(isize, u8, Vec<u8>) {\\n\\n let mut best = (-0xffff, 0x00, vec![]);\\n\\n for b in 1..=255u8 {\\n\\n let decrypted = xor_arrays(data, &[b]);\\n\\n let score = english_frequency_score(&decrypted);\\n\\n if score > best.0 {\\n\\n best = (score, b, decrypted);\\n\\n }\\n\\n }\\n\\n best\\n\\n}\\n\",\n \"file_path\": \"src/lib.rs\",\n \"rank\": 7,\n \"score\": 109465.82969825211\n },\n {\n \"content\": \"pub fn random_key<T: Into<usize>>(length: T) -> Vec<u8> {\\n\\n let length = length.into() as usize;\\n\\n let mut output: Vec<u8> = Vec::with_capacity(length);\\n\\n\\n\\n let mut rng = rand::thread_rng();\\n\\n for i in 0..length {\\n\\n output.push(rng.gen());\\n\\n }\\n\\n output\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/lib.rs\",\n \"rank\": 10,\n \"score\": 108089.07142058073\n },\n {\n \"content\": \"// Returns a 128-bit MD4 hash as an array of four 32-bit words.\\n\\n// Based on RFC 1186 from https://www.ietf.org/rfc/rfc1186.txt\\n\\npub fn md4<T: Into<Vec<u8>>>(\\n\\n input: T,\\n\\n existing_len: u64,\\n\\n inner_state: Option<&[u32; 4]>,\\n\\n) -> [u32; 4] {\\n\\n let mut bytes = input.into().to_vec();\\n\\n let orig_bytes_len = bytes.len();\\n\\n let initial_bit_len = ((existing_len << 3) + (bytes.len() << 3) as u64) as u64;\\n\\n\\n\\n // Step 1. Append padding bits\\n\\n // Append one '1' bit, then append 0 ≤ k < 512 bits '0', such that the resulting message\\n\\n // length in bis is congruent to 448 (mod 512).\\n\\n // Since our message is in bytes, we use one byte with a set high-order bit (0x80) plus\\n\\n // a variable number of zero bytes.\\n\\n\\n\\n // Append zeros\\n\\n // Number of padding bytes needed is 448 bits (56 bytes) modulo 512 bits (64 bytes)\\n\\n bytes.push(0x80_u8);\\n\\n while (bytes.len() % 64) != 56 {\\n\\n bytes.push(0_u8);\\n\",\n \"file_path\": \"src/md4.rs\",\n \"rank\": 11,\n \"score\": 105156.87630591044\n },\n {\n \"content\": \"pub fn bytes_to_hex(data: &[u8]) -> String {\\n\\n data.to_vec()\\n\\n .iter()\\n\\n .map(|b| format!(\\\"{:02x}\\\", b))\\n\\n .collect::<Vec<_>>()\\n\\n .join(\\\"\\\")\\n\\n}\\n\",\n \"file_path\": \"src/lib.rs\",\n \"rank\": 12,\n \"score\": 104821.4368771918\n },\n {\n \"content\": \"pub fn bytes_to_base64(data: &[u8]) -> String {\\n\\n use std::cmp::min;\\n\\n\\n\\n let uppers = (b'A'..=b'Z').collect::<Vec<u8>>();\\n\\n let lowers = (b'a'..=b'z').collect::<Vec<u8>>();\\n\\n let numbers = (b'0'..=b'9').collect::<Vec<u8>>();\\n\\n let extras = vec![b'+', b'/'];\\n\\n let lookup = vec![uppers, lowers, numbers, extras].concat();\\n\\n\\n\\n let mut current_byte = 0;\\n\\n let mut bit_offset = 0;\\n\\n\\n\\n let mut output = String::new();\\n\\n loop {\\n\\n let take_bits = min(6, 8 - bit_offset);\\n\\n let mut taken_bits = bits_from_byte(data[current_byte], bit_offset, take_bits);\\n\\n\\n\\n // if we are on byte border\\n\\n if take_bits < 6 {\\n\\n let take_from_next = 6 - take_bits;\\n\",\n \"file_path\": \"src/lib.rs\",\n \"rank\": 13,\n \"score\": 104821.4368771918\n },\n {\n \"content\": \"pub fn english_frequency_score(data: &[u8]) -> isize {\\n\\n let reference = \\\"etaoinsETAOINS \\\";\\n\\n\\n\\n let mut score = 0;\\n\\n data.to_vec().windows(3).for_each(|triplet| {\\n\\n let a = triplet[0] as char;\\n\\n let b = triplet[1] as char;\\n\\n let c = triplet[2] as char;\\n\\n\\n\\n if a == b {\\n\\n score -= 1;\\n\\n }\\n\\n if (a == b) && (b == c) {\\n\\n score -= 2;\\n\\n }\\n\\n if a != b && b != c && b == ' ' {\\n\\n score += 2;\\n\\n }\\n\\n\\n\\n if (a == '.' || a == ',') && b == ' ' {\\n\",\n \"file_path\": \"src/lib.rs\",\n \"rank\": 14,\n \"score\": 102170.95737434115\n },\n {\n \"content\": \"pub fn hex_to_bytes(data: &str) -> Vec<u8> {\\n\\n let numbers = (b'0'..=b'9').collect::<Vec<u8>>();\\n\\n let lowers = (b'a'..=b'f').collect::<Vec<u8>>();\\n\\n let lookup = vec![numbers, lowers].concat();\\n\\n data.to_string()\\n\\n .to_ascii_lowercase()\\n\\n .bytes()\\n\\n .collect::<Vec<u8>>()\\n\\n .chunks(2)\\n\\n .map(|d| {\\n\\n let val_a = lookup.iter().position(|l| l == &d[0]).expect(\\\"first byte\\\");\\n\\n let val_b = lookup\\n\\n .iter()\\n\\n .position(|l| l == &d[1])\\n\\n .expect(\\\"uneven characters?\\\");\\n\\n (val_a * 16 + val_b) as u8\\n\\n })\\n\\n .collect::<Vec<u8>>()\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/lib.rs\",\n \"rank\": 15,\n \"score\": 99612.06268665097\n },\n {\n \"content\": \"pub fn base64_to_bytes(data: &str) -> Vec<u8> {\\n\\n use std::cmp::min;\\n\\n\\n\\n let uppers = (b'A'..=b'Z').collect::<Vec<u8>>();\\n\\n let lowers = (b'a'..=b'z').collect::<Vec<u8>>();\\n\\n let numbers = (b'0'..=b'9').collect::<Vec<u8>>();\\n\\n let extras = vec![b'+', b'/'];\\n\\n let lookup = vec![uppers, lowers, numbers, extras].concat();\\n\\n\\n\\n let mut output = vec![];\\n\\n\\n\\n let mut filled_bits = 0;\\n\\n let mut carry = 0;\\n\\n for x in data.bytes() {\\n\\n let bits = lookup.iter().position(|l| l == &x);\\n\\n // skip newlines and such\\n\\n let bits = match bits {\\n\\n Some(b) => b,\\n\\n None => continue,\\n\\n } as u8;\\n\",\n \"file_path\": \"src/lib.rs\",\n \"rank\": 16,\n \"score\": 99612.06268665097\n },\n {\n \"content\": \"fn convert_byte_vec_to_u32(mut bytes: Vec<u8>) -> Vec<u32> {\\n\\n bytes.shrink_to_fit();\\n\\n let num_bytes = bytes.len();\\n\\n let num_words = num_bytes / 4;\\n\\n unsafe {\\n\\n let words = Vec::from_raw_parts(bytes.as_mut_ptr() as *mut u32, num_words, num_words);\\n\\n mem::forget(bytes);\\n\\n words\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/md4.rs\",\n \"rank\": 17,\n \"score\": 92762.45792490905\n },\n {\n \"content\": \"#[inline(always)]\\n\\nfn as_block(input: &[u8]) -> &[u8; 64] {\\n\\n unsafe {\\n\\n assert!(input.len() == 64);\\n\\n let arr: &[u8; 64] = mem::transmute(input.as_ptr());\\n\\n arr\\n\\n }\\n\\n}\\n\\n\\n\\nimpl Default for Sha1 {\\n\\n fn default() -> Sha1 {\\n\\n Sha1::new()\\n\\n }\\n\\n}\\n\\n\\n\\nimpl Sha1 {\\n\\n /// Creates an fresh sha1 hash object.\\n\\n ///\\n\\n /// This is equivalent to creating a hash with `Default::default`.\\n\\n pub fn new() -> Sha1 {\\n\\n Sha1 {\\n\",\n \"file_path\": \"src/sha1.rs\",\n \"rank\": 18,\n \"score\": 85312.87749896166\n },\n {\n \"content\": \"fn bits_from_byte(d: u8, a: u32, b: u32) -> u8 {\\n\\n assert!(a + b <= 8);\\n\\n assert!(b <= 8);\\n\\n d.rotate_left(a) >> (8 - b)\\n\\n}\\n\",\n \"file_path\": \"src/lib.rs\",\n \"rank\": 19,\n \"score\": 77346.51720403964\n },\n {\n \"content\": \"#[test]\\n\\npub fn base64_to_bytes_works() {\\n\\n let result = base64_to_bytes(\\\"QQABAgNC//8=\\\");\\n\\n let reference = [b'A', 0x00, 0x01, 0x02, 0x03, b'B', 0xff, 0xff];\\n\\n assert_eq!(result, reference);\\n\\n\\n\\n let result = base64_to_bytes(\\\"sAAFlG0CAncq3weaDw==\\\");\\n\\n let reference = [\\n\\n 0xb0, 0x00, 0x05, 0x94, 0x6d, 0x02, 0x02, 0x77, 0x2a, 0xdf, 0x07, 0x9a, 0x0f,\\n\\n ];\\n\\n assert_eq!(result, reference);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/lib.rs\",\n \"rank\": 20,\n \"score\": 76780.05968468015\n },\n {\n \"content\": \"#[test]\\n\\npub fn bytes_to_hex_works() {\\n\\n assert_eq!(bytes_to_hex(&[0x00, 0x01, 0x02, 0x03, 0xff]), \\\"00010203ff\\\");\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/lib.rs\",\n \"rank\": 21,\n \"score\": 76780.05968468015\n },\n {\n \"content\": \"pub fn load_stdin() -> String {\\n\\n let mut buffer = String::new();\\n\\n eprintln!(\\\"reading input from stdin...\\\");\\n\\n io::stdin().lock().read_to_string(&mut buffer).unwrap();\\n\\n buffer\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/lib.rs\",\n \"rank\": 22,\n \"score\": 74445.8590384547\n },\n {\n \"content\": \"pub fn get_timestamp() -> std::time::Duration {\\n\\n SystemTime::now()\\n\\n .duration_since(UNIX_EPOCH)\\n\\n .expect(\\\"timetamp is broken\\\")\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/lib.rs\",\n \"rank\": 23,\n \"score\": 66682.95430746948\n },\n {\n \"content\": \"#[test]\\n\\nfn test_mt19937() {\\n\\n use std::collections::HashMap;\\n\\n // matches output from:\\n\\n // http://burtleburtle.net/bob/c/readable.c\\n\\n let verification_data: HashMap<usize, u32> = [\\n\\n (0, 3331822403),\\n\\n (1, 157471482),\\n\\n (2, 2805605540),\\n\\n (3, 3776487808),\\n\\n (4, 3041352379),\\n\\n (5, 1684094076),\\n\\n (6, 1865610459),\\n\\n (7, 4068209049),\\n\\n (8, 1179506908),\\n\\n (9, 2512518870),\\n\\n (10, 3068092408),\\n\\n (100, 1155969921),\\n\\n (1000, 885714877),\\n\\n (9000, 270018718),\\n\\n (10000, 725707472),\\n\",\n \"file_path\": \"src/mt19937.rs\",\n \"rank\": 24,\n \"score\": 62551.2771435818\n },\n {\n \"content\": \"pub trait SimdExt {\\n\\n fn simd_eq(self, rhs: Self) -> Self;\\n\\n}\\n\\n\\n\\nimpl SimdExt for fake::u32x4 {\\n\\n fn simd_eq(self, rhs: Self) -> Self {\\n\\n if self == rhs {\\n\\n fake::u32x4(0xffffffff, 0xffffffff, 0xffffffff, 0xffffffff)\\n\\n } else {\\n\\n fake::u32x4(0, 0, 0, 0)\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\nmod fake {\\n\\n use core::ops::{Add, BitAnd, BitOr, BitXor, Shl, Shr, Sub};\\n\\n\\n\\n #[derive(Clone, Copy, PartialEq, Eq)]\\n\\n #[allow(non_camel_case_types)]\\n\\n pub struct u32x4(pub u32, pub u32, pub u32, pub u32);\\n\",\n \"file_path\": \"src/sha1.rs\",\n \"rank\": 25,\n \"score\": 45255.656363250324\n },\n {\n \"content\": \"#[test]\\n\\nfn hexbytes_works() {\\n\\n let test = vec![0x00, 0x01, 0x02, 0xff];\\n\\n let test2 = bytes_to_hexbytes(&test);\\n\\n let test3 = hexbytes_to_bytes(&test2);\\n\\n assert_eq!(test, test3);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/lib.rs\",\n \"rank\": 26,\n \"score\": 36001.20198956437\n },\n {\n \"content\": \"#[test]\\n\\nfn hex_to_bytes_works() {\\n\\n assert_eq!(\\n\\n hex_to_bytes(\\\"49276d206b00010203\\\".into()),\\n\\n [73, 39, 109, 32, 107, 0, 1, 2, 3]\\n\\n );\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/lib.rs\",\n \"rank\": 27,\n \"score\": 34753.4876429585\n },\n {\n \"content\": \"#[test]\\n\\nfn bytes_to_base64_works() {\\n\\n let bytes = hex_to_bytes(\\\"49276d206b696c6c696e6720796f757220627261696e206c696b65206120706f69736f6e6f7573206d757368726f6f6d\\\".into());\\n\\n assert_eq!(\\n\\n bytes_to_base64(&bytes),\\n\\n \\\"SSdtIGtpbGxpbmcgeW91ciBicmFpbiBsaWtlIGEgcG9pc29ub3VzIG11c2hyb29t\\\"\\n\\n );\\n\\n\\n\\n assert_eq!(\\n\\n bytes_to_base64(&\\\"any carnal pleasure.\\\".bytes().collect::<Vec<_>>()),\\n\\n \\\"YW55IGNhcm5hbCBwbGVhc3VyZS4=\\\"\\n\\n );\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/lib.rs\",\n \"rank\": 28,\n \"score\": 34753.4876429585\n },\n {\n \"content\": \"#[test]\\n\\nfn xor_arrays_works() {\\n\\n let first = hex_to_bytes(\\\"1c0111001f010100061a024b53535009181c\\\");\\n\\n let second = hex_to_bytes(\\\"686974207468652062756c6c277320657965\\\");\\n\\n let result = xor_arrays(&first, &second);\\n\\n let in_hex = bytes_to_hex(&result);\\n\\n assert_eq!(in_hex, \\\"746865206b696420646f6e277420706c6179\\\");\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/lib.rs\",\n \"rank\": 29,\n \"score\": 34753.4876429585\n },\n {\n \"content\": \"#[test]\\n\\nfn bits_from_byte_works() {\\n\\n assert_eq!(bits_from_byte(43, 0, 2), 0);\\n\\n assert_eq!(bits_from_byte(43, 0, 8), 43);\\n\\n assert_eq!(bits_from_byte(43, 4, 4), 11);\\n\\n assert_eq!(bits_from_byte(43, 5, 3), 3);\\n\\n assert_eq!(bits_from_byte(73, 6, 2), 1);\\n\\n assert_eq!(bits_from_byte(73, 6, 2), 1);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/lib.rs\",\n \"rank\": 30,\n \"score\": 34753.4876429585\n },\n {\n \"content\": \"#[test]\\n\\nfn search_xor_key_works() {\\n\\n let data = \\\"LAgaCA9BAQQMCU0EDxEZGBwZBAVSDwAYDEFJUAgIHAUEEwYOGRhPSE1SHwkJTQYOEwdBAwtBFRoOQQ8fGBEGCg8NARgSBksIH00VDlIMAAUDQQABSwwZDglBGwUHAx8MAAYCDgJNABJSGw4fHggDHg5BDQ8OFAZLFQQIQQ4AAgYFAwANXksUAggPAgASERgIBUEWChUNTUlDAgcABQMVBAofQ0VDQSgGSwgfTRQSFw0UAE0VDlIIDgIeCAUXGUEYGg5BExgRCQ4VElIEB0wMAgkbDhcFAwZBBgMIH0NBNRoOQQoEExIGSwgfTQMTFwoKBQMGQQYDBEweGBIGDgxMj+H1Uh8JDRlBCAFLBQUeAg4EDhMFAwZBGgQWTBkJBFIODw8EEQkXGQwJAxVBAhkODwgSElIcDh4GEk9SPwkJTRIEEQQPCE0IElIYDgAbCA8VSxUECEEKFxJBGAUAFVICEkwYDwgDHgRMCw4TUgpBHAwTFRsIFAAME0EXBQIeFBEVFw9BAQgSEhMMBEwCE0EVGQ4ZHUEOFEsMCR4SABUOEkJn\\\";\\n\\n let data = base64_to_bytes(&data);\\n\\n let best_result = search_xor_key(&data, 7);\\n\\n\\n\\n let result_readable = String::from_utf8(best_result.2.clone()).unwrap();\\n\\n\\n\\n assert_eq!(best_result.1, [b'k', b'a', b'l', b'm', b'a', b'a', b'r']);\\n\\n assert!(result_readable.starts_with(\\\"Given some encrypted data (\\\\\\\"ciphertext\\\"));\\n\\n}\\n\",\n \"file_path\": \"src/lib.rs\",\n \"rank\": 32,\n \"score\": 33626.1033810134\n },\n {\n \"content\": \"#[test]\\n\\nfn english_frequency_score_works() {\\n\\n let text = \\\"snniiiooooaaaaatttttteeeeeee \\\";\\n\\n let frequency_delta = english_frequency_score(text.to_string().as_bytes());\\n\\n assert_eq!(frequency_delta, -24);\\n\\n\\n\\n let text = \\\"Man is distinguished, not only by his reason, but by this singular passion from other animals,\\n\\nwhich is a lust of the mind, that by a perseverance of delight in the continued and indefatigable \\n\\ngeneration of knowledge, exceeds the short vehemence of any carnal pleasure.\\\";\\n\\n let frequency_delta = english_frequency_score(text.to_string().as_bytes());\\n\\n assert_eq!(frequency_delta, 166);\\n\\n\\n\\n let text = \\\"esto ia\\\";\\n\\n let frequency_delta = english_frequency_score(text.to_string().as_bytes());\\n\\n assert_eq!(frequency_delta, 7);\\n\\n\\n\\n let text = \\\"estonia hhhhrrrfffmmmlll\\\";\\n\\n let frequency_delta = english_frequency_score(text.to_string().as_bytes());\\n\\n assert_eq!(frequency_delta, -26);\\n\\n\\n\\n let text = \\\"We have students from different countries and continents gathered here to learn our language with you. At Totally English, you will make international friends and live fantastic learning adventures in the United Kingdom. Together, you will become more proficient in all areas of our language. Being fluent in English has become indispensable in the business area, so take your chance now and improve your skills with Totally English! Be more competitive in your job and see doors open left and right for you. English is the key!We have students from different countries and continents gathered here to learn our language with you. At Totally English, you will make international friends and live fantastic learning adventures in the United Kingdom. Together, you will become more proficient in all areas of our language. Being fluent in English has become indispensable in the business area, so take your chance now and improve your skills with Totally English! Be more competitive in your job and see doors open left and right for you. English is the key!\\\";\\n\\n let frequency_delta = english_frequency_score(text.to_string().as_bytes());\\n\\n assert_eq!(frequency_delta, 659);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/lib.rs\",\n \"rank\": 35,\n \"score\": 33626.1033810134\n },\n {\n \"content\": \"#[test]\\n\\nfn find_xor_key_eng_works() {\\n\\n let text = \\\"1b37373331363f78151b7f2b783431333d78397828372d363c78373e783a393b3736\\\";\\n\\n let as_bytes = hex_to_bytes(text);\\n\\n let (_score, key, output) = find_xor_key_eng(&as_bytes);\\n\\n let output = String::from_utf8(output).unwrap();\\n\\n assert_eq!(key, 88);\\n\\n assert_eq!(output, \\\"Cooking MC's like a pound of bacon\\\");\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/lib.rs\",\n \"rank\": 37,\n \"score\": 32602.442937053864\n },\n {\n \"content\": \"fn digest_to_str(digest: &[u32]) -> String {\\n\\n let mut s = String::new();\\n\\n for &word in digest {\\n\\n write!(&mut s, \\\"{:08x}\\\", word).unwrap();\\n\\n }\\n\\n s\\n\\n}\\n\",\n \"file_path\": \"src/md4.rs\",\n \"rank\": 38,\n \"score\": 30226.153675594163\n },\n {\n \"content\": \"#[inline]\\n\\nfn sha1_first(w0: u32x4) -> u32 {\\n\\n w0.0\\n\\n}\\n\\n\\n\\n/// Not an intrinsic, but adds a word to the first element of a vector.\\n\",\n \"file_path\": \"src/sha1.rs\",\n \"rank\": 39,\n \"score\": 30226.153675594163\n },\n {\n \"content\": \"/// Emulates `llvm.x86.sha1msg2` intrinsic.\\n\\nfn sha1msg2(a: u32x4, b: u32x4) -> u32x4 {\\n\\n let u32x4(x0, x1, x2, x3) = a;\\n\\n let u32x4(_, w13, w14, w15) = b;\\n\\n\\n\\n let w16 = (x0 ^ w13).rotate_left(1);\\n\\n let w17 = (x1 ^ w14).rotate_left(1);\\n\\n let w18 = (x2 ^ w15).rotate_left(1);\\n\\n let w19 = (x3 ^ w16).rotate_left(1);\\n\\n\\n\\n u32x4(w16, w17, w18, w19)\\n\\n}\\n\\n\\n\\n/// Emulates `llvm.x86.sha1nexte` intrinsic.\\n\",\n \"file_path\": \"src/sha1.rs\",\n \"rank\": 40,\n \"score\": 30150.959999119677\n },\n {\n \"content\": \"/// Emulates `llvm.x86.sha1msg1` intrinsic.\\n\\nfn sha1msg1(a: u32x4, b: u32x4) -> u32x4 {\\n\\n let u32x4(_, _, w2, w3) = a;\\n\\n let u32x4(w4, w5, _, _) = b;\\n\\n a ^ u32x4(w2, w3, w4, w5)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/sha1.rs\",\n \"rank\": 41,\n \"score\": 30150.959999119677\n },\n {\n \"content\": \"// f(X,Y,Z) = XY v not(X)Z\\n\\nfn f(x: u32, y: u32, z: u32) -> u32 {\\n\\n (x & y) | (!x & z)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/md4.rs\",\n \"rank\": 42,\n \"score\": 29291.302356088836\n },\n {\n \"content\": \"// h(X,Y,Z) = X xor Y xor Z\\n\\nfn h(x: u32, y: u32, z: u32) -> u32 {\\n\\n x ^ y ^ z\\n\\n}\\n\\n\\n\\n// Round 1 macro\\n\\n// Let [A B C D i s] denote the operation\\n\\n// A = (A + f(B,C,D) + X[i]) <<< s\\n\\nmacro_rules! md4round1 {\\n\\n ( $a:expr, $b:expr, $c:expr, $d:expr, $i:expr, $s:expr, $x:expr) => {{\\n\\n // Rust defaults to non-overflowing arithmetic, so we need to specify wrapping add.\\n\\n $a = ($a.wrapping_add(f($b, $c, $d)).wrapping_add($x[$i])).rotate_left($s);\\n\\n }};\\n\\n}\\n\\n\\n\\n// Round 2 macro\\n\\n// Let [A B C D i s] denote the operation\\n\\n// A = (A + g(B,C,D) + X[i] + 5A827999) <<< s .\\n\\nmacro_rules! md4round2 {\\n\\n ( $a:expr, $b:expr, $c:expr, $d:expr, $i:expr, $s:expr, $x:expr) => {{\\n\\n $a = ($a\\n\",\n \"file_path\": \"src/md4.rs\",\n \"rank\": 43,\n \"score\": 29291.302356088836\n },\n {\n \"content\": \"// g(X,Y,Z) = XY v XZ v YZ\\n\\nfn g(x: u32, y: u32, z: u32) -> u32 {\\n\\n (x & y) | (x & z) | (y & z)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/md4.rs\",\n \"rank\": 44,\n \"score\": 29291.302356088836\n },\n {\n \"content\": \"/// Not an intrinsic, but helps emulate `llvm.x86.sha1rnds4` intrinsic.\\n\\nfn sha1rnds4p(abcd: u32x4, msg: u32x4) -> u32x4 {\\n\\n let u32x4(mut a, mut b, mut c, mut d) = abcd;\\n\\n let u32x4(t, u, v, w) = msg;\\n\\n let mut e = 0u32;\\n\\n\\n\\n macro_rules! bool3ary_150 {\\n\\n ($a:expr, $b:expr, $c:expr) => {\\n\\n ($a ^ $b ^ $c)\\n\\n };\\n\\n } // Parity, XOR, MD5H, SHA1P\\n\\n\\n\\n e = e\\n\\n .wrapping_add(a.rotate_left(5))\\n\\n .wrapping_add(bool3ary_150!(b, c, d))\\n\\n .wrapping_add(t);\\n\\n b = b.rotate_left(30);\\n\\n\\n\\n d = d\\n\\n .wrapping_add(e.rotate_left(5))\\n\\n .wrapping_add(bool3ary_150!(a, b, c))\\n\",\n \"file_path\": \"src/sha1.rs\",\n \"rank\": 45,\n \"score\": 28193.677961599264\n },\n {\n \"content\": \"/// Not an intrinsic, but helps emulate `llvm.x86.sha1rnds4` intrinsic.\\n\\nfn sha1rnds4m(abcd: u32x4, msg: u32x4) -> u32x4 {\\n\\n let u32x4(mut a, mut b, mut c, mut d) = abcd;\\n\\n let u32x4(t, u, v, w) = msg;\\n\\n let mut e = 0u32;\\n\\n\\n\\n macro_rules! bool3ary_232 {\\n\\n ($a:expr, $b:expr, $c:expr) => {\\n\\n ($a & $b) ^ ($a & $c) ^ ($b & $c)\\n\\n };\\n\\n } // Majority, SHA1M\\n\\n\\n\\n e = e\\n\\n .wrapping_add(a.rotate_left(5))\\n\\n .wrapping_add(bool3ary_232!(b, c, d))\\n\\n .wrapping_add(t);\\n\\n b = b.rotate_left(30);\\n\\n\\n\\n d = d\\n\\n .wrapping_add(e.rotate_left(5))\\n\\n .wrapping_add(bool3ary_232!(a, b, c))\\n\",\n \"file_path\": \"src/sha1.rs\",\n \"rank\": 46,\n \"score\": 28193.677961599264\n },\n {\n \"content\": \"/// Not an intrinsic, but helps emulate `llvm.x86.sha1rnds4` intrinsic.\\n\\nfn sha1rnds4c(abcd: u32x4, msg: u32x4) -> u32x4 {\\n\\n let u32x4(mut a, mut b, mut c, mut d) = abcd;\\n\\n let u32x4(t, u, v, w) = msg;\\n\\n let mut e = 0u32;\\n\\n\\n\\n macro_rules! bool3ary_202 {\\n\\n ($a:expr, $b:expr, $c:expr) => {\\n\\n ($c ^ ($a & ($b ^ $c)))\\n\\n };\\n\\n } // Choose, MD5F, SHA1C\\n\\n\\n\\n e = e\\n\\n .wrapping_add(a.rotate_left(5))\\n\\n .wrapping_add(bool3ary_202!(b, c, d))\\n\\n .wrapping_add(t);\\n\\n b = b.rotate_left(30);\\n\\n\\n\\n d = d\\n\\n .wrapping_add(e.rotate_left(5))\\n\\n .wrapping_add(bool3ary_202!(a, b, c))\\n\",\n \"file_path\": \"src/sha1.rs\",\n \"rank\": 47,\n \"score\": 28193.677961599264\n },\n {\n \"content\": \"#[inline]\\n\\nfn sha1_first_add(e: u32, w0: u32x4) -> u32x4 {\\n\\n let u32x4(a, b, c, d) = w0;\\n\\n u32x4(e.wrapping_add(a), b, c, d)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/sha1.rs\",\n \"rank\": 48,\n \"score\": 27338.71623374519\n },\n {\n \"content\": \"#[inline]\\n\\nfn sha1_first_half(abcd: u32x4, msg: u32x4) -> u32x4 {\\n\\n sha1_first_add(sha1_first(abcd).rotate_left(30), msg)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/sha1.rs\",\n \"rank\": 49,\n \"score\": 26552.875292355464\n },\n {\n \"content\": \"/// Emulates `llvm.x86.sha1rnds4` intrinsic.\\n\\n/// Performs 4 rounds of the message block digest.\\n\\nfn sha1_digest_round_x4(abcd: u32x4, work: u32x4, i: i8) -> u32x4 {\\n\\n const K0V: u32x4 = u32x4(K0, K0, K0, K0);\\n\\n const K1V: u32x4 = u32x4(K1, K1, K1, K1);\\n\\n const K2V: u32x4 = u32x4(K2, K2, K2, K2);\\n\\n const K3V: u32x4 = u32x4(K3, K3, K3, K3);\\n\\n\\n\\n match i {\\n\\n 0 => sha1rnds4c(abcd, work + K0V),\\n\\n 1 => sha1rnds4p(abcd, work + K1V),\\n\\n 2 => sha1rnds4m(abcd, work + K2V),\\n\\n 3 => sha1rnds4p(abcd, work + K3V),\\n\\n _ => panic!(\\\"unknown icosaround index\\\"),\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/sha1.rs\",\n \"rank\": 50,\n \"score\": 24297.876979791086\n },\n {\n \"content\": \"//extern crate cryptopals;\\n\\nuse std::num::Wrapping;\\n\\n\\n\\nconst N: u32 = 624;\\n\\nconst F: Wrapping<u32> = Wrapping(1812433253);\\n\\n\\n\\npub struct Mt19937 {\\n\\n state: [Wrapping<u32>; N as usize],\\n\\n index: u32,\\n\\n}\\n\\nimpl Mt19937 {\\n\\n pub fn from_seed(seed: u32) -> Mt19937 {\\n\\n let mut state = [Wrapping(0); N as usize];\\n\\n state[0] = Wrapping(seed);\\n\\n for i in 1..N as usize {\\n\\n state[i] = F * (state[i - 1] ^ (state[i - 1] >> 30)) + Wrapping(i as u32);\\n\\n }\\n\\n Mt19937 {\\n\\n state,\\n\\n index: N as u32,\\n\",\n \"file_path\": \"src/mt19937.rs\",\n \"rank\": 54,\n \"score\": 11.459322334549121\n },\n {\n \"content\": \" (bits >> 56) as u8,\\n\\n (bits >> 48) as u8,\\n\\n (bits >> 40) as u8,\\n\\n (bits >> 32) as u8,\\n\\n (bits >> 24) as u8,\\n\\n (bits >> 16) as u8,\\n\\n (bits >> 8) as u8,\\n\\n (bits >> 0) as u8,\\n\\n ];\\n\\n let mut last = [0; 128];\\n\\n let blocklen = self.blocks.len as usize;\\n\\n last[..blocklen].clone_from_slice(&self.blocks.block[..blocklen]);\\n\\n last[blocklen] = 0x80;\\n\\n\\n\\n if blocklen < 56 {\\n\\n last[56..64].clone_from_slice(&extra);\\n\\n let out = last[0..64].to_vec();\\n\\n //println!(\\\"INNER digest used as last block: {:?}\\\", out);\\n\\n state.process(as_block(&last[0..64]));\\n\\n } else {\\n\",\n \"file_path\": \"src/sha1.rs\",\n \"rank\": 55,\n \"score\": 10.639133830643427\n },\n {\n \"content\": \" (self.data.state[4] >> 0) as u8,\\n\\n ]\\n\\n }\\n\\n}\\n\\n\\n\\nimpl Blocks {\\n\\n fn input<F>(&mut self, mut input: &[u8], mut f: F)\\n\\n where\\n\\n F: FnMut(&[u8; 64]),\\n\\n {\\n\\n if self.len > 0 {\\n\\n let len = self.len as usize;\\n\\n let amt = cmp::min(input.len(), self.block.len() - len);\\n\\n self.block[len..len + amt].clone_from_slice(&input[..amt]);\\n\\n if len + amt == self.block.len() {\\n\\n f(&self.block);\\n\\n self.len = 0;\\n\\n input = &input[amt..];\\n\\n } else {\\n\\n self.len += amt as u32;\\n\",\n \"file_path\": \"src/sha1.rs\",\n \"rank\": 56,\n \"score\": 10.44819216228327\n },\n {\n \"content\": \" }\\n\\n }\\n\\n\\n\\n pub fn from_state(state: [Wrapping<u32>; N as usize], index: u32) -> Mt19937 {\\n\\n Mt19937 { state, index }\\n\\n }\\n\\n\\n\\n pub fn extract_number(&mut self) -> u32 {\\n\\n if self.index >= N {\\n\\n self.twist();\\n\\n }\\n\\n let mut y: u32 = self.state[self.index as usize].0;\\n\\n y = self.temper(y);\\n\\n self.index += 1;\\n\\n y\\n\\n }\\n\\n\\n\\n fn temper(&self, num: u32) -> u32 {\\n\\n let mut num = num ^ num >> 11;\\n\\n num ^= num << 7 & 0x9D2C_5680;\\n\",\n \"file_path\": \"src/mt19937.rs\",\n \"rank\": 57,\n \"score\": 10.388521795989655\n },\n {\n \"content\": \" num ^= num >> 22;\\n\\n\\n\\n num\\n\\n }\\n\\n\\n\\n fn twist(&mut self) {\\n\\n let upper_mask: Wrapping<u32> = Wrapping(0x8000_0000);\\n\\n let lower_mask: Wrapping<u32> = Wrapping(0x7fff_ffff);\\n\\n for i in 0..N as usize {\\n\\n let x = (self.state[i] & upper_mask) + (self.state[(i + 1) % N as usize] & lower_mask);\\n\\n let mut x_a: Wrapping<u32> = x >> 1;\\n\\n if x % Wrapping(2) != Wrapping(0) {\\n\\n x_a ^= Wrapping(0x9908_B0DF);\\n\\n }\\n\\n self.state[i] = self.state[(i + 397) % N as usize] ^ x_a;\\n\\n }\\n\\n self.index = 0;\\n\\n }\\n\\n}\\n\\n\\n\\n#[test]\\n\",\n \"file_path\": \"src/mt19937.rs\",\n \"rank\": 58,\n \"score\": 9.928109140688598\n },\n {\n \"content\": \"impl hash::Hash for Blocks {\\n\\n fn hash<H: hash::Hasher>(&self, state: &mut H) {\\n\\n self.len.hash(state);\\n\\n self.block.hash(state);\\n\\n }\\n\\n}\\n\\n\\n\\nimpl Clone for Blocks {\\n\\n fn clone(&self) -> Blocks {\\n\\n Blocks { ..*self }\\n\\n }\\n\\n}\\n\\n\\n\\n/// Indicates that a digest couldn't be parsed.\\n\\n#[derive(Copy, Clone, Hash, Eq, PartialEq, Ord, PartialOrd, Debug)]\\n\\npub struct DigestParseError(());\\n\\n\\n\\nimpl fmt::Display for DigestParseError {\\n\\n fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {\\n\\n write!(f, \\\"not a valid sha1 hash\\\")\\n\",\n \"file_path\": \"src/sha1.rs\",\n \"rank\": 60,\n \"score\": 8.914232258979624\n },\n {\n \"content\": \" pub fn update(&mut self, data: &[u8]) {\\n\\n let len = &mut self.len;\\n\\n let state = &mut self.state;\\n\\n self.blocks.input(data, |block| {\\n\\n *len += block.len() as u64;\\n\\n state.process(block);\\n\\n })\\n\\n }\\n\\n\\n\\n pub fn digest_now(data: &[u8]) -> Vec<u8> {\\n\\n let mut sha1 = Sha1::new();\\n\\n sha1.update(data);\\n\\n sha1.digest().bytes().to_vec()\\n\\n }\\n\\n\\n\\n /// Retrieve digest result.\\n\\n pub fn digest(&self) -> Digest {\\n\\n let mut state = self.state;\\n\\n let bits = (self.len + (self.blocks.len as u64)) * 8;\\n\\n let extra = [\\n\",\n \"file_path\": \"src/sha1.rs\",\n \"rank\": 61,\n \"score\": 8.41682833381891\n },\n {\n \"content\": \"use core::str;\\n\\n\\n\\n/// The length of a SHA1 digest in bytes\\n\\npub const DIGEST_LENGTH: usize = 20;\\n\\n\\n\\n/// Represents a Sha1 hash object in memory.\\n\\n#[derive(Clone, PartialOrd, Ord, PartialEq, Eq, Hash)]\\n\\npub struct Sha1 {\\n\\n state: Sha1State,\\n\\n blocks: Blocks,\\n\\n len: u64,\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/sha1.rs\",\n \"rank\": 62,\n \"score\": 8.416309251139474\n },\n {\n \"content\": \"\\n\\n use self::std::prelude::v1::*;\\n\\n\\n\\n use Sha1;\\n\\n\\n\\n #[test]\\n\\n fn test_simple() {\\n\\n let mut m = Sha1::new();\\n\\n\\n\\n let tests = [\\n\\n (\\\"The quick brown fox jumps over the lazy dog\\\",\\n\\n \\\"2fd4e1c67a2d28fced849ee1bb76e7391b93eb12\\\"),\\n\\n (\\\"The quick brown fox jumps over the lazy cog\\\",\\n\\n \\\"de9f2c7fd25e1b3afad3e85a0bd17d9b100db4b3\\\"),\\n\\n (\\\"\\\", \\\"da39a3ee5e6b4b0d3255bfef95601890afd80709\\\"),\\n\\n (\\\"testing\\\\n\\\", \\\"9801739daae44ec5293d4e1f53d3f4d2d426d91c\\\"),\\n\\n (\\\"xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx\\\",\\n\\n \\\"025ecbd5d70f8fb3c5457cd96bab13fda305dc59\\\"),\\n\\n (\\\"xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx\\\",\\n\\n \\\"4300320394f7ee239bcdce7d3b8bcee173a0cd5c\\\"),\\n\",\n \"file_path\": \"src/sha1.rs\",\n \"rank\": 63,\n \"score\": 7.945956169179095\n },\n {\n \"content\": \"extern crate openssl;\\n\\n\\n\\nuse crate::sha1::Sha1;\\n\\nuse num_bigint::{BigInt, BigUint, RandBigInt, ToBigInt, ToBigUint};\\n\\n\\n\\npub struct DSA {\\n\\n pub p: BigInt,\\n\\n pub q: BigInt,\\n\\n pub g: BigInt,\\n\\n pub pubkey: BigInt,\\n\\n pub privkey: BigInt,\\n\\n}\\n\\n\\n\\nconst DEFAULT_P: &[u8] = b\\\"800000000000000089e1855218a0e7dac38136ffafa72eda7\\\\\\n\\n 859f2171e25e65eac698c1702578b07dc2a1076da241c76c6\\\\\\n\\n 2d374d8389ea5aeffd3226a0530cc565f3bf6b50929139ebe\\\\\\n\\n ac04f48c3c84afb796d61e5a4f9a8fda812ab59494232c7d2\\\\\\n\\n b4deb50aa18ee9e132bfa85ac4374d7f9091abc3d015efc87\\\\\\n\\n 1a584471bb1\\\";\\n\\nconst DEFAULT_Q: &[u8] = b\\\"f4f47f05794b256174bba6e9b396a7707e563c5b\\\";\\n\",\n \"file_path\": \"src/dsa.rs\",\n \"rank\": 64,\n \"score\": 7.9058328667625695\n },\n {\n \"content\": \" }\\n\\n\\n\\n #[test]\\n\\n fn spray_and_pray() {\\n\\n use self::rand::Rng;\\n\\n\\n\\n let mut rng = rand::thread_rng();\\n\\n let mut m = Sha1::new();\\n\\n let mut bytes = [0; 512];\\n\\n\\n\\n for _ in 0..20 {\\n\\n let ty = openssl::hash::MessageDigest::sha1();\\n\\n let mut r = openssl::hash::Hasher::new(ty).unwrap();\\n\\n m.reset();\\n\\n for _ in 0..50 {\\n\\n let len = rng.gen::<usize>() % bytes.len();\\n\\n rng.fill_bytes(&mut bytes[..len]);\\n\\n m.update(&bytes[..len]);\\n\\n r.update(&bytes[..len]).unwrap();\\n\\n }\\n\",\n \"file_path\": \"src/sha1.rs\",\n \"rank\": 65,\n \"score\": 7.818020264360822\n },\n {\n \"content\": \"# cryptopals\\n\\nSolving the Cryptopals.com challenges\\n\\n\\n\\ns1c1-s1c3\\n\\n---\\n\\nimplemented in lib.rs as functions (with tests)\\n\\n\\n\\ns1c4\\n\\n---\\n\\ncargo run --bin detect_singlechar_xor < res/s1c4.txt\\n\\n\\n\\ns1c5\\n\\n---\\n\\ncargo run --bin xor_encrypt ICE < res/s1c5.txt\\n\\n\\n\\ns1c6 (find xor key)\\n\\n---\\n\\ncargo run --release --bin find_xor_key 30 < res/s1c6.txt\\n\\n\\n\\ns1c7 (decrypt aes-ecb)\\n\\n---\\n\\ncargo run --release --bin decrypt_aes_ecb \\\"YELLOW SUBMARINE\\\" < res/s1c7.txt\\n\\n\\n\\ns1c8 (detect ecb mode from lines)\\n\\n---\\n\\ncargo run --release --bin detect_ecb_mode < res/s1c8.txt\\n\\n\\n\\ns2c9 (pkcs7 padding)\\n\\n---\\n\\ncreated into block_ciphers.rs\\n\\n\\n\\ns2c10 (decrypt aes-cbc)\\n\\n---\\n\\ncargo run --bin decrypt_aes_cbc \\\"YELLOW SUBMARINE\\\" < res/s2c10.txt\\n\\n\\n\\ns2c11 (cbs vs ecb oracle)\\n\\n---\\n\\ncargo run --bin oracle_cbc_ecb\\n\\n\\n\\ns2c12 (byte-a-time ecb decrypt simple)\\n\\n---\\n\\ncargo run --release --bin break_ecb_byte_simple < res/s2c12.txt\\n\\n\\n\\ns2c13 (ecb cut and paste cookie)\\n\\n---\\n\\ncargo run --bin ecb_cut_and_paste\\n\\n\\n\\ns2c14 (byte-a-time ecb decrypt harder)\\n\\n---\\n\\ncargo run --release --bin break_ecb_byte_harder < res/s2c12.txt\\n\\n\\n\\ns2c16 (cbc bitlipping attack)\\n\\n---\\n\\ncargo run --bin cbc_bitflipping\\n\\n\\n\\ns3c17 (cbc padding oracle)\\n\\n---\\n\\n# FIXME: I do not decrypt the first block, add a virtual empty block before the first one?\\n\\ncargo run --bin cbc_padding_oracle < res/s3c17.txt\\n\\n\\n\\ns3c18 (ctr mode)\\n\\n---\\n\\ncreated into block_ciphers.rs\\n\\n\\n\\ns3c19 (ctr break substitutions - dumb)\\n\\n---\\n\\ncargo run --bin break_ctr_dumb < res/s3c19.txt\\n\\n\\n\\ns3c20 (ctr break sattistic - smart) actually same as previous\\n\\n---\\n\\ncargo run --bin break_ctr_smart < res/s3c20.txt\\n\\n\\n\\ns3c21 (mt19937)\\n\\n---\\n\\nimplemented into lib under mt19937.rs\\n\\n\\n\\ns3c22 (mt19937 epoch seed crack)\\n\\n---\\n\\ncargo run --release --bin s3c22_mt19937_wait_crack\\n\\n\\n\\ns3c23 (mt19937 clone from output)\\n\\n---\\n\\ncargo run --release --bin s3c23_clone_mt19937\\n\\n\\n\\ns3c24 (mt19937 stream cipher + crack)\\n\\n---\\n\\n`cargo run --release --bin s3c24_mt19937_cipher`\\n\\n\\n\\ns4c25 (aes_ctr_random_rw_break)\\n\\n---\\n\\n`cargo run --release --bin s4c25_aes_ctr_random_rw_break < res/s4c25.txt`\\n\\n\\n\\ns4c26\\n\\n---\\n\\n`cargo run --release --bin s4c26_ctr_bitflipping`\\n\\n\\n\",\n \"file_path\": \"README.md\",\n \"rank\": 66,\n \"score\": 7.638759684788892\n },\n {\n \"content\": \" extern crate std;\\n\\n extern crate serde_json;\\n\\n\\n\\n use self::std::prelude::v1::*;\\n\\n\\n\\n use {Sha1, Digest};\\n\\n\\n\\n #[test]\\n\\n fn test_to_json() {\\n\\n let mut s = Sha1::new();\\n\\n s.update(b\\\"Hello World!\\\");\\n\\n let x = s.digest();\\n\\n let y = serde_json::to_vec(&x).unwrap();\\n\\n assert_eq!(y, &b\\\"\\\\\\\"2ef7bde608ce5404e97d5f042f95f89f1c232871\\\\\\\"\\\"[..]);\\n\\n }\\n\\n\\n\\n #[test]\\n\\n fn test_from_json() {\\n\\n let y: Digest = serde_json::from_str(\\\"\\\\\\\"2ef7bde608ce5404e97d5f042f95f89f1c232871\\\\\\\"\\\").unwrap();\\n\\n assert_eq!(y.to_string(), \\\"2ef7bde608ce5404e97d5f042f95f89f1c232871\\\");\\n\",\n \"file_path\": \"src/sha1.rs\",\n \"rank\": 68,\n \"score\": 7.18444494223804\n },\n {\n \"content\": \" if state == 1 && cur_byte == &0xff_u8 && next_byte == 0x00_u8 {\\n\\n // take the 64 bytes of digest\\n\\n let provided_digest: &[u8] = &padded_sig[i + 2..i + 2 + 32];\\n\\n let calced_digest: &[u8] = &Sha256::digest(&m.to_bytes_be());\\n\\n return provided_digest == calced_digest;\\n\\n }\\n\\n }\\n\\n false\\n\\n }\\n\\n\\n\\n pub fn encrypt(&self, m: &BigUint) -> BigUint {\\n\\n m.modpow(&self.e, &self.n)\\n\\n }\\n\\n\\n\\n pub fn decrypt(&self, c: &BigUint) -> BigUint {\\n\\n c.modpow(&self.d, &self.n)\\n\\n }\\n\\n\\n\\n pub fn gen_big_prime(bits: i32) -> BigUint {\\n\\n use openssl::bn::BigNum;\\n\",\n \"file_path\": \"src/rsa.rs\",\n \"rank\": 69,\n \"score\": 7.093468140826138\n },\n {\n \"content\": \" self.0 >> rhs.0,\\n\\n self.1 >> rhs.1,\\n\\n self.2 >> rhs.2,\\n\\n self.3 >> rhs.3,\\n\\n )\\n\\n }\\n\\n }\\n\\n\\n\\n #[derive(Clone, Copy)]\\n\\n #[allow(non_camel_case_types)]\\n\\n pub struct u64x2(pub u64, pub u64);\\n\\n\\n\\n impl Add for u64x2 {\\n\\n type Output = u64x2;\\n\\n\\n\\n fn add(self, rhs: u64x2) -> u64x2 {\\n\\n u64x2(self.0.wrapping_add(rhs.0), self.1.wrapping_add(rhs.1))\\n\\n }\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/sha1.rs\",\n \"rank\": 70,\n \"score\": 6.900308910071147\n },\n {\n \"content\": \"\\n\\n#[cfg(feature = \\\"serde\\\")]\\n\\nimpl serde::ser::Serialize for Digest {\\n\\n fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>\\n\\n where\\n\\n S: serde::ser::Serializer,\\n\\n {\\n\\n fn to_hex(num: u8) -> u8 {\\n\\n b\\\"0123456789abcdef\\\"[num as usize]\\n\\n }\\n\\n\\n\\n let mut hex_str = [0u8; 40];\\n\\n let mut c = 0;\\n\\n for state in self.data.state.iter() {\\n\\n for off in 0..4 {\\n\\n let byte = (state >> (8 * (3 - off))) as u8;\\n\\n hex_str[c] = to_hex(byte >> 4);\\n\\n hex_str[c + 1] = to_hex(byte & 0xf);\\n\\n c += 2;\\n\\n }\\n\",\n \"file_path\": \"src/sha1.rs\",\n \"rank\": 71,\n \"score\": 6.879778416183777\n },\n {\n \"content\": \" pub fn pad_pkcs_1_5(&self, m: &[u8]) -> Vec<u8> {\\n\\n let m_b = m.len();\\n\\n let k = self.n.to_bytes_be().len();\\n\\n let ps_len = k - 3 - m_b;\\n\\n assert!(m_b <= k - 11);\\n\\n\\n\\n let mut random_bytes = vec![];\\n\\n let mut rng = rand::thread_rng();\\n\\n\\n\\n // correct way to get unbiased random bytes\\n\\n while random_bytes.len() < ps_len {\\n\\n let b: u8 = rng.gen();\\n\\n if b == 0x00 {\\n\\n continue;\\n\\n }\\n\\n random_bytes.push(b);\\n\\n }\\n\\n\\n\\n vec![\\n\\n [0x00, 0x02].to_vec(),\\n\",\n \"file_path\": \"src/rsa.rs\",\n \"rank\": 72,\n \"score\": 6.817432936350897\n },\n {\n \"content\": \" let S = match attack {\\n\\n None => (B - (k * (g.modpow(&x, &N)))).modpow(&(dh.secret + (u * x)), &N),\\n\\n Some(_) => 0.to_biguint().unwrap(),\\n\\n };\\n\\n println!(\\\"client got S: {}\\\", S);\\n\\n\\n\\n let K: &[u8] = &Sha256::digest(&S.to_bytes_be());\\n\\n\\n\\n /*\\n\\n send our HMAC(K, salt) to server for verification\\n\\n */\\n\\n let hmac = Sha256::digest(&vec![K, &server_salt.to_bytes_be()].concat());\\n\\n stream.write_all(&bytes_to_hexbytes(&hmac)).unwrap();\\n\\n\\n\\n /*\\n\\n read final \\\"OK\\\" or \\\"FAIL\\\"\\n\\n */\\n\\n let mut buffer = [0_u8; 2048];\\n\\n let _ = stream.read(&mut buffer).unwrap();\\n\\n if buffer[0] == 'O' as u8 {\\n\\n true\\n\\n } else {\\n\\n false\\n\\n }\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/srp.rs\",\n \"rank\": 73,\n \"score\": 6.631716056249456\n },\n {\n \"content\": \"// reexport block_cipher stuff for cryptopals crate users\\n\\npub mod block_ciphers;\\n\\npub mod dh;\\n\\npub mod dsa;\\n\\npub mod md4;\\n\\npub mod mt19937;\\n\\npub mod rsa;\\n\\npub mod sha1;\\n\\npub mod srp;\\n\\npub mod weakened_srp;\\n\\n\\n\\nuse rand::Rng;\\n\\nuse std::io::{self, Read};\\n\\nuse std::time::{SystemTime, UNIX_EPOCH};\\n\\n\\n\",\n \"file_path\": \"src/lib.rs\",\n \"rank\": 74,\n \"score\": 6.590528491238993\n },\n {\n \"content\": \"use num_bigint::{BigUint, RandBigInt};\\n\\n\\n\\npub struct DiffieHellmanState {\\n\\n pub secret: BigUint,\\n\\n p: BigUint,\\n\\n g: BigUint,\\n\\n pub pubkey: BigUint,\\n\\n}\\n\\n\\n\\nimpl DiffieHellmanState {\\n\\n pub fn new(g: &BigUint, p: &BigUint) -> DiffieHellmanState {\\n\\n let secret = rand::thread_rng().gen_biguint_below(&p);\\n\\n let pubkey = DiffieHellmanState::gen_pubkey(&p, &g, &secret);\\n\\n DiffieHellmanState {\\n\\n secret,\\n\\n p: p.clone(),\\n\\n g: g.clone(),\\n\\n pubkey,\\n\\n }\\n\\n }\\n\",\n \"file_path\": \"src/dh.rs\",\n \"rank\": 75,\n \"score\": 6.5252248376520745\n },\n {\n \"content\": \" }\\n\\n\\n\\n fn handle_connection(&self, mut stream: TcpStream) {\\n\\n let dh = if !self.attack {\\n\\n DiffieHellmanState::new(&self.g, &self.N)\\n\\n } else {\\n\\n let secret = 2.to_biguint().unwrap();\\n\\n DiffieHellmanState::new_static(&self.g, &self.N, &secret)\\n\\n };\\n\\n\\n\\n /*\\n\\n read username+DH_pubkey\\n\\n */\\n\\n\\n\\n let mut buffer = [0; 1024];\\n\\n let read_bytes = stream.read(&mut buffer).unwrap();\\n\\n let data = buffer[..read_bytes].to_vec();\\n\\n let mut tokens = data.splitn(2, |x| x == &0x00_u8);\\n\\n\\n\\n let username = String::from_utf8(tokens.next().unwrap().to_vec()).unwrap();\\n\",\n \"file_path\": \"src/weakened_srp.rs\",\n \"rank\": 76,\n \"score\": 6.520560419501443\n },\n {\n \"content\": \"\\n\\npub struct WeakenedSRPClient {}\\n\\n\\n\\nimpl WeakenedSRPClient {\\n\\n pub fn auth(\\n\\n connstring: String,\\n\\n N: BigUint,\\n\\n g: BigUint,\\n\\n k: BigUint,\\n\\n username: String,\\n\\n password: String,\\n\\n ) -> bool {\\n\\n let mut stream = TcpStream::connect(connstring).unwrap();\\n\\n\\n\\n /*\\n\\n send username and DH pubkey\\n\\n */\\n\\n\\n\\n let dh = DiffieHellmanState::new(&g, &N);\\n\\n let A = dh.pubkey;\\n\",\n \"file_path\": \"src/weakened_srp.rs\",\n \"rank\": 77,\n \"score\": 6.489687607040546\n },\n {\n \"content\": \"\\n\\n UserSRP { v, salt }\\n\\n }\\n\\n}\\n\\n\\n\\npub struct SRPClient {}\\n\\n\\n\\nimpl SRPClient {\\n\\n pub fn auth(\\n\\n connstring: String,\\n\\n N: BigUint,\\n\\n g: BigUint,\\n\\n k: BigUint,\\n\\n username: String,\\n\\n password: String,\\n\\n attack: &Option<BigUint>,\\n\\n ) -> bool {\\n\\n let mut stream = TcpStream::connect(connstring).unwrap();\\n\\n\\n\\n /*\\n\",\n \"file_path\": \"src/srp.rs\",\n \"rank\": 78,\n \"score\": 6.169256388555466\n },\n {\n \"content\": \"//\\n\\n// Copied from https://rosettacode.org/wiki/MD4#Rust\\n\\n//\\n\\n// MD4, based on RFC 1186 and RFC 1320.\\n\\n//\\n\\n// https://www.ietf.org/rfc/rfc1186.txt\\n\\n// https://tools.ietf.org/html/rfc1320\\n\\n//\\n\\n\\n\\nuse std::fmt::Write;\\n\\nuse std::mem;\\n\\n\\n\\n// Let not(X) denote the bit-wise complement of X.\\n\\n// Let X v Y denote the bit-wise OR of X and Y.\\n\\n// Let X xor Y denote the bit-wise XOR of X and Y.\\n\\n// Let XY denote the bit-wise AND of X and Y.\\n\\n\\n\\n// f(X,Y,Z) = XY v not(X)Z\\n\",\n \"file_path\": \"src/md4.rs\",\n \"rank\": 79,\n \"score\": 6.13046394766792\n },\n {\n \"content\": \" }\\n\\n\\n\\n /// Shortcut to create a sha1 from some bytes.\\n\\n ///\\n\\n /// This also lets you create a hash from a utf-8 string. This is equivalent\\n\\n /// to making a new Sha1 object and calling `update` on it once.\\n\\n pub fn from<D: AsRef<[u8]>>(data: D) -> Sha1 {\\n\\n let mut rv = Sha1::new();\\n\\n rv.update(data.as_ref());\\n\\n rv\\n\\n }\\n\\n\\n\\n /// Resets the hash object to it's initial state.\\n\\n pub fn reset(&mut self) {\\n\\n self.state = DEFAULT_STATE;\\n\\n self.len = 0;\\n\\n self.blocks.len = 0;\\n\\n }\\n\\n\\n\\n /// Update hash with input data.\\n\",\n \"file_path\": \"src/sha1.rs\",\n \"rank\": 80,\n \"score\": 6.096185078747202\n },\n {\n \"content\": \" stream.write_all(&bytes_to_hexbytes(hmac)).unwrap();\\n\\n\\n\\n /*\\n\\n read final \\\"OK\\\" or \\\"FAIL\\\"\\n\\n */\\n\\n\\n\\n let mut buffer = [0_u8; 2048];\\n\\n let _ = stream.read(&mut buffer).unwrap();\\n\\n buffer[0] == 'O' as u8\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/weakened_srp.rs\",\n \"rank\": 81,\n \"score\": 6.023354056320512\n },\n {\n \"content\": \"extern crate openssl;\\n\\n\\n\\nuse rand::prelude::*;\\n\\n\\n\\nuse num_bigint::{BigInt, BigUint, RandBigInt, ToBigInt, ToBigUint};\\n\\nuse sha2::{Digest, Sha256};\\n\\n\\n\\npub struct RSA {\\n\\n pub e: BigUint,\\n\\n pub n: BigUint,\\n\\n pub d: BigUint,\\n\\n pub pubkey: (BigUint, BigUint),\\n\\n privkey: (BigUint, BigUint),\\n\\n}\\n\\n\\n\\nimpl RSA {\\n\\n pub fn new(bits: i32) -> RSA {\\n\\n let big_1 = &1.to_biguint().unwrap();\\n\\n\\n\\n let e = &3.to_biguint().unwrap();\\n\",\n \"file_path\": \"src/rsa.rs\",\n \"rank\": 82,\n \"score\": 5.987354004681382\n },\n {\n \"content\": \" (100000, 3292829284),\\n\\n ]\\n\\n .iter()\\n\\n .cloned()\\n\\n .collect();\\n\\n\\n\\n let largest_test = verification_data.keys().max().expect(\\\"need some tests\\\");\\n\\n\\n\\n let mut mt = Mt19937::from_seed(0x12345678u32);\\n\\n for i in 0..=*largest_test {\\n\\n let out_num = mt.extract_number();\\n\\n if let Some(verification_num) = verification_data.get(&i) {\\n\\n assert_eq!(out_num, *verification_num);\\n\\n }\\n\\n }\\n\\n\\n\\n // test tempering\\n\\n let tempered_1 = mt.temper(42);\\n\\n assert_eq!(42, mt.untemper(tempered_1));\\n\\n\\n\\n let tempered_2 = mt.temper(0xff112233);\\n\\n assert_eq!(0xff112233, mt.untemper(tempered_2));\\n\\n}\\n\",\n \"file_path\": \"src/mt19937.rs\",\n \"rank\": 83,\n \"score\": 5.8938094581970555\n },\n {\n \"content\": \" let v = &self.g.modpow(x, &self.N);\\n\\n\\n\\n let S = (&A * v.modpow(&BigUint::from_bytes_be(fake_u), &self.N))\\n\\n .modpow(&dh.secret, &self.N);\\n\\n let K: &[u8] = &Sha256::digest(&S.to_bytes_be());\\n\\n let guessed_hmac: &[u8] = &Sha256::digest(&vec![K, fake_salt].concat());\\n\\n if guessed_hmac == client_hmac {\\n\\n println!(\\\"\\\\n!!!!cracked password: {}\\\\n\\\", &password);\\n\\n }\\n\\n }\\n\\n }\\n\\n\\n\\n /*\\n\\n proceed with our calculations\\n\\n */\\n\\n\\n\\n let S = (&A * user_v.modpow(&u, &self.N)).modpow(&dh.secret, &self.N);\\n\\n let K: &[u8] = &Sha256::digest(&S.to_bytes_be());\\n\\n\\n\\n let server_hmac = Sha256::digest(&vec![K, &user_salt.to_bytes_be()].concat());\\n\",\n \"file_path\": \"src/weakened_srp.rs\",\n \"rank\": 84,\n \"score\": 5.696340079737459\n },\n {\n \"content\": \" last[120..128].clone_from_slice(&extra);\\n\\n state.process(as_block(&last[0..64]));\\n\\n state.process(as_block(&last[64..128]));\\n\\n }\\n\\n\\n\\n Digest { data: state }\\n\\n }\\n\\n\\n\\n /// Retrieve the digest result as hex string directly.\\n\\n ///\\n\\n /// (The function is only available if the `std` feature is enabled)\\n\\n #[cfg(feature = \\\"std\\\")]\\n\\n pub fn hexdigest(&self) -> std::string::String {\\n\\n self.digest().to_string()\\n\\n }\\n\\n}\\n\\n\\n\\nimpl Digest {\\n\\n /// Returns the 160 bit (20 byte) digest as a byte array.\\n\\n pub fn bytes(&self) -> [u8; DIGEST_LENGTH] {\\n\",\n \"file_path\": \"src/sha1.rs\",\n \"rank\": 85,\n \"score\": 5.369869696698622\n },\n {\n \"content\": \" assert_eq!(r.finish().unwrap().as_ref(), &m.digest().bytes());\\n\\n }\\n\\n }\\n\\n\\n\\n #[test]\\n\\n #[cfg(feature=\\\"std\\\")]\\n\\n fn test_parse() {\\n\\n use Digest;\\n\\n use std::error::Error;\\n\\n let y: Digest = \\\"2ef7bde608ce5404e97d5f042f95f89f1c232871\\\".parse().unwrap();\\n\\n assert_eq!(y.to_string(), \\\"2ef7bde608ce5404e97d5f042f95f89f1c232871\\\");\\n\\n assert!(\\\"asdfasdf\\\".parse::<Digest>().is_err());\\n\\n assert_eq!(\\\"asdfasdf\\\".parse::<Digest>()\\n\\n .map_err(|x| x.description().to_string()).unwrap_err(), \\\"not a valid sha1 hash\\\");\\n\\n }\\n\\n}\\n\\n\\n\\n#[cfg_attr(rustfmt, rustfmt_skip)]\\n\\n#[cfg(all(test, feature=\\\"serde\\\"))]\\n\\nmod serde_tests {\\n\",\n \"file_path\": \"src/sha1.rs\",\n \"rank\": 86,\n \"score\": 5.0965902894631165\n },\n {\n \"content\": \" let mut buffer = [0; 1024];\\n\\n let read_bytes = stream.read(&mut buffer).unwrap();\\n\\n let payload = &buffer[..read_bytes];\\n\\n\\n\\n if hexbytes_to_bytes(payload) == etalon.as_slice() {\\n\\n stream.write_all(b\\\"OK\\\").unwrap();\\n\\n } else {\\n\\n stream.write_all(b\\\"FAIL\\\").unwrap();\\n\\n }\\n\\n }\\n\\n\\n\\n fn calc_user_srp(g: &BigUint, N: &BigUint, password: &str) -> UserSRP {\\n\\n let salt = rand::thread_rng().gen_biguint_below(N);\\n\\n\\n\\n let mut hasher = Sha256::new();\\n\\n hasher.update(salt.to_bytes_be());\\n\\n hasher.update(password);\\n\\n\\n\\n let x = BigUint::from_bytes_be(&hasher.finalize());\\n\\n let v = g.modpow(&x, N);\\n\",\n \"file_path\": \"src/srp.rs\",\n \"rank\": 87,\n \"score\": 4.992266786172178\n },\n {\n \"content\": \"\\n\\n pub fn new_static(g: &BigUint, p: &BigUint, secret: &BigUint) -> DiffieHellmanState {\\n\\n let pubkey = DiffieHellmanState::gen_pubkey(&p, &g, &secret);\\n\\n DiffieHellmanState {\\n\\n secret: secret.clone(),\\n\\n p: p.clone(),\\n\\n g: g.clone(),\\n\\n pubkey,\\n\\n }\\n\\n }\\n\\n\\n\\n pub fn gen_shared_key(self, other_pubkey: &BigUint) -> BigUint {\\n\\n other_pubkey.modpow(&self.secret, &self.p)\\n\\n }\\n\\n\\n\\n fn gen_pubkey(p: &BigUint, g: &BigUint, secret: &BigUint) -> BigUint {\\n\\n g.modpow(secret, p)\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/dh.rs\",\n \"rank\": 88,\n \"score\": 4.908216851396576\n },\n {\n \"content\": \" stream\\n\\n .write_all(\\n\\n &vec![\\n\\n username.as_bytes(),\\n\\n &[0x00],\\n\\n &bytes_to_hexbytes(&A.to_bytes_be()),\\n\\n ]\\n\\n .concat(),\\n\\n )\\n\\n .unwrap();\\n\\n\\n\\n /*\\n\\n read salt+B from server\\n\\n */\\n\\n\\n\\n let mut buffer = [0; 2048];\\n\\n let read_bytes = stream.read(&mut buffer).unwrap();\\n\\n let data = buffer[..read_bytes].to_vec();\\n\\n let mut tokens = data.splitn(3, |x| x == &0x00_u8);\\n\\n\\n\",\n \"file_path\": \"src/weakened_srp.rs\",\n \"rank\": 89,\n \"score\": 4.788144711476588\n },\n {\n \"content\": \" let mut b = b.clone();\\n\\n\\n\\n while a != 0.to_bigint().unwrap() {\\n\\n let (q, _a) = (&b / &a, &b % &a);\\n\\n b = a;\\n\\n a = _a;\\n\\n let (_y0, _y1) = (&y1, &y0 - (&q * &y1));\\n\\n y0 = _y0.clone();\\n\\n y1 = _y1;\\n\\n let (_x0, _x1) = (&x1, &x0 - (&q * &x1));\\n\\n x0 = _x0.clone();\\n\\n x1 = _x1;\\n\\n }\\n\\n (b, x0, y0)\\n\\n }\\n\\n\\n\\n fn egcd(a: &BigInt, b: &BigInt) -> (BigInt, BigInt, BigInt) {\\n\\n if a == &0.to_bigint().unwrap() {\\n\\n return (b.clone(), 0.to_bigint().unwrap(), 1.to_bigint().unwrap());\\n\\n }\\n\",\n \"file_path\": \"src/rsa.rs\",\n \"rank\": 90,\n \"score\": 4.769502938484949\n },\n {\n \"content\": \" let mut users_srp: HashMap<String, UserSRP> = HashMap::new();\\n\\n for (username, password) in users.iter() {\\n\\n let srp_params = SRPServer::calc_user_srp(&g, &N, password);\\n\\n users_srp.insert(username.to_string(), srp_params);\\n\\n }\\n\\n let server = SRPServer { N, g, k, users_srp };\\n\\n thread::spawn(move || {\\n\\n let listener = TcpListener::bind(connstring).unwrap();\\n\\n for stream in listener.incoming() {\\n\\n server.handle_connection(stream.unwrap());\\n\\n }\\n\\n });\\n\\n }\\n\\n\\n\\n fn handle_connection(&self, mut stream: TcpStream) {\\n\\n let dh = DiffieHellmanState::new(&self.g, &self.N);\\n\\n /*\\n\\n read username+DH_pubkey\\n\\n */\\n\\n let mut buffer = [0; 1024];\\n\",\n \"file_path\": \"src/srp.rs\",\n \"rank\": 91,\n \"score\": 4.715405743019177\n },\n {\n \"content\": \" let mut big = BigNum::new().unwrap();\\n\\n\\n\\n big.generate_prime(bits, true, None, None).unwrap();\\n\\n let prime_bytes = big.to_vec();\\n\\n BigUint::from_bytes_be(&prime_bytes)\\n\\n }\\n\\n\\n\\n /*\\n\\n unusded\\n\\n alternative to egcd\\n\\n */\\n\\n fn _xgcd(a: &BigInt, b: &BigInt) -> (BigInt, BigInt, BigInt) {\\n\\n let (mut x0, mut x1, mut y0, mut y1) = (\\n\\n 0.to_bigint().unwrap(),\\n\\n 1.to_bigint().unwrap(),\\n\\n 1.to_bigint().unwrap(),\\n\\n 0.to_bigint().unwrap(),\\n\\n );\\n\\n\\n\\n let mut a = a.clone();\\n\",\n \"file_path\": \"src/rsa.rs\",\n \"rank\": 92,\n \"score\": 4.692957560191009\n },\n {\n \"content\": \" random_bytes,\\n\\n [0x00].to_vec(),\\n\\n m.to_vec(),\\n\\n ]\\n\\n .concat()\\n\\n }\\n\\n\\n\\n /*\\n\\n this function is 100% fake and does just enough to do the task\\n\\n */\\n\\n pub fn verify(&self, m: &BigUint, sig: &BigUint) -> bool {\\n\\n let padded_sig = self.encrypt(sig).to_bytes_be();\\n\\n let mut state = 0;\\n\\n for (i, cur_byte) in padded_sig.iter().enumerate() {\\n\\n let next_byte = padded_sig[i + 1];\\n\\n if state == 0 {\\n\\n assert_eq!(&0x01_u8, cur_byte);\\n\\n state = 1;\\n\\n continue;\\n\\n }\\n\",\n \"file_path\": \"src/rsa.rs\",\n \"rank\": 93,\n \"score\": 4.678502489065998\n },\n {\n \"content\": \"\\n\\n let h = \\\"2fd4e1c67a2d28fced849ee1bb76e7391b93eb12\\\";\\n\\n assert_eq!(hh.len(), h.len());\\n\\n assert_eq!(hh, &*h);\\n\\n }\\n\\n\\n\\n #[test]\\n\\n fn test_sha1_loop() {\\n\\n let mut m = Sha1::new();\\n\\n let s = \\\"The quick brown fox jumps over the lazy dog.\\\";\\n\\n let n = 1000u64;\\n\\n\\n\\n for _ in 0..3 {\\n\\n m.reset();\\n\\n for _ in 0..n {\\n\\n m.update(s.as_bytes());\\n\\n }\\n\\n assert_eq!(m.digest().to_string(),\\n\\n \\\"7ca27655f67fceaa78ed2e645a81c7f1d6e249d2\\\");\\n\\n }\\n\",\n \"file_path\": \"src/sha1.rs\",\n \"rank\": 94,\n \"score\": 4.666053344037788\n },\n {\n \"content\": \" }\\n\\n}\\n\\n\\n\\n// Copyright (c) 2006-2009 Graydon Hoare\\n\\n// Copyright (c) 2009-2013 Mozilla Foundation\\n\\n\\n\\n// Permission is hereby granted, free of charge, to any\\n\\n// person obtaining a copy of this software and associated\\n\\n// documentation files (the \\\"Software\\\"), to deal in the\\n\\n// Software without restriction, including without\\n\\n// limitation the rights to use, copy, modify, merge,\\n\\n// publish, distribute, sublicense, and/or sell copies of\\n\\n// the Software, and to permit persons to whom the Software\\n\\n// is furnished to do so, subject to the following\\n\\n// conditions:\\n\\n\\n\\n// The above copyright notice and this permission notice\\n\\n// shall be included in all copies or substantial portions\\n\\n// of the Software.\\n\\n\\n\",\n \"file_path\": \"src/sha1.rs\",\n \"rank\": 95,\n \"score\": 4.565573982826924\n },\n {\n \"content\": \" .map_err(|_| DigestParseError(()))?;\\n\\n }\\n\\n Ok(rv)\\n\\n }\\n\\n}\\n\\n\\n\\nimpl fmt::Display for Digest {\\n\\n fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {\\n\\n for i in self.data.state.iter() {\\n\\n write!(f, \\\"{:08x}\\\", i)?;\\n\\n }\\n\\n Ok(())\\n\\n }\\n\\n}\\n\\n\\n\\nimpl fmt::Debug for Digest {\\n\\n fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {\\n\\n write!(f, \\\"Digest {{ \\\\\\\"{}\\\\\\\" }}\\\", self)\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/sha1.rs\",\n \"rank\": 96,\n \"score\": 4.479059206514475\n },\n {\n \"content\": \"// THE SOFTWARE IS PROVIDED \\\"AS IS\\\", WITHOUT WARRANTY OF\\n\\n// ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED\\n\\n// TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A\\n\\n// PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT\\n\\n// SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY\\n\\n// CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION\\n\\n// OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR\\n\\n// IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER\\n\\n// DEALINGS IN THE SOFTWARE.\\n\\n\\n\\npub use self::fake::*;\\n\\n\\n\",\n \"file_path\": \"src/sha1.rs\",\n \"rank\": 97,\n \"score\": 4.3288222745563525\n },\n {\n \"content\": \" }\\n\\n\\n\\n // Everything after this operates on 32-bit words, so reinterpret the buffer.\\n\\n let mut w = convert_byte_vec_to_u32(bytes.clone());\\n\\n\\n\\n // Step 2. Append length\\n\\n // A 64-bit representation of b (the length of the message before the padding bits were added)\\n\\n // is appended to the result of the previous step, low-order bytes first.\\n\\n w.push(initial_bit_len as u32); // Push low-order bytes first\\n\\n w.push((initial_bit_len >> 32) as u32);\\n\\n\\n\\n // Step 3. Initialize MD buffer\\n\\n let (mut a, mut b, mut c, mut d) = match inner_state {\\n\\n Some(is) => (is[0], is[1], is[2], is[3]),\\n\\n None => (\\n\\n 0x67452301_u32,\\n\\n 0xefcdab89_u32,\\n\\n 0x98badcfe_u32,\\n\\n 0x10325476_u32,\\n\\n ),\\n\",\n \"file_path\": \"src/md4.rs\",\n \"rank\": 98,\n \"score\": 4.205034574786506\n },\n {\n \"content\": \" [\\n\\n (self.data.state[0] >> 24) as u8,\\n\\n (self.data.state[0] >> 16) as u8,\\n\\n (self.data.state[0] >> 8) as u8,\\n\\n (self.data.state[0] >> 0) as u8,\\n\\n (self.data.state[1] >> 24) as u8,\\n\\n (self.data.state[1] >> 16) as u8,\\n\\n (self.data.state[1] >> 8) as u8,\\n\\n (self.data.state[1] >> 0) as u8,\\n\\n (self.data.state[2] >> 24) as u8,\\n\\n (self.data.state[2] >> 16) as u8,\\n\\n (self.data.state[2] >> 8) as u8,\\n\\n (self.data.state[2] >> 0) as u8,\\n\\n (self.data.state[3] >> 24) as u8,\\n\\n (self.data.state[3] >> 16) as u8,\\n\\n (self.data.state[3] >> 8) as u8,\\n\\n (self.data.state[3] >> 0) as u8,\\n\\n (self.data.state[4] >> 24) as u8,\\n\\n (self.data.state[4] >> 16) as u8,\\n\\n (self.data.state[4] >> 8) as u8,\\n\",\n \"file_path\": \"src/sha1.rs\",\n \"rank\": 99,\n \"score\": 4.200619750245788\n }\n]","isConversational":false}}},{"rowIdx":2345,"cells":{"lang":{"kind":"string","value":"Rust"},"file_path":{"kind":"string","value":"sigma-tree/src/sigma_protocol.rs"},"repo_name":{"kind":"string","value":"robkorn/sigma-rust"},"commit":{"kind":"string","value":"3aa25d62a2b6f6b071b5b89607d0688e5509a9a6"},"file_code":{"kind":"string","value":"\n\n#![allow(dead_code)]\n#![allow(unused_variables)]\n#![allow(missing_docs)]\n\npub mod dlog_group;\npub mod dlog_protocol;\npub mod prover;\npub mod verifier;\n\nuse k256::arithmetic::Scalar;\n\nuse crate::{big_integer::BigInteger, serialization::op_code::OpCode};\nuse blake2::digest::{Update, VariableOutput};\nuse blake2::VarBlake2b;\nuse dlog_group::EcPoint;\nuse dlog_protocol::{FirstDlogProverMessage, SecondDlogProverMessage};\nuse std::convert::TryInto;\n\npub struct DlogProverInput {\n \n pub w: Scalar,\n}\n\nimpl DlogProverInput {\n \n pub fn random() -> DlogProverInput {\n DlogProverInput {\n w: dlog_group::random_scalar_in_group_range(),\n }\n }\n\n \n fn public_image(&self) -> ProveDlog {\n \n let g = dlog_group::generator();\n ProveDlog::new(dlog_group::exponentiate(&g, &self.w))\n }\n}\n\npub enum PrivateInput {\n DlogProverInput(DlogProverInput),\n DiffieHellmanTupleProverInput,\n}\n\n#[derive(PartialEq, Eq, Debug, Clone)]\npub struct ProveDlog {\n \n pub h: Box<EcPoint>,\n}\n\nimpl ProveDlog {\n \n pub fn new(ecpoint: EcPoint) -> ProveDlog {\n ProveDlog {\n h: Box::new(ecpoint),\n }\n }\n}\n\n#[derive(PartialEq, Eq, Debug, Clone)]\npub struct ProveDHTuple {\n gv: Box<EcPoint>,\n hv: Box<EcPoint>,\n uv: Box<EcPoint>,\n vv: Box<EcPoint>,\n}\n\n#[derive(PartialEq, Eq, Debug, Clone)]\npub enum SigmaProofOfKnowledgeTree {\n \n ProveDHTuple(ProveDHTuple),\n \n ProveDlog(ProveDlog),\n}\n\n#[derive(PartialEq, Eq, Debug, Clone)]\npub enum SigmaBoolean {\n \n TrivialProp(bool),\n \n ProofOfKnowledge(SigmaProofOfKnowledgeTree),\n \n CAND(Vec<SigmaBoolean>),\n}\n\nimpl SigmaBoolean {\n \n pub fn op_code(&self) -> OpCode {\n match self {\n SigmaBoolean::ProofOfKnowledge(SigmaProofOfKnowledgeTree::ProveDlog(_)) => {\n OpCode::PROVE_DLOG\n }\n _ => todo!(),\n }\n }\n}\n\n#[derive(PartialEq, Eq, Debug, Clone)]\npub struct SigmaProp(SigmaBoolean);\n\nimpl SigmaProp {\n \n pub fn new(sbool: SigmaBoolean) -> Self {\n SigmaProp { 0: sbool }\n }\n\n \n pub fn value(&self) -> &SigmaBoolean {\n &self.0\n }\n}\n\npub enum ProofTree {\n \n UncheckedTree(UncheckedTree),\n \n UnprovenTree(UnprovenTree),\n}\n\nimpl ProofTree {\n pub fn with_challenge(&self, challenge: Challenge) -> ProofTree {\n todo!()\n }\n}\n\npub enum UnprovenTree {\n UnprovenSchnorr(UnprovenSchnorr),\n}\n\nimpl UnprovenTree {\n pub fn real(&self) -> bool {\n match self {\n UnprovenTree::UnprovenSchnorr(us) => !us.simulated,\n }\n }\n}\n\npub struct UnprovenSchnorr {\n proposition: ProveDlog,\n commitment_opt: Option<FirstDlogProverMessage>,\n randomness_opt: Option<BigInteger>,\n challenge_opt: Option<Challenge>,\n simulated: bool,\n}\n\n#[derive(PartialEq, Eq, Debug, Clone)]\npub struct Challenge(FiatShamirHash);\n\npub enum UncheckedSigmaTree {\n UncheckedLeaf(UncheckedLeaf),\n}\n\npub enum UncheckedLeaf {\n UncheckedSchnorr(UncheckedSchnorr),\n}\n\nimpl UncheckedLeaf {\n pub fn proposition(&self) -> SigmaBoolean {\n match self {\n UncheckedLeaf::UncheckedSchnorr(us) => SigmaBoolean::ProofOfKnowledge(\n SigmaProofOfKnowledgeTree::ProveDlog(us.proposition.clone()),\n ),\n }\n }\n}\n\npub struct UncheckedSchnorr {\n proposition: ProveDlog,\n commitment_opt: Option<FirstDlogProverMessage>,\n challenge: Challenge,\n second_message: SecondDlogProverMessage,\n}\n\nimpl UncheckedSigmaTree {\n \n \n \n \n \n}\n\npub enum UncheckedTree {\n \n NoProof,\n \n UncheckedSigmaTree(UncheckedSigmaTree),\n}\n\nfn serialize_sig(tree: UncheckedTree) -> Vec<u8> {\n match tree {\n UncheckedTree::NoProof => vec![],\n UncheckedTree::UncheckedSigmaTree(_) => todo!(),\n }\n}\n\nfn fiat_shamir_tree_to_bytes(tree: &ProofTree) -> Vec<u8> {\n \n \n \n \n \n \n todo!()\n}\n\n/** Size of the binary representation of any group element (2 ^ groupSizeBits == <number of elements in a group>) */\npub const GROUP_SIZE_BITS: usize = 256;\n/** Number of bytes to represent any group element as byte array */\npub const GROUP_SIZE: usize = GROUP_SIZE_BITS / 8;\n/** A size of challenge in Sigma protocols, in bits.\n * If this anything but 192, threshold won't work, because we have polynomials over GF(2^192) and no others.\n * So DO NOT change the value without implementing polynomials over GF(2^soundnessBits) first\n * and changing code that calls on GF2_192 and GF2_192_Poly classes!!!\n * We get the challenge by reducing hash function output to proper value.\n */\npub const SOUNDNESS_BITS: usize = 192;\npub const SOUNDNESS_BYTES: usize = SOUNDNESS_BITS / 8;\n\n#[derive(PartialEq, Eq, Debug, Clone)]\npub struct FiatShamirHash(pub Box<[u8; SOUNDNESS_BYTES]>);\n\npub fn fiat_shamir_hash_fn(input: &[u8]) -> FiatShamirHash {\n \n let mut hasher = VarBlake2b::new(SOUNDNESS_BYTES).unwrap();\n hasher.update(input);\n let hash = hasher.finalize_boxed();\n \n FiatShamirHash(hash.try_into().unwrap())\n}\n\n#[cfg(test)]\nmod tests {\n use super::*;\n use proptest::prelude::*;\n\n impl Arbitrary for ProveDlog {\n type Parameters = ();\n type Strategy = BoxedStrategy<Self>;\n\n fn arbitrary_with(_args: Self::Parameters) -> Self::Strategy {\n (any::<EcPoint>()).prop_map(ProveDlog::new).boxed()\n }\n }\n\n impl Arbitrary for SigmaBoolean {\n type Parameters = ();\n type Strategy = BoxedStrategy<Self>;\n\n fn arbitrary_with(_args: Self::Parameters) -> Self::Strategy {\n (any::<ProveDlog>())\n .prop_map(|p| {\n SigmaBoolean::ProofOfKnowledge(SigmaProofOfKnowledgeTree::ProveDlog(p))\n })\n .boxed()\n }\n }\n\n impl Arbitrary for SigmaProp {\n type Parameters = ();\n type Strategy = BoxedStrategy<Self>;\n\n fn arbitrary_with(_args: Self::Parameters) -> Self::Strategy {\n (any::<SigmaBoolean>()).prop_map(SigmaProp).boxed()\n }\n }\n\n #[test]\n fn ensure_soundness_bits() {\n \n assert!(SOUNDNESS_BITS < GROUP_SIZE_BITS);\n \n assert!(SOUNDNESS_BYTES * 8 <= 512);\n assert!(SOUNDNESS_BYTES % 8 == 0);\n }\n\n \n \n \n \n}\n"},"prefix":{"kind":"string","value":"\n\n#![allow(dead_code)]\n#![allow(unused_variables)]\n#![allow(missing_docs)]\n\npub mod dlog_group;\npub mod dlog_protocol;\npub mod prover;\npub mod verifier;\n\nuse k256::arithmetic::Scalar;\n\nuse crate::{big_integer::BigInteger, serialization::op_code::OpCode};\nuse blake2::digest::{Update, VariableOutput};\nuse blake2::VarBlake2b;\nuse dlog_group::EcPoint;\nuse dlog_protocol::{FirstDlogProverMessage, SecondDlogProverMessage};\nuse std::convert::TryInto;\n\npub struct DlogProverInput {\n \n pub w: Scalar,\n}\n\nimpl DlogProverInput {\n \n pub fn random() -> DlogProverInput {\n DlogProverInput {\n w: dlog_group::random_scalar_in_group_range(),\n }\n }\n\n \n fn public_image(&self) -> ProveDlog {\n \n let g = dlog_group::generator();\n ProveDlog::new(dlog_group::exponentiate(&g, &self.w))\n }\n}\n\npub enum PrivateInput {\n DlogProverInput(DlogProverInput),\n DiffieHellmanTupleProverInput,\n}\n\n#[derive(PartialEq, Eq, Debug, Clone)]\npub struct ProveDlog {\n \n pub h: Box<EcPoint>,\n}\n\nimpl ProveDlog {\n \n pub fn new(ecpoint: EcPoint) -> ProveDlog {\n ProveDlog {\n h: Box::new(ecpoint),\n }\n }\n}\n\n#[derive(PartialEq, Eq, Debug, Clone)]\npub struct ProveDHTuple {\n gv: Box<EcPoint>,\n hv: Box<EcPoint>,\n uv: Box<EcPoint>,\n vv: Box<EcPoint>,\n}\n\n#[derive(PartialEq, Eq, Debug, Clone)]\npub enum SigmaProofOfKnowledgeTree {\n \n ProveDHTuple(ProveDHTuple),\n \n ProveDlog(ProveDlog),\n}\n\n#[derive(PartialEq, Eq, Debug, Clone)]\npub enum SigmaBoolean {\n \n TrivialProp(bool),\n \n ProofOfKnowledge(SigmaProofOfKnowledgeTree),\n \n CAND(Vec<SigmaBoolean>),\n}\n\nimpl SigmaBoolean {\n \n pub fn op_code(&self) -> OpCode {\n match self {\n SigmaBoolean::ProofOfKnowledge(SigmaProofOfKnowledgeTree::ProveDlog(_)) => {\n OpCode::PROVE_DLOG\n }\n _ => todo!(),\n }\n }\n}\n\n#[derive(PartialEq, Eq, Debug, Clone)]\npub struct SigmaProp(SigmaBoolean);\n\nimpl SigmaProp {\n \n pub fn new(sbool: SigmaBoolean) -> Self {\n SigmaProp { 0: sbool }\n }\n\n \n pub fn value(&self) -> &SigmaBoolean {\n &self.0\n }\n}\n\npub enum ProofTree {\n \n UncheckedTree(UncheckedTree),\n \n UnprovenTree(UnprovenTree),\n}\n\nimpl ProofTree {\n pub fn with_challenge(&self, challenge: Challenge) -> ProofTree {\n todo!()\n }\n}\n\npub enum UnprovenTree {\n UnprovenSchnorr(UnprovenSchnorr),\n}\n\nimpl UnprovenTree {\n pub fn real(&self) -> bool {\n match self {\n UnprovenTree::UnprovenSchnorr(us) => !us.simulated,\n }\n }\n}\n\npub struct UnprovenSchnorr {\n proposition: ProveDlog,\n commitment_opt: Option<FirstDlogProverMessage>,\n randomness_opt: Option<BigInteger>,\n challenge_opt: Option<Challenge>,\n simulated: bool,\n}\n\n#[derive(PartialEq, Eq, Debug, Clone)]\npub struct Challenge(FiatShamirHash);\n\npub enum UncheckedSigmaTree {\n UncheckedLeaf(UncheckedLeaf),\n}\n\npub enum UncheckedLeaf {\n UncheckedSchnorr(UncheckedSchnorr),\n}\n\nimpl UncheckedLeaf {\n pub fn proposition(&self) -> SigmaBoolean {\n match self {\n UncheckedLeaf::UncheckedSchnorr(us) => SigmaBoolean::ProofOfKnowledge(\n SigmaProofOfKnowledgeTree::ProveDlog(us.proposition.clone()),\n ),\n }\n }\n}\n\npub struct UncheckedSchnorr {\n proposition: ProveDlog,\n commitment_opt: Option<FirstDlogProverMessage>,\n challenge: Challenge,\n second_message: SecondDlogProverMessage,\n}\n\nimpl UncheckedSigmaTree {\n \n \n \n \n \n}\n\npub enum UncheckedTree {\n \n NoProof,\n \n UncheckedSigmaTree(UncheckedSigmaTree),\n}\n\nfn serialize_sig(tree: UncheckedTree) -> Vec<u8> {\n match tree {\n UncheckedTree::NoProof => vec![],\n UncheckedTree::UncheckedSigmaTree(_) => todo!(),\n }\n}\n\nfn fiat_shamir_tree_to_bytes(tree: &ProofTree) -> Vec<u8> {\n \n \n \n \n \n \n todo!()\n}\n\n/** Size of the binary representation of any group element (2 ^ groupSizeBits == <number of elements in a group>) */\npub const GROUP_SIZE_BITS: usize = 256;\n/** Number of bytes to represent any group element as byte array */\npub const GROUP_SIZE: usize = GROUP_SIZE_BITS / 8;\n/** A size of challenge in Sigma protocols, in bits.\n * If this anything but 192, threshold won't work, because we have polynomials over GF(2^192) and no others.\n * So DO NOT change the value without implementing polynomials over GF(2^soundnessBits) first\n * and changing code that calls on GF2_192 and GF2_192_Poly classes!!!\n * We get the challenge by reducing hash function output to proper value.\n */\npub const SOUNDNESS_BITS: usize = 192;\npub const SOUNDNESS_BYTES: usize = SOUNDNESS_BITS / 8;\n\n#[derive(PartialEq, Eq, Debug, Clone)]\npub struct FiatShamirHash(pub Box<[u8; SOUNDNESS_BYTES]>);\n\npub fn fiat_shamir_hash_fn(input: &[u8]) -> FiatShamirHash {\n \n let mut hasher = VarBlake2b::new(SOUNDNESS_BYTES).unwra"},"suffix":{"kind":"string","value":"\n\n#[cfg(test)]\nmod tests {\n use super::*;\n use proptest::prelude::*;\n\n impl Arbitrary for ProveDlog {\n type Parameters = ();\n type Strategy = BoxedStrategy<Self>;\n\n fn arbitrary_with(_args: Self::Parameters) -> Self::Strategy {\n (any::<EcPoint>()).prop_map(ProveDlog::new).boxed()\n }\n }\n\n impl Arbitrary for SigmaBoolean {\n type Parameters = ();\n type Strategy = BoxedStrategy<Self>;\n\n fn arbitrary_with(_args: Self::Parameters) -> Self::Strategy {\n (any::<ProveDlog>())\n .prop_map(|p| {\n SigmaBoolean::ProofOfKnowledge(SigmaProofOfKnowledgeTree::ProveDlog(p))\n })\n .boxed()\n }\n }\n\n impl Arbitrary for SigmaProp {\n type Parameters = ();\n type Strategy = BoxedStrategy<Self>;\n\n fn arbitrary_with(_args: Self::Parameters) -> Self::Strategy {\n (any::<SigmaBoolean>()).prop_map(SigmaProp).boxed()\n }\n }\n\n #[test]\n fn ensure_soundness_bits() {\n \n assert!(SOUNDNESS_BITS < GROUP_SIZE_BITS);\n \n assert!(SOUNDNESS_BYTES * 8 <= 512);\n assert!(SOUNDNESS_BYTES % 8 == 0);\n }\n\n \n \n \n \n}\n"},"middle":{"kind":"string","value":"p();\n hasher.update(input);\n let hash = hasher.finalize_boxed();\n \n FiatShamirHash(hash.try_into().unwrap())\n}"},"strategy":{"kind":"string","value":"function_block-function_prefixed"},"context_items":{"kind":"list like","value":[{"content":"/// Creates a random scalar, a big-endian integer in the range [0, n), where n is group order\n\npub fn random_scalar_in_group_range() -> Scalar {\n\n loop {\n\n // Generate a new secret key using the operating system's\n\n // cryptographically secure random number generator\n\n let sk = k256::SecretKey::generate();\n\n let bytes: [u8; 32] = sk\n\n .secret_scalar()\n\n .as_ref()\n\n .as_slice()\n\n .try_into()\n\n .expect(\"expected 32 bytes\");\n\n // Returns None if the byte array does not contain\n\n // a big-endian integer in the range [0, n), where n is group order.\n\n let maybe_scalar = Scalar::from_bytes(bytes);\n\n if bool::from(maybe_scalar.is_some()) {\n\n break maybe_scalar.unwrap();\n\n }\n\n }\n\n}\n\n\n","file_path":"sigma-tree/src/sigma_protocol/dlog_group.rs","rank":0,"score":304795.5759556212},{"content":"/// Creates a random member of this Dlog group\n\npub fn random_element() -> EcPoint {\n\n let sk = DlogProverInput::random();\n\n let bytes = sk.w.to_bytes();\n\n let bi = BigInt::from_bytes_be(Sign::Plus, &bytes[..]);\n\n\n\n exponentiate(&generator(), &sk.w)\n\n}\n\n\n","file_path":"sigma-tree/src/sigma_protocol/dlog_group.rs","rank":1,"score":290281.25990754174},{"content":"pub fn is_identity(ge: &EcPoint) -> bool {\n\n *ge == identity()\n\n}\n\n\n","file_path":"sigma-tree/src/sigma_protocol/dlog_group.rs","rank":4,"score":261162.48115587642},{"content":"/// Blake2b256 hash (256 bit)\n\npub fn blake2b256_hash(bytes: &[u8]) -> Digest32 {\n\n // unwrap is safe 32 bytes is a valid hash size (<= 512 && 32 % 8 == 0)\n\n let mut hasher = VarBlake2b::new(Digest32::SIZE).unwrap();\n\n hasher.update(bytes);\n\n let hash = hasher.finalize_boxed();\n\n // unwrap is safe due to hash size is expected to be Digest32::SIZE\n\n Digest32(hash.try_into().unwrap())\n\n}\n\n\n\nimpl From<[u8; Digest32::SIZE]> for Digest32 {\n\n fn from(bytes: [u8; Digest32::SIZE]) -> Self {\n\n Digest32(Box::new(bytes))\n\n }\n\n}\n\n\n\nimpl Into<Base16EncodedBytes> for Digest32 {\n\n fn into(self) -> Base16EncodedBytes {\n\n Base16EncodedBytes::new(self.0.as_ref())\n\n }\n\n}\n","file_path":"sigma-tree/src/chain/digest32.rs","rank":6,"score":248194.5878895931},{"content":"/// Raises the base GroupElement to the exponent. The result is another GroupElement.\n\npub fn exponentiate(base: &EcPoint, exponent: &Scalar) -> EcPoint {\n\n if !is_identity(base) {\n\n // implement for negative exponent\n\n // see reference impl https://github.com/ScorexFoundation/sigmastate-interpreter/blob/ec71a6f988f7412bc36199f46e7ad8db643478c7/sigmastate/src/main/scala/sigmastate/basics/BcDlogGroup.scala#L201\n\n // see https://github.com/ergoplatform/sigma-rust/issues/36\n\n\n\n // we treat EC as a multiplicative group, therefore, exponentiate point is multiply.\n\n EcPoint(base.0 * exponent)\n\n } else {\n\n base.clone()\n\n }\n\n}\n\n\n","file_path":"sigma-tree/src/sigma_protocol/dlog_group.rs","rank":7,"score":246609.0916878886},{"content":"/// The generator g of the group is an element of the group such that, when written multiplicatively, every element\n\n/// of the group is a power of g.\n\npub fn generator() -> EcPoint {\n\n EcPoint(ProjectivePoint::generator())\n\n}\n\n\n\n/// the identity(infinity) element of this Dlog group\n\npub const fn identity() -> EcPoint {\n\n EcPoint(ProjectivePoint::identity())\n\n}\n\n\n","file_path":"sigma-tree/src/sigma_protocol/dlog_group.rs","rank":8,"score":233539.662568651},{"content":"pub trait Prover: Evaluator {\n\n fn secrets(&self) -> &[PrivateInput];\n\n\n\n fn prove(\n\n &self,\n\n tree: &ErgoTree,\n\n env: &Env,\n\n message: &[u8],\n\n ) -> Result<ProverResult, ProverError> {\n\n let expr = tree.proposition()?;\n\n let proof = self\n\n .reduce_to_crypto(expr.as_ref(), env)\n\n .map_err(ProverError::EvalError)\n\n .and_then(|v| match v.sigma_prop {\n\n SigmaBoolean::TrivialProp(true) => Ok(UncheckedTree::NoProof),\n\n SigmaBoolean::TrivialProp(false) => Err(ProverError::ReducedToFalse),\n\n sb => {\n\n let tree = self.convert_to_unproven(sb);\n\n let unchecked_tree = self.prove_to_unchecked(tree, message)?;\n\n Ok(UncheckedTree::UncheckedSigmaTree(unchecked_tree))\n","file_path":"sigma-tree/src/sigma_protocol/prover.rs","rank":9,"score":201430.14083236712},{"content":"fn get_embeddable_type(code: u8) -> Result<SType, SerializationError> {\n\n match TypeCode::new(code) {\n\n TypeCode::SBOOLEAN => Ok(SType::SBoolean),\n\n TypeCode::SBYTE => Ok(SType::SByte),\n\n TypeCode::SSHORT => Ok(SType::SShort),\n\n TypeCode::SINT => Ok(SType::SInt),\n\n TypeCode::SLONG => Ok(SType::SLong),\n\n TypeCode::SBIGINT => Ok(SType::SBigInt),\n\n TypeCode::SGROUP_ELEMENT => Ok(SType::SGroupElement),\n\n TypeCode::SSIGMAPROP => Ok(SType::SSigmaProp),\n\n _ => Err(SerializationError::InvalidOpCode),\n\n }\n\n}\n\n\n","file_path":"sigma-tree/src/serialization/types.rs","rank":10,"score":199649.98139593913},{"content":"pub trait Verifier: Evaluator {\n\n fn verify(\n\n &mut self,\n\n tree: &ErgoTree,\n\n env: &Env,\n\n proof: &[u8],\n\n message: &[u8],\n\n ) -> Result<VerificationResult, VerifierError> {\n\n let expr = tree.proposition()?;\n\n let cprop = self.reduce_to_crypto(expr.as_ref(), env)?.sigma_prop;\n\n let res: bool = match cprop {\n\n SigmaBoolean::TrivialProp(b) => b,\n\n sb => todo!(),\n\n };\n\n Ok(VerificationResult {\n\n result: res,\n\n cost: 0,\n\n })\n\n }\n\n}\n","file_path":"sigma-tree/src/sigma_protocol/verifier.rs","rank":11,"score":182454.27450487658},{"content":"/// Box serialization with token ids optionally saved in transaction\n\n/// (in this case only token index is saved)\n\npub fn serialize_box_with_indexed_digests<W: vlq_encode::WriteSigmaVlqExt>(\n\n box_value: &BoxValue,\n\n ergo_tree_bytes: Vec<u8>,\n\n tokens: &[TokenAmount],\n\n additional_registers: &NonMandatoryRegisters,\n\n creation_height: u32,\n\n token_ids_in_tx: Option<&IndexSet<TokenId>>,\n\n w: &mut W,\n\n) -> Result<(), io::Error> {\n\n // reference implementation - https://github.com/ScorexFoundation/sigmastate-interpreter/blob/9b20cb110effd1987ff76699d637174a4b2fb441/sigmastate/src/main/scala/org/ergoplatform/ErgoBoxCandidate.scala#L95-L95\n\n box_value.sigma_serialize(w)?;\n\n w.write_all(&ergo_tree_bytes[..])?;\n\n w.put_u32(creation_height)?;\n\n w.put_u8(u8::try_from(tokens.len()).unwrap())?;\n\n\n\n tokens.iter().try_for_each(|t| {\n\n match token_ids_in_tx {\n\n Some(token_ids) => w.put_u32(\n\n u32::try_from(\n\n token_ids\n","file_path":"sigma-tree/src/serialization/ergo_box.rs","rank":12,"score":173133.05255750826},{"content":"#[derive(PartialEq, Eq, Debug, Clone)]\n\nstruct ErgoTreeHeader(u8);\n\n\n\nimpl ErgoTreeHeader {\n\n const CONSTANT_SEGREGATION_FLAG: u8 = 0x10;\n\n\n\n pub fn is_constant_segregation(&self) -> bool {\n\n self.0 & ErgoTreeHeader::CONSTANT_SEGREGATION_FLAG != 0\n\n }\n\n}\n\n\n\n/// Whole ErgoTree parsing (deserialization) error\n\n#[derive(PartialEq, Eq, Debug, Clone)]\n\npub struct ErgoTreeConstantsParsingError {\n\n /// Ergo tree bytes (faild to deserialize)\n\n pub bytes: Vec<u8>,\n\n /// Deserialization error\n\n pub error: SerializationError,\n\n}\n\n\n\n/// ErgoTree root expr parsing (deserialization) error\n","file_path":"sigma-tree/src/ergo_tree.rs","rank":13,"score":171467.29386373737},{"content":"pub fn serialize_bytes<S, T>(bytes: T, serializer: S) -> Result<S::Ok, S::Error>\n\nwhere\n\n S: Serializer,\n\n T: AsRef<[u8]>,\n\n{\n\n serializer.serialize_str(&base16::encode_lower(bytes.as_ref()))\n\n}\n\n\n\npub mod ergo_tree {\n\n\n\n use super::*;\n\n use crate::ErgoTree;\n\n use serde::{Deserialize, Deserializer, Serializer};\n\n use sigma_ser::serializer::SigmaSerializable;\n\n\n\n pub fn serialize<S>(ergo_tree: &ErgoTree, serializer: S) -> Result<S::Ok, S::Error>\n\n where\n\n S: Serializer,\n\n {\n\n let bytes = ergo_tree.sigma_serialise_bytes();\n","file_path":"sigma-tree/src/chain/json.rs","rank":14,"score":145282.7728311161},{"content":"fn is_stype_embeddable(tpe: &SType) -> bool {\n\n match tpe {\n\n SType::SBoolean => true,\n\n SType::SByte => true,\n\n SType::SShort => true,\n\n SType::SInt => true,\n\n SType::SLong => true,\n\n SType::SBigInt => true,\n\n SType::SGroupElement => true,\n\n SType::SSigmaProp => true,\n\n _ => false,\n\n }\n\n}\n\n\n\nimpl SigmaSerializable for SType {\n\n fn sigma_serialize<W: WriteSigmaVlqExt>(&self, w: &mut W) -> Result<(), io::Error> {\n\n // for reference see http://github.com/ScorexFoundation/sigmastate-interpreter/blob/25251c1313b0131835f92099f02cef8a5d932b5e/sigmastate/src/main/scala/sigmastate/serialization/TypeSerializer.scala#L25-L25\n\n match self {\n\n SType::SAny => self.type_code().sigma_serialize(w),\n\n\n","file_path":"sigma-tree/src/serialization/types.rs","rank":15,"score":144069.00610777322},{"content":"#[allow(unconditional_recursion)]\n\nfn eval(expr: &Expr, env: &Env, ca: &mut CostAccumulator) -> Result<Value, EvalError> {\n\n match expr {\n\n Expr::Const(Constant {\n\n tpe: SType::SBoolean,\n\n v: ConstantVal::Boolean(b),\n\n }) => Ok(Value::Boolean(*b)),\n\n Expr::Const(Constant {\n\n tpe: SType::SSigmaProp,\n\n v: ConstantVal::SigmaProp(sp),\n\n }) => Ok(Value::SigmaProp(Box::new((*sp.value()).clone()))),\n\n Expr::Coll { .. } => todo!(),\n\n Expr::Tup { .. } => todo!(),\n\n Expr::PredefFunc(_) => todo!(),\n\n Expr::CollM(_) => todo!(),\n\n Expr::BoxM(_) => todo!(),\n\n Expr::CtxM(_) => todo!(),\n\n Expr::MethodCall { .. } => todo!(),\n\n Expr::BinOp(bin_op, l, r) => {\n\n let v_l = eval(l, env, ca)?;\n\n let v_r = eval(r, env, ca)?;\n","file_path":"sigma-tree/src/eval.rs","rank":16,"score":143356.5365707662},{"content":"//! Verifier\n\n\n\n#![allow(dead_code)]\n\n#![allow(unused_variables)]\n\n#![allow(missing_docs)]\n\n\n\nuse super::SigmaBoolean;\n\nuse crate::{\n\n eval::{Env, EvalError, Evaluator},\n\n ErgoTree, ErgoTreeParsingError,\n\n};\n\n\n\npub enum VerifierError {\n\n ErgoTreeError(ErgoTreeParsingError),\n\n EvalError(EvalError),\n\n}\n\n\n\nimpl From<ErgoTreeParsingError> for VerifierError {\n\n fn from(err: ErgoTreeParsingError) -> Self {\n\n VerifierError::ErgoTreeError(err)\n","file_path":"sigma-tree/src/sigma_protocol/verifier.rs","rank":17,"score":132343.50952893982},{"content":" }\n\n}\n\n\n\nimpl From<EvalError> for VerifierError {\n\n fn from(err: EvalError) -> Self {\n\n VerifierError::EvalError(err)\n\n }\n\n}\n\n\n\npub struct VerificationResult {\n\n result: bool,\n\n cost: u64,\n\n}\n\n\n","file_path":"sigma-tree/src/sigma_protocol/verifier.rs","rank":18,"score":132336.48822234911},{"content":"\n\nimpl Evaluator for TestProver {}\n\nimpl Prover for TestProver {\n\n fn secrets(&self) -> &[PrivateInput] {\n\n self.secrets.as_ref()\n\n }\n\n}\n\n\n\n#[derive(PartialEq, Eq, Debug, Clone)]\n\npub enum ProverError {\n\n ErgoTreeError(ErgoTreeParsingError),\n\n EvalError(EvalError),\n\n ReducedToFalse,\n\n TreeRootIsNotReal,\n\n SimulatedLeafWithoutChallenge,\n\n RealUnprovenTreeWithoutChallenge,\n\n SecretNotFound,\n\n}\n\n\n\nimpl From<ErgoTreeParsingError> for ProverError {\n\n fn from(err: ErgoTreeParsingError) -> Self {\n\n ProverError::ErgoTreeError(err)\n\n }\n\n}\n\n\n","file_path":"sigma-tree/src/sigma_protocol/prover.rs","rank":19,"score":132090.0939276574},{"content":"//! Interpreter with enhanced functionality to prove statements.\n\n\n\n#![allow(dead_code)]\n\n#![allow(unused_variables)]\n\n#![allow(missing_docs)]\n\n\n\nuse super::{\n\n dlog_protocol, fiat_shamir_hash_fn, fiat_shamir_tree_to_bytes, serialize_sig, Challenge,\n\n PrivateInput, ProofTree, SigmaBoolean, SigmaProofOfKnowledgeTree, UncheckedLeaf,\n\n UncheckedSchnorr, UncheckedSigmaTree, UncheckedTree, UnprovenSchnorr, UnprovenTree,\n\n};\n\nuse crate::{\n\n chain::{ContextExtension, ProverResult},\n\n eval::{Env, EvalError, Evaluator},\n\n ErgoTree, ErgoTreeParsingError,\n\n};\n\n\n\npub struct TestProver {\n\n pub secrets: Vec<PrivateInput>,\n\n}\n","file_path":"sigma-tree/src/sigma_protocol/prover.rs","rank":20,"score":132086.3459287251},{"content":" // and the message being signed.\n\n s.append(&mut message.to_vec());\n\n let root_challenge = fiat_shamir_hash_fn(s.as_slice());\n\n let step8 = step6.with_challenge(Challenge(root_challenge));\n\n\n\n // Prover Step 9: complete the proof by computing challenges at real nodes and additionally responses at real leaves\n\n let step9 = self.proving(step8)?;\n\n\n\n // Prover Step 10: output the right information into the proof\n\n match step9 {\n\n ProofTree::UncheckedTree(UncheckedTree::UncheckedSigmaTree(tree)) => Ok(tree),\n\n _ => todo!(),\n\n }\n\n }\n\n\n\n /**\n\n Prover Step 1: This step will mark as \"real\" every node for which the prover can produce a real proof.\n\n This step may mark as \"real\" more nodes than necessary if the prover has more than the minimal\n\n necessary number of witnesses (for example, more than one child of an OR).\n\n This will be corrected in the next step.\n","file_path":"sigma-tree/src/sigma_protocol/prover.rs","rank":21,"score":132085.12741664032},{"content":" match tree {\n\n ProofTree::UncheckedTree(_) => Ok(tree),\n\n ProofTree::UnprovenTree(unproven_tree) => match unproven_tree {\n\n UnprovenTree::UnprovenSchnorr(us) if unproven_tree.real() => {\n\n if let Some(challenge) = us.challenge_opt.clone() {\n\n if let Some(priv_key) = self\n\n .secrets()\n\n .iter()\n\n .flat_map(|s| match s {\n\n PrivateInput::DlogProverInput(dl) => vec![dl],\n\n _ => vec![],\n\n })\n\n .find(|prover_input| prover_input.public_image() == us.proposition)\n\n {\n\n let z = dlog_protocol::interactive_prover::second_message(\n\n &priv_key,\n\n us.randomness_opt.unwrap(),\n\n &challenge,\n\n );\n\n Ok(ProofTree::UncheckedTree(UncheckedTree::UncheckedSigmaTree(\n","file_path":"sigma-tree/src/sigma_protocol/prover.rs","rank":22,"score":132083.74330649685},{"content":" In a top-down traversal of the tree, do the following for each node:\n\n */\n\n fn polish_simulated(&self, unproven_tree: UnprovenTree) -> UnprovenTree {\n\n todo!()\n\n }\n\n\n\n /**\n\n Prover Step 4: In a top-down traversal of the tree, compute the challenges e for simulated children of every node\n\n Prover Step 5: For every leaf marked \"simulated\", use the simulator of the Sigma-protocol for that leaf\n\n to compute the commitment $a$ and the response z, given the challenge e that is already stored in the leaf.\n\n Prover Step 6: For every leaf marked \"real\", use the first prover step of the Sigma-protocol for that leaf to\n\n compute the commitment a.\n\n */\n\n fn simulate_and_commit(&self, tree: UnprovenTree) -> Result<ProofTree, ProverError> {\n\n match tree {\n\n UnprovenTree::UnprovenSchnorr(us) => {\n\n if us.simulated {\n\n // Step 5 (simulated leaf -- complete the simulation)\n\n if let Some(challenge) = us.challenge_opt {\n\n let (fm, sm) = dlog_protocol::interactive_prover::simulate(\n","file_path":"sigma-tree/src/sigma_protocol/prover.rs","rank":23,"score":132083.60331504315},{"content":"}\n\n\n\n// #[cfg(test)]\n\n// mod tests {\n\n// use super::*;\n\n// use crate::{\n\n// ast::{Constant, ConstantVal, Expr},\n\n// sigma_protocol::{DlogProverInput, SigmaProp},\n\n// types::SType,\n\n// };\n\n// use std::rc::Rc;\n\n\n\n// #[test]\n\n// fn test_prove_true_prop() {\n\n// let bool_true_tree = ErgoTree::from(Rc::new(Expr::Const(Constant {\n\n// tpe: SType::SBoolean,\n\n// v: ConstantVal::Boolean(true),\n\n// })));\n\n// let message = vec![0u8; 100];\n\n\n","file_path":"sigma-tree/src/sigma_protocol/prover.rs","rank":24,"score":132082.14336036408},{"content":" if !step1.real() {\n\n return Err(ProverError::TreeRootIsNotReal);\n\n }\n\n\n\n // Prover Step 3: Change some \"real\" nodes to \"simulated\" to make sure each node\n\n // has the right number of simulated children.\n\n\n\n // skipped, since it leaves UnprovenSchnorr untouched\n\n // let step3 = self.polish_simulated(step1);\n\n\n\n // Prover Steps 4, 5, and 6 together: find challenges for simulated nodes; simulate simulated leaves;\n\n // compute commitments for real leaves\n\n let step6 = self.simulate_and_commit(step1)?;\n\n\n\n // Prover Steps 7: convert the relevant information in the tree (namely, tree structure, node types,\n\n // the statements being proven and commitments at the leaves)\n\n // to a string\n\n let mut s = fiat_shamir_tree_to_bytes(&step6);\n\n\n\n // Prover Step 8: compute the challenge for the root of the tree as the Fiat-Shamir hash of s\n","file_path":"sigma-tree/src/sigma_protocol/prover.rs","rank":25,"score":132080.5613411577},{"content":" &us.proposition,\n\n &challenge,\n\n );\n\n Ok(ProofTree::UncheckedTree(UncheckedTree::UncheckedSigmaTree(\n\n UncheckedSigmaTree::UncheckedLeaf(UncheckedLeaf::UncheckedSchnorr(\n\n UncheckedSchnorr {\n\n proposition: us.proposition,\n\n commitment_opt: Some(fm),\n\n challenge,\n\n second_message: sm,\n\n },\n\n )),\n\n )))\n\n } else {\n\n Err(ProverError::SimulatedLeafWithoutChallenge)\n\n }\n\n } else {\n\n // Step 6 (real leaf -- compute the commitment a)\n\n let (r, commitment) =\n\n dlog_protocol::interactive_prover::first_message(&us.proposition);\n","file_path":"sigma-tree/src/sigma_protocol/prover.rs","rank":26,"score":132080.44406417472},{"content":" }\n\n });\n\n proof.map(|v| ProverResult {\n\n proof: serialize_sig(v),\n\n extension: ContextExtension::empty(),\n\n })\n\n }\n\n\n\n fn convert_to_unproven(&self, sigma_tree: SigmaBoolean) -> UnprovenTree {\n\n match sigma_tree {\n\n SigmaBoolean::TrivialProp(_) => todo!(), // TODO: why it's even here\n\n SigmaBoolean::ProofOfKnowledge(pok) => match pok {\n\n SigmaProofOfKnowledgeTree::ProveDHTuple(_) => todo!(),\n\n SigmaProofOfKnowledgeTree::ProveDlog(prove_dlog) => {\n\n UnprovenTree::UnprovenSchnorr(UnprovenSchnorr {\n\n proposition: prove_dlog,\n\n commitment_opt: None,\n\n randomness_opt: None,\n\n challenge_opt: None,\n\n simulated: false,\n","file_path":"sigma-tree/src/sigma_protocol/prover.rs","rank":27,"score":132080.42293479643},{"content":"// let prover = TestProver { secrets: vec![] };\n\n// let res = prover.prove(&bool_true_tree, &Env::empty(), message.as_slice());\n\n// assert!(res.is_ok());\n\n// assert!(res.unwrap().proof.is_empty());\n\n// }\n\n\n\n// #[test]\n\n// fn test_prove_false_prop() {\n\n// let bool_false_tree = ErgoTree::from(Rc::new(Expr::Const(Constant {\n\n// tpe: SType::SBoolean,\n\n// v: ConstantVal::Boolean(false),\n\n// })));\n\n// let message = vec![0u8; 100];\n\n\n\n// let prover = TestProver { secrets: vec![] };\n\n// let res = prover.prove(&bool_false_tree, &Env::empty(), message.as_slice());\n\n// assert!(res.is_err());\n\n// assert_eq!(res.err().unwrap(), ProverError::ReducedToFalse);\n\n// }\n\n\n","file_path":"sigma-tree/src/sigma_protocol/prover.rs","rank":28,"score":132077.7923285461},{"content":" UncheckedSigmaTree::UncheckedLeaf(UncheckedLeaf::UncheckedSchnorr(\n\n UncheckedSchnorr {\n\n proposition: us.proposition,\n\n commitment_opt: None,\n\n challenge,\n\n second_message: z,\n\n },\n\n )),\n\n )))\n\n } else {\n\n Err(ProverError::SecretNotFound)\n\n }\n\n } else {\n\n Err(ProverError::RealUnprovenTreeWithoutChallenge)\n\n }\n\n }\n\n _ => todo!(),\n\n },\n\n }\n\n }\n","file_path":"sigma-tree/src/sigma_protocol/prover.rs","rank":29,"score":132077.4879540827},{"content":" In a bottom-up traversal of the tree, do the following for each node:\n\n */\n\n fn mark_real(&self, unproven_tree: UnprovenTree) -> UnprovenTree {\n\n match unproven_tree {\n\n UnprovenTree::UnprovenSchnorr(us) => {\n\n let secret_known = self.secrets().iter().any(|s| match s {\n\n PrivateInput::DlogProverInput(dl) => dl.public_image() == us.proposition,\n\n _ => false,\n\n });\n\n UnprovenTree::UnprovenSchnorr(UnprovenSchnorr {\n\n simulated: !secret_known,\n\n ..us\n\n })\n\n }\n\n }\n\n }\n\n\n\n /**\n\n Prover Step 3: This step will change some \"real\" nodes to \"simulated\" to make sure each node has\n\n the right number of simulated children.\n","file_path":"sigma-tree/src/sigma_protocol/prover.rs","rank":30,"score":132075.8234238417},{"content":" })\n\n }\n\n },\n\n SigmaBoolean::CAND(_) => todo!(),\n\n }\n\n }\n\n\n\n /// The comments in this section are taken from the algorithm for the\n\n /// Sigma-protocol prover as described in the white paper\n\n /// https://ergoplatform.org/docs/ErgoScript.pdf (Appendix A)\n\n fn prove_to_unchecked(\n\n &self,\n\n unproven_tree: UnprovenTree,\n\n message: &[u8],\n\n ) -> Result<UncheckedSigmaTree, ProverError> {\n\n // Prover Step 1: Mark as real everything the prover can prove\n\n let step1 = self.mark_real(unproven_tree);\n\n\n\n // Prover Step 2: If the root of the tree is marked \"simulated\" then the prover does not have enough witnesses\n\n // to perform the proof. Abort.\n","file_path":"sigma-tree/src/sigma_protocol/prover.rs","rank":31,"score":132075.221121568},{"content":"// #[test]\n\n// fn test_prove_pk_prop() {\n\n// let secret = DlogProverInput::random();\n\n// let pk = secret.public_image();\n\n// let tree = ErgoTree::from(Rc::new(Expr::Const(Constant {\n\n// tpe: SType::SSigmaProp,\n\n// v: ConstantVal::SigmaProp(Box::new(SigmaProp(SigmaBoolean::ProofOfKnowledge(\n\n// SigmaProofOfKnowledgeTree::ProveDlog(pk),\n\n// )))),\n\n// })));\n\n// let message = vec![0u8; 100];\n\n\n\n// let prover = TestProver {\n\n// secrets: vec![PrivateInput::DlogProverInput(secret)],\n\n// };\n\n// let res = prover.prove(&tree, &Env::empty(), message.as_slice());\n\n// // assert!(res.is_ok());\n\n// assert!(!res.unwrap().proof.is_empty());\n\n// }\n\n// }\n","file_path":"sigma-tree/src/sigma_protocol/prover.rs","rank":32,"score":132074.9440513409},{"content":" Ok(ProofTree::UnprovenTree(UnprovenTree::UnprovenSchnorr(\n\n UnprovenSchnorr {\n\n commitment_opt: Some(commitment),\n\n randomness_opt: Some(r),\n\n ..us\n\n },\n\n )))\n\n }\n\n }\n\n }\n\n }\n\n\n\n /**\n\n Prover Step 9: Perform a top-down traversal of only the portion of the tree marked \"real\" in order to compute\n\n the challenge e for every node marked \"real\" below the root and, additionally, the response z for every leaf\n\n marked \"real\"\n\n */\n\n fn proving(&self, tree: ProofTree) -> Result<ProofTree, ProverError> {\n\n // If the node is a leaf marked \"real\", compute its response according to the second prover step\n\n // of the Sigma-protocol given the commitment, challenge, and witness\n","file_path":"sigma-tree/src/sigma_protocol/prover.rs","rank":33,"score":132071.53000850373},{"content":"/// Box deserialization with token ids optionally parsed in transaction\n\npub fn parse_box_with_indexed_digests<R: vlq_encode::ReadSigmaVlqExt>(\n\n digests_in_tx: Option<&IndexSet<TokenId>>,\n\n r: &mut R,\n\n) -> Result<ErgoBoxCandidate, SerializationError> {\n\n // reference implementation -https://github.com/ScorexFoundation/sigmastate-interpreter/blob/9b20cb110effd1987ff76699d637174a4b2fb441/sigmastate/src/main/scala/org/ergoplatform/ErgoBoxCandidate.scala#L144-L144\n\n\n\n let value = BoxValue::sigma_parse(r)?;\n\n let ergo_tree = ErgoTree::sigma_parse(r)?;\n\n let creation_height = r.get_u32()?;\n\n let tokens_count = r.get_u8()?;\n\n let mut tokens = Vec::with_capacity(tokens_count as usize);\n\n for _ in 0..tokens_count {\n\n let token_id = match digests_in_tx {\n\n None => TokenId::sigma_parse(r)?,\n\n Some(digests) => {\n\n let digest_index = r.get_u32()?;\n\n match digests.get_index(digest_index as usize) {\n\n Some(i) => Ok((*i).clone()),\n\n None => Err(SerializationError::Misc(\n\n \"failed to find token id in tx digests\".to_string(),\n","file_path":"sigma-tree/src/serialization/ergo_box.rs","rank":34,"score":130755.87430331073},{"content":"use num_bigint::{BigInt, Sign};\n\nuse sigma_ser::{\n\n serializer::{SerializationError, SigmaSerializable},\n\n vlq_encode,\n\n};\n\nuse std::{convert::TryInto, io};\n\n\n\n#[derive(PartialEq, Debug, Clone)]\n\npub struct EcPoint(ProjectivePoint);\n\n\n\nimpl EcPoint {\n\n pub const GROUP_SIZE: usize = 33;\n\n}\n\n\n\nimpl Eq for EcPoint {}\n\n\n\n/// The generator g of the group is an element of the group such that, when written multiplicatively, every element\n\n/// of the group is a power of g.\n","file_path":"sigma-tree/src/sigma_protocol/dlog_group.rs","rank":35,"score":128997.84124939927},{"content":"impl SigmaSerializable for EcPoint {\n\n fn sigma_serialize<W: vlq_encode::WriteSigmaVlqExt>(&self, w: &mut W) -> Result<(), io::Error> {\n\n let caff = self.0.to_affine();\n\n if bool::from(caff.is_some()) {\n\n let pubkey = caff.unwrap().to_compressed_pubkey();\n\n w.write_all(pubkey.as_bytes())?;\n\n } else {\n\n // infinity point\n\n let zeroes = [0u8; EcPoint::GROUP_SIZE];\n\n w.write_all(&zeroes)?;\n\n }\n\n Ok(())\n\n }\n\n\n\n fn sigma_parse<R: vlq_encode::ReadSigmaVlqExt>(r: &mut R) -> Result<Self, SerializationError> {\n\n let mut buf = [0; EcPoint::GROUP_SIZE];\n\n r.read_exact(&mut buf[..])?;\n\n if buf[0] != 0 {\n\n let pubkey = PublicKey::from_bytes(&buf[..]).ok_or_else(|| {\n\n SerializationError::Misc(\"failed to parse PK from bytes\".to_string())\n","file_path":"sigma-tree/src/sigma_protocol/dlog_group.rs","rank":36,"score":128991.06248959851},{"content":"//! This is the general interface for the discrete logarithm prime-order group.\n\n//!\n\n//! The discrete logarithm problem is as follows: given a generator g of a finite\n\n//! group G and a random element h in G, find the (unique) integer x such that\n\n//! `g^x = h`.\n\n//!\n\n//! In cryptography, we are interested in groups for which the discrete logarithm problem\n\n//! (Dlog for short) is assumed to be hard. The most known groups of that kind are some Elliptic curve groups.\n\n//!\n\n//! Another issue pertaining elliptic curves is the need to find a suitable mapping that will convert an arbitrary\n\n//! message (that is some binary string) to an element of the group and vice-versa.\n\n//!\n\n//! Only a subset of the messages can be effectively mapped to a group element in such a way that there is a one-to-one\n\n//! injection that converts the string to a group element and vice-versa.\n\n//!\n\n//! On the other hand, any group element can be mapped to some string.\n\n\n\nuse super::DlogProverInput;\n\nuse k256::arithmetic::{ProjectivePoint, Scalar};\n\nuse k256::{arithmetic::AffinePoint, PublicKey};\n","file_path":"sigma-tree/src/sigma_protocol/dlog_group.rs","rank":37,"score":128984.70460948438},{"content":" use sigma_ser::test_helpers::*;\n\n\n\n impl Arbitrary for EcPoint {\n\n type Parameters = ();\n\n type Strategy = BoxedStrategy<Self>;\n\n\n\n fn arbitrary_with(_args: Self::Parameters) -> Self::Strategy {\n\n prop_oneof![Just(generator()), Just(identity()), Just(random_element()),].boxed()\n\n }\n\n }\n\n\n\n proptest! {\n\n\n\n #[test]\n\n fn ser_roundtrip(v in any::<EcPoint>()) {\n\n prop_assert_eq![sigma_serialize_roundtrip(&v), v];\n\n }\n\n }\n\n}\n","file_path":"sigma-tree/src/sigma_protocol/dlog_group.rs","rank":38,"score":128982.96969987261},{"content":" })?;\n\n let cp = AffinePoint::from_pubkey(&pubkey);\n\n if bool::from(cp.is_none()) {\n\n Err(SerializationError::Misc(\n\n \"failed to get affine point from PK\".to_string(),\n\n ))\n\n } else {\n\n Ok(EcPoint(ProjectivePoint::from(cp.unwrap())))\n\n }\n\n } else {\n\n // infinity point\n\n Ok(EcPoint(ProjectivePoint::identity()))\n\n }\n\n }\n\n}\n\n\n\n#[cfg(test)]\n\nmod tests {\n\n use super::*;\n\n use proptest::prelude::*;\n","file_path":"sigma-tree/src/sigma_protocol/dlog_group.rs","rank":39,"score":128973.18299612621},{"content":"#[derive(PartialEq, Eq, Debug, Clone)]\n\nstruct ParsedTree {\n\n constants: Vec<Constant>,\n\n root: Result<Rc<Expr>, ErgoTreeRootParsingError>,\n\n}\n\n\n\n/** The root of ErgoScript IR. Serialized instances of this class are self sufficient and can be passed around.\n\n */\n\n#[derive(PartialEq, Eq, Debug, Clone)]\n\npub struct ErgoTree {\n\n header: ErgoTreeHeader,\n\n tree: Result<ParsedTree, ErgoTreeConstantsParsingError>,\n\n}\n\n\n","file_path":"sigma-tree/src/ergo_tree.rs","rank":40,"score":124535.41137541014},{"content":"/// Consensus-critical serialization for Ergo\n\npub trait SigmaSerializable: Sized {\n\n /// Write `self` to the given `writer`.\n\n /// This function has a `sigma_` prefix to alert the reader that the\n\n /// serialization in use is consensus-critical serialization \n\n /// Notice that the error type is [`std::io::Error`]; this indicates that\n\n /// serialization MUST be infallible up to errors in the underlying writer.\n\n /// In other words, any type implementing `SigmaSerializable`\n\n /// must make illegal states unrepresentable.\n\n fn sigma_serialize<W: vlq_encode::WriteSigmaVlqExt>(&self, w: &mut W) -> Result<(), io::Error>;\n\n\n\n /// Try to read `self` from the given `reader`.\n\n /// `sigma-` prefix to alert the reader that the serialization in use\n\n /// is consensus-critical\n\n fn sigma_parse<R: vlq_encode::ReadSigmaVlqExt>(r: &mut R) -> Result<Self, SerializationError>;\n\n\n\n /// Serialize any SigmaSerializable value into bytes\n\n fn sigma_serialise_bytes(&self) -> Vec<u8> {\n\n let mut data = Vec::new();\n\n self.sigma_serialize(&mut data)\n\n // since serialization may fail only for underlying IO errors it's ok to force unwrap\n","file_path":"sigma-ser/src/serializer.rs","rank":41,"score":115946.81811420254},{"content":"/// Encode a 32-bit value with ZigZag. ZigZag encodes signed integers\n\n/// into values that can be efficiently encoded with VLQ. (Otherwise,\n\n/// negative values must be sign-extended to 64 bits to be varint encoded,\n\n/// thus always taking 10 bytes on the wire.)\n\n/// see https://developers.google.com/protocol-buffers/docs/encoding#types\n\npub fn encode_i32(v: i32) -> u32 {\n\n // Note: the right-shift must be arithmetic\n\n // source: http://github.com/google/protobuf/blob/a7252bf42df8f0841cf3a0c85fdbf1a5172adecb/java/core/src/main/java/com/google/protobuf/CodedOutputStream.java#L934\n\n ((v << 1) ^ (v >> 31)) as u32\n\n}\n\n\n","file_path":"sigma-ser/src/zig_zag_encode.rs","rank":42,"score":113382.27196220358},{"content":"/// Encode a 64-bit value with ZigZag. ZigZag encodes signed integers\n\n/// into values that can be efficiently encoded with varint. (Otherwise,\n\n/// negative values must be sign-extended to 64 bits to be varint encoded,\n\n/// thus always taking 10 bytes on the wire.)\n\n/// see https://developers.google.com/protocol-buffers/docs/encoding#types\n\npub fn encode_i64(v: i64) -> u64 {\n\n // source: http://github.com/google/protobuf/blob/a7252bf42df8f0841cf3a0c85fdbf1a5172adecb/java/core/src/main/java/com/google/protobuf/CodedOutputStream.java#L949\n\n ((v << 1) ^ (v >> 63)) as u64\n\n}\n\n\n","file_path":"sigma-ser/src/zig_zag_encode.rs","rank":43,"score":113382.27196220358},{"content":"/// Decode a signed value previously ZigZag-encoded with [`encode_i32`]\n\n/// see https://developers.google.com/protocol-buffers/docs/encoding#types\n\npub fn decode_u32(v: u32) -> i32 {\n\n // source: http://github.com/google/protobuf/blob/a7252bf42df8f0841cf3a0c85fdbf1a5172adecb/java/core/src/main/java/com/google/protobuf/CodedInputStream.java#L553\n\n ((v >> 1) ^ (-((v & 1) as i32)) as u32) as i32\n\n}\n\n\n","file_path":"sigma-ser/src/zig_zag_encode.rs","rank":44,"score":113375.03674928242},{"content":"/// Decode a signed value previously ZigZag-encoded with [`encode_i64`]\n\n/// see https://developers.google.com/protocol-buffers/docs/encoding#types\n\npub fn decode_u64(v: u64) -> i64 {\n\n // source: http://github.com/google/protobuf/blob/a7252bf42df8f0841cf3a0c85fdbf1a5172adecb/java/core/src/main/java/com/google/protobuf/CodedInputStream.java#L566\n\n ((v >> 1) ^ (-((v & 1) as i64)) as u64) as i64\n\n}\n\n#[cfg(test)]\n\nmod tests {\n\n use super::*;\n\n\n\n #[allow(overflowing_literals)]\n\n #[test]\n\n fn test_expected_values() {\n\n // source: http://github.com/google/protobuf/blob/a7252bf42df8f0841cf3a0c85fdbf1a5172adecb/java/core/src/test/java/com/google/protobuf/CodedOutputStreamTest.java#L281\n\n assert_eq!(0, encode_i32(0));\n\n assert_eq!(1, encode_i32(-1));\n\n assert_eq!(2, encode_i32(1));\n\n assert_eq!(3, encode_i32(-2));\n\n assert_eq!(0x7FFF_FFFE, encode_i32(0x3FFF_FFFF));\n\n assert_eq!(0x7FFF_FFFF, encode_i32(0xC000_0000));\n\n assert_eq!(0xFFFF_FFFE, encode_i32(0x7FFF_FFFF));\n\n assert_eq!(0xFFFF_FFFF, encode_i32(0x8000_0000));\n","file_path":"sigma-ser/src/zig_zag_encode.rs","rank":45,"score":113375.03674928242},{"content":"pub trait Evaluator {\n\n fn reduce_to_crypto(&self, expr: &Expr, env: &Env) -> Result<ReductionResult, EvalError> {\n\n let mut ca = CostAccumulator::new(0, None);\n\n eval(expr, env, &mut ca).and_then(|v| match v {\n\n Value::Boolean(b) => Ok(ReductionResult {\n\n sigma_prop: SigmaBoolean::TrivialProp(b),\n\n cost: 0,\n\n }),\n\n Value::SigmaProp(sb) => Ok(ReductionResult {\n\n sigma_prop: *sb,\n\n cost: 0,\n\n }),\n\n _ => Err(EvalError::InvalidResultType),\n\n })\n\n }\n\n}\n\n\n","file_path":"sigma-tree/src/eval.rs","rank":46,"score":110591.21666816529},{"content":"/// serialization roundtrip\n\npub fn sigma_serialize_roundtrip<T: crate::serializer::SigmaSerializable>(v: &T) -> T {\n\n let mut data = Vec::new();\n\n v.sigma_serialize(&mut data).expect(\"serialization failed\");\n\n let cursor = Cursor::new(&mut data[..]);\n\n let mut reader = PeekableReader::new(cursor);\n\n T::sigma_parse(&mut reader).expect(\"parse failed\")\n\n}\n","file_path":"sigma-ser/src/test_helpers.rs","rank":47,"score":107673.6881738675},{"content":"/// Conversion to SType\n\npub trait LiftIntoSType {\n\n /// get SType\n\n fn stype() -> SType;\n\n}\n\n\n\nimpl<T: LiftIntoSType> LiftIntoSType for Vec<T> {\n\n fn stype() -> SType {\n\n SType::SColl(Box::new(T::stype()))\n\n }\n\n}\n\n\n\nimpl LiftIntoSType for bool {\n\n fn stype() -> SType {\n\n SType::SBoolean\n\n }\n\n}\n\n\n\nimpl LiftIntoSType for i8 {\n\n fn stype() -> SType {\n\n SType::SByte\n","file_path":"sigma-tree/src/types.rs","rank":48,"score":105828.2680589123},{"content":"/// Marker trait to select types for which CollElems::NonPrimitive is used to store elements as Vec<ConstantVal>\n\npub trait StoredNonPrimitive {}\n\n\n\nimpl StoredNonPrimitive for bool {}\n\nimpl StoredNonPrimitive for i16 {}\n\nimpl StoredNonPrimitive for i32 {}\n\nimpl StoredNonPrimitive for i64 {}\n\n\n\nimpl<T: LiftIntoSType + StoredNonPrimitive + Into<ConstantVal>> Into<ConstantVal> for Vec<T> {\n\n fn into(self) -> ConstantVal {\n\n ConstantVal::Coll(ConstantColl::NonPrimitive {\n\n elem_tpe: T::stype(),\n\n v: self.into_iter().map(|i| i.into()).collect(),\n\n })\n\n }\n\n}\n\n\n\nimpl<T: LiftIntoSType + StoredNonPrimitive + Into<ConstantVal>> Into<Constant> for Vec<T> {\n\n fn into(self) -> Constant {\n\n Constant {\n\n tpe: Self::stype(),\n","file_path":"sigma-tree/src/ast/constant.rs","rank":49,"score":103640.71752145007},{"content":"use super::dlog_group::EcPoint;\n\nuse crate::big_integer::BigInteger;\n\n\n\npub struct FirstDlogProverMessage(EcPoint);\n\npub struct SecondDlogProverMessage(BigInteger);\n\n\n\npub mod interactive_prover {\n\n use super::{FirstDlogProverMessage, SecondDlogProverMessage};\n\n use crate::{\n\n big_integer::BigInteger,\n\n sigma_protocol::{dlog_group, Challenge, DlogProverInput, ProveDlog},\n\n };\n\n\n\n pub fn simulate(\n\n public_input: &ProveDlog,\n\n challenge: &Challenge,\n\n ) -> (FirstDlogProverMessage, SecondDlogProverMessage) {\n\n todo!()\n\n }\n\n\n","file_path":"sigma-tree/src/sigma_protocol/dlog_protocol.rs","rank":50,"score":103559.58389473011},{"content":" pub fn first_message(proposition: &ProveDlog) -> (BigInteger, FirstDlogProverMessage) {\n\n let scalar = dlog_group::random_scalar_in_group_range();\n\n let g = dlog_group::generator();\n\n let a = dlog_group::exponentiate(&g, &scalar);\n\n (scalar.into(), FirstDlogProverMessage(a))\n\n }\n\n\n\n pub fn second_message(\n\n private_input: &DlogProverInput,\n\n rnd: BigInteger,\n\n challenge: &Challenge,\n\n ) -> SecondDlogProverMessage {\n\n todo!()\n\n }\n\n}\n","file_path":"sigma-tree/src/sigma_protocol/dlog_protocol.rs","rank":51,"score":103556.93764173287},{"content":"#[allow(dead_code)]\n\npub fn set_panic_hook() {\n\n // When the `console_error_panic_hook` feature is enabled, we can call the\n\n // `set_panic_hook` function at least once during initialization, and then\n\n // we will get better error messages if our code ever panics.\n\n //\n\n // For more details see\n\n // https://github.com/rustwasm/console_error_panic_hook#readme\n\n #[cfg(feature = \"console_error_panic_hook\")]\n\n console_error_panic_hook::set_once();\n\n}\n","file_path":"bindings/ergo-wallet-lib-wasm/src/utils.rs","rank":52,"score":101352.21596770632},{"content":"use super::op_code::OpCode;\n\nuse crate::sigma_protocol::{\n\n dlog_group::EcPoint, ProveDlog, SigmaBoolean, SigmaProofOfKnowledgeTree,\n\n};\n\nuse sigma_ser::{\n\n serializer::{SerializationError, SigmaSerializable},\n\n vlq_encode,\n\n};\n\nuse std::io;\n\n\n\nimpl SigmaSerializable for SigmaBoolean {\n\n fn sigma_serialize<W: vlq_encode::WriteSigmaVlqExt>(&self, w: &mut W) -> Result<(), io::Error> {\n\n self.op_code().sigma_serialize(w)?;\n\n match self {\n\n SigmaBoolean::ProofOfKnowledge(proof) => match proof {\n\n SigmaProofOfKnowledgeTree::ProveDHTuple { .. } => todo!(),\n\n SigmaProofOfKnowledgeTree::ProveDlog(v) => v.sigma_serialize(w),\n\n },\n\n SigmaBoolean::CAND(_) => todo!(),\n\n SigmaBoolean::TrivialProp(_) => Ok(()), // besides opCode no additional bytes\n","file_path":"sigma-tree/src/serialization/sigmaboolean.rs","rank":65,"score":93760.16782276653},{"content":" }\n\n }\n\n\n\n fn sigma_parse<R: vlq_encode::ReadSigmaVlqExt>(r: &mut R) -> Result<Self, SerializationError> {\n\n let op_code = OpCode::sigma_parse(r)?;\n\n match op_code {\n\n OpCode::PROVE_DLOG => Ok(SigmaBoolean::ProofOfKnowledge(\n\n SigmaProofOfKnowledgeTree::ProveDlog(ProveDlog::sigma_parse(r)?),\n\n )),\n\n _ => todo!(),\n\n }\n\n }\n\n}\n\n\n\nimpl SigmaSerializable for ProveDlog {\n\n fn sigma_serialize<W: vlq_encode::WriteSigmaVlqExt>(&self, w: &mut W) -> Result<(), io::Error> {\n\n self.h.sigma_serialize(w)\n\n }\n\n\n\n fn sigma_parse<R: vlq_encode::ReadSigmaVlqExt>(r: &mut R) -> Result<Self, SerializationError> {\n\n let p = EcPoint::sigma_parse(r)?;\n\n Ok(ProveDlog::new(p))\n\n }\n\n}\n","file_path":"sigma-tree/src/serialization/sigmaboolean.rs","rank":66,"score":93751.81868783914},{"content":"use crate::{chain::ErgoBox, sigma_protocol::SigmaBoolean};\n\nuse std::ops::Add;\n\n\n\n#[allow(dead_code)]\n\npub enum Value {\n\n Boolean(bool),\n\n Byte(i8),\n\n Short(i16),\n\n Int(i32),\n\n Long(i64),\n\n BigInt,\n\n GroupElement,\n\n SigmaProp(Box<SigmaBoolean>),\n\n Box(Box<ErgoBox>),\n\n AvlTree,\n\n Coll(Vec<Value>),\n\n Tup(Vec<Value>),\n\n}\n\n\n\nimpl Value {\n","file_path":"sigma-tree/src/eval/value.rs","rank":67,"score":93679.11921324018},{"content":" #[inline]\n\n pub fn byte(value: i8) -> Self {\n\n Value::Byte(value)\n\n }\n\n}\n\n\n\nimpl Add for Value {\n\n type Output = Self;\n\n fn add(self, other: Self) -> Self {\n\n match (self, other) {\n\n (Value::Byte(s), Value::Byte(o)) => Self::byte(s + o),\n\n _ => todo!(),\n\n }\n\n }\n\n}\n","file_path":"sigma-tree/src/eval/value.rs","rank":68,"score":93670.11107088254},{"content":"use sigma_ser::{\n\n serializer::{SerializationError, SigmaSerializable},\n\n vlq_encode,\n\n};\n\nuse std::io;\n\nuse vlq_encode::WriteSigmaVlqExt;\n\n\n\n#[derive(PartialEq, Eq, Hash, Copy, Clone)]\n\npub struct OpCode(u8);\n\n\n\nimpl OpCode {\n\n pub const LAST_DATA_TYPE: OpCode = OpCode(111);\n\n pub const LAST_CONSTANT_CODE: OpCode = OpCode(Self::LAST_DATA_TYPE.value() + 1);\n\n\n\n pub const FOLD: OpCode = Self::new_op_code(64);\n\n pub const PROVE_DLOG: OpCode = Self::new_op_code(93);\n\n\n\n const fn new_op_code(shift: u8) -> OpCode {\n\n OpCode(Self::LAST_CONSTANT_CODE.value() + shift)\n\n }\n","file_path":"sigma-tree/src/serialization/op_code.rs","rank":69,"score":91145.22622905049},{"content":"\n\n pub fn parse(b: u8) -> OpCode {\n\n OpCode(b)\n\n }\n\n\n\n pub const fn value(self) -> u8 {\n\n self.0\n\n }\n\n}\n\n\n\nimpl SigmaSerializable for OpCode {\n\n fn sigma_serialize<W: WriteSigmaVlqExt>(&self, w: &mut W) -> Result<(), io::Error> {\n\n w.put_u8(self.0)?;\n\n Ok(())\n\n }\n\n fn sigma_parse<R: vlq_encode::ReadSigmaVlqExt>(r: &mut R) -> Result<Self, SerializationError> {\n\n let code = r.get_u8()?;\n\n Ok(OpCode::parse(code))\n\n }\n\n}\n","file_path":"sigma-tree/src/serialization/op_code.rs","rank":70,"score":91144.24305277137},{"content":"//! Transitioning type for Base16 encoded bytes in JSON serialization\n\n\n\n#[cfg(feature = \"with-serde\")]\n\nuse serde::{Deserialize, Serialize};\n\nuse std::convert::TryFrom;\n\n\n\n/// Transitioning type for Base16 encoded bytes\n\n#[cfg_attr(feature = \"with-serde\", derive(Serialize, Deserialize))]\n\n#[cfg_attr(feature = \"with-serde\", serde(into = \"String\"))]\n\n#[derive(PartialEq, Eq, Debug, Clone)]\n\npub struct Base16EncodedBytes(String);\n\n\n\nimpl Base16EncodedBytes {\n\n /// Create from byte array ref (&[u8])\n\n pub fn new<T: ?Sized + AsRef<[u8]>>(input: &T) -> Base16EncodedBytes {\n\n Base16EncodedBytes(base16::encode_lower(input))\n\n }\n\n}\n\n\n\nimpl Into<String> for Base16EncodedBytes {\n","file_path":"sigma-tree/src/chain/base16_bytes.rs","rank":71,"score":91105.97352877635},{"content":" fn into(self) -> String {\n\n self.0\n\n }\n\n}\n\n\n\n/// Transitioning type for Base16 decoded bytes\n\n#[cfg_attr(feature = \"with-serde\", derive(Serialize, Deserialize))]\n\n#[cfg_attr(feature = \"with-serde\", serde(try_from = \"String\"))]\n\n#[derive(PartialEq, Eq, Debug, Clone)]\n\npub struct Base16DecodedBytes(pub Vec<u8>);\n\n\n\nimpl TryFrom<String> for Base16DecodedBytes {\n\n type Error = base16::DecodeError;\n\n fn try_from(str: String) -> Result<Self, Self::Error> {\n\n Ok(Base16DecodedBytes(base16::decode(&str)?))\n\n }\n\n}\n","file_path":"sigma-tree/src/chain/base16_bytes.rs","rank":72,"score":91104.22240508255},{"content":"//! ProverResult\n\nuse sigma_ser::serializer::SerializationError;\n\nuse sigma_ser::serializer::SigmaSerializable;\n\nuse sigma_ser::vlq_encode;\n\nuse std::io;\n\n\n\nuse super::context_extension::ContextExtension;\n\n#[cfg(feature = \"with-serde\")]\n\nuse serde::{Deserialize, Serialize};\n\n\n\n/// Proof of correctness of tx spending\n\n#[derive(Debug, PartialEq, Eq, Clone)]\n\n#[cfg_attr(feature = \"with-serde\", derive(Serialize, Deserialize))]\n\npub struct ProverResult {\n\n /// proof that satisfies final sigma proposition\n\n #[cfg_attr(feature = \"with-serde\", serde(rename = \"proofBytes\"))]\n\n pub proof: Vec<u8>,\n\n /// user-defined variables to be put into context\n\n #[cfg_attr(feature = \"with-serde\", serde(rename = \"extension\"))]\n\n pub extension: ContextExtension,\n","file_path":"sigma-tree/src/chain/prover_result.rs","rank":73,"score":90873.78550028711},{"content":"}\n\n\n\nimpl SigmaSerializable for ProverResult {\n\n fn sigma_serialize<W: vlq_encode::WriteSigmaVlqExt>(&self, w: &mut W) -> Result<(), io::Error> {\n\n w.put_u16(self.proof.len() as u16)?;\n\n w.write_all(&self.proof)?;\n\n self.extension.sigma_serialize(w)?;\n\n Ok(())\n\n }\n\n fn sigma_parse<R: vlq_encode::ReadSigmaVlqExt>(r: &mut R) -> Result<Self, SerializationError> {\n\n let proof_len = r.get_u16()?;\n\n let mut proof = vec![0; proof_len as usize];\n\n r.read_exact(&mut proof)?;\n\n let extension = ContextExtension::sigma_parse(r)?;\n\n Ok(ProverResult { proof, extension })\n\n }\n\n}\n\n\n\n#[cfg(test)]\n\nmod tests {\n","file_path":"sigma-tree/src/chain/prover_result.rs","rank":74,"score":90872.3009561621},{"content":" use super::*;\n\n use proptest::{collection::vec, prelude::*};\n\n use sigma_ser::test_helpers::*;\n\n\n\n impl Arbitrary for ProverResult {\n\n type Parameters = ();\n\n\n\n fn arbitrary_with(_args: Self::Parameters) -> Self::Strategy {\n\n (vec(any::<u8>(), 0..100))\n\n .prop_map(|v| Self {\n\n proof: v,\n\n extension: ContextExtension::empty(),\n\n })\n\n .boxed()\n\n }\n\n\n\n type Strategy = BoxedStrategy<Self>;\n\n }\n\n proptest! {\n\n\n\n #[test]\n\n fn ser_roundtrip(v in any::<ProverResult>()) {\n\n prop_assert_eq![sigma_serialize_roundtrip(&v), v];\n\n }\n\n }\n\n}\n","file_path":"sigma-tree/src/chain/prover_result.rs","rank":75,"score":90870.22102646278},{"content":"pub fn address_delete(address: AddressPtr) {\n\n if !address.is_null() {\n\n let boxed = unsafe { Box::from_raw(address) };\n\n std::mem::drop(boxed);\n\n }\n\n}\n","file_path":"bindings/ergo-wallet-lib-c-core/src/lib.rs","rank":76,"score":90512.35178426781},{"content":"impl SigmaSerializable for BoxValue {\n\n fn sigma_serialize<W: vlq_encode::WriteSigmaVlqExt>(&self, w: &mut W) -> Result<(), io::Error> {\n\n w.put_u64(self.0)\n\n }\n\n fn sigma_parse<R: vlq_encode::ReadSigmaVlqExt>(r: &mut R) -> Result<Self, SerializationError> {\n\n let v = r.get_u64()?;\n\n Ok(BoxValue(v))\n\n }\n\n}\n\n\n\n#[cfg(test)]\n\nmod tests {\n\n use super::*;\n\n use proptest::{arbitrary::Arbitrary, prelude::*};\n\n\n\n impl Arbitrary for BoxValue {\n\n type Parameters = ();\n\n type Strategy = BoxedStrategy<Self>;\n\n fn arbitrary_with(_args: Self::Parameters) -> Self::Strategy {\n\n (1..i64::MAX).prop_map(|v| BoxValue(v as u64)).boxed()\n\n }\n\n }\n\n}\n","file_path":"sigma-tree/src/chain/ergo_box/box_value.rs","rank":77,"score":86290.55009248243},{"content":"//! Box value newtype\n\n\n\n#[cfg(feature = \"with-serde\")]\n\nuse serde::{Deserialize, Serialize};\n\nuse sigma_ser::serializer::{SerializationError, SigmaSerializable};\n\nuse sigma_ser::vlq_encode;\n\nuse std::{convert::TryFrom, io};\n\n\n\n/// Box value\n\n#[derive(PartialEq, Eq, Hash, Debug, Clone)]\n\n#[cfg_attr(feature = \"with-serde\", derive(Serialize, Deserialize))]\n\npub struct BoxValue(u64);\n\n\n\nimpl BoxValue {\n\n const MIN_RAW: u64 = 1;\n\n const MAX_RAW: u64 = i64::MAX as u64;\n\n\n\n /// Minimal value\n\n pub const MIN: BoxValue = BoxValue(BoxValue::MIN_RAW);\n\n\n","file_path":"sigma-tree/src/chain/ergo_box/box_value.rs","rank":78,"score":86288.76558877125},{"content":" /// Create from u64 with bounds check\n\n pub fn new(v: u64) -> Result<BoxValue, BoxValueError> {\n\n BoxValue::try_from(v)\n\n }\n\n\n\n /// Check if a value is in bounds\n\n pub fn within_bounds(v: u64) -> bool {\n\n v >= BoxValue::MIN_RAW && v <= BoxValue::MAX_RAW\n\n }\n\n\n\n /// Get u64 value\n\n pub fn value(&self) -> u64 {\n\n self.0\n\n }\n\n}\n\n\n\n/// BoxValue errors\n\n#[derive(PartialEq, Eq, Debug, Clone)]\n\npub enum BoxValueError {\n\n /// Value is out of bounds\n","file_path":"sigma-tree/src/chain/ergo_box/box_value.rs","rank":79,"score":86284.22098746832},{"content":" OutOfBounds,\n\n}\n\n\n\nimpl TryFrom<u64> for BoxValue {\n\n type Error = BoxValueError;\n\n fn try_from(v: u64) -> Result<Self, Self::Error> {\n\n if BoxValue::within_bounds(v) {\n\n Ok(BoxValue(v))\n\n } else {\n\n Err(BoxValueError::OutOfBounds)\n\n }\n\n }\n\n}\n\n\n\nimpl Into<u64> for BoxValue {\n\n fn into(self) -> u64 {\n\n self.0\n\n }\n\n}\n\n\n","file_path":"sigma-tree/src/chain/ergo_box/box_value.rs","rank":80,"score":86273.21533300132},{"content":"class OutputBoxes {\n\n internal var pointer: OutputBoxesPtr\n\n\n\n init(box: ErgoBoxCandidate) throws {\n\n var ptr: OutputBoxesPtr?\n\n let error = ergo_wallet_output_boxes_new(box.pointer, &ptr)\n\n try checkError(error)\n\n self.pointer = ptr!\n\n }\n\n\n\n deinit {\n\n ergo_wallet_output_boxes_delete(self.pointer)\n\n }\n\n}\n\n\n","file_path":"bindings/ergo-wallet-lib-ios/Sources/ErgoWallet/ErgoWallet.swift","rank":81,"score":84905.9088467529},{"content":"// Tries to get meaningful description from panic-error.\n\npub fn any_to_string(any: &Box<dyn Any + Send>) -> String {\n\n if let Some(s) = any.downcast_ref::<&str>() {\n\n s.to_string()\n\n } else if let Some(s) = any.downcast_ref::<String>() {\n\n s.clone()\n\n } else if let Some(error) = any.downcast_ref::<Box<dyn std::error::Error + Send>>() {\n\n error.to_string()\n\n } else {\n\n \"Unknown error occurred\".to_string()\n\n }\n\n}\n\n\n\n#[cfg(test)]\n\nmod tests {\n\n use super::*;\n\n use std::error::Error;\n\n use std::panic;\n\n\n\n #[test]\n\n fn str_any() {\n","file_path":"bindings/ergo-wallet-lib-android/src/main/rust/exception.rs","rank":82,"score":78793.44584052754},{"content":"/// A wrapper around any struct implementing the `Read` trait, additionally\n\n/// allowing for `peek` operations to be performed. Therefore, the\n\n/// `PeekableReader` struct also implements the `Read` trait.\n\n///\n\n/// The primary invariant of the `PeekableReader` is that after calling the\n\n/// `peek` method, the next `read_byte` call will return the same result as\n\n/// the `peek` does. When the result is a byte (read off the wrapped reader),\n\n/// any read-type method of the `Reader` trait will include the byte as the\n\n/// first one. On the other hand, if the result is an `io::Error`, the error\n\n/// will be returned regardless of which read-type method of the `Reader` is\n\n/// invoked. Consecutive `peek`s before any read-type operation is used\n\n/// always return the same `io::Result`.\n\n///\n\npub trait Peekable: Read {\n\n /// When using peek_u8 you will get a Result<u8, &Error>, while when you call\n\n /// any of the `Read` functions you will get an io::Result<u8>, thereby\n\n /// consuming the io::Error (if any.)\n\n fn peek_u8(&mut self) -> Result<u8, &Error>;\n\n}\n\n\n\nimpl<R: Read> Peekable for PeekableReader<R> {\n\n /// Returns the `io::Result` which the Reader will return on the next\n\n /// `get_byte` call.\n\n ///\n\n /// If the `io::Result` is indeed an `io::Error`, the error will be returned\n\n /// for any subsequent read operation invoked upon the `Read`er.\n\n fn peek_u8(&mut self) -> Result<u8, &Error> {\n\n // Return either the currently cached peeked byte or obtain a new one\n\n // from the underlying reader.\n\n match self.peeked_result {\n\n Some(Ok(x)) => Ok(x),\n\n Some(Err(ref e)) => Err(e),\n\n None => {\n","file_path":"sigma-ser/src/peekable_reader.rs","rank":83,"score":75564.83631597302},{"content":"/// Write encoded unsigned values using VLQ and signed values first with ZigZag, then using VLQ\n\n/// for VLQ see [[https://en.wikipedia.org/wiki/Variable-length_quantity]]\n\n/// for ZigZag see https://developers.google.com/protocol-buffers/docs/encoding#types\n\npub trait WriteSigmaVlqExt: io::Write {\n\n /// Write i8 without encoding\n\n fn put_i8(&mut self, v: i8) -> io::Result<()> {\n\n Self::put_u8(self, v as u8)\n\n }\n\n\n\n /// Write u8 without encoding\n\n fn put_u8(&mut self, v: u8) -> io::Result<()> {\n\n self.write_all(&[v])\n\n }\n\n\n\n /// Encode using ZigZag and then VLQ.\n\n fn put_i16(&mut self, v: i16) -> io::Result<()> {\n\n Self::put_u32(self, zig_zag_encode::encode_i32(v as i32))\n\n }\n\n\n\n /// Encode using VLQ.\n\n fn put_u16(&mut self, v: u16) -> io::Result<()> {\n\n Self::put_u64(self, v as u64)\n\n }\n","file_path":"sigma-ser/src/vlq_encode.rs","rank":84,"score":75482.89445492288},{"content":"/// Read and decode values using VLQ (+ ZigZag for signed values) encoded and written with [`WriteSigmaVlqExt`]\n\n/// for VLQ see [[https://en.wikipedia.org/wiki/Variable-length_quantity]]\n\n/// for ZigZag see https://developers.google.com/protocol-buffers/docs/encoding#types\n\npub trait ReadSigmaVlqExt: peekable_reader::Peekable {\n\n /// Read i8 without decoding\n\n fn get_i8(&mut self) -> Result<i8, io::Error> {\n\n Self::get_u8(self).map(|v| v as i8)\n\n }\n\n\n\n /// Read u8 without decoding\n\n fn get_u8(&mut self) -> std::result::Result<u8, io::Error> {\n\n let mut slice = [0u8; 1];\n\n self.read_exact(&mut slice)?;\n\n Ok(slice[0])\n\n }\n\n\n\n /// Read and decode using VLQ and ZigZag value written with [`WriteSigmaVlqExt::put_i16`]\n\n fn get_i16(&mut self) -> Result<i16, VlqEncodingError> {\n\n Self::get_u32(self).and_then(|v| {\n\n let vd = zig_zag_encode::decode_u32(v);\n\n i16::try_from(vd).map_err(VlqEncodingError::TryFrom)\n\n })\n\n }\n","file_path":"sigma-ser/src/vlq_encode.rs","rank":85,"score":74328.58198814924},{"content":"#[allow(dead_code)]\n\npub fn unwrap_exc_or_default<T: Default>(env: &JNIEnv, res: ExceptionResult<T>) -> T {\n\n unwrap_exc_or(env, res, T::default())\n\n}\n\n\n","file_path":"bindings/ergo-wallet-lib-android/src/main/rust/exception.rs","rank":86,"score":67504.29583301273},{"content":"// Returns value or \"throws\" exception. `error_val` is returned, because exception will be thrown\n\n// at the Java side. So this function should be used only for the `panic::catch_unwind` result.\n\npub fn unwrap_exc_or<T>(env: &JNIEnv, res: ExceptionResult<T>, error_val: T) -> T {\n\n match res {\n\n Ok(val) => {\n\n match val {\n\n Ok(val) => val,\n\n Err(jni_error) => {\n\n // Do nothing if there is a pending Java-exception that will be thrown\n\n // automatically by the JVM when the native method returns.\n\n if !env.exception_check().unwrap() {\n\n // Throw a Java exception manually in case of an internal error.\n\n throw(env, &jni_error.to_string())\n\n }\n\n error_val\n\n }\n\n }\n\n }\n\n Err(ref e) => {\n\n throw(env, &any_to_string(e));\n\n error_val\n\n }\n\n }\n\n}\n\n\n\n// Same as `unwrap_exc_or` but returns default value.\n","file_path":"bindings/ergo-wallet-lib-android/src/main/rust/exception.rs","rank":87,"score":65457.556864192375},{"content":" pub fn with_segregation(_: Rc<Expr>) -> ErgoTree {\n\n todo!()\n\n }\n\n}\n\n\n\nimpl From<Rc<Expr>> for ErgoTree {\n\n fn from(expr: Rc<Expr>) -> Self {\n\n match expr.as_ref() {\n\n Expr::Const(Constant { tpe, .. }) if *tpe == SType::SSigmaProp => {\n\n ErgoTree::without_segregation(expr)\n\n }\n\n _ => ErgoTree::with_segregation(expr),\n\n }\n\n }\n\n}\n\nimpl SigmaSerializable for ErgoTreeHeader {\n\n fn sigma_serialize<W: WriteSigmaVlqExt>(&self, w: &mut W) -> Result<(), io::Error> {\n\n w.put_u8(self.0)?;\n\n Ok(())\n\n }\n","file_path":"sigma-tree/src/ergo_tree.rs","rank":88,"score":64578.35108023852},{"content":" fn sigma_parse<R: ReadSigmaVlqExt>(r: &mut R) -> Result<Self, SerializationError> {\n\n let header = r.get_u8()?;\n\n Ok(ErgoTreeHeader(header))\n\n }\n\n}\n\n\n\nimpl SigmaSerializable for ErgoTree {\n\n fn sigma_serialize<W: WriteSigmaVlqExt>(&self, w: &mut W) -> Result<(), io::Error> {\n\n self.header.sigma_serialize(w)?;\n\n match &self.tree {\n\n Ok(ParsedTree { constants, root }) => {\n\n if self.header.is_constant_segregation() {\n\n w.put_usize_as_u32(constants.len())?;\n\n assert!(\n\n constants.is_empty(),\n\n \"separate constants serialization is not yet supported\"\n\n );\n\n }\n\n match root {\n\n Ok(expr) => expr.sigma_serialize(w)?,\n","file_path":"sigma-tree/src/ergo_tree.rs","rank":89,"score":64572.65151070547},{"content":"#[derive(PartialEq, Eq, Debug, Clone)]\n\npub struct ErgoTreeRootParsingError {\n\n /// Ergo tree root expr bytes (faild to deserialize)\n\n pub bytes: Vec<u8>,\n\n /// Deserialization error\n\n pub error: SerializationError,\n\n}\n\n\n\n/// ErgoTree parsing (deserialization) error\n\n#[derive(PartialEq, Eq, Debug, Clone)]\n\npub enum ErgoTreeParsingError {\n\n /// Whole ErgoTree parsing (deserialization) error\n\n TreeParsingError(ErgoTreeConstantsParsingError),\n\n /// ErgoTree root expr parsing (deserialization) error\n\n RootParsingError(ErgoTreeRootParsingError),\n\n}\n\n\n\nimpl ErgoTree {\n\n const DEFAULT_HEADER: ErgoTreeHeader = ErgoTreeHeader(0);\n\n\n","file_path":"sigma-tree/src/ergo_tree.rs","rank":90,"score":64570.58744980605},{"content":" Ok(ErgoTree {\n\n header,\n\n tree: Ok(ParsedTree {\n\n constants,\n\n root: Ok(Rc::new(root)),\n\n }),\n\n })\n\n }\n\n\n\n fn sigma_parse_bytes(mut bytes: Vec<u8>) -> Result<Self, SerializationError> {\n\n let cursor = Cursor::new(&mut bytes[..]);\n\n let mut r = PeekableReader::new(cursor);\n\n let header = ErgoTreeHeader::sigma_parse(&mut r)?;\n\n if header.is_constant_segregation() {\n\n let constants_len = r.get_u32()?;\n\n if constants_len != 0 {\n\n return Ok(ErgoTree {\n\n header,\n\n tree: Err(ErgoTreeConstantsParsingError {\n\n bytes: bytes[1..].to_vec(),\n","file_path":"sigma-tree/src/ergo_tree.rs","rank":91,"score":64569.438522524986},{"content":" error: SerializationError::NotImplementedYet(\n\n \"separate constants serialization is not yet supported\".to_string(),\n\n ),\n\n }),\n\n });\n\n }\n\n }\n\n let constants = Vec::new();\n\n let mut rest_of_the_bytes = Vec::new();\n\n let _ = r.read_to_end(&mut rest_of_the_bytes);\n\n let rest_of_the_bytes_copy = rest_of_the_bytes.clone();\n\n match Expr::sigma_parse_bytes(rest_of_the_bytes) {\n\n Ok(parsed) => Ok(ErgoTree {\n\n header,\n\n tree: Ok(ParsedTree {\n\n constants,\n\n root: Ok(Rc::new(parsed)),\n\n }),\n\n }),\n\n Err(err) => Ok(ErgoTree {\n","file_path":"sigma-tree/src/ergo_tree.rs","rank":92,"score":64568.31162559973},{"content":" Err(ErgoTreeRootParsingError { bytes, .. }) => w.write_all(&bytes[..])?,\n\n }\n\n }\n\n Err(ErgoTreeConstantsParsingError { bytes, .. }) => w.write_all(&bytes[..])?,\n\n }\n\n Ok(())\n\n }\n\n\n\n fn sigma_parse<R: ReadSigmaVlqExt>(r: &mut R) -> Result<Self, SerializationError> {\n\n let header = ErgoTreeHeader::sigma_parse(r)?;\n\n if header.is_constant_segregation() {\n\n let constants_len = r.get_u32()?;\n\n if constants_len != 0 {\n\n return Err(SerializationError::NotImplementedYet(\n\n \"separate constants serialization is not yet supported\".to_string(),\n\n ));\n\n }\n\n }\n\n let constants = Vec::new();\n\n let root = Expr::sigma_parse(r)?;\n","file_path":"sigma-tree/src/ergo_tree.rs","rank":93,"score":64566.57379992548},{"content":" /// get Expr out of ErgoTree\n\n pub fn proposition(&self) -> Result<Rc<Expr>, ErgoTreeParsingError> {\n\n self.tree\n\n .clone()\n\n .map_err(ErgoTreeParsingError::TreeParsingError)\n\n .and_then(|t| t.root.map_err(ErgoTreeParsingError::RootParsingError))\n\n }\n\n\n\n /// Build ErgoTree using expr as is, without constants segregated\n\n pub fn without_segregation(expr: Rc<Expr>) -> ErgoTree {\n\n ErgoTree {\n\n header: ErgoTree::DEFAULT_HEADER,\n\n tree: Ok(ParsedTree {\n\n constants: Vec::new(),\n\n root: Ok(expr),\n\n }),\n\n }\n\n }\n\n\n\n /// Build ErgoTree with constants segregated from expr\n","file_path":"sigma-tree/src/ergo_tree.rs","rank":94,"score":64565.3049188236},{"content":" prop_assert_eq![sigma_serialize_roundtrip(&(v)), v];\n\n }\n\n }\n\n\n\n #[test]\n\n fn deserialization_non_parseable_tree_ok() {\n\n // constants length is set\n\n assert!(ErgoTree::sigma_parse_bytes(vec![0, 1]).is_ok());\n\n }\n\n\n\n #[test]\n\n fn deserialization_non_parseable_root_ok() {\n\n // constants length is zero, but Expr is invalid\n\n assert!(ErgoTree::sigma_parse_bytes(vec![0, 0, 1]).is_ok());\n\n }\n\n\n\n #[test]\n\n fn test_constant_segregation_header_flag_support() {\n\n let encoder = chain::AddressEncoder::new(chain::NetworkPrefix::Mainnet);\n\n let address = encoder\n\n .parse_address_from_str(\"9hzP24a2q8KLPVCUk7gdMDXYc7vinmGuxmLp5KU7k9UwptgYBYV\")\n\n .unwrap();\n\n\n\n let contract = chain::Contract::pay_to_address(address).unwrap();\n\n let bytes = &contract.get_ergo_tree().sigma_serialise_bytes();\n\n assert_eq!(&bytes[..2], vec![0u8, 8u8].as_slice());\n\n }\n\n}\n","file_path":"sigma-tree/src/ergo_tree.rs","rank":95,"score":64565.16805310321},{"content":" header,\n\n tree: Ok(ParsedTree {\n\n constants,\n\n root: Err(ErgoTreeRootParsingError {\n\n bytes: rest_of_the_bytes_copy,\n\n error: err,\n\n }),\n\n }),\n\n }),\n\n }\n\n }\n\n}\n\n\n\n#[cfg(test)]\n\nmod tests {\n\n use super::*;\n\n use crate::{ast::ConstantVal, chain, sigma_protocol::SigmaProp, types::SType};\n\n use proptest::prelude::*;\n\n use sigma_ser::test_helpers::*;\n\n\n","file_path":"sigma-tree/src/ergo_tree.rs","rank":96,"score":64564.009160363144},{"content":"//! ErgoTree\n\nuse crate::{\n\n ast::{Constant, Expr},\n\n types::SType,\n\n};\n\nuse io::{Cursor, Read};\n\nuse sigma_ser::serializer::SerializationError;\n\nuse sigma_ser::serializer::SigmaSerializable;\n\nuse sigma_ser::{peekable_reader::PeekableReader, vlq_encode};\n\nuse std::io;\n\nuse std::rc::Rc;\n\nuse vlq_encode::{ReadSigmaVlqExt, WriteSigmaVlqExt};\n\n\n\n#[derive(PartialEq, Eq, Debug, Clone)]\n","file_path":"sigma-tree/src/ergo_tree.rs","rank":97,"score":64562.33551290245},{"content":" impl Arbitrary for ErgoTree {\n\n type Parameters = ();\n\n type Strategy = BoxedStrategy<Self>;\n\n\n\n fn arbitrary_with(_args: Self::Parameters) -> Self::Strategy {\n\n (any::<SigmaProp>())\n\n .prop_map(|p| {\n\n ErgoTree::from(Rc::new(Expr::Const(Constant {\n\n tpe: SType::SSigmaProp,\n\n v: ConstantVal::SigmaProp(Box::new(p)),\n\n })))\n\n })\n\n .boxed()\n\n }\n\n }\n\n\n\n proptest! {\n\n\n\n #[test]\n\n fn ser_roundtrip(v in any::<ErgoTree>()) {\n","file_path":"sigma-tree/src/ergo_tree.rs","rank":98,"score":64559.99938191821},{"content":"//! AST for ErgoTree\n\nuse crate::{serialization::op_code::OpCode, types::*};\n\nuse core::fmt;\n\nuse Expr::*;\n\n\n\nmod constant;\n\npub mod ops;\n\n\n\npub use constant::*;\n\n\n\n#[derive(PartialEq, Eq, Debug)]\n\n/// newtype for box register id\n\npub struct RegisterId(u8);\n\n\n\n#[derive(PartialEq, Eq, Debug)]\n\n/// Expression in ErgoTree\n\npub enum Expr {\n\n /// Constant value\n\n Const(Constant),\n\n /// Collection of values (same type)\n","file_path":"sigma-tree/src/ast.rs","rank":99,"score":59012.81410275754}],"string":"[\n {\n \"content\": \"/// Creates a random scalar, a big-endian integer in the range [0, n), where n is group order\\n\\npub fn random_scalar_in_group_range() -> Scalar {\\n\\n loop {\\n\\n // Generate a new secret key using the operating system's\\n\\n // cryptographically secure random number generator\\n\\n let sk = k256::SecretKey::generate();\\n\\n let bytes: [u8; 32] = sk\\n\\n .secret_scalar()\\n\\n .as_ref()\\n\\n .as_slice()\\n\\n .try_into()\\n\\n .expect(\\\"expected 32 bytes\\\");\\n\\n // Returns None if the byte array does not contain\\n\\n // a big-endian integer in the range [0, n), where n is group order.\\n\\n let maybe_scalar = Scalar::from_bytes(bytes);\\n\\n if bool::from(maybe_scalar.is_some()) {\\n\\n break maybe_scalar.unwrap();\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"sigma-tree/src/sigma_protocol/dlog_group.rs\",\n \"rank\": 0,\n \"score\": 304795.5759556212\n },\n {\n \"content\": \"/// Creates a random member of this Dlog group\\n\\npub fn random_element() -> EcPoint {\\n\\n let sk = DlogProverInput::random();\\n\\n let bytes = sk.w.to_bytes();\\n\\n let bi = BigInt::from_bytes_be(Sign::Plus, &bytes[..]);\\n\\n\\n\\n exponentiate(&generator(), &sk.w)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"sigma-tree/src/sigma_protocol/dlog_group.rs\",\n \"rank\": 1,\n \"score\": 290281.25990754174\n },\n {\n \"content\": \"pub fn is_identity(ge: &EcPoint) -> bool {\\n\\n *ge == identity()\\n\\n}\\n\\n\\n\",\n \"file_path\": \"sigma-tree/src/sigma_protocol/dlog_group.rs\",\n \"rank\": 4,\n \"score\": 261162.48115587642\n },\n {\n \"content\": \"/// Blake2b256 hash (256 bit)\\n\\npub fn blake2b256_hash(bytes: &[u8]) -> Digest32 {\\n\\n // unwrap is safe 32 bytes is a valid hash size (<= 512 && 32 % 8 == 0)\\n\\n let mut hasher = VarBlake2b::new(Digest32::SIZE).unwrap();\\n\\n hasher.update(bytes);\\n\\n let hash = hasher.finalize_boxed();\\n\\n // unwrap is safe due to hash size is expected to be Digest32::SIZE\\n\\n Digest32(hash.try_into().unwrap())\\n\\n}\\n\\n\\n\\nimpl From<[u8; Digest32::SIZE]> for Digest32 {\\n\\n fn from(bytes: [u8; Digest32::SIZE]) -> Self {\\n\\n Digest32(Box::new(bytes))\\n\\n }\\n\\n}\\n\\n\\n\\nimpl Into<Base16EncodedBytes> for Digest32 {\\n\\n fn into(self) -> Base16EncodedBytes {\\n\\n Base16EncodedBytes::new(self.0.as_ref())\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"sigma-tree/src/chain/digest32.rs\",\n \"rank\": 6,\n \"score\": 248194.5878895931\n },\n {\n \"content\": \"/// Raises the base GroupElement to the exponent. The result is another GroupElement.\\n\\npub fn exponentiate(base: &EcPoint, exponent: &Scalar) -> EcPoint {\\n\\n if !is_identity(base) {\\n\\n // implement for negative exponent\\n\\n // see reference impl https://github.com/ScorexFoundation/sigmastate-interpreter/blob/ec71a6f988f7412bc36199f46e7ad8db643478c7/sigmastate/src/main/scala/sigmastate/basics/BcDlogGroup.scala#L201\\n\\n // see https://github.com/ergoplatform/sigma-rust/issues/36\\n\\n\\n\\n // we treat EC as a multiplicative group, therefore, exponentiate point is multiply.\\n\\n EcPoint(base.0 * exponent)\\n\\n } else {\\n\\n base.clone()\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"sigma-tree/src/sigma_protocol/dlog_group.rs\",\n \"rank\": 7,\n \"score\": 246609.0916878886\n },\n {\n \"content\": \"/// The generator g of the group is an element of the group such that, when written multiplicatively, every element\\n\\n/// of the group is a power of g.\\n\\npub fn generator() -> EcPoint {\\n\\n EcPoint(ProjectivePoint::generator())\\n\\n}\\n\\n\\n\\n/// the identity(infinity) element of this Dlog group\\n\\npub const fn identity() -> EcPoint {\\n\\n EcPoint(ProjectivePoint::identity())\\n\\n}\\n\\n\\n\",\n \"file_path\": \"sigma-tree/src/sigma_protocol/dlog_group.rs\",\n \"rank\": 8,\n \"score\": 233539.662568651\n },\n {\n \"content\": \"pub trait Prover: Evaluator {\\n\\n fn secrets(&self) -> &[PrivateInput];\\n\\n\\n\\n fn prove(\\n\\n &self,\\n\\n tree: &ErgoTree,\\n\\n env: &Env,\\n\\n message: &[u8],\\n\\n ) -> Result<ProverResult, ProverError> {\\n\\n let expr = tree.proposition()?;\\n\\n let proof = self\\n\\n .reduce_to_crypto(expr.as_ref(), env)\\n\\n .map_err(ProverError::EvalError)\\n\\n .and_then(|v| match v.sigma_prop {\\n\\n SigmaBoolean::TrivialProp(true) => Ok(UncheckedTree::NoProof),\\n\\n SigmaBoolean::TrivialProp(false) => Err(ProverError::ReducedToFalse),\\n\\n sb => {\\n\\n let tree = self.convert_to_unproven(sb);\\n\\n let unchecked_tree = self.prove_to_unchecked(tree, message)?;\\n\\n Ok(UncheckedTree::UncheckedSigmaTree(unchecked_tree))\\n\",\n \"file_path\": \"sigma-tree/src/sigma_protocol/prover.rs\",\n \"rank\": 9,\n \"score\": 201430.14083236712\n },\n {\n \"content\": \"fn get_embeddable_type(code: u8) -> Result<SType, SerializationError> {\\n\\n match TypeCode::new(code) {\\n\\n TypeCode::SBOOLEAN => Ok(SType::SBoolean),\\n\\n TypeCode::SBYTE => Ok(SType::SByte),\\n\\n TypeCode::SSHORT => Ok(SType::SShort),\\n\\n TypeCode::SINT => Ok(SType::SInt),\\n\\n TypeCode::SLONG => Ok(SType::SLong),\\n\\n TypeCode::SBIGINT => Ok(SType::SBigInt),\\n\\n TypeCode::SGROUP_ELEMENT => Ok(SType::SGroupElement),\\n\\n TypeCode::SSIGMAPROP => Ok(SType::SSigmaProp),\\n\\n _ => Err(SerializationError::InvalidOpCode),\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"sigma-tree/src/serialization/types.rs\",\n \"rank\": 10,\n \"score\": 199649.98139593913\n },\n {\n \"content\": \"pub trait Verifier: Evaluator {\\n\\n fn verify(\\n\\n &mut self,\\n\\n tree: &ErgoTree,\\n\\n env: &Env,\\n\\n proof: &[u8],\\n\\n message: &[u8],\\n\\n ) -> Result<VerificationResult, VerifierError> {\\n\\n let expr = tree.proposition()?;\\n\\n let cprop = self.reduce_to_crypto(expr.as_ref(), env)?.sigma_prop;\\n\\n let res: bool = match cprop {\\n\\n SigmaBoolean::TrivialProp(b) => b,\\n\\n sb => todo!(),\\n\\n };\\n\\n Ok(VerificationResult {\\n\\n result: res,\\n\\n cost: 0,\\n\\n })\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"sigma-tree/src/sigma_protocol/verifier.rs\",\n \"rank\": 11,\n \"score\": 182454.27450487658\n },\n {\n \"content\": \"/// Box serialization with token ids optionally saved in transaction\\n\\n/// (in this case only token index is saved)\\n\\npub fn serialize_box_with_indexed_digests<W: vlq_encode::WriteSigmaVlqExt>(\\n\\n box_value: &BoxValue,\\n\\n ergo_tree_bytes: Vec<u8>,\\n\\n tokens: &[TokenAmount],\\n\\n additional_registers: &NonMandatoryRegisters,\\n\\n creation_height: u32,\\n\\n token_ids_in_tx: Option<&IndexSet<TokenId>>,\\n\\n w: &mut W,\\n\\n) -> Result<(), io::Error> {\\n\\n // reference implementation - https://github.com/ScorexFoundation/sigmastate-interpreter/blob/9b20cb110effd1987ff76699d637174a4b2fb441/sigmastate/src/main/scala/org/ergoplatform/ErgoBoxCandidate.scala#L95-L95\\n\\n box_value.sigma_serialize(w)?;\\n\\n w.write_all(&ergo_tree_bytes[..])?;\\n\\n w.put_u32(creation_height)?;\\n\\n w.put_u8(u8::try_from(tokens.len()).unwrap())?;\\n\\n\\n\\n tokens.iter().try_for_each(|t| {\\n\\n match token_ids_in_tx {\\n\\n Some(token_ids) => w.put_u32(\\n\\n u32::try_from(\\n\\n token_ids\\n\",\n \"file_path\": \"sigma-tree/src/serialization/ergo_box.rs\",\n \"rank\": 12,\n \"score\": 173133.05255750826\n },\n {\n \"content\": \"#[derive(PartialEq, Eq, Debug, Clone)]\\n\\nstruct ErgoTreeHeader(u8);\\n\\n\\n\\nimpl ErgoTreeHeader {\\n\\n const CONSTANT_SEGREGATION_FLAG: u8 = 0x10;\\n\\n\\n\\n pub fn is_constant_segregation(&self) -> bool {\\n\\n self.0 & ErgoTreeHeader::CONSTANT_SEGREGATION_FLAG != 0\\n\\n }\\n\\n}\\n\\n\\n\\n/// Whole ErgoTree parsing (deserialization) error\\n\\n#[derive(PartialEq, Eq, Debug, Clone)]\\n\\npub struct ErgoTreeConstantsParsingError {\\n\\n /// Ergo tree bytes (faild to deserialize)\\n\\n pub bytes: Vec<u8>,\\n\\n /// Deserialization error\\n\\n pub error: SerializationError,\\n\\n}\\n\\n\\n\\n/// ErgoTree root expr parsing (deserialization) error\\n\",\n \"file_path\": \"sigma-tree/src/ergo_tree.rs\",\n \"rank\": 13,\n \"score\": 171467.29386373737\n },\n {\n \"content\": \"pub fn serialize_bytes<S, T>(bytes: T, serializer: S) -> Result<S::Ok, S::Error>\\n\\nwhere\\n\\n S: Serializer,\\n\\n T: AsRef<[u8]>,\\n\\n{\\n\\n serializer.serialize_str(&base16::encode_lower(bytes.as_ref()))\\n\\n}\\n\\n\\n\\npub mod ergo_tree {\\n\\n\\n\\n use super::*;\\n\\n use crate::ErgoTree;\\n\\n use serde::{Deserialize, Deserializer, Serializer};\\n\\n use sigma_ser::serializer::SigmaSerializable;\\n\\n\\n\\n pub fn serialize<S>(ergo_tree: &ErgoTree, serializer: S) -> Result<S::Ok, S::Error>\\n\\n where\\n\\n S: Serializer,\\n\\n {\\n\\n let bytes = ergo_tree.sigma_serialise_bytes();\\n\",\n \"file_path\": \"sigma-tree/src/chain/json.rs\",\n \"rank\": 14,\n \"score\": 145282.7728311161\n },\n {\n \"content\": \"fn is_stype_embeddable(tpe: &SType) -> bool {\\n\\n match tpe {\\n\\n SType::SBoolean => true,\\n\\n SType::SByte => true,\\n\\n SType::SShort => true,\\n\\n SType::SInt => true,\\n\\n SType::SLong => true,\\n\\n SType::SBigInt => true,\\n\\n SType::SGroupElement => true,\\n\\n SType::SSigmaProp => true,\\n\\n _ => false,\\n\\n }\\n\\n}\\n\\n\\n\\nimpl SigmaSerializable for SType {\\n\\n fn sigma_serialize<W: WriteSigmaVlqExt>(&self, w: &mut W) -> Result<(), io::Error> {\\n\\n // for reference see http://github.com/ScorexFoundation/sigmastate-interpreter/blob/25251c1313b0131835f92099f02cef8a5d932b5e/sigmastate/src/main/scala/sigmastate/serialization/TypeSerializer.scala#L25-L25\\n\\n match self {\\n\\n SType::SAny => self.type_code().sigma_serialize(w),\\n\\n\\n\",\n \"file_path\": \"sigma-tree/src/serialization/types.rs\",\n \"rank\": 15,\n \"score\": 144069.00610777322\n },\n {\n \"content\": \"#[allow(unconditional_recursion)]\\n\\nfn eval(expr: &Expr, env: &Env, ca: &mut CostAccumulator) -> Result<Value, EvalError> {\\n\\n match expr {\\n\\n Expr::Const(Constant {\\n\\n tpe: SType::SBoolean,\\n\\n v: ConstantVal::Boolean(b),\\n\\n }) => Ok(Value::Boolean(*b)),\\n\\n Expr::Const(Constant {\\n\\n tpe: SType::SSigmaProp,\\n\\n v: ConstantVal::SigmaProp(sp),\\n\\n }) => Ok(Value::SigmaProp(Box::new((*sp.value()).clone()))),\\n\\n Expr::Coll { .. } => todo!(),\\n\\n Expr::Tup { .. } => todo!(),\\n\\n Expr::PredefFunc(_) => todo!(),\\n\\n Expr::CollM(_) => todo!(),\\n\\n Expr::BoxM(_) => todo!(),\\n\\n Expr::CtxM(_) => todo!(),\\n\\n Expr::MethodCall { .. } => todo!(),\\n\\n Expr::BinOp(bin_op, l, r) => {\\n\\n let v_l = eval(l, env, ca)?;\\n\\n let v_r = eval(r, env, ca)?;\\n\",\n \"file_path\": \"sigma-tree/src/eval.rs\",\n \"rank\": 16,\n \"score\": 143356.5365707662\n },\n {\n \"content\": \"//! Verifier\\n\\n\\n\\n#![allow(dead_code)]\\n\\n#![allow(unused_variables)]\\n\\n#![allow(missing_docs)]\\n\\n\\n\\nuse super::SigmaBoolean;\\n\\nuse crate::{\\n\\n eval::{Env, EvalError, Evaluator},\\n\\n ErgoTree, ErgoTreeParsingError,\\n\\n};\\n\\n\\n\\npub enum VerifierError {\\n\\n ErgoTreeError(ErgoTreeParsingError),\\n\\n EvalError(EvalError),\\n\\n}\\n\\n\\n\\nimpl From<ErgoTreeParsingError> for VerifierError {\\n\\n fn from(err: ErgoTreeParsingError) -> Self {\\n\\n VerifierError::ErgoTreeError(err)\\n\",\n \"file_path\": \"sigma-tree/src/sigma_protocol/verifier.rs\",\n \"rank\": 17,\n \"score\": 132343.50952893982\n },\n {\n \"content\": \" }\\n\\n}\\n\\n\\n\\nimpl From<EvalError> for VerifierError {\\n\\n fn from(err: EvalError) -> Self {\\n\\n VerifierError::EvalError(err)\\n\\n }\\n\\n}\\n\\n\\n\\npub struct VerificationResult {\\n\\n result: bool,\\n\\n cost: u64,\\n\\n}\\n\\n\\n\",\n \"file_path\": \"sigma-tree/src/sigma_protocol/verifier.rs\",\n \"rank\": 18,\n \"score\": 132336.48822234911\n },\n {\n \"content\": \"\\n\\nimpl Evaluator for TestProver {}\\n\\nimpl Prover for TestProver {\\n\\n fn secrets(&self) -> &[PrivateInput] {\\n\\n self.secrets.as_ref()\\n\\n }\\n\\n}\\n\\n\\n\\n#[derive(PartialEq, Eq, Debug, Clone)]\\n\\npub enum ProverError {\\n\\n ErgoTreeError(ErgoTreeParsingError),\\n\\n EvalError(EvalError),\\n\\n ReducedToFalse,\\n\\n TreeRootIsNotReal,\\n\\n SimulatedLeafWithoutChallenge,\\n\\n RealUnprovenTreeWithoutChallenge,\\n\\n SecretNotFound,\\n\\n}\\n\\n\\n\\nimpl From<ErgoTreeParsingError> for ProverError {\\n\\n fn from(err: ErgoTreeParsingError) -> Self {\\n\\n ProverError::ErgoTreeError(err)\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"sigma-tree/src/sigma_protocol/prover.rs\",\n \"rank\": 19,\n \"score\": 132090.0939276574\n },\n {\n \"content\": \"//! Interpreter with enhanced functionality to prove statements.\\n\\n\\n\\n#![allow(dead_code)]\\n\\n#![allow(unused_variables)]\\n\\n#![allow(missing_docs)]\\n\\n\\n\\nuse super::{\\n\\n dlog_protocol, fiat_shamir_hash_fn, fiat_shamir_tree_to_bytes, serialize_sig, Challenge,\\n\\n PrivateInput, ProofTree, SigmaBoolean, SigmaProofOfKnowledgeTree, UncheckedLeaf,\\n\\n UncheckedSchnorr, UncheckedSigmaTree, UncheckedTree, UnprovenSchnorr, UnprovenTree,\\n\\n};\\n\\nuse crate::{\\n\\n chain::{ContextExtension, ProverResult},\\n\\n eval::{Env, EvalError, Evaluator},\\n\\n ErgoTree, ErgoTreeParsingError,\\n\\n};\\n\\n\\n\\npub struct TestProver {\\n\\n pub secrets: Vec<PrivateInput>,\\n\\n}\\n\",\n \"file_path\": \"sigma-tree/src/sigma_protocol/prover.rs\",\n \"rank\": 20,\n \"score\": 132086.3459287251\n },\n {\n \"content\": \" // and the message being signed.\\n\\n s.append(&mut message.to_vec());\\n\\n let root_challenge = fiat_shamir_hash_fn(s.as_slice());\\n\\n let step8 = step6.with_challenge(Challenge(root_challenge));\\n\\n\\n\\n // Prover Step 9: complete the proof by computing challenges at real nodes and additionally responses at real leaves\\n\\n let step9 = self.proving(step8)?;\\n\\n\\n\\n // Prover Step 10: output the right information into the proof\\n\\n match step9 {\\n\\n ProofTree::UncheckedTree(UncheckedTree::UncheckedSigmaTree(tree)) => Ok(tree),\\n\\n _ => todo!(),\\n\\n }\\n\\n }\\n\\n\\n\\n /**\\n\\n Prover Step 1: This step will mark as \\\"real\\\" every node for which the prover can produce a real proof.\\n\\n This step may mark as \\\"real\\\" more nodes than necessary if the prover has more than the minimal\\n\\n necessary number of witnesses (for example, more than one child of an OR).\\n\\n This will be corrected in the next step.\\n\",\n \"file_path\": \"sigma-tree/src/sigma_protocol/prover.rs\",\n \"rank\": 21,\n \"score\": 132085.12741664032\n },\n {\n \"content\": \" match tree {\\n\\n ProofTree::UncheckedTree(_) => Ok(tree),\\n\\n ProofTree::UnprovenTree(unproven_tree) => match unproven_tree {\\n\\n UnprovenTree::UnprovenSchnorr(us) if unproven_tree.real() => {\\n\\n if let Some(challenge) = us.challenge_opt.clone() {\\n\\n if let Some(priv_key) = self\\n\\n .secrets()\\n\\n .iter()\\n\\n .flat_map(|s| match s {\\n\\n PrivateInput::DlogProverInput(dl) => vec![dl],\\n\\n _ => vec![],\\n\\n })\\n\\n .find(|prover_input| prover_input.public_image() == us.proposition)\\n\\n {\\n\\n let z = dlog_protocol::interactive_prover::second_message(\\n\\n &priv_key,\\n\\n us.randomness_opt.unwrap(),\\n\\n &challenge,\\n\\n );\\n\\n Ok(ProofTree::UncheckedTree(UncheckedTree::UncheckedSigmaTree(\\n\",\n \"file_path\": \"sigma-tree/src/sigma_protocol/prover.rs\",\n \"rank\": 22,\n \"score\": 132083.74330649685\n },\n {\n \"content\": \" In a top-down traversal of the tree, do the following for each node:\\n\\n */\\n\\n fn polish_simulated(&self, unproven_tree: UnprovenTree) -> UnprovenTree {\\n\\n todo!()\\n\\n }\\n\\n\\n\\n /**\\n\\n Prover Step 4: In a top-down traversal of the tree, compute the challenges e for simulated children of every node\\n\\n Prover Step 5: For every leaf marked \\\"simulated\\\", use the simulator of the Sigma-protocol for that leaf\\n\\n to compute the commitment $a$ and the response z, given the challenge e that is already stored in the leaf.\\n\\n Prover Step 6: For every leaf marked \\\"real\\\", use the first prover step of the Sigma-protocol for that leaf to\\n\\n compute the commitment a.\\n\\n */\\n\\n fn simulate_and_commit(&self, tree: UnprovenTree) -> Result<ProofTree, ProverError> {\\n\\n match tree {\\n\\n UnprovenTree::UnprovenSchnorr(us) => {\\n\\n if us.simulated {\\n\\n // Step 5 (simulated leaf -- complete the simulation)\\n\\n if let Some(challenge) = us.challenge_opt {\\n\\n let (fm, sm) = dlog_protocol::interactive_prover::simulate(\\n\",\n \"file_path\": \"sigma-tree/src/sigma_protocol/prover.rs\",\n \"rank\": 23,\n \"score\": 132083.60331504315\n },\n {\n \"content\": \"}\\n\\n\\n\\n// #[cfg(test)]\\n\\n// mod tests {\\n\\n// use super::*;\\n\\n// use crate::{\\n\\n// ast::{Constant, ConstantVal, Expr},\\n\\n// sigma_protocol::{DlogProverInput, SigmaProp},\\n\\n// types::SType,\\n\\n// };\\n\\n// use std::rc::Rc;\\n\\n\\n\\n// #[test]\\n\\n// fn test_prove_true_prop() {\\n\\n// let bool_true_tree = ErgoTree::from(Rc::new(Expr::Const(Constant {\\n\\n// tpe: SType::SBoolean,\\n\\n// v: ConstantVal::Boolean(true),\\n\\n// })));\\n\\n// let message = vec![0u8; 100];\\n\\n\\n\",\n \"file_path\": \"sigma-tree/src/sigma_protocol/prover.rs\",\n \"rank\": 24,\n \"score\": 132082.14336036408\n },\n {\n \"content\": \" if !step1.real() {\\n\\n return Err(ProverError::TreeRootIsNotReal);\\n\\n }\\n\\n\\n\\n // Prover Step 3: Change some \\\"real\\\" nodes to \\\"simulated\\\" to make sure each node\\n\\n // has the right number of simulated children.\\n\\n\\n\\n // skipped, since it leaves UnprovenSchnorr untouched\\n\\n // let step3 = self.polish_simulated(step1);\\n\\n\\n\\n // Prover Steps 4, 5, and 6 together: find challenges for simulated nodes; simulate simulated leaves;\\n\\n // compute commitments for real leaves\\n\\n let step6 = self.simulate_and_commit(step1)?;\\n\\n\\n\\n // Prover Steps 7: convert the relevant information in the tree (namely, tree structure, node types,\\n\\n // the statements being proven and commitments at the leaves)\\n\\n // to a string\\n\\n let mut s = fiat_shamir_tree_to_bytes(&step6);\\n\\n\\n\\n // Prover Step 8: compute the challenge for the root of the tree as the Fiat-Shamir hash of s\\n\",\n \"file_path\": \"sigma-tree/src/sigma_protocol/prover.rs\",\n \"rank\": 25,\n \"score\": 132080.5613411577\n },\n {\n \"content\": \" &us.proposition,\\n\\n &challenge,\\n\\n );\\n\\n Ok(ProofTree::UncheckedTree(UncheckedTree::UncheckedSigmaTree(\\n\\n UncheckedSigmaTree::UncheckedLeaf(UncheckedLeaf::UncheckedSchnorr(\\n\\n UncheckedSchnorr {\\n\\n proposition: us.proposition,\\n\\n commitment_opt: Some(fm),\\n\\n challenge,\\n\\n second_message: sm,\\n\\n },\\n\\n )),\\n\\n )))\\n\\n } else {\\n\\n Err(ProverError::SimulatedLeafWithoutChallenge)\\n\\n }\\n\\n } else {\\n\\n // Step 6 (real leaf -- compute the commitment a)\\n\\n let (r, commitment) =\\n\\n dlog_protocol::interactive_prover::first_message(&us.proposition);\\n\",\n \"file_path\": \"sigma-tree/src/sigma_protocol/prover.rs\",\n \"rank\": 26,\n \"score\": 132080.44406417472\n },\n {\n \"content\": \" }\\n\\n });\\n\\n proof.map(|v| ProverResult {\\n\\n proof: serialize_sig(v),\\n\\n extension: ContextExtension::empty(),\\n\\n })\\n\\n }\\n\\n\\n\\n fn convert_to_unproven(&self, sigma_tree: SigmaBoolean) -> UnprovenTree {\\n\\n match sigma_tree {\\n\\n SigmaBoolean::TrivialProp(_) => todo!(), // TODO: why it's even here\\n\\n SigmaBoolean::ProofOfKnowledge(pok) => match pok {\\n\\n SigmaProofOfKnowledgeTree::ProveDHTuple(_) => todo!(),\\n\\n SigmaProofOfKnowledgeTree::ProveDlog(prove_dlog) => {\\n\\n UnprovenTree::UnprovenSchnorr(UnprovenSchnorr {\\n\\n proposition: prove_dlog,\\n\\n commitment_opt: None,\\n\\n randomness_opt: None,\\n\\n challenge_opt: None,\\n\\n simulated: false,\\n\",\n \"file_path\": \"sigma-tree/src/sigma_protocol/prover.rs\",\n \"rank\": 27,\n \"score\": 132080.42293479643\n },\n {\n \"content\": \"// let prover = TestProver { secrets: vec![] };\\n\\n// let res = prover.prove(&bool_true_tree, &Env::empty(), message.as_slice());\\n\\n// assert!(res.is_ok());\\n\\n// assert!(res.unwrap().proof.is_empty());\\n\\n// }\\n\\n\\n\\n// #[test]\\n\\n// fn test_prove_false_prop() {\\n\\n// let bool_false_tree = ErgoTree::from(Rc::new(Expr::Const(Constant {\\n\\n// tpe: SType::SBoolean,\\n\\n// v: ConstantVal::Boolean(false),\\n\\n// })));\\n\\n// let message = vec![0u8; 100];\\n\\n\\n\\n// let prover = TestProver { secrets: vec![] };\\n\\n// let res = prover.prove(&bool_false_tree, &Env::empty(), message.as_slice());\\n\\n// assert!(res.is_err());\\n\\n// assert_eq!(res.err().unwrap(), ProverError::ReducedToFalse);\\n\\n// }\\n\\n\\n\",\n \"file_path\": \"sigma-tree/src/sigma_protocol/prover.rs\",\n \"rank\": 28,\n \"score\": 132077.7923285461\n },\n {\n \"content\": \" UncheckedSigmaTree::UncheckedLeaf(UncheckedLeaf::UncheckedSchnorr(\\n\\n UncheckedSchnorr {\\n\\n proposition: us.proposition,\\n\\n commitment_opt: None,\\n\\n challenge,\\n\\n second_message: z,\\n\\n },\\n\\n )),\\n\\n )))\\n\\n } else {\\n\\n Err(ProverError::SecretNotFound)\\n\\n }\\n\\n } else {\\n\\n Err(ProverError::RealUnprovenTreeWithoutChallenge)\\n\\n }\\n\\n }\\n\\n _ => todo!(),\\n\\n },\\n\\n }\\n\\n }\\n\",\n \"file_path\": \"sigma-tree/src/sigma_protocol/prover.rs\",\n \"rank\": 29,\n \"score\": 132077.4879540827\n },\n {\n \"content\": \" In a bottom-up traversal of the tree, do the following for each node:\\n\\n */\\n\\n fn mark_real(&self, unproven_tree: UnprovenTree) -> UnprovenTree {\\n\\n match unproven_tree {\\n\\n UnprovenTree::UnprovenSchnorr(us) => {\\n\\n let secret_known = self.secrets().iter().any(|s| match s {\\n\\n PrivateInput::DlogProverInput(dl) => dl.public_image() == us.proposition,\\n\\n _ => false,\\n\\n });\\n\\n UnprovenTree::UnprovenSchnorr(UnprovenSchnorr {\\n\\n simulated: !secret_known,\\n\\n ..us\\n\\n })\\n\\n }\\n\\n }\\n\\n }\\n\\n\\n\\n /**\\n\\n Prover Step 3: This step will change some \\\"real\\\" nodes to \\\"simulated\\\" to make sure each node has\\n\\n the right number of simulated children.\\n\",\n \"file_path\": \"sigma-tree/src/sigma_protocol/prover.rs\",\n \"rank\": 30,\n \"score\": 132075.8234238417\n },\n {\n \"content\": \" })\\n\\n }\\n\\n },\\n\\n SigmaBoolean::CAND(_) => todo!(),\\n\\n }\\n\\n }\\n\\n\\n\\n /// The comments in this section are taken from the algorithm for the\\n\\n /// Sigma-protocol prover as described in the white paper\\n\\n /// https://ergoplatform.org/docs/ErgoScript.pdf (Appendix A)\\n\\n fn prove_to_unchecked(\\n\\n &self,\\n\\n unproven_tree: UnprovenTree,\\n\\n message: &[u8],\\n\\n ) -> Result<UncheckedSigmaTree, ProverError> {\\n\\n // Prover Step 1: Mark as real everything the prover can prove\\n\\n let step1 = self.mark_real(unproven_tree);\\n\\n\\n\\n // Prover Step 2: If the root of the tree is marked \\\"simulated\\\" then the prover does not have enough witnesses\\n\\n // to perform the proof. Abort.\\n\",\n \"file_path\": \"sigma-tree/src/sigma_protocol/prover.rs\",\n \"rank\": 31,\n \"score\": 132075.221121568\n },\n {\n \"content\": \"// #[test]\\n\\n// fn test_prove_pk_prop() {\\n\\n// let secret = DlogProverInput::random();\\n\\n// let pk = secret.public_image();\\n\\n// let tree = ErgoTree::from(Rc::new(Expr::Const(Constant {\\n\\n// tpe: SType::SSigmaProp,\\n\\n// v: ConstantVal::SigmaProp(Box::new(SigmaProp(SigmaBoolean::ProofOfKnowledge(\\n\\n// SigmaProofOfKnowledgeTree::ProveDlog(pk),\\n\\n// )))),\\n\\n// })));\\n\\n// let message = vec![0u8; 100];\\n\\n\\n\\n// let prover = TestProver {\\n\\n// secrets: vec![PrivateInput::DlogProverInput(secret)],\\n\\n// };\\n\\n// let res = prover.prove(&tree, &Env::empty(), message.as_slice());\\n\\n// // assert!(res.is_ok());\\n\\n// assert!(!res.unwrap().proof.is_empty());\\n\\n// }\\n\\n// }\\n\",\n \"file_path\": \"sigma-tree/src/sigma_protocol/prover.rs\",\n \"rank\": 32,\n \"score\": 132074.9440513409\n },\n {\n \"content\": \" Ok(ProofTree::UnprovenTree(UnprovenTree::UnprovenSchnorr(\\n\\n UnprovenSchnorr {\\n\\n commitment_opt: Some(commitment),\\n\\n randomness_opt: Some(r),\\n\\n ..us\\n\\n },\\n\\n )))\\n\\n }\\n\\n }\\n\\n }\\n\\n }\\n\\n\\n\\n /**\\n\\n Prover Step 9: Perform a top-down traversal of only the portion of the tree marked \\\"real\\\" in order to compute\\n\\n the challenge e for every node marked \\\"real\\\" below the root and, additionally, the response z for every leaf\\n\\n marked \\\"real\\\"\\n\\n */\\n\\n fn proving(&self, tree: ProofTree) -> Result<ProofTree, ProverError> {\\n\\n // If the node is a leaf marked \\\"real\\\", compute its response according to the second prover step\\n\\n // of the Sigma-protocol given the commitment, challenge, and witness\\n\",\n \"file_path\": \"sigma-tree/src/sigma_protocol/prover.rs\",\n \"rank\": 33,\n \"score\": 132071.53000850373\n },\n {\n \"content\": \"/// Box deserialization with token ids optionally parsed in transaction\\n\\npub fn parse_box_with_indexed_digests<R: vlq_encode::ReadSigmaVlqExt>(\\n\\n digests_in_tx: Option<&IndexSet<TokenId>>,\\n\\n r: &mut R,\\n\\n) -> Result<ErgoBoxCandidate, SerializationError> {\\n\\n // reference implementation -https://github.com/ScorexFoundation/sigmastate-interpreter/blob/9b20cb110effd1987ff76699d637174a4b2fb441/sigmastate/src/main/scala/org/ergoplatform/ErgoBoxCandidate.scala#L144-L144\\n\\n\\n\\n let value = BoxValue::sigma_parse(r)?;\\n\\n let ergo_tree = ErgoTree::sigma_parse(r)?;\\n\\n let creation_height = r.get_u32()?;\\n\\n let tokens_count = r.get_u8()?;\\n\\n let mut tokens = Vec::with_capacity(tokens_count as usize);\\n\\n for _ in 0..tokens_count {\\n\\n let token_id = match digests_in_tx {\\n\\n None => TokenId::sigma_parse(r)?,\\n\\n Some(digests) => {\\n\\n let digest_index = r.get_u32()?;\\n\\n match digests.get_index(digest_index as usize) {\\n\\n Some(i) => Ok((*i).clone()),\\n\\n None => Err(SerializationError::Misc(\\n\\n \\\"failed to find token id in tx digests\\\".to_string(),\\n\",\n \"file_path\": \"sigma-tree/src/serialization/ergo_box.rs\",\n \"rank\": 34,\n \"score\": 130755.87430331073\n },\n {\n \"content\": \"use num_bigint::{BigInt, Sign};\\n\\nuse sigma_ser::{\\n\\n serializer::{SerializationError, SigmaSerializable},\\n\\n vlq_encode,\\n\\n};\\n\\nuse std::{convert::TryInto, io};\\n\\n\\n\\n#[derive(PartialEq, Debug, Clone)]\\n\\npub struct EcPoint(ProjectivePoint);\\n\\n\\n\\nimpl EcPoint {\\n\\n pub const GROUP_SIZE: usize = 33;\\n\\n}\\n\\n\\n\\nimpl Eq for EcPoint {}\\n\\n\\n\\n/// The generator g of the group is an element of the group such that, when written multiplicatively, every element\\n\\n/// of the group is a power of g.\\n\",\n \"file_path\": \"sigma-tree/src/sigma_protocol/dlog_group.rs\",\n \"rank\": 35,\n \"score\": 128997.84124939927\n },\n {\n \"content\": \"impl SigmaSerializable for EcPoint {\\n\\n fn sigma_serialize<W: vlq_encode::WriteSigmaVlqExt>(&self, w: &mut W) -> Result<(), io::Error> {\\n\\n let caff = self.0.to_affine();\\n\\n if bool::from(caff.is_some()) {\\n\\n let pubkey = caff.unwrap().to_compressed_pubkey();\\n\\n w.write_all(pubkey.as_bytes())?;\\n\\n } else {\\n\\n // infinity point\\n\\n let zeroes = [0u8; EcPoint::GROUP_SIZE];\\n\\n w.write_all(&zeroes)?;\\n\\n }\\n\\n Ok(())\\n\\n }\\n\\n\\n\\n fn sigma_parse<R: vlq_encode::ReadSigmaVlqExt>(r: &mut R) -> Result<Self, SerializationError> {\\n\\n let mut buf = [0; EcPoint::GROUP_SIZE];\\n\\n r.read_exact(&mut buf[..])?;\\n\\n if buf[0] != 0 {\\n\\n let pubkey = PublicKey::from_bytes(&buf[..]).ok_or_else(|| {\\n\\n SerializationError::Misc(\\\"failed to parse PK from bytes\\\".to_string())\\n\",\n \"file_path\": \"sigma-tree/src/sigma_protocol/dlog_group.rs\",\n \"rank\": 36,\n \"score\": 128991.06248959851\n },\n {\n \"content\": \"//! This is the general interface for the discrete logarithm prime-order group.\\n\\n//!\\n\\n//! The discrete logarithm problem is as follows: given a generator g of a finite\\n\\n//! group G and a random element h in G, find the (unique) integer x such that\\n\\n//! `g^x = h`.\\n\\n//!\\n\\n//! In cryptography, we are interested in groups for which the discrete logarithm problem\\n\\n//! (Dlog for short) is assumed to be hard. The most known groups of that kind are some Elliptic curve groups.\\n\\n//!\\n\\n//! Another issue pertaining elliptic curves is the need to find a suitable mapping that will convert an arbitrary\\n\\n//! message (that is some binary string) to an element of the group and vice-versa.\\n\\n//!\\n\\n//! Only a subset of the messages can be effectively mapped to a group element in such a way that there is a one-to-one\\n\\n//! injection that converts the string to a group element and vice-versa.\\n\\n//!\\n\\n//! On the other hand, any group element can be mapped to some string.\\n\\n\\n\\nuse super::DlogProverInput;\\n\\nuse k256::arithmetic::{ProjectivePoint, Scalar};\\n\\nuse k256::{arithmetic::AffinePoint, PublicKey};\\n\",\n \"file_path\": \"sigma-tree/src/sigma_protocol/dlog_group.rs\",\n \"rank\": 37,\n \"score\": 128984.70460948438\n },\n {\n \"content\": \" use sigma_ser::test_helpers::*;\\n\\n\\n\\n impl Arbitrary for EcPoint {\\n\\n type Parameters = ();\\n\\n type Strategy = BoxedStrategy<Self>;\\n\\n\\n\\n fn arbitrary_with(_args: Self::Parameters) -> Self::Strategy {\\n\\n prop_oneof![Just(generator()), Just(identity()), Just(random_element()),].boxed()\\n\\n }\\n\\n }\\n\\n\\n\\n proptest! {\\n\\n\\n\\n #[test]\\n\\n fn ser_roundtrip(v in any::<EcPoint>()) {\\n\\n prop_assert_eq![sigma_serialize_roundtrip(&v), v];\\n\\n }\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"sigma-tree/src/sigma_protocol/dlog_group.rs\",\n \"rank\": 38,\n \"score\": 128982.96969987261\n },\n {\n \"content\": \" })?;\\n\\n let cp = AffinePoint::from_pubkey(&pubkey);\\n\\n if bool::from(cp.is_none()) {\\n\\n Err(SerializationError::Misc(\\n\\n \\\"failed to get affine point from PK\\\".to_string(),\\n\\n ))\\n\\n } else {\\n\\n Ok(EcPoint(ProjectivePoint::from(cp.unwrap())))\\n\\n }\\n\\n } else {\\n\\n // infinity point\\n\\n Ok(EcPoint(ProjectivePoint::identity()))\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\n#[cfg(test)]\\n\\nmod tests {\\n\\n use super::*;\\n\\n use proptest::prelude::*;\\n\",\n \"file_path\": \"sigma-tree/src/sigma_protocol/dlog_group.rs\",\n \"rank\": 39,\n \"score\": 128973.18299612621\n },\n {\n \"content\": \"#[derive(PartialEq, Eq, Debug, Clone)]\\n\\nstruct ParsedTree {\\n\\n constants: Vec<Constant>,\\n\\n root: Result<Rc<Expr>, ErgoTreeRootParsingError>,\\n\\n}\\n\\n\\n\\n/** The root of ErgoScript IR. Serialized instances of this class are self sufficient and can be passed around.\\n\\n */\\n\\n#[derive(PartialEq, Eq, Debug, Clone)]\\n\\npub struct ErgoTree {\\n\\n header: ErgoTreeHeader,\\n\\n tree: Result<ParsedTree, ErgoTreeConstantsParsingError>,\\n\\n}\\n\\n\\n\",\n \"file_path\": \"sigma-tree/src/ergo_tree.rs\",\n \"rank\": 40,\n \"score\": 124535.41137541014\n },\n {\n \"content\": \"/// Consensus-critical serialization for Ergo\\n\\npub trait SigmaSerializable: Sized {\\n\\n /// Write `self` to the given `writer`.\\n\\n /// This function has a `sigma_` prefix to alert the reader that the\\n\\n /// serialization in use is consensus-critical serialization \\n\\n /// Notice that the error type is [`std::io::Error`]; this indicates that\\n\\n /// serialization MUST be infallible up to errors in the underlying writer.\\n\\n /// In other words, any type implementing `SigmaSerializable`\\n\\n /// must make illegal states unrepresentable.\\n\\n fn sigma_serialize<W: vlq_encode::WriteSigmaVlqExt>(&self, w: &mut W) -> Result<(), io::Error>;\\n\\n\\n\\n /// Try to read `self` from the given `reader`.\\n\\n /// `sigma-` prefix to alert the reader that the serialization in use\\n\\n /// is consensus-critical\\n\\n fn sigma_parse<R: vlq_encode::ReadSigmaVlqExt>(r: &mut R) -> Result<Self, SerializationError>;\\n\\n\\n\\n /// Serialize any SigmaSerializable value into bytes\\n\\n fn sigma_serialise_bytes(&self) -> Vec<u8> {\\n\\n let mut data = Vec::new();\\n\\n self.sigma_serialize(&mut data)\\n\\n // since serialization may fail only for underlying IO errors it's ok to force unwrap\\n\",\n \"file_path\": \"sigma-ser/src/serializer.rs\",\n \"rank\": 41,\n \"score\": 115946.81811420254\n },\n {\n \"content\": \"/// Encode a 32-bit value with ZigZag. ZigZag encodes signed integers\\n\\n/// into values that can be efficiently encoded with VLQ. (Otherwise,\\n\\n/// negative values must be sign-extended to 64 bits to be varint encoded,\\n\\n/// thus always taking 10 bytes on the wire.)\\n\\n/// see https://developers.google.com/protocol-buffers/docs/encoding#types\\n\\npub fn encode_i32(v: i32) -> u32 {\\n\\n // Note: the right-shift must be arithmetic\\n\\n // source: http://github.com/google/protobuf/blob/a7252bf42df8f0841cf3a0c85fdbf1a5172adecb/java/core/src/main/java/com/google/protobuf/CodedOutputStream.java#L934\\n\\n ((v << 1) ^ (v >> 31)) as u32\\n\\n}\\n\\n\\n\",\n \"file_path\": \"sigma-ser/src/zig_zag_encode.rs\",\n \"rank\": 42,\n \"score\": 113382.27196220358\n },\n {\n \"content\": \"/// Encode a 64-bit value with ZigZag. ZigZag encodes signed integers\\n\\n/// into values that can be efficiently encoded with varint. (Otherwise,\\n\\n/// negative values must be sign-extended to 64 bits to be varint encoded,\\n\\n/// thus always taking 10 bytes on the wire.)\\n\\n/// see https://developers.google.com/protocol-buffers/docs/encoding#types\\n\\npub fn encode_i64(v: i64) -> u64 {\\n\\n // source: http://github.com/google/protobuf/blob/a7252bf42df8f0841cf3a0c85fdbf1a5172adecb/java/core/src/main/java/com/google/protobuf/CodedOutputStream.java#L949\\n\\n ((v << 1) ^ (v >> 63)) as u64\\n\\n}\\n\\n\\n\",\n \"file_path\": \"sigma-ser/src/zig_zag_encode.rs\",\n \"rank\": 43,\n \"score\": 113382.27196220358\n },\n {\n \"content\": \"/// Decode a signed value previously ZigZag-encoded with [`encode_i32`]\\n\\n/// see https://developers.google.com/protocol-buffers/docs/encoding#types\\n\\npub fn decode_u32(v: u32) -> i32 {\\n\\n // source: http://github.com/google/protobuf/blob/a7252bf42df8f0841cf3a0c85fdbf1a5172adecb/java/core/src/main/java/com/google/protobuf/CodedInputStream.java#L553\\n\\n ((v >> 1) ^ (-((v & 1) as i32)) as u32) as i32\\n\\n}\\n\\n\\n\",\n \"file_path\": \"sigma-ser/src/zig_zag_encode.rs\",\n \"rank\": 44,\n \"score\": 113375.03674928242\n },\n {\n \"content\": \"/// Decode a signed value previously ZigZag-encoded with [`encode_i64`]\\n\\n/// see https://developers.google.com/protocol-buffers/docs/encoding#types\\n\\npub fn decode_u64(v: u64) -> i64 {\\n\\n // source: http://github.com/google/protobuf/blob/a7252bf42df8f0841cf3a0c85fdbf1a5172adecb/java/core/src/main/java/com/google/protobuf/CodedInputStream.java#L566\\n\\n ((v >> 1) ^ (-((v & 1) as i64)) as u64) as i64\\n\\n}\\n\\n#[cfg(test)]\\n\\nmod tests {\\n\\n use super::*;\\n\\n\\n\\n #[allow(overflowing_literals)]\\n\\n #[test]\\n\\n fn test_expected_values() {\\n\\n // source: http://github.com/google/protobuf/blob/a7252bf42df8f0841cf3a0c85fdbf1a5172adecb/java/core/src/test/java/com/google/protobuf/CodedOutputStreamTest.java#L281\\n\\n assert_eq!(0, encode_i32(0));\\n\\n assert_eq!(1, encode_i32(-1));\\n\\n assert_eq!(2, encode_i32(1));\\n\\n assert_eq!(3, encode_i32(-2));\\n\\n assert_eq!(0x7FFF_FFFE, encode_i32(0x3FFF_FFFF));\\n\\n assert_eq!(0x7FFF_FFFF, encode_i32(0xC000_0000));\\n\\n assert_eq!(0xFFFF_FFFE, encode_i32(0x7FFF_FFFF));\\n\\n assert_eq!(0xFFFF_FFFF, encode_i32(0x8000_0000));\\n\",\n \"file_path\": \"sigma-ser/src/zig_zag_encode.rs\",\n \"rank\": 45,\n \"score\": 113375.03674928242\n },\n {\n \"content\": \"pub trait Evaluator {\\n\\n fn reduce_to_crypto(&self, expr: &Expr, env: &Env) -> Result<ReductionResult, EvalError> {\\n\\n let mut ca = CostAccumulator::new(0, None);\\n\\n eval(expr, env, &mut ca).and_then(|v| match v {\\n\\n Value::Boolean(b) => Ok(ReductionResult {\\n\\n sigma_prop: SigmaBoolean::TrivialProp(b),\\n\\n cost: 0,\\n\\n }),\\n\\n Value::SigmaProp(sb) => Ok(ReductionResult {\\n\\n sigma_prop: *sb,\\n\\n cost: 0,\\n\\n }),\\n\\n _ => Err(EvalError::InvalidResultType),\\n\\n })\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"sigma-tree/src/eval.rs\",\n \"rank\": 46,\n \"score\": 110591.21666816529\n },\n {\n \"content\": \"/// serialization roundtrip\\n\\npub fn sigma_serialize_roundtrip<T: crate::serializer::SigmaSerializable>(v: &T) -> T {\\n\\n let mut data = Vec::new();\\n\\n v.sigma_serialize(&mut data).expect(\\\"serialization failed\\\");\\n\\n let cursor = Cursor::new(&mut data[..]);\\n\\n let mut reader = PeekableReader::new(cursor);\\n\\n T::sigma_parse(&mut reader).expect(\\\"parse failed\\\")\\n\\n}\\n\",\n \"file_path\": \"sigma-ser/src/test_helpers.rs\",\n \"rank\": 47,\n \"score\": 107673.6881738675\n },\n {\n \"content\": \"/// Conversion to SType\\n\\npub trait LiftIntoSType {\\n\\n /// get SType\\n\\n fn stype() -> SType;\\n\\n}\\n\\n\\n\\nimpl<T: LiftIntoSType> LiftIntoSType for Vec<T> {\\n\\n fn stype() -> SType {\\n\\n SType::SColl(Box::new(T::stype()))\\n\\n }\\n\\n}\\n\\n\\n\\nimpl LiftIntoSType for bool {\\n\\n fn stype() -> SType {\\n\\n SType::SBoolean\\n\\n }\\n\\n}\\n\\n\\n\\nimpl LiftIntoSType for i8 {\\n\\n fn stype() -> SType {\\n\\n SType::SByte\\n\",\n \"file_path\": \"sigma-tree/src/types.rs\",\n \"rank\": 48,\n \"score\": 105828.2680589123\n },\n {\n \"content\": \"/// Marker trait to select types for which CollElems::NonPrimitive is used to store elements as Vec<ConstantVal>\\n\\npub trait StoredNonPrimitive {}\\n\\n\\n\\nimpl StoredNonPrimitive for bool {}\\n\\nimpl StoredNonPrimitive for i16 {}\\n\\nimpl StoredNonPrimitive for i32 {}\\n\\nimpl StoredNonPrimitive for i64 {}\\n\\n\\n\\nimpl<T: LiftIntoSType + StoredNonPrimitive + Into<ConstantVal>> Into<ConstantVal> for Vec<T> {\\n\\n fn into(self) -> ConstantVal {\\n\\n ConstantVal::Coll(ConstantColl::NonPrimitive {\\n\\n elem_tpe: T::stype(),\\n\\n v: self.into_iter().map(|i| i.into()).collect(),\\n\\n })\\n\\n }\\n\\n}\\n\\n\\n\\nimpl<T: LiftIntoSType + StoredNonPrimitive + Into<ConstantVal>> Into<Constant> for Vec<T> {\\n\\n fn into(self) -> Constant {\\n\\n Constant {\\n\\n tpe: Self::stype(),\\n\",\n \"file_path\": \"sigma-tree/src/ast/constant.rs\",\n \"rank\": 49,\n \"score\": 103640.71752145007\n },\n {\n \"content\": \"use super::dlog_group::EcPoint;\\n\\nuse crate::big_integer::BigInteger;\\n\\n\\n\\npub struct FirstDlogProverMessage(EcPoint);\\n\\npub struct SecondDlogProverMessage(BigInteger);\\n\\n\\n\\npub mod interactive_prover {\\n\\n use super::{FirstDlogProverMessage, SecondDlogProverMessage};\\n\\n use crate::{\\n\\n big_integer::BigInteger,\\n\\n sigma_protocol::{dlog_group, Challenge, DlogProverInput, ProveDlog},\\n\\n };\\n\\n\\n\\n pub fn simulate(\\n\\n public_input: &ProveDlog,\\n\\n challenge: &Challenge,\\n\\n ) -> (FirstDlogProverMessage, SecondDlogProverMessage) {\\n\\n todo!()\\n\\n }\\n\\n\\n\",\n \"file_path\": \"sigma-tree/src/sigma_protocol/dlog_protocol.rs\",\n \"rank\": 50,\n \"score\": 103559.58389473011\n },\n {\n \"content\": \" pub fn first_message(proposition: &ProveDlog) -> (BigInteger, FirstDlogProverMessage) {\\n\\n let scalar = dlog_group::random_scalar_in_group_range();\\n\\n let g = dlog_group::generator();\\n\\n let a = dlog_group::exponentiate(&g, &scalar);\\n\\n (scalar.into(), FirstDlogProverMessage(a))\\n\\n }\\n\\n\\n\\n pub fn second_message(\\n\\n private_input: &DlogProverInput,\\n\\n rnd: BigInteger,\\n\\n challenge: &Challenge,\\n\\n ) -> SecondDlogProverMessage {\\n\\n todo!()\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"sigma-tree/src/sigma_protocol/dlog_protocol.rs\",\n \"rank\": 51,\n \"score\": 103556.93764173287\n },\n {\n \"content\": \"#[allow(dead_code)]\\n\\npub fn set_panic_hook() {\\n\\n // When the `console_error_panic_hook` feature is enabled, we can call the\\n\\n // `set_panic_hook` function at least once during initialization, and then\\n\\n // we will get better error messages if our code ever panics.\\n\\n //\\n\\n // For more details see\\n\\n // https://github.com/rustwasm/console_error_panic_hook#readme\\n\\n #[cfg(feature = \\\"console_error_panic_hook\\\")]\\n\\n console_error_panic_hook::set_once();\\n\\n}\\n\",\n \"file_path\": \"bindings/ergo-wallet-lib-wasm/src/utils.rs\",\n \"rank\": 52,\n \"score\": 101352.21596770632\n },\n {\n \"content\": \"use super::op_code::OpCode;\\n\\nuse crate::sigma_protocol::{\\n\\n dlog_group::EcPoint, ProveDlog, SigmaBoolean, SigmaProofOfKnowledgeTree,\\n\\n};\\n\\nuse sigma_ser::{\\n\\n serializer::{SerializationError, SigmaSerializable},\\n\\n vlq_encode,\\n\\n};\\n\\nuse std::io;\\n\\n\\n\\nimpl SigmaSerializable for SigmaBoolean {\\n\\n fn sigma_serialize<W: vlq_encode::WriteSigmaVlqExt>(&self, w: &mut W) -> Result<(), io::Error> {\\n\\n self.op_code().sigma_serialize(w)?;\\n\\n match self {\\n\\n SigmaBoolean::ProofOfKnowledge(proof) => match proof {\\n\\n SigmaProofOfKnowledgeTree::ProveDHTuple { .. } => todo!(),\\n\\n SigmaProofOfKnowledgeTree::ProveDlog(v) => v.sigma_serialize(w),\\n\\n },\\n\\n SigmaBoolean::CAND(_) => todo!(),\\n\\n SigmaBoolean::TrivialProp(_) => Ok(()), // besides opCode no additional bytes\\n\",\n \"file_path\": \"sigma-tree/src/serialization/sigmaboolean.rs\",\n \"rank\": 65,\n \"score\": 93760.16782276653\n },\n {\n \"content\": \" }\\n\\n }\\n\\n\\n\\n fn sigma_parse<R: vlq_encode::ReadSigmaVlqExt>(r: &mut R) -> Result<Self, SerializationError> {\\n\\n let op_code = OpCode::sigma_parse(r)?;\\n\\n match op_code {\\n\\n OpCode::PROVE_DLOG => Ok(SigmaBoolean::ProofOfKnowledge(\\n\\n SigmaProofOfKnowledgeTree::ProveDlog(ProveDlog::sigma_parse(r)?),\\n\\n )),\\n\\n _ => todo!(),\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\nimpl SigmaSerializable for ProveDlog {\\n\\n fn sigma_serialize<W: vlq_encode::WriteSigmaVlqExt>(&self, w: &mut W) -> Result<(), io::Error> {\\n\\n self.h.sigma_serialize(w)\\n\\n }\\n\\n\\n\\n fn sigma_parse<R: vlq_encode::ReadSigmaVlqExt>(r: &mut R) -> Result<Self, SerializationError> {\\n\\n let p = EcPoint::sigma_parse(r)?;\\n\\n Ok(ProveDlog::new(p))\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"sigma-tree/src/serialization/sigmaboolean.rs\",\n \"rank\": 66,\n \"score\": 93751.81868783914\n },\n {\n \"content\": \"use crate::{chain::ErgoBox, sigma_protocol::SigmaBoolean};\\n\\nuse std::ops::Add;\\n\\n\\n\\n#[allow(dead_code)]\\n\\npub enum Value {\\n\\n Boolean(bool),\\n\\n Byte(i8),\\n\\n Short(i16),\\n\\n Int(i32),\\n\\n Long(i64),\\n\\n BigInt,\\n\\n GroupElement,\\n\\n SigmaProp(Box<SigmaBoolean>),\\n\\n Box(Box<ErgoBox>),\\n\\n AvlTree,\\n\\n Coll(Vec<Value>),\\n\\n Tup(Vec<Value>),\\n\\n}\\n\\n\\n\\nimpl Value {\\n\",\n \"file_path\": \"sigma-tree/src/eval/value.rs\",\n \"rank\": 67,\n \"score\": 93679.11921324018\n },\n {\n \"content\": \" #[inline]\\n\\n pub fn byte(value: i8) -> Self {\\n\\n Value::Byte(value)\\n\\n }\\n\\n}\\n\\n\\n\\nimpl Add for Value {\\n\\n type Output = Self;\\n\\n fn add(self, other: Self) -> Self {\\n\\n match (self, other) {\\n\\n (Value::Byte(s), Value::Byte(o)) => Self::byte(s + o),\\n\\n _ => todo!(),\\n\\n }\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"sigma-tree/src/eval/value.rs\",\n \"rank\": 68,\n \"score\": 93670.11107088254\n },\n {\n \"content\": \"use sigma_ser::{\\n\\n serializer::{SerializationError, SigmaSerializable},\\n\\n vlq_encode,\\n\\n};\\n\\nuse std::io;\\n\\nuse vlq_encode::WriteSigmaVlqExt;\\n\\n\\n\\n#[derive(PartialEq, Eq, Hash, Copy, Clone)]\\n\\npub struct OpCode(u8);\\n\\n\\n\\nimpl OpCode {\\n\\n pub const LAST_DATA_TYPE: OpCode = OpCode(111);\\n\\n pub const LAST_CONSTANT_CODE: OpCode = OpCode(Self::LAST_DATA_TYPE.value() + 1);\\n\\n\\n\\n pub const FOLD: OpCode = Self::new_op_code(64);\\n\\n pub const PROVE_DLOG: OpCode = Self::new_op_code(93);\\n\\n\\n\\n const fn new_op_code(shift: u8) -> OpCode {\\n\\n OpCode(Self::LAST_CONSTANT_CODE.value() + shift)\\n\\n }\\n\",\n \"file_path\": \"sigma-tree/src/serialization/op_code.rs\",\n \"rank\": 69,\n \"score\": 91145.22622905049\n },\n {\n \"content\": \"\\n\\n pub fn parse(b: u8) -> OpCode {\\n\\n OpCode(b)\\n\\n }\\n\\n\\n\\n pub const fn value(self) -> u8 {\\n\\n self.0\\n\\n }\\n\\n}\\n\\n\\n\\nimpl SigmaSerializable for OpCode {\\n\\n fn sigma_serialize<W: WriteSigmaVlqExt>(&self, w: &mut W) -> Result<(), io::Error> {\\n\\n w.put_u8(self.0)?;\\n\\n Ok(())\\n\\n }\\n\\n fn sigma_parse<R: vlq_encode::ReadSigmaVlqExt>(r: &mut R) -> Result<Self, SerializationError> {\\n\\n let code = r.get_u8()?;\\n\\n Ok(OpCode::parse(code))\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"sigma-tree/src/serialization/op_code.rs\",\n \"rank\": 70,\n \"score\": 91144.24305277137\n },\n {\n \"content\": \"//! Transitioning type for Base16 encoded bytes in JSON serialization\\n\\n\\n\\n#[cfg(feature = \\\"with-serde\\\")]\\n\\nuse serde::{Deserialize, Serialize};\\n\\nuse std::convert::TryFrom;\\n\\n\\n\\n/// Transitioning type for Base16 encoded bytes\\n\\n#[cfg_attr(feature = \\\"with-serde\\\", derive(Serialize, Deserialize))]\\n\\n#[cfg_attr(feature = \\\"with-serde\\\", serde(into = \\\"String\\\"))]\\n\\n#[derive(PartialEq, Eq, Debug, Clone)]\\n\\npub struct Base16EncodedBytes(String);\\n\\n\\n\\nimpl Base16EncodedBytes {\\n\\n /// Create from byte array ref (&[u8])\\n\\n pub fn new<T: ?Sized + AsRef<[u8]>>(input: &T) -> Base16EncodedBytes {\\n\\n Base16EncodedBytes(base16::encode_lower(input))\\n\\n }\\n\\n}\\n\\n\\n\\nimpl Into<String> for Base16EncodedBytes {\\n\",\n \"file_path\": \"sigma-tree/src/chain/base16_bytes.rs\",\n \"rank\": 71,\n \"score\": 91105.97352877635\n },\n {\n \"content\": \" fn into(self) -> String {\\n\\n self.0\\n\\n }\\n\\n}\\n\\n\\n\\n/// Transitioning type for Base16 decoded bytes\\n\\n#[cfg_attr(feature = \\\"with-serde\\\", derive(Serialize, Deserialize))]\\n\\n#[cfg_attr(feature = \\\"with-serde\\\", serde(try_from = \\\"String\\\"))]\\n\\n#[derive(PartialEq, Eq, Debug, Clone)]\\n\\npub struct Base16DecodedBytes(pub Vec<u8>);\\n\\n\\n\\nimpl TryFrom<String> for Base16DecodedBytes {\\n\\n type Error = base16::DecodeError;\\n\\n fn try_from(str: String) -> Result<Self, Self::Error> {\\n\\n Ok(Base16DecodedBytes(base16::decode(&str)?))\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"sigma-tree/src/chain/base16_bytes.rs\",\n \"rank\": 72,\n \"score\": 91104.22240508255\n },\n {\n \"content\": \"//! ProverResult\\n\\nuse sigma_ser::serializer::SerializationError;\\n\\nuse sigma_ser::serializer::SigmaSerializable;\\n\\nuse sigma_ser::vlq_encode;\\n\\nuse std::io;\\n\\n\\n\\nuse super::context_extension::ContextExtension;\\n\\n#[cfg(feature = \\\"with-serde\\\")]\\n\\nuse serde::{Deserialize, Serialize};\\n\\n\\n\\n/// Proof of correctness of tx spending\\n\\n#[derive(Debug, PartialEq, Eq, Clone)]\\n\\n#[cfg_attr(feature = \\\"with-serde\\\", derive(Serialize, Deserialize))]\\n\\npub struct ProverResult {\\n\\n /// proof that satisfies final sigma proposition\\n\\n #[cfg_attr(feature = \\\"with-serde\\\", serde(rename = \\\"proofBytes\\\"))]\\n\\n pub proof: Vec<u8>,\\n\\n /// user-defined variables to be put into context\\n\\n #[cfg_attr(feature = \\\"with-serde\\\", serde(rename = \\\"extension\\\"))]\\n\\n pub extension: ContextExtension,\\n\",\n \"file_path\": \"sigma-tree/src/chain/prover_result.rs\",\n \"rank\": 73,\n \"score\": 90873.78550028711\n },\n {\n \"content\": \"}\\n\\n\\n\\nimpl SigmaSerializable for ProverResult {\\n\\n fn sigma_serialize<W: vlq_encode::WriteSigmaVlqExt>(&self, w: &mut W) -> Result<(), io::Error> {\\n\\n w.put_u16(self.proof.len() as u16)?;\\n\\n w.write_all(&self.proof)?;\\n\\n self.extension.sigma_serialize(w)?;\\n\\n Ok(())\\n\\n }\\n\\n fn sigma_parse<R: vlq_encode::ReadSigmaVlqExt>(r: &mut R) -> Result<Self, SerializationError> {\\n\\n let proof_len = r.get_u16()?;\\n\\n let mut proof = vec![0; proof_len as usize];\\n\\n r.read_exact(&mut proof)?;\\n\\n let extension = ContextExtension::sigma_parse(r)?;\\n\\n Ok(ProverResult { proof, extension })\\n\\n }\\n\\n}\\n\\n\\n\\n#[cfg(test)]\\n\\nmod tests {\\n\",\n \"file_path\": \"sigma-tree/src/chain/prover_result.rs\",\n \"rank\": 74,\n \"score\": 90872.3009561621\n },\n {\n \"content\": \" use super::*;\\n\\n use proptest::{collection::vec, prelude::*};\\n\\n use sigma_ser::test_helpers::*;\\n\\n\\n\\n impl Arbitrary for ProverResult {\\n\\n type Parameters = ();\\n\\n\\n\\n fn arbitrary_with(_args: Self::Parameters) -> Self::Strategy {\\n\\n (vec(any::<u8>(), 0..100))\\n\\n .prop_map(|v| Self {\\n\\n proof: v,\\n\\n extension: ContextExtension::empty(),\\n\\n })\\n\\n .boxed()\\n\\n }\\n\\n\\n\\n type Strategy = BoxedStrategy<Self>;\\n\\n }\\n\\n proptest! {\\n\\n\\n\\n #[test]\\n\\n fn ser_roundtrip(v in any::<ProverResult>()) {\\n\\n prop_assert_eq![sigma_serialize_roundtrip(&v), v];\\n\\n }\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"sigma-tree/src/chain/prover_result.rs\",\n \"rank\": 75,\n \"score\": 90870.22102646278\n },\n {\n \"content\": \"pub fn address_delete(address: AddressPtr) {\\n\\n if !address.is_null() {\\n\\n let boxed = unsafe { Box::from_raw(address) };\\n\\n std::mem::drop(boxed);\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"bindings/ergo-wallet-lib-c-core/src/lib.rs\",\n \"rank\": 76,\n \"score\": 90512.35178426781\n },\n {\n \"content\": \"impl SigmaSerializable for BoxValue {\\n\\n fn sigma_serialize<W: vlq_encode::WriteSigmaVlqExt>(&self, w: &mut W) -> Result<(), io::Error> {\\n\\n w.put_u64(self.0)\\n\\n }\\n\\n fn sigma_parse<R: vlq_encode::ReadSigmaVlqExt>(r: &mut R) -> Result<Self, SerializationError> {\\n\\n let v = r.get_u64()?;\\n\\n Ok(BoxValue(v))\\n\\n }\\n\\n}\\n\\n\\n\\n#[cfg(test)]\\n\\nmod tests {\\n\\n use super::*;\\n\\n use proptest::{arbitrary::Arbitrary, prelude::*};\\n\\n\\n\\n impl Arbitrary for BoxValue {\\n\\n type Parameters = ();\\n\\n type Strategy = BoxedStrategy<Self>;\\n\\n fn arbitrary_with(_args: Self::Parameters) -> Self::Strategy {\\n\\n (1..i64::MAX).prop_map(|v| BoxValue(v as u64)).boxed()\\n\\n }\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"sigma-tree/src/chain/ergo_box/box_value.rs\",\n \"rank\": 77,\n \"score\": 86290.55009248243\n },\n {\n \"content\": \"//! Box value newtype\\n\\n\\n\\n#[cfg(feature = \\\"with-serde\\\")]\\n\\nuse serde::{Deserialize, Serialize};\\n\\nuse sigma_ser::serializer::{SerializationError, SigmaSerializable};\\n\\nuse sigma_ser::vlq_encode;\\n\\nuse std::{convert::TryFrom, io};\\n\\n\\n\\n/// Box value\\n\\n#[derive(PartialEq, Eq, Hash, Debug, Clone)]\\n\\n#[cfg_attr(feature = \\\"with-serde\\\", derive(Serialize, Deserialize))]\\n\\npub struct BoxValue(u64);\\n\\n\\n\\nimpl BoxValue {\\n\\n const MIN_RAW: u64 = 1;\\n\\n const MAX_RAW: u64 = i64::MAX as u64;\\n\\n\\n\\n /// Minimal value\\n\\n pub const MIN: BoxValue = BoxValue(BoxValue::MIN_RAW);\\n\\n\\n\",\n \"file_path\": \"sigma-tree/src/chain/ergo_box/box_value.rs\",\n \"rank\": 78,\n \"score\": 86288.76558877125\n },\n {\n \"content\": \" /// Create from u64 with bounds check\\n\\n pub fn new(v: u64) -> Result<BoxValue, BoxValueError> {\\n\\n BoxValue::try_from(v)\\n\\n }\\n\\n\\n\\n /// Check if a value is in bounds\\n\\n pub fn within_bounds(v: u64) -> bool {\\n\\n v >= BoxValue::MIN_RAW && v <= BoxValue::MAX_RAW\\n\\n }\\n\\n\\n\\n /// Get u64 value\\n\\n pub fn value(&self) -> u64 {\\n\\n self.0\\n\\n }\\n\\n}\\n\\n\\n\\n/// BoxValue errors\\n\\n#[derive(PartialEq, Eq, Debug, Clone)]\\n\\npub enum BoxValueError {\\n\\n /// Value is out of bounds\\n\",\n \"file_path\": \"sigma-tree/src/chain/ergo_box/box_value.rs\",\n \"rank\": 79,\n \"score\": 86284.22098746832\n },\n {\n \"content\": \" OutOfBounds,\\n\\n}\\n\\n\\n\\nimpl TryFrom<u64> for BoxValue {\\n\\n type Error = BoxValueError;\\n\\n fn try_from(v: u64) -> Result<Self, Self::Error> {\\n\\n if BoxValue::within_bounds(v) {\\n\\n Ok(BoxValue(v))\\n\\n } else {\\n\\n Err(BoxValueError::OutOfBounds)\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\nimpl Into<u64> for BoxValue {\\n\\n fn into(self) -> u64 {\\n\\n self.0\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"sigma-tree/src/chain/ergo_box/box_value.rs\",\n \"rank\": 80,\n \"score\": 86273.21533300132\n },\n {\n \"content\": \"class OutputBoxes {\\n\\n internal var pointer: OutputBoxesPtr\\n\\n\\n\\n init(box: ErgoBoxCandidate) throws {\\n\\n var ptr: OutputBoxesPtr?\\n\\n let error = ergo_wallet_output_boxes_new(box.pointer, &ptr)\\n\\n try checkError(error)\\n\\n self.pointer = ptr!\\n\\n }\\n\\n\\n\\n deinit {\\n\\n ergo_wallet_output_boxes_delete(self.pointer)\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"bindings/ergo-wallet-lib-ios/Sources/ErgoWallet/ErgoWallet.swift\",\n \"rank\": 81,\n \"score\": 84905.9088467529\n },\n {\n \"content\": \"// Tries to get meaningful description from panic-error.\\n\\npub fn any_to_string(any: &Box<dyn Any + Send>) -> String {\\n\\n if let Some(s) = any.downcast_ref::<&str>() {\\n\\n s.to_string()\\n\\n } else if let Some(s) = any.downcast_ref::<String>() {\\n\\n s.clone()\\n\\n } else if let Some(error) = any.downcast_ref::<Box<dyn std::error::Error + Send>>() {\\n\\n error.to_string()\\n\\n } else {\\n\\n \\\"Unknown error occurred\\\".to_string()\\n\\n }\\n\\n}\\n\\n\\n\\n#[cfg(test)]\\n\\nmod tests {\\n\\n use super::*;\\n\\n use std::error::Error;\\n\\n use std::panic;\\n\\n\\n\\n #[test]\\n\\n fn str_any() {\\n\",\n \"file_path\": \"bindings/ergo-wallet-lib-android/src/main/rust/exception.rs\",\n \"rank\": 82,\n \"score\": 78793.44584052754\n },\n {\n \"content\": \"/// A wrapper around any struct implementing the `Read` trait, additionally\\n\\n/// allowing for `peek` operations to be performed. Therefore, the\\n\\n/// `PeekableReader` struct also implements the `Read` trait.\\n\\n///\\n\\n/// The primary invariant of the `PeekableReader` is that after calling the\\n\\n/// `peek` method, the next `read_byte` call will return the same result as\\n\\n/// the `peek` does. When the result is a byte (read off the wrapped reader),\\n\\n/// any read-type method of the `Reader` trait will include the byte as the\\n\\n/// first one. On the other hand, if the result is an `io::Error`, the error\\n\\n/// will be returned regardless of which read-type method of the `Reader` is\\n\\n/// invoked. Consecutive `peek`s before any read-type operation is used\\n\\n/// always return the same `io::Result`.\\n\\n///\\n\\npub trait Peekable: Read {\\n\\n /// When using peek_u8 you will get a Result<u8, &Error>, while when you call\\n\\n /// any of the `Read` functions you will get an io::Result<u8>, thereby\\n\\n /// consuming the io::Error (if any.)\\n\\n fn peek_u8(&mut self) -> Result<u8, &Error>;\\n\\n}\\n\\n\\n\\nimpl<R: Read> Peekable for PeekableReader<R> {\\n\\n /// Returns the `io::Result` which the Reader will return on the next\\n\\n /// `get_byte` call.\\n\\n ///\\n\\n /// If the `io::Result` is indeed an `io::Error`, the error will be returned\\n\\n /// for any subsequent read operation invoked upon the `Read`er.\\n\\n fn peek_u8(&mut self) -> Result<u8, &Error> {\\n\\n // Return either the currently cached peeked byte or obtain a new one\\n\\n // from the underlying reader.\\n\\n match self.peeked_result {\\n\\n Some(Ok(x)) => Ok(x),\\n\\n Some(Err(ref e)) => Err(e),\\n\\n None => {\\n\",\n \"file_path\": \"sigma-ser/src/peekable_reader.rs\",\n \"rank\": 83,\n \"score\": 75564.83631597302\n },\n {\n \"content\": \"/// Write encoded unsigned values using VLQ and signed values first with ZigZag, then using VLQ\\n\\n/// for VLQ see [[https://en.wikipedia.org/wiki/Variable-length_quantity]]\\n\\n/// for ZigZag see https://developers.google.com/protocol-buffers/docs/encoding#types\\n\\npub trait WriteSigmaVlqExt: io::Write {\\n\\n /// Write i8 without encoding\\n\\n fn put_i8(&mut self, v: i8) -> io::Result<()> {\\n\\n Self::put_u8(self, v as u8)\\n\\n }\\n\\n\\n\\n /// Write u8 without encoding\\n\\n fn put_u8(&mut self, v: u8) -> io::Result<()> {\\n\\n self.write_all(&[v])\\n\\n }\\n\\n\\n\\n /// Encode using ZigZag and then VLQ.\\n\\n fn put_i16(&mut self, v: i16) -> io::Result<()> {\\n\\n Self::put_u32(self, zig_zag_encode::encode_i32(v as i32))\\n\\n }\\n\\n\\n\\n /// Encode using VLQ.\\n\\n fn put_u16(&mut self, v: u16) -> io::Result<()> {\\n\\n Self::put_u64(self, v as u64)\\n\\n }\\n\",\n \"file_path\": \"sigma-ser/src/vlq_encode.rs\",\n \"rank\": 84,\n \"score\": 75482.89445492288\n },\n {\n \"content\": \"/// Read and decode values using VLQ (+ ZigZag for signed values) encoded and written with [`WriteSigmaVlqExt`]\\n\\n/// for VLQ see [[https://en.wikipedia.org/wiki/Variable-length_quantity]]\\n\\n/// for ZigZag see https://developers.google.com/protocol-buffers/docs/encoding#types\\n\\npub trait ReadSigmaVlqExt: peekable_reader::Peekable {\\n\\n /// Read i8 without decoding\\n\\n fn get_i8(&mut self) -> Result<i8, io::Error> {\\n\\n Self::get_u8(self).map(|v| v as i8)\\n\\n }\\n\\n\\n\\n /// Read u8 without decoding\\n\\n fn get_u8(&mut self) -> std::result::Result<u8, io::Error> {\\n\\n let mut slice = [0u8; 1];\\n\\n self.read_exact(&mut slice)?;\\n\\n Ok(slice[0])\\n\\n }\\n\\n\\n\\n /// Read and decode using VLQ and ZigZag value written with [`WriteSigmaVlqExt::put_i16`]\\n\\n fn get_i16(&mut self) -> Result<i16, VlqEncodingError> {\\n\\n Self::get_u32(self).and_then(|v| {\\n\\n let vd = zig_zag_encode::decode_u32(v);\\n\\n i16::try_from(vd).map_err(VlqEncodingError::TryFrom)\\n\\n })\\n\\n }\\n\",\n \"file_path\": \"sigma-ser/src/vlq_encode.rs\",\n \"rank\": 85,\n \"score\": 74328.58198814924\n },\n {\n \"content\": \"#[allow(dead_code)]\\n\\npub fn unwrap_exc_or_default<T: Default>(env: &JNIEnv, res: ExceptionResult<T>) -> T {\\n\\n unwrap_exc_or(env, res, T::default())\\n\\n}\\n\\n\\n\",\n \"file_path\": \"bindings/ergo-wallet-lib-android/src/main/rust/exception.rs\",\n \"rank\": 86,\n \"score\": 67504.29583301273\n },\n {\n \"content\": \"// Returns value or \\\"throws\\\" exception. `error_val` is returned, because exception will be thrown\\n\\n// at the Java side. So this function should be used only for the `panic::catch_unwind` result.\\n\\npub fn unwrap_exc_or<T>(env: &JNIEnv, res: ExceptionResult<T>, error_val: T) -> T {\\n\\n match res {\\n\\n Ok(val) => {\\n\\n match val {\\n\\n Ok(val) => val,\\n\\n Err(jni_error) => {\\n\\n // Do nothing if there is a pending Java-exception that will be thrown\\n\\n // automatically by the JVM when the native method returns.\\n\\n if !env.exception_check().unwrap() {\\n\\n // Throw a Java exception manually in case of an internal error.\\n\\n throw(env, &jni_error.to_string())\\n\\n }\\n\\n error_val\\n\\n }\\n\\n }\\n\\n }\\n\\n Err(ref e) => {\\n\\n throw(env, &any_to_string(e));\\n\\n error_val\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\n// Same as `unwrap_exc_or` but returns default value.\\n\",\n \"file_path\": \"bindings/ergo-wallet-lib-android/src/main/rust/exception.rs\",\n \"rank\": 87,\n \"score\": 65457.556864192375\n },\n {\n \"content\": \" pub fn with_segregation(_: Rc<Expr>) -> ErgoTree {\\n\\n todo!()\\n\\n }\\n\\n}\\n\\n\\n\\nimpl From<Rc<Expr>> for ErgoTree {\\n\\n fn from(expr: Rc<Expr>) -> Self {\\n\\n match expr.as_ref() {\\n\\n Expr::Const(Constant { tpe, .. }) if *tpe == SType::SSigmaProp => {\\n\\n ErgoTree::without_segregation(expr)\\n\\n }\\n\\n _ => ErgoTree::with_segregation(expr),\\n\\n }\\n\\n }\\n\\n}\\n\\nimpl SigmaSerializable for ErgoTreeHeader {\\n\\n fn sigma_serialize<W: WriteSigmaVlqExt>(&self, w: &mut W) -> Result<(), io::Error> {\\n\\n w.put_u8(self.0)?;\\n\\n Ok(())\\n\\n }\\n\",\n \"file_path\": \"sigma-tree/src/ergo_tree.rs\",\n \"rank\": 88,\n \"score\": 64578.35108023852\n },\n {\n \"content\": \" fn sigma_parse<R: ReadSigmaVlqExt>(r: &mut R) -> Result<Self, SerializationError> {\\n\\n let header = r.get_u8()?;\\n\\n Ok(ErgoTreeHeader(header))\\n\\n }\\n\\n}\\n\\n\\n\\nimpl SigmaSerializable for ErgoTree {\\n\\n fn sigma_serialize<W: WriteSigmaVlqExt>(&self, w: &mut W) -> Result<(), io::Error> {\\n\\n self.header.sigma_serialize(w)?;\\n\\n match &self.tree {\\n\\n Ok(ParsedTree { constants, root }) => {\\n\\n if self.header.is_constant_segregation() {\\n\\n w.put_usize_as_u32(constants.len())?;\\n\\n assert!(\\n\\n constants.is_empty(),\\n\\n \\\"separate constants serialization is not yet supported\\\"\\n\\n );\\n\\n }\\n\\n match root {\\n\\n Ok(expr) => expr.sigma_serialize(w)?,\\n\",\n \"file_path\": \"sigma-tree/src/ergo_tree.rs\",\n \"rank\": 89,\n \"score\": 64572.65151070547\n },\n {\n \"content\": \"#[derive(PartialEq, Eq, Debug, Clone)]\\n\\npub struct ErgoTreeRootParsingError {\\n\\n /// Ergo tree root expr bytes (faild to deserialize)\\n\\n pub bytes: Vec<u8>,\\n\\n /// Deserialization error\\n\\n pub error: SerializationError,\\n\\n}\\n\\n\\n\\n/// ErgoTree parsing (deserialization) error\\n\\n#[derive(PartialEq, Eq, Debug, Clone)]\\n\\npub enum ErgoTreeParsingError {\\n\\n /// Whole ErgoTree parsing (deserialization) error\\n\\n TreeParsingError(ErgoTreeConstantsParsingError),\\n\\n /// ErgoTree root expr parsing (deserialization) error\\n\\n RootParsingError(ErgoTreeRootParsingError),\\n\\n}\\n\\n\\n\\nimpl ErgoTree {\\n\\n const DEFAULT_HEADER: ErgoTreeHeader = ErgoTreeHeader(0);\\n\\n\\n\",\n \"file_path\": \"sigma-tree/src/ergo_tree.rs\",\n \"rank\": 90,\n \"score\": 64570.58744980605\n },\n {\n \"content\": \" Ok(ErgoTree {\\n\\n header,\\n\\n tree: Ok(ParsedTree {\\n\\n constants,\\n\\n root: Ok(Rc::new(root)),\\n\\n }),\\n\\n })\\n\\n }\\n\\n\\n\\n fn sigma_parse_bytes(mut bytes: Vec<u8>) -> Result<Self, SerializationError> {\\n\\n let cursor = Cursor::new(&mut bytes[..]);\\n\\n let mut r = PeekableReader::new(cursor);\\n\\n let header = ErgoTreeHeader::sigma_parse(&mut r)?;\\n\\n if header.is_constant_segregation() {\\n\\n let constants_len = r.get_u32()?;\\n\\n if constants_len != 0 {\\n\\n return Ok(ErgoTree {\\n\\n header,\\n\\n tree: Err(ErgoTreeConstantsParsingError {\\n\\n bytes: bytes[1..].to_vec(),\\n\",\n \"file_path\": \"sigma-tree/src/ergo_tree.rs\",\n \"rank\": 91,\n \"score\": 64569.438522524986\n },\n {\n \"content\": \" error: SerializationError::NotImplementedYet(\\n\\n \\\"separate constants serialization is not yet supported\\\".to_string(),\\n\\n ),\\n\\n }),\\n\\n });\\n\\n }\\n\\n }\\n\\n let constants = Vec::new();\\n\\n let mut rest_of_the_bytes = Vec::new();\\n\\n let _ = r.read_to_end(&mut rest_of_the_bytes);\\n\\n let rest_of_the_bytes_copy = rest_of_the_bytes.clone();\\n\\n match Expr::sigma_parse_bytes(rest_of_the_bytes) {\\n\\n Ok(parsed) => Ok(ErgoTree {\\n\\n header,\\n\\n tree: Ok(ParsedTree {\\n\\n constants,\\n\\n root: Ok(Rc::new(parsed)),\\n\\n }),\\n\\n }),\\n\\n Err(err) => Ok(ErgoTree {\\n\",\n \"file_path\": \"sigma-tree/src/ergo_tree.rs\",\n \"rank\": 92,\n \"score\": 64568.31162559973\n },\n {\n \"content\": \" Err(ErgoTreeRootParsingError { bytes, .. }) => w.write_all(&bytes[..])?,\\n\\n }\\n\\n }\\n\\n Err(ErgoTreeConstantsParsingError { bytes, .. }) => w.write_all(&bytes[..])?,\\n\\n }\\n\\n Ok(())\\n\\n }\\n\\n\\n\\n fn sigma_parse<R: ReadSigmaVlqExt>(r: &mut R) -> Result<Self, SerializationError> {\\n\\n let header = ErgoTreeHeader::sigma_parse(r)?;\\n\\n if header.is_constant_segregation() {\\n\\n let constants_len = r.get_u32()?;\\n\\n if constants_len != 0 {\\n\\n return Err(SerializationError::NotImplementedYet(\\n\\n \\\"separate constants serialization is not yet supported\\\".to_string(),\\n\\n ));\\n\\n }\\n\\n }\\n\\n let constants = Vec::new();\\n\\n let root = Expr::sigma_parse(r)?;\\n\",\n \"file_path\": \"sigma-tree/src/ergo_tree.rs\",\n \"rank\": 93,\n \"score\": 64566.57379992548\n },\n {\n \"content\": \" /// get Expr out of ErgoTree\\n\\n pub fn proposition(&self) -> Result<Rc<Expr>, ErgoTreeParsingError> {\\n\\n self.tree\\n\\n .clone()\\n\\n .map_err(ErgoTreeParsingError::TreeParsingError)\\n\\n .and_then(|t| t.root.map_err(ErgoTreeParsingError::RootParsingError))\\n\\n }\\n\\n\\n\\n /// Build ErgoTree using expr as is, without constants segregated\\n\\n pub fn without_segregation(expr: Rc<Expr>) -> ErgoTree {\\n\\n ErgoTree {\\n\\n header: ErgoTree::DEFAULT_HEADER,\\n\\n tree: Ok(ParsedTree {\\n\\n constants: Vec::new(),\\n\\n root: Ok(expr),\\n\\n }),\\n\\n }\\n\\n }\\n\\n\\n\\n /// Build ErgoTree with constants segregated from expr\\n\",\n \"file_path\": \"sigma-tree/src/ergo_tree.rs\",\n \"rank\": 94,\n \"score\": 64565.3049188236\n },\n {\n \"content\": \" prop_assert_eq![sigma_serialize_roundtrip(&(v)), v];\\n\\n }\\n\\n }\\n\\n\\n\\n #[test]\\n\\n fn deserialization_non_parseable_tree_ok() {\\n\\n // constants length is set\\n\\n assert!(ErgoTree::sigma_parse_bytes(vec![0, 1]).is_ok());\\n\\n }\\n\\n\\n\\n #[test]\\n\\n fn deserialization_non_parseable_root_ok() {\\n\\n // constants length is zero, but Expr is invalid\\n\\n assert!(ErgoTree::sigma_parse_bytes(vec![0, 0, 1]).is_ok());\\n\\n }\\n\\n\\n\\n #[test]\\n\\n fn test_constant_segregation_header_flag_support() {\\n\\n let encoder = chain::AddressEncoder::new(chain::NetworkPrefix::Mainnet);\\n\\n let address = encoder\\n\\n .parse_address_from_str(\\\"9hzP24a2q8KLPVCUk7gdMDXYc7vinmGuxmLp5KU7k9UwptgYBYV\\\")\\n\\n .unwrap();\\n\\n\\n\\n let contract = chain::Contract::pay_to_address(address).unwrap();\\n\\n let bytes = &contract.get_ergo_tree().sigma_serialise_bytes();\\n\\n assert_eq!(&bytes[..2], vec![0u8, 8u8].as_slice());\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"sigma-tree/src/ergo_tree.rs\",\n \"rank\": 95,\n \"score\": 64565.16805310321\n },\n {\n \"content\": \" header,\\n\\n tree: Ok(ParsedTree {\\n\\n constants,\\n\\n root: Err(ErgoTreeRootParsingError {\\n\\n bytes: rest_of_the_bytes_copy,\\n\\n error: err,\\n\\n }),\\n\\n }),\\n\\n }),\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\n#[cfg(test)]\\n\\nmod tests {\\n\\n use super::*;\\n\\n use crate::{ast::ConstantVal, chain, sigma_protocol::SigmaProp, types::SType};\\n\\n use proptest::prelude::*;\\n\\n use sigma_ser::test_helpers::*;\\n\\n\\n\",\n \"file_path\": \"sigma-tree/src/ergo_tree.rs\",\n \"rank\": 96,\n \"score\": 64564.009160363144\n },\n {\n \"content\": \"//! ErgoTree\\n\\nuse crate::{\\n\\n ast::{Constant, Expr},\\n\\n types::SType,\\n\\n};\\n\\nuse io::{Cursor, Read};\\n\\nuse sigma_ser::serializer::SerializationError;\\n\\nuse sigma_ser::serializer::SigmaSerializable;\\n\\nuse sigma_ser::{peekable_reader::PeekableReader, vlq_encode};\\n\\nuse std::io;\\n\\nuse std::rc::Rc;\\n\\nuse vlq_encode::{ReadSigmaVlqExt, WriteSigmaVlqExt};\\n\\n\\n\\n#[derive(PartialEq, Eq, Debug, Clone)]\\n\",\n \"file_path\": \"sigma-tree/src/ergo_tree.rs\",\n \"rank\": 97,\n \"score\": 64562.33551290245\n },\n {\n \"content\": \" impl Arbitrary for ErgoTree {\\n\\n type Parameters = ();\\n\\n type Strategy = BoxedStrategy<Self>;\\n\\n\\n\\n fn arbitrary_with(_args: Self::Parameters) -> Self::Strategy {\\n\\n (any::<SigmaProp>())\\n\\n .prop_map(|p| {\\n\\n ErgoTree::from(Rc::new(Expr::Const(Constant {\\n\\n tpe: SType::SSigmaProp,\\n\\n v: ConstantVal::SigmaProp(Box::new(p)),\\n\\n })))\\n\\n })\\n\\n .boxed()\\n\\n }\\n\\n }\\n\\n\\n\\n proptest! {\\n\\n\\n\\n #[test]\\n\\n fn ser_roundtrip(v in any::<ErgoTree>()) {\\n\",\n \"file_path\": \"sigma-tree/src/ergo_tree.rs\",\n \"rank\": 98,\n \"score\": 64559.99938191821\n },\n {\n \"content\": \"//! AST for ErgoTree\\n\\nuse crate::{serialization::op_code::OpCode, types::*};\\n\\nuse core::fmt;\\n\\nuse Expr::*;\\n\\n\\n\\nmod constant;\\n\\npub mod ops;\\n\\n\\n\\npub use constant::*;\\n\\n\\n\\n#[derive(PartialEq, Eq, Debug)]\\n\\n/// newtype for box register id\\n\\npub struct RegisterId(u8);\\n\\n\\n\\n#[derive(PartialEq, Eq, Debug)]\\n\\n/// Expression in ErgoTree\\n\\npub enum Expr {\\n\\n /// Constant value\\n\\n Const(Constant),\\n\\n /// Collection of values (same type)\\n\",\n \"file_path\": \"sigma-tree/src/ast.rs\",\n \"rank\": 99,\n \"score\": 59012.81410275754\n }\n]","isConversational":false}}},{"rowIdx":2346,"cells":{"lang":{"kind":"string","value":"Rust"},"file_path":{"kind":"string","value":"src/lib.rs"},"repo_name":{"kind":"string","value":"load1n9/neko"},"commit":{"kind":"string","value":"addb9c2b2e911e33f2926230677c2d90b3b43de0"},"file_code":{"kind":"string","value":"\nextern crate minifb;\nuse std::cell::RefCell;\nuse std::collections::HashMap;\n\nuse minifb::Key;\nuse minifb::Window;\nuse minifb::WindowOptions;\nuse minifb::MouseMode;\nuse minifb::MouseButton;\n\npub static SUCCESS: u32 = 0;\npub static ERR_WINDOW_NOT_FOUND: u32 = 2;\npub static ERR_UPDATE_WITH_BUFFER_FAILED: u32 = 3;\n\nthread_local! {\n static WINDOWS: RefCell<HashMap<u32, Window>> = RefCell::new(HashMap::new());\n}\nfn str_to_mousekey_code(key: &str) -> Option<MouseButton> {\n match key {\n \"left\" => Some(MouseButton::Left),\n\t\t\"right\" => Some(MouseButton::Right),\n\t\t\"middle\" => Some(MouseButton::Middle),\n\t\t_ => None,\n\t}\n}\n\nfn str_to_key_code(key: &str) -> Option<Key> {\n match key {\n \"key0\" => Some(Key::Key0),\n\t\t\"key1\" => Some(Key::Key1),\n\t\t\"key2\" => Some(Key::Key2),\n\t\t\"key3\" => Some(Key::Key3),\n\t\t\"key4\" => Some(Key::Key4),\n\t\t\"key5\" => Some(Key::Key5),\n\t\t\"key6\" => Some(Key::Key6),\n\t\t\"key7\" => Some(Key::Key7),\n\t\t\"key8\" => Some(Key::Key8),\n\t\t\"key9\" => Some(Key::Key9),\n\t\t\"a\" => Some(Key::A),\n\t\t\"b\" => Some(Key::B),\n\t\t\"c\" => Some(Key::C),\n\t\t\"d\" => Some(Key::D),\n\t\t\"e\" => Some(Key::E),\n\t\t\"f\" => Some(Key::F),\n\t\t\"g\" => Some(Key::G),\n\t\t\"h\" => Some(Key::H),\n\t\t\"i\" => Some(Key::I),\n\t\t\"j\" => Some(Key::J),\n\t\t\"k\" => Some(Key::K),\n\t\t\"l\" => Some(Key::L),\n\t\t\"m\" => Some(Key::M),\n\t\t\"n\" => Some(Key::N),\n\t\t\"o\" => Some(Key::O),\n\t\t\"p\" => Some(Key::P),\n\t\t\"q\" => Some(Key::Q),\n\t\t\"r\" => Some(Key::R),\n\t\t\"s\" => Some(Key::S),\n\t\t\"t\" => Some(Key::T),\n\t\t\"u\" => Some(Key::U),\n\t\t\"v\" => Some(Key::V),\n\t\t\"w\" => Some(Key::W),\n\t\t\"x\" => Some(Key::X),\n\t\t\"y\" => Some(Key::Y),\n\t\t\"z\" => Some(Key::Z),\n\t\t\"f1\" => Some(Key::F1),\n\t\t\"f2\" => Some(Key::F2),\n\t\t\"f3\" => Some(Key::F3),\n\t\t\"f4\" => Some(Key::F4),\n\t\t\"f5\" => Some(Key::F5),\n\t\t\"f6\" => Some(Key::F6),\n\t\t\"f7\" => Some(Key::F7),\n\t\t\"f8\" => Some(Key::F8),\n\t\t\"f9\" => Some(Key::F9),\n\t\t\"f10\" => Some(Key::F10),\n\t\t\"f11\" => Some(Key::F11),\n\t\t\"f12\" => Some(Key::F12),\n\t\t\"f13\" => Some(Key::F13),\n\t\t\"f14\" => Some(Key::F14),\n\t\t\"f15\" => Some(Key::F15),\n\t\t\"down\" => Some(Key::Down),\n\t\t\"left\" => Some(Key::Left),\n\t\t\"right\" => Some(Key::Right),\n\t\t\"up\" => Some(Key::Up),\n\t\t\"apostrophe\" => Some(Key::Apostrophe),\n\t\t\"backquote\" => Some(Key::Backquote),\n\t\t\"backslash\" => Some(Key::Backslash),\n\t\t\"comma\" => Some(Key::Comma),\n\t\t\"equal\" => Some(Key::Equal),\n\t\t\"leftbracket\" => Some(Key::LeftBracket),\n\t\t\"minus\" => Some(Key::Minus),\n\t\t\"period\" => Some(Key::Period),\n\t\t\"rightbracket\" => Some(Key::RightBracket),\n\t\t\"semicolon\" => Some(Key::Semicolon),\n\t\t\"slash\" => Some(Key::Slash),\n\t\t\"backspace\" => Some(Key::Backspace),\n\t\t\"delete\" => Some(Key::Delete),\n\t\t\"end\" => Some(Key::End),\n\t\t\"enter\" => Some(Key::Enter),\n\t\t\"escape\" => Some(Key::Escape),\n\t\t\"home\" => Some(Key::Home),\n\t\t\"insert\" => Some(Key::Insert),\n\t\t\"menu\" => Some(Key::Menu),\n\t\t\"pagedown\" => Some(Key::PageDown),\n\t\t\"pageup\" => Some(Key::PageUp),\n\t\t\"pause\" => Some(Key::Pause),\n\t\t\"space\" => Some(Key::Space),\n\t\t\"tab\" => Some(Key::Tab),\n\t\t\"numlock\" => Some(Key::NumLock),\n\t\t\"capslock\" => Some(Key::CapsLock),\n\t\t\"scrolllock\" => Some(Key::ScrollLock),\n\t\t\"leftshift\" => Some(Key::LeftShift),\n\t\t\"rightshift\" => Some(Key::RightShift),\n\t\t\"leftctrl\" => Some(Key::LeftCtrl),\n\t\t\"rightctrl\" => Some(Key::RightCtrl),\n\t\t\"numpad0\" => Some(Key::NumPad0),\n\t\t\"numpad1\" => Some(Key::NumPad1),\n\t\t\"numpad2\" => Some(Key::NumPad2),\n\t\t\"numpad3\" => Some(Key::NumPad3),\n\t\t\"numpad4\" => Some(Key::NumPad4),\n\t\t\"numpad5\" => Some(Key::NumPad5),\n\t\t\"numpad6\" => Some(Key::NumPad6),\n\t\t\"numpad7\" => Some(Key::NumPad7),\n\t\t\"numpad8\" => Some(Key::NumPad8),\n\t\t\"numpad9\" => Some(Key::NumPad9),\n\t\t\"numpaddot\" => Some(Key::NumPadDot),\n\t\t\"numpadslash\" => Some(Key::NumPadSlash),\n\t\t\"numpadasterisk\" => Some(Key::NumPadAsterisk),\n\t\t\"numpadminus\" => Some(Key::NumPadMinus),\n\t\t\"numpadplus\" => Some(Key::NumPadPlus),\n\t\t\"numpadenter\" => Some(Key::NumPadEnter),\n\t\t\"leftalt\" => Some(Key::LeftAlt),\n\t\t\"rightalt\" => Some(Key::RightAlt),\n\t\t\"leftsuper\" => Some(Key::LeftSuper),\n\t\t\"rightsuper\" => Some(Key::RightSuper),\n\t\t\"unknown\" => Some(Key::Unknown),\n _ => None,\n }\n}\n#[no_mangle]\npub extern \"C\" fn window_is_key_down(id: u32, key: *const i8) -> u32 {\n let key = unsafe { std::ffi::CStr::from_ptr(key) }.to_str().unwrap();\n let key = str_to_key_code(key);\n if let Some(key) = key {\n WINDOWS.with(|map| {\n let map = map.borrow();\n if let Some(window) = map.get(&id) {\n if window.is_key_down(key) {\n 1\n } else {\n 0\n }\n } else {\n ERR_WINDOW_NOT_FOUND\n }\n })\n } else {\n 0\n }\n}\n\n#[no_mangle]\npub extern \"C\" fn window_is_mouse_button_down(id: u32, key: *const i8) -> u32 {\n let key = unsafe { std::ffi::CStr::from_ptr(key) }.to_str().unwrap();\n let key = str_to_mousekey_code(key);\n if let Some(key) = key {\n WINDOWS.with(|map| {\n let map = map.borrow();\n if let Some(window) = map.get(&id) {\n if window.get_mouse_down(key) {\n 1\n } else {\n 0\n }\n } else {\n ERR_WINDOW_NOT_FOUND\n }\n })\n } else {\n 0\n }\n}\n\n#[no_mangle]\npub extern \"C\" fn window_get_mouse_x(id: u32) -> f32 {\n\tWINDOWS.with(|map| {\n\t\tlet map = map.borrow();\n\t\tif let Some(window) = map.get(&id) {\n\t\t\tlet mouse = window.get_mouse_pos(MouseMode::Pass);\n\n\t\t\tif mouse.is_some() {\n\t\t\t\tlet mouse = mouse.unwrap();\n\t\t\t\treturn mouse.0;\n\t\t\t}\n\t\t}\n\t\t0.0\n\t})\n}\n\n#[no_mangle]\npub extern \"C\" fn window_get_mouse_y(id: u32) -> f32 {\n\tWINDOWS.with(|map| {\n\t\tlet map = map.borrow();\n\t\tif let Some(window) = map.get(&id) {\n\t\t\tlet mouse = window.get_mouse_pos(MouseMode::Pass);\n\n\t\t\tif mouse.is_some() {\n\t\t\t\tlet mouse = mouse.unwrap();\n\t\t\t\treturn mouse.1;\n\t\t\t}\n\t\t}\n\t\t0.0\n\t})\n}\n\n#[no_mangle]\npub extern \"C\" fn window_get_mouse_scroll(id: u32) -> f32 {\n\tWINDOWS.with(|map| {\n\t\tlet map = map.borrow();\n\t\tif let Some(window) = map.get(&id) {\n\t\t\tlet mouse = window.get_scroll_wheel();\n\n\t\t\tif mouse.is_some() {\n\t\t\t\tlet mouse = mouse.unwrap();\n\t\t\t\treturn mouse.1;\n\t\t\t}\n\t\t}\n\t\t0.0\n\t})\n}\n\n#[no_mangle]\npub extern \"C\" fn window_new(title: *const i8, width: usize, height: usize) -> u32 {\n WINDOWS.with(|map| {\n let mut map = map.borrow_mut();\n let mut id = 0u32;\n while map.contains_key(&id) {\n id += 1;\n }\n\n let title = unsafe { std::ffi::CStr::from_ptr(title) };\n let window = Window::new(\n title.to_str().unwrap(),\n width,\n height,\n WindowOptions::default(),\n )\n .unwrap();\n\n map.insert(id, window);\n id\n })\n}\n\n#[no_mangle]\npub extern \"C\" fn window_close(id: u32) -> u32 {\n WINDOWS.with(|map| {\n let mut map = map.borrow_mut();\n\n if map.contains_key(&id) {\n map.remove(&id);\n SUCCESS\n } else {\n ERR_WINDOW_NOT_FOUND\n }\n })\n}\n#[no_mangle]\npub extern \"C\" fn window_is_open(id: u32) -> u32 {\n WINDOWS.with(|map| {\n let map = map.borrow();\n if let Some(window) = map.get(&id) {\n if window.is_open() {\n 1\n } else {\n 0\n }\n } else {\n ERR_WINDOW_NOT_FOUND\n }\n })\n}\n\n#[no_mangle]\npub extern \"C\" fn window_is_active(id: u32) -> u32 {\n WINDOWS.with(|map| {\n let mut map = map.borrow_mut();\n if let Some(window) = map.get_mut(&id) {\n if window.is_active() {\n 1\n } else {\n 0\n }\n } else {\n ERR_WINDOW_NOT_FOUND\n }\n })\n}\n\n#[no_mangle]\npub extern \"C\" fn window_limit_update_rate(id: u32, ms: u64) -> u32 {\n WINDOWS.with(|map| {\n let mut map = map.borrow_mut();\n\n if let Some(window) = map.get_mut(&id) {\n window.limit_update_rate(if ms == 0 {\n None\n } else {\n Some(std::time::Duration::from_micros(ms))\n });\n SUCCESS\n } else {\n ERR_WINDOW_NOT_FOUND\n }\n })\n}\n\n#[no_mangle]\npub extern \"C\" fn window_update_with_buffer(\n id: u32,\n buffer: *const u8,\n width: usize,\n height: usize,\n) -> u32 {\n WINDOWS.with(|map| {\n let mut map = map.borrow_mut();\n\n if let Some(window) = map.get_mut(&id) {\n let bufu8: &[u8] = unsafe { std::slice::from_raw_parts(buffer, width * height * 4) };\n let mut buffer = vec![0u32; width * height];\n\n let mut idx = 0;\n while idx < buffer.len() {\n let r = bufu8[idx * 4 + 0] as u32;\n let g = bufu8[idx * 4 + 1] as u32;\n let b = bufu8[idx * 4 + 2] as u32;\n\n buffer[idx] = (r << 16) | (g << 8) | b;\n idx += 1;\n }\n\n if let Ok(()) = window.update_with_buffer(&buffer, width, height) {\n SUCCESS\n } else {\n ERR_UPDATE_WITH_BUFFER_FAILED\n }\n } else {\n ERR_WINDOW_NOT_FOUND\n }\n })\n}\n\n#[no_mangle]\npub extern \"C\" fn window_update(id: u32) -> u32 {\n WINDOWS.with(|map| {\n let mut map = map.borrow_mut();\n\n if let Some(window) = map.get_mut(&id) {\n window.update();\n SUCCESS\n } else {\n ERR_WINDOW_NOT_FOUND\n }\n })\n}\n"},"prefix":{"kind":"string","value":"\nextern crate minifb;\nuse std::cell::RefCell;\nuse std::collections::HashMap;\n\nuse minifb::Key;\nuse minifb::Window;\nuse minifb::WindowOptions;\nuse minifb::MouseMode;\nuse minifb::MouseButton;\n\npub static SUCCESS: u32 = 0;\npub static ERR_WINDOW_NOT_FOUND: u32 = 2;\npub static ERR_UPDATE_WITH_BUFFER_FAILED: u32 = 3;\n\nthread_local! {\n static WINDOWS: RefCell<HashMap<u32, Window>> = RefCell::new(HashMap::new());\n}\nfn str_to_mousekey_code(key: &str) -> Option<MouseButton> {\n match key {\n \"left\" => Some(MouseButton::Left),\n\t\t\"right\" => Some(MouseButton::Right),\n\t\t\"middle\" => Some(MouseButton::Middle),\n\t\t_ => None,\n\t}\n}\n\nfn str_to_key_code(key: &str) -> Option<Key> {\n match key {\n \"key0\" => Some(Key::Key0),\n\t\t\"key1\" => Some(Key::Key1),\n\t\t\"key2\" => Some(Key::Key2),\n\t\t\"key3\" => Some(Key::Key3),\n\t\t\"key4\" => Some(Key::Key4),\n\t\t\"key5\" => Some(Key::Key5),\n\t\t\"key6\" => Some(Key::Key6),\n\t\t\"key7\" => Some(Key::Key7),\n\t\t\"key8\" => Some(Key::Key8),\n\t\t\"key9\" => Some(Key::Key9),\n\t\t\"a\" => Some(Key::A),\n\t\t\"b\" => Some(Key::B),\n\t\t\"c\" => Some(Key::C),\n\t\t\"d\" => Some(Key::D),\n\t\t\"e\" => Some(Key::E),\n\t\t\"f\" => Some(Key::F),\n\t\t\"g\" => Some(Key::G),\n\t\t\"h\" => Some(Key::H),\n\t\t\"i\" => Some(Key::I),\n\t\t\"j\" => Some(Key::J),\n\t\t\"k\" => Some(Key::K),\n\t\t\"l\" => Some(Key::L),\n\t\t\"m\" => Some(Key::M),\n\t\t\"n\" => Some(Key::N),\n\t\t\"o\" => Some(Key::O),\n\t\t\"p\" => Some(Key::P),\n\t\t\"q\" => Some(Key::Q),\n\t\t\"r\" => Some(Key::R),\n\t\t\"s\" => Some(Key::S),\n\t\t\"t\" => Some(Key::T),\n\t\t\"u\" => Some(Key::U),\n\t\t\"v\" => Some(Key::V),\n\t\t\"w\" => Some(Key::W),\n\t\t\"x\" => Some(Key::X),\n\t\t\"y\" => Some(Key::Y),\n\t\t\"z\" => Some(Key::Z),\n\t\t\"f1\" => Some(Key::F1),\n\t\t\"f2\" => Some(Key::F2),\n\t\t\"f3\" => Some(Key::F3),\n\t\t\"f4\" => Some(Key::F4),\n\t\t\"f5\" => Some(Key::F5),\n\t\t\"f6\" => Some(Key::F6),\n\t\t\"f7\" => Some(Key::F7),\n\t\t\"f8\" => Some(Key::F8),\n\t\t\"f9\" => Some(Key::F9),\n\t\t\"f10\" => Some(Key::F10),\n\t\t\"f11\" => Some(Key::F11),\n\t\t\"f12\" => Some(Key::F12),\n\t\t\"f13\" => Some(Key::F13),\n\t\t\"f14\" => Some(Key::F14),\n\t\t\"f15\" => Some(Key::F15),\n\t\t\"down\" => Some(Key::Down),\n\t\t\"left\" => Some(Key::Left),\n\t\t\"right\" => Some(Key::Right),\n\t\t\"up\" => Some(Key::Up),\n\t\t\"apostrophe\" => Some(Key::Apostrophe),\n\t\t\"backquote\" => Some(Key::Backquote),\n\t\t\"backslash\" => Some(Key::Backslash),\n\t\t\"comma\" => Some(Key::Comma),\n\t\t\"equal\" => Some(Key::Equal),\n\t\t\"leftbracket\" => Some(Key::LeftBracket),\n\t\t\"minus\" => Some(Key::Minus),\n\t\t\"period\" => Some(Key::Period),\n\t\t\"rightbracket\" => Some(Key::RightBracket),\n\t\t\"semicolon\" => Some(Key::Semicolon),\n\t\t\"slash\" => Some(Key::Slash),\n\t\t\"backspace\" => Some(Key::Backspace),\n\t\t\"delete\" => Some(Key::Delete),\n\t\t\"end\" => Some(Key::End),\n\t\t\"enter\" => Some(Key::Enter),\n\t\t\"escape\" => Some(Key::Escape),\n\t\t\"home\" => Some(Key::Home),\n\t\t\"insert\" => Some(Key::Insert),\n\t\t\"menu\" => Some(Key::Menu),\n\t\t\"pagedown\" => Some(Key::PageDown),\n\t\t\"pageup\" => Some(Key::PageUp),\n\t\t\"pause\" => Some(Key::Pause),\n\t\t\"space\" => Some(Key::Space),\n\t\t\"tab\" => Some(Key::Tab),\n\t\t\"numlock\" => Some(Key::NumLock),\n\t\t\"capslock\" => Some(Key::CapsLock),\n\t\t\"scrolllock\" => Some(Key::ScrollLock),\n\t\t\"leftshift\" => Some(Key::LeftShift),\n\t\t\"rightshift\" => Some(Key::RightShift),\n\t\t\"leftctrl\" => Some(Key::LeftCtrl),\n\t\t\"rightctrl\" => Some(Key::RightCtrl),\n\t\t\"numpad0\" => Some(Key::NumPad0),\n\t\t\"numpad1\" => Some(Key::NumPad1),\n\t\t\"numpad2\" => Some(Key::NumPad2),\n\t\t\"numpad3\" => Some(Key::NumPad3),\n\t\t\"numpad4\" => Some(Key::NumPad4),\n\t\t\"numpad5\" => Some(Key::NumPad5),\n\t\t\"numpad6\" => Some(Key::NumPad6),\n\t\t\"numpad7\" => Some(Key::NumPad7),\n\t\t\"numpad8\" => Some(Key::NumPad8),\n\t\t\"numpad9\" => Some(Key::NumPad9),\n\t\t\"numpaddot\" => Some(Key::NumPadDot),\n\t\t\"numpadslash\" => Some(Key::NumPadSlash),\n\t\t\"numpadasterisk\" => Some(Key::NumPadAsterisk),\n\t\t\"numpadminus\" => Some(Key::NumPadMinus),\n\t\t\"numpadplus\" => Some(Key::NumPadPlus),\n\t\t\"numpadenter\" => Some(Key::NumPadEnter),\n\t\t\"leftalt\" => Some(Key::LeftAlt),\n\t\t\"rightalt\" => Some(Key::RightAlt),\n\t\t\"leftsuper\" => Some(Key::LeftSuper),\n\t\t\"rightsuper\" => Some(Key::RightSuper),\n\t\t\"unknown\" => Some(Key::Unknown),\n _ => None,\n }\n}\n#[no_mangle]\npub extern \"C\" fn window_is_key_down(id: u32, key: *const i8) -> u32 {\n let key = unsafe { std::ffi::CStr::from_ptr(key) }.to_str().unwrap();\n let key = str_to_key_code(key);\n if let Some(key) = key {\n WINDOWS.with(|map| {\n let map = map.borrow();\n if let Some(window) = map.get(&id) {\n if window.is_key_down(key) {\n 1\n } else {\n 0\n }\n } else {\n ERR_WINDOW_NOT_FOUND\n }\n })\n } else {\n 0\n }\n}\n\n#[no_mangle]\npub extern \"C\" fn window_is_mouse_button_down(id: u32, key: *const i8) -> u32 {\n let key = unsafe { std::ffi::CStr::from_ptr(key) }.to_str().unwrap();\n let key = str_to_mousekey_code(key);\n if let Some(key) = key {\n WINDOWS.with(|map| {\n let map = map.borrow();\n if let Some(window) = map.get(&id) {\n if window.get_mouse_down(key) {\n 1\n } else {\n 0\n }\n } else {\n ERR_WINDOW_NOT_FOUND\n }\n })\n } else {\n 0\n }\n}\n\n#[no_mangle]\npub extern \"C\" fn window_get_mouse_x(id: u32) -> f32 {\n\tWINDOWS.with(|map| {\n\t\tlet map = map.borrow();\n\t\tif let Some(window) = map.get(&id) {\n\t\t\tlet mouse = window.get_mouse_pos(MouseMode::Pass);\n\n\t\t\tif mouse.is_some() {\n\t\t\t\tlet mouse = mouse.unwrap();\n\t\t\t\treturn mouse.0;\n\t\t\t}\n\t\t}\n\t\t0.0\n\t})\n}\n\n#[no_mangle]\npub extern \"C\" fn window_get_mouse_y(id: u32) -> f32 {\n\tWINDOWS.with(|map| {\n\t\tlet map = map.borrow();\n\t\tif let Some(window) = map.get(&id) {\n\t\t\tlet mouse = window.get_mouse_pos(MouseMode::Pass);\n\n\t\t\tif mouse.is_some() {\n\t\t\t\tlet mouse = mouse.unwrap();\n\t\t\t\treturn mouse.1;\n\t\t\t}\n\t\t}\n\t\t0.0\n\t})\n}\n\n#[no_mangle]\npub extern \"C\" fn window_get_mouse_scroll(id: u32) -> f32 {\n\tWINDOWS.with(|map| {\n\t\tlet map = map.borrow();\n\t\tif let Some(window) = map.get(&id) {\n\t\t\tlet mouse = window.get_scroll_wheel();\n\n\t\t\tif mouse.is_some() {\n\t\t\t\tlet mouse = mouse.unwrap();\n\t\t\t\treturn mouse.1;\n\t\t\t}\n\t\t}\n\t\t0.0\n\t})\n}\n\n#[no_mangle]\npub extern \"C\" fn window_new(title: *const i8, width: usize, height: usize) -> u32 {\n WINDOWS.with(|map| {\n let mut map = map.borrow_mut();\n let mut id = 0u32;\n while map.contains_key(&id) {\n id += 1;\n }\n\n let title = unsafe { std::ffi::CStr::from_ptr(title) };\n let window = Window::new(\n title.to_str().unwrap(),\n width,\n height,\n WindowOptions::default(),\n )\n .unwrap();\n\n map.insert(id, window);\n id\n })\n}\n\n#[no_mangle]\npub extern \"C\" fn window_close(id: u32) -> u32 {\n WINDOWS.with(|map| {\n let mut map = map.borrow_mut();\n\n if map.contains_key(&id) {\n map.remove(&id);\n SUCCESS\n } else {\n ERR_WINDOW_NOT_FOUND\n }\n })\n}\n#[no_mangle]\n"},"suffix":{"kind":"string","value":"\n\n#[no_mangle]\npub extern \"C\" fn window_is_active(id: u32) -> u32 {\n WINDOWS.with(|map| {\n let mut map = map.borrow_mut();\n if let Some(window) = map.get_mut(&id) {\n if window.is_active() {\n 1\n } else {\n 0\n }\n } else {\n ERR_WINDOW_NOT_FOUND\n }\n })\n}\n\n#[no_mangle]\npub extern \"C\" fn window_limit_update_rate(id: u32, ms: u64) -> u32 {\n WINDOWS.with(|map| {\n let mut map = map.borrow_mut();\n\n if let Some(window) = map.get_mut(&id) {\n window.limit_update_rate(if ms == 0 {\n None\n } else {\n Some(std::time::Duration::from_micros(ms))\n });\n SUCCESS\n } else {\n ERR_WINDOW_NOT_FOUND\n }\n })\n}\n\n#[no_mangle]\npub extern \"C\" fn window_update_with_buffer(\n id: u32,\n buffer: *const u8,\n width: usize,\n height: usize,\n) -> u32 {\n WINDOWS.with(|map| {\n let mut map = map.borrow_mut();\n\n if let Some(window) = map.get_mut(&id) {\n let bufu8: &[u8] = unsafe { std::slice::from_raw_parts(buffer, width * height * 4) };\n let mut buffer = vec![0u32; width * height];\n\n let mut idx = 0;\n while idx < buffer.len() {\n let r = bufu8[idx * 4 + 0] as u32;\n let g = bufu8[idx * 4 + 1] as u32;\n let b = bufu8[idx * 4 + 2] as u32;\n\n buffer[idx] = (r << 16) | (g << 8) | b;\n idx += 1;\n }\n\n if let Ok(()) = window.update_with_buffer(&buffer, width, height) {\n SUCCESS\n } else {\n ERR_UPDATE_WITH_BUFFER_FAILED\n }\n } else {\n ERR_WINDOW_NOT_FOUND\n }\n })\n}\n\n#[no_mangle]\npub extern \"C\" fn window_update(id: u32) -> u32 {\n WINDOWS.with(|map| {\n let mut map = map.borrow_mut();\n\n if let Some(window) = map.get_mut(&id) {\n window.update();\n SUCCESS\n } else {\n ERR_WINDOW_NOT_FOUND\n }\n })\n}\n"},"middle":{"kind":"string","value":"pub extern \"C\" fn window_is_open(id: u32) -> u32 {\n WINDOWS.with(|map| {\n let map = map.borrow();\n if let Some(window) = map.get(&id) {\n if window.is_open() {\n 1\n } else {\n 0\n }\n } else {\n ERR_WINDOW_NOT_FOUND\n }\n })\n}"},"strategy":{"kind":"string","value":"function_block-full_function"},"context_items":{"kind":"list like","value":[{"content":"const width = 800;\n","file_path":"examples/test.ts","rank":2,"score":55611.0160243587},{"content":"const height = 600;\n","file_path":"examples/test.ts","rank":3,"score":55611.0160243587},{"content":"const H = 300;\n","file_path":"canvas/examples/tetris.ts","rank":4,"score":54832.42854458706},{"content":"const W = 300;\n","file_path":"canvas/examples/tetris.ts","rank":5,"score":54832.42854458706},{"content":"let P = MakePermutation();\n","file_path":"canvas/examples/perlin.ts","rank":6,"score":54803.60461176964},{"content":"const P = MakePermutation();\n","file_path":"canvas/examples/terrain.ts","rank":7,"score":54803.60461176964},{"content":"let width: any\n","file_path":"canvas/examples/spiral.ts","rank":8,"score":54691.095863010516},{"content":" get height(): number {\n\n return this.#height;\n","file_path":"canvas/Ctx.ts","rank":9,"score":54691.095863010516},{"content":"let height: any\n","file_path":"canvas/examples/spiral.ts","rank":10,"score":54691.095863010516},{"content":" get width(): number {\n\n return this.#width;\n","file_path":"canvas/Ctx.ts","rank":11,"score":54691.095863010516},{"content":"export function unwrapBoolean(result: number): boolean {\n\n if (result !== 0 && result !== 1) {\n\n unwrap(result);\n\n return false;\n\n } else {\n\n return result === 1;\n\n }\n","file_path":"lib/utils.ts","rank":12,"score":30007.036543887454},{"content":"const SPACING = 4;\n","file_path":"canvas/examples/spiral.ts","rank":13,"score":30007.036543887454},{"content":" isKeyDown(key: string): boolean {\n\n return unwrapBoolean(lib.symbols.window_is_key_down(this.#id, new Uint8Array([...encode(key), 0])));\n","file_path":"lib/Neko.ts","rank":14,"score":29947.28940163874},{"content":"let rightPressed = false; \n","file_path":"canvas/examples/brickbreaker.ts","rank":15,"score":29137.084644085677},{"content":"const thetaZ = theta * Math.PI / 180\n","file_path":"canvas/examples/terrain.ts","rank":16,"score":29107.145138897977},{"content":"let leftPressed = false;\n","file_path":"canvas/examples/brickbreaker.ts","rank":17,"score":29107.145138897977},{"content":"const BLOCK_H = H / ROWS;\n","file_path":"canvas/examples/tetris.ts","rank":18,"score":29107.145138897977},{"content":"let thetaZ = theta * Math.PI / 180\n","file_path":"canvas/examples/cube.ts","rank":19,"score":29107.145138897977},{"content":"const BLOCK_W = W / COLS;\n","file_path":"canvas/examples/tetris.ts","rank":20,"score":29107.145138897977},{"content":" isMouseButtonDown(key: string): boolean {\n\n return unwrapBoolean(lib.symbols.window_is_mouse_button_down(this.#id, new Uint8Array([...encode(key), 0])));\n","file_path":"lib/Neko.ts","rank":21,"score":29079.069666885345},{"content":"const brickHeight = 20;\n","file_path":"canvas/examples/brickbreaker.ts","rank":22,"score":29024.158902857176},{"content":"const paddleHeight = 10;\n","file_path":"canvas/examples/brickbreaker.ts","rank":23,"score":29024.158902857176},{"content":"const brickWidth = 80;\n","file_path":"canvas/examples/brickbreaker.ts","rank":24,"score":29024.158902857176},{"content":"let paddleWidth = 75;\n","file_path":"canvas/examples/brickbreaker.ts","rank":25,"score":29024.158902857176},{"content":"let lastX: any\n","file_path":"canvas/examples/spiral.ts","rank":26,"score":28996.8191676101},{"content":"let currentX: number | undefined;\n","file_path":"canvas/examples/tetris.ts","rank":27,"score":28996.8191676101},{"content":"const foodX: any[] = [];\n","file_path":"canvas/examples/snake.ts","rank":28,"score":28996.8191676101},{"content":"let thetaX = theta * Math.PI / 180\n","file_path":"canvas/examples/cube.ts","rank":29,"score":28996.8191676101},{"content":"const thetaX = theta * Math.PI / 180\n","file_path":"canvas/examples/terrain.ts","rank":30,"score":28996.8191676101},{"content":"let paddleX = (canvas.width - paddleWidth) / 2;\n","file_path":"canvas/examples/brickbreaker.ts","rank":31,"score":28996.8191676101},{"content":"const brickOffsetLeft = 40;\n","file_path":"canvas/examples/brickbreaker.ts","rank":32,"score":28287.058158667696},{"content":" getMousePosition(): [number, number] {\n\n return [lib.symbols.window_get_mouse_x(this.#id), lib.symbols.window_get_mouse_y(this.#id)];\n","file_path":"lib/Neko.ts","rank":33,"score":28259.77370648719},{"content":"<p align=\"center\">\n\n <img src=https://raw.githubusercontent.com/load1n9/neko/master/assets/neko.png width=\"100rem\" /> \n\n <br>\n\n <h1 align=\"center\" >Neko 🐈</h1>\n\n</p>\n\n\n\nneko's twin frame buffer deno module built on top of mini_fb with canvas api implementation\n\n<p align=\"center\">\n\n <a href=\"https://github.com/load1n9/neko/stargazers\">\n\n <img alt=\"neko stars\" src=\"https://img.shields.io/github/stars/load1n9/neko?logo=data:image/png;base64,iVBORw0KGgoAAAANSUhEUgAAABwAAAAcCAYAAAEFCu8CAAAABGdBTUEAALGPC/xhBQAAADhlWElmTU0AKgAAAAgAAYdpAAQAAAABAAAAGgAAAAAAAqACAAQAAAABAAAAHKADAAQAAAABAAAAHAAAAABHddaYAAABxElEQVRIDe2Wv04CQRDGAQuoTKQ2ITyADZWVJZWV+gJYWBNqKh/C16CRBlprWxsTE2NJfABNOH9z7Gzm2Nv7A8TCOMnHzs1838ze3e4ejUbMkiRZS64lP1x8MjTFr2DQE6Gl2nI+7POARXAmdbas44ku8eLGhU9UckRliX6qxM9sQvz0vrcVaaKJKdsSNO7LOtK1kvcbaXVRu4LMz9kgKoYwBq/KLBi/yC2DQgSnBaLMQ88Tx7Q3AVkDKHpgBdoak5HrCSjuaAW/6zOz+u/Q3ZfcVrhliuaPYCAqsSJekIO/TlWbn2BveAH5JZBVUWayusZW2ClTuPzMi6xTIp5abuBHxHLcZSyzkxHF1uNJRrV9gXBhOl7h6wFW/FqcaGILEmsDWfg9G//3858Az0lWaHhm5dP3i9JoDtTm+1UrUdMl72OZv10itfx3zOYpLAv/FPQNLvFj35Bnco/gzeCD72H6b4JYaDTpgidwaJOa3bCji5BsgYcDdJUamSMi2lQTCEbgu0Zz4Y5UX3tE3K/RTKny3qNWdst3UWU8sYtmU40py2Go9o5zC460l/guJjm1leZrjaiH4B4cVxUK12mGVTV/j/cDqcFClUX01ZEAAAAASUVORK5CYII=\" />\n\n </a>\n\n <a href=\"https://github.com/load1n9/neko/releases/latest/\">\n\n <img alt=\"neko releases\" src=\"https://img.shields.io/github/v/release/load1n9/neko?logo=github\" />\n\n </a>\n\n <a href=\"https://github.com/load1n9/neko/blob/master/LICENSE\">\n\n <img alt=\"neko License\" src=\"https://img.shields.io/github/license/load1n9/neko?logo=data:image/png;base64,iVBORw0KGgoAAAANSUhEUgAAABwAAAAcCAYAAAEFCu8CAAAABGdBTUEAALGPC/xhBQAAADhlWElmTU0AKgAAAAgAAYdpAAQAAAABAAAAGgAAAAAAAqACAAQAAAABAAAAHKADAAQAAAABAAAAHAAAAABHddaYAAAC5UlEQVRIDd2WPWtVQRCGby5pVASLiGghQSxyG8Ui2KWwCfkH9olY2JneQkiR0oCIxH/gB+qVFDYBIWBAbAIRSbCRpLXwIxLiPT7vnNm9e87ZxJtUwYH3zO47Mzv7Mbv3tlo5KYriGtgAJ81OY1ENdG/YI4boFEOI911BXgY/pdtwGuAtXpvmB1tAXHDnUolE5urkPOQo6MqA3pXWmJJL4Bb4rQ7yEYfxsjnIF29NJIoNC6e5fxOL/qN+9KCz7AaLpN8zI415N2i2EptpGrkRIjGeAuvR6IY1hSFLFUOug9Ms2M7ZxIUNytm1mnME186sdI2BOCwAyQMg54ugzSmKmwbPwSbolKH+hbAtQdsOoF+BsF3anUVwBdiOWRidFZDKTTrKEAJTm3GVrGkHzw/uPZbyx7DNNLfB7KGmRsCcr+/gjaiPSpAOTyX9qG4L/XBDdWXDDf1M+wtQ5fwCOtcb4Dto6VpLmzByB6gqdHbTItGSJdAGqibJQhmRfCF7IN4beSF2G9CqnGXQrxofXU+EykllNeoczRgYytDKMubDIRK0g5MF8rE69cGu0u9nlUcqaUZ41W0qK2nGcSzr4D2wV9U9wxp1rnpxn8agXAOHMQ9cy9kbHM7ngY4gFb03TxrO/yfBUifTtXt78jCrjY/jgEFnMn45LuNWUtknuu7NSm7D3QEn3HbatV1Q2jvgIRf1sfODKQaeymxZoMLlTqsq1LF+HvaTqQOzEzUCfni0/eNIA+DfuE3KEtbsegckGmMktTXacnBHPVe687ugkpT+axCkkhBSyRSjWI2xf1KMMVmYiQdWksK9BEFiQoiYLIlvJA3/zeTzCejP0RbB6YPbhZuB+0pR3KcdX0LaJtju0ZgBL8Bd+sbz2QIaU2OfBX3BaQLsgZysQtrk0M8Sh1A0w3DyyYnGnAiZ4gqZ/TvI2A8OGd1YIbF7+F3P+B6dYpYdsJNZgrjO0UdOIhmom0nwL0pnfnzkL1803jAoKhvyAAAAAElFTkSuQmCC\" />\n\n </a>\n\n </p>\n\n<hr/>\n\n\n","file_path":"README.md","rank":34,"score":25640.785658484252},{"content":"## [Canvas API using Neko](https://github.com/load1n9/neko/tree/master/canvas)\n\n\n\n<img src=\"https://raw.githubusercontent.com/load1n9/neko/master/assets/tetris.png\" width=\"1500rem\" />\n\n### Usage\n\n\n\n#### Using Methods\n\n\n\n```typescript\n\nimport { World, Neko } from \"https://deno.land/x/neko/mod.ts\";\n\n\n\nconst width = 800;\n\nconst height = 600;\n\n\n\nconst neko = new Neko({\n\n title: \"Neko\",\n\n width,\n\n height,\n\n});\n\nconst frame = new Uint8Array(width * height * 4).fill(0x000000);\n\nclass Instance extends World {\n\n update() {\n\n frame[Math.round(Math.random() * frame.length)] = Math.round(Math.random() * 0xffffff);\n\n neko.setFrameBuffer(frame);\n\n }\n\n}\n\n\n\nnew Instance().start(neko, 60);\n\n```\n\n#### Using Functions\n\n```typescript\n\nimport { World, Neko } from \"https://deno.land/x/neko/mod.ts\";\n\n\n\nconst width = 800;\n\nconst height = 600;\n\n\n\nconst neko = new Neko({\n\n title: \"Neko\",\n\n width,\n\n height,\n\n});\n\nconst frame = new Uint8Array(width * height * 4).fill(0x000000);\n\nnew World().start(neko, {\n\n fps: 60,\n\n update: () => {\n\n frame[Math.round(Math.random() * frame.length)] = Math.round(Math.random() * 0xffffff);\n\n neko.setFrameBuffer(frame);\n\n }\n\n});\n\n```\n\n### Maintainers\n\n- Loading ([@load1n9](https://github.com/load1n9))\n\n\n","file_path":"README.md","rank":35,"score":25639.780087096955},{"content":"export { Neko } from \"./lib/Neko.ts\";\n","file_path":"mod.ts","rank":36,"score":25630.810228469283},{"content":"# Neko Canvas 🐈\n\n\n\n### Usage\n\n\n\n#### Render a red square\n\n```typescript\n\nimport { Canvas } from \"https://deno.land/x/neko/canvas/mod.ts\";\n\n\n\nconst canvas = new Canvas({\n\n title: \"Neko\",\n\n width: 200,\n\n height: 200,\n\n fps: 60,\n\n});\n\n\n\nconst ctx = canvas.getContext(\"2d\");\n\n\n\nctx.fillStyle = \"red\";\n\nctx.fillRect(10, 10, 50, 50);\n\n```\n\n#### Render an Image\n\n```typescript\n\nimport { Canvas, loadImage } from \"https://deno.land/x/neko/canvas/mod.ts\";\n\n\n\nconst canvas = new Canvas({\n\n title: \"Neko\",\n\n width: 500,\n\n height: 500,\n\n});\n\n\n\nconst ctx = canvas.getContext(\"2d\");\n\n// image created by Hashrock (https://hashrock.studio.site)\n\nconst img = await loadImage(\"https://deno.land/images/artwork/hashrock_simple.png\");\n\nctx.drawImage(img, 0, 0);\n\n```\n","file_path":"canvas/README.md","rank":37,"score":24988.44384608725},{"content":"import { Plug } from \"https://deno.land/x/plug@0.5.1/mod.ts\";\n\nimport { NekoOptions } from \"./types.ts\";\n\nimport { encode, unwrap, unwrapBoolean } from \"./utils.ts\";\n\n\n\nconst options: Plug.Options = {\n\n name: \"neko\",\n\n urls: {\n\n windows: `https://github.com/load1n9/neko/blob/master/dist/neko.dll?raw=true`,\n\n darwin: `https://github.com/load1n9/neko/blob/master/dist/libneko.dylib?raw=true`,\n\n linux: `https://github.com/load1n9/neko/blob/master/dist/libneko.so?raw=true` \n\n },\n\n};\n\n\n\nconst lib = await Plug.prepare(options, {\n\n window_new: {\n\n parameters: [\"pointer\", \"usize\", \"usize\"],\n\n result: \"u32\",\n\n },\n\n\n\n window_close: {\n\n parameters: [\"u32\"],\n\n result: \"u32\",\n\n },\n\n window_is_open: {\n\n parameters: [\"u32\"],\n\n result: \"u32\",\n\n },\n\n window_is_key_down: {\n\n parameters: [\"u32\", \"pointer\"],\n\n result: \"u32\",\n\n },\n\n\n\n window_is_mouse_button_down: {\n\n parameters: [\"u32\", \"pointer\"],\n\n result: \"u32\",\n\n },\n\n\n\n window_is_active: {\n\n parameters: [\"u32\"],\n\n result: \"u32\",\n\n },\n\n\n\n window_limit_update_rate: {\n\n parameters: [\"u32\", \"u64\"],\n\n result: \"u32\",\n\n },\n\n\n\n window_update_with_buffer: {\n\n parameters: [\"u32\", \"pointer\", \"usize\", \"usize\"],\n\n result: \"u32\",\n\n },\n\n\n\n window_update: {\n\n parameters: [\"u32\"],\n\n result: \"u32\",\n\n },\n\n\n\n window_get_mouse_x: {\n\n parameters: [\"u32\"],\n\n result: \"f32\",\n\n },\n\n\n\n window_get_mouse_y: {\n\n parameters: [\"u32\"],\n\n result: \"f32\",\n\n },\n\n\n\n window_get_mouse_scroll: {\n\n parameters: [\"u32\"],\n\n result: \"f32\",\n\n },\n\n});\n\n\n\n\n\nexport class Neko {\n\n #id;\n\n width: number;\n\n height: number;\n\n constructor(options: NekoOptions) {\n\n this.width = options.width;\n\n this.height = options.height;\n\n this.#id = lib.symbols.window_new(\n\n new Uint8Array([...encode(options.title), 0]),\n\n options.width,\n\n options.height,\n\n );\n\n }\n\n limitUpdateRate(micros: number) {\n\n unwrap(lib.symbols.window_limit_update_rate(this.#id, micros));\n\n }\n\n setFrameBuffer(buffer: Uint8Array, width?: number, height?: number) {\n\n unwrap(\n\n lib.symbols.window_update_with_buffer(\n\n this.#id,\n\n buffer,\n\n width ?? this.width,\n\n height ?? this.height,\n\n )\n\n );\n\n }\n\n\n\n update() {\n\n unwrap(lib.symbols.window_update(this.#id));\n\n }\n\n\n\n close() {\n\n unwrap(lib.symbols.window_close(this.#id));\n\n }\n\n\n\n isKeyDown(key: string): boolean {\n\n return unwrapBoolean(lib.symbols.window_is_key_down(this.#id, new Uint8Array([...encode(key), 0])));\n\n }\n\n\n\n isMouseButtonDown(key: string): boolean {\n\n return unwrapBoolean(lib.symbols.window_is_mouse_button_down(this.#id, new Uint8Array([...encode(key), 0])));\n\n }\n\n\n\n getScroll(): number {\n\n return lib.symbols.window_get_mouse_scroll(this.#id);\n\n }\n\n\n\n\n\n getMousePosition(): [number, number] {\n\n return [lib.symbols.window_get_mouse_x(this.#id), lib.symbols.window_get_mouse_y(this.#id)];\n\n }\n\n\n\n get open(): boolean {\n\n return unwrapBoolean(lib.symbols.window_is_open(this.#id));\n\n }\n\n\n\n get active(): boolean {\n\n return unwrapBoolean(lib.symbols.window_is_active(this.#id));\n\n }\n\n}\n","file_path":"lib/Neko.ts","rank":38,"score":24981.80989607868},{"content":"import { World, Neko } from \"../mod.ts\";\n\n\n\nconst width = 800;\n\nconst height = 600;\n\n\n\nconst neko = new Neko({\n\n title: \"Neko\",\n\n width,\n\n height,\n\n});\n\nconst frame = new Uint8Array(width * height * 4).fill(0x000000);\n\nclass Instance extends World {\n\n update() {\n\n frame[Math.round(Math.random() * frame.length)] = Math.round(Math.random() * 0xffffff);\n\n neko.setFrameBuffer(frame);\n\n }\n\n}\n\n\n","file_path":"examples/test.ts","rank":39,"score":24981.80989607868},{"content":"import { Neko } from \"./Neko.ts\";\n\nimport { WorldSettings } from \"./types.ts\";\n\n\n\nexport class World {\n\n start(renderer: Neko, settingsOrFps: number | WorldSettings = 60) {\n\n const settings = typeof settingsOrFps === \"number\" ? { fps: settingsOrFps } : settingsOrFps;\n\n const fps = typeof settingsOrFps === \"number\" ? settingsOrFps : settingsOrFps.fps;\n\n (settings.setup || this.setup)();\n\n setInterval(() => {\n\n if (renderer.open) {\n\n (settings.update || this.update)();\n\n } else {\n\n Deno.exit(0)\n\n }\n\n }, 1 / fps * 1000)\n\n }\n\n setup() {\n\n \n\n }\n\n update() {\n\n\n\n }\n","file_path":"lib/World.ts","rank":40,"score":24981.80989607868},{"content":"import { Neko, World } from \"../mod.ts\";\n\nimport { createCanvas } from \"https://deno.land/x/canvas@v1.4.1/mod.ts\";\n\nimport type {\n\n CanvasRenderingContext2D,\n\n EmulatedCanvas2D,\n\n} from \"https://deno.land/x/canvas@v1.4.1/mod.ts\";\n\ninterface Config {\n\n title?: string;\n\n width?: number;\n\n height?: number;\n\n fps?: number;\n\n}\n\nexport class Canvas {\n\n #title: string;\n\n #ctx: CanvasRenderingContext2D;\n\n #canvas: EmulatedCanvas2D;\n\n window: Neko;\n\n #world: World;\n\n #width: number;\n\n #height: number;\n\n #fps: number;\n\n constructor(config: Config) {\n\n this.#world = new World();\n\n this.#height = config.height || 200;\n\n this.#width = config.width || 200;\n\n this.#title = config.title || \"Neko\";\n\n this.#fps = config.fps || 60;\n\n this.#canvas = createCanvas(this.#width, this.#height);\n\n this.#ctx = this.#canvas.getContext(\"2d\");\n\n this.window = new Neko({\n\n title: this.#title,\n\n width: this.#width,\n\n height: this.#height,\n\n });\n\n this.#world.start(this.window, {\n\n fps: this.#fps,\n\n update: () => {\n\n this.window.setFrameBuffer(\n\n this.#canvas.getRawBuffer(0, 0, this.#width, this.#height),\n\n );\n\n },\n\n });\n\n }\n\n getContext(_type = \"2d\"): CanvasRenderingContext2D {\n\n return this.#ctx;\n\n }\n\n get canvas(): EmulatedCanvas2D {\n\n return this.#canvas;\n\n }\n\n get width(): number {\n\n return this.#width;\n\n }\n\n get height(): number {\n\n return this.#height;\n\n }\n\n}\n","file_path":"canvas/Ctx.ts","rank":41,"score":24981.80989607868},{"content":"export interface NekoOptions {\n\n title: string;\n\n width: number;\n\n height: number;\n\n}\n\nexport interface WorldSettings {\n\n fps: number;\n\n setup?: () => void;\n\n update?: () => void;\n","file_path":"lib/types.ts","rank":42,"score":24981.80989607868},{"content":"export const encode = (str: string): Uint8Array => new TextEncoder().encode(str);\n\n\n\nconst ERROR_CODES: {\n\n [code: number]: string | undefined;\n\n} = {\n\n 2: \"Window not found\",\n\n 3: \"Failed to updateWithBuffer\",\n\n};\n\n\n\nexport function unwrap(result: number) {\n\n let error;\n\n if ((error = ERROR_CODES[result])) {\n\n throw new Error(`Unwrap called on Error Value (${result}): ${error}`);\n\n }\n\n}\n\n\n\nexport function unwrapBoolean(result: number): boolean {\n\n if (result !== 0 && result !== 1) {\n\n unwrap(result);\n\n return false;\n\n } else {\n\n return result === 1;\n\n }\n\n}\n","file_path":"lib/utils.ts","rank":43,"score":24981.80989607868},{"content":"export * from \"./Ctx.ts\";\n","file_path":"canvas/mod.ts","rank":44,"score":24981.80989607868},{"content":"let x = canvas.width / 2;\n","file_path":"canvas/examples/brickbreaker.ts","rank":45,"score":24856.22541582151},{"content":"// deno-lint-ignore-file no-explicit-any\n\nimport { Canvas } from \"../mod.ts\";\n\n\n\nconst COLS = 20;\n\nconst ROWS = 20;\n\nconst board: any = [];\n\n// deno-lint-ignore no-unused-vars prefer-const\n\nlet score = 0;\n\nlet lose = false;\n\nlet interval: any;\n\nlet intervalRender: any;\n\nlet intervalRotate: any;\n\nlet current: any;\n\nlet currentX: number | undefined;\n\nlet currentY: number | undefined;\n\nlet freezed: boolean | undefined;\n\nconst shapes = [\n\n [1, 1, 1, 1],\n\n [1, 1, 1, 0, 1],\n\n [1, 1, 1, 0, 0, 0, 1],\n\n [1, 1, 0, 0, 1, 1],\n\n [1, 1, 0, 0, 0, 1, 1],\n\n [0, 1, 1, 0, 1, 1],\n\n [0, 1, 0, 0, 1, 1, 1],\n\n];\n\nconst colors = [\n\n \"cyan\",\n\n \"orange\",\n\n \"blue\",\n\n \"yellow\",\n\n \"red\",\n\n \"green\",\n\n \"purple\",\n\n];\n\nfunction newShape() {\n\n const id = Math.floor(Math.random() * shapes.length);\n\n const shape = shapes[id];\n\n current = [];\n\n for (let y = 0; y < 4; ++y) {\n\n current[y] = [];\n\n for (let x = 0; x < 4; ++x) {\n\n const i = 4 * y + x;\n\n if (typeof shape[i] != \"undefined\" && shape[i]) {\n\n current[y][x] = id + 1;\n\n } else {\n\n current[y][x] = 0;\n\n }\n\n }\n\n }\n\n freezed = false;\n\n currentX = 5;\n\n currentY = 0;\n\n}\n\n\n\nfunction init() {\n\n for (let y = 0; y < ROWS; ++y) {\n\n board[y] = [];\n\n for (let x = 0; x < COLS; ++x) {\n\n board[y][x] = 0;\n\n }\n\n }\n\n}\n\n\n\nfunction tick() {\n\n if (valid(0, 1)) {\n\n (currentY!)++;\n\n }\n\n else {\n\n freeze();\n\n valid(0, 1);\n\n clearLines();\n\n if (lose) {\n\n clearAllIntervals();\n\n return false;\n\n }\n\n newShape();\n\n }\n\n}\n\n\n\nfunction freeze() {\n\n for (let y = 0; y < 4; ++y) {\n\n for (let x = 0; x < 4; ++x) {\n\n if (current[y][x]) {\n\n board[y + currentY!][x + currentX!] = current[y][x];\n\n }\n\n }\n\n }\n\n freezed = true;\n\n}\n\n\n\nfunction rotate(current: any) {\n\n const newCurrent: any = [];\n\n for (let y = 0; y < 4; ++y) {\n\n newCurrent[y] = [];\n\n for (let x = 0; x < 4; ++x) {\n\n newCurrent[y][x] = current[3 - x][y];\n\n }\n\n }\n\n\n\n return newCurrent;\n\n}\n\n\n\nfunction clearLines() {\n\n for (let y = ROWS - 1; y >= 0; --y) {\n\n let rowFilled = true;\n\n for (let x = 0; x < COLS; ++x) {\n\n if (board[y][x] == 0) {\n\n rowFilled = false;\n\n break;\n\n }\n\n }\n\n if (rowFilled) {\n\n for (let yy = y; yy > 0; --yy) {\n\n for (let x = 0; x < COLS; ++x) {\n\n board[yy][x] = board[yy - 1][x];\n\n }\n\n }\n\n y++;\n\n }\n\n }\n\n}\n\n\n\nfunction keyPress(key: string) {\n\n switch (key) {\n\n case \"left\":\n\n if (valid(-1)) {\n\n (currentX!)--;\n\n }\n\n break;\n\n case \"right\":\n\n if (valid(1)) {\n\n (currentX!)++;\n\n }\n\n break;\n\n case \"down\":\n\n if (valid(0, 1)) {\n\n (currentY!)++;\n\n }\n\n break;\n\n // deno-lint-ignore no-case-declarations\n\n case \"rotate\":\n\n const rotated = rotate(current);\n\n if (valid(0, 0, rotated)) {\n\n current = rotated;\n\n }\n\n break;\n\n case \"drop\":\n\n while (valid(0, 1)) {\n\n (currentY!)++;\n\n }\n\n tick();\n\n break;\n\n }\n\n}\n\nfunction checkForKeyPress() {\n\n if(canvas.window.isKeyDown(\"up\")) {\n\n keyPress(\"rotate\");\n\n }\n\n}\n\nfunction valid(offsetX = 0, offsetY = 0, newCurrent?: any) {\n\n offsetX = currentX! + offsetX;\n\n offsetY = currentY! + offsetY;\n\n newCurrent = newCurrent || current;\n\n\n\n for (let y = 0; y < 4; y++) {\n\n for (let x = 0; x < 4; x++) {\n\n if (newCurrent[y][x]) {\n\n if (\n\n typeof board[y + offsetY] == \"undefined\" ||\n\n typeof board[y + offsetY][x + offsetX] == \"undefined\" ||\n\n board[y + offsetY][x + offsetX] ||\n\n x + offsetX < 0 ||\n\n y + offsetY >= ROWS ||\n\n x + offsetX >= COLS\n\n ) {\n\n if (offsetY == 1 && freezed) {\n\n lose = true;\n\n }\n\n return false;\n\n }\n\n }\n\n }\n\n }\n\n return true;\n\n}\n\n\n\nfunction playButtonClicked() {\n\n newGame();\n\n}\n\n\n\nfunction newGame() {\n\n clearAllIntervals();\n\n intervalRender = setInterval(render, 30);\n\n intervalRotate = setInterval(checkForKeyPress, 70);\n\n init();\n\n newShape();\n\n lose = false;\n\n interval = setInterval(tick, 400);\n\n}\n\n\n\nfunction clearAllIntervals() {\n\n clearInterval(interval);\n\n clearInterval(intervalRender);\n\n clearInterval(intervalRotate);\n\n}\n\n\n\nconst canvas = new Canvas({\n\n title: \"Tetris\",\n\n width: 300,\n\n height: 300,\n\n});\n\nconst ctx = canvas.getContext(\"2d\");\n\nconst W = 300;\n\nconst H = 300;\n\nconst BLOCK_W = W / COLS;\n\nconst BLOCK_H = H / ROWS;\n\n\n\nfunction drawBlock(x: number, y: number) {\n\n ctx.fillRect(BLOCK_W * x, BLOCK_H * y, BLOCK_W - 1, BLOCK_H - 1);\n\n ctx.strokeRect(BLOCK_W * x, BLOCK_H * y, BLOCK_W - 1, BLOCK_H - 1);\n\n}\n\n\n\nfunction render() {\n\n ctx.clearRect(0, 0, W, H);\n\n if(canvas.window.isKeyDown(\"space\")) {\n\n keyPress(\"drop\");\n\n }\n\n if(canvas.window.isKeyDown(\"left\")) {\n\n keyPress(\"left\");\n\n }\n\n if(canvas.window.isKeyDown(\"right\")) {\n\n keyPress(\"right\");\n\n }\n\n if(canvas.window.isKeyDown(\"down\")) {\n\n keyPress(\"down\");\n\n }\n\n ctx.strokeStyle = \"black\";\n\n for (let x = 0; x < COLS; ++x) {\n\n for (let y = 0; y < ROWS; ++y) {\n\n if (board[y][x]) {\n\n ctx.fillStyle = colors[board[y][x] - 1];\n\n drawBlock(x, y);\n\n }\n\n }\n\n }\n\n\n\n ctx.fillStyle = \"red\";\n\n ctx.strokeStyle = \"black\";\n\n for (let y = 0; y < 4; ++y) {\n\n for (let x = 0; x < 4; ++x) {\n\n if (current[y][x]) {\n\n ctx.fillStyle = colors[current[y][x] - 1];\n\n drawBlock(currentX! + x, currentY! + y);\n\n }\n\n }\n\n }\n\n}\n\nplayButtonClicked();\n","file_path":"canvas/examples/tetris.ts","rank":46,"score":24364.864698215602},{"content":"// ported from https://codepen.io/hakimel/pen/QdWpRv\n\nimport { Canvas } from \"../mod.ts\";\n\nconst canvas = new Canvas({\n\n title: \"spiral\",\n\n width: 1000,\n\n height: 1000,\n\n});\n\nconst context = canvas.getContext(\"2d\");\n\n\n\nlet time = 0;\n\nlet velocity = 0.1;\n\nconst velocityTarget = 0.1;\n\n// deno-lint-ignore no-explicit-any\n\nlet width: any\n\n// deno-lint-ignore no-explicit-any\n\nlet height: any\n\n// deno-lint-ignore no-explicit-any no-unused-vars\n\nlet lastX: any\n\n// deno-lint-ignore no-explicit-any no-unused-vars\n\nlet lastY: any\n\n\n\nconst MAX_OFFSET = 400;\n\nconst SPACING = 4;\n\nconst POINTS = MAX_OFFSET / SPACING;\n\nconst PEAK = MAX_OFFSET * 0.25;\n\nconst POINTS_PER_LAP = 6;\n\nconst SHADOW_STRENGTH = 6;\n\n\n\nsetup();\n\n\n\nfunction setup() {\n\n resize();\n\n step();\n\n}\n\n\n\nfunction resize() {\n\n width = canvas.width;\n\n height = canvas.height;\n\n}\n\n\n\nfunction step() {\n\n time += velocity;\n\n velocity += (velocityTarget - velocity) * 0.3;\n\n\n\n clear();\n\n render();\n\n}\n\n\n\nfunction clear() {\n\n context.clearRect(0, 0, width, height);\n\n}\n\n\n\nfunction render() {\n\n // deno-lint-ignore prefer-const\n\n let x, y, cx = width / 2, cy = height / 2;\n\n\n\n context.globalCompositeOperation = \"lighter\";\n\n context.strokeStyle = \"#fff\";\n\n context.shadowColor = \"#fff\";\n\n context.lineWidth = 2;\n\n context.beginPath();\n\n\n\n for (let i = POINTS; i > 0; i--) {\n\n const value = i * SPACING + (time % SPACING);\n\n\n\n const ax = Math.sin(value / POINTS_PER_LAP) * Math.PI;\n\n const ay = Math.cos(value / POINTS_PER_LAP) * Math.PI;\n\n\n\n x = ax * value, y = ay * value * 0.35;\n\n\n\n const o = 1 - (Math.min(value, PEAK) / PEAK);\n\n\n\n y -= Math.pow(o, 2) * 200;\n\n y += 200 * value / MAX_OFFSET;\n\n y += x / cx * width * 0.1;\n\n\n\n context.globalAlpha = 1 - (value / MAX_OFFSET);\n\n context.shadowBlur = SHADOW_STRENGTH * o;\n\n\n\n context.lineTo(cx + x, cy + y);\n\n context.stroke();\n\n\n\n context.beginPath();\n\n context.moveTo(cx + x, cy + y);\n\n }\n\n\n\n context.lineTo(cx, cy - 200);\n\n context.lineTo(cx, 0);\n\n context.stroke();\n\n}\n\n\n","file_path":"canvas/examples/spiral.ts","rank":47,"score":24364.864698215602},{"content":"import { Canvas } from \"../mod.ts\";\n\n\n\nconst canvas = new Canvas({\n\n title: \"Neko\",\n\n width: 200,\n\n height: 200,\n\n fps: 60,\n\n});\n\n\n\nconst ctx = canvas.getContext(\"2d\");\n\n\n\nctx.fillStyle = \"red\";\n","file_path":"canvas/examples/rect.ts","rank":48,"score":24364.864698215602},{"content":"// ported from https://github.com/AleikovStudio/Brick-breaker-game-JS-HTML-Canvas\n\nimport { Canvas } from \"../mod.ts\";\n\nconst canvas = new Canvas({\n\n title: \"Brick Breaker\",\n\n width: 500,\n\n height: 500,\n\n});\n\nconst ctx = canvas.getContext(\"2d\");\n\n\n\nlet x = canvas.width / 2;\n\nlet y = canvas.height - 80;\n\nconst paddleHeight = 10;\n\nlet paddleWidth = 75;\n\nlet paddleX = (canvas.width - paddleWidth) / 2;\n\nlet rightPressed = false; \n\nlet leftPressed = false;\n\nconst ballRadius = 10;\n\nconst brickRowCount = 7;\n\nconst brickColumnCount = 5;\n\n\n\nlet count = brickRowCount * brickColumnCount;\n\nlet rem = count;\n\n\n\nlet score = 0;\n\nlet lives = 3;\n\n\n\nconst brickWidth = 80;\n\nconst brickHeight = 20;\n\nconst brickPadding = 7;\n\nconst brickOffsetTop = 30;\n\nconst brickOffsetLeft = 40;\n\nlet speedup1 = 0;\n\nlet speedup2 = 0;\n\nlet speedup3 = 0;\n\nlet speedup4 = 0;\n\nlet speedup5 = 0;\n\nlet speedup6 = 0;\n\nconst _speedup7 = 0;\n\n\n\n// deno-lint-ignore no-explicit-any\n\nconst bricks: any = [];\n\nfor (let c = 0; c < brickColumnCount; ++c) {\n\n bricks[c] = [];\n\n for (let r = 0; r < brickRowCount; ++r) {\n\n bricks[c][r] = { x: 0, y: 0, status: 1 };\n\n }\n\n}\n\n\n\nlet dx = 3.5;\n\nlet dy = -3.5;\n\n\n\nfunction drawBall() {\n\n ctx.beginPath();\n\n ctx.arc(x, y, ballRadius, 0, Math.PI * 2);\n\n ctx.fillStyle = \"#fff\";\n\n ctx.fill();\n\n ctx.closePath();\n\n}\n\n\n\nfunction drawPaddle() {\n\n ctx.beginPath();\n\n ctx.rect(paddleX, canvas.height - paddleHeight, paddleWidth, paddleHeight);\n\n ctx.fillStyle = \"#00ffff\";\n\n ctx.fill();\n\n ctx.closePath();\n\n}\n\n\n\nfunction drawBricks() {\n\n for (let c = 0; c < brickColumnCount; ++c) {\n\n for (let r = 0; r < brickRowCount; ++r) {\n\n if (bricks[c][r].status == 1) {\n\n const brickX = (c * (brickWidth + brickPadding)) + brickOffsetLeft;\n\n const brickY = (r * (brickHeight + brickPadding)) + brickOffsetTop;\n\n bricks[c][r].x = brickX;\n\n bricks[c][r].y = brickY;\n\n ctx.beginPath();\n\n ctx.rect(brickX, brickY, brickWidth, brickHeight);\n\n if (c % 2 != 0) {\n\n ctx.fillStyle = \"#fff\";\n\n } else {\n\n ctx.fillStyle = \"#C2AA83\";\n\n }\n\n ctx.fill();\n\n ctx.closePath();\n\n }\n\n }\n\n }\n\n}\n\nfunction collisionDetection() {\n\n for (let c = 0; c < brickColumnCount; ++c) {\n\n for (let r = 0; r < brickRowCount; ++r) {\n\n const b = bricks[c][r];\n\n\n\n if (b.status == 1) {\n\n if (\n\n x > b.x && x < b.x + brickWidth && y > b.y && y < b.y + brickHeight\n\n ) {\n\n dy = -dy;\n\n b.status = 0;\n\n score++;\n\n count--;\n\n ctx.beginPath();\n\n ctx.arc(x, y, ballRadius, 0, Math.PI * 2);\n\n ctx.fillStyle = \"#00ffff\";\n\n ctx.fill();\n\n ctx.closePath();\n\n if (count <= (rem - rem / 7) && speedup1 == 0) {\n\n if (dy < 0) {\n\n dy -= 0.5;\n\n } else {\n\n dy += 0.5;\n\n }\n\n if (dx < 0) {\n\n dx -= 0.5;\n\n } else {\n\n dx += 0.5;\n\n }\n\n paddleWidth += 2;\n\n speedup1 = 1;\n\n }\n\n if (count <= (rem - 2 * rem / 7) && speedup2 == 0) {\n\n if (dy < 0) {\n\n dy -= 1;\n\n } else {\n\n dy += 1;\n\n }\n\n if (dx < 0) {\n\n dx -= 1;\n\n } else {\n\n dx += 1;\n\n }\n\n\n\n paddleWidth += 3;\n\n speedup2 = 1;\n\n }\n\n if (count <= (rem - 3 * rem / 7) && speedup3 == 0) {\n\n if (dy < 0) {\n\n dy -= 1;\n\n } else {\n\n dy += 1;\n\n }\n\n if (dx < 0) {\n\n dx -= 1;\n\n } else {\n\n dx += 1;\n\n }\n\n\n\n paddleWidth += 4;\n\n speedup3 = 1;\n\n }\n\n\n\n if (count <= (rem - 4 * rem / 7) && speedup4 == 0) {\n\n if (dy < 0) {\n\n dy -= 1;\n\n } else {\n\n dy += 1;\n\n }\n\n if (dx < 0) {\n\n dx -= 1;\n\n } else {\n\n dx += 1;\n\n }\n\n paddleWidth += 5;\n\n speedup4 = 1;\n\n }\n\n\n\n if (count <= (rem - 5 * rem / 7) && speedup5 == 0) {\n\n if (dy < 0) {\n\n dy -= 1;\n\n } else {\n\n dy += 1;\n\n }\n\n if (dx < 0) {\n\n dx -= 1;\n\n } else {\n\n dx += 1;\n\n }\n\n paddleWidth += 6;\n\n speedup5 = 1;\n\n }\n\n\n\n if (count <= (rem - 6 * rem / 7) && speedup6 == 0) {\n\n if (dy < 0) {\n\n dy -= 1;\n\n } else {\n\n dy += 1;\n\n }\n\n if (dx < 0) {\n\n dx -= 1;\n\n } else {\n\n dx += 1;\n\n }\n\n paddleWidth += 7;\n\n speedup6 = 1;\n\n }\n\n\n\n if (count <= 0) {\n\n console.log(\"You Win!\");\n\n Deno.exit(0);\n\n }\n\n }\n\n }\n\n }\n\n }\n\n}\n\n\n\nfunction drawScore() {\n\n ctx.font = \"18px Arial\";\n\n ctx.fillStyle = \"#fff\";\n\n ctx.fillText(\"score: \" + score, 40, 20);\n\n}\n\n\n\nfunction drawLives() {\n\n ctx.font = \"18px Arial\";\n\n ctx.fillStyle = \"#fff\";\n\n ctx.fillText(\n\n \"lives: \" + lives,\n\n canvas.width - 310,\n\n 20,\n\n );\n\n}\n\n\n\nfunction draw() {\n\n keyHandler();\n\n ctx.clearRect(0, 0, canvas.width, canvas.height);\n\n drawBricks();\n\n drawBall();\n\n drawPaddle();\n\n drawScore();\n\n drawLives();\n\n\n\n collisionDetection();\n\n\n\n if (y + dy < ballRadius) {\n\n dy = -dy;\n\n } else if (y + dy > canvas.height - ballRadius) {\n\n if (x >= paddleX && x <= paddleX + paddleWidth) {\n\n dy = -dy;\n\n } else {\n\n lives--;\n\n if (lives <= 0) {\n\n console.log(\"Sorry, you've lost...\\nTry again! :-)\");\n\n Deno.exit(0);\n\n } else {\n\n x = canvas.width / 2;\n\n y = canvas.height - 30;\n\n paddleWidth = 80;\n\n rem = count;\n\n paddleX = (canvas.width - paddleWidth) / 2;\n\n }\n\n }\n\n } else {\n\n y += dy;\n\n }\n\n\n\n if (x + dx < ballRadius || x + dx > canvas.width - ballRadius) {\n\n dx = -dx;\n\n } else {\n\n x += dx;\n\n }\n\n\n\n if (rightPressed && paddleX < canvas.width - paddleWidth) {\n\n paddleX += 7;\n\n } else if (leftPressed && paddleX > 0) {\n\n paddleX -= 7;\n\n }\n\n}\n\n\n\nfunction keyHandler() {\n\n if (canvas.window.isKeyDown(\"right\")) {\n\n rightPressed = true;\n\n } else {\n\n rightPressed = false;\n\n }\n\n if (canvas.window.isKeyDown(\"left\")) {\n\n leftPressed = true;\n\n } else {\n\n leftPressed = false;\n\n }\n\n}\n\n\n\nsetInterval(draw, 20);\n","file_path":"canvas/examples/brickbreaker.ts","rank":49,"score":24364.864698215602},{"content":"import { Canvas, loadImage } from \"../mod.ts\";\n\n\n\nconst canvas = new Canvas({\n\n title: \"Neko\",\n\n width: 500,\n\n height: 500,\n\n});\n\nconst ctx = canvas.getContext(\"2d\");\n\n// image created by Hashrock (https://hashrock.studio.site)\n\nconst img = await loadImage(\"https://deno.land/images/artwork/hashrock_simple.png\");\n","file_path":"canvas/examples/image.ts","rank":50,"score":24364.864698215602},{"content":"// ported from https://codepen.io/lukasvait/pen/OJexNE\n\nimport { Canvas } from \"../mod.ts\";\n\nconst canvas = new Canvas({\n\n title: \"Snake\",\n\n width: 500,\n\n height: 500,\n\n});\n\n// deno-lint-ignore no-explicit-any\n\nlet loop: any = undefined;\n\nconst ctx = canvas.getContext(\"2d\");\n\nlet direction = \"\";\n\nlet directionQueue = \"\";\n\nconst fps = 70;\n\n// deno-lint-ignore no-explicit-any\n\nlet snake: any[] = [];\n\nconst snakeLength = 5;\n\nconst cellSize = 20;\n\nconst snakeColor = \"#3498db\";\n\nconst foodColor = \"#ff3636\";\n\n// deno-lint-ignore no-explicit-any\n\nconst foodX: any[] = [];\n\n// deno-lint-ignore no-explicit-any\n\nconst foodY: any[] = [];\n\nconst food = {\n\n x: 0,\n\n y: 0,\n\n};\n\nlet score = 0;\n\n\n\nfor (let i = 0; i <= canvas.width - cellSize; i += cellSize) {\n\n foodX.push(i);\n\n foodY.push(i);\n\n}\n\nconst drawSquare = (x: number, y: number, color: string) => {\n\n ctx.fillStyle = color;\n\n ctx.fillRect(x, y, cellSize, cellSize);\n\n};\n\n\n\nconst createFood = () => {\n\n food.x = foodX[Math.floor(Math.random() * foodX.length)];\n\n food.y = foodY[Math.floor(Math.random() * foodY.length)];\n\n for (const i in snake) {\n\n if (checkCollision(food.x, food.y, snake[i].x, snake[i].y)) {\n\n createFood();\n\n }\n\n }\n\n};\n\nconst drawFood = () => {\n\n drawSquare(food.x, food.y, foodColor);\n\n};\n\n\n\nconst setBackground = (color1: string, color2: string) => {\n\n ctx.fillStyle = color1;\n\n ctx.strokeStyle = color2;\n\n\n\n ctx.fillRect(0, 0, canvas.height, canvas.width);\n\n\n\n for (let x = 0.5; x < canvas.width; x += cellSize) {\n\n ctx.moveTo(x, 0);\n\n ctx.lineTo(x, canvas.height);\n\n }\n\n for (let y = 0.5; y < canvas.height; y += cellSize) {\n\n ctx.moveTo(0, y);\n\n ctx.lineTo(canvas.width, y);\n\n }\n\n\n\n ctx.stroke();\n\n};\n\nconst createSnake = () => {\n\n snake = [];\n\n for (let i = snakeLength; i > 0; i--) {\n\n snake.push({ x: i * cellSize, y: 0 });\n\n }\n\n};\n\nconst drawSnake = () => {\n\n for (let i = 0; i < snake.length; i++) {\n\n drawSquare(snake[i].x, snake[i].y, snakeColor);\n\n }\n\n};\n\nconst changeDirection = (keycode: string) => {\n\n if (keycode === \"left\" && direction != \"right\") directionQueue = \"left\";\n\n else if (keycode === \"up\" && direction != \"down\") directionQueue = \"up\";\n\n else if (keycode === \"right\" && direction != \"left\") directionQueue = \"right\";\n\n else if (keycode === \"down\" && direction != \"top\") directionQueue = \"down\";\n\n};\n\nconst moveSnake = () => {\n\n let x = snake[0].x;\n\n let y = snake[0].y;\n\n\n\n direction = directionQueue;\n\n\n\n if (direction == \"right\") {\n\n x += cellSize;\n\n } else if (direction == \"left\") {\n\n x -= cellSize;\n\n } else if (direction == \"up\") {\n\n y -= cellSize;\n\n } else if (direction == \"down\") {\n\n y += cellSize;\n\n }\n\n const tail = snake.pop();\n\n tail.x = x;\n\n tail.y = y;\n\n snake.unshift(tail);\n\n};\n\n\n\nconst checkCollision = (\n\n x1: number,\n\n y1: number,\n\n x2: number,\n\n y2: number,\n\n) => (x1 === x2 && y1 === y2);\n\nconst game = () => {\n\n const head = snake[0];\n\n if (\n\n head.x < 0 || head.x > canvas.width - cellSize || head.y < 0 ||\n\n head.y > canvas.height - cellSize\n\n ) {\n\n setBackground(\"#ff3636\", \"#ff3636\");\n\n createSnake();\n\n drawSnake();\n\n createFood();\n\n drawFood();\n\n directionQueue = \"right\";\n\n score = 0;\n\n }\n\n for (let i = 1; i < snake.length; i++) {\n\n if (head.x == snake[i].x && head.y == snake[i].y) {\n\n setBackground(\"#ff3636\", \"#ff3636\");\n\n createSnake();\n\n drawSnake();\n\n createFood();\n\n drawFood();\n\n directionQueue = \"right\";\n\n score = 0;\n\n }\n\n }\n\n if (checkCollision(head.x, head.y, food.x, food.y)) {\n\n snake[snake.length] = { x: head.x, y: head.y };\n\n createFood();\n\n drawFood();\n\n score += 10;\n\n }\n\n\n\n if (canvas.window.isKeyDown(\"left\")) {\n\n changeDirection(\"left\");\n\n } else if (canvas.window.isKeyDown(\"right\")) {\n\n changeDirection(\"right\");\n\n } else if (canvas.window.isKeyDown(\"up\")) {\n\n changeDirection(\"up\");\n\n } else if (canvas.window.isKeyDown(\"down\")) {\n\n changeDirection(\"down\");\n\n }\n\n\n\n ctx.beginPath();\n\n setBackground(\"#fff\", \"#eee\");\n\n drawSnake();\n\n drawFood();\n\n moveSnake();\n\n};\n\nfunction newGame() {\n\n direction = \"right\";\n\n directionQueue = \"right\";\n\n ctx.beginPath();\n\n createSnake();\n\n createFood();\n\n\n\n if (typeof loop != \"undefined\") {\n\n clearInterval(loop);\n\n } else {\n\n loop = setInterval(game, fps);\n\n }\n\n}\n\nnewGame();\n","file_path":"canvas/examples/snake.ts","rank":51,"score":24364.864698215602},{"content":"import { Canvas } from \"../mod.ts\";\n\n\n\ntype Vector = {\n\n x: number,\n\n y: number\n\n}\n\n\n\nconst canvas = new Canvas({\n\n title: \"Perlin\",\n\n width: 800,\n\n height: 800,\n\n});\n\nconst ctx = canvas.getContext(\"2d\")\n\n\n\nconst BATCH = 5\n\nconst WRAP = 100\n\nconst SIZE = 1\n\nconst TOTAL = WRAP * BATCH\n\n\n\nfunction Shuffle(tab: number[]) {\n\n for (let e = tab.length - 1; e > 0; e--) {\n\n let index = Math.round(Math.random() * (e - 1)),\n\n temp = tab[e];\n\n\n\n tab[e] = tab[index];\n\n tab[index] = temp;\n\n }\n\n}\n\n\n\nfunction MakePermutation() {\n\n let P = [];\n\n for (let i = 0; i < 256; i++) {\n\n P.push(i);\n\n }\n\n Shuffle(P);\n\n for (let i = 0; i < 256; i++) {\n\n P.push(P[i]);\n\n }\n\n\n\n return P;\n\n}\n\nlet P = MakePermutation();\n\n\n\nfunction ConstantVector(v: number) {\n\n return [\n\n { x: 1, y: 1 },\n\n { x: -1, y: 1 },\n\n { x: -1, y: -1 },\n\n { x: 1, y: -1 }\n\n ][v & 3]\n\n}\n\n\n\nconst matrix: number[][] = []\n\nfor (let i = 0; i < TOTAL; i++) {\n\n const col = []\n\n for (let j = 0; j < TOTAL; j++) {\n\n col.push(0);\n\n }\n\n matrix.push(col)\n\n}\n\n\n\nfunction Calculate() {\n\n for (let i = 0; i < BATCH; i++) {\n\n for (let j = 0; j < BATCH; j++) {\n\n PerlinBatch(i, j)\n\n }\n\n }\n\n}\n\n\n\nfunction Draw() {\n\n ctx.fillStyle = `rgb(0, 0, 0)`\n\n ctx.fillRect(0, 0, 800, 800)\n\n for (let i = 0; i < TOTAL; i++) {\n\n for (let j = 0; j < TOTAL; j++) {\n\n ctx.fillStyle = `rgba(255, 255, 255, ${matrix[i][j] + 0.5})`\n\n ctx.fillRect(i * SIZE, j * SIZE, SIZE, SIZE)\n\n }\n\n }\n\n}\n\n\n\nfunction PerlinBatch(batchX: number, batchY: number,) {\n\n const trv = ConstantVector(P[P[batchX + 1] + batchY + 1]);\n\n const tlv = ConstantVector(P[P[batchX] + batchY + 1]);\n\n const brv = ConstantVector(P[P[batchX + 1] + batchY]);\n\n const blv = ConstantVector(P[P[batchX] + batchY]);\n\n\n\n for (let x = 0; x < WRAP; x++) {\n\n for (let y = 0; y < WRAP; y++) {\n\n const currentX = x + batchX * WRAP;\n\n const currentY = y + batchY * WRAP;\n\n matrix[currentX][currentY] = Perlin(x / WRAP, y / WRAP, trv, tlv, brv, blv)\n\n }\n\n }\n\n};\n\n\n\nfunction Perlin(x: number, y: number, trv: Vector, tlv: Vector, brv: Vector, blv: Vector) {\n\n const tr = { x: x - 1, y: y - 1 }\n\n const tl = { x: x, y: y - 1 }\n\n const br = { x: x - 1, y: y }\n\n const bl = { x: x, y: y }\n\n\n\n const trd = Dot(trv, tr)\n\n const tld = Dot(tlv, tl)\n\n const brd = Dot(brv, br)\n\n const bld = Dot(blv, bl)\n\n\n\n const u = Fade(x);\n\n const v = Fade(y);\n\n\n\n const left = Lerp(bld, tld, v)\n\n const right = Lerp(brd, trd, v)\n\n return Lerp(left, right, u)\n\n};\n\n\n\nfunction Dot(a: Vector, b: Vector) {\n\n return a.x * b.x + a.y * b.y\n\n}\n\n\n\nfunction Lerp(a: number, b: number, x: number) {\n\n return a + (b - a) * x\n\n}\n\n\n\nfunction Fade(t: number) {\n\n return ((6 * t - 15) * t + 10) * t * t * t;\n\n}\n\n\n\nCalculate()\n","file_path":"canvas/examples/perlin.ts","rank":52,"score":24364.864698215602},{"content":"import { Canvas } from \"../mod.ts\";\n\n\n\nconst canvas = new Canvas({\n\n title: \"Cube\",\n\n width: 800,\n\n height: 800,\n\n \n\n});\n\nconst ctx = canvas.getContext(\"2d\")\n\nctx.fillStyle = \"#fff\";\n\nctx.strokeStyle = \"#fff\";\n\n\n\nlet theta = 0\n\nlet thetaZ = theta * Math.PI / 180\n\nlet thetaY = theta * Math.PI / 180\n\nlet thetaX = theta * Math.PI / 180\n\nconst d = 300\n\nconst step = 200\n\nconst steps = 1\n\nconst matrix: [number, number, number][][][] = []\n\n\n\nfor (let i = -step * steps / 2; i < step * steps; i += step) {\n\n const column: [number, number, number][][] = []\n\n for (let j = -step * steps / 2; j < step * steps; j += step) {\n\n const row: [number, number, number][] = []\n\n for (let k = -step * steps / 2; k < step * steps; k += step) {\n\n row.push([i, j, k])\n\n }\n\n column.push(row)\n\n }\n\n matrix.push(column)\n\n}\n\n\n\nfunction Render() {\n\n const matrix2 = []\n\n for (const column of matrix) {\n\n const column2 = []\n\n for (const row of column) {\n\n const row2 = []\n\n for (const point of row) {\n\n let x = point[0]\n\n let y = point[1]\n\n let z = point[2]\n\n x = x * Math.cos(thetaX) - z * Math.sin(thetaX)\n\n z = point[0] * Math.sin(thetaX) + z * Math.cos(thetaX)\n\n y = y * Math.cos(thetaY) - z * Math.sin(thetaY)\n\n z = point[1] * Math.sin(thetaY) + z * Math.cos(thetaY)\n\n const x2 = x\n\n x = x * Math.cos(thetaZ) - y * Math.sin(thetaZ)\n\n y = x2 * Math.sin(thetaZ) + y * Math.cos(thetaZ)\n\n\n\n ctx.beginPath();\n\n ctx.arc(x + d, y + d, 5, 0, 2 * Math.PI);\n\n ctx.fill();\n\n row2.push([x + d, y + d])\n\n }\n\n column2.push(row2)\n\n }\n\n matrix2.push(column2)\n\n }\n\n\n\n for (let i = 0; i < matrix2.length; i++) {\n\n for (let j = 0; j < matrix2[i].length; j++) {\n\n for (let k = 0; k < matrix2[i][j].length; k++) {\n\n const point = matrix2[i][j][k]\n\n const point2 = matrix2[i][j][k + 1]\n\n if (point2) {\n\n ctx.beginPath();\n\n ctx.moveTo(point[0], point[1]);\n\n ctx.lineTo(point2[0], point2[1]);\n\n ctx.stroke();\n\n }\n\n }\n\n const point = matrix2[i][j]\n\n const point2 = matrix2[i][j + 1]\n\n if (point2) {\n\n for (let k = 0; k < matrix2[i][j].length; k++) {\n\n ctx.beginPath();\n\n ctx.moveTo(point[k][0], point[k][1]);\n\n ctx.lineTo(point2[k][0], point2[k][1]);\n\n ctx.stroke();\n\n }\n\n }\n\n }\n\n const point = matrix2[i]\n\n const point2 = matrix2[i + 1]\n\n if (point2) {\n\n for (let j = 0; j < matrix2[i].length; j++) {\n\n for (let k = 0; k < matrix2[i][j].length; k++) {\n\n ctx.beginPath();\n\n ctx.moveTo(point[j][k][0], point[j][k][1]);\n\n ctx.lineTo(point2[j][k][0], point2[j][k][1]);\n\n ctx.stroke();\n\n }\n\n }\n\n }\n\n }\n\n}\n\n\n\nctx.clearRect(0, 0, canvas.width, canvas.height)\n\n\n\nsetInterval(() => {\n\n ctx.clearRect(0, 0, canvas.width, canvas.height)\n\n theta += 3\n\n if (theta > 360) {\n\n theta = 0\n\n }\n\n thetaY = theta * Math.PI / 180\n\n thetaZ = theta * Math.PI / 180\n\n thetaX = theta * Math.PI / 180\n\n Render()\n","file_path":"canvas/examples/cube.ts","rank":53,"score":24364.864698215602},{"content":"import { Canvas } from \"../mod.ts\";\n\n\n\ntype Vector = {\n\n x: number,\n\n y: number\n\n}\n\n\n\nconst canvas = new Canvas({\n\n title: \"Terrain\",\n\n width: 800,\n\n height: 800,\n\n});\n\nconst ctx = canvas.getContext(\"2d\")\n\nctx.fillStyle = \"#fff\";\n\nctx.strokeStyle = \"#fff\";\n\n\n\nconst BATCH = 5\n\nconst WRAP = 4\n\nconst TOTAL = WRAP * BATCH\n\nconst theta = 40\n\nconst thetaZ = theta * Math.PI / 180\n\nconst thetaY = theta * Math.PI / 180\n\nconst thetaX = theta * Math.PI / 180\n\nconst sx = 200\n\nconst sy = 40\n\nconst step = 20\n\nconst steps = 20\n\nconst radius = 2\n\n\n\nconst matrix: [number, number, number][][][] = []\n\nconst matrix2: number[][] = []\n\nfor (let i = 0; i < TOTAL; i++) {\n\n const col: number[] = []\n\n for (let j = 0; j < TOTAL; j++) {\n\n col.push(0);\n\n }\n\n matrix2.push(col)\n\n}\n\n\n\n\n\nfunction Shuffle(tab: number[]) {\n\n for (let e = tab.length - 1; e > 0; e--) {\n\n const index = Math.round(Math.random() * (e - 1)),\n\n temp = tab[e];\n\n\n\n tab[e] = tab[index];\n\n tab[index] = temp;\n\n }\n\n}\n\n\n\nfunction MakePermutation() {\n\n const P = [];\n\n for (let i = 0; i < 256; i++) {\n\n P.push(i);\n\n }\n\n Shuffle(P);\n\n for (let i = 0; i < 256; i++) {\n\n P.push(P[i]);\n\n }\n\n\n\n return P;\n\n}\n\nconst P = MakePermutation();\n\n\n\nfunction ConstantVector(v: number) {\n\n return [\n\n { x: 1, y: 1 },\n\n { x: -1, y: 1 },\n\n { x: -1, y: -1 },\n\n { x: 1, y: -1 }\n\n ][v & 3]\n\n}\n\n\n\nfunction Calculate() {\n\n for (let i = 0; i < TOTAL; i++) {\n\n for (let j = 0; j < TOTAL; j++) {\n\n matrix2[i][j] = PerlinBatch(i, j)\n\n }\n\n }\n\n}\n\n\n\nfunction PerlinBatch(posX: number, posY: number) {\n\n const batchX = Math.floor(posX / WRAP)\n\n const batchY = Math.floor(posY / WRAP)\n\n const trv = ConstantVector(P[P[batchX + 1] + batchY + 1]);\n\n const tlv = ConstantVector(P[P[batchX] + batchY + 1]);\n\n const brv = ConstantVector(P[P[batchX + 1] + batchY]);\n\n const blv = ConstantVector(P[P[batchX] + batchY]);\n\n\n\n const currentX = posX / WRAP - batchX;\n\n const currentY = posY / WRAP - batchY;\n\n return Perlin(currentX, currentY, trv, tlv, brv, blv)\n\n};\n\n\n\nfunction Perlin(x: number, y: number, trv: Vector, tlv: Vector, brv: Vector, blv: Vector) {\n\n const tr = { x: x - 1, y: y - 1 }\n\n const tl = { x: x, y: y - 1 }\n\n const br = { x: x - 1, y: y }\n\n const bl = { x: x, y: y }\n\n\n\n const trd = Dot(trv, tr)\n\n const tld = Dot(tlv, tl)\n\n const brd = Dot(brv, br)\n\n const bld = Dot(blv, bl)\n\n\n\n const u = Fade(x);\n\n const v = Fade(y);\n\n\n\n const left = Lerp(bld, tld, v)\n\n const right = Lerp(brd, trd, v)\n\n return Lerp(left, right, u)\n\n};\n\n\n\nfunction Dot(a: Vector, b: Vector) {\n\n return a.x * b.x + a.y * b.y\n\n}\n\n\n\nfunction Lerp(a: number, b: number, x: number) {\n\n return a + (b - a) * x\n\n}\n\n\n\nfunction Fade(t: number) {\n\n return ((6 * t - 15) * t + 10) * t * t * t;\n\n}\n\n\n\nfor (let i = 0; i < steps; i += 1) {\n\n const column: [number, number, number][][] = []\n\n for (let j = 0; j < steps; j += 1) {\n\n const row: [number, number, number][] = []\n\n const x = i * step;\n\n const y = j * step;\n\n row.push([x, y, -PerlinBatch(i, j) * 40])\n\n column.push(row)\n\n }\n\n matrix.push(column)\n\n}\n\n\n\nfunction Render() {\n\n const matrix2 = []\n\n for (const column of matrix) {\n\n const column2 = []\n\n for (const row of column) {\n\n const row2 = []\n\n for (const point of row) {\n\n let x = point[0]\n\n let y = point[1]\n\n let z = point[2]\n\n x = x * Math.cos(thetaX) - z * Math.sin(thetaX)\n\n z = point[0] * Math.sin(thetaX) + z * Math.cos(thetaX)\n\n y = y * Math.cos(thetaY) - z * Math.sin(thetaY)\n\n z = point[1] * Math.sin(thetaY) + z * Math.cos(thetaY)\n\n const x2 = x\n\n x = x * Math.cos(thetaZ) - y * Math.sin(thetaZ)\n\n y = x2 * Math.sin(thetaZ) + y * Math.cos(thetaZ)\n\n\n\n ctx.beginPath();\n\n ctx.arc(x + sx, y + sy, radius, 0, 2 * Math.PI);\n\n ctx.fill();\n\n row2.push([x + sx, y + sy])\n\n }\n\n column2.push(row2)\n\n }\n\n matrix2.push(column2)\n\n }\n\n\n\n for (let i = 0; i < matrix2.length; i++) {\n\n for (let j = 0; j < matrix2[i].length; j++) {\n\n for (let k = 0; k < matrix2[i][j].length; k++) {\n\n const point = matrix2[i][j][k]\n\n const point2 = matrix2[i][j][k + 1]\n\n if (point2) {\n\n ctx.beginPath();\n\n ctx.moveTo(point[0], point[1]);\n\n ctx.lineTo(point2[0], point2[1]);\n\n ctx.stroke();\n\n }\n\n }\n\n const point = matrix2[i][j]\n\n const point2 = matrix2[i][j + 1]\n\n if (point2) {\n\n for (let k = 0; k < matrix2[i][j].length; k++) {\n\n ctx.beginPath();\n\n ctx.moveTo(point[k][0], point[k][1]);\n\n ctx.lineTo(point2[k][0], point2[k][1]);\n\n ctx.stroke();\n\n }\n\n }\n\n }\n\n const point = matrix2[i]\n\n const point2 = matrix2[i + 1]\n\n if (point2) {\n\n for (let j = 0; j < matrix2[i].length; j++) {\n\n for (let k = 0; k < matrix2[i][j].length; k++) {\n\n ctx.beginPath();\n\n ctx.moveTo(point[j][k][0], point[j][k][1]);\n\n ctx.lineTo(point2[j][k][0], point2[j][k][1]);\n\n ctx.stroke();\n\n }\n\n }\n\n }\n\n }\n\n}\n\n\n\nCalculate()\n","file_path":"canvas/examples/terrain.ts","rank":54,"score":24364.864698215602},{"content":"export class Neko {\n\n #id;\n\n width: number;\n\n height: number;\n\n constructor(options: NekoOptions) {\n\n this.width = options.width;\n\n this.height = options.height;\n\n this.#id = lib.symbols.window_new(\n\n new Uint8Array([...encode(options.title), 0]),\n\n options.width,\n\n options.height,\n\n );\n\n }\n\n limitUpdateRate(micros: number) {\n\n unwrap(lib.symbols.window_limit_update_rate(this.#id, micros));\n\n }\n\n setFrameBuffer(buffer: Uint8Array, width?: number, height?: number) {\n\n unwrap(\n\n lib.symbols.window_update_with_buffer(\n\n this.#id,\n\n buffer,\n\n width ?? this.width,\n\n height ?? this.height,\n\n )\n\n );\n\n }\n\n\n\n update() {\n\n unwrap(lib.symbols.window_update(this.#id));\n\n }\n\n\n\n close() {\n\n unwrap(lib.symbols.window_close(this.#id));\n\n }\n\n\n\n isKeyDown(key: string): boolean {\n\n return unwrapBoolean(lib.symbols.window_is_key_down(this.#id, new Uint8Array([...encode(key), 0])));\n\n }\n\n\n\n isMouseButtonDown(key: string): boolean {\n\n return unwrapBoolean(lib.symbols.window_is_mouse_button_down(this.#id, new Uint8Array([...encode(key), 0])));\n\n }\n\n\n\n getScroll(): number {\n\n return lib.symbols.window_get_mouse_scroll(this.#id);\n\n }\n\n\n\n\n\n getMousePosition(): [number, number] {\n\n return [lib.symbols.window_get_mouse_x(this.#id), lib.symbols.window_get_mouse_y(this.#id)];\n\n }\n\n\n\n get open(): boolean {\n\n return unwrapBoolean(lib.symbols.window_is_open(this.#id));\n\n }\n\n\n\n get active(): boolean {\n\n return unwrapBoolean(lib.symbols.window_is_active(this.#id));\n\n }\n","file_path":"lib/Neko.ts","rank":72,"score":5.2839719015223805},{"content":"export class Canvas {\n\n #title: string;\n\n #ctx: CanvasRenderingContext2D;\n\n #canvas: EmulatedCanvas2D;\n\n window: Neko;\n\n #world: World;\n\n #width: number;\n\n #height: number;\n\n #fps: number;\n\n constructor(config: Config) {\n\n this.#world = new World();\n\n this.#height = config.height || 200;\n\n this.#width = config.width || 200;\n\n this.#title = config.title || \"Neko\";\n\n this.#fps = config.fps || 60;\n\n this.#canvas = createCanvas(this.#width, this.#height);\n\n this.#ctx = this.#canvas.getContext(\"2d\");\n\n this.window = new Neko({\n\n title: this.#title,\n\n width: this.#width,\n\n height: this.#height,\n\n });\n\n this.#world.start(this.window, {\n\n fps: this.#fps,\n\n update: () => {\n\n this.window.setFrameBuffer(\n\n this.#canvas.getRawBuffer(0, 0, this.#width, this.#height),\n\n );\n\n },\n\n });\n\n }\n\n getContext(_type = \"2d\"): CanvasRenderingContext2D {\n\n return this.#ctx;\n\n }\n\n get canvas(): EmulatedCanvas2D {\n\n return this.#canvas;\n\n }\n\n get width(): number {\n\n return this.#width;\n\n }\n\n get height(): number {\n\n return this.#height;\n\n }\n","file_path":"canvas/Ctx.ts","rank":73,"score":2.8236485947224073},{"content":"let score = 0;\n","file_path":"canvas/examples/tetris.ts","rank":74,"score":2.3680541116852547}],"string":"[\n {\n \"content\": \"const width = 800;\\n\",\n \"file_path\": \"examples/test.ts\",\n \"rank\": 2,\n \"score\": 55611.0160243587\n },\n {\n \"content\": \"const height = 600;\\n\",\n \"file_path\": \"examples/test.ts\",\n \"rank\": 3,\n \"score\": 55611.0160243587\n },\n {\n \"content\": \"const H = 300;\\n\",\n \"file_path\": \"canvas/examples/tetris.ts\",\n \"rank\": 4,\n \"score\": 54832.42854458706\n },\n {\n \"content\": \"const W = 300;\\n\",\n \"file_path\": \"canvas/examples/tetris.ts\",\n \"rank\": 5,\n \"score\": 54832.42854458706\n },\n {\n \"content\": \"let P = MakePermutation();\\n\",\n \"file_path\": \"canvas/examples/perlin.ts\",\n \"rank\": 6,\n \"score\": 54803.60461176964\n },\n {\n \"content\": \"const P = MakePermutation();\\n\",\n \"file_path\": \"canvas/examples/terrain.ts\",\n \"rank\": 7,\n \"score\": 54803.60461176964\n },\n {\n \"content\": \"let width: any\\n\",\n \"file_path\": \"canvas/examples/spiral.ts\",\n \"rank\": 8,\n \"score\": 54691.095863010516\n },\n {\n \"content\": \" get height(): number {\\n\\n return this.#height;\\n\",\n \"file_path\": \"canvas/Ctx.ts\",\n \"rank\": 9,\n \"score\": 54691.095863010516\n },\n {\n \"content\": \"let height: any\\n\",\n \"file_path\": \"canvas/examples/spiral.ts\",\n \"rank\": 10,\n \"score\": 54691.095863010516\n },\n {\n \"content\": \" get width(): number {\\n\\n return this.#width;\\n\",\n \"file_path\": \"canvas/Ctx.ts\",\n \"rank\": 11,\n \"score\": 54691.095863010516\n },\n {\n \"content\": \"export function unwrapBoolean(result: number): boolean {\\n\\n if (result !== 0 && result !== 1) {\\n\\n unwrap(result);\\n\\n return false;\\n\\n } else {\\n\\n return result === 1;\\n\\n }\\n\",\n \"file_path\": \"lib/utils.ts\",\n \"rank\": 12,\n \"score\": 30007.036543887454\n },\n {\n \"content\": \"const SPACING = 4;\\n\",\n \"file_path\": \"canvas/examples/spiral.ts\",\n \"rank\": 13,\n \"score\": 30007.036543887454\n },\n {\n \"content\": \" isKeyDown(key: string): boolean {\\n\\n return unwrapBoolean(lib.symbols.window_is_key_down(this.#id, new Uint8Array([...encode(key), 0])));\\n\",\n \"file_path\": \"lib/Neko.ts\",\n \"rank\": 14,\n \"score\": 29947.28940163874\n },\n {\n \"content\": \"let rightPressed = false; \\n\",\n \"file_path\": \"canvas/examples/brickbreaker.ts\",\n \"rank\": 15,\n \"score\": 29137.084644085677\n },\n {\n \"content\": \"const thetaZ = theta * Math.PI / 180\\n\",\n \"file_path\": \"canvas/examples/terrain.ts\",\n \"rank\": 16,\n \"score\": 29107.145138897977\n },\n {\n \"content\": \"let leftPressed = false;\\n\",\n \"file_path\": \"canvas/examples/brickbreaker.ts\",\n \"rank\": 17,\n \"score\": 29107.145138897977\n },\n {\n \"content\": \"const BLOCK_H = H / ROWS;\\n\",\n \"file_path\": \"canvas/examples/tetris.ts\",\n \"rank\": 18,\n \"score\": 29107.145138897977\n },\n {\n \"content\": \"let thetaZ = theta * Math.PI / 180\\n\",\n \"file_path\": \"canvas/examples/cube.ts\",\n \"rank\": 19,\n \"score\": 29107.145138897977\n },\n {\n \"content\": \"const BLOCK_W = W / COLS;\\n\",\n \"file_path\": \"canvas/examples/tetris.ts\",\n \"rank\": 20,\n \"score\": 29107.145138897977\n },\n {\n \"content\": \" isMouseButtonDown(key: string): boolean {\\n\\n return unwrapBoolean(lib.symbols.window_is_mouse_button_down(this.#id, new Uint8Array([...encode(key), 0])));\\n\",\n \"file_path\": \"lib/Neko.ts\",\n \"rank\": 21,\n \"score\": 29079.069666885345\n },\n {\n \"content\": \"const brickHeight = 20;\\n\",\n \"file_path\": \"canvas/examples/brickbreaker.ts\",\n \"rank\": 22,\n \"score\": 29024.158902857176\n },\n {\n \"content\": \"const paddleHeight = 10;\\n\",\n \"file_path\": \"canvas/examples/brickbreaker.ts\",\n \"rank\": 23,\n \"score\": 29024.158902857176\n },\n {\n \"content\": \"const brickWidth = 80;\\n\",\n \"file_path\": \"canvas/examples/brickbreaker.ts\",\n \"rank\": 24,\n \"score\": 29024.158902857176\n },\n {\n \"content\": \"let paddleWidth = 75;\\n\",\n \"file_path\": \"canvas/examples/brickbreaker.ts\",\n \"rank\": 25,\n \"score\": 29024.158902857176\n },\n {\n \"content\": \"let lastX: any\\n\",\n \"file_path\": \"canvas/examples/spiral.ts\",\n \"rank\": 26,\n \"score\": 28996.8191676101\n },\n {\n \"content\": \"let currentX: number | undefined;\\n\",\n \"file_path\": \"canvas/examples/tetris.ts\",\n \"rank\": 27,\n \"score\": 28996.8191676101\n },\n {\n \"content\": \"const foodX: any[] = [];\\n\",\n \"file_path\": \"canvas/examples/snake.ts\",\n \"rank\": 28,\n \"score\": 28996.8191676101\n },\n {\n \"content\": \"let thetaX = theta * Math.PI / 180\\n\",\n \"file_path\": \"canvas/examples/cube.ts\",\n \"rank\": 29,\n \"score\": 28996.8191676101\n },\n {\n \"content\": \"const thetaX = theta * Math.PI / 180\\n\",\n \"file_path\": \"canvas/examples/terrain.ts\",\n \"rank\": 30,\n \"score\": 28996.8191676101\n },\n {\n \"content\": \"let paddleX = (canvas.width - paddleWidth) / 2;\\n\",\n \"file_path\": \"canvas/examples/brickbreaker.ts\",\n \"rank\": 31,\n \"score\": 28996.8191676101\n },\n {\n \"content\": \"const brickOffsetLeft = 40;\\n\",\n \"file_path\": \"canvas/examples/brickbreaker.ts\",\n \"rank\": 32,\n \"score\": 28287.058158667696\n },\n {\n \"content\": \" getMousePosition(): [number, number] {\\n\\n return [lib.symbols.window_get_mouse_x(this.#id), lib.symbols.window_get_mouse_y(this.#id)];\\n\",\n \"file_path\": \"lib/Neko.ts\",\n \"rank\": 33,\n \"score\": 28259.77370648719\n },\n {\n \"content\": \"<p align=\\\"center\\\">\\n\\n <img src=https://raw.githubusercontent.com/load1n9/neko/master/assets/neko.png width=\\\"100rem\\\" /> \\n\\n <br>\\n\\n <h1 align=\\\"center\\\" >Neko 🐈</h1>\\n\\n</p>\\n\\n\\n\\nneko's twin frame buffer deno module built on top of mini_fb with canvas api implementation\\n\\n<p align=\\\"center\\\">\\n\\n <a href=\\\"https://github.com/load1n9/neko/stargazers\\\">\\n\\n <img alt=\\\"neko stars\\\" src=\\\"https://img.shields.io/github/stars/load1n9/neko?logo=data:image/png;base64,iVBORw0KGgoAAAANSUhEUgAAABwAAAAcCAYAAAEFCu8CAAAABGdBTUEAALGPC/xhBQAAADhlWElmTU0AKgAAAAgAAYdpAAQAAAABAAAAGgAAAAAAAqACAAQAAAABAAAAHKADAAQAAAABAAAAHAAAAABHddaYAAABxElEQVRIDe2Wv04CQRDGAQuoTKQ2ITyADZWVJZWV+gJYWBNqKh/C16CRBlprWxsTE2NJfABNOH9z7Gzm2Nv7A8TCOMnHzs1838ze3e4ejUbMkiRZS64lP1x8MjTFr2DQE6Gl2nI+7POARXAmdbas44ku8eLGhU9UckRliX6qxM9sQvz0vrcVaaKJKdsSNO7LOtK1kvcbaXVRu4LMz9kgKoYwBq/KLBi/yC2DQgSnBaLMQ88Tx7Q3AVkDKHpgBdoak5HrCSjuaAW/6zOz+u/Q3ZfcVrhliuaPYCAqsSJekIO/TlWbn2BveAH5JZBVUWayusZW2ClTuPzMi6xTIp5abuBHxHLcZSyzkxHF1uNJRrV9gXBhOl7h6wFW/FqcaGILEmsDWfg9G//3858Az0lWaHhm5dP3i9JoDtTm+1UrUdMl72OZv10itfx3zOYpLAv/FPQNLvFj35Bnco/gzeCD72H6b4JYaDTpgidwaJOa3bCji5BsgYcDdJUamSMi2lQTCEbgu0Zz4Y5UX3tE3K/RTKny3qNWdst3UWU8sYtmU40py2Go9o5zC460l/guJjm1leZrjaiH4B4cVxUK12mGVTV/j/cDqcFClUX01ZEAAAAASUVORK5CYII=\\\" />\\n\\n </a>\\n\\n <a href=\\\"https://github.com/load1n9/neko/releases/latest/\\\">\\n\\n <img alt=\\\"neko releases\\\" src=\\\"https://img.shields.io/github/v/release/load1n9/neko?logo=github\\\" />\\n\\n </a>\\n\\n <a href=\\\"https://github.com/load1n9/neko/blob/master/LICENSE\\\">\\n\\n <img alt=\\\"neko License\\\" src=\\\"https://img.shields.io/github/license/load1n9/neko?logo=data:image/png;base64,iVBORw0KGgoAAAANSUhEUgAAABwAAAAcCAYAAAEFCu8CAAAABGdBTUEAALGPC/xhBQAAADhlWElmTU0AKgAAAAgAAYdpAAQAAAABAAAAGgAAAAAAAqACAAQAAAABAAAAHKADAAQAAAABAAAAHAAAAABHddaYAAAC5UlEQVRIDd2WPWtVQRCGby5pVASLiGghQSxyG8Ui2KWwCfkH9olY2JneQkiR0oCIxH/gB+qVFDYBIWBAbAIRSbCRpLXwIxLiPT7vnNm9e87ZxJtUwYH3zO47Mzv7Mbv3tlo5KYriGtgAJ81OY1ENdG/YI4boFEOI911BXgY/pdtwGuAtXpvmB1tAXHDnUolE5urkPOQo6MqA3pXWmJJL4Bb4rQ7yEYfxsjnIF29NJIoNC6e5fxOL/qN+9KCz7AaLpN8zI415N2i2EptpGrkRIjGeAuvR6IY1hSFLFUOug9Ms2M7ZxIUNytm1mnME186sdI2BOCwAyQMg54ugzSmKmwbPwSbolKH+hbAtQdsOoF+BsF3anUVwBdiOWRidFZDKTTrKEAJTm3GVrGkHzw/uPZbyx7DNNLfB7KGmRsCcr+/gjaiPSpAOTyX9qG4L/XBDdWXDDf1M+wtQ5fwCOtcb4Dto6VpLmzByB6gqdHbTItGSJdAGqibJQhmRfCF7IN4beSF2G9CqnGXQrxofXU+EykllNeoczRgYytDKMubDIRK0g5MF8rE69cGu0u9nlUcqaUZ41W0qK2nGcSzr4D2wV9U9wxp1rnpxn8agXAOHMQ9cy9kbHM7ngY4gFb03TxrO/yfBUifTtXt78jCrjY/jgEFnMn45LuNWUtknuu7NSm7D3QEn3HbatV1Q2jvgIRf1sfODKQaeymxZoMLlTqsq1LF+HvaTqQOzEzUCfni0/eNIA+DfuE3KEtbsegckGmMktTXacnBHPVe687ugkpT+axCkkhBSyRSjWI2xf1KMMVmYiQdWksK9BEFiQoiYLIlvJA3/zeTzCejP0RbB6YPbhZuB+0pR3KcdX0LaJtju0ZgBL8Bd+sbz2QIaU2OfBX3BaQLsgZysQtrk0M8Sh1A0w3DyyYnGnAiZ4gqZ/TvI2A8OGd1YIbF7+F3P+B6dYpYdsJNZgrjO0UdOIhmom0nwL0pnfnzkL1803jAoKhvyAAAAAElFTkSuQmCC\\\" />\\n\\n </a>\\n\\n </p>\\n\\n<hr/>\\n\\n\\n\",\n \"file_path\": \"README.md\",\n \"rank\": 34,\n \"score\": 25640.785658484252\n },\n {\n \"content\": \"## [Canvas API using Neko](https://github.com/load1n9/neko/tree/master/canvas)\\n\\n\\n\\n<img src=\\\"https://raw.githubusercontent.com/load1n9/neko/master/assets/tetris.png\\\" width=\\\"1500rem\\\" />\\n\\n### Usage\\n\\n\\n\\n#### Using Methods\\n\\n\\n\\n```typescript\\n\\nimport { World, Neko } from \\\"https://deno.land/x/neko/mod.ts\\\";\\n\\n\\n\\nconst width = 800;\\n\\nconst height = 600;\\n\\n\\n\\nconst neko = new Neko({\\n\\n title: \\\"Neko\\\",\\n\\n width,\\n\\n height,\\n\\n});\\n\\nconst frame = new Uint8Array(width * height * 4).fill(0x000000);\\n\\nclass Instance extends World {\\n\\n update() {\\n\\n frame[Math.round(Math.random() * frame.length)] = Math.round(Math.random() * 0xffffff);\\n\\n neko.setFrameBuffer(frame);\\n\\n }\\n\\n}\\n\\n\\n\\nnew Instance().start(neko, 60);\\n\\n```\\n\\n#### Using Functions\\n\\n```typescript\\n\\nimport { World, Neko } from \\\"https://deno.land/x/neko/mod.ts\\\";\\n\\n\\n\\nconst width = 800;\\n\\nconst height = 600;\\n\\n\\n\\nconst neko = new Neko({\\n\\n title: \\\"Neko\\\",\\n\\n width,\\n\\n height,\\n\\n});\\n\\nconst frame = new Uint8Array(width * height * 4).fill(0x000000);\\n\\nnew World().start(neko, {\\n\\n fps: 60,\\n\\n update: () => {\\n\\n frame[Math.round(Math.random() * frame.length)] = Math.round(Math.random() * 0xffffff);\\n\\n neko.setFrameBuffer(frame);\\n\\n }\\n\\n});\\n\\n```\\n\\n### Maintainers\\n\\n- Loading ([@load1n9](https://github.com/load1n9))\\n\\n\\n\",\n \"file_path\": \"README.md\",\n \"rank\": 35,\n \"score\": 25639.780087096955\n },\n {\n \"content\": \"export { Neko } from \\\"./lib/Neko.ts\\\";\\n\",\n \"file_path\": \"mod.ts\",\n \"rank\": 36,\n \"score\": 25630.810228469283\n },\n {\n \"content\": \"# Neko Canvas 🐈\\n\\n\\n\\n### Usage\\n\\n\\n\\n#### Render a red square\\n\\n```typescript\\n\\nimport { Canvas } from \\\"https://deno.land/x/neko/canvas/mod.ts\\\";\\n\\n\\n\\nconst canvas = new Canvas({\\n\\n title: \\\"Neko\\\",\\n\\n width: 200,\\n\\n height: 200,\\n\\n fps: 60,\\n\\n});\\n\\n\\n\\nconst ctx = canvas.getContext(\\\"2d\\\");\\n\\n\\n\\nctx.fillStyle = \\\"red\\\";\\n\\nctx.fillRect(10, 10, 50, 50);\\n\\n```\\n\\n#### Render an Image\\n\\n```typescript\\n\\nimport { Canvas, loadImage } from \\\"https://deno.land/x/neko/canvas/mod.ts\\\";\\n\\n\\n\\nconst canvas = new Canvas({\\n\\n title: \\\"Neko\\\",\\n\\n width: 500,\\n\\n height: 500,\\n\\n});\\n\\n\\n\\nconst ctx = canvas.getContext(\\\"2d\\\");\\n\\n// image created by Hashrock (https://hashrock.studio.site)\\n\\nconst img = await loadImage(\\\"https://deno.land/images/artwork/hashrock_simple.png\\\");\\n\\nctx.drawImage(img, 0, 0);\\n\\n```\\n\",\n \"file_path\": \"canvas/README.md\",\n \"rank\": 37,\n \"score\": 24988.44384608725\n },\n {\n \"content\": \"import { Plug } from \\\"https://deno.land/x/plug@0.5.1/mod.ts\\\";\\n\\nimport { NekoOptions } from \\\"./types.ts\\\";\\n\\nimport { encode, unwrap, unwrapBoolean } from \\\"./utils.ts\\\";\\n\\n\\n\\nconst options: Plug.Options = {\\n\\n name: \\\"neko\\\",\\n\\n urls: {\\n\\n windows: `https://github.com/load1n9/neko/blob/master/dist/neko.dll?raw=true`,\\n\\n darwin: `https://github.com/load1n9/neko/blob/master/dist/libneko.dylib?raw=true`,\\n\\n linux: `https://github.com/load1n9/neko/blob/master/dist/libneko.so?raw=true` \\n\\n },\\n\\n};\\n\\n\\n\\nconst lib = await Plug.prepare(options, {\\n\\n window_new: {\\n\\n parameters: [\\\"pointer\\\", \\\"usize\\\", \\\"usize\\\"],\\n\\n result: \\\"u32\\\",\\n\\n },\\n\\n\\n\\n window_close: {\\n\\n parameters: [\\\"u32\\\"],\\n\\n result: \\\"u32\\\",\\n\\n },\\n\\n window_is_open: {\\n\\n parameters: [\\\"u32\\\"],\\n\\n result: \\\"u32\\\",\\n\\n },\\n\\n window_is_key_down: {\\n\\n parameters: [\\\"u32\\\", \\\"pointer\\\"],\\n\\n result: \\\"u32\\\",\\n\\n },\\n\\n\\n\\n window_is_mouse_button_down: {\\n\\n parameters: [\\\"u32\\\", \\\"pointer\\\"],\\n\\n result: \\\"u32\\\",\\n\\n },\\n\\n\\n\\n window_is_active: {\\n\\n parameters: [\\\"u32\\\"],\\n\\n result: \\\"u32\\\",\\n\\n },\\n\\n\\n\\n window_limit_update_rate: {\\n\\n parameters: [\\\"u32\\\", \\\"u64\\\"],\\n\\n result: \\\"u32\\\",\\n\\n },\\n\\n\\n\\n window_update_with_buffer: {\\n\\n parameters: [\\\"u32\\\", \\\"pointer\\\", \\\"usize\\\", \\\"usize\\\"],\\n\\n result: \\\"u32\\\",\\n\\n },\\n\\n\\n\\n window_update: {\\n\\n parameters: [\\\"u32\\\"],\\n\\n result: \\\"u32\\\",\\n\\n },\\n\\n\\n\\n window_get_mouse_x: {\\n\\n parameters: [\\\"u32\\\"],\\n\\n result: \\\"f32\\\",\\n\\n },\\n\\n\\n\\n window_get_mouse_y: {\\n\\n parameters: [\\\"u32\\\"],\\n\\n result: \\\"f32\\\",\\n\\n },\\n\\n\\n\\n window_get_mouse_scroll: {\\n\\n parameters: [\\\"u32\\\"],\\n\\n result: \\\"f32\\\",\\n\\n },\\n\\n});\\n\\n\\n\\n\\n\\nexport class Neko {\\n\\n #id;\\n\\n width: number;\\n\\n height: number;\\n\\n constructor(options: NekoOptions) {\\n\\n this.width = options.width;\\n\\n this.height = options.height;\\n\\n this.#id = lib.symbols.window_new(\\n\\n new Uint8Array([...encode(options.title), 0]),\\n\\n options.width,\\n\\n options.height,\\n\\n );\\n\\n }\\n\\n limitUpdateRate(micros: number) {\\n\\n unwrap(lib.symbols.window_limit_update_rate(this.#id, micros));\\n\\n }\\n\\n setFrameBuffer(buffer: Uint8Array, width?: number, height?: number) {\\n\\n unwrap(\\n\\n lib.symbols.window_update_with_buffer(\\n\\n this.#id,\\n\\n buffer,\\n\\n width ?? this.width,\\n\\n height ?? this.height,\\n\\n )\\n\\n );\\n\\n }\\n\\n\\n\\n update() {\\n\\n unwrap(lib.symbols.window_update(this.#id));\\n\\n }\\n\\n\\n\\n close() {\\n\\n unwrap(lib.symbols.window_close(this.#id));\\n\\n }\\n\\n\\n\\n isKeyDown(key: string): boolean {\\n\\n return unwrapBoolean(lib.symbols.window_is_key_down(this.#id, new Uint8Array([...encode(key), 0])));\\n\\n }\\n\\n\\n\\n isMouseButtonDown(key: string): boolean {\\n\\n return unwrapBoolean(lib.symbols.window_is_mouse_button_down(this.#id, new Uint8Array([...encode(key), 0])));\\n\\n }\\n\\n\\n\\n getScroll(): number {\\n\\n return lib.symbols.window_get_mouse_scroll(this.#id);\\n\\n }\\n\\n\\n\\n\\n\\n getMousePosition(): [number, number] {\\n\\n return [lib.symbols.window_get_mouse_x(this.#id), lib.symbols.window_get_mouse_y(this.#id)];\\n\\n }\\n\\n\\n\\n get open(): boolean {\\n\\n return unwrapBoolean(lib.symbols.window_is_open(this.#id));\\n\\n }\\n\\n\\n\\n get active(): boolean {\\n\\n return unwrapBoolean(lib.symbols.window_is_active(this.#id));\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"lib/Neko.ts\",\n \"rank\": 38,\n \"score\": 24981.80989607868\n },\n {\n \"content\": \"import { World, Neko } from \\\"../mod.ts\\\";\\n\\n\\n\\nconst width = 800;\\n\\nconst height = 600;\\n\\n\\n\\nconst neko = new Neko({\\n\\n title: \\\"Neko\\\",\\n\\n width,\\n\\n height,\\n\\n});\\n\\nconst frame = new Uint8Array(width * height * 4).fill(0x000000);\\n\\nclass Instance extends World {\\n\\n update() {\\n\\n frame[Math.round(Math.random() * frame.length)] = Math.round(Math.random() * 0xffffff);\\n\\n neko.setFrameBuffer(frame);\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"examples/test.ts\",\n \"rank\": 39,\n \"score\": 24981.80989607868\n },\n {\n \"content\": \"import { Neko } from \\\"./Neko.ts\\\";\\n\\nimport { WorldSettings } from \\\"./types.ts\\\";\\n\\n\\n\\nexport class World {\\n\\n start(renderer: Neko, settingsOrFps: number | WorldSettings = 60) {\\n\\n const settings = typeof settingsOrFps === \\\"number\\\" ? { fps: settingsOrFps } : settingsOrFps;\\n\\n const fps = typeof settingsOrFps === \\\"number\\\" ? settingsOrFps : settingsOrFps.fps;\\n\\n (settings.setup || this.setup)();\\n\\n setInterval(() => {\\n\\n if (renderer.open) {\\n\\n (settings.update || this.update)();\\n\\n } else {\\n\\n Deno.exit(0)\\n\\n }\\n\\n }, 1 / fps * 1000)\\n\\n }\\n\\n setup() {\\n\\n \\n\\n }\\n\\n update() {\\n\\n\\n\\n }\\n\",\n \"file_path\": \"lib/World.ts\",\n \"rank\": 40,\n \"score\": 24981.80989607868\n },\n {\n \"content\": \"import { Neko, World } from \\\"../mod.ts\\\";\\n\\nimport { createCanvas } from \\\"https://deno.land/x/canvas@v1.4.1/mod.ts\\\";\\n\\nimport type {\\n\\n CanvasRenderingContext2D,\\n\\n EmulatedCanvas2D,\\n\\n} from \\\"https://deno.land/x/canvas@v1.4.1/mod.ts\\\";\\n\\ninterface Config {\\n\\n title?: string;\\n\\n width?: number;\\n\\n height?: number;\\n\\n fps?: number;\\n\\n}\\n\\nexport class Canvas {\\n\\n #title: string;\\n\\n #ctx: CanvasRenderingContext2D;\\n\\n #canvas: EmulatedCanvas2D;\\n\\n window: Neko;\\n\\n #world: World;\\n\\n #width: number;\\n\\n #height: number;\\n\\n #fps: number;\\n\\n constructor(config: Config) {\\n\\n this.#world = new World();\\n\\n this.#height = config.height || 200;\\n\\n this.#width = config.width || 200;\\n\\n this.#title = config.title || \\\"Neko\\\";\\n\\n this.#fps = config.fps || 60;\\n\\n this.#canvas = createCanvas(this.#width, this.#height);\\n\\n this.#ctx = this.#canvas.getContext(\\\"2d\\\");\\n\\n this.window = new Neko({\\n\\n title: this.#title,\\n\\n width: this.#width,\\n\\n height: this.#height,\\n\\n });\\n\\n this.#world.start(this.window, {\\n\\n fps: this.#fps,\\n\\n update: () => {\\n\\n this.window.setFrameBuffer(\\n\\n this.#canvas.getRawBuffer(0, 0, this.#width, this.#height),\\n\\n );\\n\\n },\\n\\n });\\n\\n }\\n\\n getContext(_type = \\\"2d\\\"): CanvasRenderingContext2D {\\n\\n return this.#ctx;\\n\\n }\\n\\n get canvas(): EmulatedCanvas2D {\\n\\n return this.#canvas;\\n\\n }\\n\\n get width(): number {\\n\\n return this.#width;\\n\\n }\\n\\n get height(): number {\\n\\n return this.#height;\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"canvas/Ctx.ts\",\n \"rank\": 41,\n \"score\": 24981.80989607868\n },\n {\n \"content\": \"export interface NekoOptions {\\n\\n title: string;\\n\\n width: number;\\n\\n height: number;\\n\\n}\\n\\nexport interface WorldSettings {\\n\\n fps: number;\\n\\n setup?: () => void;\\n\\n update?: () => void;\\n\",\n \"file_path\": \"lib/types.ts\",\n \"rank\": 42,\n \"score\": 24981.80989607868\n },\n {\n \"content\": \"export const encode = (str: string): Uint8Array => new TextEncoder().encode(str);\\n\\n\\n\\nconst ERROR_CODES: {\\n\\n [code: number]: string | undefined;\\n\\n} = {\\n\\n 2: \\\"Window not found\\\",\\n\\n 3: \\\"Failed to updateWithBuffer\\\",\\n\\n};\\n\\n\\n\\nexport function unwrap(result: number) {\\n\\n let error;\\n\\n if ((error = ERROR_CODES[result])) {\\n\\n throw new Error(`Unwrap called on Error Value (${result}): ${error}`);\\n\\n }\\n\\n}\\n\\n\\n\\nexport function unwrapBoolean(result: number): boolean {\\n\\n if (result !== 0 && result !== 1) {\\n\\n unwrap(result);\\n\\n return false;\\n\\n } else {\\n\\n return result === 1;\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"lib/utils.ts\",\n \"rank\": 43,\n \"score\": 24981.80989607868\n },\n {\n \"content\": \"export * from \\\"./Ctx.ts\\\";\\n\",\n \"file_path\": \"canvas/mod.ts\",\n \"rank\": 44,\n \"score\": 24981.80989607868\n },\n {\n \"content\": \"let x = canvas.width / 2;\\n\",\n \"file_path\": \"canvas/examples/brickbreaker.ts\",\n \"rank\": 45,\n \"score\": 24856.22541582151\n },\n {\n \"content\": \"// deno-lint-ignore-file no-explicit-any\\n\\nimport { Canvas } from \\\"../mod.ts\\\";\\n\\n\\n\\nconst COLS = 20;\\n\\nconst ROWS = 20;\\n\\nconst board: any = [];\\n\\n// deno-lint-ignore no-unused-vars prefer-const\\n\\nlet score = 0;\\n\\nlet lose = false;\\n\\nlet interval: any;\\n\\nlet intervalRender: any;\\n\\nlet intervalRotate: any;\\n\\nlet current: any;\\n\\nlet currentX: number | undefined;\\n\\nlet currentY: number | undefined;\\n\\nlet freezed: boolean | undefined;\\n\\nconst shapes = [\\n\\n [1, 1, 1, 1],\\n\\n [1, 1, 1, 0, 1],\\n\\n [1, 1, 1, 0, 0, 0, 1],\\n\\n [1, 1, 0, 0, 1, 1],\\n\\n [1, 1, 0, 0, 0, 1, 1],\\n\\n [0, 1, 1, 0, 1, 1],\\n\\n [0, 1, 0, 0, 1, 1, 1],\\n\\n];\\n\\nconst colors = [\\n\\n \\\"cyan\\\",\\n\\n \\\"orange\\\",\\n\\n \\\"blue\\\",\\n\\n \\\"yellow\\\",\\n\\n \\\"red\\\",\\n\\n \\\"green\\\",\\n\\n \\\"purple\\\",\\n\\n];\\n\\nfunction newShape() {\\n\\n const id = Math.floor(Math.random() * shapes.length);\\n\\n const shape = shapes[id];\\n\\n current = [];\\n\\n for (let y = 0; y < 4; ++y) {\\n\\n current[y] = [];\\n\\n for (let x = 0; x < 4; ++x) {\\n\\n const i = 4 * y + x;\\n\\n if (typeof shape[i] != \\\"undefined\\\" && shape[i]) {\\n\\n current[y][x] = id + 1;\\n\\n } else {\\n\\n current[y][x] = 0;\\n\\n }\\n\\n }\\n\\n }\\n\\n freezed = false;\\n\\n currentX = 5;\\n\\n currentY = 0;\\n\\n}\\n\\n\\n\\nfunction init() {\\n\\n for (let y = 0; y < ROWS; ++y) {\\n\\n board[y] = [];\\n\\n for (let x = 0; x < COLS; ++x) {\\n\\n board[y][x] = 0;\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\nfunction tick() {\\n\\n if (valid(0, 1)) {\\n\\n (currentY!)++;\\n\\n }\\n\\n else {\\n\\n freeze();\\n\\n valid(0, 1);\\n\\n clearLines();\\n\\n if (lose) {\\n\\n clearAllIntervals();\\n\\n return false;\\n\\n }\\n\\n newShape();\\n\\n }\\n\\n}\\n\\n\\n\\nfunction freeze() {\\n\\n for (let y = 0; y < 4; ++y) {\\n\\n for (let x = 0; x < 4; ++x) {\\n\\n if (current[y][x]) {\\n\\n board[y + currentY!][x + currentX!] = current[y][x];\\n\\n }\\n\\n }\\n\\n }\\n\\n freezed = true;\\n\\n}\\n\\n\\n\\nfunction rotate(current: any) {\\n\\n const newCurrent: any = [];\\n\\n for (let y = 0; y < 4; ++y) {\\n\\n newCurrent[y] = [];\\n\\n for (let x = 0; x < 4; ++x) {\\n\\n newCurrent[y][x] = current[3 - x][y];\\n\\n }\\n\\n }\\n\\n\\n\\n return newCurrent;\\n\\n}\\n\\n\\n\\nfunction clearLines() {\\n\\n for (let y = ROWS - 1; y >= 0; --y) {\\n\\n let rowFilled = true;\\n\\n for (let x = 0; x < COLS; ++x) {\\n\\n if (board[y][x] == 0) {\\n\\n rowFilled = false;\\n\\n break;\\n\\n }\\n\\n }\\n\\n if (rowFilled) {\\n\\n for (let yy = y; yy > 0; --yy) {\\n\\n for (let x = 0; x < COLS; ++x) {\\n\\n board[yy][x] = board[yy - 1][x];\\n\\n }\\n\\n }\\n\\n y++;\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\nfunction keyPress(key: string) {\\n\\n switch (key) {\\n\\n case \\\"left\\\":\\n\\n if (valid(-1)) {\\n\\n (currentX!)--;\\n\\n }\\n\\n break;\\n\\n case \\\"right\\\":\\n\\n if (valid(1)) {\\n\\n (currentX!)++;\\n\\n }\\n\\n break;\\n\\n case \\\"down\\\":\\n\\n if (valid(0, 1)) {\\n\\n (currentY!)++;\\n\\n }\\n\\n break;\\n\\n // deno-lint-ignore no-case-declarations\\n\\n case \\\"rotate\\\":\\n\\n const rotated = rotate(current);\\n\\n if (valid(0, 0, rotated)) {\\n\\n current = rotated;\\n\\n }\\n\\n break;\\n\\n case \\\"drop\\\":\\n\\n while (valid(0, 1)) {\\n\\n (currentY!)++;\\n\\n }\\n\\n tick();\\n\\n break;\\n\\n }\\n\\n}\\n\\nfunction checkForKeyPress() {\\n\\n if(canvas.window.isKeyDown(\\\"up\\\")) {\\n\\n keyPress(\\\"rotate\\\");\\n\\n }\\n\\n}\\n\\nfunction valid(offsetX = 0, offsetY = 0, newCurrent?: any) {\\n\\n offsetX = currentX! + offsetX;\\n\\n offsetY = currentY! + offsetY;\\n\\n newCurrent = newCurrent || current;\\n\\n\\n\\n for (let y = 0; y < 4; y++) {\\n\\n for (let x = 0; x < 4; x++) {\\n\\n if (newCurrent[y][x]) {\\n\\n if (\\n\\n typeof board[y + offsetY] == \\\"undefined\\\" ||\\n\\n typeof board[y + offsetY][x + offsetX] == \\\"undefined\\\" ||\\n\\n board[y + offsetY][x + offsetX] ||\\n\\n x + offsetX < 0 ||\\n\\n y + offsetY >= ROWS ||\\n\\n x + offsetX >= COLS\\n\\n ) {\\n\\n if (offsetY == 1 && freezed) {\\n\\n lose = true;\\n\\n }\\n\\n return false;\\n\\n }\\n\\n }\\n\\n }\\n\\n }\\n\\n return true;\\n\\n}\\n\\n\\n\\nfunction playButtonClicked() {\\n\\n newGame();\\n\\n}\\n\\n\\n\\nfunction newGame() {\\n\\n clearAllIntervals();\\n\\n intervalRender = setInterval(render, 30);\\n\\n intervalRotate = setInterval(checkForKeyPress, 70);\\n\\n init();\\n\\n newShape();\\n\\n lose = false;\\n\\n interval = setInterval(tick, 400);\\n\\n}\\n\\n\\n\\nfunction clearAllIntervals() {\\n\\n clearInterval(interval);\\n\\n clearInterval(intervalRender);\\n\\n clearInterval(intervalRotate);\\n\\n}\\n\\n\\n\\nconst canvas = new Canvas({\\n\\n title: \\\"Tetris\\\",\\n\\n width: 300,\\n\\n height: 300,\\n\\n});\\n\\nconst ctx = canvas.getContext(\\\"2d\\\");\\n\\nconst W = 300;\\n\\nconst H = 300;\\n\\nconst BLOCK_W = W / COLS;\\n\\nconst BLOCK_H = H / ROWS;\\n\\n\\n\\nfunction drawBlock(x: number, y: number) {\\n\\n ctx.fillRect(BLOCK_W * x, BLOCK_H * y, BLOCK_W - 1, BLOCK_H - 1);\\n\\n ctx.strokeRect(BLOCK_W * x, BLOCK_H * y, BLOCK_W - 1, BLOCK_H - 1);\\n\\n}\\n\\n\\n\\nfunction render() {\\n\\n ctx.clearRect(0, 0, W, H);\\n\\n if(canvas.window.isKeyDown(\\\"space\\\")) {\\n\\n keyPress(\\\"drop\\\");\\n\\n }\\n\\n if(canvas.window.isKeyDown(\\\"left\\\")) {\\n\\n keyPress(\\\"left\\\");\\n\\n }\\n\\n if(canvas.window.isKeyDown(\\\"right\\\")) {\\n\\n keyPress(\\\"right\\\");\\n\\n }\\n\\n if(canvas.window.isKeyDown(\\\"down\\\")) {\\n\\n keyPress(\\\"down\\\");\\n\\n }\\n\\n ctx.strokeStyle = \\\"black\\\";\\n\\n for (let x = 0; x < COLS; ++x) {\\n\\n for (let y = 0; y < ROWS; ++y) {\\n\\n if (board[y][x]) {\\n\\n ctx.fillStyle = colors[board[y][x] - 1];\\n\\n drawBlock(x, y);\\n\\n }\\n\\n }\\n\\n }\\n\\n\\n\\n ctx.fillStyle = \\\"red\\\";\\n\\n ctx.strokeStyle = \\\"black\\\";\\n\\n for (let y = 0; y < 4; ++y) {\\n\\n for (let x = 0; x < 4; ++x) {\\n\\n if (current[y][x]) {\\n\\n ctx.fillStyle = colors[current[y][x] - 1];\\n\\n drawBlock(currentX! + x, currentY! + y);\\n\\n }\\n\\n }\\n\\n }\\n\\n}\\n\\nplayButtonClicked();\\n\",\n \"file_path\": \"canvas/examples/tetris.ts\",\n \"rank\": 46,\n \"score\": 24364.864698215602\n },\n {\n \"content\": \"// ported from https://codepen.io/hakimel/pen/QdWpRv\\n\\nimport { Canvas } from \\\"../mod.ts\\\";\\n\\nconst canvas = new Canvas({\\n\\n title: \\\"spiral\\\",\\n\\n width: 1000,\\n\\n height: 1000,\\n\\n});\\n\\nconst context = canvas.getContext(\\\"2d\\\");\\n\\n\\n\\nlet time = 0;\\n\\nlet velocity = 0.1;\\n\\nconst velocityTarget = 0.1;\\n\\n// deno-lint-ignore no-explicit-any\\n\\nlet width: any\\n\\n// deno-lint-ignore no-explicit-any\\n\\nlet height: any\\n\\n// deno-lint-ignore no-explicit-any no-unused-vars\\n\\nlet lastX: any\\n\\n// deno-lint-ignore no-explicit-any no-unused-vars\\n\\nlet lastY: any\\n\\n\\n\\nconst MAX_OFFSET = 400;\\n\\nconst SPACING = 4;\\n\\nconst POINTS = MAX_OFFSET / SPACING;\\n\\nconst PEAK = MAX_OFFSET * 0.25;\\n\\nconst POINTS_PER_LAP = 6;\\n\\nconst SHADOW_STRENGTH = 6;\\n\\n\\n\\nsetup();\\n\\n\\n\\nfunction setup() {\\n\\n resize();\\n\\n step();\\n\\n}\\n\\n\\n\\nfunction resize() {\\n\\n width = canvas.width;\\n\\n height = canvas.height;\\n\\n}\\n\\n\\n\\nfunction step() {\\n\\n time += velocity;\\n\\n velocity += (velocityTarget - velocity) * 0.3;\\n\\n\\n\\n clear();\\n\\n render();\\n\\n}\\n\\n\\n\\nfunction clear() {\\n\\n context.clearRect(0, 0, width, height);\\n\\n}\\n\\n\\n\\nfunction render() {\\n\\n // deno-lint-ignore prefer-const\\n\\n let x, y, cx = width / 2, cy = height / 2;\\n\\n\\n\\n context.globalCompositeOperation = \\\"lighter\\\";\\n\\n context.strokeStyle = \\\"#fff\\\";\\n\\n context.shadowColor = \\\"#fff\\\";\\n\\n context.lineWidth = 2;\\n\\n context.beginPath();\\n\\n\\n\\n for (let i = POINTS; i > 0; i--) {\\n\\n const value = i * SPACING + (time % SPACING);\\n\\n\\n\\n const ax = Math.sin(value / POINTS_PER_LAP) * Math.PI;\\n\\n const ay = Math.cos(value / POINTS_PER_LAP) * Math.PI;\\n\\n\\n\\n x = ax * value, y = ay * value * 0.35;\\n\\n\\n\\n const o = 1 - (Math.min(value, PEAK) / PEAK);\\n\\n\\n\\n y -= Math.pow(o, 2) * 200;\\n\\n y += 200 * value / MAX_OFFSET;\\n\\n y += x / cx * width * 0.1;\\n\\n\\n\\n context.globalAlpha = 1 - (value / MAX_OFFSET);\\n\\n context.shadowBlur = SHADOW_STRENGTH * o;\\n\\n\\n\\n context.lineTo(cx + x, cy + y);\\n\\n context.stroke();\\n\\n\\n\\n context.beginPath();\\n\\n context.moveTo(cx + x, cy + y);\\n\\n }\\n\\n\\n\\n context.lineTo(cx, cy - 200);\\n\\n context.lineTo(cx, 0);\\n\\n context.stroke();\\n\\n}\\n\\n\\n\",\n \"file_path\": \"canvas/examples/spiral.ts\",\n \"rank\": 47,\n \"score\": 24364.864698215602\n },\n {\n \"content\": \"import { Canvas } from \\\"../mod.ts\\\";\\n\\n\\n\\nconst canvas = new Canvas({\\n\\n title: \\\"Neko\\\",\\n\\n width: 200,\\n\\n height: 200,\\n\\n fps: 60,\\n\\n});\\n\\n\\n\\nconst ctx = canvas.getContext(\\\"2d\\\");\\n\\n\\n\\nctx.fillStyle = \\\"red\\\";\\n\",\n \"file_path\": \"canvas/examples/rect.ts\",\n \"rank\": 48,\n \"score\": 24364.864698215602\n },\n {\n \"content\": \"// ported from https://github.com/AleikovStudio/Brick-breaker-game-JS-HTML-Canvas\\n\\nimport { Canvas } from \\\"../mod.ts\\\";\\n\\nconst canvas = new Canvas({\\n\\n title: \\\"Brick Breaker\\\",\\n\\n width: 500,\\n\\n height: 500,\\n\\n});\\n\\nconst ctx = canvas.getContext(\\\"2d\\\");\\n\\n\\n\\nlet x = canvas.width / 2;\\n\\nlet y = canvas.height - 80;\\n\\nconst paddleHeight = 10;\\n\\nlet paddleWidth = 75;\\n\\nlet paddleX = (canvas.width - paddleWidth) / 2;\\n\\nlet rightPressed = false; \\n\\nlet leftPressed = false;\\n\\nconst ballRadius = 10;\\n\\nconst brickRowCount = 7;\\n\\nconst brickColumnCount = 5;\\n\\n\\n\\nlet count = brickRowCount * brickColumnCount;\\n\\nlet rem = count;\\n\\n\\n\\nlet score = 0;\\n\\nlet lives = 3;\\n\\n\\n\\nconst brickWidth = 80;\\n\\nconst brickHeight = 20;\\n\\nconst brickPadding = 7;\\n\\nconst brickOffsetTop = 30;\\n\\nconst brickOffsetLeft = 40;\\n\\nlet speedup1 = 0;\\n\\nlet speedup2 = 0;\\n\\nlet speedup3 = 0;\\n\\nlet speedup4 = 0;\\n\\nlet speedup5 = 0;\\n\\nlet speedup6 = 0;\\n\\nconst _speedup7 = 0;\\n\\n\\n\\n// deno-lint-ignore no-explicit-any\\n\\nconst bricks: any = [];\\n\\nfor (let c = 0; c < brickColumnCount; ++c) {\\n\\n bricks[c] = [];\\n\\n for (let r = 0; r < brickRowCount; ++r) {\\n\\n bricks[c][r] = { x: 0, y: 0, status: 1 };\\n\\n }\\n\\n}\\n\\n\\n\\nlet dx = 3.5;\\n\\nlet dy = -3.5;\\n\\n\\n\\nfunction drawBall() {\\n\\n ctx.beginPath();\\n\\n ctx.arc(x, y, ballRadius, 0, Math.PI * 2);\\n\\n ctx.fillStyle = \\\"#fff\\\";\\n\\n ctx.fill();\\n\\n ctx.closePath();\\n\\n}\\n\\n\\n\\nfunction drawPaddle() {\\n\\n ctx.beginPath();\\n\\n ctx.rect(paddleX, canvas.height - paddleHeight, paddleWidth, paddleHeight);\\n\\n ctx.fillStyle = \\\"#00ffff\\\";\\n\\n ctx.fill();\\n\\n ctx.closePath();\\n\\n}\\n\\n\\n\\nfunction drawBricks() {\\n\\n for (let c = 0; c < brickColumnCount; ++c) {\\n\\n for (let r = 0; r < brickRowCount; ++r) {\\n\\n if (bricks[c][r].status == 1) {\\n\\n const brickX = (c * (brickWidth + brickPadding)) + brickOffsetLeft;\\n\\n const brickY = (r * (brickHeight + brickPadding)) + brickOffsetTop;\\n\\n bricks[c][r].x = brickX;\\n\\n bricks[c][r].y = brickY;\\n\\n ctx.beginPath();\\n\\n ctx.rect(brickX, brickY, brickWidth, brickHeight);\\n\\n if (c % 2 != 0) {\\n\\n ctx.fillStyle = \\\"#fff\\\";\\n\\n } else {\\n\\n ctx.fillStyle = \\\"#C2AA83\\\";\\n\\n }\\n\\n ctx.fill();\\n\\n ctx.closePath();\\n\\n }\\n\\n }\\n\\n }\\n\\n}\\n\\nfunction collisionDetection() {\\n\\n for (let c = 0; c < brickColumnCount; ++c) {\\n\\n for (let r = 0; r < brickRowCount; ++r) {\\n\\n const b = bricks[c][r];\\n\\n\\n\\n if (b.status == 1) {\\n\\n if (\\n\\n x > b.x && x < b.x + brickWidth && y > b.y && y < b.y + brickHeight\\n\\n ) {\\n\\n dy = -dy;\\n\\n b.status = 0;\\n\\n score++;\\n\\n count--;\\n\\n ctx.beginPath();\\n\\n ctx.arc(x, y, ballRadius, 0, Math.PI * 2);\\n\\n ctx.fillStyle = \\\"#00ffff\\\";\\n\\n ctx.fill();\\n\\n ctx.closePath();\\n\\n if (count <= (rem - rem / 7) && speedup1 == 0) {\\n\\n if (dy < 0) {\\n\\n dy -= 0.5;\\n\\n } else {\\n\\n dy += 0.5;\\n\\n }\\n\\n if (dx < 0) {\\n\\n dx -= 0.5;\\n\\n } else {\\n\\n dx += 0.5;\\n\\n }\\n\\n paddleWidth += 2;\\n\\n speedup1 = 1;\\n\\n }\\n\\n if (count <= (rem - 2 * rem / 7) && speedup2 == 0) {\\n\\n if (dy < 0) {\\n\\n dy -= 1;\\n\\n } else {\\n\\n dy += 1;\\n\\n }\\n\\n if (dx < 0) {\\n\\n dx -= 1;\\n\\n } else {\\n\\n dx += 1;\\n\\n }\\n\\n\\n\\n paddleWidth += 3;\\n\\n speedup2 = 1;\\n\\n }\\n\\n if (count <= (rem - 3 * rem / 7) && speedup3 == 0) {\\n\\n if (dy < 0) {\\n\\n dy -= 1;\\n\\n } else {\\n\\n dy += 1;\\n\\n }\\n\\n if (dx < 0) {\\n\\n dx -= 1;\\n\\n } else {\\n\\n dx += 1;\\n\\n }\\n\\n\\n\\n paddleWidth += 4;\\n\\n speedup3 = 1;\\n\\n }\\n\\n\\n\\n if (count <= (rem - 4 * rem / 7) && speedup4 == 0) {\\n\\n if (dy < 0) {\\n\\n dy -= 1;\\n\\n } else {\\n\\n dy += 1;\\n\\n }\\n\\n if (dx < 0) {\\n\\n dx -= 1;\\n\\n } else {\\n\\n dx += 1;\\n\\n }\\n\\n paddleWidth += 5;\\n\\n speedup4 = 1;\\n\\n }\\n\\n\\n\\n if (count <= (rem - 5 * rem / 7) && speedup5 == 0) {\\n\\n if (dy < 0) {\\n\\n dy -= 1;\\n\\n } else {\\n\\n dy += 1;\\n\\n }\\n\\n if (dx < 0) {\\n\\n dx -= 1;\\n\\n } else {\\n\\n dx += 1;\\n\\n }\\n\\n paddleWidth += 6;\\n\\n speedup5 = 1;\\n\\n }\\n\\n\\n\\n if (count <= (rem - 6 * rem / 7) && speedup6 == 0) {\\n\\n if (dy < 0) {\\n\\n dy -= 1;\\n\\n } else {\\n\\n dy += 1;\\n\\n }\\n\\n if (dx < 0) {\\n\\n dx -= 1;\\n\\n } else {\\n\\n dx += 1;\\n\\n }\\n\\n paddleWidth += 7;\\n\\n speedup6 = 1;\\n\\n }\\n\\n\\n\\n if (count <= 0) {\\n\\n console.log(\\\"You Win!\\\");\\n\\n Deno.exit(0);\\n\\n }\\n\\n }\\n\\n }\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\nfunction drawScore() {\\n\\n ctx.font = \\\"18px Arial\\\";\\n\\n ctx.fillStyle = \\\"#fff\\\";\\n\\n ctx.fillText(\\\"score: \\\" + score, 40, 20);\\n\\n}\\n\\n\\n\\nfunction drawLives() {\\n\\n ctx.font = \\\"18px Arial\\\";\\n\\n ctx.fillStyle = \\\"#fff\\\";\\n\\n ctx.fillText(\\n\\n \\\"lives: \\\" + lives,\\n\\n canvas.width - 310,\\n\\n 20,\\n\\n );\\n\\n}\\n\\n\\n\\nfunction draw() {\\n\\n keyHandler();\\n\\n ctx.clearRect(0, 0, canvas.width, canvas.height);\\n\\n drawBricks();\\n\\n drawBall();\\n\\n drawPaddle();\\n\\n drawScore();\\n\\n drawLives();\\n\\n\\n\\n collisionDetection();\\n\\n\\n\\n if (y + dy < ballRadius) {\\n\\n dy = -dy;\\n\\n } else if (y + dy > canvas.height - ballRadius) {\\n\\n if (x >= paddleX && x <= paddleX + paddleWidth) {\\n\\n dy = -dy;\\n\\n } else {\\n\\n lives--;\\n\\n if (lives <= 0) {\\n\\n console.log(\\\"Sorry, you've lost...\\\\nTry again! :-)\\\");\\n\\n Deno.exit(0);\\n\\n } else {\\n\\n x = canvas.width / 2;\\n\\n y = canvas.height - 30;\\n\\n paddleWidth = 80;\\n\\n rem = count;\\n\\n paddleX = (canvas.width - paddleWidth) / 2;\\n\\n }\\n\\n }\\n\\n } else {\\n\\n y += dy;\\n\\n }\\n\\n\\n\\n if (x + dx < ballRadius || x + dx > canvas.width - ballRadius) {\\n\\n dx = -dx;\\n\\n } else {\\n\\n x += dx;\\n\\n }\\n\\n\\n\\n if (rightPressed && paddleX < canvas.width - paddleWidth) {\\n\\n paddleX += 7;\\n\\n } else if (leftPressed && paddleX > 0) {\\n\\n paddleX -= 7;\\n\\n }\\n\\n}\\n\\n\\n\\nfunction keyHandler() {\\n\\n if (canvas.window.isKeyDown(\\\"right\\\")) {\\n\\n rightPressed = true;\\n\\n } else {\\n\\n rightPressed = false;\\n\\n }\\n\\n if (canvas.window.isKeyDown(\\\"left\\\")) {\\n\\n leftPressed = true;\\n\\n } else {\\n\\n leftPressed = false;\\n\\n }\\n\\n}\\n\\n\\n\\nsetInterval(draw, 20);\\n\",\n \"file_path\": \"canvas/examples/brickbreaker.ts\",\n \"rank\": 49,\n \"score\": 24364.864698215602\n },\n {\n \"content\": \"import { Canvas, loadImage } from \\\"../mod.ts\\\";\\n\\n\\n\\nconst canvas = new Canvas({\\n\\n title: \\\"Neko\\\",\\n\\n width: 500,\\n\\n height: 500,\\n\\n});\\n\\nconst ctx = canvas.getContext(\\\"2d\\\");\\n\\n// image created by Hashrock (https://hashrock.studio.site)\\n\\nconst img = await loadImage(\\\"https://deno.land/images/artwork/hashrock_simple.png\\\");\\n\",\n \"file_path\": \"canvas/examples/image.ts\",\n \"rank\": 50,\n \"score\": 24364.864698215602\n },\n {\n \"content\": \"// ported from https://codepen.io/lukasvait/pen/OJexNE\\n\\nimport { Canvas } from \\\"../mod.ts\\\";\\n\\nconst canvas = new Canvas({\\n\\n title: \\\"Snake\\\",\\n\\n width: 500,\\n\\n height: 500,\\n\\n});\\n\\n// deno-lint-ignore no-explicit-any\\n\\nlet loop: any = undefined;\\n\\nconst ctx = canvas.getContext(\\\"2d\\\");\\n\\nlet direction = \\\"\\\";\\n\\nlet directionQueue = \\\"\\\";\\n\\nconst fps = 70;\\n\\n// deno-lint-ignore no-explicit-any\\n\\nlet snake: any[] = [];\\n\\nconst snakeLength = 5;\\n\\nconst cellSize = 20;\\n\\nconst snakeColor = \\\"#3498db\\\";\\n\\nconst foodColor = \\\"#ff3636\\\";\\n\\n// deno-lint-ignore no-explicit-any\\n\\nconst foodX: any[] = [];\\n\\n// deno-lint-ignore no-explicit-any\\n\\nconst foodY: any[] = [];\\n\\nconst food = {\\n\\n x: 0,\\n\\n y: 0,\\n\\n};\\n\\nlet score = 0;\\n\\n\\n\\nfor (let i = 0; i <= canvas.width - cellSize; i += cellSize) {\\n\\n foodX.push(i);\\n\\n foodY.push(i);\\n\\n}\\n\\nconst drawSquare = (x: number, y: number, color: string) => {\\n\\n ctx.fillStyle = color;\\n\\n ctx.fillRect(x, y, cellSize, cellSize);\\n\\n};\\n\\n\\n\\nconst createFood = () => {\\n\\n food.x = foodX[Math.floor(Math.random() * foodX.length)];\\n\\n food.y = foodY[Math.floor(Math.random() * foodY.length)];\\n\\n for (const i in snake) {\\n\\n if (checkCollision(food.x, food.y, snake[i].x, snake[i].y)) {\\n\\n createFood();\\n\\n }\\n\\n }\\n\\n};\\n\\nconst drawFood = () => {\\n\\n drawSquare(food.x, food.y, foodColor);\\n\\n};\\n\\n\\n\\nconst setBackground = (color1: string, color2: string) => {\\n\\n ctx.fillStyle = color1;\\n\\n ctx.strokeStyle = color2;\\n\\n\\n\\n ctx.fillRect(0, 0, canvas.height, canvas.width);\\n\\n\\n\\n for (let x = 0.5; x < canvas.width; x += cellSize) {\\n\\n ctx.moveTo(x, 0);\\n\\n ctx.lineTo(x, canvas.height);\\n\\n }\\n\\n for (let y = 0.5; y < canvas.height; y += cellSize) {\\n\\n ctx.moveTo(0, y);\\n\\n ctx.lineTo(canvas.width, y);\\n\\n }\\n\\n\\n\\n ctx.stroke();\\n\\n};\\n\\nconst createSnake = () => {\\n\\n snake = [];\\n\\n for (let i = snakeLength; i > 0; i--) {\\n\\n snake.push({ x: i * cellSize, y: 0 });\\n\\n }\\n\\n};\\n\\nconst drawSnake = () => {\\n\\n for (let i = 0; i < snake.length; i++) {\\n\\n drawSquare(snake[i].x, snake[i].y, snakeColor);\\n\\n }\\n\\n};\\n\\nconst changeDirection = (keycode: string) => {\\n\\n if (keycode === \\\"left\\\" && direction != \\\"right\\\") directionQueue = \\\"left\\\";\\n\\n else if (keycode === \\\"up\\\" && direction != \\\"down\\\") directionQueue = \\\"up\\\";\\n\\n else if (keycode === \\\"right\\\" && direction != \\\"left\\\") directionQueue = \\\"right\\\";\\n\\n else if (keycode === \\\"down\\\" && direction != \\\"top\\\") directionQueue = \\\"down\\\";\\n\\n};\\n\\nconst moveSnake = () => {\\n\\n let x = snake[0].x;\\n\\n let y = snake[0].y;\\n\\n\\n\\n direction = directionQueue;\\n\\n\\n\\n if (direction == \\\"right\\\") {\\n\\n x += cellSize;\\n\\n } else if (direction == \\\"left\\\") {\\n\\n x -= cellSize;\\n\\n } else if (direction == \\\"up\\\") {\\n\\n y -= cellSize;\\n\\n } else if (direction == \\\"down\\\") {\\n\\n y += cellSize;\\n\\n }\\n\\n const tail = snake.pop();\\n\\n tail.x = x;\\n\\n tail.y = y;\\n\\n snake.unshift(tail);\\n\\n};\\n\\n\\n\\nconst checkCollision = (\\n\\n x1: number,\\n\\n y1: number,\\n\\n x2: number,\\n\\n y2: number,\\n\\n) => (x1 === x2 && y1 === y2);\\n\\nconst game = () => {\\n\\n const head = snake[0];\\n\\n if (\\n\\n head.x < 0 || head.x > canvas.width - cellSize || head.y < 0 ||\\n\\n head.y > canvas.height - cellSize\\n\\n ) {\\n\\n setBackground(\\\"#ff3636\\\", \\\"#ff3636\\\");\\n\\n createSnake();\\n\\n drawSnake();\\n\\n createFood();\\n\\n drawFood();\\n\\n directionQueue = \\\"right\\\";\\n\\n score = 0;\\n\\n }\\n\\n for (let i = 1; i < snake.length; i++) {\\n\\n if (head.x == snake[i].x && head.y == snake[i].y) {\\n\\n setBackground(\\\"#ff3636\\\", \\\"#ff3636\\\");\\n\\n createSnake();\\n\\n drawSnake();\\n\\n createFood();\\n\\n drawFood();\\n\\n directionQueue = \\\"right\\\";\\n\\n score = 0;\\n\\n }\\n\\n }\\n\\n if (checkCollision(head.x, head.y, food.x, food.y)) {\\n\\n snake[snake.length] = { x: head.x, y: head.y };\\n\\n createFood();\\n\\n drawFood();\\n\\n score += 10;\\n\\n }\\n\\n\\n\\n if (canvas.window.isKeyDown(\\\"left\\\")) {\\n\\n changeDirection(\\\"left\\\");\\n\\n } else if (canvas.window.isKeyDown(\\\"right\\\")) {\\n\\n changeDirection(\\\"right\\\");\\n\\n } else if (canvas.window.isKeyDown(\\\"up\\\")) {\\n\\n changeDirection(\\\"up\\\");\\n\\n } else if (canvas.window.isKeyDown(\\\"down\\\")) {\\n\\n changeDirection(\\\"down\\\");\\n\\n }\\n\\n\\n\\n ctx.beginPath();\\n\\n setBackground(\\\"#fff\\\", \\\"#eee\\\");\\n\\n drawSnake();\\n\\n drawFood();\\n\\n moveSnake();\\n\\n};\\n\\nfunction newGame() {\\n\\n direction = \\\"right\\\";\\n\\n directionQueue = \\\"right\\\";\\n\\n ctx.beginPath();\\n\\n createSnake();\\n\\n createFood();\\n\\n\\n\\n if (typeof loop != \\\"undefined\\\") {\\n\\n clearInterval(loop);\\n\\n } else {\\n\\n loop = setInterval(game, fps);\\n\\n }\\n\\n}\\n\\nnewGame();\\n\",\n \"file_path\": \"canvas/examples/snake.ts\",\n \"rank\": 51,\n \"score\": 24364.864698215602\n },\n {\n \"content\": \"import { Canvas } from \\\"../mod.ts\\\";\\n\\n\\n\\ntype Vector = {\\n\\n x: number,\\n\\n y: number\\n\\n}\\n\\n\\n\\nconst canvas = new Canvas({\\n\\n title: \\\"Perlin\\\",\\n\\n width: 800,\\n\\n height: 800,\\n\\n});\\n\\nconst ctx = canvas.getContext(\\\"2d\\\")\\n\\n\\n\\nconst BATCH = 5\\n\\nconst WRAP = 100\\n\\nconst SIZE = 1\\n\\nconst TOTAL = WRAP * BATCH\\n\\n\\n\\nfunction Shuffle(tab: number[]) {\\n\\n for (let e = tab.length - 1; e > 0; e--) {\\n\\n let index = Math.round(Math.random() * (e - 1)),\\n\\n temp = tab[e];\\n\\n\\n\\n tab[e] = tab[index];\\n\\n tab[index] = temp;\\n\\n }\\n\\n}\\n\\n\\n\\nfunction MakePermutation() {\\n\\n let P = [];\\n\\n for (let i = 0; i < 256; i++) {\\n\\n P.push(i);\\n\\n }\\n\\n Shuffle(P);\\n\\n for (let i = 0; i < 256; i++) {\\n\\n P.push(P[i]);\\n\\n }\\n\\n\\n\\n return P;\\n\\n}\\n\\nlet P = MakePermutation();\\n\\n\\n\\nfunction ConstantVector(v: number) {\\n\\n return [\\n\\n { x: 1, y: 1 },\\n\\n { x: -1, y: 1 },\\n\\n { x: -1, y: -1 },\\n\\n { x: 1, y: -1 }\\n\\n ][v & 3]\\n\\n}\\n\\n\\n\\nconst matrix: number[][] = []\\n\\nfor (let i = 0; i < TOTAL; i++) {\\n\\n const col = []\\n\\n for (let j = 0; j < TOTAL; j++) {\\n\\n col.push(0);\\n\\n }\\n\\n matrix.push(col)\\n\\n}\\n\\n\\n\\nfunction Calculate() {\\n\\n for (let i = 0; i < BATCH; i++) {\\n\\n for (let j = 0; j < BATCH; j++) {\\n\\n PerlinBatch(i, j)\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\nfunction Draw() {\\n\\n ctx.fillStyle = `rgb(0, 0, 0)`\\n\\n ctx.fillRect(0, 0, 800, 800)\\n\\n for (let i = 0; i < TOTAL; i++) {\\n\\n for (let j = 0; j < TOTAL; j++) {\\n\\n ctx.fillStyle = `rgba(255, 255, 255, ${matrix[i][j] + 0.5})`\\n\\n ctx.fillRect(i * SIZE, j * SIZE, SIZE, SIZE)\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\nfunction PerlinBatch(batchX: number, batchY: number,) {\\n\\n const trv = ConstantVector(P[P[batchX + 1] + batchY + 1]);\\n\\n const tlv = ConstantVector(P[P[batchX] + batchY + 1]);\\n\\n const brv = ConstantVector(P[P[batchX + 1] + batchY]);\\n\\n const blv = ConstantVector(P[P[batchX] + batchY]);\\n\\n\\n\\n for (let x = 0; x < WRAP; x++) {\\n\\n for (let y = 0; y < WRAP; y++) {\\n\\n const currentX = x + batchX * WRAP;\\n\\n const currentY = y + batchY * WRAP;\\n\\n matrix[currentX][currentY] = Perlin(x / WRAP, y / WRAP, trv, tlv, brv, blv)\\n\\n }\\n\\n }\\n\\n};\\n\\n\\n\\nfunction Perlin(x: number, y: number, trv: Vector, tlv: Vector, brv: Vector, blv: Vector) {\\n\\n const tr = { x: x - 1, y: y - 1 }\\n\\n const tl = { x: x, y: y - 1 }\\n\\n const br = { x: x - 1, y: y }\\n\\n const bl = { x: x, y: y }\\n\\n\\n\\n const trd = Dot(trv, tr)\\n\\n const tld = Dot(tlv, tl)\\n\\n const brd = Dot(brv, br)\\n\\n const bld = Dot(blv, bl)\\n\\n\\n\\n const u = Fade(x);\\n\\n const v = Fade(y);\\n\\n\\n\\n const left = Lerp(bld, tld, v)\\n\\n const right = Lerp(brd, trd, v)\\n\\n return Lerp(left, right, u)\\n\\n};\\n\\n\\n\\nfunction Dot(a: Vector, b: Vector) {\\n\\n return a.x * b.x + a.y * b.y\\n\\n}\\n\\n\\n\\nfunction Lerp(a: number, b: number, x: number) {\\n\\n return a + (b - a) * x\\n\\n}\\n\\n\\n\\nfunction Fade(t: number) {\\n\\n return ((6 * t - 15) * t + 10) * t * t * t;\\n\\n}\\n\\n\\n\\nCalculate()\\n\",\n \"file_path\": \"canvas/examples/perlin.ts\",\n \"rank\": 52,\n \"score\": 24364.864698215602\n },\n {\n \"content\": \"import { Canvas } from \\\"../mod.ts\\\";\\n\\n\\n\\nconst canvas = new Canvas({\\n\\n title: \\\"Cube\\\",\\n\\n width: 800,\\n\\n height: 800,\\n\\n \\n\\n});\\n\\nconst ctx = canvas.getContext(\\\"2d\\\")\\n\\nctx.fillStyle = \\\"#fff\\\";\\n\\nctx.strokeStyle = \\\"#fff\\\";\\n\\n\\n\\nlet theta = 0\\n\\nlet thetaZ = theta * Math.PI / 180\\n\\nlet thetaY = theta * Math.PI / 180\\n\\nlet thetaX = theta * Math.PI / 180\\n\\nconst d = 300\\n\\nconst step = 200\\n\\nconst steps = 1\\n\\nconst matrix: [number, number, number][][][] = []\\n\\n\\n\\nfor (let i = -step * steps / 2; i < step * steps; i += step) {\\n\\n const column: [number, number, number][][] = []\\n\\n for (let j = -step * steps / 2; j < step * steps; j += step) {\\n\\n const row: [number, number, number][] = []\\n\\n for (let k = -step * steps / 2; k < step * steps; k += step) {\\n\\n row.push([i, j, k])\\n\\n }\\n\\n column.push(row)\\n\\n }\\n\\n matrix.push(column)\\n\\n}\\n\\n\\n\\nfunction Render() {\\n\\n const matrix2 = []\\n\\n for (const column of matrix) {\\n\\n const column2 = []\\n\\n for (const row of column) {\\n\\n const row2 = []\\n\\n for (const point of row) {\\n\\n let x = point[0]\\n\\n let y = point[1]\\n\\n let z = point[2]\\n\\n x = x * Math.cos(thetaX) - z * Math.sin(thetaX)\\n\\n z = point[0] * Math.sin(thetaX) + z * Math.cos(thetaX)\\n\\n y = y * Math.cos(thetaY) - z * Math.sin(thetaY)\\n\\n z = point[1] * Math.sin(thetaY) + z * Math.cos(thetaY)\\n\\n const x2 = x\\n\\n x = x * Math.cos(thetaZ) - y * Math.sin(thetaZ)\\n\\n y = x2 * Math.sin(thetaZ) + y * Math.cos(thetaZ)\\n\\n\\n\\n ctx.beginPath();\\n\\n ctx.arc(x + d, y + d, 5, 0, 2 * Math.PI);\\n\\n ctx.fill();\\n\\n row2.push([x + d, y + d])\\n\\n }\\n\\n column2.push(row2)\\n\\n }\\n\\n matrix2.push(column2)\\n\\n }\\n\\n\\n\\n for (let i = 0; i < matrix2.length; i++) {\\n\\n for (let j = 0; j < matrix2[i].length; j++) {\\n\\n for (let k = 0; k < matrix2[i][j].length; k++) {\\n\\n const point = matrix2[i][j][k]\\n\\n const point2 = matrix2[i][j][k + 1]\\n\\n if (point2) {\\n\\n ctx.beginPath();\\n\\n ctx.moveTo(point[0], point[1]);\\n\\n ctx.lineTo(point2[0], point2[1]);\\n\\n ctx.stroke();\\n\\n }\\n\\n }\\n\\n const point = matrix2[i][j]\\n\\n const point2 = matrix2[i][j + 1]\\n\\n if (point2) {\\n\\n for (let k = 0; k < matrix2[i][j].length; k++) {\\n\\n ctx.beginPath();\\n\\n ctx.moveTo(point[k][0], point[k][1]);\\n\\n ctx.lineTo(point2[k][0], point2[k][1]);\\n\\n ctx.stroke();\\n\\n }\\n\\n }\\n\\n }\\n\\n const point = matrix2[i]\\n\\n const point2 = matrix2[i + 1]\\n\\n if (point2) {\\n\\n for (let j = 0; j < matrix2[i].length; j++) {\\n\\n for (let k = 0; k < matrix2[i][j].length; k++) {\\n\\n ctx.beginPath();\\n\\n ctx.moveTo(point[j][k][0], point[j][k][1]);\\n\\n ctx.lineTo(point2[j][k][0], point2[j][k][1]);\\n\\n ctx.stroke();\\n\\n }\\n\\n }\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\nctx.clearRect(0, 0, canvas.width, canvas.height)\\n\\n\\n\\nsetInterval(() => {\\n\\n ctx.clearRect(0, 0, canvas.width, canvas.height)\\n\\n theta += 3\\n\\n if (theta > 360) {\\n\\n theta = 0\\n\\n }\\n\\n thetaY = theta * Math.PI / 180\\n\\n thetaZ = theta * Math.PI / 180\\n\\n thetaX = theta * Math.PI / 180\\n\\n Render()\\n\",\n \"file_path\": \"canvas/examples/cube.ts\",\n \"rank\": 53,\n \"score\": 24364.864698215602\n },\n {\n \"content\": \"import { Canvas } from \\\"../mod.ts\\\";\\n\\n\\n\\ntype Vector = {\\n\\n x: number,\\n\\n y: number\\n\\n}\\n\\n\\n\\nconst canvas = new Canvas({\\n\\n title: \\\"Terrain\\\",\\n\\n width: 800,\\n\\n height: 800,\\n\\n});\\n\\nconst ctx = canvas.getContext(\\\"2d\\\")\\n\\nctx.fillStyle = \\\"#fff\\\";\\n\\nctx.strokeStyle = \\\"#fff\\\";\\n\\n\\n\\nconst BATCH = 5\\n\\nconst WRAP = 4\\n\\nconst TOTAL = WRAP * BATCH\\n\\nconst theta = 40\\n\\nconst thetaZ = theta * Math.PI / 180\\n\\nconst thetaY = theta * Math.PI / 180\\n\\nconst thetaX = theta * Math.PI / 180\\n\\nconst sx = 200\\n\\nconst sy = 40\\n\\nconst step = 20\\n\\nconst steps = 20\\n\\nconst radius = 2\\n\\n\\n\\nconst matrix: [number, number, number][][][] = []\\n\\nconst matrix2: number[][] = []\\n\\nfor (let i = 0; i < TOTAL; i++) {\\n\\n const col: number[] = []\\n\\n for (let j = 0; j < TOTAL; j++) {\\n\\n col.push(0);\\n\\n }\\n\\n matrix2.push(col)\\n\\n}\\n\\n\\n\\n\\n\\nfunction Shuffle(tab: number[]) {\\n\\n for (let e = tab.length - 1; e > 0; e--) {\\n\\n const index = Math.round(Math.random() * (e - 1)),\\n\\n temp = tab[e];\\n\\n\\n\\n tab[e] = tab[index];\\n\\n tab[index] = temp;\\n\\n }\\n\\n}\\n\\n\\n\\nfunction MakePermutation() {\\n\\n const P = [];\\n\\n for (let i = 0; i < 256; i++) {\\n\\n P.push(i);\\n\\n }\\n\\n Shuffle(P);\\n\\n for (let i = 0; i < 256; i++) {\\n\\n P.push(P[i]);\\n\\n }\\n\\n\\n\\n return P;\\n\\n}\\n\\nconst P = MakePermutation();\\n\\n\\n\\nfunction ConstantVector(v: number) {\\n\\n return [\\n\\n { x: 1, y: 1 },\\n\\n { x: -1, y: 1 },\\n\\n { x: -1, y: -1 },\\n\\n { x: 1, y: -1 }\\n\\n ][v & 3]\\n\\n}\\n\\n\\n\\nfunction Calculate() {\\n\\n for (let i = 0; i < TOTAL; i++) {\\n\\n for (let j = 0; j < TOTAL; j++) {\\n\\n matrix2[i][j] = PerlinBatch(i, j)\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\nfunction PerlinBatch(posX: number, posY: number) {\\n\\n const batchX = Math.floor(posX / WRAP)\\n\\n const batchY = Math.floor(posY / WRAP)\\n\\n const trv = ConstantVector(P[P[batchX + 1] + batchY + 1]);\\n\\n const tlv = ConstantVector(P[P[batchX] + batchY + 1]);\\n\\n const brv = ConstantVector(P[P[batchX + 1] + batchY]);\\n\\n const blv = ConstantVector(P[P[batchX] + batchY]);\\n\\n\\n\\n const currentX = posX / WRAP - batchX;\\n\\n const currentY = posY / WRAP - batchY;\\n\\n return Perlin(currentX, currentY, trv, tlv, brv, blv)\\n\\n};\\n\\n\\n\\nfunction Perlin(x: number, y: number, trv: Vector, tlv: Vector, brv: Vector, blv: Vector) {\\n\\n const tr = { x: x - 1, y: y - 1 }\\n\\n const tl = { x: x, y: y - 1 }\\n\\n const br = { x: x - 1, y: y }\\n\\n const bl = { x: x, y: y }\\n\\n\\n\\n const trd = Dot(trv, tr)\\n\\n const tld = Dot(tlv, tl)\\n\\n const brd = Dot(brv, br)\\n\\n const bld = Dot(blv, bl)\\n\\n\\n\\n const u = Fade(x);\\n\\n const v = Fade(y);\\n\\n\\n\\n const left = Lerp(bld, tld, v)\\n\\n const right = Lerp(brd, trd, v)\\n\\n return Lerp(left, right, u)\\n\\n};\\n\\n\\n\\nfunction Dot(a: Vector, b: Vector) {\\n\\n return a.x * b.x + a.y * b.y\\n\\n}\\n\\n\\n\\nfunction Lerp(a: number, b: number, x: number) {\\n\\n return a + (b - a) * x\\n\\n}\\n\\n\\n\\nfunction Fade(t: number) {\\n\\n return ((6 * t - 15) * t + 10) * t * t * t;\\n\\n}\\n\\n\\n\\nfor (let i = 0; i < steps; i += 1) {\\n\\n const column: [number, number, number][][] = []\\n\\n for (let j = 0; j < steps; j += 1) {\\n\\n const row: [number, number, number][] = []\\n\\n const x = i * step;\\n\\n const y = j * step;\\n\\n row.push([x, y, -PerlinBatch(i, j) * 40])\\n\\n column.push(row)\\n\\n }\\n\\n matrix.push(column)\\n\\n}\\n\\n\\n\\nfunction Render() {\\n\\n const matrix2 = []\\n\\n for (const column of matrix) {\\n\\n const column2 = []\\n\\n for (const row of column) {\\n\\n const row2 = []\\n\\n for (const point of row) {\\n\\n let x = point[0]\\n\\n let y = point[1]\\n\\n let z = point[2]\\n\\n x = x * Math.cos(thetaX) - z * Math.sin(thetaX)\\n\\n z = point[0] * Math.sin(thetaX) + z * Math.cos(thetaX)\\n\\n y = y * Math.cos(thetaY) - z * Math.sin(thetaY)\\n\\n z = point[1] * Math.sin(thetaY) + z * Math.cos(thetaY)\\n\\n const x2 = x\\n\\n x = x * Math.cos(thetaZ) - y * Math.sin(thetaZ)\\n\\n y = x2 * Math.sin(thetaZ) + y * Math.cos(thetaZ)\\n\\n\\n\\n ctx.beginPath();\\n\\n ctx.arc(x + sx, y + sy, radius, 0, 2 * Math.PI);\\n\\n ctx.fill();\\n\\n row2.push([x + sx, y + sy])\\n\\n }\\n\\n column2.push(row2)\\n\\n }\\n\\n matrix2.push(column2)\\n\\n }\\n\\n\\n\\n for (let i = 0; i < matrix2.length; i++) {\\n\\n for (let j = 0; j < matrix2[i].length; j++) {\\n\\n for (let k = 0; k < matrix2[i][j].length; k++) {\\n\\n const point = matrix2[i][j][k]\\n\\n const point2 = matrix2[i][j][k + 1]\\n\\n if (point2) {\\n\\n ctx.beginPath();\\n\\n ctx.moveTo(point[0], point[1]);\\n\\n ctx.lineTo(point2[0], point2[1]);\\n\\n ctx.stroke();\\n\\n }\\n\\n }\\n\\n const point = matrix2[i][j]\\n\\n const point2 = matrix2[i][j + 1]\\n\\n if (point2) {\\n\\n for (let k = 0; k < matrix2[i][j].length; k++) {\\n\\n ctx.beginPath();\\n\\n ctx.moveTo(point[k][0], point[k][1]);\\n\\n ctx.lineTo(point2[k][0], point2[k][1]);\\n\\n ctx.stroke();\\n\\n }\\n\\n }\\n\\n }\\n\\n const point = matrix2[i]\\n\\n const point2 = matrix2[i + 1]\\n\\n if (point2) {\\n\\n for (let j = 0; j < matrix2[i].length; j++) {\\n\\n for (let k = 0; k < matrix2[i][j].length; k++) {\\n\\n ctx.beginPath();\\n\\n ctx.moveTo(point[j][k][0], point[j][k][1]);\\n\\n ctx.lineTo(point2[j][k][0], point2[j][k][1]);\\n\\n ctx.stroke();\\n\\n }\\n\\n }\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\nCalculate()\\n\",\n \"file_path\": \"canvas/examples/terrain.ts\",\n \"rank\": 54,\n \"score\": 24364.864698215602\n },\n {\n \"content\": \"export class Neko {\\n\\n #id;\\n\\n width: number;\\n\\n height: number;\\n\\n constructor(options: NekoOptions) {\\n\\n this.width = options.width;\\n\\n this.height = options.height;\\n\\n this.#id = lib.symbols.window_new(\\n\\n new Uint8Array([...encode(options.title), 0]),\\n\\n options.width,\\n\\n options.height,\\n\\n );\\n\\n }\\n\\n limitUpdateRate(micros: number) {\\n\\n unwrap(lib.symbols.window_limit_update_rate(this.#id, micros));\\n\\n }\\n\\n setFrameBuffer(buffer: Uint8Array, width?: number, height?: number) {\\n\\n unwrap(\\n\\n lib.symbols.window_update_with_buffer(\\n\\n this.#id,\\n\\n buffer,\\n\\n width ?? this.width,\\n\\n height ?? this.height,\\n\\n )\\n\\n );\\n\\n }\\n\\n\\n\\n update() {\\n\\n unwrap(lib.symbols.window_update(this.#id));\\n\\n }\\n\\n\\n\\n close() {\\n\\n unwrap(lib.symbols.window_close(this.#id));\\n\\n }\\n\\n\\n\\n isKeyDown(key: string): boolean {\\n\\n return unwrapBoolean(lib.symbols.window_is_key_down(this.#id, new Uint8Array([...encode(key), 0])));\\n\\n }\\n\\n\\n\\n isMouseButtonDown(key: string): boolean {\\n\\n return unwrapBoolean(lib.symbols.window_is_mouse_button_down(this.#id, new Uint8Array([...encode(key), 0])));\\n\\n }\\n\\n\\n\\n getScroll(): number {\\n\\n return lib.symbols.window_get_mouse_scroll(this.#id);\\n\\n }\\n\\n\\n\\n\\n\\n getMousePosition(): [number, number] {\\n\\n return [lib.symbols.window_get_mouse_x(this.#id), lib.symbols.window_get_mouse_y(this.#id)];\\n\\n }\\n\\n\\n\\n get open(): boolean {\\n\\n return unwrapBoolean(lib.symbols.window_is_open(this.#id));\\n\\n }\\n\\n\\n\\n get active(): boolean {\\n\\n return unwrapBoolean(lib.symbols.window_is_active(this.#id));\\n\\n }\\n\",\n \"file_path\": \"lib/Neko.ts\",\n \"rank\": 72,\n \"score\": 5.2839719015223805\n },\n {\n \"content\": \"export class Canvas {\\n\\n #title: string;\\n\\n #ctx: CanvasRenderingContext2D;\\n\\n #canvas: EmulatedCanvas2D;\\n\\n window: Neko;\\n\\n #world: World;\\n\\n #width: number;\\n\\n #height: number;\\n\\n #fps: number;\\n\\n constructor(config: Config) {\\n\\n this.#world = new World();\\n\\n this.#height = config.height || 200;\\n\\n this.#width = config.width || 200;\\n\\n this.#title = config.title || \\\"Neko\\\";\\n\\n this.#fps = config.fps || 60;\\n\\n this.#canvas = createCanvas(this.#width, this.#height);\\n\\n this.#ctx = this.#canvas.getContext(\\\"2d\\\");\\n\\n this.window = new Neko({\\n\\n title: this.#title,\\n\\n width: this.#width,\\n\\n height: this.#height,\\n\\n });\\n\\n this.#world.start(this.window, {\\n\\n fps: this.#fps,\\n\\n update: () => {\\n\\n this.window.setFrameBuffer(\\n\\n this.#canvas.getRawBuffer(0, 0, this.#width, this.#height),\\n\\n );\\n\\n },\\n\\n });\\n\\n }\\n\\n getContext(_type = \\\"2d\\\"): CanvasRenderingContext2D {\\n\\n return this.#ctx;\\n\\n }\\n\\n get canvas(): EmulatedCanvas2D {\\n\\n return this.#canvas;\\n\\n }\\n\\n get width(): number {\\n\\n return this.#width;\\n\\n }\\n\\n get height(): number {\\n\\n return this.#height;\\n\\n }\\n\",\n \"file_path\": \"canvas/Ctx.ts\",\n \"rank\": 73,\n \"score\": 2.8236485947224073\n },\n {\n \"content\": \"let score = 0;\\n\",\n \"file_path\": \"canvas/examples/tetris.ts\",\n \"rank\": 74,\n \"score\": 2.3680541116852547\n }\n]","isConversational":false}}},{"rowIdx":2347,"cells":{"lang":{"kind":"string","value":"Rust"},"file_path":{"kind":"string","value":"applications/swap/src/lib.rs"},"repo_name":{"kind":"string","value":"jacob-earle/Theseus"},"commit":{"kind":"string","value":"d53038328d1a39c69ffff6e32226394e8c957e33"},"file_code":{"kind":"string","value":"\n\n#![no_std]\n#![feature(slice_concat_ext)]\n\n#[macro_use] extern crate alloc;\n#[macro_use] extern crate terminal_print;\nextern crate itertools;\n\nextern crate getopts;\nextern crate memory;\nextern crate mod_mgmt;\nextern crate crate_swap;\nextern crate hpet;\nextern crate task;\nextern crate path;\nextern crate fs_node;\n\nuse alloc::{\n string::{String, ToString},\n vec::Vec,\n sync::Arc,\n};\nuse getopts::{Options, Matches};\nuse mod_mgmt::{NamespaceDir, IntoCrateObjectFile};\nuse crate_swap::SwapRequest;\nuse hpet::get_hpet;\nuse path::Path;\nuse fs_node::{FileOrDir, DirRef};\n\npub fn main(args: Vec<String>) -> isize {\n #[cfg(not(loadable))] {\n println!(\"****************\\nWARNING: Theseus was not built in 'loadable' mode, so crate swapping may not work.\\n****************\");\n }\n\n let mut opts = Options::new();\n opts.optflag(\"h\", \"help\", \"print this help menu\");\n opts.optflag(\"v\", \"verbose\", \"enable verbose logging of crate swapping actions\");\n opts.optflag(\"c\", \"cache\", \"enable caching of the old crate(s) removed by the swapping action\");\n opts.optopt(\"d\", \"directory-crates\", \"the absolute path of the base directory where new crates will be loaded from\", \"PATH\");\n opts.optmulti(\"t\", \"state-transfer\", \"the fully-qualified symbol names of state transfer functions, to be run in the order given\", \"SYMBOL\");\n\n let matches = match opts.parse(&args) {\n Ok(m) => m,\n Err(_f) => {\n println!(\"{}\", _f);\n print_usage(opts);\n return -1; \n }\n };\n\n if matches.opt_present(\"h\") {\n print_usage(opts);\n return 0;\n }\n\n match rmain(matches) {\n Ok(_) => 0,\n Err(e) => {\n println!(\"Error: {}\", e); \n -1\n }\n }\n}\n\nfn rmain(matches: Matches) -> Result<(), String> {\n\n let taskref = task::get_my_current_task()\n .ok_or_else(|| format!(\"failed to get current task\"))?;\n\n let curr_dir = Arc::clone(&taskref.get_env().lock().working_dir);\n\n let override_namespace_crate_dir = if let Some(path) = matches.opt_str(\"d\") {\n let path = Path::new(path);\n let dir = match path.get(&curr_dir) {\n Some(FileOrDir::Dir(dir)) => dir,\n _ => return Err(format!(\"Error: could not find specified namespace crate directory: {}.\", path)),\n };\n Some(NamespaceDir::new(dir))\n } else {\n None\n };\n\n let verbose = matches.opt_present(\"v\");\n let cache_old_crates = matches.opt_present(\"c\");\n let state_transfer_functions = matches.opt_strs(\"t\");\n\n let free_args = matches.free.join(\" \");\n println!(\"arguments: {}\", free_args);\n\n let tuples = parse_input_tuples(&free_args)?;\n println!(\"tuples: {:?}\", tuples);\n\n do_swap(\n tuples, \n &curr_dir, \n override_namespace_crate_dir,\n state_transfer_functions,\n verbose,\n cache_old_crates\n )\n}\n\nfn parse_input_tuples<'a>(args: &'a str) -> Result<Vec<(&'a str, &'a str, bool)>, String> {\n let mut v: Vec<(&str, &str, bool)> = Vec::new();\n let mut open_paren_iter = args.match_indices('(');\n\n \n while let Some((paren_start, _)) = open_paren_iter.next() {\n let the_rest = args.get((paren_start + 1) ..).ok_or_else(|| \"unmatched open parenthesis.\".to_string())?;\n \n let parsed = the_rest.find(')')\n .and_then(|end_index| the_rest.get(.. end_index))\n .and_then(|inside_paren| {\n let mut token_iter = inside_paren.split(',').map(str::trim);\n token_iter.next().and_then(|first| {\n token_iter.next().map(|second| {\n (first, second, token_iter.next())\n })\n })\n });\n match parsed {\n Some((o, n, reexport)) => {\n println!(\"found triple: {:?}, {:?}, {:?}\", o, n, reexport);\n let reexport_bool = match reexport {\n Some(\"true\") => true, \n Some(\"yes\") => true, \n Some(\"y\") => true, \n _ => false,\n };\n v.push((o, n, reexport_bool));\n }\n _ => return Err(\"list of crate tuples is formatted incorrectly.\".to_string()),\n }\n }\n\n if v.is_empty() {\n Err(\"no crate tuples specified.\".to_string())\n }\n else {\n Ok(v)\n }\n}\n\nfn do_swap(\n tuples: Vec<(&str, &str, bool)>, \n curr_dir: &DirRef, \n override_namespace_crate_dir: Option<NamespaceDir>, \n state_transfer_functions: Vec<String>,\n verbose_log: bool,\n cache_old_crates: bool\n) -> Result<(), String> {\n let kernel_mmi_ref = memory::get_kernel_mmi_ref().ok_or_else(|| \"couldn't get kernel_mmi_ref\".to_string())?;\n let namespace = task::get_my_current_task().ok_or(\"Couldn't get current task\")?.get_namespace();\n\n let swap_requests = {\n let mut requests: Vec<SwapRequest> = Vec::with_capacity(tuples.len());\n for (old_crate_name, new_crate_str, reexport) in tuples {\n\n \n \n \n let (into_new_crate_file, new_namespace) = {\n if let Some(f) = override_namespace_crate_dir.as_ref().and_then(|ns_dir| ns_dir.get_file_starting_with(new_crate_str)) {\n (IntoCrateObjectFile::File(f), None)\n } else if let Some(FileOrDir::File(f)) = Path::new(String::from(new_crate_str)).get(curr_dir) {\n (IntoCrateObjectFile::File(f), None)\n } else {\n (IntoCrateObjectFile::Prefix(String::from(new_crate_str)), None)\n }\n };\n \n let swap_req = SwapRequest::new(\n Some(old_crate_name),\n Arc::clone(&namespace),\n into_new_crate_file,\n new_namespace,\n reexport\n ).map_err(|invalid_req| format!(\"{:#?}\", invalid_req))?;\n requests.push(swap_req);\n }\n requests\n };\n \n let start = get_hpet().as_ref().ok_or(\"couldn't get HPET timer\")?.get_counter();\n\n let swap_result = crate_swap::swap_crates(\n &namespace,\n swap_requests, \n override_namespace_crate_dir,\n state_transfer_functions,\n &kernel_mmi_ref,\n verbose_log,\n cache_old_crates,\n );\n \n let end = get_hpet().as_ref().ok_or(\"couldn't get HPET timer\")?.get_counter();\n let hpet_period = get_hpet().as_ref().ok_or(\"couldn't get HPET timer\")?.counter_period_femtoseconds();\n\n let elapsed_ticks = end - start;\n \n \n match swap_result {\n Ok(()) => {\n println!(\"Swap operation complete. Elapsed HPET ticks: {}, (HPET Period: {} femtoseconds)\", \n elapsed_ticks, hpet_period);\n Ok(())\n }\n Err(e) => Err(e.to_string())\n }\n}\n\nfn print_usage(opts: Options) {\n println!(\"{}\", opts.usage(USAGE));\n}\n\nconst USAGE: &'static str = \"Usage: swap (OLD1, NEW1 [, true | false]) [(OLD2, NEW2 [, true | false])]...\nSwaps the given list of crate tuples, with NEW# replacing OLD# in each tuple.\nThe OLD and NEW values are crate names, such as \\\"my_crate-<hash>\\\".\nBoth the old crate name and the new crate name can be prefixes, e.g., \\\"my_cra\\\" will find \\\"my_crate-<hash>\\\", \nbut *only* if there is a single matching crate or object file.\nA third element of each tuple is the optional 'reexport_new_symbols_as_old' boolean, which if true, \nwill reexport new symbols under their old names, if those symbols match (excluding hashes).\";\n"},"prefix":{"kind":"string","value":"\n\n#![no_std]\n#![feature(slice_concat_ext)]\n\n#[macro_use] extern crate alloc;\n#[macro_use] extern crate terminal_print;\nextern crate itertools;\n\nextern crate getopts;\nextern crate memory;\nextern crate mod_mgmt;\nextern crate crate_swap;\nextern crate hpet;\nextern crate task;\nextern crate path;\nextern crate fs_node;\n\nuse alloc::{\n string::{String, ToString},\n vec::Vec,\n sync::Arc,\n};\nuse getopts::{Options, Matches};\nuse mod_mgmt::{NamespaceDir, IntoCrateObjectFile};\nuse crate_swap::SwapRequest;\nuse hpet::get_hpet;\nuse path::Path;\nuse fs_node::{FileOrDir, DirRef};\n\npub fn main(args: Vec<String>) -> isize {\n #[cfg(not(loadable))] {\n println!(\"****************\\nWARNING: Theseus was not built in 'loadable' mode, so crate swapping may not work.\\n****************\");\n }\n\n let mut opts = Options::new();\n opts.optflag(\"h\", \"help\", \"print this help menu\");\n opts.optflag(\"v\", \"verbose\", \"enable verbose logging of crate swapping actions\");\n opts.optflag(\"c\", \"cache\", \"enable caching of the old crate(s) removed by the swapping action\");\n opts.optopt(\"d\", \"directory-crates\", \"the absolute path of the base directory where new crates will be loaded from\", \"PATH\");\n opts.optmulti(\"t\", \"state-transfer\", \"the fully-qualified symbol names of state transfer functions, to be run in the order given\", \"SYMBOL\");\n\n let matches = match opts.parse(&args) {\n Ok(m) => m,\n Err(_f) => {\n println!(\"{}\", _f);\n print_usage(opts);\n return -1; \n }\n };\n\n if matches.opt_present(\"h\") {\n print_usage(opts);\n return 0;\n }\n\n match rmain(matches) {\n Ok(_) => 0,\n Err(e) => {\n println!(\"Error: {}\", e); \n -1\n }\n }\n}\n\nfn rmain(matches: Matches) -> Result<(), String> {\n\n let taskref = task::get_my_current_task()\n .ok_or_else(|| format!(\"failed to get current task\"))?;\n\n let curr_dir = Arc::clone(&taskref.get_env().lock().working_dir);\n\n let override_namespace_crate_dir = if let Some(path) = matches.opt_str(\"d\") {\n let path = Path::new(path);\n let dir = match path.get(&curr_dir) {\n Some(FileOrDir::Dir(dir)) => dir,\n _ => return Err(format!(\"Error: could not find specified namespace crate directory: {}.\", path)),\n };\n Some(NamespaceDir::new(dir))\n } else {\n None\n };\n\n let verbose = matches.opt_present(\"v\");\n let cache_old_crates = matches.opt_present(\"c\");\n let state_transfer_functions = matches.opt_strs(\"t\");\n\n let free_args = matches.free.join(\" \");\n println!(\"arguments: {}\", free_args);\n\n let tuples = parse_input_tuples(&free_args)?;\n println!(\"tuples: {:?}\", tuples);\n\n do_swap(\n tuples, \n &curr_dir, \n override_namespace_crate_dir,\n state_transfer_functions,\n verbose,\n cache_old_crates\n )\n}\n\nfn parse_input_tuples<'a>(args: &'a str) -> Result<Vec<(&'a str, &'a str, bool)>, String> {\n let mut v: Vec<(&str, &str, bool)> = Vec::new();\n let mut open_paren_iter = args.match_indices('(');\n\n \n while let Some((paren_start, _)) = open_paren_iter.next() {\n let the_rest = args.get((paren_start + 1) ..).ok_or_else(|| \"unmatched open parenthesis.\".to_string())?;\n \n let parsed = the_rest.find(')')\n .and_then(|end_index| the_rest.get(.. end_index))\n .and_then(|inside_paren| {\n let mut token_iter = inside_paren.split(',').map(str::trim);\n token_iter.next().and_then(|first| {\n token_iter.next().map(|second| {\n (first, second, token_iter.next())\n })\n })\n });\n match parsed {\n Some((o, n, reexport)) => {\n println!(\"found triple: {:?}, {:?}, {:?}\", o, n, reexport);\n let reexport_bool = match reexport {\n Some(\"true\") => true, \n Some(\"yes\") => true, \n Some(\"y\") => true, \n _ => false,\n };\n "},"suffix":{"kind":"string","value":"ace = task::get_my_current_task().ok_or(\"Couldn't get current task\")?.get_namespace();\n\n let swap_requests = {\n let mut requests: Vec<SwapRequest> = Vec::with_capacity(tuples.len());\n for (old_crate_name, new_crate_str, reexport) in tuples {\n\n \n \n \n let (into_new_crate_file, new_namespace) = {\n if let Some(f) = override_namespace_crate_dir.as_ref().and_then(|ns_dir| ns_dir.get_file_starting_with(new_crate_str)) {\n (IntoCrateObjectFile::File(f), None)\n } else if let Some(FileOrDir::File(f)) = Path::new(String::from(new_crate_str)).get(curr_dir) {\n (IntoCrateObjectFile::File(f), None)\n } else {\n (IntoCrateObjectFile::Prefix(String::from(new_crate_str)), None)\n }\n };\n \n let swap_req = SwapRequest::new(\n Some(old_crate_name),\n Arc::clone(&namespace),\n into_new_crate_file,\n new_namespace,\n reexport\n ).map_err(|invalid_req| format!(\"{:#?}\", invalid_req))?;\n requests.push(swap_req);\n }\n requests\n };\n \n let start = get_hpet().as_ref().ok_or(\"couldn't get HPET timer\")?.get_counter();\n\n let swap_result = crate_swap::swap_crates(\n &namespace,\n swap_requests, \n override_namespace_crate_dir,\n state_transfer_functions,\n &kernel_mmi_ref,\n verbose_log,\n cache_old_crates,\n );\n \n let end = get_hpet().as_ref().ok_or(\"couldn't get HPET timer\")?.get_counter();\n let hpet_period = get_hpet().as_ref().ok_or(\"couldn't get HPET timer\")?.counter_period_femtoseconds();\n\n let elapsed_ticks = end - start;\n \n \n match swap_result {\n Ok(()) => {\n println!(\"Swap operation complete. Elapsed HPET ticks: {}, (HPET Period: {} femtoseconds)\", \n elapsed_ticks, hpet_period);\n Ok(())\n }\n Err(e) => Err(e.to_string())\n }\n}\n\nfn print_usage(opts: Options) {\n println!(\"{}\", opts.usage(USAGE));\n}\n\nconst USAGE: &'static str = \"Usage: swap (OLD1, NEW1 [, true | false]) [(OLD2, NEW2 [, true | false])]...\nSwaps the given list of crate tuples, with NEW# replacing OLD# in each tuple.\nThe OLD and NEW values are crate names, such as \\\"my_crate-<hash>\\\".\nBoth the old crate name and the new crate name can be prefixes, e.g., \\\"my_cra\\\" will find \\\"my_crate-<hash>\\\", \nbut *only* if there is a single matching crate or object file.\nA third element of each tuple is the optional 'reexport_new_symbols_as_old' boolean, which if true, \nwill reexport new symbols under their old names, if those symbols match (excluding hashes).\";\n"},"middle":{"kind":"string","value":" v.push((o, n, reexport_bool));\n }\n _ => return Err(\"list of crate tuples is formatted incorrectly.\".to_string()),\n }\n }\n\n if v.is_empty() {\n Err(\"no crate tuples specified.\".to_string())\n }\n else {\n Ok(v)\n }\n}\n\nfn do_swap(\n tuples: Vec<(&str, &str, bool)>, \n curr_dir: &DirRef, \n override_namespace_crate_dir: Option<NamespaceDir>, \n state_transfer_functions: Vec<String>,\n verbose_log: bool,\n cache_old_crates: bool\n) -> Result<(), String> {\n let kernel_mmi_ref = memory::get_kernel_mmi_ref().ok_or_else(|| \"couldn't get kernel_mmi_ref\".to_string())?;\n let namesp"},"strategy":{"kind":"string","value":"random"},"context_items":{"kind":"list like","value":[{"content":"/// Spawns a new userspace task based on the provided `path`, which must point to an ELF executable file with a defined entry point.\n\n/// Optionally, provide a `name` for the new Task. If none is provided, the name is based on the given `Path`.\n\npub fn spawn_userspace(path: Path, name: Option<String>) -> Result<TaskRef, &'static str> {\n\n return Err(\"this function has not yet been adapted to use the fs-based crate namespace system\");\n\n\n\n debug!(\"spawn_userspace [0]: Interrupts enabled: {}\", irq_safety::interrupts_enabled());\n\n \n\n let mut new_task = Task::new();\n\n new_task.name = String::from(name.unwrap_or(String::from(path.as_ref())));\n\n\n\n let mut ustack: Option<Stack> = None;\n\n\n\n // create a new MemoryManagementInfo instance to represent the new process's address space. \n\n let new_userspace_mmi = {\n\n let kernel_mmi_ref = get_kernel_mmi_ref().expect(\"spawn_userspace(): KERNEL_MMI was not yet initialized!\");\n\n let mut kernel_mmi_locked = kernel_mmi_ref.lock();\n\n \n\n // create a new kernel stack for this userspace task\n\n let mut kstack: Stack = kernel_mmi_locked.alloc_stack(KERNEL_STACK_SIZE_IN_PAGES).expect(\"spawn_userspace: couldn't alloc_stack for new kernel stack!\");\n\n\n\n setup_context_trampoline(&mut kstack, &mut new_task, userspace_wrapper);\n\n \n","file_path":"old_crates/spawn_userspace/src/lib.rs","rank":0,"score":599883.9079822414},{"content":"/// This function is used for live evolution from a round robin scheduler to a priority scheduler. \n\n/// It first extracts the taskrefs from the round robin Runqueue,\n\n/// then converts them into priority taskrefs and places them on the priority Runqueue.\n\npub fn prio_sched(_old_namespace: &Arc<CrateNamespace>, _new_namespace: &CrateNamespace) -> Result<(), &'static str> {\n\n\n\n // just debugging info\n\n #[cfg(not(loscd_eval))]\n\n {\n\n warn!(\"prio_sched(): at the top.\");\n\n let rq_rr_crate = CrateNamespace::get_crate_starting_with(_old_namespace, \"runqueue_round_robin\")\n\n .map(|(_crate_name, crate_ref, _ns)| crate_ref)\n\n .ok_or(\"Couldn't get runqueue_round_robin crate from old namespace\")?;\n\n let krate = rq_rr_crate.lock_as_ref();\n\n for sec in krate.sections.values() {\n\n if sec.name.contains(\"RUNQUEUES\") {\n\n debug!(\"Section {}\\n\\ttype: {:?}\\n\\tvaddr: {:#X}\\n\\tsize: {}\\n\", sec.name, sec.typ, sec.start_address(), sec.size());\n\n }\n\n }\n\n warn!(\"REPLACING LAZY_STATIC RUNQUEUES...\");\n\n }\n\n\n\n #[cfg(loscd_eval)]\n\n let hpet = hpet::get_hpet().ok_or(\"couldn't get HPET timer\")?;\n","file_path":"kernel/state_transfer/src/lib.rs","rank":1,"score":498659.451111004},{"content":"/// Parses the given `path` to obtain the part of the filename before the crate name delimiter '-'. \n\nfn get_plain_crate_name_from_path<'p>(path: &'p Path) -> Result<&'p str, String> {\n\n path.file_stem()\n\n .and_then(|os_str| os_str.to_str())\n\n .ok_or_else(|| format!(\"Couldn't get file name of file in out_dir: {}\", path.display()))?\n\n .split('-').next()\n\n .ok_or_else(|| format!(\"File in out_dir missing delimiter '-' between crate name and hash. {}\", path.display()))\n\n}\n\n\n\n\n","file_path":"tools/theseus_cargo/src/main.rs","rank":2,"score":489312.4673317265},{"content":"/// This function calls the crate swapping routine for a corrupted crate (referred to as self swap)\n\n/// Swapping a crate with a new copy of object file includes following steps in high level\n\n/// 1) Call generic crate swapping routine with self_swap = true\n\n/// 2) Change the calues in the stack to the reloaded crate\n\n/// 3) Change any other references in the heap to the reloaded crate\n\n/// This function handles 1 and 2 operations and 3 is handled in the call site depending on necessity\n\npub fn self_swap_handler(crate_name: &str) -> Result<SwapRanges, String> {\n\n\n\n let taskref = task::get_my_current_task()\n\n .ok_or_else(|| format!(\"failed to get current task\"))?;\n\n\n\n #[cfg(not(downtime_eval))]\n\n debug!(\"The taskref is {:?}\",taskref);\n\n\n\n let curr_dir = Arc::clone(&taskref.get_env().lock().working_dir);\n\n\n\n let override_namespace_crate_dir = Option::<NamespaceDir>::None;\n\n\n\n let verbose = false;\n\n let state_transfer_functions: Vec<String> = Vec::new();\n\n\n\n let mut tuples: Vec<(&str, &str, bool)> = Vec::new();\n\n\n\n tuples.push((crate_name, crate_name , false));\n\n\n\n #[cfg(not(downtime_eval))]\n","file_path":"kernel/fault_crate_swap/src/lib.rs","rank":3,"score":488256.98800288304},{"content":"/// Replaces the `old_crate_name` substring in the given `demangled_full_symbol` with the given `new_crate_name`, \n\n/// if it can be found, and if the parent crate name matches the `old_crate_name`. \n\n/// If the parent crate name can be found but does not match the expected `old_crate_name`,\n\n/// then None is returned.\n\n/// \n\n/// This creates an entirely new String rather than performing an in-place replacement, \n\n/// because the `new_crate_name` might be a different length than the original crate name.\n\n/// \n\n/// We cannot simply use `str::replace()` because it would replace *all* instances of the `old_crate_name`, \n\n/// including components of function/symbol names. \n\n/// \n\n/// # Examples\n\n/// * `replace_containing_crate_name(\"keyboard::init\", \"keyboard\", \"keyboard_new\") -> Some(\"keyboard_new::init\")`\n\n/// * `replace_containing_crate_name(\"<framebuffer::VirtualFramebuffer as display::Display>::fill_rectangle\", \"display\", \"display3\")\n\n/// -> Some(\"<framebuffer::VirtualFramebuffer as display3::Display>::fill_rectangle\")`\n\npub fn replace_containing_crate_name(demangled_full_symbol: &str, old_crate_name: &str, new_crate_name: &str) -> Option<String> {\n\n let mut new_symbol = String::from(demangled_full_symbol);\n\n let mut addend: isize = 0; // index compensation for the difference in old vs. new crate name length\n\n let mut replaced = false;\n\n for range in get_containing_crate_name_ranges(demangled_full_symbol) {\n\n if demangled_full_symbol.get(range.clone()) == Some(old_crate_name) {\n\n new_symbol = format!(\"{}{}{}\", \n\n &new_symbol[.. ((range.start as isize + addend) as usize)],\n\n new_crate_name,\n\n &demangled_full_symbol[range.end ..]\n\n );\n\n replaced = true;\n\n addend += (new_crate_name.len() as isize) - (old_crate_name.len() as isize);\n\n }\n\n }\n\n if replaced { Some(new_symbol) } else { None }\n\n}\n","file_path":"kernel/crate_name_utils/src/lib.rs","rank":4,"score":488128.19302356354},{"content":"/// Outputs the list of sections in the given crate.\n\n/// \n\n/// # Arguments\n\n/// * `all_sections`: If `true`, then all sections will be printed. \n\n/// If `false`, then only public (global) sections will be printed.\n\n/// \n\n/// If there are multiple matches, this returns an Error containing \n\n/// all of the matching section names separated by the newline character `'\\n'`.\n\nfn sections_in_crate(crate_name: &str, all_sections: bool) -> Result<(), String> {\n\n let (crate_name, crate_ref) = find_crate(crate_name)?;\n\n\n\n let mut containing_crates = BTreeSet::new();\n\n if all_sections {\n\n println_log!(\"Sections (all) in crate {}:\", crate_name);\n\n for sec in crate_ref.lock_as_ref().sections.values() {\n\n println_log!(\" {}\", sec.name);\n\n for n in get_containing_crate_name(&sec.name) {\n\n containing_crates.insert(String::from(n));\n\n }\n\n }\n\n } else {\n\n println_log!(\"Sections (public-only) in crate {}:\", crate_name);\n\n for sec in crate_ref.lock_as_ref().global_sections_iter() {\n\n println_log!(\" {}\", sec.name);\n\n for n in get_containing_crate_name(&sec.name) {\n\n containing_crates.insert(String::from(n));\n\n }\n\n }\n\n }\n\n\n\n let crates_list = containing_crates.into_iter().collect::<Vec<String>>().join(\"\\n\");\n\n println_log!(\"Constituent (or related) crates:\\n{}\", &crates_list);\n\n Ok(())\n\n}\n\n\n\n\n","file_path":"applications/deps/src/lib.rs","rank":5,"score":456637.2499454488},{"content":"/// Removes a `TaskRef` from all `RunQueue`s that exist on the entire system.\n\npub fn remove_task_from_all(task: &TaskRef) -> Result<(), &'static str>{\n\n RunQueue::remove_task_from_all(task)\n\n}\n\n\n\n\n\n\n","file_path":"kernel/runqueue/src/lib.rs","rank":6,"score":453697.7047795294},{"content":"/// Returns the crate matching the given `crate_name` if there is a single match.\n\n/// \n\n/// If there are multiple matches, this returns an Error containing \n\n/// all of the matching section names separated by the newline character `'\\n'`.\n\nfn find_crate(crate_name: &str) -> Result<(String, StrongCrateRef), String> {\n\n let namespace = get_my_current_namespace();\n\n let mut matching_crates = CrateNamespace::get_crates_starting_with(&namespace, crate_name);\n\n match matching_crates.len() {\n\n 0 => Err(format!(\"couldn't find crate matching {:?}\", crate_name)),\n\n 1 => {\n\n let mc = matching_crates.swap_remove(0);\n\n Ok((mc.0, mc.1)) \n\n }\n\n _ => Err(matching_crates.into_iter().map(|(crate_name, _crate_ref, _ns)| crate_name).collect::<Vec<String>>().join(\"\\n\")),\n\n }\n\n}\n\n\n\n\n","file_path":"applications/deps/src/lib.rs","rank":7,"score":442980.47538265924},{"content":"fn print_crates(output: &mut String, indent: usize, namespace: &CrateNamespace, recursive: bool) -> core::fmt::Result {\n\n writeln!(output, \"\\n{:indent$}{} CrateNamespace has loaded crates:\", \"\", namespace.name(), indent = indent)?;\n\n let mut crates: Vec<String> = Vec::new();\n\n // We do recursion manually here so we can separately print each recursive namespace.\n\n namespace.for_each_crate(false, |crate_name, crate_ref| {\n\n crates.push(format!(\"{:indent$}{} {:?}\", \"\", crate_name, crate_ref.lock_as_ref().object_file.lock().get_absolute_path(), indent = (indent + 4)));\n\n true\n\n });\n\n crates.sort();\n\n for c in crates {\n\n writeln!(output, \"{}\", c)?;\n\n }\n\n\n\n if recursive {\n\n if let Some(r_ns) = namespace.recursive_namespace() {\n\n print_crates(output, indent + 2, r_ns.deref(), recursive)?;\n\n }\n\n }\n\n\n\n Ok(())\n\n}\n\n\n\n\n","file_path":"applications/ns/src/lib.rs","rank":8,"score":439216.26627476927},{"content":"/// This function sets up the given new `Task`'s kernel stack pointer to properly jump\n\n/// to the given entry point function when the new `Task` is first scheduled in. \n\n/// \n\n/// When a new task is first scheduled in, a `Context` struct will be popped off the stack,\n\n/// and at the end of that struct is the address of the next instruction that will be popped off as part of the \"ret\" instruction, \n\n/// i.e., the entry point into the new task. \n\n/// \n\n/// So, this function allocates space for the saved context registers to be popped off when this task is first switched to.\n\n/// It also sets the given `new_task`'s `saved_sp` (its saved stack pointer, which holds the Context for task switching).\n\n/// \n\nfn setup_context_trampoline(new_task: &mut Task, entry_point_function: fn() -> !) -> Result<(), &'static str> {\n\n \n\n /// A private macro that actually creates the Context and sets it up in the `new_task`.\n\n /// We use a macro here so we can pass in the proper `ContextType` at runtime, \n\n /// which is useful for both the simd_personality config and regular/SSE configs.\n\n macro_rules! set_context {\n\n ($ContextType:ty) => (\n\n // We write the new Context struct at the top of the stack, which is at the end of the stack's MappedPages. \n\n // We subtract \"size of usize\" (8) bytes to ensure the new Context struct doesn't spill over past the top of the stack.\n\n let mp_offset = new_task.inner_mut().kstack.size_in_bytes() - mem::size_of::<usize>() - mem::size_of::<$ContextType>();\n\n let new_context_destination: &mut $ContextType = new_task.inner_mut().kstack.as_type_mut(mp_offset)?;\n\n *new_context_destination = <$ContextType>::new(entry_point_function as usize);\n\n new_task.inner_mut().saved_sp = new_context_destination as *const _ as usize;\n\n );\n\n }\n\n\n\n // If `simd_personality` is enabled, all of the `context_switch*` implementation crates are simultaneously enabled,\n\n // in order to allow choosing one of them based on the configuration options of each Task (SIMD, regular, etc).\n\n #[cfg(simd_personality)] {\n\n match new_task.simd {\n","file_path":"kernel/spawn/src/lib.rs","rank":9,"score":437286.9768535586},{"content":"pub fn sysrecv(name:&CStr) -> String{\n\n let sname = name.to_string_lossy().into_owned();;;\n\n trace!(\"Get the connection {}\", &sname);\n\n let mut table = get_connection_table().write();\n\n let mut connection = table.get_connection(sname)\n\n .expect(\"Fail to create the bus connection\").write();\n\n\n\n let obj = connection.receive();\n\n if obj.is_some() {\n\n trace!(\"Get the result!\");\n\n return obj.unwrap().data;\n\n } else {\n\n trace!(\"No message!\");\n\n return String::from(\"\");\n\n }\n\n}\n","file_path":"old_crates/dbus/src/lib.rs","rank":10,"score":435715.33054222027},{"content":"fn print_files(output: &mut String, indent: usize, namespace: &CrateNamespace, recursive: bool) -> core::fmt::Result {\n\n writeln!(output, \"\\n{:indent$}{} CrateNamespace has crate object files:\", \"\", namespace.name(), indent = indent)?;\n\n let mut files = namespace.dir().lock().list();\n\n files.sort();\n\n for f in files {\n\n writeln!(output, \"{:indent$}{}\", \"\", f, indent = (indent + 4))?;\n\n }\n\n\n\n if recursive {\n\n if let Some(r_ns) = namespace.recursive_namespace() {\n\n print_files(output, indent + 2, r_ns.deref(), recursive)?;\n\n }\n\n }\n\n\n\n Ok(())\n\n}\n\n\n\n\n","file_path":"applications/ns/src/lib.rs","rank":12,"score":425113.5945333614},{"content":"/// Creates a new directory with a unique name in the given `parent_dir`. \n\n/// For example, given a base_name of \"my_dir\", \n\n/// it will create a directory \"my_dir.2\" if \"my_dir\" and \"my_dir.1\" already exist.\n\nfn make_unique_directory(base_name: &str, parent_dir: &DirRef) -> Result<DirRef, &'static str> {\n\n if parent_dir.lock().get(base_name).is_none() {\n\n return VFSDirectory::new(base_name.to_string(), parent_dir);\n\n }\n\n for i in 1.. {\n\n let new_base_name = format!(\"{}.{}\", base_name, i);\n\n if parent_dir.lock().get(&new_base_name).is_none() {\n\n return VFSDirectory::new(new_base_name, parent_dir);\n\n } \n\n }\n\n\n\n Err(\"unable to create new unique directory\")\n\n}\n\n\n\n\n","file_path":"applications/upd/src/lib.rs","rank":13,"score":423567.98013474175},{"content":"fn load_crate(output: &mut String, crate_file_ref: FileRef, namespace: &Arc<CrateNamespace>) -> Result<(), String> {\n\n let kernel_mmi_ref = memory::get_kernel_mmi_ref().ok_or_else(|| format!(\"Cannot get kernel_mmi_ref\"))?;\n\n let (_new_crate_ref, _new_syms) = namespace.load_crate(\n\n &crate_file_ref,\n\n None,\n\n &kernel_mmi_ref,\n\n false\n\n ).map_err(|e| String::from(e))?;\n\n writeln!(output, \"Loaded crate with {} new symbols from {}\", _new_syms, crate_file_ref.lock().get_absolute_path()).unwrap();\n\n Ok(())\n\n}\n\n\n\n\n","file_path":"applications/ns/src/lib.rs","rank":14,"score":412844.7681497364},{"content":"/// Applies an already-downloaded update according the \"diff.txt\" file\n\n/// that must be in the given base directory.\n\nfn apply(base_dir_path: &Path) -> Result<(), String> {\n\n if cfg!(not(loadable)) {\n\n return Err(format!(\"Evolutionary updates can only be applied when Theseus is built in loadable mode.\"));\n\n }\n\n\n\n let kernel_mmi_ref = memory::get_kernel_mmi_ref().ok_or_else(|| format!(\"couldn't get kernel MMI\"))?;\n\n let curr_dir = task::get_my_current_task().map(|t| t.get_env().lock().working_dir.clone()).ok_or_else(|| format!(\"couldn't get my current working directory\"))?;\n\n let new_namespace_dir = match base_dir_path.get(&curr_dir) {\n\n Some(FileOrDir::Dir(d)) => NamespaceDir::new(d),\n\n _ => return Err(format!(\"cannot find an update base directory at path {}\", base_dir_path)),\n\n };\n\n let diff_file = match new_namespace_dir.lock().get(DIFF_FILE_NAME) { \n\n Some(FileOrDir::File(f)) => f,\n\n _ => return Err(format!(\"cannot find diff file expected at {}/{}\", base_dir_path, DIFF_FILE_NAME)),\n\n };\n\n let mut diff_content: Vec<u8> = alloc::vec::from_elem(0, diff_file.lock().size()); \n\n let _bytes_read = diff_file.lock().read(&mut diff_content, 0)?;\n\n let diffs = ota_update_client::as_lines(&diff_content).map_err(|e| e.to_string())\n\n .and_then(|diff_lines| ota_update_client::parse_diff_lines(&diff_lines).map_err(|e| e.to_string()))?;\n\n\n","file_path":"applications/upd/src/lib.rs","rank":15,"score":408477.0494424983},{"content":"/// Chooses the \"least busy\" core's runqueue\n\n/// and adds the given `Task` reference to that core's runqueue.\n\npub fn add_task_to_any_runqueue(task: TaskRef) -> Result<(), &'static str>{\n\n RunQueue::add_task_to_any_runqueue(task)\n\n}\n\n\n","file_path":"kernel/runqueue/src/lib.rs","rank":16,"score":408019.60812394647},{"content":"/// Parse the given verbose rustc command string and return the value of the \"--out-dir\" argument.\n\nfn get_out_dir_arg(cmd_str: &str) -> Result<String, String> {\n\n let out_dir_str_start = cmd_str.find(\" --out-dir\")\n\n .map(|idx| &cmd_str[idx..])\n\n .ok_or_else(|| format!(\"Captured rustc command did not have an --out-dir argument\"))?;\n\n let out_dir_parse = rustc_clap_options(\"\")\n\n .setting(clap::AppSettings::DisableHelpFlags)\n\n .setting(clap::AppSettings::DisableHelpSubcommand)\n\n .setting(clap::AppSettings::AllowExternalSubcommands)\n\n .setting(clap::AppSettings::NoBinaryName)\n\n .setting(clap::AppSettings::ColorNever)\n\n .get_matches_from_safe(out_dir_str_start.split_whitespace());\n\n let matches = out_dir_parse.map_err(|e| \n\n format!(\"Could not parse --out-dir argument in captured rustc command.\\nError {}\", e)\n\n )?;\n\n matches.value_of(\"--out-dir\")\n\n .map(String::from)\n\n .ok_or_else(|| format!(\"--out-dir argument did not have a value\"))\n\n}\n\n\n\n\n","file_path":"tools/theseus_cargo/src/main.rs","rank":17,"score":407685.89983285917},{"content":"/// Outputs the given crate's weak dependents, i.e.,\n\n/// the crates that depend on the given crate.\n\n/// \n\n/// If there are multiple matches, this returns an Error containing \n\n/// all of the matching crate names separated by the newline character `'\\n'`.\n\nfn crates_dependent_on_me(_crate_name: &str) -> Result<(), String> {\n\n Err(format!(\"unimplemented\"))\n\n}\n\n\n\n\n","file_path":"applications/deps/src/lib.rs","rank":18,"score":406320.82831300865},{"content":"/// Outputs the given crate's strong dependencies, i.e.,\n\n/// the crates that the given crate depends on.\n\n/// \n\n/// If there are multiple matches, this returns an Error containing \n\n/// all of the matching crate names separated by the newline character `'\\n'`.\n\nfn crates_i_depend_on(_crate_name: &str) -> Result<(), String> {\n\n Err(format!(\"unimplemented\"))\n\n}\n\n\n\n\n\n\n","file_path":"applications/deps/src/lib.rs","rank":19,"score":406320.82831300865},{"content":"/// Finds the corresponding function for each instruction pointer and calculates the percentage amount each function occured in the samples\n\npub fn find_function_names_from_samples(sample_results: &SampleResults) -> Result<(), &'static str> {\n\n let taskref = task::get_my_current_task().ok_or(\"pmu_x86::get_function_names_from_samples: Could not get reference to current task\")?;\n\n let namespace = taskref.get_namespace();\n\n debug!(\"Analyze Samples:\");\n\n\n\n let mut sections: BTreeMap<String, usize> = BTreeMap::new();\n\n let total_samples = sample_results.instruction_pointers.len();\n\n\n\n for ip in sample_results.instruction_pointers.iter() {\n\n let (section_ref, _offset) = namespace.get_section_containing_address(\n\n memory::VirtualAddress::new(ip.0).ok_or(\"sampled instruction pointer was an invalid virtual address\")?,\n\n true\n\n ).ok_or(\"Can't find section containing sampled instruction pointer\")?;\n\n let section_name = section_ref.name_without_hash().to_string();\n\n\n\n sections.entry(section_name).and_modify(|e| {*e += 1}).or_insert(1);\n\n }\n\n\n\n for (section, occurrences) in sections.iter() {\n\n let percentage = *occurrences as f32 / total_samples as f32 * 100.0;\n\n debug!(\"{:?} {}% \\n\", section, percentage);\n\n }\n\n\n\n Ok(())\n\n}\n\n\n","file_path":"kernel/pmu_x86/src/lib.rs","rank":20,"score":403932.27209229174},{"content":"fn num_deps_crate(crate_name: &str) -> Result<(), String> {\n\n let (_cn, crate_ref) = find_crate(crate_name)?;\n\n let (s, w, i) = crate_dependency_count(&crate_ref);\n\n println!(\"Crate {}'s Dependency Count:\\nStrong: {}\\nWeak: {}\\nIntrnl: {}\", crate_name, s, w, i);\n\n Ok(())\n\n}\n\n\n","file_path":"applications/deps/src/lib.rs","rank":21,"score":400201.7806153407},{"content":"/// Returns the crate name that is derived from a crate object file path.\n\n/// \n\n/// # Examples of acceptable paths\n\n/// Legal paths can:\n\n/// * be absolute or relative,\n\n/// * optionally end with an extension, e.g., `\".o\"`, optionally start \n\n/// * optionally start with a module file prefix, e.g., `\"k#my_crate-<hash>.o\"`.\n\npub fn crate_name_from_path<'p>(object_file_path: &'p Path) -> &'p str {\n\n let stem = object_file_path.file_stem();\n\n if let Ok((_crate_type, _prefix, name)) = CrateType::from_module_name(stem) {\n\n name\n\n } else {\n\n stem\n\n }\n\n}\n\n\n","file_path":"kernel/crate_name_utils/src/lib.rs","rank":22,"score":400198.30873816303},{"content":"/// Parses the given symbol string to try to find the name of the parent crate\n\n/// that contains the symbol. \n\n/// Depending on the symbol, there may be multiple potential parent crates;\n\n/// if so, they are returned in order of likeliness: \n\n/// the first crate name in the symbol is most likely to contain it.\n\n/// If the parent crate cannot be determined (e.g., a `no_mangle` symbol),\n\n/// then an empty `Vec` is returned.\n\n/// \n\n/// # Examples\n\n/// * `<*const T as core::fmt::Debug>::fmt` -> `[\"core\"]`\n\n/// * `<alloc::boxed::Box<T>>::into_unique` -> `[\"alloc\"]`\n\n/// * `<framebuffer::VirtualFramebuffer as display::Display>::fill_rectangle` -> `[\"framebuffer\", \"display\"]`\n\n/// * `keyboard::init` -> `[\"keyboard\"]`\n\npub fn get_containing_crate_name<'a>(demangled_full_symbol: &'a str) -> Vec<&'a str> {\n\n get_containing_crate_name_ranges(demangled_full_symbol)\n\n .into_iter()\n\n .filter_map(|range| demangled_full_symbol.get(range))\n\n .dedup()\n\n .collect()\n\n}\n\n\n\n\n","file_path":"kernel/crate_name_utils/src/lib.rs","rank":23,"score":396355.2217847112},{"content":"/// Removes the (child application's task ID, parent terminal print_producer) key-val pair from the map\n\n/// Called right after an application exits\n\npub fn remove_child(child_task_id: usize) -> Result<(), &'static str> {\n\n TERMINAL_PRINT_PRODUCERS.lock().remove(&child_task_id);\n\n Ok(()) \n\n}\n\n\n\n\n\n\n\nuse core::fmt;\n","file_path":"kernel/terminal_print/src/lib.rs","rank":24,"score":394094.2936114032},{"content":"/// Goes through the contents of each directory to compare each file. \n\n/// \n\n/// Returns a mapping of old crate to new crate, meaning that the old crate should be replaced with the new crate. \n\n/// If the old crate is `None` and the new crate is `Some`, then the new crate is a new addition that does not replace any old crate.\n\n/// If the old crate is `Some` and the new crate is `None`, then the old crate is merely being removed without being replaced.\n\n/// If both the old crate and new crate are `Some`, then the new crate is replacing the old crate.\n\nfn compare_dirs(old_dir_contents: Trie<BString, PathBuf>, new_dir_contents: Trie<BString, PathBuf>) -> Result<MultiMap<String, String>, String> {\n\n let mut replacements: MultiMap<String, String> = MultiMap::new();\n\n\n\n // First, we go through the new directory and see which files have changed since the old directory\n\n for (new_filename, new_path) in new_dir_contents.iter() {\n\n\n\n // if the old dir contains an identical file as the new dir, then we diff their actual contents\n\n if let Some(old_path) = old_dir_contents.get(new_filename) {\n\n let old_file = fs::read(old_path).map_err(|e| e.to_string())?;\n\n let new_file = fs::read(new_path).map_err(|e| e.to_string())?;\n\n if old_file != new_file {\n\n println!(\"{0} -> {0}\", new_filename.as_str());\n\n replacements.insert(new_filename.clone().into(), new_filename.clone().into());\n\n }\n\n }\n\n // otherwise we try to search the old dir to see if there's a single matching crate that has a different hash\n\n else {\n\n // initially, we search just the crate name itself (e.g., \"terminal\", \"apic\") without the trailing hash to allow for matching applications.\n\n let crate_name_search_str = format!(\"{}\", crate_name_without_hash(new_filename.as_str()));\n\n let matching_old_crates: Vec<(BString, PathBuf)> = old_dir_contents.iter_prefix_str(&crate_name_search_str).map(|(k, v)| (k.clone(), v.clone())).collect();\n","file_path":"tools/diff_crates/src/main.rs","rank":25,"score":392359.44195370865},{"content":"/// This function is designed to be invoked from an interrupt handler \n\n/// when a sampling interrupt has (or may have) occurred. \n\n///\n\n/// It takes a sample by logging the the instruction pointer and task ID at the point\n\n/// at which the sampling interrupt occurred. \n\n/// The counter is then either reset to its starting value \n\n/// (if there are more samples that need to be taken)\n\n/// or disabled entirely if the final sample has been taken. \n\n///\n\n/// # Argument\n\n/// * `stack_frame`: the stack frame that was pushed onto the stack automatically \n\n/// by the CPU and passed into the interrupt/exception handler. \n\n/// This is used to determine during which instruction the sampling interrupt occurred.\n\n///\n\n/// # Return\n\n/// * Returns `Ok(true)` if a PMU sample occurred and was handled. \n\n/// * Returns `Ok(false)` if PMU isn't supported, or if PMU wasn't yet initialized, \n\n/// or if there was not a pending sampling interrupt. \n\n/// * Returns an `Err` if PMU is supported and initialized and a sample was pending, \n\n/// but an error occurred while logging the sample.\n\n///\n\npub fn handle_sample(stack_frame: &mut ExceptionStackFrame) -> Result<bool, &'static str> {\n\n // Check that PMU hardware exists and is supported on this machine.\n\n if *PMU_VERSION < MIN_PMU_VERSION {\n\n return Ok(false);\n\n }\n\n // Check that a PMU sampling event is currently pending.\n\n if rdmsr(IA32_PERF_GLOBAL_STAUS) == 0 {\n\n return Ok(false);\n\n }\n\n\n\n unsafe { wrmsr(IA32_PERF_GLOBAL_OVF_CTRL, CLEAR_PERF_STATUS_MSR); }\n\n\n\n let my_core_id = apic::get_my_apic_id();\n\n let event_mask = rdmsr(IA32_PERFEVTSEL0);\n\n\n\n let mut sampling_info = SAMPLING_INFO.lock();\n\n let mut samples = sampling_info.get_mut(&my_core_id)\n\n .ok_or(\"pmu_x86::handle_sample: Could not retrieve sampling information for this core\")?;\n\n\n\n let current_count = samples.sample_count;\n","file_path":"kernel/pmu_x86/src/lib.rs","rank":26,"score":391348.2914188261},{"content":"/// This function returns the name of the crate to replace if required. \n\n/// Returns none if no crate is needed to be replaced. \n\npub fn get_crate_to_swap() -> Option<String> {\n\n\n\n #[cfg(not(use_crate_replacement))]\n\n {\n\n return null_swap_policy();\n\n }\n\n\n\n\n\n #[cfg(use_crate_replacement)]\n\n {\n\n #[cfg(not(use_iterative_replacement))]\n\n return simple_swap_policy();\n\n\n\n #[cfg(use_iterative_replacement)]\n\n return iterative_swap_policy() ;\n\n }\n\n}\n","file_path":"kernel/fault_crate_swap/src/lib.rs","rank":27,"score":382009.2490633057},{"content":"/// Adds the given `Task` reference to given core's runqueue.\n\npub fn add_task_to_specific_runqueue(which_core: u8, task: TaskRef) -> Result<(), &'static str>{\n\n RunQueue::add_task_to_specific_runqueue(which_core, task)\n\n}\n\n\n","file_path":"kernel/runqueue/src/lib.rs","rank":28,"score":379951.3577393348},{"content":"/// Changes the priority of the given task with the given priority level.\n\n/// Priority values must be between 40 (maximum priority) and 0 (minimum prriority).\n\npub fn set_priority(task: &TaskRef, priority: u8) -> Result<(), &'static str> {\n\n let priority = core::cmp::min(priority, MAX_PRIORITY);\n\n RunQueue::set_priority(task, priority)\n\n}\n\n\n","file_path":"kernel/scheduler_priority/src/lib.rs","rank":29,"score":376628.47468942497},{"content":"/// Shell call this function to check whether a task is requesting instant stdin flush.\n\n/// \n\n/// Error can occur when there is no IoControlFlags structure for that task.\n\npub fn is_requesting_instant_flush(task_id: &usize) -> Result<bool, &'static str> {\n\n let locked_flags = shared_maps::lock_flag_map();\n\n match locked_flags.get(task_id) {\n\n Some(flags) => {\n\n Ok(flags.stdin_instant_flush)\n\n },\n\n None => Err(\"no io control flags for this task\")\n\n }\n\n}\n\n\n\n/// Calls `print!()` with an extra newline ('\\n') appended to the end. \n\n#[macro_export]\n\nmacro_rules! println {\n\n ($fmt:expr) => (print!(concat!($fmt, \"\\n\")));\n\n ($fmt:expr, $($arg:tt)*) => (print!(concat!($fmt, \"\\n\"), $($arg)*));\n\n\n\n}\n\n\n\n/// The main printing macro, which simply writes to the current task's stdout stream.\n\n#[macro_export]\n\nmacro_rules! print {\n\n ($($arg:tt)*) => ({\n\n $crate::print_to_stdout_args(format_args!($($arg)*));\n\n });\n\n}\n\n\n\nuse core::fmt;\n\nuse bare_io::Write;\n","file_path":"applications/app_io/src/lib.rs","rank":30,"score":376293.3365553078},{"content":"/// enable or disable the packet streaming\n\n/// also return the vec of data previously in the buffer which may be useful\n\npub fn mouse_packet_streaming(enable: bool) -> Result<Vec<u8>, &'static str> {\n\n if enable {\n\n if let Err(_e) = command_to_mouse(0xf4) {\n\n warn!(\"enable streaming failed\");\n\n Err(\"enable mouse streaming failed\")\n\n } else {\n\n // info!(\"enable streaming succeeded!!\");\n\n Ok(Vec::new())\n\n }\n\n }\n\n else {\n\n let mut buffer_data = Vec::new();\n\n if data_to_port2(0xf5) != 0xfa {\n\n for x in 0..15 {\n\n if x == 14 {\n\n warn!(\"disable mouse streaming failed\");\n\n return Err(\"disable mouse streaming failed\");\n\n }\n\n let response = ps2_read_data();\n\n\n","file_path":"kernel/ps2/src/lib.rs","rank":31,"score":375503.69543570344},{"content":"/// Performs early-stage initialization for simple devices needed during early boot.\n\n///\n\n/// This includes:\n\n/// * local APICs ([`apic`]),\n\n/// * [`acpi`] tables for system configuration info, including the IOAPIC.\n\npub fn early_init(kernel_mmi: &mut MemoryManagementInfo) -> Result<(), &'static str> {\n\n // First, initialize the local apic info.\n\n apic::init(&mut kernel_mmi.page_table)?;\n\n \n\n // Then, parse the ACPI tables to acquire system configuration info.\n\n acpi::init(&mut kernel_mmi.page_table)?;\n\n\n\n Ok(())\n\n}\n\n\n\n\n","file_path":"kernel/device_manager/src/lib.rs","rank":32,"score":371455.4948536592},{"content":"/// Returns the section matching the given `section_name` if there is a single match.\n\n/// \n\n/// If there are multiple matches, this returns an Error containing \n\n/// all of the matching section names separated by the newline character `'\\n'`.\n\nfn find_section(section_name: &str) -> Result<StrongSectionRef, String> {\n\n let namespace = get_my_current_namespace();\n\n let matching_symbols = namespace.find_symbols_starting_with(section_name);\n\n if matching_symbols.len() == 1 {\n\n return matching_symbols[0].1.upgrade()\n\n .ok_or_else(|| format!(\"Found matching symbol name but couldn't get reference to section\"));\n\n } else if matching_symbols.len() > 1 {\n\n return Err(matching_symbols.into_iter().map(|(k, _v)| k).collect::<Vec<String>>().join(\"\\n\"));\n\n } else {\n\n // continue on\n\n }\n\n\n\n // If it wasn't a global section in the symbol map, then we need to find its containing crate\n\n // and search that crate's symbols manually.\n\n let containing_crate_ref = get_containing_crate_name(section_name).get(0)\n\n .and_then(|cname| CrateNamespace::get_crate_starting_with(&namespace, &format!(\"{}-\", cname)))\n\n .or_else(|| get_containing_crate_name(section_name).get(1)\n\n .and_then(|cname| CrateNamespace::get_crate_starting_with(&namespace, &format!(\"{}-\", cname)))\n\n )\n\n .map(|(_cname, crate_ref, _ns)| crate_ref)\n","file_path":"applications/deps/src/lib.rs","rank":33,"score":368825.29379083513},{"content":"/// Same as [`get_containing_crate_name()`](#get_containing_crate_name),\n\n/// but returns the substring `Range`s of where the parent crate names \n\n/// are located in the given `demangled_full_symbol` string.\n\n/// \n\n/// # Examples\n\n/// * `<*const T as core::fmt::Debug>::fmt` -> `[12..16]`\n\n/// * `<alloc::boxed::Box<T>>::into_unique` -> `[1..6]`\n\n/// * `<framebuffer::VirtualFramebuffer as display::Display>::fill_rectangle` -> `[1..13, 37..44]`\n\n/// * `keyboard::init` -> `[0..8]`\n\npub fn get_containing_crate_name_ranges(demangled_full_symbol: &str) -> Vec<Range<usize>> {\n\n let mut ranges: Vec<Range<usize>> = Vec::new();\n\n // the separator between independent parts of the symbol string\n\n const AS: &'static str = \" as \";\n\n // the index at which we are starting our search for a crate name\n\n let mut beginning_bound = Some(0);\n\n\n\n while let Some(beg) = beginning_bound {\n\n // Find the first occurrence of \"::\"; the crate name will be right before that.\n\n let end = demangled_full_symbol.get(beg..)\n\n .and_then(|s| s.find(\"::\"))\n\n .map(|end_idx| beg + end_idx);\n\n\n\n if let Some(end) = end {\n\n // If the above search for \"::\" passed an \" as \" substring, \n\n // we skip it and let the next iteration of the loop handle it to avoid doubly counting it.\n\n if demangled_full_symbol.get(beg..end).map(|s| s.contains(AS)) != Some(true) {\n\n // Find the beginning of the crate name, searching backwards from the \"end\"\n\n let start = demangled_full_symbol.get(beg..end)\n\n .and_then(|s| s.rfind(|c| !is_valid_crate_name_char(c))) // find the first char before the crate name that isn't part of the crate name\n","file_path":"kernel/crate_name_utils/src/lib.rs","rank":34,"score":367750.6082950745},{"content":"/// Provides the most recent entry in the log for given crate\n\n/// Utility function for iterative crate replacement\n\npub fn get_the_most_recent_match(error_crate : &str) -> Option<FaultEntry> {\n\n\n\n #[cfg(not(downtime_eval))]\n\n debug!(\"getting the most recent match\");\n\n\n\n let mut fe :Option<FaultEntry> = None;\n\n for fault_entry in FAULT_LIST.lock().iter() {\n\n if let Some(crate_error_occured) = &fault_entry.crate_error_occured {\n\n let error_crate_name = crate_error_occured.clone();\n\n let error_crate_name_simple = error_crate_name.split(\"-\").next().unwrap_or_else(|| &error_crate_name);\n\n if error_crate_name_simple == error_crate {\n\n let item = fault_entry.clone();\n\n fe = Some(item);\n\n }\n\n }\n\n }\n\n\n\n if fe.is_none(){\n\n\n\n #[cfg(not(downtime_eval))]\n\n debug!(\"No recent entries for the given crate {}\", error_crate);\n\n }\n\n fe\n\n}","file_path":"kernel/fault_log/src/lib.rs","rank":35,"score":366278.20432617544},{"content":"/// Starts a new task that detects new console connections\n\n/// by waiting for new data to be received on serial ports.\n\n///\n\n/// Returns the newly-spawned detection task.\n\npub fn start_connection_detection() -> Result<TaskRef, &'static str> {\n\n\tlet (sender, receiver) = async_channel::new_channel(4);\n\n\tserial_port::set_connection_listener(sender);\n\n\n\n\tspawn::new_task_builder(console_connection_detector, receiver)\n\n\t\t.name(\"console_connection_detector\".into())\n\n\t\t.spawn()\n\n}\n\n\n\npub struct Console<I, O, Backend> \n\n\twhere I: bare_io::Read,\n\n\t O: bare_io::Write,\n\n\t\t Backend: TerminalBackend,\n\n{\n\n\tname: String,\n\n\t_input: I,\n\n\tterminal: TextTerminal<Backend>,\n\n\t_output: PhantomData<O>,\n\n}\n\n\n","file_path":"kernel/console/src/lib.rs","rank":36,"score":365571.09612527635},{"content":"pub fn rmain(matches: &Matches, opts: &Options) -> Result<(), &'static str> {\n\n\n\n let mut did_work = false;\n\n\n\n if let Some(i) = matches.opt_str(\"w\") {\n\n let num_tasks = i.parse::<usize>().map_err(|_e| \"couldn't parse number of num_tasks\")?;\n\n run_whole(num_tasks)?;\n\n did_work = true;\n\n }\n\n\n\n if let Some(i) = matches.opt_str(\"s\") {\n\n let iterations = i.parse::<usize>().map_err(|_e| \"couldn't parse number of num_tasks\")?;\n\n run_single(iterations)?;\n\n did_work = true;\n\n } \n\n\n\n if did_work {\n\n Ok(())\n\n }\n\n else {\n\n println!(\"Nothing was done. Please specify a type of evaluation task to run.\");\n\n print_usage(opts);\n\n Ok(())\n\n }\n\n}\n\n\n\n\n","file_path":"applications/rq_eval/src/lib.rs","rank":37,"score":364208.5968591212},{"content":"pub fn rmain(matches: &Matches, _opts: &Options) -> Result<(), &'static str> {\n\n const TRIES: usize = 10;\n\n let mut mapper_normal = mapper_from_current();\n\n let mut mapper_spillful = MapperSpillful::new();\n\n\n\n let num_mappings = matches.opt_str(\"n\")\n\n .and_then(|i| i.parse::<usize>().ok())\n\n .unwrap_or(100);\n\n\n\n let size_in_pages = matches.opt_str(\"s\")\n\n .and_then(|i| i.parse::<usize>().ok())\n\n .unwrap_or(2);\n\n\n\n let use_spillful = matches.opt_present(\"p\");\n\n let verbose = matches.opt_present(\"v\");\n\n\n\n if num_mappings < 1 { \n\n return Err(\"invalid number of mappings specified.\")\n\n }\n\n\n","file_path":"applications/mm_eval/src/lib.rs","rank":38,"score":364208.5968591211},{"content":"/// Iterates over the contents of the given directory to find crates within it. \n\n/// \n\n/// This directory should contain one .rmeta and .rlib file per crate, \n\n/// and those files are named as such:\n\n/// `\"lib<crate_name>-<hash>.[rmeta]\"`\n\n/// \n\n/// This function only looks at the `.rmeta` files in the given directory \n\n/// and extracts from that file name the name of the crate name as a String.\n\n/// \n\n/// Returns the set of discovered crates as a map, in which the key is the simple crate name \n\n/// (\"my_crate\") and the value is the full crate name with the hash included (\"my_crate-43462c60d48a531a\").\n\n/// The value can be used to define the path to crate's actual .rmeta/.rlib file.\n\nfn populate_crates_from_dir<P: AsRef<Path>>(dir_path: P) -> Result<HashMap<String, String>, io::Error> {\n\n let mut crates: HashMap<String, String> = HashMap::new();\n\n \n\n let dir_iter = WalkDir::new(dir_path)\n\n .into_iter()\n\n .filter_map(|res| res.ok());\n\n\n\n for dir_entry in dir_iter {\n\n if !dir_entry.file_type().is_file() { continue; }\n\n let path = dir_entry.path();\n\n if path.extension().and_then(|p| p.to_str()) == Some(RMETA_FILE_EXTENSION) {\n\n let filestem = path.file_stem().expect(\"no valid file stem\").to_string_lossy();\n\n if filestem.starts_with(\"lib\") {\n\n let crate_name_with_hash = &filestem[PREFIX_END ..];\n\n let crate_name_without_hash = crate_name_with_hash.split('-').next().unwrap();\n\n crates.insert(crate_name_without_hash.to_string(), crate_name_with_hash.to_string());\n\n } else {\n\n return Err(io::Error::new(\n\n io::ErrorKind::Other,\n\n format!(\"File {:?} is an .rmeta file that does not begin with 'lib' as expected.\", path),\n","file_path":"tools/theseus_cargo/src/main.rs","rank":39,"score":362042.4131036053},{"content":"/// Returns the top-level directory that contains all of the namespaces. \n\npub fn get_namespaces_directory() -> Option<DirRef> {\n\n root::get_root().lock().get_dir(NAMESPACES_DIRECTORY_NAME)\n\n}\n\n\n\nlazy_static! {\n\n /// The thread-local storage (TLS) area \"image\" that is used as the initial data for each `Task`.\n\n /// When spawning a new task, the new task will create its own local TLS area\n\n /// with this `TlsInitializer` as the initial data values.\n\n /// \n\n /// # Implementation Notes/Shortcomings\n\n /// Currently, a single system-wide `TlsInitializer` instance is shared across all namespaces.\n\n /// In the future, each namespace should hold its own TLS sections in its TlsInitializer area.\n\n /// \n\n /// However, this is quite complex because each namespace must be aware of the TLS sections\n\n /// in BOTH its underlying recursive namespace AND its (multiple) \"parent\" namespace(s)\n\n /// that recursively depend on it, since no two TLS sections can conflict (have the same offset).\n\n /// \n\n /// Thus, we stick with a singleton `TlsInitializer` instance, which makes sense \n\n /// because it behaves much like an allocator, in that it reserves space (index ranges) in the TLS area.\n\n static ref TLS_INITIALIZER: Mutex<TlsInitializer> = Mutex::new(TlsInitializer::empty());\n\n}\n\n\n\n\n","file_path":"kernel/mod_mgmt/src/lib.rs","rank":40,"score":355910.05587729823},{"content":"pub fn remove_node(args: Vec<String>) -> Result<(), String> {\n\n let mut opts = Options::new();\n\n opts.optflag(\"h\", \"help\", \"print this help menu\");\n\n opts.optflag(\"r\", \"recursive\", \"recursively remove directories and their contents\");\n\n \n\n let matches = match opts.parse(&args) {\n\n Ok(m) => m,\n\n Err(e) => {\n\n print_usage(opts);\n\n return Err(e.to_string());\n\n }\n\n };\n\n\n\n if matches.opt_present(\"h\") {\n\n print_usage(opts);\n\n return Ok(());\n\n }\n\n\n\n\n\n let taskref = match task::get_my_current_task() {\n","file_path":"applications/rm/src/lib.rs","rank":41,"score":355705.60782637005},{"content":"/// Starts the first applications that run in Theseus \n\n/// by creating a new \"default\" application namespace\n\n/// and spawning the first application `Task`(s). \n\n/// \n\n/// Currently this only spawns a shell (terminal),\n\n/// but in the future it could spawn a fuller desktop environment. \n\n/// \n\n/// Kernel initialization routines should be complete before invoking this. \n\npub fn start() -> Result<(), &'static str> {\n\n let new_app_ns = mod_mgmt::create_application_namespace(None)?;\n\n let (shell_file, _ns) = CrateNamespace::get_crate_object_file_starting_with(&new_app_ns, \"shell-\")\n\n .ok_or(\"Couldn't find shell application in default app namespace\")?;\n\n\n\n let path = Path::new(shell_file.lock().get_absolute_path());\n\n info!(\"Starting first application: crate at {:?}\", path);\n\n // Spawn the default shell\n\n spawn::new_application_task_builder(path, Some(new_app_ns))?\n\n .name(\"default_shell\".to_string())\n\n .spawn()?;\n\n\n\n Ok(())\n\n}\n","file_path":"kernel/first_application/src/lib.rs","rank":42,"score":352575.5810519779},{"content":"/// Initializes the tasks virtual filesystem directory within the root directory.\n\npub fn init() -> Result<(), &'static str> {\n\n TaskFs::new()?;\n\n Ok(())\n\n}\n\n\n\n\n\n/// The top level directory that includes a dynamically-generated list of all `Task`s,\n\n/// each comprising a `TaskDir`.\n\n/// This directory exists in the root directory.\n\npub struct TaskFs { }\n\n\n\nimpl TaskFs {\n\n fn new() -> Result<DirRef, &'static str> {\n\n let root = root::get_root();\n\n let dir_ref = Arc::new(Mutex::new(TaskFs { })) as DirRef;\n\n root.lock().insert(FileOrDir::Dir(dir_ref.clone()))?;\n\n Ok(dir_ref)\n\n }\n\n\n\n fn get_self_pointer(&self) -> Option<DirRef> {\n","file_path":"kernel/task_fs/src/lib.rs","rank":43,"score":352315.04485890386},{"content":"/// Iterates over the contents of the given directory to find crates within it. \n\n/// \n\n/// Crates are discovered by looking for a directory that contains a `Cargo.toml` file. \n\n/// \n\n/// Returns the set of unique crate names. \n\nfn populate_crates_from_dir<P: AsRef<Path>>(dir_path: P) -> Result<HashSet<String>, io::Error> {\n\n let mut crates: HashSet<String> = HashSet::new();\n\n \n\n let dir_iter = WalkDir::new(dir_path)\n\n .into_iter()\n\n .filter_map(|res| res.ok());\n\n // .filter(|entry| entry.path().is_file() && entry.path().extension() == Some(object_file_extension))\n\n // .filter_map(|entry| entry.path().file_name()\n\n // .map(|fname| {\n\n // (\n\n // fname.to_string_lossy().to_string().into(), \n\n // entry.path().to_path_buf()\n\n // )\n\n // })\n\n // );\n\n\n\n for dir_entry in dir_iter {\n\n if dir_entry.file_type().is_file() && dir_entry.file_name() == \"Cargo.toml\" {\n\n // the parent of this dir_entry is a crate directory\n\n let parent_crate_dir = dir_entry.path().parent().ok_or_else(|| {\n","file_path":"tools/copy_latest_crate_objects/src/main.rs","rank":44,"score":350284.11635661166},{"content":"/// Changes the priority of the given task with the given priority level.\n\n/// Priority values must be between 40 (maximum priority) and 0 (minimum prriority).\n\n/// This function returns an error when a scheduler without priority is loaded. \n\npub fn set_priority(_task: &TaskRef, _priority: u8) -> Result<(), &'static str> {\n\n #[cfg(priority_scheduler)] {\n\n scheduler_priority::set_priority(_task, _priority)\n\n }\n\n #[cfg(not(priority_scheduler))] {\n\n Err(\"no scheduler that uses task priority is currently loaded\")\n\n }\n\n}\n\n\n","file_path":"kernel/scheduler/src/lib.rs","rank":45,"score":350062.594677154},{"content":"/// Outputs the given section's weak dependents, i.e.,\n\n/// the sections that depend on the given section.\n\n/// \n\n/// If there are multiple matches, this returns an Error containing \n\n/// all of the matching section names separated by the newline character `'\\n'`.\n\nfn sections_dependent_on_me(section_name: &str) -> Result<(), String> {\n\n let sec = find_section(section_name)?;\n\n println!(\"Sections that depend on {} (weak dependents):\", sec.name);\n\n for dependent_sec in sec.inner.read().sections_dependent_on_me.iter().filter_map(|weak_dep| weak_dep.section.upgrade()) {\n\n if verbose!() { \n\n println!(\" {} in {:?}\", dependent_sec.name, dependent_sec.parent_crate.upgrade());\n\n } else {\n\n println!(\" {}\", dependent_sec.name);\n\n }\n\n }\n\n Ok(())\n\n}\n\n\n\n\n","file_path":"applications/deps/src/lib.rs","rank":46,"score":349886.6792293177},{"content":"/// Outputs the given section's strong dependencies, i.e.,\n\n/// the sections that the given section depends on.\n\n/// \n\n/// If there are multiple matches, this returns an Error containing \n\n/// all of the matching section names separated by the newline character `'\\n'`.\n\nfn sections_i_depend_on(section_name: &str) -> Result<(), String> {\n\n let sec = find_section(section_name)?;\n\n println!(\"Sections that {} depends on (strong dependencies):\", sec.name);\n\n for dependency_sec in sec.inner.read().sections_i_depend_on.iter().map(|dep| &dep.section) {\n\n if verbose!() { \n\n println!(\" {} in {:?}\", dependency_sec.name, dependency_sec.parent_crate.upgrade());\n\n } else {\n\n println!(\" {}\", dependency_sec.name);\n\n }\n\n }\n\n Ok(())\n\n}\n\n\n\n\n","file_path":"applications/deps/src/lib.rs","rank":47,"score":349886.6792293177},{"content":"/// Create a new application `CrateNamespace` that uses the default application directory \n\n/// and is structured atop the given `recursive_namespace`. \n\n/// If no `recursive_namespace` is provided, the default initial kernel namespace will be used. \n\n/// \n\n/// # Return\n\n/// The returned `CrateNamespace` will itself be empty, having no crates and no symbols in its map.\n\n/// \n\npub fn create_application_namespace(recursive_namespace: Option<Arc<CrateNamespace>>) -> Result<Arc<CrateNamespace>, &'static str> {\n\n // (1) use the initial kernel CrateNamespace as the new app namespace's recursive namespace if none was provided.\n\n let recursive_namespace = recursive_namespace\n\n .or_else(|| get_initial_kernel_namespace().cloned())\n\n .ok_or(\"initial kernel CrateNamespace not yet initialized\")?;\n\n // (2) get the directory where the default app namespace should have been populated when mod_mgmt was inited.\n\n let default_app_namespace_name = CrateType::Application.default_namespace_name().to_string(); // this will be \"_applications\"\n\n let default_app_namespace_dir = get_namespaces_directory()\n\n .and_then(|ns_dir| ns_dir.lock().get_dir(&default_app_namespace_name))\n\n .ok_or(\"Couldn't find the directory for the default application CrateNamespace\")?;\n\n // (3) create the actual new application CrateNamespace.\n\n let new_app_namespace = Arc::new(CrateNamespace::new(\n\n default_app_namespace_name,\n\n NamespaceDir::new(default_app_namespace_dir),\n\n Some(recursive_namespace),\n\n ));\n\n\n\n Ok(new_app_namespace)\n\n}\n\n\n\n\n","file_path":"kernel/mod_mgmt/src/lib.rs","rank":48,"score":349229.9302905223},{"content":"/// Helper function to allocate memory at required address\n\n/// \n\n/// # Arguments\n\n/// * `mem_base`: starting physical address of the region that need to be allocated\n\n/// * `mem_size_in_bytes`: size of the region that needs to be allocated \n\npub fn allocate_memory(mem_base: PhysicalAddress, mem_size_in_bytes: usize) -> Result<MappedPages, &'static str> {\n\n // set up virtual pages and physical frames to be mapped\n\n let pages_nic = allocate_pages_by_bytes(mem_size_in_bytes)\n\n .ok_or(\"NicInit::mem_map(): couldn't allocate virtual page!\")?;\n\n let frames_nic = allocate_frames_by_bytes_at(mem_base, mem_size_in_bytes)\n\n .map_err(|_e| \"NicInit::mem_map(): couldn't allocate physical frames!\")?;\n\n\n\n // debug!(\"NicInit: memory base: {:#X}, memory size: {}\", mem_base, mem_size_in_bytes);\n\n\n\n let kernel_mmi_ref = get_kernel_mmi_ref().ok_or(\"NicInit::mem_map(): KERNEL_MMI was not yet initialized!\")?;\n\n let mut kernel_mmi = kernel_mmi_ref.lock();\n\n let nic_mapped_page = kernel_mmi.page_table.map_allocated_pages_to(pages_nic, frames_nic, NIC_MAPPING_FLAGS)?;\n\n\n\n Ok(nic_mapped_page)\n\n}\n\n\n","file_path":"kernel/nic_initialization/src/lib.rs","rank":49,"score":346913.2801913284},{"content":"/// Initially maps the base APIC MMIO register frames so that we can know which LAPIC (core) we are.\n\n/// This only does something for apic/xapic systems, it does nothing for x2apic systems, as required.\n\npub fn init(_page_table: &mut PageTable) -> Result<(), &'static str> {\n\n let x2 = has_x2apic();\n\n debug!(\"is x2apic? {}. IA32_APIC_BASE (phys addr): {:X?}\", \n\n x2, PhysicalAddress::new(rdmsr(IA32_APIC_BASE) as usize)\n\n );\n\n\n\n if !x2 {\n\n // Ensure the local apic is enabled in xapic mode, otherwise we'll get a General Protection fault\n\n unsafe { wrmsr(IA32_APIC_BASE, rdmsr(IA32_APIC_BASE) | IA32_APIC_XAPIC_ENABLE); }\n\n }\n\n\n\n Ok(())\n\n}\n\n\n\n\n","file_path":"kernel/apic/src/lib.rs","rank":50,"score":346884.4432456855},{"content":"/// Parses the system's ACPI tables \n\npub fn init(page_table: &mut PageTable) -> Result<(), &'static str> {\n\n // The first step is to search for the RSDP (Root System Descriptor Pointer),\n\n // which contains the physical address of the RSDT/XSDG (Root/Extended System Descriptor Table).\n\n let rsdp = Rsdp::get_rsdp(page_table)?;\n\n let rsdt_phys_addr = rsdp.sdt_address();\n\n debug!(\"RXSDT is located in Frame {:#X}\", rsdt_phys_addr);\n\n\n\n // Now, we get the actual RSDT/XSDT\n\n {\n\n let mut acpi_tables = ACPI_TABLES.lock();\n\n let (sdt_signature, sdt_total_length) = acpi_tables.map_new_table(rsdt_phys_addr, page_table)?;\n\n acpi_table_handler(&mut acpi_tables, sdt_signature, sdt_total_length, rsdt_phys_addr)?;\n\n }\n\n let sdt_addresses: Vec<PhysicalAddress> = {\n\n let acpi_tables = ACPI_TABLES.lock();\n\n let rxsdt = rsdt::RsdtXsdt::get(&acpi_tables).ok_or(\"couldn't get RSDT or XSDT from ACPI tables\")?;\n\n rxsdt.addresses().collect()\n\n };\n\n\n\n // The RSDT/XSDT tells us where all of the rest of the ACPI tables exist.\n","file_path":"kernel/acpi/src/lib.rs","rank":51,"score":346879.1935156811},{"content":"/// Spawns an idle task on the given `core` if specified, otherwise on the current core. \n\n/// Then, it adds adds the new idle task to that core's runqueue.\n\npub fn create_idle_task(core: Option<u8>) -> Result<TaskRef, &'static str> {\n\n let apic_id = core.unwrap_or_else(|| get_my_apic_id());\n\n debug!(\"Spawning a new idle task on core {}\", apic_id);\n\n\n\n new_task_builder(dummy_idle_task, apic_id)\n\n .name(format!(\"idle_task_core_{}\", apic_id))\n\n .idle(apic_id)\n\n .spawn_restartable()\n\n}\n\n\n\n/// Dummy `idle_task` to be used if original `idle_task` crashes.\n\n/// \n\n/// Note: the current spawn API does not support spawning a task with the return type `!`,\n\n/// so we use `()` here instead. \n","file_path":"kernel/spawn/src/lib.rs","rank":52,"score":345838.73017929215},{"content":"/// A convenience function to poll the given network interface (i.e., flush tx/rx).\n\n/// Returns true if any packets were sent or received through that interface on the given `sockets`.\n\npub fn poll_iface(iface: &NetworkInterfaceRef, sockets: &mut SocketSet, startup_time: u64) -> Result<bool, &'static str> {\n\n let timestamp: i64 = millis_since(startup_time)?\n\n .try_into()\n\n .map_err(|_e| \"millis_since() u64 timestamp was larger than i64\")?;\n\n // debug!(\"calling iface.poll() with timestamp: {:?}\", timestamp);\n\n let packets_were_sent_or_received = match iface.lock().poll(sockets, Instant::from_millis(timestamp)) {\n\n Ok(b) => b,\n\n Err(err) => {\n\n warn!(\"smoltcp_helper: poll error: {}\", err);\n\n false\n\n }\n\n };\n\n Ok(packets_were_sent_or_received)\n\n}\n","file_path":"kernel/smoltcp_helper/src/lib.rs","rank":53,"score":345757.92634408025},{"content":"/// Convenience function that removes the given `file` from its parent directory \n\n/// and inserts it into the given destination directory. \n\n/// \n\n/// # Return\n\n/// If the file ends up replacing a file/dir node in the `dest_dir`, this returns a tuple of:\n\n/// 1. The node that was in the `dest_dir` that got replaced by the given `file`,\n\n/// 2. The parent directory that originally contained the given `file`. This is useful for realizing a file \"swap\" operation.\n\n/// \n\n/// # Locking / Deadlock\n\n/// This function obtains the lock on both `file`, the `file`'s parent directory, and the `dest_dir`. \n\nfn move_file(file: &FileRef, dest_dir: &DirRef) -> Result<Option<(FileOrDir, DirRef)>, &'static str> {\n\n let parent = file.lock().get_parent_dir().ok_or(\"couldn't get file's parent directory\")?;\n\n // This section is redundent as it is checked before calling the function\n\n // if Arc::ptr_eq(&parent, dest_dir) {\n\n // #[cfg(not(downtime_eval))]\n\n // trace!(\"swap_crates::move_file(): skipping move between same directory {:?} for file {:?}\", \n\n // dest_dir.try_lock().map(|f| f.get_absolute_path()), file.try_lock().map(|f| f.get_absolute_path())\n\n // );\n\n // return Ok(None);\n\n // }\n\n\n\n // Perform the actual move operation.\n\n let mut removed_file = parent.lock().remove(&FileOrDir::File(Arc::clone(file))).ok_or(\"Couldn't remove file from its parent directory\")?;\n\n removed_file.set_parent_dir(Arc::downgrade(dest_dir));\n\n let res = dest_dir.lock().insert(removed_file.clone());\n\n \n\n // Log success or failure\n\n match res {\n\n Ok(replaced_file) => {\n\n #[cfg(not(any(loscd_eval, downtime_eval)))]\n","file_path":"kernel/crate_swap/src/lib.rs","rank":54,"score":345718.62232842157},{"content":"pub fn rmain(matches: &Matches, _opts: Options, address: IpAddress) -> Result<(), &'static str> {\n\n\n\n \n\n let mut count = 4;\n\n let mut interval = 1000;\n\n let mut timeout = 5000;\n\n let mut buffer_size = 40;\n\n let mut verbose = false;\n\n let did_work = true;\n\n\n\n\n\n if let Some(i) = matches.opt_default(\"c\", \"4\") {\n\n count = i.parse::<usize>().map_err(|_e| \"couldn't parse number of packets\")?;\n\n }\n\n if let Some(i) = matches.opt_default(\"i\", \"1000\") {\n\n interval = i.parse::<u64>().map_err(|_e| \"couldn't parse interval\")?;\n\n }\n\n if let Some(i) = matches.opt_default(\"t\", \"5000\") {\n\n timeout = i.parse::<u64>().map_err(|_e| \"couldn't parse timeout length\")?;\n\n }\n","file_path":"applications/ping/src/lib.rs","rank":55,"score":345240.7451861227},{"content":"pub fn main(_args: Vec<String>) -> isize {\n\n print_fault_log();\n\n 0\n\n}\n","file_path":"applications/print_fault_log/src/lib.rs","rank":56,"score":345088.5538016539},{"content":"fn num_deps_section(section_name: &str) -> Result<(), String> {\n\n let section = find_section(section_name)?;\n\n let (s, w, i) = section_dependency_count(§ion);\n\n println!(\"Section {}'s Dependency Count:\\nStrong: {}\\nWeak: {}\\nIntrnl: {}\", section_name, s, w, i);\n\n Ok(())\n\n}\n\n\n","file_path":"applications/deps/src/lib.rs","rank":57,"score":344679.71595668735},{"content":"/// Wrapper function used to measure file read and file read with open. \n\n/// Accepts a bool argument. If true includes the latency to open a file\n\n/// If false only measure the time to read from file.\n\n/// Actual measuring is deferred to `do_fs_read_with_size` function\n\nfn do_fs_read(with_open: bool) -> Result<(), &'static str>{\n\n\tlet fsize_kb = 1024;\n\n\tprintlninfo!(\"File size : {} KB\", fsize_kb);\n\n\tprintlninfo!(\"Read buf size : {} KB\", READ_BUF_SIZE / 1024);\n\n\tprintlninfo!(\"========================================\");\n\n\n\n\tlet overhead_ct = hpet_timing_overhead()?;\n\n\n\n\tdo_fs_read_with_size(overhead_ct, fsize_kb, with_open)?;\n\n\tif with_open {\n\n\t\tprintlninfo!(\"This test is equivalent to `bw_file_rd open2close` in LMBench\");\n\n\t} else {\n\n\t\tprintlninfo!(\"This test is equivalent to `bw_file_rd io_only` in LMBench\");\n\n\t}\n\n\tOk(())\n\n}\n\n\n","file_path":"applications/bm/src/lib.rs","rank":58,"score":343959.0617462259},{"content":"fn kill_task(task_id: usize, reap: bool) -> Result<(), String> {\n\n if let Some(task_ref) = task::get_task(task_id) {\n\n if task_ref.kill(task::KillReason::Requested)\n\n .and_then(|_| runqueue::remove_task_from_all(&task_ref))\n\n .is_ok() \n\n {\n\n println!(\"Killed task {}\", &*task_ref);\n\n if reap {\n\n match task_ref.take_exit_value() {\n\n Some(exit_val) => { \n\n println!(\"Reaped task {}, got exit value {}\", task_id, debugit!(exit_val));\n\n Ok(())\n\n }\n\n _ => {\n\n Err(format!(\"Failed to reap task {}\", task_id))\n\n }\n\n }\n\n } \n\n else {\n\n // killed the task successfully, no reap request, so return success.\n","file_path":"applications/kill/src/lib.rs","rank":59,"score":342342.30175521155},{"content":"/// Allocates memory for the NIC registers\n\n/// \n\n/// # Arguments \n\n/// * `dev`: reference to pci device \n\n/// * `mem_base`: starting physical address of the device's memory mapped registers\n\npub fn allocate_device_register_memory(dev: &PciDevice, mem_base: PhysicalAddress) -> Result<MappedPages, &'static str> {\n\n //find out amount of space needed\n\n let mem_size_in_bytes = dev.determine_mem_size(0) as usize;\n\n\n\n allocate_memory(mem_base, mem_size_in_bytes)\n\n}\n\n\n","file_path":"kernel/nic_initialization/src/lib.rs","rank":60,"score":342225.3246529746},{"content":"fn run(filename: String) -> Result<(), String> {\n\n\n\n // Acquire key event queue.\n\n let key_event_queue = app_io::take_key_event_queue()?;\n\n let key_event_queue = (*key_event_queue).as_ref()\n\n .ok_or(\"failed to take key event reader\")?;\n\n\n\n // Read the whole file to a String.\n\n let content = get_content_string(filename)?;\n\n\n\n // Get it run.\n\n let map = parse_content(&content)?;\n\n\n\n Ok(event_handler_loop(&content, &map, key_event_queue)?)\n\n}\n\n\n","file_path":"applications/less/src/lib.rs","rank":61,"score":341494.9911143106},{"content":"/// Read the whole file to a String.\n\nfn get_content_string(file_path: String) -> Result<String, String> {\n\n let taskref = match task::get_my_current_task() {\n\n Some(t) => t,\n\n None => {\n\n return Err(\"failed to get current task\".to_string());\n\n }\n\n };\n\n\n\n // grabs the current working directory pointer; this is scoped so that we drop the lock on the task as soon as we get the working directory pointer\n\n let curr_wr = Arc::clone(&taskref.get_env().lock().working_dir);\n\n let path = Path::new(file_path);\n\n \n\n // navigate to the filepath specified by first argument\n\n match path.get(&curr_wr) {\n\n Some(file_dir_enum) => { \n\n match file_dir_enum {\n\n FileOrDir::Dir(directory) => {\n\n Err(format!(\"{:?} is a directory, cannot 'less' non-files.\", directory.lock().get_name()))\n\n }\n\n FileOrDir::File(file) => {\n","file_path":"applications/less/src/lib.rs","rank":62,"score":341229.3003963408},{"content":"/// Convenience function for converting a byte stream\n\n/// that is delimited by newlines into a list of Strings.\n\npub fn as_lines(bytes: &[u8]) -> Result<Vec<String>, &'static str> {\n\n str::from_utf8(bytes)\n\n .map_err(|_e| \"couldn't convert file into a UTF8 string\")\n\n .map(|files| files.lines().map(|s| String::from(s)).collect())\n\n}\n\n\n\n\n\n/// A representation of an diff file used to define an evolutionary crate swapping update.\n\npub struct Diff {\n\n /// A list of tuples in which the first element is the old crate and the second element is the new crate.\n\n /// If the first element is the empty string, the second element is a new addition (replacing nothing),\n\n /// and if the second element is the empty string, the first element is to be removed without replacement.\n\n pub pairs: Vec<(String, String)>,\n\n /// The list of state transfer functions which should be applied at the end of a crate swapping operation.\n\n pub state_transfer_functions: Vec<String>,\n\n}\n\n\n\n\n","file_path":"kernel/ota_update_client/src/lib.rs","rank":64,"score":335697.1878498163},{"content":"/// Measures the overhead of using the hpet timer. \n\n/// Calls `timing_overhead_inner` multiple times and averages the value. \n\n/// Overhead is a count value. It is not time. \n\npub fn hpet_timing_overhead() -> Result<u64, &'static str> {\n\n\tconst TRIES: u64 = 10;\n\n\tlet mut tries: u64 = 0;\n\n\tlet mut max: u64 = core::u64::MIN;\n\n\tlet mut min: u64 = core::u64::MAX;\n\n\n\n\tfor _ in 0..TRIES {\n\n\t\tlet overhead = hpet_timing_overhead_inner()?;\n\n\t\ttries += overhead;\n\n\t\tif overhead > max {max = overhead;}\n\n\t\tif overhead < min {min = overhead;}\n\n\t}\n\n\n\n\tlet overhead = tries / TRIES as u64;\n\n\tlet err = (overhead * 10 + overhead * THRESHOLD_ERROR_RATIO) / 10;\n\n\tif \tmax - overhead > err || overhead - min > err {\n\n\t\twarn!(\"hpet_timing_overhead diff is too big: {} ({} - {}) ctr\", max-min, max, min);\n\n\t}\n\n\tinfo!(\"HPET timing overhead is {} ticks\", overhead);\n\n\tOk(overhead)\n\n}\n\n\n","file_path":"kernel/libtest/src/lib.rs","rank":65,"score":335566.3317660459},{"content":"/// Returns the frequency of the TSC for the system, \n\n/// currently measured using the PIT clock for calibration.\n\npub fn get_tsc_frequency() -> Result<u128, &'static str> {\n\n // this is a soft state, so it's not a form of state spill\n\n static TSC_FREQUENCY: AtomicUsize = AtomicUsize::new(0);\n\n\n\n let freq = TSC_FREQUENCY.load(Ordering::SeqCst) as u128;\n\n \n\n if freq != 0 {\n\n Ok(freq)\n\n }\n\n else {\n\n // a freq of zero means it hasn't yet been initialized.\n\n let start = tsc_ticks();\n\n // wait 10000 us (10 ms)\n\n pit_clock::pit_wait(10000)?;\n\n let end = tsc_ticks(); \n\n\n\n let diff = end.sub(&start).ok_or(\"couldn't subtract end-start TSC tick values\")?;\n\n let tsc_freq = diff.into() * 100; // multiplied by 100 because we measured a 10ms interval\n\n info!(\"TSC frequency calculated by PIT is: {}\", tsc_freq);\n\n TSC_FREQUENCY.store(tsc_freq as usize, Ordering::Release);\n\n Ok(tsc_freq)\n\n }\n\n}\n","file_path":"kernel/tsc/src/lib.rs","rank":66,"score":335512.40827376756},{"content":"/// returns Ok(()) if everything was handled properly.\n\n/// Otherwise, returns an error string.\n\npub fn handle_keyboard_input(scan_code: u8, extended: bool) -> Result<(), &'static str> {\n\n // SAFE: no real race conditions with keyboard presses\n\n let modifiers = unsafe { &mut KBD_MODIFIERS };\n\n // debug!(\"KBD_MODIFIERS before {}: {:?}\", scan_code, modifiers);\n\n\n\n // first, update the modifier keys\n\n match scan_code {\n\n x if x == Keycode::Control as u8 => { \n\n modifiers.insert(if extended { KeyboardModifiers::CONTROL_RIGHT } else { KeyboardModifiers::CONTROL_LEFT});\n\n }\n\n x if x == Keycode::Alt as u8 => { modifiers.insert(KeyboardModifiers::ALT); }\n\n x if x == Keycode::LeftShift as u8 => { modifiers.insert(KeyboardModifiers::SHIFT_LEFT); }\n\n x if x == Keycode::RightShift as u8 => { modifiers.insert(KeyboardModifiers::SHIFT_RIGHT); }\n\n x if x == Keycode::SuperKeyLeft as u8 => { modifiers.insert(KeyboardModifiers::SUPER_KEY_LEFT); }\n\n x if x == Keycode::SuperKeyRight as u8 => { modifiers.insert(KeyboardModifiers::SUPER_KEY_RIGHT); }\n\n\n\n x if x == Keycode::Control as u8 + KEY_RELEASED_OFFSET => {\n\n modifiers.remove(if extended { KeyboardModifiers::CONTROL_RIGHT } else { KeyboardModifiers::CONTROL_LEFT});\n\n }\n\n x if x == Keycode::Alt as u8 + KEY_RELEASED_OFFSET => { modifiers.remove(KeyboardModifiers::ALT); }\n","file_path":"kernel/keyboard/src/lib.rs","rank":67,"score":331859.0676609294},{"content":"/// Crate names must be only alphanumeric characters, an underscore, or a dash.\n\n/// \n\n/// See: <https://www.reddit.com/r/rust/comments/4rlom7/what_characters_are_allowed_in_a_crate_name/>\n\npub fn is_valid_crate_name_char(c: char) -> bool {\n\n char::is_alphanumeric(c) || \n\n c == '_' || \n\n c == '-'\n\n}\n\n\n","file_path":"kernel/crate_name_utils/src/lib.rs","rank":68,"score":330602.76959084754},{"content":"/// Returns a reference to the current task.\n\npub fn get_my_current_task() -> Option<&'static TaskRef> {\n\n get_task_local_data().map(|tld| &tld.current_taskref)\n\n}\n\n\n","file_path":"kernel/task/src/lib.rs","rank":69,"score":328585.5125592143},{"content":"/// Parses a series of diff lines into a representation of an update diff.\n\n/// \n\n/// # Arguments\n\n/// * `diffs`: a list of lines, in which each line is a diff entry.\n\n/// \n\n/// # Example diff entry formats\n\n/// ```\n\n/// a#ps.o -> a#ps.o\n\n/// k#runqueue-d04869f0baadb1bd.o -> k#runqueue-d04869f0baadb1bd.o\n\n/// - k#scheduler-7f6134ffbb934a27.o\n\n/// + k#spawn-f1c87a8fc4e03893.o\n\n/// ```\n\npub fn parse_diff_lines(diffs: &Vec<String>) -> Result<Diff, &'static str> {\n\n let mut pairs: Vec<(String, String)> = Vec::with_capacity(diffs.len());\n\n let mut state_transfer_functions: Vec<String> = Vec::new();\n\n for diff in diffs {\n\n // addition of new crate\n\n if diff.starts_with(\"+\") {\n\n pairs.push((\n\n String::new(), \n\n diff.get(1..).ok_or(\"error parsing (+) diff line\")?.trim().to_string(),\n\n ));\n\n } \n\n // removal of old crate\n\n else if diff.starts_with(\"-\") {\n\n pairs.push((\n\n diff.get(1..).ok_or(\"error parsing (-) diff line\")?.trim().to_string(), \n\n String::new()\n\n ));\n\n }\n\n // replacement of old crate with new crate\n\n else if let Some((old, new)) = diff.split(\"->\").collect_tuple() {\n","file_path":"kernel/ota_update_client/src/lib.rs","rank":70,"score":327292.949210211},{"content":"/// Adds the (child application's task ID, parent terminal print_producer) key-val pair to the map \n\n/// Simulates connecting an output stream to the application\n\npub fn add_child(child_task_id: usize, print_producer: DFQueueProducer<Event>) -> Result<(), &'static str> {\n\n TERMINAL_PRINT_PRODUCERS.lock().insert(child_task_id, print_producer);\n\n Ok(())\n\n}\n\n\n","file_path":"kernel/terminal_print/src/lib.rs","rank":71,"score":326550.2272909797},{"content":"fn run() -> Result<(), &'static str> {\n\n let stdout = app_io::stdout()?;\n\n let mut stdout_locked = stdout.lock();\n\n let queue = app_io::take_key_event_queue()?;\n\n let queue = (*queue).as_ref().ok_or(\"failed to get key event reader\")?;\n\n let ack = \"event received\\n\".as_bytes();\n\n\n\n stdout_locked.write_all(\n\n format!(\"{}\\n{}\\n{}\\n\\n\",\n\n \"Acknowledge upon receiving a keyboard event.\",\n\n \"Note that one keyboard strike contains at least one pressing event and one releasing event.\",\n\n \"Press `q` to exit.\"\n\n ).as_bytes()\n\n )\n\n .or(Err(\"failed to perform write_all\"))?;\n\n\n\n // Print an acknowledge message to the screen.\n\n // Note that one keyboard strike contains at least two events:\n\n // one pressing event and one releasing event.\n\n loop {\n\n if let Some(key_event) = queue.read_one() {\n\n stdout_locked.write_all(&ack).or(Err(\"failed to perform write_all\"))?;\n\n if key_event.keycode == Keycode::Q { break; }\n\n }\n\n scheduler::schedule();\n\n }\n\n\n\n Ok(())\n\n}\n","file_path":"applications/keyboard_echo/src/lib.rs","rank":72,"score":323573.5601910429},{"content":"fn run() -> Result<(), &'static str> {\n\n let mut stdin = app_io::stdin()?;\n\n let stdout = app_io::stdout()?;\n\n let mut stdout_locked = stdout.lock();\n\n\n\n stdout_locked.write_all(\n\n format!(\"{}\\n{}\\n\\n\",\n\n \"Echo upon receiving a new input line.\",\n\n \"Press `ctrl-D` to exit cleanly.\"\n\n ).as_bytes()\n\n )\n\n .or(Err(\"failed to perform write_all\"))?;\n\n\n\n let mut buf = String::new();\n\n\n\n // Read a line and print it back.\n\n loop {\n\n let cnt = stdin.read_line(&mut buf).or(Err(\"failed to perform read_line\"))?;\n\n if cnt == 0 { break; }\n\n stdout_locked.write_all(buf.as_bytes())\n\n .or(Err(\"faileld to perform write_all\"))?;\n\n buf.clear();\n\n }\n\n Ok(())\n\n}\n","file_path":"applications/input_echo/src/lib.rs","rank":73,"score":323573.56019104295},{"content":"/// Returns the first network interface available in the system.\n\npub fn get_default_iface() -> Result<NetworkInterfaceRef, &'static str> {\n\n NETWORK_INTERFACES.lock()\n\n .iter()\n\n .next()\n\n .cloned()\n\n .ok_or_else(|| \"no network interfaces available\")\n\n}\n\n\n","file_path":"kernel/smoltcp_helper/src/lib.rs","rank":74,"score":321388.0530333385},{"content":"/// Finds the addresses in memory of the main kernel sections, as specified by the given boot information. \n\n/// \n\n/// Returns the following tuple, if successful:\n\n/// * The combined size and address bounds of key sections, e.g., .text, .rodata, .data.\n\n/// Each of the these section bounds is aggregated to cover the bounds and sizes of *all* sections \n\n/// that share the same page table mapping flags and can thus be logically combined.\n\n/// * The list of all individual sections found. \n\npub fn find_section_memory_bounds(boot_info: &BootInformation) -> Result<(AggregatedSectionMemoryBounds, [Option<SectionMemoryBounds>; 32]), &'static str> {\n\n let elf_sections_tag = boot_info.elf_sections_tag().ok_or(\"no Elf sections tag present!\")?;\n\n\n\n let mut index = 0;\n\n let mut text_start: Option<(VirtualAddress, PhysicalAddress)> = None;\n\n let mut text_end: Option<(VirtualAddress, PhysicalAddress)> = None;\n\n let mut rodata_start: Option<(VirtualAddress, PhysicalAddress)> = None;\n\n let mut rodata_end: Option<(VirtualAddress, PhysicalAddress)> = None;\n\n let mut data_start: Option<(VirtualAddress, PhysicalAddress)> = None;\n\n let mut data_end: Option<(VirtualAddress, PhysicalAddress)> = None;\n\n let mut stack_start: Option<(VirtualAddress, PhysicalAddress)> = None;\n\n let mut stack_end: Option<(VirtualAddress, PhysicalAddress)> = None;\n\n let mut page_table_start: Option<(VirtualAddress, PhysicalAddress)> = None;\n\n let mut page_table_end: Option<(VirtualAddress, PhysicalAddress)> = None;\n\n\n\n let mut text_flags: Option<EntryFlags> = None;\n\n let mut rodata_flags: Option<EntryFlags> = None;\n\n let mut data_flags: Option<EntryFlags> = None;\n\n\n\n let mut sections_memory_bounds: [Option<SectionMemoryBounds>; 32] = Default::default();\n","file_path":"kernel/memory_x86_64/src/lib.rs","rank":75,"score":320351.9671537116},{"content":"/// Sets the kill handler function for the current `Task`\n\npub fn set_my_kill_handler(handler: KillHandler) -> Result<(), &'static str> {\n\n get_my_current_task()\n\n .ok_or(\"couldn't get_my_current_task\")\n\n .map(|taskref| taskref.set_kill_handler(handler))\n\n}\n\n\n\n\n\n/// The list of possible reasons that a given `Task` was killed prematurely.\n\n#[derive(Debug)]\n\npub enum KillReason {\n\n /// The user or another task requested that this `Task` be killed. \n\n /// For example, the user pressed `Ctrl + C` on the shell window that started a `Task`.\n\n Requested,\n\n /// A Rust-level panic occurred while running this `Task`.\n\n Panic(PanicInfoOwned),\n\n /// A non-language-level problem, such as a Page Fault or some other machine exception.\n\n /// The number of the exception is included, e.g., 15 (0xE) for a Page Fault.\n\n Exception(u8),\n\n}\n\nimpl fmt::Display for KillReason {\n","file_path":"kernel/task/src/lib.rs","rank":76,"score":319958.4331707658},{"content":"/// This function saves the current CPU register values onto the stack (to preserve them)\n\n/// and then invokes the given closure with those registers as the argument.\n\n/// \n\n/// In general, this is useful for jumpstarting the unwinding procedure,\n\n/// since we have to start from the current call frame and work backwards up the call stack \n\n/// while applying the rules for register value changes in each call frame\n\n/// in order to arrive at the proper register values for a prior call frame.\n\npub fn invoke_with_current_registers<F>(f: F) -> Result<(), &'static str> \n\n where F: FuncWithRegisters \n\n{\n\n let f: RefFuncWithRegisters = &f;\n\n let result = unsafe { \n\n let res_ptr = unwind_trampoline(&f);\n\n let res_boxed = Box::from_raw(res_ptr);\n\n *res_boxed\n\n };\n\n return result;\n\n // this is the end of the code in this function, the following is just inner functions.\n\n\n\n\n\n /// This is an internal assembly function used by `invoke_with_current_registers()` \n\n /// that saves the current register values by pushing them onto the stack\n\n /// before invoking the function \"unwind_recorder\" with those register values as the only argument.\n\n /// This is needed because the unwind info tables describe register values as operations (offsets/addends)\n\n /// that are relative to the current register values, so we must have those current values as a starting point.\n\n /// \n\n /// The argument is a pointer to a function reference, so effectively a pointer to a pointer. \n","file_path":"kernel/unwind/src/lib.rs","rank":77,"score":319590.59352102946},{"content":"fn run() -> Result<(), &'static str> {\n\n app_io::request_stdin_instant_flush()?;\n\n let stdin = app_io::stdin()?;\n\n let stdout = app_io::stdout()?;\n\n let mut buf = [0u8];\n\n\n\n // Can lock them at the same time. Won't run into deadlock.\n\n let mut stdin_locked = stdin.lock();\n\n let mut stdout_locked = stdout.lock();\n\n\n\n stdout_locked.write_all(\n\n format!(\"{}\\n{}\\n\\n\",\n\n \"Echo upon receiving a character input.\",\n\n \"Press `ctrl-D` to exit cleanly.\"\n\n ).as_bytes()\n\n )\n\n .or(Err(\"failed to perform write_all\"))?;\n\n\n\n loop {\n\n let byte_num = stdin_locked.read(&mut buf).or(Err(\"failed to invoke read\"))?;\n\n if byte_num == 0 { break; }\n\n stdout_locked.write_all(&buf).or(Err(\"failed to invoke write_all\"))?;\n\n }\n\n stdout_locked.write_all(&['\\n' as u8]).or(Err(\"failed to invoke write_all\"))?;\n\n Ok(())\n\n}\n","file_path":"applications/immediate_input_echo/src/lib.rs","rank":78,"score":318993.6638906435},{"content":"/// Downloads all of the new or changed crates from the `diff` file of the \n\nfn download(remote_endpoint: IpEndpoint, update_build: &str, crate_list: Option<&[String]>) -> Result<(), String> {\n\n let iface = get_default_iface()?;\n\n println!(\"Downloading crates...\");\n\n let crate_list = if crate_list == Some(&[]) { None } else { crate_list };\n\n\n\n let mut diff_file_lines: Option<Vec<String>> = None;\n\n\n\n let crates = if let Some(crate_list) = crate_list {\n\n let crate_set = crate_list.iter().cloned().collect::<BTreeSet<String>>();\n\n ota_update_client::download_crates(&iface, remote_endpoint, update_build, crate_set).map_err(|e| e.to_string())?\n\n } else {\n\n let diff_lines = ota_update_client::download_diff(&iface, remote_endpoint, update_build)\n\n .map_err(|e| format!(\"failed to download diff file for {}, error: {}\", update_build, e))?;\n\n let diff = ota_update_client::parse_diff_lines(&diff_lines).map_err(|e| e.to_string())?;\n\n\n\n // download all of the new crates\n\n let new_crates_to_download: BTreeSet<String> = diff.pairs.iter().map(|(_old, new)| new.clone()).collect();\n\n let crates = ota_update_client::download_crates(&iface, remote_endpoint, update_build, new_crates_to_download).map_err(|e| e.to_string())?;\n\n diff_file_lines = Some(diff_lines);\n\n crates\n","file_path":"applications/upd/src/lib.rs","rank":79,"score":316468.89862397197},{"content":"/// Convenience function for writing a simple string to the logger.\n\n///\n\n/// If the logger has not yet been initialized, no log messages will be emitted.\n\n/// and an `Error` will be returned.\n\npub fn write_str(s: &str) -> fmt::Result {\n\n crate::write_fmt(format_args!(\"{}\", s))\n\n}\n\n\n\n\n\n/// ANSI style codes for basic colors.\n","file_path":"kernel/logger/src/lib.rs","rank":80,"score":315215.8892302605},{"content":"fn crate_name_without_hash<'s>(name: &'s str) -> &'s str {\n\n name.split(\"-\")\n\n .next()\n\n .unwrap_or_else(|| name)\n\n}\n\n\n\n\n","file_path":"tools/diff_crates/src/main.rs","rank":82,"score":310764.67697308},{"content":"/// Initialization function that enables the PMU if one is available.\n\n/// We initialize the 3 fixed PMCs and general purpose PMCs. Calling this initialization function again\n\n/// on a core that has already been initialized will do nothing.\n\n/// \n\n/// Currently we support a maximum core ID of 255, and up to 8 general purpose counters per core. \n\n/// A core ID greater than 255 is not supported in Theseus in general since the ID has to fit within a u8.\n\n/// \n\n/// If the core ID limit is changed and we need to update the PMU data structures to support more cores then: \n\n/// - Increase WORDS_IN_BITMAP and CORES_SUPPORTED_BY_PMU as required. For example, the cores supported is 256 so there are 4 64-bit words in the bitmap, one bit per core. \n\n/// - Add additional AtomicU64 variables to the initialization of the CORES_SAMPLING and RESULTS_READY bitmaps. \n\n/// \n\n/// If the general purpose PMC limit is reached then: \n\n/// - Update PMCS_SUPPORTED_BY_PMU to the new PMC limit.\n\n/// - Change the element type in the PMCS_AVAILABLE vector to be larger than AtomicU8 so that there is one bit per counter.\n\n/// - Update INIT_PMCS_AVAILABLE to the new maximum value for the per core bitmap.\n\n/// \n\n/// # Warning\n\n/// This function should only be called after all the cores have been booted up.\n\npub fn init() -> Result<(), &'static str> {\n\n let mut cores_initialized = CORES_INITIALIZED.lock();\n\n let core_id = apic::get_my_apic_id();\n\n\n\n if cores_initialized.contains(&core_id) {\n\n warn!(\"PMU has already been intitialized on core {}\", core_id);\n\n return Ok(());\n\n } \n\n else {\n\n\n\n if *PMU_VERSION >= MIN_PMU_VERSION {\n\n \n\n if greater_core_id_than_expected()? {\n\n return Err(\"pmu_x86: There are larger core ids in this machine than can be handled by the existing structures which store information about the PMU\");\n\n }\n\n\n\n if more_pmcs_than_expected(*NUM_PMC)? {\n\n return Err(\"pmu_x86: There are more general purpose PMCs in this machine than can be handled by the existing structures which store information about the PMU\");\n\n }\n\n\n","file_path":"kernel/pmu_x86/src/lib.rs","rank":83,"score":308215.64918284403},{"content":"/// reset the mouse\n\npub fn reset_mouse() -> Result<(), &'static str> {\n\n if let Err(_e) = command_to_mouse(0xFF) {\n\n Err(\"reset mouse failled please try again\")\n\n } else {\n\n for _x in 0..14 {\n\n let more_bytes = ps2_read_data();\n\n if more_bytes == 0xAA {\n\n // command reset mouse succeeded\n\n return Ok(());\n\n }\n\n }\n\n warn!(\"disable streaming failed\");\n\n Err(\"fail to command reset mouse fail!!!\")\n\n }\n\n}\n\n\n","file_path":"kernel/ps2/src/lib.rs","rank":84,"score":308198.372075957},{"content":"pub fn do_threadtest() -> Result<(), &'static str> {\n\n\n\n let nthreads = NTHREADS.load(Ordering::SeqCst);\n\n let mut tries = Vec::with_capacity(TRIES as usize);\n\n\n\n let hpet_overhead = hpet_timing_overhead()?;\n\n let hpet = get_hpet().ok_or(\"couldn't get HPET timer\")?;\n\n\n\n println!(\"Running threadtest for {} threads, {} iterations, {} total objects allocated every iteration by all threads, {} obj size ...\", \n\n nthreads, NITERATIONS.load(Ordering::SeqCst), NOBJECTS.load(Ordering::SeqCst), OBJSIZE.load(Ordering::SeqCst));\n\n\n\n #[cfg(direct_access_to_multiple_heaps)]\n\n {\n\n let overhead = overhead_of_accessing_multiple_heaps()?;\n\n println!(\"Overhead of accessing multiple heaps is: {} ticks, {} ns\", overhead, hpet_2_us(overhead));\n\n }\n\n\n\n for try in 0..TRIES {\n\n let mut threads = Vec::with_capacity(nthreads);\n\n\n","file_path":"applications/heap_eval/src/threadtest.rs","rank":85,"score":308198.372075957},{"content":"/// resend the most recent packet again\n\npub fn mouse_resend() -> Result<(), &'static str> {\n\n if let Err(_e) = command_to_mouse(0xFE) {\n\n Err(\"mouse resend request failled, please request again\")\n\n } else {\n\n // mouse resend request succeeded\n\n Ok(())\n\n }\n\n}\n\n\n","file_path":"kernel/ps2/src/lib.rs","rank":86,"score":308198.372075957},{"content":"pub fn do_shbench() -> Result<(), &'static str> {\n\n\n\n let nthreads = NTHREADS.load(Ordering::SeqCst);\n\n let niterations = NITERATIONS.load(Ordering::SeqCst);\n\n let mut tries = Vec::with_capacity(TRIES as usize);\n\n\n\n let hpet_overhead = hpet_timing_overhead()?;\n\n let hpet = get_hpet().ok_or(\"couldn't get HPET timer\")?;\n\n\n\n println!(\"Running shbench for {} threads, {} total iterations, {} iterations per thread, {} total objects allocated by all threads, {} max block size, {} min block size ...\", \n\n nthreads, niterations, niterations/nthreads, ALLOCATIONS_PER_ITER * niterations, MAX_BLOCK_SIZE.load(Ordering::SeqCst), MIN_BLOCK_SIZE.load(Ordering::SeqCst));\n\n \n\n #[cfg(direct_access_to_multiple_heaps)]\n\n {\n\n let overhead = overhead_of_accessing_multiple_heaps()?;\n\n println!(\"Overhead of accessing multiple heaps is: {} ticks, {} ns\", overhead, hpet_2_us(overhead));\n\n }\n\n\n\n for try in 0..TRIES {\n\n\n","file_path":"applications/heap_eval/src/shbench.rs","rank":87,"score":308198.372075957},{"content":"/// Sets the current core's TSS privilege stack 0 (RSP0) entry, which points to the stack that \n\n/// the x86_64 hardware automatically switches to when transitioning from Ring 3 -> Ring 0.\n\n/// Should be set to an address within the current userspace task's kernel stack.\n\n/// WARNING: If set incorrectly, the OS will crash upon an interrupt from userspace into kernel space!!\n\npub fn tss_set_rsp0(new_privilege_stack_top: VirtualAddress) -> Result<(), &'static str> {\n\n let my_apic_id = apic::get_my_apic_id();\n\n let mut tss_entry = TSS.get(&my_apic_id).ok_or_else(|| {\n\n error!(\"tss_set_rsp0(): couldn't find TSS for apic {}\", my_apic_id);\n\n \"No TSS for the current core's apid id\" \n\n })?.lock();\n\n tss_entry.privilege_stack_table[0] = x86_64::VirtualAddress(new_privilege_stack_top.value());\n\n // trace!(\"tss_set_rsp0: new TSS {:?}\", tss_entry);\n\n Ok(())\n\n}\n\n\n\n\n","file_path":"kernel/tss/src/lib.rs","rank":88,"score":307269.11542648793},{"content":"/// Initialize the page allocator.\n\n///\n\n/// # Arguments\n\n/// * `end_vaddr_of_low_designated_region`: the `VirtualAddress` that marks the end of the \n\n/// lower designated region, which should be the ending address of the initial kernel image\n\n/// (a lower-half identity address).\n\n/// \n\n/// The page allocator will only allocate addresses lower than `end_vaddr_of_low_designated_region`\n\n/// if specifically requested.\n\n/// General allocation requests for any virtual address will not use any address lower than that,\n\n/// unless the rest of the entire virtual address space is already in use.\n\n///\n\npub fn init(end_vaddr_of_low_designated_region: VirtualAddress) -> Result<(), &'static str> {\n\n\tassert!(end_vaddr_of_low_designated_region < DESIGNATED_PAGES_HIGH_START.start_address());\n\n\tlet designated_low_end = DESIGNATED_PAGES_LOW_END.call_once(|| Page::containing_address(end_vaddr_of_low_designated_region));\n\n\tlet designated_low_end = *designated_low_end;\n\n\n\n\tlet initial_free_chunks = [\n\n\t\t// The first region contains all pages *below* the beginning of the 510th entry of P4. \n\n\t\t// We split it up into three chunks just for ease, since it overlaps the designated regions.\n\n\t\tSome(Chunk { \n\n\t\t\tpages: PageRange::new(\n\n\t\t\t\tPage::containing_address(VirtualAddress::zero()),\n\n\t\t\t\tdesignated_low_end,\n\n\t\t\t)\n\n\t\t}),\n\n\t\tSome(Chunk { \n\n\t\t\tpages: PageRange::new(\n\n\t\t\t\tdesignated_low_end + 1,\n\n\t\t\t\tDESIGNATED_PAGES_HIGH_START - 1,\n\n\t\t\t)\n\n\t\t}),\n","file_path":"kernel/page_allocator/src/lib.rs","rank":89,"score":307106.3441707317},{"content":"/// Measures the round trip time to send a 1-byte message on a rendezvous channel. \n\n/// Calls `do_ipc_rendezvous_inner` multiple times to perform the actual operation\n\nfn do_ipc_rendezvous(pinned: bool, cycles: bool) -> Result<(), &'static str> {\n\n\tlet child_core = if pinned {\n\n\t\tSome(CPU_ID!())\n\n\t} else {\n\n\t\tNone\n\n\t};\n\n\n\n\tlet mut tries: u64 = 0;\n\n\tlet mut max: u64 = core::u64::MIN;\n\n\tlet mut min: u64 = core::u64::MAX;\n\n\tlet mut vec = Vec::with_capacity(TRIES);\n\n\n\n\tprint_header(TRIES, ITERATIONS);\n\n\n\n\tfor i in 0..TRIES {\n\n\t\tlet lat = if cycles {\n\n\t\t\tdo_ipc_rendezvous_inner_cycles(i+1, TRIES, child_core)?\t\n\n\t\t} else {\n\n\t\t\tdo_ipc_rendezvous_inner(i+1, TRIES, child_core)?\t\n\n\t\t};\n","file_path":"applications/bm/src/lib.rs","rank":90,"score":306746.7623434306},{"content":"/// Measures the round trip time to send a 1-byte message on a simple channel. \n\n/// Calls `do_ipc_simple_inner` multiple times to perform the actual operation\n\nfn do_ipc_simple(pinned: bool, cycles: bool) -> Result<(), &'static str> {\n\n\tlet child_core = if pinned {\n\n\t\tSome(CPU_ID!())\n\n\t} else {\n\n\t\tNone\n\n\t};\n\n\n\n\tlet mut tries: u64 = 0;\n\n\tlet mut max: u64 = core::u64::MIN;\n\n\tlet mut min: u64 = core::u64::MAX;\n\n\tlet mut vec = Vec::with_capacity(TRIES);\n\n\t\n\n\tprint_header(TRIES, ITERATIONS);\n\n\n\n\tfor i in 0..TRIES {\n\n\t\tlet lat = if cycles {\n\n\t\t\tdo_ipc_simple_inner_cycles(i+1, TRIES, child_core)?\n\n\t\t} else {\n\n\t\t\tdo_ipc_simple_inner(i+1, TRIES, child_core)?\n\n\t\t};\n","file_path":"applications/bm/src/lib.rs","rank":91,"score":306746.7623434306},{"content":"/// Allocates the given number of frames starting at (inclusive of) the frame containing the given `PhysicalAddress`.\n\n/// \n\n/// See [`allocate_frames_deferred()`](fn.allocate_frames_deferred.html) for more details. \n\npub fn allocate_frames_at(paddr: PhysicalAddress, num_frames: usize) -> Result<AllocatedFrames, &'static str> {\n\n allocate_frames_deferred(Some(paddr), num_frames)\n\n .map(|(af, _action)| af)\n\n}\n\n\n\n\n\n/// Converts the frame allocator from using static memory (a primitive array) to dynamically-allocated memory.\n\n/// \n\n/// Call this function once heap allocation is available. \n\n/// Calling this multiple times is unnecessary but harmless, as it will do nothing after the first invocation.\n","file_path":"kernel/frame_allocator/src/lib.rs","rank":92,"score":306565.7796150503},{"content":"/// Allocates the given number of pages starting at (inclusive of) the page containing the given `VirtualAddress`.\n\n/// \n\n/// See [`allocate_pages_deferred()`](fn.allocate_pages_deferred.html) for more details. \n\npub fn allocate_pages_at(vaddr: VirtualAddress, num_pages: usize) -> Result<AllocatedPages, &'static str> {\n\n\tallocate_pages_deferred(Some(vaddr), num_pages)\n\n\t\t.map(|(ap, _action)| ap)\n\n}\n\n\n\n\n\n/// Converts the page allocator from using static memory (a primitive array) to dynamically-allocated memory.\n\n/// \n\n/// Call this function once heap allocation is available. \n\n/// Calling this multiple times is unnecessary but harmless, as it will do nothing after the first invocation.\n","file_path":"kernel/page_allocator/src/lib.rs","rank":93,"score":306565.7796150503},{"content":"/// Returns the priority of the given task.\n\npub fn get_priority(task: &TaskRef) -> Option<u8> {\n\n RunQueue::get_priority(task)\n\n}\n\n\n","file_path":"kernel/scheduler_priority/src/lib.rs","rank":94,"score":306287.72402710957},{"content":"/// Clears the cache of unloaded (swapped-out) crates saved from previous crate swapping operations. \n\npub fn clear_unloaded_crate_cache() {\n\n UNLOADED_CRATE_CACHE.lock().clear();\n\n}\n\n\n\n\n\n/// A state transfer function is an arbitrary function called when swapping crates. \n\n/// \n\n/// See the `swap_crates()` function for more details. \n\npub type StateTransferFunction = fn(&Arc<CrateNamespace>, &CrateNamespace) -> Result<(), &'static str>;\n\n\n\n\n","file_path":"kernel/crate_swap/src/lib.rs","rank":95,"score":305953.26402118965},{"content":"/// Frees all counters and make them available to be used.\n\n/// Essentially sets the PMU to its initial state.\n\npub fn reset_pmu() -> Result<(), &'static str> {\n\n for pmc in get_pmcs_available()?.iter() {\n\n pmc.store(INIT_VAL_PMCS_AVAILABLE, Ordering::SeqCst);\n\n }\n\n for core in CORES_SAMPLING.iter() {\n\n core.store(0, Ordering::SeqCst);\n\n }\n\n for result in RESULTS_READY.iter() {\n\n result.store(0, Ordering::SeqCst);\n\n }\n\n SAMPLING_INFO.lock().clear();\n\n\n\n Ok(())\n\n}\n\n\n","file_path":"kernel/pmu_x86/src/lib.rs","rank":96,"score":303870.8776198717},{"content":"/// Measures the round trip time to send a 1-byte message on an async channel. \n\n/// Calls `do_ipc_async_inner` multiple times to perform the actual operation\n\nfn do_ipc_async(pinned: bool, blocking: bool, cycles: bool) -> Result<(), &'static str> {\n\n\tlet child_core = if pinned {\n\n\t\tSome(CPU_ID!())\n\n\t} else {\n\n\t\tNone\n\n\t};\n\n\n\n\tlet mut tries: u64 = 0;\n\n\tlet mut max: u64 = core::u64::MIN;\n\n\tlet mut min: u64 = core::u64::MAX;\n\n\tlet mut vec = Vec::with_capacity(TRIES);\n\n\n\n\tprint_header(TRIES, ITERATIONS);\n\n\n\n\tfor i in 0..TRIES {\n\n\t\tlet lat = if cycles {\n\n\t\t\tdo_ipc_async_inner_cycles(i+1, TRIES, child_core, blocking)?\t\n\n\t\t} else {\n\n\t\t\tdo_ipc_async_inner(i+1, TRIES, child_core, blocking)?\n\n\t\t};\n","file_path":"applications/bm/src/lib.rs","rank":97,"score":303696.57440139557},{"content":"/// Returns the samples that were stored during sampling in the form of a SampleResults object. \n\n/// If samples are not yet finished, forces them to stop. \n\npub fn retrieve_samples() -> Result<SampleResults, &'static str> {\n\n let my_core_id = apic::get_my_apic_id();\n\n\n\n let mut sampling_info = SAMPLING_INFO.lock();\n\n let mut samples = sampling_info.get_mut(&my_core_id).ok_or(\"pmu_x86::retrieve_samples: could not retrieve sampling information for this core\")?;\n\n\n\n // the interrupt handler might have stopped samples already so thsi check is required\n\n if core_is_currently_sampling(my_core_id) {\n\n stop_samples(my_core_id, &mut samples)?;\n\n }\n\n \n\n sampling_results_have_been_retrieved(my_core_id)?;\n\n\n\n Ok(SampleResults{instruction_pointers: samples.ip_list.clone(), task_ids: samples.task_id_list.clone()}) \n\n}\n\n\n","file_path":"kernel/pmu_x86/src/lib.rs","rank":98,"score":303202.7709236565},{"content":"/// Allocates pages starting at the given `VirtualAddress` with a size given in number of bytes. \n\n/// \n\n/// This function still allocates whole pages by rounding up the number of bytes. \n\n/// See [`allocate_pages_deferred()`](fn.allocate_pages_deferred.html) for more details. \n\npub fn allocate_pages_by_bytes_at(vaddr: VirtualAddress, num_bytes: usize) -> Result<AllocatedPages, &'static str> {\n\n\tallocate_pages_by_bytes_deferred(Some(vaddr), num_bytes)\n\n\t\t.map(|(ap, _action)| ap)\n\n}\n\n\n\n\n","file_path":"kernel/page_allocator/src/lib.rs","rank":99,"score":303053.0685333697}],"string":"[\n {\n \"content\": \"/// Spawns a new userspace task based on the provided `path`, which must point to an ELF executable file with a defined entry point.\\n\\n/// Optionally, provide a `name` for the new Task. If none is provided, the name is based on the given `Path`.\\n\\npub fn spawn_userspace(path: Path, name: Option<String>) -> Result<TaskRef, &'static str> {\\n\\n return Err(\\\"this function has not yet been adapted to use the fs-based crate namespace system\\\");\\n\\n\\n\\n debug!(\\\"spawn_userspace [0]: Interrupts enabled: {}\\\", irq_safety::interrupts_enabled());\\n\\n \\n\\n let mut new_task = Task::new();\\n\\n new_task.name = String::from(name.unwrap_or(String::from(path.as_ref())));\\n\\n\\n\\n let mut ustack: Option<Stack> = None;\\n\\n\\n\\n // create a new MemoryManagementInfo instance to represent the new process's address space. \\n\\n let new_userspace_mmi = {\\n\\n let kernel_mmi_ref = get_kernel_mmi_ref().expect(\\\"spawn_userspace(): KERNEL_MMI was not yet initialized!\\\");\\n\\n let mut kernel_mmi_locked = kernel_mmi_ref.lock();\\n\\n \\n\\n // create a new kernel stack for this userspace task\\n\\n let mut kstack: Stack = kernel_mmi_locked.alloc_stack(KERNEL_STACK_SIZE_IN_PAGES).expect(\\\"spawn_userspace: couldn't alloc_stack for new kernel stack!\\\");\\n\\n\\n\\n setup_context_trampoline(&mut kstack, &mut new_task, userspace_wrapper);\\n\\n \\n\",\n \"file_path\": \"old_crates/spawn_userspace/src/lib.rs\",\n \"rank\": 0,\n \"score\": 599883.9079822414\n },\n {\n \"content\": \"/// This function is used for live evolution from a round robin scheduler to a priority scheduler. \\n\\n/// It first extracts the taskrefs from the round robin Runqueue,\\n\\n/// then converts them into priority taskrefs and places them on the priority Runqueue.\\n\\npub fn prio_sched(_old_namespace: &Arc<CrateNamespace>, _new_namespace: &CrateNamespace) -> Result<(), &'static str> {\\n\\n\\n\\n // just debugging info\\n\\n #[cfg(not(loscd_eval))]\\n\\n {\\n\\n warn!(\\\"prio_sched(): at the top.\\\");\\n\\n let rq_rr_crate = CrateNamespace::get_crate_starting_with(_old_namespace, \\\"runqueue_round_robin\\\")\\n\\n .map(|(_crate_name, crate_ref, _ns)| crate_ref)\\n\\n .ok_or(\\\"Couldn't get runqueue_round_robin crate from old namespace\\\")?;\\n\\n let krate = rq_rr_crate.lock_as_ref();\\n\\n for sec in krate.sections.values() {\\n\\n if sec.name.contains(\\\"RUNQUEUES\\\") {\\n\\n debug!(\\\"Section {}\\\\n\\\\ttype: {:?}\\\\n\\\\tvaddr: {:#X}\\\\n\\\\tsize: {}\\\\n\\\", sec.name, sec.typ, sec.start_address(), sec.size());\\n\\n }\\n\\n }\\n\\n warn!(\\\"REPLACING LAZY_STATIC RUNQUEUES...\\\");\\n\\n }\\n\\n\\n\\n #[cfg(loscd_eval)]\\n\\n let hpet = hpet::get_hpet().ok_or(\\\"couldn't get HPET timer\\\")?;\\n\",\n \"file_path\": \"kernel/state_transfer/src/lib.rs\",\n \"rank\": 1,\n \"score\": 498659.451111004\n },\n {\n \"content\": \"/// Parses the given `path` to obtain the part of the filename before the crate name delimiter '-'. \\n\\nfn get_plain_crate_name_from_path<'p>(path: &'p Path) -> Result<&'p str, String> {\\n\\n path.file_stem()\\n\\n .and_then(|os_str| os_str.to_str())\\n\\n .ok_or_else(|| format!(\\\"Couldn't get file name of file in out_dir: {}\\\", path.display()))?\\n\\n .split('-').next()\\n\\n .ok_or_else(|| format!(\\\"File in out_dir missing delimiter '-' between crate name and hash. {}\\\", path.display()))\\n\\n}\\n\\n\\n\\n\\n\",\n \"file_path\": \"tools/theseus_cargo/src/main.rs\",\n \"rank\": 2,\n \"score\": 489312.4673317265\n },\n {\n \"content\": \"/// This function calls the crate swapping routine for a corrupted crate (referred to as self swap)\\n\\n/// Swapping a crate with a new copy of object file includes following steps in high level\\n\\n/// 1) Call generic crate swapping routine with self_swap = true\\n\\n/// 2) Change the calues in the stack to the reloaded crate\\n\\n/// 3) Change any other references in the heap to the reloaded crate\\n\\n/// This function handles 1 and 2 operations and 3 is handled in the call site depending on necessity\\n\\npub fn self_swap_handler(crate_name: &str) -> Result<SwapRanges, String> {\\n\\n\\n\\n let taskref = task::get_my_current_task()\\n\\n .ok_or_else(|| format!(\\\"failed to get current task\\\"))?;\\n\\n\\n\\n #[cfg(not(downtime_eval))]\\n\\n debug!(\\\"The taskref is {:?}\\\",taskref);\\n\\n\\n\\n let curr_dir = Arc::clone(&taskref.get_env().lock().working_dir);\\n\\n\\n\\n let override_namespace_crate_dir = Option::<NamespaceDir>::None;\\n\\n\\n\\n let verbose = false;\\n\\n let state_transfer_functions: Vec<String> = Vec::new();\\n\\n\\n\\n let mut tuples: Vec<(&str, &str, bool)> = Vec::new();\\n\\n\\n\\n tuples.push((crate_name, crate_name , false));\\n\\n\\n\\n #[cfg(not(downtime_eval))]\\n\",\n \"file_path\": \"kernel/fault_crate_swap/src/lib.rs\",\n \"rank\": 3,\n \"score\": 488256.98800288304\n },\n {\n \"content\": \"/// Replaces the `old_crate_name` substring in the given `demangled_full_symbol` with the given `new_crate_name`, \\n\\n/// if it can be found, and if the parent crate name matches the `old_crate_name`. \\n\\n/// If the parent crate name can be found but does not match the expected `old_crate_name`,\\n\\n/// then None is returned.\\n\\n/// \\n\\n/// This creates an entirely new String rather than performing an in-place replacement, \\n\\n/// because the `new_crate_name` might be a different length than the original crate name.\\n\\n/// \\n\\n/// We cannot simply use `str::replace()` because it would replace *all* instances of the `old_crate_name`, \\n\\n/// including components of function/symbol names. \\n\\n/// \\n\\n/// # Examples\\n\\n/// * `replace_containing_crate_name(\\\"keyboard::init\\\", \\\"keyboard\\\", \\\"keyboard_new\\\") -> Some(\\\"keyboard_new::init\\\")`\\n\\n/// * `replace_containing_crate_name(\\\"<framebuffer::VirtualFramebuffer as display::Display>::fill_rectangle\\\", \\\"display\\\", \\\"display3\\\")\\n\\n/// -> Some(\\\"<framebuffer::VirtualFramebuffer as display3::Display>::fill_rectangle\\\")`\\n\\npub fn replace_containing_crate_name(demangled_full_symbol: &str, old_crate_name: &str, new_crate_name: &str) -> Option<String> {\\n\\n let mut new_symbol = String::from(demangled_full_symbol);\\n\\n let mut addend: isize = 0; // index compensation for the difference in old vs. new crate name length\\n\\n let mut replaced = false;\\n\\n for range in get_containing_crate_name_ranges(demangled_full_symbol) {\\n\\n if demangled_full_symbol.get(range.clone()) == Some(old_crate_name) {\\n\\n new_symbol = format!(\\\"{}{}{}\\\", \\n\\n &new_symbol[.. ((range.start as isize + addend) as usize)],\\n\\n new_crate_name,\\n\\n &demangled_full_symbol[range.end ..]\\n\\n );\\n\\n replaced = true;\\n\\n addend += (new_crate_name.len() as isize) - (old_crate_name.len() as isize);\\n\\n }\\n\\n }\\n\\n if replaced { Some(new_symbol) } else { None }\\n\\n}\\n\",\n \"file_path\": \"kernel/crate_name_utils/src/lib.rs\",\n \"rank\": 4,\n \"score\": 488128.19302356354\n },\n {\n \"content\": \"/// Outputs the list of sections in the given crate.\\n\\n/// \\n\\n/// # Arguments\\n\\n/// * `all_sections`: If `true`, then all sections will be printed. \\n\\n/// If `false`, then only public (global) sections will be printed.\\n\\n/// \\n\\n/// If there are multiple matches, this returns an Error containing \\n\\n/// all of the matching section names separated by the newline character `'\\\\n'`.\\n\\nfn sections_in_crate(crate_name: &str, all_sections: bool) -> Result<(), String> {\\n\\n let (crate_name, crate_ref) = find_crate(crate_name)?;\\n\\n\\n\\n let mut containing_crates = BTreeSet::new();\\n\\n if all_sections {\\n\\n println_log!(\\\"Sections (all) in crate {}:\\\", crate_name);\\n\\n for sec in crate_ref.lock_as_ref().sections.values() {\\n\\n println_log!(\\\" {}\\\", sec.name);\\n\\n for n in get_containing_crate_name(&sec.name) {\\n\\n containing_crates.insert(String::from(n));\\n\\n }\\n\\n }\\n\\n } else {\\n\\n println_log!(\\\"Sections (public-only) in crate {}:\\\", crate_name);\\n\\n for sec in crate_ref.lock_as_ref().global_sections_iter() {\\n\\n println_log!(\\\" {}\\\", sec.name);\\n\\n for n in get_containing_crate_name(&sec.name) {\\n\\n containing_crates.insert(String::from(n));\\n\\n }\\n\\n }\\n\\n }\\n\\n\\n\\n let crates_list = containing_crates.into_iter().collect::<Vec<String>>().join(\\\"\\\\n\\\");\\n\\n println_log!(\\\"Constituent (or related) crates:\\\\n{}\\\", &crates_list);\\n\\n Ok(())\\n\\n}\\n\\n\\n\\n\\n\",\n \"file_path\": \"applications/deps/src/lib.rs\",\n \"rank\": 5,\n \"score\": 456637.2499454488\n },\n {\n \"content\": \"/// Removes a `TaskRef` from all `RunQueue`s that exist on the entire system.\\n\\npub fn remove_task_from_all(task: &TaskRef) -> Result<(), &'static str>{\\n\\n RunQueue::remove_task_from_all(task)\\n\\n}\\n\\n\\n\\n\\n\\n\\n\",\n \"file_path\": \"kernel/runqueue/src/lib.rs\",\n \"rank\": 6,\n \"score\": 453697.7047795294\n },\n {\n \"content\": \"/// Returns the crate matching the given `crate_name` if there is a single match.\\n\\n/// \\n\\n/// If there are multiple matches, this returns an Error containing \\n\\n/// all of the matching section names separated by the newline character `'\\\\n'`.\\n\\nfn find_crate(crate_name: &str) -> Result<(String, StrongCrateRef), String> {\\n\\n let namespace = get_my_current_namespace();\\n\\n let mut matching_crates = CrateNamespace::get_crates_starting_with(&namespace, crate_name);\\n\\n match matching_crates.len() {\\n\\n 0 => Err(format!(\\\"couldn't find crate matching {:?}\\\", crate_name)),\\n\\n 1 => {\\n\\n let mc = matching_crates.swap_remove(0);\\n\\n Ok((mc.0, mc.1)) \\n\\n }\\n\\n _ => Err(matching_crates.into_iter().map(|(crate_name, _crate_ref, _ns)| crate_name).collect::<Vec<String>>().join(\\\"\\\\n\\\")),\\n\\n }\\n\\n}\\n\\n\\n\\n\\n\",\n \"file_path\": \"applications/deps/src/lib.rs\",\n \"rank\": 7,\n \"score\": 442980.47538265924\n },\n {\n \"content\": \"fn print_crates(output: &mut String, indent: usize, namespace: &CrateNamespace, recursive: bool) -> core::fmt::Result {\\n\\n writeln!(output, \\\"\\\\n{:indent$}{} CrateNamespace has loaded crates:\\\", \\\"\\\", namespace.name(), indent = indent)?;\\n\\n let mut crates: Vec<String> = Vec::new();\\n\\n // We do recursion manually here so we can separately print each recursive namespace.\\n\\n namespace.for_each_crate(false, |crate_name, crate_ref| {\\n\\n crates.push(format!(\\\"{:indent$}{} {:?}\\\", \\\"\\\", crate_name, crate_ref.lock_as_ref().object_file.lock().get_absolute_path(), indent = (indent + 4)));\\n\\n true\\n\\n });\\n\\n crates.sort();\\n\\n for c in crates {\\n\\n writeln!(output, \\\"{}\\\", c)?;\\n\\n }\\n\\n\\n\\n if recursive {\\n\\n if let Some(r_ns) = namespace.recursive_namespace() {\\n\\n print_crates(output, indent + 2, r_ns.deref(), recursive)?;\\n\\n }\\n\\n }\\n\\n\\n\\n Ok(())\\n\\n}\\n\\n\\n\\n\\n\",\n \"file_path\": \"applications/ns/src/lib.rs\",\n \"rank\": 8,\n \"score\": 439216.26627476927\n },\n {\n \"content\": \"/// This function sets up the given new `Task`'s kernel stack pointer to properly jump\\n\\n/// to the given entry point function when the new `Task` is first scheduled in. \\n\\n/// \\n\\n/// When a new task is first scheduled in, a `Context` struct will be popped off the stack,\\n\\n/// and at the end of that struct is the address of the next instruction that will be popped off as part of the \\\"ret\\\" instruction, \\n\\n/// i.e., the entry point into the new task. \\n\\n/// \\n\\n/// So, this function allocates space for the saved context registers to be popped off when this task is first switched to.\\n\\n/// It also sets the given `new_task`'s `saved_sp` (its saved stack pointer, which holds the Context for task switching).\\n\\n/// \\n\\nfn setup_context_trampoline(new_task: &mut Task, entry_point_function: fn() -> !) -> Result<(), &'static str> {\\n\\n \\n\\n /// A private macro that actually creates the Context and sets it up in the `new_task`.\\n\\n /// We use a macro here so we can pass in the proper `ContextType` at runtime, \\n\\n /// which is useful for both the simd_personality config and regular/SSE configs.\\n\\n macro_rules! set_context {\\n\\n ($ContextType:ty) => (\\n\\n // We write the new Context struct at the top of the stack, which is at the end of the stack's MappedPages. \\n\\n // We subtract \\\"size of usize\\\" (8) bytes to ensure the new Context struct doesn't spill over past the top of the stack.\\n\\n let mp_offset = new_task.inner_mut().kstack.size_in_bytes() - mem::size_of::<usize>() - mem::size_of::<$ContextType>();\\n\\n let new_context_destination: &mut $ContextType = new_task.inner_mut().kstack.as_type_mut(mp_offset)?;\\n\\n *new_context_destination = <$ContextType>::new(entry_point_function as usize);\\n\\n new_task.inner_mut().saved_sp = new_context_destination as *const _ as usize;\\n\\n );\\n\\n }\\n\\n\\n\\n // If `simd_personality` is enabled, all of the `context_switch*` implementation crates are simultaneously enabled,\\n\\n // in order to allow choosing one of them based on the configuration options of each Task (SIMD, regular, etc).\\n\\n #[cfg(simd_personality)] {\\n\\n match new_task.simd {\\n\",\n \"file_path\": \"kernel/spawn/src/lib.rs\",\n \"rank\": 9,\n \"score\": 437286.9768535586\n },\n {\n \"content\": \"pub fn sysrecv(name:&CStr) -> String{\\n\\n let sname = name.to_string_lossy().into_owned();;;\\n\\n trace!(\\\"Get the connection {}\\\", &sname);\\n\\n let mut table = get_connection_table().write();\\n\\n let mut connection = table.get_connection(sname)\\n\\n .expect(\\\"Fail to create the bus connection\\\").write();\\n\\n\\n\\n let obj = connection.receive();\\n\\n if obj.is_some() {\\n\\n trace!(\\\"Get the result!\\\");\\n\\n return obj.unwrap().data;\\n\\n } else {\\n\\n trace!(\\\"No message!\\\");\\n\\n return String::from(\\\"\\\");\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"old_crates/dbus/src/lib.rs\",\n \"rank\": 10,\n \"score\": 435715.33054222027\n },\n {\n \"content\": \"fn print_files(output: &mut String, indent: usize, namespace: &CrateNamespace, recursive: bool) -> core::fmt::Result {\\n\\n writeln!(output, \\\"\\\\n{:indent$}{} CrateNamespace has crate object files:\\\", \\\"\\\", namespace.name(), indent = indent)?;\\n\\n let mut files = namespace.dir().lock().list();\\n\\n files.sort();\\n\\n for f in files {\\n\\n writeln!(output, \\\"{:indent$}{}\\\", \\\"\\\", f, indent = (indent + 4))?;\\n\\n }\\n\\n\\n\\n if recursive {\\n\\n if let Some(r_ns) = namespace.recursive_namespace() {\\n\\n print_files(output, indent + 2, r_ns.deref(), recursive)?;\\n\\n }\\n\\n }\\n\\n\\n\\n Ok(())\\n\\n}\\n\\n\\n\\n\\n\",\n \"file_path\": \"applications/ns/src/lib.rs\",\n \"rank\": 12,\n \"score\": 425113.5945333614\n },\n {\n \"content\": \"/// Creates a new directory with a unique name in the given `parent_dir`. \\n\\n/// For example, given a base_name of \\\"my_dir\\\", \\n\\n/// it will create a directory \\\"my_dir.2\\\" if \\\"my_dir\\\" and \\\"my_dir.1\\\" already exist.\\n\\nfn make_unique_directory(base_name: &str, parent_dir: &DirRef) -> Result<DirRef, &'static str> {\\n\\n if parent_dir.lock().get(base_name).is_none() {\\n\\n return VFSDirectory::new(base_name.to_string(), parent_dir);\\n\\n }\\n\\n for i in 1.. {\\n\\n let new_base_name = format!(\\\"{}.{}\\\", base_name, i);\\n\\n if parent_dir.lock().get(&new_base_name).is_none() {\\n\\n return VFSDirectory::new(new_base_name, parent_dir);\\n\\n } \\n\\n }\\n\\n\\n\\n Err(\\\"unable to create new unique directory\\\")\\n\\n}\\n\\n\\n\\n\\n\",\n \"file_path\": \"applications/upd/src/lib.rs\",\n \"rank\": 13,\n \"score\": 423567.98013474175\n },\n {\n \"content\": \"fn load_crate(output: &mut String, crate_file_ref: FileRef, namespace: &Arc<CrateNamespace>) -> Result<(), String> {\\n\\n let kernel_mmi_ref = memory::get_kernel_mmi_ref().ok_or_else(|| format!(\\\"Cannot get kernel_mmi_ref\\\"))?;\\n\\n let (_new_crate_ref, _new_syms) = namespace.load_crate(\\n\\n &crate_file_ref,\\n\\n None,\\n\\n &kernel_mmi_ref,\\n\\n false\\n\\n ).map_err(|e| String::from(e))?;\\n\\n writeln!(output, \\\"Loaded crate with {} new symbols from {}\\\", _new_syms, crate_file_ref.lock().get_absolute_path()).unwrap();\\n\\n Ok(())\\n\\n}\\n\\n\\n\\n\\n\",\n \"file_path\": \"applications/ns/src/lib.rs\",\n \"rank\": 14,\n \"score\": 412844.7681497364\n },\n {\n \"content\": \"/// Applies an already-downloaded update according the \\\"diff.txt\\\" file\\n\\n/// that must be in the given base directory.\\n\\nfn apply(base_dir_path: &Path) -> Result<(), String> {\\n\\n if cfg!(not(loadable)) {\\n\\n return Err(format!(\\\"Evolutionary updates can only be applied when Theseus is built in loadable mode.\\\"));\\n\\n }\\n\\n\\n\\n let kernel_mmi_ref = memory::get_kernel_mmi_ref().ok_or_else(|| format!(\\\"couldn't get kernel MMI\\\"))?;\\n\\n let curr_dir = task::get_my_current_task().map(|t| t.get_env().lock().working_dir.clone()).ok_or_else(|| format!(\\\"couldn't get my current working directory\\\"))?;\\n\\n let new_namespace_dir = match base_dir_path.get(&curr_dir) {\\n\\n Some(FileOrDir::Dir(d)) => NamespaceDir::new(d),\\n\\n _ => return Err(format!(\\\"cannot find an update base directory at path {}\\\", base_dir_path)),\\n\\n };\\n\\n let diff_file = match new_namespace_dir.lock().get(DIFF_FILE_NAME) { \\n\\n Some(FileOrDir::File(f)) => f,\\n\\n _ => return Err(format!(\\\"cannot find diff file expected at {}/{}\\\", base_dir_path, DIFF_FILE_NAME)),\\n\\n };\\n\\n let mut diff_content: Vec<u8> = alloc::vec::from_elem(0, diff_file.lock().size()); \\n\\n let _bytes_read = diff_file.lock().read(&mut diff_content, 0)?;\\n\\n let diffs = ota_update_client::as_lines(&diff_content).map_err(|e| e.to_string())\\n\\n .and_then(|diff_lines| ota_update_client::parse_diff_lines(&diff_lines).map_err(|e| e.to_string()))?;\\n\\n\\n\",\n \"file_path\": \"applications/upd/src/lib.rs\",\n \"rank\": 15,\n \"score\": 408477.0494424983\n },\n {\n \"content\": \"/// Chooses the \\\"least busy\\\" core's runqueue\\n\\n/// and adds the given `Task` reference to that core's runqueue.\\n\\npub fn add_task_to_any_runqueue(task: TaskRef) -> Result<(), &'static str>{\\n\\n RunQueue::add_task_to_any_runqueue(task)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"kernel/runqueue/src/lib.rs\",\n \"rank\": 16,\n \"score\": 408019.60812394647\n },\n {\n \"content\": \"/// Parse the given verbose rustc command string and return the value of the \\\"--out-dir\\\" argument.\\n\\nfn get_out_dir_arg(cmd_str: &str) -> Result<String, String> {\\n\\n let out_dir_str_start = cmd_str.find(\\\" --out-dir\\\")\\n\\n .map(|idx| &cmd_str[idx..])\\n\\n .ok_or_else(|| format!(\\\"Captured rustc command did not have an --out-dir argument\\\"))?;\\n\\n let out_dir_parse = rustc_clap_options(\\\"\\\")\\n\\n .setting(clap::AppSettings::DisableHelpFlags)\\n\\n .setting(clap::AppSettings::DisableHelpSubcommand)\\n\\n .setting(clap::AppSettings::AllowExternalSubcommands)\\n\\n .setting(clap::AppSettings::NoBinaryName)\\n\\n .setting(clap::AppSettings::ColorNever)\\n\\n .get_matches_from_safe(out_dir_str_start.split_whitespace());\\n\\n let matches = out_dir_parse.map_err(|e| \\n\\n format!(\\\"Could not parse --out-dir argument in captured rustc command.\\\\nError {}\\\", e)\\n\\n )?;\\n\\n matches.value_of(\\\"--out-dir\\\")\\n\\n .map(String::from)\\n\\n .ok_or_else(|| format!(\\\"--out-dir argument did not have a value\\\"))\\n\\n}\\n\\n\\n\\n\\n\",\n \"file_path\": \"tools/theseus_cargo/src/main.rs\",\n \"rank\": 17,\n \"score\": 407685.89983285917\n },\n {\n \"content\": \"/// Outputs the given crate's weak dependents, i.e.,\\n\\n/// the crates that depend on the given crate.\\n\\n/// \\n\\n/// If there are multiple matches, this returns an Error containing \\n\\n/// all of the matching crate names separated by the newline character `'\\\\n'`.\\n\\nfn crates_dependent_on_me(_crate_name: &str) -> Result<(), String> {\\n\\n Err(format!(\\\"unimplemented\\\"))\\n\\n}\\n\\n\\n\\n\\n\",\n \"file_path\": \"applications/deps/src/lib.rs\",\n \"rank\": 18,\n \"score\": 406320.82831300865\n },\n {\n \"content\": \"/// Outputs the given crate's strong dependencies, i.e.,\\n\\n/// the crates that the given crate depends on.\\n\\n/// \\n\\n/// If there are multiple matches, this returns an Error containing \\n\\n/// all of the matching crate names separated by the newline character `'\\\\n'`.\\n\\nfn crates_i_depend_on(_crate_name: &str) -> Result<(), String> {\\n\\n Err(format!(\\\"unimplemented\\\"))\\n\\n}\\n\\n\\n\\n\\n\\n\\n\",\n \"file_path\": \"applications/deps/src/lib.rs\",\n \"rank\": 19,\n \"score\": 406320.82831300865\n },\n {\n \"content\": \"/// Finds the corresponding function for each instruction pointer and calculates the percentage amount each function occured in the samples\\n\\npub fn find_function_names_from_samples(sample_results: &SampleResults) -> Result<(), &'static str> {\\n\\n let taskref = task::get_my_current_task().ok_or(\\\"pmu_x86::get_function_names_from_samples: Could not get reference to current task\\\")?;\\n\\n let namespace = taskref.get_namespace();\\n\\n debug!(\\\"Analyze Samples:\\\");\\n\\n\\n\\n let mut sections: BTreeMap<String, usize> = BTreeMap::new();\\n\\n let total_samples = sample_results.instruction_pointers.len();\\n\\n\\n\\n for ip in sample_results.instruction_pointers.iter() {\\n\\n let (section_ref, _offset) = namespace.get_section_containing_address(\\n\\n memory::VirtualAddress::new(ip.0).ok_or(\\\"sampled instruction pointer was an invalid virtual address\\\")?,\\n\\n true\\n\\n ).ok_or(\\\"Can't find section containing sampled instruction pointer\\\")?;\\n\\n let section_name = section_ref.name_without_hash().to_string();\\n\\n\\n\\n sections.entry(section_name).and_modify(|e| {*e += 1}).or_insert(1);\\n\\n }\\n\\n\\n\\n for (section, occurrences) in sections.iter() {\\n\\n let percentage = *occurrences as f32 / total_samples as f32 * 100.0;\\n\\n debug!(\\\"{:?} {}% \\\\n\\\", section, percentage);\\n\\n }\\n\\n\\n\\n Ok(())\\n\\n}\\n\\n\\n\",\n \"file_path\": \"kernel/pmu_x86/src/lib.rs\",\n \"rank\": 20,\n \"score\": 403932.27209229174\n },\n {\n \"content\": \"fn num_deps_crate(crate_name: &str) -> Result<(), String> {\\n\\n let (_cn, crate_ref) = find_crate(crate_name)?;\\n\\n let (s, w, i) = crate_dependency_count(&crate_ref);\\n\\n println!(\\\"Crate {}'s Dependency Count:\\\\nStrong: {}\\\\nWeak: {}\\\\nIntrnl: {}\\\", crate_name, s, w, i);\\n\\n Ok(())\\n\\n}\\n\\n\\n\",\n \"file_path\": \"applications/deps/src/lib.rs\",\n \"rank\": 21,\n \"score\": 400201.7806153407\n },\n {\n \"content\": \"/// Returns the crate name that is derived from a crate object file path.\\n\\n/// \\n\\n/// # Examples of acceptable paths\\n\\n/// Legal paths can:\\n\\n/// * be absolute or relative,\\n\\n/// * optionally end with an extension, e.g., `\\\".o\\\"`, optionally start \\n\\n/// * optionally start with a module file prefix, e.g., `\\\"k#my_crate-<hash>.o\\\"`.\\n\\npub fn crate_name_from_path<'p>(object_file_path: &'p Path) -> &'p str {\\n\\n let stem = object_file_path.file_stem();\\n\\n if let Ok((_crate_type, _prefix, name)) = CrateType::from_module_name(stem) {\\n\\n name\\n\\n } else {\\n\\n stem\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"kernel/crate_name_utils/src/lib.rs\",\n \"rank\": 22,\n \"score\": 400198.30873816303\n },\n {\n \"content\": \"/// Parses the given symbol string to try to find the name of the parent crate\\n\\n/// that contains the symbol. \\n\\n/// Depending on the symbol, there may be multiple potential parent crates;\\n\\n/// if so, they are returned in order of likeliness: \\n\\n/// the first crate name in the symbol is most likely to contain it.\\n\\n/// If the parent crate cannot be determined (e.g., a `no_mangle` symbol),\\n\\n/// then an empty `Vec` is returned.\\n\\n/// \\n\\n/// # Examples\\n\\n/// * `<*const T as core::fmt::Debug>::fmt` -> `[\\\"core\\\"]`\\n\\n/// * `<alloc::boxed::Box<T>>::into_unique` -> `[\\\"alloc\\\"]`\\n\\n/// * `<framebuffer::VirtualFramebuffer as display::Display>::fill_rectangle` -> `[\\\"framebuffer\\\", \\\"display\\\"]`\\n\\n/// * `keyboard::init` -> `[\\\"keyboard\\\"]`\\n\\npub fn get_containing_crate_name<'a>(demangled_full_symbol: &'a str) -> Vec<&'a str> {\\n\\n get_containing_crate_name_ranges(demangled_full_symbol)\\n\\n .into_iter()\\n\\n .filter_map(|range| demangled_full_symbol.get(range))\\n\\n .dedup()\\n\\n .collect()\\n\\n}\\n\\n\\n\\n\\n\",\n \"file_path\": \"kernel/crate_name_utils/src/lib.rs\",\n \"rank\": 23,\n \"score\": 396355.2217847112\n },\n {\n \"content\": \"/// Removes the (child application's task ID, parent terminal print_producer) key-val pair from the map\\n\\n/// Called right after an application exits\\n\\npub fn remove_child(child_task_id: usize) -> Result<(), &'static str> {\\n\\n TERMINAL_PRINT_PRODUCERS.lock().remove(&child_task_id);\\n\\n Ok(()) \\n\\n}\\n\\n\\n\\n\\n\\n\\n\\nuse core::fmt;\\n\",\n \"file_path\": \"kernel/terminal_print/src/lib.rs\",\n \"rank\": 24,\n \"score\": 394094.2936114032\n },\n {\n \"content\": \"/// Goes through the contents of each directory to compare each file. \\n\\n/// \\n\\n/// Returns a mapping of old crate to new crate, meaning that the old crate should be replaced with the new crate. \\n\\n/// If the old crate is `None` and the new crate is `Some`, then the new crate is a new addition that does not replace any old crate.\\n\\n/// If the old crate is `Some` and the new crate is `None`, then the old crate is merely being removed without being replaced.\\n\\n/// If both the old crate and new crate are `Some`, then the new crate is replacing the old crate.\\n\\nfn compare_dirs(old_dir_contents: Trie<BString, PathBuf>, new_dir_contents: Trie<BString, PathBuf>) -> Result<MultiMap<String, String>, String> {\\n\\n let mut replacements: MultiMap<String, String> = MultiMap::new();\\n\\n\\n\\n // First, we go through the new directory and see which files have changed since the old directory\\n\\n for (new_filename, new_path) in new_dir_contents.iter() {\\n\\n\\n\\n // if the old dir contains an identical file as the new dir, then we diff their actual contents\\n\\n if let Some(old_path) = old_dir_contents.get(new_filename) {\\n\\n let old_file = fs::read(old_path).map_err(|e| e.to_string())?;\\n\\n let new_file = fs::read(new_path).map_err(|e| e.to_string())?;\\n\\n if old_file != new_file {\\n\\n println!(\\\"{0} -> {0}\\\", new_filename.as_str());\\n\\n replacements.insert(new_filename.clone().into(), new_filename.clone().into());\\n\\n }\\n\\n }\\n\\n // otherwise we try to search the old dir to see if there's a single matching crate that has a different hash\\n\\n else {\\n\\n // initially, we search just the crate name itself (e.g., \\\"terminal\\\", \\\"apic\\\") without the trailing hash to allow for matching applications.\\n\\n let crate_name_search_str = format!(\\\"{}\\\", crate_name_without_hash(new_filename.as_str()));\\n\\n let matching_old_crates: Vec<(BString, PathBuf)> = old_dir_contents.iter_prefix_str(&crate_name_search_str).map(|(k, v)| (k.clone(), v.clone())).collect();\\n\",\n \"file_path\": \"tools/diff_crates/src/main.rs\",\n \"rank\": 25,\n \"score\": 392359.44195370865\n },\n {\n \"content\": \"/// This function is designed to be invoked from an interrupt handler \\n\\n/// when a sampling interrupt has (or may have) occurred. \\n\\n///\\n\\n/// It takes a sample by logging the the instruction pointer and task ID at the point\\n\\n/// at which the sampling interrupt occurred. \\n\\n/// The counter is then either reset to its starting value \\n\\n/// (if there are more samples that need to be taken)\\n\\n/// or disabled entirely if the final sample has been taken. \\n\\n///\\n\\n/// # Argument\\n\\n/// * `stack_frame`: the stack frame that was pushed onto the stack automatically \\n\\n/// by the CPU and passed into the interrupt/exception handler. \\n\\n/// This is used to determine during which instruction the sampling interrupt occurred.\\n\\n///\\n\\n/// # Return\\n\\n/// * Returns `Ok(true)` if a PMU sample occurred and was handled. \\n\\n/// * Returns `Ok(false)` if PMU isn't supported, or if PMU wasn't yet initialized, \\n\\n/// or if there was not a pending sampling interrupt. \\n\\n/// * Returns an `Err` if PMU is supported and initialized and a sample was pending, \\n\\n/// but an error occurred while logging the sample.\\n\\n///\\n\\npub fn handle_sample(stack_frame: &mut ExceptionStackFrame) -> Result<bool, &'static str> {\\n\\n // Check that PMU hardware exists and is supported on this machine.\\n\\n if *PMU_VERSION < MIN_PMU_VERSION {\\n\\n return Ok(false);\\n\\n }\\n\\n // Check that a PMU sampling event is currently pending.\\n\\n if rdmsr(IA32_PERF_GLOBAL_STAUS) == 0 {\\n\\n return Ok(false);\\n\\n }\\n\\n\\n\\n unsafe { wrmsr(IA32_PERF_GLOBAL_OVF_CTRL, CLEAR_PERF_STATUS_MSR); }\\n\\n\\n\\n let my_core_id = apic::get_my_apic_id();\\n\\n let event_mask = rdmsr(IA32_PERFEVTSEL0);\\n\\n\\n\\n let mut sampling_info = SAMPLING_INFO.lock();\\n\\n let mut samples = sampling_info.get_mut(&my_core_id)\\n\\n .ok_or(\\\"pmu_x86::handle_sample: Could not retrieve sampling information for this core\\\")?;\\n\\n\\n\\n let current_count = samples.sample_count;\\n\",\n \"file_path\": \"kernel/pmu_x86/src/lib.rs\",\n \"rank\": 26,\n \"score\": 391348.2914188261\n },\n {\n \"content\": \"/// This function returns the name of the crate to replace if required. \\n\\n/// Returns none if no crate is needed to be replaced. \\n\\npub fn get_crate_to_swap() -> Option<String> {\\n\\n\\n\\n #[cfg(not(use_crate_replacement))]\\n\\n {\\n\\n return null_swap_policy();\\n\\n }\\n\\n\\n\\n\\n\\n #[cfg(use_crate_replacement)]\\n\\n {\\n\\n #[cfg(not(use_iterative_replacement))]\\n\\n return simple_swap_policy();\\n\\n\\n\\n #[cfg(use_iterative_replacement)]\\n\\n return iterative_swap_policy() ;\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"kernel/fault_crate_swap/src/lib.rs\",\n \"rank\": 27,\n \"score\": 382009.2490633057\n },\n {\n \"content\": \"/// Adds the given `Task` reference to given core's runqueue.\\n\\npub fn add_task_to_specific_runqueue(which_core: u8, task: TaskRef) -> Result<(), &'static str>{\\n\\n RunQueue::add_task_to_specific_runqueue(which_core, task)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"kernel/runqueue/src/lib.rs\",\n \"rank\": 28,\n \"score\": 379951.3577393348\n },\n {\n \"content\": \"/// Changes the priority of the given task with the given priority level.\\n\\n/// Priority values must be between 40 (maximum priority) and 0 (minimum prriority).\\n\\npub fn set_priority(task: &TaskRef, priority: u8) -> Result<(), &'static str> {\\n\\n let priority = core::cmp::min(priority, MAX_PRIORITY);\\n\\n RunQueue::set_priority(task, priority)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"kernel/scheduler_priority/src/lib.rs\",\n \"rank\": 29,\n \"score\": 376628.47468942497\n },\n {\n \"content\": \"/// Shell call this function to check whether a task is requesting instant stdin flush.\\n\\n/// \\n\\n/// Error can occur when there is no IoControlFlags structure for that task.\\n\\npub fn is_requesting_instant_flush(task_id: &usize) -> Result<bool, &'static str> {\\n\\n let locked_flags = shared_maps::lock_flag_map();\\n\\n match locked_flags.get(task_id) {\\n\\n Some(flags) => {\\n\\n Ok(flags.stdin_instant_flush)\\n\\n },\\n\\n None => Err(\\\"no io control flags for this task\\\")\\n\\n }\\n\\n}\\n\\n\\n\\n/// Calls `print!()` with an extra newline ('\\\\n') appended to the end. \\n\\n#[macro_export]\\n\\nmacro_rules! println {\\n\\n ($fmt:expr) => (print!(concat!($fmt, \\\"\\\\n\\\")));\\n\\n ($fmt:expr, $($arg:tt)*) => (print!(concat!($fmt, \\\"\\\\n\\\"), $($arg)*));\\n\\n\\n\\n}\\n\\n\\n\\n/// The main printing macro, which simply writes to the current task's stdout stream.\\n\\n#[macro_export]\\n\\nmacro_rules! print {\\n\\n ($($arg:tt)*) => ({\\n\\n $crate::print_to_stdout_args(format_args!($($arg)*));\\n\\n });\\n\\n}\\n\\n\\n\\nuse core::fmt;\\n\\nuse bare_io::Write;\\n\",\n \"file_path\": \"applications/app_io/src/lib.rs\",\n \"rank\": 30,\n \"score\": 376293.3365553078\n },\n {\n \"content\": \"/// enable or disable the packet streaming\\n\\n/// also return the vec of data previously in the buffer which may be useful\\n\\npub fn mouse_packet_streaming(enable: bool) -> Result<Vec<u8>, &'static str> {\\n\\n if enable {\\n\\n if let Err(_e) = command_to_mouse(0xf4) {\\n\\n warn!(\\\"enable streaming failed\\\");\\n\\n Err(\\\"enable mouse streaming failed\\\")\\n\\n } else {\\n\\n // info!(\\\"enable streaming succeeded!!\\\");\\n\\n Ok(Vec::new())\\n\\n }\\n\\n }\\n\\n else {\\n\\n let mut buffer_data = Vec::new();\\n\\n if data_to_port2(0xf5) != 0xfa {\\n\\n for x in 0..15 {\\n\\n if x == 14 {\\n\\n warn!(\\\"disable mouse streaming failed\\\");\\n\\n return Err(\\\"disable mouse streaming failed\\\");\\n\\n }\\n\\n let response = ps2_read_data();\\n\\n\\n\",\n \"file_path\": \"kernel/ps2/src/lib.rs\",\n \"rank\": 31,\n \"score\": 375503.69543570344\n },\n {\n \"content\": \"/// Performs early-stage initialization for simple devices needed during early boot.\\n\\n///\\n\\n/// This includes:\\n\\n/// * local APICs ([`apic`]),\\n\\n/// * [`acpi`] tables for system configuration info, including the IOAPIC.\\n\\npub fn early_init(kernel_mmi: &mut MemoryManagementInfo) -> Result<(), &'static str> {\\n\\n // First, initialize the local apic info.\\n\\n apic::init(&mut kernel_mmi.page_table)?;\\n\\n \\n\\n // Then, parse the ACPI tables to acquire system configuration info.\\n\\n acpi::init(&mut kernel_mmi.page_table)?;\\n\\n\\n\\n Ok(())\\n\\n}\\n\\n\\n\\n\\n\",\n \"file_path\": \"kernel/device_manager/src/lib.rs\",\n \"rank\": 32,\n \"score\": 371455.4948536592\n },\n {\n \"content\": \"/// Returns the section matching the given `section_name` if there is a single match.\\n\\n/// \\n\\n/// If there are multiple matches, this returns an Error containing \\n\\n/// all of the matching section names separated by the newline character `'\\\\n'`.\\n\\nfn find_section(section_name: &str) -> Result<StrongSectionRef, String> {\\n\\n let namespace = get_my_current_namespace();\\n\\n let matching_symbols = namespace.find_symbols_starting_with(section_name);\\n\\n if matching_symbols.len() == 1 {\\n\\n return matching_symbols[0].1.upgrade()\\n\\n .ok_or_else(|| format!(\\\"Found matching symbol name but couldn't get reference to section\\\"));\\n\\n } else if matching_symbols.len() > 1 {\\n\\n return Err(matching_symbols.into_iter().map(|(k, _v)| k).collect::<Vec<String>>().join(\\\"\\\\n\\\"));\\n\\n } else {\\n\\n // continue on\\n\\n }\\n\\n\\n\\n // If it wasn't a global section in the symbol map, then we need to find its containing crate\\n\\n // and search that crate's symbols manually.\\n\\n let containing_crate_ref = get_containing_crate_name(section_name).get(0)\\n\\n .and_then(|cname| CrateNamespace::get_crate_starting_with(&namespace, &format!(\\\"{}-\\\", cname)))\\n\\n .or_else(|| get_containing_crate_name(section_name).get(1)\\n\\n .and_then(|cname| CrateNamespace::get_crate_starting_with(&namespace, &format!(\\\"{}-\\\", cname)))\\n\\n )\\n\\n .map(|(_cname, crate_ref, _ns)| crate_ref)\\n\",\n \"file_path\": \"applications/deps/src/lib.rs\",\n \"rank\": 33,\n \"score\": 368825.29379083513\n },\n {\n \"content\": \"/// Same as [`get_containing_crate_name()`](#get_containing_crate_name),\\n\\n/// but returns the substring `Range`s of where the parent crate names \\n\\n/// are located in the given `demangled_full_symbol` string.\\n\\n/// \\n\\n/// # Examples\\n\\n/// * `<*const T as core::fmt::Debug>::fmt` -> `[12..16]`\\n\\n/// * `<alloc::boxed::Box<T>>::into_unique` -> `[1..6]`\\n\\n/// * `<framebuffer::VirtualFramebuffer as display::Display>::fill_rectangle` -> `[1..13, 37..44]`\\n\\n/// * `keyboard::init` -> `[0..8]`\\n\\npub fn get_containing_crate_name_ranges(demangled_full_symbol: &str) -> Vec<Range<usize>> {\\n\\n let mut ranges: Vec<Range<usize>> = Vec::new();\\n\\n // the separator between independent parts of the symbol string\\n\\n const AS: &'static str = \\\" as \\\";\\n\\n // the index at which we are starting our search for a crate name\\n\\n let mut beginning_bound = Some(0);\\n\\n\\n\\n while let Some(beg) = beginning_bound {\\n\\n // Find the first occurrence of \\\"::\\\"; the crate name will be right before that.\\n\\n let end = demangled_full_symbol.get(beg..)\\n\\n .and_then(|s| s.find(\\\"::\\\"))\\n\\n .map(|end_idx| beg + end_idx);\\n\\n\\n\\n if let Some(end) = end {\\n\\n // If the above search for \\\"::\\\" passed an \\\" as \\\" substring, \\n\\n // we skip it and let the next iteration of the loop handle it to avoid doubly counting it.\\n\\n if demangled_full_symbol.get(beg..end).map(|s| s.contains(AS)) != Some(true) {\\n\\n // Find the beginning of the crate name, searching backwards from the \\\"end\\\"\\n\\n let start = demangled_full_symbol.get(beg..end)\\n\\n .and_then(|s| s.rfind(|c| !is_valid_crate_name_char(c))) // find the first char before the crate name that isn't part of the crate name\\n\",\n \"file_path\": \"kernel/crate_name_utils/src/lib.rs\",\n \"rank\": 34,\n \"score\": 367750.6082950745\n },\n {\n \"content\": \"/// Provides the most recent entry in the log for given crate\\n\\n/// Utility function for iterative crate replacement\\n\\npub fn get_the_most_recent_match(error_crate : &str) -> Option<FaultEntry> {\\n\\n\\n\\n #[cfg(not(downtime_eval))]\\n\\n debug!(\\\"getting the most recent match\\\");\\n\\n\\n\\n let mut fe :Option<FaultEntry> = None;\\n\\n for fault_entry in FAULT_LIST.lock().iter() {\\n\\n if let Some(crate_error_occured) = &fault_entry.crate_error_occured {\\n\\n let error_crate_name = crate_error_occured.clone();\\n\\n let error_crate_name_simple = error_crate_name.split(\\\"-\\\").next().unwrap_or_else(|| &error_crate_name);\\n\\n if error_crate_name_simple == error_crate {\\n\\n let item = fault_entry.clone();\\n\\n fe = Some(item);\\n\\n }\\n\\n }\\n\\n }\\n\\n\\n\\n if fe.is_none(){\\n\\n\\n\\n #[cfg(not(downtime_eval))]\\n\\n debug!(\\\"No recent entries for the given crate {}\\\", error_crate);\\n\\n }\\n\\n fe\\n\\n}\",\n \"file_path\": \"kernel/fault_log/src/lib.rs\",\n \"rank\": 35,\n \"score\": 366278.20432617544\n },\n {\n \"content\": \"/// Starts a new task that detects new console connections\\n\\n/// by waiting for new data to be received on serial ports.\\n\\n///\\n\\n/// Returns the newly-spawned detection task.\\n\\npub fn start_connection_detection() -> Result<TaskRef, &'static str> {\\n\\n\\tlet (sender, receiver) = async_channel::new_channel(4);\\n\\n\\tserial_port::set_connection_listener(sender);\\n\\n\\n\\n\\tspawn::new_task_builder(console_connection_detector, receiver)\\n\\n\\t\\t.name(\\\"console_connection_detector\\\".into())\\n\\n\\t\\t.spawn()\\n\\n}\\n\\n\\n\\npub struct Console<I, O, Backend> \\n\\n\\twhere I: bare_io::Read,\\n\\n\\t O: bare_io::Write,\\n\\n\\t\\t Backend: TerminalBackend,\\n\\n{\\n\\n\\tname: String,\\n\\n\\t_input: I,\\n\\n\\tterminal: TextTerminal<Backend>,\\n\\n\\t_output: PhantomData<O>,\\n\\n}\\n\\n\\n\",\n \"file_path\": \"kernel/console/src/lib.rs\",\n \"rank\": 36,\n \"score\": 365571.09612527635\n },\n {\n \"content\": \"pub fn rmain(matches: &Matches, opts: &Options) -> Result<(), &'static str> {\\n\\n\\n\\n let mut did_work = false;\\n\\n\\n\\n if let Some(i) = matches.opt_str(\\\"w\\\") {\\n\\n let num_tasks = i.parse::<usize>().map_err(|_e| \\\"couldn't parse number of num_tasks\\\")?;\\n\\n run_whole(num_tasks)?;\\n\\n did_work = true;\\n\\n }\\n\\n\\n\\n if let Some(i) = matches.opt_str(\\\"s\\\") {\\n\\n let iterations = i.parse::<usize>().map_err(|_e| \\\"couldn't parse number of num_tasks\\\")?;\\n\\n run_single(iterations)?;\\n\\n did_work = true;\\n\\n } \\n\\n\\n\\n if did_work {\\n\\n Ok(())\\n\\n }\\n\\n else {\\n\\n println!(\\\"Nothing was done. Please specify a type of evaluation task to run.\\\");\\n\\n print_usage(opts);\\n\\n Ok(())\\n\\n }\\n\\n}\\n\\n\\n\\n\\n\",\n \"file_path\": \"applications/rq_eval/src/lib.rs\",\n \"rank\": 37,\n \"score\": 364208.5968591212\n },\n {\n \"content\": \"pub fn rmain(matches: &Matches, _opts: &Options) -> Result<(), &'static str> {\\n\\n const TRIES: usize = 10;\\n\\n let mut mapper_normal = mapper_from_current();\\n\\n let mut mapper_spillful = MapperSpillful::new();\\n\\n\\n\\n let num_mappings = matches.opt_str(\\\"n\\\")\\n\\n .and_then(|i| i.parse::<usize>().ok())\\n\\n .unwrap_or(100);\\n\\n\\n\\n let size_in_pages = matches.opt_str(\\\"s\\\")\\n\\n .and_then(|i| i.parse::<usize>().ok())\\n\\n .unwrap_or(2);\\n\\n\\n\\n let use_spillful = matches.opt_present(\\\"p\\\");\\n\\n let verbose = matches.opt_present(\\\"v\\\");\\n\\n\\n\\n if num_mappings < 1 { \\n\\n return Err(\\\"invalid number of mappings specified.\\\")\\n\\n }\\n\\n\\n\",\n \"file_path\": \"applications/mm_eval/src/lib.rs\",\n \"rank\": 38,\n \"score\": 364208.5968591211\n },\n {\n \"content\": \"/// Iterates over the contents of the given directory to find crates within it. \\n\\n/// \\n\\n/// This directory should contain one .rmeta and .rlib file per crate, \\n\\n/// and those files are named as such:\\n\\n/// `\\\"lib<crate_name>-<hash>.[rmeta]\\\"`\\n\\n/// \\n\\n/// This function only looks at the `.rmeta` files in the given directory \\n\\n/// and extracts from that file name the name of the crate name as a String.\\n\\n/// \\n\\n/// Returns the set of discovered crates as a map, in which the key is the simple crate name \\n\\n/// (\\\"my_crate\\\") and the value is the full crate name with the hash included (\\\"my_crate-43462c60d48a531a\\\").\\n\\n/// The value can be used to define the path to crate's actual .rmeta/.rlib file.\\n\\nfn populate_crates_from_dir<P: AsRef<Path>>(dir_path: P) -> Result<HashMap<String, String>, io::Error> {\\n\\n let mut crates: HashMap<String, String> = HashMap::new();\\n\\n \\n\\n let dir_iter = WalkDir::new(dir_path)\\n\\n .into_iter()\\n\\n .filter_map(|res| res.ok());\\n\\n\\n\\n for dir_entry in dir_iter {\\n\\n if !dir_entry.file_type().is_file() { continue; }\\n\\n let path = dir_entry.path();\\n\\n if path.extension().and_then(|p| p.to_str()) == Some(RMETA_FILE_EXTENSION) {\\n\\n let filestem = path.file_stem().expect(\\\"no valid file stem\\\").to_string_lossy();\\n\\n if filestem.starts_with(\\\"lib\\\") {\\n\\n let crate_name_with_hash = &filestem[PREFIX_END ..];\\n\\n let crate_name_without_hash = crate_name_with_hash.split('-').next().unwrap();\\n\\n crates.insert(crate_name_without_hash.to_string(), crate_name_with_hash.to_string());\\n\\n } else {\\n\\n return Err(io::Error::new(\\n\\n io::ErrorKind::Other,\\n\\n format!(\\\"File {:?} is an .rmeta file that does not begin with 'lib' as expected.\\\", path),\\n\",\n \"file_path\": \"tools/theseus_cargo/src/main.rs\",\n \"rank\": 39,\n \"score\": 362042.4131036053\n },\n {\n \"content\": \"/// Returns the top-level directory that contains all of the namespaces. \\n\\npub fn get_namespaces_directory() -> Option<DirRef> {\\n\\n root::get_root().lock().get_dir(NAMESPACES_DIRECTORY_NAME)\\n\\n}\\n\\n\\n\\nlazy_static! {\\n\\n /// The thread-local storage (TLS) area \\\"image\\\" that is used as the initial data for each `Task`.\\n\\n /// When spawning a new task, the new task will create its own local TLS area\\n\\n /// with this `TlsInitializer` as the initial data values.\\n\\n /// \\n\\n /// # Implementation Notes/Shortcomings\\n\\n /// Currently, a single system-wide `TlsInitializer` instance is shared across all namespaces.\\n\\n /// In the future, each namespace should hold its own TLS sections in its TlsInitializer area.\\n\\n /// \\n\\n /// However, this is quite complex because each namespace must be aware of the TLS sections\\n\\n /// in BOTH its underlying recursive namespace AND its (multiple) \\\"parent\\\" namespace(s)\\n\\n /// that recursively depend on it, since no two TLS sections can conflict (have the same offset).\\n\\n /// \\n\\n /// Thus, we stick with a singleton `TlsInitializer` instance, which makes sense \\n\\n /// because it behaves much like an allocator, in that it reserves space (index ranges) in the TLS area.\\n\\n static ref TLS_INITIALIZER: Mutex<TlsInitializer> = Mutex::new(TlsInitializer::empty());\\n\\n}\\n\\n\\n\\n\\n\",\n \"file_path\": \"kernel/mod_mgmt/src/lib.rs\",\n \"rank\": 40,\n \"score\": 355910.05587729823\n },\n {\n \"content\": \"pub fn remove_node(args: Vec<String>) -> Result<(), String> {\\n\\n let mut opts = Options::new();\\n\\n opts.optflag(\\\"h\\\", \\\"help\\\", \\\"print this help menu\\\");\\n\\n opts.optflag(\\\"r\\\", \\\"recursive\\\", \\\"recursively remove directories and their contents\\\");\\n\\n \\n\\n let matches = match opts.parse(&args) {\\n\\n Ok(m) => m,\\n\\n Err(e) => {\\n\\n print_usage(opts);\\n\\n return Err(e.to_string());\\n\\n }\\n\\n };\\n\\n\\n\\n if matches.opt_present(\\\"h\\\") {\\n\\n print_usage(opts);\\n\\n return Ok(());\\n\\n }\\n\\n\\n\\n\\n\\n let taskref = match task::get_my_current_task() {\\n\",\n \"file_path\": \"applications/rm/src/lib.rs\",\n \"rank\": 41,\n \"score\": 355705.60782637005\n },\n {\n \"content\": \"/// Starts the first applications that run in Theseus \\n\\n/// by creating a new \\\"default\\\" application namespace\\n\\n/// and spawning the first application `Task`(s). \\n\\n/// \\n\\n/// Currently this only spawns a shell (terminal),\\n\\n/// but in the future it could spawn a fuller desktop environment. \\n\\n/// \\n\\n/// Kernel initialization routines should be complete before invoking this. \\n\\npub fn start() -> Result<(), &'static str> {\\n\\n let new_app_ns = mod_mgmt::create_application_namespace(None)?;\\n\\n let (shell_file, _ns) = CrateNamespace::get_crate_object_file_starting_with(&new_app_ns, \\\"shell-\\\")\\n\\n .ok_or(\\\"Couldn't find shell application in default app namespace\\\")?;\\n\\n\\n\\n let path = Path::new(shell_file.lock().get_absolute_path());\\n\\n info!(\\\"Starting first application: crate at {:?}\\\", path);\\n\\n // Spawn the default shell\\n\\n spawn::new_application_task_builder(path, Some(new_app_ns))?\\n\\n .name(\\\"default_shell\\\".to_string())\\n\\n .spawn()?;\\n\\n\\n\\n Ok(())\\n\\n}\\n\",\n \"file_path\": \"kernel/first_application/src/lib.rs\",\n \"rank\": 42,\n \"score\": 352575.5810519779\n },\n {\n \"content\": \"/// Initializes the tasks virtual filesystem directory within the root directory.\\n\\npub fn init() -> Result<(), &'static str> {\\n\\n TaskFs::new()?;\\n\\n Ok(())\\n\\n}\\n\\n\\n\\n\\n\\n/// The top level directory that includes a dynamically-generated list of all `Task`s,\\n\\n/// each comprising a `TaskDir`.\\n\\n/// This directory exists in the root directory.\\n\\npub struct TaskFs { }\\n\\n\\n\\nimpl TaskFs {\\n\\n fn new() -> Result<DirRef, &'static str> {\\n\\n let root = root::get_root();\\n\\n let dir_ref = Arc::new(Mutex::new(TaskFs { })) as DirRef;\\n\\n root.lock().insert(FileOrDir::Dir(dir_ref.clone()))?;\\n\\n Ok(dir_ref)\\n\\n }\\n\\n\\n\\n fn get_self_pointer(&self) -> Option<DirRef> {\\n\",\n \"file_path\": \"kernel/task_fs/src/lib.rs\",\n \"rank\": 43,\n \"score\": 352315.04485890386\n },\n {\n \"content\": \"/// Iterates over the contents of the given directory to find crates within it. \\n\\n/// \\n\\n/// Crates are discovered by looking for a directory that contains a `Cargo.toml` file. \\n\\n/// \\n\\n/// Returns the set of unique crate names. \\n\\nfn populate_crates_from_dir<P: AsRef<Path>>(dir_path: P) -> Result<HashSet<String>, io::Error> {\\n\\n let mut crates: HashSet<String> = HashSet::new();\\n\\n \\n\\n let dir_iter = WalkDir::new(dir_path)\\n\\n .into_iter()\\n\\n .filter_map(|res| res.ok());\\n\\n // .filter(|entry| entry.path().is_file() && entry.path().extension() == Some(object_file_extension))\\n\\n // .filter_map(|entry| entry.path().file_name()\\n\\n // .map(|fname| {\\n\\n // (\\n\\n // fname.to_string_lossy().to_string().into(), \\n\\n // entry.path().to_path_buf()\\n\\n // )\\n\\n // })\\n\\n // );\\n\\n\\n\\n for dir_entry in dir_iter {\\n\\n if dir_entry.file_type().is_file() && dir_entry.file_name() == \\\"Cargo.toml\\\" {\\n\\n // the parent of this dir_entry is a crate directory\\n\\n let parent_crate_dir = dir_entry.path().parent().ok_or_else(|| {\\n\",\n \"file_path\": \"tools/copy_latest_crate_objects/src/main.rs\",\n \"rank\": 44,\n \"score\": 350284.11635661166\n },\n {\n \"content\": \"/// Changes the priority of the given task with the given priority level.\\n\\n/// Priority values must be between 40 (maximum priority) and 0 (minimum prriority).\\n\\n/// This function returns an error when a scheduler without priority is loaded. \\n\\npub fn set_priority(_task: &TaskRef, _priority: u8) -> Result<(), &'static str> {\\n\\n #[cfg(priority_scheduler)] {\\n\\n scheduler_priority::set_priority(_task, _priority)\\n\\n }\\n\\n #[cfg(not(priority_scheduler))] {\\n\\n Err(\\\"no scheduler that uses task priority is currently loaded\\\")\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"kernel/scheduler/src/lib.rs\",\n \"rank\": 45,\n \"score\": 350062.594677154\n },\n {\n \"content\": \"/// Outputs the given section's weak dependents, i.e.,\\n\\n/// the sections that depend on the given section.\\n\\n/// \\n\\n/// If there are multiple matches, this returns an Error containing \\n\\n/// all of the matching section names separated by the newline character `'\\\\n'`.\\n\\nfn sections_dependent_on_me(section_name: &str) -> Result<(), String> {\\n\\n let sec = find_section(section_name)?;\\n\\n println!(\\\"Sections that depend on {} (weak dependents):\\\", sec.name);\\n\\n for dependent_sec in sec.inner.read().sections_dependent_on_me.iter().filter_map(|weak_dep| weak_dep.section.upgrade()) {\\n\\n if verbose!() { \\n\\n println!(\\\" {} in {:?}\\\", dependent_sec.name, dependent_sec.parent_crate.upgrade());\\n\\n } else {\\n\\n println!(\\\" {}\\\", dependent_sec.name);\\n\\n }\\n\\n }\\n\\n Ok(())\\n\\n}\\n\\n\\n\\n\\n\",\n \"file_path\": \"applications/deps/src/lib.rs\",\n \"rank\": 46,\n \"score\": 349886.6792293177\n },\n {\n \"content\": \"/// Outputs the given section's strong dependencies, i.e.,\\n\\n/// the sections that the given section depends on.\\n\\n/// \\n\\n/// If there are multiple matches, this returns an Error containing \\n\\n/// all of the matching section names separated by the newline character `'\\\\n'`.\\n\\nfn sections_i_depend_on(section_name: &str) -> Result<(), String> {\\n\\n let sec = find_section(section_name)?;\\n\\n println!(\\\"Sections that {} depends on (strong dependencies):\\\", sec.name);\\n\\n for dependency_sec in sec.inner.read().sections_i_depend_on.iter().map(|dep| &dep.section) {\\n\\n if verbose!() { \\n\\n println!(\\\" {} in {:?}\\\", dependency_sec.name, dependency_sec.parent_crate.upgrade());\\n\\n } else {\\n\\n println!(\\\" {}\\\", dependency_sec.name);\\n\\n }\\n\\n }\\n\\n Ok(())\\n\\n}\\n\\n\\n\\n\\n\",\n \"file_path\": \"applications/deps/src/lib.rs\",\n \"rank\": 47,\n \"score\": 349886.6792293177\n },\n {\n \"content\": \"/// Create a new application `CrateNamespace` that uses the default application directory \\n\\n/// and is structured atop the given `recursive_namespace`. \\n\\n/// If no `recursive_namespace` is provided, the default initial kernel namespace will be used. \\n\\n/// \\n\\n/// # Return\\n\\n/// The returned `CrateNamespace` will itself be empty, having no crates and no symbols in its map.\\n\\n/// \\n\\npub fn create_application_namespace(recursive_namespace: Option<Arc<CrateNamespace>>) -> Result<Arc<CrateNamespace>, &'static str> {\\n\\n // (1) use the initial kernel CrateNamespace as the new app namespace's recursive namespace if none was provided.\\n\\n let recursive_namespace = recursive_namespace\\n\\n .or_else(|| get_initial_kernel_namespace().cloned())\\n\\n .ok_or(\\\"initial kernel CrateNamespace not yet initialized\\\")?;\\n\\n // (2) get the directory where the default app namespace should have been populated when mod_mgmt was inited.\\n\\n let default_app_namespace_name = CrateType::Application.default_namespace_name().to_string(); // this will be \\\"_applications\\\"\\n\\n let default_app_namespace_dir = get_namespaces_directory()\\n\\n .and_then(|ns_dir| ns_dir.lock().get_dir(&default_app_namespace_name))\\n\\n .ok_or(\\\"Couldn't find the directory for the default application CrateNamespace\\\")?;\\n\\n // (3) create the actual new application CrateNamespace.\\n\\n let new_app_namespace = Arc::new(CrateNamespace::new(\\n\\n default_app_namespace_name,\\n\\n NamespaceDir::new(default_app_namespace_dir),\\n\\n Some(recursive_namespace),\\n\\n ));\\n\\n\\n\\n Ok(new_app_namespace)\\n\\n}\\n\\n\\n\\n\\n\",\n \"file_path\": \"kernel/mod_mgmt/src/lib.rs\",\n \"rank\": 48,\n \"score\": 349229.9302905223\n },\n {\n \"content\": \"/// Helper function to allocate memory at required address\\n\\n/// \\n\\n/// # Arguments\\n\\n/// * `mem_base`: starting physical address of the region that need to be allocated\\n\\n/// * `mem_size_in_bytes`: size of the region that needs to be allocated \\n\\npub fn allocate_memory(mem_base: PhysicalAddress, mem_size_in_bytes: usize) -> Result<MappedPages, &'static str> {\\n\\n // set up virtual pages and physical frames to be mapped\\n\\n let pages_nic = allocate_pages_by_bytes(mem_size_in_bytes)\\n\\n .ok_or(\\\"NicInit::mem_map(): couldn't allocate virtual page!\\\")?;\\n\\n let frames_nic = allocate_frames_by_bytes_at(mem_base, mem_size_in_bytes)\\n\\n .map_err(|_e| \\\"NicInit::mem_map(): couldn't allocate physical frames!\\\")?;\\n\\n\\n\\n // debug!(\\\"NicInit: memory base: {:#X}, memory size: {}\\\", mem_base, mem_size_in_bytes);\\n\\n\\n\\n let kernel_mmi_ref = get_kernel_mmi_ref().ok_or(\\\"NicInit::mem_map(): KERNEL_MMI was not yet initialized!\\\")?;\\n\\n let mut kernel_mmi = kernel_mmi_ref.lock();\\n\\n let nic_mapped_page = kernel_mmi.page_table.map_allocated_pages_to(pages_nic, frames_nic, NIC_MAPPING_FLAGS)?;\\n\\n\\n\\n Ok(nic_mapped_page)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"kernel/nic_initialization/src/lib.rs\",\n \"rank\": 49,\n \"score\": 346913.2801913284\n },\n {\n \"content\": \"/// Initially maps the base APIC MMIO register frames so that we can know which LAPIC (core) we are.\\n\\n/// This only does something for apic/xapic systems, it does nothing for x2apic systems, as required.\\n\\npub fn init(_page_table: &mut PageTable) -> Result<(), &'static str> {\\n\\n let x2 = has_x2apic();\\n\\n debug!(\\\"is x2apic? {}. IA32_APIC_BASE (phys addr): {:X?}\\\", \\n\\n x2, PhysicalAddress::new(rdmsr(IA32_APIC_BASE) as usize)\\n\\n );\\n\\n\\n\\n if !x2 {\\n\\n // Ensure the local apic is enabled in xapic mode, otherwise we'll get a General Protection fault\\n\\n unsafe { wrmsr(IA32_APIC_BASE, rdmsr(IA32_APIC_BASE) | IA32_APIC_XAPIC_ENABLE); }\\n\\n }\\n\\n\\n\\n Ok(())\\n\\n}\\n\\n\\n\\n\\n\",\n \"file_path\": \"kernel/apic/src/lib.rs\",\n \"rank\": 50,\n \"score\": 346884.4432456855\n },\n {\n \"content\": \"/// Parses the system's ACPI tables \\n\\npub fn init(page_table: &mut PageTable) -> Result<(), &'static str> {\\n\\n // The first step is to search for the RSDP (Root System Descriptor Pointer),\\n\\n // which contains the physical address of the RSDT/XSDG (Root/Extended System Descriptor Table).\\n\\n let rsdp = Rsdp::get_rsdp(page_table)?;\\n\\n let rsdt_phys_addr = rsdp.sdt_address();\\n\\n debug!(\\\"RXSDT is located in Frame {:#X}\\\", rsdt_phys_addr);\\n\\n\\n\\n // Now, we get the actual RSDT/XSDT\\n\\n {\\n\\n let mut acpi_tables = ACPI_TABLES.lock();\\n\\n let (sdt_signature, sdt_total_length) = acpi_tables.map_new_table(rsdt_phys_addr, page_table)?;\\n\\n acpi_table_handler(&mut acpi_tables, sdt_signature, sdt_total_length, rsdt_phys_addr)?;\\n\\n }\\n\\n let sdt_addresses: Vec<PhysicalAddress> = {\\n\\n let acpi_tables = ACPI_TABLES.lock();\\n\\n let rxsdt = rsdt::RsdtXsdt::get(&acpi_tables).ok_or(\\\"couldn't get RSDT or XSDT from ACPI tables\\\")?;\\n\\n rxsdt.addresses().collect()\\n\\n };\\n\\n\\n\\n // The RSDT/XSDT tells us where all of the rest of the ACPI tables exist.\\n\",\n \"file_path\": \"kernel/acpi/src/lib.rs\",\n \"rank\": 51,\n \"score\": 346879.1935156811\n },\n {\n \"content\": \"/// Spawns an idle task on the given `core` if specified, otherwise on the current core. \\n\\n/// Then, it adds adds the new idle task to that core's runqueue.\\n\\npub fn create_idle_task(core: Option<u8>) -> Result<TaskRef, &'static str> {\\n\\n let apic_id = core.unwrap_or_else(|| get_my_apic_id());\\n\\n debug!(\\\"Spawning a new idle task on core {}\\\", apic_id);\\n\\n\\n\\n new_task_builder(dummy_idle_task, apic_id)\\n\\n .name(format!(\\\"idle_task_core_{}\\\", apic_id))\\n\\n .idle(apic_id)\\n\\n .spawn_restartable()\\n\\n}\\n\\n\\n\\n/// Dummy `idle_task` to be used if original `idle_task` crashes.\\n\\n/// \\n\\n/// Note: the current spawn API does not support spawning a task with the return type `!`,\\n\\n/// so we use `()` here instead. \\n\",\n \"file_path\": \"kernel/spawn/src/lib.rs\",\n \"rank\": 52,\n \"score\": 345838.73017929215\n },\n {\n \"content\": \"/// A convenience function to poll the given network interface (i.e., flush tx/rx).\\n\\n/// Returns true if any packets were sent or received through that interface on the given `sockets`.\\n\\npub fn poll_iface(iface: &NetworkInterfaceRef, sockets: &mut SocketSet, startup_time: u64) -> Result<bool, &'static str> {\\n\\n let timestamp: i64 = millis_since(startup_time)?\\n\\n .try_into()\\n\\n .map_err(|_e| \\\"millis_since() u64 timestamp was larger than i64\\\")?;\\n\\n // debug!(\\\"calling iface.poll() with timestamp: {:?}\\\", timestamp);\\n\\n let packets_were_sent_or_received = match iface.lock().poll(sockets, Instant::from_millis(timestamp)) {\\n\\n Ok(b) => b,\\n\\n Err(err) => {\\n\\n warn!(\\\"smoltcp_helper: poll error: {}\\\", err);\\n\\n false\\n\\n }\\n\\n };\\n\\n Ok(packets_were_sent_or_received)\\n\\n}\\n\",\n \"file_path\": \"kernel/smoltcp_helper/src/lib.rs\",\n \"rank\": 53,\n \"score\": 345757.92634408025\n },\n {\n \"content\": \"/// Convenience function that removes the given `file` from its parent directory \\n\\n/// and inserts it into the given destination directory. \\n\\n/// \\n\\n/// # Return\\n\\n/// If the file ends up replacing a file/dir node in the `dest_dir`, this returns a tuple of:\\n\\n/// 1. The node that was in the `dest_dir` that got replaced by the given `file`,\\n\\n/// 2. The parent directory that originally contained the given `file`. This is useful for realizing a file \\\"swap\\\" operation.\\n\\n/// \\n\\n/// # Locking / Deadlock\\n\\n/// This function obtains the lock on both `file`, the `file`'s parent directory, and the `dest_dir`. \\n\\nfn move_file(file: &FileRef, dest_dir: &DirRef) -> Result<Option<(FileOrDir, DirRef)>, &'static str> {\\n\\n let parent = file.lock().get_parent_dir().ok_or(\\\"couldn't get file's parent directory\\\")?;\\n\\n // This section is redundent as it is checked before calling the function\\n\\n // if Arc::ptr_eq(&parent, dest_dir) {\\n\\n // #[cfg(not(downtime_eval))]\\n\\n // trace!(\\\"swap_crates::move_file(): skipping move between same directory {:?} for file {:?}\\\", \\n\\n // dest_dir.try_lock().map(|f| f.get_absolute_path()), file.try_lock().map(|f| f.get_absolute_path())\\n\\n // );\\n\\n // return Ok(None);\\n\\n // }\\n\\n\\n\\n // Perform the actual move operation.\\n\\n let mut removed_file = parent.lock().remove(&FileOrDir::File(Arc::clone(file))).ok_or(\\\"Couldn't remove file from its parent directory\\\")?;\\n\\n removed_file.set_parent_dir(Arc::downgrade(dest_dir));\\n\\n let res = dest_dir.lock().insert(removed_file.clone());\\n\\n \\n\\n // Log success or failure\\n\\n match res {\\n\\n Ok(replaced_file) => {\\n\\n #[cfg(not(any(loscd_eval, downtime_eval)))]\\n\",\n \"file_path\": \"kernel/crate_swap/src/lib.rs\",\n \"rank\": 54,\n \"score\": 345718.62232842157\n },\n {\n \"content\": \"pub fn rmain(matches: &Matches, _opts: Options, address: IpAddress) -> Result<(), &'static str> {\\n\\n\\n\\n \\n\\n let mut count = 4;\\n\\n let mut interval = 1000;\\n\\n let mut timeout = 5000;\\n\\n let mut buffer_size = 40;\\n\\n let mut verbose = false;\\n\\n let did_work = true;\\n\\n\\n\\n\\n\\n if let Some(i) = matches.opt_default(\\\"c\\\", \\\"4\\\") {\\n\\n count = i.parse::<usize>().map_err(|_e| \\\"couldn't parse number of packets\\\")?;\\n\\n }\\n\\n if let Some(i) = matches.opt_default(\\\"i\\\", \\\"1000\\\") {\\n\\n interval = i.parse::<u64>().map_err(|_e| \\\"couldn't parse interval\\\")?;\\n\\n }\\n\\n if let Some(i) = matches.opt_default(\\\"t\\\", \\\"5000\\\") {\\n\\n timeout = i.parse::<u64>().map_err(|_e| \\\"couldn't parse timeout length\\\")?;\\n\\n }\\n\",\n \"file_path\": \"applications/ping/src/lib.rs\",\n \"rank\": 55,\n \"score\": 345240.7451861227\n },\n {\n \"content\": \"pub fn main(_args: Vec<String>) -> isize {\\n\\n print_fault_log();\\n\\n 0\\n\\n}\\n\",\n \"file_path\": \"applications/print_fault_log/src/lib.rs\",\n \"rank\": 56,\n \"score\": 345088.5538016539\n },\n {\n \"content\": \"fn num_deps_section(section_name: &str) -> Result<(), String> {\\n\\n let section = find_section(section_name)?;\\n\\n let (s, w, i) = section_dependency_count(§ion);\\n\\n println!(\\\"Section {}'s Dependency Count:\\\\nStrong: {}\\\\nWeak: {}\\\\nIntrnl: {}\\\", section_name, s, w, i);\\n\\n Ok(())\\n\\n}\\n\\n\\n\",\n \"file_path\": \"applications/deps/src/lib.rs\",\n \"rank\": 57,\n \"score\": 344679.71595668735\n },\n {\n \"content\": \"/// Wrapper function used to measure file read and file read with open. \\n\\n/// Accepts a bool argument. If true includes the latency to open a file\\n\\n/// If false only measure the time to read from file.\\n\\n/// Actual measuring is deferred to `do_fs_read_with_size` function\\n\\nfn do_fs_read(with_open: bool) -> Result<(), &'static str>{\\n\\n\\tlet fsize_kb = 1024;\\n\\n\\tprintlninfo!(\\\"File size : {} KB\\\", fsize_kb);\\n\\n\\tprintlninfo!(\\\"Read buf size : {} KB\\\", READ_BUF_SIZE / 1024);\\n\\n\\tprintlninfo!(\\\"========================================\\\");\\n\\n\\n\\n\\tlet overhead_ct = hpet_timing_overhead()?;\\n\\n\\n\\n\\tdo_fs_read_with_size(overhead_ct, fsize_kb, with_open)?;\\n\\n\\tif with_open {\\n\\n\\t\\tprintlninfo!(\\\"This test is equivalent to `bw_file_rd open2close` in LMBench\\\");\\n\\n\\t} else {\\n\\n\\t\\tprintlninfo!(\\\"This test is equivalent to `bw_file_rd io_only` in LMBench\\\");\\n\\n\\t}\\n\\n\\tOk(())\\n\\n}\\n\\n\\n\",\n \"file_path\": \"applications/bm/src/lib.rs\",\n \"rank\": 58,\n \"score\": 343959.0617462259\n },\n {\n \"content\": \"fn kill_task(task_id: usize, reap: bool) -> Result<(), String> {\\n\\n if let Some(task_ref) = task::get_task(task_id) {\\n\\n if task_ref.kill(task::KillReason::Requested)\\n\\n .and_then(|_| runqueue::remove_task_from_all(&task_ref))\\n\\n .is_ok() \\n\\n {\\n\\n println!(\\\"Killed task {}\\\", &*task_ref);\\n\\n if reap {\\n\\n match task_ref.take_exit_value() {\\n\\n Some(exit_val) => { \\n\\n println!(\\\"Reaped task {}, got exit value {}\\\", task_id, debugit!(exit_val));\\n\\n Ok(())\\n\\n }\\n\\n _ => {\\n\\n Err(format!(\\\"Failed to reap task {}\\\", task_id))\\n\\n }\\n\\n }\\n\\n } \\n\\n else {\\n\\n // killed the task successfully, no reap request, so return success.\\n\",\n \"file_path\": \"applications/kill/src/lib.rs\",\n \"rank\": 59,\n \"score\": 342342.30175521155\n },\n {\n \"content\": \"/// Allocates memory for the NIC registers\\n\\n/// \\n\\n/// # Arguments \\n\\n/// * `dev`: reference to pci device \\n\\n/// * `mem_base`: starting physical address of the device's memory mapped registers\\n\\npub fn allocate_device_register_memory(dev: &PciDevice, mem_base: PhysicalAddress) -> Result<MappedPages, &'static str> {\\n\\n //find out amount of space needed\\n\\n let mem_size_in_bytes = dev.determine_mem_size(0) as usize;\\n\\n\\n\\n allocate_memory(mem_base, mem_size_in_bytes)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"kernel/nic_initialization/src/lib.rs\",\n \"rank\": 60,\n \"score\": 342225.3246529746\n },\n {\n \"content\": \"fn run(filename: String) -> Result<(), String> {\\n\\n\\n\\n // Acquire key event queue.\\n\\n let key_event_queue = app_io::take_key_event_queue()?;\\n\\n let key_event_queue = (*key_event_queue).as_ref()\\n\\n .ok_or(\\\"failed to take key event reader\\\")?;\\n\\n\\n\\n // Read the whole file to a String.\\n\\n let content = get_content_string(filename)?;\\n\\n\\n\\n // Get it run.\\n\\n let map = parse_content(&content)?;\\n\\n\\n\\n Ok(event_handler_loop(&content, &map, key_event_queue)?)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"applications/less/src/lib.rs\",\n \"rank\": 61,\n \"score\": 341494.9911143106\n },\n {\n \"content\": \"/// Read the whole file to a String.\\n\\nfn get_content_string(file_path: String) -> Result<String, String> {\\n\\n let taskref = match task::get_my_current_task() {\\n\\n Some(t) => t,\\n\\n None => {\\n\\n return Err(\\\"failed to get current task\\\".to_string());\\n\\n }\\n\\n };\\n\\n\\n\\n // grabs the current working directory pointer; this is scoped so that we drop the lock on the task as soon as we get the working directory pointer\\n\\n let curr_wr = Arc::clone(&taskref.get_env().lock().working_dir);\\n\\n let path = Path::new(file_path);\\n\\n \\n\\n // navigate to the filepath specified by first argument\\n\\n match path.get(&curr_wr) {\\n\\n Some(file_dir_enum) => { \\n\\n match file_dir_enum {\\n\\n FileOrDir::Dir(directory) => {\\n\\n Err(format!(\\\"{:?} is a directory, cannot 'less' non-files.\\\", directory.lock().get_name()))\\n\\n }\\n\\n FileOrDir::File(file) => {\\n\",\n \"file_path\": \"applications/less/src/lib.rs\",\n \"rank\": 62,\n \"score\": 341229.3003963408\n },\n {\n \"content\": \"/// Convenience function for converting a byte stream\\n\\n/// that is delimited by newlines into a list of Strings.\\n\\npub fn as_lines(bytes: &[u8]) -> Result<Vec<String>, &'static str> {\\n\\n str::from_utf8(bytes)\\n\\n .map_err(|_e| \\\"couldn't convert file into a UTF8 string\\\")\\n\\n .map(|files| files.lines().map(|s| String::from(s)).collect())\\n\\n}\\n\\n\\n\\n\\n\\n/// A representation of an diff file used to define an evolutionary crate swapping update.\\n\\npub struct Diff {\\n\\n /// A list of tuples in which the first element is the old crate and the second element is the new crate.\\n\\n /// If the first element is the empty string, the second element is a new addition (replacing nothing),\\n\\n /// and if the second element is the empty string, the first element is to be removed without replacement.\\n\\n pub pairs: Vec<(String, String)>,\\n\\n /// The list of state transfer functions which should be applied at the end of a crate swapping operation.\\n\\n pub state_transfer_functions: Vec<String>,\\n\\n}\\n\\n\\n\\n\\n\",\n \"file_path\": \"kernel/ota_update_client/src/lib.rs\",\n \"rank\": 64,\n \"score\": 335697.1878498163\n },\n {\n \"content\": \"/// Measures the overhead of using the hpet timer. \\n\\n/// Calls `timing_overhead_inner` multiple times and averages the value. \\n\\n/// Overhead is a count value. It is not time. \\n\\npub fn hpet_timing_overhead() -> Result<u64, &'static str> {\\n\\n\\tconst TRIES: u64 = 10;\\n\\n\\tlet mut tries: u64 = 0;\\n\\n\\tlet mut max: u64 = core::u64::MIN;\\n\\n\\tlet mut min: u64 = core::u64::MAX;\\n\\n\\n\\n\\tfor _ in 0..TRIES {\\n\\n\\t\\tlet overhead = hpet_timing_overhead_inner()?;\\n\\n\\t\\ttries += overhead;\\n\\n\\t\\tif overhead > max {max = overhead;}\\n\\n\\t\\tif overhead < min {min = overhead;}\\n\\n\\t}\\n\\n\\n\\n\\tlet overhead = tries / TRIES as u64;\\n\\n\\tlet err = (overhead * 10 + overhead * THRESHOLD_ERROR_RATIO) / 10;\\n\\n\\tif \\tmax - overhead > err || overhead - min > err {\\n\\n\\t\\twarn!(\\\"hpet_timing_overhead diff is too big: {} ({} - {}) ctr\\\", max-min, max, min);\\n\\n\\t}\\n\\n\\tinfo!(\\\"HPET timing overhead is {} ticks\\\", overhead);\\n\\n\\tOk(overhead)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"kernel/libtest/src/lib.rs\",\n \"rank\": 65,\n \"score\": 335566.3317660459\n },\n {\n \"content\": \"/// Returns the frequency of the TSC for the system, \\n\\n/// currently measured using the PIT clock for calibration.\\n\\npub fn get_tsc_frequency() -> Result<u128, &'static str> {\\n\\n // this is a soft state, so it's not a form of state spill\\n\\n static TSC_FREQUENCY: AtomicUsize = AtomicUsize::new(0);\\n\\n\\n\\n let freq = TSC_FREQUENCY.load(Ordering::SeqCst) as u128;\\n\\n \\n\\n if freq != 0 {\\n\\n Ok(freq)\\n\\n }\\n\\n else {\\n\\n // a freq of zero means it hasn't yet been initialized.\\n\\n let start = tsc_ticks();\\n\\n // wait 10000 us (10 ms)\\n\\n pit_clock::pit_wait(10000)?;\\n\\n let end = tsc_ticks(); \\n\\n\\n\\n let diff = end.sub(&start).ok_or(\\\"couldn't subtract end-start TSC tick values\\\")?;\\n\\n let tsc_freq = diff.into() * 100; // multiplied by 100 because we measured a 10ms interval\\n\\n info!(\\\"TSC frequency calculated by PIT is: {}\\\", tsc_freq);\\n\\n TSC_FREQUENCY.store(tsc_freq as usize, Ordering::Release);\\n\\n Ok(tsc_freq)\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"kernel/tsc/src/lib.rs\",\n \"rank\": 66,\n \"score\": 335512.40827376756\n },\n {\n \"content\": \"/// returns Ok(()) if everything was handled properly.\\n\\n/// Otherwise, returns an error string.\\n\\npub fn handle_keyboard_input(scan_code: u8, extended: bool) -> Result<(), &'static str> {\\n\\n // SAFE: no real race conditions with keyboard presses\\n\\n let modifiers = unsafe { &mut KBD_MODIFIERS };\\n\\n // debug!(\\\"KBD_MODIFIERS before {}: {:?}\\\", scan_code, modifiers);\\n\\n\\n\\n // first, update the modifier keys\\n\\n match scan_code {\\n\\n x if x == Keycode::Control as u8 => { \\n\\n modifiers.insert(if extended { KeyboardModifiers::CONTROL_RIGHT } else { KeyboardModifiers::CONTROL_LEFT});\\n\\n }\\n\\n x if x == Keycode::Alt as u8 => { modifiers.insert(KeyboardModifiers::ALT); }\\n\\n x if x == Keycode::LeftShift as u8 => { modifiers.insert(KeyboardModifiers::SHIFT_LEFT); }\\n\\n x if x == Keycode::RightShift as u8 => { modifiers.insert(KeyboardModifiers::SHIFT_RIGHT); }\\n\\n x if x == Keycode::SuperKeyLeft as u8 => { modifiers.insert(KeyboardModifiers::SUPER_KEY_LEFT); }\\n\\n x if x == Keycode::SuperKeyRight as u8 => { modifiers.insert(KeyboardModifiers::SUPER_KEY_RIGHT); }\\n\\n\\n\\n x if x == Keycode::Control as u8 + KEY_RELEASED_OFFSET => {\\n\\n modifiers.remove(if extended { KeyboardModifiers::CONTROL_RIGHT } else { KeyboardModifiers::CONTROL_LEFT});\\n\\n }\\n\\n x if x == Keycode::Alt as u8 + KEY_RELEASED_OFFSET => { modifiers.remove(KeyboardModifiers::ALT); }\\n\",\n \"file_path\": \"kernel/keyboard/src/lib.rs\",\n \"rank\": 67,\n \"score\": 331859.0676609294\n },\n {\n \"content\": \"/// Crate names must be only alphanumeric characters, an underscore, or a dash.\\n\\n/// \\n\\n/// See: <https://www.reddit.com/r/rust/comments/4rlom7/what_characters_are_allowed_in_a_crate_name/>\\n\\npub fn is_valid_crate_name_char(c: char) -> bool {\\n\\n char::is_alphanumeric(c) || \\n\\n c == '_' || \\n\\n c == '-'\\n\\n}\\n\\n\\n\",\n \"file_path\": \"kernel/crate_name_utils/src/lib.rs\",\n \"rank\": 68,\n \"score\": 330602.76959084754\n },\n {\n \"content\": \"/// Returns a reference to the current task.\\n\\npub fn get_my_current_task() -> Option<&'static TaskRef> {\\n\\n get_task_local_data().map(|tld| &tld.current_taskref)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"kernel/task/src/lib.rs\",\n \"rank\": 69,\n \"score\": 328585.5125592143\n },\n {\n \"content\": \"/// Parses a series of diff lines into a representation of an update diff.\\n\\n/// \\n\\n/// # Arguments\\n\\n/// * `diffs`: a list of lines, in which each line is a diff entry.\\n\\n/// \\n\\n/// # Example diff entry formats\\n\\n/// ```\\n\\n/// a#ps.o -> a#ps.o\\n\\n/// k#runqueue-d04869f0baadb1bd.o -> k#runqueue-d04869f0baadb1bd.o\\n\\n/// - k#scheduler-7f6134ffbb934a27.o\\n\\n/// + k#spawn-f1c87a8fc4e03893.o\\n\\n/// ```\\n\\npub fn parse_diff_lines(diffs: &Vec<String>) -> Result<Diff, &'static str> {\\n\\n let mut pairs: Vec<(String, String)> = Vec::with_capacity(diffs.len());\\n\\n let mut state_transfer_functions: Vec<String> = Vec::new();\\n\\n for diff in diffs {\\n\\n // addition of new crate\\n\\n if diff.starts_with(\\\"+\\\") {\\n\\n pairs.push((\\n\\n String::new(), \\n\\n diff.get(1..).ok_or(\\\"error parsing (+) diff line\\\")?.trim().to_string(),\\n\\n ));\\n\\n } \\n\\n // removal of old crate\\n\\n else if diff.starts_with(\\\"-\\\") {\\n\\n pairs.push((\\n\\n diff.get(1..).ok_or(\\\"error parsing (-) diff line\\\")?.trim().to_string(), \\n\\n String::new()\\n\\n ));\\n\\n }\\n\\n // replacement of old crate with new crate\\n\\n else if let Some((old, new)) = diff.split(\\\"->\\\").collect_tuple() {\\n\",\n \"file_path\": \"kernel/ota_update_client/src/lib.rs\",\n \"rank\": 70,\n \"score\": 327292.949210211\n },\n {\n \"content\": \"/// Adds the (child application's task ID, parent terminal print_producer) key-val pair to the map \\n\\n/// Simulates connecting an output stream to the application\\n\\npub fn add_child(child_task_id: usize, print_producer: DFQueueProducer<Event>) -> Result<(), &'static str> {\\n\\n TERMINAL_PRINT_PRODUCERS.lock().insert(child_task_id, print_producer);\\n\\n Ok(())\\n\\n}\\n\\n\\n\",\n \"file_path\": \"kernel/terminal_print/src/lib.rs\",\n \"rank\": 71,\n \"score\": 326550.2272909797\n },\n {\n \"content\": \"fn run() -> Result<(), &'static str> {\\n\\n let stdout = app_io::stdout()?;\\n\\n let mut stdout_locked = stdout.lock();\\n\\n let queue = app_io::take_key_event_queue()?;\\n\\n let queue = (*queue).as_ref().ok_or(\\\"failed to get key event reader\\\")?;\\n\\n let ack = \\\"event received\\\\n\\\".as_bytes();\\n\\n\\n\\n stdout_locked.write_all(\\n\\n format!(\\\"{}\\\\n{}\\\\n{}\\\\n\\\\n\\\",\\n\\n \\\"Acknowledge upon receiving a keyboard event.\\\",\\n\\n \\\"Note that one keyboard strike contains at least one pressing event and one releasing event.\\\",\\n\\n \\\"Press `q` to exit.\\\"\\n\\n ).as_bytes()\\n\\n )\\n\\n .or(Err(\\\"failed to perform write_all\\\"))?;\\n\\n\\n\\n // Print an acknowledge message to the screen.\\n\\n // Note that one keyboard strike contains at least two events:\\n\\n // one pressing event and one releasing event.\\n\\n loop {\\n\\n if let Some(key_event) = queue.read_one() {\\n\\n stdout_locked.write_all(&ack).or(Err(\\\"failed to perform write_all\\\"))?;\\n\\n if key_event.keycode == Keycode::Q { break; }\\n\\n }\\n\\n scheduler::schedule();\\n\\n }\\n\\n\\n\\n Ok(())\\n\\n}\\n\",\n \"file_path\": \"applications/keyboard_echo/src/lib.rs\",\n \"rank\": 72,\n \"score\": 323573.5601910429\n },\n {\n \"content\": \"fn run() -> Result<(), &'static str> {\\n\\n let mut stdin = app_io::stdin()?;\\n\\n let stdout = app_io::stdout()?;\\n\\n let mut stdout_locked = stdout.lock();\\n\\n\\n\\n stdout_locked.write_all(\\n\\n format!(\\\"{}\\\\n{}\\\\n\\\\n\\\",\\n\\n \\\"Echo upon receiving a new input line.\\\",\\n\\n \\\"Press `ctrl-D` to exit cleanly.\\\"\\n\\n ).as_bytes()\\n\\n )\\n\\n .or(Err(\\\"failed to perform write_all\\\"))?;\\n\\n\\n\\n let mut buf = String::new();\\n\\n\\n\\n // Read a line and print it back.\\n\\n loop {\\n\\n let cnt = stdin.read_line(&mut buf).or(Err(\\\"failed to perform read_line\\\"))?;\\n\\n if cnt == 0 { break; }\\n\\n stdout_locked.write_all(buf.as_bytes())\\n\\n .or(Err(\\\"faileld to perform write_all\\\"))?;\\n\\n buf.clear();\\n\\n }\\n\\n Ok(())\\n\\n}\\n\",\n \"file_path\": \"applications/input_echo/src/lib.rs\",\n \"rank\": 73,\n \"score\": 323573.56019104295\n },\n {\n \"content\": \"/// Returns the first network interface available in the system.\\n\\npub fn get_default_iface() -> Result<NetworkInterfaceRef, &'static str> {\\n\\n NETWORK_INTERFACES.lock()\\n\\n .iter()\\n\\n .next()\\n\\n .cloned()\\n\\n .ok_or_else(|| \\\"no network interfaces available\\\")\\n\\n}\\n\\n\\n\",\n \"file_path\": \"kernel/smoltcp_helper/src/lib.rs\",\n \"rank\": 74,\n \"score\": 321388.0530333385\n },\n {\n \"content\": \"/// Finds the addresses in memory of the main kernel sections, as specified by the given boot information. \\n\\n/// \\n\\n/// Returns the following tuple, if successful:\\n\\n/// * The combined size and address bounds of key sections, e.g., .text, .rodata, .data.\\n\\n/// Each of the these section bounds is aggregated to cover the bounds and sizes of *all* sections \\n\\n/// that share the same page table mapping flags and can thus be logically combined.\\n\\n/// * The list of all individual sections found. \\n\\npub fn find_section_memory_bounds(boot_info: &BootInformation) -> Result<(AggregatedSectionMemoryBounds, [Option<SectionMemoryBounds>; 32]), &'static str> {\\n\\n let elf_sections_tag = boot_info.elf_sections_tag().ok_or(\\\"no Elf sections tag present!\\\")?;\\n\\n\\n\\n let mut index = 0;\\n\\n let mut text_start: Option<(VirtualAddress, PhysicalAddress)> = None;\\n\\n let mut text_end: Option<(VirtualAddress, PhysicalAddress)> = None;\\n\\n let mut rodata_start: Option<(VirtualAddress, PhysicalAddress)> = None;\\n\\n let mut rodata_end: Option<(VirtualAddress, PhysicalAddress)> = None;\\n\\n let mut data_start: Option<(VirtualAddress, PhysicalAddress)> = None;\\n\\n let mut data_end: Option<(VirtualAddress, PhysicalAddress)> = None;\\n\\n let mut stack_start: Option<(VirtualAddress, PhysicalAddress)> = None;\\n\\n let mut stack_end: Option<(VirtualAddress, PhysicalAddress)> = None;\\n\\n let mut page_table_start: Option<(VirtualAddress, PhysicalAddress)> = None;\\n\\n let mut page_table_end: Option<(VirtualAddress, PhysicalAddress)> = None;\\n\\n\\n\\n let mut text_flags: Option<EntryFlags> = None;\\n\\n let mut rodata_flags: Option<EntryFlags> = None;\\n\\n let mut data_flags: Option<EntryFlags> = None;\\n\\n\\n\\n let mut sections_memory_bounds: [Option<SectionMemoryBounds>; 32] = Default::default();\\n\",\n \"file_path\": \"kernel/memory_x86_64/src/lib.rs\",\n \"rank\": 75,\n \"score\": 320351.9671537116\n },\n {\n \"content\": \"/// Sets the kill handler function for the current `Task`\\n\\npub fn set_my_kill_handler(handler: KillHandler) -> Result<(), &'static str> {\\n\\n get_my_current_task()\\n\\n .ok_or(\\\"couldn't get_my_current_task\\\")\\n\\n .map(|taskref| taskref.set_kill_handler(handler))\\n\\n}\\n\\n\\n\\n\\n\\n/// The list of possible reasons that a given `Task` was killed prematurely.\\n\\n#[derive(Debug)]\\n\\npub enum KillReason {\\n\\n /// The user or another task requested that this `Task` be killed. \\n\\n /// For example, the user pressed `Ctrl + C` on the shell window that started a `Task`.\\n\\n Requested,\\n\\n /// A Rust-level panic occurred while running this `Task`.\\n\\n Panic(PanicInfoOwned),\\n\\n /// A non-language-level problem, such as a Page Fault or some other machine exception.\\n\\n /// The number of the exception is included, e.g., 15 (0xE) for a Page Fault.\\n\\n Exception(u8),\\n\\n}\\n\\nimpl fmt::Display for KillReason {\\n\",\n \"file_path\": \"kernel/task/src/lib.rs\",\n \"rank\": 76,\n \"score\": 319958.4331707658\n },\n {\n \"content\": \"/// This function saves the current CPU register values onto the stack (to preserve them)\\n\\n/// and then invokes the given closure with those registers as the argument.\\n\\n/// \\n\\n/// In general, this is useful for jumpstarting the unwinding procedure,\\n\\n/// since we have to start from the current call frame and work backwards up the call stack \\n\\n/// while applying the rules for register value changes in each call frame\\n\\n/// in order to arrive at the proper register values for a prior call frame.\\n\\npub fn invoke_with_current_registers<F>(f: F) -> Result<(), &'static str> \\n\\n where F: FuncWithRegisters \\n\\n{\\n\\n let f: RefFuncWithRegisters = &f;\\n\\n let result = unsafe { \\n\\n let res_ptr = unwind_trampoline(&f);\\n\\n let res_boxed = Box::from_raw(res_ptr);\\n\\n *res_boxed\\n\\n };\\n\\n return result;\\n\\n // this is the end of the code in this function, the following is just inner functions.\\n\\n\\n\\n\\n\\n /// This is an internal assembly function used by `invoke_with_current_registers()` \\n\\n /// that saves the current register values by pushing them onto the stack\\n\\n /// before invoking the function \\\"unwind_recorder\\\" with those register values as the only argument.\\n\\n /// This is needed because the unwind info tables describe register values as operations (offsets/addends)\\n\\n /// that are relative to the current register values, so we must have those current values as a starting point.\\n\\n /// \\n\\n /// The argument is a pointer to a function reference, so effectively a pointer to a pointer. \\n\",\n \"file_path\": \"kernel/unwind/src/lib.rs\",\n \"rank\": 77,\n \"score\": 319590.59352102946\n },\n {\n \"content\": \"fn run() -> Result<(), &'static str> {\\n\\n app_io::request_stdin_instant_flush()?;\\n\\n let stdin = app_io::stdin()?;\\n\\n let stdout = app_io::stdout()?;\\n\\n let mut buf = [0u8];\\n\\n\\n\\n // Can lock them at the same time. Won't run into deadlock.\\n\\n let mut stdin_locked = stdin.lock();\\n\\n let mut stdout_locked = stdout.lock();\\n\\n\\n\\n stdout_locked.write_all(\\n\\n format!(\\\"{}\\\\n{}\\\\n\\\\n\\\",\\n\\n \\\"Echo upon receiving a character input.\\\",\\n\\n \\\"Press `ctrl-D` to exit cleanly.\\\"\\n\\n ).as_bytes()\\n\\n )\\n\\n .or(Err(\\\"failed to perform write_all\\\"))?;\\n\\n\\n\\n loop {\\n\\n let byte_num = stdin_locked.read(&mut buf).or(Err(\\\"failed to invoke read\\\"))?;\\n\\n if byte_num == 0 { break; }\\n\\n stdout_locked.write_all(&buf).or(Err(\\\"failed to invoke write_all\\\"))?;\\n\\n }\\n\\n stdout_locked.write_all(&['\\\\n' as u8]).or(Err(\\\"failed to invoke write_all\\\"))?;\\n\\n Ok(())\\n\\n}\\n\",\n \"file_path\": \"applications/immediate_input_echo/src/lib.rs\",\n \"rank\": 78,\n \"score\": 318993.6638906435\n },\n {\n \"content\": \"/// Downloads all of the new or changed crates from the `diff` file of the \\n\\nfn download(remote_endpoint: IpEndpoint, update_build: &str, crate_list: Option<&[String]>) -> Result<(), String> {\\n\\n let iface = get_default_iface()?;\\n\\n println!(\\\"Downloading crates...\\\");\\n\\n let crate_list = if crate_list == Some(&[]) { None } else { crate_list };\\n\\n\\n\\n let mut diff_file_lines: Option<Vec<String>> = None;\\n\\n\\n\\n let crates = if let Some(crate_list) = crate_list {\\n\\n let crate_set = crate_list.iter().cloned().collect::<BTreeSet<String>>();\\n\\n ota_update_client::download_crates(&iface, remote_endpoint, update_build, crate_set).map_err(|e| e.to_string())?\\n\\n } else {\\n\\n let diff_lines = ota_update_client::download_diff(&iface, remote_endpoint, update_build)\\n\\n .map_err(|e| format!(\\\"failed to download diff file for {}, error: {}\\\", update_build, e))?;\\n\\n let diff = ota_update_client::parse_diff_lines(&diff_lines).map_err(|e| e.to_string())?;\\n\\n\\n\\n // download all of the new crates\\n\\n let new_crates_to_download: BTreeSet<String> = diff.pairs.iter().map(|(_old, new)| new.clone()).collect();\\n\\n let crates = ota_update_client::download_crates(&iface, remote_endpoint, update_build, new_crates_to_download).map_err(|e| e.to_string())?;\\n\\n diff_file_lines = Some(diff_lines);\\n\\n crates\\n\",\n \"file_path\": \"applications/upd/src/lib.rs\",\n \"rank\": 79,\n \"score\": 316468.89862397197\n },\n {\n \"content\": \"/// Convenience function for writing a simple string to the logger.\\n\\n///\\n\\n/// If the logger has not yet been initialized, no log messages will be emitted.\\n\\n/// and an `Error` will be returned.\\n\\npub fn write_str(s: &str) -> fmt::Result {\\n\\n crate::write_fmt(format_args!(\\\"{}\\\", s))\\n\\n}\\n\\n\\n\\n\\n\\n/// ANSI style codes for basic colors.\\n\",\n \"file_path\": \"kernel/logger/src/lib.rs\",\n \"rank\": 80,\n \"score\": 315215.8892302605\n },\n {\n \"content\": \"fn crate_name_without_hash<'s>(name: &'s str) -> &'s str {\\n\\n name.split(\\\"-\\\")\\n\\n .next()\\n\\n .unwrap_or_else(|| name)\\n\\n}\\n\\n\\n\\n\\n\",\n \"file_path\": \"tools/diff_crates/src/main.rs\",\n \"rank\": 82,\n \"score\": 310764.67697308\n },\n {\n \"content\": \"/// Initialization function that enables the PMU if one is available.\\n\\n/// We initialize the 3 fixed PMCs and general purpose PMCs. Calling this initialization function again\\n\\n/// on a core that has already been initialized will do nothing.\\n\\n/// \\n\\n/// Currently we support a maximum core ID of 255, and up to 8 general purpose counters per core. \\n\\n/// A core ID greater than 255 is not supported in Theseus in general since the ID has to fit within a u8.\\n\\n/// \\n\\n/// If the core ID limit is changed and we need to update the PMU data structures to support more cores then: \\n\\n/// - Increase WORDS_IN_BITMAP and CORES_SUPPORTED_BY_PMU as required. For example, the cores supported is 256 so there are 4 64-bit words in the bitmap, one bit per core. \\n\\n/// - Add additional AtomicU64 variables to the initialization of the CORES_SAMPLING and RESULTS_READY bitmaps. \\n\\n/// \\n\\n/// If the general purpose PMC limit is reached then: \\n\\n/// - Update PMCS_SUPPORTED_BY_PMU to the new PMC limit.\\n\\n/// - Change the element type in the PMCS_AVAILABLE vector to be larger than AtomicU8 so that there is one bit per counter.\\n\\n/// - Update INIT_PMCS_AVAILABLE to the new maximum value for the per core bitmap.\\n\\n/// \\n\\n/// # Warning\\n\\n/// This function should only be called after all the cores have been booted up.\\n\\npub fn init() -> Result<(), &'static str> {\\n\\n let mut cores_initialized = CORES_INITIALIZED.lock();\\n\\n let core_id = apic::get_my_apic_id();\\n\\n\\n\\n if cores_initialized.contains(&core_id) {\\n\\n warn!(\\\"PMU has already been intitialized on core {}\\\", core_id);\\n\\n return Ok(());\\n\\n } \\n\\n else {\\n\\n\\n\\n if *PMU_VERSION >= MIN_PMU_VERSION {\\n\\n \\n\\n if greater_core_id_than_expected()? {\\n\\n return Err(\\\"pmu_x86: There are larger core ids in this machine than can be handled by the existing structures which store information about the PMU\\\");\\n\\n }\\n\\n\\n\\n if more_pmcs_than_expected(*NUM_PMC)? {\\n\\n return Err(\\\"pmu_x86: There are more general purpose PMCs in this machine than can be handled by the existing structures which store information about the PMU\\\");\\n\\n }\\n\\n\\n\",\n \"file_path\": \"kernel/pmu_x86/src/lib.rs\",\n \"rank\": 83,\n \"score\": 308215.64918284403\n },\n {\n \"content\": \"/// reset the mouse\\n\\npub fn reset_mouse() -> Result<(), &'static str> {\\n\\n if let Err(_e) = command_to_mouse(0xFF) {\\n\\n Err(\\\"reset mouse failled please try again\\\")\\n\\n } else {\\n\\n for _x in 0..14 {\\n\\n let more_bytes = ps2_read_data();\\n\\n if more_bytes == 0xAA {\\n\\n // command reset mouse succeeded\\n\\n return Ok(());\\n\\n }\\n\\n }\\n\\n warn!(\\\"disable streaming failed\\\");\\n\\n Err(\\\"fail to command reset mouse fail!!!\\\")\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"kernel/ps2/src/lib.rs\",\n \"rank\": 84,\n \"score\": 308198.372075957\n },\n {\n \"content\": \"pub fn do_threadtest() -> Result<(), &'static str> {\\n\\n\\n\\n let nthreads = NTHREADS.load(Ordering::SeqCst);\\n\\n let mut tries = Vec::with_capacity(TRIES as usize);\\n\\n\\n\\n let hpet_overhead = hpet_timing_overhead()?;\\n\\n let hpet = get_hpet().ok_or(\\\"couldn't get HPET timer\\\")?;\\n\\n\\n\\n println!(\\\"Running threadtest for {} threads, {} iterations, {} total objects allocated every iteration by all threads, {} obj size ...\\\", \\n\\n nthreads, NITERATIONS.load(Ordering::SeqCst), NOBJECTS.load(Ordering::SeqCst), OBJSIZE.load(Ordering::SeqCst));\\n\\n\\n\\n #[cfg(direct_access_to_multiple_heaps)]\\n\\n {\\n\\n let overhead = overhead_of_accessing_multiple_heaps()?;\\n\\n println!(\\\"Overhead of accessing multiple heaps is: {} ticks, {} ns\\\", overhead, hpet_2_us(overhead));\\n\\n }\\n\\n\\n\\n for try in 0..TRIES {\\n\\n let mut threads = Vec::with_capacity(nthreads);\\n\\n\\n\",\n \"file_path\": \"applications/heap_eval/src/threadtest.rs\",\n \"rank\": 85,\n \"score\": 308198.372075957\n },\n {\n \"content\": \"/// resend the most recent packet again\\n\\npub fn mouse_resend() -> Result<(), &'static str> {\\n\\n if let Err(_e) = command_to_mouse(0xFE) {\\n\\n Err(\\\"mouse resend request failled, please request again\\\")\\n\\n } else {\\n\\n // mouse resend request succeeded\\n\\n Ok(())\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"kernel/ps2/src/lib.rs\",\n \"rank\": 86,\n \"score\": 308198.372075957\n },\n {\n \"content\": \"pub fn do_shbench() -> Result<(), &'static str> {\\n\\n\\n\\n let nthreads = NTHREADS.load(Ordering::SeqCst);\\n\\n let niterations = NITERATIONS.load(Ordering::SeqCst);\\n\\n let mut tries = Vec::with_capacity(TRIES as usize);\\n\\n\\n\\n let hpet_overhead = hpet_timing_overhead()?;\\n\\n let hpet = get_hpet().ok_or(\\\"couldn't get HPET timer\\\")?;\\n\\n\\n\\n println!(\\\"Running shbench for {} threads, {} total iterations, {} iterations per thread, {} total objects allocated by all threads, {} max block size, {} min block size ...\\\", \\n\\n nthreads, niterations, niterations/nthreads, ALLOCATIONS_PER_ITER * niterations, MAX_BLOCK_SIZE.load(Ordering::SeqCst), MIN_BLOCK_SIZE.load(Ordering::SeqCst));\\n\\n \\n\\n #[cfg(direct_access_to_multiple_heaps)]\\n\\n {\\n\\n let overhead = overhead_of_accessing_multiple_heaps()?;\\n\\n println!(\\\"Overhead of accessing multiple heaps is: {} ticks, {} ns\\\", overhead, hpet_2_us(overhead));\\n\\n }\\n\\n\\n\\n for try in 0..TRIES {\\n\\n\\n\",\n \"file_path\": \"applications/heap_eval/src/shbench.rs\",\n \"rank\": 87,\n \"score\": 308198.372075957\n },\n {\n \"content\": \"/// Sets the current core's TSS privilege stack 0 (RSP0) entry, which points to the stack that \\n\\n/// the x86_64 hardware automatically switches to when transitioning from Ring 3 -> Ring 0.\\n\\n/// Should be set to an address within the current userspace task's kernel stack.\\n\\n/// WARNING: If set incorrectly, the OS will crash upon an interrupt from userspace into kernel space!!\\n\\npub fn tss_set_rsp0(new_privilege_stack_top: VirtualAddress) -> Result<(), &'static str> {\\n\\n let my_apic_id = apic::get_my_apic_id();\\n\\n let mut tss_entry = TSS.get(&my_apic_id).ok_or_else(|| {\\n\\n error!(\\\"tss_set_rsp0(): couldn't find TSS for apic {}\\\", my_apic_id);\\n\\n \\\"No TSS for the current core's apid id\\\" \\n\\n })?.lock();\\n\\n tss_entry.privilege_stack_table[0] = x86_64::VirtualAddress(new_privilege_stack_top.value());\\n\\n // trace!(\\\"tss_set_rsp0: new TSS {:?}\\\", tss_entry);\\n\\n Ok(())\\n\\n}\\n\\n\\n\\n\\n\",\n \"file_path\": \"kernel/tss/src/lib.rs\",\n \"rank\": 88,\n \"score\": 307269.11542648793\n },\n {\n \"content\": \"/// Initialize the page allocator.\\n\\n///\\n\\n/// # Arguments\\n\\n/// * `end_vaddr_of_low_designated_region`: the `VirtualAddress` that marks the end of the \\n\\n/// lower designated region, which should be the ending address of the initial kernel image\\n\\n/// (a lower-half identity address).\\n\\n/// \\n\\n/// The page allocator will only allocate addresses lower than `end_vaddr_of_low_designated_region`\\n\\n/// if specifically requested.\\n\\n/// General allocation requests for any virtual address will not use any address lower than that,\\n\\n/// unless the rest of the entire virtual address space is already in use.\\n\\n///\\n\\npub fn init(end_vaddr_of_low_designated_region: VirtualAddress) -> Result<(), &'static str> {\\n\\n\\tassert!(end_vaddr_of_low_designated_region < DESIGNATED_PAGES_HIGH_START.start_address());\\n\\n\\tlet designated_low_end = DESIGNATED_PAGES_LOW_END.call_once(|| Page::containing_address(end_vaddr_of_low_designated_region));\\n\\n\\tlet designated_low_end = *designated_low_end;\\n\\n\\n\\n\\tlet initial_free_chunks = [\\n\\n\\t\\t// The first region contains all pages *below* the beginning of the 510th entry of P4. \\n\\n\\t\\t// We split it up into three chunks just for ease, since it overlaps the designated regions.\\n\\n\\t\\tSome(Chunk { \\n\\n\\t\\t\\tpages: PageRange::new(\\n\\n\\t\\t\\t\\tPage::containing_address(VirtualAddress::zero()),\\n\\n\\t\\t\\t\\tdesignated_low_end,\\n\\n\\t\\t\\t)\\n\\n\\t\\t}),\\n\\n\\t\\tSome(Chunk { \\n\\n\\t\\t\\tpages: PageRange::new(\\n\\n\\t\\t\\t\\tdesignated_low_end + 1,\\n\\n\\t\\t\\t\\tDESIGNATED_PAGES_HIGH_START - 1,\\n\\n\\t\\t\\t)\\n\\n\\t\\t}),\\n\",\n \"file_path\": \"kernel/page_allocator/src/lib.rs\",\n \"rank\": 89,\n \"score\": 307106.3441707317\n },\n {\n \"content\": \"/// Measures the round trip time to send a 1-byte message on a rendezvous channel. \\n\\n/// Calls `do_ipc_rendezvous_inner` multiple times to perform the actual operation\\n\\nfn do_ipc_rendezvous(pinned: bool, cycles: bool) -> Result<(), &'static str> {\\n\\n\\tlet child_core = if pinned {\\n\\n\\t\\tSome(CPU_ID!())\\n\\n\\t} else {\\n\\n\\t\\tNone\\n\\n\\t};\\n\\n\\n\\n\\tlet mut tries: u64 = 0;\\n\\n\\tlet mut max: u64 = core::u64::MIN;\\n\\n\\tlet mut min: u64 = core::u64::MAX;\\n\\n\\tlet mut vec = Vec::with_capacity(TRIES);\\n\\n\\n\\n\\tprint_header(TRIES, ITERATIONS);\\n\\n\\n\\n\\tfor i in 0..TRIES {\\n\\n\\t\\tlet lat = if cycles {\\n\\n\\t\\t\\tdo_ipc_rendezvous_inner_cycles(i+1, TRIES, child_core)?\\t\\n\\n\\t\\t} else {\\n\\n\\t\\t\\tdo_ipc_rendezvous_inner(i+1, TRIES, child_core)?\\t\\n\\n\\t\\t};\\n\",\n \"file_path\": \"applications/bm/src/lib.rs\",\n \"rank\": 90,\n \"score\": 306746.7623434306\n },\n {\n \"content\": \"/// Measures the round trip time to send a 1-byte message on a simple channel. \\n\\n/// Calls `do_ipc_simple_inner` multiple times to perform the actual operation\\n\\nfn do_ipc_simple(pinned: bool, cycles: bool) -> Result<(), &'static str> {\\n\\n\\tlet child_core = if pinned {\\n\\n\\t\\tSome(CPU_ID!())\\n\\n\\t} else {\\n\\n\\t\\tNone\\n\\n\\t};\\n\\n\\n\\n\\tlet mut tries: u64 = 0;\\n\\n\\tlet mut max: u64 = core::u64::MIN;\\n\\n\\tlet mut min: u64 = core::u64::MAX;\\n\\n\\tlet mut vec = Vec::with_capacity(TRIES);\\n\\n\\t\\n\\n\\tprint_header(TRIES, ITERATIONS);\\n\\n\\n\\n\\tfor i in 0..TRIES {\\n\\n\\t\\tlet lat = if cycles {\\n\\n\\t\\t\\tdo_ipc_simple_inner_cycles(i+1, TRIES, child_core)?\\n\\n\\t\\t} else {\\n\\n\\t\\t\\tdo_ipc_simple_inner(i+1, TRIES, child_core)?\\n\\n\\t\\t};\\n\",\n \"file_path\": \"applications/bm/src/lib.rs\",\n \"rank\": 91,\n \"score\": 306746.7623434306\n },\n {\n \"content\": \"/// Allocates the given number of frames starting at (inclusive of) the frame containing the given `PhysicalAddress`.\\n\\n/// \\n\\n/// See [`allocate_frames_deferred()`](fn.allocate_frames_deferred.html) for more details. \\n\\npub fn allocate_frames_at(paddr: PhysicalAddress, num_frames: usize) -> Result<AllocatedFrames, &'static str> {\\n\\n allocate_frames_deferred(Some(paddr), num_frames)\\n\\n .map(|(af, _action)| af)\\n\\n}\\n\\n\\n\\n\\n\\n/// Converts the frame allocator from using static memory (a primitive array) to dynamically-allocated memory.\\n\\n/// \\n\\n/// Call this function once heap allocation is available. \\n\\n/// Calling this multiple times is unnecessary but harmless, as it will do nothing after the first invocation.\\n\",\n \"file_path\": \"kernel/frame_allocator/src/lib.rs\",\n \"rank\": 92,\n \"score\": 306565.7796150503\n },\n {\n \"content\": \"/// Allocates the given number of pages starting at (inclusive of) the page containing the given `VirtualAddress`.\\n\\n/// \\n\\n/// See [`allocate_pages_deferred()`](fn.allocate_pages_deferred.html) for more details. \\n\\npub fn allocate_pages_at(vaddr: VirtualAddress, num_pages: usize) -> Result<AllocatedPages, &'static str> {\\n\\n\\tallocate_pages_deferred(Some(vaddr), num_pages)\\n\\n\\t\\t.map(|(ap, _action)| ap)\\n\\n}\\n\\n\\n\\n\\n\\n/// Converts the page allocator from using static memory (a primitive array) to dynamically-allocated memory.\\n\\n/// \\n\\n/// Call this function once heap allocation is available. \\n\\n/// Calling this multiple times is unnecessary but harmless, as it will do nothing after the first invocation.\\n\",\n \"file_path\": \"kernel/page_allocator/src/lib.rs\",\n \"rank\": 93,\n \"score\": 306565.7796150503\n },\n {\n \"content\": \"/// Returns the priority of the given task.\\n\\npub fn get_priority(task: &TaskRef) -> Option<u8> {\\n\\n RunQueue::get_priority(task)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"kernel/scheduler_priority/src/lib.rs\",\n \"rank\": 94,\n \"score\": 306287.72402710957\n },\n {\n \"content\": \"/// Clears the cache of unloaded (swapped-out) crates saved from previous crate swapping operations. \\n\\npub fn clear_unloaded_crate_cache() {\\n\\n UNLOADED_CRATE_CACHE.lock().clear();\\n\\n}\\n\\n\\n\\n\\n\\n/// A state transfer function is an arbitrary function called when swapping crates. \\n\\n/// \\n\\n/// See the `swap_crates()` function for more details. \\n\\npub type StateTransferFunction = fn(&Arc<CrateNamespace>, &CrateNamespace) -> Result<(), &'static str>;\\n\\n\\n\\n\\n\",\n \"file_path\": \"kernel/crate_swap/src/lib.rs\",\n \"rank\": 95,\n \"score\": 305953.26402118965\n },\n {\n \"content\": \"/// Frees all counters and make them available to be used.\\n\\n/// Essentially sets the PMU to its initial state.\\n\\npub fn reset_pmu() -> Result<(), &'static str> {\\n\\n for pmc in get_pmcs_available()?.iter() {\\n\\n pmc.store(INIT_VAL_PMCS_AVAILABLE, Ordering::SeqCst);\\n\\n }\\n\\n for core in CORES_SAMPLING.iter() {\\n\\n core.store(0, Ordering::SeqCst);\\n\\n }\\n\\n for result in RESULTS_READY.iter() {\\n\\n result.store(0, Ordering::SeqCst);\\n\\n }\\n\\n SAMPLING_INFO.lock().clear();\\n\\n\\n\\n Ok(())\\n\\n}\\n\\n\\n\",\n \"file_path\": \"kernel/pmu_x86/src/lib.rs\",\n \"rank\": 96,\n \"score\": 303870.8776198717\n },\n {\n \"content\": \"/// Measures the round trip time to send a 1-byte message on an async channel. \\n\\n/// Calls `do_ipc_async_inner` multiple times to perform the actual operation\\n\\nfn do_ipc_async(pinned: bool, blocking: bool, cycles: bool) -> Result<(), &'static str> {\\n\\n\\tlet child_core = if pinned {\\n\\n\\t\\tSome(CPU_ID!())\\n\\n\\t} else {\\n\\n\\t\\tNone\\n\\n\\t};\\n\\n\\n\\n\\tlet mut tries: u64 = 0;\\n\\n\\tlet mut max: u64 = core::u64::MIN;\\n\\n\\tlet mut min: u64 = core::u64::MAX;\\n\\n\\tlet mut vec = Vec::with_capacity(TRIES);\\n\\n\\n\\n\\tprint_header(TRIES, ITERATIONS);\\n\\n\\n\\n\\tfor i in 0..TRIES {\\n\\n\\t\\tlet lat = if cycles {\\n\\n\\t\\t\\tdo_ipc_async_inner_cycles(i+1, TRIES, child_core, blocking)?\\t\\n\\n\\t\\t} else {\\n\\n\\t\\t\\tdo_ipc_async_inner(i+1, TRIES, child_core, blocking)?\\n\\n\\t\\t};\\n\",\n \"file_path\": \"applications/bm/src/lib.rs\",\n \"rank\": 97,\n \"score\": 303696.57440139557\n },\n {\n \"content\": \"/// Returns the samples that were stored during sampling in the form of a SampleResults object. \\n\\n/// If samples are not yet finished, forces them to stop. \\n\\npub fn retrieve_samples() -> Result<SampleResults, &'static str> {\\n\\n let my_core_id = apic::get_my_apic_id();\\n\\n\\n\\n let mut sampling_info = SAMPLING_INFO.lock();\\n\\n let mut samples = sampling_info.get_mut(&my_core_id).ok_or(\\\"pmu_x86::retrieve_samples: could not retrieve sampling information for this core\\\")?;\\n\\n\\n\\n // the interrupt handler might have stopped samples already so thsi check is required\\n\\n if core_is_currently_sampling(my_core_id) {\\n\\n stop_samples(my_core_id, &mut samples)?;\\n\\n }\\n\\n \\n\\n sampling_results_have_been_retrieved(my_core_id)?;\\n\\n\\n\\n Ok(SampleResults{instruction_pointers: samples.ip_list.clone(), task_ids: samples.task_id_list.clone()}) \\n\\n}\\n\\n\\n\",\n \"file_path\": \"kernel/pmu_x86/src/lib.rs\",\n \"rank\": 98,\n \"score\": 303202.7709236565\n },\n {\n \"content\": \"/// Allocates pages starting at the given `VirtualAddress` with a size given in number of bytes. \\n\\n/// \\n\\n/// This function still allocates whole pages by rounding up the number of bytes. \\n\\n/// See [`allocate_pages_deferred()`](fn.allocate_pages_deferred.html) for more details. \\n\\npub fn allocate_pages_by_bytes_at(vaddr: VirtualAddress, num_bytes: usize) -> Result<AllocatedPages, &'static str> {\\n\\n\\tallocate_pages_by_bytes_deferred(Some(vaddr), num_bytes)\\n\\n\\t\\t.map(|(ap, _action)| ap)\\n\\n}\\n\\n\\n\\n\\n\",\n \"file_path\": \"kernel/page_allocator/src/lib.rs\",\n \"rank\": 99,\n \"score\": 303053.0685333697\n }\n]","isConversational":false}}},{"rowIdx":2348,"cells":{"lang":{"kind":"string","value":"Rust"},"file_path":{"kind":"string","value":"src/de/value.rs"},"repo_name":{"kind":"string","value":"Mingun/serde-gff"},"commit":{"kind":"string","value":"2bfacbb0b6b361da749082f99edaec474ccc6c7c"},"file_code":{"kind":"string","value":"\n\nuse std::collections::HashMap;\nuse std::fmt;\nuse std::marker::PhantomData;\nuse indexmap::IndexMap;\nuse serde::forward_to_deserialize_any;\nuse serde::de::{Deserialize, Deserializer, Error, IntoDeserializer, SeqAccess, MapAccess, Visitor};\n\nuse crate::Label;\nuse crate::string::{GffString, StringKey};\nuse crate::value::Value;\n\nmacro_rules! string_key {\n ($method:ident, $type:ty) => (\n #[inline]\n fn $method<E>(self, value: $type) -> Result<Key, E>\n where E: Error,\n {\n Ok(Key::String(StringKey(value as u32)))\n }\n );\n}\n\nenum Key {\n \n \n Label(Label),\n \n String(StringKey),\n}\n\nstruct KeyVisitor;\n\nimpl<'de> Visitor<'de> for KeyVisitor {\n type Value = Key;\n\n fn expecting(&self, formatter: &mut fmt::Formatter) -> fmt::Result {\n formatter.write_str(\"a string with length in UTF-8 <=16, byte buffer with length <=16, char or integer\")\n }\n\n string_key!(visit_u8, u8);\n string_key!(visit_i8, i8);\n string_key!(visit_u16, u16);\n string_key!(visit_i16, i16);\n string_key!(visit_u32, u32);\n string_key!(visit_i32, i32);\n string_key!(visit_u64, u64);\n string_key!(visit_i64, i64);\n string_key!(visit_u128, u128);\n string_key!(visit_i128, i128);\n\n #[inline]\n fn visit_char<E>(self, value: char) -> Result<Key, E>\n where E: Error,\n {\n self.visit_string(value.to_string())\n }\n #[inline]\n fn visit_str<E>(self, value: &str) -> Result<Key, E>\n where E: Error,\n {\n self.visit_bytes(value.as_bytes())\n }\n\n #[inline]\n fn visit_bytes<E>(self, value: &[u8]) -> Result<Key, E>\n where E: Error,\n {\n use crate::error::Error::TooLongLabel;\n\n match Label::from_bytes(value) {\n Ok(label) => Ok(Key::Label(label)),\n Err(TooLongLabel(len)) => Err(E::invalid_length(len, &self)),\n Err(err) => Err(E::custom(err)),\n }\n }\n}\n\nimpl<'de> Deserialize<'de> for Key {\n #[inline]\n fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>\n where D: Deserializer<'de>,\n {\n deserializer.deserialize_any(KeyVisitor)\n }\n}\n\nstruct LabelVisitor;\n\nimpl<'de> Visitor<'de> for LabelVisitor {\n type Value = Label;\n\n fn expecting(&self, formatter: &mut fmt::Formatter) -> fmt::Result {\n formatter.write_str(\"a string with length in UTF-8 <=16, byte buffer with length <=16, or char\")\n }\n\n #[inline]\n fn visit_char<E>(self, value: char) -> Result<Label, E>\n where E: Error,\n {\n self.visit_string(value.to_string())\n }\n #[inline]\n fn visit_str<E>(self, value: &str) -> Result<Label, E>\n where E: Error,\n {\n self.visit_bytes(value.as_bytes())\n }\n\n #[inline]\n fn visit_bytes<E>(self, value: &[u8]) -> Result<Label, E>\n where E: Error,\n {\n use crate::error::Error::TooLongLabel;\n\n match Label::from_bytes(value) {\n Ok(label) => Ok(label),\n Err(TooLongLabel(len)) => Err(E::invalid_length(len, &self)),\n Err(err) => Err(E::custom(err)),\n }\n }\n}\n\nimpl<'de> Deserialize<'de> for Label {\n #[inline]\n fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>\n where D: Deserializer<'de>,\n {\n deserializer.deserialize_any(LabelVisitor)\n }\n}\n\n#[derive(Debug)]\npub struct LabelDeserializer<E> {\n \n value: Label,\n \n marker: PhantomData<E>,\n}\nimpl<'de, E> IntoDeserializer<'de, E> for Label\n where E: Error,\n{\n type Deserializer = LabelDeserializer<E>;\n\n #[inline]\n fn into_deserializer(self) -> Self::Deserializer {\n LabelDeserializer { value: self, marker: PhantomData }\n }\n}\nimpl<'de, E> Deserializer<'de> for LabelDeserializer<E>\n where E: Error,\n{\n type Error = E;\n\n fn deserialize_any<V>(self, visitor: V) -> Result<V::Value, Self::Error>\n where V: Visitor<'de>,\n {\n if let Ok(str) = self.value.as_str() {\n return visitor.visit_str(str);\n }\n visitor.visit_bytes(self.value.as_ref())\n }\n\n forward_to_deserialize_any!(\n bool i8 i16 i32 i64 i128 u8 u16 u32 u64 u128 f32 f64 char str\n string bytes byte_buf option unit unit_struct newtype_struct seq\n tuple tuple_struct map struct enum identifier ignored_any\n );\n}\n\nmacro_rules! value_from_primitive {\n ($name:ident, $type:ty => $variant:ident) => (\n #[inline]\n fn $name<E>(self, value: $type) -> Result<Value, E> {\n Ok(Value::$variant(value.into()))\n }\n );\n}\n\nstruct ValueVisitor;\n\nimpl<'de> Visitor<'de> for ValueVisitor {\n type Value = Value;\n\n fn expecting(&self, formatter: &mut fmt::Formatter) -> fmt::Result {\n formatter.write_str(\"any valid GFF value\")\n }\n\n #[inline]\n fn visit_bool<E>(self, value: bool) -> Result<Value, E> {\n Ok(Value::Byte(if value { 1 } else { 0 }))\n }\n\n value_from_primitive!(visit_i8 , i8 => Char);\n value_from_primitive!(visit_i16, i16 => Short);\n value_from_primitive!(visit_i32, i32 => Int);\n value_from_primitive!(visit_i64, i64 => Int64);\n \n\n value_from_primitive!(visit_u8 , u8 => Byte);\n value_from_primitive!(visit_u16, u16 => Word);\n value_from_primitive!(visit_u32, u32 => Dword);\n value_from_primitive!(visit_u64, u64 => Dword64);\n \n\n value_from_primitive!(visit_f32, f32 => Float);\n value_from_primitive!(visit_f64, f64 => Double);\n\n \n\n value_from_primitive!(visit_str, &str => String);\n \n value_from_primitive!(visit_string, String => String);\n\n value_from_primitive!(visit_bytes, &[u8] => Void);\n \n value_from_primitive!(visit_byte_buf, Vec<u8> => Void);\n\n \n #[inline]\n fn visit_some<D>(self, deserializer: D) -> Result<Value, D::Error>\n where D: Deserializer<'de>,\n {\n Deserialize::deserialize(deserializer)\n }\n\n #[inline]\n fn visit_unit<E>(self) -> Result<Value, E> {\n Ok(Value::Struct(IndexMap::with_capacity(0)))\n }\n \n\n #[inline]\n fn visit_seq<V>(self, mut seq: V) -> Result<Value, V::Error>\n where V: SeqAccess<'de>,\n {\n let mut vec = Vec::with_capacity(seq.size_hint().unwrap_or(0));\n\n while let Some(elem) = seq.next_element()? {\n vec.push(elem);\n }\n\n Ok(Value::List(vec))\n }\n fn visit_map<V>(self, mut map: V) -> Result<Value, V::Error>\n where V: MapAccess<'de>,\n {\n let size = map.size_hint().unwrap_or(0);\n\n if let Some(key) = map.next_key()? {\n match key {\n Key::Label(label) => {\n let mut values = IndexMap::with_capacity(size);\n values.insert(label, map.next_value()?);\n\n while let Some((key, value)) = map.next_entry()? {\n values.insert(key, value);\n }\n\n Ok(Value::Struct(values))\n },\n Key::String(key) => {\n let mut values = HashMap::with_capacity(size);\n values.insert(key, map.next_value()?);\n\n while let Some((key, value)) = map.next_entry()? {\n values.insert(StringKey(key), value);\n }\n\n Ok(Value::LocString(GffString::Internal(values).into()))\n },\n }\n } else {\n Ok(Value::Struct(IndexMap::with_capacity(0)))\n }\n }\n \n}\n\nimpl<'de> Deserialize<'de> for Value {\n #[inline]\n fn deserialize<D>(deserializer: D) -> Result<Value, D::Error>\n where D: Deserializer<'de>,\n {\n deserializer.deserialize_any(ValueVisitor)\n }\n}\n\n#[derive(Debug)]\npub struct ValueDeserializer<E> {\n \n value: Value,\n \n marker: PhantomData<E>,\n}\nimpl<'de, E> IntoDeserializer<'de, E> for Value\n where E: Error,\n{\n type Deserializer = ValueDeserializer<E>;\n\n #[inline]\n fn into_deserializer(self) -> Self::Deserializer {\n ValueDeserializer { value: self, marker: PhantomData }\n }\n}\nimpl<'de, E> Deserializer<'de> for ValueDeserializer<E>\n where E: Error,\n{\n type Error = E;\n\n #[inline]\n fn is_human_readable(&self) -> bool { false }\n\n fn deserialize_any<V>(self, visitor: V) -> Result<V::Value, Self::Error>\n where V: Visitor<'de>,\n {\n use self::Value::*;\n\n match self.value {\n Byte(val) => visitor.visit_u8(val),\n Char(val) => visitor.visit_i8(val),\n Word(val) => visitor.visit_u16(val),\n Short(val) => visitor.visit_i16(val),\n Dword(val) => visitor.visit_u32(val),\n Int(val) => visitor.visit_i32(val),\n Dword64(val) => visitor.visit_u64(val),\n Int64(val) => visitor.visit_i64(val),\n Float(val) => visitor.visit_f32(val),\n Double(val) => visitor.visit_f64(val),\n String(val) => visitor.visit_string(val),\n ResRef(val) => {\n if let Ok(str) = val.as_str() {\n return visitor.visit_str(str);\n }\n visitor.visit_byte_buf(val.0)\n },\n LocString(val) => {\n let value: GffString = val.into();\n value.into_deserializer().deserialize_any(visitor)\n },\n Void(val) => visitor.visit_byte_buf(val),\n Struct(val) => {\n \n use serde::de::value::MapDeserializer;\n MapDeserializer::new(val.into_iter()).deserialize_any(visitor)\n },\n List(val) => val.into_deserializer().deserialize_any(visitor),\n }\n }\n\n forward_to_deserialize_any!(\n bool i8 i16 i32 i64 i128 u8 u16 u32 u64 u128 f32 f64 char str\n string bytes byte_buf option unit unit_struct newtype_struct seq\n tuple tuple_struct map struct enum identifier ignored_any\n );\n}\n"},"prefix":{"kind":"string","value":"\n\nuse std::collections::HashMap;\nuse std::fmt;\nuse std::marker::PhantomData;\nuse indexmap::IndexMap;\nuse serde::forward_to_deserialize_any;\nuse serde::de::{Deserialize, Deserializer, Error, IntoDeserializer, SeqAccess, MapAccess, Visitor};\n\nuse crate::Label;\nuse crate::string::{GffString, StringKey};\nuse crate::value::Value;\n\nmacro_rules! string_key {\n ($method:ident, $type:ty) => (\n #[inline]\n fn $method<E>(self, value: $type) -> Result<Key, E>\n where E: Error,\n {\n Ok(Key::String(StringKey(value as u32)))\n }\n );\n}\n\nenum Key {\n \n \n Label(Label),\n \n String(StringKey),\n}\n\nstruct KeyVisitor;\n\nimpl<'de> Visitor<'de> for KeyVisitor {\n type Value = Key;\n\n fn expecting(&self, formatter: &mut fmt::Formatter) -> fmt::Result {\n formatter.write_str(\"a string with length in UTF-8 <=16, byte buffer with length <=16, char or integer\")\n }\n\n string_key!(visit_u8, u8);\n string_key!(visit_i8, i8);\n string_key!(visit_u16, u16);\n string_key!(visit_i16, i16);\n string_key!(visit_u32, u32);\n string_key!(visit_i32, i32);\n string_key!(visit_u64, u64);\n string_key!(visit_i64, i64);\n string_key!(visit_u128, u128);\n string_key!(visit_i128, i128);\n\n #[inline]\n fn visit_char<E>(self, value: char) -> Result<Key, E>\n where E: Error,\n {\n self.visit_string(value.to_string())\n }\n #[inline]\n fn visit_str<E>(self, value: &str) -> Result<Key, E>\n where E: Error,\n {\n self.visit_bytes(value.as_bytes())\n }\n\n #[inline]\n fn visit_bytes<E>(self, value: &[u8]) -> Result<Key, E>\n where E: Error,\n {\n use crate::error::Error::TooLongLabel;\n\n match Label::from_bytes(value) {\n Ok(label) => Ok(Key::Label(label)),\n Err(TooLongLabel(len)) => Err(E::invalid_length(len, &self)),\n Err(err) => Err(E::custom(err)),\n }\n }\n}\n\nimpl<'de> Deserialize<'de> for Key {\n #[inline]\n fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>\n where D: Deserializer<'de>,\n {\n deserializer.deserialize_any(KeyVisitor)\n }\n}\n\nstruct LabelVisitor;\n\nimpl<'de> Visitor<'de> for LabelVisitor {\n type Value = Label;\n\n fn expecting(&self, formatter: &mut fmt::Formatter) -> fmt::Result {\n formatter.write_str(\"a string with length in UTF-8 <=16, byte buffer with length <=16, or char\")\n }\n\n #[inline]\n fn visit_char<E>(self, value: char) -> Result<Label, E>\n where E: Error,\n {\n self.visit_string(value.to_string())\n }\n #[inline]\n fn visit_str<E>(self, value: &str) -> Result<Label, E>\n where E: Error,\n {\n self.visit_bytes(value.as_bytes())\n }\n\n #[inline]\n fn visit_bytes<E>(self, value: &[u"},"suffix":{"kind":"string","value":"\n}\n\nimpl<'de> Deserialize<'de> for Label {\n #[inline]\n fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>\n where D: Deserializer<'de>,\n {\n deserializer.deserialize_any(LabelVisitor)\n }\n}\n\n#[derive(Debug)]\npub struct LabelDeserializer<E> {\n \n value: Label,\n \n marker: PhantomData<E>,\n}\nimpl<'de, E> IntoDeserializer<'de, E> for Label\n where E: Error,\n{\n type Deserializer = LabelDeserializer<E>;\n\n #[inline]\n fn into_deserializer(self) -> Self::Deserializer {\n LabelDeserializer { value: self, marker: PhantomData }\n }\n}\nimpl<'de, E> Deserializer<'de> for LabelDeserializer<E>\n where E: Error,\n{\n type Error = E;\n\n fn deserialize_any<V>(self, visitor: V) -> Result<V::Value, Self::Error>\n where V: Visitor<'de>,\n {\n if let Ok(str) = self.value.as_str() {\n return visitor.visit_str(str);\n }\n visitor.visit_bytes(self.value.as_ref())\n }\n\n forward_to_deserialize_any!(\n bool i8 i16 i32 i64 i128 u8 u16 u32 u64 u128 f32 f64 char str\n string bytes byte_buf option unit unit_struct newtype_struct seq\n tuple tuple_struct map struct enum identifier ignored_any\n );\n}\n\nmacro_rules! value_from_primitive {\n ($name:ident, $type:ty => $variant:ident) => (\n #[inline]\n fn $name<E>(self, value: $type) -> Result<Value, E> {\n Ok(Value::$variant(value.into()))\n }\n );\n}\n\nstruct ValueVisitor;\n\nimpl<'de> Visitor<'de> for ValueVisitor {\n type Value = Value;\n\n fn expecting(&self, formatter: &mut fmt::Formatter) -> fmt::Result {\n formatter.write_str(\"any valid GFF value\")\n }\n\n #[inline]\n fn visit_bool<E>(self, value: bool) -> Result<Value, E> {\n Ok(Value::Byte(if value { 1 } else { 0 }))\n }\n\n value_from_primitive!(visit_i8 , i8 => Char);\n value_from_primitive!(visit_i16, i16 => Short);\n value_from_primitive!(visit_i32, i32 => Int);\n value_from_primitive!(visit_i64, i64 => Int64);\n \n\n value_from_primitive!(visit_u8 , u8 => Byte);\n value_from_primitive!(visit_u16, u16 => Word);\n value_from_primitive!(visit_u32, u32 => Dword);\n value_from_primitive!(visit_u64, u64 => Dword64);\n \n\n value_from_primitive!(visit_f32, f32 => Float);\n value_from_primitive!(visit_f64, f64 => Double);\n\n \n\n value_from_primitive!(visit_str, &str => String);\n \n value_from_primitive!(visit_string, String => String);\n\n value_from_primitive!(visit_bytes, &[u8] => Void);\n \n value_from_primitive!(visit_byte_buf, Vec<u8> => Void);\n\n \n #[inline]\n fn visit_some<D>(self, deserializer: D) -> Result<Value, D::Error>\n where D: Deserializer<'de>,\n {\n Deserialize::deserialize(deserializer)\n }\n\n #[inline]\n fn visit_unit<E>(self) -> Result<Value, E> {\n Ok(Value::Struct(IndexMap::with_capacity(0)))\n }\n \n\n #[inline]\n fn visit_seq<V>(self, mut seq: V) -> Result<Value, V::Error>\n where V: SeqAccess<'de>,\n {\n let mut vec = Vec::with_capacity(seq.size_hint().unwrap_or(0));\n\n while let Some(elem) = seq.next_element()? {\n vec.push(elem);\n }\n\n Ok(Value::List(vec))\n }\n fn visit_map<V>(self, mut map: V) -> Result<Value, V::Error>\n where V: MapAccess<'de>,\n {\n let size = map.size_hint().unwrap_or(0);\n\n if let Some(key) = map.next_key()? {\n match key {\n Key::Label(label) => {\n let mut values = IndexMap::with_capacity(size);\n values.insert(label, map.next_value()?);\n\n while let Some((key, value)) = map.next_entry()? {\n values.insert(key, value);\n }\n\n Ok(Value::Struct(values))\n },\n Key::String(key) => {\n let mut values = HashMap::with_capacity(size);\n values.insert(key, map.next_value()?);\n\n while let Some((key, value)) = map.next_entry()? {\n values.insert(StringKey(key), value);\n }\n\n Ok(Value::LocString(GffString::Internal(values).into()))\n },\n }\n } else {\n Ok(Value::Struct(IndexMap::with_capacity(0)))\n }\n }\n \n}\n\nimpl<'de> Deserialize<'de> for Value {\n #[inline]\n fn deserialize<D>(deserializer: D) -> Result<Value, D::Error>\n where D: Deserializer<'de>,\n {\n deserializer.deserialize_any(ValueVisitor)\n }\n}\n\n#[derive(Debug)]\npub struct ValueDeserializer<E> {\n \n value: Value,\n \n marker: PhantomData<E>,\n}\nimpl<'de, E> IntoDeserializer<'de, E> for Value\n where E: Error,\n{\n type Deserializer = ValueDeserializer<E>;\n\n #[inline]\n fn into_deserializer(self) -> Self::Deserializer {\n ValueDeserializer { value: self, marker: PhantomData }\n }\n}\nimpl<'de, E> Deserializer<'de> for ValueDeserializer<E>\n where E: Error,\n{\n type Error = E;\n\n #[inline]\n fn is_human_readable(&self) -> bool { false }\n\n fn deserialize_any<V>(self, visitor: V) -> Result<V::Value, Self::Error>\n where V: Visitor<'de>,\n {\n use self::Value::*;\n\n match self.value {\n Byte(val) => visitor.visit_u8(val),\n Char(val) => visitor.visit_i8(val),\n Word(val) => visitor.visit_u16(val),\n Short(val) => visitor.visit_i16(val),\n Dword(val) => visitor.visit_u32(val),\n Int(val) => visitor.visit_i32(val),\n Dword64(val) => visitor.visit_u64(val),\n Int64(val) => visitor.visit_i64(val),\n Float(val) => visitor.visit_f32(val),\n Double(val) => visitor.visit_f64(val),\n String(val) => visitor.visit_string(val),\n ResRef(val) => {\n if let Ok(str) = val.as_str() {\n return visitor.visit_str(str);\n }\n visitor.visit_byte_buf(val.0)\n },\n LocString(val) => {\n let value: GffString = val.into();\n value.into_deserializer().deserialize_any(visitor)\n },\n Void(val) => visitor.visit_byte_buf(val),\n Struct(val) => {\n \n use serde::de::value::MapDeserializer;\n MapDeserializer::new(val.into_iter()).deserialize_any(visitor)\n },\n List(val) => val.into_deserializer().deserialize_any(visitor),\n }\n }\n\n forward_to_deserialize_any!(\n bool i8 i16 i32 i64 i128 u8 u16 u32 u64 u128 f32 f64 char str\n string bytes byte_buf option unit unit_struct newtype_struct seq\n tuple tuple_struct map struct enum identifier ignored_any\n );\n}\n"},"middle":{"kind":"string","value":"8]) -> Result<Label, E>\n where E: Error,\n {\n use crate::error::Error::TooLongLabel;\n\n match Label::from_bytes(value) {\n Ok(label) => Ok(label),\n Err(TooLongLabel(len)) => Err(E::invalid_length(len, &self)),\n Err(err) => Err(E::custom(err)),\n }\n }"},"strategy":{"kind":"string","value":"function_block-function_prefixed"},"context_items":{"kind":"list like","value":[{"content":"/// Десериализатор для чтения идентификаторов полей\n\nstruct Field<'a, R: 'a + Read + Seek>(&'a mut Deserializer<R>);\n\n\n\nimpl<'de, 'a, R: 'a + Read + Seek> de::Deserializer<'de> for Field<'a, R> {\n\n type Error = Error;\n\n\n\n #[inline]\n\n fn is_human_readable(&self) -> bool { false }\n\n\n\n fn deserialize_identifier<V>(self, visitor: V) -> Result<V::Value>\n\n where V: Visitor<'de>,\n\n {\n\n let token = self.0.next_token()?;\n\n if let Token::Label(index) = token {\n\n let label = self.0.parser.read_label(index)?;\n\n return visitor.visit_str(label.as_str()?);\n\n }\n\n return Err(Error::Unexpected(\"Label\", token));\n\n }\n\n\n\n delegate!(deserialize_i8);\n","file_path":"src/de/mod.rs","rank":4,"score":84696.97356030186},{"content":"#[derive(Debug)]\n\nenum Struct {\n\n /// Структура без полей\n\n NoFields,\n\n /// Структура, состоящая только из одного поля, содержит индекс этого поля\n\n OneField(usize),\n\n /// Структура, состоящая из двух и более полей. Содержит индекс списка и количество полей\n\n MultiField { list: FieldListIndex, fields: u32 }\n\n}\n\nimpl Struct {\n\n /// Преобразует промежуточное представление в окончательное, которое может быть записано в файл\n\n #[inline]\n\n fn into_raw(&self, offsets: &[u32]) -> raw::Struct {\n\n use self::Struct::*;\n\n\n\n match *self {\n\n NoFields => raw::Struct { tag: 0, offset: 0, fields: 0 },\n\n OneField(index) => raw::Struct { tag: 0, offset: index as u32, fields: 1 },\n\n MultiField { list, fields } => raw::Struct { tag: 0, offset: offsets[list.0], fields },\n\n }\n\n }\n\n}\n\n\n\n/// Промежуточное представление сериализуемого поля структуры. Содержит данные, которые после\n\n/// небольшого преобразования, возможного только после окончания сериализации, могут\n\n/// быть записаны в файл\n","file_path":"src/ser/mod.rs","rank":5,"score":78386.64666751807},{"content":"/// Список индексов для одной структуры, хранимые в поле [`Gff::field_indices`]\n\n///\n\n/// [`Gff::field_indices`]: ../struct.Gff.html#field.field_indices\n\nstruct FieldIndex<'a>(&'a [u32]);\n\nimpl<'a> fmt::Debug for FieldIndex<'a> {\n\n fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {\n\n write!(f, \"{:?}\", self.0)\n\n }\n\n}\n\n/// Представление списка индексов полей структур для отладочного вывода\n","file_path":"src/raw.rs","rank":6,"score":63018.69864732902},{"content":"/// Данные для одного поля, хранимые в поле [`Gff::field_data`]. Используется для улучшения отладочного вывода\n\n///\n\n/// [`Gff::field_data`]: ../struct.Gff.html#field.field_data\n\nstruct FieldData<'a>(&'a [u8]);\n\nimpl<'a> fmt::Debug for FieldData<'a> {\n\n fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {\n\n write!(f, \"{:?}\", self.0)\n\n }\n\n}\n\n/// Представление данных комплексных полей для отладочного вывода\n","file_path":"src/raw.rs","rank":7,"score":63018.69864732902},{"content":"/// Список индексов для одного списка, хранимый в поле [`Gff::list_indices`]\n\n///\n\n/// [`Gff::list_indices`]: ../struct.Gff.html#field.list_indices\n\nstruct ListIndex<'a>(&'a [u32]);\n\nimpl<'a> fmt::Debug for ListIndex<'a> {\n\n fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {\n\n write!(f, \"{:?}\", self.0)\n\n }\n\n}\n\n/// Представление списка индексов полей структур для отладочного вывода\n","file_path":"src/raw.rs","rank":8,"score":63018.69864732902},{"content":"#[inline]\n\npub fn to_vec<T>(signature: Signature, value: &T) -> Result<Vec<u8>>\n\n where T: Serialize + ?Sized,\n\n{\n\n let mut vec = Vec::new();\n\n to_writer(&mut vec, signature, value)?;\n\n Ok(vec)\n\n}\n\n\n\n/// Реализует метод, возвращающий ошибку при попытке сериализовать значение, с описанием\n\n/// причины, что GFF не поддерживает данный тип на верхнем уровне и требуется обернуть его\n\n/// в структуру\n\nmacro_rules! unsupported {\n\n ($ser_method:ident ( $($type:ty),* ) ) => (\n\n unsupported!($ser_method($($type),*) -> Self::Ok);\n\n );\n\n ($ser_method:ident ( $($type:ty),* ) -> $result:ty) => (\n\n fn $ser_method(self, $(_: $type),*) -> Result<$result> {\n\n Err(Error::Serialize(concat!(\n\n \"`\", stringify!($ser_method), \"` can't be implemented in GFF format. Wrap value to the struct and serialize struct\"\n\n ).into()))\n","file_path":"src/ser/mod.rs","rank":9,"score":57658.16761985123},{"content":"#[inline]\n\npub fn to_writer<W, T>(writer: &mut W, signature: Signature, value: &T) -> Result<()>\n\n where W: Write,\n\n T: Serialize + ?Sized,\n\n{\n\n let mut s = Serializer::default();\n\n value.serialize(&mut s)?;\n\n s.write(writer, signature, Version::V3_2)\n\n}\n\n/// Сериализует значение в массив. Значение должно являться Rust структурой или перечислением\n","file_path":"src/ser/mod.rs","rank":10,"score":52929.837909316484},{"content":"#[derive(Debug, Copy, Clone)]\n\nstruct StructIndex(usize);\n\n\n\n/// Вспомогательная структура, описывающая индекс списка полей структуры, для типобезопасности.\n\n/// Любая GFF структура, имеющая более двух полей, ссылается по такому индексу на список с\n\n/// перечислением имеющихся у нее полей\n","file_path":"src/ser/mod.rs","rank":11,"score":42628.416642876524},{"content":"#[derive(Debug)]\n\nenum Field {\n\n /// Поле, представленное значением без внутренней структуры. Содержит метку поля и его значение\n\n Simple { label: LabelIndex, value: SimpleValueRef },\n\n /// Поле, представленное значением с внутренней структурой. Содержит метку поля и индекс\n\n /// промежуточного представления структуры в массиве [`structs`](struct.Serializer.html#field.structs)\n\n Struct { label: LabelIndex, struct_: StructIndex },\n\n /// Поле, представленное списком значений. Содержит метку поля и индекс списка в массиве\n\n /// [`list_indices`](struct.Serializer.html#field.list_indices)\n\n List { label: LabelIndex, list: ListIndex },\n\n}\n\nimpl Field {\n\n /// Преобразует промежуточное представление в окончательное, которое может быть записано в файл\n\n #[inline]\n\n fn into_raw(&self, offsets: &[u32]) -> Result<raw::Field> {\n\n use self::Field::*;\n\n\n\n Ok(match self {\n\n Simple { label, value } => value.into_raw(label.0)?,\n\n Struct { label, struct_ } => {\n\n let mut data = [0u8; 4];\n","file_path":"src/ser/mod.rs","rank":12,"score":39430.20043977518},{"content":"#[derive(Debug, Clone)]\n\nstruct ReadList {\n\n /// Индекс в таблице индексов, содержащий структуру-элемент для чтения\n\n index: ListIndicesIndex,\n\n /// Состояние, в которое нужно перейти после завершения чтения списка\n\n state: Box<State>,\n\n}\n\nimpl ReadList {\n\n /// # Возвращаемое значение\n\n /// Возвращает генерируемый в процессе разбора токен и новое состояние парсера\n\n fn next<R: Read + Seek>(self, parser: &mut Parser<R>) -> Result<(Token, State)> {\n\n // Переходим к списку индексов структур-элементов списка и читаем его размер\n\n parser.seek(self.index)?;\n\n let count = parser.read_u32()?;\n\n\n\n // Сообщаем о начале списка и переходим в состояние чтения первого элемента\n\n let token = Token::ListBegin(count);\n\n let state = ReadItems {\n\n index: self.index + 1,\n\n count: count,\n\n state: self.state,\n","file_path":"src/parser/states.rs","rank":13,"score":37342.98237045143},{"content":"/// Сериализатор, записывающий значение поля\n\nstruct FieldSerializer<'a> {\n\n /// Хранилище записываемых данных\n\n ser: &'a mut Serializer,\n\n /// Номер метки, ассоциированной с сериализуемым полем\n\n label: LabelIndex,\n\n}\n\nimpl<'a> FieldSerializer<'a> {\n\n /// Добавляет в список структур новую структуру с указанным количеством полей, а\n\n /// в список полей -- новое поле типа \"структура\".\n\n ///\n\n /// Корректная ссылка на данные еще не заполнена, ее нужно будет скорректировать\n\n /// после того, как содержимое структуры будет записано\n\n ///\n\n /// Возвращает пару индексов: добавленной структуры и списка с полями структуры,\n\n /// если полей несколько\n\n fn add_struct(&mut self, fields: usize) -> Result<(StructIndex, FieldListIndex)> {\n\n // Добавляем запись о структуре\n\n let (struct_index, fields_index) = self.ser.add_struct(fields);\n\n\n\n self.ser.fields.push(Field::Struct {\n","file_path":"src/ser/mod.rs","rank":14,"score":34328.402072405515},{"content":"#[derive(Debug)]\n\nstruct DebugListIndex<'a> {\n\n /// Данные, разбитые по принадлежности к отдельным спискам и без длины, для удобства отладочного вывода\n\n by_list: Vec<ListIndex<'a>>,\n\n /// Данные в том виде, в каком они хранятся в файле\n\n raw: &'a [u32],\n\n}\n\n\n\n/// Описание всей структуры GFF файла, как она хранится в GFF файле\n\npub struct Gff {\n\n /// Заголовок файла, содержащий метаинформацию о нем: тип содержимого, версию структуры,\n\n /// количество и местоположение структур в файле\n\n pub header: Header,\n\n /// Список структур внутри GFF файла. Структура -- группирующий элемент, состоящий\n\n /// из [полей], помеченных [метками]\n\n ///\n\n /// [полей]: struct.Field.html\n\n /// [метками]: ../struct.Label.html\n\n pub structs: Vec<Struct>,\n\n /// Список полей из всех структур GFF файла. Каждое поле ссылается на [метку] и данные,\n\n /// а также имеет некоторый тип\n","file_path":"src/raw.rs","rank":15,"score":34328.402072405515},{"content":"#[derive(Debug)]\n\nstruct DebugFieldIndex<'a> {\n\n /// Данные, разбитые по принадлежности к отдельным структурам, для удобства отладочного вывода\n\n by_struct: Vec<FieldIndex<'a>>,\n\n /// Данные в том виде, в каком они хранятся в файле\n\n raw: &'a [u32],\n\n}\n\n\n","file_path":"src/raw.rs","rank":16,"score":34328.402072405515},{"content":"#[derive(Debug)]\n\nstruct DebugFieldData<'a> {\n\n /// Данные, разбитые по принадлежности к отдельным полям, для удобства отладочного вывода\n\n by_field: Vec<FieldData<'a>>,\n\n /// Данные в том виде, в каком они хранятся в файле\n\n raw: &'a [u8],\n\n}\n\n\n","file_path":"src/raw.rs","rank":17,"score":34328.402072405515},{"content":"#[derive(Debug, Copy, Clone)]\n\nstruct ListIndex(usize);\n\n\n\n/// Промежуточное представление сериализуемых структур. Содержит данные, которые после\n\n/// небольшого преобразования, возможного только после окончания сериализации, могут\n\n/// быть записаны в файл\n","file_path":"src/ser/mod.rs","rank":18,"score":32896.906332685656},{"content":"#[derive(Debug, Copy, Clone)]\n\nstruct FieldListIndex(usize);\n\n\n\n/// Вспомогательная структура, описывающая индекс списка элементов GFF списка, для типобезопасности\n","file_path":"src/ser/mod.rs","rank":19,"score":31618.23813472376},{"content":"impl From<FromUtf8Error> for Error {\n\n fn from(value: FromUtf8Error) -> Self { Encoding(value.to_string().into()) }\n\n}\n\n\n\nimpl de::Error for Error {\n\n fn custom<T: fmt::Display>(msg: T) -> Self {\n\n Deserialize(msg.to_string())\n\n }\n\n}\n\nimpl ser::Error for Error {\n\n fn custom<T: fmt::Display>(msg: T) -> Self {\n\n Error::Serialize(msg.to_string())\n\n }\n\n}\n","file_path":"src/error.rs","rank":20,"score":31157.648306416206},{"content":"\n\nimpl error::Error for Error {\n\n fn source(&self) -> Option<&(dyn error::Error + 'static)> {\n\n match *self {\n\n Io(ref err) => Some(err),\n\n _ => None,\n\n }\n\n }\n\n}\n\n\n\nimpl From<io::Error> for Error {\n\n fn from(value: io::Error) -> Self { Io(value) }\n\n}\n\n/// Реализация для конвертации из ошибок кодирования библиотеки `encodings`\n\nimpl From<Cow<'static, str>> for Error {\n\n fn from(value: Cow<'static, str>) -> Self { Encoding(value) }\n\n}\n\nimpl From<Utf8Error> for Error {\n\n fn from(value: Utf8Error) -> Self { Encoding(value.to_string().into()) }\n\n}\n","file_path":"src/error.rs","rank":21,"score":31157.074837021893},{"content":" /// Произошла ошибка кодирования или декодирования строки, например, из-за использования\n\n /// символа, не поддерживаемого кодировкой\n\n Encoding(Cow<'static, str>),\n\n /// В файле встретилось значение неизвестного типа, хранящее указанное значение\n\n UnknownValue {\n\n /// Идентификатор типа значения\n\n tag: u32,\n\n /// Значение, которое было записано в файле для данного тега\n\n value: u32\n\n },\n\n /// Разбор уже завершен\n\n ParsingFinished,\n\n /// Некорректное значение для метки. Метка не должна превышать по длине 16 байт в UTF-8,\n\n /// но указанное значение больше. Ошибка содержит длину текста, который пытаются преобразовать\n\n TooLongLabel(usize),\n\n /// При десериализации был обнаружен указанный токен, хотя ожидался не он.\n\n /// Ожидаемые значения описаны в первом параметре\n\n Unexpected(&'static str, Token),\n\n /// Ошибка, возникшая при десериализации\n\n Deserialize(String),\n","file_path":"src/error.rs","rank":22,"score":31156.977287721165},{"content":" /// Ошибка, возникшая при сериализации\n\n Serialize(String),\n\n}\n\n/// Тип результата, используемый в методах данной библиотеки\n\npub type Result<T> = result::Result<T, Error>;\n\n\n\nimpl fmt::Display for Error {\n\n fn fmt(&self, fmt: &mut fmt::Formatter) -> fmt::Result {\n\n match *self {\n\n Io(ref err) => err.fmt(fmt),\n\n Encoding(ref msg) => msg.fmt(fmt),\n\n UnknownValue { tag, value } => write!(fmt, \"Unknown field value (tag: {}, value: {})\", tag, value),\n\n ParsingFinished => write!(fmt, \"Parsing finished\"),\n\n TooLongLabel(len) => write!(fmt, \"Too long label: label can contain up to 16 bytes, but string contains {} bytes in UTF-8\", len),\n\n Unexpected(ref expected, ref actual) => write!(fmt, \"Expected {}, but {:?} found\", expected, actual),\n\n Deserialize(ref msg) => msg.fmt(fmt),\n\n Serialize(ref msg) => msg.fmt(fmt),\n\n }\n\n }\n\n}\n","file_path":"src/error.rs","rank":23,"score":31155.115355074882},{"content":"//! Реализация структуры, описывающей ошибки кодирования или декодирования GFF\n\n\n\nuse std::borrow::Cow;\n\nuse std::fmt;\n\nuse std::error;\n\nuse std::io;\n\nuse std::result;\n\nuse std::str::Utf8Error;\n\nuse std::string::FromUtf8Error;\n\nuse serde::de;\n\nuse serde::ser;\n\n\n\nuse crate::parser::Token;\n\nuse self::Error::*;\n\n\n\n/// Виды ошибок, который могут возникнуть при чтении и интерпретации GFF-файла\n\n#[derive(Debug)]\n\npub enum Error {\n\n /// Произошла ошибка чтения или записи из/в нижележащего буфера\n\n Io(io::Error),\n","file_path":"src/error.rs","rank":24,"score":31150.980686689294},{"content":"\n\nimpl From<[u8; 16]> for Label {\n\n fn from(arr: [u8; 16]) -> Self { Label(arr) }\n\n}\n\n\n\nimpl AsRef<[u8]> for Label {\n\n fn as_ref(&self) -> &[u8] { &self.0 }\n\n}\n\n\n\nimpl FromStr for Label {\n\n type Err = Error;\n\n\n\n #[inline]\n\n fn from_str(value: &str) -> Result<Self, Error> {\n\n Self::from_bytes(value.as_bytes())\n\n }\n\n}\n\n\n\n#[cfg(test)]\n\nmod tests {\n","file_path":"src/label.rs","rank":25,"score":31144.708684693032},{"content":" return from_utf8(&self.0[0..i])\n\n }\n\n }\n\n return from_utf8(&self.0);\n\n }\n\n\n\n /// Пытается создать метку из указанного массива байт.\n\n ///\n\n /// # Ошибки\n\n /// В случае, если длина среза равна или превышает 16 байт, возвращается ошибка\n\n /// [`Error::TooLongLabel`](./error/enum.Error.html#variant.TooLongLabel)\n\n pub fn from_bytes(bytes: &[u8]) -> Result<Self, Error> {\n\n if bytes.len() > 16 {\n\n return Err(Error::TooLongLabel(bytes.len()));\n\n }\n\n\n\n let mut storage: [u8; 16] = Default::default();\n\n let range = 0..bytes.len();\n\n storage[range.clone()].copy_from_slice(&bytes[range]);\n\n Ok(storage.into())\n","file_path":"src/label.rs","rank":26,"score":31139.326154841918},{"content":"//! Содержит реализацию структуры, описывающей название поля в GFF файле и реализацию типажей для\n\n//! конвертации других типов данных в метку и обратно\n\n\n\nuse std::fmt;\n\nuse std::result::Result;\n\nuse std::str::{from_utf8, FromStr, Utf8Error};\n\nuse crate::error::Error;\n\n\n\n/// Описание названия поля структуры GFF файла. GFF файл состоит из дерева структур, а каждая\n\n/// структура -- из полей с именем и значением. Имена полей представлены данной структурой\n\n#[derive(Clone, Copy, PartialEq, Eq, Hash)]\n\npub struct Label([u8; 16]);\n\n\n\nimpl Label {\n\n /// Возвращает представление данной метки как текста, если он представлен в виде `UTF-8` строки\n\n pub fn as_str(&self) -> Result<&str, Utf8Error> {\n\n for i in 0..self.0.len() {\n\n // Во внутреннем представлении данные метки продолжаются до первого нулевого символа,\n\n // однако сам нулевой символ не храниться -- это просто заполнитель\n\n if self.0[i] == 0 {\n","file_path":"src/label.rs","rank":27,"score":31137.62733871038},{"content":" }\n\n}\n\n\n\nimpl fmt::Debug for Label {\n\n fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {\n\n if let Ok(value) = self.as_str() {\n\n return write!(f, \"Label({})\", value);\n\n }\n\n write!(f, \"Label(\")?;\n\n self.0.fmt(f)?;\n\n return write!(f, \")\");\n\n }\n\n}\n\n\n\nimpl fmt::Display for Label {\n\n fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {\n\n let value = self.as_str().map_err(|_| fmt::Error)?;\n\n write!(f, \"{}\", value)\n\n }\n\n}\n","file_path":"src/label.rs","rank":28,"score":31136.28605459529},{"content":" use super::Label;\n\n\n\n #[test]\n\n fn label_constructs_from_str() {\n\n assert_eq!(Label::from(*b\"short\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\"), \"short\".parse().unwrap());\n\n assert_eq!(Label::from(*b\"exact_16_chars_\\0\"), \"exact_16_chars_\".parse().unwrap());\n\n assert!(\"more_then_16_char\".parse::<Label>().is_err());\n\n }\n\n}\n","file_path":"src/label.rs","rank":29,"score":31129.95299440092},{"content":" /// Преобразует вариант строки, наиболее приближенный к хранимому в файле варианту (и, таким\n\n /// образом, хранящий без потерь все содержимое файла) в вариант строки, в котором компилятор\n\n /// Rust гарантирует корректность данных -- либо ссылка на внешнюю строку, либо список строк\n\n /// для каждого языка и пола, причем для каждой пары существует лишь один вариант строки --\n\n /// последний из `LocString.strings`, если их там окажется несколько.\n\n ///\n\n /// Метод возвращает внутреннее представление, если `LocString.str_ref == StrRef(0xFFFFFFFF)`,\n\n /// в противном случае возвращается внешнее представление. Все строки из массива `LocString.strings`\n\n /// в этом случае игнорируются.\n\n fn from(value: LocString) -> Self {\n\n use self::GffString::*;\n\n\n\n match value.str_ref {\n\n StrRef(0xFFFFFFFF) => Internal(value.strings.into_iter().map(Into::into).collect()),\n\n _ => External(value.str_ref),\n\n }\n\n }\n\n}\n\nimpl From<GffString> for LocString {\n\n /// Преобразует представление локализованной строки, корректность данных в котором гарантируется\n","file_path":"src/string.rs","rank":30,"score":30987.8971985248},{"content":" /// компилятором Rust в представление, приближенное к хранимому в GFF файле.\n\n ///\n\n /// При преобразовании внешнего представления строки в `LocString.strings` записывается пустой массив.\n\n /// При преобразовании внутреннего представления в `LocString.str_ref` записывается `StrRef(0xFFFFFFFF)`.\n\n fn from(value: GffString) -> Self {\n\n use self::GffString::*;\n\n\n\n match value {\n\n External(str_ref) => LocString { str_ref, strings: vec![] },\n\n Internal(strings) => {\n\n let strings = strings.into_iter().map(Into::into).collect();\n\n LocString { str_ref: StrRef(0xFFFFFFFF), strings }\n\n },\n\n }\n\n }\n\n}\n","file_path":"src/string.rs","rank":31,"score":30987.151542149175},{"content":"}\n\nimpl From<(StringKey, String)> for SubString {\n\n #[inline]\n\n fn from(value: (StringKey, String)) -> Self {\n\n SubString { key: value.0, string: value.1 }\n\n }\n\n}\n\nimpl Into<(StringKey, String)> for SubString {\n\n #[inline]\n\n fn into(self) -> (StringKey, String) {\n\n (self.key, self.string)\n\n }\n\n}\n\n\n\n/// Локализуемая строка, содержащая в себе все данные, которые могут храниться в GFF файле.\n\n/// Может содержать логически некорректные данные, поэтому, если не требуется анализировать\n\n/// непосредственное содержимое GFF файла без потерь, лучше сразу преобразовать ее в\n\n/// [`GffString`], используя `into()`, и работать с ней.\n\n///\n\n/// [`GffString`]: enum.GffString.html\n","file_path":"src/string.rs","rank":32,"score":30986.995264880225},{"content":" StringKey(((value.0 as u32) << 1) | value.1 as u32)\n\n }\n\n}\n\n/// Преобразует ключ в число, в котором он храниться в GFF файле по формуле:\n\n/// ```rust,ignore\n\n/// ((self.language() as u32) << 1) | self.gender() as u32\n\n/// ```\n\nimpl Into<u32> for StringKey {\n\n #[inline]\n\n fn into(self) -> u32 { self.0 }\n\n}\n\n\n\n/// Часть локализованной строки, хранящая информацию для одного языка и пола\n\n#[derive(Debug, Clone, PartialEq, Eq, Hash)]\n\npub struct SubString {\n\n /// Язык, на котором записан текст этой части многоязыковой строки, и пол\n\n /// персонажа, для которого он написан\n\n pub key: StringKey,\n\n /// Текст многоязыковой строки для указанного пола и языка\n\n pub string: String,\n","file_path":"src/string.rs","rank":33,"score":30986.93637505392},{"content":" /// Строка предназначена для персонажа мужского или неопределенного пола\n\n Male = 0,\n\n /// Строка предназначена для персонажа женского пола\n\n Female = 1,\n\n}\n\n\n\n/// Ключ, используемый для индексации локализуемых строк во внутреннем представлении\n\n/// строк (когда строки внедрены в GFF файл, а не используются ссылки на строки в TLK\n\n/// файле).\n\n#[derive(Debug, Clone, PartialEq, Eq, Hash)]\n\npub struct StringKey(pub(crate) u32);\n\nimpl StringKey {\n\n /// Язык, на котором записан текст этой части многоязыковой строки\n\n pub fn language(&self) -> Language { unsafe { transmute(self.0 >> 1) } }\n\n /// Пол персонажа, для которого написан текст этой части многоязыковой строки\n\n pub fn gender(&self) -> Gender { unsafe { transmute(self.0 % 2) } }\n\n}\n\nimpl From<(Language, Gender)> for StringKey {\n\n #[inline]\n\n fn from(value: (Language, Gender)) -> Self {\n","file_path":"src/string.rs","rank":34,"score":30984.9720129579},{"content":" #[inline]\n\n pub fn code(&self) -> u32 { self.0 & !USER_TLK_MASK }\n\n}\n\n\n\nimpl fmt::Debug for StrRef {\n\n fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {\n\n write!(f, \"code: {}, user: {}\", self.code(), self.is_user())\n\n }\n\n}\n\n\n\n/// Виды языков, на которых могут храниться локализованные строки в объекте `LocString`\n\n#[derive(Debug, Clone, Copy, PartialEq, Eq, Hash)]\n\n#[repr(u32)]\n\npub enum Language {\n\n /// Английский язык\n\n English = 0,\n\n /// Французский язык\n\n French = 1,\n\n /// Немецкий язык\n\n German = 2,\n","file_path":"src/string.rs","rank":35,"score":30983.126135282753},{"content":"//! Содержит реализации структур, описывающих строки, хранящиеся в GFF файле\n\nuse std::fmt;\n\nuse std::mem::transmute;\n\nuse std::collections::HashMap;\n\n\n\n/// Маска, определяющая идентификатор строки\n\nconst USER_TLK_MASK: u32 = 0x8000_0000;\n\n\n\n/// Индекс в файле `dialog.tlk`, содержащий локализованный текст\n\n#[derive(Clone, Copy, PartialEq, Eq, Hash)]\n\npub struct StrRef(pub(crate) u32);\n\n\n\nimpl StrRef {\n\n /// Определяет, является ли строка индексом не из основного TLK файла игры, а из TLK\n\n /// файла модуля. Строка является строкой из TLK файла модуля, если старший бит в ее\n\n /// идентификаторе взведен\n\n #[inline]\n\n pub fn is_user(&self) -> bool { self.0 & USER_TLK_MASK != 0 }\n\n\n\n /// Определяет индекс строки в TLK файле\n","file_path":"src/string.rs","rank":36,"score":30980.13710120473},{"content":"#[derive(Debug, Clone, PartialEq, Eq, Hash)]\n\npub struct LocString {\n\n /// Индекс в TLK файле, содержащий локализованный текст\n\n pub str_ref: StrRef,\n\n /// Список локализованных строк для каждого языка и пола\n\n pub strings: Vec<SubString>,\n\n}\n\n\n\n/// Локализуемая строка, представленная в виде, в котором некорректные значения\n\n/// непредставимы.\n\n#[derive(Debug, Clone, PartialEq, Eq)]\n\npub enum GffString {\n\n /// Внешнее представление строки в виде индекса в TLK файле, содержащем локализованный\n\n /// текст. В зависимости от локализации текст будет разным\n\n External(StrRef),\n\n /// Внутреннее представление строки, хранимое внутри самого файла -- по строке для каждого\n\n /// языка и пола персонажа\n\n Internal(HashMap<StringKey, String>),\n\n}\n\nimpl From<LocString> for GffString {\n","file_path":"src/string.rs","rank":37,"score":30978.754982429386},{"content":" /// Итальянский язык\n\n Italian = 3,\n\n /// Испанский язык\n\n Spanish = 4,\n\n /// Польский язык\n\n Polish = 5,\n\n /// Корейский язык\n\n Korean = 128,\n\n /// Традиционный китайский\n\n ChineseTraditional = 129,\n\n /// Упрощенный китайский\n\n ChineseSimplified = 130,\n\n /// Японский\n\n Japanese= 131,\n\n}\n\n\n\n/// Виды пола персонажа, на которых могут храниться локализованные строки в объекте `LocString`\n\n#[derive(Debug, Clone, Copy, PartialEq, Eq, Hash)]\n\n#[repr(u32)]\n\npub enum Gender {\n","file_path":"src/string.rs","rank":38,"score":30973.803320334773},{"content":" ///\n\n /// Тег, ассоциированный с типом, равен `0`.\n\n Byte(u8),\n\n /// Символ текста в диапазоне `0x00-0xFF`, занимающий один байт.\n\n ///\n\n /// Тег, ассоциированный с типом, равен `1`.\n\n Char(i8),\n\n /// Беззнаковое целое (от 0 до 65535), занимающее 2 байта.\n\n ///\n\n /// Тег, ассоциированный с типом, равен `2`.\n\n Word(u16),\n\n /// Знаковое целое (от -32768 до 32767), занимающее 2 байта.\n\n ///\n\n /// Тег, ассоциированный с типом, равен `3`.\n\n Short(i16),\n\n /// Беззнаковое целое (от 0 до 4294967296), занимающее 4 байта.\n\n ///\n\n /// Тег, ассоциированный с типом, равен `4`.\n\n Dword(u32),\n\n /// Знаковое целое (от -2147483648 до 2147483647), занимающее 4 байта.\n","file_path":"src/value.rs","rank":39,"score":30546.175296797446},{"content":" ///\n\n /// Тег, ассоциированный с типом, равен `13`.\n\n Void(Vec<u8>),\n\n /// Вложенная структура. Порядок полей в структуре постоянный и определяется порядком их добавления\n\n ///\n\n /// Тег, ассоциированный с типом, равен `14`.\n\n Struct(IndexMap<Label, Value>),\n\n /// Список значений любой длины.\n\n ///\n\n /// Тег, ассоциированный с типом, равен `15`.\n\n List(Vec<Value>),\n\n}\n\n\n\nimpl From<SimpleValue> for Value {\n\n #[inline]\n\n fn from(value: SimpleValue) -> Value {\n\n use self::SimpleValue::*;\n\n\n\n match value {\n\n Byte(val) => Value::Byte(val),\n","file_path":"src/value.rs","rank":40,"score":30546.06659401941},{"content":" Char(i8),\n\n /// Беззнаковое целое (от 0 до 65535), занимающее 2 байта.\n\n ///\n\n /// Тег, ассоциированный с типом, равен `2`.\n\n Word(u16),\n\n /// Знаковое целое (от -32768 до 32767), занимающее 2 байта.\n\n ///\n\n /// Тег, ассоциированный с типом, равен `3`.\n\n Short(i16),\n\n /// Беззнаковое целое (от 0 до 4294967296), занимающее 4 байта.\n\n ///\n\n /// Тег, ассоциированный с типом, равен `4`.\n\n Dword(u32),\n\n /// Знаковое целое (от -2147483648 до 2147483647), занимающее 4 байта.\n\n ///\n\n /// Тег, ассоциированный с типом, равен `5`.\n\n Int(i32),\n\n /// Беззнаковое целое (от 0 до примерно 18e+18), занимающее 8 байт.\n\n ///\n\n /// Тег, ассоциированный с типом, равен `6`.\n","file_path":"src/value.rs","rank":41,"score":30543.52106744416},{"content":"//! Содержит описания значений, которые может хранить GFF файл\n\n\n\nuse indexmap::IndexMap;\n\n\n\nuse crate::{Label, LocString, ResRef};\n\nuse crate::index::{U64Index, I64Index, F64Index, StringIndex, ResRefIndex, LocStringIndex, BinaryIndex};\n\n\n\n/// Перечисление, представляющее все примитивные типы данных, который может хранить GFF файл.\n\n///\n\n/// Кроме примитивных типов данных GFF файл также может хранить рекурсивные структуры из\n\n/// данных типов и их списки.\n\n#[derive(Debug, Clone, PartialEq)]\n\npub enum SimpleValueRef {\n\n /// Беззнаковое байтовое значение (от 0 до 255), занимающее один байт.\n\n ///\n\n /// Тег, ассоциированный с типом, равен `0`.\n\n Byte(u8),\n\n /// Символ текста в диапазоне `0x00-0xFF`, занимающий один байт.\n\n ///\n\n /// Тег, ассоциированный с типом, равен `1`.\n","file_path":"src/value.rs","rank":42,"score":30542.653857835507},{"content":" Word(u16),\n\n /// Знаковое целое (от -32768 до 32767), занимающее 2 байта.\n\n ///\n\n /// Тег, ассоциированный с типом, равен `3`.\n\n Short(i16),\n\n /// Беззнаковое целое (от 0 до 4294967296), занимающее 4 байта.\n\n ///\n\n /// Тег, ассоциированный с типом, равен `4`.\n\n Dword(u32),\n\n /// Знаковое целое (от -2147483648 до 2147483647), занимающее 4 байта.\n\n ///\n\n /// Тег, ассоциированный с типом, равен `5`.\n\n Int(i32),\n\n /// Беззнаковое целое (от 0 до примерно 18e+18), занимающее 8 байт.\n\n ///\n\n /// Тег, ассоциированный с типом, равен `6`.\n\n Dword64(u64),\n\n /// Знаковое целое (примерно от -9e+18 до +9e+18), занимающее 8 байт.\n\n ///\n\n /// Тег, ассоциированный с типом, равен `7`.\n","file_path":"src/value.rs","rank":43,"score":30539.87136796028},{"content":"/// В отличие от [`SimpleValueRef`] содержит полностью прочитанные данные из файла, а не только\n\n/// ссылки на них\n\n///\n\n/// Кроме примитивных типов данных GFF файл также может хранить рекурсивные структуры из\n\n/// данных типов и их списки.\n\n///\n\n/// [`SimpleValueRef`]: enum.SimpleValueRef.html\n\n#[derive(Debug, Clone, PartialEq)]\n\npub enum SimpleValue {\n\n /// Беззнаковое байтовое значение (от 0 до 255), занимающее один байт.\n\n ///\n\n /// Тег, ассоциированный с типом, равен `0`.\n\n Byte(u8),\n\n /// Символ текста в диапазоне `0x00-0xFF`, занимающий один байт.\n\n ///\n\n /// Тег, ассоциированный с типом, равен `1`.\n\n Char(i8),\n\n /// Беззнаковое целое (от 0 до 65535), занимающее 2 байта.\n\n ///\n\n /// Тег, ассоциированный с типом, равен `2`.\n","file_path":"src/value.rs","rank":44,"score":30537.620475558047},{"content":" ///\n\n /// Тег, ассоциированный с типом, равен `5`.\n\n Int(i32),\n\n /// Беззнаковое целое (от 0 до примерно 18e+18), занимающее 8 байт.\n\n ///\n\n /// Тег, ассоциированный с типом, равен `6`.\n\n Dword64(u64),\n\n /// Знаковое целое (примерно от -9e+18 до +9e+18), занимающее 8 байт.\n\n ///\n\n /// Тег, ассоциированный с типом, равен `7`.\n\n Int64(i64),\n\n /// Число с плавающей запятой одинарной точности, занимающее 4 байта.\n\n ///\n\n /// Тег, ассоциированный с типом, равен `8`.\n\n Float(f32),\n\n /// Число с плавающей запятой двойной точности, занимающее 8 байт.\n\n ///\n\n /// Тег, ассоциированный с типом, равен `9`.\n\n Double(f64),\n\n /// Нелокализуемая строка.\n","file_path":"src/value.rs","rank":45,"score":30532.849342583555},{"content":" Char(val) => Value::Char(val),\n\n Word(val) => Value::Word(val),\n\n Short(val) => Value::Short(val),\n\n Dword(val) => Value::Dword(val),\n\n Int(val) => Value::Int(val),\n\n Dword64(val) => Value::Dword64(val),\n\n Int64(val) => Value::Int64(val),\n\n Float(val) => Value::Float(val),\n\n Double(val) => Value::Double(val),\n\n String(val) => Value::String(val),\n\n ResRef(val) => Value::ResRef(val),\n\n LocString(val) => Value::LocString(val),\n\n Void(val) => Value::Void(val),\n\n }\n\n }\n\n}\n","file_path":"src/value.rs","rank":46,"score":30532.788314587626},{"content":" String(String),\n\n /// Имя файла ресурса, до 16 символов.\n\n ///\n\n /// Тег, ассоциированный с типом, равен `11`.\n\n ResRef(ResRef),\n\n /// Локализуемая строка. Содержит `StringRef` и несколько `CExoString`, каждую со своим номером языка.\n\n ///\n\n /// Тег, ассоциированный с типом, равен `12`.\n\n LocString(LocString),\n\n /// Произвольные данные любой длины.\n\n ///\n\n /// Тег, ассоциированный с типом, равен `13`.\n\n Void(Vec<u8>),\n\n}\n\n\n\n/// Перечисление, представляющее все возможные типы данных, которых способен хранить GFF файл,\n\n/// в обобщенном виде. Аналог `serde_json::Value`\n\n#[derive(Debug, Clone, PartialEq)]\n\npub enum Value {\n\n /// Беззнаковое байтовое значение (от 0 до 255), занимающее один байт.\n","file_path":"src/value.rs","rank":47,"score":30532.700719398974},{"content":" Dword64(U64Index),\n\n /// Знаковое целое (примерно от -9e+18 до +9e+18), занимающее 8 байт.\n\n ///\n\n /// Тег, ассоциированный с типом, равен `7`.\n\n Int64(I64Index),\n\n /// Число с плавающей запятой одинарной точности, занимающее 4 байта.\n\n ///\n\n /// Тег, ассоциированный с типом, равен `8`.\n\n Float(f32),\n\n /// Число с плавающей запятой двойной точности, занимающее 8 байт.\n\n ///\n\n /// Тег, ассоциированный с типом, равен `9`.\n\n Double(F64Index),\n\n /// Нелокализуемая строка.\n\n ///\n\n /// Предпочитаемый максимальный размер - 1024 символа. Это ограничение установлено в первую\n\n /// очередь для того, чтобы сохранить пропускную способность сети в том случае, если строку\n\n /// необходимо передавать с сервера на клиент.\n\n ///\n\n /// Данный вид строк не должен использоваться для текста, который может увидеть игрок, так как\n","file_path":"src/value.rs","rank":48,"score":30529.12186974538},{"content":" ///\n\n /// Предпочитаемый максимальный размер - 1024 символа. Это ограничение установлено в первую\n\n /// очередь для того, чтобы сохранить пропускную способность сети в том случае, если строку\n\n /// необходимо передавать с сервера на клиент.\n\n ///\n\n /// Данный вид строк не должен использоваться для текста, который может увидеть игрок, так как\n\n /// он будет одинаковым независимо от языка клиента игры. Область применения данного типа -\n\n /// текст для разработчиков/дизайнеров уровней, например, тегов объектов, используемых в скриптах.\n\n ///\n\n /// Тег, ассоциированный с типом, равен `10`.\n\n String(String),\n\n /// Имя файла ресурса, до 16 символов.\n\n ///\n\n /// Тег, ассоциированный с типом, равен `11`.\n\n ResRef(ResRef),\n\n /// Локализуемая строка. Содержит `StringRef` и несколько `CExoString`, каждую со своим номером языка.\n\n ///\n\n /// Тег, ассоциированный с типом, равен `12`.\n\n LocString(LocString),\n\n /// Произвольные данные любой длины.\n","file_path":"src/value.rs","rank":49,"score":30526.940391457494},{"content":" /// он будет одинаковым независимо от языка клиента игры. Область применения данного типа -\n\n /// текст для разработчиков/дизайнеров уровней, например, тегов объектов, используемых в скриптах.\n\n ///\n\n /// Тег, ассоциированный с типом, равен `10`.\n\n String(StringIndex),\n\n /// Имя файла ресурса, до 16 символов.\n\n ///\n\n /// Тег, ассоциированный с типом, равен `11`.\n\n ResRef(ResRefIndex),\n\n /// Локализуемая строка. Содержит `StringRef` и несколько `CExoString`, каждую со своим номером языка.\n\n ///\n\n /// Тег, ассоциированный с типом, равен `12`.\n\n LocString(LocStringIndex),\n\n /// Произвольные данные любой длины.\n\n ///\n\n /// Тег, ассоциированный с типом, равен `13`.\n\n Void(BinaryIndex),\n\n}\n\n\n\n/// Перечисление, представляющее все примитивные типы данных, который может хранить GFF файл.\n","file_path":"src/value.rs","rank":50,"score":30526.8134241638},{"content":" Int64(i64),\n\n /// Число с плавающей запятой одинарной точности, занимающее 4 байта.\n\n ///\n\n /// Тег, ассоциированный с типом, равен `8`.\n\n Float(f32),\n\n /// Число с плавающей запятой двойной точности, занимающее 8 байт.\n\n ///\n\n /// Тег, ассоциированный с типом, равен `9`.\n\n Double(f64),\n\n /// Нелокализуемая строка.\n\n ///\n\n /// Предпочитаемый максимальный размер - 1024 символа. Это ограничение установлено в первую\n\n /// очередь для того, чтобы сохранить пропускную способность сети в том случае, если строку\n\n /// необходимо передавать с сервера на клиент.\n\n ///\n\n /// Данный вид строк не должен использоваться для текста, который может увидеть игрок, так как\n\n /// он будет одинаковым независимо от языка клиента игры. Область применения данного типа -\n\n /// текст для разработчиков/дизайнеров уровней, например, тегов объектов, используемых в скриптах.\n\n ///\n\n /// Тег, ассоциированный с типом, равен `10`.\n","file_path":"src/value.rs","rank":51,"score":30525.90206614384},{"content":" /// Фиктивный элемент, для связывания типа ошибки `E`\n\n marker: PhantomData<E>,\n\n}\n\nimpl<'de, E> Deserializer<'de> for GffStringDeserializer<E>\n\n where E: Error,\n\n{\n\n type Error = E;\n\n\n\n fn deserialize_any<V>(self, visitor: V) -> Result<V::Value, Self::Error>\n\n where V: Visitor<'de>,\n\n {\n\n use self::GffString::*;\n\n\n\n match self.value {\n\n External(str_ref) => visitor.visit_u32(str_ref.0),\n\n Internal(strings) => visitor.visit_map(strings.into_deserializer()),\n\n }\n\n }\n\n\n\n forward_to_deserialize_any!(\n\n bool i8 i16 i32 i64 i128 u8 u16 u32 u64 u128 f32 f64 char str\n\n string bytes byte_buf option unit unit_struct newtype_struct seq\n\n tuple tuple_struct map struct enum identifier ignored_any\n\n );\n\n}\n","file_path":"src/de/string.rs","rank":52,"score":28922.169946553317},{"content":"{\n\n type Error = E;\n\n\n\n fn deserialize_any<V>(self, visitor: V) -> Result<V::Value, Self::Error>\n\n where V: Visitor<'de>,\n\n {\n\n visitor.visit_u32(self.value.into())\n\n }\n\n\n\n forward_to_deserialize_any!(\n\n bool i8 i16 i32 i64 i128 u8 u16 u32 u64 u128 f32 f64 char str\n\n string bytes byte_buf option unit unit_struct newtype_struct seq\n\n tuple tuple_struct map struct enum identifier ignored_any\n\n );\n\n}\n\n\n\n///////////////////////////////////////////////////////////////////////////////////////////////////\n\n\n\nimpl<'de, E> IntoDeserializer<'de, E> for GffString\n\n where E: Error,\n","file_path":"src/de/string.rs","rank":53,"score":28921.305944119318},{"content":"//! Содержит реализацию конвертирования типа GFF строки в десериализатор\n\n//! с помощью которого из него могут быть прочитаны другие совместимые типы.\n\n\n\nuse std::marker::PhantomData;\n\n\n\nuse serde::forward_to_deserialize_any;\n\nuse serde::de::{Deserializer, Error, IntoDeserializer, Visitor};\n\n\n\nuse crate::string::{GffString, StringKey};\n\n\n\nimpl<'de, E> IntoDeserializer<'de, E> for StringKey\n\n where E: Error,\n\n{\n\n type Deserializer = StringKeyDeserializer<E>;\n\n\n\n #[inline]\n\n fn into_deserializer(self) -> Self::Deserializer {\n\n StringKeyDeserializer { value: self, marker: PhantomData }\n\n }\n\n}\n","file_path":"src/de/string.rs","rank":54,"score":28903.540760330176},{"content":"{\n\n type Deserializer = GffStringDeserializer<E>;\n\n\n\n #[inline]\n\n fn into_deserializer(self) -> Self::Deserializer {\n\n GffStringDeserializer { value: self, marker: PhantomData }\n\n }\n\n}\n\n\n\n/// Десериализатор, использующий в качестве источника данных тип [`GffString`].\n\n///\n\n/// В зависимости от типа хранимой строки позволяет прочитать из значения либо `u32`,\n\n/// являющемся StrRef индексом, либо отображение из `u32` (содержащего комбинированное\n\n/// значение языка и пола строки) на `String` с текстом строки для данного языка и пола.\n\n///\n\n/// [`GffString`]: ../../enum.GffString.html\n\n#[derive(Debug)]\n\npub struct GffStringDeserializer<E> {\n\n /// Источник данных, из которого достаются данные для десериализации других структур\n\n value: GffString,\n","file_path":"src/de/string.rs","rank":55,"score":28897.100960122872},{"content":"\n\n/// Десериализатор, использующий в качестве источника данных тип [`StringKey`].\n\n///\n\n/// Позволяет прочитать из ключа число, сформированное по формуле:\n\n/// ```rust,ignore\n\n/// ((language as u32) << 1) | gender as u32\n\n/// ```\n\n/// Именно в таком формате оно храниться в GFF файле.\n\n///\n\n/// [`StringKey`]: ../../enum.StringKey.html\n\n#[derive(Debug)]\n\npub struct StringKeyDeserializer<E> {\n\n /// Источник данных, из которого достаются данные для десериализации других структур\n\n value: StringKey,\n\n /// Фиктивный элемент, для связывания типа ошибки `E`\n\n marker: PhantomData<E>,\n\n}\n\n\n\nimpl<'de, E> Deserializer<'de> for StringKeyDeserializer<E>\n\n where E: Error,\n","file_path":"src/de/string.rs","rank":56,"score":28895.398146382126},{"content":" {\n\n use self::Value::*;\n\n\n\n match *self {\n\n Byte(val) => serializer.serialize_u8(val),\n\n Char(val) => serializer.serialize_i8(val),\n\n Word(val) => serializer.serialize_u16(val),\n\n Short(val) => serializer.serialize_i16(val),\n\n Dword(val) => serializer.serialize_u32(val),\n\n Int(val) => serializer.serialize_i32(val),\n\n Dword64(val) => serializer.serialize_u64(val),\n\n Int64(val) => serializer.serialize_i64(val),\n\n Float(val) => serializer.serialize_f32(val),\n\n Double(val) => serializer.serialize_f64(val),\n\n String(ref val) => serializer.serialize_str(&val),\n\n ResRef(ref val) => serializer.serialize_bytes(&val.0),\n\n //TODO: реализовать сериализацию LocString\n\n LocString(ref _val) => unimplemented!(\"serialization of LocString not yet implemented\"),\n\n Void(ref val) => serializer.serialize_bytes(&val),\n\n Struct(ref val) => {\n","file_path":"src/ser/value.rs","rank":69,"score":28476.337407948547},{"content":"//! Содержит реализацию типажа `Serialize` для сериализации типа `Value`\n\n\n\nuse serde::ser::{Serialize, SerializeMap, Serializer};\n\n\n\nuse crate::Label;\n\nuse crate::value::Value;\n\n\n\nimpl Serialize for Label {\n\n #[inline]\n\n fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>\n\n where S: Serializer,\n\n {\n\n serializer.serialize_bytes(self.as_ref())\n\n }\n\n}\n\n\n\nimpl Serialize for Value {\n\n #[inline]\n\n fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>\n\n where S: Serializer,\n","file_path":"src/ser/value.rs","rank":73,"score":28468.982693317765},{"content":" let mut map = serializer.serialize_map(Some(val.len()))?;\n\n for (k, v) in val {\n\n map.serialize_key(k)?;\n\n map.serialize_value(v)?;\n\n }\n\n map.end()\n\n },\n\n List(ref val) => val.serialize(serializer),\n\n }\n\n }\n\n}\n","file_path":"src/ser/value.rs","rank":74,"score":28459.222286063865},{"content":"}\n\n\n\nfn main() {\n\n let data = Test {\n\n u16: 1, i16: 2,\n\n u32: 3, i32: 4,\n\n u64: 5, i64: 6,\n\n\n\n string: \"String\".into(),\n\n\n\n Struct: Struct { f32: PI, f64: E, bytes: b\"Vec<u8>\".to_vec() },\n\n list: vec![\n\n Item { u8: 7, i8: -8 },\n\n Item { u8: 9, i8: -10 },\n\n ],\n\n };\n\n\n\n let mut vec = to_vec((*b\"GFF \").into(), &data).expect(\"can't write data\");\n\n // Важный нюанс - не забыть, что создание десериализатора читает заголовок и возвращает\n\n // Result, а не сам десериализатор, поэтому требуется распаковка результата\n\n let mut de = Deserializer::new(Cursor::new(vec)).expect(\"can't read GFF header\");\n\n let val = Value::deserialize(&mut de).expect(\"can't deserialize data\");\n\n\n\n println!(\"{:#?}\", val);\n\n}\n","file_path":"readme.md","rank":75,"score":39.74302806539192},{"content":"//! struct Item { u8: u8, i8: i8 }\n\n//!\n\n//! #[derive(Debug, Serialize, Deserialize)]\n\n//! struct Struct {\n\n//! f32: f32,\n\n//! f64: f64,\n\n//!\n\n//! #[serde(with = \"serde_bytes\")]\n\n//! bytes: Vec<u8>,\n\n//! }\n\n//!\n\n//! #[derive(Debug, Serialize, Deserialize)]\n\n//! #[allow(non_snake_case)]\n\n//! struct Test {\n\n//! u16: u16,\n\n//! i16: i16,\n\n//! u32: u32,\n\n//! i32: i32,\n\n//! u64: u64,\n\n//! i64: i64,\n","file_path":"src/lib.rs","rank":76,"score":39.28025437604654},{"content":" }\n\n }\n\n );\n\n}\n\nimpl<'de, 'a, R: Read + Seek> de::Deserializer<'de> for &'a mut Deserializer<R> {\n\n type Error = Error;\n\n\n\n #[inline]\n\n fn is_human_readable(&self) -> bool { false }\n\n\n\n primitive!(deserialize_i8 , visit_i8 , Char);\n\n primitive!(deserialize_u8 , visit_u8 , Byte);\n\n primitive!(deserialize_i16, visit_i16, Short);\n\n primitive!(deserialize_u16, visit_u16, Word);\n\n primitive!(deserialize_i32, visit_i32, Int);\n\n primitive!(deserialize_u32, visit_u32, Dword);\n\n primitive!(deserialize_i64, visit_i64, Int64, read_i64);\n\n primitive!(deserialize_u64, visit_u64, Dword64, read_u64);\n\n primitive!(deserialize_f32, visit_f32, Float);\n\n primitive!(deserialize_f64, visit_f64, Double, read_f64);\n","file_path":"src/de/mod.rs","rank":77,"score":39.25136861130052},{"content":" unsupported!(serialize_i16(i16));\n\n unsupported!(serialize_u16(u16));\n\n unsupported!(serialize_i32(i32));\n\n unsupported!(serialize_u32(u32));\n\n unsupported!(serialize_i64(i64));\n\n unsupported!(serialize_u64(u64));\n\n\n\n unsupported!(serialize_f32(f32));\n\n unsupported!(serialize_f64(f64));\n\n\n\n unsupported!(serialize_bool(bool));\n\n unsupported!(serialize_char(char));\n\n\n\n #[inline]\n\n fn serialize_str(self, value: &str) -> Result<Self::Ok> {\n\n // Добавляем запись о метке\n\n self.ser.ser.add_label(value)\n\n }\n\n unsupported!(serialize_bytes(&[u8]));\n\n\n","file_path":"src/ser/mod.rs","rank":78,"score":36.321910865387025},{"content":"//!\n\n//! string: String,\n\n//!\n\n//! Struct: Struct,\n\n//! list: Vec<Item>,\n\n//! }\n\n//!\n\n//! fn main() {\n\n//! let data = Test {\n\n//! u16: 1, i16: 2,\n\n//! u32: 3, i32: 4,\n\n//! u64: 5, i64: 6,\n\n//!\n\n//! string: \"String\".into(),\n\n//!\n\n//! Struct: Struct { f32: PI, f64: E, bytes: b\"Vec<u8>\".to_vec() },\n\n//! list: vec![\n\n//! Item { u8: 7, i8: -8 },\n\n//! Item { u8: 9, i8: -10 },\n\n//! ],\n","file_path":"src/lib.rs","rank":79,"score":35.672519039071155},{"content":"serde-gff\n\n=========\n\n[](https://crates.io/crates/serde_gff)\n\n[](https://docs.rs/serde-gff)\n\n[](https://github.com/Mingun/serde-gff/blob/master/LICENSE)\n\n\n\nGeneric File Format (GFF) -- формат файлов, используемый играми на движке Bioware Aurora:\n\nNewerwinter Nights, The Witcher и Newerwinter Nights 2.\n\n\n\nФормат имеет некоторые ограничения:\n\n- элементами верхнего уровня могут быть только структуры или перечисления Rust в unit или struct варианте\n\n- имена полей структур не должны быть длиннее 16 байт в UTF-8. При нарушении при сериализации будет ошибка\n\n- то же самое касается ключей карт. Кроме того, ключами могут быть только строки (`&str` или `String`)\n\n\n\nУстановка\n\n---------\n\nВыполните в корне проекта\n\n```sh\n\ncargo add serde_gff\n\n```\n\nили добавьте следующую строку в `Cargo.toml`:\n\n```toml\n\n[dependencies]\n\nserde_gff = \"0.2\"\n\n```\n\n\n\nПример\n\n------\n\n```rust\n\nuse std::f32::consts::PI;\n\nuse std::f64::consts::E;\n\nuse std::io::Cursor;\n\nuse serde::{Serialize, Deserialize};\n\n\n\nuse serde_gff::de::Deserializer;\n\nuse serde_gff::ser::to_vec;\n\nuse serde_gff::value::Value;\n\n\n\n#[derive(Debug, Serialize, Deserialize)]\n\nstruct Item { u8: u8, i8: i8 }\n\n\n\n#[derive(Debug, Serialize, Deserialize)]\n\nstruct Struct {\n\n f32: f32,\n\n f64: f64,\n\n\n\n #[serde(with = \"serde_bytes\")]\n\n bytes: Vec<u8>,\n\n}\n\n\n\n#[derive(Debug, Serialize, Deserialize)]\n\n#[allow(non_snake_case)]\n\nstruct Test {\n\n u16: u16,\n\n i16: i16,\n\n u32: u32,\n\n i32: i32,\n\n u64: u64,\n\n i64: i64,\n\n\n\n string: String,\n\n\n\n Struct: Struct,\n\n list: Vec<Item>,\n","file_path":"readme.md","rank":80,"score":34.09530801930947},{"content":" delegate!(deserialize_u8);\n\n delegate!(deserialize_i16);\n\n delegate!(deserialize_u16);\n\n delegate!(deserialize_i32);\n\n delegate!(deserialize_u32);\n\n delegate!(deserialize_i64);\n\n delegate!(deserialize_u64);\n\n delegate!(deserialize_f32);\n\n delegate!(deserialize_f64);\n\n\n\n delegate!(deserialize_bool);\n\n delegate!(deserialize_char);\n\n delegate!(deserialize_str);\n\n delegate!(deserialize_string);\n\n delegate!(deserialize_bytes);\n\n delegate!(deserialize_byte_buf);\n\n delegate!(deserialize_option);\n\n delegate!(deserialize_unit);\n\n delegate!(deserialize_map);\n\n delegate!(deserialize_seq);\n","file_path":"src/de/mod.rs","rank":81,"score":33.046993488137666},{"content":" type SerializeTupleVariant = Self::SerializeSeq;\n\n type SerializeMap = MapSerializer<'a>;\n\n type SerializeStruct = StructSerializer<'a>;\n\n type SerializeStructVariant = Self::SerializeStruct;\n\n\n\n primitive!(serialize_u8 , u8 , Byte);\n\n primitive!(serialize_i8 , i8 , Char);\n\n primitive!(serialize_u16, u16, Word);\n\n primitive!(serialize_i16, i16, Short);\n\n primitive!(serialize_u32, u32, Dword);\n\n primitive!(serialize_i32, i32, Int);\n\n complex! (serialize_u64, u64, Dword64, write_u64);\n\n complex! (serialize_i64, i64, Int64, write_i64);\n\n\n\n primitive!(serialize_f32, f32, Float);\n\n complex! (serialize_f64, f64, Double, write_f64);\n\n\n\n /// Формат не поддерживает сериализацию булевых значений, поэтому значение сериализуется,\n\n /// как `u8`: `true` представляется в виде `1`, а `false` -- в виде `0`.\n\n #[inline]\n","file_path":"src/ser/mod.rs","rank":82,"score":32.984519516947536},{"content":" /// # Параметры\n\n /// - `tag`: Вид данных, которые требуется прочитать. Известные данные расположены в\n\n /// диапазоне `[0; 13]`, для остальных значений возвращается ошибка [`Error::UnknownValue`]\n\n ///\n\n /// # Возвращаемое значение\n\n /// Возвращает лениво читаемое значение. Если данные хранятся непосредственно за тегом, то\n\n /// они будут уже прочитаны, в противном случае читается только адрес их местонахождения в файле.\n\n /// Таким образом, если данные не нужны, лишних чтений не будет\n\n ///\n\n /// [`Error::UnknownValue`]: ../../error/enum.Error.html#variant.UnknownValue\n\n fn read_value_ref(&mut self, tag: u32) -> Result<SimpleValueRef> {\n\n use self::SimpleValueRef::*;\n\n\n\n let value = match tag {\n\n 0 => Byte (self.reader.read_u8()?),\n\n 1 => Char (self.reader.read_i8()?),\n\n 2 => Word (self.reader.read_u16::<LE>()?),\n\n 3 => Short(self.reader.read_i16::<LE>()?),\n\n 4 => Dword(self.reader.read_u32::<LE>()?),\n\n 5 => Int (self.reader.read_i32::<LE>()?),\n","file_path":"src/parser/mod.rs","rank":83,"score":30.68165213864182},{"content":" return Err(Error::Unexpected(\"Byte, Char\", token));\n\n }\n\n\n\n #[inline]\n\n fn deserialize_str<V>(self, visitor: V) -> Result<V::Value>\n\n where V: Visitor<'de>,\n\n {\n\n self.deserialize_string(visitor)\n\n }\n\n fn deserialize_string<V>(self, visitor: V) -> Result<V::Value>\n\n where V: Visitor<'de>,\n\n {\n\n let token = self.next_token()?;\n\n match token {\n\n Token::Value(SimpleValueRef::String(value)) => {\n\n visitor.visit_string(self.parser.read_string(value)?)\n\n },\n\n Token::Value(SimpleValueRef::ResRef(value)) => {\n\n visitor.visit_string(self.parser.read_resref(value)?.as_string()?)\n\n },\n","file_path":"src/de/mod.rs","rank":84,"score":30.511566422187407},{"content":"\n\n #[inline]\n\n fn serialize_field<T>(&mut self, key: &'static str, value: &T) -> Result<Self::Ok>\n\n where T: ?Sized + Serialize,\n\n {\n\n // Добавляем запись о метке\n\n let label = self.ser.add_label(key)?;\n\n self.serialize_value(label, value)\n\n }\n\n\n\n #[inline]\n\n fn end(self) -> Result<Self::Ok> { Ok(()) }\n\n}\n\nimpl<'a> SerializeStructVariant for StructSerializer<'a> {\n\n type Ok = ();\n\n type Error = Error;\n\n\n\n #[inline]\n\n fn serialize_field<T>(&mut self, key: &'static str, value: &T) -> Result<Self::Ok>\n\n where T: ?Sized + Serialize,\n","file_path":"src/ser/mod.rs","rank":85,"score":29.293138120035366},{"content":" }\n\n\n\n newtype_test!(u8 = 42u8);\n\n newtype_test!(u16 = 42u16);\n\n newtype_test!(u32 = 42u32);\n\n newtype_test!(u64 = 42u64);\n\n\n\n newtype_test!(i8 = -42i8);\n\n newtype_test!(i16 = -42i16);\n\n newtype_test!(i32 = -42i32);\n\n newtype_test!(i64 = -42i64);\n\n\n\n newtype_test!(f32 = 42f32);\n\n newtype_test!(f64 = 42f64);\n\n\n\n newtype_test!(bool = true);\n\n newtype_test!(bool = false);\n\n\n\n newtype_test!(String = String::from(\"some string\"));\n\n newtype_test!(ByteBuf = ByteBuf::from(b\"some vector\".to_vec()));\n","file_path":"src/ser/mod.rs","rank":86,"score":29.289398726253392},{"content":" fn serialize_bool(self, v: bool) -> Result<Self::Ok> {\n\n self.serialize_u8(if v { 1 } else { 0 })\n\n }\n\n /// Формат не поддерживает сериализацию произвольных символов как отдельную сущность, поэтому\n\n /// они сериализуются, как строка из одного символа\n\n #[inline]\n\n fn serialize_char(self, v: char) -> Result<Self::Ok> {\n\n let mut data = [0u8; 4];\n\n self.serialize_str(v.encode_utf8(&mut data))\n\n }\n\n\n\n complex!(serialize_str , &str , String);\n\n complex!(serialize_bytes, &[u8], Void);\n\n\n\n #[inline]\n\n fn serialize_none(self) -> Result<Self::Ok> {\n\n self.serialize_unit()\n\n }\n\n #[inline]\n\n fn serialize_some<T>(self, value: &T) -> Result<Self::Ok>\n","file_path":"src/ser/mod.rs","rank":87,"score":29.27307416122513},{"content":" unsupported!(serialize_i32(i32));\n\n unsupported!(serialize_u32(u32));\n\n unsupported!(serialize_i64(i64));\n\n unsupported!(serialize_u64(u64));\n\n\n\n unsupported!(serialize_f32(f32));\n\n unsupported!(serialize_f64(f64));\n\n\n\n unsupported!(serialize_bool(bool));\n\n unsupported!(serialize_char(char));\n\n\n\n unsupported!(serialize_str(&str));\n\n unsupported!(serialize_bytes(&[u8]));\n\n\n\n #[inline]\n\n fn serialize_none(self) -> Result<Self::Ok> {\n\n self.serialize_unit()\n\n }\n\n fn serialize_some<T>(self, value: &T) -> Result<Self::Ok>\n\n where T: ?Sized + Serialize,\n","file_path":"src/ser/mod.rs","rank":88,"score":28.207364269203115},{"content":" let token = self.next_token()?;\n\n unimplemented!(\"`deserialize_tuple_struct(name: {}, len: {})` not yet supported. Token: {:?}\", name, len, token)\n\n }\n\n fn deserialize_struct<V>(self, _name: &'static str, _fields: &'static [&'static str], visitor: V) -> Result<V::Value>\n\n where V: Visitor<'de>,\n\n {\n\n self.deserialize_map(visitor)\n\n }\n\n fn deserialize_enum<V>(self, name: &'static str, variants: &'static [&'static str], _visitor: V) -> Result<V::Value>\n\n where V: Visitor<'de>,\n\n {\n\n let token = self.next_token()?;\n\n unimplemented!(\"`deserialize_enum(name: {}, variants: {})` not yet supported. Token: {:?}\", name, variants.len(), token)\n\n }\n\n}\n\n\n\nimpl<'de, 'a, R: Read + Seek> de::MapAccess<'de> for &'a mut Deserializer<R> {\n\n type Error = Error;\n\n\n\n fn next_key_seed<K>(&mut self, seed: K) -> Result<Option<K::Value>>\n","file_path":"src/de/mod.rs","rank":89,"score":28.157945108383448},{"content":" fn into_raw(&self, label: u32) -> Result<raw::Field> {\n\n use self::SimpleValueRef::*;\n\n\n\n let mut data = [0u8; 4];\n\n let type_ = {\n\n let mut storage = &mut data[..];\n\n match *self {\n\n Byte(val) => { storage.write_u8 (val )?; FieldType::Byte },\n\n Char(val) => { storage.write_i8 (val )?; FieldType::Char },\n\n Word(val) => { storage.write_u16::<LE>(val )?; FieldType::Word },\n\n Short(val) => { storage.write_i16::<LE>(val )?; FieldType::Short },\n\n Dword(val) => { storage.write_u32::<LE>(val )?; FieldType::Dword },\n\n Int(val) => { storage.write_i32::<LE>(val )?; FieldType::Int },\n\n Dword64(val) => { storage.write_u32::<LE>(val.0)?; FieldType::Dword64 },\n\n Int64(val) => { storage.write_u32::<LE>(val.0)?; FieldType::Int64 },\n\n Float(val) => { storage.write_f32::<LE>(val )?; FieldType::Float },\n\n Double(val) => { storage.write_u32::<LE>(val.0)?; FieldType::Double },\n\n String(val) => { storage.write_u32::<LE>(val.0)?; FieldType::String },\n\n ResRef(val) => { storage.write_u32::<LE>(val.0)?; FieldType::ResRef },\n\n LocString(val) => { storage.write_u32::<LE>(val.0)?; FieldType::LocString },\n","file_path":"src/ser/mod.rs","rank":90,"score":26.831443170936854},{"content":"\n\n delegate!(deserialize_any);\n\n delegate!(deserialize_ignored_any);\n\n\n\n delegate!(deserialize_unit_struct, name);\n\n delegate!(deserialize_newtype_struct, name);\n\n delegate!(deserialize_struct, names);\n\n delegate!(deserialize_enum, names);\n\n\n\n #[inline]\n\n fn deserialize_tuple<V>(self, len: usize, visitor: V) -> Result<V::Value>\n\n where V: Visitor<'de>,\n\n {\n\n self.0.deserialize_tuple(len, visitor)\n\n }\n\n #[inline]\n\n fn deserialize_tuple_struct<V>(self, name: &'static str, len: usize, visitor: V) -> Result<V::Value>\n\n where V: Visitor<'de>,\n\n {\n\n self.0.deserialize_tuple_struct(name, len, visitor)\n","file_path":"src/de/mod.rs","rank":91,"score":26.41915103701061},{"content":" _ => Err(Error::Unexpected(\"String, ResRef\", token)),\n\n }\n\n }\n\n #[inline]\n\n fn deserialize_bytes<V>(self, visitor: V) -> Result<V::Value>\n\n where V: Visitor<'de>,\n\n {\n\n self.deserialize_byte_buf(visitor)\n\n }\n\n fn deserialize_byte_buf<V>(self, visitor: V) -> Result<V::Value>\n\n where V: Visitor<'de>,\n\n {\n\n let token = self.next_token()?;\n\n match token {\n\n Token::Value(SimpleValueRef::Void(value)) => {\n\n visitor.visit_byte_buf(self.parser.read_byte_buf(value)?)\n\n },\n\n Token::Value(SimpleValueRef::ResRef(value)) => {\n\n visitor.visit_byte_buf(self.parser.read_resref(value)?.0)\n\n },\n","file_path":"src/de/mod.rs","rank":92,"score":26.04842989291718},{"content":" where K: DeserializeSeed<'de>,\n\n {\n\n let token = self.peek_token()?.clone();\n\n match token {\n\n Token::RootEnd | Token::ItemEnd | Token::StructEnd => Ok(None),\n\n Token::Label(..) => seed.deserialize(Field(&mut **self)).map(Some),\n\n token => Err(Error::Unexpected(\"Label\", token)),\n\n }\n\n }\n\n\n\n #[inline]\n\n fn next_value_seed<V>(&mut self, seed: V) -> Result<V::Value>\n\n where V: DeserializeSeed<'de>,\n\n {\n\n seed.deserialize(&mut **self)\n\n }\n\n}\n\n\n\nimpl<'de, 'a, R: Read + Seek> de::SeqAccess<'de> for &'a mut Deserializer<R> {\n\n type Error = Error;\n","file_path":"src/de/mod.rs","rank":93,"score":25.637917980794793},{"content":"//! Содержит реализацию структуры, описывающей ссылку на ресурс и реализацию типажей для\n\n//! конвертации других типов данных в ссылку и обратно\n\n\n\nuse std::fmt;\n\nuse std::str::{self, FromStr, Utf8Error};\n\nuse std::string::FromUtf8Error;\n\n\n\n/// Представляет ссылку на игровой ресурс, которым может быть шаблон объекта\n\n#[derive(Clone, PartialEq, Eq, Hash)]\n\npub struct ResRef(pub(crate) Vec<u8>);\n\n\n\nimpl ResRef {\n\n /// Возвращает представление данной ссылки на ресурс как строки, если она представлена в виде `UTF-8` строки\n\n #[inline]\n\n pub fn as_str(&self) -> Result<&str, Utf8Error> {\n\n str::from_utf8(&self.0)\n\n }\n\n /// Возвращает представление данной ссылки на ресурс как строки, если она представлена в виде `UTF-8` строки\n\n #[inline]\n\n pub fn as_string(self) -> Result<String, FromUtf8Error> {\n","file_path":"src/resref.rs","rank":94,"score":25.07538584320534},{"content":" }\n\n );\n\n}\n\n\n\nimpl<'a> ser::Serializer for &'a mut Serializer {\n\n type Ok = ();\n\n type Error = Error;\n\n\n\n type SerializeSeq = ListSerializer<'a>;\n\n type SerializeTuple = Impossible<Self::Ok, Self::Error>;\n\n type SerializeTupleStruct = Impossible<Self::Ok, Self::Error>;\n\n type SerializeTupleVariant = Self::SerializeSeq;\n\n type SerializeMap = MapSerializer<'a>;\n\n type SerializeStruct = StructSerializer<'a>;\n\n type SerializeStructVariant = Self::SerializeStruct;\n\n\n\n unsupported!(serialize_i8(i8));\n\n unsupported!(serialize_u8(u8));\n\n unsupported!(serialize_i16(i16));\n\n unsupported!(serialize_u16(u16));\n","file_path":"src/ser/mod.rs","rank":95,"score":25.018520171408536},{"content":"\n\n fn deserialize_bool<V>(self, visitor: V) -> Result<V::Value>\n\n where V: Visitor<'de>,\n\n {\n\n let token = self.next_token()?;\n\n if let Token::Value(SimpleValueRef::Byte(value)) = token {\n\n return visitor.visit_bool(value != 0);\n\n }\n\n return Err(Error::Unexpected(\"Byte\", token));\n\n }\n\n fn deserialize_char<V>(self, visitor: V) -> Result<V::Value>\n\n where V: Visitor<'de>,\n\n {\n\n let token = self.next_token()?;\n\n if let Token::Value(SimpleValueRef::Byte(value)) = token {\n\n return visitor.visit_char(value as char);\n\n }\n\n if let Token::Value(SimpleValueRef::Char(value)) = token {\n\n return visitor.visit_char(value as u8 as char);\n\n }\n","file_path":"src/de/mod.rs","rank":96,"score":24.95690371453668},{"content":" String::from_utf8(self.0)\n\n }\n\n}\n\n\n\nimpl fmt::Debug for ResRef {\n\n fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {\n\n if let Ok(value) = str::from_utf8(&self.0) {\n\n return write!(f, \"{}\", value);\n\n }\n\n self.0.fmt(f)\n\n }\n\n}\n\n\n\nimpl fmt::Display for ResRef {\n\n #[inline]\n\n fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {\n\n let value = self.as_str().map_err(|_| fmt::Error)?;\n\n write!(f, \"{}\", value)\n\n }\n\n}\n","file_path":"src/resref.rs","rank":97,"score":24.280137291571616},{"content":" let token = self.next_token()?;\n\n match token {\n\n //TODO: После решения https://github.com/serde-rs/serde/issues/745 можно будет передавать числа\n\n Token::Value(Byte(val)) => visitor.visit_string(val.to_string()),\n\n Token::Value(Char(val)) => visitor.visit_string(val.to_string()),\n\n Token::Value(Word(val)) => visitor.visit_string(val.to_string()),\n\n Token::Value(Short(val)) => visitor.visit_string(val.to_string()),\n\n Token::Value(Dword(val)) => visitor.visit_string(val.to_string()),\n\n Token::Value(Int(val)) => visitor.visit_string(val.to_string()),\n\n Token::Value(Dword64(val)) => visitor.visit_string(self.parser.read_u64(val)?.to_string()),\n\n Token::Value(Int64(val)) => visitor.visit_string(self.parser.read_i64(val)?.to_string()),\n\n Token::Value(String(val)) => visitor.visit_string(self.parser.read_string(val)?),\n\n _ => Err(Error::Unexpected(\"Byte, Char, Word, Short, Dword, Int, Int64, String\", token)),\n\n }\n\n }\n\n\n\n fn deserialize_map<V>(self, visitor: V) -> Result<V::Value>\n\n where V: Visitor<'de>,\n\n {\n\n let token = self.next_token()?;\n","file_path":"src/de/mod.rs","rank":98,"score":23.95045613106896},{"content":" Token::Label(index) => {\n\n let label = self.parser.read_label(index)?;\n\n visitor.visit_str(label.as_str()?)\n\n },\n\n _ => unimplemented!(\"`deserialize_any`, token: {:?}\", token)\n\n }\n\n }\n\n fn deserialize_ignored_any<V>(self, visitor: V) -> Result<V::Value>\n\n where V: Visitor<'de>,\n\n {\n\n let token = self.next_token()?;\n\n self.parser.skip_next(token);\n\n visitor.visit_none()\n\n }\n\n /// Данный метод вызывается при необходимости десериализовать идентификатор перечисления\n\n fn deserialize_identifier<V>(self, visitor: V) -> Result<V::Value>\n\n where V: Visitor<'de>,\n\n {\n\n use self::SimpleValueRef::*;\n\n\n","file_path":"src/de/mod.rs","rank":99,"score":23.831870013881463}],"string":"[\n {\n \"content\": \"/// Десериализатор для чтения идентификаторов полей\\n\\nstruct Field<'a, R: 'a + Read + Seek>(&'a mut Deserializer<R>);\\n\\n\\n\\nimpl<'de, 'a, R: 'a + Read + Seek> de::Deserializer<'de> for Field<'a, R> {\\n\\n type Error = Error;\\n\\n\\n\\n #[inline]\\n\\n fn is_human_readable(&self) -> bool { false }\\n\\n\\n\\n fn deserialize_identifier<V>(self, visitor: V) -> Result<V::Value>\\n\\n where V: Visitor<'de>,\\n\\n {\\n\\n let token = self.0.next_token()?;\\n\\n if let Token::Label(index) = token {\\n\\n let label = self.0.parser.read_label(index)?;\\n\\n return visitor.visit_str(label.as_str()?);\\n\\n }\\n\\n return Err(Error::Unexpected(\\\"Label\\\", token));\\n\\n }\\n\\n\\n\\n delegate!(deserialize_i8);\\n\",\n \"file_path\": \"src/de/mod.rs\",\n \"rank\": 4,\n \"score\": 84696.97356030186\n },\n {\n \"content\": \"#[derive(Debug)]\\n\\nenum Struct {\\n\\n /// Структура без полей\\n\\n NoFields,\\n\\n /// Структура, состоящая только из одного поля, содержит индекс этого поля\\n\\n OneField(usize),\\n\\n /// Структура, состоящая из двух и более полей. Содержит индекс списка и количество полей\\n\\n MultiField { list: FieldListIndex, fields: u32 }\\n\\n}\\n\\nimpl Struct {\\n\\n /// Преобразует промежуточное представление в окончательное, которое может быть записано в файл\\n\\n #[inline]\\n\\n fn into_raw(&self, offsets: &[u32]) -> raw::Struct {\\n\\n use self::Struct::*;\\n\\n\\n\\n match *self {\\n\\n NoFields => raw::Struct { tag: 0, offset: 0, fields: 0 },\\n\\n OneField(index) => raw::Struct { tag: 0, offset: index as u32, fields: 1 },\\n\\n MultiField { list, fields } => raw::Struct { tag: 0, offset: offsets[list.0], fields },\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\n/// Промежуточное представление сериализуемого поля структуры. Содержит данные, которые после\\n\\n/// небольшого преобразования, возможного только после окончания сериализации, могут\\n\\n/// быть записаны в файл\\n\",\n \"file_path\": \"src/ser/mod.rs\",\n \"rank\": 5,\n \"score\": 78386.64666751807\n },\n {\n \"content\": \"/// Список индексов для одной структуры, хранимые в поле [`Gff::field_indices`]\\n\\n///\\n\\n/// [`Gff::field_indices`]: ../struct.Gff.html#field.field_indices\\n\\nstruct FieldIndex<'a>(&'a [u32]);\\n\\nimpl<'a> fmt::Debug for FieldIndex<'a> {\\n\\n fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {\\n\\n write!(f, \\\"{:?}\\\", self.0)\\n\\n }\\n\\n}\\n\\n/// Представление списка индексов полей структур для отладочного вывода\\n\",\n \"file_path\": \"src/raw.rs\",\n \"rank\": 6,\n \"score\": 63018.69864732902\n },\n {\n \"content\": \"/// Данные для одного поля, хранимые в поле [`Gff::field_data`]. Используется для улучшения отладочного вывода\\n\\n///\\n\\n/// [`Gff::field_data`]: ../struct.Gff.html#field.field_data\\n\\nstruct FieldData<'a>(&'a [u8]);\\n\\nimpl<'a> fmt::Debug for FieldData<'a> {\\n\\n fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {\\n\\n write!(f, \\\"{:?}\\\", self.0)\\n\\n }\\n\\n}\\n\\n/// Представление данных комплексных полей для отладочного вывода\\n\",\n \"file_path\": \"src/raw.rs\",\n \"rank\": 7,\n \"score\": 63018.69864732902\n },\n {\n \"content\": \"/// Список индексов для одного списка, хранимый в поле [`Gff::list_indices`]\\n\\n///\\n\\n/// [`Gff::list_indices`]: ../struct.Gff.html#field.list_indices\\n\\nstruct ListIndex<'a>(&'a [u32]);\\n\\nimpl<'a> fmt::Debug for ListIndex<'a> {\\n\\n fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {\\n\\n write!(f, \\\"{:?}\\\", self.0)\\n\\n }\\n\\n}\\n\\n/// Представление списка индексов полей структур для отладочного вывода\\n\",\n \"file_path\": \"src/raw.rs\",\n \"rank\": 8,\n \"score\": 63018.69864732902\n },\n {\n \"content\": \"#[inline]\\n\\npub fn to_vec<T>(signature: Signature, value: &T) -> Result<Vec<u8>>\\n\\n where T: Serialize + ?Sized,\\n\\n{\\n\\n let mut vec = Vec::new();\\n\\n to_writer(&mut vec, signature, value)?;\\n\\n Ok(vec)\\n\\n}\\n\\n\\n\\n/// Реализует метод, возвращающий ошибку при попытке сериализовать значение, с описанием\\n\\n/// причины, что GFF не поддерживает данный тип на верхнем уровне и требуется обернуть его\\n\\n/// в структуру\\n\\nmacro_rules! unsupported {\\n\\n ($ser_method:ident ( $($type:ty),* ) ) => (\\n\\n unsupported!($ser_method($($type),*) -> Self::Ok);\\n\\n );\\n\\n ($ser_method:ident ( $($type:ty),* ) -> $result:ty) => (\\n\\n fn $ser_method(self, $(_: $type),*) -> Result<$result> {\\n\\n Err(Error::Serialize(concat!(\\n\\n \\\"`\\\", stringify!($ser_method), \\\"` can't be implemented in GFF format. Wrap value to the struct and serialize struct\\\"\\n\\n ).into()))\\n\",\n \"file_path\": \"src/ser/mod.rs\",\n \"rank\": 9,\n \"score\": 57658.16761985123\n },\n {\n \"content\": \"#[inline]\\n\\npub fn to_writer<W, T>(writer: &mut W, signature: Signature, value: &T) -> Result<()>\\n\\n where W: Write,\\n\\n T: Serialize + ?Sized,\\n\\n{\\n\\n let mut s = Serializer::default();\\n\\n value.serialize(&mut s)?;\\n\\n s.write(writer, signature, Version::V3_2)\\n\\n}\\n\\n/// Сериализует значение в массив. Значение должно являться Rust структурой или перечислением\\n\",\n \"file_path\": \"src/ser/mod.rs\",\n \"rank\": 10,\n \"score\": 52929.837909316484\n },\n {\n \"content\": \"#[derive(Debug, Copy, Clone)]\\n\\nstruct StructIndex(usize);\\n\\n\\n\\n/// Вспомогательная структура, описывающая индекс списка полей структуры, для типобезопасности.\\n\\n/// Любая GFF структура, имеющая более двух полей, ссылается по такому индексу на список с\\n\\n/// перечислением имеющихся у нее полей\\n\",\n \"file_path\": \"src/ser/mod.rs\",\n \"rank\": 11,\n \"score\": 42628.416642876524\n },\n {\n \"content\": \"#[derive(Debug)]\\n\\nenum Field {\\n\\n /// Поле, представленное значением без внутренней структуры. Содержит метку поля и его значение\\n\\n Simple { label: LabelIndex, value: SimpleValueRef },\\n\\n /// Поле, представленное значением с внутренней структурой. Содержит метку поля и индекс\\n\\n /// промежуточного представления структуры в массиве [`structs`](struct.Serializer.html#field.structs)\\n\\n Struct { label: LabelIndex, struct_: StructIndex },\\n\\n /// Поле, представленное списком значений. Содержит метку поля и индекс списка в массиве\\n\\n /// [`list_indices`](struct.Serializer.html#field.list_indices)\\n\\n List { label: LabelIndex, list: ListIndex },\\n\\n}\\n\\nimpl Field {\\n\\n /// Преобразует промежуточное представление в окончательное, которое может быть записано в файл\\n\\n #[inline]\\n\\n fn into_raw(&self, offsets: &[u32]) -> Result<raw::Field> {\\n\\n use self::Field::*;\\n\\n\\n\\n Ok(match self {\\n\\n Simple { label, value } => value.into_raw(label.0)?,\\n\\n Struct { label, struct_ } => {\\n\\n let mut data = [0u8; 4];\\n\",\n \"file_path\": \"src/ser/mod.rs\",\n \"rank\": 12,\n \"score\": 39430.20043977518\n },\n {\n \"content\": \"#[derive(Debug, Clone)]\\n\\nstruct ReadList {\\n\\n /// Индекс в таблице индексов, содержащий структуру-элемент для чтения\\n\\n index: ListIndicesIndex,\\n\\n /// Состояние, в которое нужно перейти после завершения чтения списка\\n\\n state: Box<State>,\\n\\n}\\n\\nimpl ReadList {\\n\\n /// # Возвращаемое значение\\n\\n /// Возвращает генерируемый в процессе разбора токен и новое состояние парсера\\n\\n fn next<R: Read + Seek>(self, parser: &mut Parser<R>) -> Result<(Token, State)> {\\n\\n // Переходим к списку индексов структур-элементов списка и читаем его размер\\n\\n parser.seek(self.index)?;\\n\\n let count = parser.read_u32()?;\\n\\n\\n\\n // Сообщаем о начале списка и переходим в состояние чтения первого элемента\\n\\n let token = Token::ListBegin(count);\\n\\n let state = ReadItems {\\n\\n index: self.index + 1,\\n\\n count: count,\\n\\n state: self.state,\\n\",\n \"file_path\": \"src/parser/states.rs\",\n \"rank\": 13,\n \"score\": 37342.98237045143\n },\n {\n \"content\": \"/// Сериализатор, записывающий значение поля\\n\\nstruct FieldSerializer<'a> {\\n\\n /// Хранилище записываемых данных\\n\\n ser: &'a mut Serializer,\\n\\n /// Номер метки, ассоциированной с сериализуемым полем\\n\\n label: LabelIndex,\\n\\n}\\n\\nimpl<'a> FieldSerializer<'a> {\\n\\n /// Добавляет в список структур новую структуру с указанным количеством полей, а\\n\\n /// в список полей -- новое поле типа \\\"структура\\\".\\n\\n ///\\n\\n /// Корректная ссылка на данные еще не заполнена, ее нужно будет скорректировать\\n\\n /// после того, как содержимое структуры будет записано\\n\\n ///\\n\\n /// Возвращает пару индексов: добавленной структуры и списка с полями структуры,\\n\\n /// если полей несколько\\n\\n fn add_struct(&mut self, fields: usize) -> Result<(StructIndex, FieldListIndex)> {\\n\\n // Добавляем запись о структуре\\n\\n let (struct_index, fields_index) = self.ser.add_struct(fields);\\n\\n\\n\\n self.ser.fields.push(Field::Struct {\\n\",\n \"file_path\": \"src/ser/mod.rs\",\n \"rank\": 14,\n \"score\": 34328.402072405515\n },\n {\n \"content\": \"#[derive(Debug)]\\n\\nstruct DebugListIndex<'a> {\\n\\n /// Данные, разбитые по принадлежности к отдельным спискам и без длины, для удобства отладочного вывода\\n\\n by_list: Vec<ListIndex<'a>>,\\n\\n /// Данные в том виде, в каком они хранятся в файле\\n\\n raw: &'a [u32],\\n\\n}\\n\\n\\n\\n/// Описание всей структуры GFF файла, как она хранится в GFF файле\\n\\npub struct Gff {\\n\\n /// Заголовок файла, содержащий метаинформацию о нем: тип содержимого, версию структуры,\\n\\n /// количество и местоположение структур в файле\\n\\n pub header: Header,\\n\\n /// Список структур внутри GFF файла. Структура -- группирующий элемент, состоящий\\n\\n /// из [полей], помеченных [метками]\\n\\n ///\\n\\n /// [полей]: struct.Field.html\\n\\n /// [метками]: ../struct.Label.html\\n\\n pub structs: Vec<Struct>,\\n\\n /// Список полей из всех структур GFF файла. Каждое поле ссылается на [метку] и данные,\\n\\n /// а также имеет некоторый тип\\n\",\n \"file_path\": \"src/raw.rs\",\n \"rank\": 15,\n \"score\": 34328.402072405515\n },\n {\n \"content\": \"#[derive(Debug)]\\n\\nstruct DebugFieldIndex<'a> {\\n\\n /// Данные, разбитые по принадлежности к отдельным структурам, для удобства отладочного вывода\\n\\n by_struct: Vec<FieldIndex<'a>>,\\n\\n /// Данные в том виде, в каком они хранятся в файле\\n\\n raw: &'a [u32],\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/raw.rs\",\n \"rank\": 16,\n \"score\": 34328.402072405515\n },\n {\n \"content\": \"#[derive(Debug)]\\n\\nstruct DebugFieldData<'a> {\\n\\n /// Данные, разбитые по принадлежности к отдельным полям, для удобства отладочного вывода\\n\\n by_field: Vec<FieldData<'a>>,\\n\\n /// Данные в том виде, в каком они хранятся в файле\\n\\n raw: &'a [u8],\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/raw.rs\",\n \"rank\": 17,\n \"score\": 34328.402072405515\n },\n {\n \"content\": \"#[derive(Debug, Copy, Clone)]\\n\\nstruct ListIndex(usize);\\n\\n\\n\\n/// Промежуточное представление сериализуемых структур. Содержит данные, которые после\\n\\n/// небольшого преобразования, возможного только после окончания сериализации, могут\\n\\n/// быть записаны в файл\\n\",\n \"file_path\": \"src/ser/mod.rs\",\n \"rank\": 18,\n \"score\": 32896.906332685656\n },\n {\n \"content\": \"#[derive(Debug, Copy, Clone)]\\n\\nstruct FieldListIndex(usize);\\n\\n\\n\\n/// Вспомогательная структура, описывающая индекс списка элементов GFF списка, для типобезопасности\\n\",\n \"file_path\": \"src/ser/mod.rs\",\n \"rank\": 19,\n \"score\": 31618.23813472376\n },\n {\n \"content\": \"impl From<FromUtf8Error> for Error {\\n\\n fn from(value: FromUtf8Error) -> Self { Encoding(value.to_string().into()) }\\n\\n}\\n\\n\\n\\nimpl de::Error for Error {\\n\\n fn custom<T: fmt::Display>(msg: T) -> Self {\\n\\n Deserialize(msg.to_string())\\n\\n }\\n\\n}\\n\\nimpl ser::Error for Error {\\n\\n fn custom<T: fmt::Display>(msg: T) -> Self {\\n\\n Error::Serialize(msg.to_string())\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/error.rs\",\n \"rank\": 20,\n \"score\": 31157.648306416206\n },\n {\n \"content\": \"\\n\\nimpl error::Error for Error {\\n\\n fn source(&self) -> Option<&(dyn error::Error + 'static)> {\\n\\n match *self {\\n\\n Io(ref err) => Some(err),\\n\\n _ => None,\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\nimpl From<io::Error> for Error {\\n\\n fn from(value: io::Error) -> Self { Io(value) }\\n\\n}\\n\\n/// Реализация для конвертации из ошибок кодирования библиотеки `encodings`\\n\\nimpl From<Cow<'static, str>> for Error {\\n\\n fn from(value: Cow<'static, str>) -> Self { Encoding(value) }\\n\\n}\\n\\nimpl From<Utf8Error> for Error {\\n\\n fn from(value: Utf8Error) -> Self { Encoding(value.to_string().into()) }\\n\\n}\\n\",\n \"file_path\": \"src/error.rs\",\n \"rank\": 21,\n \"score\": 31157.074837021893\n },\n {\n \"content\": \" /// Произошла ошибка кодирования или декодирования строки, например, из-за использования\\n\\n /// символа, не поддерживаемого кодировкой\\n\\n Encoding(Cow<'static, str>),\\n\\n /// В файле встретилось значение неизвестного типа, хранящее указанное значение\\n\\n UnknownValue {\\n\\n /// Идентификатор типа значения\\n\\n tag: u32,\\n\\n /// Значение, которое было записано в файле для данного тега\\n\\n value: u32\\n\\n },\\n\\n /// Разбор уже завершен\\n\\n ParsingFinished,\\n\\n /// Некорректное значение для метки. Метка не должна превышать по длине 16 байт в UTF-8,\\n\\n /// но указанное значение больше. Ошибка содержит длину текста, который пытаются преобразовать\\n\\n TooLongLabel(usize),\\n\\n /// При десериализации был обнаружен указанный токен, хотя ожидался не он.\\n\\n /// Ожидаемые значения описаны в первом параметре\\n\\n Unexpected(&'static str, Token),\\n\\n /// Ошибка, возникшая при десериализации\\n\\n Deserialize(String),\\n\",\n \"file_path\": \"src/error.rs\",\n \"rank\": 22,\n \"score\": 31156.977287721165\n },\n {\n \"content\": \" /// Ошибка, возникшая при сериализации\\n\\n Serialize(String),\\n\\n}\\n\\n/// Тип результата, используемый в методах данной библиотеки\\n\\npub type Result<T> = result::Result<T, Error>;\\n\\n\\n\\nimpl fmt::Display for Error {\\n\\n fn fmt(&self, fmt: &mut fmt::Formatter) -> fmt::Result {\\n\\n match *self {\\n\\n Io(ref err) => err.fmt(fmt),\\n\\n Encoding(ref msg) => msg.fmt(fmt),\\n\\n UnknownValue { tag, value } => write!(fmt, \\\"Unknown field value (tag: {}, value: {})\\\", tag, value),\\n\\n ParsingFinished => write!(fmt, \\\"Parsing finished\\\"),\\n\\n TooLongLabel(len) => write!(fmt, \\\"Too long label: label can contain up to 16 bytes, but string contains {} bytes in UTF-8\\\", len),\\n\\n Unexpected(ref expected, ref actual) => write!(fmt, \\\"Expected {}, but {:?} found\\\", expected, actual),\\n\\n Deserialize(ref msg) => msg.fmt(fmt),\\n\\n Serialize(ref msg) => msg.fmt(fmt),\\n\\n }\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/error.rs\",\n \"rank\": 23,\n \"score\": 31155.115355074882\n },\n {\n \"content\": \"//! Реализация структуры, описывающей ошибки кодирования или декодирования GFF\\n\\n\\n\\nuse std::borrow::Cow;\\n\\nuse std::fmt;\\n\\nuse std::error;\\n\\nuse std::io;\\n\\nuse std::result;\\n\\nuse std::str::Utf8Error;\\n\\nuse std::string::FromUtf8Error;\\n\\nuse serde::de;\\n\\nuse serde::ser;\\n\\n\\n\\nuse crate::parser::Token;\\n\\nuse self::Error::*;\\n\\n\\n\\n/// Виды ошибок, который могут возникнуть при чтении и интерпретации GFF-файла\\n\\n#[derive(Debug)]\\n\\npub enum Error {\\n\\n /// Произошла ошибка чтения или записи из/в нижележащего буфера\\n\\n Io(io::Error),\\n\",\n \"file_path\": \"src/error.rs\",\n \"rank\": 24,\n \"score\": 31150.980686689294\n },\n {\n \"content\": \"\\n\\nimpl From<[u8; 16]> for Label {\\n\\n fn from(arr: [u8; 16]) -> Self { Label(arr) }\\n\\n}\\n\\n\\n\\nimpl AsRef<[u8]> for Label {\\n\\n fn as_ref(&self) -> &[u8] { &self.0 }\\n\\n}\\n\\n\\n\\nimpl FromStr for Label {\\n\\n type Err = Error;\\n\\n\\n\\n #[inline]\\n\\n fn from_str(value: &str) -> Result<Self, Error> {\\n\\n Self::from_bytes(value.as_bytes())\\n\\n }\\n\\n}\\n\\n\\n\\n#[cfg(test)]\\n\\nmod tests {\\n\",\n \"file_path\": \"src/label.rs\",\n \"rank\": 25,\n \"score\": 31144.708684693032\n },\n {\n \"content\": \" return from_utf8(&self.0[0..i])\\n\\n }\\n\\n }\\n\\n return from_utf8(&self.0);\\n\\n }\\n\\n\\n\\n /// Пытается создать метку из указанного массива байт.\\n\\n ///\\n\\n /// # Ошибки\\n\\n /// В случае, если длина среза равна или превышает 16 байт, возвращается ошибка\\n\\n /// [`Error::TooLongLabel`](./error/enum.Error.html#variant.TooLongLabel)\\n\\n pub fn from_bytes(bytes: &[u8]) -> Result<Self, Error> {\\n\\n if bytes.len() > 16 {\\n\\n return Err(Error::TooLongLabel(bytes.len()));\\n\\n }\\n\\n\\n\\n let mut storage: [u8; 16] = Default::default();\\n\\n let range = 0..bytes.len();\\n\\n storage[range.clone()].copy_from_slice(&bytes[range]);\\n\\n Ok(storage.into())\\n\",\n \"file_path\": \"src/label.rs\",\n \"rank\": 26,\n \"score\": 31139.326154841918\n },\n {\n \"content\": \"//! Содержит реализацию структуры, описывающей название поля в GFF файле и реализацию типажей для\\n\\n//! конвертации других типов данных в метку и обратно\\n\\n\\n\\nuse std::fmt;\\n\\nuse std::result::Result;\\n\\nuse std::str::{from_utf8, FromStr, Utf8Error};\\n\\nuse crate::error::Error;\\n\\n\\n\\n/// Описание названия поля структуры GFF файла. GFF файл состоит из дерева структур, а каждая\\n\\n/// структура -- из полей с именем и значением. Имена полей представлены данной структурой\\n\\n#[derive(Clone, Copy, PartialEq, Eq, Hash)]\\n\\npub struct Label([u8; 16]);\\n\\n\\n\\nimpl Label {\\n\\n /// Возвращает представление данной метки как текста, если он представлен в виде `UTF-8` строки\\n\\n pub fn as_str(&self) -> Result<&str, Utf8Error> {\\n\\n for i in 0..self.0.len() {\\n\\n // Во внутреннем представлении данные метки продолжаются до первого нулевого символа,\\n\\n // однако сам нулевой символ не храниться -- это просто заполнитель\\n\\n if self.0[i] == 0 {\\n\",\n \"file_path\": \"src/label.rs\",\n \"rank\": 27,\n \"score\": 31137.62733871038\n },\n {\n \"content\": \" }\\n\\n}\\n\\n\\n\\nimpl fmt::Debug for Label {\\n\\n fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {\\n\\n if let Ok(value) = self.as_str() {\\n\\n return write!(f, \\\"Label({})\\\", value);\\n\\n }\\n\\n write!(f, \\\"Label(\\\")?;\\n\\n self.0.fmt(f)?;\\n\\n return write!(f, \\\")\\\");\\n\\n }\\n\\n}\\n\\n\\n\\nimpl fmt::Display for Label {\\n\\n fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {\\n\\n let value = self.as_str().map_err(|_| fmt::Error)?;\\n\\n write!(f, \\\"{}\\\", value)\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/label.rs\",\n \"rank\": 28,\n \"score\": 31136.28605459529\n },\n {\n \"content\": \" use super::Label;\\n\\n\\n\\n #[test]\\n\\n fn label_constructs_from_str() {\\n\\n assert_eq!(Label::from(*b\\\"short\\\\0\\\\0\\\\0\\\\0\\\\0\\\\0\\\\0\\\\0\\\\0\\\\0\\\\0\\\"), \\\"short\\\".parse().unwrap());\\n\\n assert_eq!(Label::from(*b\\\"exact_16_chars_\\\\0\\\"), \\\"exact_16_chars_\\\".parse().unwrap());\\n\\n assert!(\\\"more_then_16_char\\\".parse::<Label>().is_err());\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/label.rs\",\n \"rank\": 29,\n \"score\": 31129.95299440092\n },\n {\n \"content\": \" /// Преобразует вариант строки, наиболее приближенный к хранимому в файле варианту (и, таким\\n\\n /// образом, хранящий без потерь все содержимое файла) в вариант строки, в котором компилятор\\n\\n /// Rust гарантирует корректность данных -- либо ссылка на внешнюю строку, либо список строк\\n\\n /// для каждого языка и пола, причем для каждой пары существует лишь один вариант строки --\\n\\n /// последний из `LocString.strings`, если их там окажется несколько.\\n\\n ///\\n\\n /// Метод возвращает внутреннее представление, если `LocString.str_ref == StrRef(0xFFFFFFFF)`,\\n\\n /// в противном случае возвращается внешнее представление. Все строки из массива `LocString.strings`\\n\\n /// в этом случае игнорируются.\\n\\n fn from(value: LocString) -> Self {\\n\\n use self::GffString::*;\\n\\n\\n\\n match value.str_ref {\\n\\n StrRef(0xFFFFFFFF) => Internal(value.strings.into_iter().map(Into::into).collect()),\\n\\n _ => External(value.str_ref),\\n\\n }\\n\\n }\\n\\n}\\n\\nimpl From<GffString> for LocString {\\n\\n /// Преобразует представление локализованной строки, корректность данных в котором гарантируется\\n\",\n \"file_path\": \"src/string.rs\",\n \"rank\": 30,\n \"score\": 30987.8971985248\n },\n {\n \"content\": \" /// компилятором Rust в представление, приближенное к хранимому в GFF файле.\\n\\n ///\\n\\n /// При преобразовании внешнего представления строки в `LocString.strings` записывается пустой массив.\\n\\n /// При преобразовании внутреннего представления в `LocString.str_ref` записывается `StrRef(0xFFFFFFFF)`.\\n\\n fn from(value: GffString) -> Self {\\n\\n use self::GffString::*;\\n\\n\\n\\n match value {\\n\\n External(str_ref) => LocString { str_ref, strings: vec![] },\\n\\n Internal(strings) => {\\n\\n let strings = strings.into_iter().map(Into::into).collect();\\n\\n LocString { str_ref: StrRef(0xFFFFFFFF), strings }\\n\\n },\\n\\n }\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/string.rs\",\n \"rank\": 31,\n \"score\": 30987.151542149175\n },\n {\n \"content\": \"}\\n\\nimpl From<(StringKey, String)> for SubString {\\n\\n #[inline]\\n\\n fn from(value: (StringKey, String)) -> Self {\\n\\n SubString { key: value.0, string: value.1 }\\n\\n }\\n\\n}\\n\\nimpl Into<(StringKey, String)> for SubString {\\n\\n #[inline]\\n\\n fn into(self) -> (StringKey, String) {\\n\\n (self.key, self.string)\\n\\n }\\n\\n}\\n\\n\\n\\n/// Локализуемая строка, содержащая в себе все данные, которые могут храниться в GFF файле.\\n\\n/// Может содержать логически некорректные данные, поэтому, если не требуется анализировать\\n\\n/// непосредственное содержимое GFF файла без потерь, лучше сразу преобразовать ее в\\n\\n/// [`GffString`], используя `into()`, и работать с ней.\\n\\n///\\n\\n/// [`GffString`]: enum.GffString.html\\n\",\n \"file_path\": \"src/string.rs\",\n \"rank\": 32,\n \"score\": 30986.995264880225\n },\n {\n \"content\": \" StringKey(((value.0 as u32) << 1) | value.1 as u32)\\n\\n }\\n\\n}\\n\\n/// Преобразует ключ в число, в котором он храниться в GFF файле по формуле:\\n\\n/// ```rust,ignore\\n\\n/// ((self.language() as u32) << 1) | self.gender() as u32\\n\\n/// ```\\n\\nimpl Into<u32> for StringKey {\\n\\n #[inline]\\n\\n fn into(self) -> u32 { self.0 }\\n\\n}\\n\\n\\n\\n/// Часть локализованной строки, хранящая информацию для одного языка и пола\\n\\n#[derive(Debug, Clone, PartialEq, Eq, Hash)]\\n\\npub struct SubString {\\n\\n /// Язык, на котором записан текст этой части многоязыковой строки, и пол\\n\\n /// персонажа, для которого он написан\\n\\n pub key: StringKey,\\n\\n /// Текст многоязыковой строки для указанного пола и языка\\n\\n pub string: String,\\n\",\n \"file_path\": \"src/string.rs\",\n \"rank\": 33,\n \"score\": 30986.93637505392\n },\n {\n \"content\": \" /// Строка предназначена для персонажа мужского или неопределенного пола\\n\\n Male = 0,\\n\\n /// Строка предназначена для персонажа женского пола\\n\\n Female = 1,\\n\\n}\\n\\n\\n\\n/// Ключ, используемый для индексации локализуемых строк во внутреннем представлении\\n\\n/// строк (когда строки внедрены в GFF файл, а не используются ссылки на строки в TLK\\n\\n/// файле).\\n\\n#[derive(Debug, Clone, PartialEq, Eq, Hash)]\\n\\npub struct StringKey(pub(crate) u32);\\n\\nimpl StringKey {\\n\\n /// Язык, на котором записан текст этой части многоязыковой строки\\n\\n pub fn language(&self) -> Language { unsafe { transmute(self.0 >> 1) } }\\n\\n /// Пол персонажа, для которого написан текст этой части многоязыковой строки\\n\\n pub fn gender(&self) -> Gender { unsafe { transmute(self.0 % 2) } }\\n\\n}\\n\\nimpl From<(Language, Gender)> for StringKey {\\n\\n #[inline]\\n\\n fn from(value: (Language, Gender)) -> Self {\\n\",\n \"file_path\": \"src/string.rs\",\n \"rank\": 34,\n \"score\": 30984.9720129579\n },\n {\n \"content\": \" #[inline]\\n\\n pub fn code(&self) -> u32 { self.0 & !USER_TLK_MASK }\\n\\n}\\n\\n\\n\\nimpl fmt::Debug for StrRef {\\n\\n fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {\\n\\n write!(f, \\\"code: {}, user: {}\\\", self.code(), self.is_user())\\n\\n }\\n\\n}\\n\\n\\n\\n/// Виды языков, на которых могут храниться локализованные строки в объекте `LocString`\\n\\n#[derive(Debug, Clone, Copy, PartialEq, Eq, Hash)]\\n\\n#[repr(u32)]\\n\\npub enum Language {\\n\\n /// Английский язык\\n\\n English = 0,\\n\\n /// Французский язык\\n\\n French = 1,\\n\\n /// Немецкий язык\\n\\n German = 2,\\n\",\n \"file_path\": \"src/string.rs\",\n \"rank\": 35,\n \"score\": 30983.126135282753\n },\n {\n \"content\": \"//! Содержит реализации структур, описывающих строки, хранящиеся в GFF файле\\n\\nuse std::fmt;\\n\\nuse std::mem::transmute;\\n\\nuse std::collections::HashMap;\\n\\n\\n\\n/// Маска, определяющая идентификатор строки\\n\\nconst USER_TLK_MASK: u32 = 0x8000_0000;\\n\\n\\n\\n/// Индекс в файле `dialog.tlk`, содержащий локализованный текст\\n\\n#[derive(Clone, Copy, PartialEq, Eq, Hash)]\\n\\npub struct StrRef(pub(crate) u32);\\n\\n\\n\\nimpl StrRef {\\n\\n /// Определяет, является ли строка индексом не из основного TLK файла игры, а из TLK\\n\\n /// файла модуля. Строка является строкой из TLK файла модуля, если старший бит в ее\\n\\n /// идентификаторе взведен\\n\\n #[inline]\\n\\n pub fn is_user(&self) -> bool { self.0 & USER_TLK_MASK != 0 }\\n\\n\\n\\n /// Определяет индекс строки в TLK файле\\n\",\n \"file_path\": \"src/string.rs\",\n \"rank\": 36,\n \"score\": 30980.13710120473\n },\n {\n \"content\": \"#[derive(Debug, Clone, PartialEq, Eq, Hash)]\\n\\npub struct LocString {\\n\\n /// Индекс в TLK файле, содержащий локализованный текст\\n\\n pub str_ref: StrRef,\\n\\n /// Список локализованных строк для каждого языка и пола\\n\\n pub strings: Vec<SubString>,\\n\\n}\\n\\n\\n\\n/// Локализуемая строка, представленная в виде, в котором некорректные значения\\n\\n/// непредставимы.\\n\\n#[derive(Debug, Clone, PartialEq, Eq)]\\n\\npub enum GffString {\\n\\n /// Внешнее представление строки в виде индекса в TLK файле, содержащем локализованный\\n\\n /// текст. В зависимости от локализации текст будет разным\\n\\n External(StrRef),\\n\\n /// Внутреннее представление строки, хранимое внутри самого файла -- по строке для каждого\\n\\n /// языка и пола персонажа\\n\\n Internal(HashMap<StringKey, String>),\\n\\n}\\n\\nimpl From<LocString> for GffString {\\n\",\n \"file_path\": \"src/string.rs\",\n \"rank\": 37,\n \"score\": 30978.754982429386\n },\n {\n \"content\": \" /// Итальянский язык\\n\\n Italian = 3,\\n\\n /// Испанский язык\\n\\n Spanish = 4,\\n\\n /// Польский язык\\n\\n Polish = 5,\\n\\n /// Корейский язык\\n\\n Korean = 128,\\n\\n /// Традиционный китайский\\n\\n ChineseTraditional = 129,\\n\\n /// Упрощенный китайский\\n\\n ChineseSimplified = 130,\\n\\n /// Японский\\n\\n Japanese= 131,\\n\\n}\\n\\n\\n\\n/// Виды пола персонажа, на которых могут храниться локализованные строки в объекте `LocString`\\n\\n#[derive(Debug, Clone, Copy, PartialEq, Eq, Hash)]\\n\\n#[repr(u32)]\\n\\npub enum Gender {\\n\",\n \"file_path\": \"src/string.rs\",\n \"rank\": 38,\n \"score\": 30973.803320334773\n },\n {\n \"content\": \" ///\\n\\n /// Тег, ассоциированный с типом, равен `0`.\\n\\n Byte(u8),\\n\\n /// Символ текста в диапазоне `0x00-0xFF`, занимающий один байт.\\n\\n ///\\n\\n /// Тег, ассоциированный с типом, равен `1`.\\n\\n Char(i8),\\n\\n /// Беззнаковое целое (от 0 до 65535), занимающее 2 байта.\\n\\n ///\\n\\n /// Тег, ассоциированный с типом, равен `2`.\\n\\n Word(u16),\\n\\n /// Знаковое целое (от -32768 до 32767), занимающее 2 байта.\\n\\n ///\\n\\n /// Тег, ассоциированный с типом, равен `3`.\\n\\n Short(i16),\\n\\n /// Беззнаковое целое (от 0 до 4294967296), занимающее 4 байта.\\n\\n ///\\n\\n /// Тег, ассоциированный с типом, равен `4`.\\n\\n Dword(u32),\\n\\n /// Знаковое целое (от -2147483648 до 2147483647), занимающее 4 байта.\\n\",\n \"file_path\": \"src/value.rs\",\n \"rank\": 39,\n \"score\": 30546.175296797446\n },\n {\n \"content\": \" ///\\n\\n /// Тег, ассоциированный с типом, равен `13`.\\n\\n Void(Vec<u8>),\\n\\n /// Вложенная структура. Порядок полей в структуре постоянный и определяется порядком их добавления\\n\\n ///\\n\\n /// Тег, ассоциированный с типом, равен `14`.\\n\\n Struct(IndexMap<Label, Value>),\\n\\n /// Список значений любой длины.\\n\\n ///\\n\\n /// Тег, ассоциированный с типом, равен `15`.\\n\\n List(Vec<Value>),\\n\\n}\\n\\n\\n\\nimpl From<SimpleValue> for Value {\\n\\n #[inline]\\n\\n fn from(value: SimpleValue) -> Value {\\n\\n use self::SimpleValue::*;\\n\\n\\n\\n match value {\\n\\n Byte(val) => Value::Byte(val),\\n\",\n \"file_path\": \"src/value.rs\",\n \"rank\": 40,\n \"score\": 30546.06659401941\n },\n {\n \"content\": \" Char(i8),\\n\\n /// Беззнаковое целое (от 0 до 65535), занимающее 2 байта.\\n\\n ///\\n\\n /// Тег, ассоциированный с типом, равен `2`.\\n\\n Word(u16),\\n\\n /// Знаковое целое (от -32768 до 32767), занимающее 2 байта.\\n\\n ///\\n\\n /// Тег, ассоциированный с типом, равен `3`.\\n\\n Short(i16),\\n\\n /// Беззнаковое целое (от 0 до 4294967296), занимающее 4 байта.\\n\\n ///\\n\\n /// Тег, ассоциированный с типом, равен `4`.\\n\\n Dword(u32),\\n\\n /// Знаковое целое (от -2147483648 до 2147483647), занимающее 4 байта.\\n\\n ///\\n\\n /// Тег, ассоциированный с типом, равен `5`.\\n\\n Int(i32),\\n\\n /// Беззнаковое целое (от 0 до примерно 18e+18), занимающее 8 байт.\\n\\n ///\\n\\n /// Тег, ассоциированный с типом, равен `6`.\\n\",\n \"file_path\": \"src/value.rs\",\n \"rank\": 41,\n \"score\": 30543.52106744416\n },\n {\n \"content\": \"//! Содержит описания значений, которые может хранить GFF файл\\n\\n\\n\\nuse indexmap::IndexMap;\\n\\n\\n\\nuse crate::{Label, LocString, ResRef};\\n\\nuse crate::index::{U64Index, I64Index, F64Index, StringIndex, ResRefIndex, LocStringIndex, BinaryIndex};\\n\\n\\n\\n/// Перечисление, представляющее все примитивные типы данных, который может хранить GFF файл.\\n\\n///\\n\\n/// Кроме примитивных типов данных GFF файл также может хранить рекурсивные структуры из\\n\\n/// данных типов и их списки.\\n\\n#[derive(Debug, Clone, PartialEq)]\\n\\npub enum SimpleValueRef {\\n\\n /// Беззнаковое байтовое значение (от 0 до 255), занимающее один байт.\\n\\n ///\\n\\n /// Тег, ассоциированный с типом, равен `0`.\\n\\n Byte(u8),\\n\\n /// Символ текста в диапазоне `0x00-0xFF`, занимающий один байт.\\n\\n ///\\n\\n /// Тег, ассоциированный с типом, равен `1`.\\n\",\n \"file_path\": \"src/value.rs\",\n \"rank\": 42,\n \"score\": 30542.653857835507\n },\n {\n \"content\": \" Word(u16),\\n\\n /// Знаковое целое (от -32768 до 32767), занимающее 2 байта.\\n\\n ///\\n\\n /// Тег, ассоциированный с типом, равен `3`.\\n\\n Short(i16),\\n\\n /// Беззнаковое целое (от 0 до 4294967296), занимающее 4 байта.\\n\\n ///\\n\\n /// Тег, ассоциированный с типом, равен `4`.\\n\\n Dword(u32),\\n\\n /// Знаковое целое (от -2147483648 до 2147483647), занимающее 4 байта.\\n\\n ///\\n\\n /// Тег, ассоциированный с типом, равен `5`.\\n\\n Int(i32),\\n\\n /// Беззнаковое целое (от 0 до примерно 18e+18), занимающее 8 байт.\\n\\n ///\\n\\n /// Тег, ассоциированный с типом, равен `6`.\\n\\n Dword64(u64),\\n\\n /// Знаковое целое (примерно от -9e+18 до +9e+18), занимающее 8 байт.\\n\\n ///\\n\\n /// Тег, ассоциированный с типом, равен `7`.\\n\",\n \"file_path\": \"src/value.rs\",\n \"rank\": 43,\n \"score\": 30539.87136796028\n },\n {\n \"content\": \"/// В отличие от [`SimpleValueRef`] содержит полностью прочитанные данные из файла, а не только\\n\\n/// ссылки на них\\n\\n///\\n\\n/// Кроме примитивных типов данных GFF файл также может хранить рекурсивные структуры из\\n\\n/// данных типов и их списки.\\n\\n///\\n\\n/// [`SimpleValueRef`]: enum.SimpleValueRef.html\\n\\n#[derive(Debug, Clone, PartialEq)]\\n\\npub enum SimpleValue {\\n\\n /// Беззнаковое байтовое значение (от 0 до 255), занимающее один байт.\\n\\n ///\\n\\n /// Тег, ассоциированный с типом, равен `0`.\\n\\n Byte(u8),\\n\\n /// Символ текста в диапазоне `0x00-0xFF`, занимающий один байт.\\n\\n ///\\n\\n /// Тег, ассоциированный с типом, равен `1`.\\n\\n Char(i8),\\n\\n /// Беззнаковое целое (от 0 до 65535), занимающее 2 байта.\\n\\n ///\\n\\n /// Тег, ассоциированный с типом, равен `2`.\\n\",\n \"file_path\": \"src/value.rs\",\n \"rank\": 44,\n \"score\": 30537.620475558047\n },\n {\n \"content\": \" ///\\n\\n /// Тег, ассоциированный с типом, равен `5`.\\n\\n Int(i32),\\n\\n /// Беззнаковое целое (от 0 до примерно 18e+18), занимающее 8 байт.\\n\\n ///\\n\\n /// Тег, ассоциированный с типом, равен `6`.\\n\\n Dword64(u64),\\n\\n /// Знаковое целое (примерно от -9e+18 до +9e+18), занимающее 8 байт.\\n\\n ///\\n\\n /// Тег, ассоциированный с типом, равен `7`.\\n\\n Int64(i64),\\n\\n /// Число с плавающей запятой одинарной точности, занимающее 4 байта.\\n\\n ///\\n\\n /// Тег, ассоциированный с типом, равен `8`.\\n\\n Float(f32),\\n\\n /// Число с плавающей запятой двойной точности, занимающее 8 байт.\\n\\n ///\\n\\n /// Тег, ассоциированный с типом, равен `9`.\\n\\n Double(f64),\\n\\n /// Нелокализуемая строка.\\n\",\n \"file_path\": \"src/value.rs\",\n \"rank\": 45,\n \"score\": 30532.849342583555\n },\n {\n \"content\": \" Char(val) => Value::Char(val),\\n\\n Word(val) => Value::Word(val),\\n\\n Short(val) => Value::Short(val),\\n\\n Dword(val) => Value::Dword(val),\\n\\n Int(val) => Value::Int(val),\\n\\n Dword64(val) => Value::Dword64(val),\\n\\n Int64(val) => Value::Int64(val),\\n\\n Float(val) => Value::Float(val),\\n\\n Double(val) => Value::Double(val),\\n\\n String(val) => Value::String(val),\\n\\n ResRef(val) => Value::ResRef(val),\\n\\n LocString(val) => Value::LocString(val),\\n\\n Void(val) => Value::Void(val),\\n\\n }\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/value.rs\",\n \"rank\": 46,\n \"score\": 30532.788314587626\n },\n {\n \"content\": \" String(String),\\n\\n /// Имя файла ресурса, до 16 символов.\\n\\n ///\\n\\n /// Тег, ассоциированный с типом, равен `11`.\\n\\n ResRef(ResRef),\\n\\n /// Локализуемая строка. Содержит `StringRef` и несколько `CExoString`, каждую со своим номером языка.\\n\\n ///\\n\\n /// Тег, ассоциированный с типом, равен `12`.\\n\\n LocString(LocString),\\n\\n /// Произвольные данные любой длины.\\n\\n ///\\n\\n /// Тег, ассоциированный с типом, равен `13`.\\n\\n Void(Vec<u8>),\\n\\n}\\n\\n\\n\\n/// Перечисление, представляющее все возможные типы данных, которых способен хранить GFF файл,\\n\\n/// в обобщенном виде. Аналог `serde_json::Value`\\n\\n#[derive(Debug, Clone, PartialEq)]\\n\\npub enum Value {\\n\\n /// Беззнаковое байтовое значение (от 0 до 255), занимающее один байт.\\n\",\n \"file_path\": \"src/value.rs\",\n \"rank\": 47,\n \"score\": 30532.700719398974\n },\n {\n \"content\": \" Dword64(U64Index),\\n\\n /// Знаковое целое (примерно от -9e+18 до +9e+18), занимающее 8 байт.\\n\\n ///\\n\\n /// Тег, ассоциированный с типом, равен `7`.\\n\\n Int64(I64Index),\\n\\n /// Число с плавающей запятой одинарной точности, занимающее 4 байта.\\n\\n ///\\n\\n /// Тег, ассоциированный с типом, равен `8`.\\n\\n Float(f32),\\n\\n /// Число с плавающей запятой двойной точности, занимающее 8 байт.\\n\\n ///\\n\\n /// Тег, ассоциированный с типом, равен `9`.\\n\\n Double(F64Index),\\n\\n /// Нелокализуемая строка.\\n\\n ///\\n\\n /// Предпочитаемый максимальный размер - 1024 символа. Это ограничение установлено в первую\\n\\n /// очередь для того, чтобы сохранить пропускную способность сети в том случае, если строку\\n\\n /// необходимо передавать с сервера на клиент.\\n\\n ///\\n\\n /// Данный вид строк не должен использоваться для текста, который может увидеть игрок, так как\\n\",\n \"file_path\": \"src/value.rs\",\n \"rank\": 48,\n \"score\": 30529.12186974538\n },\n {\n \"content\": \" ///\\n\\n /// Предпочитаемый максимальный размер - 1024 символа. Это ограничение установлено в первую\\n\\n /// очередь для того, чтобы сохранить пропускную способность сети в том случае, если строку\\n\\n /// необходимо передавать с сервера на клиент.\\n\\n ///\\n\\n /// Данный вид строк не должен использоваться для текста, который может увидеть игрок, так как\\n\\n /// он будет одинаковым независимо от языка клиента игры. Область применения данного типа -\\n\\n /// текст для разработчиков/дизайнеров уровней, например, тегов объектов, используемых в скриптах.\\n\\n ///\\n\\n /// Тег, ассоциированный с типом, равен `10`.\\n\\n String(String),\\n\\n /// Имя файла ресурса, до 16 символов.\\n\\n ///\\n\\n /// Тег, ассоциированный с типом, равен `11`.\\n\\n ResRef(ResRef),\\n\\n /// Локализуемая строка. Содержит `StringRef` и несколько `CExoString`, каждую со своим номером языка.\\n\\n ///\\n\\n /// Тег, ассоциированный с типом, равен `12`.\\n\\n LocString(LocString),\\n\\n /// Произвольные данные любой длины.\\n\",\n \"file_path\": \"src/value.rs\",\n \"rank\": 49,\n \"score\": 30526.940391457494\n },\n {\n \"content\": \" /// он будет одинаковым независимо от языка клиента игры. Область применения данного типа -\\n\\n /// текст для разработчиков/дизайнеров уровней, например, тегов объектов, используемых в скриптах.\\n\\n ///\\n\\n /// Тег, ассоциированный с типом, равен `10`.\\n\\n String(StringIndex),\\n\\n /// Имя файла ресурса, до 16 символов.\\n\\n ///\\n\\n /// Тег, ассоциированный с типом, равен `11`.\\n\\n ResRef(ResRefIndex),\\n\\n /// Локализуемая строка. Содержит `StringRef` и несколько `CExoString`, каждую со своим номером языка.\\n\\n ///\\n\\n /// Тег, ассоциированный с типом, равен `12`.\\n\\n LocString(LocStringIndex),\\n\\n /// Произвольные данные любой длины.\\n\\n ///\\n\\n /// Тег, ассоциированный с типом, равен `13`.\\n\\n Void(BinaryIndex),\\n\\n}\\n\\n\\n\\n/// Перечисление, представляющее все примитивные типы данных, который может хранить GFF файл.\\n\",\n \"file_path\": \"src/value.rs\",\n \"rank\": 50,\n \"score\": 30526.8134241638\n },\n {\n \"content\": \" Int64(i64),\\n\\n /// Число с плавающей запятой одинарной точности, занимающее 4 байта.\\n\\n ///\\n\\n /// Тег, ассоциированный с типом, равен `8`.\\n\\n Float(f32),\\n\\n /// Число с плавающей запятой двойной точности, занимающее 8 байт.\\n\\n ///\\n\\n /// Тег, ассоциированный с типом, равен `9`.\\n\\n Double(f64),\\n\\n /// Нелокализуемая строка.\\n\\n ///\\n\\n /// Предпочитаемый максимальный размер - 1024 символа. Это ограничение установлено в первую\\n\\n /// очередь для того, чтобы сохранить пропускную способность сети в том случае, если строку\\n\\n /// необходимо передавать с сервера на клиент.\\n\\n ///\\n\\n /// Данный вид строк не должен использоваться для текста, который может увидеть игрок, так как\\n\\n /// он будет одинаковым независимо от языка клиента игры. Область применения данного типа -\\n\\n /// текст для разработчиков/дизайнеров уровней, например, тегов объектов, используемых в скриптах.\\n\\n ///\\n\\n /// Тег, ассоциированный с типом, равен `10`.\\n\",\n \"file_path\": \"src/value.rs\",\n \"rank\": 51,\n \"score\": 30525.90206614384\n },\n {\n \"content\": \" /// Фиктивный элемент, для связывания типа ошибки `E`\\n\\n marker: PhantomData<E>,\\n\\n}\\n\\nimpl<'de, E> Deserializer<'de> for GffStringDeserializer<E>\\n\\n where E: Error,\\n\\n{\\n\\n type Error = E;\\n\\n\\n\\n fn deserialize_any<V>(self, visitor: V) -> Result<V::Value, Self::Error>\\n\\n where V: Visitor<'de>,\\n\\n {\\n\\n use self::GffString::*;\\n\\n\\n\\n match self.value {\\n\\n External(str_ref) => visitor.visit_u32(str_ref.0),\\n\\n Internal(strings) => visitor.visit_map(strings.into_deserializer()),\\n\\n }\\n\\n }\\n\\n\\n\\n forward_to_deserialize_any!(\\n\\n bool i8 i16 i32 i64 i128 u8 u16 u32 u64 u128 f32 f64 char str\\n\\n string bytes byte_buf option unit unit_struct newtype_struct seq\\n\\n tuple tuple_struct map struct enum identifier ignored_any\\n\\n );\\n\\n}\\n\",\n \"file_path\": \"src/de/string.rs\",\n \"rank\": 52,\n \"score\": 28922.169946553317\n },\n {\n \"content\": \"{\\n\\n type Error = E;\\n\\n\\n\\n fn deserialize_any<V>(self, visitor: V) -> Result<V::Value, Self::Error>\\n\\n where V: Visitor<'de>,\\n\\n {\\n\\n visitor.visit_u32(self.value.into())\\n\\n }\\n\\n\\n\\n forward_to_deserialize_any!(\\n\\n bool i8 i16 i32 i64 i128 u8 u16 u32 u64 u128 f32 f64 char str\\n\\n string bytes byte_buf option unit unit_struct newtype_struct seq\\n\\n tuple tuple_struct map struct enum identifier ignored_any\\n\\n );\\n\\n}\\n\\n\\n\\n///////////////////////////////////////////////////////////////////////////////////////////////////\\n\\n\\n\\nimpl<'de, E> IntoDeserializer<'de, E> for GffString\\n\\n where E: Error,\\n\",\n \"file_path\": \"src/de/string.rs\",\n \"rank\": 53,\n \"score\": 28921.305944119318\n },\n {\n \"content\": \"//! Содержит реализацию конвертирования типа GFF строки в десериализатор\\n\\n//! с помощью которого из него могут быть прочитаны другие совместимые типы.\\n\\n\\n\\nuse std::marker::PhantomData;\\n\\n\\n\\nuse serde::forward_to_deserialize_any;\\n\\nuse serde::de::{Deserializer, Error, IntoDeserializer, Visitor};\\n\\n\\n\\nuse crate::string::{GffString, StringKey};\\n\\n\\n\\nimpl<'de, E> IntoDeserializer<'de, E> for StringKey\\n\\n where E: Error,\\n\\n{\\n\\n type Deserializer = StringKeyDeserializer<E>;\\n\\n\\n\\n #[inline]\\n\\n fn into_deserializer(self) -> Self::Deserializer {\\n\\n StringKeyDeserializer { value: self, marker: PhantomData }\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/de/string.rs\",\n \"rank\": 54,\n \"score\": 28903.540760330176\n },\n {\n \"content\": \"{\\n\\n type Deserializer = GffStringDeserializer<E>;\\n\\n\\n\\n #[inline]\\n\\n fn into_deserializer(self) -> Self::Deserializer {\\n\\n GffStringDeserializer { value: self, marker: PhantomData }\\n\\n }\\n\\n}\\n\\n\\n\\n/// Десериализатор, использующий в качестве источника данных тип [`GffString`].\\n\\n///\\n\\n/// В зависимости от типа хранимой строки позволяет прочитать из значения либо `u32`,\\n\\n/// являющемся StrRef индексом, либо отображение из `u32` (содержащего комбинированное\\n\\n/// значение языка и пола строки) на `String` с текстом строки для данного языка и пола.\\n\\n///\\n\\n/// [`GffString`]: ../../enum.GffString.html\\n\\n#[derive(Debug)]\\n\\npub struct GffStringDeserializer<E> {\\n\\n /// Источник данных, из которого достаются данные для десериализации других структур\\n\\n value: GffString,\\n\",\n \"file_path\": \"src/de/string.rs\",\n \"rank\": 55,\n \"score\": 28897.100960122872\n },\n {\n \"content\": \"\\n\\n/// Десериализатор, использующий в качестве источника данных тип [`StringKey`].\\n\\n///\\n\\n/// Позволяет прочитать из ключа число, сформированное по формуле:\\n\\n/// ```rust,ignore\\n\\n/// ((language as u32) << 1) | gender as u32\\n\\n/// ```\\n\\n/// Именно в таком формате оно храниться в GFF файле.\\n\\n///\\n\\n/// [`StringKey`]: ../../enum.StringKey.html\\n\\n#[derive(Debug)]\\n\\npub struct StringKeyDeserializer<E> {\\n\\n /// Источник данных, из которого достаются данные для десериализации других структур\\n\\n value: StringKey,\\n\\n /// Фиктивный элемент, для связывания типа ошибки `E`\\n\\n marker: PhantomData<E>,\\n\\n}\\n\\n\\n\\nimpl<'de, E> Deserializer<'de> for StringKeyDeserializer<E>\\n\\n where E: Error,\\n\",\n \"file_path\": \"src/de/string.rs\",\n \"rank\": 56,\n \"score\": 28895.398146382126\n },\n {\n \"content\": \" {\\n\\n use self::Value::*;\\n\\n\\n\\n match *self {\\n\\n Byte(val) => serializer.serialize_u8(val),\\n\\n Char(val) => serializer.serialize_i8(val),\\n\\n Word(val) => serializer.serialize_u16(val),\\n\\n Short(val) => serializer.serialize_i16(val),\\n\\n Dword(val) => serializer.serialize_u32(val),\\n\\n Int(val) => serializer.serialize_i32(val),\\n\\n Dword64(val) => serializer.serialize_u64(val),\\n\\n Int64(val) => serializer.serialize_i64(val),\\n\\n Float(val) => serializer.serialize_f32(val),\\n\\n Double(val) => serializer.serialize_f64(val),\\n\\n String(ref val) => serializer.serialize_str(&val),\\n\\n ResRef(ref val) => serializer.serialize_bytes(&val.0),\\n\\n //TODO: реализовать сериализацию LocString\\n\\n LocString(ref _val) => unimplemented!(\\\"serialization of LocString not yet implemented\\\"),\\n\\n Void(ref val) => serializer.serialize_bytes(&val),\\n\\n Struct(ref val) => {\\n\",\n \"file_path\": \"src/ser/value.rs\",\n \"rank\": 69,\n \"score\": 28476.337407948547\n },\n {\n \"content\": \"//! Содержит реализацию типажа `Serialize` для сериализации типа `Value`\\n\\n\\n\\nuse serde::ser::{Serialize, SerializeMap, Serializer};\\n\\n\\n\\nuse crate::Label;\\n\\nuse crate::value::Value;\\n\\n\\n\\nimpl Serialize for Label {\\n\\n #[inline]\\n\\n fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>\\n\\n where S: Serializer,\\n\\n {\\n\\n serializer.serialize_bytes(self.as_ref())\\n\\n }\\n\\n}\\n\\n\\n\\nimpl Serialize for Value {\\n\\n #[inline]\\n\\n fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>\\n\\n where S: Serializer,\\n\",\n \"file_path\": \"src/ser/value.rs\",\n \"rank\": 73,\n \"score\": 28468.982693317765\n },\n {\n \"content\": \" let mut map = serializer.serialize_map(Some(val.len()))?;\\n\\n for (k, v) in val {\\n\\n map.serialize_key(k)?;\\n\\n map.serialize_value(v)?;\\n\\n }\\n\\n map.end()\\n\\n },\\n\\n List(ref val) => val.serialize(serializer),\\n\\n }\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/ser/value.rs\",\n \"rank\": 74,\n \"score\": 28459.222286063865\n },\n {\n \"content\": \"}\\n\\n\\n\\nfn main() {\\n\\n let data = Test {\\n\\n u16: 1, i16: 2,\\n\\n u32: 3, i32: 4,\\n\\n u64: 5, i64: 6,\\n\\n\\n\\n string: \\\"String\\\".into(),\\n\\n\\n\\n Struct: Struct { f32: PI, f64: E, bytes: b\\\"Vec<u8>\\\".to_vec() },\\n\\n list: vec![\\n\\n Item { u8: 7, i8: -8 },\\n\\n Item { u8: 9, i8: -10 },\\n\\n ],\\n\\n };\\n\\n\\n\\n let mut vec = to_vec((*b\\\"GFF \\\").into(), &data).expect(\\\"can't write data\\\");\\n\\n // Важный нюанс - не забыть, что создание десериализатора читает заголовок и возвращает\\n\\n // Result, а не сам десериализатор, поэтому требуется распаковка результата\\n\\n let mut de = Deserializer::new(Cursor::new(vec)).expect(\\\"can't read GFF header\\\");\\n\\n let val = Value::deserialize(&mut de).expect(\\\"can't deserialize data\\\");\\n\\n\\n\\n println!(\\\"{:#?}\\\", val);\\n\\n}\\n\",\n \"file_path\": \"readme.md\",\n \"rank\": 75,\n \"score\": 39.74302806539192\n },\n {\n \"content\": \"//! struct Item { u8: u8, i8: i8 }\\n\\n//!\\n\\n//! #[derive(Debug, Serialize, Deserialize)]\\n\\n//! struct Struct {\\n\\n//! f32: f32,\\n\\n//! f64: f64,\\n\\n//!\\n\\n//! #[serde(with = \\\"serde_bytes\\\")]\\n\\n//! bytes: Vec<u8>,\\n\\n//! }\\n\\n//!\\n\\n//! #[derive(Debug, Serialize, Deserialize)]\\n\\n//! #[allow(non_snake_case)]\\n\\n//! struct Test {\\n\\n//! u16: u16,\\n\\n//! i16: i16,\\n\\n//! u32: u32,\\n\\n//! i32: i32,\\n\\n//! u64: u64,\\n\\n//! i64: i64,\\n\",\n \"file_path\": \"src/lib.rs\",\n \"rank\": 76,\n \"score\": 39.28025437604654\n },\n {\n \"content\": \" }\\n\\n }\\n\\n );\\n\\n}\\n\\nimpl<'de, 'a, R: Read + Seek> de::Deserializer<'de> for &'a mut Deserializer<R> {\\n\\n type Error = Error;\\n\\n\\n\\n #[inline]\\n\\n fn is_human_readable(&self) -> bool { false }\\n\\n\\n\\n primitive!(deserialize_i8 , visit_i8 , Char);\\n\\n primitive!(deserialize_u8 , visit_u8 , Byte);\\n\\n primitive!(deserialize_i16, visit_i16, Short);\\n\\n primitive!(deserialize_u16, visit_u16, Word);\\n\\n primitive!(deserialize_i32, visit_i32, Int);\\n\\n primitive!(deserialize_u32, visit_u32, Dword);\\n\\n primitive!(deserialize_i64, visit_i64, Int64, read_i64);\\n\\n primitive!(deserialize_u64, visit_u64, Dword64, read_u64);\\n\\n primitive!(deserialize_f32, visit_f32, Float);\\n\\n primitive!(deserialize_f64, visit_f64, Double, read_f64);\\n\",\n \"file_path\": \"src/de/mod.rs\",\n \"rank\": 77,\n \"score\": 39.25136861130052\n },\n {\n \"content\": \" unsupported!(serialize_i16(i16));\\n\\n unsupported!(serialize_u16(u16));\\n\\n unsupported!(serialize_i32(i32));\\n\\n unsupported!(serialize_u32(u32));\\n\\n unsupported!(serialize_i64(i64));\\n\\n unsupported!(serialize_u64(u64));\\n\\n\\n\\n unsupported!(serialize_f32(f32));\\n\\n unsupported!(serialize_f64(f64));\\n\\n\\n\\n unsupported!(serialize_bool(bool));\\n\\n unsupported!(serialize_char(char));\\n\\n\\n\\n #[inline]\\n\\n fn serialize_str(self, value: &str) -> Result<Self::Ok> {\\n\\n // Добавляем запись о метке\\n\\n self.ser.ser.add_label(value)\\n\\n }\\n\\n unsupported!(serialize_bytes(&[u8]));\\n\\n\\n\",\n \"file_path\": \"src/ser/mod.rs\",\n \"rank\": 78,\n \"score\": 36.321910865387025\n },\n {\n \"content\": \"//!\\n\\n//! string: String,\\n\\n//!\\n\\n//! Struct: Struct,\\n\\n//! list: Vec<Item>,\\n\\n//! }\\n\\n//!\\n\\n//! fn main() {\\n\\n//! let data = Test {\\n\\n//! u16: 1, i16: 2,\\n\\n//! u32: 3, i32: 4,\\n\\n//! u64: 5, i64: 6,\\n\\n//!\\n\\n//! string: \\\"String\\\".into(),\\n\\n//!\\n\\n//! Struct: Struct { f32: PI, f64: E, bytes: b\\\"Vec<u8>\\\".to_vec() },\\n\\n//! list: vec![\\n\\n//! Item { u8: 7, i8: -8 },\\n\\n//! Item { u8: 9, i8: -10 },\\n\\n//! ],\\n\",\n \"file_path\": \"src/lib.rs\",\n \"rank\": 79,\n \"score\": 35.672519039071155\n },\n {\n \"content\": \"serde-gff\\n\\n=========\\n\\n[](https://crates.io/crates/serde_gff)\\n\\n[](https://docs.rs/serde-gff)\\n\\n[](https://github.com/Mingun/serde-gff/blob/master/LICENSE)\\n\\n\\n\\nGeneric File Format (GFF) -- формат файлов, используемый играми на движке Bioware Aurora:\\n\\nNewerwinter Nights, The Witcher и Newerwinter Nights 2.\\n\\n\\n\\nФормат имеет некоторые ограничения:\\n\\n- элементами верхнего уровня могут быть только структуры или перечисления Rust в unit или struct варианте\\n\\n- имена полей структур не должны быть длиннее 16 байт в UTF-8. При нарушении при сериализации будет ошибка\\n\\n- то же самое касается ключей карт. Кроме того, ключами могут быть только строки (`&str` или `String`)\\n\\n\\n\\nУстановка\\n\\n---------\\n\\nВыполните в корне проекта\\n\\n```sh\\n\\ncargo add serde_gff\\n\\n```\\n\\nили добавьте следующую строку в `Cargo.toml`:\\n\\n```toml\\n\\n[dependencies]\\n\\nserde_gff = \\\"0.2\\\"\\n\\n```\\n\\n\\n\\nПример\\n\\n------\\n\\n```rust\\n\\nuse std::f32::consts::PI;\\n\\nuse std::f64::consts::E;\\n\\nuse std::io::Cursor;\\n\\nuse serde::{Serialize, Deserialize};\\n\\n\\n\\nuse serde_gff::de::Deserializer;\\n\\nuse serde_gff::ser::to_vec;\\n\\nuse serde_gff::value::Value;\\n\\n\\n\\n#[derive(Debug, Serialize, Deserialize)]\\n\\nstruct Item { u8: u8, i8: i8 }\\n\\n\\n\\n#[derive(Debug, Serialize, Deserialize)]\\n\\nstruct Struct {\\n\\n f32: f32,\\n\\n f64: f64,\\n\\n\\n\\n #[serde(with = \\\"serde_bytes\\\")]\\n\\n bytes: Vec<u8>,\\n\\n}\\n\\n\\n\\n#[derive(Debug, Serialize, Deserialize)]\\n\\n#[allow(non_snake_case)]\\n\\nstruct Test {\\n\\n u16: u16,\\n\\n i16: i16,\\n\\n u32: u32,\\n\\n i32: i32,\\n\\n u64: u64,\\n\\n i64: i64,\\n\\n\\n\\n string: String,\\n\\n\\n\\n Struct: Struct,\\n\\n list: Vec<Item>,\\n\",\n \"file_path\": \"readme.md\",\n \"rank\": 80,\n \"score\": 34.09530801930947\n },\n {\n \"content\": \" delegate!(deserialize_u8);\\n\\n delegate!(deserialize_i16);\\n\\n delegate!(deserialize_u16);\\n\\n delegate!(deserialize_i32);\\n\\n delegate!(deserialize_u32);\\n\\n delegate!(deserialize_i64);\\n\\n delegate!(deserialize_u64);\\n\\n delegate!(deserialize_f32);\\n\\n delegate!(deserialize_f64);\\n\\n\\n\\n delegate!(deserialize_bool);\\n\\n delegate!(deserialize_char);\\n\\n delegate!(deserialize_str);\\n\\n delegate!(deserialize_string);\\n\\n delegate!(deserialize_bytes);\\n\\n delegate!(deserialize_byte_buf);\\n\\n delegate!(deserialize_option);\\n\\n delegate!(deserialize_unit);\\n\\n delegate!(deserialize_map);\\n\\n delegate!(deserialize_seq);\\n\",\n \"file_path\": \"src/de/mod.rs\",\n \"rank\": 81,\n \"score\": 33.046993488137666\n },\n {\n \"content\": \" type SerializeTupleVariant = Self::SerializeSeq;\\n\\n type SerializeMap = MapSerializer<'a>;\\n\\n type SerializeStruct = StructSerializer<'a>;\\n\\n type SerializeStructVariant = Self::SerializeStruct;\\n\\n\\n\\n primitive!(serialize_u8 , u8 , Byte);\\n\\n primitive!(serialize_i8 , i8 , Char);\\n\\n primitive!(serialize_u16, u16, Word);\\n\\n primitive!(serialize_i16, i16, Short);\\n\\n primitive!(serialize_u32, u32, Dword);\\n\\n primitive!(serialize_i32, i32, Int);\\n\\n complex! (serialize_u64, u64, Dword64, write_u64);\\n\\n complex! (serialize_i64, i64, Int64, write_i64);\\n\\n\\n\\n primitive!(serialize_f32, f32, Float);\\n\\n complex! (serialize_f64, f64, Double, write_f64);\\n\\n\\n\\n /// Формат не поддерживает сериализацию булевых значений, поэтому значение сериализуется,\\n\\n /// как `u8`: `true` представляется в виде `1`, а `false` -- в виде `0`.\\n\\n #[inline]\\n\",\n \"file_path\": \"src/ser/mod.rs\",\n \"rank\": 82,\n \"score\": 32.984519516947536\n },\n {\n \"content\": \" /// # Параметры\\n\\n /// - `tag`: Вид данных, которые требуется прочитать. Известные данные расположены в\\n\\n /// диапазоне `[0; 13]`, для остальных значений возвращается ошибка [`Error::UnknownValue`]\\n\\n ///\\n\\n /// # Возвращаемое значение\\n\\n /// Возвращает лениво читаемое значение. Если данные хранятся непосредственно за тегом, то\\n\\n /// они будут уже прочитаны, в противном случае читается только адрес их местонахождения в файле.\\n\\n /// Таким образом, если данные не нужны, лишних чтений не будет\\n\\n ///\\n\\n /// [`Error::UnknownValue`]: ../../error/enum.Error.html#variant.UnknownValue\\n\\n fn read_value_ref(&mut self, tag: u32) -> Result<SimpleValueRef> {\\n\\n use self::SimpleValueRef::*;\\n\\n\\n\\n let value = match tag {\\n\\n 0 => Byte (self.reader.read_u8()?),\\n\\n 1 => Char (self.reader.read_i8()?),\\n\\n 2 => Word (self.reader.read_u16::<LE>()?),\\n\\n 3 => Short(self.reader.read_i16::<LE>()?),\\n\\n 4 => Dword(self.reader.read_u32::<LE>()?),\\n\\n 5 => Int (self.reader.read_i32::<LE>()?),\\n\",\n \"file_path\": \"src/parser/mod.rs\",\n \"rank\": 83,\n \"score\": 30.68165213864182\n },\n {\n \"content\": \" return Err(Error::Unexpected(\\\"Byte, Char\\\", token));\\n\\n }\\n\\n\\n\\n #[inline]\\n\\n fn deserialize_str<V>(self, visitor: V) -> Result<V::Value>\\n\\n where V: Visitor<'de>,\\n\\n {\\n\\n self.deserialize_string(visitor)\\n\\n }\\n\\n fn deserialize_string<V>(self, visitor: V) -> Result<V::Value>\\n\\n where V: Visitor<'de>,\\n\\n {\\n\\n let token = self.next_token()?;\\n\\n match token {\\n\\n Token::Value(SimpleValueRef::String(value)) => {\\n\\n visitor.visit_string(self.parser.read_string(value)?)\\n\\n },\\n\\n Token::Value(SimpleValueRef::ResRef(value)) => {\\n\\n visitor.visit_string(self.parser.read_resref(value)?.as_string()?)\\n\\n },\\n\",\n \"file_path\": \"src/de/mod.rs\",\n \"rank\": 84,\n \"score\": 30.511566422187407\n },\n {\n \"content\": \"\\n\\n #[inline]\\n\\n fn serialize_field<T>(&mut self, key: &'static str, value: &T) -> Result<Self::Ok>\\n\\n where T: ?Sized + Serialize,\\n\\n {\\n\\n // Добавляем запись о метке\\n\\n let label = self.ser.add_label(key)?;\\n\\n self.serialize_value(label, value)\\n\\n }\\n\\n\\n\\n #[inline]\\n\\n fn end(self) -> Result<Self::Ok> { Ok(()) }\\n\\n}\\n\\nimpl<'a> SerializeStructVariant for StructSerializer<'a> {\\n\\n type Ok = ();\\n\\n type Error = Error;\\n\\n\\n\\n #[inline]\\n\\n fn serialize_field<T>(&mut self, key: &'static str, value: &T) -> Result<Self::Ok>\\n\\n where T: ?Sized + Serialize,\\n\",\n \"file_path\": \"src/ser/mod.rs\",\n \"rank\": 85,\n \"score\": 29.293138120035366\n },\n {\n \"content\": \" }\\n\\n\\n\\n newtype_test!(u8 = 42u8);\\n\\n newtype_test!(u16 = 42u16);\\n\\n newtype_test!(u32 = 42u32);\\n\\n newtype_test!(u64 = 42u64);\\n\\n\\n\\n newtype_test!(i8 = -42i8);\\n\\n newtype_test!(i16 = -42i16);\\n\\n newtype_test!(i32 = -42i32);\\n\\n newtype_test!(i64 = -42i64);\\n\\n\\n\\n newtype_test!(f32 = 42f32);\\n\\n newtype_test!(f64 = 42f64);\\n\\n\\n\\n newtype_test!(bool = true);\\n\\n newtype_test!(bool = false);\\n\\n\\n\\n newtype_test!(String = String::from(\\\"some string\\\"));\\n\\n newtype_test!(ByteBuf = ByteBuf::from(b\\\"some vector\\\".to_vec()));\\n\",\n \"file_path\": \"src/ser/mod.rs\",\n \"rank\": 86,\n \"score\": 29.289398726253392\n },\n {\n \"content\": \" fn serialize_bool(self, v: bool) -> Result<Self::Ok> {\\n\\n self.serialize_u8(if v { 1 } else { 0 })\\n\\n }\\n\\n /// Формат не поддерживает сериализацию произвольных символов как отдельную сущность, поэтому\\n\\n /// они сериализуются, как строка из одного символа\\n\\n #[inline]\\n\\n fn serialize_char(self, v: char) -> Result<Self::Ok> {\\n\\n let mut data = [0u8; 4];\\n\\n self.serialize_str(v.encode_utf8(&mut data))\\n\\n }\\n\\n\\n\\n complex!(serialize_str , &str , String);\\n\\n complex!(serialize_bytes, &[u8], Void);\\n\\n\\n\\n #[inline]\\n\\n fn serialize_none(self) -> Result<Self::Ok> {\\n\\n self.serialize_unit()\\n\\n }\\n\\n #[inline]\\n\\n fn serialize_some<T>(self, value: &T) -> Result<Self::Ok>\\n\",\n \"file_path\": \"src/ser/mod.rs\",\n \"rank\": 87,\n \"score\": 29.27307416122513\n },\n {\n \"content\": \" unsupported!(serialize_i32(i32));\\n\\n unsupported!(serialize_u32(u32));\\n\\n unsupported!(serialize_i64(i64));\\n\\n unsupported!(serialize_u64(u64));\\n\\n\\n\\n unsupported!(serialize_f32(f32));\\n\\n unsupported!(serialize_f64(f64));\\n\\n\\n\\n unsupported!(serialize_bool(bool));\\n\\n unsupported!(serialize_char(char));\\n\\n\\n\\n unsupported!(serialize_str(&str));\\n\\n unsupported!(serialize_bytes(&[u8]));\\n\\n\\n\\n #[inline]\\n\\n fn serialize_none(self) -> Result<Self::Ok> {\\n\\n self.serialize_unit()\\n\\n }\\n\\n fn serialize_some<T>(self, value: &T) -> Result<Self::Ok>\\n\\n where T: ?Sized + Serialize,\\n\",\n \"file_path\": \"src/ser/mod.rs\",\n \"rank\": 88,\n \"score\": 28.207364269203115\n },\n {\n \"content\": \" let token = self.next_token()?;\\n\\n unimplemented!(\\\"`deserialize_tuple_struct(name: {}, len: {})` not yet supported. Token: {:?}\\\", name, len, token)\\n\\n }\\n\\n fn deserialize_struct<V>(self, _name: &'static str, _fields: &'static [&'static str], visitor: V) -> Result<V::Value>\\n\\n where V: Visitor<'de>,\\n\\n {\\n\\n self.deserialize_map(visitor)\\n\\n }\\n\\n fn deserialize_enum<V>(self, name: &'static str, variants: &'static [&'static str], _visitor: V) -> Result<V::Value>\\n\\n where V: Visitor<'de>,\\n\\n {\\n\\n let token = self.next_token()?;\\n\\n unimplemented!(\\\"`deserialize_enum(name: {}, variants: {})` not yet supported. Token: {:?}\\\", name, variants.len(), token)\\n\\n }\\n\\n}\\n\\n\\n\\nimpl<'de, 'a, R: Read + Seek> de::MapAccess<'de> for &'a mut Deserializer<R> {\\n\\n type Error = Error;\\n\\n\\n\\n fn next_key_seed<K>(&mut self, seed: K) -> Result<Option<K::Value>>\\n\",\n \"file_path\": \"src/de/mod.rs\",\n \"rank\": 89,\n \"score\": 28.157945108383448\n },\n {\n \"content\": \" fn into_raw(&self, label: u32) -> Result<raw::Field> {\\n\\n use self::SimpleValueRef::*;\\n\\n\\n\\n let mut data = [0u8; 4];\\n\\n let type_ = {\\n\\n let mut storage = &mut data[..];\\n\\n match *self {\\n\\n Byte(val) => { storage.write_u8 (val )?; FieldType::Byte },\\n\\n Char(val) => { storage.write_i8 (val )?; FieldType::Char },\\n\\n Word(val) => { storage.write_u16::<LE>(val )?; FieldType::Word },\\n\\n Short(val) => { storage.write_i16::<LE>(val )?; FieldType::Short },\\n\\n Dword(val) => { storage.write_u32::<LE>(val )?; FieldType::Dword },\\n\\n Int(val) => { storage.write_i32::<LE>(val )?; FieldType::Int },\\n\\n Dword64(val) => { storage.write_u32::<LE>(val.0)?; FieldType::Dword64 },\\n\\n Int64(val) => { storage.write_u32::<LE>(val.0)?; FieldType::Int64 },\\n\\n Float(val) => { storage.write_f32::<LE>(val )?; FieldType::Float },\\n\\n Double(val) => { storage.write_u32::<LE>(val.0)?; FieldType::Double },\\n\\n String(val) => { storage.write_u32::<LE>(val.0)?; FieldType::String },\\n\\n ResRef(val) => { storage.write_u32::<LE>(val.0)?; FieldType::ResRef },\\n\\n LocString(val) => { storage.write_u32::<LE>(val.0)?; FieldType::LocString },\\n\",\n \"file_path\": \"src/ser/mod.rs\",\n \"rank\": 90,\n \"score\": 26.831443170936854\n },\n {\n \"content\": \"\\n\\n delegate!(deserialize_any);\\n\\n delegate!(deserialize_ignored_any);\\n\\n\\n\\n delegate!(deserialize_unit_struct, name);\\n\\n delegate!(deserialize_newtype_struct, name);\\n\\n delegate!(deserialize_struct, names);\\n\\n delegate!(deserialize_enum, names);\\n\\n\\n\\n #[inline]\\n\\n fn deserialize_tuple<V>(self, len: usize, visitor: V) -> Result<V::Value>\\n\\n where V: Visitor<'de>,\\n\\n {\\n\\n self.0.deserialize_tuple(len, visitor)\\n\\n }\\n\\n #[inline]\\n\\n fn deserialize_tuple_struct<V>(self, name: &'static str, len: usize, visitor: V) -> Result<V::Value>\\n\\n where V: Visitor<'de>,\\n\\n {\\n\\n self.0.deserialize_tuple_struct(name, len, visitor)\\n\",\n \"file_path\": \"src/de/mod.rs\",\n \"rank\": 91,\n \"score\": 26.41915103701061\n },\n {\n \"content\": \" _ => Err(Error::Unexpected(\\\"String, ResRef\\\", token)),\\n\\n }\\n\\n }\\n\\n #[inline]\\n\\n fn deserialize_bytes<V>(self, visitor: V) -> Result<V::Value>\\n\\n where V: Visitor<'de>,\\n\\n {\\n\\n self.deserialize_byte_buf(visitor)\\n\\n }\\n\\n fn deserialize_byte_buf<V>(self, visitor: V) -> Result<V::Value>\\n\\n where V: Visitor<'de>,\\n\\n {\\n\\n let token = self.next_token()?;\\n\\n match token {\\n\\n Token::Value(SimpleValueRef::Void(value)) => {\\n\\n visitor.visit_byte_buf(self.parser.read_byte_buf(value)?)\\n\\n },\\n\\n Token::Value(SimpleValueRef::ResRef(value)) => {\\n\\n visitor.visit_byte_buf(self.parser.read_resref(value)?.0)\\n\\n },\\n\",\n \"file_path\": \"src/de/mod.rs\",\n \"rank\": 92,\n \"score\": 26.04842989291718\n },\n {\n \"content\": \" where K: DeserializeSeed<'de>,\\n\\n {\\n\\n let token = self.peek_token()?.clone();\\n\\n match token {\\n\\n Token::RootEnd | Token::ItemEnd | Token::StructEnd => Ok(None),\\n\\n Token::Label(..) => seed.deserialize(Field(&mut **self)).map(Some),\\n\\n token => Err(Error::Unexpected(\\\"Label\\\", token)),\\n\\n }\\n\\n }\\n\\n\\n\\n #[inline]\\n\\n fn next_value_seed<V>(&mut self, seed: V) -> Result<V::Value>\\n\\n where V: DeserializeSeed<'de>,\\n\\n {\\n\\n seed.deserialize(&mut **self)\\n\\n }\\n\\n}\\n\\n\\n\\nimpl<'de, 'a, R: Read + Seek> de::SeqAccess<'de> for &'a mut Deserializer<R> {\\n\\n type Error = Error;\\n\",\n \"file_path\": \"src/de/mod.rs\",\n \"rank\": 93,\n \"score\": 25.637917980794793\n },\n {\n \"content\": \"//! Содержит реализацию структуры, описывающей ссылку на ресурс и реализацию типажей для\\n\\n//! конвертации других типов данных в ссылку и обратно\\n\\n\\n\\nuse std::fmt;\\n\\nuse std::str::{self, FromStr, Utf8Error};\\n\\nuse std::string::FromUtf8Error;\\n\\n\\n\\n/// Представляет ссылку на игровой ресурс, которым может быть шаблон объекта\\n\\n#[derive(Clone, PartialEq, Eq, Hash)]\\n\\npub struct ResRef(pub(crate) Vec<u8>);\\n\\n\\n\\nimpl ResRef {\\n\\n /// Возвращает представление данной ссылки на ресурс как строки, если она представлена в виде `UTF-8` строки\\n\\n #[inline]\\n\\n pub fn as_str(&self) -> Result<&str, Utf8Error> {\\n\\n str::from_utf8(&self.0)\\n\\n }\\n\\n /// Возвращает представление данной ссылки на ресурс как строки, если она представлена в виде `UTF-8` строки\\n\\n #[inline]\\n\\n pub fn as_string(self) -> Result<String, FromUtf8Error> {\\n\",\n \"file_path\": \"src/resref.rs\",\n \"rank\": 94,\n \"score\": 25.07538584320534\n },\n {\n \"content\": \" }\\n\\n );\\n\\n}\\n\\n\\n\\nimpl<'a> ser::Serializer for &'a mut Serializer {\\n\\n type Ok = ();\\n\\n type Error = Error;\\n\\n\\n\\n type SerializeSeq = ListSerializer<'a>;\\n\\n type SerializeTuple = Impossible<Self::Ok, Self::Error>;\\n\\n type SerializeTupleStruct = Impossible<Self::Ok, Self::Error>;\\n\\n type SerializeTupleVariant = Self::SerializeSeq;\\n\\n type SerializeMap = MapSerializer<'a>;\\n\\n type SerializeStruct = StructSerializer<'a>;\\n\\n type SerializeStructVariant = Self::SerializeStruct;\\n\\n\\n\\n unsupported!(serialize_i8(i8));\\n\\n unsupported!(serialize_u8(u8));\\n\\n unsupported!(serialize_i16(i16));\\n\\n unsupported!(serialize_u16(u16));\\n\",\n \"file_path\": \"src/ser/mod.rs\",\n \"rank\": 95,\n \"score\": 25.018520171408536\n },\n {\n \"content\": \"\\n\\n fn deserialize_bool<V>(self, visitor: V) -> Result<V::Value>\\n\\n where V: Visitor<'de>,\\n\\n {\\n\\n let token = self.next_token()?;\\n\\n if let Token::Value(SimpleValueRef::Byte(value)) = token {\\n\\n return visitor.visit_bool(value != 0);\\n\\n }\\n\\n return Err(Error::Unexpected(\\\"Byte\\\", token));\\n\\n }\\n\\n fn deserialize_char<V>(self, visitor: V) -> Result<V::Value>\\n\\n where V: Visitor<'de>,\\n\\n {\\n\\n let token = self.next_token()?;\\n\\n if let Token::Value(SimpleValueRef::Byte(value)) = token {\\n\\n return visitor.visit_char(value as char);\\n\\n }\\n\\n if let Token::Value(SimpleValueRef::Char(value)) = token {\\n\\n return visitor.visit_char(value as u8 as char);\\n\\n }\\n\",\n \"file_path\": \"src/de/mod.rs\",\n \"rank\": 96,\n \"score\": 24.95690371453668\n },\n {\n \"content\": \" String::from_utf8(self.0)\\n\\n }\\n\\n}\\n\\n\\n\\nimpl fmt::Debug for ResRef {\\n\\n fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {\\n\\n if let Ok(value) = str::from_utf8(&self.0) {\\n\\n return write!(f, \\\"{}\\\", value);\\n\\n }\\n\\n self.0.fmt(f)\\n\\n }\\n\\n}\\n\\n\\n\\nimpl fmt::Display for ResRef {\\n\\n #[inline]\\n\\n fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {\\n\\n let value = self.as_str().map_err(|_| fmt::Error)?;\\n\\n write!(f, \\\"{}\\\", value)\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/resref.rs\",\n \"rank\": 97,\n \"score\": 24.280137291571616\n },\n {\n \"content\": \" let token = self.next_token()?;\\n\\n match token {\\n\\n //TODO: После решения https://github.com/serde-rs/serde/issues/745 можно будет передавать числа\\n\\n Token::Value(Byte(val)) => visitor.visit_string(val.to_string()),\\n\\n Token::Value(Char(val)) => visitor.visit_string(val.to_string()),\\n\\n Token::Value(Word(val)) => visitor.visit_string(val.to_string()),\\n\\n Token::Value(Short(val)) => visitor.visit_string(val.to_string()),\\n\\n Token::Value(Dword(val)) => visitor.visit_string(val.to_string()),\\n\\n Token::Value(Int(val)) => visitor.visit_string(val.to_string()),\\n\\n Token::Value(Dword64(val)) => visitor.visit_string(self.parser.read_u64(val)?.to_string()),\\n\\n Token::Value(Int64(val)) => visitor.visit_string(self.parser.read_i64(val)?.to_string()),\\n\\n Token::Value(String(val)) => visitor.visit_string(self.parser.read_string(val)?),\\n\\n _ => Err(Error::Unexpected(\\\"Byte, Char, Word, Short, Dword, Int, Int64, String\\\", token)),\\n\\n }\\n\\n }\\n\\n\\n\\n fn deserialize_map<V>(self, visitor: V) -> Result<V::Value>\\n\\n where V: Visitor<'de>,\\n\\n {\\n\\n let token = self.next_token()?;\\n\",\n \"file_path\": \"src/de/mod.rs\",\n \"rank\": 98,\n \"score\": 23.95045613106896\n },\n {\n \"content\": \" Token::Label(index) => {\\n\\n let label = self.parser.read_label(index)?;\\n\\n visitor.visit_str(label.as_str()?)\\n\\n },\\n\\n _ => unimplemented!(\\\"`deserialize_any`, token: {:?}\\\", token)\\n\\n }\\n\\n }\\n\\n fn deserialize_ignored_any<V>(self, visitor: V) -> Result<V::Value>\\n\\n where V: Visitor<'de>,\\n\\n {\\n\\n let token = self.next_token()?;\\n\\n self.parser.skip_next(token);\\n\\n visitor.visit_none()\\n\\n }\\n\\n /// Данный метод вызывается при необходимости десериализовать идентификатор перечисления\\n\\n fn deserialize_identifier<V>(self, visitor: V) -> Result<V::Value>\\n\\n where V: Visitor<'de>,\\n\\n {\\n\\n use self::SimpleValueRef::*;\\n\\n\\n\",\n \"file_path\": \"src/de/mod.rs\",\n \"rank\": 99,\n \"score\": 23.831870013881463\n }\n]","isConversational":false}}},{"rowIdx":2349,"cells":{"lang":{"kind":"string","value":"Rust"},"file_path":{"kind":"string","value":"src/intrinsics_orthographic.rs"},"repo_name":{"kind":"string","value":"strawlab/cam-geom"},"commit":{"kind":"string","value":"0d160e2510d4f0df7af1123d51cf1518c7a58070"},"file_code":{"kind":"string","value":"use nalgebra::{\n allocator::Allocator,\n base::storage::{Owned, Storage},\n convert, DefaultAllocator, Dim, OMatrix, RealField, U2, U3,\n};\n\n#[cfg(feature = \"serde-serialize\")]\nuse serde::{Deserialize, Serialize};\n\nuse crate::{\n coordinate_system::CameraFrame, Bundle, IntrinsicParameters, Pixels, Points, RayBundle,\n};\n\nuse crate::ray_bundle_types::SharedDirectionRayBundle;\n\n#[derive(Debug, Clone, PartialEq)]\n#[cfg_attr(feature = \"serde-serialize\", derive(Serialize, Deserialize))]\npub struct OrthographicParams<R: RealField> {\n \n pub sx: R,\n \n pub sy: R,\n \n pub cx: R,\n \n pub cy: R,\n}\n\nimpl<R: RealField> From<OrthographicParams<R>> for IntrinsicParametersOrthographic<R> {\n #[inline]\n fn from(params: OrthographicParams<R>) -> Self {\n Self { params }\n }\n}\n\n#[derive(Debug, Clone, PartialEq)]\n#[cfg_attr(feature = \"serde-serialize\", derive(Serialize, Deserialize))]\npub struct IntrinsicParametersOrthographic<R: RealField> {\n params: OrthographicParams<R>,\n}\n\nimpl<R> IntrinsicParameters<R> for IntrinsicParametersOrthographic<R>\nwhere\n R: RealField,\n{\n type BundleType = SharedDirectionRayBundle<R>;\n\n fn pixel_to_camera<IN, NPTS>(\n &self,\n pixels: &Pixels<R, NPTS, IN>,\n ) -> RayBundle<CameraFrame, Self::BundleType, R, NPTS, Owned<R, NPTS, U3>>\n where\n Self::BundleType: Bundle<R>,\n IN: Storage<R, NPTS, U2>,\n NPTS: Dim,\n DefaultAllocator: Allocator<R, NPTS, U3>,\n {\n let zero: R = convert(0.0);\n\n \n let mut result = RayBundle::new_shared_plusz_direction(OMatrix::zeros_generic(\n NPTS::from_usize(pixels.data.nrows()),\n U3::from_usize(3),\n ));\n\n let origin = &mut result.data;\n\n \n \n \n\n for i in 0..pixels.data.nrows() {\n let u = pixels.data[(i, 0)].clone();\n let v = pixels.data[(i, 1)].clone();\n\n let x: R = (u - self.params.cx.clone()) / self.params.sx.clone();\n let y: R = (v - self.params.cy.clone()) / self.params.sy.clone();\n\n origin[(i, 0)] = x;\n origin[(i, 1)] = y;\n origin[(i, 2)] = zero.clone();\n }\n result\n }\n\n fn camera_to_pixel<IN, NPTS>(\n &self,\n camera: &Points<CameraFrame, R, NPTS, IN>,\n ) -> Pixels<R, NPTS, Owned<R, NPTS, U2>>\n where\n IN: Storage<R, NPTS, U3>,\n NPTS: Dim,\n DefaultAllocator: Allocator<R, NPTS, U2>,\n {\n let mut result = Pixels::new(OMatrix::zeros_generic(\n NPTS::from_usize(camera.data.nrows()),\n U2::from_usize(2),\n ));\n\n \n \n \n\n for i in 0..camera.data.nrows() {\n result.data[(i, 0)] =\n camera.data[(i, 0)].clone() * self.params.sx.clone() + self.params.cx.clone();\n result.data[(i, 1)] =\n camera.data[(i, 1)].clone() * self.params.sy.clone() + self.params.cy.clone();\n }\n result\n }\n}\n\n#[cfg(test)]\nmod tests {\n use nalgebra::Vector3;\n\n use super::{IntrinsicParametersOrthographic, OrthographicParams};\n use crate::camera::{roundtrip_camera, Camera};\n use crate::extrinsics::ExtrinsicParameters;\n use crate::intrinsic_test_utils::roundtrip_intrinsics;\n\n #[test]\n fn roundtrip() {\n let params = OrthographicParams {\n sx: 100.0,\n sy: 102.0,\n cx: 321.0,\n cy: 239.9,\n };\n let cam: IntrinsicParametersOrthographic<_> = params.into();\n\n roundtrip_intrinsics(&cam, 640, 480, 5, 0, nalgebra::convert(1e-10));\n\n let extrinsics = ExtrinsicParameters::from_view(\n &Vector3::new(1.2, 3.4, 5.6), \n &Vector3::new(2.2, 3.4, 5.6), \n &nalgebra::Unit::new_normalize(Vector3::new(0.0, 0.0, 1.0)), \n );\n\n let full_cam = Camera::new(cam, extrinsics);\n roundtrip_camera(full_cam, 640, 480, 5, 0, nalgebra::convert(1e-10));\n }\n\n #[test]\n #[cfg(feature = \"serde-serialize\")]\n fn test_serde() {\n let params = OrthographicParams {\n sx: 100.0,\n sy: 102.0,\n cx: 321.0,\n cy: 239.9,\n };\n let expected: IntrinsicParametersOrthographic<_> = params.into();\n\n let buf = serde_json::to_string(&expected).unwrap();\n let actual: IntrinsicParametersOrthographic<f64> = serde_json::from_str(&buf).unwrap();\n assert!(expected == actual);\n }\n}\n"},"prefix":{"kind":"string","value":"use nalgebra::{\n allocator::Allocator,\n base::storage::{Owned, Storage},\n convert, DefaultAllocator, Dim, OMatrix, RealField, U2, U3,\n};\n\n#[cfg(feature = \"serde-serialize\")]\nuse serde::{Deserialize, Serialize};\n\nuse crate::{\n coordinate_system::CameraFrame, Bundle, IntrinsicParameters, Pixels, Points, RayBundle,\n};\n\nuse crate::ray_bundle_types::SharedDirectionRayBundle;\n\n#[derive(Debug, Clone, PartialEq)]\n#[cfg_attr(feature = \"serde-serialize\", derive(Serialize, Deserialize))]\npub struct OrthographicParams<R: RealField> {\n \n pub sx: R,\n \n pub sy: R,\n \n pub cx: R,\n \n pub cy: R,\n}\n\nimpl<R: RealField> From<OrthographicParams<R>> for IntrinsicParametersOrthographic<R> {\n #[inline]\n fn from(params: OrthographicParams<R>) -> Self {\n Self { params }\n }\n}\n\n#[derive(Debug, Clone, PartialEq)]\n#[cfg_attr(feature = \"serde-serialize\", derive(Serialize, Deserialize))]\npub struct IntrinsicParametersOrthographic<R: RealField> {\n params: OrthographicParams<R>,\n}\n\nimpl<R> IntrinsicParameters<R> for IntrinsicParametersOrthographic<R>\nwhere\n R: RealField,\n{\n type BundleType = SharedDirectionRayBundle<R>;\n\n fn pixel_to_camera<IN, NPTS>(\n &self,\n pixels: &Pixels<R, NPTS, IN>,\n ) -> RayBundle<CameraFrame, Self::BundleType, R, NPTS, Owned<R, NPTS, U3>>\n where\n Self::BundleType: Bundle<R>,\n IN: Storage<R, NPTS, U2>,\n NPTS: Dim,\n DefaultAllocator: Allocator<R, NPTS, U3>,\n {\n let zero: R = convert(0.0);\n\n \n let mut result = RayBundle::new_shared_plusz_direction(OMatrix::zeros_generic(\n NPTS::from_usize(pixels.data.nrows()),\n U3::from_usize(3),\n ));\n\n let origin = &mut result.data;\n\n \n \n \n\n for i in 0..pixels.data.nrows() {\n let u = pixels.data[(i, 0)].clone();\n let v = pixels.data[(i, 1)].clone();\n\n let x: R = (u - self.params.cx.clone()) / self.params.sx.clone();\n let y: R = (v - self.params.cy.clone()) / self.params.sy.clone();\n\n origin[(i, 0)] = x;\n origin[(i, 1)] = y;\n origin[(i, 2)] = zero.clone();\n }\n result\n }\n\n fn camera_to_pixel<IN, NPTS>(\n &self,\n camera: &Points<CameraFrame, R, NPTS, IN>,\n ) -> Pixels<R, NPTS, Owned<R, NPTS, U2>>\n where\n IN: Storage<R, NPTS, U3>,\n NPTS: Dim,\n DefaultAllocator: Allocator<R, NPTS, U2>,\n {\n let mut result = Pixels::new(OMatrix::zeros_generic(\n NPTS::from_usize(camera.data.nrows()),\n U2::from_usize(2),\n ));\n\n \n \n \n\n for i in 0..camera.data.nrows() {\n result.data[(i, 0)] =\n camera.data[(i, 0)].clone() * self.params.sx.clone() + self.params.cx.clone();\n result.data[(i, 1)] =\n camera.data[(i, 1)].clone() * self.params.sy.clone() + self.params.cy.clone();\n }\n result\n }\n}\n\n#[cfg(test)]\nmod tests {\n use nalgebra::Vector3;\n\n use super::{IntrinsicParametersOrthographic, OrthographicParams};\n use crate::camera::{roundtrip_camera, Camera};\n use crate::extrinsics::ExtrinsicParameters;\n use crate::intrinsic_test_utils::roundtrip_intrinsics;\n\n #[test]\n "},"suffix":{"kind":"string","value":"\n\n #[test]\n #[cfg(feature = \"serde-serialize\")]\n fn test_serde() {\n let params = OrthographicParams {\n sx: 100.0,\n sy: 102.0,\n cx: 321.0,\n cy: 239.9,\n };\n let expected: IntrinsicParametersOrthographic<_> = params.into();\n\n let buf = serde_json::to_string(&expected).unwrap();\n let actual: IntrinsicParametersOrthographic<f64> = serde_json::from_str(&buf).unwrap();\n assert!(expected == actual);\n }\n}\n"},"middle":{"kind":"string","value":"fn roundtrip() {\n let params = OrthographicParams {\n sx: 100.0,\n sy: 102.0,\n cx: 321.0,\n cy: 239.9,\n };\n let cam: IntrinsicParametersOrthographic<_> = params.into();\n\n roundtrip_intrinsics(&cam, 640, 480, 5, 0, nalgebra::convert(1e-10));\n\n let extrinsics = ExtrinsicParameters::from_view(\n &Vector3::new(1.2, 3.4, 5.6), \n &Vector3::new(2.2, 3.4, 5.6), \n &nalgebra::Unit::new_normalize(Vector3::new(0.0, 0.0, 1.0)), \n );\n\n let full_cam = Camera::new(cam, extrinsics);\n roundtrip_camera(full_cam, 640, 480, 5, 0, nalgebra::convert(1e-10));\n }"},"strategy":{"kind":"string","value":"function_block-full_function"},"context_items":{"kind":"list like","value":[{"content":"#[cfg(test)]\n\npub fn roundtrip_camera<R, I>(\n\n cam: Camera<R, I>,\n\n width: usize,\n\n height: usize,\n\n step: usize,\n\n border: usize,\n\n eps: R,\n\n) where\n\n R: RealField,\n\n I: IntrinsicParameters<R>,\n\n I::BundleType: Bundle<R>,\n\n{\n\n let pixels = crate::intrinsic_test_utils::generate_uv_raw(width, height, step, border);\n\n\n\n let world_coords = cam.pixel_to_world(&pixels);\n\n let world_coords_points = world_coords.point_on_ray();\n\n\n\n // project back to pixel coordinates\n\n let pixel_actual = cam.world_to_pixel(&world_coords_points);\n\n approx::assert_abs_diff_eq!(pixels.data, pixel_actual.data, epsilon = convert(eps));\n\n}\n\n\n","file_path":"src/camera.rs","rank":0,"score":136172.98602122226},{"content":"// Calculate angle of quaternion\n\n///\n\n/// This is the implementation from prior to\n\n/// https://github.com/rustsim/nalgebra/commit/74aefd9c23dadd12ee654c7d0206b0a96d22040c\n\nfn my_quat_angle<R: RealField>(quat: &nalgebra::UnitQuaternion<R>) -> R {\n\n let w = quat.quaternion().scalar().abs();\n\n\n\n // Handle inaccuracies that make break `.acos`.\n\n if w >= R::one() {\n\n R::zero()\n\n } else {\n\n w.acos() * convert(2.0f64)\n\n }\n\n}\n\n\n\n#[cfg(test)]\n\nmod tests {\n\n #[test]\n\n #[cfg(feature = \"serde-serialize\")]\n\n fn test_serde() {\n\n use nalgebra::{Unit, Vector3};\n\n\n\n use super::PerspectiveParams;\n\n use crate::{Camera, ExtrinsicParameters, IntrinsicParametersPerspective};\n","file_path":"src/camera.rs","rank":1,"score":122426.87178791224},{"content":"/// Test roundtrip projection from pixels to camera rays for an intrinsic camera model.\n\n///\n\n/// Generate pixel coordinates, project them to rays, convert to points on the\n\n/// rays, convert the points back to pixels, and then compare with the original\n\n/// pixel coordinates.\n\npub fn roundtrip_intrinsics<R, CAM>(\n\n cam: &CAM,\n\n width: usize,\n\n height: usize,\n\n step: usize,\n\n border: usize,\n\n eps: R,\n\n) where\n\n R: RealField,\n\n CAM: IntrinsicParameters<R>,\n\n CAM::BundleType: Bundle<R>,\n\n{\n\n let pixels = generate_uv_raw(width, height, step, border);\n\n\n\n let camcoords = cam.pixel_to_camera(&pixels);\n\n let camera_coords_points = camcoords.point_on_ray();\n\n\n\n // project back to pixel coordinates\n\n let pixel_actual = cam.camera_to_pixel(&camera_coords_points);\n\n approx::assert_abs_diff_eq!(pixels.data, pixel_actual.data, epsilon = convert(eps));\n\n}\n","file_path":"src/intrinsic_test_utils.rs","rank":2,"score":115458.93551733317},{"content":"#[allow(clippy::many_single_char_names)]\n\nfn pmat2cam_center<R, S>(p: &Matrix<R, U3, U4, S>) -> Point3<R>\n\nwhere\n\n R: RealField,\n\n S: Storage<R, U3, U4> + Clone,\n\n{\n\n let x = p.clone().remove_column(0).determinant();\n\n let y = -p.clone().remove_column(1).determinant();\n\n let z = p.clone().remove_column(2).determinant();\n\n let w = -p.clone().remove_column(3).determinant();\n\n Point3::from(Vector3::new(x / w.clone(), y / w.clone(), z / w))\n\n}\n\n\n","file_path":"src/camera.rs","rank":3,"score":108975.94157834267},{"content":"/// perform RQ decomposition and return results as right-handed quaternion and intrinsics matrix\n\nfn rq_decomposition<R: RealField>(\n\n orig: Matrix3<R>,\n\n) -> Result<(UnitQuaternion<R>, Matrix3<R>), Error> {\n\n let (mut intrin, mut q) = rq(orig);\n\n let zero: R = convert(0.0);\n\n for i in 0..3 {\n\n if intrin[(i, i)] < zero {\n\n for j in 0..3 {\n\n intrin[(j, i)] = -intrin[(j, i)].clone();\n\n q[(i, j)] = -q[(i, j)].clone();\n\n }\n\n }\n\n }\n\n\n\n match right_handed_rotation_quat_new(&q) {\n\n Ok(rquat) => Ok((rquat, intrin)),\n\n Err(error) => {\n\n match error {\n\n Error::InvalidRotationMatrix => {\n\n // convert left-handed rotation to right-handed rotation\n","file_path":"src/camera.rs","rank":4,"score":105463.62763693056},{"content":"#[allow(non_snake_case)]\n\nfn rq<R: RealField>(A: Matrix3<R>) -> (Matrix3<R>, Matrix3<R>) {\n\n let zero: R = convert(0.0);\n\n let one: R = convert(1.0);\n\n\n\n // see https://math.stackexchange.com/a/1640762\n\n #[rustfmt::skip]\n\n let P = Matrix3::<R>::new(\n\n zero.clone(), zero.clone(), one.clone(), // row 1\n\n zero.clone(), one.clone(), zero.clone(), // row 2\n\n one, zero.clone(), zero, // row 3\n\n );\n\n let Atilde = P.clone() * A;\n\n\n\n let (Qtilde, Rtilde) = {\n\n let qrm = nalgebra::linalg::QR::new(Atilde.transpose());\n\n (qrm.q(), qrm.r())\n\n };\n\n let Q = P.clone() * Qtilde.transpose();\n\n let R = P.clone() * Rtilde.transpose() * P;\n\n (R, Q)\n\n}\n\n\n","file_path":"src/camera.rs","rank":5,"score":101123.39700944631},{"content":"/// Specifies operations which any RayBundle must implement.\n\npub trait Bundle<R>\n\nwhere\n\n R: RealField,\n\n{\n\n /// Return a single ray from a `RayBundle` with exactly one ray.\n\n fn to_single_ray<Coords>(&self, self_data: &SMatrix<R, 1, 3>) -> Ray<Coords, R>\n\n where\n\n Coords: CoordinateSystem;\n\n\n\n /// Get directions of each ray in bundle.\n\n ///\n\n /// This can be inefficient, because when not every ray has a different\n\n /// direction (which is the case for the `SharedDirectionRayBundle` type),\n\n /// this will nevertheless copy the single direction `NPTS` times.\n\n fn directions<NPTS, StorageIn>(\n\n &self,\n\n self_data: &Matrix<R, NPTS, U3, StorageIn>,\n\n ) -> Matrix<R, NPTS, U3, Owned<R, NPTS, U3>>\n\n where\n\n NPTS: DimName,\n","file_path":"src/lib.rs","rank":6,"score":100532.62165853298},{"content":"/// convert a 3x3 matrix into a valid right-handed rotation\n\nfn right_handed_rotation_quat_new<R: RealField>(\n\n orig: &Matrix3<R>,\n\n) -> Result<UnitQuaternion<R>, Error> {\n\n let r1 = orig.clone();\n\n let rotmat = Rotation3::from_matrix_unchecked(r1);\n\n let rquat = UnitQuaternion::from_rotation_matrix(&rotmat);\n\n if !is_right_handed_rotation_quat(&rquat) {\n\n return Err(Error::InvalidRotationMatrix);\n\n }\n\n Ok(rquat)\n\n}\n\n\n\n/// Check for valid right-handed rotation.\n\n///\n\n/// Converts quaternion to rotation matrix and back again to quat then comparing\n\n/// quats. Probably there is a much faster and better way.\n\npub(crate) fn is_right_handed_rotation_quat<R: RealField>(rquat: &UnitQuaternion<R>) -> bool {\n\n let rotmat2 = rquat.clone().to_rotation_matrix();\n\n let rquat2 = UnitQuaternion::from_rotation_matrix(&rotmat2);\n\n let delta = rquat.rotation_to(&rquat2);\n\n let angle = my_quat_angle(&delta);\n\n let epsilon = R::default_epsilon() * convert(1e5);\n\n angle.abs() <= epsilon\n\n}\n\n\n\n/// get the camera center from a 3x4 camera projection matrix\n","file_path":"src/camera.rs","rank":7,"score":97042.40713319693},{"content":"#[allow(non_snake_case)]\n\npub fn best_intersection_of_rays<Coords, R>(\n\n rays: &[Ray<Coords, R>],\n\n) -> Result<SinglePoint<Coords, R>, Error>\n\nwhere\n\n Coords: CoordinateSystem,\n\n R: RealField,\n\n DefaultAllocator: Allocator<R, Dynamic, U3>,\n\n DefaultAllocator: Allocator<R, U1, Dynamic>,\n\n DefaultAllocator: Allocator<R, U1, U3>,\n\n{\n\n if rays.len() < 2 {\n\n return Err(Error::MinimumTwoRaysNeeded);\n\n }\n\n\n\n let npts = Dynamic::new(rays.len());\n\n let u1 = U1::from_usize(1);\n\n let u3 = U3::from_usize(3);\n\n\n\n let mut line_dirs = OMatrix::<R, Dynamic, U3>::zeros_generic(npts, u3);\n\n let mut line_points = OMatrix::<R, Dynamic, U3>::zeros_generic(npts, u3);\n","file_path":"src/ray_intersection.rs","rank":8,"score":95032.78494146772},{"content":"#[cfg(feature = \"serde-serialize\")]\n\nfn _test_extrinsics_is_serialize() {\n\n // Compile-time test to ensure ExtrinsicParameters implements Serialize trait.\n\n fn implements<T: serde::Serialize>() {}\n\n implements::<ExtrinsicParameters<f64>>();\n\n}\n\n\n","file_path":"src/extrinsics.rs","rank":9,"score":91536.7480978276},{"content":"#[cfg(feature = \"serde-serialize\")]\n\nfn _test_is_deserialize() {\n\n // Compile-time test to ensure IntrinsicParametersPerspective implements Deserialize trait.\n\n fn implements<'de, T: serde::Deserialize<'de>>() {}\n\n implements::<IntrinsicParametersPerspective<f64>>();\n\n}\n\n\n\n#[cfg(test)]\n\nmod tests {\n\n use nalgebra::{SMatrix, Vector3};\n\n\n\n use super::{IntrinsicParametersPerspective, PerspectiveParams};\n\n use crate::camera::{roundtrip_camera, Camera};\n\n use crate::extrinsics::ExtrinsicParameters;\n\n use crate::intrinsic_test_utils::roundtrip_intrinsics;\n\n use crate::Points;\n\n\n\n #[test]\n\n fn roundtrip() {\n\n let params = PerspectiveParams {\n\n fx: 100.0,\n","file_path":"src/intrinsics_perspective.rs","rank":10,"score":91536.7480978276},{"content":"#[cfg(feature = \"serde-serialize\")]\n\nfn _test_extrinsics_is_deserialize() {\n\n // Compile-time test to ensure ExtrinsicParameters implements Deserialize trait.\n\n fn implements<'de, T: serde::Deserialize<'de>>() {}\n\n implements::<ExtrinsicParameters<f64>>();\n\n}\n\n\n\n#[cfg(test)]\n\nmod tests {\n\n use super::*;\n\n use nalgebra::convert as c;\n\n\n\n #[test]\n\n fn roundtrip_f64() {\n\n roundtrip_generic::<f64>(1e-10)\n\n }\n\n\n\n #[test]\n\n fn roundtrip_f32() {\n\n roundtrip_generic::<f32>(1e-5)\n\n }\n","file_path":"src/extrinsics.rs","rank":11,"score":91536.7480978276},{"content":"#[cfg(feature = \"serde-serialize\")]\n\nfn _test_is_serialize() {\n\n // Compile-time test to ensure IntrinsicParametersPerspective implements Serialize trait.\n\n fn implements<T: serde::Serialize>() {}\n\n implements::<IntrinsicParametersPerspective<f64>>();\n\n}\n\n\n","file_path":"src/intrinsics_perspective.rs","rank":12,"score":91536.7480978276},{"content":"fn my_pinv<R: RealField>(m: &SMatrix<R, 3, 3>) -> Result<SMatrix<R, 3, 3>, Error> {\n\n Ok(\n\n na::linalg::SVD::try_new(m.clone(), true, true, na::convert(1e-7), 100)\n\n .ok_or(Error::SvdFailed)?\n\n .pseudo_inverse(na::convert(1.0e-7))\n\n .unwrap(),\n\n )\n\n // The unwrap() above is safe because, as of nalgebra 0.19, this could only error if the SVD has not been computed.\n\n // But this is not possible here, so the unwrap() should never result in a panic.\n\n}\n\n\n\n#[cfg(test)]\n\nmod tests {\n\n use nalgebra::Vector3;\n\n\n\n use crate::{Camera, ExtrinsicParameters, IntrinsicParametersPerspective, PerspectiveParams};\n\n\n\n use super::*;\n\n\n\n #[test]\n","file_path":"src/ray_intersection.rs","rank":13,"score":89463.55211542993},{"content":"/// A geometric model of camera coordinates to pixels (and vice versa).\n\npub trait IntrinsicParameters<R>: std::fmt::Debug + Clone\n\nwhere\n\n R: RealField,\n\n{\n\n /// What type of ray bundle is returned when projecting pixels to rays.\n\n type BundleType;\n\n\n\n /// project pixels to camera coords\n\n fn pixel_to_camera<IN, NPTS>(\n\n &self,\n\n pixels: &Pixels<R, NPTS, IN>,\n\n ) -> RayBundle<coordinate_system::CameraFrame, Self::BundleType, R, NPTS, Owned<R, NPTS, U3>>\n\n where\n\n Self::BundleType: Bundle<R>,\n\n IN: Storage<R, NPTS, U2>,\n\n NPTS: Dim,\n\n DefaultAllocator: Allocator<R, U1, U2>, // needed to make life easy for implementors\n\n DefaultAllocator: Allocator<R, NPTS, U2>, // needed to make life easy for implementors\n\n DefaultAllocator: Allocator<R, NPTS, U3>;\n\n\n","file_path":"src/lib.rs","rank":14,"score":84438.46753649716},{"content":"#[test]\n\nfn test_jacobian_perspective() {\n\n use nalgebra::{OMatrix, RowVector2, RowVector3, Unit, Vector3};\n\n\n\n use super::*;\n\n use crate::{Camera, ExtrinsicParameters, IntrinsicParametersPerspective};\n\n\n\n // create a perspective camera\n\n let params = PerspectiveParams {\n\n fx: 100.0,\n\n fy: 102.0,\n\n skew: 0.1,\n\n cx: 321.0,\n\n cy: 239.9,\n\n };\n\n\n\n let intrinsics: IntrinsicParametersPerspective<_> = params.into();\n\n\n\n let camcenter = Vector3::new(10.0, 0.0, 10.0);\n\n let lookat = Vector3::new(0.0, 0.0, 0.0);\n\n let up = Unit::new_normalize(Vector3::new(0.0, 0.0, 1.0));\n","file_path":"src/linearize.rs","rank":15,"score":66591.21310308106},{"content":"fn main() -> Result<(), std::io::Error> {\n\n // Create cube vertices in the world coordinate frame.\n\n let world_coords = Points::<WorldFrame, _, _, _>::new(SMatrix::<f64, 8, 3>::from_row_slice(&[\n\n -1.0, -1.0, -1.0, // v1\n\n 1.0, -1.0, -1.0, // v2\n\n 1.0, 1.0, -1.0, // v3\n\n -1.0, 1.0, -1.0, // v4\n\n -1.0, -1.0, 1.0, // v5\n\n 1.0, -1.0, 1.0, // v6\n\n 1.0, 1.0, 1.0, // v7\n\n -1.0, 1.0, 1.0, // v8\n\n ]));\n\n let edges = [\n\n (0, 1),\n\n (1, 2),\n\n (2, 3),\n\n (3, 0),\n\n (4, 5),\n\n (5, 6),\n\n (6, 7),\n","file_path":"examples/render-cube.rs","rank":16,"score":62875.40159167157},{"content":"/// Create an orthographic camera.\n\nfn get_ortho_cam() -> Camera<f64, IntrinsicParametersOrthographic<f64>> {\n\n let intrinsics = OrthographicParams {\n\n sx: 100.0,\n\n sy: 102.0,\n\n cx: 321.0,\n\n cy: 239.9,\n\n };\n\n\n\n // Set extrinsic parameters.\n\n let camcenter = Vector3::new(10.0, 3.0, 5.0);\n\n let lookat = Vector3::new(0.0, 0.0, 0.0);\n\n let up = Unit::new_normalize(Vector3::new(0.0, 0.0, 1.0));\n\n let pose = ExtrinsicParameters::from_view(&camcenter, &lookat, &up);\n\n\n\n // Create camera with both intrinsic and extrinsic parameters.\n\n Camera::new(intrinsics.into(), pose)\n\n}\n\n\n","file_path":"examples/render-cube.rs","rank":17,"score":55875.500102336795},{"content":"/// Create a perspective camera.\n\nfn get_perspective_cam() -> Camera<f64, IntrinsicParametersPerspective<f64>> {\n\n // Set intrinsic parameters\n\n let intrinsics = PerspectiveParams {\n\n fx: 100.0,\n\n fy: 100.0,\n\n skew: 0.0,\n\n cx: 640.0,\n\n cy: 480.0,\n\n };\n\n\n\n // Set extrinsic parameters.\n\n let camcenter = Vector3::new(10.0, 3.0, 5.0);\n\n let lookat = Vector3::new(0.0, 0.0, 0.0);\n\n let up = Unit::new_normalize(Vector3::new(0.0, 0.0, 1.0));\n\n let pose = ExtrinsicParameters::from_view(&camcenter, &lookat, &up);\n\n\n\n // Create camera with both intrinsic and extrinsic parameters.\n\n Camera::new(intrinsics.into(), pose)\n\n}\n\n\n","file_path":"examples/render-cube.rs","rank":18,"score":55875.500102336795},{"content":" result.data[(i, j)] =\n\n center[j].clone() + scale.clone() * directions[(i, j)].clone();\n\n }\n\n }\n\n result\n\n }\n\n\n\n fn to_pose<NPTS, StorageIn, OutFrame>(\n\n &self,\n\n pose: Isometry3<R>,\n\n self_data: &Matrix<R, NPTS, U3, StorageIn>,\n\n ) -> RayBundle<OutFrame, Self, R, NPTS, Owned<R, NPTS, U3>>\n\n where\n\n NPTS: Dim,\n\n StorageIn: Storage<R, NPTS, U3>,\n\n OutFrame: CoordinateSystem,\n\n DefaultAllocator: Allocator<R, NPTS, U3>,\n\n {\n\n let bundle_type = Self::new_shared_zero_origin();\n\n let mut reposed = RayBundle::new(\n","file_path":"src/ray_bundle_types.rs","rank":19,"score":51819.391084191746},{"content":"use nalgebra::{OMatrix, SMatrix};\n\n\n\nuse crate::*;\n\n\n\n#[cfg(feature = \"serde-serialize\")]\n\nuse serde::{Deserialize, Serialize};\n\n\n\n/// A bundle of rays with the same arbitrary origin\n\n#[derive(Debug, Clone, PartialEq)]\n\n#[cfg_attr(feature = \"serde-serialize\", derive(Serialize, Deserialize))]\n\npub struct SharedOriginRayBundle<R: RealField> {\n\n center: Point3<R>,\n\n}\n\n\n\nimpl<R> SharedOriginRayBundle<R>\n\nwhere\n\n R: RealField,\n\n{\n\n /// Create a new SharedOriginRayBundle with origin (center) at zero.\n\n #[inline]\n","file_path":"src/ray_bundle_types.rs","rank":20,"score":51818.4778008362},{"content":" pub fn new_shared_zero_origin() -> Self {\n\n // center is at (0,0,0)\n\n let zero: R = nalgebra::convert(0.0);\n\n Self {\n\n center: Point3::new(zero.clone(), zero.clone(), zero),\n\n }\n\n }\n\n}\n\n\n\nimpl<R> Bundle<R> for SharedOriginRayBundle<R>\n\nwhere\n\n R: RealField,\n\n{\n\n #[inline]\n\n fn to_single_ray<Coords>(&self, self_data: &SMatrix<R, 1, 3>) -> Ray<Coords, R>\n\n where\n\n Coords: CoordinateSystem,\n\n {\n\n Ray {\n\n direction: self_data.clone(),\n","file_path":"src/ray_bundle_types.rs","rank":21,"score":51815.05730868795},{"content":" for j in 0..3 {\n\n result[(i, j)] = self_data[(i, j)].clone();\n\n }\n\n }\n\n result\n\n }\n\n\n\n fn point_on_ray<NPTS, StorageIn, OutFrame>(\n\n &self,\n\n centers: &Matrix<R, NPTS, U3, StorageIn>,\n\n ) -> Points<OutFrame, R, NPTS, Owned<R, NPTS, U3>>\n\n where\n\n Self: Sized,\n\n NPTS: Dim,\n\n StorageIn: Storage<R, NPTS, U3>,\n\n OutFrame: CoordinateSystem,\n\n DefaultAllocator: Allocator<R, NPTS, U3>,\n\n {\n\n let mut result = Points::new(OMatrix::zeros_generic(\n\n NPTS::from_usize(centers.nrows()),\n","file_path":"src/ray_bundle_types.rs","rank":22,"score":51814.27521371419},{"content":" result\n\n }\n\n\n\n fn point_on_ray<NPTS, StorageIn, OutFrame>(\n\n &self,\n\n directions: &Matrix<R, NPTS, U3, StorageIn>,\n\n ) -> Points<OutFrame, R, NPTS, Owned<R, NPTS, U3>>\n\n where\n\n Self: Sized,\n\n NPTS: Dim,\n\n StorageIn: Storage<R, NPTS, U3>,\n\n OutFrame: CoordinateSystem,\n\n DefaultAllocator: Allocator<R, NPTS, U3>,\n\n {\n\n let mut result = Points::new(OMatrix::zeros_generic(\n\n NPTS::from_usize(directions.nrows()),\n\n U3::from_usize(3),\n\n ));\n\n let center = [\n\n self.center[0].clone(),\n","file_path":"src/ray_bundle_types.rs","rank":23,"score":51813.71449631355},{"content":" }\n\n result\n\n }\n\n\n\n fn centers<NPTS, StorageIn>(\n\n &self,\n\n self_data: &Matrix<R, NPTS, U3, StorageIn>,\n\n ) -> Matrix<R, NPTS, U3, Owned<R, NPTS, U3>>\n\n where\n\n NPTS: nalgebra::DimName,\n\n StorageIn: Storage<R, NPTS, U3>,\n\n DefaultAllocator: Allocator<R, NPTS, U3>,\n\n {\n\n // TODO: do this more smartly/efficiently\n\n let mut result = nalgebra::OMatrix::<R, NPTS, U3>::zeros();\n\n for i in 0..self_data.nrows() {\n\n for j in 0..3 {\n\n result[(i, j)] = self.center[j].clone();\n\n }\n\n }\n","file_path":"src/ray_bundle_types.rs","rank":24,"score":51812.460173182175},{"content":" for i in 0..self_data.nrows() {\n\n for j in 0..3 {\n\n result[(i, j)] = self.direction[j].clone();\n\n }\n\n }\n\n result\n\n }\n\n\n\n fn centers<NPTS, StorageIn>(\n\n &self,\n\n self_data: &Matrix<R, NPTS, U3, StorageIn>,\n\n ) -> Matrix<R, NPTS, U3, Owned<R, NPTS, U3>>\n\n where\n\n NPTS: nalgebra::DimName,\n\n StorageIn: Storage<R, NPTS, U3>,\n\n DefaultAllocator: Allocator<R, NPTS, U3>,\n\n {\n\n // TODO: do this more smartly/efficiently\n\n let mut result = nalgebra::OMatrix::<R, NPTS, U3>::zeros();\n\n for i in 0..self_data.nrows() {\n","file_path":"src/ray_bundle_types.rs","rank":25,"score":51812.18931822467},{"content":" self.center[1].clone(),\n\n self.center[2].clone(),\n\n ];\n\n for i in 0..directions.nrows() {\n\n for j in 0..3 {\n\n result.data[(i, j)] = center[j].clone() + directions[(i, j)].clone();\n\n }\n\n }\n\n result\n\n }\n\n\n\n fn point_on_ray_at_distance<NPTS, StorageIn, OutFrame>(\n\n &self,\n\n directions: &Matrix<R, NPTS, U3, StorageIn>,\n\n distance: R,\n\n ) -> Points<OutFrame, R, NPTS, Owned<R, NPTS, U3>>\n\n where\n\n Self: Sized,\n\n NPTS: Dim,\n\n StorageIn: Storage<R, NPTS, U3>,\n","file_path":"src/ray_bundle_types.rs","rank":26,"score":51811.314010433554},{"content":" center: self.center.coords.transpose(),\n\n c: std::marker::PhantomData,\n\n }\n\n }\n\n\n\n fn directions<NPTS, StorageIn>(\n\n &self,\n\n self_data: &Matrix<R, NPTS, U3, StorageIn>,\n\n ) -> Matrix<R, NPTS, U3, Owned<R, NPTS, U3>>\n\n where\n\n NPTS: nalgebra::DimName,\n\n StorageIn: Storage<R, NPTS, U3>,\n\n DefaultAllocator: Allocator<R, NPTS, U3>,\n\n {\n\n // TODO: do this more smartly/efficiently\n\n let mut result = nalgebra::OMatrix::<R, NPTS, U3>::zeros();\n\n for i in 0..self_data.nrows() {\n\n for j in 0..3 {\n\n result[(i, j)] = self_data[(i, j)].clone();\n\n }\n","file_path":"src/ray_bundle_types.rs","rank":27,"score":51811.087994732385},{"content":" Coords: CoordinateSystem,\n\n {\n\n Ray {\n\n direction: self.direction.transpose(),\n\n center: self_data.clone(),\n\n c: std::marker::PhantomData,\n\n }\n\n }\n\n\n\n fn directions<NPTS, StorageIn>(\n\n &self,\n\n self_data: &Matrix<R, NPTS, U3, StorageIn>,\n\n ) -> Matrix<R, NPTS, U3, Owned<R, NPTS, U3>>\n\n where\n\n NPTS: nalgebra::DimName,\n\n StorageIn: Storage<R, NPTS, U3>,\n\n DefaultAllocator: Allocator<R, NPTS, U3>,\n\n {\n\n // TODO: do this more smartly/efficiently\n\n let mut result = nalgebra::OMatrix::<R, NPTS, U3>::zeros();\n","file_path":"src/ray_bundle_types.rs","rank":28,"score":51810.1186098261},{"content":" where\n\n Self: Sized,\n\n NPTS: Dim,\n\n StorageIn: Storage<R, NPTS, U3>,\n\n OutFrame: CoordinateSystem,\n\n DefaultAllocator: Allocator<R, NPTS, U3>,\n\n {\n\n let mut result = Points::new(OMatrix::zeros_generic(\n\n NPTS::from_usize(centers.nrows()),\n\n U3::from_usize(3),\n\n ));\n\n\n\n let d = &self.direction;\n\n let dx = d[0].clone();\n\n let dy = d[1].clone();\n\n let dz = d[2].clone();\n\n let mag2 = dx.clone() * dx.clone() + dy.clone() * dy.clone() + dz.clone() * dz.clone();\n\n let mag = mag2.sqrt();\n\n let scale = distance / mag;\n\n let dist_dir = Vector3::new(scale.clone() * dx, scale.clone() * dy, scale * dz);\n","file_path":"src/ray_bundle_types.rs","rank":29,"score":51809.65576233619},{"content":"\n\n for i in 0..centers.nrows() {\n\n for j in 0..3 {\n\n result.data[(i, j)] = dist_dir[j].clone() + centers[(i, j)].clone();\n\n }\n\n }\n\n result\n\n }\n\n\n\n fn to_pose<NPTS, StorageIn, OutFrame>(\n\n &self,\n\n pose: Isometry3<R>,\n\n self_data: &Matrix<R, NPTS, U3, StorageIn>,\n\n ) -> RayBundle<OutFrame, Self, R, NPTS, Owned<R, NPTS, U3>>\n\n where\n\n NPTS: Dim,\n\n StorageIn: Storage<R, NPTS, U3>,\n\n OutFrame: CoordinateSystem,\n\n DefaultAllocator: Allocator<R, NPTS, U3>,\n\n {\n","file_path":"src/ray_bundle_types.rs","rank":30,"score":51809.64665817562},{"content":" let bundle_type = Self::new_plusz_shared_direction();\n\n\n\n let mut reposed = RayBundle::new(\n\n bundle_type,\n\n OMatrix::zeros_generic(NPTS::from_usize(self_data.nrows()), U3::from_usize(3)),\n\n );\n\n\n\n // transform single bundle direction\n\n let new_direction = pose.transform_vector(&self.direction);\n\n\n\n // transform multiple bundle origins\n\n for i in 0..self_data.nrows() {\n\n let orig_point = Point3 {\n\n coords: self_data.row(i).transpose(),\n\n };\n\n let new_point = pose.transform_point(&orig_point);\n\n for j in 0..3 {\n\n reposed.data[(i, j)] = new_point[j].clone();\n\n }\n\n }\n\n\n\n reposed.bundle_type = SharedDirectionRayBundle {\n\n direction: new_direction,\n\n };\n\n reposed\n\n }\n\n}\n","file_path":"src/ray_bundle_types.rs","rank":31,"score":51808.01957949661},{"content":"/// A bundle of rays with the same arbitrary direction\n\n#[derive(Debug, Clone, PartialEq)]\n\n#[cfg_attr(feature = \"serde-serialize\", derive(Serialize, Deserialize))]\n\npub struct SharedDirectionRayBundle<R: RealField> {\n\n direction: Vector3<R>,\n\n}\n\n\n\nimpl<R: RealField> SharedDirectionRayBundle<R> {\n\n /// Create a new SharedDirectionRayBundle with direction +z.\n\n pub fn new_plusz_shared_direction() -> Self {\n\n // in +z direction\n\n Self {\n\n direction: Vector3::new(R::zero(), R::zero(), R::one()),\n\n }\n\n }\n\n}\n\n\n\nimpl<R: RealField> Bundle<R> for SharedDirectionRayBundle<R> {\n\n fn to_single_ray<Coords>(&self, self_data: &SMatrix<R, 1, 3>) -> Ray<Coords, R>\n\n where\n","file_path":"src/ray_bundle_types.rs","rank":32,"score":51807.299392168774},{"content":" U3::from_usize(3),\n\n ));\n\n let direction = [\n\n self.direction[0].clone(),\n\n self.direction[1].clone(),\n\n self.direction[2].clone(),\n\n ];\n\n for i in 0..centers.nrows() {\n\n for j in 0..3 {\n\n result.data[(i, j)] = direction[j].clone() + centers[(i, j)].clone();\n\n }\n\n }\n\n result\n\n }\n\n\n\n fn point_on_ray_at_distance<NPTS, StorageIn, OutFrame>(\n\n &self,\n\n centers: &Matrix<R, NPTS, U3, StorageIn>,\n\n distance: R,\n\n ) -> Points<OutFrame, R, NPTS, Owned<R, NPTS, U3>>\n","file_path":"src/ray_bundle_types.rs","rank":33,"score":51806.27216805993},{"content":" bundle_type,\n\n OMatrix::zeros_generic(NPTS::from_usize(self_data.nrows()), U3::from_usize(3)),\n\n );\n\n // transform single bundle center point\n\n let new_center = pose.transform_point(&self.center);\n\n\n\n // transform multiple bundle directions\n\n for i in 0..self_data.nrows() {\n\n let orig_vec = self_data.row(i).transpose();\n\n let new_vec = pose.transform_vector(&orig_vec);\n\n for j in 0..3 {\n\n reposed.data[(i, j)] = new_vec[j].clone();\n\n }\n\n }\n\n\n\n reposed.bundle_type = SharedOriginRayBundle { center: new_center };\n\n reposed\n\n }\n\n}\n\n\n","file_path":"src/ray_bundle_types.rs","rank":34,"score":51803.69948324986},{"content":" OutFrame: CoordinateSystem,\n\n DefaultAllocator: Allocator<R, NPTS, U3>,\n\n {\n\n let mut result = Points::new(OMatrix::zeros_generic(\n\n NPTS::from_usize(directions.nrows()),\n\n U3::from_usize(3),\n\n ));\n\n let center = [\n\n self.center[0].clone(),\n\n self.center[1].clone(),\n\n self.center[2].clone(),\n\n ];\n\n for i in 0..directions.nrows() {\n\n let dx = directions[(i, 0)].clone();\n\n let dy = directions[(i, 1)].clone();\n\n let dz = directions[(i, 2)].clone();\n\n let mag2 = dx.clone() * dx + dy.clone() * dy + dz.clone() * dz;\n\n let mag = mag2.sqrt();\n\n let scale = distance.clone() / mag;\n\n for j in 0..3 {\n","file_path":"src/ray_bundle_types.rs","rank":35,"score":51802.844693236715},{"content":"fn main() {\n\n use cam_geom::*;\n\n use nalgebra::{Matrix2x3, Unit, Vector3};\n\n\n\n // Create two points in the world coordinate frame.\n\n let world_coords = Points::new(Matrix2x3::new(\n\n 1.0, 0.0, 0.0, // point 1\n\n 0.0, 1.0, 0.0, // point 2\n\n ));\n\n\n\n // perepective parameters - focal length of 100, no skew, pixel center at (640,480)\n\n let intrinsics = IntrinsicParametersPerspective::from(PerspectiveParams {\n\n fx: 100.0,\n\n fy: 100.0,\n\n skew: 0.0,\n\n cx: 640.0,\n\n cy: 480.0,\n\n });\n\n\n\n // Set extrinsic parameters - camera at (10,0,0), looing at (0,0,0), up (0,0,1)\n","file_path":"examples/3d-to-2d.rs","rank":36,"score":46487.34670254089},{"content":"/// A simple SVG file writer\n\nstruct SvgWriter {\n\n segs: Vec<((f64, f64), (f64, f64))>,\n\n xmin: f64,\n\n xmax: f64,\n\n ymin: f64,\n\n ymax: f64,\n\n}\n\n\n\nimpl SvgWriter {\n\n fn new() -> Self {\n\n Self {\n\n xmin: std::f64::INFINITY,\n\n xmax: -std::f64::INFINITY,\n\n ymin: std::f64::INFINITY,\n\n ymax: -std::f64::INFINITY,\n\n segs: Vec::new(),\n\n }\n\n }\n\n fn add_edge<S>(&mut self, pt0: &Matrix<f64, U1, U2, S>, pt1: &Matrix<f64, U1, U2, S>)\n\n where\n","file_path":"examples/render-cube.rs","rank":37,"score":44111.36614513887},{"content":"fn main() {\n\n use cam_geom::*;\n\n use nalgebra::RowVector3;\n\n\n\n // Create the first ray.\n\n let ray1 = Ray::<WorldFrame, _>::new(\n\n RowVector3::new(1.0, 0.0, 0.0), // origin\n\n RowVector3::new(0.0, 1.0, 0.0), // direction\n\n );\n\n\n\n // Create the second ray.\n\n let ray2 = Ray::<WorldFrame, _>::new(\n\n RowVector3::new(0.0, 1.0, 0.0), // origin\n\n RowVector3::new(1.0, 0.0, 0.0), // direction\n\n );\n\n\n\n // Compute the best intersection.\n\n let result = best_intersection_of_rays(&[ray1, ray2]).unwrap();\n\n\n\n // Print the result.\n\n println!(\"result: {}\", result.data);\n\n}\n","file_path":"examples/ray-intersect.rs","rank":38,"score":43192.15790611204},{"content":"/// A coordinate system in which points and rays can be defined.\n\npub trait CoordinateSystem {}\n\n\n\n/// Implementations of [`CoordinateSystem`](trait.CoordinateSystem.html).\n\npub mod coordinate_system {\n\n\n\n #[cfg(feature = \"serde-serialize\")]\n\n use serde::{Deserialize, Serialize};\n\n\n\n /// Coordinates in the camera coordinate system.\n\n ///\n\n /// The camera center is at (0,0,0) at looking at (0,0,1) with up as\n\n /// (0,-1,0) in this coordinate frame.\n\n #[derive(Debug, Clone, PartialEq)]\n\n #[cfg_attr(feature = \"serde-serialize\", derive(Serialize, Deserialize))]\n\n pub struct CameraFrame {}\n\n impl crate::CoordinateSystem for CameraFrame {}\n\n\n\n /// Coordinates in the world coordinate system.\n\n ///\n\n /// The camera center is may be located at an arbitrary position and pointed\n","file_path":"src/lib.rs","rank":39,"score":40464.393337334455},{"content":"// Save a wireframe rendering of the vertices and edges to an SVG file.\n\nfn render_wireframe<NPTS, I, S>(\n\n verts: &Points<WorldFrame, f64, NPTS, S>,\n\n edges: &[(usize, usize)],\n\n cam: &Camera<f64, I>,\n\n fname: &str,\n\n) -> Result<(), std::io::Error>\n\nwhere\n\n NPTS: Dim,\n\n I: IntrinsicParameters<f64>,\n\n S: Storage<f64, NPTS, U3>,\n\n DefaultAllocator: Allocator<f64, NPTS, U3>,\n\n DefaultAllocator: Allocator<f64, NPTS, U2>,\n\n{\n\n // Project the original 3D coordinates to 2D pixel coordinates.\n\n let pixel_coords = cam.world_to_pixel(&verts);\n\n\n\n let mut wtr = SvgWriter::new();\n\n\n\n for edge in edges {\n\n let (i0, i1) = edge;\n\n let pt0 = pixel_coords.data.row(*i0);\n\n let pt1 = pixel_coords.data.row(*i1);\n\n wtr.add_edge(&pt0, &pt1);\n\n }\n\n wtr.save(fname)?;\n\n\n\n Ok(())\n\n}\n\n\n","file_path":"examples/render-cube.rs","rank":40,"score":32972.6694241497},{"content":"use nalgebra::{\n\n allocator::Allocator,\n\n base::storage::{Owned, Storage},\n\n convert,\n\n geometry::{Point3, Rotation3, UnitQuaternion},\n\n DefaultAllocator, Dim, Matrix, Matrix3, RealField, SMatrix, Vector3, U1, U2, U3, U4,\n\n};\n\n\n\n#[cfg(feature = \"serde-serialize\")]\n\nuse serde::{Deserialize, Serialize};\n\n\n\nuse crate::{\n\n coordinate_system::WorldFrame,\n\n intrinsics_perspective::{IntrinsicParametersPerspective, PerspectiveParams},\n\n Bundle, Error, ExtrinsicParameters, IntrinsicParameters, Pixels, Points, RayBundle,\n\n};\n\n\n\n/// A camera model that can convert world coordinates into pixel coordinates.\n\n///\n\n/// # Examples\n","file_path":"src/camera.rs","rank":41,"score":29144.473563773092},{"content":" I::BundleType: Bundle<R>,\n\n DefaultAllocator: Allocator<R, U1, U2>,\n\n DefaultAllocator: Allocator<R, NPTS, U2>,\n\n DefaultAllocator: Allocator<R, NPTS, U3>,\n\n {\n\n // get camera frame rays\n\n let camera = self.intrinsics.pixel_to_camera(&pixels);\n\n\n\n // get world frame rays\n\n self.extrinsics.ray_camera_to_world(&camera)\n\n }\n\n}\n\n\n\nimpl<R: RealField> Camera<R, IntrinsicParametersPerspective<R>> {\n\n /// Create a `Camera` from a 3x4 perspective projection matrix.\n\n pub fn from_perspective_matrix<S>(pmat: &Matrix<R, U3, U4, S>) -> Result<Self, Error>\n\n where\n\n S: Storage<R, U3, U4> + Clone,\n\n {\n\n let m = pmat.clone().remove_column(3);\n","file_path":"src/camera.rs","rank":42,"score":29139.99310188842},{"content":" &self.extrinsics\n\n }\n\n\n\n /// Return a reference to the intrinsic parameters.\n\n #[inline]\n\n pub fn intrinsics(&self) -> &I {\n\n &self.intrinsics\n\n }\n\n\n\n /// take 3D coordinates in world frame and convert to pixel coordinates\n\n pub fn world_to_pixel<NPTS, InStorage>(\n\n &self,\n\n world: &Points<WorldFrame, R, NPTS, InStorage>,\n\n ) -> Pixels<R, NPTS, Owned<R, NPTS, U2>>\n\n where\n\n NPTS: Dim,\n\n InStorage: Storage<R, NPTS, U3>,\n\n DefaultAllocator: Allocator<R, NPTS, U3>,\n\n DefaultAllocator: Allocator<R, NPTS, U2>,\n\n {\n","file_path":"src/camera.rs","rank":43,"score":29138.151316190673},{"content":" let camera_frame = self.extrinsics.world_to_camera(&world);\n\n self.intrinsics.camera_to_pixel(&camera_frame)\n\n }\n\n\n\n /// take pixel coordinates and project to 3D in world frame\n\n ///\n\n /// output arguments:\n\n /// `camera` - camera frame coordinate rays\n\n /// `world` - world frame coordinate rays\n\n ///\n\n /// Note that the camera frame coordinates are returned as they must\n\n /// be computed anyway, so this additional data is \"free\".\n\n pub fn pixel_to_world<IN, NPTS>(\n\n &self,\n\n pixels: &Pixels<R, NPTS, IN>,\n\n ) -> RayBundle<WorldFrame, I::BundleType, R, NPTS, Owned<R, NPTS, U3>>\n\n where\n\n I::BundleType: Bundle<R>,\n\n IN: Storage<R, NPTS, U2>,\n\n NPTS: Dim,\n","file_path":"src/camera.rs","rank":44,"score":29136.625153810426},{"content":"/// let pose = ExtrinsicParameters::from_view(&camcenter, &lookat, &up);\n\n///\n\n/// // Create camera with both intrinsic and extrinsic parameters.\n\n/// let cam = Camera::new(intrinsics, pose);\n\n/// ```\n\n///\n\n/// Creates a new orthographic camera:\n\n///\n\n/// ```\n\n/// use cam_geom::*;\n\n/// use nalgebra::*;\n\n///\n\n/// // orthographic parameters - scale of 100, pixel center at (640,480)\n\n/// let intrinsics = IntrinsicParametersOrthographic::from(OrthographicParams {\n\n/// sx: 100.0,\n\n/// sy: 100.0,\n\n/// cx: 640.0,\n\n/// cy: 480.0,\n\n/// });\n\n///\n","file_path":"src/camera.rs","rank":45,"score":29133.723403484277},{"content":" let (rquat, k) = rq_decomposition(m)?;\n\n\n\n let k22: R = k[(2, 2)].clone();\n\n\n\n let one: R = convert(1.0);\n\n\n\n let k = k * (one / k22); // normalize\n\n\n\n let params = PerspectiveParams {\n\n fx: k[(0, 0)].clone(),\n\n fy: k[(1, 1)].clone(),\n\n skew: k[(0, 1)].clone(),\n\n cx: k[(0, 2)].clone(),\n\n cy: k[(1, 2)].clone(),\n\n };\n\n\n\n let camcenter = pmat2cam_center(pmat);\n\n let extrinsics = ExtrinsicParameters::from_rotation_and_camcenter(rquat, camcenter);\n\n\n\n Ok(Self::new(params.into(), extrinsics))\n","file_path":"src/camera.rs","rank":46,"score":29130.104435495323},{"content":" }\n\n\n\n /// Create a 3x4 perspective projection matrix modeling this camera.\n\n pub fn as_camera_matrix(&self) -> SMatrix<R, 3, 4> {\n\n let m = {\n\n let p33 = self.intrinsics().as_intrinsics_matrix();\n\n p33 * self.extrinsics().cache.qt.clone()\n\n };\n\n\n\n // flip sign if focal length < 0\n\n let m = if m[(0, 0)] < nalgebra::convert(0.0) {\n\n -m\n\n } else {\n\n m\n\n };\n\n\n\n m.clone() / m[(2, 3)].clone() // normalize\n\n }\n\n}\n\n\n\n#[cfg(test)]\n","file_path":"src/camera.rs","rank":47,"score":29129.253944656783},{"content":"///\n\n/// Creates a new perspective camera:\n\n///\n\n/// ```\n\n/// use cam_geom::*;\n\n/// use nalgebra::*;\n\n///\n\n/// // perepective parameters - focal length of 100, no skew, pixel center at (640,480)\n\n/// let intrinsics = IntrinsicParametersPerspective::from(PerspectiveParams {\n\n/// fx: 100.0,\n\n/// fy: 100.0,\n\n/// skew: 0.0,\n\n/// cx: 640.0,\n\n/// cy: 480.0,\n\n/// });\n\n///\n\n/// // Set extrinsic parameters - camera at (10,0,10), looing at (0,0,0), up (0,0,1)\n\n/// let camcenter = Vector3::new(10.0, 0.0, 10.0);\n\n/// let lookat = Vector3::new(0.0, 0.0, 0.0);\n\n/// let up = Unit::new_normalize(Vector3::new(0.0, 0.0, 1.0));\n","file_path":"src/camera.rs","rank":48,"score":29127.79443317597},{"content":"impl<R, I> Camera<R, I>\n\nwhere\n\n I: IntrinsicParameters<R>,\n\n R: RealField,\n\n{\n\n /// Create a new camera from intrinsic and extrinsic parameters.\n\n ///\n\n /// # Arguments\n\n /// Intrinsic parameters and extrinsic parameters\n\n #[inline]\n\n pub fn new(intrinsics: I, extrinsics: ExtrinsicParameters<R>) -> Self {\n\n Self {\n\n intrinsics,\n\n extrinsics,\n\n }\n\n }\n\n\n\n /// Return a reference to the extrinsic parameters.\n\n #[inline]\n\n pub fn extrinsics(&self) -> &ExtrinsicParameters<R> {\n","file_path":"src/camera.rs","rank":49,"score":29126.222083095578},{"content":"/// // Set extrinsic parameters - camera at (10,0,10), looing at (0,0,0), up (0,0,1)\n\n/// let camcenter = Vector3::new(10.0, 0.0, 10.0);\n\n/// let lookat = Vector3::new(0.0, 0.0, 0.0);\n\n/// let up = Unit::new_normalize(Vector3::new(0.0, 0.0, 1.0));\n\n/// let pose = ExtrinsicParameters::from_view(&camcenter, &lookat, &up);\n\n///\n\n/// // Create camera with both intrinsic and extrinsic parameters.\n\n/// let cam = Camera::new(intrinsics, pose);\n\n/// ```\n\n#[derive(Debug, Clone, PartialEq)]\n\n#[cfg_attr(feature = \"serde-serialize\", derive(Serialize, Deserialize))]\n\npub struct Camera<R, I>\n\nwhere\n\n I: IntrinsicParameters<R>,\n\n R: RealField,\n\n{\n\n intrinsics: I,\n\n extrinsics: ExtrinsicParameters<R>,\n\n}\n\n\n","file_path":"src/camera.rs","rank":50,"score":29125.671528990628},{"content":"\n\n let params = PerspectiveParams {\n\n fx: 100.0,\n\n fy: 102.0,\n\n skew: 0.1,\n\n cx: 321.0,\n\n cy: 239.9,\n\n };\n\n\n\n let intrinsics: IntrinsicParametersPerspective<_> = params.into();\n\n\n\n let camcenter = Vector3::new(10.0, 0.0, 10.0);\n\n let lookat = Vector3::new(0.0, 0.0, 0.0);\n\n let up = Unit::new_normalize(Vector3::new(0.0, 0.0, 1.0));\n\n let pose = ExtrinsicParameters::from_view(&camcenter, &lookat, &up);\n\n\n\n let expected = Camera::new(intrinsics, pose);\n\n\n\n let buf = serde_json::to_string(&expected).unwrap();\n\n let actual: Camera<_, _> = serde_json::from_str(&buf).unwrap();\n\n assert!(expected == actual);\n\n }\n\n}\n","file_path":"src/camera.rs","rank":51,"score":29120.539110261896},{"content":" let q = -q;\n\n let intrin = -intrin;\n\n let rquat = right_handed_rotation_quat_new(&q)?;\n\n Ok((rquat, intrin))\n\n }\n\n e => Err(e),\n\n }\n\n }\n\n }\n\n}\n\n\n","file_path":"src/camera.rs","rank":52,"score":29109.535102279733},{"content":" let mut data = nalgebra::OMatrix::<R, Dynamic, U2>::from_element(uv_raws.len(), convert(0.0));\n\n for i in 0..uv_raws.len() {\n\n for j in 0..2 {\n\n data[(i, j)] = uv_raws[i][j].clone();\n\n }\n\n }\n\n Pixels { data }\n\n}\n\n\n\n/// Test roundtrip projection from pixels to camera rays for an intrinsic camera model.\n\n///\n\n/// Generate pixel coordinates, project them to rays, convert to points on the\n\n/// rays, convert the points back to pixels, and then compare with the original\n\n/// pixel coordinates.\n","file_path":"src/intrinsic_test_utils.rs","rank":53,"score":26210.138653684768},{"content":"//! Utilities for testing `cam_geom` implementations.\n\nuse super::*;\n\nuse nalgebra::{\n\n base::{dimension::Dynamic, VecStorage},\n\n convert,\n\n};\n\n\n\npub(crate) fn generate_uv_raw<R: RealField>(\n\n width: usize,\n\n height: usize,\n\n step: usize,\n\n border: usize,\n\n) -> Pixels<R, Dynamic, VecStorage<R, Dynamic, U2>> {\n\n let mut uv_raws: Vec<[R; 2]> = Vec::new();\n\n for row in num_iter::range_step(border, height - border, step) {\n\n for col in num_iter::range_step(border, width - border, step) {\n\n uv_raws.push([convert(col as f64), convert(row as f64)]);\n\n }\n\n }\n\n\n","file_path":"src/intrinsic_test_utils.rs","rank":54,"score":26205.75022012014},{"content":" type BundleType = SharedOriginRayBundle<R>;\n\n\n\n fn pixel_to_camera<IN, NPTS>(\n\n &self,\n\n pixels: &Pixels<R, NPTS, IN>,\n\n ) -> RayBundle<CameraFrame, Self::BundleType, R, NPTS, Owned<R, NPTS, U3>>\n\n where\n\n Self::BundleType: Bundle<R>,\n\n IN: Storage<R, NPTS, U2>,\n\n NPTS: Dim,\n\n DefaultAllocator: Allocator<R, NPTS, U3>,\n\n {\n\n let one: R = convert(1.0);\n\n\n\n // allocate zeros, fill later\n\n let mut result = RayBundle::new_shared_zero_origin(OMatrix::zeros_generic(\n\n NPTS::from_usize(pixels.data.nrows()),\n\n U3::from_usize(3),\n\n ));\n\n\n","file_path":"src/intrinsics_perspective.rs","rank":57,"score":41.213358780101956},{"content":"use nalgebra::{\n\n allocator::Allocator,\n\n convert,\n\n storage::{Owned, Storage},\n\n DefaultAllocator, Dim, Matrix, OMatrix, RealField, SMatrix, SliceStorage, U1, U2, U3,\n\n};\n\n\n\n#[cfg(feature = \"serde-serialize\")]\n\nuse serde::{Deserialize, Serialize};\n\n\n\nuse crate::{\n\n coordinate_system::CameraFrame, Bundle, Error, IntrinsicParameters, Pixels, Points, RayBundle,\n\n};\n\n\n\nuse crate::ray_bundle_types::SharedOriginRayBundle;\n\n\n\n/// Parameters defining a pinhole perspective camera model.\n\n///\n\n/// These will be used to make the 3x4 intrinsic parameter matrix\n\n/// ```text\n","file_path":"src/intrinsics_perspective.rs","rank":59,"score":38.88697905728456},{"content":" /// project camera coords to pixel coordinates\n\n fn camera_to_pixel<IN, NPTS>(\n\n &self,\n\n camera: &Points<coordinate_system::CameraFrame, R, NPTS, IN>,\n\n ) -> Pixels<R, NPTS, Owned<R, NPTS, U2>>\n\n where\n\n IN: Storage<R, NPTS, U3>,\n\n NPTS: Dim,\n\n DefaultAllocator: Allocator<R, NPTS, U2>;\n\n}\n\n\n\n#[cfg(test)]\n\nmod tests {\n\n use super::*;\n\n use nalgebra::convert;\n\n\n\n #[cfg(not(feature = \"std\"))]\n\n compile_error!(\"tests require std\");\n\n\n\n #[test]\n","file_path":"src/lib.rs","rank":62,"score":36.05262309990812},{"content":"use nalgebra::geometry::{Isometry3, Point3, Rotation3, Translation, UnitQuaternion};\n\nuse nalgebra::{\n\n allocator::Allocator,\n\n storage::{Owned, Storage},\n\n DefaultAllocator, RealField,\n\n};\n\nuse nalgebra::{convert, Dim, OMatrix, SMatrix, Unit, Vector3, U3};\n\n\n\n#[cfg(feature = \"serde-serialize\")]\n\nuse serde::{Deserialize, Serialize};\n\n\n\nuse crate::{\n\n coordinate_system::{CameraFrame, WorldFrame},\n\n Bundle, Points, RayBundle,\n\n};\n\n\n\n/// Defines the pose of a camera in the world coordinate system.\n\n#[derive(Clone, PartialEq)]\n\n#[cfg_attr(feature = \"serde-serialize\", derive(Serialize))]\n\npub struct ExtrinsicParameters<R: RealField> {\n","file_path":"src/extrinsics.rs","rank":63,"score":35.1196506573625},{"content":" /// `Coords` type.\n\n pub fn new_shared_zero_origin(data: Matrix<R, NPTS, U3, StorageMultiple>) -> Self {\n\n let bundle_type = crate::ray_bundle_types::SharedOriginRayBundle::new_shared_zero_origin();\n\n Self::new(bundle_type, data)\n\n }\n\n}\n\n\n\nimpl<Coords, R, NPTS, StorageMultiple>\n\n RayBundle<\n\n Coords,\n\n crate::ray_bundle_types::SharedDirectionRayBundle<R>,\n\n R,\n\n NPTS,\n\n StorageMultiple,\n\n >\n\nwhere\n\n Coords: CoordinateSystem,\n\n R: RealField,\n\n NPTS: Dim,\n\n StorageMultiple: Storage<R, NPTS, U3>,\n","file_path":"src/lib.rs","rank":64,"score":33.515373384915016},{"content":" R: RealField,\n\n NPTS: Dim,\n\n{\n\n /// Create a new Points instance from the underlying storage.\n\n #[inline]\n\n pub fn new(data: nalgebra::Matrix<R, NPTS, U3, STORAGE>) -> Self {\n\n Self {\n\n coords: std::marker::PhantomData,\n\n data,\n\n }\n\n }\n\n}\n\n\n\n/// 3D rays. Can be in any [`CoordinateSystem`](trait.CoordinateSystem.html).\n\n///\n\n/// Any given `RayBundle` will have a particular bundle type, which implements\n\n/// the [`Bundle`](trait.Bundle.html) trait.\n\n#[derive(Debug, Clone, PartialEq)]\n\n#[cfg_attr(feature = \"serde-serialize\", derive(Serialize, Deserialize))]\n\npub struct RayBundle<Coords, BType, R, NPTS, StorageMultiple>\n","file_path":"src/lib.rs","rank":65,"score":33.248173804708394},{"content":" std::fmt::Debug::fmt(self, f)\n\n }\n\n}\n\n\n\n/// 2D pixel locations on the image sensor.\n\n///\n\n/// These pixels are \"distorted\" - with barrel and pincushion distortion - if\n\n/// the camera model incorporates such. (Undistorted pixels are handled\n\n/// internally within the camera model.)\n\n///\n\n/// This is a newtype wrapping an `nalgebra::Matrix`.\n\n#[derive(Clone)]\n\npub struct Pixels<R: RealField, NPTS: Dim, STORAGE> {\n\n /// The matrix storing pixel locations.\n\n pub data: nalgebra::Matrix<R, NPTS, U2, STORAGE>,\n\n}\n\n\n\nimpl<R: RealField, NPTS: Dim, STORAGE> Pixels<R, NPTS, STORAGE> {\n\n /// Create a new Pixels instance\n\n #[inline]\n\n pub fn new(data: nalgebra::Matrix<R, NPTS, U2, STORAGE>) -> Self {\n\n Self { data }\n\n }\n\n}\n\n\n\n/// A coordinate system in which points and rays can be defined.\n","file_path":"src/lib.rs","rank":66,"score":32.531246057600065},{"content":" in_mult[(i, 2)].clone(),\n\n ));\n\n for j in 0..3 {\n\n out_mult[(i, j)] = tmp[j].clone();\n\n }\n\n }\n\n world\n\n }\n\n\n\n /// Convert rays in camera coordinates to world coordinates.\n\n #[inline]\n\n pub fn ray_camera_to_world<BType, NPTS, StorageCamera>(\n\n &self,\n\n camera: &RayBundle<CameraFrame, BType, R, NPTS, StorageCamera>,\n\n ) -> RayBundle<WorldFrame, BType, R, NPTS, Owned<R, NPTS, U3>>\n\n where\n\n BType: Bundle<R>,\n\n NPTS: Dim,\n\n StorageCamera: Storage<R, NPTS, U3>,\n\n DefaultAllocator: Allocator<R, NPTS, U3>,\n","file_path":"src/extrinsics.rs","rank":67,"score":32.50944476226419},{"content":" /// Vertical component of the principal point.\n\n pub cy: R,\n\n}\n\n\n\nimpl<R: RealField> From<PerspectiveParams<R>> for IntrinsicParametersPerspective<R> {\n\n fn from(params: PerspectiveParams<R>) -> Self {\n\n use nalgebra::convert as c;\n\n #[rustfmt::skip]\n\n let cache_p = nalgebra::SMatrix::<R,3,4>::new(\n\n params.fx.clone(), params.skew.clone(), params.cx.clone(), c(0.0),\n\n c(0.0), params.fy.clone(), params.cy.clone(), c(0.0),\n\n c(0.0), c(0.0), c(1.0), c(0.0),\n\n );\n\n Self { params, cache_p }\n\n }\n\n}\n\n\n\n/// A pinhole perspective camera model. Implements [`IntrinsicParameters`](trait.IntrinsicParameters.html).\n\n///\n\n/// Create an `IntrinsicParametersPerspective` as described for\n","file_path":"src/intrinsics_perspective.rs","rank":68,"score":31.60075913388543},{"content":"{\n\n /// Create a new RayBundle instance from the underlying storage.\n\n ///\n\n /// The coordinate system is given by the `Coords` type and the bundle type\n\n /// (e.g. shared origin or shared direction) is given by the `BType`.\n\n #[inline]\n\n fn new(bundle_type: BType, data: nalgebra::Matrix<R, NPTS, U3, StorageMultiple>) -> Self {\n\n Self {\n\n coords: std::marker::PhantomData,\n\n data,\n\n bundle_type,\n\n }\n\n }\n\n\n\n /// get a 3D point on the ray, obtained by adding the direction(s) to the origin(s)\n\n ///\n\n /// The distance of the point from the ray bundle center is not definted and\n\n /// can be arbitrary.\n\n #[inline]\n\n pub fn point_on_ray(&self) -> Points<Coords, R, NPTS, Owned<R, NPTS, U3>>\n","file_path":"src/lib.rs","rank":69,"score":31.515474382620422},{"content":" fn camera_to_pixel<IN, NPTS>(\n\n &self,\n\n camera: &Points<CameraFrame, R, NPTS, IN>,\n\n ) -> Pixels<R, NPTS, Owned<R, NPTS, U2>>\n\n where\n\n IN: Storage<R, NPTS, U3>,\n\n NPTS: Dim,\n\n DefaultAllocator: Allocator<R, NPTS, U2>,\n\n {\n\n let mut result = Pixels::new(OMatrix::zeros_generic(\n\n NPTS::from_usize(camera.data.nrows()),\n\n U2::from_usize(2),\n\n ));\n\n\n\n // It seems broadcasting is not (yet) supported in nalgebra, so we loop\n\n // through the data. See\n\n // https://discourse.nphysics.org/t/array-broadcasting-support/375/3 .\n\n\n\n for i in 0..camera.data.nrows() {\n\n let x = nalgebra::Point3::new(\n","file_path":"src/intrinsics_perspective.rs","rank":71,"score":30.810816112752722},{"content":" let C = Vector3::new(CX, CY, CZ);\n\n\n\n let s_f64_pinv = my_pinv(&S)?;\n\n let s_pinv = despecialize!(s_f64_pinv, R, 3, 3);\n\n let r: Vector3<R> = s_pinv * C;\n\n\n\n let mut result = crate::Points::new(nalgebra::OMatrix::<R, U1, U3>::zeros_generic(u1, u3));\n\n for j in 0..3 {\n\n result.data[(0, j)] = r[j].clone();\n\n }\n\n Ok(result)\n\n}\n\n\n","file_path":"src/ray_intersection.rs","rank":72,"score":30.032406695442504},{"content":" /// in an arbitrary direction in this coordinate frame.\n\n #[derive(Debug, Clone, PartialEq)]\n\n #[cfg_attr(feature = \"serde-serialize\", derive(Serialize, Deserialize))]\n\n pub struct WorldFrame {}\n\n impl crate::CoordinateSystem for WorldFrame {}\n\n}\n\npub use coordinate_system::{CameraFrame, WorldFrame};\n\n\n\n/// 3D points. Can be in any [`CoordinateSystem`](trait.CoordinateSystem.html).\n\n///\n\n/// This is a newtype wrapping an `nalgebra::Matrix`.\n\npub struct Points<Coords: CoordinateSystem, R: RealField, NPTS: Dim, STORAGE> {\n\n coords: std::marker::PhantomData<Coords>,\n\n /// The matrix storing point locations.\n\n pub data: nalgebra::Matrix<R, NPTS, U3, STORAGE>,\n\n}\n\n\n\nimpl<Coords, R, NPTS, STORAGE> Points<Coords, R, NPTS, STORAGE>\n\nwhere\n\n Coords: CoordinateSystem,\n","file_path":"src/lib.rs","rank":73,"score":29.865324876072883},{"content":" {\n\n camera.to_pose(self.cache.pose_inv.clone())\n\n }\n\n\n\n /// Convert points in world coordinates to camera coordinates.\n\n pub fn world_to_camera<NPTS, InStorage>(\n\n &self,\n\n world: &Points<WorldFrame, R, NPTS, InStorage>,\n\n ) -> Points<CameraFrame, R, NPTS, Owned<R, NPTS, U3>>\n\n where\n\n NPTS: Dim,\n\n InStorage: Storage<R, NPTS, U3>,\n\n DefaultAllocator: Allocator<R, NPTS, U3>,\n\n {\n\n let mut cam_coords = Points::new(OMatrix::zeros_generic(\n\n NPTS::from_usize(world.data.nrows()),\n\n U3::from_usize(3),\n\n ));\n\n\n\n // Potential optimization: remove for loops\n","file_path":"src/extrinsics.rs","rank":74,"score":29.442911666684736},{"content":"{\n\n /// Return the single ray from the RayBundle with exactly one ray.\n\n #[inline]\n\n pub fn to_single_ray(&self) -> Ray<Coords, R> {\n\n self.bundle_type.to_single_ray(&self.data)\n\n }\n\n}\n\n\n\nimpl<Coords, R, NPTS, StorageMultiple>\n\n RayBundle<Coords, crate::ray_bundle_types::SharedOriginRayBundle<R>, R, NPTS, StorageMultiple>\n\nwhere\n\n Coords: CoordinateSystem,\n\n R: RealField,\n\n NPTS: Dim,\n\n StorageMultiple: Storage<R, NPTS, U3>,\n\n{\n\n /// Create a new RayBundle instance in which all rays share origin at zero.\n\n ///\n\n /// The number of points allocated is given by the `npts` parameter, which\n\n /// should agree with the `NPTS` type. The coordinate system is given by the\n","file_path":"src/lib.rs","rank":75,"score":29.417751505426086},{"content":"\n\n#![deny(rust_2018_idioms, unsafe_code, missing_docs)]\n\n#![cfg_attr(not(feature = \"std\"), no_std)]\n\n\n\n#[cfg(not(feature = \"std\"))]\n\nextern crate core as std;\n\n\n\n#[cfg(feature = \"serde-serialize\")]\n\nuse serde::{Deserialize, Serialize};\n\n\n\nuse nalgebra::{\n\n allocator::Allocator,\n\n storage::{Owned, Storage},\n\n DefaultAllocator, Dim, DimName, Isometry3, Matrix, Point3, RealField, SMatrix, Vector3, U1, U2,\n\n U3,\n\n};\n\n\n\n#[cfg(feature = \"std\")]\n\npub mod intrinsic_test_utils;\n\n\n","file_path":"src/lib.rs","rank":76,"score":28.891117554823875},{"content":" #[inline]\n\n pub fn fy(&self) -> R {\n\n self.params.fy.clone()\n\n }\n\n\n\n /// Get skew\n\n #[inline]\n\n pub fn skew(&self) -> R {\n\n self.params.skew.clone()\n\n }\n\n\n\n /// Get X center\n\n #[inline]\n\n pub fn cx(&self) -> R {\n\n self.params.cx.clone()\n\n }\n\n\n\n /// Get Y center\n\n #[inline]\n\n pub fn cy(&self) -> R {\n","file_path":"src/intrinsics_perspective.rs","rank":77,"score":28.228063216177762},{"content":" // flip sign if focal length < 0\n\n let m = if m[(0, 0)] < nalgebra::zero() { -m } else { m };\n\n\n\n let m = m.clone() / m[(2, 3)].clone(); // normalize\n\n\n\n Self { m }\n\n }\n\n\n\n /// Linearize camera model by evaluating around input point `p`.\n\n ///\n\n /// Returns Jacobian matrix `A` (shape 2x3) such that `Ao = (u,v)` where `o`\n\n /// is 3D world coords offset from `p` and `(u,v)` are the shift in pixel\n\n /// coords from the projected location of `p`. In other words, for a camera\n\n /// model `F(x)`, if `F(p) = (a,b)` and `F(p+o) = (a,b)\n\n /// + Ao = (a,b) + (u,v) = (a+u,b+v)`, this function returns `A`.\n\n pub fn linearize_at<STORAGE>(&self, p: &Points<WorldFrame, R, U1, STORAGE>) -> SMatrix<R, 2, 3>\n\n where\n\n STORAGE: Storage<R, U1, U3>,\n\n {\n\n let pt3d = &p.data;\n","file_path":"src/linearize.rs","rank":78,"score":27.80528684431472},{"content":"/// [`PerspectiveParams`](struct.PerspectiveParams.html) by using `.into()`.\n\n#[derive(Clone, PartialEq)]\n\n#[cfg_attr(feature = \"serde-serialize\", derive(Serialize))]\n\npub struct IntrinsicParametersPerspective<R: RealField> {\n\n params: PerspectiveParams<R>,\n\n #[cfg_attr(feature = \"serde-serialize\", serde(skip))]\n\n pub(crate) cache_p: SMatrix<R, 3, 4>,\n\n}\n\n\n\nimpl<R: RealField> IntrinsicParametersPerspective<R> {\n\n /// Create a new instance given an intrinsic parameter matrix.\n\n ///\n\n /// Returns an error if the intrinsic parameter matrix is not normalized or\n\n /// otherwise does not represent a perspective camera model.\n\n pub fn from_normalized_3x4_matrix(p: SMatrix<R, 3, 4>) -> std::result::Result<Self, Error> {\n\n let params: PerspectiveParams<R> = PerspectiveParams {\n\n fx: p[(0, 0)].clone(),\n\n fy: p[(1, 1)].clone(),\n\n skew: p[(0, 1)].clone(),\n\n cx: p[(0, 2)].clone(),\n","file_path":"src/intrinsics_perspective.rs","rank":80,"score":27.532207090466635},{"content":"{\n\n /// Create a new RayBundle instance in which all rays share +z direction.\n\n ///\n\n /// The number of points allocated is given by the `npts` parameter, which\n\n /// should agree with the `NPTS` type. The coordinate system is given by the\n\n /// `Coords` type.\n\n pub fn new_shared_plusz_direction(data: Matrix<R, NPTS, U3, StorageMultiple>) -> Self {\n\n let bundle_type =\n\n crate::ray_bundle_types::SharedDirectionRayBundle::new_plusz_shared_direction();\n\n Self::new(bundle_type, data)\n\n }\n\n}\n\n\n\nimpl<Coords, BType, R, NPTS, StorageMultiple> RayBundle<Coords, BType, R, NPTS, StorageMultiple>\n\nwhere\n\n Coords: CoordinateSystem,\n\n BType: Bundle<R>,\n\n R: RealField,\n\n NPTS: Dim,\n\n StorageMultiple: Storage<R, NPTS, U3>,\n","file_path":"src/lib.rs","rank":81,"score":26.810483928153676},{"content":"## Testing\n\n\n\n### Unit tests\n\n\n\nTo run the basic unit tests:\n\n\n\n```\n\ncargo test\n\n```\n\n\n\nTo run all unit tests:\n\n\n\n```\n\ncargo test --features serde-serialize\n\n```\n\n\n\n### Test for `no_std`\n\n\n\nSince the `thumbv7em-none-eabihf` target does not have `std` available, we\n\ncan build for it to check that our crate does not inadvertently pull in\n\nstd. The unit tests require std, so cannot be run on a `no_std` platform.\n\nThe following will fail if a std dependency is present:\n\n\n\n```\n\n# install target with: \"rustup target add thumbv7em-none-eabihf\"\n\ncargo build --no-default-features --target thumbv7em-none-eabihf\n\n```\n\n\n\n## Examples\n\n\n\n### Example - projecting 3D world coordinates to 2D pixel coordinates.\n\n\n\n```rust\n\nuse cam_geom::*;\n\nuse nalgebra::{Matrix2x3, Unit, Vector3};\n\n\n\n// Create two points in the world coordinate frame.\n\nlet world_coords = Points::new(Matrix2x3::new(\n\n 1.0, 0.0, 0.0, // point 1\n\n 0.0, 1.0, 0.0, // point 2\n\n));\n\n\n\n// perepective parameters - focal length of 100, no skew, pixel center at (640,480)\n\nlet intrinsics = IntrinsicParametersPerspective::from(PerspectiveParams {\n\n fx: 100.0,\n\n fy: 100.0,\n\n skew: 0.0,\n\n cx: 640.0,\n\n cy: 480.0,\n\n});\n\n\n\n// Set extrinsic parameters - camera at (10,0,0), looing at (0,0,0), up (0,0,1)\n\nlet camcenter = Vector3::new(10.0, 0.0, 0.0);\n\nlet lookat = Vector3::new(0.0, 0.0, 0.0);\n\nlet up = Unit::new_normalize(Vector3::new(0.0, 0.0, 1.0));\n\nlet pose = ExtrinsicParameters::from_view(&camcenter, &lookat, &up);\n\n\n\n// Create a `Camera` with both intrinsic and extrinsic parameters.\n\nlet camera = Camera::new(intrinsics, pose);\n\n\n\n// Project the original 3D coordinates to 2D pixel coordinates.\n\nlet pixel_coords = camera.world_to_pixel(&world_coords);\n\n\n\n// Print the results.\n\nfor i in 0..world_coords.data.nrows() {\n\n let wc = world_coords.data.row(i);\n\n let pix = pixel_coords.data.row(i);\n\n println!(\"{} -> {}\", wc, pix);\n\n}\n\n```\n\n\n\nThis will print:\n\n\n\n```\n\n ┌ ┐\n\n │ 1 0 0 │\n\n └ ┘\n\n\n\n ->\n\n ┌ ┐\n\n │ 640 480 │\n\n └ ┘\n\n\n\n\n\n\n\n ┌ ┐\n\n │ 0 1 0 │\n\n └ ┘\n\n\n\n ->\n\n ┌ ┐\n\n │ 650 480 │\n\n └ ┘\n\n```\n\n\n\n\n","file_path":"README.md","rank":82,"score":25.755761032683992},{"content":"/// let params = PerspectiveParams {\n\n/// fx: 100.0,\n\n/// fy: 100.0,\n\n/// skew: 0.0,\n\n/// cx: 640.0,\n\n/// cy: 480.0,\n\n/// };\n\n/// let intrinsics: IntrinsicParametersPerspective<_> = params.into();\n\n/// ```\n\n#[derive(Debug, Clone, PartialEq)]\n\n#[cfg_attr(feature = \"serde-serialize\", derive(Serialize, Deserialize))]\n\npub struct PerspectiveParams<R: RealField> {\n\n /// Horizontal focal length.\n\n pub fx: R,\n\n /// Vertical focal length.\n\n pub fy: R,\n\n /// Skew between horizontal and vertical axes.\n\n pub skew: R,\n\n /// Horizontal component of the principal point.\n\n pub cx: R,\n","file_path":"src/intrinsics_perspective.rs","rank":83,"score":25.57735879071031},{"content":" where\n\n DefaultAllocator: Allocator<R, NPTS, U3>,\n\n {\n\n self.bundle_type.point_on_ray(&self.data)\n\n }\n\n\n\n /// get a 3D point on the ray at a defined distance from the origin(s)\n\n #[inline]\n\n pub fn point_on_ray_at_distance(\n\n &self,\n\n distance: R,\n\n ) -> Points<Coords, R, NPTS, Owned<R, NPTS, U3>>\n\n where\n\n DefaultAllocator: Allocator<R, NPTS, U3>,\n\n {\n\n self.bundle_type\n\n .point_on_ray_at_distance(&self.data, distance)\n\n }\n\n\n\n #[inline]\n","file_path":"src/lib.rs","rank":84,"score":25.380549224719346},{"content":" self.params.cy.clone()\n\n }\n\n\n\n /// Create a 3x3 projection matrix.\n\n #[inline]\n\n pub(crate) fn as_intrinsics_matrix(\n\n &self,\n\n ) -> Matrix<R, U3, U3, SliceStorage<'_, R, U3, U3, U1, U3>> {\n\n // TODO: implement similar functionality for orthographic camera and\n\n // make a new trait which exposes this functionality. Note that not all\n\n // intrinsic parameter implementations will be able to implement this\n\n // hypothetical new trait, because not all cameras are linear.\n\n self.cache_p.fixed_slice::<3, 3>(0, 0)\n\n }\n\n}\n\n\n\nimpl<R> IntrinsicParameters<R> for IntrinsicParametersPerspective<R>\n\nwhere\n\n R: RealField,\n\n{\n","file_path":"src/intrinsics_perspective.rs","rank":85,"score":24.883178561565146},{"content":" let cam_dir = &mut result.data;\n\n\n\n // It seems broadcasting is not (yet) supported in nalgebra, so we loop\n\n // through the data. See\n\n // https://discourse.nphysics.org/t/array-broadcasting-support/375/3 .\n\n\n\n for i in 0..pixels.data.nrows() {\n\n let u = pixels.data[(i, 0)].clone();\n\n let v = pixels.data[(i, 1)].clone();\n\n\n\n // point in camcoords at distance 1.0 from image plane\n\n let y = (v - self.params.cy.clone()) / self.params.fy.clone();\n\n cam_dir[(i, 0)] = (u - self.params.skew.clone() * y.clone() - self.params.cx.clone())\n\n / self.params.fx.clone(); // x\n\n cam_dir[(i, 1)] = y;\n\n cam_dir[(i, 2)] = one.clone(); // z\n\n }\n\n result\n\n }\n\n\n","file_path":"src/intrinsics_perspective.rs","rank":86,"score":24.82773694544442},{"content":" cam_coords: &Points<CameraFrame, R, NPTS, InStorage>,\n\n ) -> Points<WorldFrame, R, NPTS, Owned<R, NPTS, U3>>\n\n where\n\n NPTS: Dim,\n\n InStorage: Storage<R, NPTS, U3>,\n\n DefaultAllocator: Allocator<R, NPTS, U3>,\n\n {\n\n let mut world = Points::new(OMatrix::zeros_generic(\n\n NPTS::from_usize(cam_coords.data.nrows()),\n\n U3::from_usize(3),\n\n ));\n\n\n\n // Potential optimization: remove for loops\n\n let in_mult = &cam_coords.data;\n\n let out_mult = &mut world.data;\n\n\n\n for i in 0..in_mult.nrows() {\n\n let tmp = self.cache.pose_inv.transform_point(&Point3::new(\n\n in_mult[(i, 0)].clone(),\n\n in_mult[(i, 1)].clone(),\n","file_path":"src/extrinsics.rs","rank":87,"score":24.63546639919511},{"content":" }\n\n\n\n if approx::relative_ne!(p[(2, 2)], nalgebra::convert(1.0)) {\n\n return Err(Error::InvalidInput); // camera matrix must be normalized\n\n }\n\n\n\n if approx::relative_ne!(p[(2, 3)], nalgebra::convert(0.0)) {\n\n return Err(Error::InvalidInput);\n\n }\n\n\n\n Ok(params.into())\n\n }\n\n\n\n /// Get X focal length\n\n #[inline]\n\n pub fn fx(&self) -> R {\n\n self.params.fx.clone()\n\n }\n\n\n\n /// Get Y focal length\n","file_path":"src/intrinsics_perspective.rs","rank":88,"score":24.402419456233815},{"content":"mod intrinsics_perspective;\n\npub use intrinsics_perspective::{IntrinsicParametersPerspective, PerspectiveParams};\n\n\n\nmod intrinsics_orthographic;\n\npub use intrinsics_orthographic::{IntrinsicParametersOrthographic, OrthographicParams};\n\n\n\nmod extrinsics;\n\npub use extrinsics::ExtrinsicParameters;\n\n\n\nmod camera;\n\npub use camera::Camera;\n\n\n\n/// Defines the different possible types of ray bundles.\n\npub mod ray_bundle_types;\n\n\n\nmod ray_intersection;\n\npub use ray_intersection::best_intersection_of_rays;\n\n\n\npub mod linearize;\n\n\n","file_path":"src/lib.rs","rank":90,"score":23.53548608496405},{"content":" );\n\n\n\n let from_params = Camera::new(cam, extrinsics);\n\n result.push((\"from-params\".into(), from_params));\n\n\n\n // in the future - more cameras\n\n\n\n result\n\n }\n\n\n\n #[test]\n\n #[cfg(feature = \"serde-serialize\")]\n\n fn test_serde() {\n\n let params = PerspectiveParams {\n\n fx: 100.0,\n\n fy: 102.0,\n\n skew: 0.1,\n\n cx: 321.0,\n\n cy: 239.9,\n\n };\n","file_path":"src/intrinsics_perspective.rs","rank":91,"score":23.250285383354317},{"content":"#![deny(unsafe_code, missing_docs)]\n\n\n\nuse nalgebra as na;\n\n\n\nuse na::{\n\n allocator::Allocator, base::storage::Owned, DefaultAllocator, Dim, Dynamic, Matrix3, OMatrix,\n\n RealField, SMatrix, Vector3, U1, U3,\n\n};\n\n\n\nuse itertools::izip;\n\n\n\nuse crate::{CoordinateSystem, Error, Points, Ray};\n\n\n\n/// Iter::Sum is not implemented for R.\n\nmacro_rules! sum_as_f64 {\n\n ($iter:expr,$R:ty) => {{\n\n $iter\n\n .map(|x| na::try_convert::<$R, f64>(x.clone()).unwrap())\n\n .sum()\n\n }};\n","file_path":"src/ray_intersection.rs","rank":92,"score":23.23541401194915},{"content":"\n\n fn get_test_cameras() -> Vec<(String, Camera<f64, IntrinsicParametersPerspective<f64>>)> {\n\n let mut result = Vec::new();\n\n\n\n // camera 1 - from perspective parameters\n\n let params = PerspectiveParams {\n\n fx: 100.0,\n\n fy: 102.0,\n\n skew: 0.1,\n\n cx: 321.0,\n\n cy: 239.9,\n\n };\n\n\n\n let cam: IntrinsicParametersPerspective<_> = params.into();\n\n roundtrip_intrinsics(&cam, 640, 480, 5, 0, nalgebra::convert(1e-10));\n\n\n\n let extrinsics = ExtrinsicParameters::from_view(\n\n &Vector3::new(1.2, 3.4, 5.6), // camcenter\n\n &Vector3::new(2.2, 3.4, 5.6), // lookat\n\n &nalgebra::Unit::new_normalize(Vector3::new(0.0, 0.0, 1.0)), // up\n","file_path":"src/intrinsics_perspective.rs","rank":93,"score":23.22266495132496},{"content":"//! Linearize camera models by computing the Jacobian matrix.\n\n\n\nuse crate::{Camera, IntrinsicParametersPerspective, Points, WorldFrame};\n\nuse nalgebra::{storage::Storage, RealField, SMatrix, U1, U3};\n\n\n\n/// Required data required for finding Jacobian of perspective camera models.\n\n///\n\n/// Create this with the [`new()`](struct.JacobianPerspectiveCache.html#method.new) method.\n\npub struct JacobianPerspectiveCache<R: RealField> {\n\n m: SMatrix<R, 3, 4>,\n\n}\n\n\n\nimpl<R: RealField> JacobianPerspectiveCache<R> {\n\n /// Create a new `JacobianPerspectiveCache` from a `Camera` with a perspective model.\n\n pub fn new(cam: &Camera<R, IntrinsicParametersPerspective<R>>) -> Self {\n\n let m = {\n\n let p33 = cam.intrinsics().as_intrinsics_matrix();\n\n p33 * cam.extrinsics().matrix()\n\n };\n\n\n","file_path":"src/linearize.rs","rank":94,"score":23.11128427585163},{"content":" DefaultAllocator: Allocator<R, NPTS, U3>,\n\n{\n\n /// get directions of each ray in bundle\n\n #[inline]\n\n pub fn directions(&self) -> Matrix<R, NPTS, U3, Owned<R, NPTS, U3>> {\n\n self.bundle_type.directions(&self.data)\n\n }\n\n\n\n /// get centers (origins) of each ray in bundle\n\n #[inline]\n\n pub fn centers(&self) -> Matrix<R, NPTS, U3, Owned<R, NPTS, U3>> {\n\n self.bundle_type.centers(&self.data)\n\n }\n\n}\n\n\n\nimpl<Coords, BType, R> RayBundle<Coords, BType, R, U1, Owned<R, U1, U3>>\n\nwhere\n\n Coords: CoordinateSystem,\n\n BType: Bundle<R>,\n\n R: RealField,\n","file_path":"src/lib.rs","rank":95,"score":23.1032511135329},{"content":"where\n\n Coords: CoordinateSystem,\n\n BType: Bundle<R>,\n\n R: RealField,\n\n NPTS: Dim,\n\n StorageMultiple: Storage<R, NPTS, U3>,\n\n{\n\n coords: std::marker::PhantomData<Coords>,\n\n /// The matrix storing the ray data.\n\n pub data: Matrix<R, NPTS, U3, StorageMultiple>,\n\n bundle_type: BType,\n\n}\n\n\n\nimpl<Coords, BType, R, NPTS, StorageMultiple> RayBundle<Coords, BType, R, NPTS, StorageMultiple>\n\nwhere\n\n Coords: CoordinateSystem,\n\n BType: Bundle<R>,\n\n R: RealField,\n\n NPTS: DimName,\n\n StorageMultiple: Storage<R, NPTS, U3>,\n","file_path":"src/lib.rs","rank":96,"score":22.929327902789414},{"content":"\n\n fn roundtrip_generic<R: RealField>(epsilon: R) {\n\n let zero: R = convert(0.0);\n\n let one: R = convert(1.0);\n\n\n\n let e1 = ExtrinsicParameters::<R>::from_view(\n\n &Vector3::new(c(1.2), c(3.4), c(5.6)), // camcenter\n\n &Vector3::new(c(2.2), c(3.4), c(5.6)), // lookat\n\n &nalgebra::Unit::new_normalize(Vector3::new(zero.clone(), zero.clone(), one.clone())), // up\n\n );\n\n\n\n #[rustfmt::skip]\n\n let cam_coords = Points {\n\n coords: std::marker::PhantomData,\n\n data: SMatrix::<R, 4, 3>::new(\n\n zero.clone(), zero.clone(), zero.clone(), // at camera center\n\n zero.clone(), zero.clone(), one.clone(), // one unit in +Z - exactly in camera direction\n\n one.clone(), zero.clone(), zero.clone(), // one unit in +X - right of camera axis\n\n zero.clone(), one.clone(), zero.clone(), // one unit in +Y - down from camera axis\n\n ),\n","file_path":"src/extrinsics.rs","rank":97,"score":22.421653754135733},{"content":" }\n\n\n\n /// Return a unit vector aligned along our right (+X) direction.\n\n pub fn right(&self) -> Unit<Vector3<R>> {\n\n let pt_cam = Point3::new(R::one(), R::zero(), R::zero());\n\n self.lookdir(&pt_cam)\n\n }\n\n\n\n /// Return a world coords unit vector aligned along the given direction\n\n ///\n\n /// `pt_cam` is specified in camera coords.\n\n fn lookdir(&self, pt_cam: &Point3<R>) -> Unit<Vector3<R>> {\n\n let cc = self.camcenter();\n\n let pt = self.cache.pose_inv.transform_point(&pt_cam) - cc;\n\n nalgebra::Unit::new_normalize(pt)\n\n }\n\n\n\n /// Convert points in camera coordinates to world coordinates.\n\n pub fn camera_to_world<NPTS, InStorage>(\n\n &self,\n","file_path":"src/extrinsics.rs","rank":98,"score":22.183906081320956},{"content":" /// can be arbitrary.\n\n fn point_on_ray<NPTS, StorageIn, OutFrame>(\n\n &self,\n\n self_data: &Matrix<R, NPTS, U3, StorageIn>,\n\n ) -> Points<OutFrame, R, NPTS, Owned<R, NPTS, U3>>\n\n where\n\n Self: Sized,\n\n NPTS: Dim,\n\n StorageIn: Storage<R, NPTS, U3>,\n\n OutFrame: CoordinateSystem,\n\n DefaultAllocator: Allocator<R, NPTS, U3>;\n\n\n\n /// Return points on on the input rays at a defined distance from the origin(s).\n\n fn point_on_ray_at_distance<NPTS, StorageIn, OutFrame>(\n\n &self,\n\n self_data: &Matrix<R, NPTS, U3, StorageIn>,\n\n distance: R,\n\n ) -> Points<OutFrame, R, NPTS, Owned<R, NPTS, U3>>\n\n where\n\n Self: Sized,\n","file_path":"src/lib.rs","rank":99,"score":21.99919840424277}],"string":"[\n {\n \"content\": \"#[cfg(test)]\\n\\npub fn roundtrip_camera<R, I>(\\n\\n cam: Camera<R, I>,\\n\\n width: usize,\\n\\n height: usize,\\n\\n step: usize,\\n\\n border: usize,\\n\\n eps: R,\\n\\n) where\\n\\n R: RealField,\\n\\n I: IntrinsicParameters<R>,\\n\\n I::BundleType: Bundle<R>,\\n\\n{\\n\\n let pixels = crate::intrinsic_test_utils::generate_uv_raw(width, height, step, border);\\n\\n\\n\\n let world_coords = cam.pixel_to_world(&pixels);\\n\\n let world_coords_points = world_coords.point_on_ray();\\n\\n\\n\\n // project back to pixel coordinates\\n\\n let pixel_actual = cam.world_to_pixel(&world_coords_points);\\n\\n approx::assert_abs_diff_eq!(pixels.data, pixel_actual.data, epsilon = convert(eps));\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/camera.rs\",\n \"rank\": 0,\n \"score\": 136172.98602122226\n },\n {\n \"content\": \"// Calculate angle of quaternion\\n\\n///\\n\\n/// This is the implementation from prior to\\n\\n/// https://github.com/rustsim/nalgebra/commit/74aefd9c23dadd12ee654c7d0206b0a96d22040c\\n\\nfn my_quat_angle<R: RealField>(quat: &nalgebra::UnitQuaternion<R>) -> R {\\n\\n let w = quat.quaternion().scalar().abs();\\n\\n\\n\\n // Handle inaccuracies that make break `.acos`.\\n\\n if w >= R::one() {\\n\\n R::zero()\\n\\n } else {\\n\\n w.acos() * convert(2.0f64)\\n\\n }\\n\\n}\\n\\n\\n\\n#[cfg(test)]\\n\\nmod tests {\\n\\n #[test]\\n\\n #[cfg(feature = \\\"serde-serialize\\\")]\\n\\n fn test_serde() {\\n\\n use nalgebra::{Unit, Vector3};\\n\\n\\n\\n use super::PerspectiveParams;\\n\\n use crate::{Camera, ExtrinsicParameters, IntrinsicParametersPerspective};\\n\",\n \"file_path\": \"src/camera.rs\",\n \"rank\": 1,\n \"score\": 122426.87178791224\n },\n {\n \"content\": \"/// Test roundtrip projection from pixels to camera rays for an intrinsic camera model.\\n\\n///\\n\\n/// Generate pixel coordinates, project them to rays, convert to points on the\\n\\n/// rays, convert the points back to pixels, and then compare with the original\\n\\n/// pixel coordinates.\\n\\npub fn roundtrip_intrinsics<R, CAM>(\\n\\n cam: &CAM,\\n\\n width: usize,\\n\\n height: usize,\\n\\n step: usize,\\n\\n border: usize,\\n\\n eps: R,\\n\\n) where\\n\\n R: RealField,\\n\\n CAM: IntrinsicParameters<R>,\\n\\n CAM::BundleType: Bundle<R>,\\n\\n{\\n\\n let pixels = generate_uv_raw(width, height, step, border);\\n\\n\\n\\n let camcoords = cam.pixel_to_camera(&pixels);\\n\\n let camera_coords_points = camcoords.point_on_ray();\\n\\n\\n\\n // project back to pixel coordinates\\n\\n let pixel_actual = cam.camera_to_pixel(&camera_coords_points);\\n\\n approx::assert_abs_diff_eq!(pixels.data, pixel_actual.data, epsilon = convert(eps));\\n\\n}\\n\",\n \"file_path\": \"src/intrinsic_test_utils.rs\",\n \"rank\": 2,\n \"score\": 115458.93551733317\n },\n {\n \"content\": \"#[allow(clippy::many_single_char_names)]\\n\\nfn pmat2cam_center<R, S>(p: &Matrix<R, U3, U4, S>) -> Point3<R>\\n\\nwhere\\n\\n R: RealField,\\n\\n S: Storage<R, U3, U4> + Clone,\\n\\n{\\n\\n let x = p.clone().remove_column(0).determinant();\\n\\n let y = -p.clone().remove_column(1).determinant();\\n\\n let z = p.clone().remove_column(2).determinant();\\n\\n let w = -p.clone().remove_column(3).determinant();\\n\\n Point3::from(Vector3::new(x / w.clone(), y / w.clone(), z / w))\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/camera.rs\",\n \"rank\": 3,\n \"score\": 108975.94157834267\n },\n {\n \"content\": \"/// perform RQ decomposition and return results as right-handed quaternion and intrinsics matrix\\n\\nfn rq_decomposition<R: RealField>(\\n\\n orig: Matrix3<R>,\\n\\n) -> Result<(UnitQuaternion<R>, Matrix3<R>), Error> {\\n\\n let (mut intrin, mut q) = rq(orig);\\n\\n let zero: R = convert(0.0);\\n\\n for i in 0..3 {\\n\\n if intrin[(i, i)] < zero {\\n\\n for j in 0..3 {\\n\\n intrin[(j, i)] = -intrin[(j, i)].clone();\\n\\n q[(i, j)] = -q[(i, j)].clone();\\n\\n }\\n\\n }\\n\\n }\\n\\n\\n\\n match right_handed_rotation_quat_new(&q) {\\n\\n Ok(rquat) => Ok((rquat, intrin)),\\n\\n Err(error) => {\\n\\n match error {\\n\\n Error::InvalidRotationMatrix => {\\n\\n // convert left-handed rotation to right-handed rotation\\n\",\n \"file_path\": \"src/camera.rs\",\n \"rank\": 4,\n \"score\": 105463.62763693056\n },\n {\n \"content\": \"#[allow(non_snake_case)]\\n\\nfn rq<R: RealField>(A: Matrix3<R>) -> (Matrix3<R>, Matrix3<R>) {\\n\\n let zero: R = convert(0.0);\\n\\n let one: R = convert(1.0);\\n\\n\\n\\n // see https://math.stackexchange.com/a/1640762\\n\\n #[rustfmt::skip]\\n\\n let P = Matrix3::<R>::new(\\n\\n zero.clone(), zero.clone(), one.clone(), // row 1\\n\\n zero.clone(), one.clone(), zero.clone(), // row 2\\n\\n one, zero.clone(), zero, // row 3\\n\\n );\\n\\n let Atilde = P.clone() * A;\\n\\n\\n\\n let (Qtilde, Rtilde) = {\\n\\n let qrm = nalgebra::linalg::QR::new(Atilde.transpose());\\n\\n (qrm.q(), qrm.r())\\n\\n };\\n\\n let Q = P.clone() * Qtilde.transpose();\\n\\n let R = P.clone() * Rtilde.transpose() * P;\\n\\n (R, Q)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/camera.rs\",\n \"rank\": 5,\n \"score\": 101123.39700944631\n },\n {\n \"content\": \"/// Specifies operations which any RayBundle must implement.\\n\\npub trait Bundle<R>\\n\\nwhere\\n\\n R: RealField,\\n\\n{\\n\\n /// Return a single ray from a `RayBundle` with exactly one ray.\\n\\n fn to_single_ray<Coords>(&self, self_data: &SMatrix<R, 1, 3>) -> Ray<Coords, R>\\n\\n where\\n\\n Coords: CoordinateSystem;\\n\\n\\n\\n /// Get directions of each ray in bundle.\\n\\n ///\\n\\n /// This can be inefficient, because when not every ray has a different\\n\\n /// direction (which is the case for the `SharedDirectionRayBundle` type),\\n\\n /// this will nevertheless copy the single direction `NPTS` times.\\n\\n fn directions<NPTS, StorageIn>(\\n\\n &self,\\n\\n self_data: &Matrix<R, NPTS, U3, StorageIn>,\\n\\n ) -> Matrix<R, NPTS, U3, Owned<R, NPTS, U3>>\\n\\n where\\n\\n NPTS: DimName,\\n\",\n \"file_path\": \"src/lib.rs\",\n \"rank\": 6,\n \"score\": 100532.62165853298\n },\n {\n \"content\": \"/// convert a 3x3 matrix into a valid right-handed rotation\\n\\nfn right_handed_rotation_quat_new<R: RealField>(\\n\\n orig: &Matrix3<R>,\\n\\n) -> Result<UnitQuaternion<R>, Error> {\\n\\n let r1 = orig.clone();\\n\\n let rotmat = Rotation3::from_matrix_unchecked(r1);\\n\\n let rquat = UnitQuaternion::from_rotation_matrix(&rotmat);\\n\\n if !is_right_handed_rotation_quat(&rquat) {\\n\\n return Err(Error::InvalidRotationMatrix);\\n\\n }\\n\\n Ok(rquat)\\n\\n}\\n\\n\\n\\n/// Check for valid right-handed rotation.\\n\\n///\\n\\n/// Converts quaternion to rotation matrix and back again to quat then comparing\\n\\n/// quats. Probably there is a much faster and better way.\\n\\npub(crate) fn is_right_handed_rotation_quat<R: RealField>(rquat: &UnitQuaternion<R>) -> bool {\\n\\n let rotmat2 = rquat.clone().to_rotation_matrix();\\n\\n let rquat2 = UnitQuaternion::from_rotation_matrix(&rotmat2);\\n\\n let delta = rquat.rotation_to(&rquat2);\\n\\n let angle = my_quat_angle(&delta);\\n\\n let epsilon = R::default_epsilon() * convert(1e5);\\n\\n angle.abs() <= epsilon\\n\\n}\\n\\n\\n\\n/// get the camera center from a 3x4 camera projection matrix\\n\",\n \"file_path\": \"src/camera.rs\",\n \"rank\": 7,\n \"score\": 97042.40713319693\n },\n {\n \"content\": \"#[allow(non_snake_case)]\\n\\npub fn best_intersection_of_rays<Coords, R>(\\n\\n rays: &[Ray<Coords, R>],\\n\\n) -> Result<SinglePoint<Coords, R>, Error>\\n\\nwhere\\n\\n Coords: CoordinateSystem,\\n\\n R: RealField,\\n\\n DefaultAllocator: Allocator<R, Dynamic, U3>,\\n\\n DefaultAllocator: Allocator<R, U1, Dynamic>,\\n\\n DefaultAllocator: Allocator<R, U1, U3>,\\n\\n{\\n\\n if rays.len() < 2 {\\n\\n return Err(Error::MinimumTwoRaysNeeded);\\n\\n }\\n\\n\\n\\n let npts = Dynamic::new(rays.len());\\n\\n let u1 = U1::from_usize(1);\\n\\n let u3 = U3::from_usize(3);\\n\\n\\n\\n let mut line_dirs = OMatrix::<R, Dynamic, U3>::zeros_generic(npts, u3);\\n\\n let mut line_points = OMatrix::<R, Dynamic, U3>::zeros_generic(npts, u3);\\n\",\n \"file_path\": \"src/ray_intersection.rs\",\n \"rank\": 8,\n \"score\": 95032.78494146772\n },\n {\n \"content\": \"#[cfg(feature = \\\"serde-serialize\\\")]\\n\\nfn _test_extrinsics_is_serialize() {\\n\\n // Compile-time test to ensure ExtrinsicParameters implements Serialize trait.\\n\\n fn implements<T: serde::Serialize>() {}\\n\\n implements::<ExtrinsicParameters<f64>>();\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/extrinsics.rs\",\n \"rank\": 9,\n \"score\": 91536.7480978276\n },\n {\n \"content\": \"#[cfg(feature = \\\"serde-serialize\\\")]\\n\\nfn _test_is_deserialize() {\\n\\n // Compile-time test to ensure IntrinsicParametersPerspective implements Deserialize trait.\\n\\n fn implements<'de, T: serde::Deserialize<'de>>() {}\\n\\n implements::<IntrinsicParametersPerspective<f64>>();\\n\\n}\\n\\n\\n\\n#[cfg(test)]\\n\\nmod tests {\\n\\n use nalgebra::{SMatrix, Vector3};\\n\\n\\n\\n use super::{IntrinsicParametersPerspective, PerspectiveParams};\\n\\n use crate::camera::{roundtrip_camera, Camera};\\n\\n use crate::extrinsics::ExtrinsicParameters;\\n\\n use crate::intrinsic_test_utils::roundtrip_intrinsics;\\n\\n use crate::Points;\\n\\n\\n\\n #[test]\\n\\n fn roundtrip() {\\n\\n let params = PerspectiveParams {\\n\\n fx: 100.0,\\n\",\n \"file_path\": \"src/intrinsics_perspective.rs\",\n \"rank\": 10,\n \"score\": 91536.7480978276\n },\n {\n \"content\": \"#[cfg(feature = \\\"serde-serialize\\\")]\\n\\nfn _test_extrinsics_is_deserialize() {\\n\\n // Compile-time test to ensure ExtrinsicParameters implements Deserialize trait.\\n\\n fn implements<'de, T: serde::Deserialize<'de>>() {}\\n\\n implements::<ExtrinsicParameters<f64>>();\\n\\n}\\n\\n\\n\\n#[cfg(test)]\\n\\nmod tests {\\n\\n use super::*;\\n\\n use nalgebra::convert as c;\\n\\n\\n\\n #[test]\\n\\n fn roundtrip_f64() {\\n\\n roundtrip_generic::<f64>(1e-10)\\n\\n }\\n\\n\\n\\n #[test]\\n\\n fn roundtrip_f32() {\\n\\n roundtrip_generic::<f32>(1e-5)\\n\\n }\\n\",\n \"file_path\": \"src/extrinsics.rs\",\n \"rank\": 11,\n \"score\": 91536.7480978276\n },\n {\n \"content\": \"#[cfg(feature = \\\"serde-serialize\\\")]\\n\\nfn _test_is_serialize() {\\n\\n // Compile-time test to ensure IntrinsicParametersPerspective implements Serialize trait.\\n\\n fn implements<T: serde::Serialize>() {}\\n\\n implements::<IntrinsicParametersPerspective<f64>>();\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/intrinsics_perspective.rs\",\n \"rank\": 12,\n \"score\": 91536.7480978276\n },\n {\n \"content\": \"fn my_pinv<R: RealField>(m: &SMatrix<R, 3, 3>) -> Result<SMatrix<R, 3, 3>, Error> {\\n\\n Ok(\\n\\n na::linalg::SVD::try_new(m.clone(), true, true, na::convert(1e-7), 100)\\n\\n .ok_or(Error::SvdFailed)?\\n\\n .pseudo_inverse(na::convert(1.0e-7))\\n\\n .unwrap(),\\n\\n )\\n\\n // The unwrap() above is safe because, as of nalgebra 0.19, this could only error if the SVD has not been computed.\\n\\n // But this is not possible here, so the unwrap() should never result in a panic.\\n\\n}\\n\\n\\n\\n#[cfg(test)]\\n\\nmod tests {\\n\\n use nalgebra::Vector3;\\n\\n\\n\\n use crate::{Camera, ExtrinsicParameters, IntrinsicParametersPerspective, PerspectiveParams};\\n\\n\\n\\n use super::*;\\n\\n\\n\\n #[test]\\n\",\n \"file_path\": \"src/ray_intersection.rs\",\n \"rank\": 13,\n \"score\": 89463.55211542993\n },\n {\n \"content\": \"/// A geometric model of camera coordinates to pixels (and vice versa).\\n\\npub trait IntrinsicParameters<R>: std::fmt::Debug + Clone\\n\\nwhere\\n\\n R: RealField,\\n\\n{\\n\\n /// What type of ray bundle is returned when projecting pixels to rays.\\n\\n type BundleType;\\n\\n\\n\\n /// project pixels to camera coords\\n\\n fn pixel_to_camera<IN, NPTS>(\\n\\n &self,\\n\\n pixels: &Pixels<R, NPTS, IN>,\\n\\n ) -> RayBundle<coordinate_system::CameraFrame, Self::BundleType, R, NPTS, Owned<R, NPTS, U3>>\\n\\n where\\n\\n Self::BundleType: Bundle<R>,\\n\\n IN: Storage<R, NPTS, U2>,\\n\\n NPTS: Dim,\\n\\n DefaultAllocator: Allocator<R, U1, U2>, // needed to make life easy for implementors\\n\\n DefaultAllocator: Allocator<R, NPTS, U2>, // needed to make life easy for implementors\\n\\n DefaultAllocator: Allocator<R, NPTS, U3>;\\n\\n\\n\",\n \"file_path\": \"src/lib.rs\",\n \"rank\": 14,\n \"score\": 84438.46753649716\n },\n {\n \"content\": \"#[test]\\n\\nfn test_jacobian_perspective() {\\n\\n use nalgebra::{OMatrix, RowVector2, RowVector3, Unit, Vector3};\\n\\n\\n\\n use super::*;\\n\\n use crate::{Camera, ExtrinsicParameters, IntrinsicParametersPerspective};\\n\\n\\n\\n // create a perspective camera\\n\\n let params = PerspectiveParams {\\n\\n fx: 100.0,\\n\\n fy: 102.0,\\n\\n skew: 0.1,\\n\\n cx: 321.0,\\n\\n cy: 239.9,\\n\\n };\\n\\n\\n\\n let intrinsics: IntrinsicParametersPerspective<_> = params.into();\\n\\n\\n\\n let camcenter = Vector3::new(10.0, 0.0, 10.0);\\n\\n let lookat = Vector3::new(0.0, 0.0, 0.0);\\n\\n let up = Unit::new_normalize(Vector3::new(0.0, 0.0, 1.0));\\n\",\n \"file_path\": \"src/linearize.rs\",\n \"rank\": 15,\n \"score\": 66591.21310308106\n },\n {\n \"content\": \"fn main() -> Result<(), std::io::Error> {\\n\\n // Create cube vertices in the world coordinate frame.\\n\\n let world_coords = Points::<WorldFrame, _, _, _>::new(SMatrix::<f64, 8, 3>::from_row_slice(&[\\n\\n -1.0, -1.0, -1.0, // v1\\n\\n 1.0, -1.0, -1.0, // v2\\n\\n 1.0, 1.0, -1.0, // v3\\n\\n -1.0, 1.0, -1.0, // v4\\n\\n -1.0, -1.0, 1.0, // v5\\n\\n 1.0, -1.0, 1.0, // v6\\n\\n 1.0, 1.0, 1.0, // v7\\n\\n -1.0, 1.0, 1.0, // v8\\n\\n ]));\\n\\n let edges = [\\n\\n (0, 1),\\n\\n (1, 2),\\n\\n (2, 3),\\n\\n (3, 0),\\n\\n (4, 5),\\n\\n (5, 6),\\n\\n (6, 7),\\n\",\n \"file_path\": \"examples/render-cube.rs\",\n \"rank\": 16,\n \"score\": 62875.40159167157\n },\n {\n \"content\": \"/// Create an orthographic camera.\\n\\nfn get_ortho_cam() -> Camera<f64, IntrinsicParametersOrthographic<f64>> {\\n\\n let intrinsics = OrthographicParams {\\n\\n sx: 100.0,\\n\\n sy: 102.0,\\n\\n cx: 321.0,\\n\\n cy: 239.9,\\n\\n };\\n\\n\\n\\n // Set extrinsic parameters.\\n\\n let camcenter = Vector3::new(10.0, 3.0, 5.0);\\n\\n let lookat = Vector3::new(0.0, 0.0, 0.0);\\n\\n let up = Unit::new_normalize(Vector3::new(0.0, 0.0, 1.0));\\n\\n let pose = ExtrinsicParameters::from_view(&camcenter, &lookat, &up);\\n\\n\\n\\n // Create camera with both intrinsic and extrinsic parameters.\\n\\n Camera::new(intrinsics.into(), pose)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"examples/render-cube.rs\",\n \"rank\": 17,\n \"score\": 55875.500102336795\n },\n {\n \"content\": \"/// Create a perspective camera.\\n\\nfn get_perspective_cam() -> Camera<f64, IntrinsicParametersPerspective<f64>> {\\n\\n // Set intrinsic parameters\\n\\n let intrinsics = PerspectiveParams {\\n\\n fx: 100.0,\\n\\n fy: 100.0,\\n\\n skew: 0.0,\\n\\n cx: 640.0,\\n\\n cy: 480.0,\\n\\n };\\n\\n\\n\\n // Set extrinsic parameters.\\n\\n let camcenter = Vector3::new(10.0, 3.0, 5.0);\\n\\n let lookat = Vector3::new(0.0, 0.0, 0.0);\\n\\n let up = Unit::new_normalize(Vector3::new(0.0, 0.0, 1.0));\\n\\n let pose = ExtrinsicParameters::from_view(&camcenter, &lookat, &up);\\n\\n\\n\\n // Create camera with both intrinsic and extrinsic parameters.\\n\\n Camera::new(intrinsics.into(), pose)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"examples/render-cube.rs\",\n \"rank\": 18,\n \"score\": 55875.500102336795\n },\n {\n \"content\": \" result.data[(i, j)] =\\n\\n center[j].clone() + scale.clone() * directions[(i, j)].clone();\\n\\n }\\n\\n }\\n\\n result\\n\\n }\\n\\n\\n\\n fn to_pose<NPTS, StorageIn, OutFrame>(\\n\\n &self,\\n\\n pose: Isometry3<R>,\\n\\n self_data: &Matrix<R, NPTS, U3, StorageIn>,\\n\\n ) -> RayBundle<OutFrame, Self, R, NPTS, Owned<R, NPTS, U3>>\\n\\n where\\n\\n NPTS: Dim,\\n\\n StorageIn: Storage<R, NPTS, U3>,\\n\\n OutFrame: CoordinateSystem,\\n\\n DefaultAllocator: Allocator<R, NPTS, U3>,\\n\\n {\\n\\n let bundle_type = Self::new_shared_zero_origin();\\n\\n let mut reposed = RayBundle::new(\\n\",\n \"file_path\": \"src/ray_bundle_types.rs\",\n \"rank\": 19,\n \"score\": 51819.391084191746\n },\n {\n \"content\": \"use nalgebra::{OMatrix, SMatrix};\\n\\n\\n\\nuse crate::*;\\n\\n\\n\\n#[cfg(feature = \\\"serde-serialize\\\")]\\n\\nuse serde::{Deserialize, Serialize};\\n\\n\\n\\n/// A bundle of rays with the same arbitrary origin\\n\\n#[derive(Debug, Clone, PartialEq)]\\n\\n#[cfg_attr(feature = \\\"serde-serialize\\\", derive(Serialize, Deserialize))]\\n\\npub struct SharedOriginRayBundle<R: RealField> {\\n\\n center: Point3<R>,\\n\\n}\\n\\n\\n\\nimpl<R> SharedOriginRayBundle<R>\\n\\nwhere\\n\\n R: RealField,\\n\\n{\\n\\n /// Create a new SharedOriginRayBundle with origin (center) at zero.\\n\\n #[inline]\\n\",\n \"file_path\": \"src/ray_bundle_types.rs\",\n \"rank\": 20,\n \"score\": 51818.4778008362\n },\n {\n \"content\": \" pub fn new_shared_zero_origin() -> Self {\\n\\n // center is at (0,0,0)\\n\\n let zero: R = nalgebra::convert(0.0);\\n\\n Self {\\n\\n center: Point3::new(zero.clone(), zero.clone(), zero),\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\nimpl<R> Bundle<R> for SharedOriginRayBundle<R>\\n\\nwhere\\n\\n R: RealField,\\n\\n{\\n\\n #[inline]\\n\\n fn to_single_ray<Coords>(&self, self_data: &SMatrix<R, 1, 3>) -> Ray<Coords, R>\\n\\n where\\n\\n Coords: CoordinateSystem,\\n\\n {\\n\\n Ray {\\n\\n direction: self_data.clone(),\\n\",\n \"file_path\": \"src/ray_bundle_types.rs\",\n \"rank\": 21,\n \"score\": 51815.05730868795\n },\n {\n \"content\": \" for j in 0..3 {\\n\\n result[(i, j)] = self_data[(i, j)].clone();\\n\\n }\\n\\n }\\n\\n result\\n\\n }\\n\\n\\n\\n fn point_on_ray<NPTS, StorageIn, OutFrame>(\\n\\n &self,\\n\\n centers: &Matrix<R, NPTS, U3, StorageIn>,\\n\\n ) -> Points<OutFrame, R, NPTS, Owned<R, NPTS, U3>>\\n\\n where\\n\\n Self: Sized,\\n\\n NPTS: Dim,\\n\\n StorageIn: Storage<R, NPTS, U3>,\\n\\n OutFrame: CoordinateSystem,\\n\\n DefaultAllocator: Allocator<R, NPTS, U3>,\\n\\n {\\n\\n let mut result = Points::new(OMatrix::zeros_generic(\\n\\n NPTS::from_usize(centers.nrows()),\\n\",\n \"file_path\": \"src/ray_bundle_types.rs\",\n \"rank\": 22,\n \"score\": 51814.27521371419\n },\n {\n \"content\": \" result\\n\\n }\\n\\n\\n\\n fn point_on_ray<NPTS, StorageIn, OutFrame>(\\n\\n &self,\\n\\n directions: &Matrix<R, NPTS, U3, StorageIn>,\\n\\n ) -> Points<OutFrame, R, NPTS, Owned<R, NPTS, U3>>\\n\\n where\\n\\n Self: Sized,\\n\\n NPTS: Dim,\\n\\n StorageIn: Storage<R, NPTS, U3>,\\n\\n OutFrame: CoordinateSystem,\\n\\n DefaultAllocator: Allocator<R, NPTS, U3>,\\n\\n {\\n\\n let mut result = Points::new(OMatrix::zeros_generic(\\n\\n NPTS::from_usize(directions.nrows()),\\n\\n U3::from_usize(3),\\n\\n ));\\n\\n let center = [\\n\\n self.center[0].clone(),\\n\",\n \"file_path\": \"src/ray_bundle_types.rs\",\n \"rank\": 23,\n \"score\": 51813.71449631355\n },\n {\n \"content\": \" }\\n\\n result\\n\\n }\\n\\n\\n\\n fn centers<NPTS, StorageIn>(\\n\\n &self,\\n\\n self_data: &Matrix<R, NPTS, U3, StorageIn>,\\n\\n ) -> Matrix<R, NPTS, U3, Owned<R, NPTS, U3>>\\n\\n where\\n\\n NPTS: nalgebra::DimName,\\n\\n StorageIn: Storage<R, NPTS, U3>,\\n\\n DefaultAllocator: Allocator<R, NPTS, U3>,\\n\\n {\\n\\n // TODO: do this more smartly/efficiently\\n\\n let mut result = nalgebra::OMatrix::<R, NPTS, U3>::zeros();\\n\\n for i in 0..self_data.nrows() {\\n\\n for j in 0..3 {\\n\\n result[(i, j)] = self.center[j].clone();\\n\\n }\\n\\n }\\n\",\n \"file_path\": \"src/ray_bundle_types.rs\",\n \"rank\": 24,\n \"score\": 51812.460173182175\n },\n {\n \"content\": \" for i in 0..self_data.nrows() {\\n\\n for j in 0..3 {\\n\\n result[(i, j)] = self.direction[j].clone();\\n\\n }\\n\\n }\\n\\n result\\n\\n }\\n\\n\\n\\n fn centers<NPTS, StorageIn>(\\n\\n &self,\\n\\n self_data: &Matrix<R, NPTS, U3, StorageIn>,\\n\\n ) -> Matrix<R, NPTS, U3, Owned<R, NPTS, U3>>\\n\\n where\\n\\n NPTS: nalgebra::DimName,\\n\\n StorageIn: Storage<R, NPTS, U3>,\\n\\n DefaultAllocator: Allocator<R, NPTS, U3>,\\n\\n {\\n\\n // TODO: do this more smartly/efficiently\\n\\n let mut result = nalgebra::OMatrix::<R, NPTS, U3>::zeros();\\n\\n for i in 0..self_data.nrows() {\\n\",\n \"file_path\": \"src/ray_bundle_types.rs\",\n \"rank\": 25,\n \"score\": 51812.18931822467\n },\n {\n \"content\": \" self.center[1].clone(),\\n\\n self.center[2].clone(),\\n\\n ];\\n\\n for i in 0..directions.nrows() {\\n\\n for j in 0..3 {\\n\\n result.data[(i, j)] = center[j].clone() + directions[(i, j)].clone();\\n\\n }\\n\\n }\\n\\n result\\n\\n }\\n\\n\\n\\n fn point_on_ray_at_distance<NPTS, StorageIn, OutFrame>(\\n\\n &self,\\n\\n directions: &Matrix<R, NPTS, U3, StorageIn>,\\n\\n distance: R,\\n\\n ) -> Points<OutFrame, R, NPTS, Owned<R, NPTS, U3>>\\n\\n where\\n\\n Self: Sized,\\n\\n NPTS: Dim,\\n\\n StorageIn: Storage<R, NPTS, U3>,\\n\",\n \"file_path\": \"src/ray_bundle_types.rs\",\n \"rank\": 26,\n \"score\": 51811.314010433554\n },\n {\n \"content\": \" center: self.center.coords.transpose(),\\n\\n c: std::marker::PhantomData,\\n\\n }\\n\\n }\\n\\n\\n\\n fn directions<NPTS, StorageIn>(\\n\\n &self,\\n\\n self_data: &Matrix<R, NPTS, U3, StorageIn>,\\n\\n ) -> Matrix<R, NPTS, U3, Owned<R, NPTS, U3>>\\n\\n where\\n\\n NPTS: nalgebra::DimName,\\n\\n StorageIn: Storage<R, NPTS, U3>,\\n\\n DefaultAllocator: Allocator<R, NPTS, U3>,\\n\\n {\\n\\n // TODO: do this more smartly/efficiently\\n\\n let mut result = nalgebra::OMatrix::<R, NPTS, U3>::zeros();\\n\\n for i in 0..self_data.nrows() {\\n\\n for j in 0..3 {\\n\\n result[(i, j)] = self_data[(i, j)].clone();\\n\\n }\\n\",\n \"file_path\": \"src/ray_bundle_types.rs\",\n \"rank\": 27,\n \"score\": 51811.087994732385\n },\n {\n \"content\": \" Coords: CoordinateSystem,\\n\\n {\\n\\n Ray {\\n\\n direction: self.direction.transpose(),\\n\\n center: self_data.clone(),\\n\\n c: std::marker::PhantomData,\\n\\n }\\n\\n }\\n\\n\\n\\n fn directions<NPTS, StorageIn>(\\n\\n &self,\\n\\n self_data: &Matrix<R, NPTS, U3, StorageIn>,\\n\\n ) -> Matrix<R, NPTS, U3, Owned<R, NPTS, U3>>\\n\\n where\\n\\n NPTS: nalgebra::DimName,\\n\\n StorageIn: Storage<R, NPTS, U3>,\\n\\n DefaultAllocator: Allocator<R, NPTS, U3>,\\n\\n {\\n\\n // TODO: do this more smartly/efficiently\\n\\n let mut result = nalgebra::OMatrix::<R, NPTS, U3>::zeros();\\n\",\n \"file_path\": \"src/ray_bundle_types.rs\",\n \"rank\": 28,\n \"score\": 51810.1186098261\n },\n {\n \"content\": \" where\\n\\n Self: Sized,\\n\\n NPTS: Dim,\\n\\n StorageIn: Storage<R, NPTS, U3>,\\n\\n OutFrame: CoordinateSystem,\\n\\n DefaultAllocator: Allocator<R, NPTS, U3>,\\n\\n {\\n\\n let mut result = Points::new(OMatrix::zeros_generic(\\n\\n NPTS::from_usize(centers.nrows()),\\n\\n U3::from_usize(3),\\n\\n ));\\n\\n\\n\\n let d = &self.direction;\\n\\n let dx = d[0].clone();\\n\\n let dy = d[1].clone();\\n\\n let dz = d[2].clone();\\n\\n let mag2 = dx.clone() * dx.clone() + dy.clone() * dy.clone() + dz.clone() * dz.clone();\\n\\n let mag = mag2.sqrt();\\n\\n let scale = distance / mag;\\n\\n let dist_dir = Vector3::new(scale.clone() * dx, scale.clone() * dy, scale * dz);\\n\",\n \"file_path\": \"src/ray_bundle_types.rs\",\n \"rank\": 29,\n \"score\": 51809.65576233619\n },\n {\n \"content\": \"\\n\\n for i in 0..centers.nrows() {\\n\\n for j in 0..3 {\\n\\n result.data[(i, j)] = dist_dir[j].clone() + centers[(i, j)].clone();\\n\\n }\\n\\n }\\n\\n result\\n\\n }\\n\\n\\n\\n fn to_pose<NPTS, StorageIn, OutFrame>(\\n\\n &self,\\n\\n pose: Isometry3<R>,\\n\\n self_data: &Matrix<R, NPTS, U3, StorageIn>,\\n\\n ) -> RayBundle<OutFrame, Self, R, NPTS, Owned<R, NPTS, U3>>\\n\\n where\\n\\n NPTS: Dim,\\n\\n StorageIn: Storage<R, NPTS, U3>,\\n\\n OutFrame: CoordinateSystem,\\n\\n DefaultAllocator: Allocator<R, NPTS, U3>,\\n\\n {\\n\",\n \"file_path\": \"src/ray_bundle_types.rs\",\n \"rank\": 30,\n \"score\": 51809.64665817562\n },\n {\n \"content\": \" let bundle_type = Self::new_plusz_shared_direction();\\n\\n\\n\\n let mut reposed = RayBundle::new(\\n\\n bundle_type,\\n\\n OMatrix::zeros_generic(NPTS::from_usize(self_data.nrows()), U3::from_usize(3)),\\n\\n );\\n\\n\\n\\n // transform single bundle direction\\n\\n let new_direction = pose.transform_vector(&self.direction);\\n\\n\\n\\n // transform multiple bundle origins\\n\\n for i in 0..self_data.nrows() {\\n\\n let orig_point = Point3 {\\n\\n coords: self_data.row(i).transpose(),\\n\\n };\\n\\n let new_point = pose.transform_point(&orig_point);\\n\\n for j in 0..3 {\\n\\n reposed.data[(i, j)] = new_point[j].clone();\\n\\n }\\n\\n }\\n\\n\\n\\n reposed.bundle_type = SharedDirectionRayBundle {\\n\\n direction: new_direction,\\n\\n };\\n\\n reposed\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/ray_bundle_types.rs\",\n \"rank\": 31,\n \"score\": 51808.01957949661\n },\n {\n \"content\": \"/// A bundle of rays with the same arbitrary direction\\n\\n#[derive(Debug, Clone, PartialEq)]\\n\\n#[cfg_attr(feature = \\\"serde-serialize\\\", derive(Serialize, Deserialize))]\\n\\npub struct SharedDirectionRayBundle<R: RealField> {\\n\\n direction: Vector3<R>,\\n\\n}\\n\\n\\n\\nimpl<R: RealField> SharedDirectionRayBundle<R> {\\n\\n /// Create a new SharedDirectionRayBundle with direction +z.\\n\\n pub fn new_plusz_shared_direction() -> Self {\\n\\n // in +z direction\\n\\n Self {\\n\\n direction: Vector3::new(R::zero(), R::zero(), R::one()),\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\nimpl<R: RealField> Bundle<R> for SharedDirectionRayBundle<R> {\\n\\n fn to_single_ray<Coords>(&self, self_data: &SMatrix<R, 1, 3>) -> Ray<Coords, R>\\n\\n where\\n\",\n \"file_path\": \"src/ray_bundle_types.rs\",\n \"rank\": 32,\n \"score\": 51807.299392168774\n },\n {\n \"content\": \" U3::from_usize(3),\\n\\n ));\\n\\n let direction = [\\n\\n self.direction[0].clone(),\\n\\n self.direction[1].clone(),\\n\\n self.direction[2].clone(),\\n\\n ];\\n\\n for i in 0..centers.nrows() {\\n\\n for j in 0..3 {\\n\\n result.data[(i, j)] = direction[j].clone() + centers[(i, j)].clone();\\n\\n }\\n\\n }\\n\\n result\\n\\n }\\n\\n\\n\\n fn point_on_ray_at_distance<NPTS, StorageIn, OutFrame>(\\n\\n &self,\\n\\n centers: &Matrix<R, NPTS, U3, StorageIn>,\\n\\n distance: R,\\n\\n ) -> Points<OutFrame, R, NPTS, Owned<R, NPTS, U3>>\\n\",\n \"file_path\": \"src/ray_bundle_types.rs\",\n \"rank\": 33,\n \"score\": 51806.27216805993\n },\n {\n \"content\": \" bundle_type,\\n\\n OMatrix::zeros_generic(NPTS::from_usize(self_data.nrows()), U3::from_usize(3)),\\n\\n );\\n\\n // transform single bundle center point\\n\\n let new_center = pose.transform_point(&self.center);\\n\\n\\n\\n // transform multiple bundle directions\\n\\n for i in 0..self_data.nrows() {\\n\\n let orig_vec = self_data.row(i).transpose();\\n\\n let new_vec = pose.transform_vector(&orig_vec);\\n\\n for j in 0..3 {\\n\\n reposed.data[(i, j)] = new_vec[j].clone();\\n\\n }\\n\\n }\\n\\n\\n\\n reposed.bundle_type = SharedOriginRayBundle { center: new_center };\\n\\n reposed\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/ray_bundle_types.rs\",\n \"rank\": 34,\n \"score\": 51803.69948324986\n },\n {\n \"content\": \" OutFrame: CoordinateSystem,\\n\\n DefaultAllocator: Allocator<R, NPTS, U3>,\\n\\n {\\n\\n let mut result = Points::new(OMatrix::zeros_generic(\\n\\n NPTS::from_usize(directions.nrows()),\\n\\n U3::from_usize(3),\\n\\n ));\\n\\n let center = [\\n\\n self.center[0].clone(),\\n\\n self.center[1].clone(),\\n\\n self.center[2].clone(),\\n\\n ];\\n\\n for i in 0..directions.nrows() {\\n\\n let dx = directions[(i, 0)].clone();\\n\\n let dy = directions[(i, 1)].clone();\\n\\n let dz = directions[(i, 2)].clone();\\n\\n let mag2 = dx.clone() * dx + dy.clone() * dy + dz.clone() * dz;\\n\\n let mag = mag2.sqrt();\\n\\n let scale = distance.clone() / mag;\\n\\n for j in 0..3 {\\n\",\n \"file_path\": \"src/ray_bundle_types.rs\",\n \"rank\": 35,\n \"score\": 51802.844693236715\n },\n {\n \"content\": \"fn main() {\\n\\n use cam_geom::*;\\n\\n use nalgebra::{Matrix2x3, Unit, Vector3};\\n\\n\\n\\n // Create two points in the world coordinate frame.\\n\\n let world_coords = Points::new(Matrix2x3::new(\\n\\n 1.0, 0.0, 0.0, // point 1\\n\\n 0.0, 1.0, 0.0, // point 2\\n\\n ));\\n\\n\\n\\n // perepective parameters - focal length of 100, no skew, pixel center at (640,480)\\n\\n let intrinsics = IntrinsicParametersPerspective::from(PerspectiveParams {\\n\\n fx: 100.0,\\n\\n fy: 100.0,\\n\\n skew: 0.0,\\n\\n cx: 640.0,\\n\\n cy: 480.0,\\n\\n });\\n\\n\\n\\n // Set extrinsic parameters - camera at (10,0,0), looing at (0,0,0), up (0,0,1)\\n\",\n \"file_path\": \"examples/3d-to-2d.rs\",\n \"rank\": 36,\n \"score\": 46487.34670254089\n },\n {\n \"content\": \"/// A simple SVG file writer\\n\\nstruct SvgWriter {\\n\\n segs: Vec<((f64, f64), (f64, f64))>,\\n\\n xmin: f64,\\n\\n xmax: f64,\\n\\n ymin: f64,\\n\\n ymax: f64,\\n\\n}\\n\\n\\n\\nimpl SvgWriter {\\n\\n fn new() -> Self {\\n\\n Self {\\n\\n xmin: std::f64::INFINITY,\\n\\n xmax: -std::f64::INFINITY,\\n\\n ymin: std::f64::INFINITY,\\n\\n ymax: -std::f64::INFINITY,\\n\\n segs: Vec::new(),\\n\\n }\\n\\n }\\n\\n fn add_edge<S>(&mut self, pt0: &Matrix<f64, U1, U2, S>, pt1: &Matrix<f64, U1, U2, S>)\\n\\n where\\n\",\n \"file_path\": \"examples/render-cube.rs\",\n \"rank\": 37,\n \"score\": 44111.36614513887\n },\n {\n \"content\": \"fn main() {\\n\\n use cam_geom::*;\\n\\n use nalgebra::RowVector3;\\n\\n\\n\\n // Create the first ray.\\n\\n let ray1 = Ray::<WorldFrame, _>::new(\\n\\n RowVector3::new(1.0, 0.0, 0.0), // origin\\n\\n RowVector3::new(0.0, 1.0, 0.0), // direction\\n\\n );\\n\\n\\n\\n // Create the second ray.\\n\\n let ray2 = Ray::<WorldFrame, _>::new(\\n\\n RowVector3::new(0.0, 1.0, 0.0), // origin\\n\\n RowVector3::new(1.0, 0.0, 0.0), // direction\\n\\n );\\n\\n\\n\\n // Compute the best intersection.\\n\\n let result = best_intersection_of_rays(&[ray1, ray2]).unwrap();\\n\\n\\n\\n // Print the result.\\n\\n println!(\\\"result: {}\\\", result.data);\\n\\n}\\n\",\n \"file_path\": \"examples/ray-intersect.rs\",\n \"rank\": 38,\n \"score\": 43192.15790611204\n },\n {\n \"content\": \"/// A coordinate system in which points and rays can be defined.\\n\\npub trait CoordinateSystem {}\\n\\n\\n\\n/// Implementations of [`CoordinateSystem`](trait.CoordinateSystem.html).\\n\\npub mod coordinate_system {\\n\\n\\n\\n #[cfg(feature = \\\"serde-serialize\\\")]\\n\\n use serde::{Deserialize, Serialize};\\n\\n\\n\\n /// Coordinates in the camera coordinate system.\\n\\n ///\\n\\n /// The camera center is at (0,0,0) at looking at (0,0,1) with up as\\n\\n /// (0,-1,0) in this coordinate frame.\\n\\n #[derive(Debug, Clone, PartialEq)]\\n\\n #[cfg_attr(feature = \\\"serde-serialize\\\", derive(Serialize, Deserialize))]\\n\\n pub struct CameraFrame {}\\n\\n impl crate::CoordinateSystem for CameraFrame {}\\n\\n\\n\\n /// Coordinates in the world coordinate system.\\n\\n ///\\n\\n /// The camera center is may be located at an arbitrary position and pointed\\n\",\n \"file_path\": \"src/lib.rs\",\n \"rank\": 39,\n \"score\": 40464.393337334455\n },\n {\n \"content\": \"// Save a wireframe rendering of the vertices and edges to an SVG file.\\n\\nfn render_wireframe<NPTS, I, S>(\\n\\n verts: &Points<WorldFrame, f64, NPTS, S>,\\n\\n edges: &[(usize, usize)],\\n\\n cam: &Camera<f64, I>,\\n\\n fname: &str,\\n\\n) -> Result<(), std::io::Error>\\n\\nwhere\\n\\n NPTS: Dim,\\n\\n I: IntrinsicParameters<f64>,\\n\\n S: Storage<f64, NPTS, U3>,\\n\\n DefaultAllocator: Allocator<f64, NPTS, U3>,\\n\\n DefaultAllocator: Allocator<f64, NPTS, U2>,\\n\\n{\\n\\n // Project the original 3D coordinates to 2D pixel coordinates.\\n\\n let pixel_coords = cam.world_to_pixel(&verts);\\n\\n\\n\\n let mut wtr = SvgWriter::new();\\n\\n\\n\\n for edge in edges {\\n\\n let (i0, i1) = edge;\\n\\n let pt0 = pixel_coords.data.row(*i0);\\n\\n let pt1 = pixel_coords.data.row(*i1);\\n\\n wtr.add_edge(&pt0, &pt1);\\n\\n }\\n\\n wtr.save(fname)?;\\n\\n\\n\\n Ok(())\\n\\n}\\n\\n\\n\",\n \"file_path\": \"examples/render-cube.rs\",\n \"rank\": 40,\n \"score\": 32972.6694241497\n },\n {\n \"content\": \"use nalgebra::{\\n\\n allocator::Allocator,\\n\\n base::storage::{Owned, Storage},\\n\\n convert,\\n\\n geometry::{Point3, Rotation3, UnitQuaternion},\\n\\n DefaultAllocator, Dim, Matrix, Matrix3, RealField, SMatrix, Vector3, U1, U2, U3, U4,\\n\\n};\\n\\n\\n\\n#[cfg(feature = \\\"serde-serialize\\\")]\\n\\nuse serde::{Deserialize, Serialize};\\n\\n\\n\\nuse crate::{\\n\\n coordinate_system::WorldFrame,\\n\\n intrinsics_perspective::{IntrinsicParametersPerspective, PerspectiveParams},\\n\\n Bundle, Error, ExtrinsicParameters, IntrinsicParameters, Pixels, Points, RayBundle,\\n\\n};\\n\\n\\n\\n/// A camera model that can convert world coordinates into pixel coordinates.\\n\\n///\\n\\n/// # Examples\\n\",\n \"file_path\": \"src/camera.rs\",\n \"rank\": 41,\n \"score\": 29144.473563773092\n },\n {\n \"content\": \" I::BundleType: Bundle<R>,\\n\\n DefaultAllocator: Allocator<R, U1, U2>,\\n\\n DefaultAllocator: Allocator<R, NPTS, U2>,\\n\\n DefaultAllocator: Allocator<R, NPTS, U3>,\\n\\n {\\n\\n // get camera frame rays\\n\\n let camera = self.intrinsics.pixel_to_camera(&pixels);\\n\\n\\n\\n // get world frame rays\\n\\n self.extrinsics.ray_camera_to_world(&camera)\\n\\n }\\n\\n}\\n\\n\\n\\nimpl<R: RealField> Camera<R, IntrinsicParametersPerspective<R>> {\\n\\n /// Create a `Camera` from a 3x4 perspective projection matrix.\\n\\n pub fn from_perspective_matrix<S>(pmat: &Matrix<R, U3, U4, S>) -> Result<Self, Error>\\n\\n where\\n\\n S: Storage<R, U3, U4> + Clone,\\n\\n {\\n\\n let m = pmat.clone().remove_column(3);\\n\",\n \"file_path\": \"src/camera.rs\",\n \"rank\": 42,\n \"score\": 29139.99310188842\n },\n {\n \"content\": \" &self.extrinsics\\n\\n }\\n\\n\\n\\n /// Return a reference to the intrinsic parameters.\\n\\n #[inline]\\n\\n pub fn intrinsics(&self) -> &I {\\n\\n &self.intrinsics\\n\\n }\\n\\n\\n\\n /// take 3D coordinates in world frame and convert to pixel coordinates\\n\\n pub fn world_to_pixel<NPTS, InStorage>(\\n\\n &self,\\n\\n world: &Points<WorldFrame, R, NPTS, InStorage>,\\n\\n ) -> Pixels<R, NPTS, Owned<R, NPTS, U2>>\\n\\n where\\n\\n NPTS: Dim,\\n\\n InStorage: Storage<R, NPTS, U3>,\\n\\n DefaultAllocator: Allocator<R, NPTS, U3>,\\n\\n DefaultAllocator: Allocator<R, NPTS, U2>,\\n\\n {\\n\",\n \"file_path\": \"src/camera.rs\",\n \"rank\": 43,\n \"score\": 29138.151316190673\n },\n {\n \"content\": \" let camera_frame = self.extrinsics.world_to_camera(&world);\\n\\n self.intrinsics.camera_to_pixel(&camera_frame)\\n\\n }\\n\\n\\n\\n /// take pixel coordinates and project to 3D in world frame\\n\\n ///\\n\\n /// output arguments:\\n\\n /// `camera` - camera frame coordinate rays\\n\\n /// `world` - world frame coordinate rays\\n\\n ///\\n\\n /// Note that the camera frame coordinates are returned as they must\\n\\n /// be computed anyway, so this additional data is \\\"free\\\".\\n\\n pub fn pixel_to_world<IN, NPTS>(\\n\\n &self,\\n\\n pixels: &Pixels<R, NPTS, IN>,\\n\\n ) -> RayBundle<WorldFrame, I::BundleType, R, NPTS, Owned<R, NPTS, U3>>\\n\\n where\\n\\n I::BundleType: Bundle<R>,\\n\\n IN: Storage<R, NPTS, U2>,\\n\\n NPTS: Dim,\\n\",\n \"file_path\": \"src/camera.rs\",\n \"rank\": 44,\n \"score\": 29136.625153810426\n },\n {\n \"content\": \"/// let pose = ExtrinsicParameters::from_view(&camcenter, &lookat, &up);\\n\\n///\\n\\n/// // Create camera with both intrinsic and extrinsic parameters.\\n\\n/// let cam = Camera::new(intrinsics, pose);\\n\\n/// ```\\n\\n///\\n\\n/// Creates a new orthographic camera:\\n\\n///\\n\\n/// ```\\n\\n/// use cam_geom::*;\\n\\n/// use nalgebra::*;\\n\\n///\\n\\n/// // orthographic parameters - scale of 100, pixel center at (640,480)\\n\\n/// let intrinsics = IntrinsicParametersOrthographic::from(OrthographicParams {\\n\\n/// sx: 100.0,\\n\\n/// sy: 100.0,\\n\\n/// cx: 640.0,\\n\\n/// cy: 480.0,\\n\\n/// });\\n\\n///\\n\",\n \"file_path\": \"src/camera.rs\",\n \"rank\": 45,\n \"score\": 29133.723403484277\n },\n {\n \"content\": \" let (rquat, k) = rq_decomposition(m)?;\\n\\n\\n\\n let k22: R = k[(2, 2)].clone();\\n\\n\\n\\n let one: R = convert(1.0);\\n\\n\\n\\n let k = k * (one / k22); // normalize\\n\\n\\n\\n let params = PerspectiveParams {\\n\\n fx: k[(0, 0)].clone(),\\n\\n fy: k[(1, 1)].clone(),\\n\\n skew: k[(0, 1)].clone(),\\n\\n cx: k[(0, 2)].clone(),\\n\\n cy: k[(1, 2)].clone(),\\n\\n };\\n\\n\\n\\n let camcenter = pmat2cam_center(pmat);\\n\\n let extrinsics = ExtrinsicParameters::from_rotation_and_camcenter(rquat, camcenter);\\n\\n\\n\\n Ok(Self::new(params.into(), extrinsics))\\n\",\n \"file_path\": \"src/camera.rs\",\n \"rank\": 46,\n \"score\": 29130.104435495323\n },\n {\n \"content\": \" }\\n\\n\\n\\n /// Create a 3x4 perspective projection matrix modeling this camera.\\n\\n pub fn as_camera_matrix(&self) -> SMatrix<R, 3, 4> {\\n\\n let m = {\\n\\n let p33 = self.intrinsics().as_intrinsics_matrix();\\n\\n p33 * self.extrinsics().cache.qt.clone()\\n\\n };\\n\\n\\n\\n // flip sign if focal length < 0\\n\\n let m = if m[(0, 0)] < nalgebra::convert(0.0) {\\n\\n -m\\n\\n } else {\\n\\n m\\n\\n };\\n\\n\\n\\n m.clone() / m[(2, 3)].clone() // normalize\\n\\n }\\n\\n}\\n\\n\\n\\n#[cfg(test)]\\n\",\n \"file_path\": \"src/camera.rs\",\n \"rank\": 47,\n \"score\": 29129.253944656783\n },\n {\n \"content\": \"///\\n\\n/// Creates a new perspective camera:\\n\\n///\\n\\n/// ```\\n\\n/// use cam_geom::*;\\n\\n/// use nalgebra::*;\\n\\n///\\n\\n/// // perepective parameters - focal length of 100, no skew, pixel center at (640,480)\\n\\n/// let intrinsics = IntrinsicParametersPerspective::from(PerspectiveParams {\\n\\n/// fx: 100.0,\\n\\n/// fy: 100.0,\\n\\n/// skew: 0.0,\\n\\n/// cx: 640.0,\\n\\n/// cy: 480.0,\\n\\n/// });\\n\\n///\\n\\n/// // Set extrinsic parameters - camera at (10,0,10), looing at (0,0,0), up (0,0,1)\\n\\n/// let camcenter = Vector3::new(10.0, 0.0, 10.0);\\n\\n/// let lookat = Vector3::new(0.0, 0.0, 0.0);\\n\\n/// let up = Unit::new_normalize(Vector3::new(0.0, 0.0, 1.0));\\n\",\n \"file_path\": \"src/camera.rs\",\n \"rank\": 48,\n \"score\": 29127.79443317597\n },\n {\n \"content\": \"impl<R, I> Camera<R, I>\\n\\nwhere\\n\\n I: IntrinsicParameters<R>,\\n\\n R: RealField,\\n\\n{\\n\\n /// Create a new camera from intrinsic and extrinsic parameters.\\n\\n ///\\n\\n /// # Arguments\\n\\n /// Intrinsic parameters and extrinsic parameters\\n\\n #[inline]\\n\\n pub fn new(intrinsics: I, extrinsics: ExtrinsicParameters<R>) -> Self {\\n\\n Self {\\n\\n intrinsics,\\n\\n extrinsics,\\n\\n }\\n\\n }\\n\\n\\n\\n /// Return a reference to the extrinsic parameters.\\n\\n #[inline]\\n\\n pub fn extrinsics(&self) -> &ExtrinsicParameters<R> {\\n\",\n \"file_path\": \"src/camera.rs\",\n \"rank\": 49,\n \"score\": 29126.222083095578\n },\n {\n \"content\": \"/// // Set extrinsic parameters - camera at (10,0,10), looing at (0,0,0), up (0,0,1)\\n\\n/// let camcenter = Vector3::new(10.0, 0.0, 10.0);\\n\\n/// let lookat = Vector3::new(0.0, 0.0, 0.0);\\n\\n/// let up = Unit::new_normalize(Vector3::new(0.0, 0.0, 1.0));\\n\\n/// let pose = ExtrinsicParameters::from_view(&camcenter, &lookat, &up);\\n\\n///\\n\\n/// // Create camera with both intrinsic and extrinsic parameters.\\n\\n/// let cam = Camera::new(intrinsics, pose);\\n\\n/// ```\\n\\n#[derive(Debug, Clone, PartialEq)]\\n\\n#[cfg_attr(feature = \\\"serde-serialize\\\", derive(Serialize, Deserialize))]\\n\\npub struct Camera<R, I>\\n\\nwhere\\n\\n I: IntrinsicParameters<R>,\\n\\n R: RealField,\\n\\n{\\n\\n intrinsics: I,\\n\\n extrinsics: ExtrinsicParameters<R>,\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/camera.rs\",\n \"rank\": 50,\n \"score\": 29125.671528990628\n },\n {\n \"content\": \"\\n\\n let params = PerspectiveParams {\\n\\n fx: 100.0,\\n\\n fy: 102.0,\\n\\n skew: 0.1,\\n\\n cx: 321.0,\\n\\n cy: 239.9,\\n\\n };\\n\\n\\n\\n let intrinsics: IntrinsicParametersPerspective<_> = params.into();\\n\\n\\n\\n let camcenter = Vector3::new(10.0, 0.0, 10.0);\\n\\n let lookat = Vector3::new(0.0, 0.0, 0.0);\\n\\n let up = Unit::new_normalize(Vector3::new(0.0, 0.0, 1.0));\\n\\n let pose = ExtrinsicParameters::from_view(&camcenter, &lookat, &up);\\n\\n\\n\\n let expected = Camera::new(intrinsics, pose);\\n\\n\\n\\n let buf = serde_json::to_string(&expected).unwrap();\\n\\n let actual: Camera<_, _> = serde_json::from_str(&buf).unwrap();\\n\\n assert!(expected == actual);\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/camera.rs\",\n \"rank\": 51,\n \"score\": 29120.539110261896\n },\n {\n \"content\": \" let q = -q;\\n\\n let intrin = -intrin;\\n\\n let rquat = right_handed_rotation_quat_new(&q)?;\\n\\n Ok((rquat, intrin))\\n\\n }\\n\\n e => Err(e),\\n\\n }\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/camera.rs\",\n \"rank\": 52,\n \"score\": 29109.535102279733\n },\n {\n \"content\": \" let mut data = nalgebra::OMatrix::<R, Dynamic, U2>::from_element(uv_raws.len(), convert(0.0));\\n\\n for i in 0..uv_raws.len() {\\n\\n for j in 0..2 {\\n\\n data[(i, j)] = uv_raws[i][j].clone();\\n\\n }\\n\\n }\\n\\n Pixels { data }\\n\\n}\\n\\n\\n\\n/// Test roundtrip projection from pixels to camera rays for an intrinsic camera model.\\n\\n///\\n\\n/// Generate pixel coordinates, project them to rays, convert to points on the\\n\\n/// rays, convert the points back to pixels, and then compare with the original\\n\\n/// pixel coordinates.\\n\",\n \"file_path\": \"src/intrinsic_test_utils.rs\",\n \"rank\": 53,\n \"score\": 26210.138653684768\n },\n {\n \"content\": \"//! Utilities for testing `cam_geom` implementations.\\n\\nuse super::*;\\n\\nuse nalgebra::{\\n\\n base::{dimension::Dynamic, VecStorage},\\n\\n convert,\\n\\n};\\n\\n\\n\\npub(crate) fn generate_uv_raw<R: RealField>(\\n\\n width: usize,\\n\\n height: usize,\\n\\n step: usize,\\n\\n border: usize,\\n\\n) -> Pixels<R, Dynamic, VecStorage<R, Dynamic, U2>> {\\n\\n let mut uv_raws: Vec<[R; 2]> = Vec::new();\\n\\n for row in num_iter::range_step(border, height - border, step) {\\n\\n for col in num_iter::range_step(border, width - border, step) {\\n\\n uv_raws.push([convert(col as f64), convert(row as f64)]);\\n\\n }\\n\\n }\\n\\n\\n\",\n \"file_path\": \"src/intrinsic_test_utils.rs\",\n \"rank\": 54,\n \"score\": 26205.75022012014\n },\n {\n \"content\": \" type BundleType = SharedOriginRayBundle<R>;\\n\\n\\n\\n fn pixel_to_camera<IN, NPTS>(\\n\\n &self,\\n\\n pixels: &Pixels<R, NPTS, IN>,\\n\\n ) -> RayBundle<CameraFrame, Self::BundleType, R, NPTS, Owned<R, NPTS, U3>>\\n\\n where\\n\\n Self::BundleType: Bundle<R>,\\n\\n IN: Storage<R, NPTS, U2>,\\n\\n NPTS: Dim,\\n\\n DefaultAllocator: Allocator<R, NPTS, U3>,\\n\\n {\\n\\n let one: R = convert(1.0);\\n\\n\\n\\n // allocate zeros, fill later\\n\\n let mut result = RayBundle::new_shared_zero_origin(OMatrix::zeros_generic(\\n\\n NPTS::from_usize(pixels.data.nrows()),\\n\\n U3::from_usize(3),\\n\\n ));\\n\\n\\n\",\n \"file_path\": \"src/intrinsics_perspective.rs\",\n \"rank\": 57,\n \"score\": 41.213358780101956\n },\n {\n \"content\": \"use nalgebra::{\\n\\n allocator::Allocator,\\n\\n convert,\\n\\n storage::{Owned, Storage},\\n\\n DefaultAllocator, Dim, Matrix, OMatrix, RealField, SMatrix, SliceStorage, U1, U2, U3,\\n\\n};\\n\\n\\n\\n#[cfg(feature = \\\"serde-serialize\\\")]\\n\\nuse serde::{Deserialize, Serialize};\\n\\n\\n\\nuse crate::{\\n\\n coordinate_system::CameraFrame, Bundle, Error, IntrinsicParameters, Pixels, Points, RayBundle,\\n\\n};\\n\\n\\n\\nuse crate::ray_bundle_types::SharedOriginRayBundle;\\n\\n\\n\\n/// Parameters defining a pinhole perspective camera model.\\n\\n///\\n\\n/// These will be used to make the 3x4 intrinsic parameter matrix\\n\\n/// ```text\\n\",\n \"file_path\": \"src/intrinsics_perspective.rs\",\n \"rank\": 59,\n \"score\": 38.88697905728456\n },\n {\n \"content\": \" /// project camera coords to pixel coordinates\\n\\n fn camera_to_pixel<IN, NPTS>(\\n\\n &self,\\n\\n camera: &Points<coordinate_system::CameraFrame, R, NPTS, IN>,\\n\\n ) -> Pixels<R, NPTS, Owned<R, NPTS, U2>>\\n\\n where\\n\\n IN: Storage<R, NPTS, U3>,\\n\\n NPTS: Dim,\\n\\n DefaultAllocator: Allocator<R, NPTS, U2>;\\n\\n}\\n\\n\\n\\n#[cfg(test)]\\n\\nmod tests {\\n\\n use super::*;\\n\\n use nalgebra::convert;\\n\\n\\n\\n #[cfg(not(feature = \\\"std\\\"))]\\n\\n compile_error!(\\\"tests require std\\\");\\n\\n\\n\\n #[test]\\n\",\n \"file_path\": \"src/lib.rs\",\n \"rank\": 62,\n \"score\": 36.05262309990812\n },\n {\n \"content\": \"use nalgebra::geometry::{Isometry3, Point3, Rotation3, Translation, UnitQuaternion};\\n\\nuse nalgebra::{\\n\\n allocator::Allocator,\\n\\n storage::{Owned, Storage},\\n\\n DefaultAllocator, RealField,\\n\\n};\\n\\nuse nalgebra::{convert, Dim, OMatrix, SMatrix, Unit, Vector3, U3};\\n\\n\\n\\n#[cfg(feature = \\\"serde-serialize\\\")]\\n\\nuse serde::{Deserialize, Serialize};\\n\\n\\n\\nuse crate::{\\n\\n coordinate_system::{CameraFrame, WorldFrame},\\n\\n Bundle, Points, RayBundle,\\n\\n};\\n\\n\\n\\n/// Defines the pose of a camera in the world coordinate system.\\n\\n#[derive(Clone, PartialEq)]\\n\\n#[cfg_attr(feature = \\\"serde-serialize\\\", derive(Serialize))]\\n\\npub struct ExtrinsicParameters<R: RealField> {\\n\",\n \"file_path\": \"src/extrinsics.rs\",\n \"rank\": 63,\n \"score\": 35.1196506573625\n },\n {\n \"content\": \" /// `Coords` type.\\n\\n pub fn new_shared_zero_origin(data: Matrix<R, NPTS, U3, StorageMultiple>) -> Self {\\n\\n let bundle_type = crate::ray_bundle_types::SharedOriginRayBundle::new_shared_zero_origin();\\n\\n Self::new(bundle_type, data)\\n\\n }\\n\\n}\\n\\n\\n\\nimpl<Coords, R, NPTS, StorageMultiple>\\n\\n RayBundle<\\n\\n Coords,\\n\\n crate::ray_bundle_types::SharedDirectionRayBundle<R>,\\n\\n R,\\n\\n NPTS,\\n\\n StorageMultiple,\\n\\n >\\n\\nwhere\\n\\n Coords: CoordinateSystem,\\n\\n R: RealField,\\n\\n NPTS: Dim,\\n\\n StorageMultiple: Storage<R, NPTS, U3>,\\n\",\n \"file_path\": \"src/lib.rs\",\n \"rank\": 64,\n \"score\": 33.515373384915016\n },\n {\n \"content\": \" R: RealField,\\n\\n NPTS: Dim,\\n\\n{\\n\\n /// Create a new Points instance from the underlying storage.\\n\\n #[inline]\\n\\n pub fn new(data: nalgebra::Matrix<R, NPTS, U3, STORAGE>) -> Self {\\n\\n Self {\\n\\n coords: std::marker::PhantomData,\\n\\n data,\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\n/// 3D rays. Can be in any [`CoordinateSystem`](trait.CoordinateSystem.html).\\n\\n///\\n\\n/// Any given `RayBundle` will have a particular bundle type, which implements\\n\\n/// the [`Bundle`](trait.Bundle.html) trait.\\n\\n#[derive(Debug, Clone, PartialEq)]\\n\\n#[cfg_attr(feature = \\\"serde-serialize\\\", derive(Serialize, Deserialize))]\\n\\npub struct RayBundle<Coords, BType, R, NPTS, StorageMultiple>\\n\",\n \"file_path\": \"src/lib.rs\",\n \"rank\": 65,\n \"score\": 33.248173804708394\n },\n {\n \"content\": \" std::fmt::Debug::fmt(self, f)\\n\\n }\\n\\n}\\n\\n\\n\\n/// 2D pixel locations on the image sensor.\\n\\n///\\n\\n/// These pixels are \\\"distorted\\\" - with barrel and pincushion distortion - if\\n\\n/// the camera model incorporates such. (Undistorted pixels are handled\\n\\n/// internally within the camera model.)\\n\\n///\\n\\n/// This is a newtype wrapping an `nalgebra::Matrix`.\\n\\n#[derive(Clone)]\\n\\npub struct Pixels<R: RealField, NPTS: Dim, STORAGE> {\\n\\n /// The matrix storing pixel locations.\\n\\n pub data: nalgebra::Matrix<R, NPTS, U2, STORAGE>,\\n\\n}\\n\\n\\n\\nimpl<R: RealField, NPTS: Dim, STORAGE> Pixels<R, NPTS, STORAGE> {\\n\\n /// Create a new Pixels instance\\n\\n #[inline]\\n\\n pub fn new(data: nalgebra::Matrix<R, NPTS, U2, STORAGE>) -> Self {\\n\\n Self { data }\\n\\n }\\n\\n}\\n\\n\\n\\n/// A coordinate system in which points and rays can be defined.\\n\",\n \"file_path\": \"src/lib.rs\",\n \"rank\": 66,\n \"score\": 32.531246057600065\n },\n {\n \"content\": \" in_mult[(i, 2)].clone(),\\n\\n ));\\n\\n for j in 0..3 {\\n\\n out_mult[(i, j)] = tmp[j].clone();\\n\\n }\\n\\n }\\n\\n world\\n\\n }\\n\\n\\n\\n /// Convert rays in camera coordinates to world coordinates.\\n\\n #[inline]\\n\\n pub fn ray_camera_to_world<BType, NPTS, StorageCamera>(\\n\\n &self,\\n\\n camera: &RayBundle<CameraFrame, BType, R, NPTS, StorageCamera>,\\n\\n ) -> RayBundle<WorldFrame, BType, R, NPTS, Owned<R, NPTS, U3>>\\n\\n where\\n\\n BType: Bundle<R>,\\n\\n NPTS: Dim,\\n\\n StorageCamera: Storage<R, NPTS, U3>,\\n\\n DefaultAllocator: Allocator<R, NPTS, U3>,\\n\",\n \"file_path\": \"src/extrinsics.rs\",\n \"rank\": 67,\n \"score\": 32.50944476226419\n },\n {\n \"content\": \" /// Vertical component of the principal point.\\n\\n pub cy: R,\\n\\n}\\n\\n\\n\\nimpl<R: RealField> From<PerspectiveParams<R>> for IntrinsicParametersPerspective<R> {\\n\\n fn from(params: PerspectiveParams<R>) -> Self {\\n\\n use nalgebra::convert as c;\\n\\n #[rustfmt::skip]\\n\\n let cache_p = nalgebra::SMatrix::<R,3,4>::new(\\n\\n params.fx.clone(), params.skew.clone(), params.cx.clone(), c(0.0),\\n\\n c(0.0), params.fy.clone(), params.cy.clone(), c(0.0),\\n\\n c(0.0), c(0.0), c(1.0), c(0.0),\\n\\n );\\n\\n Self { params, cache_p }\\n\\n }\\n\\n}\\n\\n\\n\\n/// A pinhole perspective camera model. Implements [`IntrinsicParameters`](trait.IntrinsicParameters.html).\\n\\n///\\n\\n/// Create an `IntrinsicParametersPerspective` as described for\\n\",\n \"file_path\": \"src/intrinsics_perspective.rs\",\n \"rank\": 68,\n \"score\": 31.60075913388543\n },\n {\n \"content\": \"{\\n\\n /// Create a new RayBundle instance from the underlying storage.\\n\\n ///\\n\\n /// The coordinate system is given by the `Coords` type and the bundle type\\n\\n /// (e.g. shared origin or shared direction) is given by the `BType`.\\n\\n #[inline]\\n\\n fn new(bundle_type: BType, data: nalgebra::Matrix<R, NPTS, U3, StorageMultiple>) -> Self {\\n\\n Self {\\n\\n coords: std::marker::PhantomData,\\n\\n data,\\n\\n bundle_type,\\n\\n }\\n\\n }\\n\\n\\n\\n /// get a 3D point on the ray, obtained by adding the direction(s) to the origin(s)\\n\\n ///\\n\\n /// The distance of the point from the ray bundle center is not definted and\\n\\n /// can be arbitrary.\\n\\n #[inline]\\n\\n pub fn point_on_ray(&self) -> Points<Coords, R, NPTS, Owned<R, NPTS, U3>>\\n\",\n \"file_path\": \"src/lib.rs\",\n \"rank\": 69,\n \"score\": 31.515474382620422\n },\n {\n \"content\": \" fn camera_to_pixel<IN, NPTS>(\\n\\n &self,\\n\\n camera: &Points<CameraFrame, R, NPTS, IN>,\\n\\n ) -> Pixels<R, NPTS, Owned<R, NPTS, U2>>\\n\\n where\\n\\n IN: Storage<R, NPTS, U3>,\\n\\n NPTS: Dim,\\n\\n DefaultAllocator: Allocator<R, NPTS, U2>,\\n\\n {\\n\\n let mut result = Pixels::new(OMatrix::zeros_generic(\\n\\n NPTS::from_usize(camera.data.nrows()),\\n\\n U2::from_usize(2),\\n\\n ));\\n\\n\\n\\n // It seems broadcasting is not (yet) supported in nalgebra, so we loop\\n\\n // through the data. See\\n\\n // https://discourse.nphysics.org/t/array-broadcasting-support/375/3 .\\n\\n\\n\\n for i in 0..camera.data.nrows() {\\n\\n let x = nalgebra::Point3::new(\\n\",\n \"file_path\": \"src/intrinsics_perspective.rs\",\n \"rank\": 71,\n \"score\": 30.810816112752722\n },\n {\n \"content\": \" let C = Vector3::new(CX, CY, CZ);\\n\\n\\n\\n let s_f64_pinv = my_pinv(&S)?;\\n\\n let s_pinv = despecialize!(s_f64_pinv, R, 3, 3);\\n\\n let r: Vector3<R> = s_pinv * C;\\n\\n\\n\\n let mut result = crate::Points::new(nalgebra::OMatrix::<R, U1, U3>::zeros_generic(u1, u3));\\n\\n for j in 0..3 {\\n\\n result.data[(0, j)] = r[j].clone();\\n\\n }\\n\\n Ok(result)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/ray_intersection.rs\",\n \"rank\": 72,\n \"score\": 30.032406695442504\n },\n {\n \"content\": \" /// in an arbitrary direction in this coordinate frame.\\n\\n #[derive(Debug, Clone, PartialEq)]\\n\\n #[cfg_attr(feature = \\\"serde-serialize\\\", derive(Serialize, Deserialize))]\\n\\n pub struct WorldFrame {}\\n\\n impl crate::CoordinateSystem for WorldFrame {}\\n\\n}\\n\\npub use coordinate_system::{CameraFrame, WorldFrame};\\n\\n\\n\\n/// 3D points. Can be in any [`CoordinateSystem`](trait.CoordinateSystem.html).\\n\\n///\\n\\n/// This is a newtype wrapping an `nalgebra::Matrix`.\\n\\npub struct Points<Coords: CoordinateSystem, R: RealField, NPTS: Dim, STORAGE> {\\n\\n coords: std::marker::PhantomData<Coords>,\\n\\n /// The matrix storing point locations.\\n\\n pub data: nalgebra::Matrix<R, NPTS, U3, STORAGE>,\\n\\n}\\n\\n\\n\\nimpl<Coords, R, NPTS, STORAGE> Points<Coords, R, NPTS, STORAGE>\\n\\nwhere\\n\\n Coords: CoordinateSystem,\\n\",\n \"file_path\": \"src/lib.rs\",\n \"rank\": 73,\n \"score\": 29.865324876072883\n },\n {\n \"content\": \" {\\n\\n camera.to_pose(self.cache.pose_inv.clone())\\n\\n }\\n\\n\\n\\n /// Convert points in world coordinates to camera coordinates.\\n\\n pub fn world_to_camera<NPTS, InStorage>(\\n\\n &self,\\n\\n world: &Points<WorldFrame, R, NPTS, InStorage>,\\n\\n ) -> Points<CameraFrame, R, NPTS, Owned<R, NPTS, U3>>\\n\\n where\\n\\n NPTS: Dim,\\n\\n InStorage: Storage<R, NPTS, U3>,\\n\\n DefaultAllocator: Allocator<R, NPTS, U3>,\\n\\n {\\n\\n let mut cam_coords = Points::new(OMatrix::zeros_generic(\\n\\n NPTS::from_usize(world.data.nrows()),\\n\\n U3::from_usize(3),\\n\\n ));\\n\\n\\n\\n // Potential optimization: remove for loops\\n\",\n \"file_path\": \"src/extrinsics.rs\",\n \"rank\": 74,\n \"score\": 29.442911666684736\n },\n {\n \"content\": \"{\\n\\n /// Return the single ray from the RayBundle with exactly one ray.\\n\\n #[inline]\\n\\n pub fn to_single_ray(&self) -> Ray<Coords, R> {\\n\\n self.bundle_type.to_single_ray(&self.data)\\n\\n }\\n\\n}\\n\\n\\n\\nimpl<Coords, R, NPTS, StorageMultiple>\\n\\n RayBundle<Coords, crate::ray_bundle_types::SharedOriginRayBundle<R>, R, NPTS, StorageMultiple>\\n\\nwhere\\n\\n Coords: CoordinateSystem,\\n\\n R: RealField,\\n\\n NPTS: Dim,\\n\\n StorageMultiple: Storage<R, NPTS, U3>,\\n\\n{\\n\\n /// Create a new RayBundle instance in which all rays share origin at zero.\\n\\n ///\\n\\n /// The number of points allocated is given by the `npts` parameter, which\\n\\n /// should agree with the `NPTS` type. The coordinate system is given by the\\n\",\n \"file_path\": \"src/lib.rs\",\n \"rank\": 75,\n \"score\": 29.417751505426086\n },\n {\n \"content\": \"\\n\\n#![deny(rust_2018_idioms, unsafe_code, missing_docs)]\\n\\n#![cfg_attr(not(feature = \\\"std\\\"), no_std)]\\n\\n\\n\\n#[cfg(not(feature = \\\"std\\\"))]\\n\\nextern crate core as std;\\n\\n\\n\\n#[cfg(feature = \\\"serde-serialize\\\")]\\n\\nuse serde::{Deserialize, Serialize};\\n\\n\\n\\nuse nalgebra::{\\n\\n allocator::Allocator,\\n\\n storage::{Owned, Storage},\\n\\n DefaultAllocator, Dim, DimName, Isometry3, Matrix, Point3, RealField, SMatrix, Vector3, U1, U2,\\n\\n U3,\\n\\n};\\n\\n\\n\\n#[cfg(feature = \\\"std\\\")]\\n\\npub mod intrinsic_test_utils;\\n\\n\\n\",\n \"file_path\": \"src/lib.rs\",\n \"rank\": 76,\n \"score\": 28.891117554823875\n },\n {\n \"content\": \" #[inline]\\n\\n pub fn fy(&self) -> R {\\n\\n self.params.fy.clone()\\n\\n }\\n\\n\\n\\n /// Get skew\\n\\n #[inline]\\n\\n pub fn skew(&self) -> R {\\n\\n self.params.skew.clone()\\n\\n }\\n\\n\\n\\n /// Get X center\\n\\n #[inline]\\n\\n pub fn cx(&self) -> R {\\n\\n self.params.cx.clone()\\n\\n }\\n\\n\\n\\n /// Get Y center\\n\\n #[inline]\\n\\n pub fn cy(&self) -> R {\\n\",\n \"file_path\": \"src/intrinsics_perspective.rs\",\n \"rank\": 77,\n \"score\": 28.228063216177762\n },\n {\n \"content\": \" // flip sign if focal length < 0\\n\\n let m = if m[(0, 0)] < nalgebra::zero() { -m } else { m };\\n\\n\\n\\n let m = m.clone() / m[(2, 3)].clone(); // normalize\\n\\n\\n\\n Self { m }\\n\\n }\\n\\n\\n\\n /// Linearize camera model by evaluating around input point `p`.\\n\\n ///\\n\\n /// Returns Jacobian matrix `A` (shape 2x3) such that `Ao = (u,v)` where `o`\\n\\n /// is 3D world coords offset from `p` and `(u,v)` are the shift in pixel\\n\\n /// coords from the projected location of `p`. In other words, for a camera\\n\\n /// model `F(x)`, if `F(p) = (a,b)` and `F(p+o) = (a,b)\\n\\n /// + Ao = (a,b) + (u,v) = (a+u,b+v)`, this function returns `A`.\\n\\n pub fn linearize_at<STORAGE>(&self, p: &Points<WorldFrame, R, U1, STORAGE>) -> SMatrix<R, 2, 3>\\n\\n where\\n\\n STORAGE: Storage<R, U1, U3>,\\n\\n {\\n\\n let pt3d = &p.data;\\n\",\n \"file_path\": \"src/linearize.rs\",\n \"rank\": 78,\n \"score\": 27.80528684431472\n },\n {\n \"content\": \"/// [`PerspectiveParams`](struct.PerspectiveParams.html) by using `.into()`.\\n\\n#[derive(Clone, PartialEq)]\\n\\n#[cfg_attr(feature = \\\"serde-serialize\\\", derive(Serialize))]\\n\\npub struct IntrinsicParametersPerspective<R: RealField> {\\n\\n params: PerspectiveParams<R>,\\n\\n #[cfg_attr(feature = \\\"serde-serialize\\\", serde(skip))]\\n\\n pub(crate) cache_p: SMatrix<R, 3, 4>,\\n\\n}\\n\\n\\n\\nimpl<R: RealField> IntrinsicParametersPerspective<R> {\\n\\n /// Create a new instance given an intrinsic parameter matrix.\\n\\n ///\\n\\n /// Returns an error if the intrinsic parameter matrix is not normalized or\\n\\n /// otherwise does not represent a perspective camera model.\\n\\n pub fn from_normalized_3x4_matrix(p: SMatrix<R, 3, 4>) -> std::result::Result<Self, Error> {\\n\\n let params: PerspectiveParams<R> = PerspectiveParams {\\n\\n fx: p[(0, 0)].clone(),\\n\\n fy: p[(1, 1)].clone(),\\n\\n skew: p[(0, 1)].clone(),\\n\\n cx: p[(0, 2)].clone(),\\n\",\n \"file_path\": \"src/intrinsics_perspective.rs\",\n \"rank\": 80,\n \"score\": 27.532207090466635\n },\n {\n \"content\": \"{\\n\\n /// Create a new RayBundle instance in which all rays share +z direction.\\n\\n ///\\n\\n /// The number of points allocated is given by the `npts` parameter, which\\n\\n /// should agree with the `NPTS` type. The coordinate system is given by the\\n\\n /// `Coords` type.\\n\\n pub fn new_shared_plusz_direction(data: Matrix<R, NPTS, U3, StorageMultiple>) -> Self {\\n\\n let bundle_type =\\n\\n crate::ray_bundle_types::SharedDirectionRayBundle::new_plusz_shared_direction();\\n\\n Self::new(bundle_type, data)\\n\\n }\\n\\n}\\n\\n\\n\\nimpl<Coords, BType, R, NPTS, StorageMultiple> RayBundle<Coords, BType, R, NPTS, StorageMultiple>\\n\\nwhere\\n\\n Coords: CoordinateSystem,\\n\\n BType: Bundle<R>,\\n\\n R: RealField,\\n\\n NPTS: Dim,\\n\\n StorageMultiple: Storage<R, NPTS, U3>,\\n\",\n \"file_path\": \"src/lib.rs\",\n \"rank\": 81,\n \"score\": 26.810483928153676\n },\n {\n \"content\": \"## Testing\\n\\n\\n\\n### Unit tests\\n\\n\\n\\nTo run the basic unit tests:\\n\\n\\n\\n```\\n\\ncargo test\\n\\n```\\n\\n\\n\\nTo run all unit tests:\\n\\n\\n\\n```\\n\\ncargo test --features serde-serialize\\n\\n```\\n\\n\\n\\n### Test for `no_std`\\n\\n\\n\\nSince the `thumbv7em-none-eabihf` target does not have `std` available, we\\n\\ncan build for it to check that our crate does not inadvertently pull in\\n\\nstd. The unit tests require std, so cannot be run on a `no_std` platform.\\n\\nThe following will fail if a std dependency is present:\\n\\n\\n\\n```\\n\\n# install target with: \\\"rustup target add thumbv7em-none-eabihf\\\"\\n\\ncargo build --no-default-features --target thumbv7em-none-eabihf\\n\\n```\\n\\n\\n\\n## Examples\\n\\n\\n\\n### Example - projecting 3D world coordinates to 2D pixel coordinates.\\n\\n\\n\\n```rust\\n\\nuse cam_geom::*;\\n\\nuse nalgebra::{Matrix2x3, Unit, Vector3};\\n\\n\\n\\n// Create two points in the world coordinate frame.\\n\\nlet world_coords = Points::new(Matrix2x3::new(\\n\\n 1.0, 0.0, 0.0, // point 1\\n\\n 0.0, 1.0, 0.0, // point 2\\n\\n));\\n\\n\\n\\n// perepective parameters - focal length of 100, no skew, pixel center at (640,480)\\n\\nlet intrinsics = IntrinsicParametersPerspective::from(PerspectiveParams {\\n\\n fx: 100.0,\\n\\n fy: 100.0,\\n\\n skew: 0.0,\\n\\n cx: 640.0,\\n\\n cy: 480.0,\\n\\n});\\n\\n\\n\\n// Set extrinsic parameters - camera at (10,0,0), looing at (0,0,0), up (0,0,1)\\n\\nlet camcenter = Vector3::new(10.0, 0.0, 0.0);\\n\\nlet lookat = Vector3::new(0.0, 0.0, 0.0);\\n\\nlet up = Unit::new_normalize(Vector3::new(0.0, 0.0, 1.0));\\n\\nlet pose = ExtrinsicParameters::from_view(&camcenter, &lookat, &up);\\n\\n\\n\\n// Create a `Camera` with both intrinsic and extrinsic parameters.\\n\\nlet camera = Camera::new(intrinsics, pose);\\n\\n\\n\\n// Project the original 3D coordinates to 2D pixel coordinates.\\n\\nlet pixel_coords = camera.world_to_pixel(&world_coords);\\n\\n\\n\\n// Print the results.\\n\\nfor i in 0..world_coords.data.nrows() {\\n\\n let wc = world_coords.data.row(i);\\n\\n let pix = pixel_coords.data.row(i);\\n\\n println!(\\\"{} -> {}\\\", wc, pix);\\n\\n}\\n\\n```\\n\\n\\n\\nThis will print:\\n\\n\\n\\n```\\n\\n ┌ ┐\\n\\n │ 1 0 0 │\\n\\n └ ┘\\n\\n\\n\\n ->\\n\\n ┌ ┐\\n\\n │ 640 480 │\\n\\n └ ┘\\n\\n\\n\\n\\n\\n\\n\\n ┌ ┐\\n\\n │ 0 1 0 │\\n\\n └ ┘\\n\\n\\n\\n ->\\n\\n ┌ ┐\\n\\n │ 650 480 │\\n\\n └ ┘\\n\\n```\\n\\n\\n\\n\\n\",\n \"file_path\": \"README.md\",\n \"rank\": 82,\n \"score\": 25.755761032683992\n },\n {\n \"content\": \"/// let params = PerspectiveParams {\\n\\n/// fx: 100.0,\\n\\n/// fy: 100.0,\\n\\n/// skew: 0.0,\\n\\n/// cx: 640.0,\\n\\n/// cy: 480.0,\\n\\n/// };\\n\\n/// let intrinsics: IntrinsicParametersPerspective<_> = params.into();\\n\\n/// ```\\n\\n#[derive(Debug, Clone, PartialEq)]\\n\\n#[cfg_attr(feature = \\\"serde-serialize\\\", derive(Serialize, Deserialize))]\\n\\npub struct PerspectiveParams<R: RealField> {\\n\\n /// Horizontal focal length.\\n\\n pub fx: R,\\n\\n /// Vertical focal length.\\n\\n pub fy: R,\\n\\n /// Skew between horizontal and vertical axes.\\n\\n pub skew: R,\\n\\n /// Horizontal component of the principal point.\\n\\n pub cx: R,\\n\",\n \"file_path\": \"src/intrinsics_perspective.rs\",\n \"rank\": 83,\n \"score\": 25.57735879071031\n },\n {\n \"content\": \" where\\n\\n DefaultAllocator: Allocator<R, NPTS, U3>,\\n\\n {\\n\\n self.bundle_type.point_on_ray(&self.data)\\n\\n }\\n\\n\\n\\n /// get a 3D point on the ray at a defined distance from the origin(s)\\n\\n #[inline]\\n\\n pub fn point_on_ray_at_distance(\\n\\n &self,\\n\\n distance: R,\\n\\n ) -> Points<Coords, R, NPTS, Owned<R, NPTS, U3>>\\n\\n where\\n\\n DefaultAllocator: Allocator<R, NPTS, U3>,\\n\\n {\\n\\n self.bundle_type\\n\\n .point_on_ray_at_distance(&self.data, distance)\\n\\n }\\n\\n\\n\\n #[inline]\\n\",\n \"file_path\": \"src/lib.rs\",\n \"rank\": 84,\n \"score\": 25.380549224719346\n },\n {\n \"content\": \" self.params.cy.clone()\\n\\n }\\n\\n\\n\\n /// Create a 3x3 projection matrix.\\n\\n #[inline]\\n\\n pub(crate) fn as_intrinsics_matrix(\\n\\n &self,\\n\\n ) -> Matrix<R, U3, U3, SliceStorage<'_, R, U3, U3, U1, U3>> {\\n\\n // TODO: implement similar functionality for orthographic camera and\\n\\n // make a new trait which exposes this functionality. Note that not all\\n\\n // intrinsic parameter implementations will be able to implement this\\n\\n // hypothetical new trait, because not all cameras are linear.\\n\\n self.cache_p.fixed_slice::<3, 3>(0, 0)\\n\\n }\\n\\n}\\n\\n\\n\\nimpl<R> IntrinsicParameters<R> for IntrinsicParametersPerspective<R>\\n\\nwhere\\n\\n R: RealField,\\n\\n{\\n\",\n \"file_path\": \"src/intrinsics_perspective.rs\",\n \"rank\": 85,\n \"score\": 24.883178561565146\n },\n {\n \"content\": \" let cam_dir = &mut result.data;\\n\\n\\n\\n // It seems broadcasting is not (yet) supported in nalgebra, so we loop\\n\\n // through the data. See\\n\\n // https://discourse.nphysics.org/t/array-broadcasting-support/375/3 .\\n\\n\\n\\n for i in 0..pixels.data.nrows() {\\n\\n let u = pixels.data[(i, 0)].clone();\\n\\n let v = pixels.data[(i, 1)].clone();\\n\\n\\n\\n // point in camcoords at distance 1.0 from image plane\\n\\n let y = (v - self.params.cy.clone()) / self.params.fy.clone();\\n\\n cam_dir[(i, 0)] = (u - self.params.skew.clone() * y.clone() - self.params.cx.clone())\\n\\n / self.params.fx.clone(); // x\\n\\n cam_dir[(i, 1)] = y;\\n\\n cam_dir[(i, 2)] = one.clone(); // z\\n\\n }\\n\\n result\\n\\n }\\n\\n\\n\",\n \"file_path\": \"src/intrinsics_perspective.rs\",\n \"rank\": 86,\n \"score\": 24.82773694544442\n },\n {\n \"content\": \" cam_coords: &Points<CameraFrame, R, NPTS, InStorage>,\\n\\n ) -> Points<WorldFrame, R, NPTS, Owned<R, NPTS, U3>>\\n\\n where\\n\\n NPTS: Dim,\\n\\n InStorage: Storage<R, NPTS, U3>,\\n\\n DefaultAllocator: Allocator<R, NPTS, U3>,\\n\\n {\\n\\n let mut world = Points::new(OMatrix::zeros_generic(\\n\\n NPTS::from_usize(cam_coords.data.nrows()),\\n\\n U3::from_usize(3),\\n\\n ));\\n\\n\\n\\n // Potential optimization: remove for loops\\n\\n let in_mult = &cam_coords.data;\\n\\n let out_mult = &mut world.data;\\n\\n\\n\\n for i in 0..in_mult.nrows() {\\n\\n let tmp = self.cache.pose_inv.transform_point(&Point3::new(\\n\\n in_mult[(i, 0)].clone(),\\n\\n in_mult[(i, 1)].clone(),\\n\",\n \"file_path\": \"src/extrinsics.rs\",\n \"rank\": 87,\n \"score\": 24.63546639919511\n },\n {\n \"content\": \" }\\n\\n\\n\\n if approx::relative_ne!(p[(2, 2)], nalgebra::convert(1.0)) {\\n\\n return Err(Error::InvalidInput); // camera matrix must be normalized\\n\\n }\\n\\n\\n\\n if approx::relative_ne!(p[(2, 3)], nalgebra::convert(0.0)) {\\n\\n return Err(Error::InvalidInput);\\n\\n }\\n\\n\\n\\n Ok(params.into())\\n\\n }\\n\\n\\n\\n /// Get X focal length\\n\\n #[inline]\\n\\n pub fn fx(&self) -> R {\\n\\n self.params.fx.clone()\\n\\n }\\n\\n\\n\\n /// Get Y focal length\\n\",\n \"file_path\": \"src/intrinsics_perspective.rs\",\n \"rank\": 88,\n \"score\": 24.402419456233815\n },\n {\n \"content\": \"mod intrinsics_perspective;\\n\\npub use intrinsics_perspective::{IntrinsicParametersPerspective, PerspectiveParams};\\n\\n\\n\\nmod intrinsics_orthographic;\\n\\npub use intrinsics_orthographic::{IntrinsicParametersOrthographic, OrthographicParams};\\n\\n\\n\\nmod extrinsics;\\n\\npub use extrinsics::ExtrinsicParameters;\\n\\n\\n\\nmod camera;\\n\\npub use camera::Camera;\\n\\n\\n\\n/// Defines the different possible types of ray bundles.\\n\\npub mod ray_bundle_types;\\n\\n\\n\\nmod ray_intersection;\\n\\npub use ray_intersection::best_intersection_of_rays;\\n\\n\\n\\npub mod linearize;\\n\\n\\n\",\n \"file_path\": \"src/lib.rs\",\n \"rank\": 90,\n \"score\": 23.53548608496405\n },\n {\n \"content\": \" );\\n\\n\\n\\n let from_params = Camera::new(cam, extrinsics);\\n\\n result.push((\\\"from-params\\\".into(), from_params));\\n\\n\\n\\n // in the future - more cameras\\n\\n\\n\\n result\\n\\n }\\n\\n\\n\\n #[test]\\n\\n #[cfg(feature = \\\"serde-serialize\\\")]\\n\\n fn test_serde() {\\n\\n let params = PerspectiveParams {\\n\\n fx: 100.0,\\n\\n fy: 102.0,\\n\\n skew: 0.1,\\n\\n cx: 321.0,\\n\\n cy: 239.9,\\n\\n };\\n\",\n \"file_path\": \"src/intrinsics_perspective.rs\",\n \"rank\": 91,\n \"score\": 23.250285383354317\n },\n {\n \"content\": \"#![deny(unsafe_code, missing_docs)]\\n\\n\\n\\nuse nalgebra as na;\\n\\n\\n\\nuse na::{\\n\\n allocator::Allocator, base::storage::Owned, DefaultAllocator, Dim, Dynamic, Matrix3, OMatrix,\\n\\n RealField, SMatrix, Vector3, U1, U3,\\n\\n};\\n\\n\\n\\nuse itertools::izip;\\n\\n\\n\\nuse crate::{CoordinateSystem, Error, Points, Ray};\\n\\n\\n\\n/// Iter::Sum is not implemented for R.\\n\\nmacro_rules! sum_as_f64 {\\n\\n ($iter:expr,$R:ty) => {{\\n\\n $iter\\n\\n .map(|x| na::try_convert::<$R, f64>(x.clone()).unwrap())\\n\\n .sum()\\n\\n }};\\n\",\n \"file_path\": \"src/ray_intersection.rs\",\n \"rank\": 92,\n \"score\": 23.23541401194915\n },\n {\n \"content\": \"\\n\\n fn get_test_cameras() -> Vec<(String, Camera<f64, IntrinsicParametersPerspective<f64>>)> {\\n\\n let mut result = Vec::new();\\n\\n\\n\\n // camera 1 - from perspective parameters\\n\\n let params = PerspectiveParams {\\n\\n fx: 100.0,\\n\\n fy: 102.0,\\n\\n skew: 0.1,\\n\\n cx: 321.0,\\n\\n cy: 239.9,\\n\\n };\\n\\n\\n\\n let cam: IntrinsicParametersPerspective<_> = params.into();\\n\\n roundtrip_intrinsics(&cam, 640, 480, 5, 0, nalgebra::convert(1e-10));\\n\\n\\n\\n let extrinsics = ExtrinsicParameters::from_view(\\n\\n &Vector3::new(1.2, 3.4, 5.6), // camcenter\\n\\n &Vector3::new(2.2, 3.4, 5.6), // lookat\\n\\n &nalgebra::Unit::new_normalize(Vector3::new(0.0, 0.0, 1.0)), // up\\n\",\n \"file_path\": \"src/intrinsics_perspective.rs\",\n \"rank\": 93,\n \"score\": 23.22266495132496\n },\n {\n \"content\": \"//! Linearize camera models by computing the Jacobian matrix.\\n\\n\\n\\nuse crate::{Camera, IntrinsicParametersPerspective, Points, WorldFrame};\\n\\nuse nalgebra::{storage::Storage, RealField, SMatrix, U1, U3};\\n\\n\\n\\n/// Required data required for finding Jacobian of perspective camera models.\\n\\n///\\n\\n/// Create this with the [`new()`](struct.JacobianPerspectiveCache.html#method.new) method.\\n\\npub struct JacobianPerspectiveCache<R: RealField> {\\n\\n m: SMatrix<R, 3, 4>,\\n\\n}\\n\\n\\n\\nimpl<R: RealField> JacobianPerspectiveCache<R> {\\n\\n /// Create a new `JacobianPerspectiveCache` from a `Camera` with a perspective model.\\n\\n pub fn new(cam: &Camera<R, IntrinsicParametersPerspective<R>>) -> Self {\\n\\n let m = {\\n\\n let p33 = cam.intrinsics().as_intrinsics_matrix();\\n\\n p33 * cam.extrinsics().matrix()\\n\\n };\\n\\n\\n\",\n \"file_path\": \"src/linearize.rs\",\n \"rank\": 94,\n \"score\": 23.11128427585163\n },\n {\n \"content\": \" DefaultAllocator: Allocator<R, NPTS, U3>,\\n\\n{\\n\\n /// get directions of each ray in bundle\\n\\n #[inline]\\n\\n pub fn directions(&self) -> Matrix<R, NPTS, U3, Owned<R, NPTS, U3>> {\\n\\n self.bundle_type.directions(&self.data)\\n\\n }\\n\\n\\n\\n /// get centers (origins) of each ray in bundle\\n\\n #[inline]\\n\\n pub fn centers(&self) -> Matrix<R, NPTS, U3, Owned<R, NPTS, U3>> {\\n\\n self.bundle_type.centers(&self.data)\\n\\n }\\n\\n}\\n\\n\\n\\nimpl<Coords, BType, R> RayBundle<Coords, BType, R, U1, Owned<R, U1, U3>>\\n\\nwhere\\n\\n Coords: CoordinateSystem,\\n\\n BType: Bundle<R>,\\n\\n R: RealField,\\n\",\n \"file_path\": \"src/lib.rs\",\n \"rank\": 95,\n \"score\": 23.1032511135329\n },\n {\n \"content\": \"where\\n\\n Coords: CoordinateSystem,\\n\\n BType: Bundle<R>,\\n\\n R: RealField,\\n\\n NPTS: Dim,\\n\\n StorageMultiple: Storage<R, NPTS, U3>,\\n\\n{\\n\\n coords: std::marker::PhantomData<Coords>,\\n\\n /// The matrix storing the ray data.\\n\\n pub data: Matrix<R, NPTS, U3, StorageMultiple>,\\n\\n bundle_type: BType,\\n\\n}\\n\\n\\n\\nimpl<Coords, BType, R, NPTS, StorageMultiple> RayBundle<Coords, BType, R, NPTS, StorageMultiple>\\n\\nwhere\\n\\n Coords: CoordinateSystem,\\n\\n BType: Bundle<R>,\\n\\n R: RealField,\\n\\n NPTS: DimName,\\n\\n StorageMultiple: Storage<R, NPTS, U3>,\\n\",\n \"file_path\": \"src/lib.rs\",\n \"rank\": 96,\n \"score\": 22.929327902789414\n },\n {\n \"content\": \"\\n\\n fn roundtrip_generic<R: RealField>(epsilon: R) {\\n\\n let zero: R = convert(0.0);\\n\\n let one: R = convert(1.0);\\n\\n\\n\\n let e1 = ExtrinsicParameters::<R>::from_view(\\n\\n &Vector3::new(c(1.2), c(3.4), c(5.6)), // camcenter\\n\\n &Vector3::new(c(2.2), c(3.4), c(5.6)), // lookat\\n\\n &nalgebra::Unit::new_normalize(Vector3::new(zero.clone(), zero.clone(), one.clone())), // up\\n\\n );\\n\\n\\n\\n #[rustfmt::skip]\\n\\n let cam_coords = Points {\\n\\n coords: std::marker::PhantomData,\\n\\n data: SMatrix::<R, 4, 3>::new(\\n\\n zero.clone(), zero.clone(), zero.clone(), // at camera center\\n\\n zero.clone(), zero.clone(), one.clone(), // one unit in +Z - exactly in camera direction\\n\\n one.clone(), zero.clone(), zero.clone(), // one unit in +X - right of camera axis\\n\\n zero.clone(), one.clone(), zero.clone(), // one unit in +Y - down from camera axis\\n\\n ),\\n\",\n \"file_path\": \"src/extrinsics.rs\",\n \"rank\": 97,\n \"score\": 22.421653754135733\n },\n {\n \"content\": \" }\\n\\n\\n\\n /// Return a unit vector aligned along our right (+X) direction.\\n\\n pub fn right(&self) -> Unit<Vector3<R>> {\\n\\n let pt_cam = Point3::new(R::one(), R::zero(), R::zero());\\n\\n self.lookdir(&pt_cam)\\n\\n }\\n\\n\\n\\n /// Return a world coords unit vector aligned along the given direction\\n\\n ///\\n\\n /// `pt_cam` is specified in camera coords.\\n\\n fn lookdir(&self, pt_cam: &Point3<R>) -> Unit<Vector3<R>> {\\n\\n let cc = self.camcenter();\\n\\n let pt = self.cache.pose_inv.transform_point(&pt_cam) - cc;\\n\\n nalgebra::Unit::new_normalize(pt)\\n\\n }\\n\\n\\n\\n /// Convert points in camera coordinates to world coordinates.\\n\\n pub fn camera_to_world<NPTS, InStorage>(\\n\\n &self,\\n\",\n \"file_path\": \"src/extrinsics.rs\",\n \"rank\": 98,\n \"score\": 22.183906081320956\n },\n {\n \"content\": \" /// can be arbitrary.\\n\\n fn point_on_ray<NPTS, StorageIn, OutFrame>(\\n\\n &self,\\n\\n self_data: &Matrix<R, NPTS, U3, StorageIn>,\\n\\n ) -> Points<OutFrame, R, NPTS, Owned<R, NPTS, U3>>\\n\\n where\\n\\n Self: Sized,\\n\\n NPTS: Dim,\\n\\n StorageIn: Storage<R, NPTS, U3>,\\n\\n OutFrame: CoordinateSystem,\\n\\n DefaultAllocator: Allocator<R, NPTS, U3>;\\n\\n\\n\\n /// Return points on on the input rays at a defined distance from the origin(s).\\n\\n fn point_on_ray_at_distance<NPTS, StorageIn, OutFrame>(\\n\\n &self,\\n\\n self_data: &Matrix<R, NPTS, U3, StorageIn>,\\n\\n distance: R,\\n\\n ) -> Points<OutFrame, R, NPTS, Owned<R, NPTS, U3>>\\n\\n where\\n\\n Self: Sized,\\n\",\n \"file_path\": \"src/lib.rs\",\n \"rank\": 99,\n \"score\": 21.99919840424277\n }\n]","isConversational":false}}},{"rowIdx":2350,"cells":{"lang":{"kind":"string","value":"Rust"},"file_path":{"kind":"string","value":"src/handler/description.rs"},"repo_name":{"kind":"string","value":"p0lunin/dptree"},"commit":{"kind":"string","value":"cf41f052a864e145ef600faf79a1dff186b5a905"},"file_code":{"kind":"string","value":"\n\nuse core::mem;\nuse std::{\n collections::{hash_map::RandomState, HashSet},\n hash::{BuildHasher, Hash},\n};\n\npub trait HandlerDescription: Sized + Send + Sync + 'static {\n \n fn entry() -> Self;\n\n \n \n fn user_defined() -> Self;\n\n \n fn merge_chain(&self, other: &Self) -> Self;\n\n \n fn merge_branch(&self, other: &Self) -> Self;\n\n \n \n \n \n \n \n #[track_caller]\n fn map() -> Self {\n Self::user_defined()\n }\n\n \n \n \n \n \n \n #[track_caller]\n fn map_async() -> Self {\n Self::user_defined()\n }\n\n \n \n \n \n \n \n #[track_caller]\n fn filter() -> Self {\n Self::user_defined()\n }\n\n \n \n \n \n \n \n #[track_caller]\n fn filter_async() -> Self {\n Self::user_defined()\n }\n\n \n \n \n \n \n \n #[track_caller]\n fn filter_map() -> Self {\n Self::user_defined()\n }\n\n \n \n \n \n \n \n #[track_caller]\n fn filter_map_async() -> Self {\n Self::user_defined()\n }\n\n \n \n \n \n \n \n #[track_caller]\n fn endpoint() -> Self {\n Self::user_defined()\n }\n}\n\n#[derive(Debug, PartialEq, Eq)]\npub struct Unspecified(());\n\n#[derive(Debug, Clone)]\npub enum EventKind<K, S = RandomState> {\n \n InterestList(HashSet<K, S>),\n \n UserDefined,\n \n Entry,\n}\n\nimpl<T, S> HandlerDescription for EventKind<T, S>\nwhere\n T: Eq + Hash + Clone,\n S: BuildHasher + Clone,\n T: Send + Sync + 'static,\n S: Send + Sync + 'static,\n{\n fn entry() -> Self {\n EventKind::Entry\n }\n\n fn user_defined() -> Self {\n EventKind::UserDefined\n }\n\n fn merge_chain(&self, other: &Self) -> Self {\n use EventKind::*;\n\n match (self, other) {\n \n \n \n (Entry, other) | (other, Entry) => other.clone(),\n \n \n (InterestList(l), InterestList(r)) => {\n let hasher = l.hasher().clone();\n let mut res = HashSet::with_hasher(hasher);\n\n res.extend(l.intersection(r).cloned());\n\n InterestList(res)\n }\n \n \n (InterestList(known), UserDefined) => InterestList(known.clone()),\n \n \n (UserDefined, _) => UserDefined,\n }\n }\n\n fn merge_branch(&self, other: &Self) -> Self {\n use EventKind::*;\n\n match (self, other) {\n \n \n \n (Entry, other) | (other, Entry) => other.clone(),\n \n \n (InterestList(l), InterestList(r)) => {\n let hasher = l.hasher().clone();\n let mut res = HashSet::with_hasher(hasher);\n res.extend(l.union(r).cloned());\n\n InterestList(res)\n }\n \n (UserDefined, _) | (_, UserDefined) => UserDefined,\n }\n }\n}\n\nimpl<K: Hash + Eq, S: BuildHasher> Eq for EventKind<K, S> {}\n\nimpl<K: Hash + Eq, S: BuildHasher> PartialEq for EventKind<K, S> {\n fn eq(&self, other: &Self) -> bool {\n match (self, other) {\n (Self::InterestList(l), Self::InterestList(r)) => l == r,\n _ => mem::discriminant(self) == mem::discriminant(other),\n }\n }\n}\n\nimpl HandlerDescription for Unspecified {\n fn entry() -> Self {\n Self(())\n }\n\n fn user_defined() -> Self {\n Self(())\n }\n\n fn merge_chain(&self, _other: &Self) -> Self {\n Self(())\n }\n\n fn merge_branch(&self, _other: &Self) -> Self {\n Self(())\n }\n}\n"},"prefix":{"kind":"string","value":"\n\nuse core::mem;\nuse std::{\n collections::{hash_map::RandomState, HashSet},\n hash::{BuildHasher, Hash},\n};\n\npub trait HandlerDescription: Sized + Send + Sync + 'static {\n \n fn entry() -> Self;\n\n \n \n fn user_defined() -> Self;\n\n \n fn merge_chain(&self, other: &Self) -> Self;\n\n \n fn merge_branch(&self, other: &Self) -> Self;\n\n \n \n \n \n \n \n #[track_caller]\n fn map() -> Self {\n Self::user_defined()\n }\n\n \n \n \n \n \n \n #[track_caller]\n fn map_async() -> Self {\n Self::user_defined()\n }\n\n \n \n \n \n \n \n #[track_caller]\n fn filter() -> Self {\n Self::user_defined()\n }\n\n \n \n \n \n \n \n #[track_caller]\n fn filter_async() -> Self {\n Self::user_defined()\n }\n\n \n \n \n \n \n \n #[track_caller]\n fn filter_map() -> Self {\n Self::user_defined()\n }\n\n \n \n \n \n \n \n #[track_caller]\n fn filter_map_async() -> Self {\n Self::user_defined()\n }\n\n \n \n \n \n \n \n #[track_caller]\n fn endpoint() -> Self {\n Self::user_defined()\n }\n}\n\n#[derive(Debug, PartialEq, Eq)]\npub struct Unspecified(());\n\n#[derive(Debug, Clone)]\npub enum EventKind<K, S = RandomState> {\n \n InterestList(HashSet<K, S>),\n \n UserDefined,\n \n Entry,\n}\n\nimpl<T, S> HandlerDescription for EventKind<T, S>\nwhere\n T: Eq + Hash + Clone,\n S: BuildHasher + Clone,\n T: Send + Sync + 'static,\n S: Send + Sync + 'static,\n{\n fn entry() -> Self {\n EventKind::Entry\n }\n\n fn user_defined() -> Self {\n EventKind::UserDefined\n }\n\n fn merge_chain(&self, other: &Self) -> Self {\n use EventKin"},"suffix":{"kind":"string","value":"\n\n fn merge_branch(&self, other: &Self) -> Self {\n use EventKind::*;\n\n match (self, other) {\n \n \n \n (Entry, other) | (other, Entry) => other.clone(),\n \n \n (InterestList(l), InterestList(r)) => {\n let hasher = l.hasher().clone();\n let mut res = HashSet::with_hasher(hasher);\n res.extend(l.union(r).cloned());\n\n InterestList(res)\n }\n \n (UserDefined, _) | (_, UserDefined) => UserDefined,\n }\n }\n}\n\nimpl<K: Hash + Eq, S: BuildHasher> Eq for EventKind<K, S> {}\n\nimpl<K: Hash + Eq, S: BuildHasher> PartialEq for EventKind<K, S> {\n fn eq(&self, other: &Self) -> bool {\n match (self, other) {\n (Self::InterestList(l), Self::InterestList(r)) => l == r,\n _ => mem::discriminant(self) == mem::discriminant(other),\n }\n }\n}\n\nimpl HandlerDescription for Unspecified {\n fn entry() -> Self {\n Self(())\n }\n\n fn user_defined() -> Self {\n Self(())\n }\n\n fn merge_chain(&self, _other: &Self) -> Self {\n Self(())\n }\n\n fn merge_branch(&self, _other: &Self) -> Self {\n Self(())\n }\n}\n"},"middle":{"kind":"string","value":"d::*;\n\n match (self, other) {\n \n \n \n (Entry, other) | (other, Entry) => other.clone(),\n \n \n (InterestList(l), InterestList(r)) => {\n let hasher = l.hasher().clone();\n let mut res = HashSet::with_hasher(hasher);\n\n res.extend(l.intersection(r).cloned());\n\n InterestList(res)\n }\n \n \n (InterestList(known), UserDefined) => InterestList(known.clone()),\n \n \n (UserDefined, _) => UserDefined,\n }\n }"},"strategy":{"kind":"string","value":"function_block-function_prefixed"},"context_items":{"kind":"list like","value":[{"content":"#[must_use]\n\n#[track_caller]\n\npub fn filter_map<'a, Projection, Input, Output, NewType, Args, Descr>(\n\n proj: Projection,\n\n) -> Handler<'a, Input, Output, Descr>\n\nwhere\n\n Input: Clone,\n\n Asyncify<Projection>: Injectable<Input, Option<NewType>, Args> + Send + Sync + 'a,\n\n Input: Insert<NewType> + Send + Sync + 'a,\n\n Output: Send + Sync + 'a,\n\n Descr: HandlerDescription,\n\n NewType: Send,\n\n{\n\n filter_map_with_description(Descr::filter_map(), proj)\n\n}\n\n\n\n/// The asynchronous version of [`filter_map`].\n","file_path":"src/handler/filter_map.rs","rank":1,"score":134620.9475768156},{"content":"#[must_use]\n\n#[track_caller]\n\npub fn filter_map_async<'a, Projection, Input, Output, NewType, Args, Descr>(\n\n proj: Projection,\n\n) -> Handler<'a, Input, Output, Descr>\n\nwhere\n\n Input: Clone,\n\n Projection: Injectable<Input, Option<NewType>, Args> + Send + Sync + 'a,\n\n Input: Insert<NewType> + Send + Sync + 'a,\n\n Output: Send + Sync + 'a,\n\n Descr: HandlerDescription,\n\n NewType: Send,\n\n{\n\n filter_map_async_with_description(Descr::filter_map_async(), proj)\n\n}\n\n\n\n/// [`filter_map`] with a custom description.\n","file_path":"src/handler/filter_map.rs","rank":2,"score":132341.3470980578},{"content":"#[must_use]\n\n#[track_caller]\n\npub fn filter<'a, Pred, Input, Output, FnArgs, Descr>(\n\n pred: Pred,\n\n) -> Handler<'a, Input, Output, Descr>\n\nwhere\n\n Asyncify<Pred>: Injectable<Input, bool, FnArgs> + Send + Sync + 'a,\n\n Input: Send + Sync + 'a,\n\n Output: Send + Sync + 'a,\n\n Descr: HandlerDescription,\n\n{\n\n filter_with_description(Descr::filter(), pred)\n\n}\n\n\n\n/// The asynchronous version of [`filter`].\n","file_path":"src/handler/filter.rs","rank":3,"score":123583.6605678803},{"content":"#[must_use]\n\n#[track_caller]\n\npub fn filter_async<'a, Pred, Input, Output, FnArgs, Descr>(\n\n pred: Pred,\n\n) -> Handler<'a, Input, Output, Descr>\n\nwhere\n\n Pred: Injectable<Input, bool, FnArgs> + Send + Sync + 'a,\n\n Input: Send + Sync + 'a,\n\n Output: Send + Sync + 'a,\n\n Descr: HandlerDescription,\n\n{\n\n filter_async_with_description(Descr::filter_async(), pred)\n\n}\n\n\n\n/// [`filter`] with a custom description.\n","file_path":"src/handler/filter.rs","rank":4,"score":121573.83767211685},{"content":"#[must_use]\n\npub fn filter_map_with_description<'a, Projection, Input, Output, NewType, Args, Descr>(\n\n description: Descr,\n\n proj: Projection,\n\n) -> Handler<'a, Input, Output, Descr>\n\nwhere\n\n Input: Clone,\n\n Asyncify<Projection>: Injectable<Input, Option<NewType>, Args> + Send + Sync + 'a,\n\n Input: Insert<NewType> + Send + Sync + 'a,\n\n Output: Send + Sync + 'a,\n\n NewType: Send,\n\n{\n\n filter_map_async_with_description(description, Asyncify(proj))\n\n}\n\n\n\n/// [`filter_map_async`] with a custom description.\n","file_path":"src/handler/filter_map.rs","rank":5,"score":115372.80738819794},{"content":"#[must_use]\n\n#[track_caller]\n\npub fn endpoint<'a, F, Input, Output, FnArgs, Descr>(f: F) -> Endpoint<'a, Input, Output, Descr>\n\nwhere\n\n Input: Send + Sync + 'a,\n\n Output: Send + Sync + 'a,\n\n Descr: HandlerDescription,\n\n F: Injectable<Input, Output, FnArgs> + Send + Sync + 'a,\n\n{\n\n let f = Arc::new(f);\n\n\n\n from_fn_with_description(Descr::endpoint(), move |x, _cont| {\n\n let f = Arc::clone(&f);\n\n async move {\n\n let f = f.inject(&x);\n\n f().map(ControlFlow::Break).await\n\n }\n\n })\n\n}\n\n\n\n/// A handler with no further handlers in a chain.\n\npub type Endpoint<'a, Input, Output, Descr = description::Unspecified> =\n","file_path":"src/handler/endpoint.rs","rank":6,"score":114802.3962339515},{"content":"#[must_use]\n\npub fn filter_map_async_with_description<'a, Projection, Input, Output, NewType, Args, Descr>(\n\n description: Descr,\n\n proj: Projection,\n\n) -> Handler<'a, Input, Output, Descr>\n\nwhere\n\n Input: Clone,\n\n Projection: Injectable<Input, Option<NewType>, Args> + Send + Sync + 'a,\n\n Input: Insert<NewType> + Send + Sync + 'a,\n\n Output: Send + Sync + 'a,\n\n NewType: Send,\n\n{\n\n let proj = Arc::new(proj);\n\n\n\n from_fn_with_description(description, move |container: Input, cont| {\n\n let proj = Arc::clone(&proj);\n\n\n\n async move {\n\n let proj = proj.inject(&container);\n\n let res = proj().await;\n\n std::mem::drop(proj);\n","file_path":"src/handler/filter_map.rs","rank":7,"score":113208.22495815501},{"content":"#[must_use]\n\n#[track_caller]\n\npub fn map<'a, Projection, Input, Output, NewType, Args, Descr>(\n\n proj: Projection,\n\n) -> Handler<'a, Input, Output, Descr>\n\nwhere\n\n Input: Clone,\n\n Asyncify<Projection>: Injectable<Input, NewType, Args> + Send + Sync + 'a,\n\n Input: Insert<NewType> + Send + Sync + 'a,\n\n Output: Send + Sync + 'a,\n\n Descr: HandlerDescription,\n\n NewType: Send,\n\n{\n\n map_with_description(Descr::map(), proj)\n\n}\n\n\n\n/// The asynchronous version of [`map`].\n","file_path":"src/handler/map.rs","rank":8,"score":111413.53768491725},{"content":"#[must_use]\n\n#[track_caller]\n\npub fn map_async<'a, Projection, Input, Output, NewType, Args, Descr>(\n\n proj: Projection,\n\n) -> Handler<'a, Input, Output, Descr>\n\nwhere\n\n Input: Clone,\n\n Projection: Injectable<Input, NewType, Args> + Send + Sync + 'a,\n\n Input: Insert<NewType> + Send + Sync + 'a,\n\n Output: Send + Sync + 'a,\n\n Descr: HandlerDescription,\n\n NewType: Send,\n\n{\n\n map_async_with_description(Descr::map_async(), proj)\n\n}\n\n\n\n/// [`map`] with a custom description.\n","file_path":"src/handler/map.rs","rank":9,"score":109518.94596720312},{"content":"/// Converts functions into [`CompiledFn`].\n\n///\n\n/// The function must follow some rules, to be usable with DI:\n\n///\n\n/// 1. For each function parameter of type `T`, `Input` must satisfy\n\n/// `DependencySupplier<T>`.\n\n/// 2. The function must be of 0-9 arguments.\n\n/// 3. The function must return [`Future`].\n\npub trait Injectable<Input, Output, FnArgs> {\n\n fn inject<'a>(&'a self, container: &'a Input) -> CompiledFn<'a, Output>;\n\n}\n\n\n\n/// A function with all dependencies satisfied.\n\npub type CompiledFn<'a, Output> = Arc<dyn Fn() -> BoxFuture<'a, Output> + Send + Sync + 'a>;\n\n\n\n/// Turns a synchronous function into a type that implements [`Injectable`].\n\npub struct Asyncify<F>(pub F);\n\n\n\nmacro_rules! impl_into_di {\n\n ($($generic:ident),*) => {\n\n impl<Func, Input, Output, Fut, $($generic),*> Injectable<Input, Output, ($($generic,)*)> for Func\n\n where\n\n Input: $(DependencySupplier<$generic> +)*,\n\n Input: Send + Sync,\n\n Func: Fn($($generic),*) -> Fut + Send + Sync + 'static,\n\n Fut: Future<Output = Output> + Send + 'static,\n\n $($generic: Clone + Send + Sync),*\n\n {\n","file_path":"src/di.rs","rank":10,"score":105983.6501492435},{"content":"type WebHandler = Endpoint<'static, DependencyMap, String>;\n\n\n\n#[rustfmt::skip]\n\n#[tokio::main]\n\nasync fn main() {\n\n let web_server = dptree::entry()\n\n .branch(smiles_handler())\n\n .branch(sqrt_handler())\n\n .branch(not_found_handler());\n\n\n\n assert_eq!(\n\n web_server.dispatch(dptree::deps![\"/smile\"]).await,\n\n ControlFlow::Break(\"🙃\".to_owned())\n\n );\n\n assert_eq!(\n\n web_server.dispatch(dptree::deps![\"/sqrt 16\"]).await,\n\n ControlFlow::Break(\"4\".to_owned())\n\n );\n\n assert_eq!(\n\n web_server.dispatch(dptree::deps![\"/lol\"]).await,\n\n ControlFlow::Break(\"404 Not Found\".to_owned())\n\n );\n\n}\n\n\n","file_path":"examples/web_server.rs","rank":11,"score":104249.69858306258},{"content":"type CommandHandler = Endpoint<'static, DependencyMap, String>;\n\n\n","file_path":"examples/simple_dispatcher.rs","rank":12,"score":104249.69858306258},{"content":"#[must_use]\n\npub fn filter_with_description<'a, Pred, Input, Output, FnArgs, Descr>(\n\n description: Descr,\n\n pred: Pred,\n\n) -> Handler<'a, Input, Output, Descr>\n\nwhere\n\n Asyncify<Pred>: Injectable<Input, bool, FnArgs> + Send + Sync + 'a,\n\n Input: Send + Sync + 'a,\n\n Output: Send + Sync + 'a,\n\n{\n\n filter_async_with_description(description, Asyncify(pred))\n\n}\n\n\n\n/// [`filter_async`] with a custom description.\n","file_path":"src/handler/filter.rs","rank":13,"score":103852.26714478101},{"content":"#[must_use]\n\npub fn filter_async_with_description<'a, Pred, Input, Output, FnArgs, Descr>(\n\n description: Descr,\n\n pred: Pred,\n\n) -> Handler<'a, Input, Output, Descr>\n\nwhere\n\n Pred: Injectable<Input, bool, FnArgs> + Send + Sync + 'a,\n\n Input: Send + Sync + 'a,\n\n Output: Send + Sync + 'a,\n\n{\n\n let pred = Arc::new(pred);\n\n\n\n from_fn_with_description(description, move |event, cont| {\n\n let pred = Arc::clone(&pred);\n\n\n\n async move {\n\n let pred = pred.inject(&event);\n\n let cond = pred().await;\n\n drop(pred);\n\n\n\n if cond {\n","file_path":"src/handler/filter.rs","rank":14,"score":101946.93555320262},{"content":"/// Insert some value to a container.\n\npub trait Insert<Value> {\n\n /// Inserts `value` into itself, returning the previous value, if exists.\n\n fn insert(&mut self, value: Value) -> Option<Arc<Value>>;\n\n}\n\n\n\nimpl<T: Send + Sync + 'static> Insert<T> for DependencyMap {\n\n fn insert(&mut self, value: T) -> Option<Arc<T>> {\n\n DependencyMap::insert(self, value)\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 get() {\n\n let mut map = DependencyMap::new();\n\n map.insert(42i32);\n\n map.insert(\"hello world\");\n\n map.insert_container(deps![true]);\n\n\n\n assert_eq!(map.get(), Arc::new(42i32));\n\n assert_eq!(map.get(), Arc::new(\"hello world\"));\n\n assert_eq!(map.get(), Arc::new(true));\n\n }\n\n}\n","file_path":"src/di.rs","rank":15,"score":93927.88749866367},{"content":"#[must_use]\n\npub fn map_with_description<'a, Projection, Input, Output, NewType, Args, Descr>(\n\n description: Descr,\n\n proj: Projection,\n\n) -> Handler<'a, Input, Output, Descr>\n\nwhere\n\n Input: Clone,\n\n Asyncify<Projection>: Injectable<Input, NewType, Args> + Send + Sync + 'a,\n\n Input: Insert<NewType> + Send + Sync + 'a,\n\n Output: Send + Sync + 'a,\n\n Descr: HandlerDescription,\n\n NewType: Send,\n\n{\n\n map_async_with_description(description, Asyncify(proj))\n\n}\n\n\n\n/// [`map_async`] with a custom description.\n","file_path":"src/handler/map.rs","rank":16,"score":92550.40625734326},{"content":"/// A DI container from which we can extract a value of a given type.\n\n///\n\n/// There are two possible ways to handle the situation when your container\n\n/// cannot return a value of specified type:\n\n///\n\n/// 1. Do not implement [`DependencySupplier`] for the type. It often requires\n\n/// some type-level manipulations.\n\n/// 2. Runtime panic. Be careful in this case: check whether you add your type\n\n/// to the container.\n\n///\n\n/// A concrete solution is left to a particular implementation.\n\npub trait DependencySupplier<Value> {\n\n /// Get the value.\n\n ///\n\n /// We assume that all values are stored in `Arc<_>`.\n\n fn get(&self) -> Arc<Value>;\n\n}\n\n\n\n/// A DI container with multiple dependencies.\n\n///\n\n/// This DI container stores types by their corresponding type identifiers. It\n\n/// cannot prove at compile-time that a type of a requested value exists within\n\n/// the container, so if you do not provide necessary types but they were\n\n/// requested, it will panic.\n\n///\n\n/// # Examples\n\n///\n\n/// ```\n\n/// # use std::sync::Arc;\n\n/// use dptree::di::{DependencyMap, DependencySupplier};\n\n///\n","file_path":"src/di.rs","rank":17,"score":91777.26195894007},{"content":"#[must_use]\n\npub fn map_async_with_description<'a, Projection, Input, Output, NewType, Args, Descr>(\n\n description: Descr,\n\n proj: Projection,\n\n) -> Handler<'a, Input, Output, Descr>\n\nwhere\n\n Input: Clone,\n\n Projection: Injectable<Input, NewType, Args> + Send + Sync + 'a,\n\n Input: Insert<NewType> + Send + Sync + 'a,\n\n Output: Send + Sync + 'a,\n\n Descr: HandlerDescription,\n\n NewType: Send,\n\n{\n\n let proj = Arc::new(proj);\n\n\n\n from_fn_with_description(description, move |container: Input, cont| {\n\n let proj = Arc::clone(&proj);\n\n\n\n async move {\n\n let proj = proj.inject(&container);\n\n let res = proj().await;\n","file_path":"src/handler/map.rs","rank":18,"score":90762.42975638456},{"content":"type Transition = Endpoint<'static, Store, TransitionOut>;\n","file_path":"examples/state_machine.rs","rank":19,"score":86366.62315577304},{"content":"#[must_use]\n\n#[track_caller]\n\npub fn entry<'a, Input, Output, Descr>() -> Handler<'a, Input, Output, Descr>\n\nwhere\n\n Input: Send + Sync + 'a,\n\n Output: Send + Sync + 'a,\n\n Descr: HandlerDescription,\n\n{\n\n from_fn_with_description(Descr::entry(), |event, cont| cont(event))\n\n}\n\n\n\n#[cfg(test)]\n\npub(crate) fn help_inference<I, O>(h: Handler<I, O>) -> Handler<I, O> {\n\n h\n\n}\n\n\n\n#[cfg(test)]\n\nmod tests {\n\n use maplit::hashset;\n\n\n\n use crate::{\n\n deps, description, filter_map, filter_map_with_description,\n","file_path":"src/handler/core.rs","rank":20,"score":84623.40106453602},{"content":"#[track_caller]\n\nfn collector(name: &'static str) -> CollectLocations {\n\n CollectLocations { locations: vec![(name, Location::caller())] }\n\n}\n\n\n\nimpl HandlerDescription for CollectLocations {\n\n #[track_caller]\n\n fn entry() -> Self {\n\n collector(\"entry\")\n\n }\n\n\n\n #[track_caller]\n\n fn user_defined() -> Self {\n\n collector(\"user_defined\")\n\n }\n\n\n\n #[track_caller]\n\n fn merge_chain(&self, other: &Self) -> Self {\n\n let locations = self\n\n .locations\n\n .iter()\n","file_path":"examples/descr_locations.rs","rank":21,"score":79092.6021451737},{"content":"#[must_use]\n\npub fn from_fn_with_description<'a, F, Fut, Input, Output, Descr>(\n\n description: Descr,\n\n f: F,\n\n) -> Handler<'a, Input, Output, Descr>\n\nwhere\n\n F: Fn(Input, Cont<'a, Input, Output>) -> Fut,\n\n F: Send + Sync + 'a,\n\n Fut: Future<Output = ControlFlow<Output, Input>> + Send + 'a,\n\n{\n\n Handler {\n\n data: Arc::new(HandlerData {\n\n f: move |event, cont| Box::pin(f(event, cont)) as HandlerResult<_, _>,\n\n description,\n\n }),\n\n }\n\n}\n\n\n\n/// Constructs an entry point handler.\n\n///\n\n/// This function is only used to specify other handlers upon it (see the root\n\n/// examples).\n","file_path":"src/handler/core.rs","rank":22,"score":77034.3110163111},{"content":"struct HandlerData<Descr, F: ?Sized> {\n\n description: Descr,\n\n f: F,\n\n}\n\n\n","file_path":"src/handler/core.rs","rank":23,"score":68033.50362159465},{"content":"#[must_use]\n\npub fn from_fn<'a, F, Fut, Input, Output, Descr>(f: F) -> Handler<'a, Input, Output, Descr>\n\nwhere\n\n F: Fn(Input, Cont<'a, Input, Output>) -> Fut + Send + Sync + 'a,\n\n Fut: Future<Output = ControlFlow<Output, Input>> + Send + 'a,\n\n Descr: HandlerDescription,\n\n{\n\n from_fn_with_description(Descr::user_defined(), f)\n\n}\n\n\n\n/// [`from_fn`] with a custom description.\n","file_path":"src/handler/core.rs","rank":24,"score":65341.30427542399},{"content":"#[derive(Clone)]\n\nstruct Dependency {\n\n type_name: &'static str,\n\n inner: Arc<dyn Any + Send + Sync>,\n\n}\n\n\n\nimpl PartialEq for DependencyMap {\n\n fn eq(&self, other: &Self) -> bool {\n\n let keys1 = self.map.keys();\n\n let keys2 = other.map.keys();\n\n keys1.zip(keys2).map(|(k1, k2)| k1 == k2).all(|x| x)\n\n }\n\n}\n\n\n\nimpl DependencyMap {\n\n pub fn new() -> Self {\n\n Self::default()\n\n }\n\n\n\n /// Inserts a value into the container.\n\n ///\n","file_path":"src/di.rs","rank":25,"score":54261.94131157676},{"content":"use crate::{\n\n di::{Asyncify, Injectable, Insert},\n\n from_fn_with_description, Handler, HandlerDescription,\n\n};\n\nuse std::{ops::ControlFlow, sync::Arc};\n\n\n\n/// Constructs a handler that optionally passes a value of a new type further.\n\n///\n\n/// If the `proj` function returns `Some(v)` then `v` will be added to the\n\n/// container and passed further in a handler chain. If the function returns\n\n/// `None`, then the handler will return [`ControlFlow::Continue`] with the old\n\n/// container.\n\n#[must_use]\n\n#[track_caller]\n","file_path":"src/handler/filter_map.rs","rank":26,"score":53972.53157666978},{"content":"\n\n match res {\n\n Some(new_type) => {\n\n let mut intermediate = container.clone();\n\n intermediate.insert(new_type);\n\n match cont(intermediate).await {\n\n ControlFlow::Continue(_) => ControlFlow::Continue(container),\n\n ControlFlow::Break(result) => ControlFlow::Break(result),\n\n }\n\n }\n\n None => ControlFlow::Continue(container),\n\n }\n\n }\n\n })\n\n}\n\n\n\n#[cfg(test)]\n\nmod tests {\n\n use super::*;\n\n use crate::{deps, help_inference};\n","file_path":"src/handler/filter_map.rs","rank":27,"score":53968.43611763874},{"content":"\n\n #[tokio::test]\n\n async fn test_some() {\n\n let value = 123;\n\n\n\n let result = help_inference(filter_map(move || Some(value)))\n\n .endpoint(move |event: i32| async move {\n\n assert_eq!(event, value);\n\n value\n\n })\n\n .dispatch(deps![])\n\n .await;\n\n\n\n assert!(result == ControlFlow::Break(value));\n\n }\n\n\n\n #[tokio::test]\n\n async fn test_none() {\n\n let result = help_inference(filter_map(|| None::<i32>))\n\n .endpoint(|| async move { unreachable!() })\n\n .dispatch(deps![])\n\n .await;\n\n\n\n assert!(result == ControlFlow::Continue(crate::deps![]));\n\n }\n\n}\n","file_path":"src/handler/filter_map.rs","rank":28,"score":53968.172500595574},{"content":"#[derive(Copy, Clone, Debug)]\n\nenum Event {\n\n Ping,\n\n SetValue(i32),\n\n PrintValue,\n\n}\n\n\n\nimpl Event {\n\n fn parse(input: &[&str]) -> Option<Self> {\n\n match input {\n\n [\"ping\"] => Some(Event::Ping),\n\n [\"set_value\", value] => Some(Event::SetValue(value.parse().ok()?)),\n\n [\"print\"] => Some(Event::PrintValue),\n\n _ => None,\n\n }\n\n }\n\n}\n\n\n","file_path":"examples/simple_dispatcher.rs","rank":29,"score":53374.19869119703},{"content":"struct CollectLocations {\n\n locations: Vec<(&'static str, &'static Location<'static>)>,\n\n}\n\n\n","file_path":"examples/descr_locations.rs","rank":30,"score":51767.401535891724},{"content":"fn main() {\n\n #[rustfmt::skip]\n\n let some_tree: Handler<DependencyMap, _, _> = dptree::entry()\n\n .branch(\n\n dptree::filter(|| true)\n\n .endpoint(|| async {})\n\n )\n\n .branch(\n\n dptree::filter_async(|| async { true })\n\n .chain(dptree::filter_map(|| Some(1) ))\n\n .endpoint(|| async {})\n\n );\n\n\n\n get_locations(&some_tree).iter().for_each(|(name, loc)| println!(\"{name: <12} @ {loc}\"));\n\n}\n","file_path":"examples/descr_locations.rs","rank":31,"score":45704.20982797119},{"content":"fn get_locations<'a, 'b>(\n\n handler: &'a Handler<'b, impl Send + Sync + 'b, impl Send + Sync + 'b, CollectLocations>,\n\n) -> &'a [(&'static str, &'static Location<'static>)] {\n\n &handler.description().locations\n\n}\n\n\n","file_path":"examples/descr_locations.rs","rank":32,"score":42358.266987880525},{"content":"type FsmHandler = Handler<'static, Store, TransitionOut>;\n\n\n","file_path":"examples/state_machine.rs","rank":33,"score":42199.059048529074},{"content":"fn sqrt_handler() -> WebHandler {\n\n dptree::filter_map(|req: &'static str| {\n\n if req.starts_with(\"/sqrt\") {\n\n let (_, n) = req.split_once(' ')?;\n\n n.parse::<f64>().ok()\n\n } else {\n\n None\n\n }\n\n })\n\n .endpoint(|n: f64| async move { format!(\"{}\", n.sqrt()) })\n\n}\n\n\n","file_path":"examples/web_server.rs","rank":34,"score":41395.830893277525},{"content":"fn ping_handler() -> CommandHandler {\n\n dptree::filter_async(|event: Event| async move { matches!(event, Event::Ping) })\n\n .endpoint(|| async { \"Pong\".to_string() })\n\n}\n\n\n","file_path":"examples/simple_dispatcher.rs","rank":35,"score":41395.830893277525},{"content":"fn paused_handler() -> FsmHandler {\n\n dptree::case![CommandState::Paused].branch(transitions::resume()).branch(transitions::end())\n\n}\n\n\n","file_path":"examples/state_machine.rs","rank":36,"score":41395.830893277525},{"content":"fn smiles_handler() -> WebHandler {\n\n dptree::filter(|req: &'static str| req.starts_with(\"/smile\"))\n\n .endpoint(|| async { \"🙃\".to_owned() })\n\n}\n\n\n","file_path":"examples/web_server.rs","rank":37,"score":41395.830893277525},{"content":"fn exit_handler() -> FsmHandler {\n\n dptree::case![CommandState::Exit].branch(transitions::exit())\n\n}\n","file_path":"examples/state_machine.rs","rank":38,"score":41395.830893277525},{"content":"fn active_handler() -> FsmHandler {\n\n dptree::case![CommandState::Active].branch(transitions::pause()).branch(transitions::end())\n\n}\n\n\n","file_path":"examples/state_machine.rs","rank":39,"score":41395.830893277525},{"content":"fn inactive_handler() -> FsmHandler {\n\n dptree::case![CommandState::Inactive].branch(transitions::begin()).branch(transitions::exit())\n\n}\n\n\n","file_path":"examples/state_machine.rs","rank":40,"score":41395.830893277525},{"content":"fn not_found_handler() -> WebHandler {\n\n dptree::endpoint(|| async { \"404 Not Found\".to_owned() })\n\n}\n","file_path":"examples/web_server.rs","rank":41,"score":41395.830893277525},{"content":"fn set_value_handler() -> CommandHandler {\n\n dptree::filter_map_async(|event: Event| async move {\n\n match event {\n\n Event::SetValue(value) => Some(value),\n\n _ => None,\n\n }\n\n })\n\n .endpoint(move |value: i32, store: Arc<AtomicI32>| async move {\n\n store.store(value, Ordering::SeqCst);\n\n format!(\"{} stored\", value)\n\n })\n\n}\n\n\n","file_path":"examples/simple_dispatcher.rs","rank":42,"score":40510.088125972594},{"content":"fn print_value_handler() -> CommandHandler {\n\n dptree::filter_async(|event: Event| async move { matches!(event, Event::PrintValue) }).endpoint(\n\n move |store: Arc<AtomicI32>| async move {\n\n let value = store.load(Ordering::SeqCst);\n\n format!(\"{}\", value)\n\n },\n\n )\n\n}\n","file_path":"examples/simple_dispatcher.rs","rank":43,"score":40510.088125972594},{"content":"use crate::{description, di::Injectable, from_fn_with_description, Handler, HandlerDescription};\n\nuse futures::FutureExt;\n\nuse std::{ops::ControlFlow, sync::Arc};\n\n\n\nimpl<'a, Input, Output, Descr> Handler<'a, Input, Output, Descr>\n\nwhere\n\n Input: Send + Sync + 'a,\n\n Output: Send + Sync + 'a,\n\n Descr: HandlerDescription,\n\n{\n\n /// Chain this handler with the endpoint handler `f`.\n\n #[must_use]\n\n #[track_caller]\n\n pub fn endpoint<F, FnArgs>(self, f: F) -> Endpoint<'a, Input, Output, Descr>\n\n where\n\n F: Injectable<Input, Output, FnArgs> + Send + Sync + 'a,\n\n {\n\n self.chain(endpoint(f))\n\n }\n\n}\n\n\n\n/// Constructs a handler that has no further handlers in a chain.\n\n///\n\n/// An endpoint is a handler that _always_ breaks handler execution after its\n\n/// completion. So, you can use it when your chain of responsibility must end\n\n/// up, and handle an incoming event.\n\n#[must_use]\n\n#[track_caller]\n","file_path":"src/handler/endpoint.rs","rank":44,"score":28755.788048130416},{"content":" Handler<'a, Input, Output, Descr>;\n\n\n\n#[cfg(test)]\n\nmod tests {\n\n use super::*;\n\n use crate::{deps, help_inference};\n\n\n\n #[tokio::test]\n\n async fn test_endpoint() {\n\n let input = 123;\n\n let output = 7;\n\n\n\n let result = help_inference(endpoint(move |num: i32| async move {\n\n assert_eq!(num, input);\n\n output\n\n }))\n\n .dispatch(deps![input])\n\n .await;\n\n\n\n let result = match result {\n\n ControlFlow::Break(b) => b,\n\n _ => panic!(\"Unexpected: handler return ControlFlow::Break\"),\n\n };\n\n assert_eq!(result, output);\n\n }\n\n}\n","file_path":"src/handler/endpoint.rs","rank":45,"score":28747.834077232237},{"content":"use crate::{\n\n di::{Asyncify, Injectable},\n\n from_fn_with_description,\n\n handler::core::Handler,\n\n HandlerDescription,\n\n};\n\nuse std::{ops::ControlFlow, sync::Arc};\n\n\n\n/// Constructs a handler that filters input with the predicate `pred`.\n\n///\n\n/// `pred` has an access to all values that are stored in the input container.\n\n/// If it returns `true`, a continuation of the handler will be called,\n\n/// otherwise the handler returns [`ControlFlow::Continue`].\n\n#[must_use]\n\n#[track_caller]\n","file_path":"src/handler/filter.rs","rank":46,"score":28336.225145953722},{"content":" assert_eq!(event, input_value);\n\n true\n\n }))\n\n .endpoint(move |event: i32| async move {\n\n assert_eq!(event, input_value);\n\n output\n\n })\n\n .dispatch(input)\n\n .await;\n\n\n\n assert!(result == ControlFlow::Break(output));\n\n }\n\n\n\n #[tokio::test]\n\n async fn test_and_then_filter() {\n\n let input = 123;\n\n let output = 7;\n\n\n\n let result = help_inference(filter(move |event: i32| {\n\n assert_eq!(event, input);\n","file_path":"src/handler/filter.rs","rank":47,"score":28332.87634485482},{"content":" cont(event).await\n\n } else {\n\n ControlFlow::Continue(event)\n\n }\n\n }\n\n })\n\n}\n\n\n\n#[cfg(test)]\n\nmod tests {\n\n use super::*;\n\n use crate::{deps, help_inference};\n\n\n\n #[tokio::test]\n\n async fn test_filter() {\n\n let input_value = 123;\n\n let input = deps![input_value];\n\n let output = 7;\n\n\n\n let result = help_inference(filter_async(move |event: i32| async move {\n","file_path":"src/handler/filter.rs","rank":48,"score":28332.46251647711},{"content":" true\n\n }))\n\n .chain(\n\n filter_async(move |event: i32| async move {\n\n assert_eq!(event, input);\n\n true\n\n })\n\n .endpoint(move |event: i32| async move {\n\n assert_eq!(event, input);\n\n output\n\n }),\n\n )\n\n .dispatch(deps![input])\n\n .await;\n\n\n\n assert!(result == ControlFlow::Break(output));\n\n }\n\n}\n","file_path":"src/handler/filter.rs","rank":49,"score":28330.825804268537},{"content":"use crate::{\n\n di::{Asyncify, Injectable, Insert},\n\n from_fn_with_description, Handler, HandlerDescription,\n\n};\n\nuse std::{ops::ControlFlow, sync::Arc};\n\n\n\n/// Constructs a handler that passes a value of a new type further.\n\n///\n\n/// The result of invoking `proj` will be added to the container and passed\n\n/// further in a handler chain.\n\n///\n\n/// See also: [`crate::filter_map`].\n\n#[must_use]\n\n#[track_caller]\n","file_path":"src/handler/map.rs","rank":50,"score":28194.18758197884},{"content":" std::mem::drop(proj);\n\n\n\n let mut intermediate = container.clone();\n\n intermediate.insert(res);\n\n match cont(intermediate).await {\n\n ControlFlow::Continue(_) => ControlFlow::Continue(container),\n\n ControlFlow::Break(result) => ControlFlow::Break(result),\n\n }\n\n }\n\n })\n\n}\n\n\n\n#[cfg(test)]\n\nmod tests {\n\n use super::*;\n\n use crate::{deps, help_inference};\n\n\n\n #[tokio::test]\n\n async fn test_map() {\n\n let value = 123;\n","file_path":"src/handler/map.rs","rank":51,"score":28191.41688061015},{"content":"\n\n let result = help_inference(map(move || value))\n\n .endpoint(move |event: i32| async move {\n\n assert_eq!(event, value);\n\n value\n\n })\n\n .dispatch(deps![])\n\n .await;\n\n\n\n assert!(result == ControlFlow::Break(value));\n\n }\n\n}\n","file_path":"src/handler/map.rs","rank":52,"score":28188.32332798353},{"content":"type Store = Arc<DependencyMap>;\n\n\n\n#[tokio::main]\n\nasync fn main() {\n\n fn assert_num_string_handler(\n\n expected_num: u32,\n\n expected_string: &'static str,\n\n ) -> Endpoint<'static, Store, ()> {\n\n // The handler requires `u32` and `String` types from the input storage.\n\n dptree::endpoint(move |num: u32, string: String| async move {\n\n assert_eq!(num, expected_num);\n\n assert_eq!(string, expected_string);\n\n })\n\n }\n\n\n\n // Init storage with string and num\n\n let store = Arc::new(dptree::deps![10u32, \"Hello\".to_owned()]);\n\n\n\n let str_num_handler = assert_num_string_handler(10u32, \"Hello\");\n\n\n","file_path":"examples/storage.rs","rank":53,"score":24687.47907524598},{"content":"type Store = dptree::di::DependencyMap;\n","file_path":"examples/state_machine.rs","rank":54,"score":22801.64052358502},{"content":"//! Commonly used items.\n\n\n\npub use crate::{di::DependencyMap, Endpoint, Handler};\n\npub use std::ops::ControlFlow;\n","file_path":"src/prelude.rs","rank":56,"score":14.292753718292591},{"content":" #[allow(non_snake_case)]\n\n #[allow(unused_variables)]\n\n fn inject<'a>(&'a self, container: &'a Input) -> CompiledFn<'a, Output> {\n\n Arc::new(move || {\n\n $(let $generic = std::borrow::Borrow::<$generic>::borrow(&container.get()).clone();)*\n\n let fut = self( $( $generic ),* );\n\n Box::pin(fut)\n\n })\n\n }\n\n }\n\n\n\n impl<Func, Input, Output, $($generic),*> Injectable<Input, Output, ($($generic,)*)> for Asyncify<Func>\n\n where\n\n Input: $(DependencySupplier<$generic> +)*,\n\n Input: Send + Sync,\n\n Func: Fn($($generic),*) -> Output + Send + Sync + 'static,\n\n Output: Send + 'static,\n\n $($generic: Clone + Send + Sync),*\n\n {\n\n #[allow(non_snake_case)]\n","file_path":"src/di.rs","rank":57,"score":13.830068315785352},{"content":" where\n\n Out: Send + Sync + 'static,\n\n {\n\n filter_map_with_description(\n\n InterestList(hashset! { UpdateKind::B }),\n\n |update: Update| match update {\n\n Update::B(x) => Some(x),\n\n _ => None,\n\n },\n\n )\n\n }\n\n\n\n fn filter_c<Out>(\n\n ) -> Handler<'static, DependencyMap, Out, description::EventKind<UpdateKind>>\n\n where\n\n Out: Send + Sync + 'static,\n\n {\n\n filter_map_with_description(\n\n InterestList(hashset! { UpdateKind::C }),\n\n |update: Update| match update {\n","file_path":"src/handler/core.rs","rank":58,"score":13.779291915205254},{"content":" }\n\n}\n\n\n\nimpl<V> DependencySupplier<V> for DependencyMap\n\nwhere\n\n V: Send + Sync + 'static,\n\n{\n\n fn get(&self) -> Arc<V> {\n\n self.map\n\n .get(&TypeId::of::<V>())\n\n .unwrap_or_else(|| {\n\n panic!(\n\n \"{} was requested, but not provided. Available types:\\n{}\",\n\n std::any::type_name::<V>(),\n\n self.available_types()\n\n )\n\n })\n\n .clone()\n\n .inner\n\n .downcast::<V>()\n","file_path":"src/di.rs","rank":59,"score":12.905650533098525},{"content":" pub fn remove<T: Send + Sync + 'static>(&mut self) -> Option<Arc<T>> {\n\n self.map\n\n .remove(&TypeId::of::<T>())\n\n .map(|dep| dep.inner.downcast().expect(\"Values are stored by TypeId\"))\n\n }\n\n\n\n fn available_types(&self) -> String {\n\n let mut list = String::new();\n\n\n\n for dep in self.map.values() {\n\n writeln!(list, \" {}\", dep.type_name).unwrap();\n\n }\n\n\n\n list\n\n }\n\n}\n\n\n\nimpl Debug for DependencyMap {\n\n fn fmt(&self, f: &mut Formatter<'_>) -> Result<(), std::fmt::Error> {\n\n f.debug_struct(\"DependencyMap\").finish()\n","file_path":"src/di.rs","rank":60,"score":12.807727000511091},{"content":" /// If the container do not has this type present, `None` is returned.\n\n /// Otherwise, the value is updated, and the old value is returned.\n\n pub fn insert<T: Send + Sync + 'static>(&mut self, item: T) -> Option<Arc<T>> {\n\n self.map\n\n .insert(\n\n TypeId::of::<T>(),\n\n Dependency { type_name: std::any::type_name::<T>(), inner: Arc::new(item) },\n\n )\n\n .map(|dep| dep.inner.downcast().expect(\"Values are stored by TypeId\"))\n\n }\n\n\n\n /// Inserts all dependencies from another container into itself.\n\n pub fn insert_container(&mut self, container: Self) {\n\n self.map.extend(container.map);\n\n }\n\n\n\n /// Removes a value from the container.\n\n ///\n\n /// If the container do not has this type present, `None` is returned.\n\n /// Otherwise, the value is removed and returned.\n","file_path":"src/di.rs","rank":62,"score":11.9947725541206},{"content":" B(u8),\n\n C(u64),\n\n }\n\n\n\n fn filter_a<Out>(\n\n ) -> Handler<'static, DependencyMap, Out, description::EventKind<UpdateKind>>\n\n where\n\n Out: Send + Sync + 'static,\n\n {\n\n filter_map_with_description(\n\n InterestList(hashset! { UpdateKind::A }),\n\n |update: Update| match update {\n\n Update::A(x) => Some(x),\n\n _ => None,\n\n },\n\n )\n\n }\n\n\n\n fn filter_b<Out>(\n\n ) -> Handler<'static, DependencyMap, Out, description::EventKind<UpdateKind>>\n","file_path":"src/handler/core.rs","rank":63,"score":11.781195466309825},{"content":" Update::B(x) => Some(x),\n\n _ => None,\n\n },\n\n )\n\n }\n\n\n\n // User-defined filter that doesn't provide allowed updates\n\n fn user_defined_filter<Out>(\n\n ) -> Handler<'static, DependencyMap, Out, description::EventKind<UpdateKind>>\n\n where\n\n Out: Send + Sync + 'static,\n\n {\n\n filter_map(|update: Update| match update {\n\n Update::B(x) => Some(x),\n\n _ => None,\n\n })\n\n }\n\n\n\n #[track_caller]\n\n fn assert(\n","file_path":"src/handler/core.rs","rank":65,"score":11.361693460926134},{"content":"# dptree\n\n[](https://github.com/p0lunin/dptree/actions/workflows/rust.yml)\n\n[](https://crates.io/crates/dptree)\n\n[](https://docs.rs/dptree)\n\n\n\nAn implementation of the [chain (tree) of responsibility] pattern.\n\n\n\n[[`examples/web_server.rs`](examples/web_server.rs)]\n\n```rust\n\nuse dptree::prelude::*;\n\n\n\ntype WebHandler = Endpoint<'static, DependencyMap, String>;\n\n\n\n#[rustfmt::skip]\n\n#[tokio::main]\n\nasync fn main() {\n\n let web_server = dptree::entry()\n\n .branch(smiles_handler())\n\n .branch(sqrt_handler())\n\n .branch(not_found_handler());\n\n\n\n assert_eq!(\n\n web_server.dispatch(dptree::deps![\"/smile\"]).await,\n\n ControlFlow::Break(\"🙃\".to_owned())\n\n );\n\n assert_eq!(\n\n web_server.dispatch(dptree::deps![\"/sqrt 16\"]).await,\n\n ControlFlow::Break(\"4\".to_owned())\n\n );\n\n assert_eq!(\n\n web_server.dispatch(dptree::deps![\"/lol\"]).await,\n\n ControlFlow::Break(\"404 Not Found\".to_owned())\n\n );\n\n}\n\n\n\nfn smiles_handler() -> WebHandler {\n\n dptree::filter(|req: &'static str| req.starts_with(\"/smile\"))\n\n .endpoint(|| async { \"🙃\".to_owned() })\n\n}\n\n\n\nfn sqrt_handler() -> WebHandler {\n\n dptree::filter_map(|req: &'static str| {\n\n if req.starts_with(\"/sqrt\") {\n\n let (_, n) = req.split_once(' ')?;\n\n n.parse::<f64>().ok()\n\n } else {\n\n None\n\n }\n\n })\n\n .endpoint(|n: f64| async move { format!(\"{}\", n.sqrt()) })\n\n}\n\n\n\nfn not_found_handler() -> WebHandler {\n\n dptree::endpoint(|| async { \"404 Not Found\".to_owned() })\n\n}\n\n```\n\n\n","file_path":"README.md","rank":67,"score":10.859506997964981},{"content":"//! An implementation of the [chain (tree) of responsibility] pattern.\n\n//!\n\n//! ```\n\n//! use dptree::prelude::*;\n\n//!\n\n//! type WebHandler = Endpoint<'static, DependencyMap, String>;\n\n//!\n\n//! #[rustfmt::skip]\n\n//! #[tokio::main]\n\n//! async fn main() {\n\n//! let web_server = dptree::entry()\n\n//! .branch(smiles_handler())\n\n//! .branch(sqrt_handler())\n\n//! .branch(not_found_handler());\n\n//! \n\n//! assert_eq!(\n\n//! web_server.dispatch(dptree::deps![\"/smile\"]).await,\n\n//! ControlFlow::Break(\"🙃\".to_owned())\n\n//! );\n\n//! assert_eq!(\n","file_path":"src/lib.rs","rank":68,"score":10.85007183113916},{"content":"mod core;\n\npub mod description;\n\nmod endpoint;\n\nmod filter;\n\nmod filter_map;\n\nmod map;\n\n\n\npub use self::core::*;\n\npub use description::HandlerDescription;\n\npub use endpoint::*;\n\npub use filter::*;\n\npub use filter_map::*;\n\npub use map::*;\n","file_path":"src/handler.rs","rank":69,"score":10.60624801538126},{"content":" /// assert_eq!(\n\n /// handler.dispatch(dptree::deps![-10]).await,\n\n /// ControlFlow::Continue(dptree::deps![-10])\n\n /// );\n\n ///\n\n /// # }\n\n /// ```\n\n ///\n\n /// [chain of responsibility]: https://en.wikipedia.org/wiki/Chain-of-responsibility_pattern\n\n #[must_use]\n\n #[track_caller]\n\n pub fn chain(self, next: Self) -> Self {\n\n let required_update_kinds_set = self.description().merge_chain(next.description());\n\n\n\n from_fn_with_description(required_update_kinds_set, move |event, cont| {\n\n let this = self.clone();\n\n let next = next.clone();\n\n let cont = Arc::new(cont);\n\n\n\n this.execute(event, move |event| {\n","file_path":"src/handler/core.rs","rank":70,"score":10.537806057419724},{"content":" /// );\n\n /// # }\n\n /// ```\n\n #[must_use]\n\n #[track_caller]\n\n pub fn branch(self, next: Self) -> Self {\n\n let required_update_kinds_set = self.description().merge_branch(next.description());\n\n\n\n from_fn_with_description(required_update_kinds_set, move |event, cont| {\n\n let this = self.clone();\n\n let next = next.clone();\n\n let cont = Arc::new(cont);\n\n\n\n this.execute(event, move |event| {\n\n let next = next.clone();\n\n let cont = cont.clone();\n\n\n\n async move {\n\n match next.dispatch(event).await {\n\n ControlFlow::Continue(event) => cont(event).await,\n","file_path":"src/handler/core.rs","rank":72,"score":9.942065341190846},{"content":"/// let mut container = DependencyMap::new();\n\n/// container.insert(5_i32);\n\n/// container.insert(\"abc\");\n\n///\n\n/// assert_eq!(container.get(), Arc::new(5_i32));\n\n/// assert_eq!(container.get(), Arc::new(\"abc\"));\n\n///\n\n/// // If a type of a value already exists within the container, it will be replaced.\n\n/// let old_value = container.insert(10_i32).unwrap();\n\n///\n\n/// assert_eq!(old_value, Arc::new(5_i32));\n\n/// assert_eq!(container.get(), Arc::new(10_i32));\n\n/// ```\n\n///\n\n/// When a value is not found within the container, it will panic:\n\n///\n\n/// ```should_panic\n\n/// # use std::sync::Arc;\n\n/// use dptree::di::{DependencyMap, DependencySupplier};\n\n/// let mut container = DependencyMap::new();\n","file_path":"src/di.rs","rank":73,"score":9.8166885386589},{"content":"use std::{future::Future, ops::ControlFlow, sync::Arc};\n\n\n\nuse futures::future::BoxFuture;\n\n\n\nuse crate::{description, HandlerDescription};\n\n\n\n/// An instance that receives an input and decides whether to break a chain or\n\n/// pass the value further.\n\n///\n\n/// In order to create this structure, you can use the predefined functions from\n\n/// [`crate`].\n\npub struct Handler<'a, Input, Output, Descr = description::Unspecified> {\n\n data: Arc<HandlerData<Descr, DynF<'a, Input, Output>>>,\n\n}\n\n\n","file_path":"src/handler/core.rs","rank":74,"score":9.630295976660939},{"content":" handler: Handler<'static, DependencyMap, (), description::EventKind<UpdateKind>>,\n\n allowed: description::EventKind<UpdateKind>,\n\n ) {\n\n assert_eq!(handler.description(), &allowed)\n\n }\n\n\n\n assert(filter_a().chain(filter_b()), InterestList(hashset! {}));\n\n assert(entry().chain(filter_b()), InterestList(hashset! { UpdateKind::B }));\n\n\n\n assert(\n\n filter_a().branch(filter_b()),\n\n InterestList(hashset! { UpdateKind::A, UpdateKind::B }),\n\n );\n\n assert(\n\n filter_a().branch(filter_b()).branch(filter_c().chain(filter_c())),\n\n InterestList(hashset! { UpdateKind::A, UpdateKind::B, UpdateKind::C }),\n\n );\n\n assert(filter_a().chain(filter(|| true)), InterestList(hashset! { UpdateKind::A }));\n\n assert(user_defined_filter().chain(filter_a()), UserDefined);\n\n assert(filter_a().chain(user_defined_filter()), InterestList(hashset! { UpdateKind::A }));\n","file_path":"src/handler/core.rs","rank":75,"score":9.50151033076001},{"content":" handler::{endpoint, filter, filter_async},\n\n prelude::DependencyMap,\n\n };\n\n\n\n use super::*;\n\n\n\n #[tokio::test]\n\n async fn test_from_fn_break() {\n\n let input = 123;\n\n let output = \"ABC\";\n\n\n\n let result = help_inference(from_fn(|event, _cont: Cont<i32, &'static str>| async move {\n\n assert_eq!(event, input);\n\n ControlFlow::Break(output)\n\n }))\n\n .dispatch(input)\n\n .await;\n\n\n\n assert!(result == ControlFlow::Break(output));\n\n }\n","file_path":"src/handler/core.rs","rank":76,"score":9.193878282214413},{"content":"/// container.insert(10i32);\n\n/// container.insert(true);\n\n/// container.insert(\"static str\");\n\n///\n\n/// // thread 'main' panicked at 'alloc::string::String was requested, but not provided. Available types:\n\n/// // &str\n\n/// // bool\n\n/// // i32\n\n/// // ', /media/hirrolot/772CF8924BEBB279/Documents/Rust/dptree/src/di.rs:150:17\n\n/// // note: run with `RUST_BACKTRACE=1` environment variable to display a backtrace\n\n/// let string: Arc<String> = container.get();\n\n/// ```\n\n#[derive(Default, Clone)]\n\npub struct DependencyMap {\n\n map: HashMap<TypeId, Dependency>,\n\n}\n\n\n","file_path":"src/di.rs","rank":78,"score":9.15879141989109},{"content":"use dptree::prelude::*;\n\nuse std::{net::Ipv4Addr, sync::Arc};\n\n\n","file_path":"examples/storage.rs","rank":79,"score":8.987142421982181},{"content":"\n\n // Entry is invisible\n\n assert(entry().branch(filter_a()), InterestList(hashset! { UpdateKind::A }));\n\n assert(entry(), Entry);\n\n\n\n assert(user_defined_filter(), UserDefined);\n\n assert(user_defined_filter().branch(filter_a()), UserDefined);\n\n }\n\n}\n","file_path":"src/handler/core.rs","rank":80,"score":8.937056484507611},{"content":"# Changelog\n\nAll notable changes to this project will be documented in this file.\n\n\n\nThe format is based on [Keep a Changelog](https://keepachangelog.com/en/1.0.0/),\n\nand this project adheres to [Semantic Versioning](https://semver.org/spec/v2.0.0.html).\n\n\n\n## unreleased\n\n\n\n## 0.2.1 - 2022-04-27\n\n\n\n### Added\n\n\n\n - The `dptree::case!` macro for enumeration destructuring.\n\n\n\n## 0.2.0 - 2022-04-18\n\n\n\n### Added\n\n\n\n - Introspection facilities:\n\n - The `HandlerDescription` trait.\n\n - Build-in description types: `crate::description::{Unspecified, EventKind}`.\n\n - Functions constructing handlers with descriptions: `filter_async_with_description`, `filter_map_async_with_description`, `filter_map_with_description`, `filter_with_description`, `from_fn_with_description`, `map_async_with_description`, `map_with_description`.\n\n\n\n## 0.1.2 - 2022-04-04\n\n\n\n### Added\n\n\n\n - `DependencyMap::insert_container` ([PR #7](https://github.com/p0lunin/dptree/pull/7)).\n\n - `map` and `map_async` ([PR #8](https://github.com/p0lunin/dptree/pull/8)).\n\n\n\n## 0.1.1 - 2022-03-21\n\n\n\n### Fixed\n\n\n\n - Emit a full list of available types on `DependencyMap::get` panic ([PR #6](https://github.com/p0lunin/dptree/pull/6)).\n\n\n\n## 0.1.0 - 2022-02-05\n\n\n\n### Added\n\n\n\n - This badass library.\n","file_path":"CHANGELOG.md","rank":81,"score":8.821104245429446},{"content":"use std::panic::Location;\n\n\n\nuse dptree::{di::DependencyMap, Handler, HandlerDescription};\n\n\n","file_path":"examples/descr_locations.rs","rank":83,"score":8.576579813998146},{"content":"\n\n #[tokio::test]\n\n async fn test_from_fn_continue() {\n\n let input = 123;\n\n type Output = &'static str;\n\n\n\n let result =\n\n help_inference(from_fn(|event: i32, _cont: Cont<i32, &'static str>| async move {\n\n assert_eq!(event, input);\n\n ControlFlow::<Output, _>::Continue(event)\n\n }))\n\n .dispatch(input)\n\n .await;\n\n\n\n assert!(result == ControlFlow::Continue(input));\n\n }\n\n\n\n #[tokio::test]\n\n async fn test_entry() {\n\n let input = 123;\n","file_path":"src/handler/core.rs","rank":84,"score":8.570999837848829},{"content":" assert_eq!(dispatcher.dispatch(deps![0]).await, ControlFlow::Break(Output::Zero));\n\n assert_eq!(dispatcher.dispatch(deps![-1]).await, ControlFlow::Break(Output::MinusOne));\n\n assert_eq!(dispatcher.dispatch(deps![-2]).await, ControlFlow::Break(Output::LT));\n\n }\n\n\n\n #[tokio::test]\n\n async fn allowed_updates() {\n\n use crate::description::EventKind::*;\n\n\n\n #[derive(Debug, Clone, PartialEq, Eq, Hash)]\n\n enum UpdateKind {\n\n A,\n\n B,\n\n C,\n\n }\n\n\n\n #[derive(Clone)]\n\n #[allow(dead_code)]\n\n enum Update {\n\n A(i32),\n","file_path":"src/handler/core.rs","rank":85,"score":8.351584995629743},{"content":" /// let handler: Handler<_, _> = dptree::filter(|x: i32| x > 0);\n\n ///\n\n /// let output = handler.execute(dptree::deps![10], |_| async { ControlFlow::Break(\"done\") }).await;\n\n /// assert_eq!(output, ControlFlow::Break(\"done\"));\n\n ///\n\n /// # }\n\n /// ```\n\n pub async fn execute<Cont, ContFut>(\n\n self,\n\n container: Input,\n\n cont: Cont,\n\n ) -> ControlFlow<Output, Input>\n\n where\n\n Cont: Fn(Input) -> ContFut,\n\n Cont: Send + Sync + 'a,\n\n ContFut: Future<Output = ControlFlow<Output, Input>> + Send + 'a,\n\n {\n\n (self.data.f)(container, Box::new(move |event| Box::pin(cont(event)))).await\n\n }\n\n\n","file_path":"src/handler/core.rs","rank":86,"score":8.18308766791963},{"content":" Input: Send + Sync + 'a,\n\n Output: Send + Sync + 'a,\n\n Descr: HandlerDescription,\n\n{\n\n /// Chain two handlers to form a [chain of responsibility].\n\n ///\n\n /// First, `self` will be executed, and then, if `self` decides to continue\n\n /// execution, `next` will be executed.\n\n ///\n\n /// # Examples\n\n ///\n\n /// ```\n\n /// # #[tokio::main]\n\n /// # async fn main() {\n\n /// use dptree::prelude::*;\n\n ///\n\n /// let handler: Handler<_, _> =\n\n /// dptree::filter(|x: i32| x > 0).chain(dptree::endpoint(|| async { \"done\" }));\n\n ///\n\n /// assert_eq!(handler.dispatch(dptree::deps![10]).await, ControlFlow::Break(\"done\"));\n","file_path":"src/handler/core.rs","rank":87,"score":8.087561205288324},{"content":"pub use handler::*;\n\n\n\n/// Filters an enumeration, passing its payload forwards.\n\n///\n\n/// This macro expands to a [`crate::Handler`] that acts on your enumeration\n\n/// type: if the enumeration is of a certain variant, the execution continues;\n\n/// otherwise, `dptree` will try the next branch. This is very useful for\n\n/// dialogue FSM transitions and incoming command filtering; for a real-world\n\n/// example, please see teloxide's [`examples/purchase.rs`].\n\n///\n\n/// Variants can take the following forms:\n\n///\n\n/// - `Enum::MyVariant` for empty variants;\n\n/// - `Enum::MyVariant(param1, ..., paramN)` for function-like variants;\n\n/// - `Enum::MyVariant { param1, ..., paramN }` for `struct`-like variants.\n\n///\n\n/// In the first case, this macro results in a simple [`crate::filter`]; in the\n\n/// second and third cases, this macro results in [`crate::filter_map`] that\n\n/// passes the payload of `MyVariant` to the next handler if the match occurs.\n\n/// (This next handler can be an endpoint or a more complex one.) The payload\n","file_path":"src/lib.rs","rank":88,"score":7.649273365886637},{"content":" continue;\n\n }\n\n },\n\n _ => {\n\n println!(\"Unknown event\");\n\n continue;\n\n }\n\n };\n\n\n\n if new_state == CommandState::Exit {\n\n return;\n\n }\n\n\n\n state = new_state;\n\n }\n\n}\n\n\n\n#[derive(Debug, Clone, PartialEq)]\n\npub enum CommandState {\n\n Active,\n","file_path":"examples/state_machine.rs","rank":89,"score":7.119803249869147},{"content":"\n\n #[track_caller]\n\n fn map() -> Self {\n\n collector(\"map\")\n\n }\n\n\n\n #[track_caller]\n\n fn map_async() -> Self {\n\n collector(\"map_async\")\n\n }\n\n\n\n #[track_caller]\n\n fn filter() -> Self {\n\n collector(\"filter\")\n\n }\n\n\n\n #[track_caller]\n\n fn filter_async() -> Self {\n\n collector(\"filter_async\")\n\n }\n","file_path":"examples/descr_locations.rs","rank":90,"score":7.051233225197138},{"content":"\n\n #[track_caller]\n\n fn filter_map() -> Self {\n\n collector(\"filter_map\")\n\n }\n\n\n\n #[track_caller]\n\n fn filter_map_async() -> Self {\n\n collector(\"filter_map_async\")\n\n }\n\n\n\n #[track_caller]\n\n fn endpoint() -> Self {\n\n collector(\"endpoint\")\n\n }\n\n}\n\n\n","file_path":"examples/descr_locations.rs","rank":92,"score":6.983076237904248},{"content":" assert!(matches!(h.dispatch(crate::deps![State::Other]).await, ControlFlow::Continue(_)));\n\n }\n\n\n\n #[tokio::test]\n\n async fn handler_fn_variant() {\n\n let input = State::C(42, \"abc\");\n\n let h: crate::Handler<_, _> =\n\n case![State::C(x, y)].endpoint(|(x, str): (i32, &'static str)| async move {\n\n assert_eq!(x, 42);\n\n assert_eq!(str, \"abc\");\n\n 123\n\n });\n\n\n\n assert_eq!(h.dispatch(crate::deps![input]).await, ControlFlow::Break(123));\n\n assert!(matches!(h.dispatch(crate::deps![State::Other]).await, ControlFlow::Continue(_)));\n\n }\n\n\n\n #[tokio::test]\n\n async fn handler_single_struct_variant() {\n\n let input = State::D { foo: 42 };\n","file_path":"src/lib.rs","rank":93,"score":6.896835682971065},{"content":"\n\nasync fn repl(dispatcher: Handler<'static, DependencyMap, String>, store: Arc<AtomicI32>) -> ! {\n\n loop {\n\n print!(\">> \");\n\n std::io::stdout().flush().unwrap();\n\n\n\n let mut cmd = String::new();\n\n std::io::stdin().read_line(&mut cmd).unwrap();\n\n\n\n let strs = cmd.trim().split(' ').collect::<Vec<_>>();\n\n let event = Event::parse(strs.as_slice());\n\n\n\n let out = match event {\n\n Some(event) => match dispatcher.dispatch(dptree::deps![event, store.clone()]).await {\n\n ControlFlow::Continue(event) => panic!(\"Unhandled event {:?}\", event),\n\n ControlFlow::Break(result) => result,\n\n },\n\n _ => \"Unknown command\".to_string(),\n\n };\n\n\n\n println!(\"{}\", out);\n\n }\n\n}\n\n\n\n#[derive(Copy, Clone, Debug)]\n","file_path":"examples/simple_dispatcher.rs","rank":94,"score":6.792299227993009},{"content":"## Features\n\n\n\n - ✔️ Declarative handlers: `dptree::{endpoint, filter, filter_map, ...}`.\n\n - ✔️ A lightweight functional design using a form of [continuation-passing style (CPS)] internally.\n\n - ✔️ [Dependency injection (DI)] out-of-the-box.\n\n - ✔️ Supports both handler _chaining_ and _branching_ operations.\n\n - ✔️ Handler introspection facilities.\n\n - ✔️ Battle-tested: dptree is used in [teloxide] as a framework for Telegram update dispatching.\n\n - ✔️ Runtime-agnostic: uses only the [futures] crate.\n\n\n\n[continuation-passing style (CPS)]: https://en.wikipedia.org/wiki/Continuation-passing_style\n\n[Dependency injection (DI)]: https://en.wikipedia.org/wiki/Dependency_injection\n\n[teloxide]: https://github.com/teloxide/teloxide\n\n[futures]: https://github.com/rust-lang/futures-rs\n\n\n\n## Explanation\n\n\n\nThe above code is a simple web server dispatching tree. In pseudocode, it would look like this:\n\n\n\n - `dptree::entry()`: dispatch an update to the following branch handlers:\n\n - `.branch(smiles_handler())`: if the update satisfies the condition (`dptree::filter`), return a smile (`.endpoint`). Otherwise, pass the update forwards.\n\n - `.branch(sqrt_handler())`: if the update is a number (`dptree::filter_map`), return the square of it. Otherwise, pass the update forwards.\n\n - `.branch(not_found_handler())`: return `404 Not Found` immediately.\n\n\n","file_path":"README.md","rank":95,"score":6.734516095822276},{"content":"//! An implementation of [dependency injection].\n\n//!\n\n//! If you do not know what is dependency injection (DI), please read [this\n\n//! discussion on StackOverflow], then come back. The only difference is that in\n\n//! `dptree`, we inject objects into function-handlers, not into objects.\n\n//!\n\n//! Currently, the only container is [`DependencyMap`]. It implements the DI\n\n//! pattern completely, but be careful: it can panic when you do not provide\n\n//! necessary types. See more in its documentation.\n\n//!\n\n//! [dependency injection]: https://en.wikipedia.org/wiki/Dependency_injection\n\n//! [this discussion on StackOverflow]: https://stackoverflow.com/questions/130794/what-is-dependency-injection\n\nuse futures::future::{ready, BoxFuture};\n\n\n\nuse std::{\n\n any::{Any, TypeId},\n\n collections::HashMap,\n\n fmt::{Debug, Formatter, Write},\n\n future::Future,\n\n ops::Deref,\n","file_path":"src/di.rs","rank":97,"score":6.71576266591552},{"content":" })\n\n };\n\n ($($variant:ident)::+ {$param:ident}) => {\n\n $crate::filter_map(|x| match x {\n\n $($variant)::+{$param} => Some($param),\n\n _ => None,\n\n })\n\n };\n\n ($($variant:ident)::+ {$($param:ident),+ $(,)?}) => {\n\n $crate::filter_map(|x| match x {\n\n $($variant)::+ { $($param),+ } => Some(($($param),+ ,)),\n\n _ => None,\n\n })\n\n };\n\n}\n\n\n\n#[cfg(test)]\n\nmod tests {\n\n use std::ops::ControlFlow;\n\n\n","file_path":"src/lib.rs","rank":98,"score":6.625783853079696},{"content":" /// Executes this handler.\n\n ///\n\n /// Returns [`ControlFlow::Break`] when executed successfully,\n\n /// [`ControlFlow::Continue`] otherwise.\n\n pub async fn dispatch(&self, container: Input) -> ControlFlow<Output, Input> {\n\n self.clone().execute(container, |event| async move { ControlFlow::Continue(event) }).await\n\n }\n\n\n\n /// Returns the set of updates that can be processed by this handler.\n\n pub fn description(&self) -> &Descr {\n\n &self.data.description\n\n }\n\n}\n\n\n\n/// Constructs a handler from a function.\n\n///\n\n/// Most of the time, you do not want to use this function. Take a look at more\n\n/// specialised functions: [`crate::endpoint`], [`crate::filter`],\n\n/// [`crate::filter_map`], etc.\n","file_path":"src/handler/core.rs","rank":99,"score":6.61480660486019}],"string":"[\n {\n \"content\": \"#[must_use]\\n\\n#[track_caller]\\n\\npub fn filter_map<'a, Projection, Input, Output, NewType, Args, Descr>(\\n\\n proj: Projection,\\n\\n) -> Handler<'a, Input, Output, Descr>\\n\\nwhere\\n\\n Input: Clone,\\n\\n Asyncify<Projection>: Injectable<Input, Option<NewType>, Args> + Send + Sync + 'a,\\n\\n Input: Insert<NewType> + Send + Sync + 'a,\\n\\n Output: Send + Sync + 'a,\\n\\n Descr: HandlerDescription,\\n\\n NewType: Send,\\n\\n{\\n\\n filter_map_with_description(Descr::filter_map(), proj)\\n\\n}\\n\\n\\n\\n/// The asynchronous version of [`filter_map`].\\n\",\n \"file_path\": \"src/handler/filter_map.rs\",\n \"rank\": 1,\n \"score\": 134620.9475768156\n },\n {\n \"content\": \"#[must_use]\\n\\n#[track_caller]\\n\\npub fn filter_map_async<'a, Projection, Input, Output, NewType, Args, Descr>(\\n\\n proj: Projection,\\n\\n) -> Handler<'a, Input, Output, Descr>\\n\\nwhere\\n\\n Input: Clone,\\n\\n Projection: Injectable<Input, Option<NewType>, Args> + Send + Sync + 'a,\\n\\n Input: Insert<NewType> + Send + Sync + 'a,\\n\\n Output: Send + Sync + 'a,\\n\\n Descr: HandlerDescription,\\n\\n NewType: Send,\\n\\n{\\n\\n filter_map_async_with_description(Descr::filter_map_async(), proj)\\n\\n}\\n\\n\\n\\n/// [`filter_map`] with a custom description.\\n\",\n \"file_path\": \"src/handler/filter_map.rs\",\n \"rank\": 2,\n \"score\": 132341.3470980578\n },\n {\n \"content\": \"#[must_use]\\n\\n#[track_caller]\\n\\npub fn filter<'a, Pred, Input, Output, FnArgs, Descr>(\\n\\n pred: Pred,\\n\\n) -> Handler<'a, Input, Output, Descr>\\n\\nwhere\\n\\n Asyncify<Pred>: Injectable<Input, bool, FnArgs> + Send + Sync + 'a,\\n\\n Input: Send + Sync + 'a,\\n\\n Output: Send + Sync + 'a,\\n\\n Descr: HandlerDescription,\\n\\n{\\n\\n filter_with_description(Descr::filter(), pred)\\n\\n}\\n\\n\\n\\n/// The asynchronous version of [`filter`].\\n\",\n \"file_path\": \"src/handler/filter.rs\",\n \"rank\": 3,\n \"score\": 123583.6605678803\n },\n {\n \"content\": \"#[must_use]\\n\\n#[track_caller]\\n\\npub fn filter_async<'a, Pred, Input, Output, FnArgs, Descr>(\\n\\n pred: Pred,\\n\\n) -> Handler<'a, Input, Output, Descr>\\n\\nwhere\\n\\n Pred: Injectable<Input, bool, FnArgs> + Send + Sync + 'a,\\n\\n Input: Send + Sync + 'a,\\n\\n Output: Send + Sync + 'a,\\n\\n Descr: HandlerDescription,\\n\\n{\\n\\n filter_async_with_description(Descr::filter_async(), pred)\\n\\n}\\n\\n\\n\\n/// [`filter`] with a custom description.\\n\",\n \"file_path\": \"src/handler/filter.rs\",\n \"rank\": 4,\n \"score\": 121573.83767211685\n },\n {\n \"content\": \"#[must_use]\\n\\npub fn filter_map_with_description<'a, Projection, Input, Output, NewType, Args, Descr>(\\n\\n description: Descr,\\n\\n proj: Projection,\\n\\n) -> Handler<'a, Input, Output, Descr>\\n\\nwhere\\n\\n Input: Clone,\\n\\n Asyncify<Projection>: Injectable<Input, Option<NewType>, Args> + Send + Sync + 'a,\\n\\n Input: Insert<NewType> + Send + Sync + 'a,\\n\\n Output: Send + Sync + 'a,\\n\\n NewType: Send,\\n\\n{\\n\\n filter_map_async_with_description(description, Asyncify(proj))\\n\\n}\\n\\n\\n\\n/// [`filter_map_async`] with a custom description.\\n\",\n \"file_path\": \"src/handler/filter_map.rs\",\n \"rank\": 5,\n \"score\": 115372.80738819794\n },\n {\n \"content\": \"#[must_use]\\n\\n#[track_caller]\\n\\npub fn endpoint<'a, F, Input, Output, FnArgs, Descr>(f: F) -> Endpoint<'a, Input, Output, Descr>\\n\\nwhere\\n\\n Input: Send + Sync + 'a,\\n\\n Output: Send + Sync + 'a,\\n\\n Descr: HandlerDescription,\\n\\n F: Injectable<Input, Output, FnArgs> + Send + Sync + 'a,\\n\\n{\\n\\n let f = Arc::new(f);\\n\\n\\n\\n from_fn_with_description(Descr::endpoint(), move |x, _cont| {\\n\\n let f = Arc::clone(&f);\\n\\n async move {\\n\\n let f = f.inject(&x);\\n\\n f().map(ControlFlow::Break).await\\n\\n }\\n\\n })\\n\\n}\\n\\n\\n\\n/// A handler with no further handlers in a chain.\\n\\npub type Endpoint<'a, Input, Output, Descr = description::Unspecified> =\\n\",\n \"file_path\": \"src/handler/endpoint.rs\",\n \"rank\": 6,\n \"score\": 114802.3962339515\n },\n {\n \"content\": \"#[must_use]\\n\\npub fn filter_map_async_with_description<'a, Projection, Input, Output, NewType, Args, Descr>(\\n\\n description: Descr,\\n\\n proj: Projection,\\n\\n) -> Handler<'a, Input, Output, Descr>\\n\\nwhere\\n\\n Input: Clone,\\n\\n Projection: Injectable<Input, Option<NewType>, Args> + Send + Sync + 'a,\\n\\n Input: Insert<NewType> + Send + Sync + 'a,\\n\\n Output: Send + Sync + 'a,\\n\\n NewType: Send,\\n\\n{\\n\\n let proj = Arc::new(proj);\\n\\n\\n\\n from_fn_with_description(description, move |container: Input, cont| {\\n\\n let proj = Arc::clone(&proj);\\n\\n\\n\\n async move {\\n\\n let proj = proj.inject(&container);\\n\\n let res = proj().await;\\n\\n std::mem::drop(proj);\\n\",\n \"file_path\": \"src/handler/filter_map.rs\",\n \"rank\": 7,\n \"score\": 113208.22495815501\n },\n {\n \"content\": \"#[must_use]\\n\\n#[track_caller]\\n\\npub fn map<'a, Projection, Input, Output, NewType, Args, Descr>(\\n\\n proj: Projection,\\n\\n) -> Handler<'a, Input, Output, Descr>\\n\\nwhere\\n\\n Input: Clone,\\n\\n Asyncify<Projection>: Injectable<Input, NewType, Args> + Send + Sync + 'a,\\n\\n Input: Insert<NewType> + Send + Sync + 'a,\\n\\n Output: Send + Sync + 'a,\\n\\n Descr: HandlerDescription,\\n\\n NewType: Send,\\n\\n{\\n\\n map_with_description(Descr::map(), proj)\\n\\n}\\n\\n\\n\\n/// The asynchronous version of [`map`].\\n\",\n \"file_path\": \"src/handler/map.rs\",\n \"rank\": 8,\n \"score\": 111413.53768491725\n },\n {\n \"content\": \"#[must_use]\\n\\n#[track_caller]\\n\\npub fn map_async<'a, Projection, Input, Output, NewType, Args, Descr>(\\n\\n proj: Projection,\\n\\n) -> Handler<'a, Input, Output, Descr>\\n\\nwhere\\n\\n Input: Clone,\\n\\n Projection: Injectable<Input, NewType, Args> + Send + Sync + 'a,\\n\\n Input: Insert<NewType> + Send + Sync + 'a,\\n\\n Output: Send + Sync + 'a,\\n\\n Descr: HandlerDescription,\\n\\n NewType: Send,\\n\\n{\\n\\n map_async_with_description(Descr::map_async(), proj)\\n\\n}\\n\\n\\n\\n/// [`map`] with a custom description.\\n\",\n \"file_path\": \"src/handler/map.rs\",\n \"rank\": 9,\n \"score\": 109518.94596720312\n },\n {\n \"content\": \"/// Converts functions into [`CompiledFn`].\\n\\n///\\n\\n/// The function must follow some rules, to be usable with DI:\\n\\n///\\n\\n/// 1. For each function parameter of type `T`, `Input` must satisfy\\n\\n/// `DependencySupplier<T>`.\\n\\n/// 2. The function must be of 0-9 arguments.\\n\\n/// 3. The function must return [`Future`].\\n\\npub trait Injectable<Input, Output, FnArgs> {\\n\\n fn inject<'a>(&'a self, container: &'a Input) -> CompiledFn<'a, Output>;\\n\\n}\\n\\n\\n\\n/// A function with all dependencies satisfied.\\n\\npub type CompiledFn<'a, Output> = Arc<dyn Fn() -> BoxFuture<'a, Output> + Send + Sync + 'a>;\\n\\n\\n\\n/// Turns a synchronous function into a type that implements [`Injectable`].\\n\\npub struct Asyncify<F>(pub F);\\n\\n\\n\\nmacro_rules! impl_into_di {\\n\\n ($($generic:ident),*) => {\\n\\n impl<Func, Input, Output, Fut, $($generic),*> Injectable<Input, Output, ($($generic,)*)> for Func\\n\\n where\\n\\n Input: $(DependencySupplier<$generic> +)*,\\n\\n Input: Send + Sync,\\n\\n Func: Fn($($generic),*) -> Fut + Send + Sync + 'static,\\n\\n Fut: Future<Output = Output> + Send + 'static,\\n\\n $($generic: Clone + Send + Sync),*\\n\\n {\\n\",\n \"file_path\": \"src/di.rs\",\n \"rank\": 10,\n \"score\": 105983.6501492435\n },\n {\n \"content\": \"type WebHandler = Endpoint<'static, DependencyMap, String>;\\n\\n\\n\\n#[rustfmt::skip]\\n\\n#[tokio::main]\\n\\nasync fn main() {\\n\\n let web_server = dptree::entry()\\n\\n .branch(smiles_handler())\\n\\n .branch(sqrt_handler())\\n\\n .branch(not_found_handler());\\n\\n\\n\\n assert_eq!(\\n\\n web_server.dispatch(dptree::deps![\\\"/smile\\\"]).await,\\n\\n ControlFlow::Break(\\\"🙃\\\".to_owned())\\n\\n );\\n\\n assert_eq!(\\n\\n web_server.dispatch(dptree::deps![\\\"/sqrt 16\\\"]).await,\\n\\n ControlFlow::Break(\\\"4\\\".to_owned())\\n\\n );\\n\\n assert_eq!(\\n\\n web_server.dispatch(dptree::deps![\\\"/lol\\\"]).await,\\n\\n ControlFlow::Break(\\\"404 Not Found\\\".to_owned())\\n\\n );\\n\\n}\\n\\n\\n\",\n \"file_path\": \"examples/web_server.rs\",\n \"rank\": 11,\n \"score\": 104249.69858306258\n },\n {\n \"content\": \"type CommandHandler = Endpoint<'static, DependencyMap, String>;\\n\\n\\n\",\n \"file_path\": \"examples/simple_dispatcher.rs\",\n \"rank\": 12,\n \"score\": 104249.69858306258\n },\n {\n \"content\": \"#[must_use]\\n\\npub fn filter_with_description<'a, Pred, Input, Output, FnArgs, Descr>(\\n\\n description: Descr,\\n\\n pred: Pred,\\n\\n) -> Handler<'a, Input, Output, Descr>\\n\\nwhere\\n\\n Asyncify<Pred>: Injectable<Input, bool, FnArgs> + Send + Sync + 'a,\\n\\n Input: Send + Sync + 'a,\\n\\n Output: Send + Sync + 'a,\\n\\n{\\n\\n filter_async_with_description(description, Asyncify(pred))\\n\\n}\\n\\n\\n\\n/// [`filter_async`] with a custom description.\\n\",\n \"file_path\": \"src/handler/filter.rs\",\n \"rank\": 13,\n \"score\": 103852.26714478101\n },\n {\n \"content\": \"#[must_use]\\n\\npub fn filter_async_with_description<'a, Pred, Input, Output, FnArgs, Descr>(\\n\\n description: Descr,\\n\\n pred: Pred,\\n\\n) -> Handler<'a, Input, Output, Descr>\\n\\nwhere\\n\\n Pred: Injectable<Input, bool, FnArgs> + Send + Sync + 'a,\\n\\n Input: Send + Sync + 'a,\\n\\n Output: Send + Sync + 'a,\\n\\n{\\n\\n let pred = Arc::new(pred);\\n\\n\\n\\n from_fn_with_description(description, move |event, cont| {\\n\\n let pred = Arc::clone(&pred);\\n\\n\\n\\n async move {\\n\\n let pred = pred.inject(&event);\\n\\n let cond = pred().await;\\n\\n drop(pred);\\n\\n\\n\\n if cond {\\n\",\n \"file_path\": \"src/handler/filter.rs\",\n \"rank\": 14,\n \"score\": 101946.93555320262\n },\n {\n \"content\": \"/// Insert some value to a container.\\n\\npub trait Insert<Value> {\\n\\n /// Inserts `value` into itself, returning the previous value, if exists.\\n\\n fn insert(&mut self, value: Value) -> Option<Arc<Value>>;\\n\\n}\\n\\n\\n\\nimpl<T: Send + Sync + 'static> Insert<T> for DependencyMap {\\n\\n fn insert(&mut self, value: T) -> Option<Arc<T>> {\\n\\n DependencyMap::insert(self, value)\\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 get() {\\n\\n let mut map = DependencyMap::new();\\n\\n map.insert(42i32);\\n\\n map.insert(\\\"hello world\\\");\\n\\n map.insert_container(deps![true]);\\n\\n\\n\\n assert_eq!(map.get(), Arc::new(42i32));\\n\\n assert_eq!(map.get(), Arc::new(\\\"hello world\\\"));\\n\\n assert_eq!(map.get(), Arc::new(true));\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/di.rs\",\n \"rank\": 15,\n \"score\": 93927.88749866367\n },\n {\n \"content\": \"#[must_use]\\n\\npub fn map_with_description<'a, Projection, Input, Output, NewType, Args, Descr>(\\n\\n description: Descr,\\n\\n proj: Projection,\\n\\n) -> Handler<'a, Input, Output, Descr>\\n\\nwhere\\n\\n Input: Clone,\\n\\n Asyncify<Projection>: Injectable<Input, NewType, Args> + Send + Sync + 'a,\\n\\n Input: Insert<NewType> + Send + Sync + 'a,\\n\\n Output: Send + Sync + 'a,\\n\\n Descr: HandlerDescription,\\n\\n NewType: Send,\\n\\n{\\n\\n map_async_with_description(description, Asyncify(proj))\\n\\n}\\n\\n\\n\\n/// [`map_async`] with a custom description.\\n\",\n \"file_path\": \"src/handler/map.rs\",\n \"rank\": 16,\n \"score\": 92550.40625734326\n },\n {\n \"content\": \"/// A DI container from which we can extract a value of a given type.\\n\\n///\\n\\n/// There are two possible ways to handle the situation when your container\\n\\n/// cannot return a value of specified type:\\n\\n///\\n\\n/// 1. Do not implement [`DependencySupplier`] for the type. It often requires\\n\\n/// some type-level manipulations.\\n\\n/// 2. Runtime panic. Be careful in this case: check whether you add your type\\n\\n/// to the container.\\n\\n///\\n\\n/// A concrete solution is left to a particular implementation.\\n\\npub trait DependencySupplier<Value> {\\n\\n /// Get the value.\\n\\n ///\\n\\n /// We assume that all values are stored in `Arc<_>`.\\n\\n fn get(&self) -> Arc<Value>;\\n\\n}\\n\\n\\n\\n/// A DI container with multiple dependencies.\\n\\n///\\n\\n/// This DI container stores types by their corresponding type identifiers. It\\n\\n/// cannot prove at compile-time that a type of a requested value exists within\\n\\n/// the container, so if you do not provide necessary types but they were\\n\\n/// requested, it will panic.\\n\\n///\\n\\n/// # Examples\\n\\n///\\n\\n/// ```\\n\\n/// # use std::sync::Arc;\\n\\n/// use dptree::di::{DependencyMap, DependencySupplier};\\n\\n///\\n\",\n \"file_path\": \"src/di.rs\",\n \"rank\": 17,\n \"score\": 91777.26195894007\n },\n {\n \"content\": \"#[must_use]\\n\\npub fn map_async_with_description<'a, Projection, Input, Output, NewType, Args, Descr>(\\n\\n description: Descr,\\n\\n proj: Projection,\\n\\n) -> Handler<'a, Input, Output, Descr>\\n\\nwhere\\n\\n Input: Clone,\\n\\n Projection: Injectable<Input, NewType, Args> + Send + Sync + 'a,\\n\\n Input: Insert<NewType> + Send + Sync + 'a,\\n\\n Output: Send + Sync + 'a,\\n\\n Descr: HandlerDescription,\\n\\n NewType: Send,\\n\\n{\\n\\n let proj = Arc::new(proj);\\n\\n\\n\\n from_fn_with_description(description, move |container: Input, cont| {\\n\\n let proj = Arc::clone(&proj);\\n\\n\\n\\n async move {\\n\\n let proj = proj.inject(&container);\\n\\n let res = proj().await;\\n\",\n \"file_path\": \"src/handler/map.rs\",\n \"rank\": 18,\n \"score\": 90762.42975638456\n },\n {\n \"content\": \"type Transition = Endpoint<'static, Store, TransitionOut>;\\n\",\n \"file_path\": \"examples/state_machine.rs\",\n \"rank\": 19,\n \"score\": 86366.62315577304\n },\n {\n \"content\": \"#[must_use]\\n\\n#[track_caller]\\n\\npub fn entry<'a, Input, Output, Descr>() -> Handler<'a, Input, Output, Descr>\\n\\nwhere\\n\\n Input: Send + Sync + 'a,\\n\\n Output: Send + Sync + 'a,\\n\\n Descr: HandlerDescription,\\n\\n{\\n\\n from_fn_with_description(Descr::entry(), |event, cont| cont(event))\\n\\n}\\n\\n\\n\\n#[cfg(test)]\\n\\npub(crate) fn help_inference<I, O>(h: Handler<I, O>) -> Handler<I, O> {\\n\\n h\\n\\n}\\n\\n\\n\\n#[cfg(test)]\\n\\nmod tests {\\n\\n use maplit::hashset;\\n\\n\\n\\n use crate::{\\n\\n deps, description, filter_map, filter_map_with_description,\\n\",\n \"file_path\": \"src/handler/core.rs\",\n \"rank\": 20,\n \"score\": 84623.40106453602\n },\n {\n \"content\": \"#[track_caller]\\n\\nfn collector(name: &'static str) -> CollectLocations {\\n\\n CollectLocations { locations: vec![(name, Location::caller())] }\\n\\n}\\n\\n\\n\\nimpl HandlerDescription for CollectLocations {\\n\\n #[track_caller]\\n\\n fn entry() -> Self {\\n\\n collector(\\\"entry\\\")\\n\\n }\\n\\n\\n\\n #[track_caller]\\n\\n fn user_defined() -> Self {\\n\\n collector(\\\"user_defined\\\")\\n\\n }\\n\\n\\n\\n #[track_caller]\\n\\n fn merge_chain(&self, other: &Self) -> Self {\\n\\n let locations = self\\n\\n .locations\\n\\n .iter()\\n\",\n \"file_path\": \"examples/descr_locations.rs\",\n \"rank\": 21,\n \"score\": 79092.6021451737\n },\n {\n \"content\": \"#[must_use]\\n\\npub fn from_fn_with_description<'a, F, Fut, Input, Output, Descr>(\\n\\n description: Descr,\\n\\n f: F,\\n\\n) -> Handler<'a, Input, Output, Descr>\\n\\nwhere\\n\\n F: Fn(Input, Cont<'a, Input, Output>) -> Fut,\\n\\n F: Send + Sync + 'a,\\n\\n Fut: Future<Output = ControlFlow<Output, Input>> + Send + 'a,\\n\\n{\\n\\n Handler {\\n\\n data: Arc::new(HandlerData {\\n\\n f: move |event, cont| Box::pin(f(event, cont)) as HandlerResult<_, _>,\\n\\n description,\\n\\n }),\\n\\n }\\n\\n}\\n\\n\\n\\n/// Constructs an entry point handler.\\n\\n///\\n\\n/// This function is only used to specify other handlers upon it (see the root\\n\\n/// examples).\\n\",\n \"file_path\": \"src/handler/core.rs\",\n \"rank\": 22,\n \"score\": 77034.3110163111\n },\n {\n \"content\": \"struct HandlerData<Descr, F: ?Sized> {\\n\\n description: Descr,\\n\\n f: F,\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/handler/core.rs\",\n \"rank\": 23,\n \"score\": 68033.50362159465\n },\n {\n \"content\": \"#[must_use]\\n\\npub fn from_fn<'a, F, Fut, Input, Output, Descr>(f: F) -> Handler<'a, Input, Output, Descr>\\n\\nwhere\\n\\n F: Fn(Input, Cont<'a, Input, Output>) -> Fut + Send + Sync + 'a,\\n\\n Fut: Future<Output = ControlFlow<Output, Input>> + Send + 'a,\\n\\n Descr: HandlerDescription,\\n\\n{\\n\\n from_fn_with_description(Descr::user_defined(), f)\\n\\n}\\n\\n\\n\\n/// [`from_fn`] with a custom description.\\n\",\n \"file_path\": \"src/handler/core.rs\",\n \"rank\": 24,\n \"score\": 65341.30427542399\n },\n {\n \"content\": \"#[derive(Clone)]\\n\\nstruct Dependency {\\n\\n type_name: &'static str,\\n\\n inner: Arc<dyn Any + Send + Sync>,\\n\\n}\\n\\n\\n\\nimpl PartialEq for DependencyMap {\\n\\n fn eq(&self, other: &Self) -> bool {\\n\\n let keys1 = self.map.keys();\\n\\n let keys2 = other.map.keys();\\n\\n keys1.zip(keys2).map(|(k1, k2)| k1 == k2).all(|x| x)\\n\\n }\\n\\n}\\n\\n\\n\\nimpl DependencyMap {\\n\\n pub fn new() -> Self {\\n\\n Self::default()\\n\\n }\\n\\n\\n\\n /// Inserts a value into the container.\\n\\n ///\\n\",\n \"file_path\": \"src/di.rs\",\n \"rank\": 25,\n \"score\": 54261.94131157676\n },\n {\n \"content\": \"use crate::{\\n\\n di::{Asyncify, Injectable, Insert},\\n\\n from_fn_with_description, Handler, HandlerDescription,\\n\\n};\\n\\nuse std::{ops::ControlFlow, sync::Arc};\\n\\n\\n\\n/// Constructs a handler that optionally passes a value of a new type further.\\n\\n///\\n\\n/// If the `proj` function returns `Some(v)` then `v` will be added to the\\n\\n/// container and passed further in a handler chain. If the function returns\\n\\n/// `None`, then the handler will return [`ControlFlow::Continue`] with the old\\n\\n/// container.\\n\\n#[must_use]\\n\\n#[track_caller]\\n\",\n \"file_path\": \"src/handler/filter_map.rs\",\n \"rank\": 26,\n \"score\": 53972.53157666978\n },\n {\n \"content\": \"\\n\\n match res {\\n\\n Some(new_type) => {\\n\\n let mut intermediate = container.clone();\\n\\n intermediate.insert(new_type);\\n\\n match cont(intermediate).await {\\n\\n ControlFlow::Continue(_) => ControlFlow::Continue(container),\\n\\n ControlFlow::Break(result) => ControlFlow::Break(result),\\n\\n }\\n\\n }\\n\\n None => ControlFlow::Continue(container),\\n\\n }\\n\\n }\\n\\n })\\n\\n}\\n\\n\\n\\n#[cfg(test)]\\n\\nmod tests {\\n\\n use super::*;\\n\\n use crate::{deps, help_inference};\\n\",\n \"file_path\": \"src/handler/filter_map.rs\",\n \"rank\": 27,\n \"score\": 53968.43611763874\n },\n {\n \"content\": \"\\n\\n #[tokio::test]\\n\\n async fn test_some() {\\n\\n let value = 123;\\n\\n\\n\\n let result = help_inference(filter_map(move || Some(value)))\\n\\n .endpoint(move |event: i32| async move {\\n\\n assert_eq!(event, value);\\n\\n value\\n\\n })\\n\\n .dispatch(deps![])\\n\\n .await;\\n\\n\\n\\n assert!(result == ControlFlow::Break(value));\\n\\n }\\n\\n\\n\\n #[tokio::test]\\n\\n async fn test_none() {\\n\\n let result = help_inference(filter_map(|| None::<i32>))\\n\\n .endpoint(|| async move { unreachable!() })\\n\\n .dispatch(deps![])\\n\\n .await;\\n\\n\\n\\n assert!(result == ControlFlow::Continue(crate::deps![]));\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/handler/filter_map.rs\",\n \"rank\": 28,\n \"score\": 53968.172500595574\n },\n {\n \"content\": \"#[derive(Copy, Clone, Debug)]\\n\\nenum Event {\\n\\n Ping,\\n\\n SetValue(i32),\\n\\n PrintValue,\\n\\n}\\n\\n\\n\\nimpl Event {\\n\\n fn parse(input: &[&str]) -> Option<Self> {\\n\\n match input {\\n\\n [\\\"ping\\\"] => Some(Event::Ping),\\n\\n [\\\"set_value\\\", value] => Some(Event::SetValue(value.parse().ok()?)),\\n\\n [\\\"print\\\"] => Some(Event::PrintValue),\\n\\n _ => None,\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"examples/simple_dispatcher.rs\",\n \"rank\": 29,\n \"score\": 53374.19869119703\n },\n {\n \"content\": \"struct CollectLocations {\\n\\n locations: Vec<(&'static str, &'static Location<'static>)>,\\n\\n}\\n\\n\\n\",\n \"file_path\": \"examples/descr_locations.rs\",\n \"rank\": 30,\n \"score\": 51767.401535891724\n },\n {\n \"content\": \"fn main() {\\n\\n #[rustfmt::skip]\\n\\n let some_tree: Handler<DependencyMap, _, _> = dptree::entry()\\n\\n .branch(\\n\\n dptree::filter(|| true)\\n\\n .endpoint(|| async {})\\n\\n )\\n\\n .branch(\\n\\n dptree::filter_async(|| async { true })\\n\\n .chain(dptree::filter_map(|| Some(1) ))\\n\\n .endpoint(|| async {})\\n\\n );\\n\\n\\n\\n get_locations(&some_tree).iter().for_each(|(name, loc)| println!(\\\"{name: <12} @ {loc}\\\"));\\n\\n}\\n\",\n \"file_path\": \"examples/descr_locations.rs\",\n \"rank\": 31,\n \"score\": 45704.20982797119\n },\n {\n \"content\": \"fn get_locations<'a, 'b>(\\n\\n handler: &'a Handler<'b, impl Send + Sync + 'b, impl Send + Sync + 'b, CollectLocations>,\\n\\n) -> &'a [(&'static str, &'static Location<'static>)] {\\n\\n &handler.description().locations\\n\\n}\\n\\n\\n\",\n \"file_path\": \"examples/descr_locations.rs\",\n \"rank\": 32,\n \"score\": 42358.266987880525\n },\n {\n \"content\": \"type FsmHandler = Handler<'static, Store, TransitionOut>;\\n\\n\\n\",\n \"file_path\": \"examples/state_machine.rs\",\n \"rank\": 33,\n \"score\": 42199.059048529074\n },\n {\n \"content\": \"fn sqrt_handler() -> WebHandler {\\n\\n dptree::filter_map(|req: &'static str| {\\n\\n if req.starts_with(\\\"/sqrt\\\") {\\n\\n let (_, n) = req.split_once(' ')?;\\n\\n n.parse::<f64>().ok()\\n\\n } else {\\n\\n None\\n\\n }\\n\\n })\\n\\n .endpoint(|n: f64| async move { format!(\\\"{}\\\", n.sqrt()) })\\n\\n}\\n\\n\\n\",\n \"file_path\": \"examples/web_server.rs\",\n \"rank\": 34,\n \"score\": 41395.830893277525\n },\n {\n \"content\": \"fn ping_handler() -> CommandHandler {\\n\\n dptree::filter_async(|event: Event| async move { matches!(event, Event::Ping) })\\n\\n .endpoint(|| async { \\\"Pong\\\".to_string() })\\n\\n}\\n\\n\\n\",\n \"file_path\": \"examples/simple_dispatcher.rs\",\n \"rank\": 35,\n \"score\": 41395.830893277525\n },\n {\n \"content\": \"fn paused_handler() -> FsmHandler {\\n\\n dptree::case![CommandState::Paused].branch(transitions::resume()).branch(transitions::end())\\n\\n}\\n\\n\\n\",\n \"file_path\": \"examples/state_machine.rs\",\n \"rank\": 36,\n \"score\": 41395.830893277525\n },\n {\n \"content\": \"fn smiles_handler() -> WebHandler {\\n\\n dptree::filter(|req: &'static str| req.starts_with(\\\"/smile\\\"))\\n\\n .endpoint(|| async { \\\"🙃\\\".to_owned() })\\n\\n}\\n\\n\\n\",\n \"file_path\": \"examples/web_server.rs\",\n \"rank\": 37,\n \"score\": 41395.830893277525\n },\n {\n \"content\": \"fn exit_handler() -> FsmHandler {\\n\\n dptree::case![CommandState::Exit].branch(transitions::exit())\\n\\n}\\n\",\n \"file_path\": \"examples/state_machine.rs\",\n \"rank\": 38,\n \"score\": 41395.830893277525\n },\n {\n \"content\": \"fn active_handler() -> FsmHandler {\\n\\n dptree::case![CommandState::Active].branch(transitions::pause()).branch(transitions::end())\\n\\n}\\n\\n\\n\",\n \"file_path\": \"examples/state_machine.rs\",\n \"rank\": 39,\n \"score\": 41395.830893277525\n },\n {\n \"content\": \"fn inactive_handler() -> FsmHandler {\\n\\n dptree::case![CommandState::Inactive].branch(transitions::begin()).branch(transitions::exit())\\n\\n}\\n\\n\\n\",\n \"file_path\": \"examples/state_machine.rs\",\n \"rank\": 40,\n \"score\": 41395.830893277525\n },\n {\n \"content\": \"fn not_found_handler() -> WebHandler {\\n\\n dptree::endpoint(|| async { \\\"404 Not Found\\\".to_owned() })\\n\\n}\\n\",\n \"file_path\": \"examples/web_server.rs\",\n \"rank\": 41,\n \"score\": 41395.830893277525\n },\n {\n \"content\": \"fn set_value_handler() -> CommandHandler {\\n\\n dptree::filter_map_async(|event: Event| async move {\\n\\n match event {\\n\\n Event::SetValue(value) => Some(value),\\n\\n _ => None,\\n\\n }\\n\\n })\\n\\n .endpoint(move |value: i32, store: Arc<AtomicI32>| async move {\\n\\n store.store(value, Ordering::SeqCst);\\n\\n format!(\\\"{} stored\\\", value)\\n\\n })\\n\\n}\\n\\n\\n\",\n \"file_path\": \"examples/simple_dispatcher.rs\",\n \"rank\": 42,\n \"score\": 40510.088125972594\n },\n {\n \"content\": \"fn print_value_handler() -> CommandHandler {\\n\\n dptree::filter_async(|event: Event| async move { matches!(event, Event::PrintValue) }).endpoint(\\n\\n move |store: Arc<AtomicI32>| async move {\\n\\n let value = store.load(Ordering::SeqCst);\\n\\n format!(\\\"{}\\\", value)\\n\\n },\\n\\n )\\n\\n}\\n\",\n \"file_path\": \"examples/simple_dispatcher.rs\",\n \"rank\": 43,\n \"score\": 40510.088125972594\n },\n {\n \"content\": \"use crate::{description, di::Injectable, from_fn_with_description, Handler, HandlerDescription};\\n\\nuse futures::FutureExt;\\n\\nuse std::{ops::ControlFlow, sync::Arc};\\n\\n\\n\\nimpl<'a, Input, Output, Descr> Handler<'a, Input, Output, Descr>\\n\\nwhere\\n\\n Input: Send + Sync + 'a,\\n\\n Output: Send + Sync + 'a,\\n\\n Descr: HandlerDescription,\\n\\n{\\n\\n /// Chain this handler with the endpoint handler `f`.\\n\\n #[must_use]\\n\\n #[track_caller]\\n\\n pub fn endpoint<F, FnArgs>(self, f: F) -> Endpoint<'a, Input, Output, Descr>\\n\\n where\\n\\n F: Injectable<Input, Output, FnArgs> + Send + Sync + 'a,\\n\\n {\\n\\n self.chain(endpoint(f))\\n\\n }\\n\\n}\\n\\n\\n\\n/// Constructs a handler that has no further handlers in a chain.\\n\\n///\\n\\n/// An endpoint is a handler that _always_ breaks handler execution after its\\n\\n/// completion. So, you can use it when your chain of responsibility must end\\n\\n/// up, and handle an incoming event.\\n\\n#[must_use]\\n\\n#[track_caller]\\n\",\n \"file_path\": \"src/handler/endpoint.rs\",\n \"rank\": 44,\n \"score\": 28755.788048130416\n },\n {\n \"content\": \" Handler<'a, Input, Output, Descr>;\\n\\n\\n\\n#[cfg(test)]\\n\\nmod tests {\\n\\n use super::*;\\n\\n use crate::{deps, help_inference};\\n\\n\\n\\n #[tokio::test]\\n\\n async fn test_endpoint() {\\n\\n let input = 123;\\n\\n let output = 7;\\n\\n\\n\\n let result = help_inference(endpoint(move |num: i32| async move {\\n\\n assert_eq!(num, input);\\n\\n output\\n\\n }))\\n\\n .dispatch(deps![input])\\n\\n .await;\\n\\n\\n\\n let result = match result {\\n\\n ControlFlow::Break(b) => b,\\n\\n _ => panic!(\\\"Unexpected: handler return ControlFlow::Break\\\"),\\n\\n };\\n\\n assert_eq!(result, output);\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/handler/endpoint.rs\",\n \"rank\": 45,\n \"score\": 28747.834077232237\n },\n {\n \"content\": \"use crate::{\\n\\n di::{Asyncify, Injectable},\\n\\n from_fn_with_description,\\n\\n handler::core::Handler,\\n\\n HandlerDescription,\\n\\n};\\n\\nuse std::{ops::ControlFlow, sync::Arc};\\n\\n\\n\\n/// Constructs a handler that filters input with the predicate `pred`.\\n\\n///\\n\\n/// `pred` has an access to all values that are stored in the input container.\\n\\n/// If it returns `true`, a continuation of the handler will be called,\\n\\n/// otherwise the handler returns [`ControlFlow::Continue`].\\n\\n#[must_use]\\n\\n#[track_caller]\\n\",\n \"file_path\": \"src/handler/filter.rs\",\n \"rank\": 46,\n \"score\": 28336.225145953722\n },\n {\n \"content\": \" assert_eq!(event, input_value);\\n\\n true\\n\\n }))\\n\\n .endpoint(move |event: i32| async move {\\n\\n assert_eq!(event, input_value);\\n\\n output\\n\\n })\\n\\n .dispatch(input)\\n\\n .await;\\n\\n\\n\\n assert!(result == ControlFlow::Break(output));\\n\\n }\\n\\n\\n\\n #[tokio::test]\\n\\n async fn test_and_then_filter() {\\n\\n let input = 123;\\n\\n let output = 7;\\n\\n\\n\\n let result = help_inference(filter(move |event: i32| {\\n\\n assert_eq!(event, input);\\n\",\n \"file_path\": \"src/handler/filter.rs\",\n \"rank\": 47,\n \"score\": 28332.87634485482\n },\n {\n \"content\": \" cont(event).await\\n\\n } else {\\n\\n ControlFlow::Continue(event)\\n\\n }\\n\\n }\\n\\n })\\n\\n}\\n\\n\\n\\n#[cfg(test)]\\n\\nmod tests {\\n\\n use super::*;\\n\\n use crate::{deps, help_inference};\\n\\n\\n\\n #[tokio::test]\\n\\n async fn test_filter() {\\n\\n let input_value = 123;\\n\\n let input = deps![input_value];\\n\\n let output = 7;\\n\\n\\n\\n let result = help_inference(filter_async(move |event: i32| async move {\\n\",\n \"file_path\": \"src/handler/filter.rs\",\n \"rank\": 48,\n \"score\": 28332.46251647711\n },\n {\n \"content\": \" true\\n\\n }))\\n\\n .chain(\\n\\n filter_async(move |event: i32| async move {\\n\\n assert_eq!(event, input);\\n\\n true\\n\\n })\\n\\n .endpoint(move |event: i32| async move {\\n\\n assert_eq!(event, input);\\n\\n output\\n\\n }),\\n\\n )\\n\\n .dispatch(deps![input])\\n\\n .await;\\n\\n\\n\\n assert!(result == ControlFlow::Break(output));\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/handler/filter.rs\",\n \"rank\": 49,\n \"score\": 28330.825804268537\n },\n {\n \"content\": \"use crate::{\\n\\n di::{Asyncify, Injectable, Insert},\\n\\n from_fn_with_description, Handler, HandlerDescription,\\n\\n};\\n\\nuse std::{ops::ControlFlow, sync::Arc};\\n\\n\\n\\n/// Constructs a handler that passes a value of a new type further.\\n\\n///\\n\\n/// The result of invoking `proj` will be added to the container and passed\\n\\n/// further in a handler chain.\\n\\n///\\n\\n/// See also: [`crate::filter_map`].\\n\\n#[must_use]\\n\\n#[track_caller]\\n\",\n \"file_path\": \"src/handler/map.rs\",\n \"rank\": 50,\n \"score\": 28194.18758197884\n },\n {\n \"content\": \" std::mem::drop(proj);\\n\\n\\n\\n let mut intermediate = container.clone();\\n\\n intermediate.insert(res);\\n\\n match cont(intermediate).await {\\n\\n ControlFlow::Continue(_) => ControlFlow::Continue(container),\\n\\n ControlFlow::Break(result) => ControlFlow::Break(result),\\n\\n }\\n\\n }\\n\\n })\\n\\n}\\n\\n\\n\\n#[cfg(test)]\\n\\nmod tests {\\n\\n use super::*;\\n\\n use crate::{deps, help_inference};\\n\\n\\n\\n #[tokio::test]\\n\\n async fn test_map() {\\n\\n let value = 123;\\n\",\n \"file_path\": \"src/handler/map.rs\",\n \"rank\": 51,\n \"score\": 28191.41688061015\n },\n {\n \"content\": \"\\n\\n let result = help_inference(map(move || value))\\n\\n .endpoint(move |event: i32| async move {\\n\\n assert_eq!(event, value);\\n\\n value\\n\\n })\\n\\n .dispatch(deps![])\\n\\n .await;\\n\\n\\n\\n assert!(result == ControlFlow::Break(value));\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/handler/map.rs\",\n \"rank\": 52,\n \"score\": 28188.32332798353\n },\n {\n \"content\": \"type Store = Arc<DependencyMap>;\\n\\n\\n\\n#[tokio::main]\\n\\nasync fn main() {\\n\\n fn assert_num_string_handler(\\n\\n expected_num: u32,\\n\\n expected_string: &'static str,\\n\\n ) -> Endpoint<'static, Store, ()> {\\n\\n // The handler requires `u32` and `String` types from the input storage.\\n\\n dptree::endpoint(move |num: u32, string: String| async move {\\n\\n assert_eq!(num, expected_num);\\n\\n assert_eq!(string, expected_string);\\n\\n })\\n\\n }\\n\\n\\n\\n // Init storage with string and num\\n\\n let store = Arc::new(dptree::deps![10u32, \\\"Hello\\\".to_owned()]);\\n\\n\\n\\n let str_num_handler = assert_num_string_handler(10u32, \\\"Hello\\\");\\n\\n\\n\",\n \"file_path\": \"examples/storage.rs\",\n \"rank\": 53,\n \"score\": 24687.47907524598\n },\n {\n \"content\": \"type Store = dptree::di::DependencyMap;\\n\",\n \"file_path\": \"examples/state_machine.rs\",\n \"rank\": 54,\n \"score\": 22801.64052358502\n },\n {\n \"content\": \"//! Commonly used items.\\n\\n\\n\\npub use crate::{di::DependencyMap, Endpoint, Handler};\\n\\npub use std::ops::ControlFlow;\\n\",\n \"file_path\": \"src/prelude.rs\",\n \"rank\": 56,\n \"score\": 14.292753718292591\n },\n {\n \"content\": \" #[allow(non_snake_case)]\\n\\n #[allow(unused_variables)]\\n\\n fn inject<'a>(&'a self, container: &'a Input) -> CompiledFn<'a, Output> {\\n\\n Arc::new(move || {\\n\\n $(let $generic = std::borrow::Borrow::<$generic>::borrow(&container.get()).clone();)*\\n\\n let fut = self( $( $generic ),* );\\n\\n Box::pin(fut)\\n\\n })\\n\\n }\\n\\n }\\n\\n\\n\\n impl<Func, Input, Output, $($generic),*> Injectable<Input, Output, ($($generic,)*)> for Asyncify<Func>\\n\\n where\\n\\n Input: $(DependencySupplier<$generic> +)*,\\n\\n Input: Send + Sync,\\n\\n Func: Fn($($generic),*) -> Output + Send + Sync + 'static,\\n\\n Output: Send + 'static,\\n\\n $($generic: Clone + Send + Sync),*\\n\\n {\\n\\n #[allow(non_snake_case)]\\n\",\n \"file_path\": \"src/di.rs\",\n \"rank\": 57,\n \"score\": 13.830068315785352\n },\n {\n \"content\": \" where\\n\\n Out: Send + Sync + 'static,\\n\\n {\\n\\n filter_map_with_description(\\n\\n InterestList(hashset! { UpdateKind::B }),\\n\\n |update: Update| match update {\\n\\n Update::B(x) => Some(x),\\n\\n _ => None,\\n\\n },\\n\\n )\\n\\n }\\n\\n\\n\\n fn filter_c<Out>(\\n\\n ) -> Handler<'static, DependencyMap, Out, description::EventKind<UpdateKind>>\\n\\n where\\n\\n Out: Send + Sync + 'static,\\n\\n {\\n\\n filter_map_with_description(\\n\\n InterestList(hashset! { UpdateKind::C }),\\n\\n |update: Update| match update {\\n\",\n \"file_path\": \"src/handler/core.rs\",\n \"rank\": 58,\n \"score\": 13.779291915205254\n },\n {\n \"content\": \" }\\n\\n}\\n\\n\\n\\nimpl<V> DependencySupplier<V> for DependencyMap\\n\\nwhere\\n\\n V: Send + Sync + 'static,\\n\\n{\\n\\n fn get(&self) -> Arc<V> {\\n\\n self.map\\n\\n .get(&TypeId::of::<V>())\\n\\n .unwrap_or_else(|| {\\n\\n panic!(\\n\\n \\\"{} was requested, but not provided. Available types:\\\\n{}\\\",\\n\\n std::any::type_name::<V>(),\\n\\n self.available_types()\\n\\n )\\n\\n })\\n\\n .clone()\\n\\n .inner\\n\\n .downcast::<V>()\\n\",\n \"file_path\": \"src/di.rs\",\n \"rank\": 59,\n \"score\": 12.905650533098525\n },\n {\n \"content\": \" pub fn remove<T: Send + Sync + 'static>(&mut self) -> Option<Arc<T>> {\\n\\n self.map\\n\\n .remove(&TypeId::of::<T>())\\n\\n .map(|dep| dep.inner.downcast().expect(\\\"Values are stored by TypeId\\\"))\\n\\n }\\n\\n\\n\\n fn available_types(&self) -> String {\\n\\n let mut list = String::new();\\n\\n\\n\\n for dep in self.map.values() {\\n\\n writeln!(list, \\\" {}\\\", dep.type_name).unwrap();\\n\\n }\\n\\n\\n\\n list\\n\\n }\\n\\n}\\n\\n\\n\\nimpl Debug for DependencyMap {\\n\\n fn fmt(&self, f: &mut Formatter<'_>) -> Result<(), std::fmt::Error> {\\n\\n f.debug_struct(\\\"DependencyMap\\\").finish()\\n\",\n \"file_path\": \"src/di.rs\",\n \"rank\": 60,\n \"score\": 12.807727000511091\n },\n {\n \"content\": \" /// If the container do not has this type present, `None` is returned.\\n\\n /// Otherwise, the value is updated, and the old value is returned.\\n\\n pub fn insert<T: Send + Sync + 'static>(&mut self, item: T) -> Option<Arc<T>> {\\n\\n self.map\\n\\n .insert(\\n\\n TypeId::of::<T>(),\\n\\n Dependency { type_name: std::any::type_name::<T>(), inner: Arc::new(item) },\\n\\n )\\n\\n .map(|dep| dep.inner.downcast().expect(\\\"Values are stored by TypeId\\\"))\\n\\n }\\n\\n\\n\\n /// Inserts all dependencies from another container into itself.\\n\\n pub fn insert_container(&mut self, container: Self) {\\n\\n self.map.extend(container.map);\\n\\n }\\n\\n\\n\\n /// Removes a value from the container.\\n\\n ///\\n\\n /// If the container do not has this type present, `None` is returned.\\n\\n /// Otherwise, the value is removed and returned.\\n\",\n \"file_path\": \"src/di.rs\",\n \"rank\": 62,\n \"score\": 11.9947725541206\n },\n {\n \"content\": \" B(u8),\\n\\n C(u64),\\n\\n }\\n\\n\\n\\n fn filter_a<Out>(\\n\\n ) -> Handler<'static, DependencyMap, Out, description::EventKind<UpdateKind>>\\n\\n where\\n\\n Out: Send + Sync + 'static,\\n\\n {\\n\\n filter_map_with_description(\\n\\n InterestList(hashset! { UpdateKind::A }),\\n\\n |update: Update| match update {\\n\\n Update::A(x) => Some(x),\\n\\n _ => None,\\n\\n },\\n\\n )\\n\\n }\\n\\n\\n\\n fn filter_b<Out>(\\n\\n ) -> Handler<'static, DependencyMap, Out, description::EventKind<UpdateKind>>\\n\",\n \"file_path\": \"src/handler/core.rs\",\n \"rank\": 63,\n \"score\": 11.781195466309825\n },\n {\n \"content\": \" Update::B(x) => Some(x),\\n\\n _ => None,\\n\\n },\\n\\n )\\n\\n }\\n\\n\\n\\n // User-defined filter that doesn't provide allowed updates\\n\\n fn user_defined_filter<Out>(\\n\\n ) -> Handler<'static, DependencyMap, Out, description::EventKind<UpdateKind>>\\n\\n where\\n\\n Out: Send + Sync + 'static,\\n\\n {\\n\\n filter_map(|update: Update| match update {\\n\\n Update::B(x) => Some(x),\\n\\n _ => None,\\n\\n })\\n\\n }\\n\\n\\n\\n #[track_caller]\\n\\n fn assert(\\n\",\n \"file_path\": \"src/handler/core.rs\",\n \"rank\": 65,\n \"score\": 11.361693460926134\n },\n {\n \"content\": \"# dptree\\n\\n[](https://github.com/p0lunin/dptree/actions/workflows/rust.yml)\\n\\n[](https://crates.io/crates/dptree)\\n\\n[](https://docs.rs/dptree)\\n\\n\\n\\nAn implementation of the [chain (tree) of responsibility] pattern.\\n\\n\\n\\n[[`examples/web_server.rs`](examples/web_server.rs)]\\n\\n```rust\\n\\nuse dptree::prelude::*;\\n\\n\\n\\ntype WebHandler = Endpoint<'static, DependencyMap, String>;\\n\\n\\n\\n#[rustfmt::skip]\\n\\n#[tokio::main]\\n\\nasync fn main() {\\n\\n let web_server = dptree::entry()\\n\\n .branch(smiles_handler())\\n\\n .branch(sqrt_handler())\\n\\n .branch(not_found_handler());\\n\\n\\n\\n assert_eq!(\\n\\n web_server.dispatch(dptree::deps![\\\"/smile\\\"]).await,\\n\\n ControlFlow::Break(\\\"🙃\\\".to_owned())\\n\\n );\\n\\n assert_eq!(\\n\\n web_server.dispatch(dptree::deps![\\\"/sqrt 16\\\"]).await,\\n\\n ControlFlow::Break(\\\"4\\\".to_owned())\\n\\n );\\n\\n assert_eq!(\\n\\n web_server.dispatch(dptree::deps![\\\"/lol\\\"]).await,\\n\\n ControlFlow::Break(\\\"404 Not Found\\\".to_owned())\\n\\n );\\n\\n}\\n\\n\\n\\nfn smiles_handler() -> WebHandler {\\n\\n dptree::filter(|req: &'static str| req.starts_with(\\\"/smile\\\"))\\n\\n .endpoint(|| async { \\\"🙃\\\".to_owned() })\\n\\n}\\n\\n\\n\\nfn sqrt_handler() -> WebHandler {\\n\\n dptree::filter_map(|req: &'static str| {\\n\\n if req.starts_with(\\\"/sqrt\\\") {\\n\\n let (_, n) = req.split_once(' ')?;\\n\\n n.parse::<f64>().ok()\\n\\n } else {\\n\\n None\\n\\n }\\n\\n })\\n\\n .endpoint(|n: f64| async move { format!(\\\"{}\\\", n.sqrt()) })\\n\\n}\\n\\n\\n\\nfn not_found_handler() -> WebHandler {\\n\\n dptree::endpoint(|| async { \\\"404 Not Found\\\".to_owned() })\\n\\n}\\n\\n```\\n\\n\\n\",\n \"file_path\": \"README.md\",\n \"rank\": 67,\n \"score\": 10.859506997964981\n },\n {\n \"content\": \"//! An implementation of the [chain (tree) of responsibility] pattern.\\n\\n//!\\n\\n//! ```\\n\\n//! use dptree::prelude::*;\\n\\n//!\\n\\n//! type WebHandler = Endpoint<'static, DependencyMap, String>;\\n\\n//!\\n\\n//! #[rustfmt::skip]\\n\\n//! #[tokio::main]\\n\\n//! async fn main() {\\n\\n//! let web_server = dptree::entry()\\n\\n//! .branch(smiles_handler())\\n\\n//! .branch(sqrt_handler())\\n\\n//! .branch(not_found_handler());\\n\\n//! \\n\\n//! assert_eq!(\\n\\n//! web_server.dispatch(dptree::deps![\\\"/smile\\\"]).await,\\n\\n//! ControlFlow::Break(\\\"🙃\\\".to_owned())\\n\\n//! );\\n\\n//! assert_eq!(\\n\",\n \"file_path\": \"src/lib.rs\",\n \"rank\": 68,\n \"score\": 10.85007183113916\n },\n {\n \"content\": \"mod core;\\n\\npub mod description;\\n\\nmod endpoint;\\n\\nmod filter;\\n\\nmod filter_map;\\n\\nmod map;\\n\\n\\n\\npub use self::core::*;\\n\\npub use description::HandlerDescription;\\n\\npub use endpoint::*;\\n\\npub use filter::*;\\n\\npub use filter_map::*;\\n\\npub use map::*;\\n\",\n \"file_path\": \"src/handler.rs\",\n \"rank\": 69,\n \"score\": 10.60624801538126\n },\n {\n \"content\": \" /// assert_eq!(\\n\\n /// handler.dispatch(dptree::deps![-10]).await,\\n\\n /// ControlFlow::Continue(dptree::deps![-10])\\n\\n /// );\\n\\n ///\\n\\n /// # }\\n\\n /// ```\\n\\n ///\\n\\n /// [chain of responsibility]: https://en.wikipedia.org/wiki/Chain-of-responsibility_pattern\\n\\n #[must_use]\\n\\n #[track_caller]\\n\\n pub fn chain(self, next: Self) -> Self {\\n\\n let required_update_kinds_set = self.description().merge_chain(next.description());\\n\\n\\n\\n from_fn_with_description(required_update_kinds_set, move |event, cont| {\\n\\n let this = self.clone();\\n\\n let next = next.clone();\\n\\n let cont = Arc::new(cont);\\n\\n\\n\\n this.execute(event, move |event| {\\n\",\n \"file_path\": \"src/handler/core.rs\",\n \"rank\": 70,\n \"score\": 10.537806057419724\n },\n {\n \"content\": \" /// );\\n\\n /// # }\\n\\n /// ```\\n\\n #[must_use]\\n\\n #[track_caller]\\n\\n pub fn branch(self, next: Self) -> Self {\\n\\n let required_update_kinds_set = self.description().merge_branch(next.description());\\n\\n\\n\\n from_fn_with_description(required_update_kinds_set, move |event, cont| {\\n\\n let this = self.clone();\\n\\n let next = next.clone();\\n\\n let cont = Arc::new(cont);\\n\\n\\n\\n this.execute(event, move |event| {\\n\\n let next = next.clone();\\n\\n let cont = cont.clone();\\n\\n\\n\\n async move {\\n\\n match next.dispatch(event).await {\\n\\n ControlFlow::Continue(event) => cont(event).await,\\n\",\n \"file_path\": \"src/handler/core.rs\",\n \"rank\": 72,\n \"score\": 9.942065341190846\n },\n {\n \"content\": \"/// let mut container = DependencyMap::new();\\n\\n/// container.insert(5_i32);\\n\\n/// container.insert(\\\"abc\\\");\\n\\n///\\n\\n/// assert_eq!(container.get(), Arc::new(5_i32));\\n\\n/// assert_eq!(container.get(), Arc::new(\\\"abc\\\"));\\n\\n///\\n\\n/// // If a type of a value already exists within the container, it will be replaced.\\n\\n/// let old_value = container.insert(10_i32).unwrap();\\n\\n///\\n\\n/// assert_eq!(old_value, Arc::new(5_i32));\\n\\n/// assert_eq!(container.get(), Arc::new(10_i32));\\n\\n/// ```\\n\\n///\\n\\n/// When a value is not found within the container, it will panic:\\n\\n///\\n\\n/// ```should_panic\\n\\n/// # use std::sync::Arc;\\n\\n/// use dptree::di::{DependencyMap, DependencySupplier};\\n\\n/// let mut container = DependencyMap::new();\\n\",\n \"file_path\": \"src/di.rs\",\n \"rank\": 73,\n \"score\": 9.8166885386589\n },\n {\n \"content\": \"use std::{future::Future, ops::ControlFlow, sync::Arc};\\n\\n\\n\\nuse futures::future::BoxFuture;\\n\\n\\n\\nuse crate::{description, HandlerDescription};\\n\\n\\n\\n/// An instance that receives an input and decides whether to break a chain or\\n\\n/// pass the value further.\\n\\n///\\n\\n/// In order to create this structure, you can use the predefined functions from\\n\\n/// [`crate`].\\n\\npub struct Handler<'a, Input, Output, Descr = description::Unspecified> {\\n\\n data: Arc<HandlerData<Descr, DynF<'a, Input, Output>>>,\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/handler/core.rs\",\n \"rank\": 74,\n \"score\": 9.630295976660939\n },\n {\n \"content\": \" handler: Handler<'static, DependencyMap, (), description::EventKind<UpdateKind>>,\\n\\n allowed: description::EventKind<UpdateKind>,\\n\\n ) {\\n\\n assert_eq!(handler.description(), &allowed)\\n\\n }\\n\\n\\n\\n assert(filter_a().chain(filter_b()), InterestList(hashset! {}));\\n\\n assert(entry().chain(filter_b()), InterestList(hashset! { UpdateKind::B }));\\n\\n\\n\\n assert(\\n\\n filter_a().branch(filter_b()),\\n\\n InterestList(hashset! { UpdateKind::A, UpdateKind::B }),\\n\\n );\\n\\n assert(\\n\\n filter_a().branch(filter_b()).branch(filter_c().chain(filter_c())),\\n\\n InterestList(hashset! { UpdateKind::A, UpdateKind::B, UpdateKind::C }),\\n\\n );\\n\\n assert(filter_a().chain(filter(|| true)), InterestList(hashset! { UpdateKind::A }));\\n\\n assert(user_defined_filter().chain(filter_a()), UserDefined);\\n\\n assert(filter_a().chain(user_defined_filter()), InterestList(hashset! { UpdateKind::A }));\\n\",\n \"file_path\": \"src/handler/core.rs\",\n \"rank\": 75,\n \"score\": 9.50151033076001\n },\n {\n \"content\": \" handler::{endpoint, filter, filter_async},\\n\\n prelude::DependencyMap,\\n\\n };\\n\\n\\n\\n use super::*;\\n\\n\\n\\n #[tokio::test]\\n\\n async fn test_from_fn_break() {\\n\\n let input = 123;\\n\\n let output = \\\"ABC\\\";\\n\\n\\n\\n let result = help_inference(from_fn(|event, _cont: Cont<i32, &'static str>| async move {\\n\\n assert_eq!(event, input);\\n\\n ControlFlow::Break(output)\\n\\n }))\\n\\n .dispatch(input)\\n\\n .await;\\n\\n\\n\\n assert!(result == ControlFlow::Break(output));\\n\\n }\\n\",\n \"file_path\": \"src/handler/core.rs\",\n \"rank\": 76,\n \"score\": 9.193878282214413\n },\n {\n \"content\": \"/// container.insert(10i32);\\n\\n/// container.insert(true);\\n\\n/// container.insert(\\\"static str\\\");\\n\\n///\\n\\n/// // thread 'main' panicked at 'alloc::string::String was requested, but not provided. Available types:\\n\\n/// // &str\\n\\n/// // bool\\n\\n/// // i32\\n\\n/// // ', /media/hirrolot/772CF8924BEBB279/Documents/Rust/dptree/src/di.rs:150:17\\n\\n/// // note: run with `RUST_BACKTRACE=1` environment variable to display a backtrace\\n\\n/// let string: Arc<String> = container.get();\\n\\n/// ```\\n\\n#[derive(Default, Clone)]\\n\\npub struct DependencyMap {\\n\\n map: HashMap<TypeId, Dependency>,\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/di.rs\",\n \"rank\": 78,\n \"score\": 9.15879141989109\n },\n {\n \"content\": \"use dptree::prelude::*;\\n\\nuse std::{net::Ipv4Addr, sync::Arc};\\n\\n\\n\",\n \"file_path\": \"examples/storage.rs\",\n \"rank\": 79,\n \"score\": 8.987142421982181\n },\n {\n \"content\": \"\\n\\n // Entry is invisible\\n\\n assert(entry().branch(filter_a()), InterestList(hashset! { UpdateKind::A }));\\n\\n assert(entry(), Entry);\\n\\n\\n\\n assert(user_defined_filter(), UserDefined);\\n\\n assert(user_defined_filter().branch(filter_a()), UserDefined);\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/handler/core.rs\",\n \"rank\": 80,\n \"score\": 8.937056484507611\n },\n {\n \"content\": \"# Changelog\\n\\nAll notable changes to this project will be documented in this file.\\n\\n\\n\\nThe format is based on [Keep a Changelog](https://keepachangelog.com/en/1.0.0/),\\n\\nand this project adheres to [Semantic Versioning](https://semver.org/spec/v2.0.0.html).\\n\\n\\n\\n## unreleased\\n\\n\\n\\n## 0.2.1 - 2022-04-27\\n\\n\\n\\n### Added\\n\\n\\n\\n - The `dptree::case!` macro for enumeration destructuring.\\n\\n\\n\\n## 0.2.0 - 2022-04-18\\n\\n\\n\\n### Added\\n\\n\\n\\n - Introspection facilities:\\n\\n - The `HandlerDescription` trait.\\n\\n - Build-in description types: `crate::description::{Unspecified, EventKind}`.\\n\\n - Functions constructing handlers with descriptions: `filter_async_with_description`, `filter_map_async_with_description`, `filter_map_with_description`, `filter_with_description`, `from_fn_with_description`, `map_async_with_description`, `map_with_description`.\\n\\n\\n\\n## 0.1.2 - 2022-04-04\\n\\n\\n\\n### Added\\n\\n\\n\\n - `DependencyMap::insert_container` ([PR #7](https://github.com/p0lunin/dptree/pull/7)).\\n\\n - `map` and `map_async` ([PR #8](https://github.com/p0lunin/dptree/pull/8)).\\n\\n\\n\\n## 0.1.1 - 2022-03-21\\n\\n\\n\\n### Fixed\\n\\n\\n\\n - Emit a full list of available types on `DependencyMap::get` panic ([PR #6](https://github.com/p0lunin/dptree/pull/6)).\\n\\n\\n\\n## 0.1.0 - 2022-02-05\\n\\n\\n\\n### Added\\n\\n\\n\\n - This badass library.\\n\",\n \"file_path\": \"CHANGELOG.md\",\n \"rank\": 81,\n \"score\": 8.821104245429446\n },\n {\n \"content\": \"use std::panic::Location;\\n\\n\\n\\nuse dptree::{di::DependencyMap, Handler, HandlerDescription};\\n\\n\\n\",\n \"file_path\": \"examples/descr_locations.rs\",\n \"rank\": 83,\n \"score\": 8.576579813998146\n },\n {\n \"content\": \"\\n\\n #[tokio::test]\\n\\n async fn test_from_fn_continue() {\\n\\n let input = 123;\\n\\n type Output = &'static str;\\n\\n\\n\\n let result =\\n\\n help_inference(from_fn(|event: i32, _cont: Cont<i32, &'static str>| async move {\\n\\n assert_eq!(event, input);\\n\\n ControlFlow::<Output, _>::Continue(event)\\n\\n }))\\n\\n .dispatch(input)\\n\\n .await;\\n\\n\\n\\n assert!(result == ControlFlow::Continue(input));\\n\\n }\\n\\n\\n\\n #[tokio::test]\\n\\n async fn test_entry() {\\n\\n let input = 123;\\n\",\n \"file_path\": \"src/handler/core.rs\",\n \"rank\": 84,\n \"score\": 8.570999837848829\n },\n {\n \"content\": \" assert_eq!(dispatcher.dispatch(deps![0]).await, ControlFlow::Break(Output::Zero));\\n\\n assert_eq!(dispatcher.dispatch(deps![-1]).await, ControlFlow::Break(Output::MinusOne));\\n\\n assert_eq!(dispatcher.dispatch(deps![-2]).await, ControlFlow::Break(Output::LT));\\n\\n }\\n\\n\\n\\n #[tokio::test]\\n\\n async fn allowed_updates() {\\n\\n use crate::description::EventKind::*;\\n\\n\\n\\n #[derive(Debug, Clone, PartialEq, Eq, Hash)]\\n\\n enum UpdateKind {\\n\\n A,\\n\\n B,\\n\\n C,\\n\\n }\\n\\n\\n\\n #[derive(Clone)]\\n\\n #[allow(dead_code)]\\n\\n enum Update {\\n\\n A(i32),\\n\",\n \"file_path\": \"src/handler/core.rs\",\n \"rank\": 85,\n \"score\": 8.351584995629743\n },\n {\n \"content\": \" /// let handler: Handler<_, _> = dptree::filter(|x: i32| x > 0);\\n\\n ///\\n\\n /// let output = handler.execute(dptree::deps![10], |_| async { ControlFlow::Break(\\\"done\\\") }).await;\\n\\n /// assert_eq!(output, ControlFlow::Break(\\\"done\\\"));\\n\\n ///\\n\\n /// # }\\n\\n /// ```\\n\\n pub async fn execute<Cont, ContFut>(\\n\\n self,\\n\\n container: Input,\\n\\n cont: Cont,\\n\\n ) -> ControlFlow<Output, Input>\\n\\n where\\n\\n Cont: Fn(Input) -> ContFut,\\n\\n Cont: Send + Sync + 'a,\\n\\n ContFut: Future<Output = ControlFlow<Output, Input>> + Send + 'a,\\n\\n {\\n\\n (self.data.f)(container, Box::new(move |event| Box::pin(cont(event)))).await\\n\\n }\\n\\n\\n\",\n \"file_path\": \"src/handler/core.rs\",\n \"rank\": 86,\n \"score\": 8.18308766791963\n },\n {\n \"content\": \" Input: Send + Sync + 'a,\\n\\n Output: Send + Sync + 'a,\\n\\n Descr: HandlerDescription,\\n\\n{\\n\\n /// Chain two handlers to form a [chain of responsibility].\\n\\n ///\\n\\n /// First, `self` will be executed, and then, if `self` decides to continue\\n\\n /// execution, `next` will be executed.\\n\\n ///\\n\\n /// # Examples\\n\\n ///\\n\\n /// ```\\n\\n /// # #[tokio::main]\\n\\n /// # async fn main() {\\n\\n /// use dptree::prelude::*;\\n\\n ///\\n\\n /// let handler: Handler<_, _> =\\n\\n /// dptree::filter(|x: i32| x > 0).chain(dptree::endpoint(|| async { \\\"done\\\" }));\\n\\n ///\\n\\n /// assert_eq!(handler.dispatch(dptree::deps![10]).await, ControlFlow::Break(\\\"done\\\"));\\n\",\n \"file_path\": \"src/handler/core.rs\",\n \"rank\": 87,\n \"score\": 8.087561205288324\n },\n {\n \"content\": \"pub use handler::*;\\n\\n\\n\\n/// Filters an enumeration, passing its payload forwards.\\n\\n///\\n\\n/// This macro expands to a [`crate::Handler`] that acts on your enumeration\\n\\n/// type: if the enumeration is of a certain variant, the execution continues;\\n\\n/// otherwise, `dptree` will try the next branch. This is very useful for\\n\\n/// dialogue FSM transitions and incoming command filtering; for a real-world\\n\\n/// example, please see teloxide's [`examples/purchase.rs`].\\n\\n///\\n\\n/// Variants can take the following forms:\\n\\n///\\n\\n/// - `Enum::MyVariant` for empty variants;\\n\\n/// - `Enum::MyVariant(param1, ..., paramN)` for function-like variants;\\n\\n/// - `Enum::MyVariant { param1, ..., paramN }` for `struct`-like variants.\\n\\n///\\n\\n/// In the first case, this macro results in a simple [`crate::filter`]; in the\\n\\n/// second and third cases, this macro results in [`crate::filter_map`] that\\n\\n/// passes the payload of `MyVariant` to the next handler if the match occurs.\\n\\n/// (This next handler can be an endpoint or a more complex one.) The payload\\n\",\n \"file_path\": \"src/lib.rs\",\n \"rank\": 88,\n \"score\": 7.649273365886637\n },\n {\n \"content\": \" continue;\\n\\n }\\n\\n },\\n\\n _ => {\\n\\n println!(\\\"Unknown event\\\");\\n\\n continue;\\n\\n }\\n\\n };\\n\\n\\n\\n if new_state == CommandState::Exit {\\n\\n return;\\n\\n }\\n\\n\\n\\n state = new_state;\\n\\n }\\n\\n}\\n\\n\\n\\n#[derive(Debug, Clone, PartialEq)]\\n\\npub enum CommandState {\\n\\n Active,\\n\",\n \"file_path\": \"examples/state_machine.rs\",\n \"rank\": 89,\n \"score\": 7.119803249869147\n },\n {\n \"content\": \"\\n\\n #[track_caller]\\n\\n fn map() -> Self {\\n\\n collector(\\\"map\\\")\\n\\n }\\n\\n\\n\\n #[track_caller]\\n\\n fn map_async() -> Self {\\n\\n collector(\\\"map_async\\\")\\n\\n }\\n\\n\\n\\n #[track_caller]\\n\\n fn filter() -> Self {\\n\\n collector(\\\"filter\\\")\\n\\n }\\n\\n\\n\\n #[track_caller]\\n\\n fn filter_async() -> Self {\\n\\n collector(\\\"filter_async\\\")\\n\\n }\\n\",\n \"file_path\": \"examples/descr_locations.rs\",\n \"rank\": 90,\n \"score\": 7.051233225197138\n },\n {\n \"content\": \"\\n\\n #[track_caller]\\n\\n fn filter_map() -> Self {\\n\\n collector(\\\"filter_map\\\")\\n\\n }\\n\\n\\n\\n #[track_caller]\\n\\n fn filter_map_async() -> Self {\\n\\n collector(\\\"filter_map_async\\\")\\n\\n }\\n\\n\\n\\n #[track_caller]\\n\\n fn endpoint() -> Self {\\n\\n collector(\\\"endpoint\\\")\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"examples/descr_locations.rs\",\n \"rank\": 92,\n \"score\": 6.983076237904248\n },\n {\n \"content\": \" assert!(matches!(h.dispatch(crate::deps![State::Other]).await, ControlFlow::Continue(_)));\\n\\n }\\n\\n\\n\\n #[tokio::test]\\n\\n async fn handler_fn_variant() {\\n\\n let input = State::C(42, \\\"abc\\\");\\n\\n let h: crate::Handler<_, _> =\\n\\n case![State::C(x, y)].endpoint(|(x, str): (i32, &'static str)| async move {\\n\\n assert_eq!(x, 42);\\n\\n assert_eq!(str, \\\"abc\\\");\\n\\n 123\\n\\n });\\n\\n\\n\\n assert_eq!(h.dispatch(crate::deps![input]).await, ControlFlow::Break(123));\\n\\n assert!(matches!(h.dispatch(crate::deps![State::Other]).await, ControlFlow::Continue(_)));\\n\\n }\\n\\n\\n\\n #[tokio::test]\\n\\n async fn handler_single_struct_variant() {\\n\\n let input = State::D { foo: 42 };\\n\",\n \"file_path\": \"src/lib.rs\",\n \"rank\": 93,\n \"score\": 6.896835682971065\n },\n {\n \"content\": \"\\n\\nasync fn repl(dispatcher: Handler<'static, DependencyMap, String>, store: Arc<AtomicI32>) -> ! {\\n\\n loop {\\n\\n print!(\\\">> \\\");\\n\\n std::io::stdout().flush().unwrap();\\n\\n\\n\\n let mut cmd = String::new();\\n\\n std::io::stdin().read_line(&mut cmd).unwrap();\\n\\n\\n\\n let strs = cmd.trim().split(' ').collect::<Vec<_>>();\\n\\n let event = Event::parse(strs.as_slice());\\n\\n\\n\\n let out = match event {\\n\\n Some(event) => match dispatcher.dispatch(dptree::deps![event, store.clone()]).await {\\n\\n ControlFlow::Continue(event) => panic!(\\\"Unhandled event {:?}\\\", event),\\n\\n ControlFlow::Break(result) => result,\\n\\n },\\n\\n _ => \\\"Unknown command\\\".to_string(),\\n\\n };\\n\\n\\n\\n println!(\\\"{}\\\", out);\\n\\n }\\n\\n}\\n\\n\\n\\n#[derive(Copy, Clone, Debug)]\\n\",\n \"file_path\": \"examples/simple_dispatcher.rs\",\n \"rank\": 94,\n \"score\": 6.792299227993009\n },\n {\n \"content\": \"## Features\\n\\n\\n\\n - ✔️ Declarative handlers: `dptree::{endpoint, filter, filter_map, ...}`.\\n\\n - ✔️ A lightweight functional design using a form of [continuation-passing style (CPS)] internally.\\n\\n - ✔️ [Dependency injection (DI)] out-of-the-box.\\n\\n - ✔️ Supports both handler _chaining_ and _branching_ operations.\\n\\n - ✔️ Handler introspection facilities.\\n\\n - ✔️ Battle-tested: dptree is used in [teloxide] as a framework for Telegram update dispatching.\\n\\n - ✔️ Runtime-agnostic: uses only the [futures] crate.\\n\\n\\n\\n[continuation-passing style (CPS)]: https://en.wikipedia.org/wiki/Continuation-passing_style\\n\\n[Dependency injection (DI)]: https://en.wikipedia.org/wiki/Dependency_injection\\n\\n[teloxide]: https://github.com/teloxide/teloxide\\n\\n[futures]: https://github.com/rust-lang/futures-rs\\n\\n\\n\\n## Explanation\\n\\n\\n\\nThe above code is a simple web server dispatching tree. In pseudocode, it would look like this:\\n\\n\\n\\n - `dptree::entry()`: dispatch an update to the following branch handlers:\\n\\n - `.branch(smiles_handler())`: if the update satisfies the condition (`dptree::filter`), return a smile (`.endpoint`). Otherwise, pass the update forwards.\\n\\n - `.branch(sqrt_handler())`: if the update is a number (`dptree::filter_map`), return the square of it. Otherwise, pass the update forwards.\\n\\n - `.branch(not_found_handler())`: return `404 Not Found` immediately.\\n\\n\\n\",\n \"file_path\": \"README.md\",\n \"rank\": 95,\n \"score\": 6.734516095822276\n },\n {\n \"content\": \"//! An implementation of [dependency injection].\\n\\n//!\\n\\n//! If you do not know what is dependency injection (DI), please read [this\\n\\n//! discussion on StackOverflow], then come back. The only difference is that in\\n\\n//! `dptree`, we inject objects into function-handlers, not into objects.\\n\\n//!\\n\\n//! Currently, the only container is [`DependencyMap`]. It implements the DI\\n\\n//! pattern completely, but be careful: it can panic when you do not provide\\n\\n//! necessary types. See more in its documentation.\\n\\n//!\\n\\n//! [dependency injection]: https://en.wikipedia.org/wiki/Dependency_injection\\n\\n//! [this discussion on StackOverflow]: https://stackoverflow.com/questions/130794/what-is-dependency-injection\\n\\nuse futures::future::{ready, BoxFuture};\\n\\n\\n\\nuse std::{\\n\\n any::{Any, TypeId},\\n\\n collections::HashMap,\\n\\n fmt::{Debug, Formatter, Write},\\n\\n future::Future,\\n\\n ops::Deref,\\n\",\n \"file_path\": \"src/di.rs\",\n \"rank\": 97,\n \"score\": 6.71576266591552\n },\n {\n \"content\": \" })\\n\\n };\\n\\n ($($variant:ident)::+ {$param:ident}) => {\\n\\n $crate::filter_map(|x| match x {\\n\\n $($variant)::+{$param} => Some($param),\\n\\n _ => None,\\n\\n })\\n\\n };\\n\\n ($($variant:ident)::+ {$($param:ident),+ $(,)?}) => {\\n\\n $crate::filter_map(|x| match x {\\n\\n $($variant)::+ { $($param),+ } => Some(($($param),+ ,)),\\n\\n _ => None,\\n\\n })\\n\\n };\\n\\n}\\n\\n\\n\\n#[cfg(test)]\\n\\nmod tests {\\n\\n use std::ops::ControlFlow;\\n\\n\\n\",\n \"file_path\": \"src/lib.rs\",\n \"rank\": 98,\n \"score\": 6.625783853079696\n },\n {\n \"content\": \" /// Executes this handler.\\n\\n ///\\n\\n /// Returns [`ControlFlow::Break`] when executed successfully,\\n\\n /// [`ControlFlow::Continue`] otherwise.\\n\\n pub async fn dispatch(&self, container: Input) -> ControlFlow<Output, Input> {\\n\\n self.clone().execute(container, |event| async move { ControlFlow::Continue(event) }).await\\n\\n }\\n\\n\\n\\n /// Returns the set of updates that can be processed by this handler.\\n\\n pub fn description(&self) -> &Descr {\\n\\n &self.data.description\\n\\n }\\n\\n}\\n\\n\\n\\n/// Constructs a handler from a function.\\n\\n///\\n\\n/// Most of the time, you do not want to use this function. Take a look at more\\n\\n/// specialised functions: [`crate::endpoint`], [`crate::filter`],\\n\\n/// [`crate::filter_map`], etc.\\n\",\n \"file_path\": \"src/handler/core.rs\",\n \"rank\": 99,\n \"score\": 6.61480660486019\n }\n]","isConversational":false}}},{"rowIdx":2351,"cells":{"lang":{"kind":"string","value":"Rust"},"file_path":{"kind":"string","value":"src/init/init_game_data.rs"},"repo_name":{"kind":"string","value":"Noah2610/LD48"},"commit":{"kind":"string","value":"433d248beef1b7a4dd99116d48348bef66bdd301"},"file_code":{"kind":"string","value":"use crate::resource;\nuse crate::resources::prelude::*;\nuse crate::settings::Settings;\nuse crate::states::aliases::{CustomData, GameDataBuilder};\nuse amethyst::prelude::Config;\nuse amethyst::window::DisplayConfig;\nuse deathframe::amethyst;\n\npub(super) fn build_game_data<'a, 'b>(\n settings: &Settings,\n) -> amethyst::Result<GameDataBuilder<'a, 'b>> {\n use crate::input::prelude::*;\n use crate::systems::prelude::*;\n use amethyst::core::transform::TransformBundle;\n use amethyst::renderer::types::DefaultBackend;\n use amethyst::renderer::{RenderFlat2D, RenderToWindow, RenderingBundle};\n use amethyst::ui::{RenderUi, UiBundle};\n use amethyst::utils::fps_counter::FpsCounterBundle;\n use amethyst::utils::ortho_camera::CameraOrthoSystem;\n use deathframe::bundles::*;\n\n let transform_bundle = TransformBundle::new();\n let display_config = get_display_config()?;\n let rendering_bundle = RenderingBundle::<DefaultBackend>::new()\n .with_plugin(\n RenderToWindow::from_config(display_config)\n .with_clear([0.0, 0.0, 0.0, 1.0]),\n )\n .with_plugin(RenderUi::default())\n .with_plugin(RenderFlat2D::default());\n let audio_bundle = AudioBundle::<SoundKey, SongKey>::default()\n .with_sounds_default_volume(settings.audio.volume);\n let menu_input_bundle = MenuBindings::bundle()?;\n let ingame_input_bundle = IngameBindings::bundle()?;\n let physics_bundle =\n PhysicsBundle::<CollisionTag, SolidTag>::new().with_deps(&[]);\n let animation_bundle = AnimationBundle::<AnimationKey>::new();\n\n let custom_game_data = GameDataBuilder::default()\n .custom(CustomData::default())\n .dispatcher(DispatcherId::MainMenu)?\n .dispatcher(DispatcherId::Ingame)?\n .dispatcher(DispatcherId::Paused)?\n .dispatcher(DispatcherId::ZoneTransition)?\n .dispatcher(DispatcherId::GameOver)?\n .dispatcher(DispatcherId::ZoneSelect)?\n .with_core_bundle(FpsCounterBundle)?\n .with_core_bundle(transform_bundle)?\n .with_core_bundle(rendering_bundle)?\n .with_core_bundle(audio_bundle)?\n .with_core_bundle(menu_input_bundle)?\n .with_core_bundle(UiBundle::<MenuBindings>::new())?\n .with_core_bundle(animation_bundle)?\n .with_core(PrintFpsSystem::default(), \"print_fps_system\", &[])?\n .with_core(CameraOrthoSystem::default(), \"camera_ortho_system\", &[])?\n .with_core(ScaleSpritesSystem::default(), \"scale_sprites_system\", &[])?\n .with_core(\n InputManagerSystem::<MenuBindings>::default(),\n \"menu_input_manager_system\",\n &[],\n )?\n .with_bundle(DispatcherId::Ingame, ingame_input_bundle)?\n .with_bundle(DispatcherId::Ingame, physics_bundle)?\n .with(\n DispatcherId::Ingame,\n InputManagerSystem::<IngameBindings>::default(),\n \"ingame_input_manager_system\",\n &[],\n )?\n .with(\n DispatcherId::Paused,\n InputManagerSystem::<MenuBindings>::default(),\n \"paused_input_manager_system\",\n &[],\n )?\n .with(\n DispatcherId::Ingame,\n FollowSystem::default(),\n \"follow_system\",\n &[],\n )?\n .with(\n DispatcherId::Ingame,\n ConfineEntitiesSystem::default(),\n \"confine_entities_system\",\n &[\"move_entities_system\"],\n )?\n .with(\n DispatcherId::Ingame,\n EntityLoaderSystem::default(),\n \"entity_loader_system\",\n &[\n \"move_entities_system\",\n \"follow_system\",\n \"confine_entities_system\",\n ],\n )?\n .with(\n DispatcherId::Ingame,\n UpdateHealthSystem::default(),\n \"update_health_system\",\n &[],\n )?\n .with(\n DispatcherId::Ingame,\n UpdateLifecycleSystem::default(),\n \"update_lifecycle_system\",\n &[],\n )?\n .with(\n DispatcherId::Ingame,\n ControlPlayer::default(),\n \"control_player_system\",\n &[],\n )?\n .with(\n DispatcherId::Ingame,\n UpdateOnLane::default(),\n \"update_on_lane_system\",\n &[\"control_player_system\", \"move_entities_system\"],\n )?\n .with(\n DispatcherId::Ingame,\n HandleSegmentLoading::default(),\n \"handle_segment_loading_system\",\n &[],\n )?\n .with(\n DispatcherId::Ingame,\n ConfineCameraToFirstAndFinalSegment::default(),\n \"confine_camera_to_first_and_final_segment\",\n &[],\n )?\n .with(\n DispatcherId::Ingame,\n HandleZoneSwitch::default(),\n \"handle_zone_switch_system\",\n &[\"update_collisions_system\"],\n )?\n .with(\n DispatcherId::Ingame,\n HandleParentDelete::default(),\n \"handle_parent_delete_system\",\n &[],\n )?\n .with(\n DispatcherId::Ingame,\n HandleObstacle::default(),\n \"handle_obstacle_system\",\n &[],\n )?\n .with(\n DispatcherId::Ingame,\n HandleCoinCollection::default(),\n \"handle_coin_collection_system\",\n &[],\n )?\n .with(\n DispatcherId::Ingame,\n UpdateScoreUi::default(),\n \"update_score_ui_system\",\n &[],\n )?\n .with(\n DispatcherId::Ingame,\n UpdateHighscoreUi::default(),\n \"update_highscore_ui_system\",\n &[],\n )?\n .with(\n DispatcherId::Ingame,\n HandleTurret::default(),\n \"handle_turret_system\",\n &[],\n )?\n .with(\n DispatcherId::Ingame,\n HandleDeleteDelay::default(),\n \"handle_delete_delay_system\",\n &[],\n )?\n .with(\n DispatcherId::Ingame,\n UpdateRotate::default(),\n \"update_rotate_system\",\n &[],\n )?\n .with(\n DispatcherId::MainMenu,\n UpdateHighscoreUi::default(),\n \"main_menu_update_highscore_ui_system\",\n &[],\n )?\n .with(\n DispatcherId::GameOver,\n UpdateScoreUi::default(),\n \"game_over_update_score_ui_system\",\n &[],\n )?\n .with(\n DispatcherId::GameOver,\n UpdateHighscoreUi::default(),\n \"game_over_update_highscore_ui_system\",\n &[],\n )?\n .with(\n DispatcherId::ZoneSelect,\n UpdateHighscoreUi::default(),\n \"zone_select_update_highscore_ui_system\",\n &[],\n )?\n .with(\n DispatcherId::GameOver,\n UpdateRotate::default(),\n \"game_over_update_rotate_system\",\n &[],\n )?\n .with(\n DispatcherId::ZoneSelect,\n HandleZoneSelect::default(),\n \"handle_zone_select_system\",\n &[],\n )?\n .with(\n DispatcherId::ZoneSelect,\n UpdateSelectedZoneUi::default(),\n \"update_selected_zone_ui_system\",\n &[],\n )?;\n\n Ok(custom_game_data)\n}\n\nfn get_display_config() -> amethyst::Result<DisplayConfig> {\n #[cfg(not(feature = \"dev\"))]\n let display_config = DisplayConfig::load(resource(\"config/display.ron\"))?;\n #[cfg(feature = \"dev\")]\n let display_config = {\n let mut config = DisplayConfig::load(resource(\"config/display.ron\"))?;\n config.min_dimensions = config.dimensions.clone();\n config.max_dimensions = config.dimensions.clone();\n config\n };\n Ok(display_config)\n}\n"},"prefix":{"kind":"string","value":"use crate::resource;\nuse crate::resources::prelude::*;\nuse crate::settings::Settings;\nuse crate::states::aliases::{CustomData, GameDataBuilder};\nuse amethyst::prelude::Config;\nuse amethyst::window::DisplayConfig;\nuse deathframe::amethyst;\n\npub(super) fn build_game_data<'a, 'b>(\n settings: &Settings,\n) -> amethyst::Result<GameDataBuilder<'a, 'b>> {\n use crate::input::prelude::*;\n use crate::systems::prelude::*;\n use amethyst::core::transform::TransformBundle;\n use amethyst::renderer::types::DefaultBackend;\n use amethyst::renderer::{RenderFlat2D, RenderToWindow, RenderingBundle};\n use amethyst::ui::{RenderUi, UiBundle};\n use amethyst::utils::fps_counter::FpsCounterBundle;\n use amethyst::utils::ortho_camera::CameraOrthoSystem;\n use deathframe::bundles::*;\n\n let transform_bundle = TransformBundle::new();\n let display_config = get_display_config()?;\n let rendering_bundle = RenderingBundle::<DefaultBackend>::new()\n .with_plugin(\n RenderToWindow::from_config(display_config)\n .with_clear([0.0, 0.0, 0.0, 1.0]),\n )\n .with_plugin(RenderUi::default())\n .with_plugin(RenderFlat2D::default());\n let audio_bundle = AudioBundle::<SoundKey, SongKey>::default()\n .with_sounds_default_volume(settings.audio.volume);\n let menu_input_bundle = MenuBindings::bundle()?;\n let ingame_input_bundle = IngameBindings::bundle()?;\n let physics_bundle =\n PhysicsBundle::<CollisionTag, SolidTag>::new().with_deps(&[]);\n let animation_bundle = AnimationBundle::<AnimationKey>::new();\n\n let custom_game_data = GameDataBuilder::default()\n .custom(CustomData::default())\n .dispatcher(DispatcherId::MainMenu)?\n .dispatcher(DispatcherId::Ingame)?\n .dispatcher(DispatcherId::Paused)?\n .dispatcher(DispatcherId::ZoneTransition)?\n .dispatcher(DispatcherId::GameOver)?\n .dispatcher(DispatcherId::ZoneSelect)?\n .with_core_bundle(FpsCounterBundle)?\n .with_core_bundle(transform_bundle)?\n .with_core_bundle(rendering_bundle)?\n .with_core_bundle(audio_bundle)?\n .with_core_bundle(menu_input_bundle)?\n .with_core_bundle(UiBundle::<MenuBindings>::new())?\n .with_core_bundle(animation_bundle)?\n .with_core(PrintFpsSystem::default(), \"print_fps_system\", &[])?\n .with_core(CameraOrthoSystem::default(), \"camera_ortho_system\", &[])?\n .with_core(ScaleSpritesSystem::default(), \"scale_sprites_system\", &[])?\n .with_core(\n InputManagerSystem::<MenuBindings>::default(),\n \"menu_input_manager_system\",\n &[],\n )?\n .with_bundle(DispatcherId::Ingame, ingame_input_bundle)?\n .with_bundle(DispatcherId::Ingame, physics_bundle)?\n .with(\n DispatcherId::Ingame,\n InputManagerSystem::<IngameBindings>::default(),\n \"ingame_input_manager_system\",\n &[],\n )?\n .with(\n DispatcherId::Paused,\n InputManagerSystem::<MenuBindings>::default(),\n \"paused_input_manager_system\",\n &[],\n )?\n .with(\n DispatcherId::Ingame,\n FollowSystem::default(),\n \"follow_system\",\n &[],\n )?\n .with(\n DispatcherId::Ingame,\n ConfineEntitiesSystem::default(),\n \"confine_entities_system\",\n &[\"move_entities_system\"],\n )?\n .with(\n DispatcherId::Ingame,\n EntityLoaderSystem::default(),\n \"entity_loader_system\",\n &[\n \"move_entities_system\",\n \"follow_system\",\n \"confine_entities_system\",\n ],\n )?\n .with(\n DispatcherId::Ingame,\n UpdateHealthSystem::default(),\n \"update_health_system\",\n &[],\n )?\n .with(\n DispatcherId::Ingame,\n UpdateLifecycleSystem::default(),\n \"update_lifecycle_system\",\n &[],\n )?\n .with(\n DispatcherId::Ingame,\n ControlPlayer::default(),\n \"control_player_system\",\n &[],\n )?\n .with(\n DispatcherId::Ingame,\n UpdateOnLane::default(),\n \"update_on_lane_system\",\n &[\"control_player_system\", \"move_entities_system\"],\n )?\n .with(\n DispatcherId::Ingame,\n HandleSegmentLoading::default(),\n \"handle_segment_loading_system\",\n &[],\n )?\n .with(\n DispatcherId::Ingame,\n ConfineCameraToFirstAndFinalSegment::default(),\n \"confine_camera_to_first_and_final_segment\",\n &[],\n )?\n .with(\n DispatcherId::Ingame,\n HandleZoneSwitch::default(),\n \"handle_zone_switch_system\",\n &[\"update_collisions_system\"],\n )?\n .with(\n DispatcherId::Ingame,\n HandleParentDelete::default(),\n \"handle_parent_delete_system\",\n &[],\n )?\n .with(\n DispatcherId::Ingame,\n HandleObstacle::default(),\n \"handle_obstacle_system\",\n &[],\n )?\n .with(\n DispatcherId::Ingame,\n HandleCoinCollection::default(),\n \"handle_coin_collection_system\",\n &[],\n )?\n .with(\n DispatcherId::Ingame,\n UpdateScoreUi::default(),\n \"update_score_ui_system\",\n &[],\n )?\n .with(\n DispatcherId::Ingame,\n UpdateHighscoreUi::default(),\n \"update_highscore_ui_system\",\n &[],\n )?\n .with(\n DispatcherId::Ingame,\n HandleTurret::default(),\n \"handle_turret_system\",\n &[],\n )?\n .with(\n DispatcherId::Ingame,\n HandleDeleteDelay::default(),\n \"handle_delete_delay_system\",\n &[],\n )?\n .with(\n DispatcherId::Ingame,\n UpdateRotate::default(),\n \"update_rotate_system\",\n &[],\n )?\n .with(\n DispatcherId::MainMenu,\n UpdateHighscoreUi::default(),\n \"main_menu_update_highscore_ui_system\",\n &[],\n )?\n .with(\n DispatcherId::GameOver,\n UpdateScoreUi::default(),\n \"game_over_update_score_ui_system\",\n &[],\n )?\n .with(\n DispatcherId::GameOver,\n UpdateHighscoreUi::default(),\n \"game_over_update_highscore_ui_system\",\n &[],\n )?\n ."},"suffix":{"kind":"string","value":"\n\nfn get_display_config() -> amethyst::Result<DisplayConfig> {\n #[cfg(not(feature = \"dev\"))]\n let display_config = DisplayConfig::load(resource(\"config/display.ron\"))?;\n #[cfg(feature = \"dev\")]\n let display_config = {\n let mut config = DisplayConfig::load(resource(\"config/display.ron\"))?;\n config.min_dimensions = config.dimensions.clone();\n config.max_dimensions = config.dimensions.clone();\n config\n };\n Ok(display_config)\n}\n"},"middle":{"kind":"string","value":"with(\n DispatcherId::ZoneSelect,\n UpdateHighscoreUi::default(),\n \"zone_select_update_highscore_ui_system\",\n &[],\n )?\n .with(\n DispatcherId::GameOver,\n UpdateRotate::default(),\n \"game_over_update_rotate_system\",\n &[],\n )?\n .with(\n DispatcherId::ZoneSelect,\n HandleZoneSelect::default(),\n \"handle_zone_select_system\",\n &[],\n )?\n .with(\n DispatcherId::ZoneSelect,\n UpdateSelectedZoneUi::default(),\n \"update_selected_zone_ui_system\",\n &[],\n )?;\n\n Ok(custom_game_data)\n}"},"strategy":{"kind":"string","value":"function_block-function_prefix_line"},"context_items":{"kind":"list like","value":[{"content":"/// Merge `Vec` of settings `T` together.\n\n/// Returns `None` if given `Vec` is empty.\n\nfn merge_settings<T>(all_settings: Vec<T>) -> Option<T>\n\nwhere\n\n T: Merge,\n\n{\n\n let mut merged_settings: Option<T> = None;\n\n for settings in all_settings {\n\n if let Some(merged) = merged_settings.as_mut() {\n\n merged.merge(settings);\n\n } else {\n\n merged_settings = Some(settings);\n\n }\n\n }\n\n merged_settings\n\n}\n","file_path":"src/settings/mod.rs","rank":0,"score":79516.49247778016},{"content":"pub fn add_components_to_entity(\n\n entity_builder: EntityBuilder,\n\n components: Vec<EntityComponent>,\n\n mut size_opt: Option<Size>,\n\n) -> EntityBuilder {\n\n use self::EntityComponent as Comp;\n\n\n\n components\n\n .into_iter()\n\n .fold(entity_builder, |builder, component| match component {\n\n Comp::Velocity(velocity) => builder.with(velocity),\n\n Comp::Size(size) => {\n\n size_opt = Some(size.clone());\n\n builder.with(size)\n\n }\n\n Comp::Gravity(gravity) => builder.with(gravity),\n\n Comp::Animation(mut animation) => {\n\n animation.play_cycle();\n\n builder.with(animation)\n\n }\n","file_path":"src/settings/entity_components.rs","rank":1,"score":75051.07953049059},{"content":"fn load_settings<S, P>(path: P) -> amethyst::Result<S>\n\nwhere\n\n for<'de> S: serde::Deserialize<'de>,\n\n P: fmt::Display,\n\n{\n\n let file = File::open(resource(path.to_string()))?;\n\n Ok(ron::de::from_reader(file).map_err(|e| {\n\n amethyst::Error::from_string(format!(\n\n \"Failed parsing RON settings file: {}\\n{:#?}\",\n\n path, e\n\n ))\n\n })?)\n\n}\n\n\n\n// Functions below copied from deathfloor project.\n\n\n","file_path":"src/settings/mod.rs","rank":2,"score":73401.48343388524},{"content":"fn load_settings_dir<T, S>(dirname: S) -> amethyst::Result<T>\n\nwhere\n\n for<'de> T: serde::Deserialize<'de> + Merge + Default,\n\n S: std::fmt::Display,\n\n{\n\n let path = resource(dirname.to_string());\n\n let errmsg = format!(\"No settings files found in {:?}\", &path);\n\n let all_settings = load_configs_recursively_from(path)?;\n\n let merged_settings = merge_settings(all_settings).unwrap_or_else(|| {\n\n eprintln!(\n\n \"[WARNING]\\n {}\\n Using default (probably empty settings)\",\n\n errmsg\n\n );\n\n T::default()\n\n });\n\n Ok(merged_settings)\n\n}\n\n\n","file_path":"src/settings/mod.rs","rank":3,"score":72189.41444008576},{"content":"fn load_configs_recursively_from<T>(path: PathBuf) -> amethyst::Result<Vec<T>>\n\nwhere\n\n for<'de> T: serde::Deserialize<'de> + Merge,\n\n{\n\n let mut settings = Vec::new();\n\n\n\n for entry in path.read_dir()? {\n\n let entry_path = entry?.path();\n\n if entry_path.is_file() {\n\n if let Some(\"ron\") = entry_path.extension().and_then(|e| e.to_str())\n\n {\n\n let file = File::open(&entry_path)?;\n\n settings.push(ron::de::from_reader(file).map_err(|e| {\n\n amethyst::Error::from_string(format!(\n\n \"Failed parsing RON settings file: {:?}\\n{:#?}\",\n\n entry_path, e\n\n ))\n\n })?);\n\n }\n\n } else if entry_path.is_dir() {\n\n settings.append(&mut load_configs_recursively_from(entry_path)?);\n\n }\n\n }\n\n\n\n Ok(settings)\n\n}\n\n\n","file_path":"src/settings/mod.rs","rank":4,"score":61939.66377277224},{"content":"fn main() {\n\n if let Err(e) = init::run() {\n\n eprintln!(\"An error occured: {}\", e);\n\n std::process::exit(1);\n\n }\n\n}\n","file_path":"src/main.rs","rank":6,"score":50236.19162970742},{"content":"fn start_logger() {\n\n use amethyst::{LogLevelFilter, LoggerConfig};\n\n amethyst::start_logger(LoggerConfig {\n\n level_filter: LogLevelFilter::Error,\n\n ..Default::default()\n\n });\n\n}\n\n\n","file_path":"src/init/mod.rs","rank":7,"score":48223.250913462456},{"content":"pub fn build_tiles(\n\n world: &mut World,\n\n tiles: Vec<DataTile>,\n\n tile_size: Size,\n\n segment: Option<(SegmentId, Entity)>,\n\n offset_y: f32,\n\n) -> amethyst::Result<()> {\n\n for tile in tiles {\n\n let transform = {\n\n let mut transform = Transform::default();\n\n transform.set_translation_x(tile.pos.x);\n\n transform.set_translation_y(-offset_y + tile.pos.y);\n\n if let Some(z) = tile.props.get(\"z\").and_then(|val| val.as_f64()) {\n\n transform.set_translation_z(z as f32);\n\n }\n\n transform\n\n };\n\n\n\n let sprite_render = {\n\n let sprite_sheet = world\n","file_path":"src/level_loader/tiles.rs","rank":8,"score":45071.173332134225},{"content":"pub fn build_level(\n\n world: &mut World,\n\n level_data: DataLevel,\n\n) -> amethyst::Result<()> {\n\n let tile_size =\n\n Size::new(level_data.level.tile_size.w, level_data.level.tile_size.h);\n\n\n\n tiles::build_tiles(world, level_data.tiles, tile_size, None, 0.0)?;\n\n objects::build_objects(world, level_data.objects, None, 0.0)?;\n\n\n\n world.maintain();\n\n\n\n Ok(())\n\n}\n","file_path":"src/level_loader/mod.rs","rank":9,"score":45071.173332134225},{"content":"pub fn build_objects(\n\n world: &mut World,\n\n objects: Vec<DataObject>,\n\n segment: Option<(SegmentId, Entity)>,\n\n offset_y: f32,\n\n) -> amethyst::Result<()> {\n\n for object in objects {\n\n let transform = {\n\n let mut transform = Transform::default();\n\n transform.set_translation_x(object.pos.x);\n\n transform.set_translation_y(-offset_y + object.pos.y);\n\n if let Some(z) = object.props.get(\"z\").and_then(|val| val.as_f64())\n\n {\n\n transform.set_translation_z(z as f32);\n\n }\n\n transform\n\n };\n\n let size = Size::new(object.size.w, object.size.h);\n\n\n\n match &object.object_type {\n","file_path":"src/level_loader/objects.rs","rank":10,"score":45071.173332134225},{"content":"pub fn build_camera(\n\n world: &mut World,\n\n player: Option<Entity>,\n\n level_size: Size,\n\n camera_size: Option<Size>,\n\n) -> amethyst::Result<()> {\n\n use amethyst::renderer::Camera as AmethystCamera;\n\n use amethyst::utils::ortho_camera::{\n\n CameraNormalizeMode,\n\n CameraOrtho,\n\n CameraOrthoWorldCoordinates,\n\n };\n\n\n\n const LOADING_DISTANCE_PADDING: (f32, f32) = (0.0, 16.0);\n\n\n\n let settings = (*world.read_resource::<CameraSettings>()).clone();\n\n\n\n let size = camera_size.unwrap_or(settings.size);\n\n\n\n let camera = AmethystCamera::standard_2d(size.w, size.h);\n","file_path":"src/level_loader/objects.rs","rank":11,"score":45071.173332134225},{"content":"pub fn build_segment(\n\n world: &mut World,\n\n level_data: DataLevel,\n\n segment_id: SegmentId,\n\n) -> amethyst::Result<()> {\n\n let is_first_is_final_segment = {\n\n let zones_manager = world.read_resource::<ZonesManager>();\n\n let zones_settings = world.read_resource::<ZonesSettings>();\n\n if let Some(current_zone) = zones_manager.current_zone() {\n\n zones_settings\n\n .zones\n\n .get(current_zone)\n\n .map(|zone_settings| {\n\n (\n\n zone_settings.first_segment.contains(&segment_id),\n\n zone_settings.final_segment.contains(&segment_id),\n\n )\n\n })\n\n .unwrap_or((false, false))\n\n } else {\n","file_path":"src/level_loader/mod.rs","rank":12,"score":45071.173332134225},{"content":"pub fn build_player(\n\n world: &mut World,\n\n mut transform: Transform,\n\n size: Size,\n\n player_speed: f32,\n\n) -> Entity {\n\n let sprite_render = {\n\n let sprite_sheet = world\n\n .write_resource::<SpriteSheetHandles<PathBuf>>()\n\n .get_or_load(resource(\"spritesheets/player.png\"), world);\n\n SpriteRender {\n\n sprite_sheet,\n\n sprite_number: 0,\n\n }\n\n };\n\n\n\n let settings = (*world.read_resource::<PlayerSettings>()).clone();\n\n\n\n transform.set_translation_z(settings.z);\n\n\n","file_path":"src/level_loader/objects.rs","rank":13,"score":45071.173332134225},{"content":"pub fn build_segment_collision(\n\n world: &mut World,\n\n size: Size,\n\n segment_id: SegmentId,\n\n (is_first_segment, is_final_segment): (bool, bool),\n\n offset_y: f32,\n\n) -> Entity {\n\n let mut transform = Transform::default();\n\n transform.set_translation_xyz(size.w * 0.5, -offset_y + size.h * 0.5, 0.0);\n\n world\n\n .create_entity()\n\n .with(Segment {\n\n id: segment_id,\n\n is_first_segment,\n\n is_final_segment,\n\n })\n\n .with(transform)\n\n .with(size)\n\n .build()\n\n}\n","file_path":"src/level_loader/objects.rs","rank":14,"score":44243.0495882738},{"content":"pub fn build_object<'a>(\n\n world: &'a mut World,\n\n object_type: ObjectType,\n\n transform: Transform,\n\n size_opt: Option<Size>,\n\n) -> Option<EntityBuilder<'a>> {\n\n match &object_type {\n\n ObjectType::Player => {\n\n eprintln!(\n\n \"[WARNING]\\n A `Player` object is placed in the \\\n\n level!\\n The player is loaded automatically by the \\\n\n game, don't place them in the levels.\\n The placed \\\n\n player object will not be loaded.\"\n\n );\n\n // let player_entity = build_player(world, transform, size);\n\n // let _ = build_camera(world, player_entity);\n\n None\n\n }\n\n\n\n object_type => {\n","file_path":"src/level_loader/objects.rs","rank":15,"score":43944.64625182798},{"content":"type ObjectsSettingsMap = HashMap<ObjectType, ObjectSettings>;\n\n\n\n#[derive(Deserialize, Clone, Default)]\n\n#[serde(deny_unknown_fields, from = \"ObjectsSettingsMap\")]\n\npub struct ObjectsSettings {\n\n pub objects: ObjectsSettingsMap,\n\n}\n\n\n\n#[derive(Deserialize, Clone)]\n\n#[serde(deny_unknown_fields)]\n\npub struct ObjectSettings {\n\n pub components: EntityComponents,\n\n #[serde(default)]\n\n pub spritesheet: Option<String>,\n\n}\n\n\n\nimpl From<ObjectsSettingsMap> for ObjectsSettings {\n\n fn from(objects: ObjectsSettingsMap) -> Self {\n\n Self { objects }\n\n }\n\n}\n\n\n\nimpl Merge for ObjectsSettings {\n\n fn merge(&mut self, other: Self) {\n\n self.objects.extend(&mut other.objects.into_iter())\n\n }\n\n}\n","file_path":"src/settings/objects_settings.rs","rank":16,"score":43458.602569909905},{"content":"fn setup(world: &mut World) {\n\n use crate::components::prelude::{\n\n BelongsToSegment,\n\n Coin,\n\n Cutscene,\n\n Object,\n\n Obstacle,\n\n Portal,\n\n Segment,\n\n Tile,\n\n Turret,\n\n };\n\n\n\n world.register::<Tile>();\n\n world.register::<Object>();\n\n world.register::<BelongsToSegment>();\n\n world.register::<Segment>();\n\n world.register::<Portal>();\n\n world.register::<Obstacle>();\n\n world.register::<Coin>();\n","file_path":"src/states/startup.rs","rank":17,"score":42993.3249080268},{"content":"pub fn run() -> amethyst::Result<()> {\n\n start_logger();\n\n\n\n let settings = Settings::load()?;\n\n let game_data = init_game_data::build_game_data(&settings)?;\n\n\n\n let Settings {\n\n camera: camera_settings,\n\n player: player_settings,\n\n objects: objects_settings,\n\n lanes: lanes_settings,\n\n zones: zones_settings,\n\n audio: audio_settings,\n\n savefile: savefile_settings,\n\n } = settings;\n\n\n\n let mut game: amethyst::CoreApplication<GameData> =\n\n ApplicationBuilder::new(application_root_dir()?, Startup::default())?\n\n .with_frame_limit_config(frame_rate_limit_config()?)\n\n .with_resource(camera_settings)\n","file_path":"src/init/mod.rs","rank":18,"score":42993.3249080268},{"content":"fn load_savefile(world: &World) -> Savefile {\n\n let savefile =\n\n match world.read_resource::<SavefileSettings>().savefile_path() {\n\n Ok(savefile_path) => match Savefile::load(savefile_path) {\n\n Ok(savefile) => Some(savefile),\n\n Err(e) => {\n\n eprintln!(\"[WARNING]\\n {}\", e);\n\n None\n\n }\n\n },\n\n Err(e) => {\n\n eprintln!(\"[WARNING]\\n {}\", e);\n\n None\n\n }\n\n };\n\n savefile.unwrap_or_default()\n\n}\n","file_path":"src/states/startup.rs","rank":19,"score":42165.201164166385},{"content":"// resources/settings/zones\n\n\n\nuse crate::resources::prelude::SongKey;\n\nuse deathframe::core::components::prelude::Merge;\n\nuse replace_with::replace_with_or_abort;\n\nuse std::collections::HashMap;\n\n\n\npub type ZoneId = String;\n\npub type SegmentId = String;\n\n\n\n#[derive(Deserialize, Default, Debug)]\n\n#[serde(deny_unknown_fields)]\n\npub struct ZonesSettings {\n\n #[serde(default)]\n\n pub config: ZonesConfig,\n\n #[serde(default)]\n\n pub zones: HashMap<ZoneId, ZoneSettings>,\n\n}\n\n\n\n#[derive(Deserialize, Default, Debug)]\n","file_path":"src/settings/zones_settings.rs","rank":20,"score":42098.00842541583},{"content":"// resources/settings/objects.ron\n\n\n\nuse super::entity_components::EntityComponents;\n\nuse crate::level_loader::ObjectType;\n\nuse deathframe::components::prelude::Merge;\n\nuse std::collections::HashMap;\n\n\n","file_path":"src/settings/objects_settings.rs","rank":21,"score":42097.90811652406},{"content":"// resources/settings/savefile.ron\n\n\n\nuse deathframe::amethyst;\n\nuse std::fs::create_dir_all;\n\nuse std::path::PathBuf;\n\n\n\n#[derive(Deserialize, Clone)]\n\n#[serde(deny_unknown_fields)]\n\npub struct SavefileSettings {\n\n pub savefile_name: String,\n\n}\n\n\n\nimpl SavefileSettings {\n\n pub fn savefile_path(&self) -> amethyst::Result<PathBuf> {\n\n const APP_NAME: &str = env!(\"CARGO_PKG_NAME\");\n\n\n\n if let Some(mut path) = dirs::data_local_dir() {\n\n path.push(APP_NAME);\n\n if !path.exists() {\n\n if let Err(e) = create_dir_all(&path) {\n","file_path":"src/settings/savefile_settings.rs","rank":22,"score":42097.706859172},{"content":"use crate::resources::prelude::{SongKey, SoundKey};\n\nuse std::collections::HashMap;\n\n\n\n#[derive(Deserialize, Clone)]\n\n#[serde(deny_unknown_fields)]\n\npub struct AudioSettings {\n\n pub volume: f32,\n\n pub bgm: HashMap<SongKey, AudioBgmSettings>,\n\n pub sfx: HashMap<SoundKey, AudioSfxSettings>,\n\n}\n\n\n\n#[derive(Deserialize, Clone)]\n\n#[serde(deny_unknown_fields)]\n\npub struct AudioBgmSettings {\n\n pub file: String,\n\n}\n\n\n\n#[derive(Deserialize, Clone)]\n\n#[serde(deny_unknown_fields)]\n\npub struct AudioSfxSettings {\n\n pub file: String,\n\n}\n","file_path":"src/settings/audio_settings.rs","rank":23,"score":42097.55007595937},{"content":"// resources/settings/player.ron\n\n\n\nuse super::entity_components::EntityComponents;\n\n\n\n#[derive(Deserialize, Clone)]\n\n#[serde(deny_unknown_fields)]\n\npub struct PlayerSettings {\n\n pub z: f32,\n\n pub components: EntityComponents,\n\n}\n","file_path":"src/settings/player_settings.rs","rank":24,"score":42097.34038637072},{"content":"// resources/settings/camera.ron\n\n\n\nuse crate::components::prelude::Size;\n\n\n\n#[derive(Deserialize, Clone)]\n\n#[serde(deny_unknown_fields)]\n\npub struct CameraSettings {\n\n pub z: f32,\n\n pub size: Size,\n\n pub follow_offset: (f32, f32),\n\n}\n","file_path":"src/settings/camera_settings.rs","rank":25,"score":42097.203257852736},{"content":" fn merge(&mut self, other: Self) {\n\n let ZonesSettings {\n\n config: other_config,\n\n zones: mut other_zones,\n\n } = other;\n\n replace_with_or_abort(self, |self_| {\n\n let mut zones = self_\n\n .zones\n\n .into_iter()\n\n .map(|(zone_id, zone_settings)| {\n\n let merged_zone_settings = if let Some(other_zone) =\n\n other_zones.remove(&zone_id)\n\n {\n\n zone_settings.merged(other_zone)\n\n } else {\n\n zone_settings\n\n };\n\n (zone_id, merged_zone_settings)\n\n })\n\n .collect::<HashMap<_, _>>();\n","file_path":"src/settings/zones_settings.rs","rank":26,"score":42094.99361274259},{"content":"// resources/settings/lanes.ron\n\n\n\n#[derive(Deserialize, Clone)]\n\npub struct LanesSettings {\n\n pub count: usize,\n\n pub spacing: f32,\n\n}\n","file_path":"src/settings/lanes_settings.rs","rank":27,"score":42094.60524213148},{"content":" arrays configured in multiple zone configs.\\n This \\\n\n will merge multiple `config.zone_order` arrays \\\n\n together.\\n This is probably not intended.\"\n\n );\n\n self.zone_order.append(&mut other_zone_order);\n\n }\n\n }\n\n }\n\n}\n\n\n\nimpl Merge for ZoneSettings {\n\n fn merge(&mut self, other: Self) {\n\n let ZoneSettings {\n\n song: _,\n\n player_speed: _,\n\n is_skippable: _,\n\n total_segments: _,\n\n first_segment: _,\n\n final_segment: _,\n\n segments: _,\n","file_path":"src/settings/zones_settings.rs","rank":28,"score":42094.097196544804},{"content":"#[serde(deny_unknown_fields)]\n\npub struct ZonesConfig {\n\n pub zone_order: Vec<ZoneId>,\n\n}\n\n\n\n#[derive(Deserialize, Debug)]\n\n#[serde(deny_unknown_fields)]\n\npub struct ZoneSettings {\n\n #[serde(default)]\n\n pub song: Option<SongKey>,\n\n pub player_speed: f32,\n\n #[serde(default)]\n\n pub is_skippable: bool,\n\n pub total_segments: Option<usize>,\n\n pub first_segment: Vec<SegmentId>,\n\n pub final_segment: Vec<SegmentId>,\n\n pub segments: HashMap<SegmentId, Vec<SegmentId>>,\n\n}\n\n\n\nimpl Merge for ZonesSettings {\n","file_path":"src/settings/zones_settings.rs","rank":29,"score":42093.66240690515},{"content":" zones.extend(other_zones.into_iter());\n\n ZonesSettings {\n\n config: self_.config.merged(other_config),\n\n zones,\n\n }\n\n });\n\n }\n\n}\n\n\n\nimpl Merge for ZonesConfig {\n\n fn merge(&mut self, other: Self) {\n\n let ZonesConfig {\n\n zone_order: mut other_zone_order,\n\n } = other;\n\n if self.zone_order.is_empty() {\n\n self.zone_order = other_zone_order;\n\n } else {\n\n if !other_zone_order.is_empty() {\n\n eprintln!(\n\n \"[WARNING]\\n Careful, you have `config.zone_order` \\\n","file_path":"src/settings/zones_settings.rs","rank":30,"score":42093.268113592494},{"content":" return Err(amethyst::Error::from_string(format!(\n\n \"Couldn't create data directory for \\\n\n savefile:\\n{:?}\\n{:?}\",\n\n &path, e\n\n )));\n\n }\n\n }\n\n path.push(&self.savefile_name);\n\n Ok(path)\n\n } else {\n\n Err(amethyst::Error::from_string(\n\n \"Couldn't find data directory for savefile\",\n\n ))\n\n }\n\n }\n\n}\n","file_path":"src/settings/savefile_settings.rs","rank":31,"score":42090.608237189204},{"content":" } = other;\n\n eprintln!(\n\n \"[WARNING]\\n Careful, you have the same `zones.<ZONE-ID>` \\\n\n configured in multiple zone configs.\\n This will NOT merge \\\n\n them together.\\n You should probably find and fix the \\\n\n duplicate configurations.\"\n\n );\n\n }\n\n}\n","file_path":"src/settings/zones_settings.rs","rank":32,"score":42090.608237189204},{"content":"pub fn enter_fullscreen(window: &Window) {\n\n let monitor_id = window.get_current_monitor();\n\n window.set_fullscreen(Some(monitor_id));\n\n window.hide_cursor(true);\n\n}\n\n\n","file_path":"src/states/state_helpers.rs","rank":33,"score":41379.22887798081},{"content":"pub fn toggle_fullscreen(window: &Window) {\n\n let is_fullscreen = window.get_fullscreen().is_some();\n\n if is_fullscreen {\n\n leave_fullscreen(window);\n\n } else {\n\n enter_fullscreen(window);\n\n }\n\n}\n","file_path":"src/states/state_helpers.rs","rank":34,"score":41379.22887798081},{"content":"pub fn leave_fullscreen(window: &Window) {\n\n window.set_fullscreen(None);\n\n window.hide_cursor(false);\n\n}\n\n\n","file_path":"src/states/state_helpers.rs","rank":35,"score":41379.22887798081},{"content":"fn frame_rate_limit_config() -> amethyst::Result<FrameRateLimitConfig> {\n\n use std::fs::File;\n\n Ok(ron::de::from_reader(File::open(resource(\n\n \"config/frame_limiter.ron\",\n\n ))?)?)\n\n}\n","file_path":"src/init/mod.rs","rank":36,"score":38598.43606783517},{"content":"pub fn load_level(filepath: PathBuf) -> amethyst::Result<DataLevel> {\n\n let level_file = File::open(filepath)?;\n\n let level_data = serde_json::de::from_reader::<_, DataLevel>(level_file)?;\n\n Ok(level_data)\n\n}\n\n\n","file_path":"src/level_loader/mod.rs","rank":37,"score":35847.56434609405},{"content":"pub mod prelude {\n\n pub use super::audio_settings::AudioSettings;\n\n pub use super::camera_settings::CameraSettings;\n\n pub use super::lanes_settings::LanesSettings;\n\n pub use super::objects_settings::{ObjectSettings, ObjectsSettings};\n\n pub use super::player_settings::PlayerSettings;\n\n pub use super::savefile_settings::SavefileSettings;\n\n pub use super::zones_settings::{ZoneId, ZoneSettings, ZonesSettings};\n\n pub use super::Settings;\n\n}\n\n\n\npub mod audio_settings;\n\npub mod camera_settings;\n\npub mod entity_components;\n\npub mod hitbox_config;\n\npub mod lanes_settings;\n\npub mod objects_settings;\n\npub mod player_settings;\n\npub mod savefile_settings;\n\npub mod zones_settings;\n","file_path":"src/settings/mod.rs","rank":38,"score":35443.692116441205},{"content":"\n\nuse crate::resource;\n\nuse deathframe::amethyst;\n\nuse deathframe::components::prelude::Merge;\n\nuse prelude::*;\n\nuse std::fmt;\n\nuse std::fs::File;\n\nuse std::path::PathBuf;\n\n\n\npub struct Settings {\n\n pub camera: CameraSettings,\n\n pub player: PlayerSettings,\n\n pub objects: ObjectsSettings,\n\n pub lanes: LanesSettings,\n\n pub zones: ZonesSettings,\n\n pub audio: AudioSettings,\n\n pub savefile: SavefileSettings,\n\n}\n\n\n\nimpl Settings {\n","file_path":"src/settings/mod.rs","rank":39,"score":35443.656144378365},{"content":" pub fn load() -> deathframe::amethyst::Result<Self> {\n\n Ok(Self {\n\n lanes: load_settings(\"settings/lanes.ron\")?,\n\n camera: load_settings(\"settings/camera.ron\")?,\n\n player: load_settings(\"settings/player.ron\")?,\n\n objects: load_settings_dir(\"settings/objects\")?,\n\n zones: load_settings_dir(\"settings/zones\")?,\n\n audio: load_settings(\"settings/audio.ron\")?,\n\n savefile: load_settings(\"settings/savefile.ron\")?,\n\n })\n\n }\n\n}\n\n\n","file_path":"src/settings/mod.rs","rank":40,"score":35439.59311810336},{"content":"use crate::components::prelude::{Hitbox, Size};\n\nuse amethyst::ecs::{Builder, EntityBuilder};\n\nuse deathframe::amethyst;\n\nuse deathframe::core::geo::prelude::Rect;\n\n\n\n#[derive(Deserialize, Clone)]\n\npub enum HitboxConfig {\n\n Size,\n\n Custom(Hitbox),\n\n SizeOffset(Rect),\n\n}\n\n\n\nimpl HitboxConfig {\n\n pub fn add_hitbox_to_entity<'a>(\n\n &self,\n\n entity_builder: EntityBuilder<'a>,\n\n size_opt: Option<&Size>,\n\n ) -> EntityBuilder<'a> {\n\n match self {\n\n HitboxConfig::Size => {\n","file_path":"src/settings/hitbox_config.rs","rank":41,"score":34405.46575881045},{"content":"use super::hitbox_config::HitboxConfig;\n\nuse crate::components::prelude::*;\n\nuse crate::resources::prelude::{AnimationKey, CollisionTag, SolidTag};\n\nuse amethyst::ecs::{Builder, EntityBuilder};\n\nuse deathframe::amethyst;\n\n\n\npub type EntityComponents = Vec<EntityComponent>;\n\n\n\n#[derive(Deserialize, Clone)]\n\npub enum EntityComponent {\n\n Velocity(Velocity),\n\n Size(Size),\n\n Gravity(Gravity),\n\n Animation(Animation),\n\n Animations(AnimationsContainer<AnimationKey>),\n\n BaseFriction(BaseFriction),\n\n Hitbox(HitboxConfig),\n\n Collider(Collider<CollisionTag>),\n\n Collidable(Collidable<CollisionTag>),\n\n Solid(Solid<SolidTag>),\n","file_path":"src/settings/entity_components.rs","rank":42,"score":34405.46193016587},{"content":" if let Some(size) = size_opt {\n\n entity_builder.with(Hitbox::from(size))\n\n } else {\n\n panic!(\"HitboxConfig::Size entity doesn't have a Size\");\n\n }\n\n }\n\n HitboxConfig::Custom(hitbox) => entity_builder.with(hitbox.clone()),\n\n HitboxConfig::SizeOffset(padding) => {\n\n if let Some(size) = size_opt {\n\n let mut rect = Rect::from(size);\n\n rect.top += padding.top;\n\n rect.bottom += padding.bottom;\n\n rect.left += padding.left;\n\n rect.right += padding.right;\n\n entity_builder.with(Hitbox::from(rect))\n\n } else {\n\n panic!(\n\n \"HitboxConfig::SizePadding entity doesn't have a Size\"\n\n );\n\n }\n\n }\n\n }\n\n }\n\n}\n","file_path":"src/settings/hitbox_config.rs","rank":43,"score":34401.56069252267},{"content":" Comp::Animations(mut animations) => {\n\n let _ = animations.play(AnimationKey::Idle);\n\n builder.with(animations)\n\n }\n\n Comp::BaseFriction(base_friction) => builder.with(base_friction),\n\n Comp::Hitbox(hitbox) => {\n\n hitbox.add_hitbox_to_entity(builder, size_opt.as_ref())\n\n }\n\n Comp::Collider(collider) => builder.with(collider),\n\n Comp::Collidable(collidable) => builder.with(collidable),\n\n Comp::Solid(solid) => builder.with(solid),\n\n Comp::SolidPusher(solid_pusher) => builder.with(solid_pusher),\n\n Comp::SolidPushable(solid_pushable) => builder.with(solid_pushable),\n\n Comp::ScaleOnce(scale_once) => builder.with(scale_once),\n\n Comp::OnLane(on_lane) => builder.with(on_lane),\n\n Comp::Portal(portal) => builder.with(portal),\n\n Comp::Obstacle(obstacle) => builder.with(obstacle),\n\n Comp::Coin(coin) => builder.with(coin),\n\n Comp::Turret(turret) => builder.with(turret),\n\n Comp::Loadable(loadable) => {\n\n builder.with(loadable).with(Unloaded::default())\n\n }\n\n Comp::DeleteDelay(delete_delay) => builder.with(delete_delay),\n\n Comp::Rotate(rotate) => builder.with(rotate),\n\n Comp::Cutscene(cutscene) => builder.with(cutscene),\n\n })\n\n}\n","file_path":"src/settings/entity_components.rs","rank":44,"score":34401.56069252267},{"content":" SolidPusher(SolidPusher),\n\n SolidPushable(SolidPushable),\n\n ScaleOnce(ScaleOnce),\n\n OnLane(OnLane),\n\n Portal(Portal),\n\n Obstacle(Obstacle),\n\n Coin(Coin),\n\n Turret(Turret),\n\n Loadable(Loadable),\n\n DeleteDelay(DeleteDelay),\n\n Rotate(Rotate),\n\n Cutscene(Cutscene),\n\n}\n\n\n","file_path":"src/settings/entity_components.rs","rank":45,"score":34401.56069252267},{"content":"use super::data::*;\n\nuse super::ObjectType;\n\nuse crate::components::prelude::*;\n\nuse crate::resource;\n\nuse crate::settings::entity_components::add_components_to_entity;\n\nuse crate::settings::prelude::*;\n\nuse crate::settings::zones_settings::SegmentId;\n\nuse amethyst::ecs::{Builder, Entity, EntityBuilder, World, WorldExt};\n\nuse deathframe::amethyst;\n\nuse deathframe::core::geo::prelude::Axis;\n\nuse deathframe::resources::SpriteSheetHandles;\n\nuse std::path::PathBuf;\n\n\n","file_path":"src/level_loader/objects.rs","rank":46,"score":8.390125220967215},{"content":"use crate::settings::prelude::SavefileSettings;\n\nuse crate::settings::prelude::ZoneId;\n\nuse deathframe::amethyst;\n\nuse std::collections::{HashMap, HashSet};\n\nuse std::fs::File;\n\nuse std::path::PathBuf;\n\n\n\n#[derive(Default, Serialize, Deserialize)]\n\npub struct Savefile {\n\n pub highscores: Highscores,\n\n pub unlocked: HashSet<ZoneId>,\n\n\n\n #[serde(skip)]\n\n should_save: bool,\n\n}\n\n\n\n#[derive(Default, Serialize, Deserialize)]\n\npub struct Highscores {\n\n pub progression: Option<Highscore>,\n\n pub infinite: HashMap<ZoneId, Highscore>,\n","file_path":"src/resources/savefile/mod.rs","rank":47,"score":8.125703759704038},{"content":"use super::data::*;\n\nuse crate::components::prelude::*;\n\nuse crate::resource;\n\nuse crate::settings::zones_settings::SegmentId;\n\nuse amethyst::ecs::{Builder, Entity, World, WorldExt};\n\nuse deathframe::amethyst;\n\nuse deathframe::resources::SpriteSheetHandles;\n\nuse std::path::PathBuf;\n\n\n","file_path":"src/level_loader/tiles.rs","rank":48,"score":8.010321571180222},{"content":"use crate::resource;\n\nuse crate::settings::Settings;\n\nuse crate::states::aliases::GameData;\n\nuse crate::states::prelude::Startup;\n\nuse amethyst::core::frame_limiter::FrameRateLimitConfig;\n\nuse amethyst::utils::app_root_dir::application_root_dir;\n\nuse amethyst::ApplicationBuilder;\n\nuse deathframe::amethyst;\n\n\n\nmod init_game_data;\n\n\n","file_path":"src/init/mod.rs","rank":50,"score":7.8122570897575265},{"content":"use super::component_prelude::*;\n\nuse crate::settings::zones_settings::SegmentId;\n\n\n\n#[derive(Component)]\n\n#[storage(VecStorage)]\n\npub struct BelongsToSegment(pub SegmentId);\n","file_path":"src/components/belongs_to_segment.rs","rank":51,"score":7.653843852046629},{"content":"pub mod data;\n\npub mod objects;\n\npub mod tiles;\n\n\n\nuse crate::components::prelude::Size;\n\nuse crate::resources::prelude::{ZoneSize, ZonesManager};\n\nuse crate::settings::zones_settings::{SegmentId, ZoneId, ZonesSettings};\n\nuse amethyst::ecs::{World, WorldExt};\n\nuse data::*;\n\nuse deathframe::amethyst;\n\nuse std::fs::File;\n\nuse std::path::PathBuf;\n\n\n\n#[derive(Deserialize, Clone)]\n\npub enum TileType {\n\n #[serde(rename = \"\")]\n\n Empty,\n\n}\n\n\n\n#[derive(Deserialize, PartialEq, Eq, Hash, Clone, Debug)]\n\npub enum ObjectType {\n\n Player,\n\n Solid,\n\n Portal,\n\n Obstacle,\n\n Coin(ZoneId),\n\n Custom(String),\n\n}\n\n\n","file_path":"src/level_loader/mod.rs","rank":52,"score":7.574271604248039},{"content":"use crate::level_loader::data::DataLevel;\n\nuse crate::level_loader::load_level;\n\nuse crate::resource;\n\nuse crate::resources::prelude::SongKey;\n\nuse crate::settings::zones_settings::{SegmentId, ZoneId, ZonesSettings};\n\nuse rand::prelude::SliceRandom;\n\nuse replace_with::replace_with_or_abort;\n\nuse std::collections::HashMap;\n\n\n\nconst KEEP_COUNT_SEGMENTS_LOADED: usize = 2;\n\n\n\n#[derive(Default)]\n\npub struct ZonesManager {\n\n current_zone: Option<ZoneState>,\n\n initial_zone_idx: Option<usize>,\n\n is_infinite_zone: bool,\n\n last_staged_segment: Option<SegmentId>,\n\n staged_segments: Vec<SegmentId>,\n\n levels: HashMap<SegmentId, DataLevel>,\n\n segment_loading_locked: bool,\n\n}\n\n\n\n#[derive(Debug)]\n","file_path":"src/resources/zones_manager.rs","rank":53,"score":7.352643855591024},{"content":"use super::component_prelude::*;\n\nuse crate::settings::zones_settings::SegmentId;\n\n\n\n#[derive(Component)]\n\n#[storage(VecStorage)]\n\npub struct Segment {\n\n pub id: SegmentId,\n\n pub is_first_segment: bool,\n\n pub is_final_segment: bool,\n\n}\n","file_path":"src/components/segment.rs","rank":54,"score":7.324088429099131},{"content":"use crate::settings::prelude::LanesSettings;\n\n\n\npub struct Lanes {\n\n pub lanes: Vec<Lane>,\n\n}\n\n\n\npub struct Lane {\n\n pub x: f32,\n\n}\n\n\n\nimpl From<(&LanesSettings, f32)> for Lanes {\n\n fn from((settings, level_width): (&LanesSettings, f32)) -> Self {\n\n let center_x = level_width * 0.5;\n\n let total_lanes_width = settings.spacing * settings.count as f32;\n\n let half_lanes_width = total_lanes_width * 0.5;\n\n let half_lane_width = settings.spacing * 0.5;\n\n\n\n let lanes = (0 .. settings.count)\n\n .into_iter()\n\n .map(|i| Lane {\n\n x: center_x + (i as f32 * settings.spacing) - half_lanes_width\n\n + half_lane_width,\n\n })\n\n .collect();\n\n\n\n Self { lanes }\n\n }\n\n}\n","file_path":"src/resources/lanes.rs","rank":55,"score":6.6238731607347},{"content":"use crate::settings::prelude::ZoneId;\n\n\n\n#[derive(Default)]\n\npub struct SelectedZone(pub Option<(usize, ZoneId)>);\n","file_path":"src/resources/selected_zone.rs","rank":56,"score":6.538593033205714},{"content":" fn load_zone(&mut self, world: &mut World) {\n\n let mut player_speed_opt = None;\n\n\n\n {\n\n use deathframe::amethyst::ecs::{ReadExpect, WriteExpect};\n\n\n\n world.exec(\n\n |(\n\n mut zones_manager,\n\n settings,\n\n mut songs,\n\n savefile_settings,\n\n mut savefile,\n\n ): (\n\n WriteExpect<ZonesManager>,\n\n ReadExpect<ZonesSettings>,\n\n WriteExpect<Songs<SongKey>>,\n\n ReadExpect<SavefileSettings>,\n\n WriteExpect<Savefile>,\n\n )| {\n","file_path":"src/states/ingame.rs","rank":57,"score":6.4358998292679725},{"content":"\n\npub mod aliases {\n\n use crate::resources::prelude::DispatcherId;\n\n use deathframe::core::custom_game_data::prelude::*;\n\n\n\n pub type CustomData = ();\n\n\n\n pub type GameData<'a, 'b> =\n\n CustomGameData<'a, 'b, DispatcherId, CustomData>;\n\n\n\n pub type GameDataBuilder<'a, 'b> =\n\n CustomGameDataBuilder<'a, 'b, DispatcherId, CustomData>;\n\n}\n\n\n\nmod state_prelude {\n\n pub use super::aliases::*;\n\n pub use super::prelude::*;\n\n pub use super::state_helpers::*;\n\n pub use crate::resource;\n\n pub use crate::resources::prelude::*;\n\n pub use crate::settings::prelude::*;\n\n pub use deathframe::states::state_prelude::*;\n\n}\n\n\n\nmod menu_prelude {\n\n pub use deathframe::amethyst::ui::{UiEvent, UiEventType};\n\n pub use deathframe::core::menu::prelude::*;\n\n}\n","file_path":"src/states/mod.rs","rank":58,"score":6.169196797988084},{"content":"use super::system_prelude::*;\n\n\n\n#[derive(Default)]\n\npub struct HandleZoneSelect;\n\n\n\nimpl<'a> System<'a> for HandleZoneSelect {\n\n type SystemData = (\n\n ReadExpect<'a, InputManager<MenuBindings>>,\n\n ReadExpect<'a, ZonesSettings>,\n\n Write<'a, SelectedZone>,\n\n ReadExpect<'a, Savefile>,\n\n );\n\n\n\n fn run(\n\n &mut self,\n\n (\n\n input_manager,\n\n settings,\n\n mut selected_zone,\n\n savefile,\n","file_path":"src/systems/handle_zone_select.rs","rank":59,"score":6.0627299657871845},{"content":"\n\nimpl<'a, 'b> State<GameData<'a, 'b>, StateEvent> for ZoneTransition {\n\n fn on_start(&mut self, mut data: StateData<GameData<'a, 'b>>) {\n\n self.start(&mut data);\n\n\n\n {\n\n use deathframe::amethyst::ecs::{ReadExpect, WriteExpect};\n\n\n\n data.world.exec(\n\n |(mut zones_manager, zones_settings): (\n\n WriteExpect<ZonesManager>,\n\n ReadExpect<ZonesSettings>,\n\n )| {\n\n zones_manager.stage_next_zone(&zones_settings);\n\n },\n\n )\n\n }\n\n }\n\n\n\n fn on_resume(&mut self, mut data: StateData<GameData<'a, 'b>>) {\n","file_path":"src/states/zone_transition.rs","rank":60,"score":5.965678061123347},{"content":" pub use super::handle_delete_delay::HandleDeleteDelay;\n\n pub use super::handle_obstacle::HandleObstacle;\n\n pub use super::handle_parent_delete::HandleParentDelete;\n\n pub use super::handle_segment_loading::HandleSegmentLoading;\n\n pub use super::handle_turret::HandleTurret;\n\n pub use super::handle_zone_select::HandleZoneSelect;\n\n pub use super::handle_zone_switch::HandleZoneSwitch;\n\n pub use super::update_highscore_ui::UpdateHighscoreUi;\n\n pub use super::update_on_lane::UpdateOnLane;\n\n pub use super::update_rotate::UpdateRotate;\n\n pub use super::update_score_ui::UpdateScoreUi;\n\n pub use super::update_selected_zone_ui::UpdateSelectedZoneUi;\n\n pub use deathframe::systems::prelude::*;\n\n}\n\n\n\nmod system_prelude {\n\n pub use crate::components::prelude::*;\n\n pub use crate::input::prelude::*;\n\n pub use crate::resources::prelude::*;\n\n pub use crate::settings::prelude::*;\n\n pub use deathframe::core::geo::prelude::*;\n\n pub use deathframe::systems::system_prelude::*;\n\n}\n","file_path":"src/systems/mod.rs","rank":61,"score":5.91090618982883},{"content":" data.world.insert(ZoneSize::default());\n\n data.world.insert(ShouldLoadNextZone::default());\n\n data.world.insert(GameOver::default());\n\n data.world.insert(Score::default());\n\n\n\n {\n\n let lanes = Lanes::from((\n\n &*data.world.read_resource::<LanesSettings>(),\n\n SEGMENT_WIDTH,\n\n ));\n\n data.world.insert(lanes);\n\n }\n\n\n\n {\n\n use deathframe::amethyst::ecs::{ReadExpect, WriteExpect};\n\n\n\n data.world.exec(\n\n |(mut zones_manager, settings): (\n\n WriteExpect<ZonesManager>,\n\n ReadExpect<ZonesSettings>,\n","file_path":"src/states/ingame.rs","rank":62,"score":5.908676641088537},{"content":"extern crate climer;\n\nextern crate deathframe;\n\nextern crate dirs;\n\nextern crate rand;\n\nextern crate replace_with;\n\nextern crate ron;\n\n#[macro_use]\n\nextern crate serde;\n\nextern crate serde_json;\n\n\n\nmod components;\n\nmod init;\n\nmod input;\n\nmod level_loader;\n\nmod resources;\n\nmod settings;\n\nmod states;\n\nmod systems;\n\n\n\npub use deathframe::core::resource_helper::resource;\n\n\n","file_path":"src/main.rs","rank":63,"score":5.7282927833961566},{"content":"use super::system_prelude::*;\n\n\n\n#[derive(Default)]\n\npub struct HandleSegmentLoading;\n\n\n\nimpl<'a> System<'a> for HandleSegmentLoading {\n\n type SystemData = (\n\n Entities<'a>,\n\n WriteExpect<'a, ZonesManager>,\n\n ReadExpect<'a, ZonesSettings>,\n\n ReadStorage<'a, Camera>,\n\n ReadStorage<'a, Segment>,\n\n ReadStorage<'a, Transform>,\n\n ReadStorage<'a, Size>,\n\n );\n\n\n\n fn run(\n\n &mut self,\n\n (\n\n entities,\n","file_path":"src/systems/handle_segment_loading.rs","rank":64,"score":5.271385204277562},{"content":" .with_resource(player_settings)\n\n .with_resource(objects_settings)\n\n .with_resource(lanes_settings)\n\n .with_resource(zones_settings)\n\n .with_resource(audio_settings)\n\n .with_resource(savefile_settings)\n\n .build(game_data)?;\n\n\n\n game.run();\n\n\n\n Ok(())\n\n}\n\n\n","file_path":"src/init/mod.rs","rank":65,"score":4.580522909023876},{"content":" .map(|zone_settings| zone_settings.player_speed)\n\n }\n\n\n\n pub fn is_current_zone_skippable(\n\n &self,\n\n settings: &ZonesSettings,\n\n ) -> Option<bool> {\n\n if self.is_infinite_zone {\n\n Some(false)\n\n } else {\n\n self.current_zone\n\n .as_ref()\n\n .and_then(|current_zone| settings.zones.get(¤t_zone.id))\n\n .map(|zone_settings| zone_settings.is_skippable)\n\n }\n\n }\n\n}\n","file_path":"src/resources/zones_manager.rs","rank":66,"score":4.530562666553377},{"content":" pub use super::cutscene::Cutscene;\n\n pub use super::delete_delay::DeleteDelay;\n\n pub use super::object::Object;\n\n pub use super::obstacle::Obstacle;\n\n pub use super::on_lane::OnLane;\n\n pub use super::parent_delete::ParentDelete;\n\n pub use super::player::Player;\n\n pub use super::portal::Portal;\n\n pub use super::rotate::Rotate;\n\n pub use super::segment::Segment;\n\n pub use super::tile::Tile;\n\n pub use super::turret::Turret;\n\n pub use deathframe::amethyst::core::transform::Parent;\n\n pub use deathframe::components::prelude::*;\n\n}\n\n\n\nmod component_prelude {\n\n pub use super::prelude::*;\n\n pub use deathframe::components::component_prelude::*;\n\n}\n","file_path":"src/components/mod.rs","rank":67,"score":4.524326462039251},{"content":" })\n\n }\n\n\n\n pub fn get_current_song<'a>(\n\n &self,\n\n settings: &'a ZonesSettings,\n\n ) -> Option<&'a SongKey> {\n\n self.current_zone\n\n .as_ref()\n\n .and_then(|current_zone| settings.zones.get(¤t_zone.id))\n\n .and_then(|zone_settings| zone_settings.song.as_ref())\n\n }\n\n\n\n pub fn get_current_player_speed(\n\n &self,\n\n settings: &ZonesSettings,\n\n ) -> Option<f32> {\n\n self.current_zone\n\n .as_ref()\n\n .and_then(|current_zone| settings.zones.get(¤t_zone.id))\n","file_path":"src/resources/zones_manager.rs","rank":68,"score":4.501170941338993},{"content":" );\n\n }\n\n }\n\n\n\n fn get_next_segment(&self, settings: &ZonesSettings) -> Option<SegmentId> {\n\n if self.segment_loading_locked {\n\n return None;\n\n }\n\n\n\n let mut rng = rand::thread_rng();\n\n self.current_zone\n\n .as_ref()\n\n .and_then(|current_zone| {\n\n settings\n\n .zones\n\n .get(¤t_zone.id)\n\n .map(|settings| (current_zone, settings))\n\n })\n\n .map(|(current_zone, zone_settings)| {\n\n let should_load_next_zone = zone_settings\n","file_path":"src/resources/zones_manager.rs","rank":69,"score":4.4632102000735525},{"content":" let object_settings = {\n\n let settings = world.read_resource::<ObjectsSettings>();\n\n settings.objects.get(object_type).map(|s| s.clone())\n\n };\n\n\n\n if let Some(object_settings) = object_settings {\n\n let sprite_render_opt = if let Some(spritesheet) =\n\n object_settings.spritesheet.as_ref()\n\n {\n\n let sprite_sheet = world\n\n .write_resource::<SpriteSheetHandles<PathBuf>>()\n\n .get_or_load(\n\n resource(format!(\"spritesheets/{}\", spritesheet)),\n\n world,\n\n );\n\n Some({\n\n SpriteRender {\n\n sprite_sheet,\n\n sprite_number: 0,\n\n }\n","file_path":"src/level_loader/objects.rs","rank":70,"score":4.4632102000735525},{"content":"pub mod prelude {\n\n pub use super::animation_key::AnimationKey;\n\n pub use super::collision_tag::{CollisionTag, SolidTag};\n\n pub use super::dispatcher_id::DispatcherId;\n\n pub use super::game_over::GameOver;\n\n pub use super::lanes::{Lane, Lanes};\n\n pub use super::object_spawner::{ObjectSpawner, ObjectToSpawn};\n\n pub use super::savefile::{Highscore, Highscores, Savefile};\n\n pub use super::score::Score;\n\n pub use super::selected_zone::SelectedZone;\n\n pub use super::should_load_next_zone::ShouldLoadNextZone;\n\n pub use super::song_key::SongKey;\n\n pub use super::sound_key::SoundKey;\n\n pub use super::zone_progression_mode::ZoneProgressionMode;\n\n pub use super::zone_size::ZoneSize;\n\n pub use super::zones_manager::ZonesManager;\n\n pub use deathframe::resources::prelude::*;\n\n}\n\n\n\nmod animation_key;\n","file_path":"src/resources/mod.rs","rank":71,"score":4.413194167842804},{"content":"mod cutscene;\n\nmod game_over_state;\n\nmod ingame;\n\nmod main_menu;\n\nmod pause;\n\nmod startup;\n\nmod state_helpers;\n\nmod zone_select;\n\nmod zone_transition;\n\n\n\npub mod prelude {\n\n pub use super::cutscene::Cutscene;\n\n pub use super::game_over_state::GameOverState;\n\n pub use super::ingame::Ingame;\n\n pub use super::main_menu::MainMenu;\n\n pub use super::pause::Pause;\n\n pub use super::startup::Startup;\n\n pub use super::zone_select::ZoneSelect;\n\n pub use super::zone_transition::ZoneTransition;\n\n}\n","file_path":"src/states/mod.rs","rank":72,"score":4.2386060417002085},{"content":" Err(e) => {\n\n eprintln!(\n\n \"[WARNING]\\n Couldn't load segment {}!\\n{}\",\n\n &segment, e\n\n )\n\n }\n\n }\n\n }\n\n }\n\n\n\n pub fn stage_next_zone(&mut self, settings: &ZonesSettings) {\n\n if let Some((next_zone, next_order_idx)) = self.get_next_zone(settings)\n\n {\n\n self.reset();\n\n self.current_zone = Some(ZoneState::new(next_zone, next_order_idx));\n\n self.load_all_segments(settings);\n\n } else {\n\n eprintln!(\"[WARNING]\\n There is no next zone to load!\");\n\n }\n\n }\n","file_path":"src/resources/zones_manager.rs","rank":73,"score":4.108358676657278},{"content":" object_settings.components.clone(),\n\n size_opt,\n\n );\n\n\n\n Some(entity_builder)\n\n } else {\n\n eprintln!(\n\n \"[WARNING]\\n No settings for object: {:?}\",\n\n object_type\n\n );\n\n None\n\n }\n\n }\n\n }\n\n}\n\n\n","file_path":"src/level_loader/objects.rs","rank":74,"score":4.092350301061282},{"content":"use amethyst::renderer::rendy::wsi::winit::Window;\n\nuse deathframe::amethyst;\n\n\n","file_path":"src/states/state_helpers.rs","rank":75,"score":4.066435153209763},{"content":" {\n\n zones_manager.stage_initial_segments(&settings);\n\n player_speed_opt =\n\n zones_manager.get_current_player_speed(&settings);\n\n if let Some(is_skippable) =\n\n zones_manager.is_current_zone_skippable(&settings)\n\n {\n\n self.is_zone_skippable = is_skippable;\n\n }\n\n songs.stop_all();\n\n if let Some(song_key) =\n\n zones_manager.get_current_song(&settings)\n\n {\n\n songs.play(song_key);\n\n }\n\n }\n\n\n\n {\n\n if let Some(zone) = zones_manager.current_zone() {\n\n savefile.unlock(zone.clone());\n","file_path":"src/states/ingame.rs","rank":76,"score":4.035871855552555},{"content":"use super::menu_prelude::*;\n\nuse super::state_prelude::*;\n\nuse crate::components::prelude::Size;\n\nuse crate::input::prelude::{MenuAction, MenuBindings};\n\nuse crate::level_loader::objects::build_camera;\n\nuse crate::level_loader::{build_level, load_level};\n\n\n\n#[derive(Default)]\n\npub struct Cutscene {\n\n ui_data: UiData,\n\n did_load_level: bool,\n\n did_load_cutscene: bool,\n\n}\n\n\n\nimpl Cutscene {\n\n fn start<'a, 'b>(&mut self, data: &mut StateData<GameData<'a, 'b>>) {\n\n self.create_ui(data, resource(\"ui/cutscene.ron\").to_str().unwrap());\n\n }\n\n\n\n fn stop<'a, 'b>(&mut self, data: &mut StateData<GameData<'a, 'b>>) {\n","file_path":"src/states/cutscene.rs","rank":77,"score":4.022840966759144},{"content":"use super::menu_prelude::*;\n\nuse super::state_prelude::*;\n\nuse crate::components::prelude::{Size, Transform};\n\nuse crate::input::prelude::{MenuAction, MenuBindings};\n\nuse crate::level_loader::build_segment;\n\nuse crate::level_loader::objects::{build_camera, build_object, build_player};\n\n\n\nconst SEGMENT_WIDTH: f32 = 128.0;\n\nconst UI_SKIP_TEXT_ID: &str = \"skip_zone_text\";\n\nconst UI_SCORE_ID: &str = \"score\";\n\n\n\npub struct Ingame {\n\n initial_zone_idx: Option<usize>,\n\n is_infinite_zone: bool,\n\n load_new_zone_on_resume: bool,\n\n ui_data: UiData,\n\n is_zone_skippable: bool,\n\n}\n\n\n\nimpl Default for Ingame {\n","file_path":"src/states/ingame.rs","rank":78,"score":3.9989638226160755},{"content":"\n\n fn get_next_zone(\n\n &self,\n\n settings: &ZonesSettings,\n\n ) -> Option<(ZoneId, usize)> {\n\n if let Some(current_zone) = self.current_zone.as_ref() {\n\n let order_idx = current_zone.order_idx + 1;\n\n settings\n\n .config\n\n .zone_order\n\n .get(order_idx)\n\n .map(|next| (next, order_idx))\n\n } else {\n\n if let Some(&initial_zone_idx) = self.initial_zone_idx.as_ref() {\n\n settings\n\n .config\n\n .zone_order\n\n .get(initial_zone_idx)\n\n .map(|initial_zone| (initial_zone, initial_zone_idx))\n\n } else {\n","file_path":"src/resources/zones_manager.rs","rank":79,"score":3.9544715661755125},{"content":" }\n\n\n\n pub fn handle_save(&mut self, settings: &SavefileSettings) {\n\n if self.should_save() {\n\n match settings.savefile_path() {\n\n Ok(savefile_path) => {\n\n if let Err(e) = self.save(savefile_path) {\n\n eprintln!(\"[WARNING]\\n {}\", e);\n\n }\n\n }\n\n Err(e) => eprintln!(\"[WARNING]\\n {}\", e),\n\n }\n\n }\n\n }\n\n\n\n pub fn unlock(&mut self, zone: ZoneId) -> bool {\n\n let did_update = self.unlocked.insert(zone);\n\n if did_update {\n\n self.should_save = true;\n\n }\n","file_path":"src/resources/savefile/mod.rs","rank":80,"score":3.93818167472737},{"content":" use deathframe::amethyst::assets::AssetStorage;\n\n use deathframe::amethyst::ecs::{\n\n Join,\n\n Read,\n\n ReadStorage,\n\n WriteStorage,\n\n };\n\n use deathframe::amethyst::renderer::sprite::SpriteSheet;\n\n use deathframe::amethyst::renderer::Texture;\n\n\n\n if self.did_load_level && !self.did_load_cutscene {\n\n data.world.exec(\n\n |(\n\n spritesheet_assets,\n\n texture_assets,\n\n cutscene_store,\n\n mut animations_store,\n\n sprite_render_store,\n\n ): (\n\n Read<AssetStorage<SpriteSheet>>,\n","file_path":"src/states/cutscene.rs","rank":81,"score":3.927832111495411},{"content":" object.object_type,\n\n transform,\n\n object.size.map(Into::into),\n\n ) {\n\n entity_builder.build();\n\n }\n\n }\n\n }\n\n }\n\n\n\n fn handle_skippable_zone(&self, world: &mut World) {\n\n use deathframe::amethyst::core::HiddenPropagate;\n\n use deathframe::amethyst::ecs::{\n\n Entities,\n\n Join,\n\n ReadStorage,\n\n WriteStorage,\n\n };\n\n use deathframe::amethyst::ui::UiTransform;\n\n\n","file_path":"src/states/ingame.rs","rank":82,"score":3.911464089018892},{"content":" self.stage_next_segment(settings);\n\n }\n\n }\n\n\n\n pub fn stage_next_segment(&mut self, settings: &ZonesSettings) {\n\n if let Some(next_segment) = self.get_next_segment(settings) {\n\n self.current_zone\n\n .as_mut()\n\n .expect(\n\n \"Should have current zone, if next segment could be found\",\n\n )\n\n .total_segments_loaded += 1;\n\n self.last_staged_segment = Some(next_segment.clone());\n\n self.staged_segments.push(next_segment);\n\n } else {\n\n self.last_staged_segment = None;\n\n eprintln!(\n\n \"[WARNING]\\n ZonesManager couldn't find possible next \\\n\n segment, for zone and segment: {:?} {:?}\",\n\n &self.current_zone, &self.last_staged_segment\n","file_path":"src/resources/zones_manager.rs","rank":83,"score":3.8983102924001285},{"content":"pub mod prelude {\n\n pub use super::ingame_bindings::*;\n\n pub use super::menu_bindings::*;\n\n}\n\n\n\nmod ingame_bindings;\n\nmod menu_bindings;\n","file_path":"src/input/mod.rs","rank":84,"score":3.856927506606352},{"content":" );\n\n None\n\n }\n\n },\n\n )\n\n }\n\n\n\n fn load_all_segments(&mut self, settings: &ZonesSettings) {\n\n if let Some(segments) = self\n\n .current_zone\n\n .as_ref()\n\n .and_then(|zone| settings.zones.get(&zone.id))\n\n .map(|zone| {\n\n let mut segments = zone\n\n .segments\n\n .keys()\n\n .map(Clone::clone)\n\n .collect::<Vec<SegmentId>>();\n\n segments.append(&mut zone.first_segment.clone());\n\n segments.append(&mut zone.final_segment.clone());\n","file_path":"src/resources/zones_manager.rs","rank":85,"score":3.835462309663696},{"content":"use super::menu_prelude::*;\n\nuse super::state_prelude::*;\n\nuse crate::input::prelude::{MenuAction, MenuBindings};\n\n\n\n#[derive(Default)]\n\npub struct GameOverState {\n\n ui_data: UiData,\n\n}\n\n\n\nimpl GameOverState {\n\n fn start<'a, 'b>(&mut self, data: &mut StateData<GameData<'a, 'b>>) {\n\n self.create_ui(data, resource(\"ui/game_over.ron\").to_str().unwrap());\n\n self.update_highscore(data.world);\n\n }\n\n\n\n fn update_highscore(&self, world: &mut World) {\n\n use deathframe::amethyst::ecs::{Read, ReadExpect, WriteExpect};\n\n\n\n world.exec(\n\n |(\n","file_path":"src/states/game_over_state.rs","rank":86,"score":3.784425786064457},{"content":" .total_segments\n\n .map(|total_segments| {\n\n self.is_infinite_zone\n\n || current_zone.total_segments_loaded\n\n < total_segments\n\n })\n\n .unwrap_or(true);\n\n if should_load_next_zone {\n\n self.last_staged_segment\n\n .as_ref()\n\n .and_then(|current_segment| {\n\n zone_settings.segments.get(current_segment)\n\n })\n\n .unwrap_or(&zone_settings.first_segment)\n\n } else {\n\n &zone_settings.final_segment\n\n }\n\n })\n\n .and_then(|possible_segments| {\n\n possible_segments.choose(&mut rng).map(ToString::to_string)\n","file_path":"src/resources/zones_manager.rs","rank":87,"score":3.7653120127640265},{"content":"use super::component_prelude::*;\n\nuse crate::level_loader::ObjectType;\n\nuse climer::Timer;\n\nuse std::time::Duration;\n\n\n\n#[derive(Component, Clone, Deserialize)]\n\n#[storage(DenseVecStorage)]\n\npub struct Turret {\n\n pub shot_object_type: ObjectType,\n\n pub shot_interval_ms: u64,\n\n #[serde(default)]\n\n pub shot_initial_delay_ms: u64,\n\n #[serde(default)]\n\n pub shot_offset: (f32, f32),\n\n #[serde(skip)]\n\n shot_timer: Option<Timer>,\n\n}\n\n\n\nimpl Turret {\n\n pub fn get_timer(&mut self) -> &mut Timer {\n","file_path":"src/components/turret.rs","rank":88,"score":3.7632875163662955},{"content":"# DRIFTDOWN EZ MODE\n\nAlternate settings files to make the game easier. \n\nIntended for people who find the default settings too difficult, \n\nbut still want to experience the full game. \n\n\n\n## `EZ_ZONES`\n\n[`./ez_zones.ron`](./ez_zones.ron) \n\n\n\nOverwrite `resources/settings/zones/zones.ron` with the `ez_zones.ron` file.\n\n\n\n- Makes every zone skippable.\n\n- Decreases the total level segments in each zone.\n\n- Decreases the player speed in each zone.\n","file_path":"ez_mode/README.md","rank":89,"score":3.7515887614730565},{"content":" if let Some(song) = songs.get_mut(song_key) {\n\n song.set_volume(audio_settings.volume);\n\n }\n\n }\n\n Err(e) => eprintln!(\n\n \"[WARNING]\\n Error loading song {}, skipping.\\n{:#?}\",\n\n &song.file, e\n\n ),\n\n }\n\n }\n\n\n\n let mut sounds = Sounds::<SoundKey>::default();\n\n for (sound_key, sound) in audio_settings.sfx.iter() {\n\n if let Err(e) = sounds.load_audio(\n\n sound_key.clone(),\n\n resource(format!(\"audio/sfx/{}\", sound.file)),\n\n world,\n\n ) {\n\n eprintln!(\n\n \"[WARNING]\\n Error loading sound {}, skipping.\\n{:#?}\",\n","file_path":"src/states/startup.rs","rank":90,"score":3.711012713717892},{"content":"use super::system_prelude::*;\n\nuse deathframe::physics::query;\n\nuse query::prelude::{FilterQuery, Query};\n\n\n\n#[derive(Default)]\n\npub struct HandleCoinCollection;\n\n\n\nimpl<'a> System<'a> for HandleCoinCollection {\n\n type SystemData = (\n\n Entities<'a>,\n\n WriteExpect<'a, Score>,\n\n WriteExpect<'a, SoundPlayer<SoundKey>>,\n\n ReadStorage<'a, Player>,\n\n ReadStorage<'a, Coin>,\n\n ReadStorage<'a, Collider<CollisionTag>>,\n\n );\n\n\n\n fn run(\n\n &mut self,\n\n (\n","file_path":"src/systems/handle_coin_collection.rs","rank":91,"score":3.6968429990404617},{"content":"use super::system_prelude::*;\n\nuse deathframe::physics::query;\n\nuse query::prelude::{FindQuery, Query};\n\n\n\n#[derive(Default)]\n\npub struct HandleZoneSwitch;\n\n\n\nimpl<'a> System<'a> for HandleZoneSwitch {\n\n type SystemData = (\n\n WriteExpect<'a, ShouldLoadNextZone>,\n\n ReadStorage<'a, Player>,\n\n ReadStorage<'a, Collider<CollisionTag>>,\n\n );\n\n\n\n fn run(\n\n &mut self,\n\n (\n\n mut should_load_next_zone,\n\n player_store,\n\n collider_store,\n","file_path":"src/systems/handle_zone_switch.rs","rank":92,"score":3.6968429990404617},{"content":"use super::system_prelude::*;\n\nuse deathframe::physics::query;\n\nuse query::prelude::{FindQuery, Query};\n\n\n\n#[derive(Default)]\n\npub struct HandleObstacle;\n\n\n\nimpl<'a> System<'a> for HandleObstacle {\n\n type SystemData = (\n\n Entities<'a>,\n\n WriteExpect<'a, GameOver>,\n\n WriteExpect<'a, SoundPlayer<SoundKey>>,\n\n ReadStorage<'a, Player>,\n\n ReadStorage<'a, Obstacle>,\n\n ReadStorage<'a, Collider<CollisionTag>>,\n\n WriteStorage<'a, AnimationsContainer<AnimationKey>>,\n\n WriteStorage<'a, Velocity>,\n\n );\n\n\n\n fn run(\n","file_path":"src/systems/handle_obstacle.rs","rank":93,"score":3.6174476083654574},{"content":"use super::component_prelude::*;\n\nuse crate::level_loader::ObjectType;\n\n\n\n#[derive(Component)]\n\n#[storage(VecStorage)]\n\npub struct Object {\n\n pub object_type: ObjectType,\n\n}\n\n\n\nimpl From<ObjectType> for Object {\n\n fn from(object_type: ObjectType) -> Self {\n\n Self { object_type }\n\n }\n\n}\n","file_path":"src/components/object.rs","rank":94,"score":3.609006979843734},{"content":"use super::menu_prelude::*;\n\nuse super::state_prelude::*;\n\nuse crate::input::prelude::{MenuAction, MenuBindings};\n\n\n\n#[derive(Default)]\n\npub struct Pause {\n\n ui_data: UiData,\n\n}\n\n\n\nimpl Pause {\n\n fn start<'a, 'b>(&mut self, data: &mut StateData<GameData<'a, 'b>>) {\n\n self.create_ui(data, resource(\"ui/pause.ron\").to_str().unwrap());\n\n }\n\n\n\n fn stop<'a, 'b>(&mut self, data: &mut StateData<GameData<'a, 'b>>) {\n\n self.delete_ui(data);\n\n }\n\n\n\n fn handle_input<'a, 'b>(\n\n &mut self,\n","file_path":"src/states/pause.rs","rank":95,"score":3.6045454153532015},{"content":"use super::component_prelude::*;\n\nuse climer::Timer;\n\nuse std::time::Duration;\n\n\n\n#[derive(Component, Clone, Deserialize)]\n\n#[storage(DenseVecStorage)]\n\npub struct DeleteDelay {\n\n pub delete_after_ms: u64,\n\n #[serde(skip)]\n\n timer: Option<Timer>,\n\n}\n\n\n\nimpl DeleteDelay {\n\n pub fn get_timer(&mut self) -> &mut Timer {\n\n let ms = self.delete_after_ms;\n\n self.timer.get_or_insert_with(|| {\n\n let mut timer =\n\n Timer::new(Some(Duration::from_millis(ms).into()), None);\n\n let _ = timer.start();\n\n timer\n\n })\n\n }\n\n}\n","file_path":"src/components/delete_delay.rs","rank":96,"score":3.6045454153532015},{"content":" world.register::<Turret>();\n\n world.register::<Cutscene>();\n\n\n\n let sprite_sheet_handles = SpriteSheetHandles::<PathBuf>::default();\n\n world.insert(sprite_sheet_handles);\n\n\n\n world.insert(load_savefile(&world));\n\n\n\n let (songs, sounds) = {\n\n let audio_settings = world.read_resource::<AudioSettings>();\n\n\n\n let mut songs = Songs::<SongKey>::default();\n\n for (song_key, song) in audio_settings.bgm.iter() {\n\n match songs.load_audio(\n\n song_key.clone(),\n\n resource(format!(\"audio/bgm/{}\", song.file)),\n\n true,\n\n world,\n\n ) {\n\n Ok(_) => {\n","file_path":"src/states/startup.rs","rank":97,"score":3.5943853634685814},{"content":" settings.config.zone_order.first().map(|first| (first, 0))\n\n }\n\n }\n\n .map(|(next, order_idx)| (next.clone(), order_idx))\n\n }\n\n\n\n fn reset(&mut self) {\n\n replace_with_or_abort(self, |self_| ZonesManager {\n\n current_zone: None,\n\n initial_zone_idx: self_.initial_zone_idx,\n\n is_infinite_zone: self_.is_infinite_zone,\n\n last_staged_segment: None,\n\n staged_segments: Vec::new(),\n\n levels: HashMap::new(),\n\n segment_loading_locked: false,\n\n });\n\n }\n\n\n\n pub fn stage_initial_segments(&mut self, settings: &ZonesSettings) {\n\n for _ in 0 .. KEEP_COUNT_SEGMENTS_LOADED {\n","file_path":"src/resources/zones_manager.rs","rank":98,"score":3.5943853634685814},{"content":"pub mod belongs_to_segment;\n\npub mod camera;\n\npub mod coin;\n\npub mod cutscene;\n\npub mod delete_delay;\n\npub mod object;\n\npub mod obstacle;\n\npub mod on_lane;\n\npub mod parent_delete;\n\npub mod player;\n\npub mod portal;\n\npub mod rotate;\n\npub mod segment;\n\npub mod tile;\n\npub mod turret;\n\n\n\npub mod prelude {\n\n pub use super::belongs_to_segment::BelongsToSegment;\n\n pub use super::camera::Camera;\n\n pub use super::coin::Coin;\n","file_path":"src/components/mod.rs","rank":99,"score":3.4804111065257555}],"string":"[\n {\n \"content\": \"/// Merge `Vec` of settings `T` together.\\n\\n/// Returns `None` if given `Vec` is empty.\\n\\nfn merge_settings<T>(all_settings: Vec<T>) -> Option<T>\\n\\nwhere\\n\\n T: Merge,\\n\\n{\\n\\n let mut merged_settings: Option<T> = None;\\n\\n for settings in all_settings {\\n\\n if let Some(merged) = merged_settings.as_mut() {\\n\\n merged.merge(settings);\\n\\n } else {\\n\\n merged_settings = Some(settings);\\n\\n }\\n\\n }\\n\\n merged_settings\\n\\n}\\n\",\n \"file_path\": \"src/settings/mod.rs\",\n \"rank\": 0,\n \"score\": 79516.49247778016\n },\n {\n \"content\": \"pub fn add_components_to_entity(\\n\\n entity_builder: EntityBuilder,\\n\\n components: Vec<EntityComponent>,\\n\\n mut size_opt: Option<Size>,\\n\\n) -> EntityBuilder {\\n\\n use self::EntityComponent as Comp;\\n\\n\\n\\n components\\n\\n .into_iter()\\n\\n .fold(entity_builder, |builder, component| match component {\\n\\n Comp::Velocity(velocity) => builder.with(velocity),\\n\\n Comp::Size(size) => {\\n\\n size_opt = Some(size.clone());\\n\\n builder.with(size)\\n\\n }\\n\\n Comp::Gravity(gravity) => builder.with(gravity),\\n\\n Comp::Animation(mut animation) => {\\n\\n animation.play_cycle();\\n\\n builder.with(animation)\\n\\n }\\n\",\n \"file_path\": \"src/settings/entity_components.rs\",\n \"rank\": 1,\n \"score\": 75051.07953049059\n },\n {\n \"content\": \"fn load_settings<S, P>(path: P) -> amethyst::Result<S>\\n\\nwhere\\n\\n for<'de> S: serde::Deserialize<'de>,\\n\\n P: fmt::Display,\\n\\n{\\n\\n let file = File::open(resource(path.to_string()))?;\\n\\n Ok(ron::de::from_reader(file).map_err(|e| {\\n\\n amethyst::Error::from_string(format!(\\n\\n \\\"Failed parsing RON settings file: {}\\\\n{:#?}\\\",\\n\\n path, e\\n\\n ))\\n\\n })?)\\n\\n}\\n\\n\\n\\n// Functions below copied from deathfloor project.\\n\\n\\n\",\n \"file_path\": \"src/settings/mod.rs\",\n \"rank\": 2,\n \"score\": 73401.48343388524\n },\n {\n \"content\": \"fn load_settings_dir<T, S>(dirname: S) -> amethyst::Result<T>\\n\\nwhere\\n\\n for<'de> T: serde::Deserialize<'de> + Merge + Default,\\n\\n S: std::fmt::Display,\\n\\n{\\n\\n let path = resource(dirname.to_string());\\n\\n let errmsg = format!(\\\"No settings files found in {:?}\\\", &path);\\n\\n let all_settings = load_configs_recursively_from(path)?;\\n\\n let merged_settings = merge_settings(all_settings).unwrap_or_else(|| {\\n\\n eprintln!(\\n\\n \\\"[WARNING]\\\\n {}\\\\n Using default (probably empty settings)\\\",\\n\\n errmsg\\n\\n );\\n\\n T::default()\\n\\n });\\n\\n Ok(merged_settings)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/settings/mod.rs\",\n \"rank\": 3,\n \"score\": 72189.41444008576\n },\n {\n \"content\": \"fn load_configs_recursively_from<T>(path: PathBuf) -> amethyst::Result<Vec<T>>\\n\\nwhere\\n\\n for<'de> T: serde::Deserialize<'de> + Merge,\\n\\n{\\n\\n let mut settings = Vec::new();\\n\\n\\n\\n for entry in path.read_dir()? {\\n\\n let entry_path = entry?.path();\\n\\n if entry_path.is_file() {\\n\\n if let Some(\\\"ron\\\") = entry_path.extension().and_then(|e| e.to_str())\\n\\n {\\n\\n let file = File::open(&entry_path)?;\\n\\n settings.push(ron::de::from_reader(file).map_err(|e| {\\n\\n amethyst::Error::from_string(format!(\\n\\n \\\"Failed parsing RON settings file: {:?}\\\\n{:#?}\\\",\\n\\n entry_path, e\\n\\n ))\\n\\n })?);\\n\\n }\\n\\n } else if entry_path.is_dir() {\\n\\n settings.append(&mut load_configs_recursively_from(entry_path)?);\\n\\n }\\n\\n }\\n\\n\\n\\n Ok(settings)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/settings/mod.rs\",\n \"rank\": 4,\n \"score\": 61939.66377277224\n },\n {\n \"content\": \"fn main() {\\n\\n if let Err(e) = init::run() {\\n\\n eprintln!(\\\"An error occured: {}\\\", e);\\n\\n std::process::exit(1);\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/main.rs\",\n \"rank\": 6,\n \"score\": 50236.19162970742\n },\n {\n \"content\": \"fn start_logger() {\\n\\n use amethyst::{LogLevelFilter, LoggerConfig};\\n\\n amethyst::start_logger(LoggerConfig {\\n\\n level_filter: LogLevelFilter::Error,\\n\\n ..Default::default()\\n\\n });\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/init/mod.rs\",\n \"rank\": 7,\n \"score\": 48223.250913462456\n },\n {\n \"content\": \"pub fn build_tiles(\\n\\n world: &mut World,\\n\\n tiles: Vec<DataTile>,\\n\\n tile_size: Size,\\n\\n segment: Option<(SegmentId, Entity)>,\\n\\n offset_y: f32,\\n\\n) -> amethyst::Result<()> {\\n\\n for tile in tiles {\\n\\n let transform = {\\n\\n let mut transform = Transform::default();\\n\\n transform.set_translation_x(tile.pos.x);\\n\\n transform.set_translation_y(-offset_y + tile.pos.y);\\n\\n if let Some(z) = tile.props.get(\\\"z\\\").and_then(|val| val.as_f64()) {\\n\\n transform.set_translation_z(z as f32);\\n\\n }\\n\\n transform\\n\\n };\\n\\n\\n\\n let sprite_render = {\\n\\n let sprite_sheet = world\\n\",\n \"file_path\": \"src/level_loader/tiles.rs\",\n \"rank\": 8,\n \"score\": 45071.173332134225\n },\n {\n \"content\": \"pub fn build_level(\\n\\n world: &mut World,\\n\\n level_data: DataLevel,\\n\\n) -> amethyst::Result<()> {\\n\\n let tile_size =\\n\\n Size::new(level_data.level.tile_size.w, level_data.level.tile_size.h);\\n\\n\\n\\n tiles::build_tiles(world, level_data.tiles, tile_size, None, 0.0)?;\\n\\n objects::build_objects(world, level_data.objects, None, 0.0)?;\\n\\n\\n\\n world.maintain();\\n\\n\\n\\n Ok(())\\n\\n}\\n\",\n \"file_path\": \"src/level_loader/mod.rs\",\n \"rank\": 9,\n \"score\": 45071.173332134225\n },\n {\n \"content\": \"pub fn build_objects(\\n\\n world: &mut World,\\n\\n objects: Vec<DataObject>,\\n\\n segment: Option<(SegmentId, Entity)>,\\n\\n offset_y: f32,\\n\\n) -> amethyst::Result<()> {\\n\\n for object in objects {\\n\\n let transform = {\\n\\n let mut transform = Transform::default();\\n\\n transform.set_translation_x(object.pos.x);\\n\\n transform.set_translation_y(-offset_y + object.pos.y);\\n\\n if let Some(z) = object.props.get(\\\"z\\\").and_then(|val| val.as_f64())\\n\\n {\\n\\n transform.set_translation_z(z as f32);\\n\\n }\\n\\n transform\\n\\n };\\n\\n let size = Size::new(object.size.w, object.size.h);\\n\\n\\n\\n match &object.object_type {\\n\",\n \"file_path\": \"src/level_loader/objects.rs\",\n \"rank\": 10,\n \"score\": 45071.173332134225\n },\n {\n \"content\": \"pub fn build_camera(\\n\\n world: &mut World,\\n\\n player: Option<Entity>,\\n\\n level_size: Size,\\n\\n camera_size: Option<Size>,\\n\\n) -> amethyst::Result<()> {\\n\\n use amethyst::renderer::Camera as AmethystCamera;\\n\\n use amethyst::utils::ortho_camera::{\\n\\n CameraNormalizeMode,\\n\\n CameraOrtho,\\n\\n CameraOrthoWorldCoordinates,\\n\\n };\\n\\n\\n\\n const LOADING_DISTANCE_PADDING: (f32, f32) = (0.0, 16.0);\\n\\n\\n\\n let settings = (*world.read_resource::<CameraSettings>()).clone();\\n\\n\\n\\n let size = camera_size.unwrap_or(settings.size);\\n\\n\\n\\n let camera = AmethystCamera::standard_2d(size.w, size.h);\\n\",\n \"file_path\": \"src/level_loader/objects.rs\",\n \"rank\": 11,\n \"score\": 45071.173332134225\n },\n {\n \"content\": \"pub fn build_segment(\\n\\n world: &mut World,\\n\\n level_data: DataLevel,\\n\\n segment_id: SegmentId,\\n\\n) -> amethyst::Result<()> {\\n\\n let is_first_is_final_segment = {\\n\\n let zones_manager = world.read_resource::<ZonesManager>();\\n\\n let zones_settings = world.read_resource::<ZonesSettings>();\\n\\n if let Some(current_zone) = zones_manager.current_zone() {\\n\\n zones_settings\\n\\n .zones\\n\\n .get(current_zone)\\n\\n .map(|zone_settings| {\\n\\n (\\n\\n zone_settings.first_segment.contains(&segment_id),\\n\\n zone_settings.final_segment.contains(&segment_id),\\n\\n )\\n\\n })\\n\\n .unwrap_or((false, false))\\n\\n } else {\\n\",\n \"file_path\": \"src/level_loader/mod.rs\",\n \"rank\": 12,\n \"score\": 45071.173332134225\n },\n {\n \"content\": \"pub fn build_player(\\n\\n world: &mut World,\\n\\n mut transform: Transform,\\n\\n size: Size,\\n\\n player_speed: f32,\\n\\n) -> Entity {\\n\\n let sprite_render = {\\n\\n let sprite_sheet = world\\n\\n .write_resource::<SpriteSheetHandles<PathBuf>>()\\n\\n .get_or_load(resource(\\\"spritesheets/player.png\\\"), world);\\n\\n SpriteRender {\\n\\n sprite_sheet,\\n\\n sprite_number: 0,\\n\\n }\\n\\n };\\n\\n\\n\\n let settings = (*world.read_resource::<PlayerSettings>()).clone();\\n\\n\\n\\n transform.set_translation_z(settings.z);\\n\\n\\n\",\n \"file_path\": \"src/level_loader/objects.rs\",\n \"rank\": 13,\n \"score\": 45071.173332134225\n },\n {\n \"content\": \"pub fn build_segment_collision(\\n\\n world: &mut World,\\n\\n size: Size,\\n\\n segment_id: SegmentId,\\n\\n (is_first_segment, is_final_segment): (bool, bool),\\n\\n offset_y: f32,\\n\\n) -> Entity {\\n\\n let mut transform = Transform::default();\\n\\n transform.set_translation_xyz(size.w * 0.5, -offset_y + size.h * 0.5, 0.0);\\n\\n world\\n\\n .create_entity()\\n\\n .with(Segment {\\n\\n id: segment_id,\\n\\n is_first_segment,\\n\\n is_final_segment,\\n\\n })\\n\\n .with(transform)\\n\\n .with(size)\\n\\n .build()\\n\\n}\\n\",\n \"file_path\": \"src/level_loader/objects.rs\",\n \"rank\": 14,\n \"score\": 44243.0495882738\n },\n {\n \"content\": \"pub fn build_object<'a>(\\n\\n world: &'a mut World,\\n\\n object_type: ObjectType,\\n\\n transform: Transform,\\n\\n size_opt: Option<Size>,\\n\\n) -> Option<EntityBuilder<'a>> {\\n\\n match &object_type {\\n\\n ObjectType::Player => {\\n\\n eprintln!(\\n\\n \\\"[WARNING]\\\\n A `Player` object is placed in the \\\\\\n\\n level!\\\\n The player is loaded automatically by the \\\\\\n\\n game, don't place them in the levels.\\\\n The placed \\\\\\n\\n player object will not be loaded.\\\"\\n\\n );\\n\\n // let player_entity = build_player(world, transform, size);\\n\\n // let _ = build_camera(world, player_entity);\\n\\n None\\n\\n }\\n\\n\\n\\n object_type => {\\n\",\n \"file_path\": \"src/level_loader/objects.rs\",\n \"rank\": 15,\n \"score\": 43944.64625182798\n },\n {\n \"content\": \"type ObjectsSettingsMap = HashMap<ObjectType, ObjectSettings>;\\n\\n\\n\\n#[derive(Deserialize, Clone, Default)]\\n\\n#[serde(deny_unknown_fields, from = \\\"ObjectsSettingsMap\\\")]\\n\\npub struct ObjectsSettings {\\n\\n pub objects: ObjectsSettingsMap,\\n\\n}\\n\\n\\n\\n#[derive(Deserialize, Clone)]\\n\\n#[serde(deny_unknown_fields)]\\n\\npub struct ObjectSettings {\\n\\n pub components: EntityComponents,\\n\\n #[serde(default)]\\n\\n pub spritesheet: Option<String>,\\n\\n}\\n\\n\\n\\nimpl From<ObjectsSettingsMap> for ObjectsSettings {\\n\\n fn from(objects: ObjectsSettingsMap) -> Self {\\n\\n Self { objects }\\n\\n }\\n\\n}\\n\\n\\n\\nimpl Merge for ObjectsSettings {\\n\\n fn merge(&mut self, other: Self) {\\n\\n self.objects.extend(&mut other.objects.into_iter())\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/settings/objects_settings.rs\",\n \"rank\": 16,\n \"score\": 43458.602569909905\n },\n {\n \"content\": \"fn setup(world: &mut World) {\\n\\n use crate::components::prelude::{\\n\\n BelongsToSegment,\\n\\n Coin,\\n\\n Cutscene,\\n\\n Object,\\n\\n Obstacle,\\n\\n Portal,\\n\\n Segment,\\n\\n Tile,\\n\\n Turret,\\n\\n };\\n\\n\\n\\n world.register::<Tile>();\\n\\n world.register::<Object>();\\n\\n world.register::<BelongsToSegment>();\\n\\n world.register::<Segment>();\\n\\n world.register::<Portal>();\\n\\n world.register::<Obstacle>();\\n\\n world.register::<Coin>();\\n\",\n \"file_path\": \"src/states/startup.rs\",\n \"rank\": 17,\n \"score\": 42993.3249080268\n },\n {\n \"content\": \"pub fn run() -> amethyst::Result<()> {\\n\\n start_logger();\\n\\n\\n\\n let settings = Settings::load()?;\\n\\n let game_data = init_game_data::build_game_data(&settings)?;\\n\\n\\n\\n let Settings {\\n\\n camera: camera_settings,\\n\\n player: player_settings,\\n\\n objects: objects_settings,\\n\\n lanes: lanes_settings,\\n\\n zones: zones_settings,\\n\\n audio: audio_settings,\\n\\n savefile: savefile_settings,\\n\\n } = settings;\\n\\n\\n\\n let mut game: amethyst::CoreApplication<GameData> =\\n\\n ApplicationBuilder::new(application_root_dir()?, Startup::default())?\\n\\n .with_frame_limit_config(frame_rate_limit_config()?)\\n\\n .with_resource(camera_settings)\\n\",\n \"file_path\": \"src/init/mod.rs\",\n \"rank\": 18,\n \"score\": 42993.3249080268\n },\n {\n \"content\": \"fn load_savefile(world: &World) -> Savefile {\\n\\n let savefile =\\n\\n match world.read_resource::<SavefileSettings>().savefile_path() {\\n\\n Ok(savefile_path) => match Savefile::load(savefile_path) {\\n\\n Ok(savefile) => Some(savefile),\\n\\n Err(e) => {\\n\\n eprintln!(\\\"[WARNING]\\\\n {}\\\", e);\\n\\n None\\n\\n }\\n\\n },\\n\\n Err(e) => {\\n\\n eprintln!(\\\"[WARNING]\\\\n {}\\\", e);\\n\\n None\\n\\n }\\n\\n };\\n\\n savefile.unwrap_or_default()\\n\\n}\\n\",\n \"file_path\": \"src/states/startup.rs\",\n \"rank\": 19,\n \"score\": 42165.201164166385\n },\n {\n \"content\": \"// resources/settings/zones\\n\\n\\n\\nuse crate::resources::prelude::SongKey;\\n\\nuse deathframe::core::components::prelude::Merge;\\n\\nuse replace_with::replace_with_or_abort;\\n\\nuse std::collections::HashMap;\\n\\n\\n\\npub type ZoneId = String;\\n\\npub type SegmentId = String;\\n\\n\\n\\n#[derive(Deserialize, Default, Debug)]\\n\\n#[serde(deny_unknown_fields)]\\n\\npub struct ZonesSettings {\\n\\n #[serde(default)]\\n\\n pub config: ZonesConfig,\\n\\n #[serde(default)]\\n\\n pub zones: HashMap<ZoneId, ZoneSettings>,\\n\\n}\\n\\n\\n\\n#[derive(Deserialize, Default, Debug)]\\n\",\n \"file_path\": \"src/settings/zones_settings.rs\",\n \"rank\": 20,\n \"score\": 42098.00842541583\n },\n {\n \"content\": \"// resources/settings/objects.ron\\n\\n\\n\\nuse super::entity_components::EntityComponents;\\n\\nuse crate::level_loader::ObjectType;\\n\\nuse deathframe::components::prelude::Merge;\\n\\nuse std::collections::HashMap;\\n\\n\\n\",\n \"file_path\": \"src/settings/objects_settings.rs\",\n \"rank\": 21,\n \"score\": 42097.90811652406\n },\n {\n \"content\": \"// resources/settings/savefile.ron\\n\\n\\n\\nuse deathframe::amethyst;\\n\\nuse std::fs::create_dir_all;\\n\\nuse std::path::PathBuf;\\n\\n\\n\\n#[derive(Deserialize, Clone)]\\n\\n#[serde(deny_unknown_fields)]\\n\\npub struct SavefileSettings {\\n\\n pub savefile_name: String,\\n\\n}\\n\\n\\n\\nimpl SavefileSettings {\\n\\n pub fn savefile_path(&self) -> amethyst::Result<PathBuf> {\\n\\n const APP_NAME: &str = env!(\\\"CARGO_PKG_NAME\\\");\\n\\n\\n\\n if let Some(mut path) = dirs::data_local_dir() {\\n\\n path.push(APP_NAME);\\n\\n if !path.exists() {\\n\\n if let Err(e) = create_dir_all(&path) {\\n\",\n \"file_path\": \"src/settings/savefile_settings.rs\",\n \"rank\": 22,\n \"score\": 42097.706859172\n },\n {\n \"content\": \"use crate::resources::prelude::{SongKey, SoundKey};\\n\\nuse std::collections::HashMap;\\n\\n\\n\\n#[derive(Deserialize, Clone)]\\n\\n#[serde(deny_unknown_fields)]\\n\\npub struct AudioSettings {\\n\\n pub volume: f32,\\n\\n pub bgm: HashMap<SongKey, AudioBgmSettings>,\\n\\n pub sfx: HashMap<SoundKey, AudioSfxSettings>,\\n\\n}\\n\\n\\n\\n#[derive(Deserialize, Clone)]\\n\\n#[serde(deny_unknown_fields)]\\n\\npub struct AudioBgmSettings {\\n\\n pub file: String,\\n\\n}\\n\\n\\n\\n#[derive(Deserialize, Clone)]\\n\\n#[serde(deny_unknown_fields)]\\n\\npub struct AudioSfxSettings {\\n\\n pub file: String,\\n\\n}\\n\",\n \"file_path\": \"src/settings/audio_settings.rs\",\n \"rank\": 23,\n \"score\": 42097.55007595937\n },\n {\n \"content\": \"// resources/settings/player.ron\\n\\n\\n\\nuse super::entity_components::EntityComponents;\\n\\n\\n\\n#[derive(Deserialize, Clone)]\\n\\n#[serde(deny_unknown_fields)]\\n\\npub struct PlayerSettings {\\n\\n pub z: f32,\\n\\n pub components: EntityComponents,\\n\\n}\\n\",\n \"file_path\": \"src/settings/player_settings.rs\",\n \"rank\": 24,\n \"score\": 42097.34038637072\n },\n {\n \"content\": \"// resources/settings/camera.ron\\n\\n\\n\\nuse crate::components::prelude::Size;\\n\\n\\n\\n#[derive(Deserialize, Clone)]\\n\\n#[serde(deny_unknown_fields)]\\n\\npub struct CameraSettings {\\n\\n pub z: f32,\\n\\n pub size: Size,\\n\\n pub follow_offset: (f32, f32),\\n\\n}\\n\",\n \"file_path\": \"src/settings/camera_settings.rs\",\n \"rank\": 25,\n \"score\": 42097.203257852736\n },\n {\n \"content\": \" fn merge(&mut self, other: Self) {\\n\\n let ZonesSettings {\\n\\n config: other_config,\\n\\n zones: mut other_zones,\\n\\n } = other;\\n\\n replace_with_or_abort(self, |self_| {\\n\\n let mut zones = self_\\n\\n .zones\\n\\n .into_iter()\\n\\n .map(|(zone_id, zone_settings)| {\\n\\n let merged_zone_settings = if let Some(other_zone) =\\n\\n other_zones.remove(&zone_id)\\n\\n {\\n\\n zone_settings.merged(other_zone)\\n\\n } else {\\n\\n zone_settings\\n\\n };\\n\\n (zone_id, merged_zone_settings)\\n\\n })\\n\\n .collect::<HashMap<_, _>>();\\n\",\n \"file_path\": \"src/settings/zones_settings.rs\",\n \"rank\": 26,\n \"score\": 42094.99361274259\n },\n {\n \"content\": \"// resources/settings/lanes.ron\\n\\n\\n\\n#[derive(Deserialize, Clone)]\\n\\npub struct LanesSettings {\\n\\n pub count: usize,\\n\\n pub spacing: f32,\\n\\n}\\n\",\n \"file_path\": \"src/settings/lanes_settings.rs\",\n \"rank\": 27,\n \"score\": 42094.60524213148\n },\n {\n \"content\": \" arrays configured in multiple zone configs.\\\\n This \\\\\\n\\n will merge multiple `config.zone_order` arrays \\\\\\n\\n together.\\\\n This is probably not intended.\\\"\\n\\n );\\n\\n self.zone_order.append(&mut other_zone_order);\\n\\n }\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\nimpl Merge for ZoneSettings {\\n\\n fn merge(&mut self, other: Self) {\\n\\n let ZoneSettings {\\n\\n song: _,\\n\\n player_speed: _,\\n\\n is_skippable: _,\\n\\n total_segments: _,\\n\\n first_segment: _,\\n\\n final_segment: _,\\n\\n segments: _,\\n\",\n \"file_path\": \"src/settings/zones_settings.rs\",\n \"rank\": 28,\n \"score\": 42094.097196544804\n },\n {\n \"content\": \"#[serde(deny_unknown_fields)]\\n\\npub struct ZonesConfig {\\n\\n pub zone_order: Vec<ZoneId>,\\n\\n}\\n\\n\\n\\n#[derive(Deserialize, Debug)]\\n\\n#[serde(deny_unknown_fields)]\\n\\npub struct ZoneSettings {\\n\\n #[serde(default)]\\n\\n pub song: Option<SongKey>,\\n\\n pub player_speed: f32,\\n\\n #[serde(default)]\\n\\n pub is_skippable: bool,\\n\\n pub total_segments: Option<usize>,\\n\\n pub first_segment: Vec<SegmentId>,\\n\\n pub final_segment: Vec<SegmentId>,\\n\\n pub segments: HashMap<SegmentId, Vec<SegmentId>>,\\n\\n}\\n\\n\\n\\nimpl Merge for ZonesSettings {\\n\",\n \"file_path\": \"src/settings/zones_settings.rs\",\n \"rank\": 29,\n \"score\": 42093.66240690515\n },\n {\n \"content\": \" zones.extend(other_zones.into_iter());\\n\\n ZonesSettings {\\n\\n config: self_.config.merged(other_config),\\n\\n zones,\\n\\n }\\n\\n });\\n\\n }\\n\\n}\\n\\n\\n\\nimpl Merge for ZonesConfig {\\n\\n fn merge(&mut self, other: Self) {\\n\\n let ZonesConfig {\\n\\n zone_order: mut other_zone_order,\\n\\n } = other;\\n\\n if self.zone_order.is_empty() {\\n\\n self.zone_order = other_zone_order;\\n\\n } else {\\n\\n if !other_zone_order.is_empty() {\\n\\n eprintln!(\\n\\n \\\"[WARNING]\\\\n Careful, you have `config.zone_order` \\\\\\n\",\n \"file_path\": \"src/settings/zones_settings.rs\",\n \"rank\": 30,\n \"score\": 42093.268113592494\n },\n {\n \"content\": \" return Err(amethyst::Error::from_string(format!(\\n\\n \\\"Couldn't create data directory for \\\\\\n\\n savefile:\\\\n{:?}\\\\n{:?}\\\",\\n\\n &path, e\\n\\n )));\\n\\n }\\n\\n }\\n\\n path.push(&self.savefile_name);\\n\\n Ok(path)\\n\\n } else {\\n\\n Err(amethyst::Error::from_string(\\n\\n \\\"Couldn't find data directory for savefile\\\",\\n\\n ))\\n\\n }\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/settings/savefile_settings.rs\",\n \"rank\": 31,\n \"score\": 42090.608237189204\n },\n {\n \"content\": \" } = other;\\n\\n eprintln!(\\n\\n \\\"[WARNING]\\\\n Careful, you have the same `zones.<ZONE-ID>` \\\\\\n\\n configured in multiple zone configs.\\\\n This will NOT merge \\\\\\n\\n them together.\\\\n You should probably find and fix the \\\\\\n\\n duplicate configurations.\\\"\\n\\n );\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/settings/zones_settings.rs\",\n \"rank\": 32,\n \"score\": 42090.608237189204\n },\n {\n \"content\": \"pub fn enter_fullscreen(window: &Window) {\\n\\n let monitor_id = window.get_current_monitor();\\n\\n window.set_fullscreen(Some(monitor_id));\\n\\n window.hide_cursor(true);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/states/state_helpers.rs\",\n \"rank\": 33,\n \"score\": 41379.22887798081\n },\n {\n \"content\": \"pub fn toggle_fullscreen(window: &Window) {\\n\\n let is_fullscreen = window.get_fullscreen().is_some();\\n\\n if is_fullscreen {\\n\\n leave_fullscreen(window);\\n\\n } else {\\n\\n enter_fullscreen(window);\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/states/state_helpers.rs\",\n \"rank\": 34,\n \"score\": 41379.22887798081\n },\n {\n \"content\": \"pub fn leave_fullscreen(window: &Window) {\\n\\n window.set_fullscreen(None);\\n\\n window.hide_cursor(false);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/states/state_helpers.rs\",\n \"rank\": 35,\n \"score\": 41379.22887798081\n },\n {\n \"content\": \"fn frame_rate_limit_config() -> amethyst::Result<FrameRateLimitConfig> {\\n\\n use std::fs::File;\\n\\n Ok(ron::de::from_reader(File::open(resource(\\n\\n \\\"config/frame_limiter.ron\\\",\\n\\n ))?)?)\\n\\n}\\n\",\n \"file_path\": \"src/init/mod.rs\",\n \"rank\": 36,\n \"score\": 38598.43606783517\n },\n {\n \"content\": \"pub fn load_level(filepath: PathBuf) -> amethyst::Result<DataLevel> {\\n\\n let level_file = File::open(filepath)?;\\n\\n let level_data = serde_json::de::from_reader::<_, DataLevel>(level_file)?;\\n\\n Ok(level_data)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/level_loader/mod.rs\",\n \"rank\": 37,\n \"score\": 35847.56434609405\n },\n {\n \"content\": \"pub mod prelude {\\n\\n pub use super::audio_settings::AudioSettings;\\n\\n pub use super::camera_settings::CameraSettings;\\n\\n pub use super::lanes_settings::LanesSettings;\\n\\n pub use super::objects_settings::{ObjectSettings, ObjectsSettings};\\n\\n pub use super::player_settings::PlayerSettings;\\n\\n pub use super::savefile_settings::SavefileSettings;\\n\\n pub use super::zones_settings::{ZoneId, ZoneSettings, ZonesSettings};\\n\\n pub use super::Settings;\\n\\n}\\n\\n\\n\\npub mod audio_settings;\\n\\npub mod camera_settings;\\n\\npub mod entity_components;\\n\\npub mod hitbox_config;\\n\\npub mod lanes_settings;\\n\\npub mod objects_settings;\\n\\npub mod player_settings;\\n\\npub mod savefile_settings;\\n\\npub mod zones_settings;\\n\",\n \"file_path\": \"src/settings/mod.rs\",\n \"rank\": 38,\n \"score\": 35443.692116441205\n },\n {\n \"content\": \"\\n\\nuse crate::resource;\\n\\nuse deathframe::amethyst;\\n\\nuse deathframe::components::prelude::Merge;\\n\\nuse prelude::*;\\n\\nuse std::fmt;\\n\\nuse std::fs::File;\\n\\nuse std::path::PathBuf;\\n\\n\\n\\npub struct Settings {\\n\\n pub camera: CameraSettings,\\n\\n pub player: PlayerSettings,\\n\\n pub objects: ObjectsSettings,\\n\\n pub lanes: LanesSettings,\\n\\n pub zones: ZonesSettings,\\n\\n pub audio: AudioSettings,\\n\\n pub savefile: SavefileSettings,\\n\\n}\\n\\n\\n\\nimpl Settings {\\n\",\n \"file_path\": \"src/settings/mod.rs\",\n \"rank\": 39,\n \"score\": 35443.656144378365\n },\n {\n \"content\": \" pub fn load() -> deathframe::amethyst::Result<Self> {\\n\\n Ok(Self {\\n\\n lanes: load_settings(\\\"settings/lanes.ron\\\")?,\\n\\n camera: load_settings(\\\"settings/camera.ron\\\")?,\\n\\n player: load_settings(\\\"settings/player.ron\\\")?,\\n\\n objects: load_settings_dir(\\\"settings/objects\\\")?,\\n\\n zones: load_settings_dir(\\\"settings/zones\\\")?,\\n\\n audio: load_settings(\\\"settings/audio.ron\\\")?,\\n\\n savefile: load_settings(\\\"settings/savefile.ron\\\")?,\\n\\n })\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/settings/mod.rs\",\n \"rank\": 40,\n \"score\": 35439.59311810336\n },\n {\n \"content\": \"use crate::components::prelude::{Hitbox, Size};\\n\\nuse amethyst::ecs::{Builder, EntityBuilder};\\n\\nuse deathframe::amethyst;\\n\\nuse deathframe::core::geo::prelude::Rect;\\n\\n\\n\\n#[derive(Deserialize, Clone)]\\n\\npub enum HitboxConfig {\\n\\n Size,\\n\\n Custom(Hitbox),\\n\\n SizeOffset(Rect),\\n\\n}\\n\\n\\n\\nimpl HitboxConfig {\\n\\n pub fn add_hitbox_to_entity<'a>(\\n\\n &self,\\n\\n entity_builder: EntityBuilder<'a>,\\n\\n size_opt: Option<&Size>,\\n\\n ) -> EntityBuilder<'a> {\\n\\n match self {\\n\\n HitboxConfig::Size => {\\n\",\n \"file_path\": \"src/settings/hitbox_config.rs\",\n \"rank\": 41,\n \"score\": 34405.46575881045\n },\n {\n \"content\": \"use super::hitbox_config::HitboxConfig;\\n\\nuse crate::components::prelude::*;\\n\\nuse crate::resources::prelude::{AnimationKey, CollisionTag, SolidTag};\\n\\nuse amethyst::ecs::{Builder, EntityBuilder};\\n\\nuse deathframe::amethyst;\\n\\n\\n\\npub type EntityComponents = Vec<EntityComponent>;\\n\\n\\n\\n#[derive(Deserialize, Clone)]\\n\\npub enum EntityComponent {\\n\\n Velocity(Velocity),\\n\\n Size(Size),\\n\\n Gravity(Gravity),\\n\\n Animation(Animation),\\n\\n Animations(AnimationsContainer<AnimationKey>),\\n\\n BaseFriction(BaseFriction),\\n\\n Hitbox(HitboxConfig),\\n\\n Collider(Collider<CollisionTag>),\\n\\n Collidable(Collidable<CollisionTag>),\\n\\n Solid(Solid<SolidTag>),\\n\",\n \"file_path\": \"src/settings/entity_components.rs\",\n \"rank\": 42,\n \"score\": 34405.46193016587\n },\n {\n \"content\": \" if let Some(size) = size_opt {\\n\\n entity_builder.with(Hitbox::from(size))\\n\\n } else {\\n\\n panic!(\\\"HitboxConfig::Size entity doesn't have a Size\\\");\\n\\n }\\n\\n }\\n\\n HitboxConfig::Custom(hitbox) => entity_builder.with(hitbox.clone()),\\n\\n HitboxConfig::SizeOffset(padding) => {\\n\\n if let Some(size) = size_opt {\\n\\n let mut rect = Rect::from(size);\\n\\n rect.top += padding.top;\\n\\n rect.bottom += padding.bottom;\\n\\n rect.left += padding.left;\\n\\n rect.right += padding.right;\\n\\n entity_builder.with(Hitbox::from(rect))\\n\\n } else {\\n\\n panic!(\\n\\n \\\"HitboxConfig::SizePadding entity doesn't have a Size\\\"\\n\\n );\\n\\n }\\n\\n }\\n\\n }\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/settings/hitbox_config.rs\",\n \"rank\": 43,\n \"score\": 34401.56069252267\n },\n {\n \"content\": \" Comp::Animations(mut animations) => {\\n\\n let _ = animations.play(AnimationKey::Idle);\\n\\n builder.with(animations)\\n\\n }\\n\\n Comp::BaseFriction(base_friction) => builder.with(base_friction),\\n\\n Comp::Hitbox(hitbox) => {\\n\\n hitbox.add_hitbox_to_entity(builder, size_opt.as_ref())\\n\\n }\\n\\n Comp::Collider(collider) => builder.with(collider),\\n\\n Comp::Collidable(collidable) => builder.with(collidable),\\n\\n Comp::Solid(solid) => builder.with(solid),\\n\\n Comp::SolidPusher(solid_pusher) => builder.with(solid_pusher),\\n\\n Comp::SolidPushable(solid_pushable) => builder.with(solid_pushable),\\n\\n Comp::ScaleOnce(scale_once) => builder.with(scale_once),\\n\\n Comp::OnLane(on_lane) => builder.with(on_lane),\\n\\n Comp::Portal(portal) => builder.with(portal),\\n\\n Comp::Obstacle(obstacle) => builder.with(obstacle),\\n\\n Comp::Coin(coin) => builder.with(coin),\\n\\n Comp::Turret(turret) => builder.with(turret),\\n\\n Comp::Loadable(loadable) => {\\n\\n builder.with(loadable).with(Unloaded::default())\\n\\n }\\n\\n Comp::DeleteDelay(delete_delay) => builder.with(delete_delay),\\n\\n Comp::Rotate(rotate) => builder.with(rotate),\\n\\n Comp::Cutscene(cutscene) => builder.with(cutscene),\\n\\n })\\n\\n}\\n\",\n \"file_path\": \"src/settings/entity_components.rs\",\n \"rank\": 44,\n \"score\": 34401.56069252267\n },\n {\n \"content\": \" SolidPusher(SolidPusher),\\n\\n SolidPushable(SolidPushable),\\n\\n ScaleOnce(ScaleOnce),\\n\\n OnLane(OnLane),\\n\\n Portal(Portal),\\n\\n Obstacle(Obstacle),\\n\\n Coin(Coin),\\n\\n Turret(Turret),\\n\\n Loadable(Loadable),\\n\\n DeleteDelay(DeleteDelay),\\n\\n Rotate(Rotate),\\n\\n Cutscene(Cutscene),\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/settings/entity_components.rs\",\n \"rank\": 45,\n \"score\": 34401.56069252267\n },\n {\n \"content\": \"use super::data::*;\\n\\nuse super::ObjectType;\\n\\nuse crate::components::prelude::*;\\n\\nuse crate::resource;\\n\\nuse crate::settings::entity_components::add_components_to_entity;\\n\\nuse crate::settings::prelude::*;\\n\\nuse crate::settings::zones_settings::SegmentId;\\n\\nuse amethyst::ecs::{Builder, Entity, EntityBuilder, World, WorldExt};\\n\\nuse deathframe::amethyst;\\n\\nuse deathframe::core::geo::prelude::Axis;\\n\\nuse deathframe::resources::SpriteSheetHandles;\\n\\nuse std::path::PathBuf;\\n\\n\\n\",\n \"file_path\": \"src/level_loader/objects.rs\",\n \"rank\": 46,\n \"score\": 8.390125220967215\n },\n {\n \"content\": \"use crate::settings::prelude::SavefileSettings;\\n\\nuse crate::settings::prelude::ZoneId;\\n\\nuse deathframe::amethyst;\\n\\nuse std::collections::{HashMap, HashSet};\\n\\nuse std::fs::File;\\n\\nuse std::path::PathBuf;\\n\\n\\n\\n#[derive(Default, Serialize, Deserialize)]\\n\\npub struct Savefile {\\n\\n pub highscores: Highscores,\\n\\n pub unlocked: HashSet<ZoneId>,\\n\\n\\n\\n #[serde(skip)]\\n\\n should_save: bool,\\n\\n}\\n\\n\\n\\n#[derive(Default, Serialize, Deserialize)]\\n\\npub struct Highscores {\\n\\n pub progression: Option<Highscore>,\\n\\n pub infinite: HashMap<ZoneId, Highscore>,\\n\",\n \"file_path\": \"src/resources/savefile/mod.rs\",\n \"rank\": 47,\n \"score\": 8.125703759704038\n },\n {\n \"content\": \"use super::data::*;\\n\\nuse crate::components::prelude::*;\\n\\nuse crate::resource;\\n\\nuse crate::settings::zones_settings::SegmentId;\\n\\nuse amethyst::ecs::{Builder, Entity, World, WorldExt};\\n\\nuse deathframe::amethyst;\\n\\nuse deathframe::resources::SpriteSheetHandles;\\n\\nuse std::path::PathBuf;\\n\\n\\n\",\n \"file_path\": \"src/level_loader/tiles.rs\",\n \"rank\": 48,\n \"score\": 8.010321571180222\n },\n {\n \"content\": \"use crate::resource;\\n\\nuse crate::settings::Settings;\\n\\nuse crate::states::aliases::GameData;\\n\\nuse crate::states::prelude::Startup;\\n\\nuse amethyst::core::frame_limiter::FrameRateLimitConfig;\\n\\nuse amethyst::utils::app_root_dir::application_root_dir;\\n\\nuse amethyst::ApplicationBuilder;\\n\\nuse deathframe::amethyst;\\n\\n\\n\\nmod init_game_data;\\n\\n\\n\",\n \"file_path\": \"src/init/mod.rs\",\n \"rank\": 50,\n \"score\": 7.8122570897575265\n },\n {\n \"content\": \"use super::component_prelude::*;\\n\\nuse crate::settings::zones_settings::SegmentId;\\n\\n\\n\\n#[derive(Component)]\\n\\n#[storage(VecStorage)]\\n\\npub struct BelongsToSegment(pub SegmentId);\\n\",\n \"file_path\": \"src/components/belongs_to_segment.rs\",\n \"rank\": 51,\n \"score\": 7.653843852046629\n },\n {\n \"content\": \"pub mod data;\\n\\npub mod objects;\\n\\npub mod tiles;\\n\\n\\n\\nuse crate::components::prelude::Size;\\n\\nuse crate::resources::prelude::{ZoneSize, ZonesManager};\\n\\nuse crate::settings::zones_settings::{SegmentId, ZoneId, ZonesSettings};\\n\\nuse amethyst::ecs::{World, WorldExt};\\n\\nuse data::*;\\n\\nuse deathframe::amethyst;\\n\\nuse std::fs::File;\\n\\nuse std::path::PathBuf;\\n\\n\\n\\n#[derive(Deserialize, Clone)]\\n\\npub enum TileType {\\n\\n #[serde(rename = \\\"\\\")]\\n\\n Empty,\\n\\n}\\n\\n\\n\\n#[derive(Deserialize, PartialEq, Eq, Hash, Clone, Debug)]\\n\\npub enum ObjectType {\\n\\n Player,\\n\\n Solid,\\n\\n Portal,\\n\\n Obstacle,\\n\\n Coin(ZoneId),\\n\\n Custom(String),\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/level_loader/mod.rs\",\n \"rank\": 52,\n \"score\": 7.574271604248039\n },\n {\n \"content\": \"use crate::level_loader::data::DataLevel;\\n\\nuse crate::level_loader::load_level;\\n\\nuse crate::resource;\\n\\nuse crate::resources::prelude::SongKey;\\n\\nuse crate::settings::zones_settings::{SegmentId, ZoneId, ZonesSettings};\\n\\nuse rand::prelude::SliceRandom;\\n\\nuse replace_with::replace_with_or_abort;\\n\\nuse std::collections::HashMap;\\n\\n\\n\\nconst KEEP_COUNT_SEGMENTS_LOADED: usize = 2;\\n\\n\\n\\n#[derive(Default)]\\n\\npub struct ZonesManager {\\n\\n current_zone: Option<ZoneState>,\\n\\n initial_zone_idx: Option<usize>,\\n\\n is_infinite_zone: bool,\\n\\n last_staged_segment: Option<SegmentId>,\\n\\n staged_segments: Vec<SegmentId>,\\n\\n levels: HashMap<SegmentId, DataLevel>,\\n\\n segment_loading_locked: bool,\\n\\n}\\n\\n\\n\\n#[derive(Debug)]\\n\",\n \"file_path\": \"src/resources/zones_manager.rs\",\n \"rank\": 53,\n \"score\": 7.352643855591024\n },\n {\n \"content\": \"use super::component_prelude::*;\\n\\nuse crate::settings::zones_settings::SegmentId;\\n\\n\\n\\n#[derive(Component)]\\n\\n#[storage(VecStorage)]\\n\\npub struct Segment {\\n\\n pub id: SegmentId,\\n\\n pub is_first_segment: bool,\\n\\n pub is_final_segment: bool,\\n\\n}\\n\",\n \"file_path\": \"src/components/segment.rs\",\n \"rank\": 54,\n \"score\": 7.324088429099131\n },\n {\n \"content\": \"use crate::settings::prelude::LanesSettings;\\n\\n\\n\\npub struct Lanes {\\n\\n pub lanes: Vec<Lane>,\\n\\n}\\n\\n\\n\\npub struct Lane {\\n\\n pub x: f32,\\n\\n}\\n\\n\\n\\nimpl From<(&LanesSettings, f32)> for Lanes {\\n\\n fn from((settings, level_width): (&LanesSettings, f32)) -> Self {\\n\\n let center_x = level_width * 0.5;\\n\\n let total_lanes_width = settings.spacing * settings.count as f32;\\n\\n let half_lanes_width = total_lanes_width * 0.5;\\n\\n let half_lane_width = settings.spacing * 0.5;\\n\\n\\n\\n let lanes = (0 .. settings.count)\\n\\n .into_iter()\\n\\n .map(|i| Lane {\\n\\n x: center_x + (i as f32 * settings.spacing) - half_lanes_width\\n\\n + half_lane_width,\\n\\n })\\n\\n .collect();\\n\\n\\n\\n Self { lanes }\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/resources/lanes.rs\",\n \"rank\": 55,\n \"score\": 6.6238731607347\n },\n {\n \"content\": \"use crate::settings::prelude::ZoneId;\\n\\n\\n\\n#[derive(Default)]\\n\\npub struct SelectedZone(pub Option<(usize, ZoneId)>);\\n\",\n \"file_path\": \"src/resources/selected_zone.rs\",\n \"rank\": 56,\n \"score\": 6.538593033205714\n },\n {\n \"content\": \" fn load_zone(&mut self, world: &mut World) {\\n\\n let mut player_speed_opt = None;\\n\\n\\n\\n {\\n\\n use deathframe::amethyst::ecs::{ReadExpect, WriteExpect};\\n\\n\\n\\n world.exec(\\n\\n |(\\n\\n mut zones_manager,\\n\\n settings,\\n\\n mut songs,\\n\\n savefile_settings,\\n\\n mut savefile,\\n\\n ): (\\n\\n WriteExpect<ZonesManager>,\\n\\n ReadExpect<ZonesSettings>,\\n\\n WriteExpect<Songs<SongKey>>,\\n\\n ReadExpect<SavefileSettings>,\\n\\n WriteExpect<Savefile>,\\n\\n )| {\\n\",\n \"file_path\": \"src/states/ingame.rs\",\n \"rank\": 57,\n \"score\": 6.4358998292679725\n },\n {\n \"content\": \"\\n\\npub mod aliases {\\n\\n use crate::resources::prelude::DispatcherId;\\n\\n use deathframe::core::custom_game_data::prelude::*;\\n\\n\\n\\n pub type CustomData = ();\\n\\n\\n\\n pub type GameData<'a, 'b> =\\n\\n CustomGameData<'a, 'b, DispatcherId, CustomData>;\\n\\n\\n\\n pub type GameDataBuilder<'a, 'b> =\\n\\n CustomGameDataBuilder<'a, 'b, DispatcherId, CustomData>;\\n\\n}\\n\\n\\n\\nmod state_prelude {\\n\\n pub use super::aliases::*;\\n\\n pub use super::prelude::*;\\n\\n pub use super::state_helpers::*;\\n\\n pub use crate::resource;\\n\\n pub use crate::resources::prelude::*;\\n\\n pub use crate::settings::prelude::*;\\n\\n pub use deathframe::states::state_prelude::*;\\n\\n}\\n\\n\\n\\nmod menu_prelude {\\n\\n pub use deathframe::amethyst::ui::{UiEvent, UiEventType};\\n\\n pub use deathframe::core::menu::prelude::*;\\n\\n}\\n\",\n \"file_path\": \"src/states/mod.rs\",\n \"rank\": 58,\n \"score\": 6.169196797988084\n },\n {\n \"content\": \"use super::system_prelude::*;\\n\\n\\n\\n#[derive(Default)]\\n\\npub struct HandleZoneSelect;\\n\\n\\n\\nimpl<'a> System<'a> for HandleZoneSelect {\\n\\n type SystemData = (\\n\\n ReadExpect<'a, InputManager<MenuBindings>>,\\n\\n ReadExpect<'a, ZonesSettings>,\\n\\n Write<'a, SelectedZone>,\\n\\n ReadExpect<'a, Savefile>,\\n\\n );\\n\\n\\n\\n fn run(\\n\\n &mut self,\\n\\n (\\n\\n input_manager,\\n\\n settings,\\n\\n mut selected_zone,\\n\\n savefile,\\n\",\n \"file_path\": \"src/systems/handle_zone_select.rs\",\n \"rank\": 59,\n \"score\": 6.0627299657871845\n },\n {\n \"content\": \"\\n\\nimpl<'a, 'b> State<GameData<'a, 'b>, StateEvent> for ZoneTransition {\\n\\n fn on_start(&mut self, mut data: StateData<GameData<'a, 'b>>) {\\n\\n self.start(&mut data);\\n\\n\\n\\n {\\n\\n use deathframe::amethyst::ecs::{ReadExpect, WriteExpect};\\n\\n\\n\\n data.world.exec(\\n\\n |(mut zones_manager, zones_settings): (\\n\\n WriteExpect<ZonesManager>,\\n\\n ReadExpect<ZonesSettings>,\\n\\n )| {\\n\\n zones_manager.stage_next_zone(&zones_settings);\\n\\n },\\n\\n )\\n\\n }\\n\\n }\\n\\n\\n\\n fn on_resume(&mut self, mut data: StateData<GameData<'a, 'b>>) {\\n\",\n \"file_path\": \"src/states/zone_transition.rs\",\n \"rank\": 60,\n \"score\": 5.965678061123347\n },\n {\n \"content\": \" pub use super::handle_delete_delay::HandleDeleteDelay;\\n\\n pub use super::handle_obstacle::HandleObstacle;\\n\\n pub use super::handle_parent_delete::HandleParentDelete;\\n\\n pub use super::handle_segment_loading::HandleSegmentLoading;\\n\\n pub use super::handle_turret::HandleTurret;\\n\\n pub use super::handle_zone_select::HandleZoneSelect;\\n\\n pub use super::handle_zone_switch::HandleZoneSwitch;\\n\\n pub use super::update_highscore_ui::UpdateHighscoreUi;\\n\\n pub use super::update_on_lane::UpdateOnLane;\\n\\n pub use super::update_rotate::UpdateRotate;\\n\\n pub use super::update_score_ui::UpdateScoreUi;\\n\\n pub use super::update_selected_zone_ui::UpdateSelectedZoneUi;\\n\\n pub use deathframe::systems::prelude::*;\\n\\n}\\n\\n\\n\\nmod system_prelude {\\n\\n pub use crate::components::prelude::*;\\n\\n pub use crate::input::prelude::*;\\n\\n pub use crate::resources::prelude::*;\\n\\n pub use crate::settings::prelude::*;\\n\\n pub use deathframe::core::geo::prelude::*;\\n\\n pub use deathframe::systems::system_prelude::*;\\n\\n}\\n\",\n \"file_path\": \"src/systems/mod.rs\",\n \"rank\": 61,\n \"score\": 5.91090618982883\n },\n {\n \"content\": \" data.world.insert(ZoneSize::default());\\n\\n data.world.insert(ShouldLoadNextZone::default());\\n\\n data.world.insert(GameOver::default());\\n\\n data.world.insert(Score::default());\\n\\n\\n\\n {\\n\\n let lanes = Lanes::from((\\n\\n &*data.world.read_resource::<LanesSettings>(),\\n\\n SEGMENT_WIDTH,\\n\\n ));\\n\\n data.world.insert(lanes);\\n\\n }\\n\\n\\n\\n {\\n\\n use deathframe::amethyst::ecs::{ReadExpect, WriteExpect};\\n\\n\\n\\n data.world.exec(\\n\\n |(mut zones_manager, settings): (\\n\\n WriteExpect<ZonesManager>,\\n\\n ReadExpect<ZonesSettings>,\\n\",\n \"file_path\": \"src/states/ingame.rs\",\n \"rank\": 62,\n \"score\": 5.908676641088537\n },\n {\n \"content\": \"extern crate climer;\\n\\nextern crate deathframe;\\n\\nextern crate dirs;\\n\\nextern crate rand;\\n\\nextern crate replace_with;\\n\\nextern crate ron;\\n\\n#[macro_use]\\n\\nextern crate serde;\\n\\nextern crate serde_json;\\n\\n\\n\\nmod components;\\n\\nmod init;\\n\\nmod input;\\n\\nmod level_loader;\\n\\nmod resources;\\n\\nmod settings;\\n\\nmod states;\\n\\nmod systems;\\n\\n\\n\\npub use deathframe::core::resource_helper::resource;\\n\\n\\n\",\n \"file_path\": \"src/main.rs\",\n \"rank\": 63,\n \"score\": 5.7282927833961566\n },\n {\n \"content\": \"use super::system_prelude::*;\\n\\n\\n\\n#[derive(Default)]\\n\\npub struct HandleSegmentLoading;\\n\\n\\n\\nimpl<'a> System<'a> for HandleSegmentLoading {\\n\\n type SystemData = (\\n\\n Entities<'a>,\\n\\n WriteExpect<'a, ZonesManager>,\\n\\n ReadExpect<'a, ZonesSettings>,\\n\\n ReadStorage<'a, Camera>,\\n\\n ReadStorage<'a, Segment>,\\n\\n ReadStorage<'a, Transform>,\\n\\n ReadStorage<'a, Size>,\\n\\n );\\n\\n\\n\\n fn run(\\n\\n &mut self,\\n\\n (\\n\\n entities,\\n\",\n \"file_path\": \"src/systems/handle_segment_loading.rs\",\n \"rank\": 64,\n \"score\": 5.271385204277562\n },\n {\n \"content\": \" .with_resource(player_settings)\\n\\n .with_resource(objects_settings)\\n\\n .with_resource(lanes_settings)\\n\\n .with_resource(zones_settings)\\n\\n .with_resource(audio_settings)\\n\\n .with_resource(savefile_settings)\\n\\n .build(game_data)?;\\n\\n\\n\\n game.run();\\n\\n\\n\\n Ok(())\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/init/mod.rs\",\n \"rank\": 65,\n \"score\": 4.580522909023876\n },\n {\n \"content\": \" .map(|zone_settings| zone_settings.player_speed)\\n\\n }\\n\\n\\n\\n pub fn is_current_zone_skippable(\\n\\n &self,\\n\\n settings: &ZonesSettings,\\n\\n ) -> Option<bool> {\\n\\n if self.is_infinite_zone {\\n\\n Some(false)\\n\\n } else {\\n\\n self.current_zone\\n\\n .as_ref()\\n\\n .and_then(|current_zone| settings.zones.get(¤t_zone.id))\\n\\n .map(|zone_settings| zone_settings.is_skippable)\\n\\n }\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/resources/zones_manager.rs\",\n \"rank\": 66,\n \"score\": 4.530562666553377\n },\n {\n \"content\": \" pub use super::cutscene::Cutscene;\\n\\n pub use super::delete_delay::DeleteDelay;\\n\\n pub use super::object::Object;\\n\\n pub use super::obstacle::Obstacle;\\n\\n pub use super::on_lane::OnLane;\\n\\n pub use super::parent_delete::ParentDelete;\\n\\n pub use super::player::Player;\\n\\n pub use super::portal::Portal;\\n\\n pub use super::rotate::Rotate;\\n\\n pub use super::segment::Segment;\\n\\n pub use super::tile::Tile;\\n\\n pub use super::turret::Turret;\\n\\n pub use deathframe::amethyst::core::transform::Parent;\\n\\n pub use deathframe::components::prelude::*;\\n\\n}\\n\\n\\n\\nmod component_prelude {\\n\\n pub use super::prelude::*;\\n\\n pub use deathframe::components::component_prelude::*;\\n\\n}\\n\",\n \"file_path\": \"src/components/mod.rs\",\n \"rank\": 67,\n \"score\": 4.524326462039251\n },\n {\n \"content\": \" })\\n\\n }\\n\\n\\n\\n pub fn get_current_song<'a>(\\n\\n &self,\\n\\n settings: &'a ZonesSettings,\\n\\n ) -> Option<&'a SongKey> {\\n\\n self.current_zone\\n\\n .as_ref()\\n\\n .and_then(|current_zone| settings.zones.get(¤t_zone.id))\\n\\n .and_then(|zone_settings| zone_settings.song.as_ref())\\n\\n }\\n\\n\\n\\n pub fn get_current_player_speed(\\n\\n &self,\\n\\n settings: &ZonesSettings,\\n\\n ) -> Option<f32> {\\n\\n self.current_zone\\n\\n .as_ref()\\n\\n .and_then(|current_zone| settings.zones.get(¤t_zone.id))\\n\",\n \"file_path\": \"src/resources/zones_manager.rs\",\n \"rank\": 68,\n \"score\": 4.501170941338993\n },\n {\n \"content\": \" );\\n\\n }\\n\\n }\\n\\n\\n\\n fn get_next_segment(&self, settings: &ZonesSettings) -> Option<SegmentId> {\\n\\n if self.segment_loading_locked {\\n\\n return None;\\n\\n }\\n\\n\\n\\n let mut rng = rand::thread_rng();\\n\\n self.current_zone\\n\\n .as_ref()\\n\\n .and_then(|current_zone| {\\n\\n settings\\n\\n .zones\\n\\n .get(¤t_zone.id)\\n\\n .map(|settings| (current_zone, settings))\\n\\n })\\n\\n .map(|(current_zone, zone_settings)| {\\n\\n let should_load_next_zone = zone_settings\\n\",\n \"file_path\": \"src/resources/zones_manager.rs\",\n \"rank\": 69,\n \"score\": 4.4632102000735525\n },\n {\n \"content\": \" let object_settings = {\\n\\n let settings = world.read_resource::<ObjectsSettings>();\\n\\n settings.objects.get(object_type).map(|s| s.clone())\\n\\n };\\n\\n\\n\\n if let Some(object_settings) = object_settings {\\n\\n let sprite_render_opt = if let Some(spritesheet) =\\n\\n object_settings.spritesheet.as_ref()\\n\\n {\\n\\n let sprite_sheet = world\\n\\n .write_resource::<SpriteSheetHandles<PathBuf>>()\\n\\n .get_or_load(\\n\\n resource(format!(\\\"spritesheets/{}\\\", spritesheet)),\\n\\n world,\\n\\n );\\n\\n Some({\\n\\n SpriteRender {\\n\\n sprite_sheet,\\n\\n sprite_number: 0,\\n\\n }\\n\",\n \"file_path\": \"src/level_loader/objects.rs\",\n \"rank\": 70,\n \"score\": 4.4632102000735525\n },\n {\n \"content\": \"pub mod prelude {\\n\\n pub use super::animation_key::AnimationKey;\\n\\n pub use super::collision_tag::{CollisionTag, SolidTag};\\n\\n pub use super::dispatcher_id::DispatcherId;\\n\\n pub use super::game_over::GameOver;\\n\\n pub use super::lanes::{Lane, Lanes};\\n\\n pub use super::object_spawner::{ObjectSpawner, ObjectToSpawn};\\n\\n pub use super::savefile::{Highscore, Highscores, Savefile};\\n\\n pub use super::score::Score;\\n\\n pub use super::selected_zone::SelectedZone;\\n\\n pub use super::should_load_next_zone::ShouldLoadNextZone;\\n\\n pub use super::song_key::SongKey;\\n\\n pub use super::sound_key::SoundKey;\\n\\n pub use super::zone_progression_mode::ZoneProgressionMode;\\n\\n pub use super::zone_size::ZoneSize;\\n\\n pub use super::zones_manager::ZonesManager;\\n\\n pub use deathframe::resources::prelude::*;\\n\\n}\\n\\n\\n\\nmod animation_key;\\n\",\n \"file_path\": \"src/resources/mod.rs\",\n \"rank\": 71,\n \"score\": 4.413194167842804\n },\n {\n \"content\": \"mod cutscene;\\n\\nmod game_over_state;\\n\\nmod ingame;\\n\\nmod main_menu;\\n\\nmod pause;\\n\\nmod startup;\\n\\nmod state_helpers;\\n\\nmod zone_select;\\n\\nmod zone_transition;\\n\\n\\n\\npub mod prelude {\\n\\n pub use super::cutscene::Cutscene;\\n\\n pub use super::game_over_state::GameOverState;\\n\\n pub use super::ingame::Ingame;\\n\\n pub use super::main_menu::MainMenu;\\n\\n pub use super::pause::Pause;\\n\\n pub use super::startup::Startup;\\n\\n pub use super::zone_select::ZoneSelect;\\n\\n pub use super::zone_transition::ZoneTransition;\\n\\n}\\n\",\n \"file_path\": \"src/states/mod.rs\",\n \"rank\": 72,\n \"score\": 4.2386060417002085\n },\n {\n \"content\": \" Err(e) => {\\n\\n eprintln!(\\n\\n \\\"[WARNING]\\\\n Couldn't load segment {}!\\\\n{}\\\",\\n\\n &segment, e\\n\\n )\\n\\n }\\n\\n }\\n\\n }\\n\\n }\\n\\n\\n\\n pub fn stage_next_zone(&mut self, settings: &ZonesSettings) {\\n\\n if let Some((next_zone, next_order_idx)) = self.get_next_zone(settings)\\n\\n {\\n\\n self.reset();\\n\\n self.current_zone = Some(ZoneState::new(next_zone, next_order_idx));\\n\\n self.load_all_segments(settings);\\n\\n } else {\\n\\n eprintln!(\\\"[WARNING]\\\\n There is no next zone to load!\\\");\\n\\n }\\n\\n }\\n\",\n \"file_path\": \"src/resources/zones_manager.rs\",\n \"rank\": 73,\n \"score\": 4.108358676657278\n },\n {\n \"content\": \" object_settings.components.clone(),\\n\\n size_opt,\\n\\n );\\n\\n\\n\\n Some(entity_builder)\\n\\n } else {\\n\\n eprintln!(\\n\\n \\\"[WARNING]\\\\n No settings for object: {:?}\\\",\\n\\n object_type\\n\\n );\\n\\n None\\n\\n }\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/level_loader/objects.rs\",\n \"rank\": 74,\n \"score\": 4.092350301061282\n },\n {\n \"content\": \"use amethyst::renderer::rendy::wsi::winit::Window;\\n\\nuse deathframe::amethyst;\\n\\n\\n\",\n \"file_path\": \"src/states/state_helpers.rs\",\n \"rank\": 75,\n \"score\": 4.066435153209763\n },\n {\n \"content\": \" {\\n\\n zones_manager.stage_initial_segments(&settings);\\n\\n player_speed_opt =\\n\\n zones_manager.get_current_player_speed(&settings);\\n\\n if let Some(is_skippable) =\\n\\n zones_manager.is_current_zone_skippable(&settings)\\n\\n {\\n\\n self.is_zone_skippable = is_skippable;\\n\\n }\\n\\n songs.stop_all();\\n\\n if let Some(song_key) =\\n\\n zones_manager.get_current_song(&settings)\\n\\n {\\n\\n songs.play(song_key);\\n\\n }\\n\\n }\\n\\n\\n\\n {\\n\\n if let Some(zone) = zones_manager.current_zone() {\\n\\n savefile.unlock(zone.clone());\\n\",\n \"file_path\": \"src/states/ingame.rs\",\n \"rank\": 76,\n \"score\": 4.035871855552555\n },\n {\n \"content\": \"use super::menu_prelude::*;\\n\\nuse super::state_prelude::*;\\n\\nuse crate::components::prelude::Size;\\n\\nuse crate::input::prelude::{MenuAction, MenuBindings};\\n\\nuse crate::level_loader::objects::build_camera;\\n\\nuse crate::level_loader::{build_level, load_level};\\n\\n\\n\\n#[derive(Default)]\\n\\npub struct Cutscene {\\n\\n ui_data: UiData,\\n\\n did_load_level: bool,\\n\\n did_load_cutscene: bool,\\n\\n}\\n\\n\\n\\nimpl Cutscene {\\n\\n fn start<'a, 'b>(&mut self, data: &mut StateData<GameData<'a, 'b>>) {\\n\\n self.create_ui(data, resource(\\\"ui/cutscene.ron\\\").to_str().unwrap());\\n\\n }\\n\\n\\n\\n fn stop<'a, 'b>(&mut self, data: &mut StateData<GameData<'a, 'b>>) {\\n\",\n \"file_path\": \"src/states/cutscene.rs\",\n \"rank\": 77,\n \"score\": 4.022840966759144\n },\n {\n \"content\": \"use super::menu_prelude::*;\\n\\nuse super::state_prelude::*;\\n\\nuse crate::components::prelude::{Size, Transform};\\n\\nuse crate::input::prelude::{MenuAction, MenuBindings};\\n\\nuse crate::level_loader::build_segment;\\n\\nuse crate::level_loader::objects::{build_camera, build_object, build_player};\\n\\n\\n\\nconst SEGMENT_WIDTH: f32 = 128.0;\\n\\nconst UI_SKIP_TEXT_ID: &str = \\\"skip_zone_text\\\";\\n\\nconst UI_SCORE_ID: &str = \\\"score\\\";\\n\\n\\n\\npub struct Ingame {\\n\\n initial_zone_idx: Option<usize>,\\n\\n is_infinite_zone: bool,\\n\\n load_new_zone_on_resume: bool,\\n\\n ui_data: UiData,\\n\\n is_zone_skippable: bool,\\n\\n}\\n\\n\\n\\nimpl Default for Ingame {\\n\",\n \"file_path\": \"src/states/ingame.rs\",\n \"rank\": 78,\n \"score\": 3.9989638226160755\n },\n {\n \"content\": \"\\n\\n fn get_next_zone(\\n\\n &self,\\n\\n settings: &ZonesSettings,\\n\\n ) -> Option<(ZoneId, usize)> {\\n\\n if let Some(current_zone) = self.current_zone.as_ref() {\\n\\n let order_idx = current_zone.order_idx + 1;\\n\\n settings\\n\\n .config\\n\\n .zone_order\\n\\n .get(order_idx)\\n\\n .map(|next| (next, order_idx))\\n\\n } else {\\n\\n if let Some(&initial_zone_idx) = self.initial_zone_idx.as_ref() {\\n\\n settings\\n\\n .config\\n\\n .zone_order\\n\\n .get(initial_zone_idx)\\n\\n .map(|initial_zone| (initial_zone, initial_zone_idx))\\n\\n } else {\\n\",\n \"file_path\": \"src/resources/zones_manager.rs\",\n \"rank\": 79,\n \"score\": 3.9544715661755125\n },\n {\n \"content\": \" }\\n\\n\\n\\n pub fn handle_save(&mut self, settings: &SavefileSettings) {\\n\\n if self.should_save() {\\n\\n match settings.savefile_path() {\\n\\n Ok(savefile_path) => {\\n\\n if let Err(e) = self.save(savefile_path) {\\n\\n eprintln!(\\\"[WARNING]\\\\n {}\\\", e);\\n\\n }\\n\\n }\\n\\n Err(e) => eprintln!(\\\"[WARNING]\\\\n {}\\\", e),\\n\\n }\\n\\n }\\n\\n }\\n\\n\\n\\n pub fn unlock(&mut self, zone: ZoneId) -> bool {\\n\\n let did_update = self.unlocked.insert(zone);\\n\\n if did_update {\\n\\n self.should_save = true;\\n\\n }\\n\",\n \"file_path\": \"src/resources/savefile/mod.rs\",\n \"rank\": 80,\n \"score\": 3.93818167472737\n },\n {\n \"content\": \" use deathframe::amethyst::assets::AssetStorage;\\n\\n use deathframe::amethyst::ecs::{\\n\\n Join,\\n\\n Read,\\n\\n ReadStorage,\\n\\n WriteStorage,\\n\\n };\\n\\n use deathframe::amethyst::renderer::sprite::SpriteSheet;\\n\\n use deathframe::amethyst::renderer::Texture;\\n\\n\\n\\n if self.did_load_level && !self.did_load_cutscene {\\n\\n data.world.exec(\\n\\n |(\\n\\n spritesheet_assets,\\n\\n texture_assets,\\n\\n cutscene_store,\\n\\n mut animations_store,\\n\\n sprite_render_store,\\n\\n ): (\\n\\n Read<AssetStorage<SpriteSheet>>,\\n\",\n \"file_path\": \"src/states/cutscene.rs\",\n \"rank\": 81,\n \"score\": 3.927832111495411\n },\n {\n \"content\": \" object.object_type,\\n\\n transform,\\n\\n object.size.map(Into::into),\\n\\n ) {\\n\\n entity_builder.build();\\n\\n }\\n\\n }\\n\\n }\\n\\n }\\n\\n\\n\\n fn handle_skippable_zone(&self, world: &mut World) {\\n\\n use deathframe::amethyst::core::HiddenPropagate;\\n\\n use deathframe::amethyst::ecs::{\\n\\n Entities,\\n\\n Join,\\n\\n ReadStorage,\\n\\n WriteStorage,\\n\\n };\\n\\n use deathframe::amethyst::ui::UiTransform;\\n\\n\\n\",\n \"file_path\": \"src/states/ingame.rs\",\n \"rank\": 82,\n \"score\": 3.911464089018892\n },\n {\n \"content\": \" self.stage_next_segment(settings);\\n\\n }\\n\\n }\\n\\n\\n\\n pub fn stage_next_segment(&mut self, settings: &ZonesSettings) {\\n\\n if let Some(next_segment) = self.get_next_segment(settings) {\\n\\n self.current_zone\\n\\n .as_mut()\\n\\n .expect(\\n\\n \\\"Should have current zone, if next segment could be found\\\",\\n\\n )\\n\\n .total_segments_loaded += 1;\\n\\n self.last_staged_segment = Some(next_segment.clone());\\n\\n self.staged_segments.push(next_segment);\\n\\n } else {\\n\\n self.last_staged_segment = None;\\n\\n eprintln!(\\n\\n \\\"[WARNING]\\\\n ZonesManager couldn't find possible next \\\\\\n\\n segment, for zone and segment: {:?} {:?}\\\",\\n\\n &self.current_zone, &self.last_staged_segment\\n\",\n \"file_path\": \"src/resources/zones_manager.rs\",\n \"rank\": 83,\n \"score\": 3.8983102924001285\n },\n {\n \"content\": \"pub mod prelude {\\n\\n pub use super::ingame_bindings::*;\\n\\n pub use super::menu_bindings::*;\\n\\n}\\n\\n\\n\\nmod ingame_bindings;\\n\\nmod menu_bindings;\\n\",\n \"file_path\": \"src/input/mod.rs\",\n \"rank\": 84,\n \"score\": 3.856927506606352\n },\n {\n \"content\": \" );\\n\\n None\\n\\n }\\n\\n },\\n\\n )\\n\\n }\\n\\n\\n\\n fn load_all_segments(&mut self, settings: &ZonesSettings) {\\n\\n if let Some(segments) = self\\n\\n .current_zone\\n\\n .as_ref()\\n\\n .and_then(|zone| settings.zones.get(&zone.id))\\n\\n .map(|zone| {\\n\\n let mut segments = zone\\n\\n .segments\\n\\n .keys()\\n\\n .map(Clone::clone)\\n\\n .collect::<Vec<SegmentId>>();\\n\\n segments.append(&mut zone.first_segment.clone());\\n\\n segments.append(&mut zone.final_segment.clone());\\n\",\n \"file_path\": \"src/resources/zones_manager.rs\",\n \"rank\": 85,\n \"score\": 3.835462309663696\n },\n {\n \"content\": \"use super::menu_prelude::*;\\n\\nuse super::state_prelude::*;\\n\\nuse crate::input::prelude::{MenuAction, MenuBindings};\\n\\n\\n\\n#[derive(Default)]\\n\\npub struct GameOverState {\\n\\n ui_data: UiData,\\n\\n}\\n\\n\\n\\nimpl GameOverState {\\n\\n fn start<'a, 'b>(&mut self, data: &mut StateData<GameData<'a, 'b>>) {\\n\\n self.create_ui(data, resource(\\\"ui/game_over.ron\\\").to_str().unwrap());\\n\\n self.update_highscore(data.world);\\n\\n }\\n\\n\\n\\n fn update_highscore(&self, world: &mut World) {\\n\\n use deathframe::amethyst::ecs::{Read, ReadExpect, WriteExpect};\\n\\n\\n\\n world.exec(\\n\\n |(\\n\",\n \"file_path\": \"src/states/game_over_state.rs\",\n \"rank\": 86,\n \"score\": 3.784425786064457\n },\n {\n \"content\": \" .total_segments\\n\\n .map(|total_segments| {\\n\\n self.is_infinite_zone\\n\\n || current_zone.total_segments_loaded\\n\\n < total_segments\\n\\n })\\n\\n .unwrap_or(true);\\n\\n if should_load_next_zone {\\n\\n self.last_staged_segment\\n\\n .as_ref()\\n\\n .and_then(|current_segment| {\\n\\n zone_settings.segments.get(current_segment)\\n\\n })\\n\\n .unwrap_or(&zone_settings.first_segment)\\n\\n } else {\\n\\n &zone_settings.final_segment\\n\\n }\\n\\n })\\n\\n .and_then(|possible_segments| {\\n\\n possible_segments.choose(&mut rng).map(ToString::to_string)\\n\",\n \"file_path\": \"src/resources/zones_manager.rs\",\n \"rank\": 87,\n \"score\": 3.7653120127640265\n },\n {\n \"content\": \"use super::component_prelude::*;\\n\\nuse crate::level_loader::ObjectType;\\n\\nuse climer::Timer;\\n\\nuse std::time::Duration;\\n\\n\\n\\n#[derive(Component, Clone, Deserialize)]\\n\\n#[storage(DenseVecStorage)]\\n\\npub struct Turret {\\n\\n pub shot_object_type: ObjectType,\\n\\n pub shot_interval_ms: u64,\\n\\n #[serde(default)]\\n\\n pub shot_initial_delay_ms: u64,\\n\\n #[serde(default)]\\n\\n pub shot_offset: (f32, f32),\\n\\n #[serde(skip)]\\n\\n shot_timer: Option<Timer>,\\n\\n}\\n\\n\\n\\nimpl Turret {\\n\\n pub fn get_timer(&mut self) -> &mut Timer {\\n\",\n \"file_path\": \"src/components/turret.rs\",\n \"rank\": 88,\n \"score\": 3.7632875163662955\n },\n {\n \"content\": \"# DRIFTDOWN EZ MODE\\n\\nAlternate settings files to make the game easier. \\n\\nIntended for people who find the default settings too difficult, \\n\\nbut still want to experience the full game. \\n\\n\\n\\n## `EZ_ZONES`\\n\\n[`./ez_zones.ron`](./ez_zones.ron) \\n\\n\\n\\nOverwrite `resources/settings/zones/zones.ron` with the `ez_zones.ron` file.\\n\\n\\n\\n- Makes every zone skippable.\\n\\n- Decreases the total level segments in each zone.\\n\\n- Decreases the player speed in each zone.\\n\",\n \"file_path\": \"ez_mode/README.md\",\n \"rank\": 89,\n \"score\": 3.7515887614730565\n },\n {\n \"content\": \" if let Some(song) = songs.get_mut(song_key) {\\n\\n song.set_volume(audio_settings.volume);\\n\\n }\\n\\n }\\n\\n Err(e) => eprintln!(\\n\\n \\\"[WARNING]\\\\n Error loading song {}, skipping.\\\\n{:#?}\\\",\\n\\n &song.file, e\\n\\n ),\\n\\n }\\n\\n }\\n\\n\\n\\n let mut sounds = Sounds::<SoundKey>::default();\\n\\n for (sound_key, sound) in audio_settings.sfx.iter() {\\n\\n if let Err(e) = sounds.load_audio(\\n\\n sound_key.clone(),\\n\\n resource(format!(\\\"audio/sfx/{}\\\", sound.file)),\\n\\n world,\\n\\n ) {\\n\\n eprintln!(\\n\\n \\\"[WARNING]\\\\n Error loading sound {}, skipping.\\\\n{:#?}\\\",\\n\",\n \"file_path\": \"src/states/startup.rs\",\n \"rank\": 90,\n \"score\": 3.711012713717892\n },\n {\n \"content\": \"use super::system_prelude::*;\\n\\nuse deathframe::physics::query;\\n\\nuse query::prelude::{FilterQuery, Query};\\n\\n\\n\\n#[derive(Default)]\\n\\npub struct HandleCoinCollection;\\n\\n\\n\\nimpl<'a> System<'a> for HandleCoinCollection {\\n\\n type SystemData = (\\n\\n Entities<'a>,\\n\\n WriteExpect<'a, Score>,\\n\\n WriteExpect<'a, SoundPlayer<SoundKey>>,\\n\\n ReadStorage<'a, Player>,\\n\\n ReadStorage<'a, Coin>,\\n\\n ReadStorage<'a, Collider<CollisionTag>>,\\n\\n );\\n\\n\\n\\n fn run(\\n\\n &mut self,\\n\\n (\\n\",\n \"file_path\": \"src/systems/handle_coin_collection.rs\",\n \"rank\": 91,\n \"score\": 3.6968429990404617\n },\n {\n \"content\": \"use super::system_prelude::*;\\n\\nuse deathframe::physics::query;\\n\\nuse query::prelude::{FindQuery, Query};\\n\\n\\n\\n#[derive(Default)]\\n\\npub struct HandleZoneSwitch;\\n\\n\\n\\nimpl<'a> System<'a> for HandleZoneSwitch {\\n\\n type SystemData = (\\n\\n WriteExpect<'a, ShouldLoadNextZone>,\\n\\n ReadStorage<'a, Player>,\\n\\n ReadStorage<'a, Collider<CollisionTag>>,\\n\\n );\\n\\n\\n\\n fn run(\\n\\n &mut self,\\n\\n (\\n\\n mut should_load_next_zone,\\n\\n player_store,\\n\\n collider_store,\\n\",\n \"file_path\": \"src/systems/handle_zone_switch.rs\",\n \"rank\": 92,\n \"score\": 3.6968429990404617\n },\n {\n \"content\": \"use super::system_prelude::*;\\n\\nuse deathframe::physics::query;\\n\\nuse query::prelude::{FindQuery, Query};\\n\\n\\n\\n#[derive(Default)]\\n\\npub struct HandleObstacle;\\n\\n\\n\\nimpl<'a> System<'a> for HandleObstacle {\\n\\n type SystemData = (\\n\\n Entities<'a>,\\n\\n WriteExpect<'a, GameOver>,\\n\\n WriteExpect<'a, SoundPlayer<SoundKey>>,\\n\\n ReadStorage<'a, Player>,\\n\\n ReadStorage<'a, Obstacle>,\\n\\n ReadStorage<'a, Collider<CollisionTag>>,\\n\\n WriteStorage<'a, AnimationsContainer<AnimationKey>>,\\n\\n WriteStorage<'a, Velocity>,\\n\\n );\\n\\n\\n\\n fn run(\\n\",\n \"file_path\": \"src/systems/handle_obstacle.rs\",\n \"rank\": 93,\n \"score\": 3.6174476083654574\n },\n {\n \"content\": \"use super::component_prelude::*;\\n\\nuse crate::level_loader::ObjectType;\\n\\n\\n\\n#[derive(Component)]\\n\\n#[storage(VecStorage)]\\n\\npub struct Object {\\n\\n pub object_type: ObjectType,\\n\\n}\\n\\n\\n\\nimpl From<ObjectType> for Object {\\n\\n fn from(object_type: ObjectType) -> Self {\\n\\n Self { object_type }\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/components/object.rs\",\n \"rank\": 94,\n \"score\": 3.609006979843734\n },\n {\n \"content\": \"use super::menu_prelude::*;\\n\\nuse super::state_prelude::*;\\n\\nuse crate::input::prelude::{MenuAction, MenuBindings};\\n\\n\\n\\n#[derive(Default)]\\n\\npub struct Pause {\\n\\n ui_data: UiData,\\n\\n}\\n\\n\\n\\nimpl Pause {\\n\\n fn start<'a, 'b>(&mut self, data: &mut StateData<GameData<'a, 'b>>) {\\n\\n self.create_ui(data, resource(\\\"ui/pause.ron\\\").to_str().unwrap());\\n\\n }\\n\\n\\n\\n fn stop<'a, 'b>(&mut self, data: &mut StateData<GameData<'a, 'b>>) {\\n\\n self.delete_ui(data);\\n\\n }\\n\\n\\n\\n fn handle_input<'a, 'b>(\\n\\n &mut self,\\n\",\n \"file_path\": \"src/states/pause.rs\",\n \"rank\": 95,\n \"score\": 3.6045454153532015\n },\n {\n \"content\": \"use super::component_prelude::*;\\n\\nuse climer::Timer;\\n\\nuse std::time::Duration;\\n\\n\\n\\n#[derive(Component, Clone, Deserialize)]\\n\\n#[storage(DenseVecStorage)]\\n\\npub struct DeleteDelay {\\n\\n pub delete_after_ms: u64,\\n\\n #[serde(skip)]\\n\\n timer: Option<Timer>,\\n\\n}\\n\\n\\n\\nimpl DeleteDelay {\\n\\n pub fn get_timer(&mut self) -> &mut Timer {\\n\\n let ms = self.delete_after_ms;\\n\\n self.timer.get_or_insert_with(|| {\\n\\n let mut timer =\\n\\n Timer::new(Some(Duration::from_millis(ms).into()), None);\\n\\n let _ = timer.start();\\n\\n timer\\n\\n })\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/components/delete_delay.rs\",\n \"rank\": 96,\n \"score\": 3.6045454153532015\n },\n {\n \"content\": \" world.register::<Turret>();\\n\\n world.register::<Cutscene>();\\n\\n\\n\\n let sprite_sheet_handles = SpriteSheetHandles::<PathBuf>::default();\\n\\n world.insert(sprite_sheet_handles);\\n\\n\\n\\n world.insert(load_savefile(&world));\\n\\n\\n\\n let (songs, sounds) = {\\n\\n let audio_settings = world.read_resource::<AudioSettings>();\\n\\n\\n\\n let mut songs = Songs::<SongKey>::default();\\n\\n for (song_key, song) in audio_settings.bgm.iter() {\\n\\n match songs.load_audio(\\n\\n song_key.clone(),\\n\\n resource(format!(\\\"audio/bgm/{}\\\", song.file)),\\n\\n true,\\n\\n world,\\n\\n ) {\\n\\n Ok(_) => {\\n\",\n \"file_path\": \"src/states/startup.rs\",\n \"rank\": 97,\n \"score\": 3.5943853634685814\n },\n {\n \"content\": \" settings.config.zone_order.first().map(|first| (first, 0))\\n\\n }\\n\\n }\\n\\n .map(|(next, order_idx)| (next.clone(), order_idx))\\n\\n }\\n\\n\\n\\n fn reset(&mut self) {\\n\\n replace_with_or_abort(self, |self_| ZonesManager {\\n\\n current_zone: None,\\n\\n initial_zone_idx: self_.initial_zone_idx,\\n\\n is_infinite_zone: self_.is_infinite_zone,\\n\\n last_staged_segment: None,\\n\\n staged_segments: Vec::new(),\\n\\n levels: HashMap::new(),\\n\\n segment_loading_locked: false,\\n\\n });\\n\\n }\\n\\n\\n\\n pub fn stage_initial_segments(&mut self, settings: &ZonesSettings) {\\n\\n for _ in 0 .. KEEP_COUNT_SEGMENTS_LOADED {\\n\",\n \"file_path\": \"src/resources/zones_manager.rs\",\n \"rank\": 98,\n \"score\": 3.5943853634685814\n },\n {\n \"content\": \"pub mod belongs_to_segment;\\n\\npub mod camera;\\n\\npub mod coin;\\n\\npub mod cutscene;\\n\\npub mod delete_delay;\\n\\npub mod object;\\n\\npub mod obstacle;\\n\\npub mod on_lane;\\n\\npub mod parent_delete;\\n\\npub mod player;\\n\\npub mod portal;\\n\\npub mod rotate;\\n\\npub mod segment;\\n\\npub mod tile;\\n\\npub mod turret;\\n\\n\\n\\npub mod prelude {\\n\\n pub use super::belongs_to_segment::BelongsToSegment;\\n\\n pub use super::camera::Camera;\\n\\n pub use super::coin::Coin;\\n\",\n \"file_path\": \"src/components/mod.rs\",\n \"rank\": 99,\n \"score\": 3.4804111065257555\n }\n]","isConversational":false}}},{"rowIdx":2352,"cells":{"lang":{"kind":"string","value":"Rust"},"file_path":{"kind":"string","value":"src/fixes.rs"},"repo_name":{"kind":"string","value":"utter-step/dotenv-linter"},"commit":{"kind":"string","value":"6005dbcb2ea3de0f233f218bf91d8373813b589e"},"file_code":{"kind":"string","value":"use crate::common::*;\n\nmod ending_blank_line;\nmod key_without_value;\nmod lowercase_key;\nmod quote_character;\nmod space_character;\nmod trailing_whitespace;\n\ntrait Fix {\n fn name(&self) -> &str;\n\n fn fix_warnings(\n &self,\n warnings: Vec<&mut Warning>,\n lines: &mut Vec<LineEntry>,\n ) -> Option<usize> {\n let mut count: usize = 0;\n for warning in warnings {\n let line = lines.get_mut(warning.line_number() - 1)?;\n if self.fix_line(line).is_some() {\n warning.mark_as_fixed();\n count += 1;\n }\n }\n\n Some(count)\n }\n\n fn fix_line(&self, _line: &mut LineEntry) -> Option<()> {\n None\n }\n}\n\nfn fixlist() -> Vec<Box<dyn Fix>> {\n vec![\n \n \n Box::new(key_without_value::KeyWithoutValueFixer::default()),\n Box::new(lowercase_key::LowercaseKeyFixer::default()),\n Box::new(space_character::SpaceCharacterFixer::default()),\n Box::new(trailing_whitespace::TrailingWhitespaceFixer::default()),\n Box::new(quote_character::QuoteCharacterFixer::default()),\n \n \n \n Box::new(ending_blank_line::EndingBlankLineFixer::default()),\n ]\n}\n\npub fn run(warnings: &mut [Warning], lines: &mut Vec<LineEntry>) -> usize {\n if warnings.is_empty() {\n return 0;\n }\n\n let mut count = 0;\n for fixer in fixlist() {\n \n let fixer_warnings: Vec<&mut Warning> = warnings\n .iter_mut()\n .filter(|w| w.check_name == fixer.name())\n .collect();\n\n if !fixer_warnings.is_empty() {\n match fixer.fix_warnings(fixer_warnings, lines) {\n Some(fixer_count) => count += fixer_count,\n None => {\n for warning in warnings {\n warning.mark_as_unfixed();\n }\n return 0;\n }\n }\n }\n }\n\n count\n}\n\n#[cfg(test)]\nmod tests {\n use super::*;\n use std::path::PathBuf;\n\n fn line_entry(number: usize, total_lines: usize, str: &str) -> LineEntry {\n LineEntry {\n number,\n file: FileEntry {\n path: PathBuf::from(\".env\"),\n file_name: \".env\".to_string(),\n total_lines,\n },\n raw_string: String::from(str),\n }\n }\n\n fn blank_line_entry(number: usize, total_lines: usize) -> LineEntry {\n LineEntry {\n number,\n file: FileEntry {\n path: PathBuf::from(\".env\"),\n file_name: \".env\".to_string(),\n total_lines,\n },\n raw_string: String::from(\"\\n\"),\n }\n }\n\n #[test]\n fn run_with_empty_warnings_test() {\n let mut lines = vec![line_entry(1, 2, \"A=B\"), blank_line_entry(2, 2)];\n let mut warnings: Vec<Warning> = Vec::new();\n\n assert_eq!(0, run(&mut warnings, &mut lines));\n }\n\n #[test]\n fn run_with_fixable_warning_test() {\n let mut lines = vec![\n line_entry(1, 3, \"A=B\"),\n line_entry(2, 3, \"c=d\"),\n blank_line_entry(3, 3),\n ];\n let mut warnings = vec![Warning::new(\n lines[1].clone(),\n \"LowercaseKey\",\n String::from(\"The c key should be in uppercase\"),\n )];\n\n assert_eq!(1, run(&mut warnings, &mut lines));\n assert_eq!(\"C=d\", lines[1].raw_string);\n assert!(warnings[0].is_fixed);\n }\n\n #[test]\n fn run_with_unfixable_warning_test() {\n let mut lines = vec![\n line_entry(1, 3, \"A=B\"),\n line_entry(2, 3, \"UNFIXABLE-\"),\n blank_line_entry(3, 3),\n ];\n let mut warnings = vec![Warning::new(\n lines[1].clone(),\n \"Unfixable\",\n String::from(\"The UNFIXABLE- key is not fixable\"),\n )];\n\n assert_eq!(0, run(&mut warnings, &mut lines));\n assert!(!warnings[0].is_fixed);\n }\n\n #[test]\n fn run_when_lines_do_not_fit_numbers_test() {\n let mut lines = vec![\n line_entry(1, 3, \"a=B\"),\n line_entry(4, 3, \"c=D\"),\n blank_line_entry(3, 3),\n ];\n let mut warnings = vec![\n Warning::new(\n lines[0].clone(),\n \"LowercaseKey\",\n String::from(\"The a key should be in uppercase\"),\n ),\n Warning::new(\n lines[1].clone(),\n \"LowercaseKey\",\n String::from(\"The c key should be in uppercase\"),\n ),\n ];\n\n assert_eq!(0, run(&mut warnings, &mut lines));\n assert!(!warnings[0].is_fixed);\n }\n\n struct TestFixer<'a> {\n name: &'a str,\n }\n\n impl Fix for TestFixer<'_> {\n fn name(&self) -> &str {\n self.name\n }\n\n fn fix_line(&self, line: &mut LineEntry) -> Option<()> {\n if line.raw_string.chars().count() > 5 {\n Some(())\n } else {\n None\n }\n }\n }\n\n #[test]\n fn warnings_are_marked_as_fixed_if_fix_returns_some() {\n let mut lines = vec![line_entry(1, 2, \"foo=bar\"), blank_line_entry(2, 2)];\n\n let mut warning = Warning::new(lines[0].clone(), \"\", String::from(\"\"));\n\n let fixer = TestFixer { name: \"fixer\" };\n\n fixer.fix_warnings(vec![&mut warning], &mut lines);\n\n assert!(warning.is_fixed)\n }\n\n #[test]\n fn warnings_are_not_marked_as_fixed_if_fix_returns_none() {\n let mut lines = vec![line_entry(1, 2, \"a=b\"), blank_line_entry(2, 2)];\n\n let mut warning = Warning::new(lines[0].clone(), \"\", String::from(\"\"));\n\n let fixer = TestFixer { name: \"fixer\" };\n\n fixer.fix_warnings(vec![&mut warning], &mut lines);\n\n assert!(!warning.is_fixed)\n }\n}\n"},"prefix":{"kind":"string","value":"use crate::common::*;\n\nmod ending_blank_line;\nmod key_without_value;\nmod lowercase_key;\nmod quote_character;\nmod space_character;\nmod trailing_whitespace;\n\ntrait Fix {\n fn name(&self) -> &str;\n\n fn fix_warnings(\n &self,\n warnings: Vec<&mut Warning>,\n lines: &mut Vec<LineEntry>,\n ) -> Option<usize> {\n let mut count: usize = 0;\n for warning in warnings {\n let line = lines.get_mut(warning.line_number() - 1)?;\n if self.fix_line(line).is_some() {\n warning.mark_as_fixed();\n count += 1;\n }\n }\n\n Some(count)\n }\n\n fn fix_line(&self, _line: &mut LineEntry) -> Option<()> {\n None\n }\n}\n\nfn fixlist() -> Vec<Box<dyn Fix>> {\n vec![\n \n \n Box::new(key_without_value::KeyWithoutValueFixer::default()),\n Box::new(lowercase_key::LowercaseKeyFixer::default()),\n Box::new(space_character::SpaceCharacterFixer::default()),\n Box::new(trailing_whitespace::TrailingWhitespaceFixer::default()),\n Box::new(quote_character::QuoteCharacterFixer::default()),\n \n \n \n Box::new(ending_blank_line::EndingBlankLineFixer::default()),\n ]\n}\n\npub fn run(warnings: &mut [Warning], lines: &mut Vec<LineEntry>) -> usize {\n if warnings.is_empty() {\n return 0;\n }\n\n let mut count = 0;\n for fixer in fixlist() {\n \n let fixer_warnings: Vec<&mut Warning> = warnings\n .iter_mut()\n .filter(|w| w.check_name == fixer.name())\n .collect();\n\n if !fixer_warnings.is_empty() {\n match fixer.fix_warnings(fixer_warnings, lines) {\n Some(fixer_count) => count += fixer_count,\n None => {\n for warning in warnings {\n warning.mark_as_unfixed();\n }\n return 0;\n }\n }\n }\n }\n\n count\n}\n\n#[cfg(test)]\nmod tests {\n use super::*;\n use std::path::PathBuf;\n\n fn line_entry(number: usize, total_lines: usize, str: &str) -> LineEntry {\n LineEntry {\n number,\n file: FileEntry {\n path: PathBuf::from(\".env\"),\n file_name: \".env\".to_string(),\n total_lines,\n },\n raw_string: String::from(str),\n }\n }\n\n fn blank_line_entry(number: usize, total_lines: usize) -> LineEntry {\n LineEntry {\n number,\n file: FileEntry {\n path: PathBuf::from(\".env\"),\n file_name: \".env\".to_string(),\n total_lines,\n },\n raw_string: String::from(\"\\n\"),\n }\n }\n\n #[test]\n fn run_with_empty_warnings_test() {\n let mut lines = vec![line_entry(1, 2, \"A=B\"), blank_line_entry(2, 2)];\n let mut warnings: Vec<Warning> = Vec::new();\n\n assert_eq!(0, run(&mut warnings, &mut lines));\n }\n\n #[test]\n fn run_with_fixable_warning_test() {\n let mut lines = vec![\n line_entry(1, 3, \"A=B\"),\n line_entry(2, 3, \"c=d\"),\n blank_line_entry(3, 3),\n ];\n let mut warnings = vec![Warning::new(\n lines[1].clone(),\n \"LowercaseKey\",\n String::from(\"The c key should be in uppercase\"),\n )];\n\n assert_eq!(1, run(&mut warnings, &mut lines));\n assert_eq!(\"C=d\", lines[1].raw_string);\n assert!(warnings[0].is_fixed);\n }\n\n #[test]\n fn run_with_unfixable_warning_test() {\n let mut lines = vec![\n line_entry(1, 3, \"A=B\"),\n line_entry(2, 3, \"UNFIXABLE-\"),\n blank_line_entry(3, 3),\n ];\n let mut warnings = vec![Warning::new(\n lines[1].clone(),\n \"Unfixable\",\n String::from(\"The UNFIXABLE- key is not fixable\"),\n )];\n\n assert_eq!(0, run(&mut warnings, &mut lines));\n assert!(!warnings[0].is_fixed);\n }\n\n #[test]\n fn run_when_lines_do_not_fit_numbers_test() {\n let mut lines = vec![\n line_entry(1, 3, \"a=B\"),\n line_entry(4, 3, \"c=D\"),\n blank_line_entry(3, 3),\n ];\n let mut warnings = vec![\n Warning::new(\n lines[0].clone(),\n \"LowercaseKey\",\n String::from(\"The a key should be in uppercase\"),\n ),\n Warning::new(\n lines[1].clone(),\n \"LowercaseKey\",\n String::from(\"The c key should be in uppercase\"),\n ),\n ];\n\n assert_eq!(0, run(&mut warnings, &mut lines));\n assert!(!warnings[0].is_fixed);\n }\n\n struct TestFixer<'a> {\n name: &'a str,\n }\n\n impl Fix for TestFixer<'_> {\n fn name(&self) -> &str {\n self.name\n }\n\n fn fix_line(&self, line: &mut LineEntry) -> Option<()> {\n if line.raw_string.chars().count() > 5 {\n Some(())\n } else {\n None\n }\n }\n }\n\n #[test]\n fn warnings_are_marked_as_fixed_if_fix_returns_some() {\n let mut lines = vec![line_entry(1, 2, \"foo=bar\"), blank_line_entry(2, 2)];\n\n let mut warning = Warning::new(lines[0].clone(), \"\", String::from(\"\"));\n\n let fixer = TestFixer { name: \"fixer\" };\n\n fixer.fix_warnings(vec![&mut warning], &mut lines);\n\n assert!(warning.is_fixed)\n }\n\n #[test]\n fn warnings_are_not_marked_as_fixed_if_fix_returns_none() {\n let mut lines = vec![line_entry(1, 2, \"a=b\"), blank_line_entry(2, 2)];\n\n let mut warning = Warning::new(lines[0].clone(), \"\", String::from(\"\"));\n\n "},"suffix":{"kind":"string","value":"\n}\n"},"middle":{"kind":"string","value":"let fixer = TestFixer { name: \"fixer\" };\n\n fixer.fix_warnings(vec![&mut warning], &mut lines);\n\n assert!(!warning.is_fixed)\n }"},"strategy":{"kind":"string","value":"function_block-function_prefix_line"},"context_items":{"kind":"list like","value":[{"content":"#[test]\n\nfn unfixed_warnings() {\n\n let testdir = TestDir::new();\n\n let testfile = testdir.create_testfile(\".env\", \"A=DEF\\nB=BAR \\nf=BAR\\n\\n\");\n\n\n\n let expected_output = String::from(\n\n \"Fixed warnings:\\n\\\n\n .env:2 TrailingWhitespace: Trailing whitespace detected\\n\\\n\n .env:3 LowercaseKey: The f key should be in uppercase\\n\\\n\n \\n\\\n\n Unfixed warnings:\\n\\\n\n .env:5 ExtraBlankLine: Extra blank line detected\\n\",\n\n );\n\n testdir.test_command_fix_fail(expected_output);\n\n\n\n assert_eq!(testfile.contents().as_str(), \"A=DEF\\nB=BAR\\nF=BAR\\n\\n\");\n\n\n\n testdir.close();\n\n}\n\n\n","file_path":"tests/fixes/mod.rs","rank":1,"score":207464.3160682502},{"content":"pub fn run(lines: &[LineEntry], skip_checks: &[&str]) -> Vec<Warning> {\n\n let mut checks = checklist();\n\n checks.retain(|c| !skip_checks.contains(&c.name()));\n\n\n\n let mut warnings: Vec<Warning> = Vec::new();\n\n\n\n for line in lines {\n\n let is_comment = line.is_comment();\n\n for ch in &mut checks {\n\n if is_comment && ch.skip_comments() {\n\n continue;\n\n }\n\n if let Some(warning) = ch.run(line) {\n\n warnings.push(warning);\n\n }\n\n }\n\n }\n\n\n\n warnings\n\n}\n","file_path":"src/checks.rs","rank":2,"score":202541.9256181306},{"content":"/// In the future versions we should create a backup copy, or at least notify the user about it\n\npub fn write_file(path: &PathBuf, lines: Vec<LineEntry>) -> io::Result<()> {\n\n let mut file = File::create(path)?;\n\n\n\n // We don't write the last line, because it contains only LF (common::FileEntry::from)\n\n // and writeln! already adds LF.\n\n for line in lines[..lines.len() - 1].iter() {\n\n writeln!(file, \"{}\", line.raw_string)?;\n\n }\n\n\n\n Ok(())\n\n}\n\n\n\n#[cfg(test)]\n\nmod tests {\n\n use super::*;\n\n use crate::common::FileEntry;\n\n use std::fs::{self, File};\n\n\n\n fn run_relative_path_asserts(assertions: Vec<(&str, &str, &str)>) {\n\n for (target, base, relative) in assertions {\n","file_path":"src/fs_utils.rs","rank":3,"score":196915.51502914648},{"content":"#[test]\n\nfn lowercase_key() {\n\n let testdir = TestDir::new();\n\n let testfile = testdir.create_testfile(\".env\", \"abc=DEF\\n\\nfOO=BAR\\n\");\n\n let expected_output = String::from(\n\n \"Fixed warnings:\\n\\\n\n .env:1 LowercaseKey: The abc key should be in uppercase\\n\\\n\n .env:3 LowercaseKey: The fOO key should be in uppercase\\n\",\n\n );\n\n testdir.test_command_fix_success(expected_output);\n\n\n\n assert_eq!(testfile.contents().as_str(), \"ABC=DEF\\n\\nFOO=BAR\\n\");\n\n\n\n testdir.close();\n\n}\n\n\n","file_path":"tests/fixes/mod.rs","rank":4,"score":196172.34993274446},{"content":"#[test]\n\nfn correct_file() {\n\n let testdir = TestDir::new();\n\n let testfile = testdir.create_testfile(\".env\", \"ABC=DEF\\nD=BAR\\n\\nFOO=BAR\\n\");\n\n\n\n testdir.test_command_fix_success(String::new());\n\n\n\n assert_eq!(testfile.contents().as_str(), \"ABC=DEF\\nD=BAR\\n\\nFOO=BAR\\n\");\n\n\n\n testdir.close();\n\n}\n\n\n","file_path":"tests/fixes/mod.rs","rank":6,"score":174608.8767300266},{"content":"#[test]\n\nfn multiple_files() {\n\n let testdir = TestDir::new();\n\n\n\n let testfile1 = testdir.create_testfile(\"1.env\", \"AB=DEF\\nD=BAR\\n\\nF=BAR\\n\");\n\n let testfile2 = testdir.create_testfile(\"2.env\", \"abc=DEF\\n\\nF=BAR\\n\");\n\n let testfile3 = testdir.create_testfile(\"3.env\", \"A=b \\nab=DEF\\n\\n\");\n\n\n\n let expected_output = String::from(\n\n \"Fixed warnings:\\n\\\n\n 2.env:1 LowercaseKey: The abc key should be in uppercase\\n\\\n\n 3.env:1 TrailingWhitespace: Trailing whitespace detected\\n\\\n\n 3.env:2 LowercaseKey: The ab key should be in uppercase\\n\\\n\n \\n\\\n\n Unfixed warnings:\\n\\\n\n 3.env:4 ExtraBlankLine: Extra blank line detected\\n\",\n\n );\n\n testdir.test_command_fix_fail(expected_output);\n\n\n\n assert_eq!(testfile1.contents().as_str(), \"AB=DEF\\nD=BAR\\n\\nF=BAR\\n\");\n\n assert_eq!(testfile2.contents().as_str(), \"ABC=DEF\\n\\nF=BAR\\n\");\n\n assert_eq!(testfile3.contents().as_str(), \"A=b\\nAB=DEF\\n\\n\");\n\n\n\n testdir.close();\n\n}\n","file_path":"tests/fixes/mod.rs","rank":7,"score":174608.87673002656},{"content":"#[test]\n\nfn key_without_value() {\n\n let testdir = TestDir::new();\n\n let testfile = testdir.create_testfile(\".env\", \"FOO\\n\\nBAR=\\n\\nBAZ=QUX\\n\");\n\n let expected_output = String::from(\n\n \"Fixed warnings:\\n\\\n\n .env:1 KeyWithoutValue: The FOO key should be with a value or have an equal sign\\n\",\n\n );\n\n testdir.test_command_fix_success(expected_output);\n\n\n\n assert_eq!(testfile.contents().as_str(), \"FOO=\\n\\nBAR=\\n\\nBAZ=QUX\\n\");\n\n\n\n testdir.close();\n\n}\n\n\n","file_path":"tests/fixes/mod.rs","rank":8,"score":168043.80988036483},{"content":"pub fn available_check_names() -> Vec<String> {\n\n checklist()\n\n .iter()\n\n .map(|check| check.name().to_string())\n\n .collect()\n\n}\n\n\n","file_path":"src/checks.rs","rank":9,"score":157085.33004449407},{"content":"#[allow(clippy::redundant_closure)]\n\npub fn run(args: &clap::ArgMatches, current_dir: &PathBuf) -> Result<Vec<Warning>, Box<dyn Error>> {\n\n let mut file_paths: Vec<PathBuf> = Vec::new();\n\n let mut skip_checks: Vec<&str> = Vec::new();\n\n let mut excluded_paths: Vec<PathBuf> = Vec::new();\n\n\n\n let is_recursive = args.is_present(\"recursive\");\n\n\n\n if let Some(skip) = args.values_of(\"skip\") {\n\n skip_checks = skip.collect();\n\n }\n\n\n\n if let Some(excluded) = args.values_of(\"exclude\") {\n\n excluded_paths = excluded\n\n .filter_map(|f| fs_utils::canonicalize(f).ok())\n\n .collect();\n\n }\n\n\n\n if let Some(inputs) = args.values_of(\"input\") {\n\n let input_paths = inputs\n\n .filter_map(|s| fs_utils::canonicalize(s).ok())\n","file_path":"src/lib.rs","rank":10,"score":151794.52968669118},{"content":"fn get_line_entries(fe: &FileEntry, lines: Vec<String>) -> Vec<LineEntry> {\n\n let mut entries: Vec<LineEntry> = Vec::with_capacity(fe.total_lines);\n\n\n\n for (index, line) in lines.into_iter().enumerate() {\n\n entries.push(LineEntry {\n\n number: index + 1,\n\n file: fe.clone(),\n\n raw_string: line,\n\n })\n\n }\n\n\n\n entries\n\n}\n","file_path":"src/lib.rs","rank":11,"score":144748.96244230264},{"content":"/// Returns the relative path for `target_path` relative to `base_path`\n\npub fn get_relative_path(target_path: &PathBuf, base_path: &PathBuf) -> Option<PathBuf> {\n\n let comp_target: Vec<_> = target_path.components().collect();\n\n let comp_base: Vec<_> = base_path.components().collect();\n\n\n\n let mut i = 0;\n\n for (b, t) in comp_base.iter().zip(comp_target.iter()) {\n\n if b != t {\n\n break;\n\n }\n\n i += 1;\n\n }\n\n\n\n let mut relative_path = PathBuf::new();\n\n\n\n for _ in 0..(comp_base.len() - i) {\n\n relative_path.push(\"..\");\n\n }\n\n relative_path.extend(comp_target.get(i..)?);\n\n\n\n Some(relative_path)\n\n}\n\n\n","file_path":"src/fs_utils.rs","rank":12,"score":139261.1966945178},{"content":"#[test]\n\nfn exclude_two_files() {\n\n let test_dir = TestDir::new();\n\n let testfile_1 = test_dir.create_testfile(\".env\", \" FOO=\\n\");\n\n let testfile_2 = test_dir.create_testfile(\".loacl.env\", \" BAR=\\n\");\n\n\n\n test_dir.test_command_success_with_args(&[\n\n \"-e\",\n\n testfile_1.as_str(),\n\n \"-e\",\n\n testfile_2.as_str(),\n\n ]);\n\n}\n\n\n","file_path":"tests/options/exclude.rs","rank":13,"score":138800.32975634045},{"content":"#[test]\n\nfn exclude_one_file() {\n\n let test_dir = TestDir::new();\n\n let testfile = test_dir.create_testfile(\".env\", \" FOO=\\n\");\n\n test_dir.test_command_success_with_args(&[\"--exclude\", testfile.as_str()]);\n\n}\n\n\n","file_path":"tests/options/exclude.rs","rank":14,"score":138800.32975634045},{"content":"#[test]\n\nfn ending_blank_line() {\n\n let testdir = TestDir::new();\n\n let testfile = testdir.create_testfile(\".env\", \"ABC=DEF\\nFOO=BAR\");\n\n let expected_output = String::from(\n\n \"Fixed warnings:\\n\\\n\n .env:2 EndingBlankLine: No blank line at the end of the file\\n\",\n\n );\n\n testdir.test_command_fix_success(expected_output);\n\n\n\n assert_eq!(testfile.contents().as_str(), \"ABC=DEF\\nFOO=BAR\\n\");\n\n\n\n testdir.close();\n\n}\n","file_path":"tests/fixes/ending_blank_line.rs","rank":15,"score":138282.65747538724},{"content":"#[test]\n\nfn exclude_one_file_check_one_file() {\n\n let test_dir = TestDir::new();\n\n let testfile_to_check = test_dir.create_testfile(\".env\", \" FOO=\\n\");\n\n let testfile_to_exclude = test_dir.create_testfile(\".exclude-me.env\", \" BAR=\\n\");\n\n\n\n let args = &[\"--exclude\", testfile_to_exclude.as_str()];\n\n let expected_output = format!(\n\n \"{}:1 LeadingCharacter: Invalid leading character detected\\n\\nFound 1 problem\\n\",\n\n testfile_to_check.shortname_as_str()\n\n );\n\n\n\n test_dir.test_command_fail_with_args(args, expected_output);\n\n}\n","file_path":"tests/options/exclude.rs","rank":16,"score":136265.62854983204},{"content":"#[test]\n\nfn correct_files() {\n\n let contents = vec![\n\n \"A=B\\nF=BAR\\n\\nFOO=BAR\\n\",\n\n \"A=B\\r\\nF=BAR\\r\\n\\r\\nFOO=BAR\\r\\n\",\n\n \"\\n# comment\\n\\nABC=DEF\\n\",\n\n ];\n\n\n\n for content in contents {\n\n let testdir = TestDir::new();\n\n let testfile = testdir.create_testfile(\".env\", content);\n\n let args = &[testfile.as_str()];\n\n\n\n testdir.test_command_success_with_args(args);\n\n }\n\n}\n\n\n","file_path":"tests/checks/extra_blank_line.rs","rank":17,"score":133713.34845925934},{"content":"#[test]\n\nfn incorrect_files() {\n\n let contents = vec![\n\n \"ABC=DEF\\nD=BAR\\nFOO=BAR\",\n\n \"C=D\\r\\nK=L\\r\\nX=Y\",\n\n \"A=B\",\n\n \"# Comment 1\\n# Comment 2\\n# Comment 3\",\n\n ];\n\n let expected_line_numbers = vec![3, 3, 1, 3];\n\n\n\n for (i, content) in contents.iter().enumerate() {\n\n let testdir = TestDir::new();\n\n let testfile = testdir.create_testfile(\".env\", content);\n\n let args = &[testfile.as_str()];\n\n let expected_output = format!(\n\n \"{}:{} EndingBlankLine: No blank line at the end of the file\\n\\nFound 1 problem\\n\",\n\n testfile.shortname_as_str(),\n\n expected_line_numbers[i]\n\n );\n\n\n\n testdir.test_command_fail_with_args(args, expected_output);\n\n }\n\n}\n","file_path":"tests/checks/ending_blank_line.rs","rank":18,"score":133713.34845925937},{"content":"#[test]\n\nfn correct_files() {\n\n let contents = vec![\n\n \"A=B\\nF=BAR\\nFOO=BAR\\n\",\n\n \"A=B\\r\\nF=BAR\\r\\nFOO=BAR\\r\\n\",\n\n \"# comment\\nABC=DEF\\n\",\n\n ];\n\n\n\n for content in contents {\n\n let testdir = TestDir::new();\n\n let testfile = testdir.create_testfile(\".env\", content);\n\n let args = &[testfile.as_str()];\n\n\n\n testdir.test_command_success_with_args(args);\n\n }\n\n}\n\n\n","file_path":"tests/checks/ending_blank_line.rs","rank":19,"score":133713.34845925937},{"content":"#[test]\n\nfn checks_one_specific_file_and_one_path() {\n\n let testdir = TestDir::new();\n\n testdir.create_testfile(\".env\", \"foo=\");\n\n let testfile_2 = testdir.create_testfile(\"test-env-file\", \"FOO=BAR\\nBAR=FOO\\n\");\n\n\n\n let subdir = testdir.subdir();\n\n let testfile_3 = subdir.create_testfile(\"test.env\", \"FOO=BAR\\nFOO=BAR\\n\");\n\n\n\n let args = &[testfile_2.as_str(), subdir.as_str()];\n\n let expected_output = format!(\n\n \"{}:2 UnorderedKey: The BAR key should go before the FOO key\\n{}:2 DuplicatedKey: The FOO key is duplicated\\n\\nFound 2 problems\\n\",\n\n testfile_2.shortname_as_str(),\n\n Path::new(&testdir.relative_path(&subdir))\n\n .join(testfile_3.shortname_as_str())\n\n .to_str().expect(\"multi-platform path to test .env file\"),\n\n );\n\n\n\n testdir.test_command_fail_with_args(args, expected_output);\n\n}\n\n\n","file_path":"tests/args/specific_path.rs","rank":20,"score":132830.57445029358},{"content":"#[test]\n\nfn checks_one_specific_file() {\n\n let test_dir = TestDir::new();\n\n test_dir.create_testfile(\".env\", \"foo=\\n\");\n\n let testfile_2 = test_dir.create_testfile(\"test-env-file\", \"FOO =\\n\");\n\n\n\n let args = &[testfile_2.as_str()];\n\n let expected_output = format!(\n\n \"{}:1 SpaceCharacter: The line has spaces around equal sign\\n\\nFound 1 problem\\n\",\n\n testfile_2.shortname_as_str()\n\n );\n\n\n\n test_dir.test_command_fail_with_args(args, expected_output);\n\n}\n\n\n","file_path":"tests/args/specific_path.rs","rank":21,"score":130432.50197138556},{"content":"#[test]\n\nfn checks_two_specific_files() {\n\n let testdir = TestDir::new();\n\n testdir.create_testfile(\".env\", \"foo=\");\n\n let testfile_2 = testdir.create_testfile(\"test-env-file\", \"FOO =\\n\");\n\n\n\n let subdir = testdir.subdir();\n\n let testfile_3 = subdir.create_testfile(\"another_test_file\", \"FOO=BAR\\nFOO=BAR\\n\");\n\n\n\n let args = &[testfile_2.as_str(), testfile_3.as_str()];\n\n let expected_output = format!(\n\n \"{}:2 DuplicatedKey: The FOO key is duplicated\\n{}:1 SpaceCharacter: The line has spaces around equal sign\\n\\nFound 2 problems\\n\",\n\n Path::new(&testdir.relative_path(&subdir))\n\n .join(testfile_3.shortname_as_str())\n\n .to_str().expect(\"multi-platform path to test .env file\"),\n\n testfile_2.shortname_as_str(),\n\n );\n\n\n\n testdir.test_command_fail_with_args(args, expected_output);\n\n}\n\n\n","file_path":"tests/args/specific_path.rs","rank":22,"score":130432.50197138556},{"content":"#[test]\n\nfn checks_one_specific_file_twice() {\n\n let test_dir = TestDir::new();\n\n test_dir.create_testfile(\".env\", \"foo=\");\n\n let testfile_2 = test_dir.create_testfile(\"test-env-file\", \"1FOO=\\n\");\n\n\n\n let args = &[testfile_2.as_str(), testfile_2.as_str()];\n\n let expected_output = format!(\n\n \"{}:1 LeadingCharacter: Invalid leading character detected\\n\\nFound 1 problem\\n\",\n\n testfile_2.shortname_as_str()\n\n );\n\n\n\n test_dir.test_command_fail_with_args(args, expected_output);\n\n}\n","file_path":"tests/args/specific_path.rs","rank":23,"score":126697.69742909273},{"content":"pub fn remove_invalid_leading_chars(string: &str) -> String {\n\n string\n\n .chars()\n\n .skip_while(|&c| !(c.is_alphabetic() || c == '_'))\n\n .collect()\n\n}\n\n\n","file_path":"src/common.rs","rank":25,"score":118888.04419122054},{"content":"fn get_file_paths(\n\n dir_entries: Vec<PathBuf>,\n\n excludes: &[PathBuf],\n\n is_recursive: bool,\n\n) -> Vec<PathBuf> {\n\n let nested_paths: Vec<PathBuf> = dir_entries\n\n .iter()\n\n .filter(|entry| entry.is_dir())\n\n .filter(|entry| !excludes.contains(entry))\n\n .filter_map(|dir| dir.read_dir().ok())\n\n .map(|read_dir| {\n\n read_dir\n\n .filter_map(|e| e.ok())\n\n .map(|e| e.path())\n\n .filter(|path| FileEntry::is_env_file(path) || (is_recursive && path.is_dir()))\n\n .collect()\n\n })\n\n .flat_map(|dir_entries| get_file_paths(dir_entries, excludes, is_recursive))\n\n .collect();\n\n\n","file_path":"src/lib.rs","rank":26,"score":111880.81367185828},{"content":"#[test]\n\nfn checks_two_specific_paths() {\n\n let testdir = TestDir::new();\n\n testdir.create_testfile(\".env\", \"foo=\\n\");\n\n\n\n let subdir_1 = testdir.subdir();\n\n let testfile_2 = subdir_1.create_testfile(\".env\", \" FOO=\\n\");\n\n\n\n let subdir_2 = subdir_1.subdir();\n\n let testfile_3 = subdir_2.create_testfile(\".env\", \" FOO=\\n\");\n\n\n\n let args = &[subdir_1.as_str(), subdir_2.as_str()];\n\n let expected_output = format!(\n\n \"{}:1 LeadingCharacter: Invalid leading character detected\\n{}:1 LeadingCharacter: Invalid leading character detected\\n\\nFound 2 problems\\n\",\n\n Path::new(&testdir.relative_path(&subdir_1))\n\n .join(testfile_2.shortname_as_str())\n\n .to_str().expect(\"multi-platform path to test .env file\"),\n\n Path::new(&testdir.relative_path(&subdir_2))\n\n .join(testfile_3.shortname_as_str())\n\n .to_str().expect(\"multi-platform path to test .env file\"),\n\n );\n\n\n\n testdir.test_command_fail_with_args(args, expected_output);\n\n}\n\n\n","file_path":"tests/args/specific_path.rs","rank":27,"score":110916.87040246681},{"content":"#[test]\n\nfn checks_one_specific_path() {\n\n let testdir = TestDir::new();\n\n testdir.create_testfile(\".env\", \"foo=\\n\");\n\n\n\n let subdir = testdir.subdir();\n\n let testfile_2 = subdir.create_testfile(\".env.test\", \"1FOO=\\n\");\n\n\n\n let args = &[subdir.as_str()];\n\n let expected_output = format!(\n\n \"{}:1 LeadingCharacter: Invalid leading character detected\\n\\nFound 1 problem\\n\",\n\n Path::new(&testdir.relative_path(&subdir))\n\n .join(testfile_2.shortname_as_str())\n\n .to_str()\n\n .expect(\"multi-platform path to test .env file\")\n\n );\n\n\n\n testdir.test_command_fail_with_args(args, expected_output);\n\n}\n\n\n","file_path":"tests/args/specific_path.rs","rank":28,"score":110916.87040246681},{"content":"#[test]\n\nfn exits_with_0_on_no_warnings() {\n\n let test_dir = TestDir::new();\n\n test_dir.create_testfile(\".env\", \"FOO=bar\\n\");\n\n test_dir.test_command_success();\n\n}\n\n\n","file_path":"tests/args/current_dir.rs","rank":29,"score":107703.19972802594},{"content":"#[test]\n\nfn two_blank_lines_in_the_middle() {\n\n let content = \"ABC=DEF\\nD=BAR\\n\\n\\nFOO=BAR\\n\";\n\n\n\n let testdir = TestDir::new();\n\n let testfile = testdir.create_testfile(\".env\", content);\n\n let args = &[testfile.as_str()];\n\n let expected_output = format!(\n\n \"{}:{} ExtraBlankLine: Extra blank line detected\\n\\nFound 1 problem\\n\",\n\n testfile.shortname_as_str(),\n\n 4\n\n );\n\n\n\n testdir.test_command_fail_with_args(args, expected_output);\n\n}\n\n\n","file_path":"tests/checks/extra_blank_line.rs","rank":30,"score":107338.30223778376},{"content":"#[test]\n\nfn two_blank_lines_at_the_beginning() {\n\n let content = \"\\n\\nABC=DEF\\nD=BAR\\nFOO=BAR\\n\";\n\n\n\n let testdir = TestDir::new();\n\n let testfile = testdir.create_testfile(\".env\", content);\n\n let args = &[testfile.as_str()];\n\n let expected_output = format!(\n\n \"{}:{} ExtraBlankLine: Extra blank line detected\\n\\nFound 1 problem\\n\",\n\n testfile.shortname_as_str(),\n\n 2\n\n );\n\n\n\n testdir.test_command_fail_with_args(args, expected_output);\n\n}\n\n\n","file_path":"tests/checks/extra_blank_line.rs","rank":31,"score":107338.30223778376},{"content":"#[test]\n\nfn two_blank_lines_at_the_end() {\n\n let content = \"ABC=DEF\\nD=BAR\\nFOO=BAR\\n\\n\";\n\n\n\n let testdir = TestDir::new();\n\n let testfile = testdir.create_testfile(\".env\", content);\n\n let args = &[testfile.as_str()];\n\n let expected_output = format!(\n\n \"{}:{} ExtraBlankLine: Extra blank line detected\\n\\nFound 1 problem\\n\",\n\n testfile.shortname_as_str(),\n\n 5\n\n );\n\n\n\n testdir.test_command_fail_with_args(args, expected_output);\n\n}\n","file_path":"tests/checks/extra_blank_line.rs","rank":32,"score":107338.30223778376},{"content":"#[test]\n\nfn trailing_whitespace() {\n\n let testdir = TestDir::new();\n\n let testfile = testdir.create_testfile(\".env\", \"ABC=DEF \\n\\nFOO=BAR \\n\");\n\n let expected_output = String::from(\n\n \"Fixed warnings:\\n\\\n\n .env:1 TrailingWhitespace: Trailing whitespace detected\\n\\\n\n .env:3 TrailingWhitespace: Trailing whitespace detected\\n\",\n\n );\n\n testdir.test_command_fix_success(expected_output);\n\n\n\n assert_eq!(testfile.contents().as_str(), \"ABC=DEF\\n\\nFOO=BAR\\n\");\n\n\n\n testdir.close();\n\n}\n","file_path":"tests/fixes/trailing_whitespace.rs","rank":33,"score":106736.65892221834},{"content":"#[test]\n\nfn quote_character() {\n\n let testdir = TestDir::new();\n\n let testfile = testdir.create_testfile(\".env\", \"ABC=\\\"DEF\\\"\\n\\nFOO=\\'B\\\"AR\\'\\n\");\n\n let expected_output = String::from(\n\n \"Fixed warnings:\\n\\\n\n .env:1 QuoteCharacter: The value has quote characters (\\', \\\")\\n\\\n\n .env:3 QuoteCharacter: The value has quote characters (\\', \\\")\\n\",\n\n );\n\n testdir.test_command_fix_success(expected_output);\n\n\n\n assert_eq!(testfile.contents().as_str(), \"ABC=DEF\\n\\nFOO=BAR\\n\");\n\n\n\n testdir.close();\n\n}\n","file_path":"tests/fixes/quote_character.rs","rank":34,"score":106736.65892221834},{"content":"#[test]\n\nfn space_character() {\n\n let testdir = TestDir::new();\n\n let testfile = testdir.create_testfile(\".env\", \"ABC = DEF\\n\\nFOO= BAR\\n\");\n\n let expected_output = String::from(\n\n \"Fixed warnings:\\n\\\n\n .env:1 SpaceCharacter: The line has spaces around equal sign\\n\\\n\n .env:3 SpaceCharacter: The line has spaces around equal sign\\n\",\n\n );\n\n testdir.test_command_fix_success(expected_output);\n\n\n\n assert_eq!(testfile.contents().as_str(), \"ABC=DEF\\n\\nFOO=BAR\\n\");\n\n\n\n testdir.close();\n\n}\n","file_path":"tests/fixes/space_character.rs","rank":35,"score":106736.65892221834},{"content":"#[test]\n\nfn checks_files_in_deep_subdirs() {\n\n let test_dir = TestDir::new();\n\n test_dir.create_testfile(\"correct.env\", \"FOO=BAR\\n\");\n\n\n\n let test_subdir_2 = test_dir.subdir();\n\n let testfile_2 = test_subdir_2.create_testfile(\"incorrect.sub_1.env\", \"FOO=BAR\\nBAR=FOO\\n\");\n\n\n\n let test_subdir_3 = test_subdir_2.subdir();\n\n let testfile_3 = test_subdir_3.create_testfile(\".incorrect.env\", \"FOO=\");\n\n\n\n let args = &[\"--recursive\"];\n\n let expected_output = format!(\n\n \"{}:2 UnorderedKey: The BAR key should go before the FOO key\\n{}:1 EndingBlankLine: No blank line at the end of the file\\n\\nFound 2 problems\\n\",\n\n Path::new(&test_dir.relative_path(&test_subdir_2))\n\n .join(testfile_2.shortname_as_str())\n\n .to_str()\n\n .expect(\"multi-platform path to test .env file\"),\n\n Path::new(&test_dir.relative_path(&test_subdir_3))\n\n .join(testfile_3.shortname_as_str())\n\n .to_str()\n\n .expect(\"multi-platform path to test .env file\")\n\n );\n\n\n\n test_dir.test_command_fail_with_args(args, expected_output);\n\n}\n\n\n","file_path":"tests/flags/recursive.rs","rank":36,"score":104266.85934371926},{"content":"mod exclude;\n","file_path":"tests/options/mod.rs","rank":37,"score":103975.18667743792},{"content":"mod quote_character;\n\n\n\nuse crate::common::TestDir;\n\n\n\nmod ending_blank_line;\n\nmod space_character;\n\nmod trailing_whitespace;\n\n\n\n#[test]\n","file_path":"tests/fixes/mod.rs","rank":38,"score":102841.11388378526},{"content":"use crate::common::TestDir;\n\n\n\n#[test]\n","file_path":"tests/fixes/ending_blank_line.rs","rank":39,"score":94533.4285137353},{"content":"fn get_args(current_dir: &OsStr) -> clap::ArgMatches {\n\n clap::App::new(env!(\"CARGO_PKG_NAME\"))\n\n .about(env!(\"CARGO_PKG_DESCRIPTION\"))\n\n .author(env!(\"CARGO_PKG_AUTHORS\"))\n\n .version(env!(\"CARGO_PKG_VERSION\"))\n\n .version_short(\"v\")\n\n .arg(\n\n Arg::with_name(\"input\")\n\n .help(\"files or paths\")\n\n .index(1)\n\n .default_value_os(current_dir)\n\n .required(true)\n\n .multiple(true),\n\n )\n\n .arg(\n\n Arg::with_name(\"exclude\")\n\n .short(\"e\")\n\n .long(\"exclude\")\n\n .value_name(\"FILE_NAME\")\n\n .help(\"Excludes files from check\")\n","file_path":"src/main.rs","rank":40,"score":88836.69772615742},{"content":"// Checklist for checks which needs to know of only a single line\n\nfn checklist() -> Vec<Box<dyn Check>> {\n\n vec![\n\n Box::new(duplicated_key::DuplicatedKeyChecker::default()),\n\n Box::new(ending_blank_line::EndingBlankLineChecker::default()),\n\n Box::new(extra_blank_line::ExtraBlankLineChecker::default()),\n\n Box::new(incorrect_delimiter::IncorrectDelimiterChecker::default()),\n\n Box::new(leading_character::LeadingCharacterChecker::default()),\n\n Box::new(key_without_value::KeyWithoutValueChecker::default()),\n\n Box::new(lowercase_key::LowercaseKeyChecker::default()),\n\n Box::new(quote_character::QuoteCharacterChecker::default()),\n\n Box::new(space_character::SpaceCharacterChecker::default()),\n\n Box::new(trailing_whitespace::TrailingWhitespaceChecker::default()),\n\n Box::new(unordered_key::UnorderedKeyChecker::default()),\n\n ]\n\n}\n\n\n","file_path":"src/checks.rs","rank":41,"score":83056.47165956532},{"content":"#[test]\n\nfn output_without_total() {\n\n let test_dir = TestDir::new();\n\n let testfile_to_check = test_dir.create_testfile(\".env\", \" BAR='Baz'\\n\");\n\n\n\n let args = &[\"--quiet\"];\n\n let expected_output = format!(\n\n \"{a}:1 LeadingCharacter: Invalid leading character detected\\n{a}:1 QuoteCharacter: The value has quote characters (\\', \\\")\\n\",\n\n a=testfile_to_check.shortname_as_str()\n\n );\n\n\n\n test_dir.test_command_fail_with_args(args, expected_output);\n\n}\n","file_path":"tests/flags/quiet.rs","rank":42,"score":76419.81729152259},{"content":"#[test]\n\nfn checks_one_in_subdir() {\n\n let test_dir = TestDir::new();\n\n test_dir.create_testfile(\"correct.env\", \"FOO=BAR\\n\");\n\n let test_subdir = test_dir.subdir();\n\n let testfile_2 = test_subdir.create_testfile(\".incorrect.env\", \"1BAR=\\n\");\n\n\n\n let args = &[\"-r\"];\n\n let expected_output = format!(\n\n \"{}:1 LeadingCharacter: Invalid leading character detected\\n\\nFound 1 problem\\n\",\n\n Path::new(&test_dir.relative_path(&test_subdir))\n\n .join(testfile_2.shortname_as_str())\n\n .to_str()\n\n .expect(\"multi-platform path to test .env file\")\n\n );\n\n\n\n test_dir.test_command_fail_with_args(args, expected_output);\n\n}\n\n\n","file_path":"tests/flags/recursive.rs","rank":43,"score":76419.81729152259},{"content":"#[test]\n\nfn checks_current_dir() {\n\n let testdir = TestDir::new();\n\n let testfile = testdir.create_testfile(\".env\", \"FOO\\n\");\n\n\n\n testdir.test_command_fail(\n\n format!(\n\n \"{}:1 KeyWithoutValue: The FOO key should be with a value or have an equal sign\\n\\nFound 1 problem\\n\",\n\n testfile.shortname_as_str()\n\n )\n\n );\n\n}\n\n\n","file_path":"tests/args/current_dir.rs","rank":44,"score":74303.72632516392},{"content":"#[test]\n\nfn checks_recursive_with_exclude_subdir() {\n\n let test_dir = TestDir::new();\n\n test_dir.create_testfile(\"correct.env\", \"FOO=BAR\\n\");\n\n\n\n let test_subdir_2 = test_dir.subdir();\n\n let testfile_2 = test_subdir_2.create_testfile(\"incorrect.sub_1.env\", \"FOO=BAR\\nBAR=FOO\\n\");\n\n\n\n let test_subdir_3 = test_subdir_2.subdir();\n\n let testfile_to_exclude = test_subdir_3.create_testfile(\".incorrect.env\", \"FOO=\");\n\n\n\n let args = &[\"--exclude\", testfile_to_exclude.as_str(), \"--recursive\"];\n\n let expected_output = format!(\n\n \"{}:2 UnorderedKey: The BAR key should go before the FOO key\\n\\nFound 1 problem\\n\",\n\n Path::new(&test_dir.relative_path(&test_subdir_2))\n\n .join(testfile_2.shortname_as_str())\n\n .to_str()\n\n .expect(\"multi-platform path to test .env file\"),\n\n );\n\n\n\n test_dir.test_command_fail_with_args(args, expected_output);\n\n}\n","file_path":"tests/flags/recursive.rs","rank":45,"score":74303.72632516392},{"content":"#[test]\n\nfn checks_without_recursive_flag() {\n\n let test_dir = TestDir::new();\n\n test_dir.create_testfile(\"correct.env\", \"FOO=BAR\\n\");\n\n let test_subdir = test_dir.subdir();\n\n test_subdir.create_testfile(\".incorrect.env\", \"1BAR=\\n\");\n\n\n\n // incorrect file located in a subdirectory should not be checked\n\n test_dir.test_command_success();\n\n}\n\n\n","file_path":"tests/flags/recursive.rs","rank":46,"score":74303.72632516392},{"content":"#[test]\n\nfn remove_invalid_leading_chars_test() {\n\n let string = String::from(\"-1&*FOO\");\n\n assert_eq!(\"FOO\", remove_invalid_leading_chars(&string));\n\n\n\n let string = String::from(\"***FOO-BAR\");\n\n assert_eq!(\"FOO-BAR\", remove_invalid_leading_chars(&string));\n\n}\n","file_path":"src/common.rs","rank":47,"score":74303.72632516392},{"content":"fn print_total(total: usize) {\n\n let mut problems = String::from(\"problem\");\n\n\n\n if total > 1 {\n\n problems += \"s\";\n\n }\n\n\n\n println!(\"\\n{}\", format!(\"Found {} {}\", total, problems));\n\n}\n\n\n","file_path":"src/main.rs","rank":48,"score":73940.5364243457},{"content":"#[test]\n\nfn checks_current_dir_with_dot_arg() {\n\n let testdir = TestDir::new();\n\n let testfile = testdir.create_testfile(\"test.env\", \"foo=\\n\");\n\n\n\n let args = &[\".\"];\n\n let expected_output = format!(\n\n \"{}:1 LowercaseKey: The foo key should be in uppercase\\n\\nFound 1 problem\\n\",\n\n testfile.shortname_as_str(),\n\n );\n\n\n\n testdir.test_command_fail_with_args(args, expected_output);\n\n}\n","file_path":"tests/args/current_dir.rs","rank":49,"score":70484.39821908093},{"content":"use crate::common::TestDir;\n\n\n\n#[test]\n","file_path":"tests/options/exclude.rs","rank":50,"score":69110.61139044068},{"content":"\n\n fn init_cmd() -> Command {\n\n Command::cargo_bin(env!(\"CARGO_PKG_NAME\")).expect(\"command from binary name\")\n\n }\n\n}\n\n\n\n/// Use as a temporary file to act on in a TestDir\n\npub struct TestFile {\n\n file_path: PathBuf,\n\n}\n\n\n\nimpl TestFile {\n\n /// Create a new file and write its contents\n\n pub fn new(test_dir: &TempDir, name: &str, contents: &str) -> Self {\n\n let file_path = test_dir.path().join(name);\n\n let mut file = File::create(&file_path).expect(\"create testfile\");\n\n file.write_all(contents.as_bytes()).expect(\"write to file\");\n\n\n\n Self { file_path }\n\n }\n","file_path":"tests/common/mod.rs","rank":51,"score":68865.91943028726},{"content":" subdir\n\n .current_dir\n\n .path()\n\n .strip_prefix(self.current_dir.path())\n\n .expect(\"strip dir from subdir path\")\n\n .to_string_lossy()\n\n .to_string()\n\n }\n\n\n\n /// Create a TestFile within the TestDir\n\n pub fn create_testfile(&self, name: &str, contents: &str) -> TestFile {\n\n TestFile::new(&self.current_dir, name, contents)\n\n }\n\n\n\n /// Get full path of TestDir as a &str\n\n pub fn as_str(&self) -> &str {\n\n self.current_dir\n\n .path()\n\n .to_str()\n\n .expect(\"convert directory to &str\")\n","file_path":"tests/common/mod.rs","rank":52,"score":68857.85355527402},{"content":"use assert_cmd::Command;\n\nuse std::ffi::OsStr;\n\nuse std::fs::{self, File};\n\nuse std::io::Write;\n\nuse std::path::PathBuf;\n\nuse tempfile::{tempdir, tempdir_in, TempDir};\n\n\n\n#[cfg(windows)]\n\nuse dunce::canonicalize;\n\n\n\n#[cfg(not(windows))]\n\nuse std::fs::canonicalize;\n\n\n\n/// Use to test commands in temporary directories\n\npub struct TestDir {\n\n current_dir: TempDir,\n\n}\n\n\n\nimpl TestDir {\n\n /// Generate a new TestDir\n","file_path":"tests/common/mod.rs","rank":53,"score":68856.23641018898},{"content":"\n\n /// Get full path of TestFile on filesystem as &str\n\n pub fn as_str(&self) -> &str {\n\n self.file_path.to_str().expect(\"convert testfile to &str\")\n\n }\n\n\n\n /// Get the filename (short path) as &str\n\n pub fn shortname_as_str(&self) -> &str {\n\n self.file_path\n\n .file_name()\n\n .expect(\"get shortname\")\n\n .to_str()\n\n .expect(\"convert shortname to &str\")\n\n }\n\n\n\n /// Get file contents\n\n pub fn contents(&self) -> String {\n\n String::from_utf8_lossy(&fs::read(self.as_str()).expect(\"read file\")).into_owned()\n\n }\n\n}\n","file_path":"tests/common/mod.rs","rank":54,"score":68854.7307150357},{"content":" /// This method removes the TestDir when command has finished.\n\n pub fn test_command_fail_with_args<I, S>(self, args: I, expected_output: String)\n\n where\n\n I: IntoIterator<Item = S>,\n\n S: AsRef<OsStr>,\n\n {\n\n let mut cmd = Self::init_cmd();\n\n let canonical_current_dir = canonicalize(&self.current_dir).expect(\"canonical current dir\");\n\n cmd.current_dir(&canonical_current_dir)\n\n .args(args)\n\n .assert()\n\n .failure()\n\n .code(1)\n\n .stdout(expected_output);\n\n\n\n self.close();\n\n }\n\n\n\n /// Run the default CLI binary, with \"-f\", in this TestDir and check it succeeds.\n\n pub fn test_command_fix_success(&self, expected_output: String) {\n","file_path":"tests/common/mod.rs","rank":55,"score":68850.9845774771},{"content":" pub fn new() -> Self {\n\n Self {\n\n current_dir: tempdir().expect(\"create testdir\"),\n\n }\n\n }\n\n\n\n /// Create a new TestDir within an existing one\n\n pub fn subdir(&self) -> Self {\n\n Self {\n\n current_dir: tempdir_in(&self.current_dir).expect(\"create subdir\"),\n\n }\n\n }\n\n\n\n /// Explicitly panic if unable to remove TestDir from filesystem\n\n pub fn close(self) {\n\n self.current_dir.close().expect(\"remove testdir\");\n\n }\n\n\n\n /// Get relative path between TestDir and a subdirectory TestDir\n\n pub fn relative_path(&self, subdir: &Self) -> String {\n","file_path":"tests/common/mod.rs","rank":56,"score":68850.68979912002},{"content":" ///\n\n /// This method removes the TestDir when command has finished.\n\n pub fn test_command_success_with_args<I, S>(self, args: I)\n\n where\n\n I: IntoIterator<Item = S>,\n\n S: AsRef<OsStr>,\n\n {\n\n let mut cmd = Self::init_cmd();\n\n let canonical_current_dir = canonicalize(&self.current_dir).expect(\"canonical current dir\");\n\n cmd.current_dir(&canonical_current_dir)\n\n .args(args)\n\n .assert()\n\n .success();\n\n\n\n self.close();\n\n }\n\n\n\n /// Run the default CLI binary, with command line arguments,\n\n /// in this TestDir and check it fails.\n\n ///\n","file_path":"tests/common/mod.rs","rank":57,"score":68850.47578159542},{"content":" let mut cmd = Self::init_cmd();\n\n let canonical_current_dir = canonicalize(&self.current_dir).expect(\"canonical current dir\");\n\n cmd.current_dir(&canonical_current_dir)\n\n .args(&[\"-f\"])\n\n .assert()\n\n .success()\n\n .stdout(expected_output);\n\n }\n\n\n\n /// Run the default CLI binary, with \"-f\", in this TestDir and check it fails.\n\n pub fn test_command_fix_fail(&self, expected_output: String) {\n\n let mut cmd = Self::init_cmd();\n\n let canonical_current_dir = canonicalize(&self.current_dir).expect(\"canonical current dir\");\n\n cmd.current_dir(&canonical_current_dir)\n\n .args(&[\"-f\"])\n\n .assert()\n\n .failure()\n\n .code(1)\n\n .stdout(expected_output);\n\n }\n","file_path":"tests/common/mod.rs","rank":58,"score":68848.7733157412},{"content":" }\n\n\n\n /// Run the default CLI binary in this TestDir and check it succeeds.\n\n ///\n\n /// This method removes the TestDir when command has finished.\n\n pub fn test_command_success(self) {\n\n let args: &[&str; 0] = &[];\n\n self.test_command_success_with_args(args);\n\n }\n\n\n\n /// Run the default CLI binary in this TestDir and check it fails.\n\n ///\n\n /// This method removes the TestDir when command has finished.\n\n pub fn test_command_fail(self, expected_output: String) {\n\n let args: &[&str; 0] = &[];\n\n self.test_command_fail_with_args(args, expected_output);\n\n }\n\n\n\n /// Run the default CLI binary, with command line arguments,\n\n /// in this TestDir and check it succeeds.\n","file_path":"tests/common/mod.rs","rank":59,"score":68847.85352234484},{"content":"mod ending_blank_line;\n\nmod extra_blank_line;\n","file_path":"tests/checks/mod.rs","rank":60,"score":68843.62665994112},{"content":"mod current_dir;\n\nmod specific_path;\n","file_path":"tests/args/mod.rs","rank":61,"score":68843.46307982004},{"content":"mod quiet;\n\nmod recursive;\n","file_path":"tests/flags/mod.rs","rank":62,"score":68839.93315402482},{"content":"use crate::common::TestDir;\n\nuse std::path::Path;\n\n\n\n#[test]\n","file_path":"tests/args/specific_path.rs","rank":63,"score":66333.99415956465},{"content":"use crate::common::TestDir;\n\n\n\n#[test]\n","file_path":"tests/fixes/quote_character.rs","rank":64,"score":65327.1456570207},{"content":"use crate::common::TestDir;\n\n\n\n#[test]\n","file_path":"tests/fixes/space_character.rs","rank":65,"score":65327.1456570207},{"content":"use crate::common::TestDir;\n\n\n\n#[test]\n","file_path":"tests/fixes/trailing_whitespace.rs","rank":66,"score":65327.1456570207},{"content":"use super::Fix;\n\nuse crate::common::*;\n\n\n\npub(crate) struct LowercaseKeyFixer<'a> {\n\n name: &'a str,\n\n}\n\n\n\nimpl Default for LowercaseKeyFixer<'_> {\n\n fn default() -> Self {\n\n Self {\n\n name: \"LowercaseKey\",\n\n }\n\n }\n\n}\n\n\n\nimpl Fix for LowercaseKeyFixer<'_> {\n\n fn name(&self) -> &str {\n\n self.name\n\n }\n\n\n","file_path":"src/fixes/lowercase_key.rs","rank":67,"score":65263.7006580456},{"content":" fn fix_line(&self, line: &mut LineEntry) -> Option<()> {\n\n let key = line.get_key()?;\n\n let key = key.to_uppercase();\n\n line.raw_string = format!(\"{}={}\", key, line.get_value()?);\n\n\n\n Some(())\n\n }\n\n}\n\n\n\n#[cfg(test)]\n\nmod tests {\n\n use super::*;\n\n use std::path::PathBuf;\n\n\n\n #[test]\n\n fn fix_line_test() {\n\n let fixer = LowercaseKeyFixer::default();\n\n let mut line = LineEntry {\n\n number: 1,\n\n file: FileEntry {\n","file_path":"src/fixes/lowercase_key.rs","rank":68,"score":65263.3150650013},{"content":" path: PathBuf::from(\".env\"),\n\n file_name: \".env\".to_string(),\n\n total_lines: 1,\n\n },\n\n raw_string: String::from(\"foO=BAR\"),\n\n };\n\n assert_eq!(Some(()), fixer.fix_line(&mut line));\n\n assert_eq!(\"FOO=BAR\", line.raw_string);\n\n }\n\n\n\n #[test]\n\n fn fix_warnings_test() {\n\n let fixer = LowercaseKeyFixer::default();\n\n let mut lines = vec![\n\n LineEntry {\n\n number: 1,\n\n file: FileEntry {\n\n path: PathBuf::from(\".env\"),\n\n file_name: \".env\".to_string(),\n\n total_lines: 3,\n","file_path":"src/fixes/lowercase_key.rs","rank":69,"score":65256.639992448974},{"content":" },\n\n ];\n\n let mut warning = Warning::new(\n\n lines[0].clone(),\n\n \"LowercaseKey\",\n\n String::from(\"The FOO key should be in uppercase\"),\n\n );\n\n\n\n assert_eq!(Some(1), fixer.fix_warnings(vec![&mut warning], &mut lines));\n\n assert_eq!(\"FOO=BAR\", lines[0].raw_string);\n\n assert!(warning.is_fixed);\n\n }\n\n}\n","file_path":"src/fixes/lowercase_key.rs","rank":70,"score":65247.52285483658},{"content":" },\n\n raw_string: String::from(\"foO=BAR\"),\n\n },\n\n LineEntry {\n\n number: 2,\n\n file: FileEntry {\n\n path: PathBuf::from(\".env\"),\n\n file_name: \".env\".to_string(),\n\n total_lines: 3,\n\n },\n\n raw_string: String::from(\"Z=Y\"),\n\n },\n\n LineEntry {\n\n number: 3,\n\n file: FileEntry {\n\n path: PathBuf::from(\".env\"),\n\n file_name: \".env\".to_string(),\n\n total_lines: 3,\n\n },\n\n raw_string: String::from(\"\\n\"),\n","file_path":"src/fixes/lowercase_key.rs","rank":71,"score":65242.70845843175},{"content":" }\n\n\n\n Some(0)\n\n }\n\n}\n\n\n\n#[cfg(test)]\n\nmod tests {\n\n use super::*;\n\n use std::path::PathBuf;\n\n\n\n #[test]\n\n fn fix_warnings_test() {\n\n let fixer = EndingBlankLineFixer::default();\n\n let mut lines = vec![\n\n LineEntry {\n\n number: 1,\n\n file: FileEntry {\n\n path: PathBuf::from(\".env\"),\n\n file_name: \".env\".to_string(),\n","file_path":"src/fixes/ending_blank_line.rs","rank":72,"score":63138.23525149328},{"content":"use super::Fix;\n\nuse crate::common::*;\n\n\n\npub(crate) struct EndingBlankLineFixer<'a> {\n\n name: &'a str,\n\n}\n\n\n\nimpl Default for EndingBlankLineFixer<'_> {\n\n fn default() -> Self {\n\n Self {\n\n name: \"EndingBlankLine\",\n\n }\n\n }\n\n}\n\n\n\nimpl Fix for EndingBlankLineFixer<'_> {\n\n fn name(&self) -> &str {\n\n self.name\n\n }\n\n\n","file_path":"src/fixes/ending_blank_line.rs","rank":73,"score":63134.97172306282},{"content":" assert_eq!(Some(1), fixer.fix_warnings(vec![&mut warning], &mut lines));\n\n assert_eq!(\"\\n\", lines[2].raw_string);\n\n assert!(warning.is_fixed);\n\n }\n\n\n\n #[test]\n\n fn ending_blank_line_exist_test() {\n\n let fixer = EndingBlankLineFixer::default();\n\n let mut lines = vec![\n\n LineEntry {\n\n number: 1,\n\n file: FileEntry {\n\n path: PathBuf::from(\".env\"),\n\n file_name: \".env\".to_string(),\n\n total_lines: 2,\n\n },\n\n raw_string: String::from(\"FOO=BAR\"),\n\n },\n\n LineEntry {\n\n number: 2,\n","file_path":"src/fixes/ending_blank_line.rs","rank":74,"score":63131.64085536878},{"content":" fn fix_warnings(\n\n &self,\n\n warnings: Vec<&mut Warning>,\n\n lines: &mut Vec<LineEntry>,\n\n ) -> Option<usize> {\n\n let file = lines.first()?.file.clone();\n\n let last_line = lines.last()?;\n\n\n\n if !last_line.raw_string.ends_with(LF) {\n\n lines.push(LineEntry {\n\n number: lines.len() + 1,\n\n file,\n\n raw_string: LF.to_string(),\n\n });\n\n\n\n for warning in warnings {\n\n warning.mark_as_fixed()\n\n }\n\n\n\n return Some(1);\n","file_path":"src/fixes/ending_blank_line.rs","rank":75,"score":63124.73281450901},{"content":" file: FileEntry {\n\n path: PathBuf::from(\".env\"),\n\n file_name: \".env\".to_string(),\n\n total_lines: 2,\n\n },\n\n raw_string: String::from(LF),\n\n },\n\n ];\n\n\n\n assert_eq!(Some(0), fixer.fix_warnings(vec![], &mut lines));\n\n assert_eq!(lines.len(), 2);\n\n }\n\n}\n","file_path":"src/fixes/ending_blank_line.rs","rank":76,"score":63119.98869479191},{"content":" total_lines: 2,\n\n },\n\n raw_string: String::from(\"FOO=BAR\"),\n\n },\n\n LineEntry {\n\n number: 2,\n\n file: FileEntry {\n\n path: PathBuf::from(\".env\"),\n\n file_name: \".env\".to_string(),\n\n total_lines: 2,\n\n },\n\n raw_string: String::from(\"Z=Y\"),\n\n },\n\n ];\n\n let mut warning = Warning::new(\n\n lines[1].clone(),\n\n \"EndingBlankLine\",\n\n String::from(\"No blank line at the end of the file\"),\n\n );\n\n\n","file_path":"src/fixes/ending_blank_line.rs","rank":77,"score":63119.12886195012},{"content":"use crate::common::TestDir;\n\n\n\n#[test]\n","file_path":"tests/checks/ending_blank_line.rs","rank":78,"score":63083.3794403388},{"content":"use crate::common::TestDir;\n\n\n\n#[test]\n","file_path":"tests/checks/extra_blank_line.rs","rank":79,"score":63083.3794403388},{"content":" fn fix_line(&self, line: &mut LineEntry) -> Option<()> {\n\n line.raw_string.push('=');\n\n\n\n Some(())\n\n }\n\n}\n\n\n\n#[cfg(test)]\n\nmod tests {\n\n use super::*;\n\n use std::path::PathBuf;\n\n\n\n #[test]\n\n fn fix_line_test() {\n\n let fixer = KeyWithoutValueFixer::default();\n\n let mut line = LineEntry {\n\n number: 1,\n\n file: FileEntry {\n\n path: PathBuf::from(\".env\"),\n\n file_name: \".env\".to_string(),\n","file_path":"src/fixes/key_without_value.rs","rank":80,"score":62826.69915816811},{"content":"use super::Fix;\n\nuse crate::common::*;\n\n\n\npub(crate) struct KeyWithoutValueFixer<'a> {\n\n name: &'a str,\n\n}\n\n\n\nimpl Default for KeyWithoutValueFixer<'_> {\n\n fn default() -> Self {\n\n Self {\n\n name: \"KeyWithoutValue\",\n\n }\n\n }\n\n}\n\n\n\nimpl Fix for KeyWithoutValueFixer<'_> {\n\n fn name(&self) -> &str {\n\n self.name\n\n }\n\n\n","file_path":"src/fixes/key_without_value.rs","rank":81,"score":62824.802103920905},{"content":" total_lines: 1,\n\n },\n\n raw_string: String::from(\"FOO\"),\n\n };\n\n assert_eq!(Some(()), fixer.fix_line(&mut line));\n\n assert_eq!(\"FOO=\", line.raw_string);\n\n }\n\n\n\n #[test]\n\n fn fix_warnings_test() {\n\n let fixer = KeyWithoutValueFixer::default();\n\n let mut lines = vec![\n\n LineEntry {\n\n number: 1,\n\n file: FileEntry {\n\n path: PathBuf::from(\".env\"),\n\n file_name: \".env\".to_string(),\n\n total_lines: 3,\n\n },\n\n raw_string: String::from(\"FOO\"),\n","file_path":"src/fixes/key_without_value.rs","rank":82,"score":62818.14771497109},{"content":" let mut warning = Warning::new(\n\n lines[0].clone(),\n\n \"KeyWithoutValue\",\n\n String::from(\"The FOO key should be with a value or have an equal sign\"),\n\n );\n\n\n\n assert_eq!(Some(1), fixer.fix_warnings(vec![&mut warning], &mut lines));\n\n assert_eq!(\"FOO=\", lines[0].raw_string);\n\n assert!(warning.is_fixed);\n\n }\n\n}\n","file_path":"src/fixes/key_without_value.rs","rank":83,"score":62809.232513360665},{"content":" },\n\n LineEntry {\n\n number: 2,\n\n file: FileEntry {\n\n path: PathBuf::from(\".env\"),\n\n file_name: \".env\".to_string(),\n\n total_lines: 3,\n\n },\n\n raw_string: String::from(\"Z=Y\"),\n\n },\n\n LineEntry {\n\n number: 3,\n\n file: FileEntry {\n\n path: PathBuf::from(\".env\"),\n\n file_name: \".env\".to_string(),\n\n total_lines: 3,\n\n },\n\n raw_string: String::from(\"\\n\"),\n\n },\n\n ];\n","file_path":"src/fixes/key_without_value.rs","rank":84,"score":62805.15692392663},{"content":"// This trait is used for checks which needs to know of only a single line\n\ntrait Check {\n\n fn run(&mut self, line: &LineEntry) -> Option<Warning>;\n\n fn name(&self) -> &str;\n\n fn skip_comments(&self) -> bool {\n\n true\n\n }\n\n}\n\n\n","file_path":"src/checks.rs","rank":85,"score":57562.75489655691},{"content":"fn main() -> Result<(), Box<dyn Error>> {\n\n let current_dir = env::current_dir()?;\n\n let args = get_args(current_dir.as_os_str());\n\n\n\n if args.is_present(\"show-checks\") {\n\n dotenv_linter::available_check_names()\n\n .iter()\n\n .for_each(|name| println!(\"{}\", name));\n\n process::exit(0);\n\n }\n\n\n\n let is_fix = args.is_present(\"fix\");\n\n\n\n let warnings = dotenv_linter::run(&args, ¤t_dir)?;\n\n\n\n if warnings.is_empty() {\n\n process::exit(0);\n\n }\n\n\n\n if is_fix {\n","file_path":"src/main.rs","rank":86,"score":39221.815706512425},{"content":"mod args;\n\nmod checks;\n\nmod common;\n\nmod fixes;\n\nmod flags;\n\nmod options;\n","file_path":"tests/cli.rs","rank":96,"score":35405.814445055395},{"content":" \"{}:{} {}: {}\",\n\n self.line.file, self.line.number, self.check_name, self.message\n\n )\n\n }\n\n}\n\n\n\n#[cfg(test)]\n\nmod tests {\n\n use super::*;\n\n use std::path::PathBuf;\n\n\n\n #[test]\n\n fn warning_fmt_test() {\n\n let line = LineEntry {\n\n number: 1,\n\n file: FileEntry {\n\n path: PathBuf::from(\".env\"),\n\n file_name: \".env\".to_string(),\n\n total_lines: 1,\n\n },\n","file_path":"src/common/warning.rs","rank":97,"score":35108.23715626925},{"content":" }\n\n }\n\n\n\n pub fn line_number(&self) -> usize {\n\n self.line.number\n\n }\n\n\n\n pub fn mark_as_fixed(&mut self) {\n\n self.is_fixed = true;\n\n }\n\n\n\n pub fn mark_as_unfixed(&mut self) {\n\n self.is_fixed = false;\n\n }\n\n}\n\n\n\nimpl fmt::Display for Warning {\n\n fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {\n\n write!(\n\n f,\n","file_path":"src/common/warning.rs","rank":98,"score":35107.47037716739},{"content":"use std::fmt;\n\n\n\nuse crate::common::*;\n\n\n\n#[derive(Clone, Debug, PartialEq)]\n\npub struct Warning {\n\n pub check_name: String,\n\n line: LineEntry,\n\n message: String,\n\n pub is_fixed: bool,\n\n}\n\n\n\nimpl Warning {\n\n pub fn new(line: LineEntry, check_name: &str, message: String) -> Self {\n\n let check_name = String::from(check_name);\n\n Self {\n\n line,\n\n check_name,\n\n message,\n\n is_fixed: false,\n","file_path":"src/common/warning.rs","rank":99,"score":35106.136038697165}],"string":"[\n {\n \"content\": \"#[test]\\n\\nfn unfixed_warnings() {\\n\\n let testdir = TestDir::new();\\n\\n let testfile = testdir.create_testfile(\\\".env\\\", \\\"A=DEF\\\\nB=BAR \\\\nf=BAR\\\\n\\\\n\\\");\\n\\n\\n\\n let expected_output = String::from(\\n\\n \\\"Fixed warnings:\\\\n\\\\\\n\\n .env:2 TrailingWhitespace: Trailing whitespace detected\\\\n\\\\\\n\\n .env:3 LowercaseKey: The f key should be in uppercase\\\\n\\\\\\n\\n \\\\n\\\\\\n\\n Unfixed warnings:\\\\n\\\\\\n\\n .env:5 ExtraBlankLine: Extra blank line detected\\\\n\\\",\\n\\n );\\n\\n testdir.test_command_fix_fail(expected_output);\\n\\n\\n\\n assert_eq!(testfile.contents().as_str(), \\\"A=DEF\\\\nB=BAR\\\\nF=BAR\\\\n\\\\n\\\");\\n\\n\\n\\n testdir.close();\\n\\n}\\n\\n\\n\",\n \"file_path\": \"tests/fixes/mod.rs\",\n \"rank\": 1,\n \"score\": 207464.3160682502\n },\n {\n \"content\": \"pub fn run(lines: &[LineEntry], skip_checks: &[&str]) -> Vec<Warning> {\\n\\n let mut checks = checklist();\\n\\n checks.retain(|c| !skip_checks.contains(&c.name()));\\n\\n\\n\\n let mut warnings: Vec<Warning> = Vec::new();\\n\\n\\n\\n for line in lines {\\n\\n let is_comment = line.is_comment();\\n\\n for ch in &mut checks {\\n\\n if is_comment && ch.skip_comments() {\\n\\n continue;\\n\\n }\\n\\n if let Some(warning) = ch.run(line) {\\n\\n warnings.push(warning);\\n\\n }\\n\\n }\\n\\n }\\n\\n\\n\\n warnings\\n\\n}\\n\",\n \"file_path\": \"src/checks.rs\",\n \"rank\": 2,\n \"score\": 202541.9256181306\n },\n {\n \"content\": \"/// In the future versions we should create a backup copy, or at least notify the user about it\\n\\npub fn write_file(path: &PathBuf, lines: Vec<LineEntry>) -> io::Result<()> {\\n\\n let mut file = File::create(path)?;\\n\\n\\n\\n // We don't write the last line, because it contains only LF (common::FileEntry::from)\\n\\n // and writeln! already adds LF.\\n\\n for line in lines[..lines.len() - 1].iter() {\\n\\n writeln!(file, \\\"{}\\\", line.raw_string)?;\\n\\n }\\n\\n\\n\\n Ok(())\\n\\n}\\n\\n\\n\\n#[cfg(test)]\\n\\nmod tests {\\n\\n use super::*;\\n\\n use crate::common::FileEntry;\\n\\n use std::fs::{self, File};\\n\\n\\n\\n fn run_relative_path_asserts(assertions: Vec<(&str, &str, &str)>) {\\n\\n for (target, base, relative) in assertions {\\n\",\n \"file_path\": \"src/fs_utils.rs\",\n \"rank\": 3,\n \"score\": 196915.51502914648\n },\n {\n \"content\": \"#[test]\\n\\nfn lowercase_key() {\\n\\n let testdir = TestDir::new();\\n\\n let testfile = testdir.create_testfile(\\\".env\\\", \\\"abc=DEF\\\\n\\\\nfOO=BAR\\\\n\\\");\\n\\n let expected_output = String::from(\\n\\n \\\"Fixed warnings:\\\\n\\\\\\n\\n .env:1 LowercaseKey: The abc key should be in uppercase\\\\n\\\\\\n\\n .env:3 LowercaseKey: The fOO key should be in uppercase\\\\n\\\",\\n\\n );\\n\\n testdir.test_command_fix_success(expected_output);\\n\\n\\n\\n assert_eq!(testfile.contents().as_str(), \\\"ABC=DEF\\\\n\\\\nFOO=BAR\\\\n\\\");\\n\\n\\n\\n testdir.close();\\n\\n}\\n\\n\\n\",\n \"file_path\": \"tests/fixes/mod.rs\",\n \"rank\": 4,\n \"score\": 196172.34993274446\n },\n {\n \"content\": \"#[test]\\n\\nfn correct_file() {\\n\\n let testdir = TestDir::new();\\n\\n let testfile = testdir.create_testfile(\\\".env\\\", \\\"ABC=DEF\\\\nD=BAR\\\\n\\\\nFOO=BAR\\\\n\\\");\\n\\n\\n\\n testdir.test_command_fix_success(String::new());\\n\\n\\n\\n assert_eq!(testfile.contents().as_str(), \\\"ABC=DEF\\\\nD=BAR\\\\n\\\\nFOO=BAR\\\\n\\\");\\n\\n\\n\\n testdir.close();\\n\\n}\\n\\n\\n\",\n \"file_path\": \"tests/fixes/mod.rs\",\n \"rank\": 6,\n \"score\": 174608.8767300266\n },\n {\n \"content\": \"#[test]\\n\\nfn multiple_files() {\\n\\n let testdir = TestDir::new();\\n\\n\\n\\n let testfile1 = testdir.create_testfile(\\\"1.env\\\", \\\"AB=DEF\\\\nD=BAR\\\\n\\\\nF=BAR\\\\n\\\");\\n\\n let testfile2 = testdir.create_testfile(\\\"2.env\\\", \\\"abc=DEF\\\\n\\\\nF=BAR\\\\n\\\");\\n\\n let testfile3 = testdir.create_testfile(\\\"3.env\\\", \\\"A=b \\\\nab=DEF\\\\n\\\\n\\\");\\n\\n\\n\\n let expected_output = String::from(\\n\\n \\\"Fixed warnings:\\\\n\\\\\\n\\n 2.env:1 LowercaseKey: The abc key should be in uppercase\\\\n\\\\\\n\\n 3.env:1 TrailingWhitespace: Trailing whitespace detected\\\\n\\\\\\n\\n 3.env:2 LowercaseKey: The ab key should be in uppercase\\\\n\\\\\\n\\n \\\\n\\\\\\n\\n Unfixed warnings:\\\\n\\\\\\n\\n 3.env:4 ExtraBlankLine: Extra blank line detected\\\\n\\\",\\n\\n );\\n\\n testdir.test_command_fix_fail(expected_output);\\n\\n\\n\\n assert_eq!(testfile1.contents().as_str(), \\\"AB=DEF\\\\nD=BAR\\\\n\\\\nF=BAR\\\\n\\\");\\n\\n assert_eq!(testfile2.contents().as_str(), \\\"ABC=DEF\\\\n\\\\nF=BAR\\\\n\\\");\\n\\n assert_eq!(testfile3.contents().as_str(), \\\"A=b\\\\nAB=DEF\\\\n\\\\n\\\");\\n\\n\\n\\n testdir.close();\\n\\n}\\n\",\n \"file_path\": \"tests/fixes/mod.rs\",\n \"rank\": 7,\n \"score\": 174608.87673002656\n },\n {\n \"content\": \"#[test]\\n\\nfn key_without_value() {\\n\\n let testdir = TestDir::new();\\n\\n let testfile = testdir.create_testfile(\\\".env\\\", \\\"FOO\\\\n\\\\nBAR=\\\\n\\\\nBAZ=QUX\\\\n\\\");\\n\\n let expected_output = String::from(\\n\\n \\\"Fixed warnings:\\\\n\\\\\\n\\n .env:1 KeyWithoutValue: The FOO key should be with a value or have an equal sign\\\\n\\\",\\n\\n );\\n\\n testdir.test_command_fix_success(expected_output);\\n\\n\\n\\n assert_eq!(testfile.contents().as_str(), \\\"FOO=\\\\n\\\\nBAR=\\\\n\\\\nBAZ=QUX\\\\n\\\");\\n\\n\\n\\n testdir.close();\\n\\n}\\n\\n\\n\",\n \"file_path\": \"tests/fixes/mod.rs\",\n \"rank\": 8,\n \"score\": 168043.80988036483\n },\n {\n \"content\": \"pub fn available_check_names() -> Vec<String> {\\n\\n checklist()\\n\\n .iter()\\n\\n .map(|check| check.name().to_string())\\n\\n .collect()\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/checks.rs\",\n \"rank\": 9,\n \"score\": 157085.33004449407\n },\n {\n \"content\": \"#[allow(clippy::redundant_closure)]\\n\\npub fn run(args: &clap::ArgMatches, current_dir: &PathBuf) -> Result<Vec<Warning>, Box<dyn Error>> {\\n\\n let mut file_paths: Vec<PathBuf> = Vec::new();\\n\\n let mut skip_checks: Vec<&str> = Vec::new();\\n\\n let mut excluded_paths: Vec<PathBuf> = Vec::new();\\n\\n\\n\\n let is_recursive = args.is_present(\\\"recursive\\\");\\n\\n\\n\\n if let Some(skip) = args.values_of(\\\"skip\\\") {\\n\\n skip_checks = skip.collect();\\n\\n }\\n\\n\\n\\n if let Some(excluded) = args.values_of(\\\"exclude\\\") {\\n\\n excluded_paths = excluded\\n\\n .filter_map(|f| fs_utils::canonicalize(f).ok())\\n\\n .collect();\\n\\n }\\n\\n\\n\\n if let Some(inputs) = args.values_of(\\\"input\\\") {\\n\\n let input_paths = inputs\\n\\n .filter_map(|s| fs_utils::canonicalize(s).ok())\\n\",\n \"file_path\": \"src/lib.rs\",\n \"rank\": 10,\n \"score\": 151794.52968669118\n },\n {\n \"content\": \"fn get_line_entries(fe: &FileEntry, lines: Vec<String>) -> Vec<LineEntry> {\\n\\n let mut entries: Vec<LineEntry> = Vec::with_capacity(fe.total_lines);\\n\\n\\n\\n for (index, line) in lines.into_iter().enumerate() {\\n\\n entries.push(LineEntry {\\n\\n number: index + 1,\\n\\n file: fe.clone(),\\n\\n raw_string: line,\\n\\n })\\n\\n }\\n\\n\\n\\n entries\\n\\n}\\n\",\n \"file_path\": \"src/lib.rs\",\n \"rank\": 11,\n \"score\": 144748.96244230264\n },\n {\n \"content\": \"/// Returns the relative path for `target_path` relative to `base_path`\\n\\npub fn get_relative_path(target_path: &PathBuf, base_path: &PathBuf) -> Option<PathBuf> {\\n\\n let comp_target: Vec<_> = target_path.components().collect();\\n\\n let comp_base: Vec<_> = base_path.components().collect();\\n\\n\\n\\n let mut i = 0;\\n\\n for (b, t) in comp_base.iter().zip(comp_target.iter()) {\\n\\n if b != t {\\n\\n break;\\n\\n }\\n\\n i += 1;\\n\\n }\\n\\n\\n\\n let mut relative_path = PathBuf::new();\\n\\n\\n\\n for _ in 0..(comp_base.len() - i) {\\n\\n relative_path.push(\\\"..\\\");\\n\\n }\\n\\n relative_path.extend(comp_target.get(i..)?);\\n\\n\\n\\n Some(relative_path)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/fs_utils.rs\",\n \"rank\": 12,\n \"score\": 139261.1966945178\n },\n {\n \"content\": \"#[test]\\n\\nfn exclude_two_files() {\\n\\n let test_dir = TestDir::new();\\n\\n let testfile_1 = test_dir.create_testfile(\\\".env\\\", \\\" FOO=\\\\n\\\");\\n\\n let testfile_2 = test_dir.create_testfile(\\\".loacl.env\\\", \\\" BAR=\\\\n\\\");\\n\\n\\n\\n test_dir.test_command_success_with_args(&[\\n\\n \\\"-e\\\",\\n\\n testfile_1.as_str(),\\n\\n \\\"-e\\\",\\n\\n testfile_2.as_str(),\\n\\n ]);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"tests/options/exclude.rs\",\n \"rank\": 13,\n \"score\": 138800.32975634045\n },\n {\n \"content\": \"#[test]\\n\\nfn exclude_one_file() {\\n\\n let test_dir = TestDir::new();\\n\\n let testfile = test_dir.create_testfile(\\\".env\\\", \\\" FOO=\\\\n\\\");\\n\\n test_dir.test_command_success_with_args(&[\\\"--exclude\\\", testfile.as_str()]);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"tests/options/exclude.rs\",\n \"rank\": 14,\n \"score\": 138800.32975634045\n },\n {\n \"content\": \"#[test]\\n\\nfn ending_blank_line() {\\n\\n let testdir = TestDir::new();\\n\\n let testfile = testdir.create_testfile(\\\".env\\\", \\\"ABC=DEF\\\\nFOO=BAR\\\");\\n\\n let expected_output = String::from(\\n\\n \\\"Fixed warnings:\\\\n\\\\\\n\\n .env:2 EndingBlankLine: No blank line at the end of the file\\\\n\\\",\\n\\n );\\n\\n testdir.test_command_fix_success(expected_output);\\n\\n\\n\\n assert_eq!(testfile.contents().as_str(), \\\"ABC=DEF\\\\nFOO=BAR\\\\n\\\");\\n\\n\\n\\n testdir.close();\\n\\n}\\n\",\n \"file_path\": \"tests/fixes/ending_blank_line.rs\",\n \"rank\": 15,\n \"score\": 138282.65747538724\n },\n {\n \"content\": \"#[test]\\n\\nfn exclude_one_file_check_one_file() {\\n\\n let test_dir = TestDir::new();\\n\\n let testfile_to_check = test_dir.create_testfile(\\\".env\\\", \\\" FOO=\\\\n\\\");\\n\\n let testfile_to_exclude = test_dir.create_testfile(\\\".exclude-me.env\\\", \\\" BAR=\\\\n\\\");\\n\\n\\n\\n let args = &[\\\"--exclude\\\", testfile_to_exclude.as_str()];\\n\\n let expected_output = format!(\\n\\n \\\"{}:1 LeadingCharacter: Invalid leading character detected\\\\n\\\\nFound 1 problem\\\\n\\\",\\n\\n testfile_to_check.shortname_as_str()\\n\\n );\\n\\n\\n\\n test_dir.test_command_fail_with_args(args, expected_output);\\n\\n}\\n\",\n \"file_path\": \"tests/options/exclude.rs\",\n \"rank\": 16,\n \"score\": 136265.62854983204\n },\n {\n \"content\": \"#[test]\\n\\nfn correct_files() {\\n\\n let contents = vec![\\n\\n \\\"A=B\\\\nF=BAR\\\\n\\\\nFOO=BAR\\\\n\\\",\\n\\n \\\"A=B\\\\r\\\\nF=BAR\\\\r\\\\n\\\\r\\\\nFOO=BAR\\\\r\\\\n\\\",\\n\\n \\\"\\\\n# comment\\\\n\\\\nABC=DEF\\\\n\\\",\\n\\n ];\\n\\n\\n\\n for content in contents {\\n\\n let testdir = TestDir::new();\\n\\n let testfile = testdir.create_testfile(\\\".env\\\", content);\\n\\n let args = &[testfile.as_str()];\\n\\n\\n\\n testdir.test_command_success_with_args(args);\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"tests/checks/extra_blank_line.rs\",\n \"rank\": 17,\n \"score\": 133713.34845925934\n },\n {\n \"content\": \"#[test]\\n\\nfn incorrect_files() {\\n\\n let contents = vec![\\n\\n \\\"ABC=DEF\\\\nD=BAR\\\\nFOO=BAR\\\",\\n\\n \\\"C=D\\\\r\\\\nK=L\\\\r\\\\nX=Y\\\",\\n\\n \\\"A=B\\\",\\n\\n \\\"# Comment 1\\\\n# Comment 2\\\\n# Comment 3\\\",\\n\\n ];\\n\\n let expected_line_numbers = vec![3, 3, 1, 3];\\n\\n\\n\\n for (i, content) in contents.iter().enumerate() {\\n\\n let testdir = TestDir::new();\\n\\n let testfile = testdir.create_testfile(\\\".env\\\", content);\\n\\n let args = &[testfile.as_str()];\\n\\n let expected_output = format!(\\n\\n \\\"{}:{} EndingBlankLine: No blank line at the end of the file\\\\n\\\\nFound 1 problem\\\\n\\\",\\n\\n testfile.shortname_as_str(),\\n\\n expected_line_numbers[i]\\n\\n );\\n\\n\\n\\n testdir.test_command_fail_with_args(args, expected_output);\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"tests/checks/ending_blank_line.rs\",\n \"rank\": 18,\n \"score\": 133713.34845925937\n },\n {\n \"content\": \"#[test]\\n\\nfn correct_files() {\\n\\n let contents = vec![\\n\\n \\\"A=B\\\\nF=BAR\\\\nFOO=BAR\\\\n\\\",\\n\\n \\\"A=B\\\\r\\\\nF=BAR\\\\r\\\\nFOO=BAR\\\\r\\\\n\\\",\\n\\n \\\"# comment\\\\nABC=DEF\\\\n\\\",\\n\\n ];\\n\\n\\n\\n for content in contents {\\n\\n let testdir = TestDir::new();\\n\\n let testfile = testdir.create_testfile(\\\".env\\\", content);\\n\\n let args = &[testfile.as_str()];\\n\\n\\n\\n testdir.test_command_success_with_args(args);\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"tests/checks/ending_blank_line.rs\",\n \"rank\": 19,\n \"score\": 133713.34845925937\n },\n {\n \"content\": \"#[test]\\n\\nfn checks_one_specific_file_and_one_path() {\\n\\n let testdir = TestDir::new();\\n\\n testdir.create_testfile(\\\".env\\\", \\\"foo=\\\");\\n\\n let testfile_2 = testdir.create_testfile(\\\"test-env-file\\\", \\\"FOO=BAR\\\\nBAR=FOO\\\\n\\\");\\n\\n\\n\\n let subdir = testdir.subdir();\\n\\n let testfile_3 = subdir.create_testfile(\\\"test.env\\\", \\\"FOO=BAR\\\\nFOO=BAR\\\\n\\\");\\n\\n\\n\\n let args = &[testfile_2.as_str(), subdir.as_str()];\\n\\n let expected_output = format!(\\n\\n \\\"{}:2 UnorderedKey: The BAR key should go before the FOO key\\\\n{}:2 DuplicatedKey: The FOO key is duplicated\\\\n\\\\nFound 2 problems\\\\n\\\",\\n\\n testfile_2.shortname_as_str(),\\n\\n Path::new(&testdir.relative_path(&subdir))\\n\\n .join(testfile_3.shortname_as_str())\\n\\n .to_str().expect(\\\"multi-platform path to test .env file\\\"),\\n\\n );\\n\\n\\n\\n testdir.test_command_fail_with_args(args, expected_output);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"tests/args/specific_path.rs\",\n \"rank\": 20,\n \"score\": 132830.57445029358\n },\n {\n \"content\": \"#[test]\\n\\nfn checks_one_specific_file() {\\n\\n let test_dir = TestDir::new();\\n\\n test_dir.create_testfile(\\\".env\\\", \\\"foo=\\\\n\\\");\\n\\n let testfile_2 = test_dir.create_testfile(\\\"test-env-file\\\", \\\"FOO =\\\\n\\\");\\n\\n\\n\\n let args = &[testfile_2.as_str()];\\n\\n let expected_output = format!(\\n\\n \\\"{}:1 SpaceCharacter: The line has spaces around equal sign\\\\n\\\\nFound 1 problem\\\\n\\\",\\n\\n testfile_2.shortname_as_str()\\n\\n );\\n\\n\\n\\n test_dir.test_command_fail_with_args(args, expected_output);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"tests/args/specific_path.rs\",\n \"rank\": 21,\n \"score\": 130432.50197138556\n },\n {\n \"content\": \"#[test]\\n\\nfn checks_two_specific_files() {\\n\\n let testdir = TestDir::new();\\n\\n testdir.create_testfile(\\\".env\\\", \\\"foo=\\\");\\n\\n let testfile_2 = testdir.create_testfile(\\\"test-env-file\\\", \\\"FOO =\\\\n\\\");\\n\\n\\n\\n let subdir = testdir.subdir();\\n\\n let testfile_3 = subdir.create_testfile(\\\"another_test_file\\\", \\\"FOO=BAR\\\\nFOO=BAR\\\\n\\\");\\n\\n\\n\\n let args = &[testfile_2.as_str(), testfile_3.as_str()];\\n\\n let expected_output = format!(\\n\\n \\\"{}:2 DuplicatedKey: The FOO key is duplicated\\\\n{}:1 SpaceCharacter: The line has spaces around equal sign\\\\n\\\\nFound 2 problems\\\\n\\\",\\n\\n Path::new(&testdir.relative_path(&subdir))\\n\\n .join(testfile_3.shortname_as_str())\\n\\n .to_str().expect(\\\"multi-platform path to test .env file\\\"),\\n\\n testfile_2.shortname_as_str(),\\n\\n );\\n\\n\\n\\n testdir.test_command_fail_with_args(args, expected_output);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"tests/args/specific_path.rs\",\n \"rank\": 22,\n \"score\": 130432.50197138556\n },\n {\n \"content\": \"#[test]\\n\\nfn checks_one_specific_file_twice() {\\n\\n let test_dir = TestDir::new();\\n\\n test_dir.create_testfile(\\\".env\\\", \\\"foo=\\\");\\n\\n let testfile_2 = test_dir.create_testfile(\\\"test-env-file\\\", \\\"1FOO=\\\\n\\\");\\n\\n\\n\\n let args = &[testfile_2.as_str(), testfile_2.as_str()];\\n\\n let expected_output = format!(\\n\\n \\\"{}:1 LeadingCharacter: Invalid leading character detected\\\\n\\\\nFound 1 problem\\\\n\\\",\\n\\n testfile_2.shortname_as_str()\\n\\n );\\n\\n\\n\\n test_dir.test_command_fail_with_args(args, expected_output);\\n\\n}\\n\",\n \"file_path\": \"tests/args/specific_path.rs\",\n \"rank\": 23,\n \"score\": 126697.69742909273\n },\n {\n \"content\": \"pub fn remove_invalid_leading_chars(string: &str) -> String {\\n\\n string\\n\\n .chars()\\n\\n .skip_while(|&c| !(c.is_alphabetic() || c == '_'))\\n\\n .collect()\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/common.rs\",\n \"rank\": 25,\n \"score\": 118888.04419122054\n },\n {\n \"content\": \"fn get_file_paths(\\n\\n dir_entries: Vec<PathBuf>,\\n\\n excludes: &[PathBuf],\\n\\n is_recursive: bool,\\n\\n) -> Vec<PathBuf> {\\n\\n let nested_paths: Vec<PathBuf> = dir_entries\\n\\n .iter()\\n\\n .filter(|entry| entry.is_dir())\\n\\n .filter(|entry| !excludes.contains(entry))\\n\\n .filter_map(|dir| dir.read_dir().ok())\\n\\n .map(|read_dir| {\\n\\n read_dir\\n\\n .filter_map(|e| e.ok())\\n\\n .map(|e| e.path())\\n\\n .filter(|path| FileEntry::is_env_file(path) || (is_recursive && path.is_dir()))\\n\\n .collect()\\n\\n })\\n\\n .flat_map(|dir_entries| get_file_paths(dir_entries, excludes, is_recursive))\\n\\n .collect();\\n\\n\\n\",\n \"file_path\": \"src/lib.rs\",\n \"rank\": 26,\n \"score\": 111880.81367185828\n },\n {\n \"content\": \"#[test]\\n\\nfn checks_two_specific_paths() {\\n\\n let testdir = TestDir::new();\\n\\n testdir.create_testfile(\\\".env\\\", \\\"foo=\\\\n\\\");\\n\\n\\n\\n let subdir_1 = testdir.subdir();\\n\\n let testfile_2 = subdir_1.create_testfile(\\\".env\\\", \\\" FOO=\\\\n\\\");\\n\\n\\n\\n let subdir_2 = subdir_1.subdir();\\n\\n let testfile_3 = subdir_2.create_testfile(\\\".env\\\", \\\" FOO=\\\\n\\\");\\n\\n\\n\\n let args = &[subdir_1.as_str(), subdir_2.as_str()];\\n\\n let expected_output = format!(\\n\\n \\\"{}:1 LeadingCharacter: Invalid leading character detected\\\\n{}:1 LeadingCharacter: Invalid leading character detected\\\\n\\\\nFound 2 problems\\\\n\\\",\\n\\n Path::new(&testdir.relative_path(&subdir_1))\\n\\n .join(testfile_2.shortname_as_str())\\n\\n .to_str().expect(\\\"multi-platform path to test .env file\\\"),\\n\\n Path::new(&testdir.relative_path(&subdir_2))\\n\\n .join(testfile_3.shortname_as_str())\\n\\n .to_str().expect(\\\"multi-platform path to test .env file\\\"),\\n\\n );\\n\\n\\n\\n testdir.test_command_fail_with_args(args, expected_output);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"tests/args/specific_path.rs\",\n \"rank\": 27,\n \"score\": 110916.87040246681\n },\n {\n \"content\": \"#[test]\\n\\nfn checks_one_specific_path() {\\n\\n let testdir = TestDir::new();\\n\\n testdir.create_testfile(\\\".env\\\", \\\"foo=\\\\n\\\");\\n\\n\\n\\n let subdir = testdir.subdir();\\n\\n let testfile_2 = subdir.create_testfile(\\\".env.test\\\", \\\"1FOO=\\\\n\\\");\\n\\n\\n\\n let args = &[subdir.as_str()];\\n\\n let expected_output = format!(\\n\\n \\\"{}:1 LeadingCharacter: Invalid leading character detected\\\\n\\\\nFound 1 problem\\\\n\\\",\\n\\n Path::new(&testdir.relative_path(&subdir))\\n\\n .join(testfile_2.shortname_as_str())\\n\\n .to_str()\\n\\n .expect(\\\"multi-platform path to test .env file\\\")\\n\\n );\\n\\n\\n\\n testdir.test_command_fail_with_args(args, expected_output);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"tests/args/specific_path.rs\",\n \"rank\": 28,\n \"score\": 110916.87040246681\n },\n {\n \"content\": \"#[test]\\n\\nfn exits_with_0_on_no_warnings() {\\n\\n let test_dir = TestDir::new();\\n\\n test_dir.create_testfile(\\\".env\\\", \\\"FOO=bar\\\\n\\\");\\n\\n test_dir.test_command_success();\\n\\n}\\n\\n\\n\",\n \"file_path\": \"tests/args/current_dir.rs\",\n \"rank\": 29,\n \"score\": 107703.19972802594\n },\n {\n \"content\": \"#[test]\\n\\nfn two_blank_lines_in_the_middle() {\\n\\n let content = \\\"ABC=DEF\\\\nD=BAR\\\\n\\\\n\\\\nFOO=BAR\\\\n\\\";\\n\\n\\n\\n let testdir = TestDir::new();\\n\\n let testfile = testdir.create_testfile(\\\".env\\\", content);\\n\\n let args = &[testfile.as_str()];\\n\\n let expected_output = format!(\\n\\n \\\"{}:{} ExtraBlankLine: Extra blank line detected\\\\n\\\\nFound 1 problem\\\\n\\\",\\n\\n testfile.shortname_as_str(),\\n\\n 4\\n\\n );\\n\\n\\n\\n testdir.test_command_fail_with_args(args, expected_output);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"tests/checks/extra_blank_line.rs\",\n \"rank\": 30,\n \"score\": 107338.30223778376\n },\n {\n \"content\": \"#[test]\\n\\nfn two_blank_lines_at_the_beginning() {\\n\\n let content = \\\"\\\\n\\\\nABC=DEF\\\\nD=BAR\\\\nFOO=BAR\\\\n\\\";\\n\\n\\n\\n let testdir = TestDir::new();\\n\\n let testfile = testdir.create_testfile(\\\".env\\\", content);\\n\\n let args = &[testfile.as_str()];\\n\\n let expected_output = format!(\\n\\n \\\"{}:{} ExtraBlankLine: Extra blank line detected\\\\n\\\\nFound 1 problem\\\\n\\\",\\n\\n testfile.shortname_as_str(),\\n\\n 2\\n\\n );\\n\\n\\n\\n testdir.test_command_fail_with_args(args, expected_output);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"tests/checks/extra_blank_line.rs\",\n \"rank\": 31,\n \"score\": 107338.30223778376\n },\n {\n \"content\": \"#[test]\\n\\nfn two_blank_lines_at_the_end() {\\n\\n let content = \\\"ABC=DEF\\\\nD=BAR\\\\nFOO=BAR\\\\n\\\\n\\\";\\n\\n\\n\\n let testdir = TestDir::new();\\n\\n let testfile = testdir.create_testfile(\\\".env\\\", content);\\n\\n let args = &[testfile.as_str()];\\n\\n let expected_output = format!(\\n\\n \\\"{}:{} ExtraBlankLine: Extra blank line detected\\\\n\\\\nFound 1 problem\\\\n\\\",\\n\\n testfile.shortname_as_str(),\\n\\n 5\\n\\n );\\n\\n\\n\\n testdir.test_command_fail_with_args(args, expected_output);\\n\\n}\\n\",\n \"file_path\": \"tests/checks/extra_blank_line.rs\",\n \"rank\": 32,\n \"score\": 107338.30223778376\n },\n {\n \"content\": \"#[test]\\n\\nfn trailing_whitespace() {\\n\\n let testdir = TestDir::new();\\n\\n let testfile = testdir.create_testfile(\\\".env\\\", \\\"ABC=DEF \\\\n\\\\nFOO=BAR \\\\n\\\");\\n\\n let expected_output = String::from(\\n\\n \\\"Fixed warnings:\\\\n\\\\\\n\\n .env:1 TrailingWhitespace: Trailing whitespace detected\\\\n\\\\\\n\\n .env:3 TrailingWhitespace: Trailing whitespace detected\\\\n\\\",\\n\\n );\\n\\n testdir.test_command_fix_success(expected_output);\\n\\n\\n\\n assert_eq!(testfile.contents().as_str(), \\\"ABC=DEF\\\\n\\\\nFOO=BAR\\\\n\\\");\\n\\n\\n\\n testdir.close();\\n\\n}\\n\",\n \"file_path\": \"tests/fixes/trailing_whitespace.rs\",\n \"rank\": 33,\n \"score\": 106736.65892221834\n },\n {\n \"content\": \"#[test]\\n\\nfn quote_character() {\\n\\n let testdir = TestDir::new();\\n\\n let testfile = testdir.create_testfile(\\\".env\\\", \\\"ABC=\\\\\\\"DEF\\\\\\\"\\\\n\\\\nFOO=\\\\'B\\\\\\\"AR\\\\'\\\\n\\\");\\n\\n let expected_output = String::from(\\n\\n \\\"Fixed warnings:\\\\n\\\\\\n\\n .env:1 QuoteCharacter: The value has quote characters (\\\\', \\\\\\\")\\\\n\\\\\\n\\n .env:3 QuoteCharacter: The value has quote characters (\\\\', \\\\\\\")\\\\n\\\",\\n\\n );\\n\\n testdir.test_command_fix_success(expected_output);\\n\\n\\n\\n assert_eq!(testfile.contents().as_str(), \\\"ABC=DEF\\\\n\\\\nFOO=BAR\\\\n\\\");\\n\\n\\n\\n testdir.close();\\n\\n}\\n\",\n \"file_path\": \"tests/fixes/quote_character.rs\",\n \"rank\": 34,\n \"score\": 106736.65892221834\n },\n {\n \"content\": \"#[test]\\n\\nfn space_character() {\\n\\n let testdir = TestDir::new();\\n\\n let testfile = testdir.create_testfile(\\\".env\\\", \\\"ABC = DEF\\\\n\\\\nFOO= BAR\\\\n\\\");\\n\\n let expected_output = String::from(\\n\\n \\\"Fixed warnings:\\\\n\\\\\\n\\n .env:1 SpaceCharacter: The line has spaces around equal sign\\\\n\\\\\\n\\n .env:3 SpaceCharacter: The line has spaces around equal sign\\\\n\\\",\\n\\n );\\n\\n testdir.test_command_fix_success(expected_output);\\n\\n\\n\\n assert_eq!(testfile.contents().as_str(), \\\"ABC=DEF\\\\n\\\\nFOO=BAR\\\\n\\\");\\n\\n\\n\\n testdir.close();\\n\\n}\\n\",\n \"file_path\": \"tests/fixes/space_character.rs\",\n \"rank\": 35,\n \"score\": 106736.65892221834\n },\n {\n \"content\": \"#[test]\\n\\nfn checks_files_in_deep_subdirs() {\\n\\n let test_dir = TestDir::new();\\n\\n test_dir.create_testfile(\\\"correct.env\\\", \\\"FOO=BAR\\\\n\\\");\\n\\n\\n\\n let test_subdir_2 = test_dir.subdir();\\n\\n let testfile_2 = test_subdir_2.create_testfile(\\\"incorrect.sub_1.env\\\", \\\"FOO=BAR\\\\nBAR=FOO\\\\n\\\");\\n\\n\\n\\n let test_subdir_3 = test_subdir_2.subdir();\\n\\n let testfile_3 = test_subdir_3.create_testfile(\\\".incorrect.env\\\", \\\"FOO=\\\");\\n\\n\\n\\n let args = &[\\\"--recursive\\\"];\\n\\n let expected_output = format!(\\n\\n \\\"{}:2 UnorderedKey: The BAR key should go before the FOO key\\\\n{}:1 EndingBlankLine: No blank line at the end of the file\\\\n\\\\nFound 2 problems\\\\n\\\",\\n\\n Path::new(&test_dir.relative_path(&test_subdir_2))\\n\\n .join(testfile_2.shortname_as_str())\\n\\n .to_str()\\n\\n .expect(\\\"multi-platform path to test .env file\\\"),\\n\\n Path::new(&test_dir.relative_path(&test_subdir_3))\\n\\n .join(testfile_3.shortname_as_str())\\n\\n .to_str()\\n\\n .expect(\\\"multi-platform path to test .env file\\\")\\n\\n );\\n\\n\\n\\n test_dir.test_command_fail_with_args(args, expected_output);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"tests/flags/recursive.rs\",\n \"rank\": 36,\n \"score\": 104266.85934371926\n },\n {\n \"content\": \"mod exclude;\\n\",\n \"file_path\": \"tests/options/mod.rs\",\n \"rank\": 37,\n \"score\": 103975.18667743792\n },\n {\n \"content\": \"mod quote_character;\\n\\n\\n\\nuse crate::common::TestDir;\\n\\n\\n\\nmod ending_blank_line;\\n\\nmod space_character;\\n\\nmod trailing_whitespace;\\n\\n\\n\\n#[test]\\n\",\n \"file_path\": \"tests/fixes/mod.rs\",\n \"rank\": 38,\n \"score\": 102841.11388378526\n },\n {\n \"content\": \"use crate::common::TestDir;\\n\\n\\n\\n#[test]\\n\",\n \"file_path\": \"tests/fixes/ending_blank_line.rs\",\n \"rank\": 39,\n \"score\": 94533.4285137353\n },\n {\n \"content\": \"fn get_args(current_dir: &OsStr) -> clap::ArgMatches {\\n\\n clap::App::new(env!(\\\"CARGO_PKG_NAME\\\"))\\n\\n .about(env!(\\\"CARGO_PKG_DESCRIPTION\\\"))\\n\\n .author(env!(\\\"CARGO_PKG_AUTHORS\\\"))\\n\\n .version(env!(\\\"CARGO_PKG_VERSION\\\"))\\n\\n .version_short(\\\"v\\\")\\n\\n .arg(\\n\\n Arg::with_name(\\\"input\\\")\\n\\n .help(\\\"files or paths\\\")\\n\\n .index(1)\\n\\n .default_value_os(current_dir)\\n\\n .required(true)\\n\\n .multiple(true),\\n\\n )\\n\\n .arg(\\n\\n Arg::with_name(\\\"exclude\\\")\\n\\n .short(\\\"e\\\")\\n\\n .long(\\\"exclude\\\")\\n\\n .value_name(\\\"FILE_NAME\\\")\\n\\n .help(\\\"Excludes files from check\\\")\\n\",\n \"file_path\": \"src/main.rs\",\n \"rank\": 40,\n \"score\": 88836.69772615742\n },\n {\n \"content\": \"// Checklist for checks which needs to know of only a single line\\n\\nfn checklist() -> Vec<Box<dyn Check>> {\\n\\n vec![\\n\\n Box::new(duplicated_key::DuplicatedKeyChecker::default()),\\n\\n Box::new(ending_blank_line::EndingBlankLineChecker::default()),\\n\\n Box::new(extra_blank_line::ExtraBlankLineChecker::default()),\\n\\n Box::new(incorrect_delimiter::IncorrectDelimiterChecker::default()),\\n\\n Box::new(leading_character::LeadingCharacterChecker::default()),\\n\\n Box::new(key_without_value::KeyWithoutValueChecker::default()),\\n\\n Box::new(lowercase_key::LowercaseKeyChecker::default()),\\n\\n Box::new(quote_character::QuoteCharacterChecker::default()),\\n\\n Box::new(space_character::SpaceCharacterChecker::default()),\\n\\n Box::new(trailing_whitespace::TrailingWhitespaceChecker::default()),\\n\\n Box::new(unordered_key::UnorderedKeyChecker::default()),\\n\\n ]\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/checks.rs\",\n \"rank\": 41,\n \"score\": 83056.47165956532\n },\n {\n \"content\": \"#[test]\\n\\nfn output_without_total() {\\n\\n let test_dir = TestDir::new();\\n\\n let testfile_to_check = test_dir.create_testfile(\\\".env\\\", \\\" BAR='Baz'\\\\n\\\");\\n\\n\\n\\n let args = &[\\\"--quiet\\\"];\\n\\n let expected_output = format!(\\n\\n \\\"{a}:1 LeadingCharacter: Invalid leading character detected\\\\n{a}:1 QuoteCharacter: The value has quote characters (\\\\', \\\\\\\")\\\\n\\\",\\n\\n a=testfile_to_check.shortname_as_str()\\n\\n );\\n\\n\\n\\n test_dir.test_command_fail_with_args(args, expected_output);\\n\\n}\\n\",\n \"file_path\": \"tests/flags/quiet.rs\",\n \"rank\": 42,\n \"score\": 76419.81729152259\n },\n {\n \"content\": \"#[test]\\n\\nfn checks_one_in_subdir() {\\n\\n let test_dir = TestDir::new();\\n\\n test_dir.create_testfile(\\\"correct.env\\\", \\\"FOO=BAR\\\\n\\\");\\n\\n let test_subdir = test_dir.subdir();\\n\\n let testfile_2 = test_subdir.create_testfile(\\\".incorrect.env\\\", \\\"1BAR=\\\\n\\\");\\n\\n\\n\\n let args = &[\\\"-r\\\"];\\n\\n let expected_output = format!(\\n\\n \\\"{}:1 LeadingCharacter: Invalid leading character detected\\\\n\\\\nFound 1 problem\\\\n\\\",\\n\\n Path::new(&test_dir.relative_path(&test_subdir))\\n\\n .join(testfile_2.shortname_as_str())\\n\\n .to_str()\\n\\n .expect(\\\"multi-platform path to test .env file\\\")\\n\\n );\\n\\n\\n\\n test_dir.test_command_fail_with_args(args, expected_output);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"tests/flags/recursive.rs\",\n \"rank\": 43,\n \"score\": 76419.81729152259\n },\n {\n \"content\": \"#[test]\\n\\nfn checks_current_dir() {\\n\\n let testdir = TestDir::new();\\n\\n let testfile = testdir.create_testfile(\\\".env\\\", \\\"FOO\\\\n\\\");\\n\\n\\n\\n testdir.test_command_fail(\\n\\n format!(\\n\\n \\\"{}:1 KeyWithoutValue: The FOO key should be with a value or have an equal sign\\\\n\\\\nFound 1 problem\\\\n\\\",\\n\\n testfile.shortname_as_str()\\n\\n )\\n\\n );\\n\\n}\\n\\n\\n\",\n \"file_path\": \"tests/args/current_dir.rs\",\n \"rank\": 44,\n \"score\": 74303.72632516392\n },\n {\n \"content\": \"#[test]\\n\\nfn checks_recursive_with_exclude_subdir() {\\n\\n let test_dir = TestDir::new();\\n\\n test_dir.create_testfile(\\\"correct.env\\\", \\\"FOO=BAR\\\\n\\\");\\n\\n\\n\\n let test_subdir_2 = test_dir.subdir();\\n\\n let testfile_2 = test_subdir_2.create_testfile(\\\"incorrect.sub_1.env\\\", \\\"FOO=BAR\\\\nBAR=FOO\\\\n\\\");\\n\\n\\n\\n let test_subdir_3 = test_subdir_2.subdir();\\n\\n let testfile_to_exclude = test_subdir_3.create_testfile(\\\".incorrect.env\\\", \\\"FOO=\\\");\\n\\n\\n\\n let args = &[\\\"--exclude\\\", testfile_to_exclude.as_str(), \\\"--recursive\\\"];\\n\\n let expected_output = format!(\\n\\n \\\"{}:2 UnorderedKey: The BAR key should go before the FOO key\\\\n\\\\nFound 1 problem\\\\n\\\",\\n\\n Path::new(&test_dir.relative_path(&test_subdir_2))\\n\\n .join(testfile_2.shortname_as_str())\\n\\n .to_str()\\n\\n .expect(\\\"multi-platform path to test .env file\\\"),\\n\\n );\\n\\n\\n\\n test_dir.test_command_fail_with_args(args, expected_output);\\n\\n}\\n\",\n \"file_path\": \"tests/flags/recursive.rs\",\n \"rank\": 45,\n \"score\": 74303.72632516392\n },\n {\n \"content\": \"#[test]\\n\\nfn checks_without_recursive_flag() {\\n\\n let test_dir = TestDir::new();\\n\\n test_dir.create_testfile(\\\"correct.env\\\", \\\"FOO=BAR\\\\n\\\");\\n\\n let test_subdir = test_dir.subdir();\\n\\n test_subdir.create_testfile(\\\".incorrect.env\\\", \\\"1BAR=\\\\n\\\");\\n\\n\\n\\n // incorrect file located in a subdirectory should not be checked\\n\\n test_dir.test_command_success();\\n\\n}\\n\\n\\n\",\n \"file_path\": \"tests/flags/recursive.rs\",\n \"rank\": 46,\n \"score\": 74303.72632516392\n },\n {\n \"content\": \"#[test]\\n\\nfn remove_invalid_leading_chars_test() {\\n\\n let string = String::from(\\\"-1&*FOO\\\");\\n\\n assert_eq!(\\\"FOO\\\", remove_invalid_leading_chars(&string));\\n\\n\\n\\n let string = String::from(\\\"***FOO-BAR\\\");\\n\\n assert_eq!(\\\"FOO-BAR\\\", remove_invalid_leading_chars(&string));\\n\\n}\\n\",\n \"file_path\": \"src/common.rs\",\n \"rank\": 47,\n \"score\": 74303.72632516392\n },\n {\n \"content\": \"fn print_total(total: usize) {\\n\\n let mut problems = String::from(\\\"problem\\\");\\n\\n\\n\\n if total > 1 {\\n\\n problems += \\\"s\\\";\\n\\n }\\n\\n\\n\\n println!(\\\"\\\\n{}\\\", format!(\\\"Found {} {}\\\", total, problems));\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/main.rs\",\n \"rank\": 48,\n \"score\": 73940.5364243457\n },\n {\n \"content\": \"#[test]\\n\\nfn checks_current_dir_with_dot_arg() {\\n\\n let testdir = TestDir::new();\\n\\n let testfile = testdir.create_testfile(\\\"test.env\\\", \\\"foo=\\\\n\\\");\\n\\n\\n\\n let args = &[\\\".\\\"];\\n\\n let expected_output = format!(\\n\\n \\\"{}:1 LowercaseKey: The foo key should be in uppercase\\\\n\\\\nFound 1 problem\\\\n\\\",\\n\\n testfile.shortname_as_str(),\\n\\n );\\n\\n\\n\\n testdir.test_command_fail_with_args(args, expected_output);\\n\\n}\\n\",\n \"file_path\": \"tests/args/current_dir.rs\",\n \"rank\": 49,\n \"score\": 70484.39821908093\n },\n {\n \"content\": \"use crate::common::TestDir;\\n\\n\\n\\n#[test]\\n\",\n \"file_path\": \"tests/options/exclude.rs\",\n \"rank\": 50,\n \"score\": 69110.61139044068\n },\n {\n \"content\": \"\\n\\n fn init_cmd() -> Command {\\n\\n Command::cargo_bin(env!(\\\"CARGO_PKG_NAME\\\")).expect(\\\"command from binary name\\\")\\n\\n }\\n\\n}\\n\\n\\n\\n/// Use as a temporary file to act on in a TestDir\\n\\npub struct TestFile {\\n\\n file_path: PathBuf,\\n\\n}\\n\\n\\n\\nimpl TestFile {\\n\\n /// Create a new file and write its contents\\n\\n pub fn new(test_dir: &TempDir, name: &str, contents: &str) -> Self {\\n\\n let file_path = test_dir.path().join(name);\\n\\n let mut file = File::create(&file_path).expect(\\\"create testfile\\\");\\n\\n file.write_all(contents.as_bytes()).expect(\\\"write to file\\\");\\n\\n\\n\\n Self { file_path }\\n\\n }\\n\",\n \"file_path\": \"tests/common/mod.rs\",\n \"rank\": 51,\n \"score\": 68865.91943028726\n },\n {\n \"content\": \" subdir\\n\\n .current_dir\\n\\n .path()\\n\\n .strip_prefix(self.current_dir.path())\\n\\n .expect(\\\"strip dir from subdir path\\\")\\n\\n .to_string_lossy()\\n\\n .to_string()\\n\\n }\\n\\n\\n\\n /// Create a TestFile within the TestDir\\n\\n pub fn create_testfile(&self, name: &str, contents: &str) -> TestFile {\\n\\n TestFile::new(&self.current_dir, name, contents)\\n\\n }\\n\\n\\n\\n /// Get full path of TestDir as a &str\\n\\n pub fn as_str(&self) -> &str {\\n\\n self.current_dir\\n\\n .path()\\n\\n .to_str()\\n\\n .expect(\\\"convert directory to &str\\\")\\n\",\n \"file_path\": \"tests/common/mod.rs\",\n \"rank\": 52,\n \"score\": 68857.85355527402\n },\n {\n \"content\": \"use assert_cmd::Command;\\n\\nuse std::ffi::OsStr;\\n\\nuse std::fs::{self, File};\\n\\nuse std::io::Write;\\n\\nuse std::path::PathBuf;\\n\\nuse tempfile::{tempdir, tempdir_in, TempDir};\\n\\n\\n\\n#[cfg(windows)]\\n\\nuse dunce::canonicalize;\\n\\n\\n\\n#[cfg(not(windows))]\\n\\nuse std::fs::canonicalize;\\n\\n\\n\\n/// Use to test commands in temporary directories\\n\\npub struct TestDir {\\n\\n current_dir: TempDir,\\n\\n}\\n\\n\\n\\nimpl TestDir {\\n\\n /// Generate a new TestDir\\n\",\n \"file_path\": \"tests/common/mod.rs\",\n \"rank\": 53,\n \"score\": 68856.23641018898\n },\n {\n \"content\": \"\\n\\n /// Get full path of TestFile on filesystem as &str\\n\\n pub fn as_str(&self) -> &str {\\n\\n self.file_path.to_str().expect(\\\"convert testfile to &str\\\")\\n\\n }\\n\\n\\n\\n /// Get the filename (short path) as &str\\n\\n pub fn shortname_as_str(&self) -> &str {\\n\\n self.file_path\\n\\n .file_name()\\n\\n .expect(\\\"get shortname\\\")\\n\\n .to_str()\\n\\n .expect(\\\"convert shortname to &str\\\")\\n\\n }\\n\\n\\n\\n /// Get file contents\\n\\n pub fn contents(&self) -> String {\\n\\n String::from_utf8_lossy(&fs::read(self.as_str()).expect(\\\"read file\\\")).into_owned()\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"tests/common/mod.rs\",\n \"rank\": 54,\n \"score\": 68854.7307150357\n },\n {\n \"content\": \" /// This method removes the TestDir when command has finished.\\n\\n pub fn test_command_fail_with_args<I, S>(self, args: I, expected_output: String)\\n\\n where\\n\\n I: IntoIterator<Item = S>,\\n\\n S: AsRef<OsStr>,\\n\\n {\\n\\n let mut cmd = Self::init_cmd();\\n\\n let canonical_current_dir = canonicalize(&self.current_dir).expect(\\\"canonical current dir\\\");\\n\\n cmd.current_dir(&canonical_current_dir)\\n\\n .args(args)\\n\\n .assert()\\n\\n .failure()\\n\\n .code(1)\\n\\n .stdout(expected_output);\\n\\n\\n\\n self.close();\\n\\n }\\n\\n\\n\\n /// Run the default CLI binary, with \\\"-f\\\", in this TestDir and check it succeeds.\\n\\n pub fn test_command_fix_success(&self, expected_output: String) {\\n\",\n \"file_path\": \"tests/common/mod.rs\",\n \"rank\": 55,\n \"score\": 68850.9845774771\n },\n {\n \"content\": \" pub fn new() -> Self {\\n\\n Self {\\n\\n current_dir: tempdir().expect(\\\"create testdir\\\"),\\n\\n }\\n\\n }\\n\\n\\n\\n /// Create a new TestDir within an existing one\\n\\n pub fn subdir(&self) -> Self {\\n\\n Self {\\n\\n current_dir: tempdir_in(&self.current_dir).expect(\\\"create subdir\\\"),\\n\\n }\\n\\n }\\n\\n\\n\\n /// Explicitly panic if unable to remove TestDir from filesystem\\n\\n pub fn close(self) {\\n\\n self.current_dir.close().expect(\\\"remove testdir\\\");\\n\\n }\\n\\n\\n\\n /// Get relative path between TestDir and a subdirectory TestDir\\n\\n pub fn relative_path(&self, subdir: &Self) -> String {\\n\",\n \"file_path\": \"tests/common/mod.rs\",\n \"rank\": 56,\n \"score\": 68850.68979912002\n },\n {\n \"content\": \" ///\\n\\n /// This method removes the TestDir when command has finished.\\n\\n pub fn test_command_success_with_args<I, S>(self, args: I)\\n\\n where\\n\\n I: IntoIterator<Item = S>,\\n\\n S: AsRef<OsStr>,\\n\\n {\\n\\n let mut cmd = Self::init_cmd();\\n\\n let canonical_current_dir = canonicalize(&self.current_dir).expect(\\\"canonical current dir\\\");\\n\\n cmd.current_dir(&canonical_current_dir)\\n\\n .args(args)\\n\\n .assert()\\n\\n .success();\\n\\n\\n\\n self.close();\\n\\n }\\n\\n\\n\\n /// Run the default CLI binary, with command line arguments,\\n\\n /// in this TestDir and check it fails.\\n\\n ///\\n\",\n \"file_path\": \"tests/common/mod.rs\",\n \"rank\": 57,\n \"score\": 68850.47578159542\n },\n {\n \"content\": \" let mut cmd = Self::init_cmd();\\n\\n let canonical_current_dir = canonicalize(&self.current_dir).expect(\\\"canonical current dir\\\");\\n\\n cmd.current_dir(&canonical_current_dir)\\n\\n .args(&[\\\"-f\\\"])\\n\\n .assert()\\n\\n .success()\\n\\n .stdout(expected_output);\\n\\n }\\n\\n\\n\\n /// Run the default CLI binary, with \\\"-f\\\", in this TestDir and check it fails.\\n\\n pub fn test_command_fix_fail(&self, expected_output: String) {\\n\\n let mut cmd = Self::init_cmd();\\n\\n let canonical_current_dir = canonicalize(&self.current_dir).expect(\\\"canonical current dir\\\");\\n\\n cmd.current_dir(&canonical_current_dir)\\n\\n .args(&[\\\"-f\\\"])\\n\\n .assert()\\n\\n .failure()\\n\\n .code(1)\\n\\n .stdout(expected_output);\\n\\n }\\n\",\n \"file_path\": \"tests/common/mod.rs\",\n \"rank\": 58,\n \"score\": 68848.7733157412\n },\n {\n \"content\": \" }\\n\\n\\n\\n /// Run the default CLI binary in this TestDir and check it succeeds.\\n\\n ///\\n\\n /// This method removes the TestDir when command has finished.\\n\\n pub fn test_command_success(self) {\\n\\n let args: &[&str; 0] = &[];\\n\\n self.test_command_success_with_args(args);\\n\\n }\\n\\n\\n\\n /// Run the default CLI binary in this TestDir and check it fails.\\n\\n ///\\n\\n /// This method removes the TestDir when command has finished.\\n\\n pub fn test_command_fail(self, expected_output: String) {\\n\\n let args: &[&str; 0] = &[];\\n\\n self.test_command_fail_with_args(args, expected_output);\\n\\n }\\n\\n\\n\\n /// Run the default CLI binary, with command line arguments,\\n\\n /// in this TestDir and check it succeeds.\\n\",\n \"file_path\": \"tests/common/mod.rs\",\n \"rank\": 59,\n \"score\": 68847.85352234484\n },\n {\n \"content\": \"mod ending_blank_line;\\n\\nmod extra_blank_line;\\n\",\n \"file_path\": \"tests/checks/mod.rs\",\n \"rank\": 60,\n \"score\": 68843.62665994112\n },\n {\n \"content\": \"mod current_dir;\\n\\nmod specific_path;\\n\",\n \"file_path\": \"tests/args/mod.rs\",\n \"rank\": 61,\n \"score\": 68843.46307982004\n },\n {\n \"content\": \"mod quiet;\\n\\nmod recursive;\\n\",\n \"file_path\": \"tests/flags/mod.rs\",\n \"rank\": 62,\n \"score\": 68839.93315402482\n },\n {\n \"content\": \"use crate::common::TestDir;\\n\\nuse std::path::Path;\\n\\n\\n\\n#[test]\\n\",\n \"file_path\": \"tests/args/specific_path.rs\",\n \"rank\": 63,\n \"score\": 66333.99415956465\n },\n {\n \"content\": \"use crate::common::TestDir;\\n\\n\\n\\n#[test]\\n\",\n \"file_path\": \"tests/fixes/quote_character.rs\",\n \"rank\": 64,\n \"score\": 65327.1456570207\n },\n {\n \"content\": \"use crate::common::TestDir;\\n\\n\\n\\n#[test]\\n\",\n \"file_path\": \"tests/fixes/space_character.rs\",\n \"rank\": 65,\n \"score\": 65327.1456570207\n },\n {\n \"content\": \"use crate::common::TestDir;\\n\\n\\n\\n#[test]\\n\",\n \"file_path\": \"tests/fixes/trailing_whitespace.rs\",\n \"rank\": 66,\n \"score\": 65327.1456570207\n },\n {\n \"content\": \"use super::Fix;\\n\\nuse crate::common::*;\\n\\n\\n\\npub(crate) struct LowercaseKeyFixer<'a> {\\n\\n name: &'a str,\\n\\n}\\n\\n\\n\\nimpl Default for LowercaseKeyFixer<'_> {\\n\\n fn default() -> Self {\\n\\n Self {\\n\\n name: \\\"LowercaseKey\\\",\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\nimpl Fix for LowercaseKeyFixer<'_> {\\n\\n fn name(&self) -> &str {\\n\\n self.name\\n\\n }\\n\\n\\n\",\n \"file_path\": \"src/fixes/lowercase_key.rs\",\n \"rank\": 67,\n \"score\": 65263.7006580456\n },\n {\n \"content\": \" fn fix_line(&self, line: &mut LineEntry) -> Option<()> {\\n\\n let key = line.get_key()?;\\n\\n let key = key.to_uppercase();\\n\\n line.raw_string = format!(\\\"{}={}\\\", key, line.get_value()?);\\n\\n\\n\\n Some(())\\n\\n }\\n\\n}\\n\\n\\n\\n#[cfg(test)]\\n\\nmod tests {\\n\\n use super::*;\\n\\n use std::path::PathBuf;\\n\\n\\n\\n #[test]\\n\\n fn fix_line_test() {\\n\\n let fixer = LowercaseKeyFixer::default();\\n\\n let mut line = LineEntry {\\n\\n number: 1,\\n\\n file: FileEntry {\\n\",\n \"file_path\": \"src/fixes/lowercase_key.rs\",\n \"rank\": 68,\n \"score\": 65263.3150650013\n },\n {\n \"content\": \" path: PathBuf::from(\\\".env\\\"),\\n\\n file_name: \\\".env\\\".to_string(),\\n\\n total_lines: 1,\\n\\n },\\n\\n raw_string: String::from(\\\"foO=BAR\\\"),\\n\\n };\\n\\n assert_eq!(Some(()), fixer.fix_line(&mut line));\\n\\n assert_eq!(\\\"FOO=BAR\\\", line.raw_string);\\n\\n }\\n\\n\\n\\n #[test]\\n\\n fn fix_warnings_test() {\\n\\n let fixer = LowercaseKeyFixer::default();\\n\\n let mut lines = vec![\\n\\n LineEntry {\\n\\n number: 1,\\n\\n file: FileEntry {\\n\\n path: PathBuf::from(\\\".env\\\"),\\n\\n file_name: \\\".env\\\".to_string(),\\n\\n total_lines: 3,\\n\",\n \"file_path\": \"src/fixes/lowercase_key.rs\",\n \"rank\": 69,\n \"score\": 65256.639992448974\n },\n {\n \"content\": \" },\\n\\n ];\\n\\n let mut warning = Warning::new(\\n\\n lines[0].clone(),\\n\\n \\\"LowercaseKey\\\",\\n\\n String::from(\\\"The FOO key should be in uppercase\\\"),\\n\\n );\\n\\n\\n\\n assert_eq!(Some(1), fixer.fix_warnings(vec![&mut warning], &mut lines));\\n\\n assert_eq!(\\\"FOO=BAR\\\", lines[0].raw_string);\\n\\n assert!(warning.is_fixed);\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/fixes/lowercase_key.rs\",\n \"rank\": 70,\n \"score\": 65247.52285483658\n },\n {\n \"content\": \" },\\n\\n raw_string: String::from(\\\"foO=BAR\\\"),\\n\\n },\\n\\n LineEntry {\\n\\n number: 2,\\n\\n file: FileEntry {\\n\\n path: PathBuf::from(\\\".env\\\"),\\n\\n file_name: \\\".env\\\".to_string(),\\n\\n total_lines: 3,\\n\\n },\\n\\n raw_string: String::from(\\\"Z=Y\\\"),\\n\\n },\\n\\n LineEntry {\\n\\n number: 3,\\n\\n file: FileEntry {\\n\\n path: PathBuf::from(\\\".env\\\"),\\n\\n file_name: \\\".env\\\".to_string(),\\n\\n total_lines: 3,\\n\\n },\\n\\n raw_string: String::from(\\\"\\\\n\\\"),\\n\",\n \"file_path\": \"src/fixes/lowercase_key.rs\",\n \"rank\": 71,\n \"score\": 65242.70845843175\n },\n {\n \"content\": \" }\\n\\n\\n\\n Some(0)\\n\\n }\\n\\n}\\n\\n\\n\\n#[cfg(test)]\\n\\nmod tests {\\n\\n use super::*;\\n\\n use std::path::PathBuf;\\n\\n\\n\\n #[test]\\n\\n fn fix_warnings_test() {\\n\\n let fixer = EndingBlankLineFixer::default();\\n\\n let mut lines = vec![\\n\\n LineEntry {\\n\\n number: 1,\\n\\n file: FileEntry {\\n\\n path: PathBuf::from(\\\".env\\\"),\\n\\n file_name: \\\".env\\\".to_string(),\\n\",\n \"file_path\": \"src/fixes/ending_blank_line.rs\",\n \"rank\": 72,\n \"score\": 63138.23525149328\n },\n {\n \"content\": \"use super::Fix;\\n\\nuse crate::common::*;\\n\\n\\n\\npub(crate) struct EndingBlankLineFixer<'a> {\\n\\n name: &'a str,\\n\\n}\\n\\n\\n\\nimpl Default for EndingBlankLineFixer<'_> {\\n\\n fn default() -> Self {\\n\\n Self {\\n\\n name: \\\"EndingBlankLine\\\",\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\nimpl Fix for EndingBlankLineFixer<'_> {\\n\\n fn name(&self) -> &str {\\n\\n self.name\\n\\n }\\n\\n\\n\",\n \"file_path\": \"src/fixes/ending_blank_line.rs\",\n \"rank\": 73,\n \"score\": 63134.97172306282\n },\n {\n \"content\": \" assert_eq!(Some(1), fixer.fix_warnings(vec![&mut warning], &mut lines));\\n\\n assert_eq!(\\\"\\\\n\\\", lines[2].raw_string);\\n\\n assert!(warning.is_fixed);\\n\\n }\\n\\n\\n\\n #[test]\\n\\n fn ending_blank_line_exist_test() {\\n\\n let fixer = EndingBlankLineFixer::default();\\n\\n let mut lines = vec![\\n\\n LineEntry {\\n\\n number: 1,\\n\\n file: FileEntry {\\n\\n path: PathBuf::from(\\\".env\\\"),\\n\\n file_name: \\\".env\\\".to_string(),\\n\\n total_lines: 2,\\n\\n },\\n\\n raw_string: String::from(\\\"FOO=BAR\\\"),\\n\\n },\\n\\n LineEntry {\\n\\n number: 2,\\n\",\n \"file_path\": \"src/fixes/ending_blank_line.rs\",\n \"rank\": 74,\n \"score\": 63131.64085536878\n },\n {\n \"content\": \" fn fix_warnings(\\n\\n &self,\\n\\n warnings: Vec<&mut Warning>,\\n\\n lines: &mut Vec<LineEntry>,\\n\\n ) -> Option<usize> {\\n\\n let file = lines.first()?.file.clone();\\n\\n let last_line = lines.last()?;\\n\\n\\n\\n if !last_line.raw_string.ends_with(LF) {\\n\\n lines.push(LineEntry {\\n\\n number: lines.len() + 1,\\n\\n file,\\n\\n raw_string: LF.to_string(),\\n\\n });\\n\\n\\n\\n for warning in warnings {\\n\\n warning.mark_as_fixed()\\n\\n }\\n\\n\\n\\n return Some(1);\\n\",\n \"file_path\": \"src/fixes/ending_blank_line.rs\",\n \"rank\": 75,\n \"score\": 63124.73281450901\n },\n {\n \"content\": \" file: FileEntry {\\n\\n path: PathBuf::from(\\\".env\\\"),\\n\\n file_name: \\\".env\\\".to_string(),\\n\\n total_lines: 2,\\n\\n },\\n\\n raw_string: String::from(LF),\\n\\n },\\n\\n ];\\n\\n\\n\\n assert_eq!(Some(0), fixer.fix_warnings(vec![], &mut lines));\\n\\n assert_eq!(lines.len(), 2);\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/fixes/ending_blank_line.rs\",\n \"rank\": 76,\n \"score\": 63119.98869479191\n },\n {\n \"content\": \" total_lines: 2,\\n\\n },\\n\\n raw_string: String::from(\\\"FOO=BAR\\\"),\\n\\n },\\n\\n LineEntry {\\n\\n number: 2,\\n\\n file: FileEntry {\\n\\n path: PathBuf::from(\\\".env\\\"),\\n\\n file_name: \\\".env\\\".to_string(),\\n\\n total_lines: 2,\\n\\n },\\n\\n raw_string: String::from(\\\"Z=Y\\\"),\\n\\n },\\n\\n ];\\n\\n let mut warning = Warning::new(\\n\\n lines[1].clone(),\\n\\n \\\"EndingBlankLine\\\",\\n\\n String::from(\\\"No blank line at the end of the file\\\"),\\n\\n );\\n\\n\\n\",\n \"file_path\": \"src/fixes/ending_blank_line.rs\",\n \"rank\": 77,\n \"score\": 63119.12886195012\n },\n {\n \"content\": \"use crate::common::TestDir;\\n\\n\\n\\n#[test]\\n\",\n \"file_path\": \"tests/checks/ending_blank_line.rs\",\n \"rank\": 78,\n \"score\": 63083.3794403388\n },\n {\n \"content\": \"use crate::common::TestDir;\\n\\n\\n\\n#[test]\\n\",\n \"file_path\": \"tests/checks/extra_blank_line.rs\",\n \"rank\": 79,\n \"score\": 63083.3794403388\n },\n {\n \"content\": \" fn fix_line(&self, line: &mut LineEntry) -> Option<()> {\\n\\n line.raw_string.push('=');\\n\\n\\n\\n Some(())\\n\\n }\\n\\n}\\n\\n\\n\\n#[cfg(test)]\\n\\nmod tests {\\n\\n use super::*;\\n\\n use std::path::PathBuf;\\n\\n\\n\\n #[test]\\n\\n fn fix_line_test() {\\n\\n let fixer = KeyWithoutValueFixer::default();\\n\\n let mut line = LineEntry {\\n\\n number: 1,\\n\\n file: FileEntry {\\n\\n path: PathBuf::from(\\\".env\\\"),\\n\\n file_name: \\\".env\\\".to_string(),\\n\",\n \"file_path\": \"src/fixes/key_without_value.rs\",\n \"rank\": 80,\n \"score\": 62826.69915816811\n },\n {\n \"content\": \"use super::Fix;\\n\\nuse crate::common::*;\\n\\n\\n\\npub(crate) struct KeyWithoutValueFixer<'a> {\\n\\n name: &'a str,\\n\\n}\\n\\n\\n\\nimpl Default for KeyWithoutValueFixer<'_> {\\n\\n fn default() -> Self {\\n\\n Self {\\n\\n name: \\\"KeyWithoutValue\\\",\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\nimpl Fix for KeyWithoutValueFixer<'_> {\\n\\n fn name(&self) -> &str {\\n\\n self.name\\n\\n }\\n\\n\\n\",\n \"file_path\": \"src/fixes/key_without_value.rs\",\n \"rank\": 81,\n \"score\": 62824.802103920905\n },\n {\n \"content\": \" total_lines: 1,\\n\\n },\\n\\n raw_string: String::from(\\\"FOO\\\"),\\n\\n };\\n\\n assert_eq!(Some(()), fixer.fix_line(&mut line));\\n\\n assert_eq!(\\\"FOO=\\\", line.raw_string);\\n\\n }\\n\\n\\n\\n #[test]\\n\\n fn fix_warnings_test() {\\n\\n let fixer = KeyWithoutValueFixer::default();\\n\\n let mut lines = vec![\\n\\n LineEntry {\\n\\n number: 1,\\n\\n file: FileEntry {\\n\\n path: PathBuf::from(\\\".env\\\"),\\n\\n file_name: \\\".env\\\".to_string(),\\n\\n total_lines: 3,\\n\\n },\\n\\n raw_string: String::from(\\\"FOO\\\"),\\n\",\n \"file_path\": \"src/fixes/key_without_value.rs\",\n \"rank\": 82,\n \"score\": 62818.14771497109\n },\n {\n \"content\": \" let mut warning = Warning::new(\\n\\n lines[0].clone(),\\n\\n \\\"KeyWithoutValue\\\",\\n\\n String::from(\\\"The FOO key should be with a value or have an equal sign\\\"),\\n\\n );\\n\\n\\n\\n assert_eq!(Some(1), fixer.fix_warnings(vec![&mut warning], &mut lines));\\n\\n assert_eq!(\\\"FOO=\\\", lines[0].raw_string);\\n\\n assert!(warning.is_fixed);\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/fixes/key_without_value.rs\",\n \"rank\": 83,\n \"score\": 62809.232513360665\n },\n {\n \"content\": \" },\\n\\n LineEntry {\\n\\n number: 2,\\n\\n file: FileEntry {\\n\\n path: PathBuf::from(\\\".env\\\"),\\n\\n file_name: \\\".env\\\".to_string(),\\n\\n total_lines: 3,\\n\\n },\\n\\n raw_string: String::from(\\\"Z=Y\\\"),\\n\\n },\\n\\n LineEntry {\\n\\n number: 3,\\n\\n file: FileEntry {\\n\\n path: PathBuf::from(\\\".env\\\"),\\n\\n file_name: \\\".env\\\".to_string(),\\n\\n total_lines: 3,\\n\\n },\\n\\n raw_string: String::from(\\\"\\\\n\\\"),\\n\\n },\\n\\n ];\\n\",\n \"file_path\": \"src/fixes/key_without_value.rs\",\n \"rank\": 84,\n \"score\": 62805.15692392663\n },\n {\n \"content\": \"// This trait is used for checks which needs to know of only a single line\\n\\ntrait Check {\\n\\n fn run(&mut self, line: &LineEntry) -> Option<Warning>;\\n\\n fn name(&self) -> &str;\\n\\n fn skip_comments(&self) -> bool {\\n\\n true\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/checks.rs\",\n \"rank\": 85,\n \"score\": 57562.75489655691\n },\n {\n \"content\": \"fn main() -> Result<(), Box<dyn Error>> {\\n\\n let current_dir = env::current_dir()?;\\n\\n let args = get_args(current_dir.as_os_str());\\n\\n\\n\\n if args.is_present(\\\"show-checks\\\") {\\n\\n dotenv_linter::available_check_names()\\n\\n .iter()\\n\\n .for_each(|name| println!(\\\"{}\\\", name));\\n\\n process::exit(0);\\n\\n }\\n\\n\\n\\n let is_fix = args.is_present(\\\"fix\\\");\\n\\n\\n\\n let warnings = dotenv_linter::run(&args, ¤t_dir)?;\\n\\n\\n\\n if warnings.is_empty() {\\n\\n process::exit(0);\\n\\n }\\n\\n\\n\\n if is_fix {\\n\",\n \"file_path\": \"src/main.rs\",\n \"rank\": 86,\n \"score\": 39221.815706512425\n },\n {\n \"content\": \"mod args;\\n\\nmod checks;\\n\\nmod common;\\n\\nmod fixes;\\n\\nmod flags;\\n\\nmod options;\\n\",\n \"file_path\": \"tests/cli.rs\",\n \"rank\": 96,\n \"score\": 35405.814445055395\n },\n {\n \"content\": \" \\\"{}:{} {}: {}\\\",\\n\\n self.line.file, self.line.number, self.check_name, self.message\\n\\n )\\n\\n }\\n\\n}\\n\\n\\n\\n#[cfg(test)]\\n\\nmod tests {\\n\\n use super::*;\\n\\n use std::path::PathBuf;\\n\\n\\n\\n #[test]\\n\\n fn warning_fmt_test() {\\n\\n let line = LineEntry {\\n\\n number: 1,\\n\\n file: FileEntry {\\n\\n path: PathBuf::from(\\\".env\\\"),\\n\\n file_name: \\\".env\\\".to_string(),\\n\\n total_lines: 1,\\n\\n },\\n\",\n \"file_path\": \"src/common/warning.rs\",\n \"rank\": 97,\n \"score\": 35108.23715626925\n },\n {\n \"content\": \" }\\n\\n }\\n\\n\\n\\n pub fn line_number(&self) -> usize {\\n\\n self.line.number\\n\\n }\\n\\n\\n\\n pub fn mark_as_fixed(&mut self) {\\n\\n self.is_fixed = true;\\n\\n }\\n\\n\\n\\n pub fn mark_as_unfixed(&mut self) {\\n\\n self.is_fixed = false;\\n\\n }\\n\\n}\\n\\n\\n\\nimpl fmt::Display for Warning {\\n\\n fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {\\n\\n write!(\\n\\n f,\\n\",\n \"file_path\": \"src/common/warning.rs\",\n \"rank\": 98,\n \"score\": 35107.47037716739\n },\n {\n \"content\": \"use std::fmt;\\n\\n\\n\\nuse crate::common::*;\\n\\n\\n\\n#[derive(Clone, Debug, PartialEq)]\\n\\npub struct Warning {\\n\\n pub check_name: String,\\n\\n line: LineEntry,\\n\\n message: String,\\n\\n pub is_fixed: bool,\\n\\n}\\n\\n\\n\\nimpl Warning {\\n\\n pub fn new(line: LineEntry, check_name: &str, message: String) -> Self {\\n\\n let check_name = String::from(check_name);\\n\\n Self {\\n\\n line,\\n\\n check_name,\\n\\n message,\\n\\n is_fixed: false,\\n\",\n \"file_path\": \"src/common/warning.rs\",\n \"rank\": 99,\n \"score\": 35106.136038697165\n }\n]","isConversational":false}}},{"rowIdx":2353,"cells":{"lang":{"kind":"string","value":"Rust"},"file_path":{"kind":"string","value":"core/src/util.rs"},"repo_name":{"kind":"string","value":"kruton/SEGIMAP"},"commit":{"kind":"string","value":"7e9e68fecd5e2ad22862ec02c5f1a2be9f35269b"},"file_code":{"kind":"string","value":"\n\nuse regex::Regex;\nuse std::env::current_dir;\nuse std::fs;\nuse std::path::Path;\nuse std::path::PathBuf;\nuse walkdir::WalkDir;\n\nuse crate::folder::Folder;\n\n#[macro_export]\nmacro_rules! path_filename_to_str(\n ($p:ident) => ({\n use std::ffi::OsStr;\n $p.file_name().unwrap_or_else(|| OsStr::new(\"\")).to_str().unwrap_or_else(|| \"\")\n });\n);\n\nfn make_absolute(dir: &Path) -> String {\n match current_dir() {\n Err(_) => dir.display().to_string(),\n Ok(absp) => {\n let mut abs_path = absp.clone();\n abs_path.push(dir);\n abs_path.display().to_string()\n }\n }\n}\n\npub fn perform_select(\n maildir: &str,\n select_args: &[&str],\n examine: bool,\n tag: &str,\n) -> (Option<Folder>, String) {\n let err_res = (None, \"\".to_string());\n if select_args.len() < 1 {\n return err_res;\n }\n let mbox_name = select_args[0].trim_matches('\"').replace(\"INBOX\", \".\");\n let mut maildir_path = PathBuf::new();\n maildir_path.push(maildir);\n maildir_path.push(mbox_name);\n let folder = match Folder::new(maildir_path, examine) {\n None => {\n return err_res;\n }\n Some(folder) => folder.clone(),\n };\n\n let ok_res = folder.select_response(tag);\n (Some(folder), ok_res)\n}\n\nfn list_dir(dir: &Path, regex: &Regex, maildir_path: &Path) -> Option<String> {\n let dir_string = dir.display().to_string();\n let dir_name = path_filename_to_str!(dir);\n\n \n \n if dir_name == \"cur\" || dir_name == \"new\" || dir_name == \"tmp\" {\n return None;\n }\n\n let abs_dir = make_absolute(dir);\n\n \n \n let mut flags = match fs::read_dir(&dir.join(\"cur\")) {\n Err(_) => \"\\\\Noselect\".to_string(),\n _ => {\n match fs::read_dir(&dir.join(\"new\")) {\n Err(_) => \"\\\\Noselect\".to_string(),\n \n \n \n \n \n Ok(newlisting) => {\n if newlisting.count() == 0 {\n \"\\\\Unmarked\".to_string()\n } else {\n \"\\\\Marked\".to_string()\n }\n }\n }\n }\n };\n\n \n \n \n match fs::read_dir(&dir) {\n Err(_) => {\n return None;\n }\n Ok(dir_listing) => {\n let mut children = false;\n for subdir_entry in dir_listing {\n if let Ok(subdir) = subdir_entry {\n if *dir == *maildir_path {\n break;\n }\n let subdir_path = subdir.path();\n let subdir_str = path_filename_to_str!(subdir_path);\n if subdir_str != \"cur\" && subdir_str != \"new\" && subdir_str != \"tmp\" {\n if fs::read_dir(&subdir.path().join(\"cur\")).is_err() {\n continue;\n }\n if fs::read_dir(&subdir.path().join(\"new\")).is_err() {\n continue;\n }\n children = true;\n break;\n }\n }\n }\n if children {\n flags.push_str(\" \\\\HasChildren\");\n } else {\n flags.push_str(\" \\\\HasNoChildren\");\n }\n }\n }\n\n let re_path = make_absolute(maildir_path);\n match fs::metadata(dir) {\n Err(_) => return None,\n Ok(md) => {\n if !md.is_dir() {\n return None;\n }\n }\n };\n\n if !regex.is_match(&dir_string[..]) {\n return None;\n }\n let mut list_str = \"* LIST (\".to_string();\n list_str.push_str(&flags[..]);\n list_str.push_str(\") \\\"/\\\" \");\n let list_dir_string = if abs_dir.starts_with(&re_path[..]) {\n abs_dir.replacen(&re_path[..], \"\", 1)\n } else {\n abs_dir\n };\n list_str.push_str(&(list_dir_string.replace(\"INBOX\", \"\"))[..]);\n Some(list_str)\n}\n\npub fn list(maildir: &str, regex: &Regex) -> Vec<String> {\n let maildir_path = Path::new(maildir);\n let mut responses = Vec::new();\n if let Some(list_response) = list_dir(maildir_path, regex, maildir_path) {\n responses.push(list_response);\n }\n for dir_res in WalkDir::new(&maildir_path) {\n if let Ok(dir) = dir_res {\n if let Some(list_response) = list_dir(dir.path(), regex, maildir_path) {\n responses.push(list_response);\n }\n }\n }\n responses\n}\n"},"prefix":{"kind":"string","value":"\n\nuse regex::Regex;\nuse std::env::current_dir;\nuse std::fs;\nuse std::path::Path;\nuse std::path::PathBuf;\nuse walkdir::WalkDir;\n\nuse crate::folder::Folder;\n\n#[macro_export]\nmacro_rules! path_filename_to_str(\n ($p:ident) => ({\n use std::ffi::OsStr;\n $p.file_name().unwrap_or_else(|| OsStr::new(\"\")).to_str().unwrap_or_else(|| \"\")\n });\n);\n\nfn make_absolute(dir: &Path) -> String {\n match current_dir() {\n Err(_) => dir.display().to_string(),\n Ok(absp) => {\n let mut abs_path = absp.clone();\n abs_path.push(dir);\n abs_path.display().to_string()\n }\n }\n}\n\npub fn perform_select(\n maildir: &str,\n "},"suffix":{"kind":"string","value":"r);\n\n \n \n let mut flags = match fs::read_dir(&dir.join(\"cur\")) {\n Err(_) => \"\\\\Noselect\".to_string(),\n _ => {\n match fs::read_dir(&dir.join(\"new\")) {\n Err(_) => \"\\\\Noselect\".to_string(),\n \n \n \n \n \n Ok(newlisting) => {\n if newlisting.count() == 0 {\n \"\\\\Unmarked\".to_string()\n } else {\n \"\\\\Marked\".to_string()\n }\n }\n }\n }\n };\n\n \n \n \n match fs::read_dir(&dir) {\n Err(_) => {\n return None;\n }\n Ok(dir_listing) => {\n let mut children = false;\n for subdir_entry in dir_listing {\n if let Ok(subdir) = subdir_entry {\n if *dir == *maildir_path {\n break;\n }\n let subdir_path = subdir.path();\n let subdir_str = path_filename_to_str!(subdir_path);\n if subdir_str != \"cur\" && subdir_str != \"new\" && subdir_str != \"tmp\" {\n if fs::read_dir(&subdir.path().join(\"cur\")).is_err() {\n continue;\n }\n if fs::read_dir(&subdir.path().join(\"new\")).is_err() {\n continue;\n }\n children = true;\n break;\n }\n }\n }\n if children {\n flags.push_str(\" \\\\HasChildren\");\n } else {\n flags.push_str(\" \\\\HasNoChildren\");\n }\n }\n }\n\n let re_path = make_absolute(maildir_path);\n match fs::metadata(dir) {\n Err(_) => return None,\n Ok(md) => {\n if !md.is_dir() {\n return None;\n }\n }\n };\n\n if !regex.is_match(&dir_string[..]) {\n return None;\n }\n let mut list_str = \"* LIST (\".to_string();\n list_str.push_str(&flags[..]);\n list_str.push_str(\") \\\"/\\\" \");\n let list_dir_string = if abs_dir.starts_with(&re_path[..]) {\n abs_dir.replacen(&re_path[..], \"\", 1)\n } else {\n abs_dir\n };\n list_str.push_str(&(list_dir_string.replace(\"INBOX\", \"\"))[..]);\n Some(list_str)\n}\n\npub fn list(maildir: &str, regex: &Regex) -> Vec<String> {\n let maildir_path = Path::new(maildir);\n let mut responses = Vec::new();\n if let Some(list_response) = list_dir(maildir_path, regex, maildir_path) {\n responses.push(list_response);\n }\n for dir_res in WalkDir::new(&maildir_path) {\n if let Ok(dir) = dir_res {\n if let Some(list_response) = list_dir(dir.path(), regex, maildir_path) {\n responses.push(list_response);\n }\n }\n }\n responses\n}\n"},"middle":{"kind":"string","value":"select_args: &[&str],\n examine: bool,\n tag: &str,\n) -> (Option<Folder>, String) {\n let err_res = (None, \"\".to_string());\n if select_args.len() < 1 {\n return err_res;\n }\n let mbox_name = select_args[0].trim_matches('\"').replace(\"INBOX\", \".\");\n let mut maildir_path = PathBuf::new();\n maildir_path.push(maildir);\n maildir_path.push(mbox_name);\n let folder = match Folder::new(maildir_path, examine) {\n None => {\n return err_res;\n }\n Some(folder) => folder.clone(),\n };\n\n let ok_res = folder.select_response(tag);\n (Some(folder), ok_res)\n}\n\nfn list_dir(dir: &Path, regex: &Regex, maildir_path: &Path) -> Option<String> {\n let dir_string = dir.display().to_string();\n let dir_name = path_filename_to_str!(dir);\n\n \n \n if dir_name == \"cur\" || dir_name == \"new\" || dir_name == \"tmp\" {\n return None;\n }\n\n let abs_dir = make_absolute(di"},"strategy":{"kind":"string","value":"random"},"context_items":{"kind":"list like","value":[{"content":"/// Parse and perform the store operation specified by `store_args`. Returns the\n\n/// response to the client or None if a BAD response should be sent back to\n\n/// the client\n\npub fn store(folder: &mut Folder, store_args: &[&str], seq_uid: bool, tag: &str) -> Option<String> {\n\n if store_args.len() < 3 {\n\n return None;\n\n }\n\n\n\n // Parse the sequence set argument\n\n let sequence_set_opt = sequence_set::parse(store_args[0].trim_matches('\"'));\n\n // Grab how to handle the flags. It should be case insensitive.\n\n let data_name = store_args[1].trim_matches('\"').to_ascii_lowercase();\n\n\n\n // Split into \"flag\" part and \"silent\" part.\n\n let mut data_name_parts = (&data_name[..]).split('.');\n\n let flag_part = data_name_parts.next();\n\n let silent_part = data_name_parts.next();\n\n\n\n // There shouldn't be any more parts to the data name argument\n\n if data_name_parts.next().is_some() {\n\n return None;\n\n }\n\n\n","file_path":"core/src/command/store.rs","rank":1,"score":172655.79344536812},{"content":"/// Reads a JSON file and turns it into a `HashMap` of emails to users.\n\n/// May throw an `std::io::Error`, hence the `Result<>` type.\n\npub fn load_users(path_str: &str) -> ImapResult<HashMap<Email, User>> {\n\n let path = Path::new(&path_str[..]);\n\n\n\n let users = match File::open(&path) {\n\n Ok(mut file) => {\n\n let mut file_buf: String = String::new();\n\n file.read_to_string(&mut file_buf)?;\n\n serde_json::from_str(&file_buf)?\n\n }\n\n Err(e) => {\n\n warn!(\"Failed to open users file, creating default: {}\", e);\n\n create_default_users(&path)?\n\n }\n\n };\n\n\n\n let mut map = HashMap::<Email, User>::new();\n\n for user in users {\n\n map.insert(user.email.clone(), user);\n\n }\n\n\n\n Ok(map)\n\n}\n\n\n","file_path":"core/src/server/user/mod.rs","rank":3,"score":131725.49913843535},{"content":"/// Given a string as passed in from the client, create a list of sequence items\n\n/// If the string does not represent a valid list, return None\n\npub fn parse(sequence_string: &str) -> Option<Vec<SequenceItem>> {\n\n let sequences = sequence_string.split(',');\n\n let mut sequence_set = Vec::new();\n\n for sequence in sequences {\n\n let mut range = sequence.split(':');\n\n let start = match range.next() {\n\n None => return None,\n\n Some(seq) => match parse_item(seq) {\n\n None => return None,\n\n Some(item) => item,\n\n },\n\n };\n\n let stop = match range.next() {\n\n None => {\n\n // Nothing after ':'\n\n // Add the number or wildcard and bail out\n\n sequence_set.push(start);\n\n continue;\n\n }\n\n Some(seq) => match parse_item(seq) {\n","file_path":"core/src/command/sequence_set.rs","rank":4,"score":131504.31379202352},{"content":"/// Writes a list of users to a new file on the disk.\n\npub fn save_users(path: &Path, users: &[User]) -> ImapResult<()> {\n\n let encoded = serde_json::to_string(&users)?;\n\n\n\n let mut file = File::create(&path)?;\n\n file.write(encoded.as_bytes())?;\n\n\n\n Ok(())\n\n}\n\n\n","file_path":"core/src/server/user/mod.rs","rank":6,"score":124367.14001897915},{"content":"/// Takes a flag argument and returns the corresponding enum.\n\npub fn parse_flag(flag: &str) -> Option<Flag> {\n\n match flag {\n\n \"\\\\Deleted\" => Some(Flag::Deleted),\n\n \"\\\\Seen\" => Some(Flag::Seen),\n\n \"\\\\Draft\" => Some(Flag::Draft),\n\n \"\\\\Answered\" => Some(Flag::Answered),\n\n \"\\\\Flagged\" => Some(Flag::Flagged),\n\n _ => None,\n\n }\n\n}\n\n\n\n/// Representation of a Message\n\n#[derive(Debug, Clone)]\n\npub struct Message {\n\n // a unique id (timestamp) for the message\n\n uid: usize,\n\n\n\n // filename\n\n path: PathBuf,\n\n\n","file_path":"core/src/message.rs","rank":7,"score":118807.34395038549},{"content":"/// Take the rest of the arguments provided by the client and parse them into a\n\n/// `FetchCommand` object with `parser::fetch`.\n\npub fn fetch(args: Vec<&str>) -> ParserResult<FetchCommand> {\n\n let mut cmd = \"FETCH\".to_string();\n\n for arg in args {\n\n cmd.push(' ');\n\n cmd.push_str(arg);\n\n }\n\n\n\n parser::fetch(cmd.as_bytes())\n\n}\n\n\n","file_path":"core/src/command/fetch.rs","rank":9,"score":110073.9421727498},{"content":"pub fn serve(serv: Arc<Server>, mut stream: BufStream<TcpStream>) {\n\n let mut l = Lmtp {\n\n rev_path: None,\n\n to_path: Vec::new(),\n\n data: String::new(),\n\n quit: false,\n\n };\n\n return_on_err!(stream.write(format!(\"220 {} LMTP server ready\\r\\n\", *serv.host()).as_bytes()));\n\n return_on_err!(stream.flush());\n\n loop {\n\n let mut command = String::new();\n\n match stream.read_line(&mut command) {\n\n Ok(_) => {\n\n if command.is_empty() {\n\n return;\n\n }\n\n let trimmed_command = (&command[..]).trim();\n\n let mut args = trimmed_command.split(' ');\n\n let invalid = \"500 Invalid command\\r\\n\".to_string();\n\n let data_res = b\"354 Start mail input; end with <CRLF>.<CRLF>\\r\\n\";\n","file_path":"core/src/server/lmtp.rs","rank":10,"score":103302.48012242152},{"content":"/// Perform the fetch operation on each sequence number indicated and return\n\n/// the response to be sent back to the client.\n\npub fn fetch_loop(\n\n parsed_cmd: &FetchCommand,\n\n folder: &mut Folder,\n\n sequence_iter: &[usize],\n\n tag: &str,\n\n uid: bool,\n\n) -> String {\n\n for attr in &parsed_cmd.attributes {\n\n if let BodySection(_, _) = *attr {\n\n let mut seen_flag_set = HashSet::new();\n\n seen_flag_set.insert(Seen);\n\n folder.store(\n\n sequence_iter.to_vec(),\n\n &Add,\n\n true,\n\n seen_flag_set,\n\n false,\n\n tag,\n\n );\n\n break;\n","file_path":"core/src/command/fetch.rs","rank":11,"score":87552.26192698072},{"content":"/// Function to create an example users JSON file at the specified path.\n\n///\n\n/// Returns the list of example users.\n\nfn create_default_users(path: &Path) -> ImapResult<Vec<User>> {\n\n let users = vec![\n\n User::new(\n\n Email::new(\"will\".to_string(), \"xqz.ca\".to_string()),\n\n \"54321\".to_string(),\n\n \"./maildir\".to_string(),\n\n ),\n\n User::new(\n\n Email::new(\"nikitapekin\".to_string(), \"gmail.com\".to_string()),\n\n \"12345\".to_string(),\n\n \"./maildir\".to_string(),\n\n ),\n\n ];\n\n\n\n save_users(path, &users)?;\n\n\n\n Ok(users)\n\n}\n","file_path":"core/src/server/user/mod.rs","rank":12,"score":86813.52789540804},{"content":"/// This moves a list of messages from folder/new/ to folder/cur/ and returns a\n\n/// new list of messages\n\nfn move_new(messages: &[Message], path: &Path, start_index: usize) -> Vec<Message> {\n\n let mut new_messages = Vec::new();\n\n\n\n // Go over the messages by index\n\n for (i, msg) in messages.iter().enumerate() {\n\n // messages before start_index are already in folder/cur/\n\n if i + 1 < start_index {\n\n new_messages.push(msg.clone());\n\n continue;\n\n }\n\n let curpath = path.join(\"cur\").join(msg.get_uid().to_string());\n\n rename_message!(msg, curpath, new_messages);\n\n }\n\n\n\n // Return the new list of messages\n\n new_messages\n\n}\n","file_path":"core/src/folder.rs","rank":13,"score":83223.04383241442},{"content":"fn parse_item(item: &str) -> Option<SequenceItem> {\n\n if let Ok(intseq) = item.parse() {\n\n Some(Number(intseq))\n\n } else if item == \"*\" {\n\n // item is not a valid number\n\n // If it is the wildcard value return that\n\n // Otherwise, return no sequence item\n\n Some(Wildcard)\n\n } else {\n\n None\n\n }\n\n}\n\n\n","file_path":"core/src/command/sequence_set.rs","rank":14,"score":74735.59798608409},{"content":"fn grab_email(arg: Option<&str>) -> Option<Email> {\n\n let from_path_split = match arg {\n\n Some(full_from_path) => {\n\n let mut split_arg = full_from_path.split(':');\n\n match split_arg.next() {\n\n Some(from_str) => match &from_str.to_ascii_lowercase()[..] {\n\n \"from\" | \"to\" => {\n\n grab_email_token!(split_arg.next())\n\n }\n\n _ => {\n\n return None;\n\n }\n\n },\n\n _ => {\n\n return None;\n\n }\n\n }\n\n }\n\n _ => {\n\n return None;\n","file_path":"core/src/server/lmtp.rs","rank":15,"score":74696.64143306736},{"content":"/// Takes the argument specifying what to do with the provided flags in a store\n\n/// operation and returns the corresponding enum.\n\nfn parse_storename(storename: Option<&str>) -> Option<StoreName> {\n\n match storename {\n\n Some(\"flags\") => Some(Replace),\n\n Some(\"+flags\") => Some(Add),\n\n Some(\"-flags\") => Some(Sub),\n\n _ => None,\n\n }\n\n}\n","file_path":"core/src/command/store.rs","rank":16,"score":73254.45650290004},{"content":"pub fn fetch(input: &[u8]) -> ParserResult<FetchCommand> {\n\n use nom::IResult::{Done, Error, Incomplete};\n\n\n\n match self::grammar::fetch(input) {\n\n Done(_, v) => Ok(v),\n\n Incomplete(_) => Err(ParserError::Incomplete),\n\n Error(err) => Err(err).map_err(ParserError::from),\n\n }\n\n}\n","file_path":"core/src/parser/mod.rs","rank":17,"score":72386.61040590914},{"content":"pub fn uid_iterator(sequence_set: &[SequenceItem]) -> Vec<usize> {\n\n let mut items = Vec::new();\n\n for item in sequence_set.iter() {\n\n match *item {\n\n Number(num) => items.push(num),\n\n Range(ref a, ref b) => {\n\n let a = match **a {\n\n Number(num) => num,\n\n Wildcard => return Vec::new(),\n\n Range(_, _) => {\n\n error!(\"A range of ranges is invalid.\");\n\n continue;\n\n }\n\n };\n\n let b = match **b {\n\n Number(num) => num,\n\n Wildcard => return Vec::new(),\n\n Range(_, _) => {\n\n error!(\"A range of ranges is invalid.\");\n\n continue;\n","file_path":"core/src/command/sequence_set.rs","rank":18,"score":69745.82299310195},{"content":"pub fn imap_serve(serv: Arc<Server>, stream: TcpStream) {\n\n let mut session = ImapSession::new(serv);\n\n session.handle(stream);\n\n}\n","file_path":"core/src/server/mod.rs","rank":19,"score":69745.27040243053},{"content":"pub fn lmtp_serve(serv: Arc<Server>, stream: TcpStream) {\n\n lmtp::serve(serv, BufStream::new(stream))\n\n}\n\n\n","file_path":"core/src/server/mod.rs","rank":20,"score":69745.27040243053},{"content":"/// Create the list of unsigned integers representing valid ids from a list of\n\n/// sequence items. Ideally this would handle wildcards in O(1) rather than O(n)\n\npub fn iterator(sequence_set: &[SequenceItem], max_id: usize) -> Vec<usize> {\n\n // If the number of possible messages is 0, we return an empty vec.\n\n if max_id == 0 {\n\n return Vec::new();\n\n }\n\n\n\n let stop = max_id + 1;\n\n\n\n let mut items = Vec::new();\n\n for item in sequence_set.iter() {\n\n match *item {\n\n // For a number we just need the value\n\n Number(num) => items.push(num),\n\n // For a range we need all the values inside it\n\n Range(ref a, ref b) => {\n\n // Grab the start of the range\n\n let a = match **a {\n\n Number(num) => num,\n\n Wildcard => max_id,\n\n Range(_, _) => {\n","file_path":"core/src/command/sequence_set.rs","rank":21,"score":64941.092282152254},{"content":"fn main() {\n\n env_logger::init();\n\n info!(\"Application started\");\n\n\n\n // Create the server. We wrap it so that it is atomically reference\n\n // counted. This allows us to safely share it across threads\n\n\n\n let serv = match Server::new() {\n\n Err(e) => {\n\n error!(\"Error starting server: {}\", e);\n\n return;\n\n }\n\n Ok(s) => Arc::new(s),\n\n };\n\n\n\n // Spawn a separate thread for listening for LMTP connections\n\n let lmtp_h = if let Some(lmtp_listener) = serv.lmtp_listener() {\n\n match lmtp_listener {\n\n Err(e) => {\n\n error!(\"Error listening on LMTP port: {}\", e);\n","file_path":"core/src/main.rs","rank":22,"score":41416.64409152838},{"content":"fn listen_generic(\n\n v: TcpListener,\n\n serv: Arc<Server>,\n\n prot: &str,\n\n serve_func: fn(Arc<Server>, TcpStream),\n\n) {\n\n for stream in v.incoming() {\n\n match stream {\n\n Err(e) => {\n\n error!(\"Error accepting incoming {} connection: {}\", prot, e);\n\n }\n\n Ok(stream) => {\n\n let session_serv = serv.clone();\n\n spawn(move || serve_func(session_serv, stream));\n\n }\n\n }\n\n }\n\n}\n\n\n","file_path":"core/src/main.rs","rank":23,"score":40294.06572405435},{"content":"#[test]\n\nfn test_sequence_num() {\n\n assert_eq!(iterator(&[Number(4324)], 5000), vec![4324]);\n\n assert_eq!(iterator(&[Number(23), Number(44)], 5000), vec![23, 44]);\n\n assert_eq!(\n\n iterator(&[Number(6), Number(6), Number(2)], 5000),\n\n vec![2, 6]\n\n );\n\n}\n\n\n","file_path":"core/src/command/sequence_set.rs","rank":24,"score":37366.820453850625},{"content":"#[test]\n\nfn test_sequence_range() {\n\n assert_eq!(\n\n iterator(&[Range(Box::new(Number(6)), Box::new(Wildcard))], 10),\n\n vec![6, 7, 8, 9, 10]\n\n );\n\n assert_eq!(\n\n iterator(&[Range(Box::new(Number(1)), Box::new(Number(10)))], 4),\n\n vec![1, 2, 3, 4]\n\n );\n\n assert_eq!(\n\n iterator(\n\n &[\n\n Range(Box::new(Wildcard), Box::new(Number(8))),\n\n Number(9),\n\n Number(2),\n\n Number(2)\n\n ],\n\n 12\n\n ),\n\n vec![2, 8, 9, 10, 11, 12]\n\n );\n\n}\n\n\n","file_path":"core/src/command/sequence_set.rs","rank":25,"score":37366.820453850625},{"content":"#[test]\n\nfn test_sequence_wildcard() {\n\n assert_eq!(\n\n iterator(\n\n &[Range(Box::new(Number(10)), Box::new(Wildcard)), Wildcard],\n\n 6\n\n ),\n\n vec![1, 2, 3, 4, 5, 6]\n\n );\n\n assert_eq!(iterator(&[Wildcard, Number(8)], 3), vec![1, 2, 3]);\n\n}\n\n\n","file_path":"core/src/command/sequence_set.rs","rank":26,"score":37366.820453850625},{"content":"#[test]\n\nfn test_sequence_complex() {\n\n assert_eq!(\n\n iterator(\n\n &[\n\n Number(1),\n\n Number(3),\n\n Range(Box::new(Number(5)), Box::new(Number(7))),\n\n Number(9),\n\n Number(12),\n\n Range(Box::new(Number(15)), Box::new(Wildcard))\n\n ],\n\n 13\n\n ),\n\n vec![1, 3, 5, 6, 7, 9, 12, 13]\n\n );\n\n}\n","file_path":"core/src/command/sequence_set.rs","rank":27,"score":37366.820453850625},{"content":"#[test]\n\nfn test_sequence_past_end() {\n\n // Needed to help rust infer the type for the empty vec.\n\n let empty_vec: Vec<usize> = Vec::new();\n\n\n\n assert_eq!(iterator(&[Number(4324)], 100), empty_vec);\n\n assert_eq!(iterator(&[Number(23), Number(44)], 30), vec![23]);\n\n assert_eq!(iterator(&[Number(6), Number(6), Number(2)], 4), vec![2]);\n\n}\n\n\n","file_path":"core/src/command/sequence_set.rs","rank":28,"score":36514.655947224994},{"content":"/// Generate a random salt using the cryptographically secure PRNG provided by\n\n/// the OS, for use with bcrypt hashing.\n\nfn gen_salt() -> Vec<u8> {\n\n let mut buf = [0u8; 16];\n\n match getrandom(&mut buf) {\n\n Ok(()) => (),\n\n Err(why) => panic!(\"{:?}\", why),\n\n };\n\n buf.to_vec()\n\n}\n\n\n\n#[cfg(test)]\n\nmod tests {\n\n use crate::server::user::auth;\n\n\n\n #[test]\n\n fn test_valid_auth_data() {\n\n let auth_data = auth::AuthData::new(\"12345\".to_string());\n\n assert!(auth_data.verify_auth(\"12345\".to_string()));\n\n }\n\n\n\n #[test]\n\n fn test_invalid_auth_data() {\n\n let auth_data = auth::AuthData::new(\"12345\".to_string());\n\n assert!(!auth_data.verify_auth(\"54321\".to_string()));\n\n }\n\n}\n","file_path":"core/src/server/user/auth.rs","rank":29,"score":35102.035450796844},{"content":"fn is_ctl(chr: u8) -> bool {\n\n chr <= b'\\x1F' || chr == b'\\x7F'\n\n}\n\n\n","file_path":"core/src/parser/grammar/mod.rs","rank":30,"score":34524.636951322675},{"content":"fn is_dquote(chr: u8) -> bool {\n\n chr == b'\"'\n\n}\n\n\n","file_path":"core/src/parser/grammar/mod.rs","rank":31,"score":34524.636951322675},{"content":"// an ASCII digit (%x30-%x39)\n\nfn is_digit(chr: u8) -> bool {\n\n chr >= b'0' && chr <= b'9'\n\n}\n\n\n","file_path":"core/src/parser/grammar/mod.rs","rank":32,"score":34524.636951322675},{"content":"fn is_sp(chr: u8) -> bool {\n\n chr == b' '\n\n}\n\n\n","file_path":"core/src/parser/grammar/mod.rs","rank":33,"score":34524.636951322675},{"content":"fn is_list_wildcards(chr: u8) -> bool {\n\n chr == b'%' || chr == b'*'\n\n}\n\n\n","file_path":"core/src/parser/grammar/mod.rs","rank":34,"score":33724.781794053386},{"content":"// a CR or LF CHAR\n\nfn is_eol_char(chr: u8) -> bool {\n\n chr == b'\\r' || chr == b'\\n'\n\n}\n\n\n\n/* String parsing */\n\n\n\nnamed!(astring<&[u8], &[u8]>, alt!(take_while1!(is_astring_char) | string));\n\n\n\nnamed!(string<&[u8], &[u8]>, alt!(quoted | literal));\n\n\n\nnamed!(quoted<&[u8], &[u8]>,\n\n delimited!(\n\n tag!(\"\\\"\"),\n\n recognize!(\n\n many0!(\n\n alt!(\n\n take_while1!(is_quoted_char) |\n\n preceded!(tag!(\"\\\\\"), alt!(tag!(\"\\\"\") | tag!(\"\\\\\")))\n\n )\n\n )\n","file_path":"core/src/parser/grammar/mod.rs","rank":35,"score":33724.781794053386},{"content":"fn is_astring_char(chr: u8) -> bool {\n\n is_atom_char(chr) || is_resp_specials(chr)\n\n}\n\n\n","file_path":"core/src/parser/grammar/mod.rs","rank":36,"score":33724.781794053386},{"content":"fn is_resp_specials(chr: u8) -> bool {\n\n chr == b']'\n\n}\n\n\n","file_path":"core/src/parser/grammar/mod.rs","rank":37,"score":33724.781794053386},{"content":"// any CHAR except CR and LF\n\nfn is_text_char(chr: u8) -> bool {\n\n !is_eol_char(chr)\n\n}\n\n\n","file_path":"core/src/parser/grammar/mod.rs","rank":38,"score":33724.781794053386},{"content":"fn is_quoted_specials(chr: u8) -> bool {\n\n is_dquote(chr) || chr == b'\\\\'\n\n}\n\n\n","file_path":"core/src/parser/grammar/mod.rs","rank":39,"score":33724.781794053386},{"content":"fn is_atom_specials(chr: u8) -> bool {\n\n chr == b'('\n\n || chr == b')'\n\n || chr == b'{'\n\n || is_sp(chr)\n\n || is_ctl(chr)\n\n || is_list_wildcards(chr)\n\n || is_quoted_specials(chr)\n\n || is_resp_specials(chr)\n\n}\n\n\n","file_path":"core/src/parser/grammar/mod.rs","rank":40,"score":33724.781794053386},{"content":"// any CHAR except atom-specials\n\nfn is_atom_char(chr: u8) -> bool {\n\n !is_atom_specials(chr)\n\n}\n\n\n","file_path":"core/src/parser/grammar/mod.rs","rank":41,"score":33724.781794053386},{"content":"// any TEXT_CHAR except quoted_specials\n\nfn is_quoted_char(chr: u8) -> bool {\n\n !is_quoted_specials(chr) && is_text_char(chr)\n\n}\n\n\n","file_path":"core/src/parser/grammar/mod.rs","rank":42,"score":33724.781794053386},{"content":"fn listen_lmtp(v: TcpListener, serv: Arc<Server>) {\n\n listen_generic(v, serv, \"LMTP\", lmtp_serve);\n\n}\n\n\n","file_path":"core/src/main.rs","rank":43,"score":32771.61215752442},{"content":"fn listen_imap(v: TcpListener, serv: Arc<Server>) {\n\n listen_generic(v, serv, \"IMAP\", imap_serve);\n\n}\n\n\n","file_path":"core/src/main.rs","rank":44,"score":32771.61215752442},{"content":"\n\n let config = match File::open(&path) {\n\n Ok(mut file) => {\n\n let mut encoded: String = String::new();\n\n match file.read_to_string(&mut encoded) {\n\n Ok(_) => match toml::from_str(&encoded) {\n\n Ok(v) => v,\n\n Err(e) => {\n\n // Use default values if parsing failed.\n\n warn!(\"Failed to parse config.toml.\\nUsing default values: {}\", e);\n\n Config::default(&config_dir)\n\n }\n\n },\n\n Err(e) => {\n\n // Use default values if reading failed.\n\n warn!(\"Failed to read config.toml.\\nUsing default values: {}\", e);\n\n Config::default(&config_dir)\n\n }\n\n }\n\n }\n","file_path":"core/src/server/config.rs","rank":45,"score":16.762673917986874},{"content":" return bad_res;\n\n }\n\n let email = login_args[0].trim_matches('\"');\n\n let password = login_args[1].trim_matches('\"');\n\n let mut no_res = tag.to_string();\n\n no_res.push_str(\" NO invalid username or password\\r\\n\");\n\n if let Some(user) = self.serv.login(email.to_string(), password.to_string()) {\n\n self.maildir = Some(user.maildir.clone());\n\n } else {\n\n return no_res;\n\n }\n\n match self.maildir {\n\n Some(_) => {\n\n let mut res = tag.to_string();\n\n res.push_str(\" OK logged in successfully as \");\n\n res.push_str(email);\n\n res.push_str(\"\\r\\n\");\n\n res\n\n }\n\n None => no_res,\n","file_path":"core/src/server/imap.rs","rank":46,"score":16.492849984162515},{"content":" let (folder, res) =\n\n util::perform_select(&maildir[..], &args.collect::<Vec<&str>>(), true, tag);\n\n self.folder = folder;\n\n match self.folder {\n\n None => bad_res,\n\n _ => res,\n\n }\n\n }\n\n \"create\" => {\n\n let create_args: Vec<&str> = args.collect();\n\n if create_args.len() < 1 {\n\n return bad_res;\n\n }\n\n let mbox_name = create_args[0].trim_matches('\"').replace(\"INBOX\", \"\");\n\n match self.maildir {\n\n None => bad_res,\n\n Some(ref maildir) => {\n\n let mut no_res = tag.to_string();\n\n no_res.push_str(\" NO Could not create folder.\\r\\n\");\n\n let maildir_path = Path::new(&maildir[..]).join(mbox_name);\n","file_path":"core/src/server/imap.rs","rank":47,"score":16.38617651849306},{"content":" }\n\n // Get the compiler to STFU with empty match block\n\n match fs::remove_file(&self.path.join(\".lock\")) {\n\n _ => {}\n\n }\n\n }\n\n result\n\n }\n\n\n\n pub fn message_count(&self) -> usize {\n\n self.messages.len()\n\n }\n\n\n\n /// Perform a fetch of the specified attributes on self.messsages[index]\n\n /// Return the FETCH response string to be sent back to the client\n\n pub fn fetch(&self, index: usize, attributes: &[Attribute]) -> String {\n\n let mut res = \"* \".to_string();\n\n res.push_str(&(index + 1).to_string()[..]);\n\n res.push_str(\" FETCH (\");\n\n res.push_str(&self.messages[index].fetch(attributes)[..]);\n","file_path":"core/src/folder.rs","rank":48,"score":15.931606873940863},{"content":" break;\n\n }\n\n };\n\n let maildir = rcpt.maildir.clone();\n\n let newdir_path = Path::new(&maildir[..]).join(\"new\");\n\n loop {\n\n let file_path = &newdir_path.join(timestamp.to_string());\n\n match File::create(&file_path) {\n\n Err(e) => {\n\n if e.kind() == AlreadyExists {\n\n timestamp += 1;\n\n } else {\n\n warn!(\"Error creating file '{}': {}\", file_path.to_str().unwrap_or_default(), e);\n\n delivery_ioerror!(res);\n\n }\n\n }\n\n Ok(mut file) => {\n\n if file.write(self.data.as_bytes()).is_err() {\n\n warn!(\"Error creating file '{}': cannot write file\", file_path.to_str().unwrap_or_default());\n\n delivery_ioerror!(res);\n","file_path":"core/src/server/lmtp.rs","rank":49,"score":15.372018042352423},{"content":" return no_res;\n\n }\n\n\n\n let mut ok_res = tag.to_string();\n\n ok_res.push_str(\" OK CREATE successful.\\r\\n\");\n\n ok_res\n\n }\n\n }\n\n }\n\n \"delete\" => {\n\n let delete_args: Vec<&str> = args.collect();\n\n if delete_args.len() < 1 {\n\n return bad_res;\n\n }\n\n let mbox_name = delete_args[0].trim_matches('\"').replace(\"INBOX\", \"\");\n\n match self.maildir {\n\n None => bad_res,\n\n Some(ref maildir) => {\n\n let mut no_res = tag.to_string();\n\n no_res.push_str(\" NO Invalid folder.\\r\\n\");\n","file_path":"core/src/server/imap.rs","rank":51,"score":14.889799173714405},{"content":" mime_message: MIME_Message,\n\n\n\n // contains the message's flags\n\n flags: HashSet<Flag>,\n\n\n\n // marks the message for deletion\n\n deleted: bool,\n\n}\n\n\n\nimpl Message {\n\n pub fn new(arg_path: &Path) -> ImapResult<Message> {\n\n let mime_message = MIME_Message::new(arg_path)?;\n\n\n\n // Grab the string in the filename representing the flags\n\n let mut path = path_filename_to_str!(arg_path).splitn(2, ':');\n\n let filename = match path.next() {\n\n Some(fname) => fname,\n\n None => {\n\n return Err(Error::MessageBadFilename);\n\n }\n","file_path":"core/src/message.rs","rank":52,"score":13.589146242655751},{"content":" }\n\n\n\n /**\n\n * RFC3501 - 7.4.2 - P.76\n\n *\n\n * The RFC requests that the data be returned as a parenthesized list, but\n\n * the current format is also acceptible by most mail clients.\n\n */\n\n pub fn get_parenthesized_addresses(&self, key: &str) -> &str {\n\n match self.headers.get(&key.to_string()) {\n\n Some(v) => &v[..],\n\n None => \"NIL\",\n\n }\n\n }\n\n\n\n pub fn get_size(&self) -> String {\n\n self.size.to_string()\n\n }\n\n\n\n pub fn get_header_boundary(&self) -> String {\n\n self.header_boundary.to_string()\n\n }\n\n\n\n pub fn get_header(&self) -> &str {\n\n &self.raw_contents[..self.header_boundary]\n\n }\n\n}\n","file_path":"mime/src/lib.rs","rank":53,"score":12.851552026303189},{"content":" }\n\n }\n\n \"logout\" => {\n\n // Close the connection after sending the response\n\n self.logout = true;\n\n\n\n // Write out current state of selected folder (if any)\n\n // to disk\n\n if let Some(ref folder) = self.folder {\n\n folder.expunge();\n\n }\n\n\n\n let mut res = \"* BYE Server logging out\\r\\n\".to_string();\n\n res.push_str(tag);\n\n res.push_str(\" OK Server logged out\\r\\n\");\n\n res\n\n }\n\n // Examine and Select should be nearly identical...\n\n \"select\" => {\n\n let maildir = match self.maildir {\n","file_path":"core/src/server/imap.rs","rank":54,"score":12.692861497042127},{"content":" // leave the other files, and the\n\n // folder itself, in tact.\n\n let mut ok_res = tag.to_string();\n\n ok_res.push_str(\" OK DELETE successsful.\\r\\n\");\n\n ok_res\n\n })\n\n )\n\n }\n\n }\n\n }\n\n // List folders which match the specified regular expression.\n\n \"list\" => {\n\n let list_args: Vec<&str> = args.collect();\n\n if list_args.len() < 2 {\n\n return bad_res;\n\n }\n\n let reference = list_args[0].trim_matches('\"');\n\n let mailbox_name = list_args[1].trim_matches('\"');\n\n match self.maildir {\n\n None => bad_res,\n","file_path":"core/src/server/imap.rs","rank":55,"score":12.50646153934058},{"content":" }\n\n\n\n let mut args = command.trim().split(' ');\n\n let inv_str = \" BAD Invalid command\\r\\n\";\n\n\n\n // The client will need the tag in the response in order to match up\n\n // the response to the command it issued because the client does not\n\n // have to wait on our response in order to issue new commands.\n\n let mut starttls = false;\n\n let res = match args.next() {\n\n None => inv_str.to_string(),\n\n Some(tag) => {\n\n let mut bad_res = tag.to_string();\n\n bad_res.push_str(inv_str);\n\n\n\n // Interpret the command and generate a response\n\n match args.next() {\n\n None => bad_res,\n\n Some(c) => {\n\n warn!(\"Cmd: {}\", command.trim());\n","file_path":"core/src/server/imap.rs","rank":57,"score":12.229046549141367},{"content":"use self::auth::AuthData;\n\nuse crate::error::ImapResult;\n\nuse serde_json;\n\nuse std::collections::HashMap;\n\nuse std::fs::File;\n\nuse std::io::{Read, Write};\n\nuse std::path::Path;\n\nuse std::str;\n\n\n\npub use self::email::Email;\n\npub use self::login::LoginData;\n\n\n\nmod auth;\n\nmod email;\n\nmod login;\n\n\n\n/// Representation of a User.\n\n#[derive(Debug, Deserialize, Serialize)]\n\npub struct User {\n\n /// The email address through which the user logs in.\n","file_path":"core/src/server/user/mod.rs","rank":58,"score":12.22257448113022},{"content":" }\n\n\n\n /// Goes through the list of attributes, constructing a FETCH response for\n\n /// this message containing the values of the requested attributes\n\n pub fn fetch(&self, attributes: &[Attribute]) -> String {\n\n let mut res = String::new();\n\n let mut first = true;\n\n for attr in attributes.iter() {\n\n // We need to space separate the attribute values\n\n if first {\n\n first = false;\n\n } else {\n\n res.push(' ');\n\n }\n\n\n\n // Provide the attribute name followed by the attribute value\n\n match *attr {\n\n Envelope => {\n\n res.push_str(\"ENVELOPE \");\n\n res.push_str(&self.mime_message.get_envelope()[..]);\n","file_path":"core/src/message.rs","rank":59,"score":12.146172666013968},{"content":"\n\nimpl AuthData {\n\n /// Generates a hash and salt for secure storage of a password\n\n pub fn new(password: String) -> AuthData {\n\n let salt = gen_salt();\n\n let password = password.into_bytes();\n\n // Perform the bcrypt hashing, storing it to an output vector.\n\n let out = &mut [0u8; 32];\n\n bcrypt_pbkdf(&password[..], &salt[..], ROUNDS, out);\n\n\n\n AuthData {\n\n salt: salt,\n\n out: out.to_vec(),\n\n }\n\n }\n\n\n\n /// Verify a password string against the stored auth data to see if it\n\n /// matches.\n\n pub fn verify_auth(&self, password: String) -> bool {\n\n let out = &mut [0u8; 32];\n\n bcrypt_pbkdf(&password.into_bytes()[..], &self.salt[..], ROUNDS, out);\n\n self.out == out.to_vec()\n\n }\n\n}\n\n\n\n/// Generate a random salt using the cryptographically secure PRNG provided by\n\n/// the OS, for use with bcrypt hashing.\n","file_path":"core/src/server/user/auth.rs","rank":60,"score":12.136464338060613},{"content":" Some(ref maildir) => {\n\n if mailbox_name.is_empty() {\n\n return format!(\n\n \"* LIST (\\\\Noselect) \\\"/\\\" \\\"{}\\\"\\r\\n{} OK List successful\\r\\n\",\n\n reference, tag\n\n );\n\n }\n\n let mailbox_name = mailbox_name.replace(\"*\", \".*\").replace(\"%\", \"[^/]*\");\n\n let maildir_path = Path::new(&maildir[..]);\n\n let re_opt = Regex::new(\n\n &format!(\n\n \"{}{}?{}{}?{}$\",\n\n path_filename_to_str!(maildir_path),\n\n MAIN_SEPARATOR,\n\n reference,\n\n MAIN_SEPARATOR,\n\n mailbox_name.replace(\"INBOX\", \"\")\n\n )[..],\n\n );\n\n match re_opt {\n","file_path":"core/src/server/imap.rs","rank":61,"score":11.935121872677625},{"content":"use std::collections::HashMap;\n\nuse std::fs::File;\n\nuse std::io::Read;\n\nuse std::path::Path;\n\nuse std::str;\n\n\n\npub use self::command::BodySectionType;\n\nuse self::command::BodySectionType::{AllSection, MsgtextSection, PartSection};\n\n\n\npub use self::command::Msgtext;\n\nuse self::command::Msgtext::{\n\n HeaderFieldsMsgtext, HeaderFieldsNotMsgtext, HeaderMsgtext, MimeMsgtext, TextMsgtext,\n\n};\n\n\n\npub use self::error::Error;\n\nuse self::error::Result as MimeResult;\n\n\n\nmod command;\n\nmod error;\n\n\n","file_path":"mime/src/lib.rs","rank":62,"score":11.845019632620046},{"content":" pub email: Email,\n\n /// The authentication data the used to verify the user's identity.\n\n pub auth_data: AuthData,\n\n /// The root directory in which the user's mail is stored.\n\n pub maildir: String,\n\n}\n\n\n\nimpl User {\n\n /// Creates a new user from a provided email, plaintext password, and root\n\n /// mail directory.\n\n pub fn new(email: Email, password: String, maildir: String) -> User {\n\n User {\n\n email: email,\n\n auth_data: AuthData::new(password),\n\n maildir: maildir,\n\n }\n\n }\n\n}\n\n\n\n/// Reads a JSON file and turns it into a `HashMap` of emails to users.\n\n/// May throw an `std::io::Error`, hence the `Result<>` type.\n","file_path":"core/src/server/user/mod.rs","rank":63,"score":11.790881924155237},{"content":" }\n\n };\n\n let mut from_parts = from_path_split.split('@');\n\n let local_part = match from_parts.next() {\n\n Some(part) => part.to_string(),\n\n _ => {\n\n return None;\n\n }\n\n };\n\n let domain_part = match from_parts.next() {\n\n Some(part) => part.to_string(),\n\n _ => {\n\n return None;\n\n }\n\n };\n\n Some(Email::new(local_part, domain_part))\n\n}\n\n\n","file_path":"core/src/server/lmtp.rs","rank":64,"score":11.756314561971612},{"content":" pub lmtp_ssl_port: Option<u16>,\n\n // SSL port on which to listen for IMAP\n\n pub imap_ssl_port: Option<u16>,\n\n // file in which user data is stored\n\n pub users: String,\n\n // Filename of PKCS #12 archive\n\n pub pkcs_file: String,\n\n // Password for PKCS #12 archive\n\n pub pkcs_pass: String,\n\n}\n\n\n\nimpl Config {\n\n pub fn new() -> ImapResult<Config> {\n\n let config_dir = match env::var(\"SEGIMAP_CONFIG_DIR\") {\n\n Ok(val) => val,\n\n Err(_e) => \".\".to_string(),\n\n };\n\n\n\n let config_file = format!(\"{}/config.toml\", config_dir);\n\n let path = Path::new(&config_file);\n","file_path":"core/src/server/config.rs","rank":66,"score":11.544548035186063},{"content":" }\n\n }\n\n\n\n pub fn remove_if_deleted(&self) -> bool {\n\n if self.deleted {\n\n // Get the compiler to STFU with empty match block\n\n match fs::remove_file(self.path.as_path()) {\n\n _ => {}\n\n }\n\n }\n\n self.deleted\n\n }\n\n\n\n pub fn get_path(&self) -> &Path {\n\n self.path.as_path()\n\n }\n\n\n\n pub fn get_uid(&self) -> usize {\n\n self.uid\n\n }\n","file_path":"core/src/message.rs","rank":67,"score":11.520464843241614},{"content":" Err(_) => bad_res,\n\n Ok(re) => {\n\n let list_responses = util::list(&maildir[..], &re);\n\n let mut ok_res = String::new();\n\n for list_response in &list_responses {\n\n ok_res.push_str(&list_response[..]);\n\n ok_res.push_str(\"\\r\\n\");\n\n }\n\n ok_res.push_str(tag);\n\n ok_res.push_str(\" OK list successful\\r\\n\");\n\n ok_res\n\n }\n\n }\n\n }\n\n }\n\n }\n\n // Resolve state of folder in memory with state of mail on\n\n // disk\n\n \"check\" => {\n\n match self.expunge() {\n","file_path":"core/src/server/imap.rs","rank":68,"score":11.496905734815986},{"content":"impl Folder {\n\n pub fn new(path: PathBuf, examine: bool) -> Option<Folder> {\n\n // the EXAMINE command is always read-only or we test SELECT for read-only status\n\n // We use a lock file to determine write access on a folder\n\n let readonly = if examine || fs::File::open(&path.join(\".lock\")).is_ok() {\n\n true\n\n } else {\n\n if let Ok(mut file) = fs::File::create(&path.join(\".lock\")) {\n\n // Get the compiler to STFU with this match\n\n let _ = file.write(b\"selected\");\n\n false\n\n } else {\n\n true\n\n }\n\n };\n\n\n\n if let Ok(cur) = fs::read_dir(&(path.join(\"cur\"))) {\n\n if let Ok(new) = fs::read_dir(&(path.join(\"new\"))) {\n\n let mut messages = Vec::new();\n\n let mut uid_to_seqnum: HashMap<usize, usize> = HashMap::new();\n","file_path":"core/src/folder.rs","rank":69,"score":11.259588345890243},{"content":" messages: messages,\n\n readonly: readonly,\n\n uid_to_seqnum: uid_to_seqnum,\n\n });\n\n }\n\n }\n\n None\n\n }\n\n\n\n /// Generate the SELECT/EXAMINE response based on data in the folder\n\n pub fn select_response(&self, tag: &str) -> String {\n\n let unseen_res = if self.unseen <= self.exists {\n\n let unseen_str = self.unseen.to_string();\n\n let mut res = \"* OK [UNSEEN \".to_string();\n\n res.push_str(&unseen_str[..]);\n\n res.push_str(\"] Message \");\n\n res.push_str(&unseen_str[..]);\n\n res.push_str(\"th is the first unseen\\r\\n\");\n\n res\n\n } else {\n","file_path":"core/src/folder.rs","rank":70,"score":11.229329420181921},{"content":"use std::fmt;\n\n\n\n/// Representation of an email\n\n/// This helps ensure the email at least has an '@' in it...\n\n#[derive(Clone, Debug, Deserialize, Eq, Hash, PartialEq, Serialize)]\n\npub struct Email {\n\n pub local_part: String,\n\n pub domain_part: String,\n\n}\n\n\n\nimpl fmt::Display for Email {\n\n fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {\n\n write!(f, \"{}\", self.to_string())\n\n }\n\n}\n\n\n\nimpl Email {\n\n pub fn new(local_part: String, domain_part: String) -> Email {\n\n Email {\n\n local_part: local_part,\n","file_path":"core/src/server/user/email.rs","rank":71,"score":11.20183562969351},{"content":" /// single character per flag representation of the current set of flags.\n\n pub fn get_new_filename(&self) -> String {\n\n let mut res = self.uid.to_string();\n\n\n\n // it is just the UID if no flags are set.\n\n if self.flags.is_empty() {\n\n return res;\n\n }\n\n\n\n // Add the prelud which separates the flags\n\n res.push_str(\":2,\");\n\n\n\n // As per the Maildir standard, the flags are to be written in\n\n // alphabetical order\n\n if self.flags.contains(&Flag::Draft) {\n\n res.push('D');\n\n }\n\n if self.flags.contains(&Flag::Flagged) {\n\n res.push('F');\n\n }\n","file_path":"core/src/message.rs","rank":73,"score":10.917510122787943},{"content":"SEGIMAP\n\n=======\n\n\n\nThis is a continuation of the upstream SEGIMAP server. Unfortunately it seems upstream might be abandoned, so this repo is trying to modernize it enough to run in a Docker container.\n\n\n\n[](https://github.com/kruton/segimap/actions/workflows/docker.yml)\n\n\n\nOriginal description\n\n--------------------\n\nThis is an IMAP server implementation written in Rust. It originally started out as a class project in Fall 2014.\n\nThere is also an LMTP server attached so that SMTP servers may deliver mail without modifying the maildir themselves.\n\n\n\nSome notes about Rust\n\n---------------------\n\n\n\nThe most confusing thing for those reading the code who are unfamiliar with rust will likely be &str and String. &str is an actual string while String is actually a StringBuffer. `&x[..]` is used to get a &str out of a String called `x` and `y.to_string()` is used to get a String out of a &str called `y`. Sometimes we need something which is neither of these to be a string so we use `.to_str()` or `.to_string()` as appropriate. Sometimes we need a String but the thing we have can only be converted to &str so we have to chain the calls like so: `.to_str().to_string()`. It sometimes also occurs the other way around in which case we wind up with something like `&z.to_string()[..]`.\n\n\n\n& denotes a pointer (ie: pass-by-reference semantics). When you see &mut it means that the pointer is mutable. Rust only allows one mutable pointer at a time and enforces this at compile time. However, multiple immutable pointers may be created. * is used to dereference a pointer. In most cases, method calls will automatically dereference when needed.\n\n\n\nThe statement `return thing;` is equivalent to `thing` (note the absence of a semi-colon).\n\n\n\nThat should be everything someone who doesn't know rust needs to understand this code and why we do things certain ways.\n\n\n","file_path":"README.md","rank":74,"score":10.900299599168147},{"content":"use nom::crlf;\n\nuse std::str;\n\n\n\npub use self::fetch::fetch;\n\n\n\nmod fetch;\n\nmod sequence;\n\n\n\nconst DIGITS: &'static str = \"0123456789\";\n\nconst NZ_DIGITS: &'static str = \"123456789\";\n\n\n","file_path":"core/src/parser/grammar/mod.rs","rank":75,"score":10.79886151956141},{"content":" return;\n\n }\n\n }\n\n\n\n // If there is an error on the stream, exit.\n\n Err(_) => {\n\n return;\n\n }\n\n }\n\n }\n\n }\n\n\n\n /// Interprets a client command and generates a String response\n\n fn interpret(\n\n &mut self,\n\n cmd: &str,\n\n args: &mut Split<char>,\n\n tag: &str,\n\n bad_res: String,\n\n ) -> String {\n","file_path":"core/src/server/imap.rs","rank":76,"score":10.790367482061743},{"content":"use super::email::Email;\n\n\n\n/// Representation of an email and password login attempt.\n\npub struct LoginData {\n\n pub email: Email,\n\n pub password: String,\n\n}\n\n\n\nimpl LoginData {\n\n pub fn new(email: String, password: String) -> Option<LoginData> {\n\n let mut parts = (&email[..]).split('@');\n\n if let Some(local_part) = parts.next() {\n\n if let Some(domain_part) = parts.next() {\n\n let login_data = LoginData {\n\n email: Email {\n\n local_part: local_part.to_string(),\n\n domain_part: domain_part.to_string(),\n\n },\n\n password: password,\n\n };\n\n return Some(login_data);\n\n }\n\n }\n\n\n\n None\n\n }\n\n}\n","file_path":"core/src/server/user/login.rs","rank":77,"score":10.786754806448997},{"content":" _ => {}\n\n }\n\n match self.folder {\n\n None => bad_res,\n\n Some(ref mut folder) => {\n\n folder.check();\n\n let mut ok_res = tag.to_string();\n\n ok_res.push_str(\" OK Check completed\\r\\n\");\n\n ok_res\n\n }\n\n }\n\n }\n\n // Close the currently selected folder. Perform all\n\n // required cleanup.\n\n \"close\" => match self.expunge() {\n\n Err(_) => bad_res,\n\n Ok(_) => {\n\n if let Some(ref mut folder) = self.folder {\n\n folder.check();\n\n }\n","file_path":"core/src/server/imap.rs","rank":78,"score":10.724549191024547},{"content":" // The argument after the tag specified the command issued.\n\n // Additional arguments are arguments for that specific command.\n\n match cmd {\n\n \"noop\" => {\n\n let mut res = tag.to_string();\n\n res += \" OK NOOP\\r\\n\";\n\n res\n\n }\n\n\n\n // Inform the client of the supported IMAP version and\n\n // extension(s)\n\n \"capability\" => {\n\n let mut res = \"* CAPABILITY IMAP4rev1 CHILDREN\\r\\n\".to_string();\n\n res.push_str(tag);\n\n res.push_str(\" OK Capability successful\\r\\n\");\n\n res\n\n }\n\n \"login\" => {\n\n let login_args: Vec<&str> = args.collect();\n\n if login_args.len() < 2 {\n","file_path":"core/src/server/imap.rs","rank":79,"score":10.68003849757391},{"content":" self.folder = None;\n\n format!(\"{} OK close completed\\r\\n\", tag)\n\n }\n\n },\n\n // Delete the messages currently marked for deletion.\n\n \"expunge\" => match self.expunge() {\n\n Err(_) => bad_res,\n\n Ok(v) => {\n\n let mut ok_res = String::new();\n\n for i in &v {\n\n ok_res.push_str(\"* \");\n\n ok_res.push_str(&i.to_string()[..]);\n\n ok_res.push_str(\" EXPUNGE\\r\\n\");\n\n }\n\n ok_res.push_str(tag);\n\n ok_res.push_str(\" OK expunge completed\\r\\n\");\n\n ok_res\n\n }\n\n },\n\n \"fetch\" => {\n","file_path":"core/src/server/imap.rs","rank":80,"score":10.54853401654476},{"content":"use crate::error::ImapResult;\n\nuse openssl::error::ErrorStack;\n\nuse openssl::pkcs12::Pkcs12;\n\nuse openssl::ssl::{SslAcceptor, SslMethod};\n\nuse openssl::x509::X509;\n\nuse std::env;\n\nuse std::fs::File;\n\nuse std::io::{Error as IoError, Read, Write};\n\nuse std::path::Path;\n\nuse std::str;\n\nuse toml;\n\n\n\npub enum PkcsError {\n\n Io(IoError),\n\n Ssl(ErrorStack),\n\n PortsDisabled,\n\n}\n\n\n\nimpl From<IoError> for PkcsError {\n\n fn from(e: IoError) -> Self {\n","file_path":"core/src/server/config.rs","rank":81,"score":10.503736023253923},{"content":" _ => { },\n\n }\n\n },\n\n */\n\n UID => {\n\n res.push_str(\"UID \");\n\n res.push_str(&self.uid.to_string()[..])\n\n }\n\n }\n\n }\n\n res\n\n }\n\n\n\n // Creates a string of the current set of flags based on what is in\n\n // self.flags.\n\n fn print_flags(&self) -> String {\n\n let mut res = \"(\".to_string();\n\n let mut first = true;\n\n for flag in &self.flags {\n\n // The flags should be space separated.\n","file_path":"core/src/message.rs","rank":82,"score":10.445533997237021},{"content":" },\n\n },\n\n \"data\" => {\n\n return_on_err!(stream.write(data_res));\n\n return_on_err!(stream.flush());\n\n let mut loop_res = invalid;\n\n loop {\n\n let mut data_command = String::new();\n\n match stream.read_line(&mut data_command) {\n\n Ok(_) => {\n\n if data_command.is_empty() {\n\n break;\n\n }\n\n let data_cmd = (&data_command[..]).trim();\n\n if data_cmd == \".\" {\n\n loop_res = l.deliver();\n\n l.data = String::new();\n\n break;\n\n }\n\n l.data.push_str(data_cmd);\n","file_path":"core/src/server/lmtp.rs","rank":83,"score":10.251935949740748},{"content":"use chrono::{Datelike, NaiveDateTime, Timelike};\n\nuse std::collections::HashSet;\n\nuse std::fs;\n\nuse std::path::Path;\n\nuse std::path::PathBuf;\n\nuse std::str;\n\n\n\nuse crate::command::store::StoreName;\n\nuse crate::command::Attribute;\n\nuse crate::command::Attribute::{\n\n Body, BodyPeek, BodySection, BodyStructure, Envelope, Flags, InternalDate, RFC822, UID,\n\n};\n\nuse crate::command::RFC822Attribute::{AllRFC822, HeaderRFC822, SizeRFC822, TextRFC822};\n\n\n\nuse crate::error::{Error, ImapResult};\n\n\n\nuse mime::Message as MIME_Message;\n\n\n\n/// Representation of a message flag\n\n#[derive(Eq, PartialEq, Hash, Debug, Clone)]\n\npub enum Flag {\n\n Answered,\n\n Draft,\n\n Flagged,\n\n Seen,\n\n Deleted,\n\n}\n\n\n\n/// Takes a flag argument and returns the corresponding enum.\n","file_path":"core/src/message.rs","rank":84,"score":10.144893395645937},{"content":" let maildir_path = Path::new(&maildir[..]).join(mbox_name);\n\n let newmaildir_path = maildir_path.join(\"new\");\n\n let curmaildir_path = maildir_path.join(\"cur\");\n\n opendirlisting!(\n\n &newmaildir_path,\n\n newlist,\n\n no_res,\n\n opendirlisting!(&curmaildir_path, curlist, no_res, {\n\n // Delete the mail in the folder\n\n for file_entry in newlist {\n\n match file_entry {\n\n Ok(file) => {\n\n if fs::remove_file(file.path()).is_err() {\n\n return no_res;\n\n }\n\n }\n\n Err(_) => return no_res,\n\n }\n\n }\n\n for file_entry in curlist {\n","file_path":"core/src/server/imap.rs","rank":85,"score":10.123604945875744},{"content":" let start = match folder.get_index_from_uid(&n) {\n\n Some(start) => *start,\n\n None => {\n\n if n == 1 {\n\n 0usize\n\n } else {\n\n return bad_res;\n\n }\n\n }\n\n };\n\n let mut res = String::new();\n\n for index in start..folder.message_count() {\n\n res.push_str(&folder.fetch(index+1, &parsed_cmd.attributes)[..]);\n\n }\n\n res.push_str(tag);\n\n res.push_str(\" OK UID FETCH completed\\r\\n\");\n\n return res;\n\n }\n\n }\n\n };\n","file_path":"core/src/server/imap.rs","rank":86,"score":10.050227104959653},{"content":" match &c.to_ascii_lowercase()[..] {\n\n // STARTTLS is handled here because it modifies the stream\n\n \"starttls\" => match stream.get_ref() {\n\n &Stream::Tcp(_) => {\n\n if self.serv.can_starttls() {\n\n starttls = true;\n\n let mut ok_res = tag.to_string();\n\n ok_res.push_str(\n\n \" OK Begin TLS negotiation now\\r\\n\",\n\n );\n\n ok_res\n\n } else {\n\n bad_res\n\n }\n\n }\n\n _ => bad_res,\n\n },\n\n cmd => self.interpret(cmd, &mut args, tag, bad_res),\n\n }\n\n }\n","file_path":"core/src/server/imap.rs","rank":87,"score":10.024202457512857},{"content":" None => {\n\n return bad_res;\n\n }\n\n Some(ref maildir) => maildir,\n\n };\n\n let (folder, res) =\n\n util::perform_select(&maildir[..], &args.collect::<Vec<&str>>(), false, tag);\n\n self.folder = folder;\n\n match self.folder {\n\n None => bad_res,\n\n _ => res,\n\n }\n\n }\n\n \"examine\" => {\n\n let maildir = match self.maildir {\n\n None => {\n\n return bad_res;\n\n }\n\n Some(ref maildir) => maildir,\n\n };\n","file_path":"core/src/server/imap.rs","rank":88,"score":9.99704001070352},{"content":" }\n\n }\n\n);\n\n\n\nmacro_rules! delivery_ioerror(\n\n ($res:ident) => ({\n\n $res.push_str(\"451 Error in processing.\\r\\n\");\n\n break;\n\n })\n\n);\n\n\n\nmacro_rules! grab_email_token(\n\n ($arg:expr) => {\n\n match $arg {\n\n Some(from_path) => from_path.trim_start_matches('<').trim_end_matches('>'),\n\n _ => { return None; }\n\n }\n\n }\n\n);\n\n\n","file_path":"core/src/server/lmtp.rs","rank":89,"score":9.637673870499036},{"content":"use std::collections::{HashMap, HashSet};\n\nuse std::fs;\n\nuse std::io::Write;\n\nuse std::path::Path;\n\nuse std::path::PathBuf;\n\n\n\nuse crate::command::Attribute;\n\nuse crate::message::Flag;\n\nuse crate::message::Message;\n\n\n\nuse crate::command::store::StoreName;\n\n\n\n/// Representation of a Folder\n\n#[derive(Clone, Debug)]\n\npub struct Folder {\n\n // How many messages are in folder/new/\n\n recent: usize,\n\n // How many messages are in the folder total\n\n exists: usize,\n\n // How many messages are not marked with the Seen flag\n","file_path":"core/src/folder.rs","rank":90,"score":9.572147903086625},{"content":" domain_part: domain_part,\n\n }\n\n }\n\n\n\n fn to_string(&self) -> String {\n\n let mut res = self.local_part.clone();\n\n res.push('@');\n\n res.push_str(&self.domain_part[..]);\n\n res\n\n }\n\n}\n","file_path":"core/src/server/user/email.rs","rank":91,"score":9.308165254230122},{"content":" res.push_str(\")\\r\\n\");\n\n res\n\n }\n\n\n\n /// Turn a UID into a sequence number\n\n pub fn get_index_from_uid(&self, uid: &usize) -> Option<&usize> {\n\n self.uid_to_seqnum.get(uid)\n\n }\n\n\n\n /// Perform a STORE on the specified set of sequence numbers\n\n /// This modifies the flags of the specified messages\n\n /// Returns the String response to be sent back to the client.\n\n pub fn store(\n\n &mut self,\n\n sequence_set: Vec<usize>,\n\n flag_name: &StoreName,\n\n silent: bool,\n\n flags: HashSet<Flag>,\n\n seq_uid: bool,\n\n tag: &str,\n","file_path":"core/src/folder.rs","rank":92,"score":9.272117608844594},{"content":" (&self.raw_contents[..]).len(),\n\n self.raw_contents\n\n )\n\n }\n\n MsgtextSection(ref msgtext) => match *msgtext {\n\n HeaderMsgtext | HeaderFieldsNotMsgtext(_) | TextMsgtext | MimeMsgtext => {\n\n empty_string\n\n }\n\n HeaderFieldsMsgtext(ref fields) => {\n\n let mut field_keys = String::new();\n\n let mut field_values = String::new();\n\n let mut first = true;\n\n for field in fields.iter() {\n\n match self.headers.get(field) {\n\n Some(v) => {\n\n let field_slice = &field[..];\n\n if first {\n\n first = false;\n\n } else {\n\n field_keys.push(' ');\n","file_path":"mime/src/lib.rs","rank":93,"score":9.206912028322192},{"content":" .to_string();\n\n\n\n // Add a space between the merged lines.\n\n trimmed_next.push(' ');\n\n trimmed_next.push_str(line.trim_start_matches(' ').trim_start_matches('\\t'));\n\n if !next.starts_with(' ') && !next.starts_with('\\t') {\n\n let split: Vec<&str> = (&trimmed_next[..]).splitn(2, ':').collect();\n\n headers.insert(split[0].to_ascii_uppercase(), split[1][1..].to_string());\n\n break;\n\n }\n\n }\n\n } else {\n\n let split: Vec<&str> = line.splitn(2, ':').collect();\n\n headers.insert(split[0].to_ascii_uppercase(), split[1][1..].to_string());\n\n }\n\n }\n\n\n\n // Remove the \"Received\" key from the HashMap.\n\n let received_key = &RECEIVED.to_string();\n\n if headers.get(received_key).is_some() {\n","file_path":"mime/src/lib.rs","rank":94,"score":9.143419354657816},{"content":"pub enum Stream {\n\n Ssl(SslStream<TcpStream>),\n\n Tcp(TcpStream),\n\n}\n\n\n\nimpl Write for Stream {\n\n fn write(&mut self, buf: &[u8]) -> Result<usize> {\n\n match *self {\n\n Stream::Ssl(ref mut s) => s.write(buf),\n\n Stream::Tcp(ref mut s) => s.write(buf),\n\n }\n\n }\n\n\n\n fn flush(&mut self) -> Result<()> {\n\n match *self {\n\n Stream::Ssl(ref mut s) => s.flush(),\n\n Stream::Tcp(ref mut s) => s.flush(),\n\n }\n\n }\n\n}\n","file_path":"core/src/server/mod.rs","rank":95,"score":9.131637265736746},{"content":" }\n\n }\n\n\n\n /// Handles client commands as they come in on the stream and writes\n\n /// responeses back to the stream.\n\n pub fn handle(&mut self, orig_stream: TcpStream) {\n\n let mut stream = BufStream::new(self.serv.imap_ssl(orig_stream));\n\n // Provide the client with an IMAP greeting.\n\n return_on_err!(stream.write(GREET));\n\n return_on_err!(stream.flush());\n\n\n\n let mut command = String::new();\n\n loop {\n\n command.truncate(0);\n\n match stream.read_line(&mut command) {\n\n Ok(_) => {\n\n // If the command is empty, exit.\n\n // Exitting will close the stream for us.\n\n if command.is_empty() {\n\n return;\n","file_path":"core/src/server/imap.rs","rank":96,"score":8.999105109555664},{"content":"use bufstream::BufStream;\n\nuse regex::Regex;\n\nuse std::fs;\n\nuse std::io::{BufRead, Write};\n\nuse std::net::TcpStream;\n\nuse std::os::unix::fs::PermissionsExt;\n\nuse std::path::Path;\n\nuse std::path::MAIN_SEPARATOR;\n\nuse std::str::Split;\n\nuse std::sync::Arc;\n\n\n\nuse crate::folder::Folder;\n\nuse crate::server::Server;\n\nuse crate::server::Stream;\n\n\n\nuse crate::command::fetch;\n\nuse crate::command::sequence_set;\n\nuse crate::command::sequence_set::SequenceItem::{Number, Range, Wildcard};\n\nuse crate::command::store;\n\nuse crate::command::Attribute::UID;\n","file_path":"core/src/server/imap.rs","rank":97,"score":8.977644924311676},{"content":" if let Some(message) = self.messages.get_mut(i - 1) {\n\n responses.push_str(\"* \");\n\n responses.push_str(&i.to_string()[..]);\n\n responses.push_str(\" FETCH (FLAGS \");\n\n responses.push_str(&message.store(flag_name, flags.clone())[..]);\n\n\n\n // UID STORE needs to respond with the UID for each FETCH response\n\n if seq_uid {\n\n let uid_res = format!(\" UID {}\", uid);\n\n responses.push_str(&uid_res[..]);\n\n }\n\n responses.push_str(\" )\\r\\n\");\n\n }\n\n }\n\n\n\n // Return an empty string if the client wanted the STORE to be SILENT\n\n if silent {\n\n responses = String::new();\n\n }\n\n responses.push_str(tag);\n","file_path":"core/src/folder.rs","rank":98,"score":8.934740082385032},{"content":" use super::fetch;\n\n use command::sequence_set::SequenceItem::{Number, Range, Wildcard};\n\n use command::Attribute::{BodyPeek, Flags, RFC822};\n\n use command::FetchCommand;\n\n use command::RFC822Attribute::AllRFC822;\n\n use mime::BodySectionType::PartSection;\n\n use mime::Msgtext::HeaderFieldsNotMsgtext;\n\n use nom::IResult::Done;\n\n\n\n #[bench]\n\n fn bench_fetch(b: &mut Bencher) {\n\n const FETCH_STR: &'static str =\n\n \"FETCH 4,5:3,* (FLAGS RFC822 BODY.PEEK[43.65.HEADER.FIELDS.NOT (a \\\"abc\\\")]<4.2>)\";\n\n\n\n b.iter(|| {\n\n assert_eq!(\n\n fetch(FETCH_STR.as_bytes()),\n\n Done(\n\n &b\"\"[..],\n\n FetchCommand::new(\n","file_path":"core/src/parser/grammar/fetch.rs","rank":99,"score":8.76112179392614}],"string":"[\n {\n \"content\": \"/// Parse and perform the store operation specified by `store_args`. Returns the\\n\\n/// response to the client or None if a BAD response should be sent back to\\n\\n/// the client\\n\\npub fn store(folder: &mut Folder, store_args: &[&str], seq_uid: bool, tag: &str) -> Option<String> {\\n\\n if store_args.len() < 3 {\\n\\n return None;\\n\\n }\\n\\n\\n\\n // Parse the sequence set argument\\n\\n let sequence_set_opt = sequence_set::parse(store_args[0].trim_matches('\\\"'));\\n\\n // Grab how to handle the flags. It should be case insensitive.\\n\\n let data_name = store_args[1].trim_matches('\\\"').to_ascii_lowercase();\\n\\n\\n\\n // Split into \\\"flag\\\" part and \\\"silent\\\" part.\\n\\n let mut data_name_parts = (&data_name[..]).split('.');\\n\\n let flag_part = data_name_parts.next();\\n\\n let silent_part = data_name_parts.next();\\n\\n\\n\\n // There shouldn't be any more parts to the data name argument\\n\\n if data_name_parts.next().is_some() {\\n\\n return None;\\n\\n }\\n\\n\\n\",\n \"file_path\": \"core/src/command/store.rs\",\n \"rank\": 1,\n \"score\": 172655.79344536812\n },\n {\n \"content\": \"/// Reads a JSON file and turns it into a `HashMap` of emails to users.\\n\\n/// May throw an `std::io::Error`, hence the `Result<>` type.\\n\\npub fn load_users(path_str: &str) -> ImapResult<HashMap<Email, User>> {\\n\\n let path = Path::new(&path_str[..]);\\n\\n\\n\\n let users = match File::open(&path) {\\n\\n Ok(mut file) => {\\n\\n let mut file_buf: String = String::new();\\n\\n file.read_to_string(&mut file_buf)?;\\n\\n serde_json::from_str(&file_buf)?\\n\\n }\\n\\n Err(e) => {\\n\\n warn!(\\\"Failed to open users file, creating default: {}\\\", e);\\n\\n create_default_users(&path)?\\n\\n }\\n\\n };\\n\\n\\n\\n let mut map = HashMap::<Email, User>::new();\\n\\n for user in users {\\n\\n map.insert(user.email.clone(), user);\\n\\n }\\n\\n\\n\\n Ok(map)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"core/src/server/user/mod.rs\",\n \"rank\": 3,\n \"score\": 131725.49913843535\n },\n {\n \"content\": \"/// Given a string as passed in from the client, create a list of sequence items\\n\\n/// If the string does not represent a valid list, return None\\n\\npub fn parse(sequence_string: &str) -> Option<Vec<SequenceItem>> {\\n\\n let sequences = sequence_string.split(',');\\n\\n let mut sequence_set = Vec::new();\\n\\n for sequence in sequences {\\n\\n let mut range = sequence.split(':');\\n\\n let start = match range.next() {\\n\\n None => return None,\\n\\n Some(seq) => match parse_item(seq) {\\n\\n None => return None,\\n\\n Some(item) => item,\\n\\n },\\n\\n };\\n\\n let stop = match range.next() {\\n\\n None => {\\n\\n // Nothing after ':'\\n\\n // Add the number or wildcard and bail out\\n\\n sequence_set.push(start);\\n\\n continue;\\n\\n }\\n\\n Some(seq) => match parse_item(seq) {\\n\",\n \"file_path\": \"core/src/command/sequence_set.rs\",\n \"rank\": 4,\n \"score\": 131504.31379202352\n },\n {\n \"content\": \"/// Writes a list of users to a new file on the disk.\\n\\npub fn save_users(path: &Path, users: &[User]) -> ImapResult<()> {\\n\\n let encoded = serde_json::to_string(&users)?;\\n\\n\\n\\n let mut file = File::create(&path)?;\\n\\n file.write(encoded.as_bytes())?;\\n\\n\\n\\n Ok(())\\n\\n}\\n\\n\\n\",\n \"file_path\": \"core/src/server/user/mod.rs\",\n \"rank\": 6,\n \"score\": 124367.14001897915\n },\n {\n \"content\": \"/// Takes a flag argument and returns the corresponding enum.\\n\\npub fn parse_flag(flag: &str) -> Option<Flag> {\\n\\n match flag {\\n\\n \\\"\\\\\\\\Deleted\\\" => Some(Flag::Deleted),\\n\\n \\\"\\\\\\\\Seen\\\" => Some(Flag::Seen),\\n\\n \\\"\\\\\\\\Draft\\\" => Some(Flag::Draft),\\n\\n \\\"\\\\\\\\Answered\\\" => Some(Flag::Answered),\\n\\n \\\"\\\\\\\\Flagged\\\" => Some(Flag::Flagged),\\n\\n _ => None,\\n\\n }\\n\\n}\\n\\n\\n\\n/// Representation of a Message\\n\\n#[derive(Debug, Clone)]\\n\\npub struct Message {\\n\\n // a unique id (timestamp) for the message\\n\\n uid: usize,\\n\\n\\n\\n // filename\\n\\n path: PathBuf,\\n\\n\\n\",\n \"file_path\": \"core/src/message.rs\",\n \"rank\": 7,\n \"score\": 118807.34395038549\n },\n {\n \"content\": \"/// Take the rest of the arguments provided by the client and parse them into a\\n\\n/// `FetchCommand` object with `parser::fetch`.\\n\\npub fn fetch(args: Vec<&str>) -> ParserResult<FetchCommand> {\\n\\n let mut cmd = \\\"FETCH\\\".to_string();\\n\\n for arg in args {\\n\\n cmd.push(' ');\\n\\n cmd.push_str(arg);\\n\\n }\\n\\n\\n\\n parser::fetch(cmd.as_bytes())\\n\\n}\\n\\n\\n\",\n \"file_path\": \"core/src/command/fetch.rs\",\n \"rank\": 9,\n \"score\": 110073.9421727498\n },\n {\n \"content\": \"pub fn serve(serv: Arc<Server>, mut stream: BufStream<TcpStream>) {\\n\\n let mut l = Lmtp {\\n\\n rev_path: None,\\n\\n to_path: Vec::new(),\\n\\n data: String::new(),\\n\\n quit: false,\\n\\n };\\n\\n return_on_err!(stream.write(format!(\\\"220 {} LMTP server ready\\\\r\\\\n\\\", *serv.host()).as_bytes()));\\n\\n return_on_err!(stream.flush());\\n\\n loop {\\n\\n let mut command = String::new();\\n\\n match stream.read_line(&mut command) {\\n\\n Ok(_) => {\\n\\n if command.is_empty() {\\n\\n return;\\n\\n }\\n\\n let trimmed_command = (&command[..]).trim();\\n\\n let mut args = trimmed_command.split(' ');\\n\\n let invalid = \\\"500 Invalid command\\\\r\\\\n\\\".to_string();\\n\\n let data_res = b\\\"354 Start mail input; end with <CRLF>.<CRLF>\\\\r\\\\n\\\";\\n\",\n \"file_path\": \"core/src/server/lmtp.rs\",\n \"rank\": 10,\n \"score\": 103302.48012242152\n },\n {\n \"content\": \"/// Perform the fetch operation on each sequence number indicated and return\\n\\n/// the response to be sent back to the client.\\n\\npub fn fetch_loop(\\n\\n parsed_cmd: &FetchCommand,\\n\\n folder: &mut Folder,\\n\\n sequence_iter: &[usize],\\n\\n tag: &str,\\n\\n uid: bool,\\n\\n) -> String {\\n\\n for attr in &parsed_cmd.attributes {\\n\\n if let BodySection(_, _) = *attr {\\n\\n let mut seen_flag_set = HashSet::new();\\n\\n seen_flag_set.insert(Seen);\\n\\n folder.store(\\n\\n sequence_iter.to_vec(),\\n\\n &Add,\\n\\n true,\\n\\n seen_flag_set,\\n\\n false,\\n\\n tag,\\n\\n );\\n\\n break;\\n\",\n \"file_path\": \"core/src/command/fetch.rs\",\n \"rank\": 11,\n \"score\": 87552.26192698072\n },\n {\n \"content\": \"/// Function to create an example users JSON file at the specified path.\\n\\n///\\n\\n/// Returns the list of example users.\\n\\nfn create_default_users(path: &Path) -> ImapResult<Vec<User>> {\\n\\n let users = vec![\\n\\n User::new(\\n\\n Email::new(\\\"will\\\".to_string(), \\\"xqz.ca\\\".to_string()),\\n\\n \\\"54321\\\".to_string(),\\n\\n \\\"./maildir\\\".to_string(),\\n\\n ),\\n\\n User::new(\\n\\n Email::new(\\\"nikitapekin\\\".to_string(), \\\"gmail.com\\\".to_string()),\\n\\n \\\"12345\\\".to_string(),\\n\\n \\\"./maildir\\\".to_string(),\\n\\n ),\\n\\n ];\\n\\n\\n\\n save_users(path, &users)?;\\n\\n\\n\\n Ok(users)\\n\\n}\\n\",\n \"file_path\": \"core/src/server/user/mod.rs\",\n \"rank\": 12,\n \"score\": 86813.52789540804\n },\n {\n \"content\": \"/// This moves a list of messages from folder/new/ to folder/cur/ and returns a\\n\\n/// new list of messages\\n\\nfn move_new(messages: &[Message], path: &Path, start_index: usize) -> Vec<Message> {\\n\\n let mut new_messages = Vec::new();\\n\\n\\n\\n // Go over the messages by index\\n\\n for (i, msg) in messages.iter().enumerate() {\\n\\n // messages before start_index are already in folder/cur/\\n\\n if i + 1 < start_index {\\n\\n new_messages.push(msg.clone());\\n\\n continue;\\n\\n }\\n\\n let curpath = path.join(\\\"cur\\\").join(msg.get_uid().to_string());\\n\\n rename_message!(msg, curpath, new_messages);\\n\\n }\\n\\n\\n\\n // Return the new list of messages\\n\\n new_messages\\n\\n}\\n\",\n \"file_path\": \"core/src/folder.rs\",\n \"rank\": 13,\n \"score\": 83223.04383241442\n },\n {\n \"content\": \"fn parse_item(item: &str) -> Option<SequenceItem> {\\n\\n if let Ok(intseq) = item.parse() {\\n\\n Some(Number(intseq))\\n\\n } else if item == \\\"*\\\" {\\n\\n // item is not a valid number\\n\\n // If it is the wildcard value return that\\n\\n // Otherwise, return no sequence item\\n\\n Some(Wildcard)\\n\\n } else {\\n\\n None\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"core/src/command/sequence_set.rs\",\n \"rank\": 14,\n \"score\": 74735.59798608409\n },\n {\n \"content\": \"fn grab_email(arg: Option<&str>) -> Option<Email> {\\n\\n let from_path_split = match arg {\\n\\n Some(full_from_path) => {\\n\\n let mut split_arg = full_from_path.split(':');\\n\\n match split_arg.next() {\\n\\n Some(from_str) => match &from_str.to_ascii_lowercase()[..] {\\n\\n \\\"from\\\" | \\\"to\\\" => {\\n\\n grab_email_token!(split_arg.next())\\n\\n }\\n\\n _ => {\\n\\n return None;\\n\\n }\\n\\n },\\n\\n _ => {\\n\\n return None;\\n\\n }\\n\\n }\\n\\n }\\n\\n _ => {\\n\\n return None;\\n\",\n \"file_path\": \"core/src/server/lmtp.rs\",\n \"rank\": 15,\n \"score\": 74696.64143306736\n },\n {\n \"content\": \"/// Takes the argument specifying what to do with the provided flags in a store\\n\\n/// operation and returns the corresponding enum.\\n\\nfn parse_storename(storename: Option<&str>) -> Option<StoreName> {\\n\\n match storename {\\n\\n Some(\\\"flags\\\") => Some(Replace),\\n\\n Some(\\\"+flags\\\") => Some(Add),\\n\\n Some(\\\"-flags\\\") => Some(Sub),\\n\\n _ => None,\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"core/src/command/store.rs\",\n \"rank\": 16,\n \"score\": 73254.45650290004\n },\n {\n \"content\": \"pub fn fetch(input: &[u8]) -> ParserResult<FetchCommand> {\\n\\n use nom::IResult::{Done, Error, Incomplete};\\n\\n\\n\\n match self::grammar::fetch(input) {\\n\\n Done(_, v) => Ok(v),\\n\\n Incomplete(_) => Err(ParserError::Incomplete),\\n\\n Error(err) => Err(err).map_err(ParserError::from),\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"core/src/parser/mod.rs\",\n \"rank\": 17,\n \"score\": 72386.61040590914\n },\n {\n \"content\": \"pub fn uid_iterator(sequence_set: &[SequenceItem]) -> Vec<usize> {\\n\\n let mut items = Vec::new();\\n\\n for item in sequence_set.iter() {\\n\\n match *item {\\n\\n Number(num) => items.push(num),\\n\\n Range(ref a, ref b) => {\\n\\n let a = match **a {\\n\\n Number(num) => num,\\n\\n Wildcard => return Vec::new(),\\n\\n Range(_, _) => {\\n\\n error!(\\\"A range of ranges is invalid.\\\");\\n\\n continue;\\n\\n }\\n\\n };\\n\\n let b = match **b {\\n\\n Number(num) => num,\\n\\n Wildcard => return Vec::new(),\\n\\n Range(_, _) => {\\n\\n error!(\\\"A range of ranges is invalid.\\\");\\n\\n continue;\\n\",\n \"file_path\": \"core/src/command/sequence_set.rs\",\n \"rank\": 18,\n \"score\": 69745.82299310195\n },\n {\n \"content\": \"pub fn imap_serve(serv: Arc<Server>, stream: TcpStream) {\\n\\n let mut session = ImapSession::new(serv);\\n\\n session.handle(stream);\\n\\n}\\n\",\n \"file_path\": \"core/src/server/mod.rs\",\n \"rank\": 19,\n \"score\": 69745.27040243053\n },\n {\n \"content\": \"pub fn lmtp_serve(serv: Arc<Server>, stream: TcpStream) {\\n\\n lmtp::serve(serv, BufStream::new(stream))\\n\\n}\\n\\n\\n\",\n \"file_path\": \"core/src/server/mod.rs\",\n \"rank\": 20,\n \"score\": 69745.27040243053\n },\n {\n \"content\": \"/// Create the list of unsigned integers representing valid ids from a list of\\n\\n/// sequence items. Ideally this would handle wildcards in O(1) rather than O(n)\\n\\npub fn iterator(sequence_set: &[SequenceItem], max_id: usize) -> Vec<usize> {\\n\\n // If the number of possible messages is 0, we return an empty vec.\\n\\n if max_id == 0 {\\n\\n return Vec::new();\\n\\n }\\n\\n\\n\\n let stop = max_id + 1;\\n\\n\\n\\n let mut items = Vec::new();\\n\\n for item in sequence_set.iter() {\\n\\n match *item {\\n\\n // For a number we just need the value\\n\\n Number(num) => items.push(num),\\n\\n // For a range we need all the values inside it\\n\\n Range(ref a, ref b) => {\\n\\n // Grab the start of the range\\n\\n let a = match **a {\\n\\n Number(num) => num,\\n\\n Wildcard => max_id,\\n\\n Range(_, _) => {\\n\",\n \"file_path\": \"core/src/command/sequence_set.rs\",\n \"rank\": 21,\n \"score\": 64941.092282152254\n },\n {\n \"content\": \"fn main() {\\n\\n env_logger::init();\\n\\n info!(\\\"Application started\\\");\\n\\n\\n\\n // Create the server. We wrap it so that it is atomically reference\\n\\n // counted. This allows us to safely share it across threads\\n\\n\\n\\n let serv = match Server::new() {\\n\\n Err(e) => {\\n\\n error!(\\\"Error starting server: {}\\\", e);\\n\\n return;\\n\\n }\\n\\n Ok(s) => Arc::new(s),\\n\\n };\\n\\n\\n\\n // Spawn a separate thread for listening for LMTP connections\\n\\n let lmtp_h = if let Some(lmtp_listener) = serv.lmtp_listener() {\\n\\n match lmtp_listener {\\n\\n Err(e) => {\\n\\n error!(\\\"Error listening on LMTP port: {}\\\", e);\\n\",\n \"file_path\": \"core/src/main.rs\",\n \"rank\": 22,\n \"score\": 41416.64409152838\n },\n {\n \"content\": \"fn listen_generic(\\n\\n v: TcpListener,\\n\\n serv: Arc<Server>,\\n\\n prot: &str,\\n\\n serve_func: fn(Arc<Server>, TcpStream),\\n\\n) {\\n\\n for stream in v.incoming() {\\n\\n match stream {\\n\\n Err(e) => {\\n\\n error!(\\\"Error accepting incoming {} connection: {}\\\", prot, e);\\n\\n }\\n\\n Ok(stream) => {\\n\\n let session_serv = serv.clone();\\n\\n spawn(move || serve_func(session_serv, stream));\\n\\n }\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"core/src/main.rs\",\n \"rank\": 23,\n \"score\": 40294.06572405435\n },\n {\n \"content\": \"#[test]\\n\\nfn test_sequence_num() {\\n\\n assert_eq!(iterator(&[Number(4324)], 5000), vec![4324]);\\n\\n assert_eq!(iterator(&[Number(23), Number(44)], 5000), vec![23, 44]);\\n\\n assert_eq!(\\n\\n iterator(&[Number(6), Number(6), Number(2)], 5000),\\n\\n vec![2, 6]\\n\\n );\\n\\n}\\n\\n\\n\",\n \"file_path\": \"core/src/command/sequence_set.rs\",\n \"rank\": 24,\n \"score\": 37366.820453850625\n },\n {\n \"content\": \"#[test]\\n\\nfn test_sequence_range() {\\n\\n assert_eq!(\\n\\n iterator(&[Range(Box::new(Number(6)), Box::new(Wildcard))], 10),\\n\\n vec![6, 7, 8, 9, 10]\\n\\n );\\n\\n assert_eq!(\\n\\n iterator(&[Range(Box::new(Number(1)), Box::new(Number(10)))], 4),\\n\\n vec![1, 2, 3, 4]\\n\\n );\\n\\n assert_eq!(\\n\\n iterator(\\n\\n &[\\n\\n Range(Box::new(Wildcard), Box::new(Number(8))),\\n\\n Number(9),\\n\\n Number(2),\\n\\n Number(2)\\n\\n ],\\n\\n 12\\n\\n ),\\n\\n vec![2, 8, 9, 10, 11, 12]\\n\\n );\\n\\n}\\n\\n\\n\",\n \"file_path\": \"core/src/command/sequence_set.rs\",\n \"rank\": 25,\n \"score\": 37366.820453850625\n },\n {\n \"content\": \"#[test]\\n\\nfn test_sequence_wildcard() {\\n\\n assert_eq!(\\n\\n iterator(\\n\\n &[Range(Box::new(Number(10)), Box::new(Wildcard)), Wildcard],\\n\\n 6\\n\\n ),\\n\\n vec![1, 2, 3, 4, 5, 6]\\n\\n );\\n\\n assert_eq!(iterator(&[Wildcard, Number(8)], 3), vec![1, 2, 3]);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"core/src/command/sequence_set.rs\",\n \"rank\": 26,\n \"score\": 37366.820453850625\n },\n {\n \"content\": \"#[test]\\n\\nfn test_sequence_complex() {\\n\\n assert_eq!(\\n\\n iterator(\\n\\n &[\\n\\n Number(1),\\n\\n Number(3),\\n\\n Range(Box::new(Number(5)), Box::new(Number(7))),\\n\\n Number(9),\\n\\n Number(12),\\n\\n Range(Box::new(Number(15)), Box::new(Wildcard))\\n\\n ],\\n\\n 13\\n\\n ),\\n\\n vec![1, 3, 5, 6, 7, 9, 12, 13]\\n\\n );\\n\\n}\\n\",\n \"file_path\": \"core/src/command/sequence_set.rs\",\n \"rank\": 27,\n \"score\": 37366.820453850625\n },\n {\n \"content\": \"#[test]\\n\\nfn test_sequence_past_end() {\\n\\n // Needed to help rust infer the type for the empty vec.\\n\\n let empty_vec: Vec<usize> = Vec::new();\\n\\n\\n\\n assert_eq!(iterator(&[Number(4324)], 100), empty_vec);\\n\\n assert_eq!(iterator(&[Number(23), Number(44)], 30), vec![23]);\\n\\n assert_eq!(iterator(&[Number(6), Number(6), Number(2)], 4), vec![2]);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"core/src/command/sequence_set.rs\",\n \"rank\": 28,\n \"score\": 36514.655947224994\n },\n {\n \"content\": \"/// Generate a random salt using the cryptographically secure PRNG provided by\\n\\n/// the OS, for use with bcrypt hashing.\\n\\nfn gen_salt() -> Vec<u8> {\\n\\n let mut buf = [0u8; 16];\\n\\n match getrandom(&mut buf) {\\n\\n Ok(()) => (),\\n\\n Err(why) => panic!(\\\"{:?}\\\", why),\\n\\n };\\n\\n buf.to_vec()\\n\\n}\\n\\n\\n\\n#[cfg(test)]\\n\\nmod tests {\\n\\n use crate::server::user::auth;\\n\\n\\n\\n #[test]\\n\\n fn test_valid_auth_data() {\\n\\n let auth_data = auth::AuthData::new(\\\"12345\\\".to_string());\\n\\n assert!(auth_data.verify_auth(\\\"12345\\\".to_string()));\\n\\n }\\n\\n\\n\\n #[test]\\n\\n fn test_invalid_auth_data() {\\n\\n let auth_data = auth::AuthData::new(\\\"12345\\\".to_string());\\n\\n assert!(!auth_data.verify_auth(\\\"54321\\\".to_string()));\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"core/src/server/user/auth.rs\",\n \"rank\": 29,\n \"score\": 35102.035450796844\n },\n {\n \"content\": \"fn is_ctl(chr: u8) -> bool {\\n\\n chr <= b'\\\\x1F' || chr == b'\\\\x7F'\\n\\n}\\n\\n\\n\",\n \"file_path\": \"core/src/parser/grammar/mod.rs\",\n \"rank\": 30,\n \"score\": 34524.636951322675\n },\n {\n \"content\": \"fn is_dquote(chr: u8) -> bool {\\n\\n chr == b'\\\"'\\n\\n}\\n\\n\\n\",\n \"file_path\": \"core/src/parser/grammar/mod.rs\",\n \"rank\": 31,\n \"score\": 34524.636951322675\n },\n {\n \"content\": \"// an ASCII digit (%x30-%x39)\\n\\nfn is_digit(chr: u8) -> bool {\\n\\n chr >= b'0' && chr <= b'9'\\n\\n}\\n\\n\\n\",\n \"file_path\": \"core/src/parser/grammar/mod.rs\",\n \"rank\": 32,\n \"score\": 34524.636951322675\n },\n {\n \"content\": \"fn is_sp(chr: u8) -> bool {\\n\\n chr == b' '\\n\\n}\\n\\n\\n\",\n \"file_path\": \"core/src/parser/grammar/mod.rs\",\n \"rank\": 33,\n \"score\": 34524.636951322675\n },\n {\n \"content\": \"fn is_list_wildcards(chr: u8) -> bool {\\n\\n chr == b'%' || chr == b'*'\\n\\n}\\n\\n\\n\",\n \"file_path\": \"core/src/parser/grammar/mod.rs\",\n \"rank\": 34,\n \"score\": 33724.781794053386\n },\n {\n \"content\": \"// a CR or LF CHAR\\n\\nfn is_eol_char(chr: u8) -> bool {\\n\\n chr == b'\\\\r' || chr == b'\\\\n'\\n\\n}\\n\\n\\n\\n/* String parsing */\\n\\n\\n\\nnamed!(astring<&[u8], &[u8]>, alt!(take_while1!(is_astring_char) | string));\\n\\n\\n\\nnamed!(string<&[u8], &[u8]>, alt!(quoted | literal));\\n\\n\\n\\nnamed!(quoted<&[u8], &[u8]>,\\n\\n delimited!(\\n\\n tag!(\\\"\\\\\\\"\\\"),\\n\\n recognize!(\\n\\n many0!(\\n\\n alt!(\\n\\n take_while1!(is_quoted_char) |\\n\\n preceded!(tag!(\\\"\\\\\\\\\\\"), alt!(tag!(\\\"\\\\\\\"\\\") | tag!(\\\"\\\\\\\\\\\")))\\n\\n )\\n\\n )\\n\",\n \"file_path\": \"core/src/parser/grammar/mod.rs\",\n \"rank\": 35,\n \"score\": 33724.781794053386\n },\n {\n \"content\": \"fn is_astring_char(chr: u8) -> bool {\\n\\n is_atom_char(chr) || is_resp_specials(chr)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"core/src/parser/grammar/mod.rs\",\n \"rank\": 36,\n \"score\": 33724.781794053386\n },\n {\n \"content\": \"fn is_resp_specials(chr: u8) -> bool {\\n\\n chr == b']'\\n\\n}\\n\\n\\n\",\n \"file_path\": \"core/src/parser/grammar/mod.rs\",\n \"rank\": 37,\n \"score\": 33724.781794053386\n },\n {\n \"content\": \"// any CHAR except CR and LF\\n\\nfn is_text_char(chr: u8) -> bool {\\n\\n !is_eol_char(chr)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"core/src/parser/grammar/mod.rs\",\n \"rank\": 38,\n \"score\": 33724.781794053386\n },\n {\n \"content\": \"fn is_quoted_specials(chr: u8) -> bool {\\n\\n is_dquote(chr) || chr == b'\\\\\\\\'\\n\\n}\\n\\n\\n\",\n \"file_path\": \"core/src/parser/grammar/mod.rs\",\n \"rank\": 39,\n \"score\": 33724.781794053386\n },\n {\n \"content\": \"fn is_atom_specials(chr: u8) -> bool {\\n\\n chr == b'('\\n\\n || chr == b')'\\n\\n || chr == b'{'\\n\\n || is_sp(chr)\\n\\n || is_ctl(chr)\\n\\n || is_list_wildcards(chr)\\n\\n || is_quoted_specials(chr)\\n\\n || is_resp_specials(chr)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"core/src/parser/grammar/mod.rs\",\n \"rank\": 40,\n \"score\": 33724.781794053386\n },\n {\n \"content\": \"// any CHAR except atom-specials\\n\\nfn is_atom_char(chr: u8) -> bool {\\n\\n !is_atom_specials(chr)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"core/src/parser/grammar/mod.rs\",\n \"rank\": 41,\n \"score\": 33724.781794053386\n },\n {\n \"content\": \"// any TEXT_CHAR except quoted_specials\\n\\nfn is_quoted_char(chr: u8) -> bool {\\n\\n !is_quoted_specials(chr) && is_text_char(chr)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"core/src/parser/grammar/mod.rs\",\n \"rank\": 42,\n \"score\": 33724.781794053386\n },\n {\n \"content\": \"fn listen_lmtp(v: TcpListener, serv: Arc<Server>) {\\n\\n listen_generic(v, serv, \\\"LMTP\\\", lmtp_serve);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"core/src/main.rs\",\n \"rank\": 43,\n \"score\": 32771.61215752442\n },\n {\n \"content\": \"fn listen_imap(v: TcpListener, serv: Arc<Server>) {\\n\\n listen_generic(v, serv, \\\"IMAP\\\", imap_serve);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"core/src/main.rs\",\n \"rank\": 44,\n \"score\": 32771.61215752442\n },\n {\n \"content\": \"\\n\\n let config = match File::open(&path) {\\n\\n Ok(mut file) => {\\n\\n let mut encoded: String = String::new();\\n\\n match file.read_to_string(&mut encoded) {\\n\\n Ok(_) => match toml::from_str(&encoded) {\\n\\n Ok(v) => v,\\n\\n Err(e) => {\\n\\n // Use default values if parsing failed.\\n\\n warn!(\\\"Failed to parse config.toml.\\\\nUsing default values: {}\\\", e);\\n\\n Config::default(&config_dir)\\n\\n }\\n\\n },\\n\\n Err(e) => {\\n\\n // Use default values if reading failed.\\n\\n warn!(\\\"Failed to read config.toml.\\\\nUsing default values: {}\\\", e);\\n\\n Config::default(&config_dir)\\n\\n }\\n\\n }\\n\\n }\\n\",\n \"file_path\": \"core/src/server/config.rs\",\n \"rank\": 45,\n \"score\": 16.762673917986874\n },\n {\n \"content\": \" return bad_res;\\n\\n }\\n\\n let email = login_args[0].trim_matches('\\\"');\\n\\n let password = login_args[1].trim_matches('\\\"');\\n\\n let mut no_res = tag.to_string();\\n\\n no_res.push_str(\\\" NO invalid username or password\\\\r\\\\n\\\");\\n\\n if let Some(user) = self.serv.login(email.to_string(), password.to_string()) {\\n\\n self.maildir = Some(user.maildir.clone());\\n\\n } else {\\n\\n return no_res;\\n\\n }\\n\\n match self.maildir {\\n\\n Some(_) => {\\n\\n let mut res = tag.to_string();\\n\\n res.push_str(\\\" OK logged in successfully as \\\");\\n\\n res.push_str(email);\\n\\n res.push_str(\\\"\\\\r\\\\n\\\");\\n\\n res\\n\\n }\\n\\n None => no_res,\\n\",\n \"file_path\": \"core/src/server/imap.rs\",\n \"rank\": 46,\n \"score\": 16.492849984162515\n },\n {\n \"content\": \" let (folder, res) =\\n\\n util::perform_select(&maildir[..], &args.collect::<Vec<&str>>(), true, tag);\\n\\n self.folder = folder;\\n\\n match self.folder {\\n\\n None => bad_res,\\n\\n _ => res,\\n\\n }\\n\\n }\\n\\n \\\"create\\\" => {\\n\\n let create_args: Vec<&str> = args.collect();\\n\\n if create_args.len() < 1 {\\n\\n return bad_res;\\n\\n }\\n\\n let mbox_name = create_args[0].trim_matches('\\\"').replace(\\\"INBOX\\\", \\\"\\\");\\n\\n match self.maildir {\\n\\n None => bad_res,\\n\\n Some(ref maildir) => {\\n\\n let mut no_res = tag.to_string();\\n\\n no_res.push_str(\\\" NO Could not create folder.\\\\r\\\\n\\\");\\n\\n let maildir_path = Path::new(&maildir[..]).join(mbox_name);\\n\",\n \"file_path\": \"core/src/server/imap.rs\",\n \"rank\": 47,\n \"score\": 16.38617651849306\n },\n {\n \"content\": \" }\\n\\n // Get the compiler to STFU with empty match block\\n\\n match fs::remove_file(&self.path.join(\\\".lock\\\")) {\\n\\n _ => {}\\n\\n }\\n\\n }\\n\\n result\\n\\n }\\n\\n\\n\\n pub fn message_count(&self) -> usize {\\n\\n self.messages.len()\\n\\n }\\n\\n\\n\\n /// Perform a fetch of the specified attributes on self.messsages[index]\\n\\n /// Return the FETCH response string to be sent back to the client\\n\\n pub fn fetch(&self, index: usize, attributes: &[Attribute]) -> String {\\n\\n let mut res = \\\"* \\\".to_string();\\n\\n res.push_str(&(index + 1).to_string()[..]);\\n\\n res.push_str(\\\" FETCH (\\\");\\n\\n res.push_str(&self.messages[index].fetch(attributes)[..]);\\n\",\n \"file_path\": \"core/src/folder.rs\",\n \"rank\": 48,\n \"score\": 15.931606873940863\n },\n {\n \"content\": \" break;\\n\\n }\\n\\n };\\n\\n let maildir = rcpt.maildir.clone();\\n\\n let newdir_path = Path::new(&maildir[..]).join(\\\"new\\\");\\n\\n loop {\\n\\n let file_path = &newdir_path.join(timestamp.to_string());\\n\\n match File::create(&file_path) {\\n\\n Err(e) => {\\n\\n if e.kind() == AlreadyExists {\\n\\n timestamp += 1;\\n\\n } else {\\n\\n warn!(\\\"Error creating file '{}': {}\\\", file_path.to_str().unwrap_or_default(), e);\\n\\n delivery_ioerror!(res);\\n\\n }\\n\\n }\\n\\n Ok(mut file) => {\\n\\n if file.write(self.data.as_bytes()).is_err() {\\n\\n warn!(\\\"Error creating file '{}': cannot write file\\\", file_path.to_str().unwrap_or_default());\\n\\n delivery_ioerror!(res);\\n\",\n \"file_path\": \"core/src/server/lmtp.rs\",\n \"rank\": 49,\n \"score\": 15.372018042352423\n },\n {\n \"content\": \" return no_res;\\n\\n }\\n\\n\\n\\n let mut ok_res = tag.to_string();\\n\\n ok_res.push_str(\\\" OK CREATE successful.\\\\r\\\\n\\\");\\n\\n ok_res\\n\\n }\\n\\n }\\n\\n }\\n\\n \\\"delete\\\" => {\\n\\n let delete_args: Vec<&str> = args.collect();\\n\\n if delete_args.len() < 1 {\\n\\n return bad_res;\\n\\n }\\n\\n let mbox_name = delete_args[0].trim_matches('\\\"').replace(\\\"INBOX\\\", \\\"\\\");\\n\\n match self.maildir {\\n\\n None => bad_res,\\n\\n Some(ref maildir) => {\\n\\n let mut no_res = tag.to_string();\\n\\n no_res.push_str(\\\" NO Invalid folder.\\\\r\\\\n\\\");\\n\",\n \"file_path\": \"core/src/server/imap.rs\",\n \"rank\": 51,\n \"score\": 14.889799173714405\n },\n {\n \"content\": \" mime_message: MIME_Message,\\n\\n\\n\\n // contains the message's flags\\n\\n flags: HashSet<Flag>,\\n\\n\\n\\n // marks the message for deletion\\n\\n deleted: bool,\\n\\n}\\n\\n\\n\\nimpl Message {\\n\\n pub fn new(arg_path: &Path) -> ImapResult<Message> {\\n\\n let mime_message = MIME_Message::new(arg_path)?;\\n\\n\\n\\n // Grab the string in the filename representing the flags\\n\\n let mut path = path_filename_to_str!(arg_path).splitn(2, ':');\\n\\n let filename = match path.next() {\\n\\n Some(fname) => fname,\\n\\n None => {\\n\\n return Err(Error::MessageBadFilename);\\n\\n }\\n\",\n \"file_path\": \"core/src/message.rs\",\n \"rank\": 52,\n \"score\": 13.589146242655751\n },\n {\n \"content\": \" }\\n\\n\\n\\n /**\\n\\n * RFC3501 - 7.4.2 - P.76\\n\\n *\\n\\n * The RFC requests that the data be returned as a parenthesized list, but\\n\\n * the current format is also acceptible by most mail clients.\\n\\n */\\n\\n pub fn get_parenthesized_addresses(&self, key: &str) -> &str {\\n\\n match self.headers.get(&key.to_string()) {\\n\\n Some(v) => &v[..],\\n\\n None => \\\"NIL\\\",\\n\\n }\\n\\n }\\n\\n\\n\\n pub fn get_size(&self) -> String {\\n\\n self.size.to_string()\\n\\n }\\n\\n\\n\\n pub fn get_header_boundary(&self) -> String {\\n\\n self.header_boundary.to_string()\\n\\n }\\n\\n\\n\\n pub fn get_header(&self) -> &str {\\n\\n &self.raw_contents[..self.header_boundary]\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"mime/src/lib.rs\",\n \"rank\": 53,\n \"score\": 12.851552026303189\n },\n {\n \"content\": \" }\\n\\n }\\n\\n \\\"logout\\\" => {\\n\\n // Close the connection after sending the response\\n\\n self.logout = true;\\n\\n\\n\\n // Write out current state of selected folder (if any)\\n\\n // to disk\\n\\n if let Some(ref folder) = self.folder {\\n\\n folder.expunge();\\n\\n }\\n\\n\\n\\n let mut res = \\\"* BYE Server logging out\\\\r\\\\n\\\".to_string();\\n\\n res.push_str(tag);\\n\\n res.push_str(\\\" OK Server logged out\\\\r\\\\n\\\");\\n\\n res\\n\\n }\\n\\n // Examine and Select should be nearly identical...\\n\\n \\\"select\\\" => {\\n\\n let maildir = match self.maildir {\\n\",\n \"file_path\": \"core/src/server/imap.rs\",\n \"rank\": 54,\n \"score\": 12.692861497042127\n },\n {\n \"content\": \" // leave the other files, and the\\n\\n // folder itself, in tact.\\n\\n let mut ok_res = tag.to_string();\\n\\n ok_res.push_str(\\\" OK DELETE successsful.\\\\r\\\\n\\\");\\n\\n ok_res\\n\\n })\\n\\n )\\n\\n }\\n\\n }\\n\\n }\\n\\n // List folders which match the specified regular expression.\\n\\n \\\"list\\\" => {\\n\\n let list_args: Vec<&str> = args.collect();\\n\\n if list_args.len() < 2 {\\n\\n return bad_res;\\n\\n }\\n\\n let reference = list_args[0].trim_matches('\\\"');\\n\\n let mailbox_name = list_args[1].trim_matches('\\\"');\\n\\n match self.maildir {\\n\\n None => bad_res,\\n\",\n \"file_path\": \"core/src/server/imap.rs\",\n \"rank\": 55,\n \"score\": 12.50646153934058\n },\n {\n \"content\": \" }\\n\\n\\n\\n let mut args = command.trim().split(' ');\\n\\n let inv_str = \\\" BAD Invalid command\\\\r\\\\n\\\";\\n\\n\\n\\n // The client will need the tag in the response in order to match up\\n\\n // the response to the command it issued because the client does not\\n\\n // have to wait on our response in order to issue new commands.\\n\\n let mut starttls = false;\\n\\n let res = match args.next() {\\n\\n None => inv_str.to_string(),\\n\\n Some(tag) => {\\n\\n let mut bad_res = tag.to_string();\\n\\n bad_res.push_str(inv_str);\\n\\n\\n\\n // Interpret the command and generate a response\\n\\n match args.next() {\\n\\n None => bad_res,\\n\\n Some(c) => {\\n\\n warn!(\\\"Cmd: {}\\\", command.trim());\\n\",\n \"file_path\": \"core/src/server/imap.rs\",\n \"rank\": 57,\n \"score\": 12.229046549141367\n },\n {\n \"content\": \"use self::auth::AuthData;\\n\\nuse crate::error::ImapResult;\\n\\nuse serde_json;\\n\\nuse std::collections::HashMap;\\n\\nuse std::fs::File;\\n\\nuse std::io::{Read, Write};\\n\\nuse std::path::Path;\\n\\nuse std::str;\\n\\n\\n\\npub use self::email::Email;\\n\\npub use self::login::LoginData;\\n\\n\\n\\nmod auth;\\n\\nmod email;\\n\\nmod login;\\n\\n\\n\\n/// Representation of a User.\\n\\n#[derive(Debug, Deserialize, Serialize)]\\n\\npub struct User {\\n\\n /// The email address through which the user logs in.\\n\",\n \"file_path\": \"core/src/server/user/mod.rs\",\n \"rank\": 58,\n \"score\": 12.22257448113022\n },\n {\n \"content\": \" }\\n\\n\\n\\n /// Goes through the list of attributes, constructing a FETCH response for\\n\\n /// this message containing the values of the requested attributes\\n\\n pub fn fetch(&self, attributes: &[Attribute]) -> String {\\n\\n let mut res = String::new();\\n\\n let mut first = true;\\n\\n for attr in attributes.iter() {\\n\\n // We need to space separate the attribute values\\n\\n if first {\\n\\n first = false;\\n\\n } else {\\n\\n res.push(' ');\\n\\n }\\n\\n\\n\\n // Provide the attribute name followed by the attribute value\\n\\n match *attr {\\n\\n Envelope => {\\n\\n res.push_str(\\\"ENVELOPE \\\");\\n\\n res.push_str(&self.mime_message.get_envelope()[..]);\\n\",\n \"file_path\": \"core/src/message.rs\",\n \"rank\": 59,\n \"score\": 12.146172666013968\n },\n {\n \"content\": \"\\n\\nimpl AuthData {\\n\\n /// Generates a hash and salt for secure storage of a password\\n\\n pub fn new(password: String) -> AuthData {\\n\\n let salt = gen_salt();\\n\\n let password = password.into_bytes();\\n\\n // Perform the bcrypt hashing, storing it to an output vector.\\n\\n let out = &mut [0u8; 32];\\n\\n bcrypt_pbkdf(&password[..], &salt[..], ROUNDS, out);\\n\\n\\n\\n AuthData {\\n\\n salt: salt,\\n\\n out: out.to_vec(),\\n\\n }\\n\\n }\\n\\n\\n\\n /// Verify a password string against the stored auth data to see if it\\n\\n /// matches.\\n\\n pub fn verify_auth(&self, password: String) -> bool {\\n\\n let out = &mut [0u8; 32];\\n\\n bcrypt_pbkdf(&password.into_bytes()[..], &self.salt[..], ROUNDS, out);\\n\\n self.out == out.to_vec()\\n\\n }\\n\\n}\\n\\n\\n\\n/// Generate a random salt using the cryptographically secure PRNG provided by\\n\\n/// the OS, for use with bcrypt hashing.\\n\",\n \"file_path\": \"core/src/server/user/auth.rs\",\n \"rank\": 60,\n \"score\": 12.136464338060613\n },\n {\n \"content\": \" Some(ref maildir) => {\\n\\n if mailbox_name.is_empty() {\\n\\n return format!(\\n\\n \\\"* LIST (\\\\\\\\Noselect) \\\\\\\"/\\\\\\\" \\\\\\\"{}\\\\\\\"\\\\r\\\\n{} OK List successful\\\\r\\\\n\\\",\\n\\n reference, tag\\n\\n );\\n\\n }\\n\\n let mailbox_name = mailbox_name.replace(\\\"*\\\", \\\".*\\\").replace(\\\"%\\\", \\\"[^/]*\\\");\\n\\n let maildir_path = Path::new(&maildir[..]);\\n\\n let re_opt = Regex::new(\\n\\n &format!(\\n\\n \\\"{}{}?{}{}?{}$\\\",\\n\\n path_filename_to_str!(maildir_path),\\n\\n MAIN_SEPARATOR,\\n\\n reference,\\n\\n MAIN_SEPARATOR,\\n\\n mailbox_name.replace(\\\"INBOX\\\", \\\"\\\")\\n\\n )[..],\\n\\n );\\n\\n match re_opt {\\n\",\n \"file_path\": \"core/src/server/imap.rs\",\n \"rank\": 61,\n \"score\": 11.935121872677625\n },\n {\n \"content\": \"use std::collections::HashMap;\\n\\nuse std::fs::File;\\n\\nuse std::io::Read;\\n\\nuse std::path::Path;\\n\\nuse std::str;\\n\\n\\n\\npub use self::command::BodySectionType;\\n\\nuse self::command::BodySectionType::{AllSection, MsgtextSection, PartSection};\\n\\n\\n\\npub use self::command::Msgtext;\\n\\nuse self::command::Msgtext::{\\n\\n HeaderFieldsMsgtext, HeaderFieldsNotMsgtext, HeaderMsgtext, MimeMsgtext, TextMsgtext,\\n\\n};\\n\\n\\n\\npub use self::error::Error;\\n\\nuse self::error::Result as MimeResult;\\n\\n\\n\\nmod command;\\n\\nmod error;\\n\\n\\n\",\n \"file_path\": \"mime/src/lib.rs\",\n \"rank\": 62,\n \"score\": 11.845019632620046\n },\n {\n \"content\": \" pub email: Email,\\n\\n /// The authentication data the used to verify the user's identity.\\n\\n pub auth_data: AuthData,\\n\\n /// The root directory in which the user's mail is stored.\\n\\n pub maildir: String,\\n\\n}\\n\\n\\n\\nimpl User {\\n\\n /// Creates a new user from a provided email, plaintext password, and root\\n\\n /// mail directory.\\n\\n pub fn new(email: Email, password: String, maildir: String) -> User {\\n\\n User {\\n\\n email: email,\\n\\n auth_data: AuthData::new(password),\\n\\n maildir: maildir,\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\n/// Reads a JSON file and turns it into a `HashMap` of emails to users.\\n\\n/// May throw an `std::io::Error`, hence the `Result<>` type.\\n\",\n \"file_path\": \"core/src/server/user/mod.rs\",\n \"rank\": 63,\n \"score\": 11.790881924155237\n },\n {\n \"content\": \" }\\n\\n };\\n\\n let mut from_parts = from_path_split.split('@');\\n\\n let local_part = match from_parts.next() {\\n\\n Some(part) => part.to_string(),\\n\\n _ => {\\n\\n return None;\\n\\n }\\n\\n };\\n\\n let domain_part = match from_parts.next() {\\n\\n Some(part) => part.to_string(),\\n\\n _ => {\\n\\n return None;\\n\\n }\\n\\n };\\n\\n Some(Email::new(local_part, domain_part))\\n\\n}\\n\\n\\n\",\n \"file_path\": \"core/src/server/lmtp.rs\",\n \"rank\": 64,\n \"score\": 11.756314561971612\n },\n {\n \"content\": \" pub lmtp_ssl_port: Option<u16>,\\n\\n // SSL port on which to listen for IMAP\\n\\n pub imap_ssl_port: Option<u16>,\\n\\n // file in which user data is stored\\n\\n pub users: String,\\n\\n // Filename of PKCS #12 archive\\n\\n pub pkcs_file: String,\\n\\n // Password for PKCS #12 archive\\n\\n pub pkcs_pass: String,\\n\\n}\\n\\n\\n\\nimpl Config {\\n\\n pub fn new() -> ImapResult<Config> {\\n\\n let config_dir = match env::var(\\\"SEGIMAP_CONFIG_DIR\\\") {\\n\\n Ok(val) => val,\\n\\n Err(_e) => \\\".\\\".to_string(),\\n\\n };\\n\\n\\n\\n let config_file = format!(\\\"{}/config.toml\\\", config_dir);\\n\\n let path = Path::new(&config_file);\\n\",\n \"file_path\": \"core/src/server/config.rs\",\n \"rank\": 66,\n \"score\": 11.544548035186063\n },\n {\n \"content\": \" }\\n\\n }\\n\\n\\n\\n pub fn remove_if_deleted(&self) -> bool {\\n\\n if self.deleted {\\n\\n // Get the compiler to STFU with empty match block\\n\\n match fs::remove_file(self.path.as_path()) {\\n\\n _ => {}\\n\\n }\\n\\n }\\n\\n self.deleted\\n\\n }\\n\\n\\n\\n pub fn get_path(&self) -> &Path {\\n\\n self.path.as_path()\\n\\n }\\n\\n\\n\\n pub fn get_uid(&self) -> usize {\\n\\n self.uid\\n\\n }\\n\",\n \"file_path\": \"core/src/message.rs\",\n \"rank\": 67,\n \"score\": 11.520464843241614\n },\n {\n \"content\": \" Err(_) => bad_res,\\n\\n Ok(re) => {\\n\\n let list_responses = util::list(&maildir[..], &re);\\n\\n let mut ok_res = String::new();\\n\\n for list_response in &list_responses {\\n\\n ok_res.push_str(&list_response[..]);\\n\\n ok_res.push_str(\\\"\\\\r\\\\n\\\");\\n\\n }\\n\\n ok_res.push_str(tag);\\n\\n ok_res.push_str(\\\" OK list successful\\\\r\\\\n\\\");\\n\\n ok_res\\n\\n }\\n\\n }\\n\\n }\\n\\n }\\n\\n }\\n\\n // Resolve state of folder in memory with state of mail on\\n\\n // disk\\n\\n \\\"check\\\" => {\\n\\n match self.expunge() {\\n\",\n \"file_path\": \"core/src/server/imap.rs\",\n \"rank\": 68,\n \"score\": 11.496905734815986\n },\n {\n \"content\": \"impl Folder {\\n\\n pub fn new(path: PathBuf, examine: bool) -> Option<Folder> {\\n\\n // the EXAMINE command is always read-only or we test SELECT for read-only status\\n\\n // We use a lock file to determine write access on a folder\\n\\n let readonly = if examine || fs::File::open(&path.join(\\\".lock\\\")).is_ok() {\\n\\n true\\n\\n } else {\\n\\n if let Ok(mut file) = fs::File::create(&path.join(\\\".lock\\\")) {\\n\\n // Get the compiler to STFU with this match\\n\\n let _ = file.write(b\\\"selected\\\");\\n\\n false\\n\\n } else {\\n\\n true\\n\\n }\\n\\n };\\n\\n\\n\\n if let Ok(cur) = fs::read_dir(&(path.join(\\\"cur\\\"))) {\\n\\n if let Ok(new) = fs::read_dir(&(path.join(\\\"new\\\"))) {\\n\\n let mut messages = Vec::new();\\n\\n let mut uid_to_seqnum: HashMap<usize, usize> = HashMap::new();\\n\",\n \"file_path\": \"core/src/folder.rs\",\n \"rank\": 69,\n \"score\": 11.259588345890243\n },\n {\n \"content\": \" messages: messages,\\n\\n readonly: readonly,\\n\\n uid_to_seqnum: uid_to_seqnum,\\n\\n });\\n\\n }\\n\\n }\\n\\n None\\n\\n }\\n\\n\\n\\n /// Generate the SELECT/EXAMINE response based on data in the folder\\n\\n pub fn select_response(&self, tag: &str) -> String {\\n\\n let unseen_res = if self.unseen <= self.exists {\\n\\n let unseen_str = self.unseen.to_string();\\n\\n let mut res = \\\"* OK [UNSEEN \\\".to_string();\\n\\n res.push_str(&unseen_str[..]);\\n\\n res.push_str(\\\"] Message \\\");\\n\\n res.push_str(&unseen_str[..]);\\n\\n res.push_str(\\\"th is the first unseen\\\\r\\\\n\\\");\\n\\n res\\n\\n } else {\\n\",\n \"file_path\": \"core/src/folder.rs\",\n \"rank\": 70,\n \"score\": 11.229329420181921\n },\n {\n \"content\": \"use std::fmt;\\n\\n\\n\\n/// Representation of an email\\n\\n/// This helps ensure the email at least has an '@' in it...\\n\\n#[derive(Clone, Debug, Deserialize, Eq, Hash, PartialEq, Serialize)]\\n\\npub struct Email {\\n\\n pub local_part: String,\\n\\n pub domain_part: String,\\n\\n}\\n\\n\\n\\nimpl fmt::Display for Email {\\n\\n fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {\\n\\n write!(f, \\\"{}\\\", self.to_string())\\n\\n }\\n\\n}\\n\\n\\n\\nimpl Email {\\n\\n pub fn new(local_part: String, domain_part: String) -> Email {\\n\\n Email {\\n\\n local_part: local_part,\\n\",\n \"file_path\": \"core/src/server/user/email.rs\",\n \"rank\": 71,\n \"score\": 11.20183562969351\n },\n {\n \"content\": \" /// single character per flag representation of the current set of flags.\\n\\n pub fn get_new_filename(&self) -> String {\\n\\n let mut res = self.uid.to_string();\\n\\n\\n\\n // it is just the UID if no flags are set.\\n\\n if self.flags.is_empty() {\\n\\n return res;\\n\\n }\\n\\n\\n\\n // Add the prelud which separates the flags\\n\\n res.push_str(\\\":2,\\\");\\n\\n\\n\\n // As per the Maildir standard, the flags are to be written in\\n\\n // alphabetical order\\n\\n if self.flags.contains(&Flag::Draft) {\\n\\n res.push('D');\\n\\n }\\n\\n if self.flags.contains(&Flag::Flagged) {\\n\\n res.push('F');\\n\\n }\\n\",\n \"file_path\": \"core/src/message.rs\",\n \"rank\": 73,\n \"score\": 10.917510122787943\n },\n {\n \"content\": \"SEGIMAP\\n\\n=======\\n\\n\\n\\nThis is a continuation of the upstream SEGIMAP server. Unfortunately it seems upstream might be abandoned, so this repo is trying to modernize it enough to run in a Docker container.\\n\\n\\n\\n[](https://github.com/kruton/segimap/actions/workflows/docker.yml)\\n\\n\\n\\nOriginal description\\n\\n--------------------\\n\\nThis is an IMAP server implementation written in Rust. It originally started out as a class project in Fall 2014.\\n\\nThere is also an LMTP server attached so that SMTP servers may deliver mail without modifying the maildir themselves.\\n\\n\\n\\nSome notes about Rust\\n\\n---------------------\\n\\n\\n\\nThe most confusing thing for those reading the code who are unfamiliar with rust will likely be &str and String. &str is an actual string while String is actually a StringBuffer. `&x[..]` is used to get a &str out of a String called `x` and `y.to_string()` is used to get a String out of a &str called `y`. Sometimes we need something which is neither of these to be a string so we use `.to_str()` or `.to_string()` as appropriate. Sometimes we need a String but the thing we have can only be converted to &str so we have to chain the calls like so: `.to_str().to_string()`. It sometimes also occurs the other way around in which case we wind up with something like `&z.to_string()[..]`.\\n\\n\\n\\n& denotes a pointer (ie: pass-by-reference semantics). When you see &mut it means that the pointer is mutable. Rust only allows one mutable pointer at a time and enforces this at compile time. However, multiple immutable pointers may be created. * is used to dereference a pointer. In most cases, method calls will automatically dereference when needed.\\n\\n\\n\\nThe statement `return thing;` is equivalent to `thing` (note the absence of a semi-colon).\\n\\n\\n\\nThat should be everything someone who doesn't know rust needs to understand this code and why we do things certain ways.\\n\\n\\n\",\n \"file_path\": \"README.md\",\n \"rank\": 74,\n \"score\": 10.900299599168147\n },\n {\n \"content\": \"use nom::crlf;\\n\\nuse std::str;\\n\\n\\n\\npub use self::fetch::fetch;\\n\\n\\n\\nmod fetch;\\n\\nmod sequence;\\n\\n\\n\\nconst DIGITS: &'static str = \\\"0123456789\\\";\\n\\nconst NZ_DIGITS: &'static str = \\\"123456789\\\";\\n\\n\\n\",\n \"file_path\": \"core/src/parser/grammar/mod.rs\",\n \"rank\": 75,\n \"score\": 10.79886151956141\n },\n {\n \"content\": \" return;\\n\\n }\\n\\n }\\n\\n\\n\\n // If there is an error on the stream, exit.\\n\\n Err(_) => {\\n\\n return;\\n\\n }\\n\\n }\\n\\n }\\n\\n }\\n\\n\\n\\n /// Interprets a client command and generates a String response\\n\\n fn interpret(\\n\\n &mut self,\\n\\n cmd: &str,\\n\\n args: &mut Split<char>,\\n\\n tag: &str,\\n\\n bad_res: String,\\n\\n ) -> String {\\n\",\n \"file_path\": \"core/src/server/imap.rs\",\n \"rank\": 76,\n \"score\": 10.790367482061743\n },\n {\n \"content\": \"use super::email::Email;\\n\\n\\n\\n/// Representation of an email and password login attempt.\\n\\npub struct LoginData {\\n\\n pub email: Email,\\n\\n pub password: String,\\n\\n}\\n\\n\\n\\nimpl LoginData {\\n\\n pub fn new(email: String, password: String) -> Option<LoginData> {\\n\\n let mut parts = (&email[..]).split('@');\\n\\n if let Some(local_part) = parts.next() {\\n\\n if let Some(domain_part) = parts.next() {\\n\\n let login_data = LoginData {\\n\\n email: Email {\\n\\n local_part: local_part.to_string(),\\n\\n domain_part: domain_part.to_string(),\\n\\n },\\n\\n password: password,\\n\\n };\\n\\n return Some(login_data);\\n\\n }\\n\\n }\\n\\n\\n\\n None\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"core/src/server/user/login.rs\",\n \"rank\": 77,\n \"score\": 10.786754806448997\n },\n {\n \"content\": \" _ => {}\\n\\n }\\n\\n match self.folder {\\n\\n None => bad_res,\\n\\n Some(ref mut folder) => {\\n\\n folder.check();\\n\\n let mut ok_res = tag.to_string();\\n\\n ok_res.push_str(\\\" OK Check completed\\\\r\\\\n\\\");\\n\\n ok_res\\n\\n }\\n\\n }\\n\\n }\\n\\n // Close the currently selected folder. Perform all\\n\\n // required cleanup.\\n\\n \\\"close\\\" => match self.expunge() {\\n\\n Err(_) => bad_res,\\n\\n Ok(_) => {\\n\\n if let Some(ref mut folder) = self.folder {\\n\\n folder.check();\\n\\n }\\n\",\n \"file_path\": \"core/src/server/imap.rs\",\n \"rank\": 78,\n \"score\": 10.724549191024547\n },\n {\n \"content\": \" // The argument after the tag specified the command issued.\\n\\n // Additional arguments are arguments for that specific command.\\n\\n match cmd {\\n\\n \\\"noop\\\" => {\\n\\n let mut res = tag.to_string();\\n\\n res += \\\" OK NOOP\\\\r\\\\n\\\";\\n\\n res\\n\\n }\\n\\n\\n\\n // Inform the client of the supported IMAP version and\\n\\n // extension(s)\\n\\n \\\"capability\\\" => {\\n\\n let mut res = \\\"* CAPABILITY IMAP4rev1 CHILDREN\\\\r\\\\n\\\".to_string();\\n\\n res.push_str(tag);\\n\\n res.push_str(\\\" OK Capability successful\\\\r\\\\n\\\");\\n\\n res\\n\\n }\\n\\n \\\"login\\\" => {\\n\\n let login_args: Vec<&str> = args.collect();\\n\\n if login_args.len() < 2 {\\n\",\n \"file_path\": \"core/src/server/imap.rs\",\n \"rank\": 79,\n \"score\": 10.68003849757391\n },\n {\n \"content\": \" self.folder = None;\\n\\n format!(\\\"{} OK close completed\\\\r\\\\n\\\", tag)\\n\\n }\\n\\n },\\n\\n // Delete the messages currently marked for deletion.\\n\\n \\\"expunge\\\" => match self.expunge() {\\n\\n Err(_) => bad_res,\\n\\n Ok(v) => {\\n\\n let mut ok_res = String::new();\\n\\n for i in &v {\\n\\n ok_res.push_str(\\\"* \\\");\\n\\n ok_res.push_str(&i.to_string()[..]);\\n\\n ok_res.push_str(\\\" EXPUNGE\\\\r\\\\n\\\");\\n\\n }\\n\\n ok_res.push_str(tag);\\n\\n ok_res.push_str(\\\" OK expunge completed\\\\r\\\\n\\\");\\n\\n ok_res\\n\\n }\\n\\n },\\n\\n \\\"fetch\\\" => {\\n\",\n \"file_path\": \"core/src/server/imap.rs\",\n \"rank\": 80,\n \"score\": 10.54853401654476\n },\n {\n \"content\": \"use crate::error::ImapResult;\\n\\nuse openssl::error::ErrorStack;\\n\\nuse openssl::pkcs12::Pkcs12;\\n\\nuse openssl::ssl::{SslAcceptor, SslMethod};\\n\\nuse openssl::x509::X509;\\n\\nuse std::env;\\n\\nuse std::fs::File;\\n\\nuse std::io::{Error as IoError, Read, Write};\\n\\nuse std::path::Path;\\n\\nuse std::str;\\n\\nuse toml;\\n\\n\\n\\npub enum PkcsError {\\n\\n Io(IoError),\\n\\n Ssl(ErrorStack),\\n\\n PortsDisabled,\\n\\n}\\n\\n\\n\\nimpl From<IoError> for PkcsError {\\n\\n fn from(e: IoError) -> Self {\\n\",\n \"file_path\": \"core/src/server/config.rs\",\n \"rank\": 81,\n \"score\": 10.503736023253923\n },\n {\n \"content\": \" _ => { },\\n\\n }\\n\\n },\\n\\n */\\n\\n UID => {\\n\\n res.push_str(\\\"UID \\\");\\n\\n res.push_str(&self.uid.to_string()[..])\\n\\n }\\n\\n }\\n\\n }\\n\\n res\\n\\n }\\n\\n\\n\\n // Creates a string of the current set of flags based on what is in\\n\\n // self.flags.\\n\\n fn print_flags(&self) -> String {\\n\\n let mut res = \\\"(\\\".to_string();\\n\\n let mut first = true;\\n\\n for flag in &self.flags {\\n\\n // The flags should be space separated.\\n\",\n \"file_path\": \"core/src/message.rs\",\n \"rank\": 82,\n \"score\": 10.445533997237021\n },\n {\n \"content\": \" },\\n\\n },\\n\\n \\\"data\\\" => {\\n\\n return_on_err!(stream.write(data_res));\\n\\n return_on_err!(stream.flush());\\n\\n let mut loop_res = invalid;\\n\\n loop {\\n\\n let mut data_command = String::new();\\n\\n match stream.read_line(&mut data_command) {\\n\\n Ok(_) => {\\n\\n if data_command.is_empty() {\\n\\n break;\\n\\n }\\n\\n let data_cmd = (&data_command[..]).trim();\\n\\n if data_cmd == \\\".\\\" {\\n\\n loop_res = l.deliver();\\n\\n l.data = String::new();\\n\\n break;\\n\\n }\\n\\n l.data.push_str(data_cmd);\\n\",\n \"file_path\": \"core/src/server/lmtp.rs\",\n \"rank\": 83,\n \"score\": 10.251935949740748\n },\n {\n \"content\": \"use chrono::{Datelike, NaiveDateTime, Timelike};\\n\\nuse std::collections::HashSet;\\n\\nuse std::fs;\\n\\nuse std::path::Path;\\n\\nuse std::path::PathBuf;\\n\\nuse std::str;\\n\\n\\n\\nuse crate::command::store::StoreName;\\n\\nuse crate::command::Attribute;\\n\\nuse crate::command::Attribute::{\\n\\n Body, BodyPeek, BodySection, BodyStructure, Envelope, Flags, InternalDate, RFC822, UID,\\n\\n};\\n\\nuse crate::command::RFC822Attribute::{AllRFC822, HeaderRFC822, SizeRFC822, TextRFC822};\\n\\n\\n\\nuse crate::error::{Error, ImapResult};\\n\\n\\n\\nuse mime::Message as MIME_Message;\\n\\n\\n\\n/// Representation of a message flag\\n\\n#[derive(Eq, PartialEq, Hash, Debug, Clone)]\\n\\npub enum Flag {\\n\\n Answered,\\n\\n Draft,\\n\\n Flagged,\\n\\n Seen,\\n\\n Deleted,\\n\\n}\\n\\n\\n\\n/// Takes a flag argument and returns the corresponding enum.\\n\",\n \"file_path\": \"core/src/message.rs\",\n \"rank\": 84,\n \"score\": 10.144893395645937\n },\n {\n \"content\": \" let maildir_path = Path::new(&maildir[..]).join(mbox_name);\\n\\n let newmaildir_path = maildir_path.join(\\\"new\\\");\\n\\n let curmaildir_path = maildir_path.join(\\\"cur\\\");\\n\\n opendirlisting!(\\n\\n &newmaildir_path,\\n\\n newlist,\\n\\n no_res,\\n\\n opendirlisting!(&curmaildir_path, curlist, no_res, {\\n\\n // Delete the mail in the folder\\n\\n for file_entry in newlist {\\n\\n match file_entry {\\n\\n Ok(file) => {\\n\\n if fs::remove_file(file.path()).is_err() {\\n\\n return no_res;\\n\\n }\\n\\n }\\n\\n Err(_) => return no_res,\\n\\n }\\n\\n }\\n\\n for file_entry in curlist {\\n\",\n \"file_path\": \"core/src/server/imap.rs\",\n \"rank\": 85,\n \"score\": 10.123604945875744\n },\n {\n \"content\": \" let start = match folder.get_index_from_uid(&n) {\\n\\n Some(start) => *start,\\n\\n None => {\\n\\n if n == 1 {\\n\\n 0usize\\n\\n } else {\\n\\n return bad_res;\\n\\n }\\n\\n }\\n\\n };\\n\\n let mut res = String::new();\\n\\n for index in start..folder.message_count() {\\n\\n res.push_str(&folder.fetch(index+1, &parsed_cmd.attributes)[..]);\\n\\n }\\n\\n res.push_str(tag);\\n\\n res.push_str(\\\" OK UID FETCH completed\\\\r\\\\n\\\");\\n\\n return res;\\n\\n }\\n\\n }\\n\\n };\\n\",\n \"file_path\": \"core/src/server/imap.rs\",\n \"rank\": 86,\n \"score\": 10.050227104959653\n },\n {\n \"content\": \" match &c.to_ascii_lowercase()[..] {\\n\\n // STARTTLS is handled here because it modifies the stream\\n\\n \\\"starttls\\\" => match stream.get_ref() {\\n\\n &Stream::Tcp(_) => {\\n\\n if self.serv.can_starttls() {\\n\\n starttls = true;\\n\\n let mut ok_res = tag.to_string();\\n\\n ok_res.push_str(\\n\\n \\\" OK Begin TLS negotiation now\\\\r\\\\n\\\",\\n\\n );\\n\\n ok_res\\n\\n } else {\\n\\n bad_res\\n\\n }\\n\\n }\\n\\n _ => bad_res,\\n\\n },\\n\\n cmd => self.interpret(cmd, &mut args, tag, bad_res),\\n\\n }\\n\\n }\\n\",\n \"file_path\": \"core/src/server/imap.rs\",\n \"rank\": 87,\n \"score\": 10.024202457512857\n },\n {\n \"content\": \" None => {\\n\\n return bad_res;\\n\\n }\\n\\n Some(ref maildir) => maildir,\\n\\n };\\n\\n let (folder, res) =\\n\\n util::perform_select(&maildir[..], &args.collect::<Vec<&str>>(), false, tag);\\n\\n self.folder = folder;\\n\\n match self.folder {\\n\\n None => bad_res,\\n\\n _ => res,\\n\\n }\\n\\n }\\n\\n \\\"examine\\\" => {\\n\\n let maildir = match self.maildir {\\n\\n None => {\\n\\n return bad_res;\\n\\n }\\n\\n Some(ref maildir) => maildir,\\n\\n };\\n\",\n \"file_path\": \"core/src/server/imap.rs\",\n \"rank\": 88,\n \"score\": 9.99704001070352\n },\n {\n \"content\": \" }\\n\\n }\\n\\n);\\n\\n\\n\\nmacro_rules! delivery_ioerror(\\n\\n ($res:ident) => ({\\n\\n $res.push_str(\\\"451 Error in processing.\\\\r\\\\n\\\");\\n\\n break;\\n\\n })\\n\\n);\\n\\n\\n\\nmacro_rules! grab_email_token(\\n\\n ($arg:expr) => {\\n\\n match $arg {\\n\\n Some(from_path) => from_path.trim_start_matches('<').trim_end_matches('>'),\\n\\n _ => { return None; }\\n\\n }\\n\\n }\\n\\n);\\n\\n\\n\",\n \"file_path\": \"core/src/server/lmtp.rs\",\n \"rank\": 89,\n \"score\": 9.637673870499036\n },\n {\n \"content\": \"use std::collections::{HashMap, HashSet};\\n\\nuse std::fs;\\n\\nuse std::io::Write;\\n\\nuse std::path::Path;\\n\\nuse std::path::PathBuf;\\n\\n\\n\\nuse crate::command::Attribute;\\n\\nuse crate::message::Flag;\\n\\nuse crate::message::Message;\\n\\n\\n\\nuse crate::command::store::StoreName;\\n\\n\\n\\n/// Representation of a Folder\\n\\n#[derive(Clone, Debug)]\\n\\npub struct Folder {\\n\\n // How many messages are in folder/new/\\n\\n recent: usize,\\n\\n // How many messages are in the folder total\\n\\n exists: usize,\\n\\n // How many messages are not marked with the Seen flag\\n\",\n \"file_path\": \"core/src/folder.rs\",\n \"rank\": 90,\n \"score\": 9.572147903086625\n },\n {\n \"content\": \" domain_part: domain_part,\\n\\n }\\n\\n }\\n\\n\\n\\n fn to_string(&self) -> String {\\n\\n let mut res = self.local_part.clone();\\n\\n res.push('@');\\n\\n res.push_str(&self.domain_part[..]);\\n\\n res\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"core/src/server/user/email.rs\",\n \"rank\": 91,\n \"score\": 9.308165254230122\n },\n {\n \"content\": \" res.push_str(\\\")\\\\r\\\\n\\\");\\n\\n res\\n\\n }\\n\\n\\n\\n /// Turn a UID into a sequence number\\n\\n pub fn get_index_from_uid(&self, uid: &usize) -> Option<&usize> {\\n\\n self.uid_to_seqnum.get(uid)\\n\\n }\\n\\n\\n\\n /// Perform a STORE on the specified set of sequence numbers\\n\\n /// This modifies the flags of the specified messages\\n\\n /// Returns the String response to be sent back to the client.\\n\\n pub fn store(\\n\\n &mut self,\\n\\n sequence_set: Vec<usize>,\\n\\n flag_name: &StoreName,\\n\\n silent: bool,\\n\\n flags: HashSet<Flag>,\\n\\n seq_uid: bool,\\n\\n tag: &str,\\n\",\n \"file_path\": \"core/src/folder.rs\",\n \"rank\": 92,\n \"score\": 9.272117608844594\n },\n {\n \"content\": \" (&self.raw_contents[..]).len(),\\n\\n self.raw_contents\\n\\n )\\n\\n }\\n\\n MsgtextSection(ref msgtext) => match *msgtext {\\n\\n HeaderMsgtext | HeaderFieldsNotMsgtext(_) | TextMsgtext | MimeMsgtext => {\\n\\n empty_string\\n\\n }\\n\\n HeaderFieldsMsgtext(ref fields) => {\\n\\n let mut field_keys = String::new();\\n\\n let mut field_values = String::new();\\n\\n let mut first = true;\\n\\n for field in fields.iter() {\\n\\n match self.headers.get(field) {\\n\\n Some(v) => {\\n\\n let field_slice = &field[..];\\n\\n if first {\\n\\n first = false;\\n\\n } else {\\n\\n field_keys.push(' ');\\n\",\n \"file_path\": \"mime/src/lib.rs\",\n \"rank\": 93,\n \"score\": 9.206912028322192\n },\n {\n \"content\": \" .to_string();\\n\\n\\n\\n // Add a space between the merged lines.\\n\\n trimmed_next.push(' ');\\n\\n trimmed_next.push_str(line.trim_start_matches(' ').trim_start_matches('\\\\t'));\\n\\n if !next.starts_with(' ') && !next.starts_with('\\\\t') {\\n\\n let split: Vec<&str> = (&trimmed_next[..]).splitn(2, ':').collect();\\n\\n headers.insert(split[0].to_ascii_uppercase(), split[1][1..].to_string());\\n\\n break;\\n\\n }\\n\\n }\\n\\n } else {\\n\\n let split: Vec<&str> = line.splitn(2, ':').collect();\\n\\n headers.insert(split[0].to_ascii_uppercase(), split[1][1..].to_string());\\n\\n }\\n\\n }\\n\\n\\n\\n // Remove the \\\"Received\\\" key from the HashMap.\\n\\n let received_key = &RECEIVED.to_string();\\n\\n if headers.get(received_key).is_some() {\\n\",\n \"file_path\": \"mime/src/lib.rs\",\n \"rank\": 94,\n \"score\": 9.143419354657816\n },\n {\n \"content\": \"pub enum Stream {\\n\\n Ssl(SslStream<TcpStream>),\\n\\n Tcp(TcpStream),\\n\\n}\\n\\n\\n\\nimpl Write for Stream {\\n\\n fn write(&mut self, buf: &[u8]) -> Result<usize> {\\n\\n match *self {\\n\\n Stream::Ssl(ref mut s) => s.write(buf),\\n\\n Stream::Tcp(ref mut s) => s.write(buf),\\n\\n }\\n\\n }\\n\\n\\n\\n fn flush(&mut self) -> Result<()> {\\n\\n match *self {\\n\\n Stream::Ssl(ref mut s) => s.flush(),\\n\\n Stream::Tcp(ref mut s) => s.flush(),\\n\\n }\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"core/src/server/mod.rs\",\n \"rank\": 95,\n \"score\": 9.131637265736746\n },\n {\n \"content\": \" }\\n\\n }\\n\\n\\n\\n /// Handles client commands as they come in on the stream and writes\\n\\n /// responeses back to the stream.\\n\\n pub fn handle(&mut self, orig_stream: TcpStream) {\\n\\n let mut stream = BufStream::new(self.serv.imap_ssl(orig_stream));\\n\\n // Provide the client with an IMAP greeting.\\n\\n return_on_err!(stream.write(GREET));\\n\\n return_on_err!(stream.flush());\\n\\n\\n\\n let mut command = String::new();\\n\\n loop {\\n\\n command.truncate(0);\\n\\n match stream.read_line(&mut command) {\\n\\n Ok(_) => {\\n\\n // If the command is empty, exit.\\n\\n // Exitting will close the stream for us.\\n\\n if command.is_empty() {\\n\\n return;\\n\",\n \"file_path\": \"core/src/server/imap.rs\",\n \"rank\": 96,\n \"score\": 8.999105109555664\n },\n {\n \"content\": \"use bufstream::BufStream;\\n\\nuse regex::Regex;\\n\\nuse std::fs;\\n\\nuse std::io::{BufRead, Write};\\n\\nuse std::net::TcpStream;\\n\\nuse std::os::unix::fs::PermissionsExt;\\n\\nuse std::path::Path;\\n\\nuse std::path::MAIN_SEPARATOR;\\n\\nuse std::str::Split;\\n\\nuse std::sync::Arc;\\n\\n\\n\\nuse crate::folder::Folder;\\n\\nuse crate::server::Server;\\n\\nuse crate::server::Stream;\\n\\n\\n\\nuse crate::command::fetch;\\n\\nuse crate::command::sequence_set;\\n\\nuse crate::command::sequence_set::SequenceItem::{Number, Range, Wildcard};\\n\\nuse crate::command::store;\\n\\nuse crate::command::Attribute::UID;\\n\",\n \"file_path\": \"core/src/server/imap.rs\",\n \"rank\": 97,\n \"score\": 8.977644924311676\n },\n {\n \"content\": \" if let Some(message) = self.messages.get_mut(i - 1) {\\n\\n responses.push_str(\\\"* \\\");\\n\\n responses.push_str(&i.to_string()[..]);\\n\\n responses.push_str(\\\" FETCH (FLAGS \\\");\\n\\n responses.push_str(&message.store(flag_name, flags.clone())[..]);\\n\\n\\n\\n // UID STORE needs to respond with the UID for each FETCH response\\n\\n if seq_uid {\\n\\n let uid_res = format!(\\\" UID {}\\\", uid);\\n\\n responses.push_str(&uid_res[..]);\\n\\n }\\n\\n responses.push_str(\\\" )\\\\r\\\\n\\\");\\n\\n }\\n\\n }\\n\\n\\n\\n // Return an empty string if the client wanted the STORE to be SILENT\\n\\n if silent {\\n\\n responses = String::new();\\n\\n }\\n\\n responses.push_str(tag);\\n\",\n \"file_path\": \"core/src/folder.rs\",\n \"rank\": 98,\n \"score\": 8.934740082385032\n },\n {\n \"content\": \" use super::fetch;\\n\\n use command::sequence_set::SequenceItem::{Number, Range, Wildcard};\\n\\n use command::Attribute::{BodyPeek, Flags, RFC822};\\n\\n use command::FetchCommand;\\n\\n use command::RFC822Attribute::AllRFC822;\\n\\n use mime::BodySectionType::PartSection;\\n\\n use mime::Msgtext::HeaderFieldsNotMsgtext;\\n\\n use nom::IResult::Done;\\n\\n\\n\\n #[bench]\\n\\n fn bench_fetch(b: &mut Bencher) {\\n\\n const FETCH_STR: &'static str =\\n\\n \\\"FETCH 4,5:3,* (FLAGS RFC822 BODY.PEEK[43.65.HEADER.FIELDS.NOT (a \\\\\\\"abc\\\\\\\")]<4.2>)\\\";\\n\\n\\n\\n b.iter(|| {\\n\\n assert_eq!(\\n\\n fetch(FETCH_STR.as_bytes()),\\n\\n Done(\\n\\n &b\\\"\\\"[..],\\n\\n FetchCommand::new(\\n\",\n \"file_path\": \"core/src/parser/grammar/fetch.rs\",\n \"rank\": 99,\n \"score\": 8.76112179392614\n }\n]","isConversational":false}}},{"rowIdx":2354,"cells":{"lang":{"kind":"string","value":"Rust"},"file_path":{"kind":"string","value":"dbcrossbarlib/src/config.rs"},"repo_name":{"kind":"string","value":"drusellers/dbcrossbar"},"commit":{"kind":"string","value":"c16ed98771a7d18dbef861f88cc8403839c96936"},"file_code":{"kind":"string","value":"\n\nuse failure::Fail;\nuse std::{\n env, fmt,\n fs::{create_dir_all, File},\n io::{self, Read},\n path::{Path, PathBuf},\n};\nuse toml_edit::{Array, Document, Item, Value};\n\nuse crate::common::*;\n\n#[cfg(not(target_os = \"macos\"))]\nfn system_config_dir() -> Option<PathBuf> {\n dirs::config_dir()\n}\n\n#[cfg(target_os = \"macos\")]\nfn system_config_dir() -> Option<PathBuf> {\n if let Some(preference_dir) = dirs::preference_dir() {\n let old_config_dir = preference_dir.join(\"dbcrossbar\");\n if old_config_dir.is_dir() {\n \n use std::sync::Once;\n static ONCE: Once = Once::new();\n ONCE.call_once(|| {\n \n if let Some(system_config_dir) = dirs::config_dir() {\n let new_config_dir = system_config_dir.join(\"dbcrossbar\");\n eprintln!(\n \"DEPRECATION WARNING: Please move `{}` to `{}`\",\n old_config_dir.display(),\n new_config_dir.display(),\n );\n }\n });\n\n return Some(preference_dir);\n }\n }\n dirs::config_dir()\n}\n\npub(crate) fn config_dir() -> Result<PathBuf> {\n \n \n match env::var_os(\"DBCROSSBAR_CONFIG_DIR\") {\n \n Some(dir) => Ok(PathBuf::from(dir)),\n \n None => Ok(system_config_dir()\n \n \n .ok_or_else(|| format_err!(\"could not find user config dir\"))?\n .join(\"dbcrossbar\")),\n }\n}\n\npub(crate) fn config_file() -> Result<PathBuf> {\n Ok(config_dir()?.join(\"dbcrossbar.toml\"))\n}\n\n#[derive(Debug)]\npub struct Key<'a> {\n \n key: &'a str,\n}\n\nimpl Key<'_> {\n \n pub fn temporary() -> Key<'static> {\n Self::global(\"temporary\")\n }\n\n \n pub(crate) fn global(key: &str) -> Key<'_> {\n Key { key }\n }\n}\n\nimpl<'a> fmt::Display for Key<'a> {\n fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {\n self.key.fmt(f)\n }\n}\n\n#[derive(Debug)]\npub struct Configuration {\n \n path: PathBuf,\n \n doc: Document,\n}\n\nimpl Configuration {\n \n pub fn try_default() -> Result<Self> {\n Self::from_path(&config_file()?)\n }\n\n \n pub(crate) fn from_path(path: &Path) -> Result<Self> {\n match File::open(&path) {\n Ok(rdr) => {\n Ok(Self::from_reader(path.to_owned(), rdr).with_context(|_| {\n format!(\"could not read file {}\", path.display())\n })?)\n }\n Err(err) if err.kind() == io::ErrorKind::NotFound => Ok(Self {\n path: path.to_owned(),\n doc: Document::default(),\n }),\n Err(err) => Err(err\n .context(format!(\"could not open file {}\", path.display()))\n .into()),\n }\n }\n\n \n fn from_reader<R>(path: PathBuf, mut rdr: R) -> Result<Self>\n where\n R: Read + 'static,\n {\n let mut buf = String::new();\n rdr.read_to_string(&mut buf)?;\n let doc = buf.parse::<Document>()?;\n Ok(Self { path, doc })\n }\n\n \n pub fn write(&self) -> Result<()> {\n let parent = self.path.parent().ok_or_else(|| {\n format_err!(\"cannot find parent directory of {}\", self.path.display())\n })?;\n create_dir_all(&parent)\n .with_context(|_| format!(\"cannot create {}\", parent.display()))?;\n let data = self.doc.to_string_in_original_order();\n let mut f = File::create(&self.path)\n .with_context(|_| format!(\"cannot create {}\", self.path.display()))?;\n f.write_all(data.as_bytes())\n .with_context(|_| format!(\"error writing to {}\", self.path.display()))?;\n f.flush()\n .with_context(|_| format!(\"error writing to {}\", self.path.display()))?;\n Ok(())\n }\n\n \n pub fn temporaries(&self) -> Result<Vec<String>> {\n self.string_array(&Key::global(\"temporary\"))\n }\n\n \n fn string_array(&self, key: &Key<'_>) -> Result<Vec<String>> {\n let mut temps = vec![];\n if let Some(raw_value) = self.doc.as_table().get(key.key) {\n if let Some(raw_array) = raw_value.as_array() {\n for raw_item in raw_array.iter() {\n if let Some(temp) = raw_item.as_str() {\n temps.push(temp.to_owned());\n } else {\n return Err(format_err!(\n \"expected string, found {:?} in {}\",\n raw_item,\n self.path.display(),\n ));\n }\n }\n } else {\n return Err(format_err!(\n \"expected array, found {:?} in {}\",\n raw_value,\n self.path.display(),\n ));\n }\n }\n Ok(temps)\n }\n\n \n fn raw_string_array_mut<'a, 'b>(\n &mut self,\n key: &'a Key<'b>,\n ) -> Result<&mut Array> {\n let array_value = self\n .doc\n .as_table_mut()\n .entry(key.key)\n .or_insert(Item::Value(Value::Array(Array::default())));\n match array_value.as_array_mut() {\n Some(array) => Ok(array),\n None => Err(format_err!(\n \"expected array for {} in {}\",\n key,\n self.path.display(),\n )),\n }\n }\n\n \n pub fn add_to_string_array(&mut self, key: &Key<'_>, value: &str) -> Result<()> {\n let raw_array = self.raw_string_array_mut(key)?;\n for raw_item in raw_array.iter() {\n if raw_item.as_str() == Some(value) {\n \n return Ok(());\n }\n }\n raw_array.push(value).map_err(|_| {\n format_err!(\"cannot append to {} because value types don't match\", key)\n })?;\n raw_array.fmt();\n Ok(())\n }\n\n \n \n pub fn remove_from_string_array(\n &mut self,\n key: &Key<'_>,\n value: &str,\n ) -> Result<()> {\n let raw_array = self.raw_string_array_mut(key)?;\n\n \n let mut indices = vec![];\n for (idx, raw_item) in raw_array.iter().enumerate() {\n if raw_item.as_str() == Some(value) {\n indices.push(idx);\n }\n }\n\n \n for idx in indices.iter().rev().cloned() {\n raw_array.remove(idx);\n }\n raw_array.fmt();\n Ok(())\n }\n}\n\n#[test]\nfn temporaries_can_be_added_and_removed() {\n let temp = tempfile::Builder::new()\n .prefix(\"dbcrossbar\")\n .suffix(\".toml\")\n .tempfile()\n .unwrap();\n let path = temp.path();\n let mut config = Configuration::from_path(&path).unwrap();\n let key = Key::global(\"temporary\");\n assert_eq!(config.temporaries().unwrap(), Vec::<String>::new());\n config.add_to_string_array(&key, \"s3://example/\").unwrap();\n assert_eq!(config.temporaries().unwrap(), &[\"s3://example/\".to_owned()]);\n config.write().unwrap();\n config = Configuration::from_path(&path).unwrap();\n assert_eq!(config.temporaries().unwrap(), &[\"s3://example/\".to_owned()]);\n config\n .remove_from_string_array(&key, \"s3://example/\")\n .unwrap();\n assert_eq!(config.temporaries().unwrap(), Vec::<String>::new());\n}\n"},"prefix":{"kind":"string","value":"\n\nuse failure::Fail;\nuse std::{\n env, fmt,\n fs::{create_dir_all, File},\n io::{self, Read},\n path::{Path, PathBuf},\n};\nuse toml_edit::{Array, Document, Item, Value};\n\nuse crate::common::*;\n\n#[cfg(not(target_os = \"macos\"))]\nfn system_config_dir() -> Option<PathBuf> {\n dirs::config_dir()\n}\n\n#[cfg(target_os = \"macos\")]\nfn system_config_dir() -> Option<PathBuf> {\n if let Some(preference_dir) = dirs::preference_dir() {\n let old_config_dir = preference_dir.join(\"dbcrossbar\");\n if old_config_dir.is_dir() {\n \n use std::sync::Once;\n static ONCE: Once = Once::new();\n ONCE.call_once(|| {\n \n if let Some(system_config_dir) = dirs::config_dir() {\n let new_config_dir = system_config_dir.join(\"dbcrossbar\");\n eprintln!(\n \"DEPRECATION WARNING: Please move `{}` to `{}`\",\n old_config_dir.display(),\n new_config_dir.display(),\n );\n }\n });\n\n return Some(preference_dir);\n }\n }\n dirs::config_dir()\n}\n\npub(crate) fn config_dir() -> Result<PathBuf> {\n \n \n match env::var_os(\"DBCROSSBAR_CONFIG_DIR\") {\n \n Some(dir) => Ok(PathBuf::from(dir)),\n \n None => Ok(system_config_dir()\n \n \n .ok_or_else(|| format_err!(\"could not find user config dir\"))?\n .join(\"dbcrossbar\")),\n }\n}\n\npub(crate) fn config_file() -> Result<PathBuf> {\n Ok(config_dir()?.join(\"dbcrossbar.toml\"))\n}\n\n#[derive(Debug)]\npub struct Key<'a> {\n \n key: &'a str,\n}\n\nimpl Key<'_> {\n \n pub fn temporary() -> Key<'static> {\n Self::global(\"temporary\")\n }\n\n \n pub(crate) fn global(key: &str) -> Key<'_> {\n Key { key }\n }\n}\n\nimpl<'a> fmt::Display for Key<'a> {\n fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {\n self.key.fmt(f)\n }\n}\n\n#[derive(Debug)]\npub struct Configuration {\n \n path: PathBuf,\n \n doc: Document,\n}\n\nimpl Configuration {\n \n pub fn try_default() -> Result<Self> {\n Self::from_path(&config_file()?)\n }\n\n \n pub(crate) fn from_path(path: &Path) -> Result<Self> {\n match File::open(&path) {\n Ok(rdr) => {\n Ok(Self::from_reader(path.to_owned(), rdr).with_context(|_| {\n format!(\"could not read file {}\", path.display())\n })?)\n }\n Err(err) if err.kind() == io::ErrorKind::NotFound => Ok(Self {\n path: path.to_owned(),\n doc: Document::default(),\n }),\n Err(err) => Err(err\n .context(format!(\"could not open file {}\", path.display()))\n .into()),\n }\n }\n\n \n fn from_reader<R>(path: PathBuf, mut rdr: R) -> Result<Self>\n where\n R: Read + 'static,\n {\n let mut buf = String::new();\n rdr.read_to_string(&mut buf)?;\n let doc = buf.parse::<Document>()?;\n Ok(Self { path, doc })\n }\n\n \n pub fn write(&self) -> Result<()> {\n let parent = self.path.parent().ok_or_else(|| {\n format_err!(\"cannot find parent directory of {}\", self.path.display())\n })?;\n create_dir_all(&parent)\n .with_context(|_| format!(\"cannot create {}\", parent.display()))?;\n let data = self.doc.to_string_in_original_order();\n let mut f = File::create(&self.path)\n .with_context(|_| format!(\"cannot create {}\", self.path.display()))?;\n f.write_all(data.as_bytes())\n .with_context(|_| format!(\"error writing to {}\", self.path.display()))?;\n f.flush()\n .with_context(|_| format!(\"error writing to {}\", self.path.display()))?;\n Ok(())\n }\n\n \n pub fn temporaries(&self) -> Result<Vec<String>> {\n self.string_array(&Key::global(\"temporary\"))\n }\n\n \n fn string_array(&self, key: &Key<'_>) -> Result<Vec<String>> {\n let mut temps = vec![];\n if let Some(raw_value) = self.doc.as_table().get(key.key) {\n if let Some(raw_array) = raw_value.as_array() {\n for raw_item in raw_array.iter() {\n if let Some(temp) = raw_item.as_str() {\n temps.push(temp.to_owned());\n } else {\n return Err(format_err!(\n \"expected string, found {:?} in {}\",\n raw_item,\n self.path.display(),\n ));\n }\n }\n } else {\n return Err(format_err!(\n \"expected array, found {:?} in {}\",\n raw_value,\n self.path.display(),\n ));\n }\n }\n Ok(temps)\n }\n\n \n fn raw_string_array_mut<'a, 'b>(\n &mut self,\n key: &'a Key<'b>,\n ) -> Result<&mut Array> {\n let array_value = self\n .doc\n .as_table_mut()\n .entry(key.key)\n .or_insert(Item::Value(Value::Array(Array::default())));\n match array_value.as_array_mut() {\n Some(array) => Ok(array),\n None => Err(format_err!(\n \"expected array for {} in {}\",\n key,\n self.path.display(),\n )),\n }\n }\n\n \n pub fn add_to_string_array(&mut self, key: &Key<'_>, value: &str) -> Result<()> {\n let raw_array = self.raw_string_array_mut(key)?;\n for raw_item in raw_array.iter() {\n "},"suffix":{"kind":"string","value":"e value types don't match\", key)\n })?;\n raw_array.fmt();\n Ok(())\n }\n\n \n \n pub fn remove_from_string_array(\n &mut self,\n key: &Key<'_>,\n value: &str,\n ) -> Result<()> {\n let raw_array = self.raw_string_array_mut(key)?;\n\n \n let mut indices = vec![];\n for (idx, raw_item) in raw_array.iter().enumerate() {\n if raw_item.as_str() == Some(value) {\n indices.push(idx);\n }\n }\n\n \n for idx in indices.iter().rev().cloned() {\n raw_array.remove(idx);\n }\n raw_array.fmt();\n Ok(())\n }\n}\n\n#[test]\nfn temporaries_can_be_added_and_removed() {\n let temp = tempfile::Builder::new()\n .prefix(\"dbcrossbar\")\n .suffix(\".toml\")\n .tempfile()\n .unwrap();\n let path = temp.path();\n let mut config = Configuration::from_path(&path).unwrap();\n let key = Key::global(\"temporary\");\n assert_eq!(config.temporaries().unwrap(), Vec::<String>::new());\n config.add_to_string_array(&key, \"s3://example/\").unwrap();\n assert_eq!(config.temporaries().unwrap(), &[\"s3://example/\".to_owned()]);\n config.write().unwrap();\n config = Configuration::from_path(&path).unwrap();\n assert_eq!(config.temporaries().unwrap(), &[\"s3://example/\".to_owned()]);\n config\n .remove_from_string_array(&key, \"s3://example/\")\n .unwrap();\n assert_eq!(config.temporaries().unwrap(), Vec::<String>::new());\n}\n"},"middle":{"kind":"string","value":" if raw_item.as_str() == Some(value) {\n \n return Ok(());\n }\n }\n raw_array.push(value).map_err(|_| {\n format_err!(\"cannot append to {} becaus"},"strategy":{"kind":"string","value":"function_block-random_span"},"context_items":{"kind":"list like","value":[{"content":"/// Generate the `COPY ... FROM ...` SQL we'll pass to `copy_in`. `data_format`\n\n/// should be something like `\"CSV HRADER\"` or `\"BINARY\"`.\n\n///\n\n/// We have a separate function for generating this because we'll use it for\n\n/// multiple `COPY` statements.\n\nfn copy_from_sql(table: &PgCreateTable, data_format: &str) -> Result<String> {\n\n let mut copy_sql_buff = vec![];\n\n writeln!(&mut copy_sql_buff, \"COPY {} (\", table.name.quoted())?;\n\n for (idx, col) in table.columns.iter().enumerate() {\n\n if idx + 1 == table.columns.len() {\n\n writeln!(&mut copy_sql_buff, \" {}\", Ident(&col.name))?;\n\n } else {\n\n writeln!(&mut copy_sql_buff, \" {},\", Ident(&col.name))?;\n\n }\n\n }\n\n writeln!(&mut copy_sql_buff, \") FROM STDIN WITH {}\", data_format)?;\n\n let copy_sql = str::from_utf8(©_sql_buff)\n\n .expect(\"generated SQL should always be UTF-8\")\n\n .to_owned();\n\n Ok(copy_sql)\n\n}\n\n\n\n/// Given `stream` containing CSV data, plus a the URL and table_name for a\n\n/// destination, as well as `\"COPY FROM\"` SQL, copy the data into the specified\n\n/// destination.\n","file_path":"dbcrossbarlib/src/drivers/postgres/write_local_data.rs","rank":0,"score":369015.41563082224},{"content":"/// Given a line of `aws s3 ls` output, extract the path.\n\nfn path_from_line(line: &str) -> Result<String> {\n\n lazy_static! {\n\n static ref RE: Regex = Regex::new(r#\"^[-0-9]+ [:0-9]+ +[0-9]+ ([^\\r\\n]+)\"#)\n\n .expect(\"invalid regex in source\");\n\n }\n\n let cap = RE\n\n .captures(line)\n\n .ok_or_else(|| format_err!(\"cannot parse S3 ls output: {:?}\", line))?;\n\n Ok(cap[1].to_owned())\n\n}\n\n\n","file_path":"dbcrossbarlib/src/clouds/aws/s3/ls.rs","rank":2,"score":310524.6688510113},{"content":"#[derive(Deserialize)]\n\n#[serde(transparent)]\n\nstruct RowsJson(HashMap<String, Vec<Value>>);\n\n\n\nimpl RowsJson {\n\n /// If we only have a single key in our `HashMap`, return the corresponding value.\n\n fn into_rows(self) -> Result<Vec<Value>> {\n\n if self.0.len() == 1 {\n\n Ok(self\n\n .0\n\n .into_iter()\n\n .next()\n\n .expect(\"checked for exactly one value, didn't find it\")\n\n .1)\n\n } else {\n\n Err(format_err!(\n\n \"found multiple keys in Shopify response: {}\",\n\n self.0.keys().join(\",\")\n\n ))\n\n }\n\n }\n\n}\n","file_path":"dbcrossbarlib/src/drivers/shopify/local_data.rs","rank":3,"score":285221.9327160282},{"content":"/// Look up an environment variable by name, returning an error if it does not exist.\n\nfn var(name: &str) -> Result<String> {\n\n match try_var(name)? {\n\n Some(value) => Ok(value),\n\n None => Err(format_err!(\n\n \"expected environment variable {} to be set\",\n\n name,\n\n )),\n\n }\n\n}\n\n\n\n/// Load credentials stored in a file.\n","file_path":"dbcrossbarlib/src/credentials.rs","rank":4,"score":279074.77776419785},{"content":"/// Look up an environment variable by name, returning `Ok(None)` if it does not\n\n/// exist.\n\nfn try_var(name: &str) -> Result<Option<String>> {\n\n match env::var(name) {\n\n Ok(value) => Ok(Some(value)),\n\n Err(env::VarError::NotPresent) => Ok(None),\n\n Err(env::VarError::NotUnicode(..)) => Err(format_err!(\n\n \"environment variable {} cannot be converted to UTF-8\",\n\n name,\n\n )),\n\n }\n\n}\n\n\n","file_path":"dbcrossbarlib/src/credentials.rs","rank":5,"score":267530.22396886325},{"content":"/// Make sure a table name is legal for PostgreSQL.\n\n///\n\n/// This will use an valid-looking table name if it can find one somewhere in\n\n/// the string, or it will return a default value.\n\nfn sanitize_table_name(table_name: &str) -> Result<String> {\n\n lazy_static! {\n\n static ref RE: Regex = Regex::new(\n\n r\"(?x)\n\n ([_a-zA-Z][_a-zA-Z0-9]*\\.)?\n\n ([_a-zA-Z][_a-zA-Z0-9]*)\n\n $\"\n\n )\n\n .expect(\"could not compile regex in source\");\n\n }\n\n if let Some(cap) = RE.captures(table_name) {\n\n Ok(cap[0].to_owned())\n\n } else {\n\n // Just use a generic table name.\n\n Ok(\"data\".to_owned())\n\n }\n\n}\n","file_path":"dbcrossbarlib/src/drivers/postgres_sql/mod.rs","rank":6,"score":263174.85666585446},{"content":"/// Parse a JSON value and write it out as a PostgreSQL binary value. This works\n\n/// for any type implementing `FromJsonValue` and `WriteBinary`. More\n\n/// complicated cases will need to do this manually.\n\nfn write_json_as_binary<T, W>(wtr: &mut W, json: &Value) -> Result<()>\n\nwhere\n\n T: FromJsonValue + WriteBinary,\n\n W: Write,\n\n{\n\n let value = T::from_json_value(json)?;\n\n value.write_binary(wtr)\n\n}\n\n\n","file_path":"dbcrossbarlib/src/drivers/postgres/csv_to_binary/mod.rs","rank":7,"score":252037.10806113842},{"content":"/// Remove the \"dataset/\" prefix from `id`.\n\nfn strip_id_prefix<R: Resource>(id: &Id<R>) -> &str {\n\n // For any given `Resource` type `R`, we know the actual ID prefix, so we\n\n // can strip it like this.\n\n &id.as_str()[R::id_prefix().len()..]\n\n}\n\n\n","file_path":"dbcrossbarlib/src/drivers/bigml/local_data.rs","rank":8,"score":246522.83703041537},{"content":"/// Convert a cell to PostgreSQL `BINARY` format.\n\nfn cell_to_binary(wtr: &mut BufferedWriter, col: &PgColumn, cell: &str) -> Result<()> {\n\n if cell.is_empty() && col.is_nullable {\n\n // We found an empty string in the CSV and this column is\n\n // nullable, so represent it as an SQL `NULL`. If the column\n\n // isn't nullable, then somebody else will have to figure out\n\n // if they can do anything with the empty string.\n\n wtr.write_i32::<NE>(-1)?;\n\n } else {\n\n match &col.data_type {\n\n PgDataType::Array {\n\n dimension_count,\n\n ty,\n\n } => {\n\n array_to_binary(wtr, *dimension_count, ty, cell)?;\n\n }\n\n PgDataType::Scalar(ty) => {\n\n scalar_to_binary(wtr, ty, cell)?;\n\n }\n\n }\n\n }\n\n Ok(())\n\n}\n\n\n","file_path":"dbcrossbarlib/src/drivers/postgres/csv_to_binary/mod.rs","rank":9,"score":232064.2902679389},{"content":"/// Convert `s` into a hexadecimal digest using a hash function.\n\n///\n\n/// The details of this hash function don't matter. We only care that it returns\n\n/// something that's safe to include in a file name, and that has an extremely\n\n/// low probability of colliding.\n\nfn string_to_hex_digest(s: &str) -> String {\n\n let mut hasher = Sha256::new();\n\n hasher.update(s);\n\n let bytes = hasher.finalize();\n\n let mut out = String::with_capacity(2 * bytes.len());\n\n for b in bytes {\n\n write!(&mut out, \"{:02x}\", b).expect(\"write should never fail\");\n\n }\n\n out\n\n}\n\n\n\n/// The path to the file where we store our OAuth2 tokens.\n\n///\n\n/// This should be unique per `token_id` (at least with extremely high probability).\n\nasync fn token_file_path(token_id: &str) -> Result<PathBuf> {\n\n let data_local_dir = dirs::data_local_dir().ok_or_else(|| {\n\n format_err!(\"cannot find directory to store authentication keys\")\n\n })?;\n\n // `yup_oauth2` will fail with a cryptic error if the containing directory\n\n // doesn't exist.\n","file_path":"dbcrossbarlib/src/clouds/gcloud/auth.rs","rank":10,"score":219194.3089187142},{"content":"/// Specify the the location of data or a schema.\n\npub trait Locator: fmt::Debug + fmt::Display + Send + Sync + 'static {\n\n /// Provide a mechanism for casting a `dyn Locator` back to the underlying,\n\n /// concrete locator type using Rust's `Any` type.\n\n ///\n\n /// See [this StackOverflow question][so] for a discussion of the technical\n\n /// details, and why we need a `Locator::as_any` method to use `Any`.\n\n ///\n\n /// This is a bit of a sketchy feature to provide, but we provide it for use\n\n /// with `supports_write_remote_data` and `write_remote_data`, which are\n\n /// used for certain locator pairs (i.e., Google Cloud Storage and BigQuery)\n\n /// to bypass our normal `local_data` and `write_local_data` transfers and\n\n /// use an external, optimized transfer method (such as direct loads from\n\n /// Google Cloud Storage into BigQuery).\n\n ///\n\n /// This should always be implemented as follows:\n\n ///\n\n /// ```no_compile\n\n /// impl Locator for MyLocator {\n\n /// fn as_any(&self) -> &dyn Any {\n\n /// self\n","file_path":"dbcrossbarlib/src/locator.rs","rank":11,"score":208991.2421188793},{"content":"/// All known drivers.\n\npub fn all_drivers() -> &'static [Box<dyn LocatorDriver>] {\n\n &KNOWN_DRIVERS[..]\n\n}\n\n\n","file_path":"dbcrossbarlib/src/drivers/mod.rs","rank":12,"score":197886.37594838574},{"content":"/// Given a slice of bytes, determine if it contains a complete set of CSV\n\n/// headers, and if so, return their length.\n\nfn csv_header_length(data: &[u8]) -> Result<Option<usize>> {\n\n // We could try to use the `csv` crate for this, but the `csv` crate will\n\n // go to great lengths to recover from malformed CSV files, so it's not\n\n // very useful for detecting whether we have a complete header line.\n\n if let Some(pos) = data.iter().position(|b| *b == b'\\n') {\n\n if data[..pos].iter().any(|b| *b == b'\"') {\n\n Err(format_err!(\n\n \"cannot yet concatenate CSV streams with quoted headers\"\n\n ))\n\n } else {\n\n Ok(Some(pos + 1))\n\n }\n\n } else {\n\n Ok(None)\n\n }\n\n}\n\n\n","file_path":"dbcrossbarlib/src/concat.rs","rank":13,"score":196898.67593449482},{"content":"/// Look up a specifc driver by `Locator` scheme.\n\npub fn find_driver(\n\n scheme: &str,\n\n enable_unstable: bool,\n\n) -> Result<&'static dyn LocatorDriver> {\n\n KNOWN_DRIVERS_BY_SCHEME\n\n .get(scheme)\n\n .copied()\n\n .filter(|&d| !d.is_unstable() || enable_unstable)\n\n .ok_or_else(|| format_err!(\"unknown locator scheme {:?}\", scheme))\n\n}\n","file_path":"dbcrossbarlib/src/drivers/mod.rs","rank":14,"score":196109.70468879747},{"content":"/// Write the specified value.\n\nfn write_json_value<W: Write>(\n\n wtr: &mut W,\n\n data_type: &DataType,\n\n value: &Value,\n\n) -> Result<()> {\n\n if data_type.serializes_as_json_for_csv() && !value.is_null() {\n\n serde_json::to_writer(wtr, value)?;\n\n } else {\n\n match value {\n\n // Write `null` as an empty CSV field.\n\n Value::Null => {}\n\n\n\n // Write booleans using our standard convention.\n\n Value::Bool(true) => write!(wtr, \"t\")?,\n\n Value::Bool(false) => write!(wtr, \"f\")?,\n\n\n\n // Numbers and strings can be written as-is.\n\n Value::Number(n) => write!(wtr, \"{}\", n)?,\n\n Value::String(s) => write!(wtr, \"{}\", s)?,\n\n\n","file_path":"dbcrossbarlib/src/drivers/shopify/json_to_csv.rs","rank":15,"score":193171.9229513635},{"content":"fn parse_locator(s: &str, enable_unstable: bool) -> Result<BoxLocator> {\n\n // Parse our locator into a URL-style scheme and the rest.\n\n lazy_static! {\n\n static ref SCHEME_RE: Regex =\n\n Regex::new(\"^[A-Za-z][-A-Za-z0-9+.]*:\").expect(\"invalid regex in source\");\n\n }\n\n let cap = SCHEME_RE\n\n .captures(s)\n\n .ok_or_else(|| format_err!(\"cannot parse locator: {:?}\", s))?;\n\n let scheme = &cap[0];\n\n\n\n // Select an appropriate locator type.\n\n let driver = find_driver(scheme, enable_unstable)?;\n\n driver.parse(s)\n\n}\n\n\n","file_path":"dbcrossbarlib/src/locator.rs","rank":16,"score":191742.2035574998},{"content":"CREATE TEMP FUNCTION ImportJson_{idx}(input STRING)\n\nRETURNS ARRAY<{bq_type}>\n\nAS ((\n\n SELECT ARRAY_AGG(\n\n COALESCE(\n\n SAFE.PARSE_DATETIME('%Y-%m-%d %H:%M:%E*S', e),\n\n PARSE_DATETIME('%Y-%m-%dT%H:%M:%E*S', e)\n\n )\n\n )\n\n FROM UNNEST(ImportJsonHelper_{idx}(input)) AS e\n\n));\n\n\"#,\n\n idx = idx,\n\n bq_type = elem_ty,\n\n )?;\n\n }\n\n\n\n BqDataType::Array(_)\n\n | BqDataType::NonArray(BqNonArrayDataType::Struct(_)) => {\n\n generate_import_udf(self, idx, f)?;\n","file_path":"dbcrossbarlib/src/drivers/bigquery_shared/column.rs","rank":17,"score":173858.96758535085},{"content":"#[test]\n\nfn parses_typescript_and_converts_to_data_type() -> Result<(), main_error::MainError> {\n\n let input = r#\"\n","file_path":"dbcrossbarlib/src/drivers/dbcrossbar_ts/ast.rs","rank":18,"score":169357.23654057688},{"content":"#[test]\n\nfn find_schema() {\n\n let storage = TemporaryStorage::new(vec![\n\n \"s3://example/\".to_string(),\n\n \"gs://example/1/\".to_string(),\n\n \"gs://example/2/\".to_string(),\n\n ]);\n\n assert_eq!(storage.find_scheme(\"s3:\"), Some(\"s3://example/\"));\n\n assert_eq!(storage.find_scheme(\"gs:\"), Some(\"gs://example/1/\"));\n\n}\n\n\n","file_path":"dbcrossbarlib/src/temporary_storage.rs","rank":19,"score":168827.2625854212},{"content":"#[test]\n\nfn path_from_line_returns_entire_path() {\n\n let examples = &[\n\n (\"2013-09-02 21:37:53 10 a.txt\", \"a.txt\"),\n\n (\"2013-09-02 21:37:53 2863288 foo.zip\", \"foo.zip\"),\n\n (\n\n \"2013-09-02 21:32:57 23 foo/bar/.baz/a\",\n\n \"foo/bar/.baz/a\",\n\n ),\n\n ];\n\n for &(line, rel_path) in examples {\n\n assert_eq!(path_from_line(line).unwrap(), rel_path);\n\n }\n\n}\n","file_path":"dbcrossbarlib/src/clouds/aws/s3/ls.rs","rank":20,"score":168325.28763072708},{"content":"#[test]\n\nfn locator_from_str_to_string_roundtrip() {\n\n let locators = vec![\n\n \"bigquery:my_project:my_dataset.my_table\",\n\n \"bigquery-schema:dir/my_table.json\",\n\n \"bigml:dataset\",\n\n \"bigml:datasets\",\n\n \"bigml:dataset/abc123\",\n\n \"bigml:source\",\n\n \"bigml:sources\",\n\n \"csv:file.csv\",\n\n \"csv:dir/\",\n\n \"dbcrossbar-schema:file.json\",\n\n \"dbcrossbar-ts:file %231 20%25.ts#Type\",\n\n \"gs://example-bucket/tmp/\",\n\n \"postgres://localhost:5432/db#my_table\",\n\n \"postgres-sql:dir/my_table.sql\",\n\n \"s3://example/my-dir/\",\n\n \"shopify://example.myshopify.com/admin/api/2020-04/orders.json\",\n\n ];\n\n for locator in locators.into_iter() {\n","file_path":"dbcrossbarlib/src/locator.rs","rank":21,"score":166432.3710849884},{"content":"/// Get a typed header, and return an error if it isn't present.\n\nfn get_header<H>(response: &reqwest::Response) -> Result<H>\n\nwhere\n\n H: Header,\n\n{\n\n response\n\n .headers()\n\n .typed_try_get::<H>()\n\n .with_context(|_| format!(\"error parsing {}\", H::name()))?\n\n .ok_or_else(|| format_err!(\"expected {} header\", H::name()))\n\n}\n\n\n\n/// An iterator which returns ranges for each chunk in a file.\n","file_path":"dbcrossbarlib/src/clouds/gcloud/storage/download_file.rs","rank":23,"score":163242.87343301298},{"content":"#[derive(Clone, Debug, Deserialize)]\n\n#[serde(deny_unknown_fields)]\n\nstruct BigMlDestinationArguments {\n\n /// The name of the source or dataset to create.\n\n name: Option<String>,\n\n\n\n /// The default optype to use for text fields.\n\n optype_for_text: Option<Optype>,\n\n\n\n /// Tags to apply to the resources we create.\n\n #[serde(default)]\n\n tags: Vec<String>,\n\n}\n\n\n\n/// Implementation of `write_local_data`, but as a real `async` function.\n\npub(crate) async fn write_local_data_helper(\n\n ctx: Context,\n\n dest: BigMlLocator,\n\n mut data: BoxStream<CsvStream>,\n\n shared_args: SharedArguments<Unverified>,\n\n dest_args: DestinationArguments<Unverified>,\n\n) -> Result<BoxStream<BoxFuture<BoxLocator>>> {\n","file_path":"dbcrossbarlib/src/drivers/bigml/write_local_data.rs","rank":24,"score":162009.89775555374},{"content":"/// Generate SQL to perform an UPSERT from `src_table_name` into `dest_table`\n\n/// using `upsert_keys`.\n\nfn upsert_sql(\n\n src_table: &PgCreateTable,\n\n dest_table: &PgCreateTable,\n\n upsert_keys: &[String],\n\n) -> Result<String> {\n\n // Figure out which of our columns are \"value\" (non-key) columns.\n\n let value_keys = columns_to_update_for_upsert(dest_table, upsert_keys)?;\n\n\n\n // TODO: Do we need to check for NULLable key columns which might\n\n // produce duplicate rows on upsert, like we do for BigQuery?\n\n\n\n Ok(format!(\n\n r#\"\n\nINSERT INTO {dest_table} ({all_columns}) (\n\n SELECT {all_columns} FROM {src_table}\n\n)\n\nON CONFLICT ({key_columns})\n\nDO UPDATE SET\n\n {value_updates}\n\n\"#,\n","file_path":"dbcrossbarlib/src/drivers/postgres/write_local_data.rs","rank":25,"score":160779.70188707754},{"content":"/// Generate the SQL needed to perform an upsert.\n\n///\n\n/// This will destructively modify and then delete `temp_table`.\n\nfn upsert_sql(\n\n temp_table: &PgCreateTable,\n\n dest_table: &PgCreateTable,\n\n upsert_keys: &[String],\n\n) -> Result<Vec<String>> {\n\n let value_cols = columns_to_update_for_upsert(dest_table, upsert_keys)?;\n\n let dest_table_name = dest_table.name.quoted();\n\n let temp_table_name = temp_table.name.quoted();\n\n let keys_match = upsert_keys\n\n .iter()\n\n .map(|k| {\n\n format!(\n\n \"{dest_table}.{name} = {temp_table}.{name}\",\n\n name = Ident(&k),\n\n dest_table = dest_table_name,\n\n temp_table = temp_table_name,\n\n )\n\n })\n\n .join(\" AND\\n \");\n\n Ok(vec![\n","file_path":"dbcrossbarlib/src/drivers/redshift/write_remote_data.rs","rank":26,"score":160774.97231162226},{"content":"#[test]\n\nfn nested_array_conversions() {\n\n let original_ty =\n\n DataType::Array(Box::new(DataType::Array(Box::new(DataType::Int32))));\n\n let pg_ty = PgDataType::from_data_type(&original_ty).unwrap();\n\n assert_eq!(\n\n pg_ty,\n\n PgDataType::Array {\n\n dimension_count: 2,\n\n ty: PgScalarDataType::Int,\n\n },\n\n );\n\n let portable_ty = pg_ty.to_data_type().unwrap();\n\n assert_eq!(portable_ty, original_ty);\n\n}\n\n\n","file_path":"dbcrossbarlib/src/drivers/postgres_shared/data_type.rs","rank":27,"score":159170.63954712803},{"content":"#[test]\n\nfn nested_arrays() {\n\n let input = DataType::Array(Box::new(DataType::Array(Box::new(DataType::Array(\n\n Box::new(DataType::Int32),\n\n )))));\n\n\n\n // What we expect when loading from a CSV file.\n\n let bq = BqDataType::for_data_type(&input, Usage::CsvLoad).unwrap();\n\n assert_eq!(format!(\"{}\", bq), \"STRING\");\n\n\n\n // What we expect in the final BigQuery table.\n\n let bq = BqDataType::for_data_type(&input, Usage::FinalTable).unwrap();\n\n assert_eq!(\n\n format!(\"{}\", bq),\n\n \"ARRAY<STRUCT<ARRAY<STRUCT<ARRAY<INT64>>>>>\"\n\n );\n\n}\n\n\n","file_path":"dbcrossbarlib/src/drivers/bigquery_shared/data_type/mod.rs","rank":28,"score":159170.63954712803},{"content":"#[test]\n\nfn chunk_ranges_returns_sequential_ranges() {\n\n let ranges = chunk_ranges(10, 25).collect::<Vec<_>>();\n\n assert_eq!(ranges, &[0..10, 10..20, 20..25]);\n\n}\n","file_path":"dbcrossbarlib/src/clouds/gcloud/storage/download_file.rs","rank":29,"score":156041.17067386303},{"content":"/// Write a JavaScript expression that will transform `input_expr` of\n\n/// `intput_type` into a `STRING` containing serialized JSON data. Only applies\n\n/// to non-array types.\n\nfn write_non_array_transform_expr(\n\n input_expr: &str,\n\n input_type: &BqNonArrayDataType,\n\n indent: IndentLevel,\n\n f: &mut dyn Write,\n\n) -> Result<()> {\n\n match input_type {\n\n BqNonArrayDataType::Bool\n\n | BqNonArrayDataType::Float64\n\n | BqNonArrayDataType::Int64\n\n | BqNonArrayDataType::Numeric\n\n | BqNonArrayDataType::String\n\n | BqNonArrayDataType::Timestamp => {\n\n write!(f, \"{}\", input_expr)?;\n\n }\n\n\n\n // BigQuery represents DATE (which has no time or timezone) as a\n\n // JavaScript `Date` with a timezone of `Z`. So we need to fix it.\n\n BqNonArrayDataType::Date => {\n\n write!(f, \"{}.toISOString().split('T')[0]\", input_expr)?;\n","file_path":"dbcrossbarlib/src/drivers/bigquery_shared/export_udf.rs","rank":30,"score":155675.60464833028},{"content":"/// Write a JavaScript expression that will transform `input_expr` into a value\n\n/// of type `output_type`. Only applies to non-array types.\n\nfn write_non_array_transform_expr(\n\n input_expr: &str,\n\n output_type: &BqNonArrayDataType,\n\n indent: IndentLevel,\n\n f: &mut dyn Write,\n\n) -> Result<()> {\n\n match output_type {\n\n // These types can be directly converted to JSON.\n\n //\n\n // TODO: Check min and max `INT64` values, because need to be\n\n // represented as JSON strings, not JSON numbers.\n\n BqNonArrayDataType::Bool\n\n | BqNonArrayDataType::Float64\n\n | BqNonArrayDataType::Int64\n\n | BqNonArrayDataType::Numeric\n\n | BqNonArrayDataType::String => {\n\n write!(f, \"{}\", input_expr)?;\n\n }\n\n\n\n // These types all need to go through `Date`, even when they\n","file_path":"dbcrossbarlib/src/drivers/bigquery_shared/import_udf.rs","rank":31,"score":155671.36254987077},{"content":"fn run() -> Result<()> {\n\n // Set up standard Rust logging for third-party crates.\n\n env_logger::init();\n\n\n\n // Find our system SSL configuration, even if we're statically linked.\n\n openssl_probe::init_ssl_cert_env_vars();\n\n\n\n // Parse our command-line arguments.\n\n let opt = cmd::Opt::from_args();\n\n\n\n // Set up `slog`-based structured logging for our async code, because we\n\n // need to be able to untangle very complicated logs from many parallel\n\n // async tasks.\n\n let base_drain = opt.log_format.create_drain();\n\n let filtered = slog_envlogger::new(base_drain);\n\n let drain = slog_async::Async::new(filtered)\n\n .chan_size(64)\n\n // This may slow down application performance, even when `RUST_LOG` is\n\n // not set. But we've been seeing a lot of dropped messages lately, so\n\n // let's try it.\n","file_path":"dbcrossbar/src/main.rs","rank":32,"score":153009.39190820363},{"content":"/// Given a stream of streams CSV data, return another stream of CSV streams\n\n/// where the CSV data is approximately `chunk_size` long whenever possible.\n\npub fn rechunk_csvs(\n\n ctx: Context,\n\n chunk_size: usize,\n\n streams: BoxStream<CsvStream>,\n\n) -> Result<BoxStream<CsvStream>> {\n\n // Convert out input `BoxStream<CsvStream>` into a single, concatenated\n\n // synchronous `Read` object.\n\n let ctx = ctx.child(o!(\"streams_transform\" => \"rechunk_csvs\"));\n\n let input_csv_stream = concatenate_csv_streams(ctx.clone(), streams)?;\n\n let csv_rdr = SyncStreamReader::new(ctx.clone(), input_csv_stream.data);\n\n\n\n // Create a channel to which we can write `CsvStream` values once we've\n\n // created them.\n\n let (mut csv_stream_sender, csv_stream_receiver) =\n\n mpsc::channel::<Result<CsvStream>>(1);\n\n\n\n // Run a synchronous background worker thread that parsers our sync CSV\n\n // `Read`er into a stream of `CsvStream`s.\n\n let worker_ctx = ctx.clone();\n\n let worker_fut = spawn_blocking(move || -> Result<()> {\n","file_path":"dbcrossbarlib/src/rechunk.rs","rank":33,"score":151720.23971467206},{"content":"/// Write a JSON row to a CSV document.\n\nfn write_row<W: Write>(\n\n wtr: &mut csv::Writer<W>,\n\n schema: &Table,\n\n row: Value,\n\n buffer: &mut Vec<u8>,\n\n) -> Result<()> {\n\n // Convert our row to a JSON object.\n\n let obj = match row {\n\n Value::Object(obj) => obj,\n\n value => return Err(format_err!(\"expected JSON object, found {:?}\", value)),\n\n };\n\n\n\n // Look up each column and output it.\n\n for col in &schema.columns {\n\n let value = obj.get(&col.name).unwrap_or(&Value::Null);\n\n buffer.clear();\n\n write_json_value(buffer, &col.data_type, &value)?;\n\n if !col.is_nullable && buffer.is_empty() {\n\n return Err(format_err!(\n\n \"unexpected NULL value in column {:?}\",\n","file_path":"dbcrossbarlib/src/drivers/shopify/json_to_csv.rs","rank":34,"score":151311.76802570833},{"content":"/// A `Write` implementation that keeps track of how much data has been written\n\n/// so far. Note that if you wrap this in a buffered type like `csv::Writer`, it\n\n/// won't keep track of the data in `csv::Writer`'s buffer, only the data that\n\n/// has been flushed.\n\nstruct CountingWriter<W: Write> {\n\n /// Our writer.\n\n inner: W,\n\n /// The total data that we've written. This is wrapped in `Rc<Cell<_>>` so\n\n /// that is can be easily accessed from anywhere in the same thread even if\n\n /// the `CountingWriter` is completely owned by another type such as\n\n /// `csv::Writer`.\n\n total_written: Rc<Cell<usize>>,\n\n}\n\n\n\nimpl<W: Write> CountingWriter<W> {\n\n /// Create a new `CountingWriter` that wraps `inner`.\n\n fn new(inner: W) -> Self {\n\n Self {\n\n inner,\n\n total_written: Rc::new(Cell::new(0)),\n\n }\n\n }\n\n\n\n /// How much data has been written? This returns an `Rc<Cell<_>>` that will\n","file_path":"dbcrossbarlib/src/rechunk.rs","rank":35,"score":150228.18827178952},{"content":"/// Extra `Locator` methods that can only be called statically. These cannot\n\n/// accessed via a `Box<Locator>`.\n\npub trait LocatorStatic: Locator + Clone + FromStr<Err = Error> + Sized {\n\n /// Convert this locator into a polymorphic `BoxLocator` on the heap.\n\n fn boxed(self) -> BoxLocator {\n\n Box::new(self)\n\n }\n\n\n\n /// Return the \"scheme\" used to format this locator, e.g., `\"postgres:\"`.\n\n fn scheme() -> &'static str;\n\n\n\n /// Return a mask of `LocatorFeatures` supported by this `Locator` type.\n\n fn features() -> Features;\n\n\n\n /// Is this driver unstable?\n\n fn is_unstable() -> bool {\n\n false\n\n }\n\n}\n\n\n","file_path":"dbcrossbarlib/src/locator.rs","rank":36,"score":148884.95305569714},{"content":"/// Create a new `tokio` runtime and use it to run `cmd_future` (which carries\n\n/// out whatever task we want to perform), and `worker_future` (which should\n\n/// have been created by `Context::create` or `Context::create_for_test`).\n\n///\n\n/// Return when at least one future has failed, or both futures have completed\n\n/// successfully.\n\n///\n\n/// This can be safely used from within a test, but it may only be called from a\n\n/// synchronous context.\n\n///\n\n/// If this hangs, make sure all `Context` values are getting dropped once the\n\n/// work is done.\n\npub fn run_futures_with_runtime(\n\n cmd_future: BoxFuture<()>,\n\n worker_future: BoxFuture<()>,\n\n) -> Result<()> {\n\n // Wait for both `cmd_fut` and `copy_fut` to finish, but bail out as soon\n\n // as either returns an error. This involves some pretty deep `tokio` magic:\n\n // If a background worker fails, then `copy_fut` will be automatically\n\n // dropped, or vice vera.\n\n let combined_fut = async move {\n\n try_join!(cmd_future, worker_future)?;\n\n let result: Result<()> = Ok(());\n\n result\n\n };\n\n\n\n // Pass `combined_fut` to our `tokio` runtime, and wait for it to finish.\n\n let mut runtime =\n\n tokio::runtime::Runtime::new().expect(\"Unable to create a runtime\");\n\n runtime.block_on(combined_fut.boxed())?;\n\n Ok(())\n\n}\n","file_path":"dbcrossbarlib/src/tokio_glue.rs","rank":37,"score":148731.7608172574},{"content":"#[async_trait]\n\ntrait CredentialsSource: fmt::Debug + fmt::Display + Send + Sync + 'static {\n\n /// Look up an appropriate set of credentials.\n\n async fn get_credentials(&self) -> Result<Option<Credentials>>;\n\n}\n\n\n","file_path":"dbcrossbarlib/src/credentials.rs","rank":38,"score":148213.27407872424},{"content":"/// Interface to a locator driver. This exists because we Rust can't treat\n\n/// classes as objects, the way Ruby can. Instead, what we do is take classes\n\n/// that implement [`LocatorStatic`] and wrap them up in objects that implement\n\n/// the `LocatorDriver` interface.\n\npub trait LocatorDriver: Send + Sync + 'static {\n\n /// Return the \"scheme\" used to format this locator, e.g., `\"postgres:\"`.\n\n fn scheme(&self) -> &str;\n\n\n\n /// The name of this driver. The same as [`LocatorDriver::schema`], but\n\n /// without the trailing `:`.\n\n fn name(&self) -> &str {\n\n let scheme = self.scheme();\n\n assert!(scheme.ends_with(':'));\n\n &scheme[..scheme.len() - 1]\n\n }\n\n\n\n /// The features supported by this driver.\n\n fn features(&self) -> Features;\n\n\n\n /// Is this driver unstable?\n\n fn is_unstable(&self) -> bool;\n\n\n\n /// Parse a locator string and return a [`BoxLocator`].\n\n fn parse(&self, s: &str) -> Result<BoxLocator>;\n","file_path":"dbcrossbarlib/src/locator.rs","rank":39,"score":140596.53763556026},{"content":"/// Interpret a JSON value as `data_type` and write it out as a `BINARY` value.\n\nfn json_to_binary<W: Write>(\n\n wtr: &mut W,\n\n data_type: &PgScalarDataType,\n\n json: &Value,\n\n) -> Result<()> {\n\n match data_type {\n\n PgScalarDataType::Boolean => write_json_as_binary::<bool, W>(wtr, json),\n\n PgScalarDataType::Date => write_json_as_binary::<NaiveDate, W>(wtr, json),\n\n PgScalarDataType::Numeric => Err(format_err!(\n\n \"cannot use `numeric` arrays with PostgreSQL yet\",\n\n )),\n\n PgScalarDataType::Real => write_json_as_binary::<f32, W>(wtr, json),\n\n PgScalarDataType::DoublePrecision => write_json_as_binary::<f64, W>(wtr, json),\n\n PgScalarDataType::Geometry(srid) => {\n\n let geometry = Geometry::<f64>::from_json_value(json)?;\n\n let value = GeometryWithSrid {\n\n geometry: &geometry,\n\n srid: *srid,\n\n };\n\n value.write_binary(wtr)\n","file_path":"dbcrossbarlib/src/drivers/postgres/csv_to_binary/mod.rs","rank":40,"score":139976.69362027606},{"content":"#[test]\n\nfn handles_magic_types() -> Result<(), main_error::MainError> {\n\n let input = r#\"\n","file_path":"dbcrossbarlib/src/drivers/dbcrossbar_ts/ast.rs","rank":41,"score":132544.79441469087},{"content":"#[test]\n\nfn parses_shopify_schema() -> Result<(), main_error::MainError> {\n\n let file_string = include_str!(\"../../../../dbcrossbar/fixtures/shopify.ts\");\n\n let source_file =\n\n SourceFile::parse(\"shopify.ts\".to_owned(), file_string.to_owned())?;\n\n for def in &[\"Order\"] {\n\n source_file.definition_to_table(def)?;\n\n }\n\n Ok(())\n\n}\n","file_path":"dbcrossbarlib/src/drivers/dbcrossbar_ts/ast.rs","rank":42,"score":132544.79441469087},{"content":"DELETE FROM {temp_table}\n\nUSING {dest_table}\n\nWHERE {keys_match}\",\n\n dest_table = dest_table_name,\n\n temp_table = temp_table_name,\n\n keys_match = keys_match,\n\n ),\n\n format!(\n\n r\"-- Insert new rows into dest table.\n\nINSERT INTO {dest_table} ({all_columns}) (\n\n SELECT {all_columns}\n\n FROM {temp_table}\n\n)\",\n\n dest_table = dest_table_name,\n\n temp_table = temp_table_name,\n\n all_columns = dest_table.columns.iter().map(|c| Ident(&c.name)).join(\", \"),\n\n ),\n\n format!(r\"DROP TABLE {temp_table}\", temp_table = temp_table_name),\n\n ])\n\n}\n\n\n","file_path":"dbcrossbarlib/src/drivers/redshift/write_remote_data.rs","rank":43,"score":131947.88989853775},{"content":"/// Given an S3 URL, get the URL for just the bucket itself.\n\nfn bucket_url(url: &Url) -> Result<Url> {\n\n let bucket = url\n\n .host()\n\n .ok_or_else(|| format_err!(\"could not find bucket name in {}\", url))?;\n\n let bucket_url = format!(\"s3://{}/\", bucket)\n\n .parse::<Url>()\n\n .context(\"could not parse S3 URL\")?;\n\n Ok(bucket_url)\n\n}\n\n\n","file_path":"dbcrossbarlib/src/clouds/aws/s3/ls.rs","rank":44,"score":131797.22688635628},{"content":"#[derive(Debug)]\n\nstruct EnvMapping {\n\n key: &'static str,\n\n var: &'static str,\n\n optional: bool,\n\n}\n\n\n\nimpl EnvMapping {\n\n /// Fetch the value of `key` from `var`.\n\n fn required(key: &'static str, var: &'static str) -> Self {\n\n Self {\n\n key,\n\n var,\n\n optional: false,\n\n }\n\n }\n\n\n\n /// Fetch the value of `key` from `var`, if present.\n\n fn optional(key: &'static str, var: &'static str) -> Self {\n\n Self {\n\n key,\n","file_path":"dbcrossbarlib/src/credentials.rs","rank":45,"score":129101.31453822306},{"content":"#[derive(Debug)]\n\nstruct EnvCredentialsSource {\n\n mapping: Vec<EnvMapping>,\n\n}\n\n\n\nimpl EnvCredentialsSource {\n\n /// Create a new `EnvCredentialsSource`.\n\n ///\n\n /// `mapping` should contain at least one element. The first element must\n\n /// not be `optional`.\n\n fn new(mapping: Vec<EnvMapping>) -> Self {\n\n // Check our preconditions with assertions, since all callers will be\n\n // hard-coded in the source.\n\n assert!(!mapping.is_empty());\n\n assert!(!mapping[0].optional);\n\n Self { mapping }\n\n }\n\n}\n\n\n\nimpl fmt::Display for EnvCredentialsSource {\n\n fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {\n","file_path":"dbcrossbarlib/src/credentials.rs","rank":46,"score":127513.31167994003},{"content":"#[derive(Debug)]\n\nstruct FileCredentialsSource {\n\n key: &'static str,\n\n path: PathBuf,\n\n}\n\n\n\nimpl FileCredentialsSource {\n\n /// Specify how to find credentials in a file. The contents of the file will\n\n /// be mapped to `key` in the credential.\n\n fn new(key: &'static str, path: PathBuf) -> Self {\n\n Self { key, path }\n\n }\n\n}\n\n\n\nimpl fmt::Display for FileCredentialsSource {\n\n fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {\n\n writeln!(f, \"- The file {}\", self.path.display())\n\n }\n\n}\n\n\n\n#[async_trait]\n","file_path":"dbcrossbarlib/src/credentials.rs","rank":47,"score":127396.80840640047},{"content":"#[derive(Debug, Deserialize)]\n\nstruct Value {\n\n /// The actual value. This is normally represented as a string.\n\n ///\n\n /// This might also be a nested `Row` object, but we don't handle that yet.\n\n #[serde(rename = \"v\")]\n\n value: serde_json::Value,\n\n}\n\n\n\nimpl Value {\n\n /// Convert this value into a JSON value.\n\n fn to_json_value(&self, _ctx: &Context) -> Result<serde_json::Value> {\n\n Ok(self.value.clone())\n\n }\n\n}\n\n\n\n/// Run a query that should return a small number of records, and return them as\n\n/// a JSON string.\n\nasync fn query_all_json(\n\n ctx: &Context,\n\n project: &str,\n","file_path":"dbcrossbarlib/src/clouds/gcloud/bigquery/queries.rs","rank":48,"score":125923.14504642788},{"content":"/// A polymorphic log drain (which means we need to use `Box<dyn ...>`,\n\n/// because that's how Rust does runtime polymorphism).\n\ntype BoxDrain = Box<dyn Drain<Ok = (), Err = Never> + Send + 'static>;\n\n\n\n/// What log format we should use.\n\n#[derive(Debug, Copy, Clone, Eq, PartialEq)]\n\npub(crate) enum LogFormat {\n\n /// Pretty, indented logs.\n\n Indented,\n\n /// Single-line log entries with all keys on each line.\n\n Flat,\n\n /// JSON records.\n\n Json,\n\n}\n\n\n\nimpl LogFormat {\n\n /// Create an appropriate `Drain` for this log format.\n\n pub(crate) fn create_drain(self) -> BoxDrain {\n\n match self {\n\n Self::Indented => {\n\n let decorator = slog_term::TermDecorator::new().stderr().build();\n\n Box::new(slog_term::CompactFormat::new(decorator).build().fuse())\n","file_path":"dbcrossbar/src/logging.rs","rank":49,"score":124999.40760604112},{"content":"#[derive(Debug, Deserialize)]\n\n#[serde(rename_all = \"camelCase\")]\n\nstruct QueryResults {\n\n /// The schema of our query results.\n\n schema: TableSchema,\n\n\n\n /// Rows returned from the query.\n\n rows: Vec<Row>,\n\n\n\n /// Has this query completed?\n\n job_complete: bool,\n\n}\n\n\n\nimpl QueryResults {\n\n fn to_json_objects(&self, ctx: &Context) -> Result<Vec<serde_json::Value>> {\n\n let objects = self\n\n .rows\n\n .iter()\n\n .map(|row| row.to_json_object(ctx, &self.schema.fields))\n\n .collect::<Result<Vec<serde_json::Value>>>()?;\n\n trace!(\n\n ctx.log(),\n\n \"rows as objects: {}\",\n\n serde_json::to_string(&objects).expect(\"should be able to serialize rows\"),\n\n );\n\n Ok(objects)\n\n }\n\n}\n\n\n\n/// A row returned in `QueryResults`.\n","file_path":"dbcrossbarlib/src/clouds/gcloud/bigquery/queries.rs","rank":50,"score":124390.79418305974},{"content":"#[derive(Clone, Copy, Debug, Eq, PartialEq)]\n\nstruct CallLimit {\n\n /// How much of our call limit have we used?\n\n used: u32,\n\n /// How much is remaining?\n\n limit: u32,\n\n}\n\n\n\nimpl CallLimit {\n\n /// Are we close enough to our call limit that we should chill out a bit?\n\n fn should_wait(self) -> bool {\n\n self.used.saturating_mul(2) >= self.limit\n\n }\n\n}\n\n\n\nimpl FromStr for CallLimit {\n\n type Err = Error;\n\n\n\n fn from_str(s: &str) -> Result<Self, Self::Err> {\n\n if let Some(split_pos) = s.find('/') {\n\n let used = s[..split_pos]\n","file_path":"dbcrossbarlib/src/drivers/shopify/local_data.rs","rank":51,"score":123537.5059197968},{"content":"#[derive(Debug)]\n\nstruct ShopifyResponse {\n\n /// How much of our API have we used?\n\n call_limit: CallLimit,\n\n\n\n /// The URL of the next page of data.\n\n next_page_url: Option<Url>,\n\n\n\n /// Individual data rows.\n\n rows: Vec<Value>,\n\n}\n\n\n\n/// A Shopify \"call limit\", specifying how much of our API quota we've used.\n","file_path":"dbcrossbarlib/src/drivers/shopify/local_data.rs","rank":52,"score":123537.5059197968},{"content":"#[derive(Debug, Serialize)]\n\n#[serde(rename_all = \"camelCase\")]\n\nstruct QueryResultsQuery {\n\n /// Geographic location. Mandatory outside of US and Europe.\n\n location: String,\n\n}\n\n\n\n/// Results of a query.\n","file_path":"dbcrossbarlib/src/clouds/gcloud/bigquery/queries.rs","rank":53,"score":122953.8313537859},{"content":"#[derive(Debug)]\n\nstruct ChunkRanges {\n\n /// The size of chunk we want to return.\n\n chunk_size: u64,\n\n /// The total length of our file.\n\n len: u64,\n\n /// The place to start our next range.\n\n next_start: u64,\n\n}\n\n\n\nimpl Iterator for ChunkRanges {\n\n type Item = ops::Range<u64>;\n\n\n\n fn next(&mut self) -> Option<Self::Item> {\n\n if self.next_start < self.len {\n\n let end = min(self.next_start + self.chunk_size, self.len);\n\n let range = self.next_start..end;\n\n self.next_start = end;\n\n Some(range)\n\n } else {\n\n None\n\n }\n\n }\n\n}\n\n\n","file_path":"dbcrossbarlib/src/clouds/gcloud/storage/download_file.rs","rank":54,"score":122942.15705326418},{"content":"#[derive(Debug, Serialize)]\n\n#[serde(rename_all = \"camelCase\")]\n\nstruct UploadQuery {\n\n /// The type of the upload we're performing.\n\n upload_type: &'static str,\n\n\n\n /// Only accept the upload if the existing object has the specified\n\n /// generation number. Use 0 to specify a non-existant object.\n\n if_generation_match: i64,\n\n\n\n /// The name of the object we're creating.\n\n name: String,\n\n}\n\n\n\n/// Upload `data` as a file at `url`.\n\n///\n\n/// Docs: https://cloud.google.com/storage/docs/json_api/v1/objects/insert\n\n///\n\n/// TODO: Support https://cloud.google.com/storage/docs/performing-resumable-uploads.\n\npub(crate) async fn upload_file<'a>(\n\n ctx: &'a Context,\n\n data: BoxStream<BytesMut>,\n","file_path":"dbcrossbarlib/src/clouds/gcloud/storage/upload_file.rs","rank":55,"score":122942.15705326418},{"content":"#[derive(Debug, Serialize)]\n\n#[serde(rename_all = \"camelCase\")]\n\nstruct DownloadQuery {\n\n /// What format should we return?\n\n alt: Alt,\n\n\n\n /// What object generation do we expect to download?\n\n if_generation_match: i64,\n\n}\n\n\n\n/// Download the file at the specified URL as a stream.\n\npub(crate) async fn download_file(\n\n ctx: &Context,\n\n item: &StorageObject,\n\n) -> Result<BoxStream<BytesMut>> {\n\n let file_url = item.to_url_string().parse::<Url>()?;\n\n debug!(ctx.log(), \"streaming from {}\", file_url);\n\n let (bucket, object) = parse_gs_url(&file_url)?;\n\n\n\n // Build our URL & common headers.\n\n let url = format!(\n\n \"https://storage.googleapis.com/storage/v1/b/{}/o/{}\",\n","file_path":"dbcrossbarlib/src/clouds/gcloud/storage/download_file.rs","rank":56,"score":122942.15705326418},{"content":"#[test]\n\nfn must_have_upsert_keys() {\n\n assert!(\"upsert-on:\".parse::<IfExists>().is_err());\n\n}\n","file_path":"dbcrossbarlib/src/if_exists.rs","rank":57,"score":122166.34010023126},{"content":"#[test]\n\nfn random_tag() {\n\n assert_eq!(TemporaryStorage::random_tag().len(), 10);\n\n}\n","file_path":"dbcrossbarlib/src/temporary_storage.rs","rank":58,"score":122135.35303314697},{"content":"#[test]\n\nfn data_type_roundtrip() {\n\n let data_types = vec![\n\n DataType::Array(Box::new(DataType::Text)),\n\n DataType::Bool,\n\n DataType::Date,\n\n DataType::Decimal,\n\n DataType::Float32,\n\n DataType::Float64,\n\n DataType::Int16,\n\n DataType::Int32,\n\n DataType::Int64,\n\n DataType::Json,\n\n DataType::Struct(vec![StructField {\n\n name: \"x\".to_owned(),\n\n is_nullable: false,\n\n data_type: DataType::Float32,\n\n }]),\n\n DataType::Text,\n\n DataType::TimestampWithoutTimeZone,\n\n DataType::TimestampWithTimeZone,\n","file_path":"dbcrossbarlib/src/schema.rs","rank":59,"score":121180.23704572642},{"content":"#[test]\n\nfn data_type_serialization_examples() {\n\n // Our serialization format is an external format, so let's write some tests\n\n // to make sure we don't change it accidentally.\n\n let examples = &[\n\n (\n\n DataType::Array(Box::new(DataType::Text)),\n\n json!({\"array\":\"text\"}),\n\n ),\n\n (DataType::Bool, json!(\"bool\")),\n\n (DataType::Date, json!(\"date\")),\n\n (DataType::Decimal, json!(\"decimal\")),\n\n (DataType::Float32, json!(\"float32\")),\n\n (DataType::Float64, json!(\"float64\")),\n\n (DataType::Int16, json!(\"int16\")),\n\n (DataType::Int32, json!(\"int32\")),\n\n (DataType::Int64, json!(\"int64\")),\n\n (DataType::Json, json!(\"json\")),\n\n (\n\n DataType::Struct(vec![StructField {\n\n name: \"x\".to_owned(),\n","file_path":"dbcrossbarlib/src/schema.rs","rank":60,"score":119672.37532169785},{"content":"#[test]\n\nfn to_json_handles_nested_keys() {\n\n use serde_json::json;\n\n let raw_args = &[\"a=b\", \"c.d=x\", \"c.e[]=y\", \"c[e][]=z\"];\n\n let args = DriverArguments::from_cli_args(raw_args).unwrap();\n\n assert_eq!(\n\n args.to_json().unwrap(),\n\n json!({\"a\": \"b\", \"c\": { \"d\": \"x\", \"e\": [\"y\", \"z\"] } }),\n\n );\n\n}\n\n\n","file_path":"dbcrossbarlib/src/driver_args.rs","rank":61,"score":119167.52157809134},{"content":"#[test]\n\nfn from_str_parses_schemas() {\n\n let examples = &[\n\n (\"postgres://user:pass@host/db#table\", \"table\"),\n\n (\"postgres://user:pass@host/db#public.table\", \"public.table\"),\n\n (\n\n \"postgres://user:pass@host/db#testme1.table\",\n\n \"testme1.table\",\n\n ),\n\n ];\n\n for &(url, table_name) in examples {\n\n assert_eq!(\n\n PostgresLocator::from_str(url).unwrap().table_name,\n\n table_name.parse::<TableName>().unwrap(),\n\n );\n\n }\n\n}\n\n\n\nimpl Locator for PostgresLocator {\n\n fn as_any(&self) -> &dyn Any {\n\n self\n","file_path":"dbcrossbarlib/src/drivers/postgres/mod.rs","rank":62,"score":119108.04265761728},{"content":"#[test]\n\n#[ignore]\n\nfn bigquery_roundtrips_structs() {\n\n let _ = env_logger::try_init();\n\n let testdir = TestDir::new(\"dbcrossbar\", \"bigquery_roundtrips_structs\");\n\n let raw_src_path = testdir.src_path(\"fixtures/structs/struct.json\");\n\n let src = testdir.path(\"structs.csv\");\n\n let raw_data_type_path =\n\n testdir.src_path(\"fixtures/structs/struct-data-type.json\");\n\n let schema = testdir.path(\"structs-schema.json\");\n\n let bq_temp_ds = bq_temp_dataset();\n\n let gs_temp_dir = gs_test_dir_url(\"bigquery_roundtrips_structs\");\n\n let bq_table = bq_test_table(\"bigquery_roundtrips_structs\");\n\n\n\n // Use our example JSON to create a CSV file with two columns: One\n\n // containing our struct, and the other containing a single-element array\n\n // containing our struct.\n\n let raw_src = fs::read_to_string(&raw_src_path).unwrap();\n\n let src_data = format!(\n\n r#\"struct,structs\n\n\"{escaped}\",\"[{escaped}]\"\n\n\"#,\n","file_path":"dbcrossbar/tests/cli/cp/bigquery.rs","rank":63,"score":119048.85403284949},{"content":"/// Construct a URL from something we can convert to URL, and something that we\n\n/// can serialize as a query string.\n\nfn build_url<U, Query>(url: U, query: Query) -> Result<Url>\n\nwhere\n\n U: IntoUrl,\n\n Query: fmt::Debug + Serialize,\n\n{\n\n let mut url = url.into_url().context(\"could not parse URL\")?;\n\n let query_str = serde_urlencoded::to_string(&query)?;\n\n if !query_str.is_empty() {\n\n url.set_query(Some(&query_str));\n\n }\n\n Ok(url)\n\n}\n\n\n\n/// A Google Cloud error response.\n","file_path":"dbcrossbarlib/src/clouds/gcloud/client.rs","rank":64,"score":118482.07542254198},{"content":"#[test]\n\nfn crc32c_matches_gcloud() {\n\n // Check that `data` hashes to `expected`.\n\n let check = |data: &[u8], expected: u32| {\n\n let mut hasher = Hasher::new();\n\n hasher.update(data);\n\n assert_eq!(hasher.finish(), expected);\n\n };\n\n\n\n // These test cases are from https://tools.ietf.org/html/rfc3720#page-217\n\n // and https://github.com/google/crc32c/blob/master/src/crc32c_unittest.cc\n\n check(&[0u8; 32], 0x8a91_36aa);\n\n check(&[0xff; 32], 0x62a8_ab43);\n\n let mut buf = [0u8; 32];\n\n for i in 0u8..=31 {\n\n buf[usize::from(i)] = i;\n\n }\n\n check(&buf, 0x46dd_794e);\n\n for i in 0u8..=31 {\n\n buf[usize::from(i)] = 31 - i;\n\n }\n","file_path":"dbcrossbarlib/src/clouds/gcloud/crc32c_stream.rs","rank":65,"score":117746.31734392996},{"content":"/// Convert a JSON-syntax array (possibly nested) into a `BINARY` array.\n\nfn array_to_binary(\n\n wtr: &mut BufferedWriter,\n\n dimension_count: i32,\n\n data_type: &PgScalarDataType,\n\n cell: &str,\n\n) -> Result<()> {\n\n // TODO: For now, we can only handle single-dimensional arrays like\n\n // `[1,2,3]`. Multidimensional arrays would require us to figure out things\n\n // like `[[1,2], [3]]` and what order to serialize nested elements in.\n\n if dimension_count != 1 {\n\n return Err(format_err!(\n\n \"arrays with {} dimensions cannot yet be written to PostgreSQL\",\n\n dimension_count,\n\n ));\n\n }\n\n\n\n // Parse our cell into a JSON value.\n\n let json = serde_json::from_str(cell).context(\"cannot parse JSON\")?;\n\n let json_array = match json {\n\n Value::Array(json_array) => json_array,\n","file_path":"dbcrossbarlib/src/drivers/postgres/csv_to_binary/mod.rs","rank":66,"score":117721.94354576748},{"content":"/// Choose an appropriate `DataType`.\n\nfn pg_data_type(\n\n data_type: &str,\n\n _udt_schema: &str,\n\n udt_name: &str,\n\n) -> Result<PgDataType> {\n\n if data_type == \"ARRAY\" {\n\n // Array element types have their own naming convention, which appears\n\n // to be \"_\" followed by the internal udt_name version of PostgreSQL's\n\n // base types.\n\n let element_type = match udt_name {\n\n \"_bool\" => PgScalarDataType::Boolean,\n\n \"_date\" => PgScalarDataType::Date,\n\n \"_float4\" => PgScalarDataType::Real,\n\n \"_float8\" => PgScalarDataType::DoublePrecision,\n\n \"_int2\" => PgScalarDataType::Smallint,\n\n \"_int4\" => PgScalarDataType::Int,\n\n \"_int8\" => PgScalarDataType::Bigint,\n\n \"_text\" => PgScalarDataType::Text,\n\n \"_timestamp\" => PgScalarDataType::TimestampWithoutTimeZone,\n\n \"_timestamptz\" => PgScalarDataType::TimestampWithTimeZone,\n","file_path":"dbcrossbarlib/src/drivers/postgres_shared/catalog.rs","rank":67,"score":116805.78950949595},{"content":"#[test]\n\nfn scalar_conversions() {\n\n let original_ty = DataType::Int32;\n\n let pg_ty = PgDataType::from_data_type(&original_ty).unwrap();\n\n assert_eq!(pg_ty, PgDataType::Scalar(PgScalarDataType::Int));\n\n let portable_ty = pg_ty.to_data_type().unwrap();\n\n assert_eq!(portable_ty, original_ty);\n\n}\n\n\n\nimpl fmt::Display for PgDataType {\n\n fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {\n\n match self {\n\n PgDataType::Array {\n\n dimension_count,\n\n ty,\n\n } => {\n\n ty.fmt(f)?;\n\n for _ in 0..*dimension_count {\n\n write!(f, \"[]\")?;\n\n }\n\n Ok(())\n","file_path":"dbcrossbarlib/src/drivers/postgres_shared/data_type.rs","rank":68,"score":116800.87908338688},{"content":"#[test]\n\nfn strips_id_prefix() {\n\n use bigml::resource::Dataset;\n\n let id = \"dataset/abc123\".parse::<Id<Dataset>>().unwrap();\n\n assert_eq!(strip_id_prefix(&id), \"abc123\");\n\n}\n","file_path":"dbcrossbarlib/src/drivers/bigml/local_data.rs","rank":69,"score":116800.87908338688},{"content":"#[test]\n\nfn parsing() {\n\n use std::convert::TryFrom;\n\n use BqDataType as DT;\n\n use BqNonArrayDataType as NADT;\n\n let examples = [\n\n (\"BOOL\", DT::NonArray(NADT::Bool)),\n\n // Not documented, but it exists.\n\n (\"BOOLEAN\", DT::NonArray(NADT::Bool)),\n\n (\"BYTES\", DT::NonArray(NADT::Bytes)),\n\n (\"DATE\", DT::NonArray(NADT::Date)),\n\n (\"DATETIME\", DT::NonArray(NADT::Datetime)),\n\n (\"FLOAT64\", DT::NonArray(NADT::Float64)),\n\n (\"GEOGRAPHY\", DT::NonArray(NADT::Geography)),\n\n (\"INT64\", DT::NonArray(NADT::Int64)),\n\n (\"NUMERIC\", DT::NonArray(NADT::Numeric)),\n\n (\"STRING\", DT::NonArray(NADT::String)),\n\n (\"TIME\", DT::NonArray(NADT::Time)),\n\n (\"TIMESTAMP\", DT::NonArray(NADT::Timestamp)),\n\n (\"ARRAY<STRING>\", DT::Array(NADT::String)),\n\n (\n","file_path":"dbcrossbarlib/src/drivers/bigquery_shared/data_type/mod.rs","rank":70,"score":116800.87908338688},{"content":"#[test]\n\nfn parse_call_limit() {\n\n let cl = CallLimit::from_str(\"2/10\").unwrap();\n\n assert_eq!(cl, CallLimit { used: 2, limit: 10 });\n\n}\n\n\n\n/// Shopify wraps all responses in single-item objects, but we don't know the\n\n/// field name. So we need a smart deserialization wrapper.\n","file_path":"dbcrossbarlib/src/drivers/shopify/local_data.rs","rank":71,"score":116800.87908338688},{"content":"#[test]\n\nfn csv_stream_name_handles_directory_inputs() {\n\n let expected = &[\n\n (\"dir/\", \"dir/file1.csv\", \"file1\"),\n\n (\"dir\", \"dir/file1.csv\", \"file1\"),\n\n (\"dir/\", \"dir/subdir/file2.csv\", \"subdir/file2\"),\n\n (\n\n \"s3://bucket/dir/\",\n\n \"s3://bucket/dir/subdir/file3.csv\",\n\n \"subdir/file3\",\n\n ),\n\n ];\n\n for &(base_path, file_path, stream_name) in expected {\n\n assert_eq!(csv_stream_name(base_path, file_path).unwrap(), stream_name);\n\n }\n\n}\n","file_path":"dbcrossbarlib/src/csv_stream.rs","rank":72,"score":116363.32114962838},{"content":"#[test]\n\nfn temporary_table_name() {\n\n let table_name = \"project:dataset.table\".parse::<TableName>().unwrap();\n\n\n\n // Construct a temporary table name without a `--temporary` argument.\n\n let default_temp_name = table_name\n\n .temporary_table_name(&TemporaryStorage::new(vec![]))\n\n .unwrap()\n\n .to_string();\n\n assert!(default_temp_name.starts_with(\"project:dataset.temp_table_\"));\n\n\n\n // Now try it with a `--temporary` argument.\n\n let temporary_storage =\n\n TemporaryStorage::new(vec![\"bigquery:project2:temp\".to_owned()]);\n\n let temp_name = table_name\n\n .temporary_table_name(&temporary_storage)\n\n .unwrap()\n\n .to_string();\n\n assert!(temp_name.starts_with(\"project2:temp.temp_table_\"));\n\n}\n\n\n","file_path":"dbcrossbarlib/src/drivers/bigquery_shared/table_name.rs","rank":73,"score":116327.88528734157},{"content":"#[test]\n\nfn csv_stream_name_handles_file_inputs() {\n\n let expected = &[\n\n (\"/path/to/file1.csv\", \"file1\"),\n\n (\"file2.csv\", \"file2\"),\n\n (\"s3://bucket/dir/file3.csv\", \"file3\"),\n\n (\"gs://bucket/dir/file4.csv\", \"file4\"),\n\n ];\n\n for &(file_path, stream_name) in expected {\n\n assert_eq!(csv_stream_name(file_path, file_path).unwrap(), stream_name);\n\n }\n\n}\n\n\n","file_path":"dbcrossbarlib/src/csv_stream.rs","rank":74,"score":116247.73660580194},{"content":"/// Write a JavaScript expression that will transform `input_expr` of\n\n/// `intput_type` into a `STRING` containing serialized JSON data.\n\nfn write_transform_expr(\n\n input_expr: &str,\n\n input_type: &BqDataType,\n\n indent: IndentLevel,\n\n f: &mut dyn Write,\n\n) -> Result<()> {\n\n // Check to see if anything below this level needs custom handling. This\n\n // check potentially requires O((depth of type)^2) to compute, but it\n\n // potentially saves us lots of unnecessary work on 300-3000 BigQuery CPUs.\n\n if needs_custom_json_export(input_type)?.in_js_code() {\n\n // Yup, we need to do this the hard way.\n\n match input_type {\n\n BqDataType::Array(ty) => {\n\n writeln!(\n\n f,\n\n \"({ie}) == null ? null : {ie}.map(function (e) {{\",\n\n ie = input_expr,\n\n )?;\n\n write!(f, \"{}return \", indent.incr())?;\n\n write_non_array_transform_expr(\"e\", ty, indent.incr(), f)?;\n","file_path":"dbcrossbarlib/src/drivers/bigquery_shared/export_udf.rs","rank":75,"score":115888.98459092289},{"content":"/// Write a JavaScript expression that will transform `input_expr` into a value\n\n/// of type `output_type`.\n\nfn write_transform_expr(\n\n input_expr: &str,\n\n output_type: &BqDataType,\n\n indent: IndentLevel,\n\n f: &mut dyn Write,\n\n) -> Result<()> {\n\n match output_type {\n\n BqDataType::Array(ty) => {\n\n writeln!(\n\n f,\n\n \"({ie} == null) ? null : {ie}.map(function (e) {{\",\n\n ie = input_expr,\n\n )?;\n\n write!(f, \"{}return \", indent.incr())?;\n\n write_non_array_transform_expr(\"e\", ty, indent.incr(), f)?;\n\n writeln!(f, \";\")?;\n\n write!(f, \"{}}})\", indent)?;\n\n }\n\n BqDataType::NonArray(ty) => {\n\n write_non_array_transform_expr(input_expr, ty, indent, f)?;\n\n }\n\n }\n\n Ok(())\n\n}\n\n\n","file_path":"dbcrossbarlib/src/drivers/bigquery_shared/import_udf.rs","rank":76,"score":115884.57593526386},{"content":"#[test]\n\nfn parsing_pg_data_type() {\n\n let array = |ty| PgDataType::Array {\n\n dimension_count: 1,\n\n ty,\n\n };\n\n let examples = &[\n\n // Basic types.\n\n (\n\n (\"bigint\", \"pg_catalog\", \"int8\"),\n\n PgDataType::Scalar(PgScalarDataType::Bigint),\n\n ),\n\n (\n\n (\"boolean\", \"pg_catalog\", \"bool\"),\n\n PgDataType::Scalar(PgScalarDataType::Boolean),\n\n ),\n\n (\n\n (\"character varying\", \"pg_catalog\", \"varchar\"),\n\n PgDataType::Scalar(PgScalarDataType::Text),\n\n ),\n\n (\n","file_path":"dbcrossbarlib/src/drivers/postgres_shared/catalog.rs","rank":77,"score":115432.71827418375},{"content":"/// A helper function which can deserialize integers represented as either\n\n/// numbers or strings.\n\nfn deserialize_int<'de, T, D>(deserializer: D) -> Result<T, D::Error>\n\nwhere\n\n T: FromStr,\n\n <T as FromStr>::Err: fmt::Display,\n\n D: Deserializer<'de>,\n\n{\n\n // We deserialize this using a visitor as described at\n\n // https://serde.rs/impl-deserialize.html because we may want to add support\n\n // for transparently handling a mix of strings and floats, if we ever get\n\n // that back from any API.\n\n struct IntVisitor<T>(PhantomData<T>);\n\n\n\n impl<'de, T> Visitor<'de> for IntVisitor<T>\n\n where\n\n T: FromStr,\n\n <T as FromStr>::Err: fmt::Display,\n\n {\n\n type Value = T;\n\n\n\n fn expecting(&self, f: &mut fmt::Formatter) -> fmt::Result {\n","file_path":"dbcrossbarlib/src/clouds/gcloud/storage/mod.rs","rank":78,"score":114377.03939999503},{"content":"/// Parse a CSV cell and write it out as a PostgreSQL binary value. This works\n\n/// for any type implementing `FromCsvCell` and `WriteBinary`. More complicated\n\n/// cases will need to do this manually.\n\nfn write_cell_as_binary<T: FromCsvCell + WriteBinary>(\n\n wtr: &mut BufferedWriter,\n\n cell: &str,\n\n) -> Result<()> {\n\n let value = T::from_csv_cell(cell)?;\n\n value.write_binary(wtr)\n\n}\n\n\n\n/// Useful extensions to `Write`.\n\npub(crate) trait WriteExt {\n\n /// Write the length of a PostgreSQL value.\n\n fn write_len(&mut self, len: usize) -> Result<()>;\n\n\n\n /// Given a scratch `buffer` (which must be empty) and a function\n\n /// that writes output, run the function, collect the output, and write\n\n /// the output length and the output to this writer.\n\n ///\n\n /// We use an external `buffer` because this is an inner loop that will run\n\n /// over terabytes of data.\n\n fn write_value<F>(&mut self, buffer: &mut Vec<u8>, f: F) -> Result<()>\n","file_path":"dbcrossbarlib/src/drivers/postgres/csv_to_binary/mod.rs","rank":79,"score":114308.73889893357},{"content":"/// Similar to `needs_custom_json_export`, but for `BqNonArrayDataType`.\n\nfn non_array_needs_custom_json_export(\n\n ty: &BqNonArrayDataType,\n\n) -> Result<NeedsCustomJsonExport> {\n\n match ty {\n\n // These types should all export to JSON correctly by default, I hope.\n\n //\n\n // TODO: Check min and max `INT64`.\n\n BqNonArrayDataType::Bool\n\n | BqNonArrayDataType::Float64\n\n | BqNonArrayDataType::Int64\n\n | BqNonArrayDataType::Numeric\n\n | BqNonArrayDataType::String\n\n | BqNonArrayDataType::Timestamp => Ok(NeedsCustomJsonExport::Never),\n\n\n\n // The SQL function `TO_JSON_STRING` handles `DATE` correctly, but it\n\n // gets converted to a full `Date` when passed to JavaScript. And that\n\n // won't automatically convert to the right thing.\n\n BqNonArrayDataType::Date => Ok(NeedsCustomJsonExport::OnlyInsideUdf),\n\n\n\n // This will also export directly.\n","file_path":"dbcrossbarlib/src/drivers/bigquery_shared/export_udf.rs","rank":80,"score":112444.39631055872},{"content":"/// A helper which builds a `Box<dyn LocatorDriver>` for a type implementating\n\n/// `LocatorStatic`.\n\nfn driver<L: LocatorStatic>() -> Box<dyn LocatorDriver> {\n\n Box::new(LocatorDriverWrapper::<L>::new())\n\n}\n\n\n\nlazy_static! {\n\n /// A list of known drivers, computed the first time we use it and cached.\n\n static ref KNOWN_DRIVERS: Vec<Box<dyn LocatorDriver>> = vec![\n\n driver::<bigml::BigMlLocator>(),\n\n driver::<bigquery::BigQueryLocator>(),\n\n driver::<bigquery_schema::BigQuerySchemaLocator>(),\n\n driver::<csv::CsvLocator>(),\n\n driver::<dbcrossbar_schema::DbcrossbarSchemaLocator>(),\n\n driver::<dbcrossbar_ts::DbcrossbarTsLocator>(),\n\n driver::<gs::GsLocator>(),\n\n driver::<postgres::PostgresLocator>(),\n\n driver::<postgres_sql::PostgresSqlLocator>(),\n\n driver::<redshift::RedshiftLocator>(),\n\n driver::<s3::S3Locator>(),\n\n driver::<shopify::ShopifyLocator>(),\n\n ];\n","file_path":"dbcrossbarlib/src/drivers/mod.rs","rank":81,"score":104876.82696671684},{"content":"/// Return an iterator over successive subranges of a file, each containing\n\n/// `chunk_size` bytes except the last.\n\nfn chunk_ranges(chunk_size: u64, len: u64) -> ChunkRanges {\n\n assert!(chunk_size > 0);\n\n ChunkRanges {\n\n chunk_size,\n\n len,\n\n next_start: 0,\n\n }\n\n}\n\n\n","file_path":"dbcrossbarlib/src/clouds/gcloud/storage/download_file.rs","rank":82,"score":99990.86383395335},{"content":"\n\n/// Given a table and list of upsert columns, return a list\n\npub(crate) fn columns_to_update_for_upsert<'a>(\n\n dest_table: &'a PgCreateTable,\n\n upsert_keys: &[String],\n\n) -> Result<Vec<&'a str>> {\n\n // Build a set of our upsert keys. We could probably implement this linear\n\n // search with no significant loss of performance.\n\n let upsert_keys_set: HashSet<&str> =\n\n HashSet::from_iter(upsert_keys.iter().map(|k| &k[..]));\n\n\n\n // Build our list of columns to update.\n\n let mut update_cols = vec![];\n\n for c in &dest_table.columns {\n\n if upsert_keys_set.contains(&c.name[..]) {\n\n // Verify that it's actually safe to use this as an upsert key.\n\n if c.is_nullable {\n\n return Err(format_err!(\n\n \"cannot upsert on column {} because it isn't declared NOT NULL\",\n\n Ident(&c.name),\n\n ));\n\n }\n\n } else {\n\n update_cols.push(&c.name[..]);\n\n }\n\n }\n\n Ok(update_cols)\n\n}\n\n\n","file_path":"dbcrossbarlib/src/drivers/postgres/write_local_data.rs","rank":83,"score":90409.37732950905},{"content":" let mut real_source_table =\n\n BqTable::read_from_table(&ctx, &source_table_name).await?;\n\n real_source_table = real_source_table.aligned_with(&source_table)?;\n\n\n\n // We need to build a temporary export table.\n\n let temp_table_name = source_table\n\n .name()\n\n .temporary_table_name(&temporary_storage)?;\n\n let mut export_sql_data = vec![];\n\n real_source_table.write_export_sql(&source_args, &mut export_sql_data)?;\n\n let export_sql =\n\n String::from_utf8(export_sql_data).expect(\"should always be UTF-8\");\n\n debug!(ctx.log(), \"export SQL: {}\", export_sql);\n\n\n\n // Run our query.\n\n bigquery::query_to_table(\n\n &ctx,\n\n source.project(),\n\n &export_sql,\n\n &temp_table_name,\n","file_path":"dbcrossbarlib/src/drivers/gs/write_remote_data.rs","rank":84,"score":90408.7186246099},{"content":"//! Implementation of `write_local_data` for Redshift.\n\n\n\nuse super::RedshiftLocator;\n\nuse crate::common::*;\n\nuse crate::drivers::s3::find_s3_temp_dir;\n\nuse crate::tokio_glue::ConsumeWithParallelism;\n\n\n\n/// Implementation of `write_local_data`, but as a real `async` function.\n\npub(crate) async fn write_local_data_helper(\n\n ctx: Context,\n\n dest: RedshiftLocator,\n\n data: BoxStream<CsvStream>,\n\n shared_args: SharedArguments<Unverified>,\n\n dest_args: DestinationArguments<Unverified>,\n\n) -> Result<BoxStream<BoxFuture<BoxLocator>>> {\n\n // Build a temporary location.\n\n let shared_args_v = shared_args.clone().verify(RedshiftLocator::features())?;\n\n let s3_temp = find_s3_temp_dir(shared_args_v.temporary_storage())?;\n\n let s3_dest_args = DestinationArguments::for_temporary();\n\n let s3_source_args = SourceArguments::for_temporary();\n","file_path":"dbcrossbarlib/src/drivers/redshift/write_local_data.rs","rank":85,"score":90407.0376541936},{"content":" let create_stmt = client.prepare(&create_sql).await?;\n\n client\n\n .execute(&create_stmt, &[])\n\n .await\n\n .with_context(|_| format!(\"error creating {}\", &table.name.quoted()))?;\n\n Ok(())\n\n}\n\n\n\n/// Create a temporary table based on `table`, but using a different name. This\n\n/// table will only live as long as the `client`.\n\npub(crate) async fn create_temp_table_for(\n\n ctx: &Context,\n\n client: &mut Client,\n\n table: &PgCreateTable,\n\n) -> Result<PgCreateTable> {\n\n let mut temp_table = table.to_owned();\n\n let temp_name = table.name.temporary_table_name()?;\n\n temp_table.name = temp_name;\n\n temp_table.if_not_exists = false;\n\n temp_table.temporary = true;\n","file_path":"dbcrossbarlib/src/drivers/postgres/write_local_data.rs","rank":86,"score":90406.55868184583},{"content":"//! Implementation of `write_local_data` for BigQuery.\n\n\n\nuse crate::common::*;\n\nuse crate::drivers::{bigquery::BigQueryLocator, gs::find_gs_temp_dir};\n\nuse crate::tokio_glue::ConsumeWithParallelism;\n\n\n\n/// Implementation of `write_local_data`, but as a real `async` function.\n\npub(crate) async fn write_local_data_helper(\n\n ctx: Context,\n\n dest: BigQueryLocator,\n\n data: BoxStream<CsvStream>,\n\n shared_args: SharedArguments<Unverified>,\n\n dest_args: DestinationArguments<Unverified>,\n\n) -> Result<BoxStream<BoxFuture<BoxLocator>>> {\n\n // Build a temporary location.\n\n let shared_args_v = shared_args.clone().verify(BigQueryLocator::features())?;\n\n let gs_temp = find_gs_temp_dir(shared_args_v.temporary_storage())?;\n\n let gs_dest_args = DestinationArguments::for_temporary();\n\n let gs_source_args = SourceArguments::for_temporary();\n\n\n","file_path":"dbcrossbarlib/src/drivers/bigquery/write_local_data.rs","rank":87,"score":90406.4598166158},{"content":" create_table(ctx, client, &temp_table).await?;\n\n Ok(temp_table)\n\n}\n\n\n\n/// Run `DROP TABLE` and/or `CREATE TABLE` as needed to prepare `table` for\n\n/// copying in data.\n\n///\n\n/// We take ownership of `pg_create_table` because we want to edit it before\n\n/// running it.\n\npub(crate) async fn prepare_table(\n\n ctx: &Context,\n\n client: &mut Client,\n\n mut table: PgCreateTable,\n\n if_exists: &IfExists,\n\n) -> Result<()> {\n\n match if_exists {\n\n IfExists::Overwrite => {\n\n drop_table_if_exists(ctx, client, &table).await?;\n\n table.if_not_exists = false;\n\n }\n","file_path":"dbcrossbarlib/src/drivers/postgres/write_local_data.rs","rank":88,"score":90404.80759849021},{"content":"//! Support for writing local data to Postgres.\n\n\n\nuse futures::pin_mut;\n\nuse itertools::Itertools;\n\nuse std::{collections::HashSet, io::prelude::*, iter::FromIterator, str};\n\n\n\nuse super::{csv_to_binary::copy_csv_to_pg_binary, Client, PostgresLocator};\n\nuse crate::common::*;\n\nuse crate::drivers::postgres_shared::{connect, CheckCatalog, Ident, PgCreateTable};\n\nuse crate::tokio_glue::try_forward;\n\nuse crate::transform::spawn_sync_transform;\n\n\n\n/// If `table_name` exists, `DROP` it.\n\nasync fn drop_table_if_exists(\n\n ctx: &Context,\n\n client: &mut Client,\n\n table: &PgCreateTable,\n\n) -> Result<()> {\n\n debug!(\n\n ctx.log(),\n","file_path":"dbcrossbarlib/src/drivers/postgres/write_local_data.rs","rank":89,"score":90403.11974345782},{"content":" // Concatenate all our CSV data into a single stream if requested.\n\n if concat_csv_streams {\n\n data = box_stream_once(Ok(concatenate_csv_streams(ctx.clone(), data)?));\n\n }\n\n\n\n // See if we have an S3 temporary directory, and transform `data` into a\n\n // list of BigML source IDs.\n\n let s3_temp = find_s3_temp_dir(shared_args_v.temporary_storage()).ok();\n\n let sources: BoxStream<BoxFuture<(Context, Source)>> =\n\n if let Some(s3_temp) = s3_temp {\n\n // We have S3 temporary storage, so let's copy everything there.\n\n\n\n // Pass our `data` streams to `S3Locator::write_local_data`, which will\n\n // write them to S3 and return a `BoxStream<BoxFuture<BoxLocator>>>`,\n\n // that is, a stream a futures yielding the S3 locators where we put\n\n // our data on S3.\n\n let s3_dest_args = DestinationArguments::for_temporary();\n\n let s3_locator_stream: BoxStream<BoxFuture<BoxLocator>> = s3_temp\n\n .write_local_data(ctx.clone(), data, shared_args, s3_dest_args)\n\n .await?;\n","file_path":"dbcrossbarlib/src/drivers/bigml/write_local_data.rs","rank":90,"score":90402.59353784253},{"content":" \"transforming data into final table {}\",\n\n dest_table.name(),\n\n );\n\n\n\n // Generate and run our import SQL.\n\n let mut query = Vec::new();\n\n dest_table.write_import_sql(initial_table.name(), if_exists, &mut query)?;\n\n let query =\n\n String::from_utf8(query).expect(\"generated SQL should always be UTF-8\");\n\n debug!(ctx.log(), \"import sql: {}\", query);\n\n bigquery::execute_sql(&ctx, dest.project(), &query, &job_labels).await?;\n\n\n\n // Delete temp table.\n\n bigquery::drop_table(&ctx, initial_table.name(), &job_labels).await?;\n\n }\n\n\n\n Ok(vec![dest.boxed()])\n\n}\n","file_path":"dbcrossbarlib/src/drivers/bigquery/write_remote_data.rs","rank":91,"score":90402.16074183013},{"content":" // Connect to Redshift and prepare our table.\n\n let mut client = connect(&ctx, dest.url()).await?;\n\n prepare_table(&ctx, &mut client, pg_create_table.clone(), &if_exists).await?;\n\n if let IfExists::Upsert(upsert_keys) = &if_exists {\n\n // Create a temporary table to hold our imported data.\n\n let temp_table =\n\n create_temp_table_for(&ctx, &mut client, &pg_create_table).await?;\n\n\n\n // Copy data into our temporary table.\n\n copy_in(&ctx, &client, &source_url, &temp_table.name, to_args).await?;\n\n\n\n // Build our upsert SQL.\n\n upsert_from_temp_table(\n\n &ctx,\n\n &mut client,\n\n &temp_table,\n\n &pg_create_table,\n\n upsert_keys,\n\n )\n\n .await?;\n","file_path":"dbcrossbarlib/src/drivers/redshift/write_remote_data.rs","rank":92,"score":90401.65438439896},{"content":" let fut = async move {\n\n while let Some(result) = data.next().await {\n\n match result {\n\n Err(err) => {\n\n debug!(ctx.log(), \"error reading stream of streams: {}\", err);\n\n return Err(err);\n\n }\n\n Ok(csv_stream) => {\n\n let ctx = ctx.child(o!(\"stream\" => csv_stream.name.clone()));\n\n\n\n // Convert our CSV stream into a PostgreSQL `BINARY` stream.\n\n let transform_table = dest_table.clone();\n\n let binary_stream = spawn_sync_transform(\n\n ctx.clone(),\n\n \"copy_csv_to_pg_binary\".to_owned(),\n\n csv_stream.data,\n\n move |_ctx, rdr, wtr| {\n\n copy_csv_to_pg_binary(&transform_table, rdr, wtr)\n\n },\n\n )?;\n","file_path":"dbcrossbarlib/src/drivers/postgres/write_local_data.rs","rank":93,"score":90400.35178357948},{"content":" dest_table = dest_table.name.quoted(),\n\n src_table = src_table.name.quoted(),\n\n all_columns = dest_table.columns.iter().map(|c| Ident(&c.name)).join(\", \"),\n\n key_columns = upsert_keys.iter().map(|k| Ident(k)).join(\", \"),\n\n value_updates = value_keys\n\n .iter()\n\n .map(|vk| format!(\"{name} = EXCLUDED.{name}\", name = Ident(&vk)))\n\n .join(\",\\n \"),\n\n ))\n\n}\n\n\n\n/// Upsert all rows from `src` into `dest`.\n\npub(crate) async fn upsert_from(\n\n ctx: &Context,\n\n client: &mut Client,\n\n src_table: &PgCreateTable,\n\n dest_table: &PgCreateTable,\n\n upsert_keys: &[String],\n\n) -> Result<()> {\n\n let sql = upsert_sql(src_table, dest_table, upsert_keys)?;\n","file_path":"dbcrossbarlib/src/drivers/postgres/write_local_data.rs","rank":94,"score":90399.50070595785},{"content":"\n\n // Copy to a temporary s3:// location.\n\n let to_temp_ctx = ctx.child(o!(\"to_temp\" => s3_temp.to_string()));\n\n let result_stream = s3_temp\n\n .write_local_data(to_temp_ctx, data, shared_args.clone(), s3_dest_args)\n\n .await?;\n\n\n\n // Wait for all s3:// uploads to finish with controllable parallelism.\n\n //\n\n // TODO: This duplicates our top-level `cp` code and we need to implement\n\n // the same rules for picking a good argument to `consume_with_parallelism`\n\n // and not just hard code our parallelism.\n\n result_stream\n\n .consume_with_parallelism(shared_args_v.max_streams())\n\n .await?;\n\n\n\n // Load from s3:// to Redshift.\n\n let from_temp_ctx = ctx.child(o!(\"from_temp\" => s3_temp.to_string()));\n\n dest.write_remote_data(\n\n from_temp_ctx,\n","file_path":"dbcrossbarlib/src/drivers/redshift/write_local_data.rs","rank":95,"score":90399.04756758394},{"content":" // Copy to a temporary gs:// location.\n\n let to_temp_ctx = ctx.child(o!(\"to_temp\" => gs_temp.to_string()));\n\n let result_stream = gs_temp\n\n .write_local_data(to_temp_ctx, data, shared_args.clone(), gs_dest_args)\n\n .await?;\n\n\n\n // Wait for all gs:// uploads to finish with controllable parallelism.\n\n //\n\n // TODO: This duplicates our top-level `cp` code and we need to implement\n\n // the same rules for picking a good argument to `consume_with_parallelism`\n\n // and not just hard code our parallelism.\n\n result_stream\n\n .consume_with_parallelism(shared_args_v.max_streams())\n\n .await?;\n\n\n\n // Load from gs:// to BigQuery.\n\n let from_temp_ctx = ctx.child(o!(\"from_temp\" => gs_temp.to_string()));\n\n dest.write_remote_data(\n\n from_temp_ctx,\n\n Box::new(gs_temp),\n","file_path":"dbcrossbarlib/src/drivers/bigquery/write_local_data.rs","rank":96,"score":90398.78404343598},{"content":"//! Implementation of `write_local_data`.\n\n\n\nuse bigml::{\n\n self,\n\n resource::{dataset, source, source::Optype, Resource, Source},\n\n};\n\nuse chrono::{Duration, Utc};\n\nuse serde::Deserialize;\n\n\n\nuse super::{source::SourceExt, BigMlLocator, CreateOptions};\n\nuse crate::clouds::aws::{sign_s3_url, AwsCredentials};\n\nuse crate::common::*;\n\nuse crate::concat::concatenate_csv_streams;\n\nuse crate::drivers::s3::find_s3_temp_dir;\n\n\n\n/// Parsed version of `--to-arg` values.\n\n#[derive(Clone, Debug, Deserialize)]\n\n#[serde(deny_unknown_fields)]\n","file_path":"dbcrossbarlib/src/drivers/bigml/write_local_data.rs","rank":97,"score":90398.71308136743},{"content":" }\n\n}\n\n\n\nimpl VerifyRedshiftCanImportFromCsv for DataType {\n\n fn verify_redshift_can_import_from_csv(&self) -> Result<()> {\n\n match self {\n\n DataType::Bool\n\n | DataType::Date\n\n | DataType::Float32\n\n | DataType::Float64\n\n | DataType::Int16\n\n | DataType::Int32\n\n | DataType::Int64\n\n | DataType::Text\n\n | DataType::TimestampWithoutTimeZone\n\n | DataType::TimestampWithTimeZone => Ok(()),\n\n DataType::Array(_)\n\n | DataType::Decimal\n\n | DataType::GeoJson(_)\n\n | DataType::Json\n\n | DataType::Struct(_)\n\n | DataType::Uuid => Err(format_err!(\n\n \"Redshift driver does not support data type {:?}\",\n\n self\n\n )),\n\n }\n\n }\n\n}\n","file_path":"dbcrossbarlib/src/drivers/redshift/write_remote_data.rs","rank":98,"score":90397.93899493864}],"string":"[\n {\n \"content\": \"/// Generate the `COPY ... FROM ...` SQL we'll pass to `copy_in`. `data_format`\\n\\n/// should be something like `\\\"CSV HRADER\\\"` or `\\\"BINARY\\\"`.\\n\\n///\\n\\n/// We have a separate function for generating this because we'll use it for\\n\\n/// multiple `COPY` statements.\\n\\nfn copy_from_sql(table: &PgCreateTable, data_format: &str) -> Result<String> {\\n\\n let mut copy_sql_buff = vec![];\\n\\n writeln!(&mut copy_sql_buff, \\\"COPY {} (\\\", table.name.quoted())?;\\n\\n for (idx, col) in table.columns.iter().enumerate() {\\n\\n if idx + 1 == table.columns.len() {\\n\\n writeln!(&mut copy_sql_buff, \\\" {}\\\", Ident(&col.name))?;\\n\\n } else {\\n\\n writeln!(&mut copy_sql_buff, \\\" {},\\\", Ident(&col.name))?;\\n\\n }\\n\\n }\\n\\n writeln!(&mut copy_sql_buff, \\\") FROM STDIN WITH {}\\\", data_format)?;\\n\\n let copy_sql = str::from_utf8(©_sql_buff)\\n\\n .expect(\\\"generated SQL should always be UTF-8\\\")\\n\\n .to_owned();\\n\\n Ok(copy_sql)\\n\\n}\\n\\n\\n\\n/// Given `stream` containing CSV data, plus a the URL and table_name for a\\n\\n/// destination, as well as `\\\"COPY FROM\\\"` SQL, copy the data into the specified\\n\\n/// destination.\\n\",\n \"file_path\": \"dbcrossbarlib/src/drivers/postgres/write_local_data.rs\",\n \"rank\": 0,\n \"score\": 369015.41563082224\n },\n {\n \"content\": \"/// Given a line of `aws s3 ls` output, extract the path.\\n\\nfn path_from_line(line: &str) -> Result<String> {\\n\\n lazy_static! {\\n\\n static ref RE: Regex = Regex::new(r#\\\"^[-0-9]+ [:0-9]+ +[0-9]+ ([^\\\\r\\\\n]+)\\\"#)\\n\\n .expect(\\\"invalid regex in source\\\");\\n\\n }\\n\\n let cap = RE\\n\\n .captures(line)\\n\\n .ok_or_else(|| format_err!(\\\"cannot parse S3 ls output: {:?}\\\", line))?;\\n\\n Ok(cap[1].to_owned())\\n\\n}\\n\\n\\n\",\n \"file_path\": \"dbcrossbarlib/src/clouds/aws/s3/ls.rs\",\n \"rank\": 2,\n \"score\": 310524.6688510113\n },\n {\n \"content\": \"#[derive(Deserialize)]\\n\\n#[serde(transparent)]\\n\\nstruct RowsJson(HashMap<String, Vec<Value>>);\\n\\n\\n\\nimpl RowsJson {\\n\\n /// If we only have a single key in our `HashMap`, return the corresponding value.\\n\\n fn into_rows(self) -> Result<Vec<Value>> {\\n\\n if self.0.len() == 1 {\\n\\n Ok(self\\n\\n .0\\n\\n .into_iter()\\n\\n .next()\\n\\n .expect(\\\"checked for exactly one value, didn't find it\\\")\\n\\n .1)\\n\\n } else {\\n\\n Err(format_err!(\\n\\n \\\"found multiple keys in Shopify response: {}\\\",\\n\\n self.0.keys().join(\\\",\\\")\\n\\n ))\\n\\n }\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"dbcrossbarlib/src/drivers/shopify/local_data.rs\",\n \"rank\": 3,\n \"score\": 285221.9327160282\n },\n {\n \"content\": \"/// Look up an environment variable by name, returning an error if it does not exist.\\n\\nfn var(name: &str) -> Result<String> {\\n\\n match try_var(name)? {\\n\\n Some(value) => Ok(value),\\n\\n None => Err(format_err!(\\n\\n \\\"expected environment variable {} to be set\\\",\\n\\n name,\\n\\n )),\\n\\n }\\n\\n}\\n\\n\\n\\n/// Load credentials stored in a file.\\n\",\n \"file_path\": \"dbcrossbarlib/src/credentials.rs\",\n \"rank\": 4,\n \"score\": 279074.77776419785\n },\n {\n \"content\": \"/// Look up an environment variable by name, returning `Ok(None)` if it does not\\n\\n/// exist.\\n\\nfn try_var(name: &str) -> Result<Option<String>> {\\n\\n match env::var(name) {\\n\\n Ok(value) => Ok(Some(value)),\\n\\n Err(env::VarError::NotPresent) => Ok(None),\\n\\n Err(env::VarError::NotUnicode(..)) => Err(format_err!(\\n\\n \\\"environment variable {} cannot be converted to UTF-8\\\",\\n\\n name,\\n\\n )),\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"dbcrossbarlib/src/credentials.rs\",\n \"rank\": 5,\n \"score\": 267530.22396886325\n },\n {\n \"content\": \"/// Make sure a table name is legal for PostgreSQL.\\n\\n///\\n\\n/// This will use an valid-looking table name if it can find one somewhere in\\n\\n/// the string, or it will return a default value.\\n\\nfn sanitize_table_name(table_name: &str) -> Result<String> {\\n\\n lazy_static! {\\n\\n static ref RE: Regex = Regex::new(\\n\\n r\\\"(?x)\\n\\n ([_a-zA-Z][_a-zA-Z0-9]*\\\\.)?\\n\\n ([_a-zA-Z][_a-zA-Z0-9]*)\\n\\n $\\\"\\n\\n )\\n\\n .expect(\\\"could not compile regex in source\\\");\\n\\n }\\n\\n if let Some(cap) = RE.captures(table_name) {\\n\\n Ok(cap[0].to_owned())\\n\\n } else {\\n\\n // Just use a generic table name.\\n\\n Ok(\\\"data\\\".to_owned())\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"dbcrossbarlib/src/drivers/postgres_sql/mod.rs\",\n \"rank\": 6,\n \"score\": 263174.85666585446\n },\n {\n \"content\": \"/// Parse a JSON value and write it out as a PostgreSQL binary value. This works\\n\\n/// for any type implementing `FromJsonValue` and `WriteBinary`. More\\n\\n/// complicated cases will need to do this manually.\\n\\nfn write_json_as_binary<T, W>(wtr: &mut W, json: &Value) -> Result<()>\\n\\nwhere\\n\\n T: FromJsonValue + WriteBinary,\\n\\n W: Write,\\n\\n{\\n\\n let value = T::from_json_value(json)?;\\n\\n value.write_binary(wtr)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"dbcrossbarlib/src/drivers/postgres/csv_to_binary/mod.rs\",\n \"rank\": 7,\n \"score\": 252037.10806113842\n },\n {\n \"content\": \"/// Remove the \\\"dataset/\\\" prefix from `id`.\\n\\nfn strip_id_prefix<R: Resource>(id: &Id<R>) -> &str {\\n\\n // For any given `Resource` type `R`, we know the actual ID prefix, so we\\n\\n // can strip it like this.\\n\\n &id.as_str()[R::id_prefix().len()..]\\n\\n}\\n\\n\\n\",\n \"file_path\": \"dbcrossbarlib/src/drivers/bigml/local_data.rs\",\n \"rank\": 8,\n \"score\": 246522.83703041537\n },\n {\n \"content\": \"/// Convert a cell to PostgreSQL `BINARY` format.\\n\\nfn cell_to_binary(wtr: &mut BufferedWriter, col: &PgColumn, cell: &str) -> Result<()> {\\n\\n if cell.is_empty() && col.is_nullable {\\n\\n // We found an empty string in the CSV and this column is\\n\\n // nullable, so represent it as an SQL `NULL`. If the column\\n\\n // isn't nullable, then somebody else will have to figure out\\n\\n // if they can do anything with the empty string.\\n\\n wtr.write_i32::<NE>(-1)?;\\n\\n } else {\\n\\n match &col.data_type {\\n\\n PgDataType::Array {\\n\\n dimension_count,\\n\\n ty,\\n\\n } => {\\n\\n array_to_binary(wtr, *dimension_count, ty, cell)?;\\n\\n }\\n\\n PgDataType::Scalar(ty) => {\\n\\n scalar_to_binary(wtr, ty, cell)?;\\n\\n }\\n\\n }\\n\\n }\\n\\n Ok(())\\n\\n}\\n\\n\\n\",\n \"file_path\": \"dbcrossbarlib/src/drivers/postgres/csv_to_binary/mod.rs\",\n \"rank\": 9,\n \"score\": 232064.2902679389\n },\n {\n \"content\": \"/// Convert `s` into a hexadecimal digest using a hash function.\\n\\n///\\n\\n/// The details of this hash function don't matter. We only care that it returns\\n\\n/// something that's safe to include in a file name, and that has an extremely\\n\\n/// low probability of colliding.\\n\\nfn string_to_hex_digest(s: &str) -> String {\\n\\n let mut hasher = Sha256::new();\\n\\n hasher.update(s);\\n\\n let bytes = hasher.finalize();\\n\\n let mut out = String::with_capacity(2 * bytes.len());\\n\\n for b in bytes {\\n\\n write!(&mut out, \\\"{:02x}\\\", b).expect(\\\"write should never fail\\\");\\n\\n }\\n\\n out\\n\\n}\\n\\n\\n\\n/// The path to the file where we store our OAuth2 tokens.\\n\\n///\\n\\n/// This should be unique per `token_id` (at least with extremely high probability).\\n\\nasync fn token_file_path(token_id: &str) -> Result<PathBuf> {\\n\\n let data_local_dir = dirs::data_local_dir().ok_or_else(|| {\\n\\n format_err!(\\\"cannot find directory to store authentication keys\\\")\\n\\n })?;\\n\\n // `yup_oauth2` will fail with a cryptic error if the containing directory\\n\\n // doesn't exist.\\n\",\n \"file_path\": \"dbcrossbarlib/src/clouds/gcloud/auth.rs\",\n \"rank\": 10,\n \"score\": 219194.3089187142\n },\n {\n \"content\": \"/// Specify the the location of data or a schema.\\n\\npub trait Locator: fmt::Debug + fmt::Display + Send + Sync + 'static {\\n\\n /// Provide a mechanism for casting a `dyn Locator` back to the underlying,\\n\\n /// concrete locator type using Rust's `Any` type.\\n\\n ///\\n\\n /// See [this StackOverflow question][so] for a discussion of the technical\\n\\n /// details, and why we need a `Locator::as_any` method to use `Any`.\\n\\n ///\\n\\n /// This is a bit of a sketchy feature to provide, but we provide it for use\\n\\n /// with `supports_write_remote_data` and `write_remote_data`, which are\\n\\n /// used for certain locator pairs (i.e., Google Cloud Storage and BigQuery)\\n\\n /// to bypass our normal `local_data` and `write_local_data` transfers and\\n\\n /// use an external, optimized transfer method (such as direct loads from\\n\\n /// Google Cloud Storage into BigQuery).\\n\\n ///\\n\\n /// This should always be implemented as follows:\\n\\n ///\\n\\n /// ```no_compile\\n\\n /// impl Locator for MyLocator {\\n\\n /// fn as_any(&self) -> &dyn Any {\\n\\n /// self\\n\",\n \"file_path\": \"dbcrossbarlib/src/locator.rs\",\n \"rank\": 11,\n \"score\": 208991.2421188793\n },\n {\n \"content\": \"/// All known drivers.\\n\\npub fn all_drivers() -> &'static [Box<dyn LocatorDriver>] {\\n\\n &KNOWN_DRIVERS[..]\\n\\n}\\n\\n\\n\",\n \"file_path\": \"dbcrossbarlib/src/drivers/mod.rs\",\n \"rank\": 12,\n \"score\": 197886.37594838574\n },\n {\n \"content\": \"/// Given a slice of bytes, determine if it contains a complete set of CSV\\n\\n/// headers, and if so, return their length.\\n\\nfn csv_header_length(data: &[u8]) -> Result<Option<usize>> {\\n\\n // We could try to use the `csv` crate for this, but the `csv` crate will\\n\\n // go to great lengths to recover from malformed CSV files, so it's not\\n\\n // very useful for detecting whether we have a complete header line.\\n\\n if let Some(pos) = data.iter().position(|b| *b == b'\\\\n') {\\n\\n if data[..pos].iter().any(|b| *b == b'\\\"') {\\n\\n Err(format_err!(\\n\\n \\\"cannot yet concatenate CSV streams with quoted headers\\\"\\n\\n ))\\n\\n } else {\\n\\n Ok(Some(pos + 1))\\n\\n }\\n\\n } else {\\n\\n Ok(None)\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"dbcrossbarlib/src/concat.rs\",\n \"rank\": 13,\n \"score\": 196898.67593449482\n },\n {\n \"content\": \"/// Look up a specifc driver by `Locator` scheme.\\n\\npub fn find_driver(\\n\\n scheme: &str,\\n\\n enable_unstable: bool,\\n\\n) -> Result<&'static dyn LocatorDriver> {\\n\\n KNOWN_DRIVERS_BY_SCHEME\\n\\n .get(scheme)\\n\\n .copied()\\n\\n .filter(|&d| !d.is_unstable() || enable_unstable)\\n\\n .ok_or_else(|| format_err!(\\\"unknown locator scheme {:?}\\\", scheme))\\n\\n}\\n\",\n \"file_path\": \"dbcrossbarlib/src/drivers/mod.rs\",\n \"rank\": 14,\n \"score\": 196109.70468879747\n },\n {\n \"content\": \"/// Write the specified value.\\n\\nfn write_json_value<W: Write>(\\n\\n wtr: &mut W,\\n\\n data_type: &DataType,\\n\\n value: &Value,\\n\\n) -> Result<()> {\\n\\n if data_type.serializes_as_json_for_csv() && !value.is_null() {\\n\\n serde_json::to_writer(wtr, value)?;\\n\\n } else {\\n\\n match value {\\n\\n // Write `null` as an empty CSV field.\\n\\n Value::Null => {}\\n\\n\\n\\n // Write booleans using our standard convention.\\n\\n Value::Bool(true) => write!(wtr, \\\"t\\\")?,\\n\\n Value::Bool(false) => write!(wtr, \\\"f\\\")?,\\n\\n\\n\\n // Numbers and strings can be written as-is.\\n\\n Value::Number(n) => write!(wtr, \\\"{}\\\", n)?,\\n\\n Value::String(s) => write!(wtr, \\\"{}\\\", s)?,\\n\\n\\n\",\n \"file_path\": \"dbcrossbarlib/src/drivers/shopify/json_to_csv.rs\",\n \"rank\": 15,\n \"score\": 193171.9229513635\n },\n {\n \"content\": \"fn parse_locator(s: &str, enable_unstable: bool) -> Result<BoxLocator> {\\n\\n // Parse our locator into a URL-style scheme and the rest.\\n\\n lazy_static! {\\n\\n static ref SCHEME_RE: Regex =\\n\\n Regex::new(\\\"^[A-Za-z][-A-Za-z0-9+.]*:\\\").expect(\\\"invalid regex in source\\\");\\n\\n }\\n\\n let cap = SCHEME_RE\\n\\n .captures(s)\\n\\n .ok_or_else(|| format_err!(\\\"cannot parse locator: {:?}\\\", s))?;\\n\\n let scheme = &cap[0];\\n\\n\\n\\n // Select an appropriate locator type.\\n\\n let driver = find_driver(scheme, enable_unstable)?;\\n\\n driver.parse(s)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"dbcrossbarlib/src/locator.rs\",\n \"rank\": 16,\n \"score\": 191742.2035574998\n },\n {\n \"content\": \"CREATE TEMP FUNCTION ImportJson_{idx}(input STRING)\\n\\nRETURNS ARRAY<{bq_type}>\\n\\nAS ((\\n\\n SELECT ARRAY_AGG(\\n\\n COALESCE(\\n\\n SAFE.PARSE_DATETIME('%Y-%m-%d %H:%M:%E*S', e),\\n\\n PARSE_DATETIME('%Y-%m-%dT%H:%M:%E*S', e)\\n\\n )\\n\\n )\\n\\n FROM UNNEST(ImportJsonHelper_{idx}(input)) AS e\\n\\n));\\n\\n\\\"#,\\n\\n idx = idx,\\n\\n bq_type = elem_ty,\\n\\n )?;\\n\\n }\\n\\n\\n\\n BqDataType::Array(_)\\n\\n | BqDataType::NonArray(BqNonArrayDataType::Struct(_)) => {\\n\\n generate_import_udf(self, idx, f)?;\\n\",\n \"file_path\": \"dbcrossbarlib/src/drivers/bigquery_shared/column.rs\",\n \"rank\": 17,\n \"score\": 173858.96758535085\n },\n {\n \"content\": \"#[test]\\n\\nfn parses_typescript_and_converts_to_data_type() -> Result<(), main_error::MainError> {\\n\\n let input = r#\\\"\\n\",\n \"file_path\": \"dbcrossbarlib/src/drivers/dbcrossbar_ts/ast.rs\",\n \"rank\": 18,\n \"score\": 169357.23654057688\n },\n {\n \"content\": \"#[test]\\n\\nfn find_schema() {\\n\\n let storage = TemporaryStorage::new(vec![\\n\\n \\\"s3://example/\\\".to_string(),\\n\\n \\\"gs://example/1/\\\".to_string(),\\n\\n \\\"gs://example/2/\\\".to_string(),\\n\\n ]);\\n\\n assert_eq!(storage.find_scheme(\\\"s3:\\\"), Some(\\\"s3://example/\\\"));\\n\\n assert_eq!(storage.find_scheme(\\\"gs:\\\"), Some(\\\"gs://example/1/\\\"));\\n\\n}\\n\\n\\n\",\n \"file_path\": \"dbcrossbarlib/src/temporary_storage.rs\",\n \"rank\": 19,\n \"score\": 168827.2625854212\n },\n {\n \"content\": \"#[test]\\n\\nfn path_from_line_returns_entire_path() {\\n\\n let examples = &[\\n\\n (\\\"2013-09-02 21:37:53 10 a.txt\\\", \\\"a.txt\\\"),\\n\\n (\\\"2013-09-02 21:37:53 2863288 foo.zip\\\", \\\"foo.zip\\\"),\\n\\n (\\n\\n \\\"2013-09-02 21:32:57 23 foo/bar/.baz/a\\\",\\n\\n \\\"foo/bar/.baz/a\\\",\\n\\n ),\\n\\n ];\\n\\n for &(line, rel_path) in examples {\\n\\n assert_eq!(path_from_line(line).unwrap(), rel_path);\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"dbcrossbarlib/src/clouds/aws/s3/ls.rs\",\n \"rank\": 20,\n \"score\": 168325.28763072708\n },\n {\n \"content\": \"#[test]\\n\\nfn locator_from_str_to_string_roundtrip() {\\n\\n let locators = vec![\\n\\n \\\"bigquery:my_project:my_dataset.my_table\\\",\\n\\n \\\"bigquery-schema:dir/my_table.json\\\",\\n\\n \\\"bigml:dataset\\\",\\n\\n \\\"bigml:datasets\\\",\\n\\n \\\"bigml:dataset/abc123\\\",\\n\\n \\\"bigml:source\\\",\\n\\n \\\"bigml:sources\\\",\\n\\n \\\"csv:file.csv\\\",\\n\\n \\\"csv:dir/\\\",\\n\\n \\\"dbcrossbar-schema:file.json\\\",\\n\\n \\\"dbcrossbar-ts:file %231 20%25.ts#Type\\\",\\n\\n \\\"gs://example-bucket/tmp/\\\",\\n\\n \\\"postgres://localhost:5432/db#my_table\\\",\\n\\n \\\"postgres-sql:dir/my_table.sql\\\",\\n\\n \\\"s3://example/my-dir/\\\",\\n\\n \\\"shopify://example.myshopify.com/admin/api/2020-04/orders.json\\\",\\n\\n ];\\n\\n for locator in locators.into_iter() {\\n\",\n \"file_path\": \"dbcrossbarlib/src/locator.rs\",\n \"rank\": 21,\n \"score\": 166432.3710849884\n },\n {\n \"content\": \"/// Get a typed header, and return an error if it isn't present.\\n\\nfn get_header<H>(response: &reqwest::Response) -> Result<H>\\n\\nwhere\\n\\n H: Header,\\n\\n{\\n\\n response\\n\\n .headers()\\n\\n .typed_try_get::<H>()\\n\\n .with_context(|_| format!(\\\"error parsing {}\\\", H::name()))?\\n\\n .ok_or_else(|| format_err!(\\\"expected {} header\\\", H::name()))\\n\\n}\\n\\n\\n\\n/// An iterator which returns ranges for each chunk in a file.\\n\",\n \"file_path\": \"dbcrossbarlib/src/clouds/gcloud/storage/download_file.rs\",\n \"rank\": 23,\n \"score\": 163242.87343301298\n },\n {\n \"content\": \"#[derive(Clone, Debug, Deserialize)]\\n\\n#[serde(deny_unknown_fields)]\\n\\nstruct BigMlDestinationArguments {\\n\\n /// The name of the source or dataset to create.\\n\\n name: Option<String>,\\n\\n\\n\\n /// The default optype to use for text fields.\\n\\n optype_for_text: Option<Optype>,\\n\\n\\n\\n /// Tags to apply to the resources we create.\\n\\n #[serde(default)]\\n\\n tags: Vec<String>,\\n\\n}\\n\\n\\n\\n/// Implementation of `write_local_data`, but as a real `async` function.\\n\\npub(crate) async fn write_local_data_helper(\\n\\n ctx: Context,\\n\\n dest: BigMlLocator,\\n\\n mut data: BoxStream<CsvStream>,\\n\\n shared_args: SharedArguments<Unverified>,\\n\\n dest_args: DestinationArguments<Unverified>,\\n\\n) -> Result<BoxStream<BoxFuture<BoxLocator>>> {\\n\",\n \"file_path\": \"dbcrossbarlib/src/drivers/bigml/write_local_data.rs\",\n \"rank\": 24,\n \"score\": 162009.89775555374\n },\n {\n \"content\": \"/// Generate SQL to perform an UPSERT from `src_table_name` into `dest_table`\\n\\n/// using `upsert_keys`.\\n\\nfn upsert_sql(\\n\\n src_table: &PgCreateTable,\\n\\n dest_table: &PgCreateTable,\\n\\n upsert_keys: &[String],\\n\\n) -> Result<String> {\\n\\n // Figure out which of our columns are \\\"value\\\" (non-key) columns.\\n\\n let value_keys = columns_to_update_for_upsert(dest_table, upsert_keys)?;\\n\\n\\n\\n // TODO: Do we need to check for NULLable key columns which might\\n\\n // produce duplicate rows on upsert, like we do for BigQuery?\\n\\n\\n\\n Ok(format!(\\n\\n r#\\\"\\n\\nINSERT INTO {dest_table} ({all_columns}) (\\n\\n SELECT {all_columns} FROM {src_table}\\n\\n)\\n\\nON CONFLICT ({key_columns})\\n\\nDO UPDATE SET\\n\\n {value_updates}\\n\\n\\\"#,\\n\",\n \"file_path\": \"dbcrossbarlib/src/drivers/postgres/write_local_data.rs\",\n \"rank\": 25,\n \"score\": 160779.70188707754\n },\n {\n \"content\": \"/// Generate the SQL needed to perform an upsert.\\n\\n///\\n\\n/// This will destructively modify and then delete `temp_table`.\\n\\nfn upsert_sql(\\n\\n temp_table: &PgCreateTable,\\n\\n dest_table: &PgCreateTable,\\n\\n upsert_keys: &[String],\\n\\n) -> Result<Vec<String>> {\\n\\n let value_cols = columns_to_update_for_upsert(dest_table, upsert_keys)?;\\n\\n let dest_table_name = dest_table.name.quoted();\\n\\n let temp_table_name = temp_table.name.quoted();\\n\\n let keys_match = upsert_keys\\n\\n .iter()\\n\\n .map(|k| {\\n\\n format!(\\n\\n \\\"{dest_table}.{name} = {temp_table}.{name}\\\",\\n\\n name = Ident(&k),\\n\\n dest_table = dest_table_name,\\n\\n temp_table = temp_table_name,\\n\\n )\\n\\n })\\n\\n .join(\\\" AND\\\\n \\\");\\n\\n Ok(vec![\\n\",\n \"file_path\": \"dbcrossbarlib/src/drivers/redshift/write_remote_data.rs\",\n \"rank\": 26,\n \"score\": 160774.97231162226\n },\n {\n \"content\": \"#[test]\\n\\nfn nested_array_conversions() {\\n\\n let original_ty =\\n\\n DataType::Array(Box::new(DataType::Array(Box::new(DataType::Int32))));\\n\\n let pg_ty = PgDataType::from_data_type(&original_ty).unwrap();\\n\\n assert_eq!(\\n\\n pg_ty,\\n\\n PgDataType::Array {\\n\\n dimension_count: 2,\\n\\n ty: PgScalarDataType::Int,\\n\\n },\\n\\n );\\n\\n let portable_ty = pg_ty.to_data_type().unwrap();\\n\\n assert_eq!(portable_ty, original_ty);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"dbcrossbarlib/src/drivers/postgres_shared/data_type.rs\",\n \"rank\": 27,\n \"score\": 159170.63954712803\n },\n {\n \"content\": \"#[test]\\n\\nfn nested_arrays() {\\n\\n let input = DataType::Array(Box::new(DataType::Array(Box::new(DataType::Array(\\n\\n Box::new(DataType::Int32),\\n\\n )))));\\n\\n\\n\\n // What we expect when loading from a CSV file.\\n\\n let bq = BqDataType::for_data_type(&input, Usage::CsvLoad).unwrap();\\n\\n assert_eq!(format!(\\\"{}\\\", bq), \\\"STRING\\\");\\n\\n\\n\\n // What we expect in the final BigQuery table.\\n\\n let bq = BqDataType::for_data_type(&input, Usage::FinalTable).unwrap();\\n\\n assert_eq!(\\n\\n format!(\\\"{}\\\", bq),\\n\\n \\\"ARRAY<STRUCT<ARRAY<STRUCT<ARRAY<INT64>>>>>\\\"\\n\\n );\\n\\n}\\n\\n\\n\",\n \"file_path\": \"dbcrossbarlib/src/drivers/bigquery_shared/data_type/mod.rs\",\n \"rank\": 28,\n \"score\": 159170.63954712803\n },\n {\n \"content\": \"#[test]\\n\\nfn chunk_ranges_returns_sequential_ranges() {\\n\\n let ranges = chunk_ranges(10, 25).collect::<Vec<_>>();\\n\\n assert_eq!(ranges, &[0..10, 10..20, 20..25]);\\n\\n}\\n\",\n \"file_path\": \"dbcrossbarlib/src/clouds/gcloud/storage/download_file.rs\",\n \"rank\": 29,\n \"score\": 156041.17067386303\n },\n {\n \"content\": \"/// Write a JavaScript expression that will transform `input_expr` of\\n\\n/// `intput_type` into a `STRING` containing serialized JSON data. Only applies\\n\\n/// to non-array types.\\n\\nfn write_non_array_transform_expr(\\n\\n input_expr: &str,\\n\\n input_type: &BqNonArrayDataType,\\n\\n indent: IndentLevel,\\n\\n f: &mut dyn Write,\\n\\n) -> Result<()> {\\n\\n match input_type {\\n\\n BqNonArrayDataType::Bool\\n\\n | BqNonArrayDataType::Float64\\n\\n | BqNonArrayDataType::Int64\\n\\n | BqNonArrayDataType::Numeric\\n\\n | BqNonArrayDataType::String\\n\\n | BqNonArrayDataType::Timestamp => {\\n\\n write!(f, \\\"{}\\\", input_expr)?;\\n\\n }\\n\\n\\n\\n // BigQuery represents DATE (which has no time or timezone) as a\\n\\n // JavaScript `Date` with a timezone of `Z`. So we need to fix it.\\n\\n BqNonArrayDataType::Date => {\\n\\n write!(f, \\\"{}.toISOString().split('T')[0]\\\", input_expr)?;\\n\",\n \"file_path\": \"dbcrossbarlib/src/drivers/bigquery_shared/export_udf.rs\",\n \"rank\": 30,\n \"score\": 155675.60464833028\n },\n {\n \"content\": \"/// Write a JavaScript expression that will transform `input_expr` into a value\\n\\n/// of type `output_type`. Only applies to non-array types.\\n\\nfn write_non_array_transform_expr(\\n\\n input_expr: &str,\\n\\n output_type: &BqNonArrayDataType,\\n\\n indent: IndentLevel,\\n\\n f: &mut dyn Write,\\n\\n) -> Result<()> {\\n\\n match output_type {\\n\\n // These types can be directly converted to JSON.\\n\\n //\\n\\n // TODO: Check min and max `INT64` values, because need to be\\n\\n // represented as JSON strings, not JSON numbers.\\n\\n BqNonArrayDataType::Bool\\n\\n | BqNonArrayDataType::Float64\\n\\n | BqNonArrayDataType::Int64\\n\\n | BqNonArrayDataType::Numeric\\n\\n | BqNonArrayDataType::String => {\\n\\n write!(f, \\\"{}\\\", input_expr)?;\\n\\n }\\n\\n\\n\\n // These types all need to go through `Date`, even when they\\n\",\n \"file_path\": \"dbcrossbarlib/src/drivers/bigquery_shared/import_udf.rs\",\n \"rank\": 31,\n \"score\": 155671.36254987077\n },\n {\n \"content\": \"fn run() -> Result<()> {\\n\\n // Set up standard Rust logging for third-party crates.\\n\\n env_logger::init();\\n\\n\\n\\n // Find our system SSL configuration, even if we're statically linked.\\n\\n openssl_probe::init_ssl_cert_env_vars();\\n\\n\\n\\n // Parse our command-line arguments.\\n\\n let opt = cmd::Opt::from_args();\\n\\n\\n\\n // Set up `slog`-based structured logging for our async code, because we\\n\\n // need to be able to untangle very complicated logs from many parallel\\n\\n // async tasks.\\n\\n let base_drain = opt.log_format.create_drain();\\n\\n let filtered = slog_envlogger::new(base_drain);\\n\\n let drain = slog_async::Async::new(filtered)\\n\\n .chan_size(64)\\n\\n // This may slow down application performance, even when `RUST_LOG` is\\n\\n // not set. But we've been seeing a lot of dropped messages lately, so\\n\\n // let's try it.\\n\",\n \"file_path\": \"dbcrossbar/src/main.rs\",\n \"rank\": 32,\n \"score\": 153009.39190820363\n },\n {\n \"content\": \"/// Given a stream of streams CSV data, return another stream of CSV streams\\n\\n/// where the CSV data is approximately `chunk_size` long whenever possible.\\n\\npub fn rechunk_csvs(\\n\\n ctx: Context,\\n\\n chunk_size: usize,\\n\\n streams: BoxStream<CsvStream>,\\n\\n) -> Result<BoxStream<CsvStream>> {\\n\\n // Convert out input `BoxStream<CsvStream>` into a single, concatenated\\n\\n // synchronous `Read` object.\\n\\n let ctx = ctx.child(o!(\\\"streams_transform\\\" => \\\"rechunk_csvs\\\"));\\n\\n let input_csv_stream = concatenate_csv_streams(ctx.clone(), streams)?;\\n\\n let csv_rdr = SyncStreamReader::new(ctx.clone(), input_csv_stream.data);\\n\\n\\n\\n // Create a channel to which we can write `CsvStream` values once we've\\n\\n // created them.\\n\\n let (mut csv_stream_sender, csv_stream_receiver) =\\n\\n mpsc::channel::<Result<CsvStream>>(1);\\n\\n\\n\\n // Run a synchronous background worker thread that parsers our sync CSV\\n\\n // `Read`er into a stream of `CsvStream`s.\\n\\n let worker_ctx = ctx.clone();\\n\\n let worker_fut = spawn_blocking(move || -> Result<()> {\\n\",\n \"file_path\": \"dbcrossbarlib/src/rechunk.rs\",\n \"rank\": 33,\n \"score\": 151720.23971467206\n },\n {\n \"content\": \"/// Write a JSON row to a CSV document.\\n\\nfn write_row<W: Write>(\\n\\n wtr: &mut csv::Writer<W>,\\n\\n schema: &Table,\\n\\n row: Value,\\n\\n buffer: &mut Vec<u8>,\\n\\n) -> Result<()> {\\n\\n // Convert our row to a JSON object.\\n\\n let obj = match row {\\n\\n Value::Object(obj) => obj,\\n\\n value => return Err(format_err!(\\\"expected JSON object, found {:?}\\\", value)),\\n\\n };\\n\\n\\n\\n // Look up each column and output it.\\n\\n for col in &schema.columns {\\n\\n let value = obj.get(&col.name).unwrap_or(&Value::Null);\\n\\n buffer.clear();\\n\\n write_json_value(buffer, &col.data_type, &value)?;\\n\\n if !col.is_nullable && buffer.is_empty() {\\n\\n return Err(format_err!(\\n\\n \\\"unexpected NULL value in column {:?}\\\",\\n\",\n \"file_path\": \"dbcrossbarlib/src/drivers/shopify/json_to_csv.rs\",\n \"rank\": 34,\n \"score\": 151311.76802570833\n },\n {\n \"content\": \"/// A `Write` implementation that keeps track of how much data has been written\\n\\n/// so far. Note that if you wrap this in a buffered type like `csv::Writer`, it\\n\\n/// won't keep track of the data in `csv::Writer`'s buffer, only the data that\\n\\n/// has been flushed.\\n\\nstruct CountingWriter<W: Write> {\\n\\n /// Our writer.\\n\\n inner: W,\\n\\n /// The total data that we've written. This is wrapped in `Rc<Cell<_>>` so\\n\\n /// that is can be easily accessed from anywhere in the same thread even if\\n\\n /// the `CountingWriter` is completely owned by another type such as\\n\\n /// `csv::Writer`.\\n\\n total_written: Rc<Cell<usize>>,\\n\\n}\\n\\n\\n\\nimpl<W: Write> CountingWriter<W> {\\n\\n /// Create a new `CountingWriter` that wraps `inner`.\\n\\n fn new(inner: W) -> Self {\\n\\n Self {\\n\\n inner,\\n\\n total_written: Rc::new(Cell::new(0)),\\n\\n }\\n\\n }\\n\\n\\n\\n /// How much data has been written? This returns an `Rc<Cell<_>>` that will\\n\",\n \"file_path\": \"dbcrossbarlib/src/rechunk.rs\",\n \"rank\": 35,\n \"score\": 150228.18827178952\n },\n {\n \"content\": \"/// Extra `Locator` methods that can only be called statically. These cannot\\n\\n/// accessed via a `Box<Locator>`.\\n\\npub trait LocatorStatic: Locator + Clone + FromStr<Err = Error> + Sized {\\n\\n /// Convert this locator into a polymorphic `BoxLocator` on the heap.\\n\\n fn boxed(self) -> BoxLocator {\\n\\n Box::new(self)\\n\\n }\\n\\n\\n\\n /// Return the \\\"scheme\\\" used to format this locator, e.g., `\\\"postgres:\\\"`.\\n\\n fn scheme() -> &'static str;\\n\\n\\n\\n /// Return a mask of `LocatorFeatures` supported by this `Locator` type.\\n\\n fn features() -> Features;\\n\\n\\n\\n /// Is this driver unstable?\\n\\n fn is_unstable() -> bool {\\n\\n false\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"dbcrossbarlib/src/locator.rs\",\n \"rank\": 36,\n \"score\": 148884.95305569714\n },\n {\n \"content\": \"/// Create a new `tokio` runtime and use it to run `cmd_future` (which carries\\n\\n/// out whatever task we want to perform), and `worker_future` (which should\\n\\n/// have been created by `Context::create` or `Context::create_for_test`).\\n\\n///\\n\\n/// Return when at least one future has failed, or both futures have completed\\n\\n/// successfully.\\n\\n///\\n\\n/// This can be safely used from within a test, but it may only be called from a\\n\\n/// synchronous context.\\n\\n///\\n\\n/// If this hangs, make sure all `Context` values are getting dropped once the\\n\\n/// work is done.\\n\\npub fn run_futures_with_runtime(\\n\\n cmd_future: BoxFuture<()>,\\n\\n worker_future: BoxFuture<()>,\\n\\n) -> Result<()> {\\n\\n // Wait for both `cmd_fut` and `copy_fut` to finish, but bail out as soon\\n\\n // as either returns an error. This involves some pretty deep `tokio` magic:\\n\\n // If a background worker fails, then `copy_fut` will be automatically\\n\\n // dropped, or vice vera.\\n\\n let combined_fut = async move {\\n\\n try_join!(cmd_future, worker_future)?;\\n\\n let result: Result<()> = Ok(());\\n\\n result\\n\\n };\\n\\n\\n\\n // Pass `combined_fut` to our `tokio` runtime, and wait for it to finish.\\n\\n let mut runtime =\\n\\n tokio::runtime::Runtime::new().expect(\\\"Unable to create a runtime\\\");\\n\\n runtime.block_on(combined_fut.boxed())?;\\n\\n Ok(())\\n\\n}\\n\",\n \"file_path\": \"dbcrossbarlib/src/tokio_glue.rs\",\n \"rank\": 37,\n \"score\": 148731.7608172574\n },\n {\n \"content\": \"#[async_trait]\\n\\ntrait CredentialsSource: fmt::Debug + fmt::Display + Send + Sync + 'static {\\n\\n /// Look up an appropriate set of credentials.\\n\\n async fn get_credentials(&self) -> Result<Option<Credentials>>;\\n\\n}\\n\\n\\n\",\n \"file_path\": \"dbcrossbarlib/src/credentials.rs\",\n \"rank\": 38,\n \"score\": 148213.27407872424\n },\n {\n \"content\": \"/// Interface to a locator driver. This exists because we Rust can't treat\\n\\n/// classes as objects, the way Ruby can. Instead, what we do is take classes\\n\\n/// that implement [`LocatorStatic`] and wrap them up in objects that implement\\n\\n/// the `LocatorDriver` interface.\\n\\npub trait LocatorDriver: Send + Sync + 'static {\\n\\n /// Return the \\\"scheme\\\" used to format this locator, e.g., `\\\"postgres:\\\"`.\\n\\n fn scheme(&self) -> &str;\\n\\n\\n\\n /// The name of this driver. The same as [`LocatorDriver::schema`], but\\n\\n /// without the trailing `:`.\\n\\n fn name(&self) -> &str {\\n\\n let scheme = self.scheme();\\n\\n assert!(scheme.ends_with(':'));\\n\\n &scheme[..scheme.len() - 1]\\n\\n }\\n\\n\\n\\n /// The features supported by this driver.\\n\\n fn features(&self) -> Features;\\n\\n\\n\\n /// Is this driver unstable?\\n\\n fn is_unstable(&self) -> bool;\\n\\n\\n\\n /// Parse a locator string and return a [`BoxLocator`].\\n\\n fn parse(&self, s: &str) -> Result<BoxLocator>;\\n\",\n \"file_path\": \"dbcrossbarlib/src/locator.rs\",\n \"rank\": 39,\n \"score\": 140596.53763556026\n },\n {\n \"content\": \"/// Interpret a JSON value as `data_type` and write it out as a `BINARY` value.\\n\\nfn json_to_binary<W: Write>(\\n\\n wtr: &mut W,\\n\\n data_type: &PgScalarDataType,\\n\\n json: &Value,\\n\\n) -> Result<()> {\\n\\n match data_type {\\n\\n PgScalarDataType::Boolean => write_json_as_binary::<bool, W>(wtr, json),\\n\\n PgScalarDataType::Date => write_json_as_binary::<NaiveDate, W>(wtr, json),\\n\\n PgScalarDataType::Numeric => Err(format_err!(\\n\\n \\\"cannot use `numeric` arrays with PostgreSQL yet\\\",\\n\\n )),\\n\\n PgScalarDataType::Real => write_json_as_binary::<f32, W>(wtr, json),\\n\\n PgScalarDataType::DoublePrecision => write_json_as_binary::<f64, W>(wtr, json),\\n\\n PgScalarDataType::Geometry(srid) => {\\n\\n let geometry = Geometry::<f64>::from_json_value(json)?;\\n\\n let value = GeometryWithSrid {\\n\\n geometry: &geometry,\\n\\n srid: *srid,\\n\\n };\\n\\n value.write_binary(wtr)\\n\",\n \"file_path\": \"dbcrossbarlib/src/drivers/postgres/csv_to_binary/mod.rs\",\n \"rank\": 40,\n \"score\": 139976.69362027606\n },\n {\n \"content\": \"#[test]\\n\\nfn handles_magic_types() -> Result<(), main_error::MainError> {\\n\\n let input = r#\\\"\\n\",\n \"file_path\": \"dbcrossbarlib/src/drivers/dbcrossbar_ts/ast.rs\",\n \"rank\": 41,\n \"score\": 132544.79441469087\n },\n {\n \"content\": \"#[test]\\n\\nfn parses_shopify_schema() -> Result<(), main_error::MainError> {\\n\\n let file_string = include_str!(\\\"../../../../dbcrossbar/fixtures/shopify.ts\\\");\\n\\n let source_file =\\n\\n SourceFile::parse(\\\"shopify.ts\\\".to_owned(), file_string.to_owned())?;\\n\\n for def in &[\\\"Order\\\"] {\\n\\n source_file.definition_to_table(def)?;\\n\\n }\\n\\n Ok(())\\n\\n}\\n\",\n \"file_path\": \"dbcrossbarlib/src/drivers/dbcrossbar_ts/ast.rs\",\n \"rank\": 42,\n \"score\": 132544.79441469087\n },\n {\n \"content\": \"DELETE FROM {temp_table}\\n\\nUSING {dest_table}\\n\\nWHERE {keys_match}\\\",\\n\\n dest_table = dest_table_name,\\n\\n temp_table = temp_table_name,\\n\\n keys_match = keys_match,\\n\\n ),\\n\\n format!(\\n\\n r\\\"-- Insert new rows into dest table.\\n\\nINSERT INTO {dest_table} ({all_columns}) (\\n\\n SELECT {all_columns}\\n\\n FROM {temp_table}\\n\\n)\\\",\\n\\n dest_table = dest_table_name,\\n\\n temp_table = temp_table_name,\\n\\n all_columns = dest_table.columns.iter().map(|c| Ident(&c.name)).join(\\\", \\\"),\\n\\n ),\\n\\n format!(r\\\"DROP TABLE {temp_table}\\\", temp_table = temp_table_name),\\n\\n ])\\n\\n}\\n\\n\\n\",\n \"file_path\": \"dbcrossbarlib/src/drivers/redshift/write_remote_data.rs\",\n \"rank\": 43,\n \"score\": 131947.88989853775\n },\n {\n \"content\": \"/// Given an S3 URL, get the URL for just the bucket itself.\\n\\nfn bucket_url(url: &Url) -> Result<Url> {\\n\\n let bucket = url\\n\\n .host()\\n\\n .ok_or_else(|| format_err!(\\\"could not find bucket name in {}\\\", url))?;\\n\\n let bucket_url = format!(\\\"s3://{}/\\\", bucket)\\n\\n .parse::<Url>()\\n\\n .context(\\\"could not parse S3 URL\\\")?;\\n\\n Ok(bucket_url)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"dbcrossbarlib/src/clouds/aws/s3/ls.rs\",\n \"rank\": 44,\n \"score\": 131797.22688635628\n },\n {\n \"content\": \"#[derive(Debug)]\\n\\nstruct EnvMapping {\\n\\n key: &'static str,\\n\\n var: &'static str,\\n\\n optional: bool,\\n\\n}\\n\\n\\n\\nimpl EnvMapping {\\n\\n /// Fetch the value of `key` from `var`.\\n\\n fn required(key: &'static str, var: &'static str) -> Self {\\n\\n Self {\\n\\n key,\\n\\n var,\\n\\n optional: false,\\n\\n }\\n\\n }\\n\\n\\n\\n /// Fetch the value of `key` from `var`, if present.\\n\\n fn optional(key: &'static str, var: &'static str) -> Self {\\n\\n Self {\\n\\n key,\\n\",\n \"file_path\": \"dbcrossbarlib/src/credentials.rs\",\n \"rank\": 45,\n \"score\": 129101.31453822306\n },\n {\n \"content\": \"#[derive(Debug)]\\n\\nstruct EnvCredentialsSource {\\n\\n mapping: Vec<EnvMapping>,\\n\\n}\\n\\n\\n\\nimpl EnvCredentialsSource {\\n\\n /// Create a new `EnvCredentialsSource`.\\n\\n ///\\n\\n /// `mapping` should contain at least one element. The first element must\\n\\n /// not be `optional`.\\n\\n fn new(mapping: Vec<EnvMapping>) -> Self {\\n\\n // Check our preconditions with assertions, since all callers will be\\n\\n // hard-coded in the source.\\n\\n assert!(!mapping.is_empty());\\n\\n assert!(!mapping[0].optional);\\n\\n Self { mapping }\\n\\n }\\n\\n}\\n\\n\\n\\nimpl fmt::Display for EnvCredentialsSource {\\n\\n fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {\\n\",\n \"file_path\": \"dbcrossbarlib/src/credentials.rs\",\n \"rank\": 46,\n \"score\": 127513.31167994003\n },\n {\n \"content\": \"#[derive(Debug)]\\n\\nstruct FileCredentialsSource {\\n\\n key: &'static str,\\n\\n path: PathBuf,\\n\\n}\\n\\n\\n\\nimpl FileCredentialsSource {\\n\\n /// Specify how to find credentials in a file. The contents of the file will\\n\\n /// be mapped to `key` in the credential.\\n\\n fn new(key: &'static str, path: PathBuf) -> Self {\\n\\n Self { key, path }\\n\\n }\\n\\n}\\n\\n\\n\\nimpl fmt::Display for FileCredentialsSource {\\n\\n fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {\\n\\n writeln!(f, \\\"- The file {}\\\", self.path.display())\\n\\n }\\n\\n}\\n\\n\\n\\n#[async_trait]\\n\",\n \"file_path\": \"dbcrossbarlib/src/credentials.rs\",\n \"rank\": 47,\n \"score\": 127396.80840640047\n },\n {\n \"content\": \"#[derive(Debug, Deserialize)]\\n\\nstruct Value {\\n\\n /// The actual value. This is normally represented as a string.\\n\\n ///\\n\\n /// This might also be a nested `Row` object, but we don't handle that yet.\\n\\n #[serde(rename = \\\"v\\\")]\\n\\n value: serde_json::Value,\\n\\n}\\n\\n\\n\\nimpl Value {\\n\\n /// Convert this value into a JSON value.\\n\\n fn to_json_value(&self, _ctx: &Context) -> Result<serde_json::Value> {\\n\\n Ok(self.value.clone())\\n\\n }\\n\\n}\\n\\n\\n\\n/// Run a query that should return a small number of records, and return them as\\n\\n/// a JSON string.\\n\\nasync fn query_all_json(\\n\\n ctx: &Context,\\n\\n project: &str,\\n\",\n \"file_path\": \"dbcrossbarlib/src/clouds/gcloud/bigquery/queries.rs\",\n \"rank\": 48,\n \"score\": 125923.14504642788\n },\n {\n \"content\": \"/// A polymorphic log drain (which means we need to use `Box<dyn ...>`,\\n\\n/// because that's how Rust does runtime polymorphism).\\n\\ntype BoxDrain = Box<dyn Drain<Ok = (), Err = Never> + Send + 'static>;\\n\\n\\n\\n/// What log format we should use.\\n\\n#[derive(Debug, Copy, Clone, Eq, PartialEq)]\\n\\npub(crate) enum LogFormat {\\n\\n /// Pretty, indented logs.\\n\\n Indented,\\n\\n /// Single-line log entries with all keys on each line.\\n\\n Flat,\\n\\n /// JSON records.\\n\\n Json,\\n\\n}\\n\\n\\n\\nimpl LogFormat {\\n\\n /// Create an appropriate `Drain` for this log format.\\n\\n pub(crate) fn create_drain(self) -> BoxDrain {\\n\\n match self {\\n\\n Self::Indented => {\\n\\n let decorator = slog_term::TermDecorator::new().stderr().build();\\n\\n Box::new(slog_term::CompactFormat::new(decorator).build().fuse())\\n\",\n \"file_path\": \"dbcrossbar/src/logging.rs\",\n \"rank\": 49,\n \"score\": 124999.40760604112\n },\n {\n \"content\": \"#[derive(Debug, Deserialize)]\\n\\n#[serde(rename_all = \\\"camelCase\\\")]\\n\\nstruct QueryResults {\\n\\n /// The schema of our query results.\\n\\n schema: TableSchema,\\n\\n\\n\\n /// Rows returned from the query.\\n\\n rows: Vec<Row>,\\n\\n\\n\\n /// Has this query completed?\\n\\n job_complete: bool,\\n\\n}\\n\\n\\n\\nimpl QueryResults {\\n\\n fn to_json_objects(&self, ctx: &Context) -> Result<Vec<serde_json::Value>> {\\n\\n let objects = self\\n\\n .rows\\n\\n .iter()\\n\\n .map(|row| row.to_json_object(ctx, &self.schema.fields))\\n\\n .collect::<Result<Vec<serde_json::Value>>>()?;\\n\\n trace!(\\n\\n ctx.log(),\\n\\n \\\"rows as objects: {}\\\",\\n\\n serde_json::to_string(&objects).expect(\\\"should be able to serialize rows\\\"),\\n\\n );\\n\\n Ok(objects)\\n\\n }\\n\\n}\\n\\n\\n\\n/// A row returned in `QueryResults`.\\n\",\n \"file_path\": \"dbcrossbarlib/src/clouds/gcloud/bigquery/queries.rs\",\n \"rank\": 50,\n \"score\": 124390.79418305974\n },\n {\n \"content\": \"#[derive(Clone, Copy, Debug, Eq, PartialEq)]\\n\\nstruct CallLimit {\\n\\n /// How much of our call limit have we used?\\n\\n used: u32,\\n\\n /// How much is remaining?\\n\\n limit: u32,\\n\\n}\\n\\n\\n\\nimpl CallLimit {\\n\\n /// Are we close enough to our call limit that we should chill out a bit?\\n\\n fn should_wait(self) -> bool {\\n\\n self.used.saturating_mul(2) >= self.limit\\n\\n }\\n\\n}\\n\\n\\n\\nimpl FromStr for CallLimit {\\n\\n type Err = Error;\\n\\n\\n\\n fn from_str(s: &str) -> Result<Self, Self::Err> {\\n\\n if let Some(split_pos) = s.find('/') {\\n\\n let used = s[..split_pos]\\n\",\n \"file_path\": \"dbcrossbarlib/src/drivers/shopify/local_data.rs\",\n \"rank\": 51,\n \"score\": 123537.5059197968\n },\n {\n \"content\": \"#[derive(Debug)]\\n\\nstruct ShopifyResponse {\\n\\n /// How much of our API have we used?\\n\\n call_limit: CallLimit,\\n\\n\\n\\n /// The URL of the next page of data.\\n\\n next_page_url: Option<Url>,\\n\\n\\n\\n /// Individual data rows.\\n\\n rows: Vec<Value>,\\n\\n}\\n\\n\\n\\n/// A Shopify \\\"call limit\\\", specifying how much of our API quota we've used.\\n\",\n \"file_path\": \"dbcrossbarlib/src/drivers/shopify/local_data.rs\",\n \"rank\": 52,\n \"score\": 123537.5059197968\n },\n {\n \"content\": \"#[derive(Debug, Serialize)]\\n\\n#[serde(rename_all = \\\"camelCase\\\")]\\n\\nstruct QueryResultsQuery {\\n\\n /// Geographic location. Mandatory outside of US and Europe.\\n\\n location: String,\\n\\n}\\n\\n\\n\\n/// Results of a query.\\n\",\n \"file_path\": \"dbcrossbarlib/src/clouds/gcloud/bigquery/queries.rs\",\n \"rank\": 53,\n \"score\": 122953.8313537859\n },\n {\n \"content\": \"#[derive(Debug)]\\n\\nstruct ChunkRanges {\\n\\n /// The size of chunk we want to return.\\n\\n chunk_size: u64,\\n\\n /// The total length of our file.\\n\\n len: u64,\\n\\n /// The place to start our next range.\\n\\n next_start: u64,\\n\\n}\\n\\n\\n\\nimpl Iterator for ChunkRanges {\\n\\n type Item = ops::Range<u64>;\\n\\n\\n\\n fn next(&mut self) -> Option<Self::Item> {\\n\\n if self.next_start < self.len {\\n\\n let end = min(self.next_start + self.chunk_size, self.len);\\n\\n let range = self.next_start..end;\\n\\n self.next_start = end;\\n\\n Some(range)\\n\\n } else {\\n\\n None\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"dbcrossbarlib/src/clouds/gcloud/storage/download_file.rs\",\n \"rank\": 54,\n \"score\": 122942.15705326418\n },\n {\n \"content\": \"#[derive(Debug, Serialize)]\\n\\n#[serde(rename_all = \\\"camelCase\\\")]\\n\\nstruct UploadQuery {\\n\\n /// The type of the upload we're performing.\\n\\n upload_type: &'static str,\\n\\n\\n\\n /// Only accept the upload if the existing object has the specified\\n\\n /// generation number. Use 0 to specify a non-existant object.\\n\\n if_generation_match: i64,\\n\\n\\n\\n /// The name of the object we're creating.\\n\\n name: String,\\n\\n}\\n\\n\\n\\n/// Upload `data` as a file at `url`.\\n\\n///\\n\\n/// Docs: https://cloud.google.com/storage/docs/json_api/v1/objects/insert\\n\\n///\\n\\n/// TODO: Support https://cloud.google.com/storage/docs/performing-resumable-uploads.\\n\\npub(crate) async fn upload_file<'a>(\\n\\n ctx: &'a Context,\\n\\n data: BoxStream<BytesMut>,\\n\",\n \"file_path\": \"dbcrossbarlib/src/clouds/gcloud/storage/upload_file.rs\",\n \"rank\": 55,\n \"score\": 122942.15705326418\n },\n {\n \"content\": \"#[derive(Debug, Serialize)]\\n\\n#[serde(rename_all = \\\"camelCase\\\")]\\n\\nstruct DownloadQuery {\\n\\n /// What format should we return?\\n\\n alt: Alt,\\n\\n\\n\\n /// What object generation do we expect to download?\\n\\n if_generation_match: i64,\\n\\n}\\n\\n\\n\\n/// Download the file at the specified URL as a stream.\\n\\npub(crate) async fn download_file(\\n\\n ctx: &Context,\\n\\n item: &StorageObject,\\n\\n) -> Result<BoxStream<BytesMut>> {\\n\\n let file_url = item.to_url_string().parse::<Url>()?;\\n\\n debug!(ctx.log(), \\\"streaming from {}\\\", file_url);\\n\\n let (bucket, object) = parse_gs_url(&file_url)?;\\n\\n\\n\\n // Build our URL & common headers.\\n\\n let url = format!(\\n\\n \\\"https://storage.googleapis.com/storage/v1/b/{}/o/{}\\\",\\n\",\n \"file_path\": \"dbcrossbarlib/src/clouds/gcloud/storage/download_file.rs\",\n \"rank\": 56,\n \"score\": 122942.15705326418\n },\n {\n \"content\": \"#[test]\\n\\nfn must_have_upsert_keys() {\\n\\n assert!(\\\"upsert-on:\\\".parse::<IfExists>().is_err());\\n\\n}\\n\",\n \"file_path\": \"dbcrossbarlib/src/if_exists.rs\",\n \"rank\": 57,\n \"score\": 122166.34010023126\n },\n {\n \"content\": \"#[test]\\n\\nfn random_tag() {\\n\\n assert_eq!(TemporaryStorage::random_tag().len(), 10);\\n\\n}\\n\",\n \"file_path\": \"dbcrossbarlib/src/temporary_storage.rs\",\n \"rank\": 58,\n \"score\": 122135.35303314697\n },\n {\n \"content\": \"#[test]\\n\\nfn data_type_roundtrip() {\\n\\n let data_types = vec![\\n\\n DataType::Array(Box::new(DataType::Text)),\\n\\n DataType::Bool,\\n\\n DataType::Date,\\n\\n DataType::Decimal,\\n\\n DataType::Float32,\\n\\n DataType::Float64,\\n\\n DataType::Int16,\\n\\n DataType::Int32,\\n\\n DataType::Int64,\\n\\n DataType::Json,\\n\\n DataType::Struct(vec![StructField {\\n\\n name: \\\"x\\\".to_owned(),\\n\\n is_nullable: false,\\n\\n data_type: DataType::Float32,\\n\\n }]),\\n\\n DataType::Text,\\n\\n DataType::TimestampWithoutTimeZone,\\n\\n DataType::TimestampWithTimeZone,\\n\",\n \"file_path\": \"dbcrossbarlib/src/schema.rs\",\n \"rank\": 59,\n \"score\": 121180.23704572642\n },\n {\n \"content\": \"#[test]\\n\\nfn data_type_serialization_examples() {\\n\\n // Our serialization format is an external format, so let's write some tests\\n\\n // to make sure we don't change it accidentally.\\n\\n let examples = &[\\n\\n (\\n\\n DataType::Array(Box::new(DataType::Text)),\\n\\n json!({\\\"array\\\":\\\"text\\\"}),\\n\\n ),\\n\\n (DataType::Bool, json!(\\\"bool\\\")),\\n\\n (DataType::Date, json!(\\\"date\\\")),\\n\\n (DataType::Decimal, json!(\\\"decimal\\\")),\\n\\n (DataType::Float32, json!(\\\"float32\\\")),\\n\\n (DataType::Float64, json!(\\\"float64\\\")),\\n\\n (DataType::Int16, json!(\\\"int16\\\")),\\n\\n (DataType::Int32, json!(\\\"int32\\\")),\\n\\n (DataType::Int64, json!(\\\"int64\\\")),\\n\\n (DataType::Json, json!(\\\"json\\\")),\\n\\n (\\n\\n DataType::Struct(vec![StructField {\\n\\n name: \\\"x\\\".to_owned(),\\n\",\n \"file_path\": \"dbcrossbarlib/src/schema.rs\",\n \"rank\": 60,\n \"score\": 119672.37532169785\n },\n {\n \"content\": \"#[test]\\n\\nfn to_json_handles_nested_keys() {\\n\\n use serde_json::json;\\n\\n let raw_args = &[\\\"a=b\\\", \\\"c.d=x\\\", \\\"c.e[]=y\\\", \\\"c[e][]=z\\\"];\\n\\n let args = DriverArguments::from_cli_args(raw_args).unwrap();\\n\\n assert_eq!(\\n\\n args.to_json().unwrap(),\\n\\n json!({\\\"a\\\": \\\"b\\\", \\\"c\\\": { \\\"d\\\": \\\"x\\\", \\\"e\\\": [\\\"y\\\", \\\"z\\\"] } }),\\n\\n );\\n\\n}\\n\\n\\n\",\n \"file_path\": \"dbcrossbarlib/src/driver_args.rs\",\n \"rank\": 61,\n \"score\": 119167.52157809134\n },\n {\n \"content\": \"#[test]\\n\\nfn from_str_parses_schemas() {\\n\\n let examples = &[\\n\\n (\\\"postgres://user:pass@host/db#table\\\", \\\"table\\\"),\\n\\n (\\\"postgres://user:pass@host/db#public.table\\\", \\\"public.table\\\"),\\n\\n (\\n\\n \\\"postgres://user:pass@host/db#testme1.table\\\",\\n\\n \\\"testme1.table\\\",\\n\\n ),\\n\\n ];\\n\\n for &(url, table_name) in examples {\\n\\n assert_eq!(\\n\\n PostgresLocator::from_str(url).unwrap().table_name,\\n\\n table_name.parse::<TableName>().unwrap(),\\n\\n );\\n\\n }\\n\\n}\\n\\n\\n\\nimpl Locator for PostgresLocator {\\n\\n fn as_any(&self) -> &dyn Any {\\n\\n self\\n\",\n \"file_path\": \"dbcrossbarlib/src/drivers/postgres/mod.rs\",\n \"rank\": 62,\n \"score\": 119108.04265761728\n },\n {\n \"content\": \"#[test]\\n\\n#[ignore]\\n\\nfn bigquery_roundtrips_structs() {\\n\\n let _ = env_logger::try_init();\\n\\n let testdir = TestDir::new(\\\"dbcrossbar\\\", \\\"bigquery_roundtrips_structs\\\");\\n\\n let raw_src_path = testdir.src_path(\\\"fixtures/structs/struct.json\\\");\\n\\n let src = testdir.path(\\\"structs.csv\\\");\\n\\n let raw_data_type_path =\\n\\n testdir.src_path(\\\"fixtures/structs/struct-data-type.json\\\");\\n\\n let schema = testdir.path(\\\"structs-schema.json\\\");\\n\\n let bq_temp_ds = bq_temp_dataset();\\n\\n let gs_temp_dir = gs_test_dir_url(\\\"bigquery_roundtrips_structs\\\");\\n\\n let bq_table = bq_test_table(\\\"bigquery_roundtrips_structs\\\");\\n\\n\\n\\n // Use our example JSON to create a CSV file with two columns: One\\n\\n // containing our struct, and the other containing a single-element array\\n\\n // containing our struct.\\n\\n let raw_src = fs::read_to_string(&raw_src_path).unwrap();\\n\\n let src_data = format!(\\n\\n r#\\\"struct,structs\\n\\n\\\"{escaped}\\\",\\\"[{escaped}]\\\"\\n\\n\\\"#,\\n\",\n \"file_path\": \"dbcrossbar/tests/cli/cp/bigquery.rs\",\n \"rank\": 63,\n \"score\": 119048.85403284949\n },\n {\n \"content\": \"/// Construct a URL from something we can convert to URL, and something that we\\n\\n/// can serialize as a query string.\\n\\nfn build_url<U, Query>(url: U, query: Query) -> Result<Url>\\n\\nwhere\\n\\n U: IntoUrl,\\n\\n Query: fmt::Debug + Serialize,\\n\\n{\\n\\n let mut url = url.into_url().context(\\\"could not parse URL\\\")?;\\n\\n let query_str = serde_urlencoded::to_string(&query)?;\\n\\n if !query_str.is_empty() {\\n\\n url.set_query(Some(&query_str));\\n\\n }\\n\\n Ok(url)\\n\\n}\\n\\n\\n\\n/// A Google Cloud error response.\\n\",\n \"file_path\": \"dbcrossbarlib/src/clouds/gcloud/client.rs\",\n \"rank\": 64,\n \"score\": 118482.07542254198\n },\n {\n \"content\": \"#[test]\\n\\nfn crc32c_matches_gcloud() {\\n\\n // Check that `data` hashes to `expected`.\\n\\n let check = |data: &[u8], expected: u32| {\\n\\n let mut hasher = Hasher::new();\\n\\n hasher.update(data);\\n\\n assert_eq!(hasher.finish(), expected);\\n\\n };\\n\\n\\n\\n // These test cases are from https://tools.ietf.org/html/rfc3720#page-217\\n\\n // and https://github.com/google/crc32c/blob/master/src/crc32c_unittest.cc\\n\\n check(&[0u8; 32], 0x8a91_36aa);\\n\\n check(&[0xff; 32], 0x62a8_ab43);\\n\\n let mut buf = [0u8; 32];\\n\\n for i in 0u8..=31 {\\n\\n buf[usize::from(i)] = i;\\n\\n }\\n\\n check(&buf, 0x46dd_794e);\\n\\n for i in 0u8..=31 {\\n\\n buf[usize::from(i)] = 31 - i;\\n\\n }\\n\",\n \"file_path\": \"dbcrossbarlib/src/clouds/gcloud/crc32c_stream.rs\",\n \"rank\": 65,\n \"score\": 117746.31734392996\n },\n {\n \"content\": \"/// Convert a JSON-syntax array (possibly nested) into a `BINARY` array.\\n\\nfn array_to_binary(\\n\\n wtr: &mut BufferedWriter,\\n\\n dimension_count: i32,\\n\\n data_type: &PgScalarDataType,\\n\\n cell: &str,\\n\\n) -> Result<()> {\\n\\n // TODO: For now, we can only handle single-dimensional arrays like\\n\\n // `[1,2,3]`. Multidimensional arrays would require us to figure out things\\n\\n // like `[[1,2], [3]]` and what order to serialize nested elements in.\\n\\n if dimension_count != 1 {\\n\\n return Err(format_err!(\\n\\n \\\"arrays with {} dimensions cannot yet be written to PostgreSQL\\\",\\n\\n dimension_count,\\n\\n ));\\n\\n }\\n\\n\\n\\n // Parse our cell into a JSON value.\\n\\n let json = serde_json::from_str(cell).context(\\\"cannot parse JSON\\\")?;\\n\\n let json_array = match json {\\n\\n Value::Array(json_array) => json_array,\\n\",\n \"file_path\": \"dbcrossbarlib/src/drivers/postgres/csv_to_binary/mod.rs\",\n \"rank\": 66,\n \"score\": 117721.94354576748\n },\n {\n \"content\": \"/// Choose an appropriate `DataType`.\\n\\nfn pg_data_type(\\n\\n data_type: &str,\\n\\n _udt_schema: &str,\\n\\n udt_name: &str,\\n\\n) -> Result<PgDataType> {\\n\\n if data_type == \\\"ARRAY\\\" {\\n\\n // Array element types have their own naming convention, which appears\\n\\n // to be \\\"_\\\" followed by the internal udt_name version of PostgreSQL's\\n\\n // base types.\\n\\n let element_type = match udt_name {\\n\\n \\\"_bool\\\" => PgScalarDataType::Boolean,\\n\\n \\\"_date\\\" => PgScalarDataType::Date,\\n\\n \\\"_float4\\\" => PgScalarDataType::Real,\\n\\n \\\"_float8\\\" => PgScalarDataType::DoublePrecision,\\n\\n \\\"_int2\\\" => PgScalarDataType::Smallint,\\n\\n \\\"_int4\\\" => PgScalarDataType::Int,\\n\\n \\\"_int8\\\" => PgScalarDataType::Bigint,\\n\\n \\\"_text\\\" => PgScalarDataType::Text,\\n\\n \\\"_timestamp\\\" => PgScalarDataType::TimestampWithoutTimeZone,\\n\\n \\\"_timestamptz\\\" => PgScalarDataType::TimestampWithTimeZone,\\n\",\n \"file_path\": \"dbcrossbarlib/src/drivers/postgres_shared/catalog.rs\",\n \"rank\": 67,\n \"score\": 116805.78950949595\n },\n {\n \"content\": \"#[test]\\n\\nfn scalar_conversions() {\\n\\n let original_ty = DataType::Int32;\\n\\n let pg_ty = PgDataType::from_data_type(&original_ty).unwrap();\\n\\n assert_eq!(pg_ty, PgDataType::Scalar(PgScalarDataType::Int));\\n\\n let portable_ty = pg_ty.to_data_type().unwrap();\\n\\n assert_eq!(portable_ty, original_ty);\\n\\n}\\n\\n\\n\\nimpl fmt::Display for PgDataType {\\n\\n fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {\\n\\n match self {\\n\\n PgDataType::Array {\\n\\n dimension_count,\\n\\n ty,\\n\\n } => {\\n\\n ty.fmt(f)?;\\n\\n for _ in 0..*dimension_count {\\n\\n write!(f, \\\"[]\\\")?;\\n\\n }\\n\\n Ok(())\\n\",\n \"file_path\": \"dbcrossbarlib/src/drivers/postgres_shared/data_type.rs\",\n \"rank\": 68,\n \"score\": 116800.87908338688\n },\n {\n \"content\": \"#[test]\\n\\nfn strips_id_prefix() {\\n\\n use bigml::resource::Dataset;\\n\\n let id = \\\"dataset/abc123\\\".parse::<Id<Dataset>>().unwrap();\\n\\n assert_eq!(strip_id_prefix(&id), \\\"abc123\\\");\\n\\n}\\n\",\n \"file_path\": \"dbcrossbarlib/src/drivers/bigml/local_data.rs\",\n \"rank\": 69,\n \"score\": 116800.87908338688\n },\n {\n \"content\": \"#[test]\\n\\nfn parsing() {\\n\\n use std::convert::TryFrom;\\n\\n use BqDataType as DT;\\n\\n use BqNonArrayDataType as NADT;\\n\\n let examples = [\\n\\n (\\\"BOOL\\\", DT::NonArray(NADT::Bool)),\\n\\n // Not documented, but it exists.\\n\\n (\\\"BOOLEAN\\\", DT::NonArray(NADT::Bool)),\\n\\n (\\\"BYTES\\\", DT::NonArray(NADT::Bytes)),\\n\\n (\\\"DATE\\\", DT::NonArray(NADT::Date)),\\n\\n (\\\"DATETIME\\\", DT::NonArray(NADT::Datetime)),\\n\\n (\\\"FLOAT64\\\", DT::NonArray(NADT::Float64)),\\n\\n (\\\"GEOGRAPHY\\\", DT::NonArray(NADT::Geography)),\\n\\n (\\\"INT64\\\", DT::NonArray(NADT::Int64)),\\n\\n (\\\"NUMERIC\\\", DT::NonArray(NADT::Numeric)),\\n\\n (\\\"STRING\\\", DT::NonArray(NADT::String)),\\n\\n (\\\"TIME\\\", DT::NonArray(NADT::Time)),\\n\\n (\\\"TIMESTAMP\\\", DT::NonArray(NADT::Timestamp)),\\n\\n (\\\"ARRAY<STRING>\\\", DT::Array(NADT::String)),\\n\\n (\\n\",\n \"file_path\": \"dbcrossbarlib/src/drivers/bigquery_shared/data_type/mod.rs\",\n \"rank\": 70,\n \"score\": 116800.87908338688\n },\n {\n \"content\": \"#[test]\\n\\nfn parse_call_limit() {\\n\\n let cl = CallLimit::from_str(\\\"2/10\\\").unwrap();\\n\\n assert_eq!(cl, CallLimit { used: 2, limit: 10 });\\n\\n}\\n\\n\\n\\n/// Shopify wraps all responses in single-item objects, but we don't know the\\n\\n/// field name. So we need a smart deserialization wrapper.\\n\",\n \"file_path\": \"dbcrossbarlib/src/drivers/shopify/local_data.rs\",\n \"rank\": 71,\n \"score\": 116800.87908338688\n },\n {\n \"content\": \"#[test]\\n\\nfn csv_stream_name_handles_directory_inputs() {\\n\\n let expected = &[\\n\\n (\\\"dir/\\\", \\\"dir/file1.csv\\\", \\\"file1\\\"),\\n\\n (\\\"dir\\\", \\\"dir/file1.csv\\\", \\\"file1\\\"),\\n\\n (\\\"dir/\\\", \\\"dir/subdir/file2.csv\\\", \\\"subdir/file2\\\"),\\n\\n (\\n\\n \\\"s3://bucket/dir/\\\",\\n\\n \\\"s3://bucket/dir/subdir/file3.csv\\\",\\n\\n \\\"subdir/file3\\\",\\n\\n ),\\n\\n ];\\n\\n for &(base_path, file_path, stream_name) in expected {\\n\\n assert_eq!(csv_stream_name(base_path, file_path).unwrap(), stream_name);\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"dbcrossbarlib/src/csv_stream.rs\",\n \"rank\": 72,\n \"score\": 116363.32114962838\n },\n {\n \"content\": \"#[test]\\n\\nfn temporary_table_name() {\\n\\n let table_name = \\\"project:dataset.table\\\".parse::<TableName>().unwrap();\\n\\n\\n\\n // Construct a temporary table name without a `--temporary` argument.\\n\\n let default_temp_name = table_name\\n\\n .temporary_table_name(&TemporaryStorage::new(vec![]))\\n\\n .unwrap()\\n\\n .to_string();\\n\\n assert!(default_temp_name.starts_with(\\\"project:dataset.temp_table_\\\"));\\n\\n\\n\\n // Now try it with a `--temporary` argument.\\n\\n let temporary_storage =\\n\\n TemporaryStorage::new(vec![\\\"bigquery:project2:temp\\\".to_owned()]);\\n\\n let temp_name = table_name\\n\\n .temporary_table_name(&temporary_storage)\\n\\n .unwrap()\\n\\n .to_string();\\n\\n assert!(temp_name.starts_with(\\\"project2:temp.temp_table_\\\"));\\n\\n}\\n\\n\\n\",\n \"file_path\": \"dbcrossbarlib/src/drivers/bigquery_shared/table_name.rs\",\n \"rank\": 73,\n \"score\": 116327.88528734157\n },\n {\n \"content\": \"#[test]\\n\\nfn csv_stream_name_handles_file_inputs() {\\n\\n let expected = &[\\n\\n (\\\"/path/to/file1.csv\\\", \\\"file1\\\"),\\n\\n (\\\"file2.csv\\\", \\\"file2\\\"),\\n\\n (\\\"s3://bucket/dir/file3.csv\\\", \\\"file3\\\"),\\n\\n (\\\"gs://bucket/dir/file4.csv\\\", \\\"file4\\\"),\\n\\n ];\\n\\n for &(file_path, stream_name) in expected {\\n\\n assert_eq!(csv_stream_name(file_path, file_path).unwrap(), stream_name);\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"dbcrossbarlib/src/csv_stream.rs\",\n \"rank\": 74,\n \"score\": 116247.73660580194\n },\n {\n \"content\": \"/// Write a JavaScript expression that will transform `input_expr` of\\n\\n/// `intput_type` into a `STRING` containing serialized JSON data.\\n\\nfn write_transform_expr(\\n\\n input_expr: &str,\\n\\n input_type: &BqDataType,\\n\\n indent: IndentLevel,\\n\\n f: &mut dyn Write,\\n\\n) -> Result<()> {\\n\\n // Check to see if anything below this level needs custom handling. This\\n\\n // check potentially requires O((depth of type)^2) to compute, but it\\n\\n // potentially saves us lots of unnecessary work on 300-3000 BigQuery CPUs.\\n\\n if needs_custom_json_export(input_type)?.in_js_code() {\\n\\n // Yup, we need to do this the hard way.\\n\\n match input_type {\\n\\n BqDataType::Array(ty) => {\\n\\n writeln!(\\n\\n f,\\n\\n \\\"({ie}) == null ? null : {ie}.map(function (e) {{\\\",\\n\\n ie = input_expr,\\n\\n )?;\\n\\n write!(f, \\\"{}return \\\", indent.incr())?;\\n\\n write_non_array_transform_expr(\\\"e\\\", ty, indent.incr(), f)?;\\n\",\n \"file_path\": \"dbcrossbarlib/src/drivers/bigquery_shared/export_udf.rs\",\n \"rank\": 75,\n \"score\": 115888.98459092289\n },\n {\n \"content\": \"/// Write a JavaScript expression that will transform `input_expr` into a value\\n\\n/// of type `output_type`.\\n\\nfn write_transform_expr(\\n\\n input_expr: &str,\\n\\n output_type: &BqDataType,\\n\\n indent: IndentLevel,\\n\\n f: &mut dyn Write,\\n\\n) -> Result<()> {\\n\\n match output_type {\\n\\n BqDataType::Array(ty) => {\\n\\n writeln!(\\n\\n f,\\n\\n \\\"({ie} == null) ? null : {ie}.map(function (e) {{\\\",\\n\\n ie = input_expr,\\n\\n )?;\\n\\n write!(f, \\\"{}return \\\", indent.incr())?;\\n\\n write_non_array_transform_expr(\\\"e\\\", ty, indent.incr(), f)?;\\n\\n writeln!(f, \\\";\\\")?;\\n\\n write!(f, \\\"{}}})\\\", indent)?;\\n\\n }\\n\\n BqDataType::NonArray(ty) => {\\n\\n write_non_array_transform_expr(input_expr, ty, indent, f)?;\\n\\n }\\n\\n }\\n\\n Ok(())\\n\\n}\\n\\n\\n\",\n \"file_path\": \"dbcrossbarlib/src/drivers/bigquery_shared/import_udf.rs\",\n \"rank\": 76,\n \"score\": 115884.57593526386\n },\n {\n \"content\": \"#[test]\\n\\nfn parsing_pg_data_type() {\\n\\n let array = |ty| PgDataType::Array {\\n\\n dimension_count: 1,\\n\\n ty,\\n\\n };\\n\\n let examples = &[\\n\\n // Basic types.\\n\\n (\\n\\n (\\\"bigint\\\", \\\"pg_catalog\\\", \\\"int8\\\"),\\n\\n PgDataType::Scalar(PgScalarDataType::Bigint),\\n\\n ),\\n\\n (\\n\\n (\\\"boolean\\\", \\\"pg_catalog\\\", \\\"bool\\\"),\\n\\n PgDataType::Scalar(PgScalarDataType::Boolean),\\n\\n ),\\n\\n (\\n\\n (\\\"character varying\\\", \\\"pg_catalog\\\", \\\"varchar\\\"),\\n\\n PgDataType::Scalar(PgScalarDataType::Text),\\n\\n ),\\n\\n (\\n\",\n \"file_path\": \"dbcrossbarlib/src/drivers/postgres_shared/catalog.rs\",\n \"rank\": 77,\n \"score\": 115432.71827418375\n },\n {\n \"content\": \"/// A helper function which can deserialize integers represented as either\\n\\n/// numbers or strings.\\n\\nfn deserialize_int<'de, T, D>(deserializer: D) -> Result<T, D::Error>\\n\\nwhere\\n\\n T: FromStr,\\n\\n <T as FromStr>::Err: fmt::Display,\\n\\n D: Deserializer<'de>,\\n\\n{\\n\\n // We deserialize this using a visitor as described at\\n\\n // https://serde.rs/impl-deserialize.html because we may want to add support\\n\\n // for transparently handling a mix of strings and floats, if we ever get\\n\\n // that back from any API.\\n\\n struct IntVisitor<T>(PhantomData<T>);\\n\\n\\n\\n impl<'de, T> Visitor<'de> for IntVisitor<T>\\n\\n where\\n\\n T: FromStr,\\n\\n <T as FromStr>::Err: fmt::Display,\\n\\n {\\n\\n type Value = T;\\n\\n\\n\\n fn expecting(&self, f: &mut fmt::Formatter) -> fmt::Result {\\n\",\n \"file_path\": \"dbcrossbarlib/src/clouds/gcloud/storage/mod.rs\",\n \"rank\": 78,\n \"score\": 114377.03939999503\n },\n {\n \"content\": \"/// Parse a CSV cell and write it out as a PostgreSQL binary value. This works\\n\\n/// for any type implementing `FromCsvCell` and `WriteBinary`. More complicated\\n\\n/// cases will need to do this manually.\\n\\nfn write_cell_as_binary<T: FromCsvCell + WriteBinary>(\\n\\n wtr: &mut BufferedWriter,\\n\\n cell: &str,\\n\\n) -> Result<()> {\\n\\n let value = T::from_csv_cell(cell)?;\\n\\n value.write_binary(wtr)\\n\\n}\\n\\n\\n\\n/// Useful extensions to `Write`.\\n\\npub(crate) trait WriteExt {\\n\\n /// Write the length of a PostgreSQL value.\\n\\n fn write_len(&mut self, len: usize) -> Result<()>;\\n\\n\\n\\n /// Given a scratch `buffer` (which must be empty) and a function\\n\\n /// that writes output, run the function, collect the output, and write\\n\\n /// the output length and the output to this writer.\\n\\n ///\\n\\n /// We use an external `buffer` because this is an inner loop that will run\\n\\n /// over terabytes of data.\\n\\n fn write_value<F>(&mut self, buffer: &mut Vec<u8>, f: F) -> Result<()>\\n\",\n \"file_path\": \"dbcrossbarlib/src/drivers/postgres/csv_to_binary/mod.rs\",\n \"rank\": 79,\n \"score\": 114308.73889893357\n },\n {\n \"content\": \"/// Similar to `needs_custom_json_export`, but for `BqNonArrayDataType`.\\n\\nfn non_array_needs_custom_json_export(\\n\\n ty: &BqNonArrayDataType,\\n\\n) -> Result<NeedsCustomJsonExport> {\\n\\n match ty {\\n\\n // These types should all export to JSON correctly by default, I hope.\\n\\n //\\n\\n // TODO: Check min and max `INT64`.\\n\\n BqNonArrayDataType::Bool\\n\\n | BqNonArrayDataType::Float64\\n\\n | BqNonArrayDataType::Int64\\n\\n | BqNonArrayDataType::Numeric\\n\\n | BqNonArrayDataType::String\\n\\n | BqNonArrayDataType::Timestamp => Ok(NeedsCustomJsonExport::Never),\\n\\n\\n\\n // The SQL function `TO_JSON_STRING` handles `DATE` correctly, but it\\n\\n // gets converted to a full `Date` when passed to JavaScript. And that\\n\\n // won't automatically convert to the right thing.\\n\\n BqNonArrayDataType::Date => Ok(NeedsCustomJsonExport::OnlyInsideUdf),\\n\\n\\n\\n // This will also export directly.\\n\",\n \"file_path\": \"dbcrossbarlib/src/drivers/bigquery_shared/export_udf.rs\",\n \"rank\": 80,\n \"score\": 112444.39631055872\n },\n {\n \"content\": \"/// A helper which builds a `Box<dyn LocatorDriver>` for a type implementating\\n\\n/// `LocatorStatic`.\\n\\nfn driver<L: LocatorStatic>() -> Box<dyn LocatorDriver> {\\n\\n Box::new(LocatorDriverWrapper::<L>::new())\\n\\n}\\n\\n\\n\\nlazy_static! {\\n\\n /// A list of known drivers, computed the first time we use it and cached.\\n\\n static ref KNOWN_DRIVERS: Vec<Box<dyn LocatorDriver>> = vec![\\n\\n driver::<bigml::BigMlLocator>(),\\n\\n driver::<bigquery::BigQueryLocator>(),\\n\\n driver::<bigquery_schema::BigQuerySchemaLocator>(),\\n\\n driver::<csv::CsvLocator>(),\\n\\n driver::<dbcrossbar_schema::DbcrossbarSchemaLocator>(),\\n\\n driver::<dbcrossbar_ts::DbcrossbarTsLocator>(),\\n\\n driver::<gs::GsLocator>(),\\n\\n driver::<postgres::PostgresLocator>(),\\n\\n driver::<postgres_sql::PostgresSqlLocator>(),\\n\\n driver::<redshift::RedshiftLocator>(),\\n\\n driver::<s3::S3Locator>(),\\n\\n driver::<shopify::ShopifyLocator>(),\\n\\n ];\\n\",\n \"file_path\": \"dbcrossbarlib/src/drivers/mod.rs\",\n \"rank\": 81,\n \"score\": 104876.82696671684\n },\n {\n \"content\": \"/// Return an iterator over successive subranges of a file, each containing\\n\\n/// `chunk_size` bytes except the last.\\n\\nfn chunk_ranges(chunk_size: u64, len: u64) -> ChunkRanges {\\n\\n assert!(chunk_size > 0);\\n\\n ChunkRanges {\\n\\n chunk_size,\\n\\n len,\\n\\n next_start: 0,\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"dbcrossbarlib/src/clouds/gcloud/storage/download_file.rs\",\n \"rank\": 82,\n \"score\": 99990.86383395335\n },\n {\n \"content\": \"\\n\\n/// Given a table and list of upsert columns, return a list\\n\\npub(crate) fn columns_to_update_for_upsert<'a>(\\n\\n dest_table: &'a PgCreateTable,\\n\\n upsert_keys: &[String],\\n\\n) -> Result<Vec<&'a str>> {\\n\\n // Build a set of our upsert keys. We could probably implement this linear\\n\\n // search with no significant loss of performance.\\n\\n let upsert_keys_set: HashSet<&str> =\\n\\n HashSet::from_iter(upsert_keys.iter().map(|k| &k[..]));\\n\\n\\n\\n // Build our list of columns to update.\\n\\n let mut update_cols = vec![];\\n\\n for c in &dest_table.columns {\\n\\n if upsert_keys_set.contains(&c.name[..]) {\\n\\n // Verify that it's actually safe to use this as an upsert key.\\n\\n if c.is_nullable {\\n\\n return Err(format_err!(\\n\\n \\\"cannot upsert on column {} because it isn't declared NOT NULL\\\",\\n\\n Ident(&c.name),\\n\\n ));\\n\\n }\\n\\n } else {\\n\\n update_cols.push(&c.name[..]);\\n\\n }\\n\\n }\\n\\n Ok(update_cols)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"dbcrossbarlib/src/drivers/postgres/write_local_data.rs\",\n \"rank\": 83,\n \"score\": 90409.37732950905\n },\n {\n \"content\": \" let mut real_source_table =\\n\\n BqTable::read_from_table(&ctx, &source_table_name).await?;\\n\\n real_source_table = real_source_table.aligned_with(&source_table)?;\\n\\n\\n\\n // We need to build a temporary export table.\\n\\n let temp_table_name = source_table\\n\\n .name()\\n\\n .temporary_table_name(&temporary_storage)?;\\n\\n let mut export_sql_data = vec![];\\n\\n real_source_table.write_export_sql(&source_args, &mut export_sql_data)?;\\n\\n let export_sql =\\n\\n String::from_utf8(export_sql_data).expect(\\\"should always be UTF-8\\\");\\n\\n debug!(ctx.log(), \\\"export SQL: {}\\\", export_sql);\\n\\n\\n\\n // Run our query.\\n\\n bigquery::query_to_table(\\n\\n &ctx,\\n\\n source.project(),\\n\\n &export_sql,\\n\\n &temp_table_name,\\n\",\n \"file_path\": \"dbcrossbarlib/src/drivers/gs/write_remote_data.rs\",\n \"rank\": 84,\n \"score\": 90408.7186246099\n },\n {\n \"content\": \"//! Implementation of `write_local_data` for Redshift.\\n\\n\\n\\nuse super::RedshiftLocator;\\n\\nuse crate::common::*;\\n\\nuse crate::drivers::s3::find_s3_temp_dir;\\n\\nuse crate::tokio_glue::ConsumeWithParallelism;\\n\\n\\n\\n/// Implementation of `write_local_data`, but as a real `async` function.\\n\\npub(crate) async fn write_local_data_helper(\\n\\n ctx: Context,\\n\\n dest: RedshiftLocator,\\n\\n data: BoxStream<CsvStream>,\\n\\n shared_args: SharedArguments<Unverified>,\\n\\n dest_args: DestinationArguments<Unverified>,\\n\\n) -> Result<BoxStream<BoxFuture<BoxLocator>>> {\\n\\n // Build a temporary location.\\n\\n let shared_args_v = shared_args.clone().verify(RedshiftLocator::features())?;\\n\\n let s3_temp = find_s3_temp_dir(shared_args_v.temporary_storage())?;\\n\\n let s3_dest_args = DestinationArguments::for_temporary();\\n\\n let s3_source_args = SourceArguments::for_temporary();\\n\",\n \"file_path\": \"dbcrossbarlib/src/drivers/redshift/write_local_data.rs\",\n \"rank\": 85,\n \"score\": 90407.0376541936\n },\n {\n \"content\": \" let create_stmt = client.prepare(&create_sql).await?;\\n\\n client\\n\\n .execute(&create_stmt, &[])\\n\\n .await\\n\\n .with_context(|_| format!(\\\"error creating {}\\\", &table.name.quoted()))?;\\n\\n Ok(())\\n\\n}\\n\\n\\n\\n/// Create a temporary table based on `table`, but using a different name. This\\n\\n/// table will only live as long as the `client`.\\n\\npub(crate) async fn create_temp_table_for(\\n\\n ctx: &Context,\\n\\n client: &mut Client,\\n\\n table: &PgCreateTable,\\n\\n) -> Result<PgCreateTable> {\\n\\n let mut temp_table = table.to_owned();\\n\\n let temp_name = table.name.temporary_table_name()?;\\n\\n temp_table.name = temp_name;\\n\\n temp_table.if_not_exists = false;\\n\\n temp_table.temporary = true;\\n\",\n \"file_path\": \"dbcrossbarlib/src/drivers/postgres/write_local_data.rs\",\n \"rank\": 86,\n \"score\": 90406.55868184583\n },\n {\n \"content\": \"//! Implementation of `write_local_data` for BigQuery.\\n\\n\\n\\nuse crate::common::*;\\n\\nuse crate::drivers::{bigquery::BigQueryLocator, gs::find_gs_temp_dir};\\n\\nuse crate::tokio_glue::ConsumeWithParallelism;\\n\\n\\n\\n/// Implementation of `write_local_data`, but as a real `async` function.\\n\\npub(crate) async fn write_local_data_helper(\\n\\n ctx: Context,\\n\\n dest: BigQueryLocator,\\n\\n data: BoxStream<CsvStream>,\\n\\n shared_args: SharedArguments<Unverified>,\\n\\n dest_args: DestinationArguments<Unverified>,\\n\\n) -> Result<BoxStream<BoxFuture<BoxLocator>>> {\\n\\n // Build a temporary location.\\n\\n let shared_args_v = shared_args.clone().verify(BigQueryLocator::features())?;\\n\\n let gs_temp = find_gs_temp_dir(shared_args_v.temporary_storage())?;\\n\\n let gs_dest_args = DestinationArguments::for_temporary();\\n\\n let gs_source_args = SourceArguments::for_temporary();\\n\\n\\n\",\n \"file_path\": \"dbcrossbarlib/src/drivers/bigquery/write_local_data.rs\",\n \"rank\": 87,\n \"score\": 90406.4598166158\n },\n {\n \"content\": \" create_table(ctx, client, &temp_table).await?;\\n\\n Ok(temp_table)\\n\\n}\\n\\n\\n\\n/// Run `DROP TABLE` and/or `CREATE TABLE` as needed to prepare `table` for\\n\\n/// copying in data.\\n\\n///\\n\\n/// We take ownership of `pg_create_table` because we want to edit it before\\n\\n/// running it.\\n\\npub(crate) async fn prepare_table(\\n\\n ctx: &Context,\\n\\n client: &mut Client,\\n\\n mut table: PgCreateTable,\\n\\n if_exists: &IfExists,\\n\\n) -> Result<()> {\\n\\n match if_exists {\\n\\n IfExists::Overwrite => {\\n\\n drop_table_if_exists(ctx, client, &table).await?;\\n\\n table.if_not_exists = false;\\n\\n }\\n\",\n \"file_path\": \"dbcrossbarlib/src/drivers/postgres/write_local_data.rs\",\n \"rank\": 88,\n \"score\": 90404.80759849021\n },\n {\n \"content\": \"//! Support for writing local data to Postgres.\\n\\n\\n\\nuse futures::pin_mut;\\n\\nuse itertools::Itertools;\\n\\nuse std::{collections::HashSet, io::prelude::*, iter::FromIterator, str};\\n\\n\\n\\nuse super::{csv_to_binary::copy_csv_to_pg_binary, Client, PostgresLocator};\\n\\nuse crate::common::*;\\n\\nuse crate::drivers::postgres_shared::{connect, CheckCatalog, Ident, PgCreateTable};\\n\\nuse crate::tokio_glue::try_forward;\\n\\nuse crate::transform::spawn_sync_transform;\\n\\n\\n\\n/// If `table_name` exists, `DROP` it.\\n\\nasync fn drop_table_if_exists(\\n\\n ctx: &Context,\\n\\n client: &mut Client,\\n\\n table: &PgCreateTable,\\n\\n) -> Result<()> {\\n\\n debug!(\\n\\n ctx.log(),\\n\",\n \"file_path\": \"dbcrossbarlib/src/drivers/postgres/write_local_data.rs\",\n \"rank\": 89,\n \"score\": 90403.11974345782\n },\n {\n \"content\": \" // Concatenate all our CSV data into a single stream if requested.\\n\\n if concat_csv_streams {\\n\\n data = box_stream_once(Ok(concatenate_csv_streams(ctx.clone(), data)?));\\n\\n }\\n\\n\\n\\n // See if we have an S3 temporary directory, and transform `data` into a\\n\\n // list of BigML source IDs.\\n\\n let s3_temp = find_s3_temp_dir(shared_args_v.temporary_storage()).ok();\\n\\n let sources: BoxStream<BoxFuture<(Context, Source)>> =\\n\\n if let Some(s3_temp) = s3_temp {\\n\\n // We have S3 temporary storage, so let's copy everything there.\\n\\n\\n\\n // Pass our `data` streams to `S3Locator::write_local_data`, which will\\n\\n // write them to S3 and return a `BoxStream<BoxFuture<BoxLocator>>>`,\\n\\n // that is, a stream a futures yielding the S3 locators where we put\\n\\n // our data on S3.\\n\\n let s3_dest_args = DestinationArguments::for_temporary();\\n\\n let s3_locator_stream: BoxStream<BoxFuture<BoxLocator>> = s3_temp\\n\\n .write_local_data(ctx.clone(), data, shared_args, s3_dest_args)\\n\\n .await?;\\n\",\n \"file_path\": \"dbcrossbarlib/src/drivers/bigml/write_local_data.rs\",\n \"rank\": 90,\n \"score\": 90402.59353784253\n },\n {\n \"content\": \" \\\"transforming data into final table {}\\\",\\n\\n dest_table.name(),\\n\\n );\\n\\n\\n\\n // Generate and run our import SQL.\\n\\n let mut query = Vec::new();\\n\\n dest_table.write_import_sql(initial_table.name(), if_exists, &mut query)?;\\n\\n let query =\\n\\n String::from_utf8(query).expect(\\\"generated SQL should always be UTF-8\\\");\\n\\n debug!(ctx.log(), \\\"import sql: {}\\\", query);\\n\\n bigquery::execute_sql(&ctx, dest.project(), &query, &job_labels).await?;\\n\\n\\n\\n // Delete temp table.\\n\\n bigquery::drop_table(&ctx, initial_table.name(), &job_labels).await?;\\n\\n }\\n\\n\\n\\n Ok(vec![dest.boxed()])\\n\\n}\\n\",\n \"file_path\": \"dbcrossbarlib/src/drivers/bigquery/write_remote_data.rs\",\n \"rank\": 91,\n \"score\": 90402.16074183013\n },\n {\n \"content\": \" // Connect to Redshift and prepare our table.\\n\\n let mut client = connect(&ctx, dest.url()).await?;\\n\\n prepare_table(&ctx, &mut client, pg_create_table.clone(), &if_exists).await?;\\n\\n if let IfExists::Upsert(upsert_keys) = &if_exists {\\n\\n // Create a temporary table to hold our imported data.\\n\\n let temp_table =\\n\\n create_temp_table_for(&ctx, &mut client, &pg_create_table).await?;\\n\\n\\n\\n // Copy data into our temporary table.\\n\\n copy_in(&ctx, &client, &source_url, &temp_table.name, to_args).await?;\\n\\n\\n\\n // Build our upsert SQL.\\n\\n upsert_from_temp_table(\\n\\n &ctx,\\n\\n &mut client,\\n\\n &temp_table,\\n\\n &pg_create_table,\\n\\n upsert_keys,\\n\\n )\\n\\n .await?;\\n\",\n \"file_path\": \"dbcrossbarlib/src/drivers/redshift/write_remote_data.rs\",\n \"rank\": 92,\n \"score\": 90401.65438439896\n },\n {\n \"content\": \" let fut = async move {\\n\\n while let Some(result) = data.next().await {\\n\\n match result {\\n\\n Err(err) => {\\n\\n debug!(ctx.log(), \\\"error reading stream of streams: {}\\\", err);\\n\\n return Err(err);\\n\\n }\\n\\n Ok(csv_stream) => {\\n\\n let ctx = ctx.child(o!(\\\"stream\\\" => csv_stream.name.clone()));\\n\\n\\n\\n // Convert our CSV stream into a PostgreSQL `BINARY` stream.\\n\\n let transform_table = dest_table.clone();\\n\\n let binary_stream = spawn_sync_transform(\\n\\n ctx.clone(),\\n\\n \\\"copy_csv_to_pg_binary\\\".to_owned(),\\n\\n csv_stream.data,\\n\\n move |_ctx, rdr, wtr| {\\n\\n copy_csv_to_pg_binary(&transform_table, rdr, wtr)\\n\\n },\\n\\n )?;\\n\",\n \"file_path\": \"dbcrossbarlib/src/drivers/postgres/write_local_data.rs\",\n \"rank\": 93,\n \"score\": 90400.35178357948\n },\n {\n \"content\": \" dest_table = dest_table.name.quoted(),\\n\\n src_table = src_table.name.quoted(),\\n\\n all_columns = dest_table.columns.iter().map(|c| Ident(&c.name)).join(\\\", \\\"),\\n\\n key_columns = upsert_keys.iter().map(|k| Ident(k)).join(\\\", \\\"),\\n\\n value_updates = value_keys\\n\\n .iter()\\n\\n .map(|vk| format!(\\\"{name} = EXCLUDED.{name}\\\", name = Ident(&vk)))\\n\\n .join(\\\",\\\\n \\\"),\\n\\n ))\\n\\n}\\n\\n\\n\\n/// Upsert all rows from `src` into `dest`.\\n\\npub(crate) async fn upsert_from(\\n\\n ctx: &Context,\\n\\n client: &mut Client,\\n\\n src_table: &PgCreateTable,\\n\\n dest_table: &PgCreateTable,\\n\\n upsert_keys: &[String],\\n\\n) -> Result<()> {\\n\\n let sql = upsert_sql(src_table, dest_table, upsert_keys)?;\\n\",\n \"file_path\": \"dbcrossbarlib/src/drivers/postgres/write_local_data.rs\",\n \"rank\": 94,\n \"score\": 90399.50070595785\n },\n {\n \"content\": \"\\n\\n // Copy to a temporary s3:// location.\\n\\n let to_temp_ctx = ctx.child(o!(\\\"to_temp\\\" => s3_temp.to_string()));\\n\\n let result_stream = s3_temp\\n\\n .write_local_data(to_temp_ctx, data, shared_args.clone(), s3_dest_args)\\n\\n .await?;\\n\\n\\n\\n // Wait for all s3:// uploads to finish with controllable parallelism.\\n\\n //\\n\\n // TODO: This duplicates our top-level `cp` code and we need to implement\\n\\n // the same rules for picking a good argument to `consume_with_parallelism`\\n\\n // and not just hard code our parallelism.\\n\\n result_stream\\n\\n .consume_with_parallelism(shared_args_v.max_streams())\\n\\n .await?;\\n\\n\\n\\n // Load from s3:// to Redshift.\\n\\n let from_temp_ctx = ctx.child(o!(\\\"from_temp\\\" => s3_temp.to_string()));\\n\\n dest.write_remote_data(\\n\\n from_temp_ctx,\\n\",\n \"file_path\": \"dbcrossbarlib/src/drivers/redshift/write_local_data.rs\",\n \"rank\": 95,\n \"score\": 90399.04756758394\n },\n {\n \"content\": \" // Copy to a temporary gs:// location.\\n\\n let to_temp_ctx = ctx.child(o!(\\\"to_temp\\\" => gs_temp.to_string()));\\n\\n let result_stream = gs_temp\\n\\n .write_local_data(to_temp_ctx, data, shared_args.clone(), gs_dest_args)\\n\\n .await?;\\n\\n\\n\\n // Wait for all gs:// uploads to finish with controllable parallelism.\\n\\n //\\n\\n // TODO: This duplicates our top-level `cp` code and we need to implement\\n\\n // the same rules for picking a good argument to `consume_with_parallelism`\\n\\n // and not just hard code our parallelism.\\n\\n result_stream\\n\\n .consume_with_parallelism(shared_args_v.max_streams())\\n\\n .await?;\\n\\n\\n\\n // Load from gs:// to BigQuery.\\n\\n let from_temp_ctx = ctx.child(o!(\\\"from_temp\\\" => gs_temp.to_string()));\\n\\n dest.write_remote_data(\\n\\n from_temp_ctx,\\n\\n Box::new(gs_temp),\\n\",\n \"file_path\": \"dbcrossbarlib/src/drivers/bigquery/write_local_data.rs\",\n \"rank\": 96,\n \"score\": 90398.78404343598\n },\n {\n \"content\": \"//! Implementation of `write_local_data`.\\n\\n\\n\\nuse bigml::{\\n\\n self,\\n\\n resource::{dataset, source, source::Optype, Resource, Source},\\n\\n};\\n\\nuse chrono::{Duration, Utc};\\n\\nuse serde::Deserialize;\\n\\n\\n\\nuse super::{source::SourceExt, BigMlLocator, CreateOptions};\\n\\nuse crate::clouds::aws::{sign_s3_url, AwsCredentials};\\n\\nuse crate::common::*;\\n\\nuse crate::concat::concatenate_csv_streams;\\n\\nuse crate::drivers::s3::find_s3_temp_dir;\\n\\n\\n\\n/// Parsed version of `--to-arg` values.\\n\\n#[derive(Clone, Debug, Deserialize)]\\n\\n#[serde(deny_unknown_fields)]\\n\",\n \"file_path\": \"dbcrossbarlib/src/drivers/bigml/write_local_data.rs\",\n \"rank\": 97,\n \"score\": 90398.71308136743\n },\n {\n \"content\": \" }\\n\\n}\\n\\n\\n\\nimpl VerifyRedshiftCanImportFromCsv for DataType {\\n\\n fn verify_redshift_can_import_from_csv(&self) -> Result<()> {\\n\\n match self {\\n\\n DataType::Bool\\n\\n | DataType::Date\\n\\n | DataType::Float32\\n\\n | DataType::Float64\\n\\n | DataType::Int16\\n\\n | DataType::Int32\\n\\n | DataType::Int64\\n\\n | DataType::Text\\n\\n | DataType::TimestampWithoutTimeZone\\n\\n | DataType::TimestampWithTimeZone => Ok(()),\\n\\n DataType::Array(_)\\n\\n | DataType::Decimal\\n\\n | DataType::GeoJson(_)\\n\\n | DataType::Json\\n\\n | DataType::Struct(_)\\n\\n | DataType::Uuid => Err(format_err!(\\n\\n \\\"Redshift driver does not support data type {:?}\\\",\\n\\n self\\n\\n )),\\n\\n }\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"dbcrossbarlib/src/drivers/redshift/write_remote_data.rs\",\n \"rank\": 98,\n \"score\": 90397.93899493864\n }\n]","isConversational":false}}},{"rowIdx":2355,"cells":{"lang":{"kind":"string","value":"Rust"},"file_path":{"kind":"string","value":"src/prns.rs"},"repo_name":{"kind":"string","value":"Chris--B/comms-rs"},"commit":{"kind":"string","value":"8b9278e698c4c817a77449f74fa5ffed3f5c5425"},"file_code":{"kind":"string","value":"\n\nuse crate::prelude::*;\n\nextern crate num; \n\nuse num::PrimInt;\nuse std::mem::size_of;\n\npub struct PrnGen<T> {\n poly_mask: T,\n state: T,\n}\n\nimpl<T: PrimInt> PrnGen<T> {\n \n \n \n \n \n \n \n \n pub fn new(poly_mask: T, state: T) -> PrnGen<T> {\n PrnGen { poly_mask, state }\n }\n\n \n \n \n \n \n \n \n \n \n \n \n \n pub fn next_byte(&mut self) -> u8 {\n let fb_bit =\n T::from((self.state & self.poly_mask).count_ones() % 2).unwrap();\n let output = self.state >> (size_of::<T>() * 8 - 1);\n self.state = self.state << 1;\n self.state = self.state | fb_bit;\n output.to_u8().unwrap()\n }\n}\n\n#[derive(Node)]\npub struct PrnsNode<T>\nwhere\n T: PrimInt + Send,\n{\n prngen: PrnGen<T>,\n pub output: NodeSender<u8>,\n}\n\nimpl<T> PrnsNode<T>\nwhere\n T: PrimInt + Send,\n{\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n pub fn new(poly_mask: T, state: T) -> Self {\n PrnsNode {\n prngen: PrnGen::new(poly_mask, state),\n output: Default::default(),\n }\n }\n\n pub fn run(&mut self) -> Result<u8, NodeError> {\n Ok(self.prngen.next_byte())\n }\n}\n\n#[cfg(test)]\nmod test {\n use crate::prelude::*;\n use crate::prns::*;\n use num::PrimInt;\n use std::collections::HashMap;\n use std::hash::Hash;\n use std::mem::size_of;\n use std::thread;\n use std::time::Instant;\n\n #[test]\n \n fn test_prns8_correctness() {\n struct TestPrnsGenerator<T: PrimInt + Hash> {\n poly_mask: T,\n state: T,\n statemap: HashMap<T, u8>,\n }\n\n impl<T: PrimInt + Hash> TestPrnsGenerator<T> {\n #[allow(clippy::map_entry)]\n fn run(&mut self) -> Option<u8> {\n if self.statemap.contains_key(&self.state) {\n println!(\"\\nSize of <T>: {}\", size_of::<T>());\n println!(\"\\n\\nWrapped, size = {}!\", self.statemap.len());\n assert_eq!(self.statemap.len(), 255);\n return None;\n } else {\n self.statemap.insert(self.state, 1 as u8);\n }\n\n let fb_bit =\n T::from((self.state & self.poly_mask).count_ones() % 2)\n .unwrap();\n let output = self.state >> (size_of::<T>() * 8 - 1);\n self.state = self.state << 1;\n self.state = self.state | fb_bit;\n output.to_u8()\n }\n }\n\n let mut prngen = TestPrnsGenerator {\n poly_mask: 0xB8 as u8,\n state: 0x01,\n statemap: HashMap::new(),\n };\n\n while let Some(x) = prngen.run() {\n print!(\"{:x}\", x);\n }\n }\n\n #[test]\n \n fn test_prns_node() {\n let mut mynode = PrnsNode::new(0xC0 as u8, 0x01);\n #[derive(Node)]\n struct CheckNode {\n input: NodeReceiver<u8>,\n state: Vec<u8>,\n }\n\n impl CheckNode {\n pub fn new() -> Self {\n CheckNode {\n state: vec![],\n input: Default::default(),\n }\n }\n\n pub fn run(&mut self, x: u8) -> Result<(), NodeError> {\n if self.state.len() == 128 {\n assert_eq!(\n self.state,\n vec![\n 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 1, 1, 0,\n 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 1, 1, 1, 1, 0, 0,\n 0, 1, 0, 0, 0, 1, 0, 0, 1, 1, 0, 0, 1, 1, 0, 1, 0,\n 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0,\n 0, 0, 1, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 1,\n 0, 1, 0, 0, 0, 0, 1, 1, 1, 1, 0, 0, 0, 1, 0, 0, 0,\n 1, 0, 0, 1, 1, 0, 0, 1, 1, 0, 1, 0, 1, 0, 1, 0, 1,\n 1, 1, 1, 1, 1, 1, 1, 0, 0\n ]\n );\n } else {\n self.state.push(x);\n }\n Ok(())\n }\n }\n\n let mut check_node = CheckNode::new();\n\n connect_nodes!(mynode, output, check_node, input);\n start_nodes!(mynode);\n let check = thread::spawn(move || {\n let now = Instant::now();\n loop {\n check_node.call().unwrap();\n if now.elapsed().as_secs() > 1 {\n break;\n }\n }\n });\n assert!(check.join().is_ok());\n }\n}\n"},"prefix":{"kind":"string","value":"\n\nuse crate::prelude::*;\n\nextern crate num; \n\nuse num::PrimInt;\nuse std::mem::size_of;\n\npub struct PrnGen<T> {\n poly_mask: T,\n state: T,\n}\n\nimpl<T: PrimInt> PrnGen<T> {\n \n \n \n \n \n \n \n \n pub fn new(poly_mask: T, state: T) -> PrnGen<T> {\n PrnGen { poly_mask, state }\n }\n\n \n \n \n \n \n \n \n \n \n \n \n \n pub fn next_byte(&mut self) -> u8 {\n let fb_bit =\n T::from((self.state & self.poly_mask).count_ones() % 2).unwrap();\n let output = self.state >> (size_of::<T>() * 8 - 1);\n self.state = self.state << 1;\n self.state = self.state | fb_bit;\n output.to_u8().unwrap()\n }\n}\n\n#[derive(Node)]\npub struct PrnsNode<T>\nwhere\n T: PrimInt + Send,\n{\n prngen: PrnGen<T>,\n pub output: NodeSender<u8>,\n}\n\nimpl<T> PrnsNode<T>\nwhere\n T: PrimInt + Send,\n{\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n pub fn new(poly_mask: T, state: T) -> Self {\n PrnsNode {\n prngen: PrnGen::new(poly_mask, state),\n output: Default::default(),\n }\n }\n\n pub fn run(&mut self) -> Result<u8, NodeError> {\n Ok(self.prngen.next_byte())\n }\n}\n\n#[cfg(test)]\nmod test {\n use crate::prelude::*;\n use crate::prns::*;\n use num::PrimInt;\n use std::collections::HashMap;\n use std::hash::Hash;\n use std::mem::size_of;\n use std::thread;\n use std::time::Instant;\n\n #[test]\n \n fn test_prns8_correctness() {\n struct TestPrnsGenerator<T: PrimInt + Hash> {\n poly_mask: T,\n state: T,\n statemap: HashMap<T, u8>,\n }\n\n impl<T: PrimInt + Hash> TestPrnsGenerator<T> {\n #[allow(clippy::map_entry)]\n fn run(&mut self) -> Option<u8> {\n "},"suffix":{"kind":"string","value":"\n\n let fb_bit =\n T::from((self.state & self.poly_mask).count_ones() % 2)\n .unwrap();\n let output = self.state >> (size_of::<T>() * 8 - 1);\n self.state = self.state << 1;\n self.state = self.state | fb_bit;\n output.to_u8()\n }\n }\n\n let mut prngen = TestPrnsGenerator {\n poly_mask: 0xB8 as u8,\n state: 0x01,\n statemap: HashMap::new(),\n };\n\n while let Some(x) = prngen.run() {\n print!(\"{:x}\", x);\n }\n }\n\n #[test]\n \n fn test_prns_node() {\n let mut mynode = PrnsNode::new(0xC0 as u8, 0x01);\n #[derive(Node)]\n struct CheckNode {\n input: NodeReceiver<u8>,\n state: Vec<u8>,\n }\n\n impl CheckNode {\n pub fn new() -> Self {\n CheckNode {\n state: vec![],\n input: Default::default(),\n }\n }\n\n pub fn run(&mut self, x: u8) -> Result<(), NodeError> {\n if self.state.len() == 128 {\n assert_eq!(\n self.state,\n vec![\n 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 1, 1, 0,\n 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 1, 1, 1, 1, 0, 0,\n 0, 1, 0, 0, 0, 1, 0, 0, 1, 1, 0, 0, 1, 1, 0, 1, 0,\n 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0,\n 0, 0, 1, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 1,\n 0, 1, 0, 0, 0, 0, 1, 1, 1, 1, 0, 0, 0, 1, 0, 0, 0,\n 1, 0, 0, 1, 1, 0, 0, 1, 1, 0, 1, 0, 1, 0, 1, 0, 1,\n 1, 1, 1, 1, 1, 1, 1, 0, 0\n ]\n );\n } else {\n self.state.push(x);\n }\n Ok(())\n }\n }\n\n let mut check_node = CheckNode::new();\n\n connect_nodes!(mynode, output, check_node, input);\n start_nodes!(mynode);\n let check = thread::spawn(move || {\n let now = Instant::now();\n loop {\n check_node.call().unwrap();\n if now.elapsed().as_secs() > 1 {\n break;\n }\n }\n });\n assert!(check.join().is_ok());\n }\n}\n"},"middle":{"kind":"string","value":"if self.statemap.contains_key(&self.state) {\n println!(\"\\nSize of <T>: {}\", size_of::<T>());\n println!(\"\\n\\nWrapped, size = {}!\", self.statemap.len());\n assert_eq!(self.statemap.len(), 255);\n return None;\n } else {\n self.statemap.insert(self.state, 1 as u8);\n }"},"strategy":{"kind":"string","value":"if_condition"},"context_items":{"kind":"list like","value":[{"content":"/// Modulates a byte via BPSK into 8 int16 samples\n\npub fn bpsk_byte_mod(byte: u8) -> Vec<Complex<i16>> {\n\n (0..8)\n\n .map(|i| bpsk_bit_mod(((1_u8 << i) & byte).rotate_right(i)).unwrap())\n\n .collect()\n\n}\n\n\n","file_path":"src/modulation/digital.rs","rank":0,"score":114674.74686400298},{"content":"/// Modulates a bit to a complex int16 impulse via BPSK\n\npub fn bpsk_bit_mod(bit: u8) -> Option<Complex<i16>> {\n\n if bit == 0 {\n\n Some(Complex::new(1, 0))\n\n } else if bit == 1 {\n\n Some(Complex::new(-1, 0))\n\n } else {\n\n None\n\n }\n\n}\n\n\n","file_path":"src/modulation/digital.rs","rank":1,"score":114674.74686400298},{"content":"/// Modulates a byte via QPSK into 4 int16 samples\n\npub fn qpsk_byte_mod(byte: u8) -> Vec<Complex<i16>> {\n\n (0..8)\n\n .step_by(2)\n\n .map(|i| qpsk_bit_mod(((3_u8 << i) & byte).rotate_right(i)).unwrap())\n\n .collect()\n\n}\n\n\n\n#[cfg(test)]\n\nmod test {\n\n use super::*;\n\n use num::Complex;\n\n\n\n #[test]\n\n fn test_bpsk_bit() {\n\n assert_eq!(bpsk_bit_mod(0_u8).unwrap(), Complex::new(1, 0));\n\n assert_eq!(bpsk_bit_mod(1_u8).unwrap(), Complex::new(-1, 0));\n\n }\n\n\n\n #[test]\n\n fn test_qpsk_bit() {\n","file_path":"src/modulation/digital.rs","rank":2,"score":114674.74686400298},{"content":"/// Modulates a pair of bits to a complex int16 impulse via QPSK\n\npub fn qpsk_bit_mod(bits: u8) -> Option<Complex<i16>> {\n\n if bits == 0 {\n\n Some(Complex::new(1, 1))\n\n } else if bits == 1 {\n\n Some(Complex::new(-1, 1))\n\n } else if bits == 2 {\n\n Some(Complex::new(1, -1))\n\n } else if bits == 3 {\n\n Some(Complex::new(-1, -1))\n\n } else {\n\n None\n\n }\n\n}\n\n\n","file_path":"src/modulation/digital.rs","rank":3,"score":114674.74686400298},{"content":"/// The trait that all nodes in the library implement.\n\npub trait Node: Send {\n\n fn start(&mut self);\n\n fn call(&mut self) -> Result<(), NodeError>;\n\n fn is_connected(&self) -> bool;\n\n}\n\n\n\n/// Connects two nodes together with crossbeam channels.\n\n///\n\n/// ```\n\n/// # #[macro_use] extern crate comms_rs;\n\n/// # use comms_rs::prelude::*;\n\n/// # fn main() {\n\n/// # #[derive(Node)]\n\n/// # struct Node1 {\n\n/// # output: NodeSender<u32>,\n\n/// # }\n\n/// #\n\n/// # impl Node1 {\n\n/// # pub fn new() -> Self {\n\n/// # Node1 {\n","file_path":"src/node/mod.rs","rank":4,"score":112282.60057911389},{"content":"/// Builds a closure for generating 0 or 1 with a Uniform distrubition.\n\n///\n\n/// # Examples\n\n///\n\n/// ```\n\n/// use comms_rs::util::rand_node::random_bit;\n\n///\n\n/// let node = random_bit();\n\n/// ```\n\npub fn random_bit() -> UniformNode<u8> {\n\n UniformNode::new(0u8, 2u8)\n\n}\n\n\n\n#[cfg(test)]\n\nmod test {\n\n use crate::util::rand_node;\n\n use std::thread;\n\n use std::time::Instant;\n\n\n\n use crate::prelude::*;\n\n\n\n #[test]\n\n // A basic test that just makes sure the node doesn't crash.\n\n fn test_normal() {\n\n let mut norm_node = rand_node::NormalNode::new(0.0, 1.0);\n\n let check = thread::spawn(move || {\n\n let now = Instant::now();\n\n loop {\n\n norm_node.call().unwrap();\n","file_path":"src/util/rand_node.rs","rank":5,"score":107691.82470161495},{"content":"#[test]\n\nfn test_macro() {\n\n let mut node1 = Node1::new();\n\n\n\n let mut node2 = Node2::new(5);\n\n\n\n let mut node3 = Node3::new();\n\n\n\n connect_nodes!(node1, output, node2, recv_input);\n\n connect_nodes!(node2, output, node3, recv_input);\n\n\n\n thread::spawn(move || {\n\n node1.call().unwrap();\n\n });\n\n\n\n thread::spawn(move || {\n\n node2.call().unwrap();\n\n });\n\n\n\n node3.call().unwrap();\n\n}\n","file_path":"tests/macro_tests.rs","rank":6,"score":92349.61495203678},{"content":"#[test]\n\nfn simple_nodes() {\n\n #[derive(Node)]\n\n struct SourceNode {\n\n pub output: NodeSender<u32>,\n\n }\n\n\n\n impl SourceNode {\n\n pub fn new() -> Self {\n\n SourceNode {\n\n output: Default::default(),\n\n }\n\n }\n\n\n\n pub fn run(&mut self) -> Result<u32, NodeError> {\n\n Ok(1)\n\n }\n\n }\n\n\n\n #[derive(Node)]\n\n struct SinkNode {\n","file_path":"tests/node_test.rs","rank":7,"score":87663.93546720617},{"content":"/// Implementation of the Mengali qfilter tap calculator.\n\n///\n\n/// This is specifically to support Mengali's feedforward non data aided\n\n/// maximum likelihood estimator described in chp. 8.4 of his book as q(t).\n\n///\n\n/// # Arguments\n\n///\n\n/// * `n_taps` - Number of desired output taps. Only takes odd numbers. Even\n\n/// numbers will be incremented by one and that shall be used\n\n/// intead.\n\n/// * `alpha` - Shaping parameter of the function. Must be on the interval\n\n/// [0.0, 1.0].\n\n/// * `sam_per_sym` - Samples per symbol\n\n///\n\n/// # Examples\n\n///\n\n/// ```\n\n/// use comms_rs::util::math::qfilt_taps;\n\n/// use num::Complex;\n\n///\n\n/// let n_taps = 21;\n\n/// let alpha = 0.25;\n\n/// let sams_per_sym = 2;\n\n/// let taps: Vec<f64> = qfilt_taps(n_taps, alpha, sams_per_sym).unwrap();\n\n/// ```\n\npub fn qfilt_taps(\n\n n_taps: u32,\n\n alpha: f64,\n\n sam_per_sym: u32,\n\n) -> Result<Vec<f64>, MathError> {\n\n if alpha < 0.0 || alpha > 1.0 {\n\n return Err(MathError::InvalidRolloffError);\n\n };\n\n\n\n // We want an odd number of taps\n\n let mut real_n_taps = n_taps;\n\n if n_taps % 2 == 0 {\n\n real_n_taps += 1;\n\n }\n\n\n\n let d = ((real_n_taps as f64) / 2.0).floor() as i32;\n\n let ttarr: Vec<f64> = (0..real_n_taps)\n\n .map(|x| (x as i32 - d) as f64 / (sam_per_sym as f64))\n\n .collect();\n\n\n","file_path":"src/util/math.rs","rank":8,"score":87569.41548045655},{"content":"/// Implementation of run for the FirNode.\n\n///\n\n/// # Arguments\n\n///\n\n/// * `input` - Input sample to be filtered.\n\n/// * `taps` - FIR filter taps.\n\n/// * `state` - FIR filter initial internal state.\n\n///\n\n/// # Examples\n\n///\n\n/// ```\n\n/// use comms_rs::filter::fir::*;\n\n/// use num::Complex;\n\n///\n\n/// let input = Complex::new(1.2_f64, -0.747_f64);\n\n/// let taps = vec![\n\n/// Complex::new(0.2, 0.0),\n\n/// Complex::new(0.6, 0.0),\n\n/// Complex::new(0.6, 0.0),\n\n/// Complex::new(0.2, 0.0),\n\n/// ];\n\n///\n\n/// let mut state = vec![\n\n/// Complex::new(1.0, 0.0),\n\n/// Complex::new(0.5, 0.0),\n\n/// Complex::new(0.25, 0.0),\n\n/// Complex::new(0.125, 0.0),\n\n/// ];\n\n///\n\n/// let output = fir(&input, &taps, &mut state);\n\n/// ```\n\npub fn fir<T>(\n\n input: &Complex<T>,\n\n taps: &[Complex<T>],\n\n state: &mut Vec<Complex<T>>,\n\n) -> Complex<T>\n\nwhere\n\n T: Num + Copy,\n\n{\n\n state.rotate_right(1);\n\n state[0] = *input;\n\n taps.iter().zip(state.iter()).map(|(x, y)| *x * *y).sum()\n\n}\n\n\n","file_path":"src/filter/fir.rs","rank":9,"score":83078.53822239142},{"content":"/// Implementation of run for the BatchFirNode.\n\n///\n\n/// # Arguments\n\n///\n\n/// * `input` - Input batch of samples to be filtered.\n\n/// * `taps` - FIR filter taps.\n\n/// * `state` - FIR filter initial internal state.\n\n///\n\n/// # Examples\n\n///\n\n/// ```\n\n/// use comms_rs::filter::fir::*;\n\n/// use num::Complex;\n\n///\n\n/// let input: Vec<Complex<f64>> = (0..100).map(|x| Complex::new((x as f64).cos(), 0.0)).collect();\n\n/// let taps = vec![\n\n/// Complex::new(0.2, 0.0),\n\n/// Complex::new(0.6, 0.0),\n\n/// Complex::new(0.6, 0.0),\n\n/// Complex::new(0.2, 0.0),\n\n/// ];\n\n///\n\n/// let mut state = vec![\n\n/// Complex::new(1.0, 0.0),\n\n/// Complex::new(0.5, 0.0),\n\n/// Complex::new(0.25, 0.0),\n\n/// Complex::new(0.125, 0.0),\n\n/// ];\n\n///\n\n/// let output = batch_fir(&input, &taps, &mut state);\n\n/// ```\n\npub fn batch_fir<T>(\n\n input: &[Complex<T>],\n\n taps: &[Complex<T>],\n\n state: &mut Vec<Complex<T>>,\n\n) -> Vec<Complex<T>>\n\nwhere\n\n T: Num + Copy,\n\n{\n\n let mut output = Vec::new();\n\n for sample in input {\n\n state.rotate_right(1);\n\n state[0] = *sample;\n\n output.push(taps.iter().zip(state.iter()).map(|(x, y)| *x * *y).sum());\n\n }\n\n output\n\n}\n","file_path":"src/filter/fir.rs","rank":10,"score":80650.28385629607},{"content":"/// Gaussian filter impulse response.\n\n///\n\n/// Use this to create the taps for an FIR filter node and use that for a pulse\n\n/// shaping node.\n\n///\n\n/// # Arguments\n\n///\n\n/// * `n_taps` - Number of desired output taps\n\n/// * `sam_per_sym` - Samples per symbol\n\n/// * `alpha` - Shaping parameter of the function\n\n///\n\n/// # Example\n\n///\n\n/// ```\n\n/// use comms_rs::util::math::gaussian_taps;\n\n/// use num::Complex;\n\n///\n\n/// let n_taps = 28_u32;\n\n/// let sams_per_sym = 4.0_f64;\n\n/// let alpha = 0.25_f64;\n\n/// let taps: Vec<Complex<f64>> = gaussian_taps(n_taps, sams_per_sym, alpha).unwrap();\n\n/// ```\n\npub fn gaussian_taps<T>(\n\n n_taps: u32,\n\n sam_per_sym: f64,\n\n alpha: f64,\n\n) -> Option<Vec<Complex<T>>>\n\nwhere\n\n T: Copy + Num + num_traits::NumCast,\n\n{\n\n let tsym = 1.0_f64;\n\n let fs = sam_per_sym / tsym;\n\n\n\n let f =\n\n |t: f64| -> f64 { (alpha / PI).sqrt() * (-alpha * t.powi(2)).exp() };\n\n\n\n let mut taps = Vec::new();\n\n for i in 0..n_taps {\n\n let t = (f64::from(i) - f64::from(n_taps - 1) / 2.0) / fs;\n\n let value = T::from(f(t))?;\n\n let im = T::from(0)?;\n\n taps.push(Complex::new(value, im));\n\n }\n\n\n\n Some(taps)\n\n}\n\n\n","file_path":"src/util/math.rs","rank":11,"score":80647.61547523568},{"content":"/// Raise Cosine (RC) filter tap calculator.\n\n///\n\n/// Use this to create the taps for a FIR filter node and use that as your\n\n/// pulse shaping.\n\n///\n\n/// # Arguments\n\n///\n\n/// * `n_taps` - Number of desired output taps\n\n/// * `sam_per_sym` - Samples per symbol\n\n/// * `beta` - Shaping parameter of the RC function. Must be on the interval\n\n/// [0, 1].\n\n///\n\n/// # Examples\n\n///\n\n/// ```\n\n/// use comms_rs::util::math::rc_taps;\n\n/// use num::Complex;\n\n///\n\n/// let n_taps = 28u32;\n\n/// let sams_per_sym = 4.0_f64;\n\n/// let beta = 0.25_f64;\n\n/// let taps: Vec<Complex<f64>> = rc_taps(n_taps, sams_per_sym, beta).unwrap();\n\n/// ```\n\npub fn rc_taps<T>(\n\n n_taps: u32,\n\n sam_per_sym: f64,\n\n beta: f64,\n\n) -> Result<Vec<Complex<T>>, MathError>\n\nwhere\n\n T: Copy + Num + num_traits::NumCast,\n\n{\n\n if beta < 0.0 || beta > 1.0 {\n\n return Err(MathError::InvalidRolloffError);\n\n };\n\n\n\n let tsym = 1.0_f64;\n\n let fs = sam_per_sym / tsym;\n\n\n\n let fint = || -> f64 { (PI / (4.0 * tsym)) * sinc(1.0 / (2.0 * beta)) };\n\n\n\n let f = |t: f64| -> f64 {\n\n (1.0 / tsym) * sinc(t / tsym) * ((PI * beta * t) / tsym).cos()\n\n / (1.0 - ((2.0 * beta * t) / tsym).powi(2))\n","file_path":"src/util/math.rs","rank":12,"score":80647.38128276012},{"content":"/// Root Raised Cosine (RRC) filter tap calculator.\n\n///\n\n/// Use this to create the taps for an FIR filter node and use that as your\n\n/// pulse shaping.\n\n///\n\n/// # Arguments\n\n///\n\n/// * `n_taps` - Number of desired output taps\n\n/// * `sam_per_sym` - Samples per symbol\n\n/// * `beta` - Shaping parameter of the RRC function. Must be on the interval\n\n/// [0.0, 1.0].\n\n///\n\n/// # Examples\n\n///\n\n/// ```\n\n/// use comms_rs::util::math::rrc_taps;\n\n/// use num::Complex;\n\n///\n\n/// let n_taps = 28u32;\n\n/// let sams_per_sym = 4.0_f64;\n\n/// let beta = 0.25_f64;\n\n/// let taps: Vec<Complex<f64>> = rrc_taps(n_taps, sams_per_sym, beta).unwrap();\n\n/// ```\n\npub fn rrc_taps<T>(\n\n n_taps: u32,\n\n sam_per_sym: f64,\n\n beta: f64,\n\n) -> Result<Vec<Complex<T>>, MathError>\n\nwhere\n\n T: Copy + Num + num_traits::NumCast,\n\n{\n\n if beta < 0.0 || beta > 1.0 {\n\n return Err(MathError::InvalidRolloffError);\n\n };\n\n\n\n let tsym = 1.0_f64;\n\n let fs = sam_per_sym / tsym;\n\n\n\n let fzero = || -> f64 { (1.0 / tsym) * (1.0 + beta * (4.0 / PI - 1.0)) };\n\n\n\n let fint = || -> f64 {\n\n (beta / (tsym * 2.0_f64.sqrt()))\n\n * ((1.0 + 2.0 / PI) * (PI / (4.0 * beta)).sin()\n","file_path":"src/util/math.rs","rank":13,"score":80647.32434005407},{"content":"/// An example that will generate random numbers, pass them through a BPSK\n\n/// modulation and a pulse shaper, then broadcast them out to a file and\n\n/// via ZeroMQ for visualization.\n\nfn main() {\n\n // A simple node to perform BPSK modulation. Only broadcasts a message\n\n // once `num_samples` samples have been received and modulated.\n\n #[derive(Node, Default)]\n\n #[aggregate]\n\n struct BpskMod {\n\n input: NodeReceiver<u8>,\n\n num_samples: usize,\n\n state: Vec<Complex<f32>>,\n\n output: NodeSender<Vec<Complex<f32>>>,\n\n }\n\n\n\n impl BpskMod {\n\n pub fn new(num_samples: usize) -> Self {\n\n BpskMod {\n\n num_samples,\n\n state: vec![],\n\n ..Default::default()\n\n }\n\n }\n","file_path":"examples/bpsk_mod.rs","rank":14,"score":79709.09742135054},{"content":"/// Normalized sinc function implementation.\n\n///\n\n/// `sinc(0) = 1`\n\n///\n\n/// `sinc(x) = sin(pi * x) / (pi * x), x != 0`\n\n///\n\n/// # Examples\n\n///\n\n/// ```\n\n/// use comms_rs::util::math::sinc;\n\n///\n\n/// assert!((sinc(0.0) - 1.0).abs() < std::f64::EPSILON);\n\n/// assert!(sinc(1.0).abs() < std::f64::EPSILON);\n\n/// assert!(sinc(2.0).abs() < std::f64::EPSILON);\n\n/// assert!(sinc(3.0).abs() < std::f64::EPSILON);\n\n/// ```\n\npub fn sinc(x: f64) -> f64 {\n\n if x != 0.0 {\n\n (PI * x).sin() / (PI * x)\n\n } else {\n\n 1.0\n\n }\n\n}\n\n\n","file_path":"src/util/math.rs","rank":15,"score":74717.04588082223},{"content":"/// Calculates a phase estimate from the input QAM symbol vector.\n\n///\n\n/// Result is in radians, and the estimator assumes the input symbol vector is\n\n/// the output from a matched filter. It additionally assumes the vector has\n\n/// already gone through accurate timing recovery.\n\n///\n\n/// Reference Chp. 5.7.5 in Mengali.\n\n///\n\n/// # Arguments\n\n///\n\n/// * `symbols` - Input vector of symbols to calculate the phase estimate from.\n\n///\n\n/// # Examples\n\n///\n\n/// ```\n\n/// use comms_rs::demodulation::phase_estimator::*;\n\n/// use num::Complex;\n\n///\n\n/// let m = 4;\n\n/// let data: Vec<_> = (0..100).map(|x| Complex::new(0.0, x as f64).exp()).collect();\n\n///\n\n/// let estimate = qam_phase_estimate(&data);\n\n/// ```\n\npub fn qam_phase_estimate(symbols: &[Complex<f64>]) -> f64 {\n\n symbols\n\n .iter()\n\n .map(|x| -1.0 * x.powi(4))\n\n .sum::<Complex<f64>>()\n\n .arg()\n\n / 4.0\n\n}\n\n\n\n#[cfg(test)]\n\nmod test {\n\n use crate::demodulation::phase_estimator::*;\n\n use num::Complex;\n\n use rand::distributions::Uniform;\n\n use rand::prelude::*;\n\n use rand::rngs::SmallRng;\n\n use std::f64::consts::PI;\n\n\n\n #[test]\n\n fn test_psk_phase_estimator() {\n","file_path":"src/demodulation/phase_estimator.rs","rank":16,"score":63089.80981543998},{"content":"/// Constructs a node containing an open but uninitialized connection to an\n\n/// RTLSDR at the given index. Use RTLSDRNode::init_radio to set up the radio\n\n/// prior to running the node.\n\npub fn rtlsdr(index: i32) -> Result<RTLSDR, RTLSDRError> {\n\n let rtlsdr = rtlsdr::open(index)?;\n\n Ok(RTLSDR { rtlsdr })\n\n}\n\n\n\n#[cfg(test)]\n\nmod test {\n\n use crate::hardware::{radio, rtlsdr_radio};\n\n use std::time::Instant;\n\n\n\n use crate::prelude::*;\n\n use std::thread;\n\n\n\n #[test]\n\n #[cfg_attr(not(feature = \"rtlsdr_node\"), ignore)]\n\n // A quick test to check if we can read samples off the RTLSDR.\n\n fn test_get_samples() {\n\n let num_samples = 262144;\n\n let mut sdr = rtlsdr_radio::rtlsdr(0).unwrap();\n\n sdr.init_radio(88.7e6 as u32, 2.4e6 as u32, 0).unwrap();\n","file_path":"src/hardware/rtlsdr_radio.rs","rank":17,"score":61409.48216759188},{"content":"/// Calculates a phase estimate from the input PSK symbol vector.\n\n///\n\n/// Result is in radians, and the estimator assumes the input symbol vector is\n\n/// the output from a matched filter. It additionally assumes the vector has\n\n/// already gone through accurate timing recovery.\n\n///\n\n/// Reference Chp. 5.7.4 in Mengali.\n\n///\n\n/// # Arguments\n\n///\n\n/// * `symbols` - Input vector of symbols to calculate the phase estimate from.\n\n///\n\n/// # Examples\n\n///\n\n/// ```\n\n/// use comms_rs::demodulation::phase_estimator::*;\n\n/// use num::Complex;\n\n///\n\n/// let m = 4;\n\n/// let data: Vec<_> = (0..100).map(|x| Complex::new(0.0, x as f64).exp()).collect();\n\n///\n\n/// let estimate = psk_phase_estimate(&data, m);\n\n/// ```\n\npub fn psk_phase_estimate(symbols: &[Complex<f64>], m: u32) -> f64 {\n\n symbols\n\n .iter()\n\n .map(|x| x.powi(m as i32))\n\n .sum::<Complex<f64>>()\n\n .arg()\n\n / (m as f64)\n\n}\n\n\n","file_path":"src/demodulation/phase_estimator.rs","rank":18,"score":58502.1129323637},{"content":"/// Rectangle pulse shaping tap calculator.\n\n///\n\n/// Use this to create the taps for an FIR filter node and use that for the\n\n/// pulse shaping node.\n\n///\n\n/// # Arguments\n\n///\n\n/// * `n_taps` - Number of desired output taps\n\n///\n\n/// # Examples\n\n///\n\n/// ```\n\n/// use comms_rs::util::math::rect_taps;\n\n/// use num::Complex;\n\n///\n\n/// let n_taps = 12_usize;\n\n/// let taps: Vec<Complex<f64>> = rect_taps(n_taps).unwrap();\n\n/// ```\n\npub fn rect_taps<T>(n_taps: usize) -> Option<Vec<Complex<T>>>\n\nwhere\n\n T: Copy + Num + num_traits::NumCast,\n\n{\n\n let re = T::from(1)?;\n\n let im = T::from(0)?;\n\n Some(vec![Complex::new(re, im); n_taps as usize])\n\n}\n\n\n","file_path":"src/util/math.rs","rank":19,"score":57332.33120896624},{"content":"/// Creates a node derived from an input structure with a constructor and\n\n/// implements the Node trait.\n\n///\n\n/// Takes a given structure and from it derives a node-based structure\n\n/// with the sending and receiving out of the node hidden from the user so\n\n/// the user can just focus on the implementation. This function does some\n\n/// transformations on the input data structure's types depending on the name\n\n/// of the fields in the structure.\n\n///\n\n/// The implementation of the Node trait depends on whether #[aggregate] is\n\n/// specified on the structure or not. If it is, the Node will only send out\n\n/// data when it gets a Some(T) from the run() function, otherwise it will\n\n/// continue to the next iteration.\n\n///\n\n/// This macro currently assumes that the structure in question implements a\n\n/// function called `run()` which is exercised in the `call()` function from\n\n/// the Node trait. The return type of the run() depends on whether the\n\n/// #[aggregate] flag is specified on the input structure. If #[aggregate] is\n\n/// present on the structure, the return type must be an Option. Otherwise, it\n\n/// can be anything.\n\n///\n\n/// Fields that are receivers must be of type NodeReceiver<T>. Fields that are\n\n/// senders must be of type NodeSender<T>.\n\n///\n\n/// Example:\n\n/// ```no_run\n\n/// #[derive(Node)]\n\n/// pub struct Node1<T> where T: Into<u32> {\n\n/// input: NodeReceiver<T>,\n\n/// internal_state: u32,\n\n/// output: NodeSender<T>,\n\n/// }\n\n/// ```\n\n/// \n\npub fn node_derive(input: proc_macro::TokenStream) -> proc_macro::TokenStream {\n\n let input = parse_macro_input!(input as DeriveInput);\n\n let name = &input.ident;\n\n let generics = &input.generics;\n\n let (impl_generics, ty_generics, where_clause) = generics.split_for_impl();\n\n let attributes = &input.attrs;\n\n let mut aggregate = false;\n\n let mut pass_by_ref = false;\n\n for attr in attributes {\n\n match attr.parse_meta() {\n\n Ok(syn::Meta::Word(ref id)) if *id == \"aggregate\" => {\n\n aggregate = true\n\n }\n\n Ok(syn::Meta::Word(ref id)) if *id == \"pass_by_ref\" => {\n\n pass_by_ref = true\n\n }\n\n Ok(_) => continue,\n\n Err(_) => {\n\n let err = quote! {\n\n compile_error!(\"unrecognized attribute\");\n","file_path":"node_derive/src/lib.rs","rank":20,"score":55871.05244650427},{"content":"/// Casts a `Complex<T>` to a `Complex<U>`.\n\n///\n\n/// All of the normal caveats with using the `as` keyword apply here for the\n\n/// conversion.\n\n///\n\n/// # Examples\n\n///\n\n/// ```\n\n/// use comms_rs::util::math::cast_complex;\n\n/// use num::Complex;\n\n///\n\n/// let a_num = Complex::new(12_i16, -4_i16);\n\n/// let a_new_num: Complex<f64> = cast_complex(&a_num).unwrap();\n\n/// ```\n\npub fn cast_complex<T, U>(input: &Complex<T>) -> Option<Complex<U>>\n\nwhere\n\n T: Copy + Num + num_traits::NumCast,\n\n U: Copy + Num + num_traits::NumCast,\n\n{\n\n let re = U::from(input.re)?;\n\n let im = U::from(input.im)?;\n\n Some(Complex::new(re, im))\n\n}\n\n\n","file_path":"src/util/math.rs","rank":21,"score":54903.68098313138},{"content":"fn main() {\n\n let mut audio: AudioNode<f32> = AudioNode::new(1, 48000, 0.5);\n\n\n\n #[derive(Node)]\n\n struct SineNode {\n\n source: Box<dyn Source<Item = f32> + Send>,\n\n pub output: NodeSender<Vec<f32>>,\n\n }\n\n\n\n impl SineNode {\n\n pub fn new(source: Box<dyn Source<Item = f32> + Send>) -> Self {\n\n SineNode {\n\n source,\n\n output: Default::default(),\n\n }\n\n }\n\n\n\n pub fn run(&mut self) -> Result<Vec<f32>, NodeError> {\n\n let source = &mut self.source;\n\n let samp: Vec<f32> = source.take(48000).collect();\n","file_path":"examples/play_audio.rs","rank":22,"score":49433.06424986267},{"content":"fn main() {\n\n // Get the radio frequency (assumed to be MHz as an input) and convert to\n\n // Hz. If no input is specified, default to 88.7 MHz.\n\n let radio_mhz = std::env::args()\n\n .nth(1)\n\n .and_then(|s| str::parse::<f32>(&s).ok());\n\n let radio_freq = match radio_mhz {\n\n Some(f) => (f * 1e6) as u32,\n\n None => {\n\n println!(\"No frequency specified, defaulting to 88.7.\");\n\n 88.7e6 as u32\n\n }\n\n };\n\n\n\n // The taps for the first low pass filter before FM demodulation.\n\n #[cfg_attr(rustfmt, rustfmt_skip)]\n\n let taps = [\n\n -0.01801270027742274, -0.004656920885448867, -0.002648852132912597,\n\n 0.0008677368918448623, 0.005009212152225975, 0.008526175375849215,\n\n 0.010172968340398776, 0.00912437509989248, 0.005334905990231011,\n","file_path":"examples/fm_radio.rs","rank":23,"score":49433.06424986267},{"content":"/// An example that will generate random numbers, pass them through a QPSK\n\n/// modulation and a pulse shaper, then broadcast them out to a file and\n\n/// via ZeroMQ for visualization.\n\nfn main() {\n\n let now = Instant::now();\n\n\n\n #[derive(Node)]\n\n struct QpskMod {\n\n pub output: NodeSender<Vec<Complex<f32>>>,\n\n }\n\n impl QpskMod {\n\n pub fn new() -> Self {\n\n QpskMod {\n\n output: Default::default(),\n\n }\n\n }\n\n\n\n pub fn run(&mut self) -> Result<Vec<Complex<f32>>, NodeError> {\n\n let dist = Uniform::new(0u8, 2u8);\n\n let mut rng = rand::thread_rng();\n\n let mut bits: Vec<u8> = Vec::new();\n\n for _ in 0..4096 {\n\n bits.push(rng.sample(&dist));\n","file_path":"examples/qpsk_zmq.rs","rank":24,"score":49433.06424986267},{"content":"/// An example that will generate random numbers, pass them through a QPSK\n\n/// modulation and a pulse shaper, then broadcast them out to a file and\n\n/// via ZeroMQ for visualization.\n\nfn main() {\n\n let mut rng = rand::thread_rng();\n\n let sam_per_sym = 4.0;\n\n let taps: Vec<Complex<f32>> =\n\n math::rrc_taps(32, sam_per_sym, 0.25).unwrap();\n\n let mut state: Vec<Complex<f32>> = vec![Complex::zero(); 32];\n\n let mut writer = BufWriter::new(File::create(\"./qpsk_out.bin\").unwrap());\n\n let now = Instant::now();\n\n let dist = Uniform::new(0u8, 2u8);\n\n\n\n loop {\n\n let mut bits: Vec<u8> = Vec::new();\n\n for _ in 0..4096 {\n\n bits.push(rng.sample(&dist));\n\n }\n\n let qpsk_mod: Vec<Complex<f32>> = bits\n\n .iter()\n\n .step_by(2)\n\n .zip(bits.iter().skip(1).step_by(2))\n\n .map(|(x, y)| {\n","file_path":"examples/single_thread_qpsk.rs","rank":25,"score":47979.68983001612},{"content":"/// An example that will generate random numbers, pass them through a BPSK\n\n/// modulation and a pulse shaper, then broadcast them out to a file and\n\n/// via ZeroMQ for visualization.\n\nfn main() {\n\n let mut rng = rand::thread_rng();\n\n let sam_per_sym = 4.0;\n\n let taps: Vec<Complex<f32>> =\n\n math::rrc_taps(32, sam_per_sym, 0.25).unwrap();\n\n let mut state: Vec<Complex<f32>> = vec![Complex::zero(); 32];\n\n let mut writer = BufWriter::new(File::create(\"./bpsk_out.bin\").unwrap());\n\n let now = Instant::now();\n\n let dist = Uniform::new(0u8, 2u8);\n\n\n\n loop {\n\n let mut bits: Vec<u8> = Vec::new();\n\n for _ in 0..4096 {\n\n bits.push(rng.sample(&dist));\n\n }\n\n let bpsk_mod: Vec<Complex<f32>> = bits\n\n .iter()\n\n .map(|x| Complex::new(f32::from(*x) * 2.0 - 1.0, 0.0))\n\n .collect();\n\n let mut upsample = vec![Complex::zero(); 4096 * 4];\n","file_path":"examples/single_thread_bpsk.rs","rank":26,"score":47979.68983001612},{"content":"struct ParsedFields<'a> {\n\n recv_fields: Vec<&'a syn::Field>,\n\n send_fields: Vec<&'a syn::Field>,\n\n}\n\n\n\n#[proc_macro_derive(Node, attributes(aggregate, pass_by_ref))]\n","file_path":"node_derive/src/lib.rs","rank":27,"score":45358.26200748177},{"content":"extern crate node_derive;\n\n#[macro_use]\n\nextern crate comms_rs;\n\n\n\nuse comms_rs::prelude::*;\n\nuse std::thread;\n\n\n\n#[derive(Node)]\n\npub struct Node1 {\n\n output: NodeSender<u32>,\n\n}\n\n\n\nimpl Node1 {\n\n fn new() -> Self {\n\n Node1 {\n\n output: Default::default(),\n\n }\n\n }\n\n\n\n fn run(&mut self) -> Result<u32, NodeError> {\n","file_path":"tests/macro_tests.rs","rank":28,"score":42288.81262493639},{"content":"#[macro_use]\n\nextern crate comms_rs;\n\n\n\nuse comms_rs::prelude::*;\n\nuse std::thread;\n\nuse std::time::Duration;\n\n\n\n#[test]\n","file_path":"tests/node_test.rs","rank":29,"score":42283.84567701762},{"content":" Ok(1)\n\n }\n\n}\n\n\n\n#[derive(Node)]\n\npub struct Node2 {\n\n recv_input: NodeReceiver<u32>,\n\n stuff: u32,\n\n output: NodeSender<u32>,\n\n}\n\n\n\nimpl Node2 {\n\n fn new(stuff: u32) -> Self {\n\n Node2 {\n\n stuff,\n\n recv_input: Default::default(),\n\n output: Default::default(),\n\n }\n\n }\n\n\n","file_path":"tests/macro_tests.rs","rank":30,"score":42277.995459399644},{"content":" pub input: NodeReceiver<u32>,\n\n }\n\n\n\n impl SinkNode {\n\n pub fn new() -> Self {\n\n SinkNode {\n\n input: Default::default(),\n\n }\n\n }\n\n\n\n pub fn run(&mut self, input: u32) -> Result<(), NodeError> {\n\n assert_eq!(input, 1);\n\n Ok(())\n\n }\n\n }\n\n\n\n let mut node = SourceNode::new();\n\n let mut node2 = SinkNode::new();\n\n connect_nodes!(node, output, node2, input);\n\n start_nodes!(node, node2);\n\n thread::sleep(Duration::from_secs(1));\n\n}\n","file_path":"tests/node_test.rs","rank":31,"score":42277.0053293621},{"content":" fn run(&mut self, x: u32) -> Result<u32, NodeError> {\n\n assert_eq!(x, 1);\n\n Ok(x + self.stuff)\n\n }\n\n}\n\n\n\n#[derive(Node)]\n\npub struct Node3 {\n\n recv_input: NodeReceiver<u32>,\n\n}\n\n\n\nimpl Node3 {\n\n fn new() -> Self {\n\n Node3 {\n\n recv_input: Default::default(),\n\n }\n\n }\n\n\n\n fn run(&mut self, x: u32) -> Result<(), NodeError> {\n\n assert_eq!(x, 6);\n\n Ok(())\n\n }\n\n}\n\n\n\n#[test]\n","file_path":"tests/macro_tests.rs","rank":32,"score":42276.73973636939},{"content":"/// A trait to capture the ability to send samples out of the hardware\n\n/// platform on a particular output.\n\npub trait RadioTx<T> {\n\n fn send_samples(&mut self, samples: &[T], output_idx: usize);\n\n}\n\n\n","file_path":"src/hardware/radio.rs","rank":33,"score":40557.73460283367},{"content":"/// A trait to capture the ability to receive samples from the hardware\n\n/// platform on a particular input.\n\npub trait RadioRx<T> {\n\n fn recv_samples(&mut self, num_samples: usize, input_idx: usize) -> Vec<T>;\n\n}\n\n\n\n/// A node that takes a generic hardware platform that supports transmitting\n\n/// samples.\n\n#[derive(Node)]\n\n#[pass_by_ref]\n\npub struct RadioTxNode<T, U>\n\nwhere\n\n T: RadioTx<U> + Send,\n\n U: Clone + Send,\n\n{\n\n pub input: NodeReceiver<Vec<U>>,\n\n radio: T,\n\n output_idx: usize,\n\n}\n\n\n\nimpl<T, U> RadioTxNode<T, U>\n\nwhere\n","file_path":"src/hardware/radio.rs","rank":34,"score":40550.44584628129},{"content":"fn parse_type(field: &syn::Field) -> FieldType {\n\n let ty = &field.ty;\n\n let type_str = quote! {#ty}.to_string();\n\n if type_str.starts_with(\"NodeReceiver\") {\n\n FieldType::Input\n\n } else if type_str.starts_with(\"NodeSender\") {\n\n FieldType::Output\n\n } else {\n\n FieldType::State\n\n }\n\n}\n","file_path":"node_derive/src/lib.rs","rank":35,"score":33200.607251486785},{"content":"fn parse_fields(fields: &syn::FieldsNamed) -> ParsedFields {\n\n let mut recv_fields = vec![];\n\n let mut send_fields = vec![];\n\n for field in &fields.named {\n\n match parse_type(&field) {\n\n FieldType::Input => recv_fields.push(field),\n\n FieldType::Output => send_fields.push(field),\n\n _ => continue,\n\n }\n\n }\n\n ParsedFields {\n\n recv_fields,\n\n send_fields,\n\n }\n\n}\n\n\n","file_path":"node_derive/src/lib.rs","rank":36,"score":32383.290157025967},{"content":" use rand::{thread_rng, Rng};\n\n use std::sync::{Arc, Mutex};\n\n use std::thread;\n\n use std::time::{Duration, Instant};\n\n\n\n use crate::node::graph::Graph;\n\n use crate::prelude::*;\n\n use rayon;\n\n\n\n #[test]\n\n /// Constructs a simple network with two nodes: one source and one sink.\n\n fn test_simple_nodes() {\n\n #[derive(Node)]\n\n struct Node1 {\n\n pub output: NodeSender<u32>,\n\n }\n\n\n\n impl Node1 {\n\n pub fn new() -> Self {\n\n Node1 {\n","file_path":"src/node/mod.rs","rank":37,"score":31847.311145337255},{"content":"//! Nodes for general input/output support, such as file IO, audio, and ZeroMQ.\n\n\n\n#[cfg(feature = \"zmq_node\")]\n\nextern crate zmq;\n\n\n\n#[cfg(feature = \"audio_node\")]\n\nextern crate rodio;\n\n\n\n#[cfg(feature = \"audio_node\")]\n\npub mod audio;\n\n\n\n#[cfg(feature = \"zmq_node\")]\n\npub mod zmq_node;\n\n\n\npub mod raw_iq;\n","file_path":"src/io/mod.rs","rank":38,"score":31846.103205669468},{"content":" ($n1:ident, $send:ident, $n2:ident, $recv:ident, $default:tt) => {{\n\n let (send, recv) = channel::unbounded();\n\n $n1.$send.push((send, Some($default)));\n\n $n2.$recv = Some(recv);\n\n }};\n\n}\n\n\n\n/// Spawns a thread for each node in order and starts nodes to run\n\n/// indefinitely.\n\n///\n\n/// # Example\n\n///\n\n/// ```\n\n/// # #[macro_use] extern crate comms_rs;\n\n/// # use comms_rs::prelude::*;\n\n/// # use std::thread;\n\n/// # fn main() {\n\n/// # #[derive(Node)]\n\n/// # struct Node1 {\n\n/// # pub output: NodeSender<u32>,\n","file_path":"src/node/mod.rs","rank":39,"score":31845.807651698888},{"content":" thread::sleep(Duration::from_secs(1));\n\n assert!(check.join().is_ok());\n\n }\n\n\n\n #[test]\n\n /// A test to ensure that persistent state works within the nodes. Makes\n\n /// two nodes: one to send 1 to 10 and the other to add the number to a\n\n /// counter within the node.\n\n fn test_counter() {\n\n #[derive(Node)]\n\n struct OneNode {\n\n count: i32,\n\n output: NodeSender<i32>,\n\n }\n\n\n\n impl OneNode {\n\n pub fn new() -> Self {\n\n OneNode {\n\n count: 0,\n\n output: Default::default(),\n","file_path":"src/node/mod.rs","rank":40,"score":31845.308918603325},{"content":" $n2.$recv = Some(recv);\n\n }};\n\n}\n\n\n\n/// Connects two nodes together in a feedback configuration using channels.\n\n/// When the nodes are connected in feedback, a specified value is sent\n\n/// through the channel immediately so that the nodes don't deadlock on\n\n/// the first iteration.\n\n///\n\n/// ```\n\n/// # #[macro_use] extern crate comms_rs;\n\n/// # use comms_rs::prelude::*;\n\n/// # fn main() {\n\n/// # #[derive(Node)]\n\n/// # struct Node1 {\n\n/// # output: NodeSender<u32>,\n\n/// # }\n\n/// #\n\n/// # impl Node1 {\n\n/// # pub fn new() -> Self {\n","file_path":"src/node/mod.rs","rank":41,"score":31844.829633301546},{"content":" output: NodeSender<Vec<Complex<U>>>,\n\n }\n\n\n\n impl<T, U> ConvertNode<T, U>\n\n where\n\n T: Copy + Num + NumCast + Send,\n\n U: Copy + Num + NumCast + Send,\n\n {\n\n pub fn new() -> Self {\n\n ConvertNode {\n\n input: Default::default(),\n\n output: Default::default(),\n\n }\n\n }\n\n\n\n pub fn run(\n\n &mut self,\n\n input: Vec<Complex<T>>,\n\n ) -> Result<Vec<Complex<U>>, NodeError> {\n\n let out: Vec<Complex<U>> = input\n","file_path":"examples/bpsk_mod.rs","rank":42,"score":31844.649928353523},{"content":"//! Provides an infrastructure to create processing nodes, connect nodes\n\n//! together via crossbeam channels, and start nodes running in their own\n\n//! independent threads.\n\n//!\n\n//! # Example\n\n//!\n\n//! ```\n\n//! #[macro_use] extern crate comms_rs;\n\n//! use comms_rs::prelude::*;\n\n//! use std::thread;\n\n//!\n\n//! // Creates two nodes: a source and a sink node. For nodes that receive\n\n//! // inputs, the receivers must explicitly be named.\n\n//! #[derive(Node)]\n\n//! struct Node1 {\n\n//! pub output: NodeSender<u32>,\n\n//! }\n\n//!\n\n//! impl Node1 {\n\n//! pub fn new() -> Self {\n","file_path":"src/node/mod.rs","rank":43,"score":31844.510973531575},{"content":"//! Provides interfaces to hardware platforms and generic traits to encapsulate\n\n//! radio functionality.\n\n//!\n\n\n\n#[cfg(feature = \"rtlsdr_node\")]\n\nextern crate rtlsdr;\n\n\n\n#[cfg(feature = \"rtlsdr_node\")]\n\npub mod rtlsdr_radio;\n\n\n\npub mod radio;\n","file_path":"src/hardware/mod.rs","rank":44,"score":31842.592233065352},{"content":"/// # use comms_rs::prelude::*;\n\n/// # use std::thread;\n\n///\n\n/// # fn main() {\n\n/// # #[derive(Node)]\n\n/// # struct Node1 {\n\n/// # pub output: NodeSender<u32>,\n\n/// # }\n\n///\n\n/// # impl Node1 {\n\n/// # pub fn new() -> Self {\n\n/// # Node1 {\n\n/// # output: Default::default(),\n\n/// # }\n\n/// # }\n\n/// #\n\n/// # pub fn run(&mut self) -> Result<u32, NodeError> {\n\n/// # Ok(1)\n\n/// # }\n\n/// # }\n","file_path":"src/node/mod.rs","rank":45,"score":31842.470181540677},{"content":" });\n\n assert!(check.join().is_ok());\n\n }\n\n\n\n #[test]\n\n /// Constructs a simple network with two nodes: one source and one sink.\n\n fn test_simple_graph() {\n\n #[derive(Node)]\n\n struct Node1 {\n\n pub output: NodeSender<u32>,\n\n }\n\n\n\n impl Node1 {\n\n pub fn new() -> Self {\n\n Node1 {\n\n output: Default::default(),\n\n }\n\n }\n\n\n\n pub fn run(&mut self) -> Result<u32, NodeError> {\n","file_path":"src/node/mod.rs","rank":46,"score":31841.911748784038},{"content":"//! Nodes for performing FFTs and IFFTs.\n\n\n\npub mod fft_node;\n\n\n\nuse num::Complex;\n\nuse num::NumCast;\n\nuse rustfft::num_complex::Complex as FFTComplex;\n\nuse rustfft::num_traits::Num;\n\nuse rustfft::num_traits::Zero;\n\nuse rustfft::FFT;\n\nuse std::sync::Arc;\n\n\n\n/// Batch based wrapper of FFT implementation provided by\n\n/// [RustFFT](https://github.com/awelkie/RustFFT).\n\n///\n\n/// This implementation acts on a batch of samples at a time. The underlying\n\n/// library only provides an FFT for type `f64`, so this wrapper will\n\n/// automatically cast any provided input appropriately, although it does\n\n/// expect the general form of `Complex<T>`.\n\npub struct BatchFFT {\n","file_path":"src/fft/mod.rs","rank":47,"score":31841.855888134636},{"content":"\n\n pub fn run(\n\n &mut self,\n\n input: u8,\n\n ) -> Result<Option<Vec<Complex<f32>>>, NodeError> {\n\n let samp: f32 = num::cast(input).unwrap();\n\n self.state.push(Complex::new(samp * 2.0 - 1.0, 0.0));\n\n if self.state.len() == self.num_samples {\n\n let state_cl = self.state.clone();\n\n self.state = vec![];\n\n Ok(Some(state_cl))\n\n } else {\n\n Ok(None)\n\n }\n\n }\n\n }\n\n\n\n // A simple node to perform upsampling of data. Zeros are injected here;\n\n // filtering takes place elsewhere.\n\n #[derive(Node)]\n","file_path":"examples/bpsk_mod.rs","rank":48,"score":31841.40247385945},{"content":" #[test]\n\n /// Performs a _very_ simplistic throughput analysis. We generate\n\n /// 10000 random i16 values at a time and pass it through the pipeline\n\n /// to see if channels will handle the throughput we hope it will.\n\n /// Make sure to run this test with --release.\n\n fn test_threadpool_throughput() {\n\n #[derive(Node)]\n\n struct Node1 {\n\n pub output: NodeSender<Arc<Vec<i16>>>,\n\n }\n\n\n\n impl Node1 {\n\n pub fn new() -> Self {\n\n Node1 {\n\n output: Default::default(),\n\n }\n\n }\n\n\n\n pub fn run(&mut self) -> Result<Arc<Vec<i16>>, NodeError> {\n\n let mut random = vec![0i16; 10000];\n","file_path":"src/node/mod.rs","rank":49,"score":31841.070241606776},{"content":"\n\n let mut node1 = Node1::new();\n\n let mut node2 = Node2::new();\n\n let mut node3 = Node3::new();\n\n\n\n connect_nodes!(node1, output, node2, input);\n\n connect_nodes!(node2, output, node3, input);\n\n start_nodes!(node1, node3);\n\n start_nodes_threadpool!(node2,);\n\n thread::sleep(Duration::from_secs(1));\n\n }\n\n\n\n #[test]\n\n /// Constructs a network where a node receives from two different nodes.\n\n /// This serves to make sure that fan-in operation works as we expect\n\n /// it to.\n\n fn test_fan_in() {\n\n use crate::prelude::*;\n\n use std::thread;\n\n use std::time::Duration;\n","file_path":"src/node/mod.rs","rank":50,"score":31840.653667132454},{"content":" struct UpsampleNode<T>\n\n where\n\n T: Zero + Copy + Send,\n\n {\n\n input: NodeReceiver<Vec<T>>,\n\n upsample_factor: usize,\n\n output: NodeSender<Vec<T>>,\n\n }\n\n\n\n impl<T> UpsampleNode<T>\n\n where\n\n T: Zero + Copy + Send,\n\n {\n\n pub fn new(upsample_factor: usize) -> Self {\n\n UpsampleNode {\n\n upsample_factor,\n\n input: Default::default(),\n\n output: Default::default(),\n\n }\n\n }\n","file_path":"examples/bpsk_mod.rs","rank":51,"score":31840.253977236705},{"content":" write!(f, \"Math error: {}\", desc)\n\n }\n\n}\n\n\n\nimpl error::Error for MathError {}\n\n\n\n/// Some basic math functions used elsewhere in the project\n\npub mod math;\n\n/// Some nodes to aid in the generation of random numbers\n\npub mod rand_node;\n\n/// Some nodes to aid in resampling signals\n\npub mod resample_node;\n","file_path":"src/util/mod.rs","rank":52,"score":31839.50812913321},{"content":"/// # connect_nodes!(node1, output, node2, input);\n\n/// // Connect two nodes named node1 and node2. node1 will now send its\n\n/// // messages to node2. node2 will receive the\n\n/// // message on its receiver named `input`.\n\n/// start_nodes_threadpool!(node1, node2);\n\n/// # }\n\n/// ```\n\n#[macro_export]\n\nmacro_rules! start_nodes_threadpool {\n\n ($($node:ident),+ $(,)?) => {\n\n $(\n\n rayon::spawn(move || {\n\n $node.start();\n\n });\n\n )*\n\n }\n\n}\n\n\n\n#[cfg(test)]\n\nmod test {\n","file_path":"src/node/mod.rs","rank":53,"score":31839.505913402907},{"content":"/// ```\n\n#[macro_export]\n\nmacro_rules! start_nodes {\n\n ($($node:ident),+ $(,)?) => {\n\n $(\n\n thread::spawn(move || {\n\n $node.start();\n\n });\n\n )*\n\n }\n\n}\n\n\n\n/// Spawns a thread from a Rayon threadpool for each node in order and starts\n\n/// nodes to run indefinitely.\n\n///\n\n/// # Example\n\n///\n\n/// ```\n\n/// # #[macro_use] extern crate comms_rs;\n\n/// # extern crate rayon;\n","file_path":"src/node/mod.rs","rank":54,"score":31839.16856665775},{"content":"/// # pub fn new() -> Self {\n\n/// # Node2 {\n\n/// # input: Default::default(),\n\n/// # }\n\n/// # }\n\n/// #\n\n/// # pub fn run(&mut self, x: u32) -> Result<(), NodeError> {\n\n/// # assert_eq!(x, 1);\n\n/// # Ok(())\n\n/// # }\n\n/// # }\n\n/// # let mut node1 = Node1::new();\n\n/// # let mut node2 = Node2::new();\n\n/// # connect_nodes!(node1, output, node2, input);\n\n///\n\n/// // Connect two nodes named node1 and node2. node1 will now send its\n\n/// // messages to node2. node2 will receive the\n\n/// // message on its receiver named `input`.\n\n/// start_nodes!(node1, node2);\n\n/// # }\n","file_path":"src/node/mod.rs","rank":55,"score":31838.55187829938},{"content":" {\n\n let check = check.lock().unwrap();\n\n assert!(*check);\n\n }\n\n }\n\n\n\n #[test]\n\n /// Constructs a network with three nodes: two aggregating data and one\n\n /// simple node. Node1 is actually doing aggregation whereas Node2\n\n /// operates as a simple node but exists to ensure that there are no\n\n /// errors in the macro. This test also demonstrates how Arc can be\n\n /// used to pass around references through the channels much easier,\n\n /// saving on potential expensive copies.\n\n fn test_aggregate_nodes() {\n\n #[derive(Node)]\n\n #[aggregate]\n\n struct Node1 {\n\n agg: Vec<u32>,\n\n pub output: NodeSender<Arc<Vec<u32>>>,\n\n }\n","file_path":"src/node/mod.rs","rank":56,"score":31838.541631148582},{"content":"use comms_rs::filter::fir_node::BatchFirNode;\n\nuse comms_rs::io::raw_iq::IQBatchOutput;\n\nuse comms_rs::node::graph::Graph;\n\nuse comms_rs::prelude::*;\n\nuse comms_rs::util::math;\n\nuse comms_rs::util::rand_node;\n\nuse num::{Complex, Num, NumCast, Zero};\n\nuse std::fs::File;\n\nuse std::io::BufWriter;\n\nuse std::sync::{Arc, Mutex};\n\nuse std::thread;\n\nuse std::time::Duration;\n\n\n\n/// An example that will generate random numbers, pass them through a BPSK\n\n/// modulation and a pulse shaper, then broadcast them out to a file and\n\n/// via ZeroMQ for visualization.\n","file_path":"examples/bpsk_mod.rs","rank":57,"score":31838.50904264467},{"content":"/// # }\n\n///\n\n/// # impl Node1 {\n\n/// # pub fn new() -> Self {\n\n/// # Node1 {\n\n/// # output: Default::default(),\n\n/// # }\n\n/// # }\n\n/// #\n\n/// # pub fn run(&mut self) -> Result<u32, NodeError> {\n\n/// # Ok(1)\n\n/// # }\n\n/// # }\n\n///\n\n/// # #[derive(Node)]\n\n/// # struct Node2 {\n\n/// # pub input: NodeReceiver<u32>,\n\n/// # }\n\n///\n\n/// # impl Node2 {\n","file_path":"src/node/mod.rs","rank":58,"score":31838.42802230971},{"content":"\n\n #[derive(Node)]\n\n #[pass_by_ref]\n\n struct Node2 {\n\n pub input: NodeReceiver<Arc<Vec<u32>>>,\n\n pub output: NodeSender<Arc<Vec<u32>>>,\n\n }\n\n\n\n impl Node2 {\n\n pub fn new() -> Self {\n\n Node2 {\n\n input: Default::default(),\n\n output: Default::default(),\n\n }\n\n }\n\n\n\n pub fn run(\n\n &mut self,\n\n input: &Arc<Vec<u32>>,\n\n ) -> Result<Arc<Vec<u32>>, NodeError> {\n","file_path":"src/node/mod.rs","rank":59,"score":31838.367359692584},{"content":" output: Default::default(),\n\n }\n\n }\n\n\n\n pub fn run(&mut self) -> Result<u32, NodeError> {\n\n Ok(1)\n\n }\n\n }\n\n\n\n #[derive(Node)]\n\n struct Node2 {\n\n pub input: NodeReceiver<u32>,\n\n }\n\n\n\n impl Node2 {\n\n pub fn new() -> Self {\n\n Node2 {\n\n input: Default::default(),\n\n }\n\n }\n","file_path":"src/node/mod.rs","rank":60,"score":31838.34639488312},{"content":"\n\n // Creates a node that takes no inputs and returns a value.\n\n #[derive(Node)]\n\n struct NoInputNode {\n\n output: NodeSender<u32>,\n\n }\n\n\n\n impl NoInputNode {\n\n pub fn new() -> Self {\n\n NoInputNode {\n\n output: Default::default(),\n\n }\n\n }\n\n\n\n pub fn run(&mut self) -> Result<u32, NodeError> {\n\n Ok(1)\n\n }\n\n }\n\n\n\n #[derive(Node)]\n","file_path":"src/node/mod.rs","rank":61,"score":31838.335173809664},{"content":" thread_rng().fill(random.as_mut_slice());\n\n Ok(Arc::new(random))\n\n }\n\n }\n\n\n\n #[derive(Node)]\n\n #[pass_by_ref]\n\n struct Node2 {\n\n pub input: NodeReceiver<Arc<Vec<i16>>>,\n\n pub output: NodeSender<Arc<Vec<i16>>>,\n\n }\n\n\n\n impl Node2 {\n\n pub fn new() -> Self {\n\n Node2 {\n\n input: Default::default(),\n\n output: Default::default(),\n\n }\n\n }\n\n\n","file_path":"src/node/mod.rs","rank":62,"score":31838.2823216712},{"content":"//! Node1 {\n\n//! output: Default::default(),\n\n//! }\n\n//! }\n\n//!\n\n//! pub fn run(&mut self) -> Result<u32, NodeError> {\n\n//! Ok(1)\n\n//! }\n\n//! }\n\n//!\n\n//! #[derive(Node)]\n\n//! struct Node2 {\n\n//! pub input: NodeReceiver<u32>,\n\n//! }\n\n//!\n\n//! impl Node2 {\n\n//! pub fn new() -> Self {\n\n//! Node2 {\n\n//! input: Default::default(),\n\n//! }\n","file_path":"src/node/mod.rs","rank":63,"score":31838.266258964697},{"content":"/// # output: Default::default(),\n\n/// # }\n\n/// # }\n\n/// #\n\n/// # pub fn run(&mut self) -> Result<u32, NodeError> {\n\n/// # Ok(1)\n\n/// # }\n\n/// # }\n\n/// #\n\n/// # #[derive(Node)]\n\n/// # struct Node2 {\n\n/// # input: NodeReceiver<u32>,\n\n/// # }\n\n/// #\n\n/// # impl Node2 {\n\n/// # pub fn new() -> Self {\n\n/// # Node2 {\n\n/// # input: Default::default(),\n\n/// # }\n\n/// # }\n","file_path":"src/node/mod.rs","rank":64,"score":31838.046719069287},{"content":" pub fn new() -> Self {\n\n Node3 {\n\n count: 0,\n\n input: Default::default(),\n\n }\n\n }\n\n\n\n pub fn run(\n\n &mut self,\n\n _val: &Arc<Vec<i16>>,\n\n ) -> Result<(), NodeError> {\n\n self.count += 1;\n\n if self.count == 40000 {\n\n println!(\n\n \"test_threadpool_throughput: Hit goal of 400 million i16 sent.\"\n\n );\n\n }\n\n Ok(())\n\n }\n\n }\n","file_path":"src/node/mod.rs","rank":65,"score":31838.028228007508},{"content":"\n\n pub fn run(&mut self, input: Vec<T>) -> Result<Vec<T>, NodeError> {\n\n let mut out = vec![T::zero(); input.len() * self.upsample_factor];\n\n let mut ix = 0;\n\n for val in input {\n\n out[ix] = val;\n\n ix += self.upsample_factor;\n\n }\n\n Ok(out)\n\n }\n\n }\n\n\n\n // A generic node to convert from one complex type to another.\n\n #[derive(Node)]\n\n struct ConvertNode<T, U>\n\n where\n\n T: Copy + Num + NumCast + Send,\n\n U: Copy + Num + NumCast + Send,\n\n {\n\n input: NodeReceiver<Vec<Complex<T>>>,\n","file_path":"examples/bpsk_mod.rs","rank":66,"score":31838.020197686776},{"content":" impl Node1 {\n\n pub fn new() -> Self {\n\n Node1 {\n\n output: Default::default(),\n\n }\n\n }\n\n\n\n pub fn run(&mut self) -> Result<Arc<Vec<i16>>, NodeError> {\n\n let mut random = vec![0i16; 10000];\n\n thread_rng().fill(random.as_mut_slice());\n\n Ok(Arc::new(random))\n\n }\n\n }\n\n\n\n #[derive(Node)]\n\n #[pass_by_ref]\n\n struct Node2 {\n\n pub input: NodeReceiver<Arc<Vec<i16>>>,\n\n pub output: NodeSender<Arc<Vec<i16>>>,\n\n }\n","file_path":"src/node/mod.rs","rank":67,"score":31837.979913595045},{"content":"/// # Node1 {\n\n/// # output: Default::default(),\n\n/// # }\n\n/// # }\n\n/// #\n\n/// # pub fn run(&mut self) -> Result<u32, NodeError> {\n\n/// # Ok(1)\n\n/// # }\n\n/// # }\n\n/// #\n\n/// # #[derive(Node)]\n\n/// # struct Node2 {\n\n/// # input: NodeReceiver<u32>,\n\n/// # }\n\n/// #\n\n/// # impl Node2 {\n\n/// # pub fn new() -> Self {\n\n/// # Node2 {\n\n/// # input: Default::default(),\n\n/// # }\n","file_path":"src/node/mod.rs","rank":68,"score":31837.960734664728},{"content":" struct AnotherNode {\n\n output: NodeSender<f64>,\n\n }\n\n\n\n impl AnotherNode {\n\n pub fn new() -> Self {\n\n AnotherNode {\n\n output: Default::default(),\n\n }\n\n }\n\n\n\n pub fn run(&mut self) -> Result<f64, NodeError> {\n\n Ok(2.0)\n\n }\n\n }\n\n\n\n // Creates a node that takes a u32 and a f64, returns a f32, and names\n\n // the receivers recv_u and recv_f.\n\n #[derive(Node)]\n\n struct DoubleInputNode {\n","file_path":"src/node/mod.rs","rank":69,"score":31837.916673462456},{"content":" pub fft: Arc<dyn FFT<f64>>,\n\n pub fft_size: usize,\n\n}\n\n\n\nimpl BatchFFT {\n\n /// Creates a new `BatchFFT`.\n\n ///\n\n /// Requires an FFT plan from the RustFFT crate.\n\n ///\n\n /// # Arguments\n\n ///\n\n /// * `fft` - FFT plan to be executed in this implementation.\n\n /// * `fft_size` - Size of the FFT to be performed.\n\n ///\n\n /// # Examples\n\n ///\n\n /// ```\n\n /// use comms_rs::fft::*;\n\n /// use rustfft::FFTplanner;\n\n ///\n","file_path":"src/fft/mod.rs","rank":70,"score":31837.912983584156},{"content":"///\n\n/// This implementation acts on a sample at a time. The underlying library\n\n/// only provides an FFT for type `f64`, so this wrapper will automatically\n\n/// cast any provided input appropriately, although it does expect the general\n\n/// form of `Complex<T>`.\n\npub struct SampleFFT<T> {\n\n pub fft: Arc<dyn FFT<f64>>,\n\n pub fft_size: usize,\n\n pub samples: Vec<Complex<T>>,\n\n}\n\n\n\nimpl<T> SampleFFT<T>\n\nwhere\n\n T: NumCast + Copy + Num,\n\n{\n\n /// Creates a new `SampleFFT`.\n\n ///\n\n /// Requires an FFT plan from the RustFFT crate.\n\n ///\n\n /// # Arguments\n","file_path":"src/fft/mod.rs","rank":71,"score":31837.71416746113},{"content":" output: NodeSender<i32>,\n\n }\n\n\n\n impl PrintNode {\n\n pub fn new() -> Self {\n\n PrintNode {\n\n count: 0,\n\n input: Default::default(),\n\n output: Default::default(),\n\n }\n\n }\n\n\n\n pub fn run(&mut self, val: i32) -> Result<i32, NodeError> {\n\n self.count = val;\n\n Ok(val)\n\n }\n\n }\n\n\n\n let mut add_node = AddNode::new();\n\n let mut print_node = PrintNode::new();\n","file_path":"src/node/mod.rs","rank":72,"score":31837.65790372658},{"content":"//! Nodes for demodulating signals.\n\npub mod nco;\n\npub mod phase_estimator;\n\npub mod timing_estimator;\n","file_path":"src/demodulation/mod.rs","rank":73,"score":31837.65122100358},{"content":"//! Nodes for modulating and demodulating signals.\n\n\n\npub mod analog;\n\npub mod analog_node;\n\npub mod digital;\n","file_path":"src/modulation/mod.rs","rank":74,"score":31837.65122100358},{"content":" input1: NodeReceiver<u32>,\n\n input2: NodeReceiver<f64>,\n\n output: NodeSender<f32>,\n\n }\n\n\n\n impl DoubleInputNode {\n\n pub fn new() -> Self {\n\n DoubleInputNode {\n\n input1: Default::default(),\n\n input2: Default::default(),\n\n output: Default::default(),\n\n }\n\n }\n\n\n\n pub fn run(&mut self, x: u32, y: f64) -> Result<f32, NodeError> {\n\n Ok((f64::from(x) + y) as f32)\n\n }\n\n }\n\n\n\n #[derive(Node)]\n","file_path":"src/node/mod.rs","rank":75,"score":31837.595532643212},{"content":" }\n\n }\n\n\n\n pub fn run(&mut self) -> Result<i32, NodeError> {\n\n self.count += 1;\n\n Ok(self.count)\n\n }\n\n }\n\n\n\n #[derive(Node)]\n\n struct CounterNode {\n\n input: NodeReceiver<i32>,\n\n count: i32,\n\n output: NodeSender<i32>,\n\n }\n\n\n\n impl CounterNode {\n\n pub fn new() -> Self {\n\n CounterNode {\n\n count: 0,\n","file_path":"src/node/mod.rs","rank":76,"score":31837.55421345403},{"content":"\n\n impl Node2 {\n\n pub fn new() -> Self {\n\n Node2 {\n\n input: Default::default(),\n\n output: Default::default(),\n\n }\n\n }\n\n\n\n pub fn run(\n\n &mut self,\n\n x: &Arc<Vec<i16>>,\n\n ) -> Result<Arc<Vec<i16>>, NodeError> {\n\n let mut y = Arc::clone(&x);\n\n for z in Arc::make_mut(&mut y).iter_mut() {\n\n *z = z.saturating_add(1);\n\n }\n\n Ok(y)\n\n }\n\n }\n","file_path":"src/node/mod.rs","rank":77,"score":31837.401725449658},{"content":"\n\n impl Node1 {\n\n pub fn new() -> Self {\n\n Node1 {\n\n agg: vec![],\n\n output: Default::default(),\n\n }\n\n }\n\n\n\n pub fn run(&mut self) -> Result<Option<Arc<Vec<u32>>>, NodeError> {\n\n if self.agg.len() < 2 {\n\n self.agg.push(1);\n\n Ok(None)\n\n } else {\n\n let val = self.agg.clone();\n\n self.agg = vec![];\n\n Ok(Some(Arc::new(val)))\n\n }\n\n }\n\n }\n","file_path":"src/node/mod.rs","rank":78,"score":31837.32749300274},{"content":" node3.call().unwrap();\n\n if now.elapsed().as_secs() >= 1 {\n\n break;\n\n }\n\n }\n\n });\n\n assert!(check.join().is_ok());\n\n }\n\n\n\n #[test]\n\n /// Performs a _very_ simplistic throughput analysis. We generate\n\n /// 10000 random i16 values at a time and pass it through the pipeline\n\n /// to see if channels will handle the throughput we hope it will.\n\n /// Make sure to run this test with --release.\n\n fn test_throughput() {\n\n #[derive(Node)]\n\n struct Node1 {\n\n pub output: NodeSender<Arc<Vec<i16>>>,\n\n }\n\n\n","file_path":"src/node/mod.rs","rank":79,"score":31837.25534498059},{"content":" /// ```\n\n /// use comms_rs::fft::*;\n\n /// use num::{Complex, Zero};\n\n /// use rustfft::FFTplanner;\n\n ///\n\n /// let fft_size = 1024;\n\n /// let mut planner = FFTplanner::new(false);\n\n /// let fft = planner.plan_fft(fft_size);\n\n /// let mut batch_fft = BatchFFT::new(fft, fft_size);\n\n ///\n\n /// let result: Vec<Complex<f64>> = batch_fft.run_fft(&vec![Complex::zero(); fft_size][..]);\n\n /// ```\n\n pub fn run_fft<T>(&mut self, data: &[Complex<T>]) -> Vec<Complex<T>>\n\n where\n\n T: NumCast + Copy + Num,\n\n {\n\n // Convert the input type from interleaved values to Complex<f32>.\n\n let mut input: Vec<FFTComplex<f64>> = data\n\n .iter()\n\n .map(|x| {\n","file_path":"src/fft/mod.rs","rank":80,"score":31837.20939287407},{"content":"\n\n impl AddNode {\n\n pub fn new() -> Self {\n\n AddNode {\n\n count: 1,\n\n input: Default::default(),\n\n output: Default::default(),\n\n }\n\n }\n\n\n\n pub fn run(&mut self, val: i32) -> Result<i32, NodeError> {\n\n self.count += val;\n\n Ok(self.count)\n\n }\n\n }\n\n\n\n #[derive(Node)]\n\n struct PrintNode {\n\n input: NodeReceiver<i32>,\n\n count: i32,\n","file_path":"src/node/mod.rs","rank":81,"score":31837.182872650556},{"content":"\n\npub mod graph;\n\n\n\nuse std::error;\n\nuse std::fmt;\n\n\n\n#[derive(Clone, Debug)]\n\npub enum NodeError {\n\n DataError,\n\n PermanentError,\n\n DataEnd,\n\n CommError,\n\n}\n\n\n\nimpl fmt::Display for NodeError {\n\n fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {\n\n let desc = match *self {\n\n NodeError::DataError => \"unable to access data\",\n\n NodeError::PermanentError => \"unable to continue executing node\",\n\n NodeError::DataEnd => \"end of data source\",\n","file_path":"src/node/mod.rs","rank":82,"score":31837.113737814696},{"content":"/// #\n\n/// # pub fn run(&mut self, x: u32) -> Result<(), NodeError> {\n\n/// # assert_eq!(x, 1);\n\n/// # Ok(())\n\n/// # }\n\n/// # }\n\n/// let mut node1 = Node1::new();\n\n/// let mut node2 = Node2::new();\n\n///\n\n/// // node1 will now send its messages to node2. node2 will receive the\n\n/// // message on its receiver named `input`.\n\n/// connect_nodes!(node1, output, node2, input);\n\n/// # }\n\n/// ```\n\n///\n\n#[macro_export]\n\nmacro_rules! connect_nodes {\n\n ($n1:ident, $send:ident, $n2:ident, $recv:ident) => {{\n\n let (send, recv) = channel::unbounded();\n\n $n1.$send.push((send, None));\n","file_path":"src/node/mod.rs","rank":83,"score":31837.089027107246},{"content":" }\n\n }\n\n\n\n /// Runs the `SampleFFT`.\n\n ///\n\n /// Takes input `Complex<T>` and performs the FFT specified in\n\n /// construction, and returns the resulting output.\n\n ///\n\n /// # Examples\n\n ///\n\n /// ```\n\n /// use comms_rs::fft::*;\n\n /// use num::{Complex, Zero};\n\n /// use rustfft::FFTplanner;\n\n ///\n\n /// let fft_size = 1024;\n\n /// let mut planner = FFTplanner::new(false);\n\n /// let fft = planner.plan_fft(fft_size);\n\n /// let mut sample_fft: SampleFFT<f64> = SampleFFT::new(fft, fft_size);\n\n /// sample_fft.samples = vec![Complex::zero(); fft_size];\n","file_path":"src/fft/mod.rs","rank":84,"score":31836.629185887916},{"content":"/// # }\n\n/// #\n\n/// # pub fn run(&mut self, x: u32) -> Result<(), NodeError> {\n\n/// # assert_eq!(x, 1);\n\n/// # Ok(())\n\n/// # }\n\n/// # }\n\n/// let mut node1 = Node1::new();\n\n/// let mut node2 = Node2::new();\n\n///\n\n/// // node1 will now send its messages to node2. node2 will receive the\n\n/// // message on its receiver named `input`. When node1 starts, it will send\n\n/// // a 0 to node2 the first time it's run by start_nodes! and run a normal\n\n/// // loop afterwards.\n\n/// connect_nodes_feedback!(node1, output, node2, input, 0);\n\n/// # }\n\n/// ```\n\n///\n\n#[macro_export]\n\nmacro_rules! connect_nodes_feedback {\n","file_path":"src/node/mod.rs","rank":85,"score":31836.045546835623},{"content":"\n\n let check = thread::spawn(move || {\n\n for _ in 0..10 {\n\n count_node.call().unwrap();\n\n }\n\n assert_eq!(count_node.count, 55);\n\n });\n\n\n\n assert!(check.join().is_ok());\n\n }\n\n\n\n #[test]\n\n /// A test to verify that feedback will work.\n\n fn test_feedback() {\n\n #[derive(Node)]\n\n struct AddNode {\n\n input: NodeReceiver<i32>,\n\n count: i32,\n\n output: NodeSender<i32>,\n\n }\n","file_path":"src/node/mod.rs","rank":86,"score":31835.334093573478},{"content":"\n\n #[derive(Node)]\n\n #[pass_by_ref]\n\n struct Node3 {\n\n pub input: NodeReceiver<Arc<Vec<i16>>>,\n\n count: u32,\n\n }\n\n\n\n impl Node3 {\n\n pub fn new() -> Self {\n\n Node3 {\n\n count: 0,\n\n input: Default::default(),\n\n }\n\n }\n\n\n\n pub fn run(\n\n &mut self,\n\n _val: &Arc<Vec<i16>>,\n\n ) -> Result<(), NodeError> {\n","file_path":"src/node/mod.rs","rank":87,"score":31835.24636338699},{"content":" Ok(1)\n\n }\n\n }\n\n\n\n #[derive(Node)]\n\n struct Node2 {\n\n pub input: NodeReceiver<u32>,\n\n pub check: Arc<Mutex<bool>>,\n\n }\n\n\n\n impl Node2 {\n\n pub fn new(check: Arc<Mutex<bool>>) -> Self {\n\n Node2 {\n\n input: Default::default(),\n\n check,\n\n }\n\n }\n\n\n\n pub fn run(&mut self, x: u32) -> Result<(), NodeError> {\n\n let mut check = self.check.lock().unwrap();\n","file_path":"src/node/mod.rs","rank":88,"score":31835.24032054455},{"content":"///\n\n/// # #[derive(Node)]\n\n/// # struct Node2 {\n\n/// # pub input: NodeReceiver<u32>,\n\n/// # }\n\n///\n\n/// # impl Node2 {\n\n/// # pub fn new() -> Self {\n\n/// # Node2 {\n\n/// # input: Default::default(),\n\n/// # }\n\n/// # }\n\n/// #\n\n/// # pub fn run(&mut self, x: u32) -> Result<(), NodeError> {\n\n/// # assert_eq!(x, 1);\n\n/// # Ok(())\n\n/// # }\n\n/// # }\n\n/// # let mut node1 = Node1::new();\n\n/// # let mut node2 = Node2::new();\n","file_path":"src/node/mod.rs","rank":89,"score":31835.200289404926},{"content":"//! }\n\n//!\n\n//! pub fn run(&mut self, x: u32) -> Result<(), NodeError> {\n\n//! assert_eq!(x, 1);\n\n//! Ok(())\n\n//! }\n\n//! }\n\n//!\n\n//! // Now that the structures are created, the user can now instantiate their\n\n//! // nodes and pass in closures for the nodes to execute.\n\n//! let mut node1 = Node1::new();\n\n//! let mut node2 = Node2::new();\n\n//!\n\n//! // Create a connection between two nodes: node1 sending messages and node2\n\n//! // receiving on the `input` receiver in the Node2 structure.\n\n//! connect_nodes!(node1, output, node2, input);\n\n//!\n\n//! // Spawn threads for node1 and node2 and have them executing indefinitely.\n\n//! start_nodes!(node1, node2);\n\n//! ```\n","file_path":"src/node/mod.rs","rank":90,"score":31835.08965641627},{"content":" let mut y = Arc::clone(&input);\n\n for z in Arc::make_mut(&mut y).iter_mut() {\n\n *z += 1;\n\n }\n\n Ok(y)\n\n }\n\n }\n\n\n\n #[derive(Node)]\n\n #[pass_by_ref]\n\n struct Node3 {\n\n pub input: NodeReceiver<Arc<Vec<u32>>>,\n\n }\n\n\n\n impl Node3 {\n\n pub fn new() -> Self {\n\n Node3 {\n\n input: Default::default(),\n\n }\n\n }\n","file_path":"src/node/mod.rs","rank":91,"score":31834.991109823564},{"content":" connect_nodes!(add_node, output, print_node, input);\n\n connect_nodes_feedback!(print_node, output, add_node, input, 0);\n\n start_nodes!(add_node);\n\n let check = thread::spawn(move || {\n\n for (print, val) in &print_node.output {\n\n match val {\n\n Some(v) => print.send(*v).unwrap(),\n\n None => continue,\n\n }\n\n }\n\n for _ in 0..10 {\n\n print_node.call().unwrap();\n\n }\n\n assert_eq!(print_node.count, 512);\n\n });\n\n assert!(check.join().is_ok());\n\n }\n\n}\n","file_path":"src/node/mod.rs","rank":92,"score":31834.749816776806},{"content":" self.count += 1;\n\n if self.count == 40000 {\n\n println!(\n\n \"test_throughput: Hit goal of 400 million i16 sent.\"\n\n );\n\n }\n\n Ok(())\n\n }\n\n }\n\n\n\n let mut node1 = Node1::new();\n\n let mut node2 = Node2::new();\n\n let mut node3 = Node3::new();\n\n\n\n connect_nodes!(node1, output, node2, input);\n\n connect_nodes!(node2, output, node3, input);\n\n start_nodes!(node1, node2, node3);\n\n thread::sleep(Duration::from_secs(1));\n\n }\n\n\n","file_path":"src/node/mod.rs","rank":93,"score":31834.552014440473},{"content":" struct CheckNode {\n\n input: NodeReceiver<f32>,\n\n }\n\n\n\n impl CheckNode {\n\n pub fn new() -> Self {\n\n CheckNode {\n\n input: Default::default(),\n\n }\n\n }\n\n\n\n pub fn run(&mut self, x: f32) -> Result<(), NodeError> {\n\n assert!(x - 3.0f32 < std::f32::EPSILON, \"Fan-out failed.\");\n\n Ok(())\n\n }\n\n }\n\n\n\n // Now, you can instantiate your nodes as usual.\n\n let mut node1 = NoInputNode::new();\n\n let mut node2 = AnotherNode::new();\n","file_path":"src/node/mod.rs","rank":94,"score":31834.251006164803},{"content":" input: Default::default(),\n\n output: Default::default(),\n\n }\n\n }\n\n\n\n pub fn run(&mut self, val: i32) -> Result<i32, NodeError> {\n\n self.count += val;\n\n Ok(self.count)\n\n }\n\n }\n\n\n\n let mut one_node = OneNode::new();\n\n let mut count_node = CounterNode::new();\n\n connect_nodes!(one_node, output, count_node, input);\n\n\n\n thread::spawn(move || {\n\n for _ in 0..10 {\n\n one_node.call().unwrap();\n\n }\n\n });\n","file_path":"src/node/mod.rs","rank":95,"score":31834.177284708723},{"content":"\n\n pub fn run(\n\n &mut self,\n\n input: &Arc<Vec<u32>>,\n\n ) -> Result<(), NodeError> {\n\n assert_eq!(**input, vec![2, 2]);\n\n Ok(())\n\n }\n\n }\n\n\n\n let mut node1 = Node1::new();\n\n let mut node2 = Node2::new();\n\n let mut node3 = Node3::new();\n\n\n\n connect_nodes!(node1, output, node2, input);\n\n connect_nodes!(node2, output, node3, input);\n\n start_nodes!(node1, node2);\n\n let check = thread::spawn(move || {\n\n let now = Instant::now();\n\n loop {\n","file_path":"src/node/mod.rs","rank":96,"score":31833.984851357603},{"content":"//! Utility nodes that don't fit into any specific category and helper\n\n//! functions for developing your own nodes.\n\n\n\nuse std::error;\n\nuse std::fmt;\n\n\n\n#[derive(Clone, Debug)]\n\npub enum MathError {\n\n ConvertError,\n\n InvalidRolloffError,\n\n}\n\n\n\nimpl fmt::Display for MathError {\n\n fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {\n\n let desc = match *self {\n\n MathError::ConvertError => \"Type conversion from generic failed\",\n\n MathError::InvalidRolloffError => {\n\n \"Invalid rolloff parameter, must be on interval [0.0, 1.0]\"\n\n }\n\n };\n","file_path":"src/util/mod.rs","rank":97,"score":31833.922627013046},{"content":" ///\n\n /// let result: Vec<Complex<f64>> = sample_fft.run_fft();\n\n /// ```\n\n pub fn run_fft(&mut self) -> Vec<Complex<T>> {\n\n let mut input: Vec<FFTComplex<f64>> = self\n\n .samples\n\n .iter()\n\n .map(|x| {\n\n FFTComplex::new(x.re.to_f64().unwrap(), x.im.to_f64().unwrap())\n\n })\n\n .collect();\n\n let mut output: Vec<FFTComplex<f64>> =\n\n vec![FFTComplex::zero(); self.fft_size];\n\n self.fft.process(&mut input[..], &mut output[..]);\n\n\n\n // After the FFT, convert back to interleaved values.\n\n let res: Vec<Complex<T>> = output\n\n .iter()\n\n .map(|x| {\n\n Complex::new(T::from(x.re).unwrap(), T::from(x.im).unwrap())\n\n })\n\n .collect();\n\n res\n\n }\n\n}\n","file_path":"src/fft/mod.rs","rank":98,"score":31833.761075749688},{"content":" ///\n\n /// * `fft` - FFT plan to be executed in this implementation.\n\n /// * `fft_size` - Size of the FFT to be performed.\n\n ///\n\n /// # Examples\n\n ///\n\n /// ```\n\n /// use comms_rs::fft::*;\n\n /// use rustfft::FFTplanner;\n\n ///\n\n /// let fft_size = 1024;\n\n /// let mut planner = FFTplanner::new(false);\n\n /// let fft = planner.plan_fft(fft_size);\n\n /// let sample_fft: SampleFFT<f64> = SampleFFT::new(fft, fft_size);\n\n /// ```\n\n pub fn new(fft: Arc<dyn FFT<f64>>, fft_size: usize) -> SampleFFT<T> {\n\n SampleFFT {\n\n fft,\n\n fft_size,\n\n samples: Vec::new(),\n","file_path":"src/fft/mod.rs","rank":99,"score":31833.62399485333}],"string":"[\n {\n \"content\": \"/// Modulates a byte via BPSK into 8 int16 samples\\n\\npub fn bpsk_byte_mod(byte: u8) -> Vec<Complex<i16>> {\\n\\n (0..8)\\n\\n .map(|i| bpsk_bit_mod(((1_u8 << i) & byte).rotate_right(i)).unwrap())\\n\\n .collect()\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/modulation/digital.rs\",\n \"rank\": 0,\n \"score\": 114674.74686400298\n },\n {\n \"content\": \"/// Modulates a bit to a complex int16 impulse via BPSK\\n\\npub fn bpsk_bit_mod(bit: u8) -> Option<Complex<i16>> {\\n\\n if bit == 0 {\\n\\n Some(Complex::new(1, 0))\\n\\n } else if bit == 1 {\\n\\n Some(Complex::new(-1, 0))\\n\\n } else {\\n\\n None\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/modulation/digital.rs\",\n \"rank\": 1,\n \"score\": 114674.74686400298\n },\n {\n \"content\": \"/// Modulates a byte via QPSK into 4 int16 samples\\n\\npub fn qpsk_byte_mod(byte: u8) -> Vec<Complex<i16>> {\\n\\n (0..8)\\n\\n .step_by(2)\\n\\n .map(|i| qpsk_bit_mod(((3_u8 << i) & byte).rotate_right(i)).unwrap())\\n\\n .collect()\\n\\n}\\n\\n\\n\\n#[cfg(test)]\\n\\nmod test {\\n\\n use super::*;\\n\\n use num::Complex;\\n\\n\\n\\n #[test]\\n\\n fn test_bpsk_bit() {\\n\\n assert_eq!(bpsk_bit_mod(0_u8).unwrap(), Complex::new(1, 0));\\n\\n assert_eq!(bpsk_bit_mod(1_u8).unwrap(), Complex::new(-1, 0));\\n\\n }\\n\\n\\n\\n #[test]\\n\\n fn test_qpsk_bit() {\\n\",\n \"file_path\": \"src/modulation/digital.rs\",\n \"rank\": 2,\n \"score\": 114674.74686400298\n },\n {\n \"content\": \"/// Modulates a pair of bits to a complex int16 impulse via QPSK\\n\\npub fn qpsk_bit_mod(bits: u8) -> Option<Complex<i16>> {\\n\\n if bits == 0 {\\n\\n Some(Complex::new(1, 1))\\n\\n } else if bits == 1 {\\n\\n Some(Complex::new(-1, 1))\\n\\n } else if bits == 2 {\\n\\n Some(Complex::new(1, -1))\\n\\n } else if bits == 3 {\\n\\n Some(Complex::new(-1, -1))\\n\\n } else {\\n\\n None\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/modulation/digital.rs\",\n \"rank\": 3,\n \"score\": 114674.74686400298\n },\n {\n \"content\": \"/// The trait that all nodes in the library implement.\\n\\npub trait Node: Send {\\n\\n fn start(&mut self);\\n\\n fn call(&mut self) -> Result<(), NodeError>;\\n\\n fn is_connected(&self) -> bool;\\n\\n}\\n\\n\\n\\n/// Connects two nodes together with crossbeam channels.\\n\\n///\\n\\n/// ```\\n\\n/// # #[macro_use] extern crate comms_rs;\\n\\n/// # use comms_rs::prelude::*;\\n\\n/// # fn main() {\\n\\n/// # #[derive(Node)]\\n\\n/// # struct Node1 {\\n\\n/// # output: NodeSender<u32>,\\n\\n/// # }\\n\\n/// #\\n\\n/// # impl Node1 {\\n\\n/// # pub fn new() -> Self {\\n\\n/// # Node1 {\\n\",\n \"file_path\": \"src/node/mod.rs\",\n \"rank\": 4,\n \"score\": 112282.60057911389\n },\n {\n \"content\": \"/// Builds a closure for generating 0 or 1 with a Uniform distrubition.\\n\\n///\\n\\n/// # Examples\\n\\n///\\n\\n/// ```\\n\\n/// use comms_rs::util::rand_node::random_bit;\\n\\n///\\n\\n/// let node = random_bit();\\n\\n/// ```\\n\\npub fn random_bit() -> UniformNode<u8> {\\n\\n UniformNode::new(0u8, 2u8)\\n\\n}\\n\\n\\n\\n#[cfg(test)]\\n\\nmod test {\\n\\n use crate::util::rand_node;\\n\\n use std::thread;\\n\\n use std::time::Instant;\\n\\n\\n\\n use crate::prelude::*;\\n\\n\\n\\n #[test]\\n\\n // A basic test that just makes sure the node doesn't crash.\\n\\n fn test_normal() {\\n\\n let mut norm_node = rand_node::NormalNode::new(0.0, 1.0);\\n\\n let check = thread::spawn(move || {\\n\\n let now = Instant::now();\\n\\n loop {\\n\\n norm_node.call().unwrap();\\n\",\n \"file_path\": \"src/util/rand_node.rs\",\n \"rank\": 5,\n \"score\": 107691.82470161495\n },\n {\n \"content\": \"#[test]\\n\\nfn test_macro() {\\n\\n let mut node1 = Node1::new();\\n\\n\\n\\n let mut node2 = Node2::new(5);\\n\\n\\n\\n let mut node3 = Node3::new();\\n\\n\\n\\n connect_nodes!(node1, output, node2, recv_input);\\n\\n connect_nodes!(node2, output, node3, recv_input);\\n\\n\\n\\n thread::spawn(move || {\\n\\n node1.call().unwrap();\\n\\n });\\n\\n\\n\\n thread::spawn(move || {\\n\\n node2.call().unwrap();\\n\\n });\\n\\n\\n\\n node3.call().unwrap();\\n\\n}\\n\",\n \"file_path\": \"tests/macro_tests.rs\",\n \"rank\": 6,\n \"score\": 92349.61495203678\n },\n {\n \"content\": \"#[test]\\n\\nfn simple_nodes() {\\n\\n #[derive(Node)]\\n\\n struct SourceNode {\\n\\n pub output: NodeSender<u32>,\\n\\n }\\n\\n\\n\\n impl SourceNode {\\n\\n pub fn new() -> Self {\\n\\n SourceNode {\\n\\n output: Default::default(),\\n\\n }\\n\\n }\\n\\n\\n\\n pub fn run(&mut self) -> Result<u32, NodeError> {\\n\\n Ok(1)\\n\\n }\\n\\n }\\n\\n\\n\\n #[derive(Node)]\\n\\n struct SinkNode {\\n\",\n \"file_path\": \"tests/node_test.rs\",\n \"rank\": 7,\n \"score\": 87663.93546720617\n },\n {\n \"content\": \"/// Implementation of the Mengali qfilter tap calculator.\\n\\n///\\n\\n/// This is specifically to support Mengali's feedforward non data aided\\n\\n/// maximum likelihood estimator described in chp. 8.4 of his book as q(t).\\n\\n///\\n\\n/// # Arguments\\n\\n///\\n\\n/// * `n_taps` - Number of desired output taps. Only takes odd numbers. Even\\n\\n/// numbers will be incremented by one and that shall be used\\n\\n/// intead.\\n\\n/// * `alpha` - Shaping parameter of the function. Must be on the interval\\n\\n/// [0.0, 1.0].\\n\\n/// * `sam_per_sym` - Samples per symbol\\n\\n///\\n\\n/// # Examples\\n\\n///\\n\\n/// ```\\n\\n/// use comms_rs::util::math::qfilt_taps;\\n\\n/// use num::Complex;\\n\\n///\\n\\n/// let n_taps = 21;\\n\\n/// let alpha = 0.25;\\n\\n/// let sams_per_sym = 2;\\n\\n/// let taps: Vec<f64> = qfilt_taps(n_taps, alpha, sams_per_sym).unwrap();\\n\\n/// ```\\n\\npub fn qfilt_taps(\\n\\n n_taps: u32,\\n\\n alpha: f64,\\n\\n sam_per_sym: u32,\\n\\n) -> Result<Vec<f64>, MathError> {\\n\\n if alpha < 0.0 || alpha > 1.0 {\\n\\n return Err(MathError::InvalidRolloffError);\\n\\n };\\n\\n\\n\\n // We want an odd number of taps\\n\\n let mut real_n_taps = n_taps;\\n\\n if n_taps % 2 == 0 {\\n\\n real_n_taps += 1;\\n\\n }\\n\\n\\n\\n let d = ((real_n_taps as f64) / 2.0).floor() as i32;\\n\\n let ttarr: Vec<f64> = (0..real_n_taps)\\n\\n .map(|x| (x as i32 - d) as f64 / (sam_per_sym as f64))\\n\\n .collect();\\n\\n\\n\",\n \"file_path\": \"src/util/math.rs\",\n \"rank\": 8,\n \"score\": 87569.41548045655\n },\n {\n \"content\": \"/// Implementation of run for the FirNode.\\n\\n///\\n\\n/// # Arguments\\n\\n///\\n\\n/// * `input` - Input sample to be filtered.\\n\\n/// * `taps` - FIR filter taps.\\n\\n/// * `state` - FIR filter initial internal state.\\n\\n///\\n\\n/// # Examples\\n\\n///\\n\\n/// ```\\n\\n/// use comms_rs::filter::fir::*;\\n\\n/// use num::Complex;\\n\\n///\\n\\n/// let input = Complex::new(1.2_f64, -0.747_f64);\\n\\n/// let taps = vec![\\n\\n/// Complex::new(0.2, 0.0),\\n\\n/// Complex::new(0.6, 0.0),\\n\\n/// Complex::new(0.6, 0.0),\\n\\n/// Complex::new(0.2, 0.0),\\n\\n/// ];\\n\\n///\\n\\n/// let mut state = vec![\\n\\n/// Complex::new(1.0, 0.0),\\n\\n/// Complex::new(0.5, 0.0),\\n\\n/// Complex::new(0.25, 0.0),\\n\\n/// Complex::new(0.125, 0.0),\\n\\n/// ];\\n\\n///\\n\\n/// let output = fir(&input, &taps, &mut state);\\n\\n/// ```\\n\\npub fn fir<T>(\\n\\n input: &Complex<T>,\\n\\n taps: &[Complex<T>],\\n\\n state: &mut Vec<Complex<T>>,\\n\\n) -> Complex<T>\\n\\nwhere\\n\\n T: Num + Copy,\\n\\n{\\n\\n state.rotate_right(1);\\n\\n state[0] = *input;\\n\\n taps.iter().zip(state.iter()).map(|(x, y)| *x * *y).sum()\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/filter/fir.rs\",\n \"rank\": 9,\n \"score\": 83078.53822239142\n },\n {\n \"content\": \"/// Implementation of run for the BatchFirNode.\\n\\n///\\n\\n/// # Arguments\\n\\n///\\n\\n/// * `input` - Input batch of samples to be filtered.\\n\\n/// * `taps` - FIR filter taps.\\n\\n/// * `state` - FIR filter initial internal state.\\n\\n///\\n\\n/// # Examples\\n\\n///\\n\\n/// ```\\n\\n/// use comms_rs::filter::fir::*;\\n\\n/// use num::Complex;\\n\\n///\\n\\n/// let input: Vec<Complex<f64>> = (0..100).map(|x| Complex::new((x as f64).cos(), 0.0)).collect();\\n\\n/// let taps = vec![\\n\\n/// Complex::new(0.2, 0.0),\\n\\n/// Complex::new(0.6, 0.0),\\n\\n/// Complex::new(0.6, 0.0),\\n\\n/// Complex::new(0.2, 0.0),\\n\\n/// ];\\n\\n///\\n\\n/// let mut state = vec![\\n\\n/// Complex::new(1.0, 0.0),\\n\\n/// Complex::new(0.5, 0.0),\\n\\n/// Complex::new(0.25, 0.0),\\n\\n/// Complex::new(0.125, 0.0),\\n\\n/// ];\\n\\n///\\n\\n/// let output = batch_fir(&input, &taps, &mut state);\\n\\n/// ```\\n\\npub fn batch_fir<T>(\\n\\n input: &[Complex<T>],\\n\\n taps: &[Complex<T>],\\n\\n state: &mut Vec<Complex<T>>,\\n\\n) -> Vec<Complex<T>>\\n\\nwhere\\n\\n T: Num + Copy,\\n\\n{\\n\\n let mut output = Vec::new();\\n\\n for sample in input {\\n\\n state.rotate_right(1);\\n\\n state[0] = *sample;\\n\\n output.push(taps.iter().zip(state.iter()).map(|(x, y)| *x * *y).sum());\\n\\n }\\n\\n output\\n\\n}\\n\",\n \"file_path\": \"src/filter/fir.rs\",\n \"rank\": 10,\n \"score\": 80650.28385629607\n },\n {\n \"content\": \"/// Gaussian filter impulse response.\\n\\n///\\n\\n/// Use this to create the taps for an FIR filter node and use that for a pulse\\n\\n/// shaping node.\\n\\n///\\n\\n/// # Arguments\\n\\n///\\n\\n/// * `n_taps` - Number of desired output taps\\n\\n/// * `sam_per_sym` - Samples per symbol\\n\\n/// * `alpha` - Shaping parameter of the function\\n\\n///\\n\\n/// # Example\\n\\n///\\n\\n/// ```\\n\\n/// use comms_rs::util::math::gaussian_taps;\\n\\n/// use num::Complex;\\n\\n///\\n\\n/// let n_taps = 28_u32;\\n\\n/// let sams_per_sym = 4.0_f64;\\n\\n/// let alpha = 0.25_f64;\\n\\n/// let taps: Vec<Complex<f64>> = gaussian_taps(n_taps, sams_per_sym, alpha).unwrap();\\n\\n/// ```\\n\\npub fn gaussian_taps<T>(\\n\\n n_taps: u32,\\n\\n sam_per_sym: f64,\\n\\n alpha: f64,\\n\\n) -> Option<Vec<Complex<T>>>\\n\\nwhere\\n\\n T: Copy + Num + num_traits::NumCast,\\n\\n{\\n\\n let tsym = 1.0_f64;\\n\\n let fs = sam_per_sym / tsym;\\n\\n\\n\\n let f =\\n\\n |t: f64| -> f64 { (alpha / PI).sqrt() * (-alpha * t.powi(2)).exp() };\\n\\n\\n\\n let mut taps = Vec::new();\\n\\n for i in 0..n_taps {\\n\\n let t = (f64::from(i) - f64::from(n_taps - 1) / 2.0) / fs;\\n\\n let value = T::from(f(t))?;\\n\\n let im = T::from(0)?;\\n\\n taps.push(Complex::new(value, im));\\n\\n }\\n\\n\\n\\n Some(taps)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/util/math.rs\",\n \"rank\": 11,\n \"score\": 80647.61547523568\n },\n {\n \"content\": \"/// Raise Cosine (RC) filter tap calculator.\\n\\n///\\n\\n/// Use this to create the taps for a FIR filter node and use that as your\\n\\n/// pulse shaping.\\n\\n///\\n\\n/// # Arguments\\n\\n///\\n\\n/// * `n_taps` - Number of desired output taps\\n\\n/// * `sam_per_sym` - Samples per symbol\\n\\n/// * `beta` - Shaping parameter of the RC function. Must be on the interval\\n\\n/// [0, 1].\\n\\n///\\n\\n/// # Examples\\n\\n///\\n\\n/// ```\\n\\n/// use comms_rs::util::math::rc_taps;\\n\\n/// use num::Complex;\\n\\n///\\n\\n/// let n_taps = 28u32;\\n\\n/// let sams_per_sym = 4.0_f64;\\n\\n/// let beta = 0.25_f64;\\n\\n/// let taps: Vec<Complex<f64>> = rc_taps(n_taps, sams_per_sym, beta).unwrap();\\n\\n/// ```\\n\\npub fn rc_taps<T>(\\n\\n n_taps: u32,\\n\\n sam_per_sym: f64,\\n\\n beta: f64,\\n\\n) -> Result<Vec<Complex<T>>, MathError>\\n\\nwhere\\n\\n T: Copy + Num + num_traits::NumCast,\\n\\n{\\n\\n if beta < 0.0 || beta > 1.0 {\\n\\n return Err(MathError::InvalidRolloffError);\\n\\n };\\n\\n\\n\\n let tsym = 1.0_f64;\\n\\n let fs = sam_per_sym / tsym;\\n\\n\\n\\n let fint = || -> f64 { (PI / (4.0 * tsym)) * sinc(1.0 / (2.0 * beta)) };\\n\\n\\n\\n let f = |t: f64| -> f64 {\\n\\n (1.0 / tsym) * sinc(t / tsym) * ((PI * beta * t) / tsym).cos()\\n\\n / (1.0 - ((2.0 * beta * t) / tsym).powi(2))\\n\",\n \"file_path\": \"src/util/math.rs\",\n \"rank\": 12,\n \"score\": 80647.38128276012\n },\n {\n \"content\": \"/// Root Raised Cosine (RRC) filter tap calculator.\\n\\n///\\n\\n/// Use this to create the taps for an FIR filter node and use that as your\\n\\n/// pulse shaping.\\n\\n///\\n\\n/// # Arguments\\n\\n///\\n\\n/// * `n_taps` - Number of desired output taps\\n\\n/// * `sam_per_sym` - Samples per symbol\\n\\n/// * `beta` - Shaping parameter of the RRC function. Must be on the interval\\n\\n/// [0.0, 1.0].\\n\\n///\\n\\n/// # Examples\\n\\n///\\n\\n/// ```\\n\\n/// use comms_rs::util::math::rrc_taps;\\n\\n/// use num::Complex;\\n\\n///\\n\\n/// let n_taps = 28u32;\\n\\n/// let sams_per_sym = 4.0_f64;\\n\\n/// let beta = 0.25_f64;\\n\\n/// let taps: Vec<Complex<f64>> = rrc_taps(n_taps, sams_per_sym, beta).unwrap();\\n\\n/// ```\\n\\npub fn rrc_taps<T>(\\n\\n n_taps: u32,\\n\\n sam_per_sym: f64,\\n\\n beta: f64,\\n\\n) -> Result<Vec<Complex<T>>, MathError>\\n\\nwhere\\n\\n T: Copy + Num + num_traits::NumCast,\\n\\n{\\n\\n if beta < 0.0 || beta > 1.0 {\\n\\n return Err(MathError::InvalidRolloffError);\\n\\n };\\n\\n\\n\\n let tsym = 1.0_f64;\\n\\n let fs = sam_per_sym / tsym;\\n\\n\\n\\n let fzero = || -> f64 { (1.0 / tsym) * (1.0 + beta * (4.0 / PI - 1.0)) };\\n\\n\\n\\n let fint = || -> f64 {\\n\\n (beta / (tsym * 2.0_f64.sqrt()))\\n\\n * ((1.0 + 2.0 / PI) * (PI / (4.0 * beta)).sin()\\n\",\n \"file_path\": \"src/util/math.rs\",\n \"rank\": 13,\n \"score\": 80647.32434005407\n },\n {\n \"content\": \"/// An example that will generate random numbers, pass them through a BPSK\\n\\n/// modulation and a pulse shaper, then broadcast them out to a file and\\n\\n/// via ZeroMQ for visualization.\\n\\nfn main() {\\n\\n // A simple node to perform BPSK modulation. Only broadcasts a message\\n\\n // once `num_samples` samples have been received and modulated.\\n\\n #[derive(Node, Default)]\\n\\n #[aggregate]\\n\\n struct BpskMod {\\n\\n input: NodeReceiver<u8>,\\n\\n num_samples: usize,\\n\\n state: Vec<Complex<f32>>,\\n\\n output: NodeSender<Vec<Complex<f32>>>,\\n\\n }\\n\\n\\n\\n impl BpskMod {\\n\\n pub fn new(num_samples: usize) -> Self {\\n\\n BpskMod {\\n\\n num_samples,\\n\\n state: vec![],\\n\\n ..Default::default()\\n\\n }\\n\\n }\\n\",\n \"file_path\": \"examples/bpsk_mod.rs\",\n \"rank\": 14,\n \"score\": 79709.09742135054\n },\n {\n \"content\": \"/// Normalized sinc function implementation.\\n\\n///\\n\\n/// `sinc(0) = 1`\\n\\n///\\n\\n/// `sinc(x) = sin(pi * x) / (pi * x), x != 0`\\n\\n///\\n\\n/// # Examples\\n\\n///\\n\\n/// ```\\n\\n/// use comms_rs::util::math::sinc;\\n\\n///\\n\\n/// assert!((sinc(0.0) - 1.0).abs() < std::f64::EPSILON);\\n\\n/// assert!(sinc(1.0).abs() < std::f64::EPSILON);\\n\\n/// assert!(sinc(2.0).abs() < std::f64::EPSILON);\\n\\n/// assert!(sinc(3.0).abs() < std::f64::EPSILON);\\n\\n/// ```\\n\\npub fn sinc(x: f64) -> f64 {\\n\\n if x != 0.0 {\\n\\n (PI * x).sin() / (PI * x)\\n\\n } else {\\n\\n 1.0\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/util/math.rs\",\n \"rank\": 15,\n \"score\": 74717.04588082223\n },\n {\n \"content\": \"/// Calculates a phase estimate from the input QAM symbol vector.\\n\\n///\\n\\n/// Result is in radians, and the estimator assumes the input symbol vector is\\n\\n/// the output from a matched filter. It additionally assumes the vector has\\n\\n/// already gone through accurate timing recovery.\\n\\n///\\n\\n/// Reference Chp. 5.7.5 in Mengali.\\n\\n///\\n\\n/// # Arguments\\n\\n///\\n\\n/// * `symbols` - Input vector of symbols to calculate the phase estimate from.\\n\\n///\\n\\n/// # Examples\\n\\n///\\n\\n/// ```\\n\\n/// use comms_rs::demodulation::phase_estimator::*;\\n\\n/// use num::Complex;\\n\\n///\\n\\n/// let m = 4;\\n\\n/// let data: Vec<_> = (0..100).map(|x| Complex::new(0.0, x as f64).exp()).collect();\\n\\n///\\n\\n/// let estimate = qam_phase_estimate(&data);\\n\\n/// ```\\n\\npub fn qam_phase_estimate(symbols: &[Complex<f64>]) -> f64 {\\n\\n symbols\\n\\n .iter()\\n\\n .map(|x| -1.0 * x.powi(4))\\n\\n .sum::<Complex<f64>>()\\n\\n .arg()\\n\\n / 4.0\\n\\n}\\n\\n\\n\\n#[cfg(test)]\\n\\nmod test {\\n\\n use crate::demodulation::phase_estimator::*;\\n\\n use num::Complex;\\n\\n use rand::distributions::Uniform;\\n\\n use rand::prelude::*;\\n\\n use rand::rngs::SmallRng;\\n\\n use std::f64::consts::PI;\\n\\n\\n\\n #[test]\\n\\n fn test_psk_phase_estimator() {\\n\",\n \"file_path\": \"src/demodulation/phase_estimator.rs\",\n \"rank\": 16,\n \"score\": 63089.80981543998\n },\n {\n \"content\": \"/// Constructs a node containing an open but uninitialized connection to an\\n\\n/// RTLSDR at the given index. Use RTLSDRNode::init_radio to set up the radio\\n\\n/// prior to running the node.\\n\\npub fn rtlsdr(index: i32) -> Result<RTLSDR, RTLSDRError> {\\n\\n let rtlsdr = rtlsdr::open(index)?;\\n\\n Ok(RTLSDR { rtlsdr })\\n\\n}\\n\\n\\n\\n#[cfg(test)]\\n\\nmod test {\\n\\n use crate::hardware::{radio, rtlsdr_radio};\\n\\n use std::time::Instant;\\n\\n\\n\\n use crate::prelude::*;\\n\\n use std::thread;\\n\\n\\n\\n #[test]\\n\\n #[cfg_attr(not(feature = \\\"rtlsdr_node\\\"), ignore)]\\n\\n // A quick test to check if we can read samples off the RTLSDR.\\n\\n fn test_get_samples() {\\n\\n let num_samples = 262144;\\n\\n let mut sdr = rtlsdr_radio::rtlsdr(0).unwrap();\\n\\n sdr.init_radio(88.7e6 as u32, 2.4e6 as u32, 0).unwrap();\\n\",\n \"file_path\": \"src/hardware/rtlsdr_radio.rs\",\n \"rank\": 17,\n \"score\": 61409.48216759188\n },\n {\n \"content\": \"/// Calculates a phase estimate from the input PSK symbol vector.\\n\\n///\\n\\n/// Result is in radians, and the estimator assumes the input symbol vector is\\n\\n/// the output from a matched filter. It additionally assumes the vector has\\n\\n/// already gone through accurate timing recovery.\\n\\n///\\n\\n/// Reference Chp. 5.7.4 in Mengali.\\n\\n///\\n\\n/// # Arguments\\n\\n///\\n\\n/// * `symbols` - Input vector of symbols to calculate the phase estimate from.\\n\\n///\\n\\n/// # Examples\\n\\n///\\n\\n/// ```\\n\\n/// use comms_rs::demodulation::phase_estimator::*;\\n\\n/// use num::Complex;\\n\\n///\\n\\n/// let m = 4;\\n\\n/// let data: Vec<_> = (0..100).map(|x| Complex::new(0.0, x as f64).exp()).collect();\\n\\n///\\n\\n/// let estimate = psk_phase_estimate(&data, m);\\n\\n/// ```\\n\\npub fn psk_phase_estimate(symbols: &[Complex<f64>], m: u32) -> f64 {\\n\\n symbols\\n\\n .iter()\\n\\n .map(|x| x.powi(m as i32))\\n\\n .sum::<Complex<f64>>()\\n\\n .arg()\\n\\n / (m as f64)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/demodulation/phase_estimator.rs\",\n \"rank\": 18,\n \"score\": 58502.1129323637\n },\n {\n \"content\": \"/// Rectangle pulse shaping tap calculator.\\n\\n///\\n\\n/// Use this to create the taps for an FIR filter node and use that for the\\n\\n/// pulse shaping node.\\n\\n///\\n\\n/// # Arguments\\n\\n///\\n\\n/// * `n_taps` - Number of desired output taps\\n\\n///\\n\\n/// # Examples\\n\\n///\\n\\n/// ```\\n\\n/// use comms_rs::util::math::rect_taps;\\n\\n/// use num::Complex;\\n\\n///\\n\\n/// let n_taps = 12_usize;\\n\\n/// let taps: Vec<Complex<f64>> = rect_taps(n_taps).unwrap();\\n\\n/// ```\\n\\npub fn rect_taps<T>(n_taps: usize) -> Option<Vec<Complex<T>>>\\n\\nwhere\\n\\n T: Copy + Num + num_traits::NumCast,\\n\\n{\\n\\n let re = T::from(1)?;\\n\\n let im = T::from(0)?;\\n\\n Some(vec![Complex::new(re, im); n_taps as usize])\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/util/math.rs\",\n \"rank\": 19,\n \"score\": 57332.33120896624\n },\n {\n \"content\": \"/// Creates a node derived from an input structure with a constructor and\\n\\n/// implements the Node trait.\\n\\n///\\n\\n/// Takes a given structure and from it derives a node-based structure\\n\\n/// with the sending and receiving out of the node hidden from the user so\\n\\n/// the user can just focus on the implementation. This function does some\\n\\n/// transformations on the input data structure's types depending on the name\\n\\n/// of the fields in the structure.\\n\\n///\\n\\n/// The implementation of the Node trait depends on whether #[aggregate] is\\n\\n/// specified on the structure or not. If it is, the Node will only send out\\n\\n/// data when it gets a Some(T) from the run() function, otherwise it will\\n\\n/// continue to the next iteration.\\n\\n///\\n\\n/// This macro currently assumes that the structure in question implements a\\n\\n/// function called `run()` which is exercised in the `call()` function from\\n\\n/// the Node trait. The return type of the run() depends on whether the\\n\\n/// #[aggregate] flag is specified on the input structure. If #[aggregate] is\\n\\n/// present on the structure, the return type must be an Option. Otherwise, it\\n\\n/// can be anything.\\n\\n///\\n\\n/// Fields that are receivers must be of type NodeReceiver<T>. Fields that are\\n\\n/// senders must be of type NodeSender<T>.\\n\\n///\\n\\n/// Example:\\n\\n/// ```no_run\\n\\n/// #[derive(Node)]\\n\\n/// pub struct Node1<T> where T: Into<u32> {\\n\\n/// input: NodeReceiver<T>,\\n\\n/// internal_state: u32,\\n\\n/// output: NodeSender<T>,\\n\\n/// }\\n\\n/// ```\\n\\n/// \\n\\npub fn node_derive(input: proc_macro::TokenStream) -> proc_macro::TokenStream {\\n\\n let input = parse_macro_input!(input as DeriveInput);\\n\\n let name = &input.ident;\\n\\n let generics = &input.generics;\\n\\n let (impl_generics, ty_generics, where_clause) = generics.split_for_impl();\\n\\n let attributes = &input.attrs;\\n\\n let mut aggregate = false;\\n\\n let mut pass_by_ref = false;\\n\\n for attr in attributes {\\n\\n match attr.parse_meta() {\\n\\n Ok(syn::Meta::Word(ref id)) if *id == \\\"aggregate\\\" => {\\n\\n aggregate = true\\n\\n }\\n\\n Ok(syn::Meta::Word(ref id)) if *id == \\\"pass_by_ref\\\" => {\\n\\n pass_by_ref = true\\n\\n }\\n\\n Ok(_) => continue,\\n\\n Err(_) => {\\n\\n let err = quote! {\\n\\n compile_error!(\\\"unrecognized attribute\\\");\\n\",\n \"file_path\": \"node_derive/src/lib.rs\",\n \"rank\": 20,\n \"score\": 55871.05244650427\n },\n {\n \"content\": \"/// Casts a `Complex<T>` to a `Complex<U>`.\\n\\n///\\n\\n/// All of the normal caveats with using the `as` keyword apply here for the\\n\\n/// conversion.\\n\\n///\\n\\n/// # Examples\\n\\n///\\n\\n/// ```\\n\\n/// use comms_rs::util::math::cast_complex;\\n\\n/// use num::Complex;\\n\\n///\\n\\n/// let a_num = Complex::new(12_i16, -4_i16);\\n\\n/// let a_new_num: Complex<f64> = cast_complex(&a_num).unwrap();\\n\\n/// ```\\n\\npub fn cast_complex<T, U>(input: &Complex<T>) -> Option<Complex<U>>\\n\\nwhere\\n\\n T: Copy + Num + num_traits::NumCast,\\n\\n U: Copy + Num + num_traits::NumCast,\\n\\n{\\n\\n let re = U::from(input.re)?;\\n\\n let im = U::from(input.im)?;\\n\\n Some(Complex::new(re, im))\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/util/math.rs\",\n \"rank\": 21,\n \"score\": 54903.68098313138\n },\n {\n \"content\": \"fn main() {\\n\\n let mut audio: AudioNode<f32> = AudioNode::new(1, 48000, 0.5);\\n\\n\\n\\n #[derive(Node)]\\n\\n struct SineNode {\\n\\n source: Box<dyn Source<Item = f32> + Send>,\\n\\n pub output: NodeSender<Vec<f32>>,\\n\\n }\\n\\n\\n\\n impl SineNode {\\n\\n pub fn new(source: Box<dyn Source<Item = f32> + Send>) -> Self {\\n\\n SineNode {\\n\\n source,\\n\\n output: Default::default(),\\n\\n }\\n\\n }\\n\\n\\n\\n pub fn run(&mut self) -> Result<Vec<f32>, NodeError> {\\n\\n let source = &mut self.source;\\n\\n let samp: Vec<f32> = source.take(48000).collect();\\n\",\n \"file_path\": \"examples/play_audio.rs\",\n \"rank\": 22,\n \"score\": 49433.06424986267\n },\n {\n \"content\": \"fn main() {\\n\\n // Get the radio frequency (assumed to be MHz as an input) and convert to\\n\\n // Hz. If no input is specified, default to 88.7 MHz.\\n\\n let radio_mhz = std::env::args()\\n\\n .nth(1)\\n\\n .and_then(|s| str::parse::<f32>(&s).ok());\\n\\n let radio_freq = match radio_mhz {\\n\\n Some(f) => (f * 1e6) as u32,\\n\\n None => {\\n\\n println!(\\\"No frequency specified, defaulting to 88.7.\\\");\\n\\n 88.7e6 as u32\\n\\n }\\n\\n };\\n\\n\\n\\n // The taps for the first low pass filter before FM demodulation.\\n\\n #[cfg_attr(rustfmt, rustfmt_skip)]\\n\\n let taps = [\\n\\n -0.01801270027742274, -0.004656920885448867, -0.002648852132912597,\\n\\n 0.0008677368918448623, 0.005009212152225975, 0.008526175375849215,\\n\\n 0.010172968340398776, 0.00912437509989248, 0.005334905990231011,\\n\",\n \"file_path\": \"examples/fm_radio.rs\",\n \"rank\": 23,\n \"score\": 49433.06424986267\n },\n {\n \"content\": \"/// An example that will generate random numbers, pass them through a QPSK\\n\\n/// modulation and a pulse shaper, then broadcast them out to a file and\\n\\n/// via ZeroMQ for visualization.\\n\\nfn main() {\\n\\n let now = Instant::now();\\n\\n\\n\\n #[derive(Node)]\\n\\n struct QpskMod {\\n\\n pub output: NodeSender<Vec<Complex<f32>>>,\\n\\n }\\n\\n impl QpskMod {\\n\\n pub fn new() -> Self {\\n\\n QpskMod {\\n\\n output: Default::default(),\\n\\n }\\n\\n }\\n\\n\\n\\n pub fn run(&mut self) -> Result<Vec<Complex<f32>>, NodeError> {\\n\\n let dist = Uniform::new(0u8, 2u8);\\n\\n let mut rng = rand::thread_rng();\\n\\n let mut bits: Vec<u8> = Vec::new();\\n\\n for _ in 0..4096 {\\n\\n bits.push(rng.sample(&dist));\\n\",\n \"file_path\": \"examples/qpsk_zmq.rs\",\n \"rank\": 24,\n \"score\": 49433.06424986267\n },\n {\n \"content\": \"/// An example that will generate random numbers, pass them through a QPSK\\n\\n/// modulation and a pulse shaper, then broadcast them out to a file and\\n\\n/// via ZeroMQ for visualization.\\n\\nfn main() {\\n\\n let mut rng = rand::thread_rng();\\n\\n let sam_per_sym = 4.0;\\n\\n let taps: Vec<Complex<f32>> =\\n\\n math::rrc_taps(32, sam_per_sym, 0.25).unwrap();\\n\\n let mut state: Vec<Complex<f32>> = vec![Complex::zero(); 32];\\n\\n let mut writer = BufWriter::new(File::create(\\\"./qpsk_out.bin\\\").unwrap());\\n\\n let now = Instant::now();\\n\\n let dist = Uniform::new(0u8, 2u8);\\n\\n\\n\\n loop {\\n\\n let mut bits: Vec<u8> = Vec::new();\\n\\n for _ in 0..4096 {\\n\\n bits.push(rng.sample(&dist));\\n\\n }\\n\\n let qpsk_mod: Vec<Complex<f32>> = bits\\n\\n .iter()\\n\\n .step_by(2)\\n\\n .zip(bits.iter().skip(1).step_by(2))\\n\\n .map(|(x, y)| {\\n\",\n \"file_path\": \"examples/single_thread_qpsk.rs\",\n \"rank\": 25,\n \"score\": 47979.68983001612\n },\n {\n \"content\": \"/// An example that will generate random numbers, pass them through a BPSK\\n\\n/// modulation and a pulse shaper, then broadcast them out to a file and\\n\\n/// via ZeroMQ for visualization.\\n\\nfn main() {\\n\\n let mut rng = rand::thread_rng();\\n\\n let sam_per_sym = 4.0;\\n\\n let taps: Vec<Complex<f32>> =\\n\\n math::rrc_taps(32, sam_per_sym, 0.25).unwrap();\\n\\n let mut state: Vec<Complex<f32>> = vec![Complex::zero(); 32];\\n\\n let mut writer = BufWriter::new(File::create(\\\"./bpsk_out.bin\\\").unwrap());\\n\\n let now = Instant::now();\\n\\n let dist = Uniform::new(0u8, 2u8);\\n\\n\\n\\n loop {\\n\\n let mut bits: Vec<u8> = Vec::new();\\n\\n for _ in 0..4096 {\\n\\n bits.push(rng.sample(&dist));\\n\\n }\\n\\n let bpsk_mod: Vec<Complex<f32>> = bits\\n\\n .iter()\\n\\n .map(|x| Complex::new(f32::from(*x) * 2.0 - 1.0, 0.0))\\n\\n .collect();\\n\\n let mut upsample = vec![Complex::zero(); 4096 * 4];\\n\",\n \"file_path\": \"examples/single_thread_bpsk.rs\",\n \"rank\": 26,\n \"score\": 47979.68983001612\n },\n {\n \"content\": \"struct ParsedFields<'a> {\\n\\n recv_fields: Vec<&'a syn::Field>,\\n\\n send_fields: Vec<&'a syn::Field>,\\n\\n}\\n\\n\\n\\n#[proc_macro_derive(Node, attributes(aggregate, pass_by_ref))]\\n\",\n \"file_path\": \"node_derive/src/lib.rs\",\n \"rank\": 27,\n \"score\": 45358.26200748177\n },\n {\n \"content\": \"extern crate node_derive;\\n\\n#[macro_use]\\n\\nextern crate comms_rs;\\n\\n\\n\\nuse comms_rs::prelude::*;\\n\\nuse std::thread;\\n\\n\\n\\n#[derive(Node)]\\n\\npub struct Node1 {\\n\\n output: NodeSender<u32>,\\n\\n}\\n\\n\\n\\nimpl Node1 {\\n\\n fn new() -> Self {\\n\\n Node1 {\\n\\n output: Default::default(),\\n\\n }\\n\\n }\\n\\n\\n\\n fn run(&mut self) -> Result<u32, NodeError> {\\n\",\n \"file_path\": \"tests/macro_tests.rs\",\n \"rank\": 28,\n \"score\": 42288.81262493639\n },\n {\n \"content\": \"#[macro_use]\\n\\nextern crate comms_rs;\\n\\n\\n\\nuse comms_rs::prelude::*;\\n\\nuse std::thread;\\n\\nuse std::time::Duration;\\n\\n\\n\\n#[test]\\n\",\n \"file_path\": \"tests/node_test.rs\",\n \"rank\": 29,\n \"score\": 42283.84567701762\n },\n {\n \"content\": \" Ok(1)\\n\\n }\\n\\n}\\n\\n\\n\\n#[derive(Node)]\\n\\npub struct Node2 {\\n\\n recv_input: NodeReceiver<u32>,\\n\\n stuff: u32,\\n\\n output: NodeSender<u32>,\\n\\n}\\n\\n\\n\\nimpl Node2 {\\n\\n fn new(stuff: u32) -> Self {\\n\\n Node2 {\\n\\n stuff,\\n\\n recv_input: Default::default(),\\n\\n output: Default::default(),\\n\\n }\\n\\n }\\n\\n\\n\",\n \"file_path\": \"tests/macro_tests.rs\",\n \"rank\": 30,\n \"score\": 42277.995459399644\n },\n {\n \"content\": \" pub input: NodeReceiver<u32>,\\n\\n }\\n\\n\\n\\n impl SinkNode {\\n\\n pub fn new() -> Self {\\n\\n SinkNode {\\n\\n input: Default::default(),\\n\\n }\\n\\n }\\n\\n\\n\\n pub fn run(&mut self, input: u32) -> Result<(), NodeError> {\\n\\n assert_eq!(input, 1);\\n\\n Ok(())\\n\\n }\\n\\n }\\n\\n\\n\\n let mut node = SourceNode::new();\\n\\n let mut node2 = SinkNode::new();\\n\\n connect_nodes!(node, output, node2, input);\\n\\n start_nodes!(node, node2);\\n\\n thread::sleep(Duration::from_secs(1));\\n\\n}\\n\",\n \"file_path\": \"tests/node_test.rs\",\n \"rank\": 31,\n \"score\": 42277.0053293621\n },\n {\n \"content\": \" fn run(&mut self, x: u32) -> Result<u32, NodeError> {\\n\\n assert_eq!(x, 1);\\n\\n Ok(x + self.stuff)\\n\\n }\\n\\n}\\n\\n\\n\\n#[derive(Node)]\\n\\npub struct Node3 {\\n\\n recv_input: NodeReceiver<u32>,\\n\\n}\\n\\n\\n\\nimpl Node3 {\\n\\n fn new() -> Self {\\n\\n Node3 {\\n\\n recv_input: Default::default(),\\n\\n }\\n\\n }\\n\\n\\n\\n fn run(&mut self, x: u32) -> Result<(), NodeError> {\\n\\n assert_eq!(x, 6);\\n\\n Ok(())\\n\\n }\\n\\n}\\n\\n\\n\\n#[test]\\n\",\n \"file_path\": \"tests/macro_tests.rs\",\n \"rank\": 32,\n \"score\": 42276.73973636939\n },\n {\n \"content\": \"/// A trait to capture the ability to send samples out of the hardware\\n\\n/// platform on a particular output.\\n\\npub trait RadioTx<T> {\\n\\n fn send_samples(&mut self, samples: &[T], output_idx: usize);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/hardware/radio.rs\",\n \"rank\": 33,\n \"score\": 40557.73460283367\n },\n {\n \"content\": \"/// A trait to capture the ability to receive samples from the hardware\\n\\n/// platform on a particular input.\\n\\npub trait RadioRx<T> {\\n\\n fn recv_samples(&mut self, num_samples: usize, input_idx: usize) -> Vec<T>;\\n\\n}\\n\\n\\n\\n/// A node that takes a generic hardware platform that supports transmitting\\n\\n/// samples.\\n\\n#[derive(Node)]\\n\\n#[pass_by_ref]\\n\\npub struct RadioTxNode<T, U>\\n\\nwhere\\n\\n T: RadioTx<U> + Send,\\n\\n U: Clone + Send,\\n\\n{\\n\\n pub input: NodeReceiver<Vec<U>>,\\n\\n radio: T,\\n\\n output_idx: usize,\\n\\n}\\n\\n\\n\\nimpl<T, U> RadioTxNode<T, U>\\n\\nwhere\\n\",\n \"file_path\": \"src/hardware/radio.rs\",\n \"rank\": 34,\n \"score\": 40550.44584628129\n },\n {\n \"content\": \"fn parse_type(field: &syn::Field) -> FieldType {\\n\\n let ty = &field.ty;\\n\\n let type_str = quote! {#ty}.to_string();\\n\\n if type_str.starts_with(\\\"NodeReceiver\\\") {\\n\\n FieldType::Input\\n\\n } else if type_str.starts_with(\\\"NodeSender\\\") {\\n\\n FieldType::Output\\n\\n } else {\\n\\n FieldType::State\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"node_derive/src/lib.rs\",\n \"rank\": 35,\n \"score\": 33200.607251486785\n },\n {\n \"content\": \"fn parse_fields(fields: &syn::FieldsNamed) -> ParsedFields {\\n\\n let mut recv_fields = vec![];\\n\\n let mut send_fields = vec![];\\n\\n for field in &fields.named {\\n\\n match parse_type(&field) {\\n\\n FieldType::Input => recv_fields.push(field),\\n\\n FieldType::Output => send_fields.push(field),\\n\\n _ => continue,\\n\\n }\\n\\n }\\n\\n ParsedFields {\\n\\n recv_fields,\\n\\n send_fields,\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"node_derive/src/lib.rs\",\n \"rank\": 36,\n \"score\": 32383.290157025967\n },\n {\n \"content\": \" use rand::{thread_rng, Rng};\\n\\n use std::sync::{Arc, Mutex};\\n\\n use std::thread;\\n\\n use std::time::{Duration, Instant};\\n\\n\\n\\n use crate::node::graph::Graph;\\n\\n use crate::prelude::*;\\n\\n use rayon;\\n\\n\\n\\n #[test]\\n\\n /// Constructs a simple network with two nodes: one source and one sink.\\n\\n fn test_simple_nodes() {\\n\\n #[derive(Node)]\\n\\n struct Node1 {\\n\\n pub output: NodeSender<u32>,\\n\\n }\\n\\n\\n\\n impl Node1 {\\n\\n pub fn new() -> Self {\\n\\n Node1 {\\n\",\n \"file_path\": \"src/node/mod.rs\",\n \"rank\": 37,\n \"score\": 31847.311145337255\n },\n {\n \"content\": \"//! Nodes for general input/output support, such as file IO, audio, and ZeroMQ.\\n\\n\\n\\n#[cfg(feature = \\\"zmq_node\\\")]\\n\\nextern crate zmq;\\n\\n\\n\\n#[cfg(feature = \\\"audio_node\\\")]\\n\\nextern crate rodio;\\n\\n\\n\\n#[cfg(feature = \\\"audio_node\\\")]\\n\\npub mod audio;\\n\\n\\n\\n#[cfg(feature = \\\"zmq_node\\\")]\\n\\npub mod zmq_node;\\n\\n\\n\\npub mod raw_iq;\\n\",\n \"file_path\": \"src/io/mod.rs\",\n \"rank\": 38,\n \"score\": 31846.103205669468\n },\n {\n \"content\": \" ($n1:ident, $send:ident, $n2:ident, $recv:ident, $default:tt) => {{\\n\\n let (send, recv) = channel::unbounded();\\n\\n $n1.$send.push((send, Some($default)));\\n\\n $n2.$recv = Some(recv);\\n\\n }};\\n\\n}\\n\\n\\n\\n/// Spawns a thread for each node in order and starts nodes to run\\n\\n/// indefinitely.\\n\\n///\\n\\n/// # Example\\n\\n///\\n\\n/// ```\\n\\n/// # #[macro_use] extern crate comms_rs;\\n\\n/// # use comms_rs::prelude::*;\\n\\n/// # use std::thread;\\n\\n/// # fn main() {\\n\\n/// # #[derive(Node)]\\n\\n/// # struct Node1 {\\n\\n/// # pub output: NodeSender<u32>,\\n\",\n \"file_path\": \"src/node/mod.rs\",\n \"rank\": 39,\n \"score\": 31845.807651698888\n },\n {\n \"content\": \" thread::sleep(Duration::from_secs(1));\\n\\n assert!(check.join().is_ok());\\n\\n }\\n\\n\\n\\n #[test]\\n\\n /// A test to ensure that persistent state works within the nodes. Makes\\n\\n /// two nodes: one to send 1 to 10 and the other to add the number to a\\n\\n /// counter within the node.\\n\\n fn test_counter() {\\n\\n #[derive(Node)]\\n\\n struct OneNode {\\n\\n count: i32,\\n\\n output: NodeSender<i32>,\\n\\n }\\n\\n\\n\\n impl OneNode {\\n\\n pub fn new() -> Self {\\n\\n OneNode {\\n\\n count: 0,\\n\\n output: Default::default(),\\n\",\n \"file_path\": \"src/node/mod.rs\",\n \"rank\": 40,\n \"score\": 31845.308918603325\n },\n {\n \"content\": \" $n2.$recv = Some(recv);\\n\\n }};\\n\\n}\\n\\n\\n\\n/// Connects two nodes together in a feedback configuration using channels.\\n\\n/// When the nodes are connected in feedback, a specified value is sent\\n\\n/// through the channel immediately so that the nodes don't deadlock on\\n\\n/// the first iteration.\\n\\n///\\n\\n/// ```\\n\\n/// # #[macro_use] extern crate comms_rs;\\n\\n/// # use comms_rs::prelude::*;\\n\\n/// # fn main() {\\n\\n/// # #[derive(Node)]\\n\\n/// # struct Node1 {\\n\\n/// # output: NodeSender<u32>,\\n\\n/// # }\\n\\n/// #\\n\\n/// # impl Node1 {\\n\\n/// # pub fn new() -> Self {\\n\",\n \"file_path\": \"src/node/mod.rs\",\n \"rank\": 41,\n \"score\": 31844.829633301546\n },\n {\n \"content\": \" output: NodeSender<Vec<Complex<U>>>,\\n\\n }\\n\\n\\n\\n impl<T, U> ConvertNode<T, U>\\n\\n where\\n\\n T: Copy + Num + NumCast + Send,\\n\\n U: Copy + Num + NumCast + Send,\\n\\n {\\n\\n pub fn new() -> Self {\\n\\n ConvertNode {\\n\\n input: Default::default(),\\n\\n output: Default::default(),\\n\\n }\\n\\n }\\n\\n\\n\\n pub fn run(\\n\\n &mut self,\\n\\n input: Vec<Complex<T>>,\\n\\n ) -> Result<Vec<Complex<U>>, NodeError> {\\n\\n let out: Vec<Complex<U>> = input\\n\",\n \"file_path\": \"examples/bpsk_mod.rs\",\n \"rank\": 42,\n \"score\": 31844.649928353523\n },\n {\n \"content\": \"//! Provides an infrastructure to create processing nodes, connect nodes\\n\\n//! together via crossbeam channels, and start nodes running in their own\\n\\n//! independent threads.\\n\\n//!\\n\\n//! # Example\\n\\n//!\\n\\n//! ```\\n\\n//! #[macro_use] extern crate comms_rs;\\n\\n//! use comms_rs::prelude::*;\\n\\n//! use std::thread;\\n\\n//!\\n\\n//! // Creates two nodes: a source and a sink node. For nodes that receive\\n\\n//! // inputs, the receivers must explicitly be named.\\n\\n//! #[derive(Node)]\\n\\n//! struct Node1 {\\n\\n//! pub output: NodeSender<u32>,\\n\\n//! }\\n\\n//!\\n\\n//! impl Node1 {\\n\\n//! pub fn new() -> Self {\\n\",\n \"file_path\": \"src/node/mod.rs\",\n \"rank\": 43,\n \"score\": 31844.510973531575\n },\n {\n \"content\": \"//! Provides interfaces to hardware platforms and generic traits to encapsulate\\n\\n//! radio functionality.\\n\\n//!\\n\\n\\n\\n#[cfg(feature = \\\"rtlsdr_node\\\")]\\n\\nextern crate rtlsdr;\\n\\n\\n\\n#[cfg(feature = \\\"rtlsdr_node\\\")]\\n\\npub mod rtlsdr_radio;\\n\\n\\n\\npub mod radio;\\n\",\n \"file_path\": \"src/hardware/mod.rs\",\n \"rank\": 44,\n \"score\": 31842.592233065352\n },\n {\n \"content\": \"/// # use comms_rs::prelude::*;\\n\\n/// # use std::thread;\\n\\n///\\n\\n/// # fn main() {\\n\\n/// # #[derive(Node)]\\n\\n/// # struct Node1 {\\n\\n/// # pub output: NodeSender<u32>,\\n\\n/// # }\\n\\n///\\n\\n/// # impl Node1 {\\n\\n/// # pub fn new() -> Self {\\n\\n/// # Node1 {\\n\\n/// # output: Default::default(),\\n\\n/// # }\\n\\n/// # }\\n\\n/// #\\n\\n/// # pub fn run(&mut self) -> Result<u32, NodeError> {\\n\\n/// # Ok(1)\\n\\n/// # }\\n\\n/// # }\\n\",\n \"file_path\": \"src/node/mod.rs\",\n \"rank\": 45,\n \"score\": 31842.470181540677\n },\n {\n \"content\": \" });\\n\\n assert!(check.join().is_ok());\\n\\n }\\n\\n\\n\\n #[test]\\n\\n /// Constructs a simple network with two nodes: one source and one sink.\\n\\n fn test_simple_graph() {\\n\\n #[derive(Node)]\\n\\n struct Node1 {\\n\\n pub output: NodeSender<u32>,\\n\\n }\\n\\n\\n\\n impl Node1 {\\n\\n pub fn new() -> Self {\\n\\n Node1 {\\n\\n output: Default::default(),\\n\\n }\\n\\n }\\n\\n\\n\\n pub fn run(&mut self) -> Result<u32, NodeError> {\\n\",\n \"file_path\": \"src/node/mod.rs\",\n \"rank\": 46,\n \"score\": 31841.911748784038\n },\n {\n \"content\": \"//! Nodes for performing FFTs and IFFTs.\\n\\n\\n\\npub mod fft_node;\\n\\n\\n\\nuse num::Complex;\\n\\nuse num::NumCast;\\n\\nuse rustfft::num_complex::Complex as FFTComplex;\\n\\nuse rustfft::num_traits::Num;\\n\\nuse rustfft::num_traits::Zero;\\n\\nuse rustfft::FFT;\\n\\nuse std::sync::Arc;\\n\\n\\n\\n/// Batch based wrapper of FFT implementation provided by\\n\\n/// [RustFFT](https://github.com/awelkie/RustFFT).\\n\\n///\\n\\n/// This implementation acts on a batch of samples at a time. The underlying\\n\\n/// library only provides an FFT for type `f64`, so this wrapper will\\n\\n/// automatically cast any provided input appropriately, although it does\\n\\n/// expect the general form of `Complex<T>`.\\n\\npub struct BatchFFT {\\n\",\n \"file_path\": \"src/fft/mod.rs\",\n \"rank\": 47,\n \"score\": 31841.855888134636\n },\n {\n \"content\": \"\\n\\n pub fn run(\\n\\n &mut self,\\n\\n input: u8,\\n\\n ) -> Result<Option<Vec<Complex<f32>>>, NodeError> {\\n\\n let samp: f32 = num::cast(input).unwrap();\\n\\n self.state.push(Complex::new(samp * 2.0 - 1.0, 0.0));\\n\\n if self.state.len() == self.num_samples {\\n\\n let state_cl = self.state.clone();\\n\\n self.state = vec![];\\n\\n Ok(Some(state_cl))\\n\\n } else {\\n\\n Ok(None)\\n\\n }\\n\\n }\\n\\n }\\n\\n\\n\\n // A simple node to perform upsampling of data. Zeros are injected here;\\n\\n // filtering takes place elsewhere.\\n\\n #[derive(Node)]\\n\",\n \"file_path\": \"examples/bpsk_mod.rs\",\n \"rank\": 48,\n \"score\": 31841.40247385945\n },\n {\n \"content\": \" #[test]\\n\\n /// Performs a _very_ simplistic throughput analysis. We generate\\n\\n /// 10000 random i16 values at a time and pass it through the pipeline\\n\\n /// to see if channels will handle the throughput we hope it will.\\n\\n /// Make sure to run this test with --release.\\n\\n fn test_threadpool_throughput() {\\n\\n #[derive(Node)]\\n\\n struct Node1 {\\n\\n pub output: NodeSender<Arc<Vec<i16>>>,\\n\\n }\\n\\n\\n\\n impl Node1 {\\n\\n pub fn new() -> Self {\\n\\n Node1 {\\n\\n output: Default::default(),\\n\\n }\\n\\n }\\n\\n\\n\\n pub fn run(&mut self) -> Result<Arc<Vec<i16>>, NodeError> {\\n\\n let mut random = vec![0i16; 10000];\\n\",\n \"file_path\": \"src/node/mod.rs\",\n \"rank\": 49,\n \"score\": 31841.070241606776\n },\n {\n \"content\": \"\\n\\n let mut node1 = Node1::new();\\n\\n let mut node2 = Node2::new();\\n\\n let mut node3 = Node3::new();\\n\\n\\n\\n connect_nodes!(node1, output, node2, input);\\n\\n connect_nodes!(node2, output, node3, input);\\n\\n start_nodes!(node1, node3);\\n\\n start_nodes_threadpool!(node2,);\\n\\n thread::sleep(Duration::from_secs(1));\\n\\n }\\n\\n\\n\\n #[test]\\n\\n /// Constructs a network where a node receives from two different nodes.\\n\\n /// This serves to make sure that fan-in operation works as we expect\\n\\n /// it to.\\n\\n fn test_fan_in() {\\n\\n use crate::prelude::*;\\n\\n use std::thread;\\n\\n use std::time::Duration;\\n\",\n \"file_path\": \"src/node/mod.rs\",\n \"rank\": 50,\n \"score\": 31840.653667132454\n },\n {\n \"content\": \" struct UpsampleNode<T>\\n\\n where\\n\\n T: Zero + Copy + Send,\\n\\n {\\n\\n input: NodeReceiver<Vec<T>>,\\n\\n upsample_factor: usize,\\n\\n output: NodeSender<Vec<T>>,\\n\\n }\\n\\n\\n\\n impl<T> UpsampleNode<T>\\n\\n where\\n\\n T: Zero + Copy + Send,\\n\\n {\\n\\n pub fn new(upsample_factor: usize) -> Self {\\n\\n UpsampleNode {\\n\\n upsample_factor,\\n\\n input: Default::default(),\\n\\n output: Default::default(),\\n\\n }\\n\\n }\\n\",\n \"file_path\": \"examples/bpsk_mod.rs\",\n \"rank\": 51,\n \"score\": 31840.253977236705\n },\n {\n \"content\": \" write!(f, \\\"Math error: {}\\\", desc)\\n\\n }\\n\\n}\\n\\n\\n\\nimpl error::Error for MathError {}\\n\\n\\n\\n/// Some basic math functions used elsewhere in the project\\n\\npub mod math;\\n\\n/// Some nodes to aid in the generation of random numbers\\n\\npub mod rand_node;\\n\\n/// Some nodes to aid in resampling signals\\n\\npub mod resample_node;\\n\",\n \"file_path\": \"src/util/mod.rs\",\n \"rank\": 52,\n \"score\": 31839.50812913321\n },\n {\n \"content\": \"/// # connect_nodes!(node1, output, node2, input);\\n\\n/// // Connect two nodes named node1 and node2. node1 will now send its\\n\\n/// // messages to node2. node2 will receive the\\n\\n/// // message on its receiver named `input`.\\n\\n/// start_nodes_threadpool!(node1, node2);\\n\\n/// # }\\n\\n/// ```\\n\\n#[macro_export]\\n\\nmacro_rules! start_nodes_threadpool {\\n\\n ($($node:ident),+ $(,)?) => {\\n\\n $(\\n\\n rayon::spawn(move || {\\n\\n $node.start();\\n\\n });\\n\\n )*\\n\\n }\\n\\n}\\n\\n\\n\\n#[cfg(test)]\\n\\nmod test {\\n\",\n \"file_path\": \"src/node/mod.rs\",\n \"rank\": 53,\n \"score\": 31839.505913402907\n },\n {\n \"content\": \"/// ```\\n\\n#[macro_export]\\n\\nmacro_rules! start_nodes {\\n\\n ($($node:ident),+ $(,)?) => {\\n\\n $(\\n\\n thread::spawn(move || {\\n\\n $node.start();\\n\\n });\\n\\n )*\\n\\n }\\n\\n}\\n\\n\\n\\n/// Spawns a thread from a Rayon threadpool for each node in order and starts\\n\\n/// nodes to run indefinitely.\\n\\n///\\n\\n/// # Example\\n\\n///\\n\\n/// ```\\n\\n/// # #[macro_use] extern crate comms_rs;\\n\\n/// # extern crate rayon;\\n\",\n \"file_path\": \"src/node/mod.rs\",\n \"rank\": 54,\n \"score\": 31839.16856665775\n },\n {\n \"content\": \"/// # pub fn new() -> Self {\\n\\n/// # Node2 {\\n\\n/// # input: Default::default(),\\n\\n/// # }\\n\\n/// # }\\n\\n/// #\\n\\n/// # pub fn run(&mut self, x: u32) -> Result<(), NodeError> {\\n\\n/// # assert_eq!(x, 1);\\n\\n/// # Ok(())\\n\\n/// # }\\n\\n/// # }\\n\\n/// # let mut node1 = Node1::new();\\n\\n/// # let mut node2 = Node2::new();\\n\\n/// # connect_nodes!(node1, output, node2, input);\\n\\n///\\n\\n/// // Connect two nodes named node1 and node2. node1 will now send its\\n\\n/// // messages to node2. node2 will receive the\\n\\n/// // message on its receiver named `input`.\\n\\n/// start_nodes!(node1, node2);\\n\\n/// # }\\n\",\n \"file_path\": \"src/node/mod.rs\",\n \"rank\": 55,\n \"score\": 31838.55187829938\n },\n {\n \"content\": \" {\\n\\n let check = check.lock().unwrap();\\n\\n assert!(*check);\\n\\n }\\n\\n }\\n\\n\\n\\n #[test]\\n\\n /// Constructs a network with three nodes: two aggregating data and one\\n\\n /// simple node. Node1 is actually doing aggregation whereas Node2\\n\\n /// operates as a simple node but exists to ensure that there are no\\n\\n /// errors in the macro. This test also demonstrates how Arc can be\\n\\n /// used to pass around references through the channels much easier,\\n\\n /// saving on potential expensive copies.\\n\\n fn test_aggregate_nodes() {\\n\\n #[derive(Node)]\\n\\n #[aggregate]\\n\\n struct Node1 {\\n\\n agg: Vec<u32>,\\n\\n pub output: NodeSender<Arc<Vec<u32>>>,\\n\\n }\\n\",\n \"file_path\": \"src/node/mod.rs\",\n \"rank\": 56,\n \"score\": 31838.541631148582\n },\n {\n \"content\": \"use comms_rs::filter::fir_node::BatchFirNode;\\n\\nuse comms_rs::io::raw_iq::IQBatchOutput;\\n\\nuse comms_rs::node::graph::Graph;\\n\\nuse comms_rs::prelude::*;\\n\\nuse comms_rs::util::math;\\n\\nuse comms_rs::util::rand_node;\\n\\nuse num::{Complex, Num, NumCast, Zero};\\n\\nuse std::fs::File;\\n\\nuse std::io::BufWriter;\\n\\nuse std::sync::{Arc, Mutex};\\n\\nuse std::thread;\\n\\nuse std::time::Duration;\\n\\n\\n\\n/// An example that will generate random numbers, pass them through a BPSK\\n\\n/// modulation and a pulse shaper, then broadcast them out to a file and\\n\\n/// via ZeroMQ for visualization.\\n\",\n \"file_path\": \"examples/bpsk_mod.rs\",\n \"rank\": 57,\n \"score\": 31838.50904264467\n },\n {\n \"content\": \"/// # }\\n\\n///\\n\\n/// # impl Node1 {\\n\\n/// # pub fn new() -> Self {\\n\\n/// # Node1 {\\n\\n/// # output: Default::default(),\\n\\n/// # }\\n\\n/// # }\\n\\n/// #\\n\\n/// # pub fn run(&mut self) -> Result<u32, NodeError> {\\n\\n/// # Ok(1)\\n\\n/// # }\\n\\n/// # }\\n\\n///\\n\\n/// # #[derive(Node)]\\n\\n/// # struct Node2 {\\n\\n/// # pub input: NodeReceiver<u32>,\\n\\n/// # }\\n\\n///\\n\\n/// # impl Node2 {\\n\",\n \"file_path\": \"src/node/mod.rs\",\n \"rank\": 58,\n \"score\": 31838.42802230971\n },\n {\n \"content\": \"\\n\\n #[derive(Node)]\\n\\n #[pass_by_ref]\\n\\n struct Node2 {\\n\\n pub input: NodeReceiver<Arc<Vec<u32>>>,\\n\\n pub output: NodeSender<Arc<Vec<u32>>>,\\n\\n }\\n\\n\\n\\n impl Node2 {\\n\\n pub fn new() -> Self {\\n\\n Node2 {\\n\\n input: Default::default(),\\n\\n output: Default::default(),\\n\\n }\\n\\n }\\n\\n\\n\\n pub fn run(\\n\\n &mut self,\\n\\n input: &Arc<Vec<u32>>,\\n\\n ) -> Result<Arc<Vec<u32>>, NodeError> {\\n\",\n \"file_path\": \"src/node/mod.rs\",\n \"rank\": 59,\n \"score\": 31838.367359692584\n },\n {\n \"content\": \" output: Default::default(),\\n\\n }\\n\\n }\\n\\n\\n\\n pub fn run(&mut self) -> Result<u32, NodeError> {\\n\\n Ok(1)\\n\\n }\\n\\n }\\n\\n\\n\\n #[derive(Node)]\\n\\n struct Node2 {\\n\\n pub input: NodeReceiver<u32>,\\n\\n }\\n\\n\\n\\n impl Node2 {\\n\\n pub fn new() -> Self {\\n\\n Node2 {\\n\\n input: Default::default(),\\n\\n }\\n\\n }\\n\",\n \"file_path\": \"src/node/mod.rs\",\n \"rank\": 60,\n \"score\": 31838.34639488312\n },\n {\n \"content\": \"\\n\\n // Creates a node that takes no inputs and returns a value.\\n\\n #[derive(Node)]\\n\\n struct NoInputNode {\\n\\n output: NodeSender<u32>,\\n\\n }\\n\\n\\n\\n impl NoInputNode {\\n\\n pub fn new() -> Self {\\n\\n NoInputNode {\\n\\n output: Default::default(),\\n\\n }\\n\\n }\\n\\n\\n\\n pub fn run(&mut self) -> Result<u32, NodeError> {\\n\\n Ok(1)\\n\\n }\\n\\n }\\n\\n\\n\\n #[derive(Node)]\\n\",\n \"file_path\": \"src/node/mod.rs\",\n \"rank\": 61,\n \"score\": 31838.335173809664\n },\n {\n \"content\": \" thread_rng().fill(random.as_mut_slice());\\n\\n Ok(Arc::new(random))\\n\\n }\\n\\n }\\n\\n\\n\\n #[derive(Node)]\\n\\n #[pass_by_ref]\\n\\n struct Node2 {\\n\\n pub input: NodeReceiver<Arc<Vec<i16>>>,\\n\\n pub output: NodeSender<Arc<Vec<i16>>>,\\n\\n }\\n\\n\\n\\n impl Node2 {\\n\\n pub fn new() -> Self {\\n\\n Node2 {\\n\\n input: Default::default(),\\n\\n output: Default::default(),\\n\\n }\\n\\n }\\n\\n\\n\",\n \"file_path\": \"src/node/mod.rs\",\n \"rank\": 62,\n \"score\": 31838.2823216712\n },\n {\n \"content\": \"//! Node1 {\\n\\n//! output: Default::default(),\\n\\n//! }\\n\\n//! }\\n\\n//!\\n\\n//! pub fn run(&mut self) -> Result<u32, NodeError> {\\n\\n//! Ok(1)\\n\\n//! }\\n\\n//! }\\n\\n//!\\n\\n//! #[derive(Node)]\\n\\n//! struct Node2 {\\n\\n//! pub input: NodeReceiver<u32>,\\n\\n//! }\\n\\n//!\\n\\n//! impl Node2 {\\n\\n//! pub fn new() -> Self {\\n\\n//! Node2 {\\n\\n//! input: Default::default(),\\n\\n//! }\\n\",\n \"file_path\": \"src/node/mod.rs\",\n \"rank\": 63,\n \"score\": 31838.266258964697\n },\n {\n \"content\": \"/// # output: Default::default(),\\n\\n/// # }\\n\\n/// # }\\n\\n/// #\\n\\n/// # pub fn run(&mut self) -> Result<u32, NodeError> {\\n\\n/// # Ok(1)\\n\\n/// # }\\n\\n/// # }\\n\\n/// #\\n\\n/// # #[derive(Node)]\\n\\n/// # struct Node2 {\\n\\n/// # input: NodeReceiver<u32>,\\n\\n/// # }\\n\\n/// #\\n\\n/// # impl Node2 {\\n\\n/// # pub fn new() -> Self {\\n\\n/// # Node2 {\\n\\n/// # input: Default::default(),\\n\\n/// # }\\n\\n/// # }\\n\",\n \"file_path\": \"src/node/mod.rs\",\n \"rank\": 64,\n \"score\": 31838.046719069287\n },\n {\n \"content\": \" pub fn new() -> Self {\\n\\n Node3 {\\n\\n count: 0,\\n\\n input: Default::default(),\\n\\n }\\n\\n }\\n\\n\\n\\n pub fn run(\\n\\n &mut self,\\n\\n _val: &Arc<Vec<i16>>,\\n\\n ) -> Result<(), NodeError> {\\n\\n self.count += 1;\\n\\n if self.count == 40000 {\\n\\n println!(\\n\\n \\\"test_threadpool_throughput: Hit goal of 400 million i16 sent.\\\"\\n\\n );\\n\\n }\\n\\n Ok(())\\n\\n }\\n\\n }\\n\",\n \"file_path\": \"src/node/mod.rs\",\n \"rank\": 65,\n \"score\": 31838.028228007508\n },\n {\n \"content\": \"\\n\\n pub fn run(&mut self, input: Vec<T>) -> Result<Vec<T>, NodeError> {\\n\\n let mut out = vec![T::zero(); input.len() * self.upsample_factor];\\n\\n let mut ix = 0;\\n\\n for val in input {\\n\\n out[ix] = val;\\n\\n ix += self.upsample_factor;\\n\\n }\\n\\n Ok(out)\\n\\n }\\n\\n }\\n\\n\\n\\n // A generic node to convert from one complex type to another.\\n\\n #[derive(Node)]\\n\\n struct ConvertNode<T, U>\\n\\n where\\n\\n T: Copy + Num + NumCast + Send,\\n\\n U: Copy + Num + NumCast + Send,\\n\\n {\\n\\n input: NodeReceiver<Vec<Complex<T>>>,\\n\",\n \"file_path\": \"examples/bpsk_mod.rs\",\n \"rank\": 66,\n \"score\": 31838.020197686776\n },\n {\n \"content\": \" impl Node1 {\\n\\n pub fn new() -> Self {\\n\\n Node1 {\\n\\n output: Default::default(),\\n\\n }\\n\\n }\\n\\n\\n\\n pub fn run(&mut self) -> Result<Arc<Vec<i16>>, NodeError> {\\n\\n let mut random = vec![0i16; 10000];\\n\\n thread_rng().fill(random.as_mut_slice());\\n\\n Ok(Arc::new(random))\\n\\n }\\n\\n }\\n\\n\\n\\n #[derive(Node)]\\n\\n #[pass_by_ref]\\n\\n struct Node2 {\\n\\n pub input: NodeReceiver<Arc<Vec<i16>>>,\\n\\n pub output: NodeSender<Arc<Vec<i16>>>,\\n\\n }\\n\",\n \"file_path\": \"src/node/mod.rs\",\n \"rank\": 67,\n \"score\": 31837.979913595045\n },\n {\n \"content\": \"/// # Node1 {\\n\\n/// # output: Default::default(),\\n\\n/// # }\\n\\n/// # }\\n\\n/// #\\n\\n/// # pub fn run(&mut self) -> Result<u32, NodeError> {\\n\\n/// # Ok(1)\\n\\n/// # }\\n\\n/// # }\\n\\n/// #\\n\\n/// # #[derive(Node)]\\n\\n/// # struct Node2 {\\n\\n/// # input: NodeReceiver<u32>,\\n\\n/// # }\\n\\n/// #\\n\\n/// # impl Node2 {\\n\\n/// # pub fn new() -> Self {\\n\\n/// # Node2 {\\n\\n/// # input: Default::default(),\\n\\n/// # }\\n\",\n \"file_path\": \"src/node/mod.rs\",\n \"rank\": 68,\n \"score\": 31837.960734664728\n },\n {\n \"content\": \" struct AnotherNode {\\n\\n output: NodeSender<f64>,\\n\\n }\\n\\n\\n\\n impl AnotherNode {\\n\\n pub fn new() -> Self {\\n\\n AnotherNode {\\n\\n output: Default::default(),\\n\\n }\\n\\n }\\n\\n\\n\\n pub fn run(&mut self) -> Result<f64, NodeError> {\\n\\n Ok(2.0)\\n\\n }\\n\\n }\\n\\n\\n\\n // Creates a node that takes a u32 and a f64, returns a f32, and names\\n\\n // the receivers recv_u and recv_f.\\n\\n #[derive(Node)]\\n\\n struct DoubleInputNode {\\n\",\n \"file_path\": \"src/node/mod.rs\",\n \"rank\": 69,\n \"score\": 31837.916673462456\n },\n {\n \"content\": \" pub fft: Arc<dyn FFT<f64>>,\\n\\n pub fft_size: usize,\\n\\n}\\n\\n\\n\\nimpl BatchFFT {\\n\\n /// Creates a new `BatchFFT`.\\n\\n ///\\n\\n /// Requires an FFT plan from the RustFFT crate.\\n\\n ///\\n\\n /// # Arguments\\n\\n ///\\n\\n /// * `fft` - FFT plan to be executed in this implementation.\\n\\n /// * `fft_size` - Size of the FFT to be performed.\\n\\n ///\\n\\n /// # Examples\\n\\n ///\\n\\n /// ```\\n\\n /// use comms_rs::fft::*;\\n\\n /// use rustfft::FFTplanner;\\n\\n ///\\n\",\n \"file_path\": \"src/fft/mod.rs\",\n \"rank\": 70,\n \"score\": 31837.912983584156\n },\n {\n \"content\": \"///\\n\\n/// This implementation acts on a sample at a time. The underlying library\\n\\n/// only provides an FFT for type `f64`, so this wrapper will automatically\\n\\n/// cast any provided input appropriately, although it does expect the general\\n\\n/// form of `Complex<T>`.\\n\\npub struct SampleFFT<T> {\\n\\n pub fft: Arc<dyn FFT<f64>>,\\n\\n pub fft_size: usize,\\n\\n pub samples: Vec<Complex<T>>,\\n\\n}\\n\\n\\n\\nimpl<T> SampleFFT<T>\\n\\nwhere\\n\\n T: NumCast + Copy + Num,\\n\\n{\\n\\n /// Creates a new `SampleFFT`.\\n\\n ///\\n\\n /// Requires an FFT plan from the RustFFT crate.\\n\\n ///\\n\\n /// # Arguments\\n\",\n \"file_path\": \"src/fft/mod.rs\",\n \"rank\": 71,\n \"score\": 31837.71416746113\n },\n {\n \"content\": \" output: NodeSender<i32>,\\n\\n }\\n\\n\\n\\n impl PrintNode {\\n\\n pub fn new() -> Self {\\n\\n PrintNode {\\n\\n count: 0,\\n\\n input: Default::default(),\\n\\n output: Default::default(),\\n\\n }\\n\\n }\\n\\n\\n\\n pub fn run(&mut self, val: i32) -> Result<i32, NodeError> {\\n\\n self.count = val;\\n\\n Ok(val)\\n\\n }\\n\\n }\\n\\n\\n\\n let mut add_node = AddNode::new();\\n\\n let mut print_node = PrintNode::new();\\n\",\n \"file_path\": \"src/node/mod.rs\",\n \"rank\": 72,\n \"score\": 31837.65790372658\n },\n {\n \"content\": \"//! Nodes for demodulating signals.\\n\\npub mod nco;\\n\\npub mod phase_estimator;\\n\\npub mod timing_estimator;\\n\",\n \"file_path\": \"src/demodulation/mod.rs\",\n \"rank\": 73,\n \"score\": 31837.65122100358\n },\n {\n \"content\": \"//! Nodes for modulating and demodulating signals.\\n\\n\\n\\npub mod analog;\\n\\npub mod analog_node;\\n\\npub mod digital;\\n\",\n \"file_path\": \"src/modulation/mod.rs\",\n \"rank\": 74,\n \"score\": 31837.65122100358\n },\n {\n \"content\": \" input1: NodeReceiver<u32>,\\n\\n input2: NodeReceiver<f64>,\\n\\n output: NodeSender<f32>,\\n\\n }\\n\\n\\n\\n impl DoubleInputNode {\\n\\n pub fn new() -> Self {\\n\\n DoubleInputNode {\\n\\n input1: Default::default(),\\n\\n input2: Default::default(),\\n\\n output: Default::default(),\\n\\n }\\n\\n }\\n\\n\\n\\n pub fn run(&mut self, x: u32, y: f64) -> Result<f32, NodeError> {\\n\\n Ok((f64::from(x) + y) as f32)\\n\\n }\\n\\n }\\n\\n\\n\\n #[derive(Node)]\\n\",\n \"file_path\": \"src/node/mod.rs\",\n \"rank\": 75,\n \"score\": 31837.595532643212\n },\n {\n \"content\": \" }\\n\\n }\\n\\n\\n\\n pub fn run(&mut self) -> Result<i32, NodeError> {\\n\\n self.count += 1;\\n\\n Ok(self.count)\\n\\n }\\n\\n }\\n\\n\\n\\n #[derive(Node)]\\n\\n struct CounterNode {\\n\\n input: NodeReceiver<i32>,\\n\\n count: i32,\\n\\n output: NodeSender<i32>,\\n\\n }\\n\\n\\n\\n impl CounterNode {\\n\\n pub fn new() -> Self {\\n\\n CounterNode {\\n\\n count: 0,\\n\",\n \"file_path\": \"src/node/mod.rs\",\n \"rank\": 76,\n \"score\": 31837.55421345403\n },\n {\n \"content\": \"\\n\\n impl Node2 {\\n\\n pub fn new() -> Self {\\n\\n Node2 {\\n\\n input: Default::default(),\\n\\n output: Default::default(),\\n\\n }\\n\\n }\\n\\n\\n\\n pub fn run(\\n\\n &mut self,\\n\\n x: &Arc<Vec<i16>>,\\n\\n ) -> Result<Arc<Vec<i16>>, NodeError> {\\n\\n let mut y = Arc::clone(&x);\\n\\n for z in Arc::make_mut(&mut y).iter_mut() {\\n\\n *z = z.saturating_add(1);\\n\\n }\\n\\n Ok(y)\\n\\n }\\n\\n }\\n\",\n \"file_path\": \"src/node/mod.rs\",\n \"rank\": 77,\n \"score\": 31837.401725449658\n },\n {\n \"content\": \"\\n\\n impl Node1 {\\n\\n pub fn new() -> Self {\\n\\n Node1 {\\n\\n agg: vec![],\\n\\n output: Default::default(),\\n\\n }\\n\\n }\\n\\n\\n\\n pub fn run(&mut self) -> Result<Option<Arc<Vec<u32>>>, NodeError> {\\n\\n if self.agg.len() < 2 {\\n\\n self.agg.push(1);\\n\\n Ok(None)\\n\\n } else {\\n\\n let val = self.agg.clone();\\n\\n self.agg = vec![];\\n\\n Ok(Some(Arc::new(val)))\\n\\n }\\n\\n }\\n\\n }\\n\",\n \"file_path\": \"src/node/mod.rs\",\n \"rank\": 78,\n \"score\": 31837.32749300274\n },\n {\n \"content\": \" node3.call().unwrap();\\n\\n if now.elapsed().as_secs() >= 1 {\\n\\n break;\\n\\n }\\n\\n }\\n\\n });\\n\\n assert!(check.join().is_ok());\\n\\n }\\n\\n\\n\\n #[test]\\n\\n /// Performs a _very_ simplistic throughput analysis. We generate\\n\\n /// 10000 random i16 values at a time and pass it through the pipeline\\n\\n /// to see if channels will handle the throughput we hope it will.\\n\\n /// Make sure to run this test with --release.\\n\\n fn test_throughput() {\\n\\n #[derive(Node)]\\n\\n struct Node1 {\\n\\n pub output: NodeSender<Arc<Vec<i16>>>,\\n\\n }\\n\\n\\n\",\n \"file_path\": \"src/node/mod.rs\",\n \"rank\": 79,\n \"score\": 31837.25534498059\n },\n {\n \"content\": \" /// ```\\n\\n /// use comms_rs::fft::*;\\n\\n /// use num::{Complex, Zero};\\n\\n /// use rustfft::FFTplanner;\\n\\n ///\\n\\n /// let fft_size = 1024;\\n\\n /// let mut planner = FFTplanner::new(false);\\n\\n /// let fft = planner.plan_fft(fft_size);\\n\\n /// let mut batch_fft = BatchFFT::new(fft, fft_size);\\n\\n ///\\n\\n /// let result: Vec<Complex<f64>> = batch_fft.run_fft(&vec![Complex::zero(); fft_size][..]);\\n\\n /// ```\\n\\n pub fn run_fft<T>(&mut self, data: &[Complex<T>]) -> Vec<Complex<T>>\\n\\n where\\n\\n T: NumCast + Copy + Num,\\n\\n {\\n\\n // Convert the input type from interleaved values to Complex<f32>.\\n\\n let mut input: Vec<FFTComplex<f64>> = data\\n\\n .iter()\\n\\n .map(|x| {\\n\",\n \"file_path\": \"src/fft/mod.rs\",\n \"rank\": 80,\n \"score\": 31837.20939287407\n },\n {\n \"content\": \"\\n\\n impl AddNode {\\n\\n pub fn new() -> Self {\\n\\n AddNode {\\n\\n count: 1,\\n\\n input: Default::default(),\\n\\n output: Default::default(),\\n\\n }\\n\\n }\\n\\n\\n\\n pub fn run(&mut self, val: i32) -> Result<i32, NodeError> {\\n\\n self.count += val;\\n\\n Ok(self.count)\\n\\n }\\n\\n }\\n\\n\\n\\n #[derive(Node)]\\n\\n struct PrintNode {\\n\\n input: NodeReceiver<i32>,\\n\\n count: i32,\\n\",\n \"file_path\": \"src/node/mod.rs\",\n \"rank\": 81,\n \"score\": 31837.182872650556\n },\n {\n \"content\": \"\\n\\npub mod graph;\\n\\n\\n\\nuse std::error;\\n\\nuse std::fmt;\\n\\n\\n\\n#[derive(Clone, Debug)]\\n\\npub enum NodeError {\\n\\n DataError,\\n\\n PermanentError,\\n\\n DataEnd,\\n\\n CommError,\\n\\n}\\n\\n\\n\\nimpl fmt::Display for NodeError {\\n\\n fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {\\n\\n let desc = match *self {\\n\\n NodeError::DataError => \\\"unable to access data\\\",\\n\\n NodeError::PermanentError => \\\"unable to continue executing node\\\",\\n\\n NodeError::DataEnd => \\\"end of data source\\\",\\n\",\n \"file_path\": \"src/node/mod.rs\",\n \"rank\": 82,\n \"score\": 31837.113737814696\n },\n {\n \"content\": \"/// #\\n\\n/// # pub fn run(&mut self, x: u32) -> Result<(), NodeError> {\\n\\n/// # assert_eq!(x, 1);\\n\\n/// # Ok(())\\n\\n/// # }\\n\\n/// # }\\n\\n/// let mut node1 = Node1::new();\\n\\n/// let mut node2 = Node2::new();\\n\\n///\\n\\n/// // node1 will now send its messages to node2. node2 will receive the\\n\\n/// // message on its receiver named `input`.\\n\\n/// connect_nodes!(node1, output, node2, input);\\n\\n/// # }\\n\\n/// ```\\n\\n///\\n\\n#[macro_export]\\n\\nmacro_rules! connect_nodes {\\n\\n ($n1:ident, $send:ident, $n2:ident, $recv:ident) => {{\\n\\n let (send, recv) = channel::unbounded();\\n\\n $n1.$send.push((send, None));\\n\",\n \"file_path\": \"src/node/mod.rs\",\n \"rank\": 83,\n \"score\": 31837.089027107246\n },\n {\n \"content\": \" }\\n\\n }\\n\\n\\n\\n /// Runs the `SampleFFT`.\\n\\n ///\\n\\n /// Takes input `Complex<T>` and performs the FFT specified in\\n\\n /// construction, and returns the resulting output.\\n\\n ///\\n\\n /// # Examples\\n\\n ///\\n\\n /// ```\\n\\n /// use comms_rs::fft::*;\\n\\n /// use num::{Complex, Zero};\\n\\n /// use rustfft::FFTplanner;\\n\\n ///\\n\\n /// let fft_size = 1024;\\n\\n /// let mut planner = FFTplanner::new(false);\\n\\n /// let fft = planner.plan_fft(fft_size);\\n\\n /// let mut sample_fft: SampleFFT<f64> = SampleFFT::new(fft, fft_size);\\n\\n /// sample_fft.samples = vec![Complex::zero(); fft_size];\\n\",\n \"file_path\": \"src/fft/mod.rs\",\n \"rank\": 84,\n \"score\": 31836.629185887916\n },\n {\n \"content\": \"/// # }\\n\\n/// #\\n\\n/// # pub fn run(&mut self, x: u32) -> Result<(), NodeError> {\\n\\n/// # assert_eq!(x, 1);\\n\\n/// # Ok(())\\n\\n/// # }\\n\\n/// # }\\n\\n/// let mut node1 = Node1::new();\\n\\n/// let mut node2 = Node2::new();\\n\\n///\\n\\n/// // node1 will now send its messages to node2. node2 will receive the\\n\\n/// // message on its receiver named `input`. When node1 starts, it will send\\n\\n/// // a 0 to node2 the first time it's run by start_nodes! and run a normal\\n\\n/// // loop afterwards.\\n\\n/// connect_nodes_feedback!(node1, output, node2, input, 0);\\n\\n/// # }\\n\\n/// ```\\n\\n///\\n\\n#[macro_export]\\n\\nmacro_rules! connect_nodes_feedback {\\n\",\n \"file_path\": \"src/node/mod.rs\",\n \"rank\": 85,\n \"score\": 31836.045546835623\n },\n {\n \"content\": \"\\n\\n let check = thread::spawn(move || {\\n\\n for _ in 0..10 {\\n\\n count_node.call().unwrap();\\n\\n }\\n\\n assert_eq!(count_node.count, 55);\\n\\n });\\n\\n\\n\\n assert!(check.join().is_ok());\\n\\n }\\n\\n\\n\\n #[test]\\n\\n /// A test to verify that feedback will work.\\n\\n fn test_feedback() {\\n\\n #[derive(Node)]\\n\\n struct AddNode {\\n\\n input: NodeReceiver<i32>,\\n\\n count: i32,\\n\\n output: NodeSender<i32>,\\n\\n }\\n\",\n \"file_path\": \"src/node/mod.rs\",\n \"rank\": 86,\n \"score\": 31835.334093573478\n },\n {\n \"content\": \"\\n\\n #[derive(Node)]\\n\\n #[pass_by_ref]\\n\\n struct Node3 {\\n\\n pub input: NodeReceiver<Arc<Vec<i16>>>,\\n\\n count: u32,\\n\\n }\\n\\n\\n\\n impl Node3 {\\n\\n pub fn new() -> Self {\\n\\n Node3 {\\n\\n count: 0,\\n\\n input: Default::default(),\\n\\n }\\n\\n }\\n\\n\\n\\n pub fn run(\\n\\n &mut self,\\n\\n _val: &Arc<Vec<i16>>,\\n\\n ) -> Result<(), NodeError> {\\n\",\n \"file_path\": \"src/node/mod.rs\",\n \"rank\": 87,\n \"score\": 31835.24636338699\n },\n {\n \"content\": \" Ok(1)\\n\\n }\\n\\n }\\n\\n\\n\\n #[derive(Node)]\\n\\n struct Node2 {\\n\\n pub input: NodeReceiver<u32>,\\n\\n pub check: Arc<Mutex<bool>>,\\n\\n }\\n\\n\\n\\n impl Node2 {\\n\\n pub fn new(check: Arc<Mutex<bool>>) -> Self {\\n\\n Node2 {\\n\\n input: Default::default(),\\n\\n check,\\n\\n }\\n\\n }\\n\\n\\n\\n pub fn run(&mut self, x: u32) -> Result<(), NodeError> {\\n\\n let mut check = self.check.lock().unwrap();\\n\",\n \"file_path\": \"src/node/mod.rs\",\n \"rank\": 88,\n \"score\": 31835.24032054455\n },\n {\n \"content\": \"///\\n\\n/// # #[derive(Node)]\\n\\n/// # struct Node2 {\\n\\n/// # pub input: NodeReceiver<u32>,\\n\\n/// # }\\n\\n///\\n\\n/// # impl Node2 {\\n\\n/// # pub fn new() -> Self {\\n\\n/// # Node2 {\\n\\n/// # input: Default::default(),\\n\\n/// # }\\n\\n/// # }\\n\\n/// #\\n\\n/// # pub fn run(&mut self, x: u32) -> Result<(), NodeError> {\\n\\n/// # assert_eq!(x, 1);\\n\\n/// # Ok(())\\n\\n/// # }\\n\\n/// # }\\n\\n/// # let mut node1 = Node1::new();\\n\\n/// # let mut node2 = Node2::new();\\n\",\n \"file_path\": \"src/node/mod.rs\",\n \"rank\": 89,\n \"score\": 31835.200289404926\n },\n {\n \"content\": \"//! }\\n\\n//!\\n\\n//! pub fn run(&mut self, x: u32) -> Result<(), NodeError> {\\n\\n//! assert_eq!(x, 1);\\n\\n//! Ok(())\\n\\n//! }\\n\\n//! }\\n\\n//!\\n\\n//! // Now that the structures are created, the user can now instantiate their\\n\\n//! // nodes and pass in closures for the nodes to execute.\\n\\n//! let mut node1 = Node1::new();\\n\\n//! let mut node2 = Node2::new();\\n\\n//!\\n\\n//! // Create a connection between two nodes: node1 sending messages and node2\\n\\n//! // receiving on the `input` receiver in the Node2 structure.\\n\\n//! connect_nodes!(node1, output, node2, input);\\n\\n//!\\n\\n//! // Spawn threads for node1 and node2 and have them executing indefinitely.\\n\\n//! start_nodes!(node1, node2);\\n\\n//! ```\\n\",\n \"file_path\": \"src/node/mod.rs\",\n \"rank\": 90,\n \"score\": 31835.08965641627\n },\n {\n \"content\": \" let mut y = Arc::clone(&input);\\n\\n for z in Arc::make_mut(&mut y).iter_mut() {\\n\\n *z += 1;\\n\\n }\\n\\n Ok(y)\\n\\n }\\n\\n }\\n\\n\\n\\n #[derive(Node)]\\n\\n #[pass_by_ref]\\n\\n struct Node3 {\\n\\n pub input: NodeReceiver<Arc<Vec<u32>>>,\\n\\n }\\n\\n\\n\\n impl Node3 {\\n\\n pub fn new() -> Self {\\n\\n Node3 {\\n\\n input: Default::default(),\\n\\n }\\n\\n }\\n\",\n \"file_path\": \"src/node/mod.rs\",\n \"rank\": 91,\n \"score\": 31834.991109823564\n },\n {\n \"content\": \" connect_nodes!(add_node, output, print_node, input);\\n\\n connect_nodes_feedback!(print_node, output, add_node, input, 0);\\n\\n start_nodes!(add_node);\\n\\n let check = thread::spawn(move || {\\n\\n for (print, val) in &print_node.output {\\n\\n match val {\\n\\n Some(v) => print.send(*v).unwrap(),\\n\\n None => continue,\\n\\n }\\n\\n }\\n\\n for _ in 0..10 {\\n\\n print_node.call().unwrap();\\n\\n }\\n\\n assert_eq!(print_node.count, 512);\\n\\n });\\n\\n assert!(check.join().is_ok());\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/node/mod.rs\",\n \"rank\": 92,\n \"score\": 31834.749816776806\n },\n {\n \"content\": \" self.count += 1;\\n\\n if self.count == 40000 {\\n\\n println!(\\n\\n \\\"test_throughput: Hit goal of 400 million i16 sent.\\\"\\n\\n );\\n\\n }\\n\\n Ok(())\\n\\n }\\n\\n }\\n\\n\\n\\n let mut node1 = Node1::new();\\n\\n let mut node2 = Node2::new();\\n\\n let mut node3 = Node3::new();\\n\\n\\n\\n connect_nodes!(node1, output, node2, input);\\n\\n connect_nodes!(node2, output, node3, input);\\n\\n start_nodes!(node1, node2, node3);\\n\\n thread::sleep(Duration::from_secs(1));\\n\\n }\\n\\n\\n\",\n \"file_path\": \"src/node/mod.rs\",\n \"rank\": 93,\n \"score\": 31834.552014440473\n },\n {\n \"content\": \" struct CheckNode {\\n\\n input: NodeReceiver<f32>,\\n\\n }\\n\\n\\n\\n impl CheckNode {\\n\\n pub fn new() -> Self {\\n\\n CheckNode {\\n\\n input: Default::default(),\\n\\n }\\n\\n }\\n\\n\\n\\n pub fn run(&mut self, x: f32) -> Result<(), NodeError> {\\n\\n assert!(x - 3.0f32 < std::f32::EPSILON, \\\"Fan-out failed.\\\");\\n\\n Ok(())\\n\\n }\\n\\n }\\n\\n\\n\\n // Now, you can instantiate your nodes as usual.\\n\\n let mut node1 = NoInputNode::new();\\n\\n let mut node2 = AnotherNode::new();\\n\",\n \"file_path\": \"src/node/mod.rs\",\n \"rank\": 94,\n \"score\": 31834.251006164803\n },\n {\n \"content\": \" input: Default::default(),\\n\\n output: Default::default(),\\n\\n }\\n\\n }\\n\\n\\n\\n pub fn run(&mut self, val: i32) -> Result<i32, NodeError> {\\n\\n self.count += val;\\n\\n Ok(self.count)\\n\\n }\\n\\n }\\n\\n\\n\\n let mut one_node = OneNode::new();\\n\\n let mut count_node = CounterNode::new();\\n\\n connect_nodes!(one_node, output, count_node, input);\\n\\n\\n\\n thread::spawn(move || {\\n\\n for _ in 0..10 {\\n\\n one_node.call().unwrap();\\n\\n }\\n\\n });\\n\",\n \"file_path\": \"src/node/mod.rs\",\n \"rank\": 95,\n \"score\": 31834.177284708723\n },\n {\n \"content\": \"\\n\\n pub fn run(\\n\\n &mut self,\\n\\n input: &Arc<Vec<u32>>,\\n\\n ) -> Result<(), NodeError> {\\n\\n assert_eq!(**input, vec![2, 2]);\\n\\n Ok(())\\n\\n }\\n\\n }\\n\\n\\n\\n let mut node1 = Node1::new();\\n\\n let mut node2 = Node2::new();\\n\\n let mut node3 = Node3::new();\\n\\n\\n\\n connect_nodes!(node1, output, node2, input);\\n\\n connect_nodes!(node2, output, node3, input);\\n\\n start_nodes!(node1, node2);\\n\\n let check = thread::spawn(move || {\\n\\n let now = Instant::now();\\n\\n loop {\\n\",\n \"file_path\": \"src/node/mod.rs\",\n \"rank\": 96,\n \"score\": 31833.984851357603\n },\n {\n \"content\": \"//! Utility nodes that don't fit into any specific category and helper\\n\\n//! functions for developing your own nodes.\\n\\n\\n\\nuse std::error;\\n\\nuse std::fmt;\\n\\n\\n\\n#[derive(Clone, Debug)]\\n\\npub enum MathError {\\n\\n ConvertError,\\n\\n InvalidRolloffError,\\n\\n}\\n\\n\\n\\nimpl fmt::Display for MathError {\\n\\n fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {\\n\\n let desc = match *self {\\n\\n MathError::ConvertError => \\\"Type conversion from generic failed\\\",\\n\\n MathError::InvalidRolloffError => {\\n\\n \\\"Invalid rolloff parameter, must be on interval [0.0, 1.0]\\\"\\n\\n }\\n\\n };\\n\",\n \"file_path\": \"src/util/mod.rs\",\n \"rank\": 97,\n \"score\": 31833.922627013046\n },\n {\n \"content\": \" ///\\n\\n /// let result: Vec<Complex<f64>> = sample_fft.run_fft();\\n\\n /// ```\\n\\n pub fn run_fft(&mut self) -> Vec<Complex<T>> {\\n\\n let mut input: Vec<FFTComplex<f64>> = self\\n\\n .samples\\n\\n .iter()\\n\\n .map(|x| {\\n\\n FFTComplex::new(x.re.to_f64().unwrap(), x.im.to_f64().unwrap())\\n\\n })\\n\\n .collect();\\n\\n let mut output: Vec<FFTComplex<f64>> =\\n\\n vec![FFTComplex::zero(); self.fft_size];\\n\\n self.fft.process(&mut input[..], &mut output[..]);\\n\\n\\n\\n // After the FFT, convert back to interleaved values.\\n\\n let res: Vec<Complex<T>> = output\\n\\n .iter()\\n\\n .map(|x| {\\n\\n Complex::new(T::from(x.re).unwrap(), T::from(x.im).unwrap())\\n\\n })\\n\\n .collect();\\n\\n res\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/fft/mod.rs\",\n \"rank\": 98,\n \"score\": 31833.761075749688\n },\n {\n \"content\": \" ///\\n\\n /// * `fft` - FFT plan to be executed in this implementation.\\n\\n /// * `fft_size` - Size of the FFT to be performed.\\n\\n ///\\n\\n /// # Examples\\n\\n ///\\n\\n /// ```\\n\\n /// use comms_rs::fft::*;\\n\\n /// use rustfft::FFTplanner;\\n\\n ///\\n\\n /// let fft_size = 1024;\\n\\n /// let mut planner = FFTplanner::new(false);\\n\\n /// let fft = planner.plan_fft(fft_size);\\n\\n /// let sample_fft: SampleFFT<f64> = SampleFFT::new(fft, fft_size);\\n\\n /// ```\\n\\n pub fn new(fft: Arc<dyn FFT<f64>>, fft_size: usize) -> SampleFFT<T> {\\n\\n SampleFFT {\\n\\n fft,\\n\\n fft_size,\\n\\n samples: Vec::new(),\\n\",\n \"file_path\": \"src/fft/mod.rs\",\n \"rank\": 99,\n \"score\": 31833.62399485333\n }\n]","isConversational":false}}},{"rowIdx":2356,"cells":{"lang":{"kind":"string","value":"Rust"},"file_path":{"kind":"string","value":"buildkit-llb/src/ops/fs/copy.rs"},"repo_name":{"kind":"string","value":"student-coin/dockerfile-plus"},"commit":{"kind":"string","value":"559196e0838404d32fa2f1b81151124573a64898"},"file_code":{"kind":"string","value":"use std::collections::HashMap;\nuse std::fmt::Debug;\nuse std::path::{Path, PathBuf};\n\nuse buildkit_proto::pb;\n\nuse super::path::{LayerPath, UnsetPath};\nuse super::FileOperation;\n\nuse crate::serialization::{Context, Result};\nuse crate::utils::OutputIdx;\n\n#[derive(Debug)]\npub struct CopyOperation<From: Debug, To: Debug> {\n source: From,\n destination: To,\n\n follow_symlinks: bool,\n recursive: bool,\n create_path: bool,\n wildcard: bool,\n\n description: HashMap<String, String>,\n caps: HashMap<String, bool>,\n}\n\ntype OpWithoutSource = CopyOperation<UnsetPath, UnsetPath>;\ntype OpWithSource<'a> = CopyOperation<LayerPath<'a, PathBuf>, UnsetPath>;\ntype OpWithDestination<'a> =\n CopyOperation<LayerPath<'a, PathBuf>, (OutputIdx, LayerPath<'a, PathBuf>)>;\n\nimpl OpWithoutSource {\n pub(crate) fn new() -> OpWithoutSource {\n let mut caps = HashMap::<String, bool>::new();\n caps.insert(\"file.base\".into(), true);\n\n CopyOperation {\n source: UnsetPath,\n destination: UnsetPath,\n\n follow_symlinks: false,\n recursive: false,\n create_path: false,\n wildcard: false,\n\n caps,\n description: Default::default(),\n }\n }\n\n pub fn from<P>(self, source: LayerPath<'_, P>) -> OpWithSource\n where\n P: AsRef<Path>,\n {\n CopyOperation {\n source: source.into_owned(),\n destination: UnsetPath,\n\n follow_symlinks: self.follow_symlinks,\n recursive: self.recursive,\n create_path: self.create_path,\n wildcard: self.wildcard,\n\n description: self.description,\n caps: self.caps,\n }\n }\n}\n\nimpl<'a> OpWithSource<'a> {\n pub fn to<P>(self, output: OutputIdx, destination: LayerPath<'a, P>) -> OpWithDestination<'a>\n where\n P: AsRef<Path>,\n {\n CopyOperation {\n source: self.source,\n destination: (output, destination.into_owned()),\n\n follow_symlinks: self.follow_symlinks,\n recursive: self.recursive,\n create_path: self.create_path,\n wildcard: self.wildcard,\n\n description: self.description,\n caps: self.caps,\n }\n }\n}\n\nimpl<'a> OpWithDestination<'a> {\n pub fn into_operation(self) -> super::sequence::SequenceOperation<'a> {\n super::sequence::SequenceOperation::new().append(self)\n }\n}\n\nimpl<From, To> CopyOperation<From, To>\nwhere\n From: Debug,\n To: Debug,\n{\n pub fn follow_symlinks(mut self, value: bool) -> Self {\n self.follow_symlinks = value;\n self\n }\n\n pub fn recursive(mut self, value: bool) -> Self {\n self.recursive = value;\n self\n }\n\n pub fn create_path(mut self, value: bool) -> Self {\n self.create_path = value;\n self\n }\n\n pub fn wildcard(mut self, value: bool) -> Self {\n self.wildcard = value;\n self\n }\n}\n\nimpl<'a> FileOperation for OpWithDestination<'a> {\n fn output(&self) -> i32 {\n self.destination.0.into()\n }\n\n fn serialize_inputs(&self, cx: &mut Context) -> Result<Vec<pb::Input>> {\n let mut inputs = if let LayerPath::Other(ref op, ..) = self.source {\n let serialized_from_head = cx.register(op.operation())?;\n\n vec![pb::Input {\n digest: serialized_from_head.digest.clone(),\n index: op.output().into(),\n }]\n } else {\n vec![]\n };\n\n if let LayerPath::Other(ref op, ..) = self.destination.1 {\n let serialized_to_head = cx.register(op.operation())?;\n\n inputs.push(pb::Input {\n digest: serialized_to_head.digest.clone(),\n index: op.output().into(),\n });\n }\n\n Ok(inputs)\n }\n\n fn serialize_action(\n &self,\n inputs_count: usize,\n inputs_offset: usize,\n ) -> Result<pb::FileAction> {\n let (src_idx, src_offset, src) = match self.source {\n LayerPath::Scratch(ref path) => (-1, 0, path.to_string_lossy().into()),\n\n LayerPath::Other(_, ref path) => {\n (inputs_offset as i64, 1, path.to_string_lossy().into())\n }\n\n LayerPath::Own(ref output, ref path) => {\n let output: i64 = output.into();\n\n (\n inputs_count as i64 + output,\n 0,\n path.to_string_lossy().into(),\n )\n }\n };\n\n let (dest_idx, dest) = match self.destination.1 {\n LayerPath::Scratch(ref path) => (-1, path.to_string_lossy().into()),\n\n LayerPath::Other(_, ref path) => (\n inputs_offset as i32 + src_offset,\n path.to_string_lossy().into(),\n ),\n\n LayerPath::Own(ref output, ref path) => {\n let output: i32 = output.into();\n\n (inputs_count as i32 + output, path.to_string_lossy().into())\n }\n };\n\n Ok(pb::FileAction {\n input: i64::from(dest_idx),\n secondary_input: src_idx,\n\n output: i64::from(self.output()),\n\n action: Some(pb::file_action::Action::Copy(pb::FileActionCopy {\n src,\n dest,\n\n follow_symlink: self.follow_symlinks,\n dir_copy_contents: self.recursive,\n create_dest_path: self.create_path,\n allow_wildcard: self.wildcard,\n\n \n mode: -1,\n\n \n timestamp: -1,\n\n ..Default::default()\n })),\n })\n }\n}\n"},"prefix":{"kind":"string","value":"use std::collections::HashMap;\nuse std::fmt::Debug;\nuse std::path::{Path, PathBuf};\n\nuse buildkit_proto::pb;\n\nuse super::path::{LayerPath, UnsetPath};\nuse super::FileOperation;\n\nuse crate::serialization::{Context, Result};\nuse crate::utils::OutputIdx;\n\n#[derive(Debug)]\npub struct CopyOperation<From: Debug, To: Debug> {\n source: From,\n destination: To,\n\n follow_symlinks: bool,\n recursive: bool,\n create_path: bool,\n wildcard: bool,\n\n description: HashMap<String, String>,\n caps: HashMap<String, bool>,\n}\n\ntype OpWithoutSource = CopyOperation<UnsetPath, UnsetPath>;\ntype OpWithSource<'a> = CopyOperation<LayerPath<'a, PathBuf>, UnsetPath>;\ntype OpWithDestination<'a> =\n CopyOperation<LayerPath<'a, PathBuf>, (OutputIdx, LayerPath<'a, PathBuf>)>;\n\nimpl OpWithoutSource {\n pub(crate) fn new() -> OpWithoutSource {\n let mut caps = HashMap::<String, bool>::new();\n caps.insert(\"file.base\".into(), true);\n\n CopyOperation {\n source: UnsetPath,\n destination: UnsetPath,\n\n follow_symlinks: false,\n recursive: false,\n create_path: false,\n wildcard: false,\n\n caps,\n description: Default::default(),\n }\n }\n\n pub fn from<P>(self, source: LayerPath<'_, P>) -> OpWithSource\n where\n P: AsRef<Path>,\n {\n CopyOperation {\n source: source.into_owned(),\n destination: Unse"},"suffix":{"kind":"string","value":"ion: self.description,\n caps: self.caps,\n }\n }\n}\n\nimpl<'a> OpWithSource<'a> {\n pub fn to<P>(self, output: OutputIdx, destination: LayerPath<'a, P>) -> OpWithDestination<'a>\n where\n P: AsRef<Path>,\n {\n CopyOperation {\n source: self.source,\n destination: (output, destination.into_owned()),\n\n follow_symlinks: self.follow_symlinks,\n recursive: self.recursive,\n create_path: self.create_path,\n wildcard: self.wildcard,\n\n description: self.description,\n caps: self.caps,\n }\n }\n}\n\nimpl<'a> OpWithDestination<'a> {\n pub fn into_operation(self) -> super::sequence::SequenceOperation<'a> {\n super::sequence::SequenceOperation::new().append(self)\n }\n}\n\nimpl<From, To> CopyOperation<From, To>\nwhere\n From: Debug,\n To: Debug,\n{\n pub fn follow_symlinks(mut self, value: bool) -> Self {\n self.follow_symlinks = value;\n self\n }\n\n pub fn recursive(mut self, value: bool) -> Self {\n self.recursive = value;\n self\n }\n\n pub fn create_path(mut self, value: bool) -> Self {\n self.create_path = value;\n self\n }\n\n pub fn wildcard(mut self, value: bool) -> Self {\n self.wildcard = value;\n self\n }\n}\n\nimpl<'a> FileOperation for OpWithDestination<'a> {\n fn output(&self) -> i32 {\n self.destination.0.into()\n }\n\n fn serialize_inputs(&self, cx: &mut Context) -> Result<Vec<pb::Input>> {\n let mut inputs = if let LayerPath::Other(ref op, ..) = self.source {\n let serialized_from_head = cx.register(op.operation())?;\n\n vec![pb::Input {\n digest: serialized_from_head.digest.clone(),\n index: op.output().into(),\n }]\n } else {\n vec![]\n };\n\n if let LayerPath::Other(ref op, ..) = self.destination.1 {\n let serialized_to_head = cx.register(op.operation())?;\n\n inputs.push(pb::Input {\n digest: serialized_to_head.digest.clone(),\n index: op.output().into(),\n });\n }\n\n Ok(inputs)\n }\n\n fn serialize_action(\n &self,\n inputs_count: usize,\n inputs_offset: usize,\n ) -> Result<pb::FileAction> {\n let (src_idx, src_offset, src) = match self.source {\n LayerPath::Scratch(ref path) => (-1, 0, path.to_string_lossy().into()),\n\n LayerPath::Other(_, ref path) => {\n (inputs_offset as i64, 1, path.to_string_lossy().into())\n }\n\n LayerPath::Own(ref output, ref path) => {\n let output: i64 = output.into();\n\n (\n inputs_count as i64 + output,\n 0,\n path.to_string_lossy().into(),\n )\n }\n };\n\n let (dest_idx, dest) = match self.destination.1 {\n LayerPath::Scratch(ref path) => (-1, path.to_string_lossy().into()),\n\n LayerPath::Other(_, ref path) => (\n inputs_offset as i32 + src_offset,\n path.to_string_lossy().into(),\n ),\n\n LayerPath::Own(ref output, ref path) => {\n let output: i32 = output.into();\n\n (inputs_count as i32 + output, path.to_string_lossy().into())\n }\n };\n\n Ok(pb::FileAction {\n input: i64::from(dest_idx),\n secondary_input: src_idx,\n\n output: i64::from(self.output()),\n\n action: Some(pb::file_action::Action::Copy(pb::FileActionCopy {\n src,\n dest,\n\n follow_symlink: self.follow_symlinks,\n dir_copy_contents: self.recursive,\n create_dest_path: self.create_path,\n allow_wildcard: self.wildcard,\n\n \n mode: -1,\n\n \n timestamp: -1,\n\n ..Default::default()\n })),\n })\n }\n}\n"},"middle":{"kind":"string","value":"tPath,\n\n follow_symlinks: self.follow_symlinks,\n recursive: self.recursive,\n create_path: self.create_path,\n wildcard: self.wildcard,\n\n descript"},"strategy":{"kind":"string","value":"function_block-random_span"},"context_items":{"kind":"list like","value":[{"content":"pub fn from_env<T, I>(pairs: I) -> Result<T>\n\nwhere\n\n T: DeserializeOwned,\n\n I: IntoIterator<Item = (String, String)>,\n\n{\n\n let owned_pairs = pairs.into_iter().collect::<Vec<_>>();\n\n let pairs = {\n\n owned_pairs.iter().filter_map(|(name, value)| {\n\n if name.starts_with(\"BUILDKIT_FRONTEND_OPT_\") {\n\n Some(value)\n\n } else {\n\n None\n\n }\n\n })\n\n };\n\n\n\n let deserializer = EnvDeserializer {\n\n vals: pairs.map(|value| extract_name_and_value(&value)),\n\n };\n\n\n\n Ok(T::deserialize(deserializer)?)\n\n}\n\n\n","file_path":"dockerfile-plus/src/options.rs","rank":0,"score":119353.22785735317},{"content":"#[derive(Debug)]\n\nstruct EnvDeserializer<P> {\n\n vals: P,\n\n}\n\n\n","file_path":"dockerfile-plus/src/options.rs","rank":1,"score":103249.88702063338},{"content":"pub trait FileOperation: Debug + Send + Sync {\n\n fn output(&self) -> i32;\n\n\n\n fn serialize_inputs(&self, cx: &mut Context) -> Result<Vec<pb::Input>>;\n\n fn serialize_action(&self, inputs_count: usize, inputs_offset: usize)\n\n -> Result<pb::FileAction>;\n\n}\n\n\n","file_path":"buildkit-llb/src/ops/fs/mod.rs","rank":4,"score":84330.13439009895},{"content":"fn main() -> Result<(), Box<dyn std::error::Error>> {\n\n tonic_build::configure()\n\n .build_client(true)\n\n .build_server(true)\n\n .compile(DEFS, PATHS)?;\n\n\n\n Ok(())\n\n}\n","file_path":"buildkit-proto/build.rs","rank":6,"score":80684.48803103683},{"content":"#[test]\n\nfn prefixes() {\n\n crate::check_op!(\n\n GitSource::new(\"http://any.url\"),\n\n |digest| { \"sha256:ecde982e19ace932e5474e57b0ca71ba690ed7d28abff2a033e8f969e22bf2d8\" },\n\n |description| { vec![] },\n\n |caps| { vec![] },\n\n |cached_tail| { vec![] },\n\n |inputs| { vec![] },\n\n |op| {\n\n Op::Source(SourceOp {\n\n identifier: \"git://any.url\".into(),\n\n attrs: Default::default(),\n\n })\n\n },\n\n );\n\n\n\n crate::check_op!(\n\n GitSource::new(\"https://any.url\"),\n\n |digest| { \"sha256:ecde982e19ace932e5474e57b0ca71ba690ed7d28abff2a033e8f969e22bf2d8\" },\n\n |description| { vec![] },\n","file_path":"buildkit-llb/src/ops/source/git.rs","rank":7,"score":80201.89027429},{"content":"#[test]\n\nfn with_reference() {\n\n crate::check_op!(\n\n GitSource::new(\"any.url\").with_reference(\"abcdef\"),\n\n |digest| { \"sha256:f59aa7f8db62e0b5c2a1da396752ba8a2bb0b5d28ddcfdd1d4f822d26ebfe3cf\" },\n\n |description| { vec![] },\n\n |caps| { vec![] },\n\n |cached_tail| { vec![] },\n\n |inputs| { vec![] },\n\n |op| {\n\n Op::Source(SourceOp {\n\n identifier: \"git://any.url#abcdef\".into(),\n\n attrs: Default::default(),\n\n })\n\n },\n\n );\n\n}\n","file_path":"buildkit-llb/src/ops/source/git.rs","rank":8,"score":80201.89027429},{"content":"#[test]\n\nfn serialization() {\n\n crate::check_op!(\n\n GitSource::new(\"any.url\"),\n\n |digest| { \"sha256:ecde982e19ace932e5474e57b0ca71ba690ed7d28abff2a033e8f969e22bf2d8\" },\n\n |description| { vec![] },\n\n |caps| { vec![] },\n\n |cached_tail| { vec![] },\n\n |inputs| { vec![] },\n\n |op| {\n\n Op::Source(SourceOp {\n\n identifier: \"git://any.url\".into(),\n\n attrs: Default::default(),\n\n })\n\n },\n\n );\n\n\n\n crate::check_op!(\n\n GitSource::new(\"any.url\").custom_name(\"git custom name\"),\n\n |digest| { \"sha256:ecde982e19ace932e5474e57b0ca71ba690ed7d28abff2a033e8f969e22bf2d8\" },\n\n |description| { vec![(\"llb.customname\", \"git custom name\")] },\n","file_path":"buildkit-llb/src/ops/source/git.rs","rank":9,"score":80201.89027429},{"content":"#[test]\n\nfn serialization() {\n\n crate::check_op!(\n\n LocalSource::new(\"context\"),\n\n |digest| { \"sha256:a60212791641cbeaa3a49de4f7dff9e40ae50ec19d1be9607232037c1db16702\" },\n\n |description| { vec![] },\n\n |caps| { vec![] },\n\n |cached_tail| { vec![] },\n\n |inputs| { vec![] },\n\n |op| {\n\n Op::Source(SourceOp {\n\n identifier: \"local://context\".into(),\n\n attrs: Default::default(),\n\n })\n\n },\n\n );\n\n\n\n crate::check_op!(\n\n LocalSource::new(\"context\").custom_name(\"context custom name\"),\n\n |digest| { \"sha256:a60212791641cbeaa3a49de4f7dff9e40ae50ec19d1be9607232037c1db16702\" },\n\n |description| { vec![(\"llb.customname\", \"context custom name\")] },\n","file_path":"buildkit-llb/src/ops/source/local.rs","rank":10,"score":80201.89027429},{"content":"#[test]\n\nfn serialization() {\n\n crate::check_op!(\n\n HttpSource::new(\"http://any.url/with/path\"),\n\n |digest| { \"sha256:22ec64461f39dd3b54680fc240b459248b1ced597f113b5d692abe9695860d12\" },\n\n |description| { vec![] },\n\n |caps| { vec![] },\n\n |cached_tail| { vec![] },\n\n |inputs| { vec![] },\n\n |op| {\n\n Op::Source(SourceOp {\n\n identifier: \"http://any.url/with/path\".into(),\n\n attrs: Default::default(),\n\n })\n\n },\n\n );\n\n\n\n crate::check_op!(\n\n HttpSource::new(\"http://any.url/with/path\").custom_name(\"git custom name\"),\n\n |digest| { \"sha256:22ec64461f39dd3b54680fc240b459248b1ced597f113b5d692abe9695860d12\" },\n\n |description| { vec![(\"llb.customname\", \"git custom name\")] },\n","file_path":"buildkit-llb/src/ops/source/http.rs","rank":11,"score":80201.89027429},{"content":"#[test]\n\nfn serialization() {\n\n crate::check_op!(\n\n ImageSource::new(\"rustlang/rust:nightly\"),\n\n |digest| { \"sha256:dee2a3d7dd482dd8098ba543ff1dcb01efd29fcd16fdb0979ef556f38564543a\" },\n\n |description| { vec![] },\n\n |caps| { vec![] },\n\n |cached_tail| { vec![] },\n\n |inputs| { vec![] },\n\n |op| {\n\n Op::Source(SourceOp {\n\n identifier: \"docker-image://docker.io/rustlang/rust:nightly\".into(),\n\n attrs: Default::default(),\n\n })\n\n },\n\n );\n\n\n\n crate::check_op!(\n\n ImageSource::new(\"library/alpine:latest\"),\n\n |digest| { \"sha256:0e6b31ceed3e6dc542018f35a53a0e857e6a188453d32a2a5bbe7aa2971c1220\" },\n\n |description| { vec![] },\n","file_path":"buildkit-llb/src/ops/source/image.rs","rank":12,"score":80201.89027429},{"content":"#[test]\n\nfn image_name() {\n\n crate::check_op!(ImageSource::new(\"rustlang/rust\"), |op| {\n\n Op::Source(SourceOp {\n\n identifier: \"docker-image://docker.io/rustlang/rust:latest\".into(),\n\n attrs: Default::default(),\n\n })\n\n });\n\n\n\n crate::check_op!(ImageSource::new(\"rust:nightly\"), |op| {\n\n Op::Source(SourceOp {\n\n identifier: \"docker-image://docker.io/library/rust:nightly\".into(),\n\n attrs: Default::default(),\n\n })\n\n });\n\n\n\n crate::check_op!(ImageSource::new(\"rust\"), |op| {\n\n Op::Source(SourceOp {\n\n identifier: \"docker-image://docker.io/library/rust:latest\".into(),\n\n attrs: Default::default(),\n\n })\n","file_path":"buildkit-llb/src/ops/source/image.rs","rank":13,"score":78500.34372088609},{"content":"#[test]\n\nfn resolve_mode() {\n\n crate::check_op!(\n\n ImageSource::new(\"rustlang/rust:nightly\").with_resolve_mode(ResolveMode::Default),\n\n |digest| { \"sha256:792e246751e84b9a5e40c28900d70771a07e8cc920c1039cdddfc6bf69256dfe\" },\n\n |description| { vec![] },\n\n |caps| { vec![] },\n\n |cached_tail| { vec![] },\n\n |inputs| { vec![] },\n\n |op| {\n\n Op::Source(SourceOp {\n\n identifier: \"docker-image://docker.io/rustlang/rust:nightly\".into(),\n\n attrs: crate::utils::test::to_map(vec![(\"image.resolvemode\", \"default\")]),\n\n })\n\n },\n\n );\n\n\n\n crate::check_op!(\n\n ImageSource::new(\"rustlang/rust:nightly\").with_resolve_mode(ResolveMode::ForcePull),\n\n |digest| { \"sha256:0bd920010eab701bdce44c61d220e6943d56d3fb9a9fa4e773fc060c0d746122\" },\n\n |description| { vec![] },\n","file_path":"buildkit-llb/src/ops/source/image.rs","rank":14,"score":78500.34372088609},{"content":"fn extract_name_and_value(mut raw_value: &str) -> (&str, EnvValue) {\n\n if raw_value.starts_with(\"build-arg:\") {\n\n raw_value = raw_value.trim_start_matches(\"build-arg:\");\n\n }\n\n\n\n let mut parts = raw_value.splitn(2, '=');\n\n let name = parts.next().unwrap();\n\n\n\n match parts.next() {\n\n None => (name, EnvValue::Flag),\n\n Some(text) if text.is_empty() => (name, EnvValue::Flag),\n\n Some(text) if &text[0..1] == \"[\" || &text[0..1] == \"{\" => (name, EnvValue::Json(text)),\n\n Some(text) => (name, EnvValue::Text(text)),\n\n }\n\n}\n\n\n\nimpl<'de> IntoDeserializer<'de, serde::de::value::Error> for EnvValue<'de> {\n\n type Deserializer = Self;\n\n\n\n fn into_deserializer(self) -> Self::Deserializer {\n","file_path":"dockerfile-plus/src/options.rs","rank":15,"score":77141.80320970429},{"content":"fn build_init_commands(image: &ImageSource) -> Vec<OperationOutput> {\n\n (0..100)\n\n .map(|idx| {\n\n let base_dir = format!(\"/file/{}\", idx);\n\n let shell = format!(\"echo 'test {}' > /out{}/file.out\", idx, base_dir);\n\n\n\n let output_mount = FileSystem::mkdir(OutputIdx(0), LayerPath::Scratch(&base_dir))\n\n .make_parents(true)\n\n .into_operation()\n\n .ignore_cache(true)\n\n .ref_counted();\n\n\n\n Command::run(\"/bin/sh\")\n\n .args(&[\"-c\", &shell])\n\n .mount(Mount::ReadOnlyLayer(image.output(), \"/\"))\n\n .mount(Mount::Layer(OutputIdx(0), output_mount.output(0), \"/out\"))\n\n .ignore_cache(true)\n\n .ref_counted()\n\n .output(0)\n\n })\n\n .collect()\n\n}\n\n\n","file_path":"buildkit-llb/examples/highly-parallel.rs","rank":16,"score":63292.32039069585},{"content":"#[derive(Debug, Deserialize)]\n\nstruct DockerfileOptions {\n\n filename: Option<PathBuf>,\n\n}\n\n\n\nconst INCLUDE_COMMAND: &str = \"INCLUDE+\";\n\n\n\nasync fn dockerfile_trap(\n\n mut client: LlbBridgeClient<Channel>,\n\n dockerfile_frontend: DockerfileFrontend,\n\n dockerfile_contents: String,\n\n) -> Result<ReturnRequest> {\n\n let mut result: Vec<String> = vec![];\n\n let context_source = Source::local(\"context\");\n\n let context_layer = solve(&mut client, Terminal::with(context_source.output())).await?;\n\n\n\n fn replace(\n\n l : & String,\n\n r : &mut Vec<String>,\n\n c : &mut LlbBridgeClient<Channel>,\n\n ctx : & String\n","file_path":"dockerfile-plus/src/main.rs","rank":17,"score":55076.55444373955},{"content":"struct ProxyLlbServer {\n\n client: Arc<RwLock<LlbBridgeClient<Channel>>>,\n\n result_sender: Sender<frontend::ReturnRequest>,\n\n\n\n dockerfile_name: String,\n\n dockerfile_contents: Vec<u8>,\n\n}\n\n\n\nimpl ProxyLlbServer {\n\n fn new(\n\n client: LlbBridgeClient<Channel>,\n\n result_sender: Sender<frontend::ReturnRequest>,\n\n dockerfile_name: String,\n\n dockerfile_contents: Vec<u8>,\n\n ) -> Self {\n\n ProxyLlbServer {\n\n client: Arc::new(RwLock::new(client)),\n\n result_sender,\n\n dockerfile_name,\n\n dockerfile_contents,\n","file_path":"dockerfile-plus/src/dockerfile_frontend.rs","rank":18,"score":53264.10700414187},{"content":"fn main() {\n\n let builder_image =\n\n Source::image(\"library/alpine:latest\").custom_name(\"Using alpine:latest as a builder\");\n\n\n\n let command = {\n\n Command::run(\"/bin/sh\")\n\n .args(&[\"-c\", \"echo 'test string 5' > /out/file0\"])\n\n .custom_name(\"create a dummy file\")\n\n .mount(Mount::ReadOnlyLayer(builder_image.output(), \"/\"))\n\n .mount(Mount::Scratch(OutputIdx(0), \"/out\"))\n\n };\n\n\n\n let fs = {\n\n FileSystem::sequence()\n\n .custom_name(\"do multiple file system manipulations\")\n\n .append(\n\n FileSystem::copy()\n\n .from(LayerPath::Other(command.output(0), \"/file0\"))\n\n .to(OutputIdx(0), LayerPath::Other(command.output(0), \"/file1\")),\n\n )\n","file_path":"buildkit-llb/examples/scratch.rs","rank":19,"score":51885.602638147},{"content":"fn main() {\n\n let bitflags_archive = Source::http(\"https://crates.io/api/v1/crates/bitflags/1.0.4/download\")\n\n .with_file_name(\"bitflags.tar\");\n\n\n\n let alpine = Source::image(\"library/alpine:latest\");\n\n let bitflags_unpacked = {\n\n Command::run(\"/bin/tar\")\n\n .args(&[\n\n \"-xvzC\",\n\n \"/out\",\n\n \"--strip-components=1\",\n\n \"-f\",\n\n \"/in/bitflags.tar\",\n\n ])\n\n .mount(Mount::ReadOnlyLayer(alpine.output(), \"/\"))\n\n .mount(Mount::ReadOnlyLayer(bitflags_archive.output(), \"/in\"))\n\n .mount(Mount::Scratch(OutputIdx(0), \"/out\"))\n\n };\n\n\n\n let env_logger_repo = Source::git(\"https://github.com/sebasmagri/env_logger.git\")\n","file_path":"buildkit-llb/examples/network.rs","rank":20,"score":51885.602638147},{"content":"fn main() {\n\n let image = Source::image(\"library/alpine:latest\");\n\n let commands = build_init_commands(&image);\n\n let commands = build_modify_commands(&image, commands);\n\n\n\n let base_fs = FileSystem::sequence()\n\n .custom_name(\"assemble outputs\")\n\n .append(FileSystem::mkdir(\n\n OutputIdx(0),\n\n LayerPath::Scratch(\"/files\"),\n\n ));\n\n\n\n let (final_fs, final_output) =\n\n commands\n\n .into_iter()\n\n .zip(0..)\n\n .fold((base_fs, 0), |(fs, last_output), (output, idx)| {\n\n let layer = fs.append(\n\n FileSystem::copy()\n\n .from(LayerPath::Other(output, format!(\"/file-{}.out\", idx)))\n","file_path":"buildkit-llb/examples/highly-parallel.rs","rank":21,"score":50918.51692782246},{"content":"#[test]\n\nfn serialization() {\n\n use crate::prelude::*;\n\n\n\n let context = Source::local(\"context\");\n\n let builder_image = Source::image(\"rustlang/rust:nightly\");\n\n let final_image = Source::image(\"library/alpine:latest\");\n\n\n\n let first_command = Command::run(\"rustc\")\n\n .args(&[\"--crate-name\", \"crate-1\"])\n\n .mount(Mount::ReadOnlyLayer(builder_image.output(), \"/\"))\n\n .mount(Mount::ReadOnlyLayer(context.output(), \"/context\"))\n\n .mount(Mount::Scratch(OutputIdx(0), \"/target\"));\n\n\n\n let second_command = Command::run(\"rustc\")\n\n .args(&[\"--crate-name\", \"crate-2\"])\n\n .mount(Mount::ReadOnlyLayer(builder_image.output(), \"/\"))\n\n .mount(Mount::ReadOnlyLayer(context.output(), \"/context\"))\n\n .mount(Mount::Scratch(OutputIdx(0), \"/target\"));\n\n\n\n let assembly_op = FileSystem::sequence()\n","file_path":"buildkit-llb/src/ops/terminal.rs","rank":22,"score":50918.51692782246},{"content":"fn main() {\n\n Terminal::with(build_graph())\n\n .write_definition(stdout())\n\n .unwrap()\n\n}\n\n\n","file_path":"buildkit-llb/examples/scratch-owned.rs","rank":23,"score":50918.51692782246},{"content":"#[test]\n\nfn serialization() {\n\n use crate::prelude::*;\n\n use buildkit_proto::pb::{op::Op, ExecOp, Meta, NetMode, SecurityMode};\n\n\n\n crate::check_op!(\n\n {\n\n Command::run(\"/bin/sh\")\n\n .args(&[\"-c\", \"echo 'test string' > /out/file0\"])\n\n .env(\"HOME\", \"/root\")\n\n .custom_name(\"exec custom name\")\n\n },\n\n |digest| { \"sha256:dc9a5a3cd84bb1c7b633f1750fdfccd9d0a69d060f8e3babb297bc190e2d7484\" },\n\n |description| { vec![(\"llb.customname\", \"exec custom name\")] },\n\n |caps| { vec![] },\n\n |cached_tail| { vec![] },\n\n |inputs| { vec![] },\n\n |op| {\n\n Op::Exec(ExecOp {\n\n mounts: vec![],\n\n network: NetMode::Unset.into(),\n","file_path":"buildkit-llb/src/ops/exec/mod.rs","rank":24,"score":50006.81925011307},{"content":"#[test]\n\nfn copy_serialization() {\n\n use crate::prelude::*;\n\n use buildkit_proto::pb::{file_action::Action, op::Op, FileAction, FileActionCopy, FileOp};\n\n\n\n let context = Source::local(\"context\");\n\n let builder_image = Source::image(\"rustlang/rust:nightly\");\n\n\n\n let operation = FileSystem::sequence()\n\n .append(\n\n FileSystem::copy()\n\n .from(LayerPath::Other(context.output(), \"Cargo.toml\"))\n\n .to(OutputIdx(0), LayerPath::Scratch(\"Cargo.toml\")),\n\n )\n\n .append(\n\n FileSystem::copy()\n\n .from(LayerPath::Other(builder_image.output(), \"/bin/sh\"))\n\n .to(OutputIdx(1), LayerPath::Own(OwnOutputIdx(0), \"/bin/sh\")),\n\n )\n\n .append(\n\n FileSystem::copy()\n","file_path":"buildkit-llb/src/ops/fs/mod.rs","rank":25,"score":49145.8837053224},{"content":"#[test]\n\nfn mkfile_serialization() {\n\n use crate::prelude::*;\n\n use buildkit_proto::pb::{file_action::Action, op::Op, FileAction, FileActionMkFile, FileOp};\n\n\n\n let context = Source::local(\"context\");\n\n\n\n let operation = FileSystem::sequence()\n\n .append(\n\n FileSystem::mkfile(\n\n OutputIdx(0),\n\n LayerPath::Other(context.output(), \"/build-plan.json\"),\n\n )\n\n .data(b\"any bytes\".to_vec()),\n\n )\n\n .append(FileSystem::mkfile(\n\n OutputIdx(1),\n\n LayerPath::Scratch(\"/build-graph.json\"),\n\n ))\n\n .append(FileSystem::mkfile(\n\n OutputIdx(2),\n","file_path":"buildkit-llb/src/ops/fs/mod.rs","rank":26,"score":49145.8837053224},{"content":"#[test]\n\nfn serialization_with_user() {\n\n use crate::prelude::*;\n\n use buildkit_proto::pb::{op::Op, ExecOp, Meta, NetMode, SecurityMode};\n\n\n\n crate::check_op!(\n\n Command::run(\"cargo\").args(&[\"build\"]).user(\"builder\"),\n\n |digest| { \"sha256:7631ea645e2126e9dbc5d9ae789e34301d9d5c80ce89bfa72bc9b82aa43b57c0\" },\n\n |description| { vec![] },\n\n |caps| { vec![] },\n\n |cached_tail| { vec![] },\n\n |inputs| { vec![] },\n\n |op| {\n\n Op::Exec(ExecOp {\n\n mounts: vec![],\n\n network: NetMode::Unset.into(),\n\n security: SecurityMode::Sandbox.into(),\n\n meta: Some(Meta {\n\n args: crate::utils::test::to_vec(vec![\"cargo\", \"build\"]),\n\n env: vec![],\n\n cwd: \"/\".into(),\n\n user: \"builder\".into(),\n\n\n\n extra_hosts: vec![],\n\n proxy_env: None,\n\n }),\n\n })\n\n },\n\n );\n\n}\n\n\n","file_path":"buildkit-llb/src/ops/exec/mod.rs","rank":27,"score":49145.8837053224},{"content":"#[test]\n\nfn mkdir_serialization() {\n\n use crate::prelude::*;\n\n use buildkit_proto::pb::{file_action::Action, op::Op, FileAction, FileActionMkDir, FileOp};\n\n\n\n let context = Source::local(\"context\");\n\n\n\n let operation = FileSystem::sequence()\n\n .append(\n\n FileSystem::mkdir(\n\n OutputIdx(0),\n\n LayerPath::Other(context.output(), \"/new-crate\"),\n\n )\n\n .make_parents(true),\n\n )\n\n .append(FileSystem::mkdir(\n\n OutputIdx(1),\n\n LayerPath::Scratch(\"/new-crate\"),\n\n ))\n\n .append(FileSystem::mkdir(\n\n OutputIdx(2),\n","file_path":"buildkit-llb/src/ops/fs/mod.rs","rank":28,"score":49145.8837053224},{"content":"#[test]\n\nfn serialization_with_cwd() {\n\n use crate::prelude::*;\n\n use buildkit_proto::pb::{op::Op, ExecOp, Meta, NetMode, SecurityMode};\n\n\n\n crate::check_op!(\n\n Command::run(\"cargo\").args(&[\"build\"]).cwd(\"/rust-src\"),\n\n |digest| { \"sha256:b8120a0e1d1f7fcaa3d6c95db292d064524dc92c6cae8b97672d4e1eafcd03fa\" },\n\n |description| { vec![] },\n\n |caps| { vec![] },\n\n |cached_tail| { vec![] },\n\n |inputs| { vec![] },\n\n |op| {\n\n Op::Exec(ExecOp {\n\n mounts: vec![],\n\n network: NetMode::Unset.into(),\n\n security: SecurityMode::Sandbox.into(),\n\n meta: Some(Meta {\n\n args: crate::utils::test::to_vec(vec![\"cargo\", \"build\"]),\n\n env: vec![],\n\n cwd: \"/rust-src\".into(),\n\n user: \"root\".into(),\n\n\n\n extra_hosts: vec![],\n\n proxy_env: None,\n\n }),\n\n })\n\n },\n\n );\n\n}\n\n\n","file_path":"buildkit-llb/src/ops/exec/mod.rs","rank":29,"score":49145.8837053224},{"content":"#[test]\n\nfn serialization_with_mounts() {\n\n use crate::prelude::*;\n\n use buildkit_proto::pb::{\n\n op::Op, CacheOpt, CacheSharingOpt, ExecOp, Meta, MountType, NetMode, SecurityMode,\n\n };\n\n\n\n let context = Source::local(\"context\");\n\n let builder_image = Source::image(\"rustlang/rust:nightly\");\n\n let final_image = Source::image(\"library/alpine:latest\");\n\n\n\n let command = Command::run(\"cargo\")\n\n .args(&[\"build\"])\n\n .mount(Mount::ReadOnlyLayer(builder_image.output(), \"/\"))\n\n .mount(Mount::Scratch(OutputIdx(1), \"/tmp\"))\n\n .mount(Mount::ReadOnlySelector(\n\n context.output(),\n\n \"/buildkit-frontend\",\n\n \"/frontend-sources\",\n\n ))\n\n .mount(Mount::Layer(OutputIdx(0), final_image.output(), \"/output\"))\n","file_path":"buildkit-llb/src/ops/exec/mod.rs","rank":30,"score":49145.8837053224},{"content":"#[test]\n\nfn serialization_with_ssh_mounts() {\n\n use crate::prelude::*;\n\n use buildkit_proto::pb::{op::Op, ExecOp, Meta, MountType, NetMode, SecurityMode, SshOpt};\n\n\n\n let builder_image = Source::image(\"rustlang/rust:nightly\");\n\n let command = Command::run(\"cargo\")\n\n .args(&[\"build\"])\n\n .mount(Mount::ReadOnlyLayer(builder_image.output(), \"/\"))\n\n .mount(Mount::OptionalSshAgent(\"/run/buildkit/ssh_agent.0\"));\n\n\n\n crate::check_op!(\n\n command,\n\n |digest| { \"sha256:1ac1438c67a153878f21fe8067383fd7544901261374eb53ba8bf26e9a5821a5\" },\n\n |description| { vec![] },\n\n |caps| { vec![\"exec.mount.bind\", \"exec.mount.ssh\"] },\n\n |cached_tail| {\n\n vec![\"sha256:dee2a3d7dd482dd8098ba543ff1dcb01efd29fcd16fdb0979ef556f38564543a\"]\n\n },\n\n |inputs| {\n\n vec![(\n","file_path":"buildkit-llb/src/ops/exec/mod.rs","rank":31,"score":48331.58556942726},{"content":"#[test]\n\nfn serialization_with_env_iter() {\n\n use crate::prelude::*;\n\n use buildkit_proto::pb::{op::Op, ExecOp, Meta, NetMode, SecurityMode};\n\n\n\n crate::check_op!(\n\n {\n\n Command::run(\"cargo\").args(&[\"build\"]).env_iter(vec![\n\n (\"HOME\", \"/root\"),\n\n (\"PATH\", \"/bin\"),\n\n (\"CARGO_HOME\", \"/root/.cargo\"),\n\n ])\n\n },\n\n |digest| { \"sha256:7675be0b02acb379d57bafee5dc749fca7e795fb1e0a92748ccc59a7bc3b491e\" },\n\n |description| { vec![] },\n\n |caps| { vec![] },\n\n |cached_tail| { vec![] },\n\n |inputs| { vec![] },\n\n |op| {\n\n Op::Exec(ExecOp {\n\n mounts: vec![],\n","file_path":"buildkit-llb/src/ops/exec/mod.rs","rank":32,"score":48331.58556942726},{"content":"#[test]\n\nfn copy_with_params_serialization() {\n\n use crate::prelude::*;\n\n use buildkit_proto::pb::{file_action::Action, op::Op, FileAction, FileActionCopy, FileOp};\n\n\n\n let context = Source::local(\"context\");\n\n\n\n let operation = FileSystem::sequence()\n\n .append(\n\n FileSystem::copy()\n\n .from(LayerPath::Other(context.output(), \"Cargo.toml\"))\n\n .to(OutputIdx(0), LayerPath::Scratch(\"Cargo.toml\"))\n\n .follow_symlinks(true),\n\n )\n\n .append(\n\n FileSystem::copy()\n\n .from(LayerPath::Other(context.output(), \"Cargo.toml\"))\n\n .to(OutputIdx(1), LayerPath::Scratch(\"Cargo.toml\"))\n\n .recursive(true),\n\n )\n\n .append(\n","file_path":"buildkit-llb/src/ops/fs/mod.rs","rank":33,"score":48331.58556942726},{"content":"/// Common operation methods.\n\npub trait OperationBuilder<'a> {\n\n /// Sets an operation display name.\n\n fn custom_name<S>(self, name: S) -> Self\n\n where\n\n S: Into<String>;\n\n\n\n /// Sets caching behavior.\n\n fn ignore_cache(self, ignore: bool) -> Self;\n\n\n\n /// Convert the operation into `Arc` so it can be shared when efficient borrowing is not possible.\n\n fn ref_counted(self) -> Arc<Self>\n\n where\n\n Self: Sized + 'a,\n\n {\n\n Arc::new(self)\n\n }\n\n}\n","file_path":"buildkit-llb/src/ops/mod.rs","rank":34,"score":47920.413221495895},{"content":"#[test]\n\nfn serialization_with_several_root_mounts() {\n\n use crate::prelude::*;\n\n use buildkit_proto::pb::{op::Op, ExecOp, Meta, MountType, NetMode, SecurityMode};\n\n\n\n let builder_image = Source::image(\"rustlang/rust:nightly\");\n\n let final_image = Source::image(\"library/alpine:latest\");\n\n\n\n let command = Command::run(\"cargo\")\n\n .args(&[\"build\"])\n\n .mount(Mount::Scratch(OutputIdx(0), \"/tmp\"))\n\n .mount(Mount::ReadOnlyLayer(builder_image.output(), \"/\"))\n\n .mount(Mount::Scratch(OutputIdx(1), \"/var\"))\n\n .mount(Mount::ReadOnlyLayer(final_image.output(), \"/\"));\n\n\n\n crate::check_op!(\n\n command,\n\n |digest| { \"sha256:baa1bf591d2c47058b7361a0284fa8a3f1bd0fac8a93c87affa77ddc0a5026fd\" },\n\n |description| { vec![] },\n\n |caps| { vec![\"exec.mount.bind\"] },\n\n |cached_tail| {\n","file_path":"buildkit-llb/src/ops/exec/mod.rs","rank":35,"score":47560.23521145835},{"content":"pub trait MultiBorrowedOutput<'a> {\n\n fn output(&'a self, number: u32) -> OperationOutput<'a>;\n\n}\n\n\n","file_path":"buildkit-llb/src/ops/mod.rs","rank":36,"score":47092.67836283872},{"content":"pub trait MultiOwnedOutput<'a> {\n\n fn output(&self, number: u32) -> OperationOutput<'a>;\n\n}\n\n\n","file_path":"buildkit-llb/src/ops/mod.rs","rank":37,"score":47092.67836283872},{"content":"pub trait SingleOwnedOutput<'a> {\n\n fn output(&self) -> OperationOutput<'a>;\n\n}\n\n\n","file_path":"buildkit-llb/src/ops/mod.rs","rank":38,"score":47092.67836283872},{"content":"pub trait SingleBorrowedOutput<'a> {\n\n fn output(&'a self) -> OperationOutput<'a>;\n\n}\n\n\n","file_path":"buildkit-llb/src/ops/mod.rs","rank":39,"score":47092.67836283872},{"content":"fn build_modify_commands<'a>(\n\n image: &'a ImageSource,\n\n layers: Vec<OperationOutput<'a>>,\n\n) -> Vec<OperationOutput<'a>> {\n\n layers\n\n .into_iter()\n\n .zip(0..)\n\n .map(|(output, idx)| {\n\n let shell = format!(\n\n \"sed s/test/modified/ < /in/file/{}/file.in > /out/file-{}.out\",\n\n idx, idx\n\n );\n\n\n\n Command::run(\"/bin/sh\")\n\n .args(&[\"-c\", &shell])\n\n .mount(Mount::ReadOnlyLayer(image.output(), \"/\"))\n\n .mount(Mount::Scratch(OutputIdx(0), \"/out\"))\n\n .mount(Mount::ReadOnlySelector(\n\n output,\n\n format!(\"/in/file/{}/file.in\", idx),\n\n format!(\"file/{}/file.out\", idx),\n\n ))\n\n .ignore_cache(true)\n\n .ref_counted()\n\n .output(0)\n\n })\n\n .collect()\n\n}\n","file_path":"buildkit-llb/examples/highly-parallel.rs","rank":40,"score":46870.47977400101},{"content":"pub trait MultiOwnedLastOutput<'a> {\n\n fn last_output(&self) -> Option<OperationOutput<'a>>;\n\n}\n\n\n","file_path":"buildkit-llb/src/ops/mod.rs","rank":41,"score":46308.599962822846},{"content":"pub trait MultiBorrowedLastOutput<'a> {\n\n fn last_output(&'a self) -> Option<OperationOutput<'a>>;\n\n}\n\n\n","file_path":"buildkit-llb/src/ops/mod.rs","rank":42,"score":46308.599962822846},{"content":"#[derive(Debug)]\n\nstruct EnvItem<'de>(&'de str);\n\n\n","file_path":"dockerfile-plus/src/options.rs","rank":43,"score":45911.94391352548},{"content":"fn build_graph() -> OperationOutput<'static> {\n\n let builder_image = Source::image(\"library/alpine:latest\")\n\n .custom_name(\"Using alpine:latest as a builder\")\n\n .ref_counted();\n\n\n\n let command = {\n\n Command::run(\"/bin/sh\")\n\n .args(&[\"-c\", \"echo 'test string 5' > /out/file0\"])\n\n .custom_name(\"create a dummy file\")\n\n .mount(Mount::ReadOnlyLayer(builder_image.output(), \"/\"))\n\n .mount(Mount::Scratch(OutputIdx(0), \"/out\"))\n\n .ref_counted()\n\n };\n\n\n\n let fs = {\n\n FileSystem::sequence()\n\n .custom_name(\"do multiple file system manipulations\")\n\n .append(\n\n FileSystem::copy()\n\n .from(LayerPath::Other(command.output(0), \"/file0\"))\n","file_path":"buildkit-llb/examples/scratch-owned.rs","rank":44,"score":43494.27465520869},{"content":"use std::collections::HashMap;\n\nuse std::sync::Arc;\n\n\n\nuse buildkit_proto::pb::{self, op::Op, OpMetadata, SourceOp};\n\n\n\nuse crate::ops::{OperationBuilder, SingleBorrowedOutput, SingleOwnedOutput};\n\nuse crate::serialization::{Context, Node, Operation, OperationId, Result};\n\nuse crate::utils::{OperationOutput, OutputIdx};\n\n\n\n#[derive(Default, Debug)]\n\npub struct GitSource {\n\n id: OperationId,\n\n remote: String,\n\n reference: Option<String>,\n\n description: HashMap<String, String>,\n\n ignore_cache: bool,\n\n}\n\n\n\nimpl GitSource {\n\n pub(crate) fn new<S>(url: S) -> Self\n","file_path":"buildkit-llb/src/ops/source/git.rs","rank":45,"score":31108.52729114938},{"content":"use std::collections::HashMap;\n\nuse std::sync::Arc;\n\n\n\nuse buildkit_proto::pb::{self, op::Op, OpMetadata, SourceOp};\n\n\n\nuse crate::ops::{OperationBuilder, SingleBorrowedOutput, SingleOwnedOutput};\n\nuse crate::serialization::{Context, Node, Operation, OperationId, Result};\n\nuse crate::utils::{OperationOutput, OutputIdx};\n\n\n\n#[derive(Default, Debug)]\n\npub struct HttpSource {\n\n id: OperationId,\n\n url: String,\n\n file_name: Option<String>,\n\n description: HashMap<String, String>,\n\n ignore_cache: bool,\n\n}\n\n\n\nimpl HttpSource {\n\n pub(crate) fn new<S>(url: S) -> Self\n","file_path":"buildkit-llb/src/ops/source/http.rs","rank":46,"score":31108.40075673507},{"content":"mod git;\n\nmod http;\n\nmod image;\n\nmod local;\n\n\n\npub use self::git::GitSource;\n\npub use self::http::HttpSource;\n\npub use self::image::{ImageSource, ResolveMode};\n\npub use self::local::LocalSource;\n\n\n\n/// Provide an input for other operations. For example: `FROM` directive in Dockerfile.\n\n#[derive(Debug)]\n\npub struct Source;\n\n\n\nimpl Source {\n\n pub fn image<S>(name: S) -> ImageSource\n\n where\n\n S: Into<String>,\n\n {\n\n ImageSource::new(name)\n","file_path":"buildkit-llb/src/ops/source/mod.rs","rank":47,"score":31105.747022982516},{"content":"use std::collections::HashMap;\n\nuse std::sync::Arc;\n\n\n\nuse buildkit_proto::pb::{self, op::Op, OpMetadata, SourceOp};\n\n\n\nuse crate::ops::{OperationBuilder, SingleBorrowedOutput, SingleOwnedOutput};\n\nuse crate::serialization::{Context, Node, Operation, OperationId, Result};\n\nuse crate::utils::{OperationOutput, OutputIdx};\n\n\n\n#[derive(Default, Debug)]\n\npub struct LocalSource {\n\n id: OperationId,\n\n name: String,\n\n description: HashMap<String, String>,\n\n ignore_cache: bool,\n\n\n\n exclude: Vec<String>,\n\n include: Vec<String>,\n\n}\n\n\n","file_path":"buildkit-llb/src/ops/source/local.rs","rank":48,"score":31104.733996424904},{"content":"\n\n description: HashMap<String, String>,\n\n ignore_cache: bool,\n\n resolve_mode: Option<ResolveMode>,\n\n}\n\n\n\n#[derive(Debug, Clone, Copy)]\n\npub enum ResolveMode {\n\n Default,\n\n ForcePull,\n\n PreferLocal,\n\n}\n\n\n\nimpl fmt::Display for ResolveMode {\n\n fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {\n\n match self {\n\n ResolveMode::Default => write!(f, \"default\"),\n\n ResolveMode::ForcePull => write!(f, \"pull\"),\n\n ResolveMode::PreferLocal => write!(f, \"local\"),\n\n }\n","file_path":"buildkit-llb/src/ops/source/image.rs","rank":49,"score":31102.783418765062},{"content":" description: Default::default(),\n\n ignore_cache: false,\n\n }\n\n }\n\n}\n\n\n\nimpl GitSource {\n\n pub fn with_reference<S>(mut self, reference: S) -> Self\n\n where\n\n S: Into<String>,\n\n {\n\n self.reference = Some(reference.into());\n\n self\n\n }\n\n}\n\n\n\nimpl<'a> SingleBorrowedOutput<'a> for GitSource {\n\n fn output(&'a self) -> OperationOutput<'a> {\n\n OperationOutput::borrowed(self, OutputIdx(0))\n\n }\n","file_path":"buildkit-llb/src/ops/source/git.rs","rank":50,"score":31102.11265673415},{"content":" self.description\n\n .insert(\"llb.customname\".into(), name.into());\n\n\n\n self\n\n }\n\n\n\n fn ignore_cache(mut self, ignore: bool) -> Self {\n\n self.ignore_cache = ignore;\n\n self\n\n }\n\n}\n\n\n\nimpl Operation for HttpSource {\n\n fn id(&self) -> &OperationId {\n\n &self.id\n\n }\n\n\n\n fn serialize(&self, _: &mut Context) -> Result<Node> {\n\n let mut attrs = HashMap::default();\n\n\n","file_path":"buildkit-llb/src/ops/source/http.rs","rank":51,"score":31102.10819247008},{"content":" fn custom_name<S>(mut self, name: S) -> Self\n\n where\n\n S: Into<String>,\n\n {\n\n self.description\n\n .insert(\"llb.customname\".into(), name.into());\n\n\n\n self\n\n }\n\n\n\n fn ignore_cache(mut self, ignore: bool) -> Self {\n\n self.ignore_cache = ignore;\n\n self\n\n }\n\n}\n\n\n\nimpl Operation for ImageSource {\n\n fn id(&self) -> &OperationId {\n\n &self.id\n\n }\n","file_path":"buildkit-llb/src/ops/source/image.rs","rank":52,"score":31101.838769448586},{"content":"}\n\n\n\nimpl<'a> SingleOwnedOutput<'static> for Arc<GitSource> {\n\n fn output(&self) -> OperationOutput<'static> {\n\n OperationOutput::owned(self.clone(), OutputIdx(0))\n\n }\n\n}\n\n\n\nimpl OperationBuilder<'static> for GitSource {\n\n fn custom_name<S>(mut self, name: S) -> Self\n\n where\n\n S: Into<String>,\n\n {\n\n self.description\n\n .insert(\"llb.customname\".into(), name.into());\n\n\n\n self\n\n }\n\n\n\n fn ignore_cache(mut self, ignore: bool) -> Self {\n","file_path":"buildkit-llb/src/ops/source/git.rs","rank":53,"score":31101.637045006886},{"content":"impl LocalSource {\n\n pub(crate) fn new<S>(name: S) -> Self\n\n where\n\n S: Into<String>,\n\n {\n\n Self {\n\n id: OperationId::default(),\n\n name: name.into(),\n\n ignore_cache: false,\n\n\n\n ..Default::default()\n\n }\n\n }\n\n\n\n pub fn add_include_pattern<S>(mut self, include: S) -> Self\n\n where\n\n S: Into<String>,\n\n {\n\n // TODO: add `source.local.includepatterns` capability\n\n self.include.push(include.into());\n","file_path":"buildkit-llb/src/ops/source/local.rs","rank":54,"score":31101.507837047953},{"content":" where\n\n S: Into<String>,\n\n {\n\n Self {\n\n id: OperationId::default(),\n\n url: url.into(),\n\n file_name: None,\n\n description: Default::default(),\n\n ignore_cache: false,\n\n }\n\n }\n\n}\n\n\n\nimpl HttpSource {\n\n pub fn with_file_name<S>(mut self, name: S) -> Self\n\n where\n\n S: Into<String>,\n\n {\n\n self.file_name = Some(name.into());\n\n self\n","file_path":"buildkit-llb/src/ops/source/http.rs","rank":55,"score":31101.233482464002},{"content":"use std::collections::HashMap;\n\nuse std::fmt;\n\nuse std::sync::Arc;\n\n\n\nuse buildkit_proto::pb::{self, op::Op, OpMetadata, SourceOp};\n\nuse lazy_static::*;\n\nuse regex::Regex;\n\n\n\nuse crate::ops::{OperationBuilder, SingleBorrowedOutput, SingleOwnedOutput};\n\nuse crate::serialization::{Context, Node, Operation, OperationId, Result};\n\nuse crate::utils::{OperationOutput, OutputIdx};\n\n\n\n#[derive(Debug)]\n\npub struct ImageSource {\n\n id: OperationId,\n\n\n\n domain: Option<String>,\n\n name: String,\n\n tag: Option<String>,\n\n digest: Option<String>,\n","file_path":"buildkit-llb/src/ops/source/image.rs","rank":56,"score":31100.940612884264},{"content":" }\n\n\n\n pub fn git<S>(url: S) -> GitSource\n\n where\n\n S: Into<String>,\n\n {\n\n GitSource::new(url)\n\n }\n\n\n\n pub fn local<S>(name: S) -> LocalSource\n\n where\n\n S: Into<String>,\n\n {\n\n LocalSource::new(name)\n\n }\n\n\n\n pub fn http<S>(name: S) -> HttpSource\n\n where\n\n S: Into<String>,\n\n {\n\n HttpSource::new(name)\n\n }\n\n}\n","file_path":"buildkit-llb/src/ops/source/mod.rs","rank":57,"score":31100.74453258572},{"content":" fn output(&self) -> OperationOutput<'static> {\n\n OperationOutput::owned(self.clone(), OutputIdx(0))\n\n }\n\n}\n\n\n\nimpl OperationBuilder<'static> for LocalSource {\n\n fn custom_name<S>(mut self, name: S) -> Self\n\n where\n\n S: Into<String>,\n\n {\n\n self.description\n\n .insert(\"llb.customname\".into(), name.into());\n\n\n\n self\n\n }\n\n\n\n fn ignore_cache(mut self, ignore: bool) -> Self {\n\n self.ignore_cache = ignore;\n\n self\n\n }\n","file_path":"buildkit-llb/src/ops/source/local.rs","rank":58,"score":31100.56007544263},{"content":"\n\n fn serialize(&self, _: &mut Context) -> Result<Node> {\n\n let mut attrs = HashMap::default();\n\n\n\n if let Some(ref mode) = self.resolve_mode {\n\n attrs.insert(\"image.resolvemode\".into(), mode.to_string());\n\n }\n\n\n\n let head = pb::Op {\n\n op: Some(Op::Source(SourceOp {\n\n identifier: format!(\"docker-image://{}\", self.canonical_name()),\n\n attrs,\n\n })),\n\n\n\n ..Default::default()\n\n };\n\n\n\n let metadata = OpMetadata {\n\n description: self.description.clone(),\n\n ignore_cache: self.ignore_cache,\n\n\n\n ..Default::default()\n\n };\n\n\n\n Ok(Node::new(head, metadata))\n\n }\n\n}\n\n\n\n#[test]\n","file_path":"buildkit-llb/src/ops/source/image.rs","rank":59,"score":31100.250740322277},{"content":" self\n\n }\n\n\n\n pub fn add_exclude_pattern<S>(mut self, exclude: S) -> Self\n\n where\n\n S: Into<String>,\n\n {\n\n // TODO: add `source.local.excludepatterns` capability\n\n self.exclude.push(exclude.into());\n\n self\n\n }\n\n}\n\n\n\nimpl<'a> SingleBorrowedOutput<'a> for LocalSource {\n\n fn output(&'a self) -> OperationOutput<'a> {\n\n OperationOutput::borrowed(self, OutputIdx(0))\n\n }\n\n}\n\n\n\nimpl<'a> SingleOwnedOutput<'static> for Arc<LocalSource> {\n","file_path":"buildkit-llb/src/ops/source/local.rs","rank":60,"score":31099.056347008427},{"content":" |caps| { vec![] },\n\n |cached_tail| { vec![] },\n\n |inputs| { vec![] },\n\n |op| {\n\n Op::Source(SourceOp {\n\n identifier: \"http://any.url/with/path\".into(),\n\n attrs: Default::default(),\n\n })\n\n },\n\n );\n\n\n\n crate::check_op!(\n\n HttpSource::new(\"http://any.url/with/path\").with_file_name(\"file.name\"),\n\n |digest| { \"sha256:e1fe6584287dfa2b065ed29fcf4f77bcf86fb54781832d2f45074fa1671df692\" },\n\n |description| { vec![] },\n\n |caps| { vec![] },\n\n |cached_tail| { vec![] },\n\n |inputs| { vec![] },\n\n |op| {\n\n Op::Source(SourceOp {\n\n identifier: \"http://any.url/with/path\".into(),\n\n attrs: vec![(\"http.filename\".to_string(), \"file.name\".to_string())]\n\n .into_iter()\n\n .collect(),\n\n })\n\n },\n\n );\n\n}\n","file_path":"buildkit-llb/src/ops/source/http.rs","rank":61,"score":31098.62570449154},{"content":"}\n\n\n\nimpl Operation for LocalSource {\n\n fn id(&self) -> &OperationId {\n\n &self.id\n\n }\n\n\n\n fn serialize(&self, _: &mut Context) -> Result<Node> {\n\n let mut attrs = HashMap::default();\n\n\n\n if !self.exclude.is_empty() {\n\n attrs.insert(\n\n \"local.excludepatterns\".into(),\n\n serde_json::to_string(&self.exclude).unwrap(),\n\n );\n\n }\n\n\n\n if !self.include.is_empty() {\n\n attrs.insert(\n\n \"local.includepattern\".into(),\n","file_path":"buildkit-llb/src/ops/source/local.rs","rank":62,"score":31098.56953664328},{"content":" }\n\n}\n\n\n\nimpl Default for ResolveMode {\n\n fn default() -> Self {\n\n ResolveMode::Default\n\n }\n\n}\n\n\n\nlazy_static! {\n\n static ref TAG_EXPR: Regex = Regex::new(r\":[\\w][\\w.-]+$\").unwrap();\n\n}\n\n\n\nimpl ImageSource {\n\n // The implementation is based on:\n\n // https://github.com/containerd/containerd/blob/614c0858f2a8db9ee0c788a9164870069f3e53ed/reference/docker/reference.go\n\n pub(crate) fn new<S>(name: S) -> Self\n\n where\n\n S: Into<String>,\n\n {\n","file_path":"buildkit-llb/src/ops/source/image.rs","rank":63,"score":31098.339351276747},{"content":" |caps| { vec![] },\n\n |cached_tail| { vec![] },\n\n |inputs| { vec![] },\n\n |op| {\n\n Op::Source(SourceOp {\n\n identifier: \"git://any.url\".into(),\n\n attrs: Default::default(),\n\n })\n\n },\n\n );\n\n\n\n crate::check_op!(\n\n GitSource::new(\"git://any.url\"),\n\n |digest| { \"sha256:ecde982e19ace932e5474e57b0ca71ba690ed7d28abff2a033e8f969e22bf2d8\" },\n\n |description| { vec![] },\n\n |caps| { vec![] },\n\n |cached_tail| { vec![] },\n\n |inputs| { vec![] },\n\n |op| {\n\n Op::Source(SourceOp {\n","file_path":"buildkit-llb/src/ops/source/git.rs","rank":64,"score":31097.27849911052},{"content":" }\n\n}\n\n\n\nimpl<'a> SingleBorrowedOutput<'a> for HttpSource {\n\n fn output(&'a self) -> OperationOutput<'a> {\n\n OperationOutput::borrowed(self, OutputIdx(0))\n\n }\n\n}\n\n\n\nimpl<'a> SingleOwnedOutput<'static> for Arc<HttpSource> {\n\n fn output(&self) -> OperationOutput<'static> {\n\n OperationOutput::owned(self.clone(), OutputIdx(0))\n\n }\n\n}\n\n\n\nimpl OperationBuilder<'static> for HttpSource {\n\n fn custom_name<S>(mut self, name: S) -> Self\n\n where\n\n S: Into<String>,\n\n {\n","file_path":"buildkit-llb/src/ops/source/http.rs","rank":65,"score":31096.815633598428},{"content":" serde_json::to_string(&self.include).unwrap(),\n\n );\n\n }\n\n\n\n let head = pb::Op {\n\n op: Some(Op::Source(SourceOp {\n\n identifier: format!(\"local://{}\", self.name),\n\n attrs,\n\n })),\n\n\n\n ..Default::default()\n\n };\n\n\n\n let metadata = OpMetadata {\n\n description: self.description.clone(),\n\n ignore_cache: self.ignore_cache,\n\n\n\n ..Default::default()\n\n };\n\n\n\n Ok(Node::new(head, metadata))\n\n }\n\n}\n\n\n\n#[test]\n","file_path":"buildkit-llb/src/ops/source/local.rs","rank":66,"score":31096.696348673468},{"content":" self.ignore_cache = ignore;\n\n self\n\n }\n\n}\n\n\n\nimpl Operation for GitSource {\n\n fn id(&self) -> &OperationId {\n\n &self.id\n\n }\n\n\n\n fn serialize(&self, _: &mut Context) -> Result<Node> {\n\n let identifier = if let Some(ref reference) = self.reference {\n\n format!(\"git://{}#{}\", self.remote, reference)\n\n } else {\n\n format!(\"git://{}\", self.remote)\n\n };\n\n\n\n let head = pb::Op {\n\n op: Some(Op::Source(SourceOp {\n\n identifier,\n","file_path":"buildkit-llb/src/ops/source/git.rs","rank":67,"score":31096.440419290946},{"content":" identifier: \"git://any.url\".into(),\n\n attrs: Default::default(),\n\n })\n\n },\n\n );\n\n\n\n crate::check_op!(\n\n GitSource::new(\"git@any.url\"),\n\n |digest| { \"sha256:ecde982e19ace932e5474e57b0ca71ba690ed7d28abff2a033e8f969e22bf2d8\" },\n\n |description| { vec![] },\n\n |caps| { vec![] },\n\n |cached_tail| { vec![] },\n\n |inputs| { vec![] },\n\n |op| {\n\n Op::Source(SourceOp {\n\n identifier: \"git://any.url\".into(),\n\n attrs: Default::default(),\n\n })\n\n },\n\n );\n\n}\n\n\n","file_path":"buildkit-llb/src/ops/source/git.rs","rank":68,"score":31096.433639419873},{"content":" |caps| { vec![] },\n\n |cached_tail| { vec![] },\n\n |inputs| { vec![] },\n\n |op| {\n\n Op::Source(SourceOp {\n\n identifier: \"docker-image://docker.io/library/alpine:latest\".into(),\n\n attrs: Default::default(),\n\n })\n\n },\n\n );\n\n\n\n crate::check_op!(\n\n ImageSource::new(\"rustlang/rust:nightly\").custom_name(\"image custom name\"),\n\n |digest| { \"sha256:dee2a3d7dd482dd8098ba543ff1dcb01efd29fcd16fdb0979ef556f38564543a\" },\n\n |description| { vec![(\"llb.customname\", \"image custom name\")] },\n\n |caps| { vec![] },\n\n |cached_tail| { vec![] },\n\n |inputs| { vec![] },\n\n |op| {\n\n Op::Source(SourceOp {\n","file_path":"buildkit-llb/src/ops/source/image.rs","rank":69,"score":31096.099225557817},{"content":" |caps| { vec![] },\n\n |cached_tail| { vec![] },\n\n |inputs| { vec![] },\n\n |op| {\n\n Op::Source(SourceOp {\n\n identifier: \"local://context\".into(),\n\n attrs: Default::default(),\n\n })\n\n },\n\n );\n\n\n\n crate::check_op!(\n\n {\n\n LocalSource::new(\"context\")\n\n .custom_name(\"context custom name\")\n\n .add_exclude_pattern(\"**/target\")\n\n .add_exclude_pattern(\"Dockerfile\")\n\n },\n\n |digest| { \"sha256:f6962b8bb1659c63a2c2c3e2a7ccf0326c87530dd70c514343f127e4c20460c4\" },\n\n |description| { vec![(\"llb.customname\", \"context custom name\")] },\n","file_path":"buildkit-llb/src/ops/source/local.rs","rank":70,"score":31095.45173883769},{"content":" identifier: \"docker-image://docker.io/rustlang/rust:nightly\".into(),\n\n attrs: Default::default(),\n\n })\n\n },\n\n );\n\n\n\n crate::check_op!(\n\n ImageSource::new(\"rustlang/rust:nightly\").with_digest(\"sha256:123456\"),\n\n |digest| { \"sha256:a9837e26998d165e7b6433f8d40b36d259905295860fcbbc62bbce75a6c991c6\" },\n\n |description| { vec![] },\n\n |caps| { vec![] },\n\n |cached_tail| { vec![] },\n\n |inputs| { vec![] },\n\n |op| {\n\n Op::Source(SourceOp {\n\n identifier: \"docker-image://docker.io/rustlang/rust:nightly@sha256:123456\".into(),\n\n attrs: Default::default(),\n\n })\n\n },\n\n );\n\n}\n\n\n","file_path":"buildkit-llb/src/ops/source/image.rs","rank":71,"score":31095.21499200355},{"content":" resolve_mode: None,\n\n }\n\n }\n\n\n\n pub fn with_resolve_mode(mut self, mode: ResolveMode) -> Self {\n\n self.resolve_mode = Some(mode);\n\n self\n\n }\n\n\n\n pub fn resolve_mode(&self) -> Option<ResolveMode> {\n\n self.resolve_mode\n\n }\n\n\n\n pub fn with_digest<S>(mut self, digest: S) -> Self\n\n where\n\n S: Into<String>,\n\n {\n\n self.digest = Some(digest.into());\n\n self\n\n }\n","file_path":"buildkit-llb/src/ops/source/image.rs","rank":72,"score":31095.03755509101},{"content":" |caps| { vec![] },\n\n |cached_tail| { vec![] },\n\n |inputs| { vec![] },\n\n |op| {\n\n Op::Source(SourceOp {\n\n identifier: \"docker-image://docker.io/rustlang/rust:nightly\".into(),\n\n attrs: crate::utils::test::to_map(vec![(\"image.resolvemode\", \"pull\")]),\n\n })\n\n },\n\n );\n\n\n\n crate::check_op!(\n\n ImageSource::new(\"rustlang/rust:nightly\").with_resolve_mode(ResolveMode::PreferLocal),\n\n |digest| { \"sha256:bd6797c8644d2663b29c36a8b3b63931e539be44ede5e56aca2da4f35f241f18\" },\n\n |description| { vec![] },\n\n |caps| { vec![] },\n\n |cached_tail| { vec![] },\n\n |inputs| { vec![] },\n\n |op| {\n\n Op::Source(SourceOp {\n\n identifier: \"docker-image://docker.io/rustlang/rust:nightly\".into(),\n\n attrs: crate::utils::test::to_map(vec![(\"image.resolvemode\", \"local\")]),\n\n })\n\n },\n\n );\n\n}\n\n\n","file_path":"buildkit-llb/src/ops/source/image.rs","rank":73,"score":31094.995866699697},{"content":"\n\n pub fn with_tag<S>(mut self, tag: S) -> Self\n\n where\n\n S: Into<String>,\n\n {\n\n self.tag = Some(tag.into());\n\n self\n\n }\n\n\n\n pub fn canonical_name(&self) -> String {\n\n let domain = match self.domain {\n\n Some(ref domain) => domain,\n\n None => \"docker.io\",\n\n };\n\n\n\n let tag = match self.tag {\n\n Some(ref tag) => tag,\n\n None => \"latest\",\n\n };\n\n\n","file_path":"buildkit-llb/src/ops/source/image.rs","rank":74,"score":31094.670694195986},{"content":" if let Some(ref file_name) = self.file_name {\n\n attrs.insert(\"http.filename\".into(), file_name.into());\n\n }\n\n\n\n let head = pb::Op {\n\n op: Some(Op::Source(SourceOp {\n\n identifier: self.url.clone(),\n\n attrs,\n\n })),\n\n\n\n ..Default::default()\n\n };\n\n\n\n let metadata = OpMetadata {\n\n description: self.description.clone(),\n\n ignore_cache: self.ignore_cache,\n\n\n\n ..Default::default()\n\n };\n\n\n\n Ok(Node::new(head, metadata))\n\n }\n\n}\n\n\n\n#[test]\n","file_path":"buildkit-llb/src/ops/source/http.rs","rank":75,"score":31093.949422365033},{"content":" },\n\n |digest| { \"sha256:a7e628333262b810572f83193bbf8554e688abfb51d44ac30bdad7fa425f3839\" },\n\n |description| { vec![(\"llb.customname\", \"context custom name\")] },\n\n |caps| { vec![] },\n\n |cached_tail| { vec![] },\n\n |inputs| { vec![] },\n\n |op| {\n\n Op::Source(SourceOp {\n\n identifier: \"local://context\".into(),\n\n attrs: crate::utils::test::to_map(vec![(\n\n \"local.includepattern\",\n\n r#\"[\"Cargo.toml\",\"inner/Cargo.toml\"]\"#,\n\n )]),\n\n })\n\n },\n\n );\n\n}\n","file_path":"buildkit-llb/src/ops/source/local.rs","rank":76,"score":31093.4696182506},{"content":" |caps| { vec![] },\n\n |cached_tail| { vec![] },\n\n |inputs| { vec![] },\n\n |op| {\n\n Op::Source(SourceOp {\n\n identifier: \"local://context\".into(),\n\n attrs: crate::utils::test::to_map(vec![(\n\n \"local.excludepatterns\",\n\n r#\"[\"**/target\",\"Dockerfile\"]\"#,\n\n )]),\n\n })\n\n },\n\n );\n\n\n\n crate::check_op!(\n\n {\n\n LocalSource::new(\"context\")\n\n .custom_name(\"context custom name\")\n\n .add_include_pattern(\"Cargo.toml\")\n\n .add_include_pattern(\"inner/Cargo.toml\")\n","file_path":"buildkit-llb/src/ops/source/local.rs","rank":77,"score":31093.23980777434},{"content":" });\n\n\n\n crate::check_op!(ImageSource::new(\"127.0.0.1:5000/rust:obj\"), |op| {\n\n Op::Source(SourceOp {\n\n identifier: \"docker-image://127.0.0.1:5000/rust:obj\".into(),\n\n attrs: Default::default(),\n\n })\n\n });\n\n\n\n crate::check_op!(ImageSource::new(\"localhost:5000/rust\"), |op| {\n\n Op::Source(SourceOp {\n\n identifier: \"docker-image://localhost:5000/rust:latest\".into(),\n\n attrs: Default::default(),\n\n })\n\n });\n\n\n\n crate::check_op!(ImageSource::new(\"127.0.0.1:5000/rust\"), |op| {\n\n Op::Source(SourceOp {\n\n identifier: \"docker-image://127.0.0.1:5000/rust:latest\".into(),\n\n attrs: Default::default(),\n","file_path":"buildkit-llb/src/ops/source/image.rs","rank":78,"score":31092.924854663026},{"content":"\n\n crate::check_op!(ImageSource::new(\"localhost/rust:obj\"), |op| {\n\n Op::Source(SourceOp {\n\n identifier: \"docker-image://localhost/rust:obj\".into(),\n\n attrs: Default::default(),\n\n })\n\n });\n\n\n\n crate::check_op!(ImageSource::new(\"127.0.0.1/rust:obj\"), |op| {\n\n Op::Source(SourceOp {\n\n identifier: \"docker-image://127.0.0.1/rust:obj\".into(),\n\n attrs: Default::default(),\n\n })\n\n });\n\n\n\n crate::check_op!(ImageSource::new(\"localhost:5000/rust:obj\"), |op| {\n\n Op::Source(SourceOp {\n\n identifier: \"docker-image://localhost:5000/rust:obj\".into(),\n\n attrs: Default::default(),\n\n })\n","file_path":"buildkit-llb/src/ops/source/image.rs","rank":79,"score":31092.826840361584},{"content":" });\n\n\n\n crate::check_op!(ImageSource::new(\"library/rust\"), |op| {\n\n Op::Source(SourceOp {\n\n identifier: \"docker-image://docker.io/library/rust:latest\".into(),\n\n attrs: Default::default(),\n\n })\n\n });\n\n\n\n crate::check_op!(ImageSource::new(\"rust:obj@sha256:abcdef\"), |op| {\n\n Op::Source(SourceOp {\n\n identifier: \"docker-image://docker.io/library/rust:obj@sha256:abcdef\".into(),\n\n attrs: Default::default(),\n\n })\n\n });\n\n\n\n crate::check_op!(ImageSource::new(\"rust@sha256:abcdef\"), |op| {\n\n Op::Source(SourceOp {\n\n identifier: \"docker-image://docker.io/library/rust:latest@sha256:abcdef\".into(),\n\n attrs: Default::default(),\n","file_path":"buildkit-llb/src/ops/source/image.rs","rank":80,"score":31092.549419730243},{"content":" })\n\n });\n\n\n\n crate::check_op!(ImageSource::new(\"docker.io/rust\"), |op| {\n\n Op::Source(SourceOp {\n\n identifier: \"docker-image://docker.io/library/rust:latest\".into(),\n\n attrs: Default::default(),\n\n })\n\n });\n\n\n\n crate::check_op!(ImageSource::new(\"docker.io/library/rust\"), |op| {\n\n Op::Source(SourceOp {\n\n identifier: \"docker-image://docker.io/library/rust:latest\".into(),\n\n attrs: Default::default(),\n\n })\n\n });\n\n}\n","file_path":"buildkit-llb/src/ops/source/image.rs","rank":81,"score":31092.45806057572},{"content":" |caps| { vec![] },\n\n |cached_tail| { vec![] },\n\n |inputs| { vec![] },\n\n |op| {\n\n Op::Source(SourceOp {\n\n identifier: \"git://any.url\".into(),\n\n attrs: Default::default(),\n\n })\n\n },\n\n );\n\n}\n\n\n","file_path":"buildkit-llb/src/ops/source/git.rs","rank":82,"score":31092.227437001773},{"content":" match self.digest {\n\n Some(ref digest) => format!(\"{}/{}:{}@{}\", domain, self.name, tag, digest),\n\n None => format!(\"{}/{}:{}\", domain, self.name, tag),\n\n }\n\n }\n\n}\n\n\n\nimpl<'a> SingleBorrowedOutput<'a> for ImageSource {\n\n fn output(&'a self) -> OperationOutput<'a> {\n\n OperationOutput::borrowed(self, OutputIdx(0))\n\n }\n\n}\n\n\n\nimpl<'a> SingleOwnedOutput<'static> for Arc<ImageSource> {\n\n fn output(&self) -> OperationOutput<'static> {\n\n OperationOutput::owned(self.clone(), OutputIdx(0))\n\n }\n\n}\n\n\n\nimpl OperationBuilder<'static> for ImageSource {\n","file_path":"buildkit-llb/src/ops/source/image.rs","rank":83,"score":31092.224980181934},{"content":" })\n\n });\n\n\n\n crate::check_op!(ImageSource::new(\"rust:obj@abcdef\"), |op| {\n\n Op::Source(SourceOp {\n\n identifier: \"docker-image://docker.io/library/rust:obj@abcdef\".into(),\n\n attrs: Default::default(),\n\n })\n\n });\n\n\n\n crate::check_op!(\n\n ImageSource::new(\"b.gcr.io/test.example.com/my-app:test.example.com\"),\n\n |op| {\n\n Op::Source(SourceOp {\n\n identifier: \"docker-image://b.gcr.io/test.example.com/my-app:test.example.com\"\n\n .into(),\n\n attrs: Default::default(),\n\n })\n\n }\n\n );\n","file_path":"buildkit-llb/src/ops/source/image.rs","rank":84,"score":31092.151068695013},{"content":"\n\n crate::check_op!(\n\n ImageSource::new(\"sub-dom1.foo.com/bar/baz/quux:some-long-tag\"),\n\n |op| {\n\n Op::Source(SourceOp {\n\n identifier: \"docker-image://sub-dom1.foo.com/bar/baz/quux:some-long-tag\".into(),\n\n attrs: Default::default(),\n\n })\n\n }\n\n );\n\n\n\n crate::check_op!(\n\n ImageSource::new(\"sub-dom1.foo.com/quux:some-long-tag\"),\n\n |op| {\n\n Op::Source(SourceOp {\n\n identifier: \"docker-image://sub-dom1.foo.com/quux:some-long-tag\".into(),\n\n attrs: Default::default(),\n\n })\n\n }\n\n );\n","file_path":"buildkit-llb/src/ops/source/image.rs","rank":85,"score":31092.0084221641},{"content":" attrs: Default::default(),\n\n })),\n\n\n\n ..Default::default()\n\n };\n\n\n\n let metadata = OpMetadata {\n\n description: self.description.clone(),\n\n ignore_cache: self.ignore_cache,\n\n\n\n ..Default::default()\n\n };\n\n\n\n Ok(Node::new(head, metadata))\n\n }\n\n}\n\n\n\n#[test]\n","file_path":"buildkit-llb/src/ops/source/git.rs","rank":86,"score":31091.83323664578},{"content":" where\n\n S: Into<String>,\n\n {\n\n let mut raw_url = url.into();\n\n let remote = if raw_url.starts_with(\"http://\") {\n\n raw_url.split_off(7)\n\n } else if raw_url.starts_with(\"https://\") {\n\n raw_url.split_off(8)\n\n } else if raw_url.starts_with(\"git://\") {\n\n raw_url.split_off(6)\n\n } else if raw_url.starts_with(\"git@\") {\n\n raw_url.split_off(4)\n\n } else {\n\n raw_url\n\n };\n\n\n\n Self {\n\n id: OperationId::default(),\n\n remote,\n\n reference: None,\n","file_path":"buildkit-llb/src/ops/source/git.rs","rank":87,"score":31089.74235230637},{"content":" let mut name = name.into();\n\n\n\n let (digest, digest_separator) = match name.find('@') {\n\n Some(pos) => (Some(name[pos + 1..].into()), pos),\n\n None => (None, name.len()),\n\n };\n\n\n\n name.truncate(digest_separator);\n\n\n\n let (tag, tag_separator) = match TAG_EXPR.find(&name) {\n\n Some(found) => (Some(name[found.start() + 1..].into()), found.start()),\n\n None => (None, name.len()),\n\n };\n\n\n\n name.truncate(tag_separator);\n\n\n\n let (domain, mut name) = match name.find('/') {\n\n // The input has canonical-like format.\n\n Some(separator_pos) if &name[..separator_pos] == \"docker.io\" => {\n\n (None, name[separator_pos + 1..].into())\n","file_path":"buildkit-llb/src/ops/source/image.rs","rank":88,"score":31088.040542765462},{"content":" Some(_) => (None, name),\n\n\n\n // Fallback if only single url component present.\n\n None => (None, name),\n\n };\n\n\n\n if domain.is_none() && name.find('/').is_none() {\n\n name = format!(\"library/{}\", name);\n\n }\n\n\n\n Self {\n\n id: OperationId::default(),\n\n\n\n domain,\n\n name,\n\n tag,\n\n digest,\n\n\n\n description: Default::default(),\n\n ignore_cache: false,\n","file_path":"buildkit-llb/src/ops/source/image.rs","rank":89,"score":31087.794533887314},{"content":" }\n\n\n\n // Special case when domain is \"localhost\".\n\n Some(separator_pos) if &name[..separator_pos] == \"localhost\" => {\n\n (Some(\"localhost\".into()), name[separator_pos + 1..].into())\n\n }\n\n\n\n // General case for a common domain.\n\n Some(separator_pos) if name[..separator_pos].find('.').is_some() => (\n\n Some(name[..separator_pos].into()),\n\n name[separator_pos + 1..].into(),\n\n ),\n\n\n\n // General case for a domain with port number.\n\n Some(separator_pos) if name[..separator_pos].find(':').is_some() => (\n\n Some(name[..separator_pos].into()),\n\n name[separator_pos + 1..].into(),\n\n ),\n\n\n\n // Fallback if the first component is not a domain name.\n","file_path":"buildkit-llb/src/ops/source/image.rs","rank":90,"score":31085.245798638105},{"content":"}\n\n\n\nimpl<'a> MakeDirOperation<'a> {\n\n pub(crate) fn new<P>(output: OutputIdx, path: LayerPath<'a, P>) -> Self\n\n where\n\n P: AsRef<Path>,\n\n {\n\n let mut caps = HashMap::<String, bool>::new();\n\n caps.insert(\"file.base\".into(), true);\n\n\n\n MakeDirOperation {\n\n path: path.into_owned(),\n\n output,\n\n\n\n make_parents: false,\n\n\n\n caps,\n\n description: Default::default(),\n\n }\n\n }\n","file_path":"buildkit-llb/src/ops/fs/mkdir.rs","rank":92,"score":26.701251335082656},{"content":"}\n\n\n\nimpl<'a> MakeFileOperation<'a> {\n\n pub(crate) fn new<P>(output: OutputIdx, path: LayerPath<'a, P>) -> Self\n\n where\n\n P: AsRef<Path>,\n\n {\n\n let mut caps = HashMap::<String, bool>::new();\n\n caps.insert(\"file.base\".into(), true);\n\n\n\n MakeFileOperation {\n\n path: path.into_owned(),\n\n output,\n\n\n\n data: None,\n\n\n\n caps,\n\n description: Default::default(),\n\n }\n\n }\n","file_path":"buildkit-llb/src/ops/fs/mkfile.rs","rank":93,"score":26.70125133508266},{"content":"\n\nimpl<'a> SequenceOperation<'a> {\n\n pub(crate) fn new() -> Self {\n\n let mut caps = HashMap::<String, bool>::new();\n\n caps.insert(\"file.base\".into(), true);\n\n\n\n Self {\n\n id: OperationId::default(),\n\n inner: vec![],\n\n\n\n caps,\n\n description: Default::default(),\n\n ignore_cache: false,\n\n }\n\n }\n\n\n\n pub fn append<T>(mut self, op: T) -> Self\n\n where\n\n T: FileOperation + 'a,\n\n {\n","file_path":"buildkit-llb/src/ops/fs/sequence.rs","rank":95,"score":24.8920289559464},{"content":"use std::collections::HashMap;\n\nuse std::path::{Path, PathBuf};\n\n\n\nuse buildkit_proto::pb;\n\n\n\nuse super::path::LayerPath;\n\nuse super::FileOperation;\n\n\n\nuse crate::serialization::{Context, Result};\n\nuse crate::utils::OutputIdx;\n\n\n\n#[derive(Debug)]\n\npub struct MakeDirOperation<'a> {\n\n path: LayerPath<'a, PathBuf>,\n\n output: OutputIdx,\n\n\n\n make_parents: bool,\n\n\n\n description: HashMap<String, String>,\n\n caps: HashMap<String, bool>,\n","file_path":"buildkit-llb/src/ops/fs/mkdir.rs","rank":99,"score":20.426360818843786}],"string":"[\n {\n \"content\": \"pub fn from_env<T, I>(pairs: I) -> Result<T>\\n\\nwhere\\n\\n T: DeserializeOwned,\\n\\n I: IntoIterator<Item = (String, String)>,\\n\\n{\\n\\n let owned_pairs = pairs.into_iter().collect::<Vec<_>>();\\n\\n let pairs = {\\n\\n owned_pairs.iter().filter_map(|(name, value)| {\\n\\n if name.starts_with(\\\"BUILDKIT_FRONTEND_OPT_\\\") {\\n\\n Some(value)\\n\\n } else {\\n\\n None\\n\\n }\\n\\n })\\n\\n };\\n\\n\\n\\n let deserializer = EnvDeserializer {\\n\\n vals: pairs.map(|value| extract_name_and_value(&value)),\\n\\n };\\n\\n\\n\\n Ok(T::deserialize(deserializer)?)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"dockerfile-plus/src/options.rs\",\n \"rank\": 0,\n \"score\": 119353.22785735317\n },\n {\n \"content\": \"#[derive(Debug)]\\n\\nstruct EnvDeserializer<P> {\\n\\n vals: P,\\n\\n}\\n\\n\\n\",\n \"file_path\": \"dockerfile-plus/src/options.rs\",\n \"rank\": 1,\n \"score\": 103249.88702063338\n },\n {\n \"content\": \"pub trait FileOperation: Debug + Send + Sync {\\n\\n fn output(&self) -> i32;\\n\\n\\n\\n fn serialize_inputs(&self, cx: &mut Context) -> Result<Vec<pb::Input>>;\\n\\n fn serialize_action(&self, inputs_count: usize, inputs_offset: usize)\\n\\n -> Result<pb::FileAction>;\\n\\n}\\n\\n\\n\",\n \"file_path\": \"buildkit-llb/src/ops/fs/mod.rs\",\n \"rank\": 4,\n \"score\": 84330.13439009895\n },\n {\n \"content\": \"fn main() -> Result<(), Box<dyn std::error::Error>> {\\n\\n tonic_build::configure()\\n\\n .build_client(true)\\n\\n .build_server(true)\\n\\n .compile(DEFS, PATHS)?;\\n\\n\\n\\n Ok(())\\n\\n}\\n\",\n \"file_path\": \"buildkit-proto/build.rs\",\n \"rank\": 6,\n \"score\": 80684.48803103683\n },\n {\n \"content\": \"#[test]\\n\\nfn prefixes() {\\n\\n crate::check_op!(\\n\\n GitSource::new(\\\"http://any.url\\\"),\\n\\n |digest| { \\\"sha256:ecde982e19ace932e5474e57b0ca71ba690ed7d28abff2a033e8f969e22bf2d8\\\" },\\n\\n |description| { vec![] },\\n\\n |caps| { vec![] },\\n\\n |cached_tail| { vec![] },\\n\\n |inputs| { vec![] },\\n\\n |op| {\\n\\n Op::Source(SourceOp {\\n\\n identifier: \\\"git://any.url\\\".into(),\\n\\n attrs: Default::default(),\\n\\n })\\n\\n },\\n\\n );\\n\\n\\n\\n crate::check_op!(\\n\\n GitSource::new(\\\"https://any.url\\\"),\\n\\n |digest| { \\\"sha256:ecde982e19ace932e5474e57b0ca71ba690ed7d28abff2a033e8f969e22bf2d8\\\" },\\n\\n |description| { vec![] },\\n\",\n \"file_path\": \"buildkit-llb/src/ops/source/git.rs\",\n \"rank\": 7,\n \"score\": 80201.89027429\n },\n {\n \"content\": \"#[test]\\n\\nfn with_reference() {\\n\\n crate::check_op!(\\n\\n GitSource::new(\\\"any.url\\\").with_reference(\\\"abcdef\\\"),\\n\\n |digest| { \\\"sha256:f59aa7f8db62e0b5c2a1da396752ba8a2bb0b5d28ddcfdd1d4f822d26ebfe3cf\\\" },\\n\\n |description| { vec![] },\\n\\n |caps| { vec![] },\\n\\n |cached_tail| { vec![] },\\n\\n |inputs| { vec![] },\\n\\n |op| {\\n\\n Op::Source(SourceOp {\\n\\n identifier: \\\"git://any.url#abcdef\\\".into(),\\n\\n attrs: Default::default(),\\n\\n })\\n\\n },\\n\\n );\\n\\n}\\n\",\n \"file_path\": \"buildkit-llb/src/ops/source/git.rs\",\n \"rank\": 8,\n \"score\": 80201.89027429\n },\n {\n \"content\": \"#[test]\\n\\nfn serialization() {\\n\\n crate::check_op!(\\n\\n GitSource::new(\\\"any.url\\\"),\\n\\n |digest| { \\\"sha256:ecde982e19ace932e5474e57b0ca71ba690ed7d28abff2a033e8f969e22bf2d8\\\" },\\n\\n |description| { vec![] },\\n\\n |caps| { vec![] },\\n\\n |cached_tail| { vec![] },\\n\\n |inputs| { vec![] },\\n\\n |op| {\\n\\n Op::Source(SourceOp {\\n\\n identifier: \\\"git://any.url\\\".into(),\\n\\n attrs: Default::default(),\\n\\n })\\n\\n },\\n\\n );\\n\\n\\n\\n crate::check_op!(\\n\\n GitSource::new(\\\"any.url\\\").custom_name(\\\"git custom name\\\"),\\n\\n |digest| { \\\"sha256:ecde982e19ace932e5474e57b0ca71ba690ed7d28abff2a033e8f969e22bf2d8\\\" },\\n\\n |description| { vec![(\\\"llb.customname\\\", \\\"git custom name\\\")] },\\n\",\n \"file_path\": \"buildkit-llb/src/ops/source/git.rs\",\n \"rank\": 9,\n \"score\": 80201.89027429\n },\n {\n \"content\": \"#[test]\\n\\nfn serialization() {\\n\\n crate::check_op!(\\n\\n LocalSource::new(\\\"context\\\"),\\n\\n |digest| { \\\"sha256:a60212791641cbeaa3a49de4f7dff9e40ae50ec19d1be9607232037c1db16702\\\" },\\n\\n |description| { vec![] },\\n\\n |caps| { vec![] },\\n\\n |cached_tail| { vec![] },\\n\\n |inputs| { vec![] },\\n\\n |op| {\\n\\n Op::Source(SourceOp {\\n\\n identifier: \\\"local://context\\\".into(),\\n\\n attrs: Default::default(),\\n\\n })\\n\\n },\\n\\n );\\n\\n\\n\\n crate::check_op!(\\n\\n LocalSource::new(\\\"context\\\").custom_name(\\\"context custom name\\\"),\\n\\n |digest| { \\\"sha256:a60212791641cbeaa3a49de4f7dff9e40ae50ec19d1be9607232037c1db16702\\\" },\\n\\n |description| { vec![(\\\"llb.customname\\\", \\\"context custom name\\\")] },\\n\",\n \"file_path\": \"buildkit-llb/src/ops/source/local.rs\",\n \"rank\": 10,\n \"score\": 80201.89027429\n },\n {\n \"content\": \"#[test]\\n\\nfn serialization() {\\n\\n crate::check_op!(\\n\\n HttpSource::new(\\\"http://any.url/with/path\\\"),\\n\\n |digest| { \\\"sha256:22ec64461f39dd3b54680fc240b459248b1ced597f113b5d692abe9695860d12\\\" },\\n\\n |description| { vec![] },\\n\\n |caps| { vec![] },\\n\\n |cached_tail| { vec![] },\\n\\n |inputs| { vec![] },\\n\\n |op| {\\n\\n Op::Source(SourceOp {\\n\\n identifier: \\\"http://any.url/with/path\\\".into(),\\n\\n attrs: Default::default(),\\n\\n })\\n\\n },\\n\\n );\\n\\n\\n\\n crate::check_op!(\\n\\n HttpSource::new(\\\"http://any.url/with/path\\\").custom_name(\\\"git custom name\\\"),\\n\\n |digest| { \\\"sha256:22ec64461f39dd3b54680fc240b459248b1ced597f113b5d692abe9695860d12\\\" },\\n\\n |description| { vec![(\\\"llb.customname\\\", \\\"git custom name\\\")] },\\n\",\n \"file_path\": \"buildkit-llb/src/ops/source/http.rs\",\n \"rank\": 11,\n \"score\": 80201.89027429\n },\n {\n \"content\": \"#[test]\\n\\nfn serialization() {\\n\\n crate::check_op!(\\n\\n ImageSource::new(\\\"rustlang/rust:nightly\\\"),\\n\\n |digest| { \\\"sha256:dee2a3d7dd482dd8098ba543ff1dcb01efd29fcd16fdb0979ef556f38564543a\\\" },\\n\\n |description| { vec![] },\\n\\n |caps| { vec![] },\\n\\n |cached_tail| { vec![] },\\n\\n |inputs| { vec![] },\\n\\n |op| {\\n\\n Op::Source(SourceOp {\\n\\n identifier: \\\"docker-image://docker.io/rustlang/rust:nightly\\\".into(),\\n\\n attrs: Default::default(),\\n\\n })\\n\\n },\\n\\n );\\n\\n\\n\\n crate::check_op!(\\n\\n ImageSource::new(\\\"library/alpine:latest\\\"),\\n\\n |digest| { \\\"sha256:0e6b31ceed3e6dc542018f35a53a0e857e6a188453d32a2a5bbe7aa2971c1220\\\" },\\n\\n |description| { vec![] },\\n\",\n \"file_path\": \"buildkit-llb/src/ops/source/image.rs\",\n \"rank\": 12,\n \"score\": 80201.89027429\n },\n {\n \"content\": \"#[test]\\n\\nfn image_name() {\\n\\n crate::check_op!(ImageSource::new(\\\"rustlang/rust\\\"), |op| {\\n\\n Op::Source(SourceOp {\\n\\n identifier: \\\"docker-image://docker.io/rustlang/rust:latest\\\".into(),\\n\\n attrs: Default::default(),\\n\\n })\\n\\n });\\n\\n\\n\\n crate::check_op!(ImageSource::new(\\\"rust:nightly\\\"), |op| {\\n\\n Op::Source(SourceOp {\\n\\n identifier: \\\"docker-image://docker.io/library/rust:nightly\\\".into(),\\n\\n attrs: Default::default(),\\n\\n })\\n\\n });\\n\\n\\n\\n crate::check_op!(ImageSource::new(\\\"rust\\\"), |op| {\\n\\n Op::Source(SourceOp {\\n\\n identifier: \\\"docker-image://docker.io/library/rust:latest\\\".into(),\\n\\n attrs: Default::default(),\\n\\n })\\n\",\n \"file_path\": \"buildkit-llb/src/ops/source/image.rs\",\n \"rank\": 13,\n \"score\": 78500.34372088609\n },\n {\n \"content\": \"#[test]\\n\\nfn resolve_mode() {\\n\\n crate::check_op!(\\n\\n ImageSource::new(\\\"rustlang/rust:nightly\\\").with_resolve_mode(ResolveMode::Default),\\n\\n |digest| { \\\"sha256:792e246751e84b9a5e40c28900d70771a07e8cc920c1039cdddfc6bf69256dfe\\\" },\\n\\n |description| { vec![] },\\n\\n |caps| { vec![] },\\n\\n |cached_tail| { vec![] },\\n\\n |inputs| { vec![] },\\n\\n |op| {\\n\\n Op::Source(SourceOp {\\n\\n identifier: \\\"docker-image://docker.io/rustlang/rust:nightly\\\".into(),\\n\\n attrs: crate::utils::test::to_map(vec![(\\\"image.resolvemode\\\", \\\"default\\\")]),\\n\\n })\\n\\n },\\n\\n );\\n\\n\\n\\n crate::check_op!(\\n\\n ImageSource::new(\\\"rustlang/rust:nightly\\\").with_resolve_mode(ResolveMode::ForcePull),\\n\\n |digest| { \\\"sha256:0bd920010eab701bdce44c61d220e6943d56d3fb9a9fa4e773fc060c0d746122\\\" },\\n\\n |description| { vec![] },\\n\",\n \"file_path\": \"buildkit-llb/src/ops/source/image.rs\",\n \"rank\": 14,\n \"score\": 78500.34372088609\n },\n {\n \"content\": \"fn extract_name_and_value(mut raw_value: &str) -> (&str, EnvValue) {\\n\\n if raw_value.starts_with(\\\"build-arg:\\\") {\\n\\n raw_value = raw_value.trim_start_matches(\\\"build-arg:\\\");\\n\\n }\\n\\n\\n\\n let mut parts = raw_value.splitn(2, '=');\\n\\n let name = parts.next().unwrap();\\n\\n\\n\\n match parts.next() {\\n\\n None => (name, EnvValue::Flag),\\n\\n Some(text) if text.is_empty() => (name, EnvValue::Flag),\\n\\n Some(text) if &text[0..1] == \\\"[\\\" || &text[0..1] == \\\"{\\\" => (name, EnvValue::Json(text)),\\n\\n Some(text) => (name, EnvValue::Text(text)),\\n\\n }\\n\\n}\\n\\n\\n\\nimpl<'de> IntoDeserializer<'de, serde::de::value::Error> for EnvValue<'de> {\\n\\n type Deserializer = Self;\\n\\n\\n\\n fn into_deserializer(self) -> Self::Deserializer {\\n\",\n \"file_path\": \"dockerfile-plus/src/options.rs\",\n \"rank\": 15,\n \"score\": 77141.80320970429\n },\n {\n \"content\": \"fn build_init_commands(image: &ImageSource) -> Vec<OperationOutput> {\\n\\n (0..100)\\n\\n .map(|idx| {\\n\\n let base_dir = format!(\\\"/file/{}\\\", idx);\\n\\n let shell = format!(\\\"echo 'test {}' > /out{}/file.out\\\", idx, base_dir);\\n\\n\\n\\n let output_mount = FileSystem::mkdir(OutputIdx(0), LayerPath::Scratch(&base_dir))\\n\\n .make_parents(true)\\n\\n .into_operation()\\n\\n .ignore_cache(true)\\n\\n .ref_counted();\\n\\n\\n\\n Command::run(\\\"/bin/sh\\\")\\n\\n .args(&[\\\"-c\\\", &shell])\\n\\n .mount(Mount::ReadOnlyLayer(image.output(), \\\"/\\\"))\\n\\n .mount(Mount::Layer(OutputIdx(0), output_mount.output(0), \\\"/out\\\"))\\n\\n .ignore_cache(true)\\n\\n .ref_counted()\\n\\n .output(0)\\n\\n })\\n\\n .collect()\\n\\n}\\n\\n\\n\",\n \"file_path\": \"buildkit-llb/examples/highly-parallel.rs\",\n \"rank\": 16,\n \"score\": 63292.32039069585\n },\n {\n \"content\": \"#[derive(Debug, Deserialize)]\\n\\nstruct DockerfileOptions {\\n\\n filename: Option<PathBuf>,\\n\\n}\\n\\n\\n\\nconst INCLUDE_COMMAND: &str = \\\"INCLUDE+\\\";\\n\\n\\n\\nasync fn dockerfile_trap(\\n\\n mut client: LlbBridgeClient<Channel>,\\n\\n dockerfile_frontend: DockerfileFrontend,\\n\\n dockerfile_contents: String,\\n\\n) -> Result<ReturnRequest> {\\n\\n let mut result: Vec<String> = vec![];\\n\\n let context_source = Source::local(\\\"context\\\");\\n\\n let context_layer = solve(&mut client, Terminal::with(context_source.output())).await?;\\n\\n\\n\\n fn replace(\\n\\n l : & String,\\n\\n r : &mut Vec<String>,\\n\\n c : &mut LlbBridgeClient<Channel>,\\n\\n ctx : & String\\n\",\n \"file_path\": \"dockerfile-plus/src/main.rs\",\n \"rank\": 17,\n \"score\": 55076.55444373955\n },\n {\n \"content\": \"struct ProxyLlbServer {\\n\\n client: Arc<RwLock<LlbBridgeClient<Channel>>>,\\n\\n result_sender: Sender<frontend::ReturnRequest>,\\n\\n\\n\\n dockerfile_name: String,\\n\\n dockerfile_contents: Vec<u8>,\\n\\n}\\n\\n\\n\\nimpl ProxyLlbServer {\\n\\n fn new(\\n\\n client: LlbBridgeClient<Channel>,\\n\\n result_sender: Sender<frontend::ReturnRequest>,\\n\\n dockerfile_name: String,\\n\\n dockerfile_contents: Vec<u8>,\\n\\n ) -> Self {\\n\\n ProxyLlbServer {\\n\\n client: Arc::new(RwLock::new(client)),\\n\\n result_sender,\\n\\n dockerfile_name,\\n\\n dockerfile_contents,\\n\",\n \"file_path\": \"dockerfile-plus/src/dockerfile_frontend.rs\",\n \"rank\": 18,\n \"score\": 53264.10700414187\n },\n {\n \"content\": \"fn main() {\\n\\n let builder_image =\\n\\n Source::image(\\\"library/alpine:latest\\\").custom_name(\\\"Using alpine:latest as a builder\\\");\\n\\n\\n\\n let command = {\\n\\n Command::run(\\\"/bin/sh\\\")\\n\\n .args(&[\\\"-c\\\", \\\"echo 'test string 5' > /out/file0\\\"])\\n\\n .custom_name(\\\"create a dummy file\\\")\\n\\n .mount(Mount::ReadOnlyLayer(builder_image.output(), \\\"/\\\"))\\n\\n .mount(Mount::Scratch(OutputIdx(0), \\\"/out\\\"))\\n\\n };\\n\\n\\n\\n let fs = {\\n\\n FileSystem::sequence()\\n\\n .custom_name(\\\"do multiple file system manipulations\\\")\\n\\n .append(\\n\\n FileSystem::copy()\\n\\n .from(LayerPath::Other(command.output(0), \\\"/file0\\\"))\\n\\n .to(OutputIdx(0), LayerPath::Other(command.output(0), \\\"/file1\\\")),\\n\\n )\\n\",\n \"file_path\": \"buildkit-llb/examples/scratch.rs\",\n \"rank\": 19,\n \"score\": 51885.602638147\n },\n {\n \"content\": \"fn main() {\\n\\n let bitflags_archive = Source::http(\\\"https://crates.io/api/v1/crates/bitflags/1.0.4/download\\\")\\n\\n .with_file_name(\\\"bitflags.tar\\\");\\n\\n\\n\\n let alpine = Source::image(\\\"library/alpine:latest\\\");\\n\\n let bitflags_unpacked = {\\n\\n Command::run(\\\"/bin/tar\\\")\\n\\n .args(&[\\n\\n \\\"-xvzC\\\",\\n\\n \\\"/out\\\",\\n\\n \\\"--strip-components=1\\\",\\n\\n \\\"-f\\\",\\n\\n \\\"/in/bitflags.tar\\\",\\n\\n ])\\n\\n .mount(Mount::ReadOnlyLayer(alpine.output(), \\\"/\\\"))\\n\\n .mount(Mount::ReadOnlyLayer(bitflags_archive.output(), \\\"/in\\\"))\\n\\n .mount(Mount::Scratch(OutputIdx(0), \\\"/out\\\"))\\n\\n };\\n\\n\\n\\n let env_logger_repo = Source::git(\\\"https://github.com/sebasmagri/env_logger.git\\\")\\n\",\n \"file_path\": \"buildkit-llb/examples/network.rs\",\n \"rank\": 20,\n \"score\": 51885.602638147\n },\n {\n \"content\": \"fn main() {\\n\\n let image = Source::image(\\\"library/alpine:latest\\\");\\n\\n let commands = build_init_commands(&image);\\n\\n let commands = build_modify_commands(&image, commands);\\n\\n\\n\\n let base_fs = FileSystem::sequence()\\n\\n .custom_name(\\\"assemble outputs\\\")\\n\\n .append(FileSystem::mkdir(\\n\\n OutputIdx(0),\\n\\n LayerPath::Scratch(\\\"/files\\\"),\\n\\n ));\\n\\n\\n\\n let (final_fs, final_output) =\\n\\n commands\\n\\n .into_iter()\\n\\n .zip(0..)\\n\\n .fold((base_fs, 0), |(fs, last_output), (output, idx)| {\\n\\n let layer = fs.append(\\n\\n FileSystem::copy()\\n\\n .from(LayerPath::Other(output, format!(\\\"/file-{}.out\\\", idx)))\\n\",\n \"file_path\": \"buildkit-llb/examples/highly-parallel.rs\",\n \"rank\": 21,\n \"score\": 50918.51692782246\n },\n {\n \"content\": \"#[test]\\n\\nfn serialization() {\\n\\n use crate::prelude::*;\\n\\n\\n\\n let context = Source::local(\\\"context\\\");\\n\\n let builder_image = Source::image(\\\"rustlang/rust:nightly\\\");\\n\\n let final_image = Source::image(\\\"library/alpine:latest\\\");\\n\\n\\n\\n let first_command = Command::run(\\\"rustc\\\")\\n\\n .args(&[\\\"--crate-name\\\", \\\"crate-1\\\"])\\n\\n .mount(Mount::ReadOnlyLayer(builder_image.output(), \\\"/\\\"))\\n\\n .mount(Mount::ReadOnlyLayer(context.output(), \\\"/context\\\"))\\n\\n .mount(Mount::Scratch(OutputIdx(0), \\\"/target\\\"));\\n\\n\\n\\n let second_command = Command::run(\\\"rustc\\\")\\n\\n .args(&[\\\"--crate-name\\\", \\\"crate-2\\\"])\\n\\n .mount(Mount::ReadOnlyLayer(builder_image.output(), \\\"/\\\"))\\n\\n .mount(Mount::ReadOnlyLayer(context.output(), \\\"/context\\\"))\\n\\n .mount(Mount::Scratch(OutputIdx(0), \\\"/target\\\"));\\n\\n\\n\\n let assembly_op = FileSystem::sequence()\\n\",\n \"file_path\": \"buildkit-llb/src/ops/terminal.rs\",\n \"rank\": 22,\n \"score\": 50918.51692782246\n },\n {\n \"content\": \"fn main() {\\n\\n Terminal::with(build_graph())\\n\\n .write_definition(stdout())\\n\\n .unwrap()\\n\\n}\\n\\n\\n\",\n \"file_path\": \"buildkit-llb/examples/scratch-owned.rs\",\n \"rank\": 23,\n \"score\": 50918.51692782246\n },\n {\n \"content\": \"#[test]\\n\\nfn serialization() {\\n\\n use crate::prelude::*;\\n\\n use buildkit_proto::pb::{op::Op, ExecOp, Meta, NetMode, SecurityMode};\\n\\n\\n\\n crate::check_op!(\\n\\n {\\n\\n Command::run(\\\"/bin/sh\\\")\\n\\n .args(&[\\\"-c\\\", \\\"echo 'test string' > /out/file0\\\"])\\n\\n .env(\\\"HOME\\\", \\\"/root\\\")\\n\\n .custom_name(\\\"exec custom name\\\")\\n\\n },\\n\\n |digest| { \\\"sha256:dc9a5a3cd84bb1c7b633f1750fdfccd9d0a69d060f8e3babb297bc190e2d7484\\\" },\\n\\n |description| { vec![(\\\"llb.customname\\\", \\\"exec custom name\\\")] },\\n\\n |caps| { vec![] },\\n\\n |cached_tail| { vec![] },\\n\\n |inputs| { vec![] },\\n\\n |op| {\\n\\n Op::Exec(ExecOp {\\n\\n mounts: vec![],\\n\\n network: NetMode::Unset.into(),\\n\",\n \"file_path\": \"buildkit-llb/src/ops/exec/mod.rs\",\n \"rank\": 24,\n \"score\": 50006.81925011307\n },\n {\n \"content\": \"#[test]\\n\\nfn copy_serialization() {\\n\\n use crate::prelude::*;\\n\\n use buildkit_proto::pb::{file_action::Action, op::Op, FileAction, FileActionCopy, FileOp};\\n\\n\\n\\n let context = Source::local(\\\"context\\\");\\n\\n let builder_image = Source::image(\\\"rustlang/rust:nightly\\\");\\n\\n\\n\\n let operation = FileSystem::sequence()\\n\\n .append(\\n\\n FileSystem::copy()\\n\\n .from(LayerPath::Other(context.output(), \\\"Cargo.toml\\\"))\\n\\n .to(OutputIdx(0), LayerPath::Scratch(\\\"Cargo.toml\\\")),\\n\\n )\\n\\n .append(\\n\\n FileSystem::copy()\\n\\n .from(LayerPath::Other(builder_image.output(), \\\"/bin/sh\\\"))\\n\\n .to(OutputIdx(1), LayerPath::Own(OwnOutputIdx(0), \\\"/bin/sh\\\")),\\n\\n )\\n\\n .append(\\n\\n FileSystem::copy()\\n\",\n \"file_path\": \"buildkit-llb/src/ops/fs/mod.rs\",\n \"rank\": 25,\n \"score\": 49145.8837053224\n },\n {\n \"content\": \"#[test]\\n\\nfn mkfile_serialization() {\\n\\n use crate::prelude::*;\\n\\n use buildkit_proto::pb::{file_action::Action, op::Op, FileAction, FileActionMkFile, FileOp};\\n\\n\\n\\n let context = Source::local(\\\"context\\\");\\n\\n\\n\\n let operation = FileSystem::sequence()\\n\\n .append(\\n\\n FileSystem::mkfile(\\n\\n OutputIdx(0),\\n\\n LayerPath::Other(context.output(), \\\"/build-plan.json\\\"),\\n\\n )\\n\\n .data(b\\\"any bytes\\\".to_vec()),\\n\\n )\\n\\n .append(FileSystem::mkfile(\\n\\n OutputIdx(1),\\n\\n LayerPath::Scratch(\\\"/build-graph.json\\\"),\\n\\n ))\\n\\n .append(FileSystem::mkfile(\\n\\n OutputIdx(2),\\n\",\n \"file_path\": \"buildkit-llb/src/ops/fs/mod.rs\",\n \"rank\": 26,\n \"score\": 49145.8837053224\n },\n {\n \"content\": \"#[test]\\n\\nfn serialization_with_user() {\\n\\n use crate::prelude::*;\\n\\n use buildkit_proto::pb::{op::Op, ExecOp, Meta, NetMode, SecurityMode};\\n\\n\\n\\n crate::check_op!(\\n\\n Command::run(\\\"cargo\\\").args(&[\\\"build\\\"]).user(\\\"builder\\\"),\\n\\n |digest| { \\\"sha256:7631ea645e2126e9dbc5d9ae789e34301d9d5c80ce89bfa72bc9b82aa43b57c0\\\" },\\n\\n |description| { vec![] },\\n\\n |caps| { vec![] },\\n\\n |cached_tail| { vec![] },\\n\\n |inputs| { vec![] },\\n\\n |op| {\\n\\n Op::Exec(ExecOp {\\n\\n mounts: vec![],\\n\\n network: NetMode::Unset.into(),\\n\\n security: SecurityMode::Sandbox.into(),\\n\\n meta: Some(Meta {\\n\\n args: crate::utils::test::to_vec(vec![\\\"cargo\\\", \\\"build\\\"]),\\n\\n env: vec![],\\n\\n cwd: \\\"/\\\".into(),\\n\\n user: \\\"builder\\\".into(),\\n\\n\\n\\n extra_hosts: vec![],\\n\\n proxy_env: None,\\n\\n }),\\n\\n })\\n\\n },\\n\\n );\\n\\n}\\n\\n\\n\",\n \"file_path\": \"buildkit-llb/src/ops/exec/mod.rs\",\n \"rank\": 27,\n \"score\": 49145.8837053224\n },\n {\n \"content\": \"#[test]\\n\\nfn mkdir_serialization() {\\n\\n use crate::prelude::*;\\n\\n use buildkit_proto::pb::{file_action::Action, op::Op, FileAction, FileActionMkDir, FileOp};\\n\\n\\n\\n let context = Source::local(\\\"context\\\");\\n\\n\\n\\n let operation = FileSystem::sequence()\\n\\n .append(\\n\\n FileSystem::mkdir(\\n\\n OutputIdx(0),\\n\\n LayerPath::Other(context.output(), \\\"/new-crate\\\"),\\n\\n )\\n\\n .make_parents(true),\\n\\n )\\n\\n .append(FileSystem::mkdir(\\n\\n OutputIdx(1),\\n\\n LayerPath::Scratch(\\\"/new-crate\\\"),\\n\\n ))\\n\\n .append(FileSystem::mkdir(\\n\\n OutputIdx(2),\\n\",\n \"file_path\": \"buildkit-llb/src/ops/fs/mod.rs\",\n \"rank\": 28,\n \"score\": 49145.8837053224\n },\n {\n \"content\": \"#[test]\\n\\nfn serialization_with_cwd() {\\n\\n use crate::prelude::*;\\n\\n use buildkit_proto::pb::{op::Op, ExecOp, Meta, NetMode, SecurityMode};\\n\\n\\n\\n crate::check_op!(\\n\\n Command::run(\\\"cargo\\\").args(&[\\\"build\\\"]).cwd(\\\"/rust-src\\\"),\\n\\n |digest| { \\\"sha256:b8120a0e1d1f7fcaa3d6c95db292d064524dc92c6cae8b97672d4e1eafcd03fa\\\" },\\n\\n |description| { vec![] },\\n\\n |caps| { vec![] },\\n\\n |cached_tail| { vec![] },\\n\\n |inputs| { vec![] },\\n\\n |op| {\\n\\n Op::Exec(ExecOp {\\n\\n mounts: vec![],\\n\\n network: NetMode::Unset.into(),\\n\\n security: SecurityMode::Sandbox.into(),\\n\\n meta: Some(Meta {\\n\\n args: crate::utils::test::to_vec(vec![\\\"cargo\\\", \\\"build\\\"]),\\n\\n env: vec![],\\n\\n cwd: \\\"/rust-src\\\".into(),\\n\\n user: \\\"root\\\".into(),\\n\\n\\n\\n extra_hosts: vec![],\\n\\n proxy_env: None,\\n\\n }),\\n\\n })\\n\\n },\\n\\n );\\n\\n}\\n\\n\\n\",\n \"file_path\": \"buildkit-llb/src/ops/exec/mod.rs\",\n \"rank\": 29,\n \"score\": 49145.8837053224\n },\n {\n \"content\": \"#[test]\\n\\nfn serialization_with_mounts() {\\n\\n use crate::prelude::*;\\n\\n use buildkit_proto::pb::{\\n\\n op::Op, CacheOpt, CacheSharingOpt, ExecOp, Meta, MountType, NetMode, SecurityMode,\\n\\n };\\n\\n\\n\\n let context = Source::local(\\\"context\\\");\\n\\n let builder_image = Source::image(\\\"rustlang/rust:nightly\\\");\\n\\n let final_image = Source::image(\\\"library/alpine:latest\\\");\\n\\n\\n\\n let command = Command::run(\\\"cargo\\\")\\n\\n .args(&[\\\"build\\\"])\\n\\n .mount(Mount::ReadOnlyLayer(builder_image.output(), \\\"/\\\"))\\n\\n .mount(Mount::Scratch(OutputIdx(1), \\\"/tmp\\\"))\\n\\n .mount(Mount::ReadOnlySelector(\\n\\n context.output(),\\n\\n \\\"/buildkit-frontend\\\",\\n\\n \\\"/frontend-sources\\\",\\n\\n ))\\n\\n .mount(Mount::Layer(OutputIdx(0), final_image.output(), \\\"/output\\\"))\\n\",\n \"file_path\": \"buildkit-llb/src/ops/exec/mod.rs\",\n \"rank\": 30,\n \"score\": 49145.8837053224\n },\n {\n \"content\": \"#[test]\\n\\nfn serialization_with_ssh_mounts() {\\n\\n use crate::prelude::*;\\n\\n use buildkit_proto::pb::{op::Op, ExecOp, Meta, MountType, NetMode, SecurityMode, SshOpt};\\n\\n\\n\\n let builder_image = Source::image(\\\"rustlang/rust:nightly\\\");\\n\\n let command = Command::run(\\\"cargo\\\")\\n\\n .args(&[\\\"build\\\"])\\n\\n .mount(Mount::ReadOnlyLayer(builder_image.output(), \\\"/\\\"))\\n\\n .mount(Mount::OptionalSshAgent(\\\"/run/buildkit/ssh_agent.0\\\"));\\n\\n\\n\\n crate::check_op!(\\n\\n command,\\n\\n |digest| { \\\"sha256:1ac1438c67a153878f21fe8067383fd7544901261374eb53ba8bf26e9a5821a5\\\" },\\n\\n |description| { vec![] },\\n\\n |caps| { vec![\\\"exec.mount.bind\\\", \\\"exec.mount.ssh\\\"] },\\n\\n |cached_tail| {\\n\\n vec![\\\"sha256:dee2a3d7dd482dd8098ba543ff1dcb01efd29fcd16fdb0979ef556f38564543a\\\"]\\n\\n },\\n\\n |inputs| {\\n\\n vec![(\\n\",\n \"file_path\": \"buildkit-llb/src/ops/exec/mod.rs\",\n \"rank\": 31,\n \"score\": 48331.58556942726\n },\n {\n \"content\": \"#[test]\\n\\nfn serialization_with_env_iter() {\\n\\n use crate::prelude::*;\\n\\n use buildkit_proto::pb::{op::Op, ExecOp, Meta, NetMode, SecurityMode};\\n\\n\\n\\n crate::check_op!(\\n\\n {\\n\\n Command::run(\\\"cargo\\\").args(&[\\\"build\\\"]).env_iter(vec![\\n\\n (\\\"HOME\\\", \\\"/root\\\"),\\n\\n (\\\"PATH\\\", \\\"/bin\\\"),\\n\\n (\\\"CARGO_HOME\\\", \\\"/root/.cargo\\\"),\\n\\n ])\\n\\n },\\n\\n |digest| { \\\"sha256:7675be0b02acb379d57bafee5dc749fca7e795fb1e0a92748ccc59a7bc3b491e\\\" },\\n\\n |description| { vec![] },\\n\\n |caps| { vec![] },\\n\\n |cached_tail| { vec![] },\\n\\n |inputs| { vec![] },\\n\\n |op| {\\n\\n Op::Exec(ExecOp {\\n\\n mounts: vec![],\\n\",\n \"file_path\": \"buildkit-llb/src/ops/exec/mod.rs\",\n \"rank\": 32,\n \"score\": 48331.58556942726\n },\n {\n \"content\": \"#[test]\\n\\nfn copy_with_params_serialization() {\\n\\n use crate::prelude::*;\\n\\n use buildkit_proto::pb::{file_action::Action, op::Op, FileAction, FileActionCopy, FileOp};\\n\\n\\n\\n let context = Source::local(\\\"context\\\");\\n\\n\\n\\n let operation = FileSystem::sequence()\\n\\n .append(\\n\\n FileSystem::copy()\\n\\n .from(LayerPath::Other(context.output(), \\\"Cargo.toml\\\"))\\n\\n .to(OutputIdx(0), LayerPath::Scratch(\\\"Cargo.toml\\\"))\\n\\n .follow_symlinks(true),\\n\\n )\\n\\n .append(\\n\\n FileSystem::copy()\\n\\n .from(LayerPath::Other(context.output(), \\\"Cargo.toml\\\"))\\n\\n .to(OutputIdx(1), LayerPath::Scratch(\\\"Cargo.toml\\\"))\\n\\n .recursive(true),\\n\\n )\\n\\n .append(\\n\",\n \"file_path\": \"buildkit-llb/src/ops/fs/mod.rs\",\n \"rank\": 33,\n \"score\": 48331.58556942726\n },\n {\n \"content\": \"/// Common operation methods.\\n\\npub trait OperationBuilder<'a> {\\n\\n /// Sets an operation display name.\\n\\n fn custom_name<S>(self, name: S) -> Self\\n\\n where\\n\\n S: Into<String>;\\n\\n\\n\\n /// Sets caching behavior.\\n\\n fn ignore_cache(self, ignore: bool) -> Self;\\n\\n\\n\\n /// Convert the operation into `Arc` so it can be shared when efficient borrowing is not possible.\\n\\n fn ref_counted(self) -> Arc<Self>\\n\\n where\\n\\n Self: Sized + 'a,\\n\\n {\\n\\n Arc::new(self)\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"buildkit-llb/src/ops/mod.rs\",\n \"rank\": 34,\n \"score\": 47920.413221495895\n },\n {\n \"content\": \"#[test]\\n\\nfn serialization_with_several_root_mounts() {\\n\\n use crate::prelude::*;\\n\\n use buildkit_proto::pb::{op::Op, ExecOp, Meta, MountType, NetMode, SecurityMode};\\n\\n\\n\\n let builder_image = Source::image(\\\"rustlang/rust:nightly\\\");\\n\\n let final_image = Source::image(\\\"library/alpine:latest\\\");\\n\\n\\n\\n let command = Command::run(\\\"cargo\\\")\\n\\n .args(&[\\\"build\\\"])\\n\\n .mount(Mount::Scratch(OutputIdx(0), \\\"/tmp\\\"))\\n\\n .mount(Mount::ReadOnlyLayer(builder_image.output(), \\\"/\\\"))\\n\\n .mount(Mount::Scratch(OutputIdx(1), \\\"/var\\\"))\\n\\n .mount(Mount::ReadOnlyLayer(final_image.output(), \\\"/\\\"));\\n\\n\\n\\n crate::check_op!(\\n\\n command,\\n\\n |digest| { \\\"sha256:baa1bf591d2c47058b7361a0284fa8a3f1bd0fac8a93c87affa77ddc0a5026fd\\\" },\\n\\n |description| { vec![] },\\n\\n |caps| { vec![\\\"exec.mount.bind\\\"] },\\n\\n |cached_tail| {\\n\",\n \"file_path\": \"buildkit-llb/src/ops/exec/mod.rs\",\n \"rank\": 35,\n \"score\": 47560.23521145835\n },\n {\n \"content\": \"pub trait MultiBorrowedOutput<'a> {\\n\\n fn output(&'a self, number: u32) -> OperationOutput<'a>;\\n\\n}\\n\\n\\n\",\n \"file_path\": \"buildkit-llb/src/ops/mod.rs\",\n \"rank\": 36,\n \"score\": 47092.67836283872\n },\n {\n \"content\": \"pub trait MultiOwnedOutput<'a> {\\n\\n fn output(&self, number: u32) -> OperationOutput<'a>;\\n\\n}\\n\\n\\n\",\n \"file_path\": \"buildkit-llb/src/ops/mod.rs\",\n \"rank\": 37,\n \"score\": 47092.67836283872\n },\n {\n \"content\": \"pub trait SingleOwnedOutput<'a> {\\n\\n fn output(&self) -> OperationOutput<'a>;\\n\\n}\\n\\n\\n\",\n \"file_path\": \"buildkit-llb/src/ops/mod.rs\",\n \"rank\": 38,\n \"score\": 47092.67836283872\n },\n {\n \"content\": \"pub trait SingleBorrowedOutput<'a> {\\n\\n fn output(&'a self) -> OperationOutput<'a>;\\n\\n}\\n\\n\\n\",\n \"file_path\": \"buildkit-llb/src/ops/mod.rs\",\n \"rank\": 39,\n \"score\": 47092.67836283872\n },\n {\n \"content\": \"fn build_modify_commands<'a>(\\n\\n image: &'a ImageSource,\\n\\n layers: Vec<OperationOutput<'a>>,\\n\\n) -> Vec<OperationOutput<'a>> {\\n\\n layers\\n\\n .into_iter()\\n\\n .zip(0..)\\n\\n .map(|(output, idx)| {\\n\\n let shell = format!(\\n\\n \\\"sed s/test/modified/ < /in/file/{}/file.in > /out/file-{}.out\\\",\\n\\n idx, idx\\n\\n );\\n\\n\\n\\n Command::run(\\\"/bin/sh\\\")\\n\\n .args(&[\\\"-c\\\", &shell])\\n\\n .mount(Mount::ReadOnlyLayer(image.output(), \\\"/\\\"))\\n\\n .mount(Mount::Scratch(OutputIdx(0), \\\"/out\\\"))\\n\\n .mount(Mount::ReadOnlySelector(\\n\\n output,\\n\\n format!(\\\"/in/file/{}/file.in\\\", idx),\\n\\n format!(\\\"file/{}/file.out\\\", idx),\\n\\n ))\\n\\n .ignore_cache(true)\\n\\n .ref_counted()\\n\\n .output(0)\\n\\n })\\n\\n .collect()\\n\\n}\\n\",\n \"file_path\": \"buildkit-llb/examples/highly-parallel.rs\",\n \"rank\": 40,\n \"score\": 46870.47977400101\n },\n {\n \"content\": \"pub trait MultiOwnedLastOutput<'a> {\\n\\n fn last_output(&self) -> Option<OperationOutput<'a>>;\\n\\n}\\n\\n\\n\",\n \"file_path\": \"buildkit-llb/src/ops/mod.rs\",\n \"rank\": 41,\n \"score\": 46308.599962822846\n },\n {\n \"content\": \"pub trait MultiBorrowedLastOutput<'a> {\\n\\n fn last_output(&'a self) -> Option<OperationOutput<'a>>;\\n\\n}\\n\\n\\n\",\n \"file_path\": \"buildkit-llb/src/ops/mod.rs\",\n \"rank\": 42,\n \"score\": 46308.599962822846\n },\n {\n \"content\": \"#[derive(Debug)]\\n\\nstruct EnvItem<'de>(&'de str);\\n\\n\\n\",\n \"file_path\": \"dockerfile-plus/src/options.rs\",\n \"rank\": 43,\n \"score\": 45911.94391352548\n },\n {\n \"content\": \"fn build_graph() -> OperationOutput<'static> {\\n\\n let builder_image = Source::image(\\\"library/alpine:latest\\\")\\n\\n .custom_name(\\\"Using alpine:latest as a builder\\\")\\n\\n .ref_counted();\\n\\n\\n\\n let command = {\\n\\n Command::run(\\\"/bin/sh\\\")\\n\\n .args(&[\\\"-c\\\", \\\"echo 'test string 5' > /out/file0\\\"])\\n\\n .custom_name(\\\"create a dummy file\\\")\\n\\n .mount(Mount::ReadOnlyLayer(builder_image.output(), \\\"/\\\"))\\n\\n .mount(Mount::Scratch(OutputIdx(0), \\\"/out\\\"))\\n\\n .ref_counted()\\n\\n };\\n\\n\\n\\n let fs = {\\n\\n FileSystem::sequence()\\n\\n .custom_name(\\\"do multiple file system manipulations\\\")\\n\\n .append(\\n\\n FileSystem::copy()\\n\\n .from(LayerPath::Other(command.output(0), \\\"/file0\\\"))\\n\",\n \"file_path\": \"buildkit-llb/examples/scratch-owned.rs\",\n \"rank\": 44,\n \"score\": 43494.27465520869\n },\n {\n \"content\": \"use std::collections::HashMap;\\n\\nuse std::sync::Arc;\\n\\n\\n\\nuse buildkit_proto::pb::{self, op::Op, OpMetadata, SourceOp};\\n\\n\\n\\nuse crate::ops::{OperationBuilder, SingleBorrowedOutput, SingleOwnedOutput};\\n\\nuse crate::serialization::{Context, Node, Operation, OperationId, Result};\\n\\nuse crate::utils::{OperationOutput, OutputIdx};\\n\\n\\n\\n#[derive(Default, Debug)]\\n\\npub struct GitSource {\\n\\n id: OperationId,\\n\\n remote: String,\\n\\n reference: Option<String>,\\n\\n description: HashMap<String, String>,\\n\\n ignore_cache: bool,\\n\\n}\\n\\n\\n\\nimpl GitSource {\\n\\n pub(crate) fn new<S>(url: S) -> Self\\n\",\n \"file_path\": \"buildkit-llb/src/ops/source/git.rs\",\n \"rank\": 45,\n \"score\": 31108.52729114938\n },\n {\n \"content\": \"use std::collections::HashMap;\\n\\nuse std::sync::Arc;\\n\\n\\n\\nuse buildkit_proto::pb::{self, op::Op, OpMetadata, SourceOp};\\n\\n\\n\\nuse crate::ops::{OperationBuilder, SingleBorrowedOutput, SingleOwnedOutput};\\n\\nuse crate::serialization::{Context, Node, Operation, OperationId, Result};\\n\\nuse crate::utils::{OperationOutput, OutputIdx};\\n\\n\\n\\n#[derive(Default, Debug)]\\n\\npub struct HttpSource {\\n\\n id: OperationId,\\n\\n url: String,\\n\\n file_name: Option<String>,\\n\\n description: HashMap<String, String>,\\n\\n ignore_cache: bool,\\n\\n}\\n\\n\\n\\nimpl HttpSource {\\n\\n pub(crate) fn new<S>(url: S) -> Self\\n\",\n \"file_path\": \"buildkit-llb/src/ops/source/http.rs\",\n \"rank\": 46,\n \"score\": 31108.40075673507\n },\n {\n \"content\": \"mod git;\\n\\nmod http;\\n\\nmod image;\\n\\nmod local;\\n\\n\\n\\npub use self::git::GitSource;\\n\\npub use self::http::HttpSource;\\n\\npub use self::image::{ImageSource, ResolveMode};\\n\\npub use self::local::LocalSource;\\n\\n\\n\\n/// Provide an input for other operations. For example: `FROM` directive in Dockerfile.\\n\\n#[derive(Debug)]\\n\\npub struct Source;\\n\\n\\n\\nimpl Source {\\n\\n pub fn image<S>(name: S) -> ImageSource\\n\\n where\\n\\n S: Into<String>,\\n\\n {\\n\\n ImageSource::new(name)\\n\",\n \"file_path\": \"buildkit-llb/src/ops/source/mod.rs\",\n \"rank\": 47,\n \"score\": 31105.747022982516\n },\n {\n \"content\": \"use std::collections::HashMap;\\n\\nuse std::sync::Arc;\\n\\n\\n\\nuse buildkit_proto::pb::{self, op::Op, OpMetadata, SourceOp};\\n\\n\\n\\nuse crate::ops::{OperationBuilder, SingleBorrowedOutput, SingleOwnedOutput};\\n\\nuse crate::serialization::{Context, Node, Operation, OperationId, Result};\\n\\nuse crate::utils::{OperationOutput, OutputIdx};\\n\\n\\n\\n#[derive(Default, Debug)]\\n\\npub struct LocalSource {\\n\\n id: OperationId,\\n\\n name: String,\\n\\n description: HashMap<String, String>,\\n\\n ignore_cache: bool,\\n\\n\\n\\n exclude: Vec<String>,\\n\\n include: Vec<String>,\\n\\n}\\n\\n\\n\",\n \"file_path\": \"buildkit-llb/src/ops/source/local.rs\",\n \"rank\": 48,\n \"score\": 31104.733996424904\n },\n {\n \"content\": \"\\n\\n description: HashMap<String, String>,\\n\\n ignore_cache: bool,\\n\\n resolve_mode: Option<ResolveMode>,\\n\\n}\\n\\n\\n\\n#[derive(Debug, Clone, Copy)]\\n\\npub enum ResolveMode {\\n\\n Default,\\n\\n ForcePull,\\n\\n PreferLocal,\\n\\n}\\n\\n\\n\\nimpl fmt::Display for ResolveMode {\\n\\n fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {\\n\\n match self {\\n\\n ResolveMode::Default => write!(f, \\\"default\\\"),\\n\\n ResolveMode::ForcePull => write!(f, \\\"pull\\\"),\\n\\n ResolveMode::PreferLocal => write!(f, \\\"local\\\"),\\n\\n }\\n\",\n \"file_path\": \"buildkit-llb/src/ops/source/image.rs\",\n \"rank\": 49,\n \"score\": 31102.783418765062\n },\n {\n \"content\": \" description: Default::default(),\\n\\n ignore_cache: false,\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\nimpl GitSource {\\n\\n pub fn with_reference<S>(mut self, reference: S) -> Self\\n\\n where\\n\\n S: Into<String>,\\n\\n {\\n\\n self.reference = Some(reference.into());\\n\\n self\\n\\n }\\n\\n}\\n\\n\\n\\nimpl<'a> SingleBorrowedOutput<'a> for GitSource {\\n\\n fn output(&'a self) -> OperationOutput<'a> {\\n\\n OperationOutput::borrowed(self, OutputIdx(0))\\n\\n }\\n\",\n \"file_path\": \"buildkit-llb/src/ops/source/git.rs\",\n \"rank\": 50,\n \"score\": 31102.11265673415\n },\n {\n \"content\": \" self.description\\n\\n .insert(\\\"llb.customname\\\".into(), name.into());\\n\\n\\n\\n self\\n\\n }\\n\\n\\n\\n fn ignore_cache(mut self, ignore: bool) -> Self {\\n\\n self.ignore_cache = ignore;\\n\\n self\\n\\n }\\n\\n}\\n\\n\\n\\nimpl Operation for HttpSource {\\n\\n fn id(&self) -> &OperationId {\\n\\n &self.id\\n\\n }\\n\\n\\n\\n fn serialize(&self, _: &mut Context) -> Result<Node> {\\n\\n let mut attrs = HashMap::default();\\n\\n\\n\",\n \"file_path\": \"buildkit-llb/src/ops/source/http.rs\",\n \"rank\": 51,\n \"score\": 31102.10819247008\n },\n {\n \"content\": \" fn custom_name<S>(mut self, name: S) -> Self\\n\\n where\\n\\n S: Into<String>,\\n\\n {\\n\\n self.description\\n\\n .insert(\\\"llb.customname\\\".into(), name.into());\\n\\n\\n\\n self\\n\\n }\\n\\n\\n\\n fn ignore_cache(mut self, ignore: bool) -> Self {\\n\\n self.ignore_cache = ignore;\\n\\n self\\n\\n }\\n\\n}\\n\\n\\n\\nimpl Operation for ImageSource {\\n\\n fn id(&self) -> &OperationId {\\n\\n &self.id\\n\\n }\\n\",\n \"file_path\": \"buildkit-llb/src/ops/source/image.rs\",\n \"rank\": 52,\n \"score\": 31101.838769448586\n },\n {\n \"content\": \"}\\n\\n\\n\\nimpl<'a> SingleOwnedOutput<'static> for Arc<GitSource> {\\n\\n fn output(&self) -> OperationOutput<'static> {\\n\\n OperationOutput::owned(self.clone(), OutputIdx(0))\\n\\n }\\n\\n}\\n\\n\\n\\nimpl OperationBuilder<'static> for GitSource {\\n\\n fn custom_name<S>(mut self, name: S) -> Self\\n\\n where\\n\\n S: Into<String>,\\n\\n {\\n\\n self.description\\n\\n .insert(\\\"llb.customname\\\".into(), name.into());\\n\\n\\n\\n self\\n\\n }\\n\\n\\n\\n fn ignore_cache(mut self, ignore: bool) -> Self {\\n\",\n \"file_path\": \"buildkit-llb/src/ops/source/git.rs\",\n \"rank\": 53,\n \"score\": 31101.637045006886\n },\n {\n \"content\": \"impl LocalSource {\\n\\n pub(crate) fn new<S>(name: S) -> Self\\n\\n where\\n\\n S: Into<String>,\\n\\n {\\n\\n Self {\\n\\n id: OperationId::default(),\\n\\n name: name.into(),\\n\\n ignore_cache: false,\\n\\n\\n\\n ..Default::default()\\n\\n }\\n\\n }\\n\\n\\n\\n pub fn add_include_pattern<S>(mut self, include: S) -> Self\\n\\n where\\n\\n S: Into<String>,\\n\\n {\\n\\n // TODO: add `source.local.includepatterns` capability\\n\\n self.include.push(include.into());\\n\",\n \"file_path\": \"buildkit-llb/src/ops/source/local.rs\",\n \"rank\": 54,\n \"score\": 31101.507837047953\n },\n {\n \"content\": \" where\\n\\n S: Into<String>,\\n\\n {\\n\\n Self {\\n\\n id: OperationId::default(),\\n\\n url: url.into(),\\n\\n file_name: None,\\n\\n description: Default::default(),\\n\\n ignore_cache: false,\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\nimpl HttpSource {\\n\\n pub fn with_file_name<S>(mut self, name: S) -> Self\\n\\n where\\n\\n S: Into<String>,\\n\\n {\\n\\n self.file_name = Some(name.into());\\n\\n self\\n\",\n \"file_path\": \"buildkit-llb/src/ops/source/http.rs\",\n \"rank\": 55,\n \"score\": 31101.233482464002\n },\n {\n \"content\": \"use std::collections::HashMap;\\n\\nuse std::fmt;\\n\\nuse std::sync::Arc;\\n\\n\\n\\nuse buildkit_proto::pb::{self, op::Op, OpMetadata, SourceOp};\\n\\nuse lazy_static::*;\\n\\nuse regex::Regex;\\n\\n\\n\\nuse crate::ops::{OperationBuilder, SingleBorrowedOutput, SingleOwnedOutput};\\n\\nuse crate::serialization::{Context, Node, Operation, OperationId, Result};\\n\\nuse crate::utils::{OperationOutput, OutputIdx};\\n\\n\\n\\n#[derive(Debug)]\\n\\npub struct ImageSource {\\n\\n id: OperationId,\\n\\n\\n\\n domain: Option<String>,\\n\\n name: String,\\n\\n tag: Option<String>,\\n\\n digest: Option<String>,\\n\",\n \"file_path\": \"buildkit-llb/src/ops/source/image.rs\",\n \"rank\": 56,\n \"score\": 31100.940612884264\n },\n {\n \"content\": \" }\\n\\n\\n\\n pub fn git<S>(url: S) -> GitSource\\n\\n where\\n\\n S: Into<String>,\\n\\n {\\n\\n GitSource::new(url)\\n\\n }\\n\\n\\n\\n pub fn local<S>(name: S) -> LocalSource\\n\\n where\\n\\n S: Into<String>,\\n\\n {\\n\\n LocalSource::new(name)\\n\\n }\\n\\n\\n\\n pub fn http<S>(name: S) -> HttpSource\\n\\n where\\n\\n S: Into<String>,\\n\\n {\\n\\n HttpSource::new(name)\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"buildkit-llb/src/ops/source/mod.rs\",\n \"rank\": 57,\n \"score\": 31100.74453258572\n },\n {\n \"content\": \" fn output(&self) -> OperationOutput<'static> {\\n\\n OperationOutput::owned(self.clone(), OutputIdx(0))\\n\\n }\\n\\n}\\n\\n\\n\\nimpl OperationBuilder<'static> for LocalSource {\\n\\n fn custom_name<S>(mut self, name: S) -> Self\\n\\n where\\n\\n S: Into<String>,\\n\\n {\\n\\n self.description\\n\\n .insert(\\\"llb.customname\\\".into(), name.into());\\n\\n\\n\\n self\\n\\n }\\n\\n\\n\\n fn ignore_cache(mut self, ignore: bool) -> Self {\\n\\n self.ignore_cache = ignore;\\n\\n self\\n\\n }\\n\",\n \"file_path\": \"buildkit-llb/src/ops/source/local.rs\",\n \"rank\": 58,\n \"score\": 31100.56007544263\n },\n {\n \"content\": \"\\n\\n fn serialize(&self, _: &mut Context) -> Result<Node> {\\n\\n let mut attrs = HashMap::default();\\n\\n\\n\\n if let Some(ref mode) = self.resolve_mode {\\n\\n attrs.insert(\\\"image.resolvemode\\\".into(), mode.to_string());\\n\\n }\\n\\n\\n\\n let head = pb::Op {\\n\\n op: Some(Op::Source(SourceOp {\\n\\n identifier: format!(\\\"docker-image://{}\\\", self.canonical_name()),\\n\\n attrs,\\n\\n })),\\n\\n\\n\\n ..Default::default()\\n\\n };\\n\\n\\n\\n let metadata = OpMetadata {\\n\\n description: self.description.clone(),\\n\\n ignore_cache: self.ignore_cache,\\n\\n\\n\\n ..Default::default()\\n\\n };\\n\\n\\n\\n Ok(Node::new(head, metadata))\\n\\n }\\n\\n}\\n\\n\\n\\n#[test]\\n\",\n \"file_path\": \"buildkit-llb/src/ops/source/image.rs\",\n \"rank\": 59,\n \"score\": 31100.250740322277\n },\n {\n \"content\": \" self\\n\\n }\\n\\n\\n\\n pub fn add_exclude_pattern<S>(mut self, exclude: S) -> Self\\n\\n where\\n\\n S: Into<String>,\\n\\n {\\n\\n // TODO: add `source.local.excludepatterns` capability\\n\\n self.exclude.push(exclude.into());\\n\\n self\\n\\n }\\n\\n}\\n\\n\\n\\nimpl<'a> SingleBorrowedOutput<'a> for LocalSource {\\n\\n fn output(&'a self) -> OperationOutput<'a> {\\n\\n OperationOutput::borrowed(self, OutputIdx(0))\\n\\n }\\n\\n}\\n\\n\\n\\nimpl<'a> SingleOwnedOutput<'static> for Arc<LocalSource> {\\n\",\n \"file_path\": \"buildkit-llb/src/ops/source/local.rs\",\n \"rank\": 60,\n \"score\": 31099.056347008427\n },\n {\n \"content\": \" |caps| { vec![] },\\n\\n |cached_tail| { vec![] },\\n\\n |inputs| { vec![] },\\n\\n |op| {\\n\\n Op::Source(SourceOp {\\n\\n identifier: \\\"http://any.url/with/path\\\".into(),\\n\\n attrs: Default::default(),\\n\\n })\\n\\n },\\n\\n );\\n\\n\\n\\n crate::check_op!(\\n\\n HttpSource::new(\\\"http://any.url/with/path\\\").with_file_name(\\\"file.name\\\"),\\n\\n |digest| { \\\"sha256:e1fe6584287dfa2b065ed29fcf4f77bcf86fb54781832d2f45074fa1671df692\\\" },\\n\\n |description| { vec![] },\\n\\n |caps| { vec![] },\\n\\n |cached_tail| { vec![] },\\n\\n |inputs| { vec![] },\\n\\n |op| {\\n\\n Op::Source(SourceOp {\\n\\n identifier: \\\"http://any.url/with/path\\\".into(),\\n\\n attrs: vec![(\\\"http.filename\\\".to_string(), \\\"file.name\\\".to_string())]\\n\\n .into_iter()\\n\\n .collect(),\\n\\n })\\n\\n },\\n\\n );\\n\\n}\\n\",\n \"file_path\": \"buildkit-llb/src/ops/source/http.rs\",\n \"rank\": 61,\n \"score\": 31098.62570449154\n },\n {\n \"content\": \"}\\n\\n\\n\\nimpl Operation for LocalSource {\\n\\n fn id(&self) -> &OperationId {\\n\\n &self.id\\n\\n }\\n\\n\\n\\n fn serialize(&self, _: &mut Context) -> Result<Node> {\\n\\n let mut attrs = HashMap::default();\\n\\n\\n\\n if !self.exclude.is_empty() {\\n\\n attrs.insert(\\n\\n \\\"local.excludepatterns\\\".into(),\\n\\n serde_json::to_string(&self.exclude).unwrap(),\\n\\n );\\n\\n }\\n\\n\\n\\n if !self.include.is_empty() {\\n\\n attrs.insert(\\n\\n \\\"local.includepattern\\\".into(),\\n\",\n \"file_path\": \"buildkit-llb/src/ops/source/local.rs\",\n \"rank\": 62,\n \"score\": 31098.56953664328\n },\n {\n \"content\": \" }\\n\\n}\\n\\n\\n\\nimpl Default for ResolveMode {\\n\\n fn default() -> Self {\\n\\n ResolveMode::Default\\n\\n }\\n\\n}\\n\\n\\n\\nlazy_static! {\\n\\n static ref TAG_EXPR: Regex = Regex::new(r\\\":[\\\\w][\\\\w.-]+$\\\").unwrap();\\n\\n}\\n\\n\\n\\nimpl ImageSource {\\n\\n // The implementation is based on:\\n\\n // https://github.com/containerd/containerd/blob/614c0858f2a8db9ee0c788a9164870069f3e53ed/reference/docker/reference.go\\n\\n pub(crate) fn new<S>(name: S) -> Self\\n\\n where\\n\\n S: Into<String>,\\n\\n {\\n\",\n \"file_path\": \"buildkit-llb/src/ops/source/image.rs\",\n \"rank\": 63,\n \"score\": 31098.339351276747\n },\n {\n \"content\": \" |caps| { vec![] },\\n\\n |cached_tail| { vec![] },\\n\\n |inputs| { vec![] },\\n\\n |op| {\\n\\n Op::Source(SourceOp {\\n\\n identifier: \\\"git://any.url\\\".into(),\\n\\n attrs: Default::default(),\\n\\n })\\n\\n },\\n\\n );\\n\\n\\n\\n crate::check_op!(\\n\\n GitSource::new(\\\"git://any.url\\\"),\\n\\n |digest| { \\\"sha256:ecde982e19ace932e5474e57b0ca71ba690ed7d28abff2a033e8f969e22bf2d8\\\" },\\n\\n |description| { vec![] },\\n\\n |caps| { vec![] },\\n\\n |cached_tail| { vec![] },\\n\\n |inputs| { vec![] },\\n\\n |op| {\\n\\n Op::Source(SourceOp {\\n\",\n \"file_path\": \"buildkit-llb/src/ops/source/git.rs\",\n \"rank\": 64,\n \"score\": 31097.27849911052\n },\n {\n \"content\": \" }\\n\\n}\\n\\n\\n\\nimpl<'a> SingleBorrowedOutput<'a> for HttpSource {\\n\\n fn output(&'a self) -> OperationOutput<'a> {\\n\\n OperationOutput::borrowed(self, OutputIdx(0))\\n\\n }\\n\\n}\\n\\n\\n\\nimpl<'a> SingleOwnedOutput<'static> for Arc<HttpSource> {\\n\\n fn output(&self) -> OperationOutput<'static> {\\n\\n OperationOutput::owned(self.clone(), OutputIdx(0))\\n\\n }\\n\\n}\\n\\n\\n\\nimpl OperationBuilder<'static> for HttpSource {\\n\\n fn custom_name<S>(mut self, name: S) -> Self\\n\\n where\\n\\n S: Into<String>,\\n\\n {\\n\",\n \"file_path\": \"buildkit-llb/src/ops/source/http.rs\",\n \"rank\": 65,\n \"score\": 31096.815633598428\n },\n {\n \"content\": \" serde_json::to_string(&self.include).unwrap(),\\n\\n );\\n\\n }\\n\\n\\n\\n let head = pb::Op {\\n\\n op: Some(Op::Source(SourceOp {\\n\\n identifier: format!(\\\"local://{}\\\", self.name),\\n\\n attrs,\\n\\n })),\\n\\n\\n\\n ..Default::default()\\n\\n };\\n\\n\\n\\n let metadata = OpMetadata {\\n\\n description: self.description.clone(),\\n\\n ignore_cache: self.ignore_cache,\\n\\n\\n\\n ..Default::default()\\n\\n };\\n\\n\\n\\n Ok(Node::new(head, metadata))\\n\\n }\\n\\n}\\n\\n\\n\\n#[test]\\n\",\n \"file_path\": \"buildkit-llb/src/ops/source/local.rs\",\n \"rank\": 66,\n \"score\": 31096.696348673468\n },\n {\n \"content\": \" self.ignore_cache = ignore;\\n\\n self\\n\\n }\\n\\n}\\n\\n\\n\\nimpl Operation for GitSource {\\n\\n fn id(&self) -> &OperationId {\\n\\n &self.id\\n\\n }\\n\\n\\n\\n fn serialize(&self, _: &mut Context) -> Result<Node> {\\n\\n let identifier = if let Some(ref reference) = self.reference {\\n\\n format!(\\\"git://{}#{}\\\", self.remote, reference)\\n\\n } else {\\n\\n format!(\\\"git://{}\\\", self.remote)\\n\\n };\\n\\n\\n\\n let head = pb::Op {\\n\\n op: Some(Op::Source(SourceOp {\\n\\n identifier,\\n\",\n \"file_path\": \"buildkit-llb/src/ops/source/git.rs\",\n \"rank\": 67,\n \"score\": 31096.440419290946\n },\n {\n \"content\": \" identifier: \\\"git://any.url\\\".into(),\\n\\n attrs: Default::default(),\\n\\n })\\n\\n },\\n\\n );\\n\\n\\n\\n crate::check_op!(\\n\\n GitSource::new(\\\"git@any.url\\\"),\\n\\n |digest| { \\\"sha256:ecde982e19ace932e5474e57b0ca71ba690ed7d28abff2a033e8f969e22bf2d8\\\" },\\n\\n |description| { vec![] },\\n\\n |caps| { vec![] },\\n\\n |cached_tail| { vec![] },\\n\\n |inputs| { vec![] },\\n\\n |op| {\\n\\n Op::Source(SourceOp {\\n\\n identifier: \\\"git://any.url\\\".into(),\\n\\n attrs: Default::default(),\\n\\n })\\n\\n },\\n\\n );\\n\\n}\\n\\n\\n\",\n \"file_path\": \"buildkit-llb/src/ops/source/git.rs\",\n \"rank\": 68,\n \"score\": 31096.433639419873\n },\n {\n \"content\": \" |caps| { vec![] },\\n\\n |cached_tail| { vec![] },\\n\\n |inputs| { vec![] },\\n\\n |op| {\\n\\n Op::Source(SourceOp {\\n\\n identifier: \\\"docker-image://docker.io/library/alpine:latest\\\".into(),\\n\\n attrs: Default::default(),\\n\\n })\\n\\n },\\n\\n );\\n\\n\\n\\n crate::check_op!(\\n\\n ImageSource::new(\\\"rustlang/rust:nightly\\\").custom_name(\\\"image custom name\\\"),\\n\\n |digest| { \\\"sha256:dee2a3d7dd482dd8098ba543ff1dcb01efd29fcd16fdb0979ef556f38564543a\\\" },\\n\\n |description| { vec![(\\\"llb.customname\\\", \\\"image custom name\\\")] },\\n\\n |caps| { vec![] },\\n\\n |cached_tail| { vec![] },\\n\\n |inputs| { vec![] },\\n\\n |op| {\\n\\n Op::Source(SourceOp {\\n\",\n \"file_path\": \"buildkit-llb/src/ops/source/image.rs\",\n \"rank\": 69,\n \"score\": 31096.099225557817\n },\n {\n \"content\": \" |caps| { vec![] },\\n\\n |cached_tail| { vec![] },\\n\\n |inputs| { vec![] },\\n\\n |op| {\\n\\n Op::Source(SourceOp {\\n\\n identifier: \\\"local://context\\\".into(),\\n\\n attrs: Default::default(),\\n\\n })\\n\\n },\\n\\n );\\n\\n\\n\\n crate::check_op!(\\n\\n {\\n\\n LocalSource::new(\\\"context\\\")\\n\\n .custom_name(\\\"context custom name\\\")\\n\\n .add_exclude_pattern(\\\"**/target\\\")\\n\\n .add_exclude_pattern(\\\"Dockerfile\\\")\\n\\n },\\n\\n |digest| { \\\"sha256:f6962b8bb1659c63a2c2c3e2a7ccf0326c87530dd70c514343f127e4c20460c4\\\" },\\n\\n |description| { vec![(\\\"llb.customname\\\", \\\"context custom name\\\")] },\\n\",\n \"file_path\": \"buildkit-llb/src/ops/source/local.rs\",\n \"rank\": 70,\n \"score\": 31095.45173883769\n },\n {\n \"content\": \" identifier: \\\"docker-image://docker.io/rustlang/rust:nightly\\\".into(),\\n\\n attrs: Default::default(),\\n\\n })\\n\\n },\\n\\n );\\n\\n\\n\\n crate::check_op!(\\n\\n ImageSource::new(\\\"rustlang/rust:nightly\\\").with_digest(\\\"sha256:123456\\\"),\\n\\n |digest| { \\\"sha256:a9837e26998d165e7b6433f8d40b36d259905295860fcbbc62bbce75a6c991c6\\\" },\\n\\n |description| { vec![] },\\n\\n |caps| { vec![] },\\n\\n |cached_tail| { vec![] },\\n\\n |inputs| { vec![] },\\n\\n |op| {\\n\\n Op::Source(SourceOp {\\n\\n identifier: \\\"docker-image://docker.io/rustlang/rust:nightly@sha256:123456\\\".into(),\\n\\n attrs: Default::default(),\\n\\n })\\n\\n },\\n\\n );\\n\\n}\\n\\n\\n\",\n \"file_path\": \"buildkit-llb/src/ops/source/image.rs\",\n \"rank\": 71,\n \"score\": 31095.21499200355\n },\n {\n \"content\": \" resolve_mode: None,\\n\\n }\\n\\n }\\n\\n\\n\\n pub fn with_resolve_mode(mut self, mode: ResolveMode) -> Self {\\n\\n self.resolve_mode = Some(mode);\\n\\n self\\n\\n }\\n\\n\\n\\n pub fn resolve_mode(&self) -> Option<ResolveMode> {\\n\\n self.resolve_mode\\n\\n }\\n\\n\\n\\n pub fn with_digest<S>(mut self, digest: S) -> Self\\n\\n where\\n\\n S: Into<String>,\\n\\n {\\n\\n self.digest = Some(digest.into());\\n\\n self\\n\\n }\\n\",\n \"file_path\": \"buildkit-llb/src/ops/source/image.rs\",\n \"rank\": 72,\n \"score\": 31095.03755509101\n },\n {\n \"content\": \" |caps| { vec![] },\\n\\n |cached_tail| { vec![] },\\n\\n |inputs| { vec![] },\\n\\n |op| {\\n\\n Op::Source(SourceOp {\\n\\n identifier: \\\"docker-image://docker.io/rustlang/rust:nightly\\\".into(),\\n\\n attrs: crate::utils::test::to_map(vec![(\\\"image.resolvemode\\\", \\\"pull\\\")]),\\n\\n })\\n\\n },\\n\\n );\\n\\n\\n\\n crate::check_op!(\\n\\n ImageSource::new(\\\"rustlang/rust:nightly\\\").with_resolve_mode(ResolveMode::PreferLocal),\\n\\n |digest| { \\\"sha256:bd6797c8644d2663b29c36a8b3b63931e539be44ede5e56aca2da4f35f241f18\\\" },\\n\\n |description| { vec![] },\\n\\n |caps| { vec![] },\\n\\n |cached_tail| { vec![] },\\n\\n |inputs| { vec![] },\\n\\n |op| {\\n\\n Op::Source(SourceOp {\\n\\n identifier: \\\"docker-image://docker.io/rustlang/rust:nightly\\\".into(),\\n\\n attrs: crate::utils::test::to_map(vec![(\\\"image.resolvemode\\\", \\\"local\\\")]),\\n\\n })\\n\\n },\\n\\n );\\n\\n}\\n\\n\\n\",\n \"file_path\": \"buildkit-llb/src/ops/source/image.rs\",\n \"rank\": 73,\n \"score\": 31094.995866699697\n },\n {\n \"content\": \"\\n\\n pub fn with_tag<S>(mut self, tag: S) -> Self\\n\\n where\\n\\n S: Into<String>,\\n\\n {\\n\\n self.tag = Some(tag.into());\\n\\n self\\n\\n }\\n\\n\\n\\n pub fn canonical_name(&self) -> String {\\n\\n let domain = match self.domain {\\n\\n Some(ref domain) => domain,\\n\\n None => \\\"docker.io\\\",\\n\\n };\\n\\n\\n\\n let tag = match self.tag {\\n\\n Some(ref tag) => tag,\\n\\n None => \\\"latest\\\",\\n\\n };\\n\\n\\n\",\n \"file_path\": \"buildkit-llb/src/ops/source/image.rs\",\n \"rank\": 74,\n \"score\": 31094.670694195986\n },\n {\n \"content\": \" if let Some(ref file_name) = self.file_name {\\n\\n attrs.insert(\\\"http.filename\\\".into(), file_name.into());\\n\\n }\\n\\n\\n\\n let head = pb::Op {\\n\\n op: Some(Op::Source(SourceOp {\\n\\n identifier: self.url.clone(),\\n\\n attrs,\\n\\n })),\\n\\n\\n\\n ..Default::default()\\n\\n };\\n\\n\\n\\n let metadata = OpMetadata {\\n\\n description: self.description.clone(),\\n\\n ignore_cache: self.ignore_cache,\\n\\n\\n\\n ..Default::default()\\n\\n };\\n\\n\\n\\n Ok(Node::new(head, metadata))\\n\\n }\\n\\n}\\n\\n\\n\\n#[test]\\n\",\n \"file_path\": \"buildkit-llb/src/ops/source/http.rs\",\n \"rank\": 75,\n \"score\": 31093.949422365033\n },\n {\n \"content\": \" },\\n\\n |digest| { \\\"sha256:a7e628333262b810572f83193bbf8554e688abfb51d44ac30bdad7fa425f3839\\\" },\\n\\n |description| { vec![(\\\"llb.customname\\\", \\\"context custom name\\\")] },\\n\\n |caps| { vec![] },\\n\\n |cached_tail| { vec![] },\\n\\n |inputs| { vec![] },\\n\\n |op| {\\n\\n Op::Source(SourceOp {\\n\\n identifier: \\\"local://context\\\".into(),\\n\\n attrs: crate::utils::test::to_map(vec![(\\n\\n \\\"local.includepattern\\\",\\n\\n r#\\\"[\\\"Cargo.toml\\\",\\\"inner/Cargo.toml\\\"]\\\"#,\\n\\n )]),\\n\\n })\\n\\n },\\n\\n );\\n\\n}\\n\",\n \"file_path\": \"buildkit-llb/src/ops/source/local.rs\",\n \"rank\": 76,\n \"score\": 31093.4696182506\n },\n {\n \"content\": \" |caps| { vec![] },\\n\\n |cached_tail| { vec![] },\\n\\n |inputs| { vec![] },\\n\\n |op| {\\n\\n Op::Source(SourceOp {\\n\\n identifier: \\\"local://context\\\".into(),\\n\\n attrs: crate::utils::test::to_map(vec![(\\n\\n \\\"local.excludepatterns\\\",\\n\\n r#\\\"[\\\"**/target\\\",\\\"Dockerfile\\\"]\\\"#,\\n\\n )]),\\n\\n })\\n\\n },\\n\\n );\\n\\n\\n\\n crate::check_op!(\\n\\n {\\n\\n LocalSource::new(\\\"context\\\")\\n\\n .custom_name(\\\"context custom name\\\")\\n\\n .add_include_pattern(\\\"Cargo.toml\\\")\\n\\n .add_include_pattern(\\\"inner/Cargo.toml\\\")\\n\",\n \"file_path\": \"buildkit-llb/src/ops/source/local.rs\",\n \"rank\": 77,\n \"score\": 31093.23980777434\n },\n {\n \"content\": \" });\\n\\n\\n\\n crate::check_op!(ImageSource::new(\\\"127.0.0.1:5000/rust:obj\\\"), |op| {\\n\\n Op::Source(SourceOp {\\n\\n identifier: \\\"docker-image://127.0.0.1:5000/rust:obj\\\".into(),\\n\\n attrs: Default::default(),\\n\\n })\\n\\n });\\n\\n\\n\\n crate::check_op!(ImageSource::new(\\\"localhost:5000/rust\\\"), |op| {\\n\\n Op::Source(SourceOp {\\n\\n identifier: \\\"docker-image://localhost:5000/rust:latest\\\".into(),\\n\\n attrs: Default::default(),\\n\\n })\\n\\n });\\n\\n\\n\\n crate::check_op!(ImageSource::new(\\\"127.0.0.1:5000/rust\\\"), |op| {\\n\\n Op::Source(SourceOp {\\n\\n identifier: \\\"docker-image://127.0.0.1:5000/rust:latest\\\".into(),\\n\\n attrs: Default::default(),\\n\",\n \"file_path\": \"buildkit-llb/src/ops/source/image.rs\",\n \"rank\": 78,\n \"score\": 31092.924854663026\n },\n {\n \"content\": \"\\n\\n crate::check_op!(ImageSource::new(\\\"localhost/rust:obj\\\"), |op| {\\n\\n Op::Source(SourceOp {\\n\\n identifier: \\\"docker-image://localhost/rust:obj\\\".into(),\\n\\n attrs: Default::default(),\\n\\n })\\n\\n });\\n\\n\\n\\n crate::check_op!(ImageSource::new(\\\"127.0.0.1/rust:obj\\\"), |op| {\\n\\n Op::Source(SourceOp {\\n\\n identifier: \\\"docker-image://127.0.0.1/rust:obj\\\".into(),\\n\\n attrs: Default::default(),\\n\\n })\\n\\n });\\n\\n\\n\\n crate::check_op!(ImageSource::new(\\\"localhost:5000/rust:obj\\\"), |op| {\\n\\n Op::Source(SourceOp {\\n\\n identifier: \\\"docker-image://localhost:5000/rust:obj\\\".into(),\\n\\n attrs: Default::default(),\\n\\n })\\n\",\n \"file_path\": \"buildkit-llb/src/ops/source/image.rs\",\n \"rank\": 79,\n \"score\": 31092.826840361584\n },\n {\n \"content\": \" });\\n\\n\\n\\n crate::check_op!(ImageSource::new(\\\"library/rust\\\"), |op| {\\n\\n Op::Source(SourceOp {\\n\\n identifier: \\\"docker-image://docker.io/library/rust:latest\\\".into(),\\n\\n attrs: Default::default(),\\n\\n })\\n\\n });\\n\\n\\n\\n crate::check_op!(ImageSource::new(\\\"rust:obj@sha256:abcdef\\\"), |op| {\\n\\n Op::Source(SourceOp {\\n\\n identifier: \\\"docker-image://docker.io/library/rust:obj@sha256:abcdef\\\".into(),\\n\\n attrs: Default::default(),\\n\\n })\\n\\n });\\n\\n\\n\\n crate::check_op!(ImageSource::new(\\\"rust@sha256:abcdef\\\"), |op| {\\n\\n Op::Source(SourceOp {\\n\\n identifier: \\\"docker-image://docker.io/library/rust:latest@sha256:abcdef\\\".into(),\\n\\n attrs: Default::default(),\\n\",\n \"file_path\": \"buildkit-llb/src/ops/source/image.rs\",\n \"rank\": 80,\n \"score\": 31092.549419730243\n },\n {\n \"content\": \" })\\n\\n });\\n\\n\\n\\n crate::check_op!(ImageSource::new(\\\"docker.io/rust\\\"), |op| {\\n\\n Op::Source(SourceOp {\\n\\n identifier: \\\"docker-image://docker.io/library/rust:latest\\\".into(),\\n\\n attrs: Default::default(),\\n\\n })\\n\\n });\\n\\n\\n\\n crate::check_op!(ImageSource::new(\\\"docker.io/library/rust\\\"), |op| {\\n\\n Op::Source(SourceOp {\\n\\n identifier: \\\"docker-image://docker.io/library/rust:latest\\\".into(),\\n\\n attrs: Default::default(),\\n\\n })\\n\\n });\\n\\n}\\n\",\n \"file_path\": \"buildkit-llb/src/ops/source/image.rs\",\n \"rank\": 81,\n \"score\": 31092.45806057572\n },\n {\n \"content\": \" |caps| { vec![] },\\n\\n |cached_tail| { vec![] },\\n\\n |inputs| { vec![] },\\n\\n |op| {\\n\\n Op::Source(SourceOp {\\n\\n identifier: \\\"git://any.url\\\".into(),\\n\\n attrs: Default::default(),\\n\\n })\\n\\n },\\n\\n );\\n\\n}\\n\\n\\n\",\n \"file_path\": \"buildkit-llb/src/ops/source/git.rs\",\n \"rank\": 82,\n \"score\": 31092.227437001773\n },\n {\n \"content\": \" match self.digest {\\n\\n Some(ref digest) => format!(\\\"{}/{}:{}@{}\\\", domain, self.name, tag, digest),\\n\\n None => format!(\\\"{}/{}:{}\\\", domain, self.name, tag),\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\nimpl<'a> SingleBorrowedOutput<'a> for ImageSource {\\n\\n fn output(&'a self) -> OperationOutput<'a> {\\n\\n OperationOutput::borrowed(self, OutputIdx(0))\\n\\n }\\n\\n}\\n\\n\\n\\nimpl<'a> SingleOwnedOutput<'static> for Arc<ImageSource> {\\n\\n fn output(&self) -> OperationOutput<'static> {\\n\\n OperationOutput::owned(self.clone(), OutputIdx(0))\\n\\n }\\n\\n}\\n\\n\\n\\nimpl OperationBuilder<'static> for ImageSource {\\n\",\n \"file_path\": \"buildkit-llb/src/ops/source/image.rs\",\n \"rank\": 83,\n \"score\": 31092.224980181934\n },\n {\n \"content\": \" })\\n\\n });\\n\\n\\n\\n crate::check_op!(ImageSource::new(\\\"rust:obj@abcdef\\\"), |op| {\\n\\n Op::Source(SourceOp {\\n\\n identifier: \\\"docker-image://docker.io/library/rust:obj@abcdef\\\".into(),\\n\\n attrs: Default::default(),\\n\\n })\\n\\n });\\n\\n\\n\\n crate::check_op!(\\n\\n ImageSource::new(\\\"b.gcr.io/test.example.com/my-app:test.example.com\\\"),\\n\\n |op| {\\n\\n Op::Source(SourceOp {\\n\\n identifier: \\\"docker-image://b.gcr.io/test.example.com/my-app:test.example.com\\\"\\n\\n .into(),\\n\\n attrs: Default::default(),\\n\\n })\\n\\n }\\n\\n );\\n\",\n \"file_path\": \"buildkit-llb/src/ops/source/image.rs\",\n \"rank\": 84,\n \"score\": 31092.151068695013\n },\n {\n \"content\": \"\\n\\n crate::check_op!(\\n\\n ImageSource::new(\\\"sub-dom1.foo.com/bar/baz/quux:some-long-tag\\\"),\\n\\n |op| {\\n\\n Op::Source(SourceOp {\\n\\n identifier: \\\"docker-image://sub-dom1.foo.com/bar/baz/quux:some-long-tag\\\".into(),\\n\\n attrs: Default::default(),\\n\\n })\\n\\n }\\n\\n );\\n\\n\\n\\n crate::check_op!(\\n\\n ImageSource::new(\\\"sub-dom1.foo.com/quux:some-long-tag\\\"),\\n\\n |op| {\\n\\n Op::Source(SourceOp {\\n\\n identifier: \\\"docker-image://sub-dom1.foo.com/quux:some-long-tag\\\".into(),\\n\\n attrs: Default::default(),\\n\\n })\\n\\n }\\n\\n );\\n\",\n \"file_path\": \"buildkit-llb/src/ops/source/image.rs\",\n \"rank\": 85,\n \"score\": 31092.0084221641\n },\n {\n \"content\": \" attrs: Default::default(),\\n\\n })),\\n\\n\\n\\n ..Default::default()\\n\\n };\\n\\n\\n\\n let metadata = OpMetadata {\\n\\n description: self.description.clone(),\\n\\n ignore_cache: self.ignore_cache,\\n\\n\\n\\n ..Default::default()\\n\\n };\\n\\n\\n\\n Ok(Node::new(head, metadata))\\n\\n }\\n\\n}\\n\\n\\n\\n#[test]\\n\",\n \"file_path\": \"buildkit-llb/src/ops/source/git.rs\",\n \"rank\": 86,\n \"score\": 31091.83323664578\n },\n {\n \"content\": \" where\\n\\n S: Into<String>,\\n\\n {\\n\\n let mut raw_url = url.into();\\n\\n let remote = if raw_url.starts_with(\\\"http://\\\") {\\n\\n raw_url.split_off(7)\\n\\n } else if raw_url.starts_with(\\\"https://\\\") {\\n\\n raw_url.split_off(8)\\n\\n } else if raw_url.starts_with(\\\"git://\\\") {\\n\\n raw_url.split_off(6)\\n\\n } else if raw_url.starts_with(\\\"git@\\\") {\\n\\n raw_url.split_off(4)\\n\\n } else {\\n\\n raw_url\\n\\n };\\n\\n\\n\\n Self {\\n\\n id: OperationId::default(),\\n\\n remote,\\n\\n reference: None,\\n\",\n \"file_path\": \"buildkit-llb/src/ops/source/git.rs\",\n \"rank\": 87,\n \"score\": 31089.74235230637\n },\n {\n \"content\": \" let mut name = name.into();\\n\\n\\n\\n let (digest, digest_separator) = match name.find('@') {\\n\\n Some(pos) => (Some(name[pos + 1..].into()), pos),\\n\\n None => (None, name.len()),\\n\\n };\\n\\n\\n\\n name.truncate(digest_separator);\\n\\n\\n\\n let (tag, tag_separator) = match TAG_EXPR.find(&name) {\\n\\n Some(found) => (Some(name[found.start() + 1..].into()), found.start()),\\n\\n None => (None, name.len()),\\n\\n };\\n\\n\\n\\n name.truncate(tag_separator);\\n\\n\\n\\n let (domain, mut name) = match name.find('/') {\\n\\n // The input has canonical-like format.\\n\\n Some(separator_pos) if &name[..separator_pos] == \\\"docker.io\\\" => {\\n\\n (None, name[separator_pos + 1..].into())\\n\",\n \"file_path\": \"buildkit-llb/src/ops/source/image.rs\",\n \"rank\": 88,\n \"score\": 31088.040542765462\n },\n {\n \"content\": \" Some(_) => (None, name),\\n\\n\\n\\n // Fallback if only single url component present.\\n\\n None => (None, name),\\n\\n };\\n\\n\\n\\n if domain.is_none() && name.find('/').is_none() {\\n\\n name = format!(\\\"library/{}\\\", name);\\n\\n }\\n\\n\\n\\n Self {\\n\\n id: OperationId::default(),\\n\\n\\n\\n domain,\\n\\n name,\\n\\n tag,\\n\\n digest,\\n\\n\\n\\n description: Default::default(),\\n\\n ignore_cache: false,\\n\",\n \"file_path\": \"buildkit-llb/src/ops/source/image.rs\",\n \"rank\": 89,\n \"score\": 31087.794533887314\n },\n {\n \"content\": \" }\\n\\n\\n\\n // Special case when domain is \\\"localhost\\\".\\n\\n Some(separator_pos) if &name[..separator_pos] == \\\"localhost\\\" => {\\n\\n (Some(\\\"localhost\\\".into()), name[separator_pos + 1..].into())\\n\\n }\\n\\n\\n\\n // General case for a common domain.\\n\\n Some(separator_pos) if name[..separator_pos].find('.').is_some() => (\\n\\n Some(name[..separator_pos].into()),\\n\\n name[separator_pos + 1..].into(),\\n\\n ),\\n\\n\\n\\n // General case for a domain with port number.\\n\\n Some(separator_pos) if name[..separator_pos].find(':').is_some() => (\\n\\n Some(name[..separator_pos].into()),\\n\\n name[separator_pos + 1..].into(),\\n\\n ),\\n\\n\\n\\n // Fallback if the first component is not a domain name.\\n\",\n \"file_path\": \"buildkit-llb/src/ops/source/image.rs\",\n \"rank\": 90,\n \"score\": 31085.245798638105\n },\n {\n \"content\": \"}\\n\\n\\n\\nimpl<'a> MakeDirOperation<'a> {\\n\\n pub(crate) fn new<P>(output: OutputIdx, path: LayerPath<'a, P>) -> Self\\n\\n where\\n\\n P: AsRef<Path>,\\n\\n {\\n\\n let mut caps = HashMap::<String, bool>::new();\\n\\n caps.insert(\\\"file.base\\\".into(), true);\\n\\n\\n\\n MakeDirOperation {\\n\\n path: path.into_owned(),\\n\\n output,\\n\\n\\n\\n make_parents: false,\\n\\n\\n\\n caps,\\n\\n description: Default::default(),\\n\\n }\\n\\n }\\n\",\n \"file_path\": \"buildkit-llb/src/ops/fs/mkdir.rs\",\n \"rank\": 92,\n \"score\": 26.701251335082656\n },\n {\n \"content\": \"}\\n\\n\\n\\nimpl<'a> MakeFileOperation<'a> {\\n\\n pub(crate) fn new<P>(output: OutputIdx, path: LayerPath<'a, P>) -> Self\\n\\n where\\n\\n P: AsRef<Path>,\\n\\n {\\n\\n let mut caps = HashMap::<String, bool>::new();\\n\\n caps.insert(\\\"file.base\\\".into(), true);\\n\\n\\n\\n MakeFileOperation {\\n\\n path: path.into_owned(),\\n\\n output,\\n\\n\\n\\n data: None,\\n\\n\\n\\n caps,\\n\\n description: Default::default(),\\n\\n }\\n\\n }\\n\",\n \"file_path\": \"buildkit-llb/src/ops/fs/mkfile.rs\",\n \"rank\": 93,\n \"score\": 26.70125133508266\n },\n {\n \"content\": \"\\n\\nimpl<'a> SequenceOperation<'a> {\\n\\n pub(crate) fn new() -> Self {\\n\\n let mut caps = HashMap::<String, bool>::new();\\n\\n caps.insert(\\\"file.base\\\".into(), true);\\n\\n\\n\\n Self {\\n\\n id: OperationId::default(),\\n\\n inner: vec![],\\n\\n\\n\\n caps,\\n\\n description: Default::default(),\\n\\n ignore_cache: false,\\n\\n }\\n\\n }\\n\\n\\n\\n pub fn append<T>(mut self, op: T) -> Self\\n\\n where\\n\\n T: FileOperation + 'a,\\n\\n {\\n\",\n \"file_path\": \"buildkit-llb/src/ops/fs/sequence.rs\",\n \"rank\": 95,\n \"score\": 24.8920289559464\n },\n {\n \"content\": \"use std::collections::HashMap;\\n\\nuse std::path::{Path, PathBuf};\\n\\n\\n\\nuse buildkit_proto::pb;\\n\\n\\n\\nuse super::path::LayerPath;\\n\\nuse super::FileOperation;\\n\\n\\n\\nuse crate::serialization::{Context, Result};\\n\\nuse crate::utils::OutputIdx;\\n\\n\\n\\n#[derive(Debug)]\\n\\npub struct MakeDirOperation<'a> {\\n\\n path: LayerPath<'a, PathBuf>,\\n\\n output: OutputIdx,\\n\\n\\n\\n make_parents: bool,\\n\\n\\n\\n description: HashMap<String, String>,\\n\\n caps: HashMap<String, bool>,\\n\",\n \"file_path\": \"buildkit-llb/src/ops/fs/mkdir.rs\",\n \"rank\": 99,\n \"score\": 20.426360818843786\n }\n]","isConversational":false}}},{"rowIdx":2357,"cells":{"lang":{"kind":"string","value":"Rust"},"file_path":{"kind":"string","value":"src/shared/binary_rate_limiter.rs"},"repo_name":{"kind":"string","value":"rnestler/cobalt-rs"},"commit":{"kind":"string","value":"cf8a23791d4c253c75635a6206e8eeeb3f3e1969"},"file_code":{"kind":"string","value":"\n\nuse std::cmp;\nuse std::time::{Duration, Instant};\n\nuse ::{Config, RateLimiter};\n\nconst MIN_GOOD_MODE_TIME_DELAY: u64 = 1000;\n\nconst MAX_GOOD_MODE_TIME_DELAY: u64 = 60000;\n\n#[derive(Debug, PartialEq)]\nenum Mode {\n Good,\n Bad\n}\n\n#[derive(Debug)]\npub struct BinaryRateLimiter {\n tick: u32,\n max_tick: u32,\n mode: Mode,\n rtt_threshold: u32,\n last_bad_time: Instant,\n last_good_time: Instant,\n good_time_duration: u64,\n delay_until_good_mode: u64\n}\n\nimpl RateLimiter for BinaryRateLimiter {\n\n fn new(config: Config) -> BinaryRateLimiter {\n\n let rate = config.send_rate as f32;\n\n BinaryRateLimiter {\n tick: 0,\n \n max_tick: (rate / (33.0 / (100.0 / rate))) as u32,\n mode: Mode::Good,\n rtt_threshold: 250,\n last_bad_time: Instant::now(),\n last_good_time: Instant::now(),\n good_time_duration: 0,\n delay_until_good_mode: MIN_GOOD_MODE_TIME_DELAY\n }\n\n }\n\n fn update(&mut self, rtt: u32, _: f32) {\n\n \n let conditions = if rtt <= self.rtt_threshold {\n \n self.good_time_duration += time_since(&self.last_good_time);\n self.last_good_time = Instant::now();\n Mode::Good\n\n } else {\n \n self.last_bad_time = Instant::now();\n self.good_time_duration = 0;\n Mode::Bad\n };\n\n match self.mode {\n\n Mode::Good => match conditions {\n\n \n \n Mode::Bad => {\n\n self.mode = Mode::Bad;\n\n \n \n if time_since(&self.last_bad_time) < 10000 {\n\n \n \n self.delay_until_good_mode *= 2;\n\n \n self.delay_until_good_mode = cmp::min(\n self.delay_until_good_mode,\n MAX_GOOD_MODE_TIME_DELAY\n );\n\n }\n\n },\n\n Mode::Good => {\n\n \n \n \n \n if self.good_time_duration >= 10000 {\n self.good_time_duration -= 10000;\n\n \n self.delay_until_good_mode = cmp::max(\n self.delay_until_good_mode,\n MIN_GOOD_MODE_TIME_DELAY\n );\n\n }\n\n }\n\n },\n\n Mode::Bad => {\n\n \n \n if time_since(&self.last_bad_time) > self.delay_until_good_mode {\n self.mode = Mode::Good;\n }\n\n }\n\n }\n\n \n \n self.tick += 1;\n if self.tick == self.max_tick {\n self.tick = 0;\n }\n\n }\n\n fn congested(&self) -> bool {\n self.mode == Mode::Bad\n }\n\n fn should_send(&self ) -> bool {\n \n \n !self.congested() || self.tick == 0\n }\n\n fn reset(&mut self) {\n self.tick = 0;\n self.mode = Mode::Good;\n self.last_bad_time = Instant::now();;\n self.last_good_time = Instant::now();\n self.good_time_duration = 0;\n self.delay_until_good_mode = MIN_GOOD_MODE_TIME_DELAY;\n }\n\n}\n\nfn time_since(i: &Instant) -> u64 {\n millis_from_duration(i.elapsed())\n}\n\nfn millis_from_duration(d: Duration) -> u64 {\n d.as_secs() * 1000 + (d.subsec_nanos() as u64 / 1000000)\n}\n\n#[cfg(test)]\nmod test {\n\n use std::thread;\n use std::time::Duration;\n\n use ::{Config, RateLimiter};\n use super::BinaryRateLimiter;\n\n #[test]\n fn test_modes() {\n\n let mut rl = BinaryRateLimiter::new(Config::default());\n\n \n assert_eq!(rl.congested(), false);\n assert_eq!(rl.should_send(), true);\n\n \n rl.update(51, 0.0);\n assert_eq!(rl.congested(), false);\n assert_eq!(rl.should_send(), true);\n\n rl.update(151, 0.0);\n assert_eq!(rl.congested(), false);\n assert_eq!(rl.should_send(), true);\n\n rl.update(250, 0.0);\n assert_eq!(rl.congested(), false);\n assert_eq!(rl.should_send(), true);\n\n \n rl.update(251, 0.0);\n\n \n assert_eq!(rl.congested(), true);\n\n \n assert_eq!(rl.should_send(), false);\n rl.update(251, 0.0);\n assert_eq!(rl.should_send(), false);\n rl.update(251, 0.0);\n\n \n assert_eq!(rl.should_send(), true);\n\n \n thread::sleep(Duration::from_millis(2100));\n rl.update(12, 0.0);\n assert_eq!(rl.congested(), false);\n assert_eq!(rl.should_send(), true);\n\n }\n\n #[test]\n fn test_reset() {\n\n let mut rl = BinaryRateLimiter::new(Config::default());\n\n \n assert_eq!(rl.congested(), false);\n assert_eq!(rl.should_send(), true);\n\n \n rl.update(251, 0.0);\n assert_eq!(rl.congested(), true);\n assert_eq!(rl.should_send(), false);\n\n \n rl.reset();\n assert_eq!(rl.congested(), false);\n assert_eq!(rl.should_send(), true);\n\n }\n\n}\n\n"},"prefix":{"kind":"string","value":"\n\nuse std::cmp;\nuse std::time::{Duration, Instant};\n\nuse ::{Config, RateLimiter};\n\nconst MIN_GOOD_MODE_TIME_DELAY: u64 = 1000;\n\nconst MAX_GOOD_MODE_TIME_DELAY: u64 = 60000;\n\n#[derive(Debug, PartialEq)]\nenum Mode {\n Good,\n Bad\n}\n\n#[derive(Debug)]\npub struct BinaryRateLimiter {\n tick: u32,\n max_tick: u32,\n mode: Mode,\n rtt_threshold: u32,\n last_bad_time: Instant,\n last_good_time: Instant,\n good_time_duration: u64,\n delay_until_good_mode: u64\n}\n\nimpl RateLimiter for BinaryRateLimiter {\n\n fn new(config: Config) -> BinaryRateLimiter {\n\n let rate = config.send_rate as f32;\n\n BinaryRateLimiter {\n tick: 0,\n \n max_tick: (rate / (33.0 / (100.0 / rate))) as u32,\n mode: Mode::Good,\n rtt_threshold: 250,\n last_bad_time: Instant::now(),\n last_good_time: Instant::now(),\n good_time_duration: 0,\n delay_until_good_mode: MIN_GOOD_MODE_TIME_DELAY\n }\n\n }\n\n fn update(&mut self, rtt: u32, _: f32) {\n\n \n let conditions = if rtt <= self.rtt_threshold {\n \n self.good_time_duration += time_since(&self.last_good_time);\n self.last_good_time = Instant::now();\n Mode::Good\n\n } else {\n \n self.last_bad_time = Instant::now();\n self.good_time_duration = 0;\n Mode::Bad\n };\n\n match self.mode {\n\n Mode::Good => match conditions {\n\n \n \n Mode::Bad => {\n\n self.mode = Mode::Bad;\n\n \n \n if time_since(&self.last_bad_time) < 10000 {\n\n \n \n self.delay_until_good_mode *= 2;\n\n \n self.delay_until_good_mode = cmp::min(\n self.delay_until_good_mode,\n MAX_GOOD_MODE_TIME_DELAY\n );\n\n }\n\n },\n\n"},"suffix":{"kind":"string","value":" MIN_GOOD_MODE_TIME_DELAY\n );\n\n }\n\n }\n\n },\n\n Mode::Bad => {\n\n \n \n if time_since(&self.last_bad_time) > self.delay_until_good_mode {\n self.mode = Mode::Good;\n }\n\n }\n\n }\n\n \n \n self.tick += 1;\n if self.tick == self.max_tick {\n self.tick = 0;\n }\n\n }\n\n fn congested(&self) -> bool {\n self.mode == Mode::Bad\n }\n\n fn should_send(&self ) -> bool {\n \n \n !self.congested() || self.tick == 0\n }\n\n fn reset(&mut self) {\n self.tick = 0;\n self.mode = Mode::Good;\n self.last_bad_time = Instant::now();;\n self.last_good_time = Instant::now();\n self.good_time_duration = 0;\n self.delay_until_good_mode = MIN_GOOD_MODE_TIME_DELAY;\n }\n\n}\n\nfn time_since(i: &Instant) -> u64 {\n millis_from_duration(i.elapsed())\n}\n\nfn millis_from_duration(d: Duration) -> u64 {\n d.as_secs() * 1000 + (d.subsec_nanos() as u64 / 1000000)\n}\n\n#[cfg(test)]\nmod test {\n\n use std::thread;\n use std::time::Duration;\n\n use ::{Config, RateLimiter};\n use super::BinaryRateLimiter;\n\n #[test]\n fn test_modes() {\n\n let mut rl = BinaryRateLimiter::new(Config::default());\n\n \n assert_eq!(rl.congested(), false);\n assert_eq!(rl.should_send(), true);\n\n \n rl.update(51, 0.0);\n assert_eq!(rl.congested(), false);\n assert_eq!(rl.should_send(), true);\n\n rl.update(151, 0.0);\n assert_eq!(rl.congested(), false);\n assert_eq!(rl.should_send(), true);\n\n rl.update(250, 0.0);\n assert_eq!(rl.congested(), false);\n assert_eq!(rl.should_send(), true);\n\n \n rl.update(251, 0.0);\n\n \n assert_eq!(rl.congested(), true);\n\n \n assert_eq!(rl.should_send(), false);\n rl.update(251, 0.0);\n assert_eq!(rl.should_send(), false);\n rl.update(251, 0.0);\n\n \n assert_eq!(rl.should_send(), true);\n\n \n thread::sleep(Duration::from_millis(2100));\n rl.update(12, 0.0);\n assert_eq!(rl.congested(), false);\n assert_eq!(rl.should_send(), true);\n\n }\n\n #[test]\n fn test_reset() {\n\n let mut rl = BinaryRateLimiter::new(Config::default());\n\n \n assert_eq!(rl.congested(), false);\n assert_eq!(rl.should_send(), true);\n\n \n rl.update(251, 0.0);\n assert_eq!(rl.congested(), true);\n assert_eq!(rl.should_send(), false);\n\n \n rl.reset();\n assert_eq!(rl.congested(), false);\n assert_eq!(rl.should_send(), true);\n\n }\n\n}\n\n"},"middle":{"kind":"string","value":" Mode::Good => {\n\n \n \n \n \n if self.good_time_duration >= 10000 {\n self.good_time_duration -= 10000;\n\n \n self.delay_until_good_mode = cmp::max(\n self.delay_until_good_mode,\n "},"strategy":{"kind":"string","value":"function_block-random_span"},"context_items":{"kind":"list like","value":[{"content":"fn create_connection(config: Option<Config>) -> Connection<BinaryRateLimiter, NoopPacketModifier> {\n\n create_connection_with_modifier::<NoopPacketModifier>(config)\n\n}\n\n\n","file_path":"src/test/connection.rs","rank":3,"score":102625.29645147541},{"content":"// Helpers --------------------------------------------------------------------\n\nfn client_init(config: Config) -> Client<MockSocket, BinaryRateLimiter, NoopPacketModifier> {\n\n\n\n let mut client = Client::<MockSocket, BinaryRateLimiter, NoopPacketModifier>::new(config);\n\n client.connect(\"255.1.1.1:5678\").ok();\n\n\n\n // Verify initial connection packet\n\n let id = client.connection().unwrap().id().0;\n\n client.send(false).ok();\n\n client.socket().unwrap().assert_sent(vec![\n\n (\"255.1.1.1:5678\", [\n\n 1, 2, 3, 4,\n\n (id >> 24) as u8,\n\n (id >> 16) as u8,\n\n (id >> 8) as u8,\n\n id as u8,\n\n 0,\n\n 0,\n\n 0, 0, 0, 0\n\n\n\n ].to_vec())\n\n ]);\n\n\n\n client\n\n\n\n}\n\n\n","file_path":"src/test/client.rs","rank":4,"score":100712.6361914995},{"content":"fn seq_bit_index(seq: u32, ack: u32) -> u32 {\n\n if seq > ack {\n\n ack + (MAX_SEQ_NUMBER - 1 - seq)\n\n\n\n } else {\n\n ack - 1 - seq\n\n }\n\n}\n\n\n","file_path":"src/shared/connection.rs","rank":5,"score":98706.87740606512},{"content":"#[test]\n\nfn test_rtt_tick_correction() {\n\n\n\n let mut conn = create_connection(None);\n\n let mut socket = MockSocket::new(conn.local_addr(), 0).unwrap();\n\n let address = conn.peer_addr();\n\n\n\n assert_eq!(conn.rtt(), 0);\n\n\n\n // First packet\n\n conn.send_packet(&mut socket, &address);\n\n socket.assert_sent(vec![\n\n (\"255.1.1.2:5678\", [\n\n 1, 2, 3, 4,\n\n (conn.id().0 >> 24) as u8,\n\n (conn.id().0 >> 16) as u8,\n\n (conn.id().0 >> 8) as u8,\n\n conn.id().0 as u8,\n\n 0,\n\n 0,\n\n 0, 0, 0, 0\n","file_path":"src/test/connection.rs","rank":6,"score":97307.07521407463},{"content":"// Helpers --------------------------------------------------------------------\n\nfn create_connection_with_modifier<T: PacketModifier>(config: Option<Config>) -> Connection<BinaryRateLimiter, T> {\n\n let config = config.unwrap_or_else(Config::default);\n\n let local_address: SocketAddr = \"127.0.0.1:1234\".parse().unwrap();\n\n let peer_address: SocketAddr = \"255.1.1.2:5678\".parse().unwrap();\n\n let limiter = BinaryRateLimiter::new(config);\n\n let modifier = T::new(config);\n\n Connection::new(config, local_address, peer_address, limiter, modifier)\n\n}\n\n\n","file_path":"src/test/connection.rs","rank":7,"score":95820.29030890358},{"content":"// Static Helpers -------------------------------------------------------------\n\nfn moving_average(a: f32, b: Duration) -> f32 {\n\n let b = (b.as_secs() as f32) * 1000.0 + (b.subsec_nanos() / 1000000) as f32;\n\n (a - (a - b) * 0.10).max(0.0)\n\n}\n\n\n","file_path":"src/shared/connection.rs","rank":8,"score":94380.18914139559},{"content":"fn seq_is_more_recent(a: u32, b: u32) -> bool {\n\n (a > b) && (a - b <= MAX_SEQ_NUMBER / 2) ||\n\n (b > a) && (b - a > MAX_SEQ_NUMBER / 2)\n\n}\n\n\n","file_path":"src/shared/connection.rs","rank":9,"score":94218.3853669351},{"content":"fn seq_was_acked(seq: u32, ack: u32, bitfield: u32) -> bool {\n\n if seq == ack {\n\n true\n\n\n\n } else {\n\n let bit = seq_bit_index(seq, ack);\n\n bit < MAX_ACK_BITS && (bitfield & (1 << bit)) != 0\n\n }\n\n}\n\n\n","file_path":"src/shared/connection.rs","rank":10,"score":93795.16225558077},{"content":"/// Trait describing a network congestion avoidance algorithm.\n\npub trait RateLimiter {\n\n\n\n /// Method that constructs a new rate limiter using the provided configuration.\n\n fn new(Config) -> Self where Self: Sized;\n\n\n\n /// Method implementing a congestion avoidance algorithm based on round\n\n /// trip time and packet loss.\n\n fn update(&mut self, rtt: u32, packet_loss: f32);\n\n\n\n /// Method that should return `true` in case the connection is currently\n\n /// considered congested and should reduce the number of packets it sends\n\n /// per second.\n\n fn congested(&self) -> bool;\n\n\n\n /// Method that returns whether a connection should be currently sending\n\n /// packets or not.\n\n fn should_send(&self) -> bool;\n\n\n\n /// Method that resets any internal state of the rate limiter.\n\n fn reset(&mut self);\n\n\n\n}\n\n\n\nimpl fmt::Debug for RateLimiter {\n\n fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {\n\n write!(f, \"RateLimiter\")\n\n }\n\n}\n\n\n","file_path":"src/traits/rate_limiter.rs","rank":11,"score":89438.56064684934},{"content":"// Helpers ---------------------------------------------------------------------\n\nfn nanos_from_duration(d: Duration) -> u64 {\n\n d.as_secs() * 1000 * 1000000 + d.subsec_nanos() as u64\n\n}\n\n\n","file_path":"src/shared/ticker.rs","rank":12,"score":83301.06662775556},{"content":"#[test]\n\nfn test_rtt() {\n\n\n\n let mut conn = create_connection(None);\n\n let mut socket = MockSocket::new(conn.local_addr(), 0).unwrap();\n\n let address = conn.peer_addr();\n\n\n\n assert_eq!(conn.rtt(), 0);\n\n\n\n // First packet\n\n conn.send_packet(&mut socket, &address);\n\n socket.assert_sent(vec![\n\n (\"255.1.1.2:5678\", [\n\n 1, 2, 3, 4,\n\n (conn.id().0 >> 24) as u8,\n\n (conn.id().0 >> 16) as u8,\n\n (conn.id().0 >> 8) as u8,\n\n conn.id().0 as u8,\n\n 0,\n\n 0,\n\n 0, 0, 0, 0\n","file_path":"src/test/connection.rs","rank":13,"score":73346.28597060584},{"content":"#[test]\n\nfn test_set_config() {\n\n // TODO how to check that the config was actually modified?\n\n let mut conn = create_connection(None);\n\n conn.set_config(Config {\n\n send_rate: 10,\n\n .. Config::default()\n\n });\n\n}\n\n\n","file_path":"src/test/connection.rs","rank":14,"score":70708.34476124767},{"content":"#[derive(Debug, PartialEq)]\n\nenum PacketState {\n\n Unknown,\n\n Acked,\n\n Lost\n\n}\n\n\n\n/// Structure used for packet acknowledgment of sent packets.\n","file_path":"src/shared/connection.rs","rank":15,"score":56896.23789175875},{"content":"#[derive(Debug, Eq, PartialEq)]\n\nstruct Message {\n\n kind: MessageKind,\n\n order: u16,\n\n size: u16,\n\n data: Vec<u8>\n\n}\n\n\n\nimpl Ord for Message {\n\n // Explicitly implement the trait so the queue becomes a min-heap\n\n // instead of a max-heap.\n\n fn cmp(&self, other: &Self) -> cmp::Ordering {\n\n other.order.cmp(&self.order)\n\n }\n\n}\n\n\n\nimpl PartialOrd for Message {\n\n fn partial_cmp(&self, other: &Self) -> Option<cmp::Ordering> {\n\n Some(self.cmp(other))\n\n }\n\n}\n","file_path":"src/shared/message_queue.rs","rank":16,"score":56896.23789175875},{"content":"// Helpers --------------------------------------------------------------------\n\nfn map_connection_events<R: RateLimiter, M: PacketModifier>(\n\n server_events: &mut VecDeque<ServerEvent>,\n\n connection: &mut Connection<R, M>\n\n) {\n\n let id = connection.id();\n\n for event in connection.events() {\n\n server_events.push_back(match event {\n\n ConnectionEvent::Connected => ServerEvent::Connection(id),\n\n ConnectionEvent::Lost(by_remote) => ServerEvent::ConnectionLost(id, by_remote),\n\n ConnectionEvent::FailedToConnect => unreachable!(),\n\n ConnectionEvent::Closed(by_remote) => ServerEvent::ConnectionClosed(id, by_remote),\n\n ConnectionEvent::Message(payload) => ServerEvent::Message(id, payload),\n\n ConnectionEvent::CongestionStateChanged(c) => ServerEvent::ConnectionCongestionStateChanged(id, c),\n\n ConnectionEvent::PacketLost(payload) => ServerEvent::PacketLost(id, payload)\n\n })\n\n }\n\n}\n\n\n","file_path":"src/server.rs","rank":17,"score":56302.8420664489},{"content":"#[derive(Debug)]\n\nstruct SentPacketAck {\n\n seq: u32,\n\n time: Instant,\n\n state: PacketState,\n\n packet: Option<Vec<u8>>\n\n}\n\n\n\n/// Enum indicating the state of a connection.\n\n#[derive(Debug, Copy, Clone, PartialEq)]\n\npub enum ConnectionState {\n\n\n\n /// The connection has been opened but has yet to receive the first\n\n /// incoming packet.\n\n Connecting,\n\n\n\n /// The remote has responded and at least one incoming packet has been\n\n /// received.\n\n Connected,\n\n\n\n /// The remote did not respond with the first packet within the maximum\n","file_path":"src/shared/connection.rs","rank":18,"score":55608.853697523904},{"content":"/// Trait describing optional per-packet payload modification logic.\n\npub trait PacketModifier {\n\n\n\n /// Method that constructs a new packet modifier using the provided configuration.\n\n fn new(Config) -> Self where Self: Sized;\n\n\n\n /// Method that is called for payload modification before a packet is send\n\n /// over a connection's underlying socket.\n\n ///\n\n /// The default implementation does not actually perform any kind of\n\n /// modification and leaves the payload to be send untouched.\n\n fn outgoing(&mut self, _: &[u8]) -> Option<Vec<u8>> {\n\n None\n\n }\n\n\n\n /// Method that is called for payload modification purposes after a packet\n\n /// is received over a connection's underlying socket.\n\n ///\n\n /// The default implementation does not actually perform any kind of\n\n /// modification and returns leaves received payload untouched.\n\n fn incoming(&mut self, _: &[u8]) -> Option<Vec<u8>> {\n","file_path":"src/traits/packet_modifier.rs","rank":19,"score":51354.170321264835},{"content":"/// Trait describing a non-blocking low latency socket.\n\npub trait Socket: fmt::Debug {\n\n\n\n /// Method that tries to bind a new socket at the specified address.\n\n fn new<T: net::ToSocketAddrs>(T, usize) -> Result<Self, Error> where Self: Sized;\n\n\n\n /// Method that attempts to return a incoming packet on this socket without\n\n /// blocking.\n\n fn try_recv(&mut self) -> Result<(net::SocketAddr, Vec<u8>), TryRecvError>;\n\n\n\n /// Method sending data on the socket to the given address. On success,\n\n /// returns the number of bytes written.\n\n fn send_to(\n\n &mut self, data: &[u8], addr: net::SocketAddr)\n\n\n\n -> Result<usize, Error>;\n\n\n\n /// Method returning the address of the actual, underlying socket.\n\n fn local_addr(&self) -> Result<net::SocketAddr, Error>;\n\n\n\n}\n\n\n","file_path":"src/traits/socket.rs","rank":20,"score":47074.14265211287},{"content":"fn main() {\n\n\n\n // Create a new server that communicates over a udp socket\n\n let mut server = Server::<\n\n UdpSocket,\n\n BinaryRateLimiter,\n\n NoopPacketModifier\n\n\n\n >::new(Config::default());\n\n\n\n // Make the server listen on port `1234` on all interfaces.\n\n println!(\"[Server] Listening...\");\n\n server.listen(\"0.0.0.0:1234\").expect(\"Failed to bind to socket.\");\n\n\n\n 'main: loop {\n\n\n\n // Accept incoming connections and fetch their events\n\n while let Ok(event) = server.accept_receive() {\n\n // Handle events (e.g. Connection, Messages, etc.)\n\n match event {\n","file_path":"examples/server.rs","rank":21,"score":44898.4193240092},{"content":"fn main() {\n\n\n\n // Create a new client that communicates over a udp socket\n\n let mut client = Client::<\n\n UdpSocket,\n\n BinaryRateLimiter,\n\n NoopPacketModifier\n\n\n\n >::new(Config::default());\n\n\n\n // Make the client connect to port `1234` on `localhost`\n\n println!(\"[Client] Connecting...\");\n\n client.connect(\"127.0.0.1:1234\").expect(\"Failed to bind to socket.\");\n\n\n\n 'main: loop {\n\n\n\n // Accept incoming connections and fetch their events\n\n while let Ok(event) = client.receive() {\n\n // Handle events (e.g. Connection, Messages, etc.)\n\n match event {\n","file_path":"examples/client.rs","rank":22,"score":44898.4193240092},{"content":"fn client_events(client: &mut Client<MockSocket, BinaryRateLimiter, NoopPacketModifier>) -> Vec<ClientEvent> {\n\n client.send(false).ok();\n\n let mut events = Vec::new();\n\n while let Ok(event) = client.receive() {\n\n events.push(event);\n\n }\n\n events\n\n}\n\n\n","file_path":"src/test/client.rs","rank":23,"score":43871.428356658726},{"content":"// Helpers --------------------------------------------------------------------\n\nfn server_events(server: &mut Server<MockSocket, BinaryRateLimiter, NoopPacketModifier>) -> Vec<ServerEvent> {\n\n server.send(false).ok();\n\n let mut events = Vec::new();\n\n while let Ok(event) = server.accept_receive() {\n\n events.push(event);\n\n }\n\n events\n\n}\n\n\n","file_path":"src/test/server.rs","rank":24,"score":43871.428356658726},{"content":"#[test]\n\nfn test_create() {\n\n\n\n let mut conn = create_connection(None);\n\n assert_eq!(conn.open(), true);\n\n assert_eq!(conn.congested(), false);\n\n assert!(conn.state() == ConnectionState::Connecting);\n\n assert_eq!(conn.rtt(), 0);\n\n assert_f32_eq!(conn.packet_loss(), 0.0);\n\n\n\n let local_address: SocketAddr = \"127.0.0.1:1234\".parse().unwrap();\n\n let peer_address: SocketAddr = \"255.1.1.2:5678\".parse().unwrap();\n\n\n\n assert_eq!(conn.local_addr(), local_address);\n\n assert_eq!(conn.peer_addr(), peer_address);\n\n assert_eq!(conn.events().len(), 0);\n\n\n\n}\n\n\n","file_path":"src/test/connection.rs","rank":25,"score":42107.73290617343},{"content":"#[test]\n\nfn test_reset() {\n\n let mut conn = create_connection(None);\n\n conn.close();\n\n assert!(conn.state() == ConnectionState::Closing);\n\n\n\n conn.reset();\n\n assert_eq!(conn.open(), true);\n\n assert!(conn.state() == ConnectionState::Connecting);\n\n}\n\n\n","file_path":"src/test/connection.rs","rank":26,"score":42107.73290617343},{"content":"#[test]\n\nfn test_send_failure() {\n\n\n\n let mut conn = create_connection(None);\n\n let mut socket = MockSocket::new(conn.local_addr(), 0).unwrap();\n\n let address = conn.peer_addr();\n\n\n\n conn.send_packet(&mut socket, &address);\n\n socket.assert_sent(vec![\n\n (\"255.1.1.2:5678\", [\n\n 1, 2, 3, 4,\n\n (conn.id().0 >> 24) as u8,\n\n (conn.id().0 >> 16) as u8,\n\n (conn.id().0 >> 8) as u8,\n\n conn.id().0 as u8,\n\n 0,\n\n 0,\n\n 0, 0, 0, 0\n\n ].to_vec())\n\n ]);\n\n\n","file_path":"src/test/connection.rs","rank":27,"score":40884.90179687059},{"content":"#[test]\n\nfn test_receive_packet() {\n\n\n\n let mut conn = create_connection(None);\n\n\n\n assert_eq!(conn.receive_packet([\n\n 1, 2, 3, 4,\n\n 0, 0, 0, 0, // ConnectionID is ignored by receive_packet)\n\n 0, // local sequence number\n\n 0, // remote sequence number we confirm\n\n 0, 0, 0, 0\n\n\n\n ].to_vec()), true);\n\n\n\n // Ignore message with same sequence number\n\n assert_eq!(conn.receive_packet([\n\n 1, 2, 3, 4,\n\n 0, 0, 0, 0, // ConnectionID is ignored by receive_packet)\n\n 0, // local sequence number\n\n 0, // remote sequence number we confirm\n\n 0, 0, 0, 0\n","file_path":"src/test/connection.rs","rank":28,"score":40884.90179687059},{"content":"#[test]\n\nfn test_debug_fmt() {\n\n let mut conn = create_connection(None);\n\n let mut socket = MockSocket::new(conn.local_addr(), 0).unwrap();\n\n let address = conn.peer_addr();\n\n conn.send_packet(&mut socket, &address);\n\n assert_ne!(format!(\"{:?}\", conn), \"\");\n\n}\n\n\n\n\n","file_path":"src/test/connection.rs","rank":29,"score":40884.90179687059},{"content":"#[test]\n\nfn test_client_internals() {\n\n\n\n let mut client = Client::<MockSocket, BinaryRateLimiter, NoopPacketModifier>::new(Config {\n\n send_rate: 30,\n\n .. Config::default()\n\n });\n\n\n\n assert_eq!(client.socket().unwrap_err().kind(), ErrorKind::NotConnected);\n\n\n\n}\n\n\n","file_path":"src/test/client.rs","rank":30,"score":40884.90179687059},{"content":"#[test]\n\nfn test_server_internals() {\n\n\n\n let mut server = Server::<MockSocket, BinaryRateLimiter, NoopPacketModifier>::new(Config {\n\n send_rate: 30,\n\n .. Config::default()\n\n });\n\n\n\n assert_eq!(server.socket().unwrap_err().kind(), ErrorKind::NotConnected);\n\n\n\n}\n\n\n","file_path":"src/test/server.rs","rank":31,"score":40884.90179687059},{"content":"#[test]\n\nfn test_client_configuration() {\n\n\n\n let config = Config {\n\n send_rate: 30,\n\n .. Config::default()\n\n };\n\n\n\n let mut client = Client::<MockSocket, BinaryRateLimiter, NoopPacketModifier>::new(config);\n\n assert_eq!(client.config(), config);\n\n\n\n let config = Config {\n\n send_rate: 60,\n\n .. Config::default()\n\n };\n\n\n\n client.set_config(config);\n\n assert_eq!(client.config(), config);\n\n\n\n}\n\n\n","file_path":"src/test/client.rs","rank":32,"score":40884.90179687059},{"content":"#[test]\n\nfn test_close_remote() {\n\n\n\n let mut conn = create_connection(None);\n\n assert!(conn.state() == ConnectionState::Connecting);\n\n\n\n // Receive initial packet\n\n conn.receive_packet([\n\n 1, 2, 3, 4,\n\n 0, 0, 0, 0, // ConnectionID is ignored by receive_packet)\n\n 0, // local sequence number\n\n 0, // remote sequence number we confirm\n\n 0, 0, 0, 0 // bitfield\n\n\n\n ].to_vec());\n\n\n\n assert!(conn.state() == ConnectionState::Connected);\n\n\n\n let events: Vec<ConnectionEvent> = conn.events().collect();\n\n assert_eq!(events, vec![ConnectionEvent::Connected]);\n\n\n","file_path":"src/test/connection.rs","rank":33,"score":40884.90179687059},{"content":"#[test]\n\nfn test_close_local() {\n\n\n\n let mut conn = create_connection(None);\n\n let mut socket = MockSocket::new(conn.local_addr(), 0).unwrap();\n\n let address = conn.peer_addr();\n\n\n\n // Initiate closure\n\n conn.close();\n\n assert_eq!(conn.open(), true);\n\n assert!(conn.state() == ConnectionState::Closing);\n\n\n\n // Receival of packets should have no effect on the connection state\n\n conn.receive_packet([\n\n 1, 2, 3, 4,\n\n 0, 0, 0, 0, // ConnectionID is ignored by receive_packet)\n\n 0, // local sequence number\n\n 0, // remote sequence number we confirm\n\n 0, 0, 0, 0 // bitfield\n\n\n\n ].to_vec());\n","file_path":"src/test/connection.rs","rank":34,"score":40884.90179687059},{"content":"#[test]\n\nfn test_server_disconnected() {\n\n\n\n let conn_id = ConnectionID(0);\n\n\n\n let mut server = Server::<MockSocket, BinaryRateLimiter, NoopPacketModifier>::new(Config {\n\n send_rate: 30,\n\n .. Config::default()\n\n });\n\n\n\n assert_eq!(server.bytes_sent(), 0);\n\n assert_eq!(server.bytes_received(), 0);\n\n\n\n assert_eq!(server.local_addr().unwrap_err().kind(), ErrorKind::AddrNotAvailable);\n\n assert_eq!(server.connection(&conn_id).unwrap_err().kind(), ErrorKind::NotConnected);\n\n assert_eq!(server.connections().len(), 0);\n\n\n\n assert_eq!(server.accept_receive(), Err(TryRecvError::Disconnected));\n\n assert_eq!(server.send(false).unwrap_err().kind(), ErrorKind::NotConnected);\n\n assert_eq!(server.shutdown().unwrap_err().kind(), ErrorKind::NotConnected);\n\n\n\n}\n\n\n","file_path":"src/test/server.rs","rank":35,"score":40884.90179687059},{"content":"#[test]\n\nfn test_client_disconnected() {\n\n\n\n let mut client = Client::<MockSocket, BinaryRateLimiter, NoopPacketModifier>::new(Config {\n\n send_rate: 30,\n\n .. Config::default()\n\n });\n\n\n\n assert_eq!(client.bytes_sent(), 0);\n\n assert_eq!(client.bytes_received(), 0);\n\n\n\n assert_eq!(client.peer_addr().unwrap_err().kind(), ErrorKind::AddrNotAvailable);\n\n assert_eq!(client.local_addr().unwrap_err().kind(), ErrorKind::AddrNotAvailable);\n\n assert_eq!(client.connection().unwrap_err().kind(), ErrorKind::NotConnected);\n\n\n\n assert_eq!(client.receive(), Err(TryRecvError::Disconnected));\n\n assert_eq!(client.send(false).unwrap_err().kind(), ErrorKind::NotConnected);\n\n assert_eq!(client.reset().unwrap_err().kind(), ErrorKind::NotConnected);\n\n assert_eq!(client.disconnect().unwrap_err().kind(), ErrorKind::NotConnected);\n\n\n\n}\n\n\n","file_path":"src/test/client.rs","rank":36,"score":40884.90179687059},{"content":"fn write_messages(\n\n queue: &mut VecDeque<Message>,\n\n packet: &mut Vec<u8>,\n\n available: usize,\n\n written: &mut usize\n\n) {\n\n let mut used = 0;\n\n while write_message(queue, packet, available, &mut used) {}\n\n *written += used;\n\n}\n\n\n","file_path":"src/shared/message_queue.rs","rank":37,"score":40884.90179687059},{"content":"#[test]\n\nfn test_server_receive() {\n\n\n\n let mut server = Server::<MockSocket, BinaryRateLimiter, NoopPacketModifier>::new(Config::default());\n\n server.listen(\"127.0.0.1:1234\").ok();\n\n\n\n // Accept incoming connections\n\n server.socket().unwrap().mock_receive(vec![\n\n (\"255.1.1.1:1000\", vec![\n\n 1, 2, 3, 4,\n\n 9, 8, 7, 6,\n\n 0,\n\n 0,\n\n 0, 0, 0, 0,\n\n 0, 0, 0, 3, 66, 97, 122\n\n ]),\n\n (\"255.1.1.2:2000\", vec![\n\n 1, 2, 3, 4,\n\n 5, 5, 1, 1,\n\n 0,\n\n 0,\n","file_path":"src/test/server.rs","rank":38,"score":40884.90179687059},{"content":"#[test]\n\nfn test_id_from_packet() {\n\n\n\n let config = Config {\n\n protocol_header: [1, 3, 3, 7],\n\n .. Config::default()\n\n };\n\n\n\n // Extract ID from matching protocol header\n\n assert_eq!(Connection::<BinaryRateLimiter, NoopPacketModifier>::id_from_packet(\n\n &config,\n\n &[1, 3, 3, 7, 1, 2, 3, 4]\n\n\n\n ), Some(ConnectionID(16909060)));\n\n\n\n // Ignore ID from non-matching protocol header\n\n assert_eq!(Connection::<BinaryRateLimiter, NoopPacketModifier>::id_from_packet(\n\n &config,\n\n &[9, 0, 0, 0, 1, 2, 3, 4]\n\n\n\n ), None);\n","file_path":"src/test/connection.rs","rank":39,"score":40884.90179687059},{"content":"#[test]\n\nfn test_server_configuration() {\n\n\n\n let config = Config {\n\n send_rate: 30,\n\n .. Config::default()\n\n };\n\n\n\n let mut server = Server::<MockSocket, BinaryRateLimiter, NoopPacketModifier>::new(config);\n\n assert_eq!(server.config(), config);\n\n\n\n let config = Config {\n\n send_rate: 60,\n\n .. Config::default()\n\n };\n\n\n\n server.set_config(config);\n\n assert_eq!(server.config(), config);\n\n\n\n}\n\n\n","file_path":"src/test/server.rs","rank":40,"score":40884.90179687059},{"content":"#[test]\n\nfn test_packet_loss() {\n\n\n\n let config = Config {\n\n // set a low threshold for packet loss\n\n packet_drop_threshold: Duration::from_millis(10),\n\n .. Config::default()\n\n };\n\n\n\n let mut conn = create_connection(Some(config));\n\n let mut socket = MockSocket::new(conn.local_addr(), 0).unwrap();\n\n let address = conn.peer_addr();\n\n\n\n conn.send(MessageKind::Instant, b\"Packet Instant\".to_vec());\n\n conn.send(MessageKind::Reliable, b\"Packet Reliable\".to_vec());\n\n conn.send(MessageKind::Ordered, b\"Packet Ordered\".to_vec());\n\n\n\n conn.send_packet(&mut socket, &address);\n\n socket.assert_sent(vec![\n\n (\"255.1.1.2:5678\", [\n\n 1, 2, 3, 4,\n","file_path":"src/test/connection.rs","rank":41,"score":40884.90179687059},{"content":"#[test]\n\nfn test_client_send() {\n\n\n\n let mut client = client_init(Config {\n\n connection_drop_threshold: Duration::from_millis(100),\n\n .. Config::default()\n\n });\n\n\n\n assert_eq!(client.bytes_sent(), 14);\n\n\n\n // Mock the receival of the first server packet which acknowledges the client\n\n let id = client.connection().unwrap().id().0;\n\n client.socket().unwrap().mock_receive(vec![\n\n (\"255.1.1.1:5678\", vec![\n\n 1, 2, 3, 4,\n\n (id >> 24) as u8,\n\n (id >> 16) as u8,\n\n (id >> 8) as u8,\n\n id as u8,\n\n 0,\n\n 0,\n","file_path":"src/test/client.rs","rank":42,"score":40884.90179687059},{"content":"#[test]\n\nfn test_server_send() {\n\n\n\n let mut server = Server::<MockSocket, BinaryRateLimiter, NoopPacketModifier>::new(Config::default());\n\n server.listen(\"127.0.0.1:1234\").ok();\n\n\n\n // Accept a incoming connection\n\n server.socket().unwrap().mock_receive(vec![\n\n (\"255.1.1.1:1000\", vec![\n\n 1, 2, 3, 4,\n\n 9, 8, 7, 6,\n\n 0,\n\n 0,\n\n 0, 0, 0, 0\n\n ])\n\n ]);\n\n\n\n assert_eq!(server_events(&mut server), vec![\n\n ServerEvent::Connection(ConnectionID(151521030))\n\n ]);\n\n\n","file_path":"src/test/server.rs","rank":43,"score":40884.90179687059},{"content":"#[test]\n\nfn test_reset() {\n\n\n\n let mut q = MessageQueue::new(Config::default());\n\n q.send(MessageKind::Instant, b\"Hello World\".to_vec());\n\n q.send(MessageKind::Instant, b\"Hello World\".to_vec());\n\n q.send(MessageKind::Reliable, b\"Hello World\".to_vec());\n\n q.send(MessageKind::Ordered, b\"Hello World\".to_vec());\n\n q.send(MessageKind::Ordered, b\"Hello World\".to_vec());\n\n\n\n // Reset all queues and order ids\n\n q.reset();\n\n\n\n // Check that nothing gets serialized\n\n let mut buffer = Vec::new();\n\n q.send_packet(&mut buffer, 64);\n\n assert_eq!(buffer, [].to_vec());\n\n\n\n // Check that local_order_id has been reset\n\n q.send(MessageKind::Ordered, b\"\".to_vec());\n\n q.send_packet(&mut buffer, 64);\n\n assert_eq!(buffer, [2, 0, 0, 0].to_vec());\n\n}\n\n\n","file_path":"src/test/message_queue.rs","rank":44,"score":40884.90179687059},{"content":"#[test]\n\nfn test_connecting_failed() {\n\n\n\n let mut conn = create_connection(None);\n\n let mut socket = MockSocket::new(conn.local_addr(), 0).unwrap();\n\n let address = conn.peer_addr();\n\n\n\n thread::sleep(Duration::from_millis(500));\n\n conn.send_packet(&mut socket, &address);\n\n\n\n let events: Vec<ConnectionEvent> = conn.events().collect();\n\n assert_eq!(events, vec![ConnectionEvent::FailedToConnect]);\n\n\n\n // Ignore any further packets\n\n conn.receive_packet([\n\n 1, 2, 3, 4,\n\n 0, 0, 0, 0,\n\n 0, 128, 85, 85, 85, 85 // closure packet data\n\n\n\n ].to_vec());\n\n\n\n let events: Vec<ConnectionEvent> = conn.events().collect();\n\n assert_eq!(events, vec![]);\n\n\n\n}\n\n\n","file_path":"src/test/connection.rs","rank":45,"score":40884.90179687059},{"content":"#[test]\n\nfn test_client_receive() {\n\n\n\n let mut client = client_init(Config {\n\n connection_drop_threshold: Duration::from_millis(100),\n\n .. Config::default()\n\n });\n\n\n\n let id = client.connection().unwrap().id().0;\n\n client.socket().unwrap().mock_receive(vec![\n\n (\"255.1.1.1:5678\", vec![\n\n 1, 2, 3, 4,\n\n (id >> 24) as u8,\n\n (id >> 16) as u8,\n\n (id >> 8) as u8,\n\n id as u8,\n\n 0,\n\n 0,\n\n 0, 0, 0, 0,\n\n 1, 0, 0, 3, 70, 111, 111,\n\n 0, 0, 0, 3, 66, 97, 114\n","file_path":"src/test/client.rs","rank":46,"score":40884.90179687059},{"content":"#[test]\n\nfn test_server_connection() {\n\n\n\n let mut server = Server::<MockSocket, BinaryRateLimiter, NoopPacketModifier>::new(Config::default());\n\n server.listen(\"127.0.0.1:1234\").ok();\n\n\n\n // Accept a incoming connection\n\n server.socket().unwrap().mock_receive(vec![\n\n (\"255.1.1.1:1000\", vec![\n\n 1, 2, 3, 4,\n\n 9, 8, 7, 6,\n\n 0,\n\n 0,\n\n 0, 0, 0, 0\n\n ])\n\n ]);\n\n\n\n assert_eq!(server_events(&mut server), vec![\n\n ServerEvent::Connection(ConnectionID(151521030))\n\n ]);\n\n\n","file_path":"src/test/server.rs","rank":47,"score":40884.90179687059},{"content":"fn write_message(\n\n queue: &mut VecDeque<Message>,\n\n packet: &mut Vec<u8>,\n\n available: usize,\n\n written: &mut usize\n\n\n\n) -> bool {\n\n\n\n if queue.is_empty() {\n\n false\n\n\n\n } else {\n\n\n\n let required = {\n\n (queue.front().unwrap().size as usize) + MESSAGE_HEADER_BYTES\n\n };\n\n\n\n // If adding this message would exceed the available bytes, exit\n\n if required > available - *written {\n\n false\n","file_path":"src/shared/message_queue.rs","rank":48,"score":40884.90179687059},{"content":"#[test]\n\nfn test_packet_modification() {\n\n\n\n #[derive(Debug, Copy, Clone)]\n\n struct TestPacketModifier;\n\n\n\n impl PacketModifier for TestPacketModifier {\n\n\n\n fn new(_: Config) -> TestPacketModifier {\n\n TestPacketModifier\n\n }\n\n\n\n fn outgoing(&mut self, data: &[u8]) -> Option<Vec<u8>> {\n\n\n\n assert_eq!([\n\n 0, 0, 0, 3, 70, 111, 111, // Foo\n\n 0, 0, 0, 3, 66, 97, 114 // Bar\n\n ].to_vec(), data);\n\n\n\n // Remove messages\n\n Some(Vec::new())\n","file_path":"src/test/connection.rs","rank":49,"score":40884.90179687059},{"content":"#[test]\n\nfn test_client_reset_events() {\n\n\n\n let mut client = client_init(Config {\n\n .. Config::default()\n\n });\n\n\n\n let id = client.connection().unwrap().id().0;\n\n client.socket().unwrap().mock_receive(vec![\n\n (\"255.1.1.1:5678\", vec![\n\n 1, 2, 3, 4,\n\n (id >> 24) as u8,\n\n (id >> 16) as u8,\n\n (id >> 8) as u8,\n\n id as u8,\n\n 0,\n\n 0,\n\n 0, 0, 0, 0\n\n ])\n\n ]);\n\n\n","file_path":"src/test/client.rs","rank":50,"score":39758.8705694476},{"content":"#[test]\n\nfn test_receive_empty() {\n\n\n\n let mut q = MessageQueue::new(Config::default());\n\n\n\n // Receive 2 empty messages\n\n q.receive_packet(&[\n\n 0, 0, 0, 0,\n\n 0, 0, 0, 0\n\n ]);\n\n\n\n assert_eq!(messages(&mut q), [b\"\", b\"\"]);\n\n\n\n}\n\n\n","file_path":"src/test/message_queue.rs","rank":51,"score":39758.8705694476},{"content":"#[test]\n\nfn test_send_and_receive_messages() {\n\n\n\n let mut conn = create_connection(None);\n\n let mut socket = MockSocket::new(conn.local_addr(), 0).unwrap();\n\n let address = conn.peer_addr();\n\n\n\n // Test Message Sending\n\n conn.send(MessageKind::Instant, b\"Foo\".to_vec());\n\n conn.send(MessageKind::Instant, b\"Bar\".to_vec());\n\n conn.send(MessageKind::Reliable, b\"Test\".to_vec());\n\n conn.send(MessageKind::Ordered, b\"Hello\".to_vec());\n\n conn.send(MessageKind::Ordered, b\"World\".to_vec());\n\n\n\n conn.send_packet(&mut socket, &address);\n\n socket.assert_sent(vec![\n\n (\"255.1.1.2:5678\", [\n\n 1, 2, 3, 4,\n\n (conn.id().0 >> 24) as u8,\n\n (conn.id().0 >> 16) as u8,\n\n (conn.id().0 >> 8) as u8,\n","file_path":"src/test/connection.rs","rank":52,"score":39758.8705694476},{"content":"#[test]\n\nfn test_client_close_by_local() {\n\n\n\n let mut client = client_init(Config::default());\n\n let id = client.connection().unwrap().id().0;\n\n client.socket().unwrap().mock_receive(vec![\n\n (\"255.1.1.1:5678\", vec![\n\n 1, 2, 3, 4,\n\n (id >> 24) as u8,\n\n (id >> 16) as u8,\n\n (id >> 8) as u8,\n\n id as u8,\n\n 0,\n\n 0,\n\n 0, 0, 0, 0\n\n ])\n\n ]);\n\n\n\n assert_eq!(client_events(&mut client), vec![\n\n ClientEvent::Connection\n\n ]);\n","file_path":"src/test/client.rs","rank":53,"score":39758.8705694476},{"content":"#[test]\n\nfn test_client_without_connection() {\n\n\n\n let mut client = Client::<MockSocket, BinaryRateLimiter, NoopPacketModifier>::new(Config::default());\n\n\n\n assert!(client.connect(\"255.1.1.1:5678\").is_ok());\n\n\n\n assert_eq!(client.receive(), Err(TryRecvError::Empty));\n\n\n\n assert!(client.send(false).is_ok());\n\n\n\n assert!(client.disconnect().is_ok());\n\n\n\n}\n\n\n","file_path":"src/test/client.rs","rank":54,"score":39758.8705694476},{"content":"#[test]\n\nfn test_client_close_by_remote() {\n\n\n\n let mut client = client_init(Config::default());\n\n let id = client.connection().unwrap().id().0;\n\n client.socket().unwrap().mock_receive(vec![\n\n (\"255.1.1.1:5678\", vec![\n\n 1, 2, 3, 4,\n\n (id >> 24) as u8,\n\n (id >> 16) as u8,\n\n (id >> 8) as u8,\n\n id as u8,\n\n 0,\n\n 0,\n\n 0, 0, 0, 0\n\n ])\n\n ]);\n\n\n\n assert_eq!(client_events(&mut client), vec![\n\n ClientEvent::Connection\n\n ]);\n","file_path":"src/test/client.rs","rank":55,"score":39758.8705694476},{"content":"#[test]\n\nfn test_out_of_order_duplicates() {\n\n\n\n let mut q = MessageQueue::new(Config::default());\n\n\n\n q.receive_packet(&[\n\n 2, 0, 0, 1, 53, // Expected #1\n\n 2, 2, 0, 1, 54, // Expected #3\n\n 2, 2, 0, 1, 55,\n\n 2, 2, 0, 1, 56,\n\n 2, 1, 0, 1, 57, // Expected #2\n\n 2, 4, 0, 1, 58, // Expected #5\n\n 2, 3, 0, 1, 59 // Expected #4\n\n ]);\n\n\n\n assert_eq!(messages(&mut q), [[53], [57], [54], [59], [58]]);\n\n\n\n}\n\n\n","file_path":"src/test/message_queue.rs","rank":56,"score":39758.8705694476},{"content":"#[test]\n\nfn test_send_and_receive_packet() {\n\n\n\n let mut conn = create_connection(None);\n\n let mut socket = MockSocket::new(conn.local_addr(), 0).unwrap();\n\n let address = conn.peer_addr();\n\n\n\n // Test Initial Packet\n\n conn.send_packet(&mut socket, &address);\n\n socket.assert_sent(vec![(\"255.1.1.2:5678\", [\n\n // protocol id\n\n 1, 2, 3, 4,\n\n\n\n // connection id\n\n (conn.id().0 >> 24) as u8,\n\n (conn.id().0 >> 16) as u8,\n\n (conn.id().0 >> 8) as u8,\n\n conn.id().0 as u8,\n\n\n\n 0, // local sequence number\n\n 0, // remote sequence number\n","file_path":"src/test/connection.rs","rank":57,"score":39758.8705694476},{"content":"#[test]\n\nfn test_server_reset_events() {\n\n\n\n let mut server = Server::<MockSocket, BinaryRateLimiter, NoopPacketModifier>::new(Config::default());\n\n server.listen(\"127.0.0.1:1234\").ok();\n\n\n\n // Accept a incoming connection\n\n server.socket().unwrap().mock_receive(vec![\n\n (\"255.1.1.1:1000\", vec![\n\n 1, 2, 3, 4,\n\n 9, 8, 7, 6,\n\n 0,\n\n 0,\n\n 0, 0, 0, 0\n\n ])\n\n ]);\n\n\n\n // Fetch events from the connections\n\n server.accept_receive().ok();\n\n server.send(false).ok();\n\n\n\n // Shutdown should clear events\n\n server.shutdown().ok();\n\n\n\n // Re-bind and make events accesible again\n\n server.listen(\"127.0.0.1:1234\").ok();\n\n assert!(server_events(&mut server).is_empty());\n\n\n\n}\n\n\n","file_path":"src/test/server.rs","rank":58,"score":39758.8705694476},{"content":"#[test]\n\nfn test_receive_invalid() {\n\n\n\n let mut q = MessageQueue::new(Config::default());\n\n\n\n // Receive a message with a invalid kind\n\n q.receive_packet(&[\n\n 255, 0, 0, 0\n\n ]);\n\n\n\n assert!(messages(&mut q).is_empty());\n\n\n\n // Receive a message with incomplete header\n\n q.receive_packet(&[\n\n 0, 0\n\n ]);\n\n\n\n q.receive_packet(&[\n\n 0, 0, 0\n\n ]);\n\n\n\n // Receive a message with incomplete data\n\n q.receive_packet(&[\n\n 0, 0, 0, 15, 72, 101, 108, 108, 111 // 15 bytes but only 5 in buffer\n\n ]);\n\n\n\n assert_eq!(messages(&mut q), [b\"Hello\"]);\n\n\n\n}\n\n\n","file_path":"src/test/message_queue.rs","rank":59,"score":39758.8705694476},{"content":"#[test]\n\nfn test_receive_read() {\n\n\n\n let mut q = MessageQueue::new(Config::default());\n\n let packet = [\n\n // Hello World\n\n 0, 0, 0, 11, 72, 101, 108, 108, 111, 32, 87, 111, 114, 108, 100,\n\n // Hello World\n\n 0, 0, 0, 11, 72, 101, 108, 108, 111, 32, 87, 111, 114, 108, 100,\n\n // Foo\n\n 1, 0, 0, 3, 70, 111, 111,\n\n // Bar\n\n 2, 0, 0, 3, 66, 97, 114,\n\n // Hello World\n\n 0, 0, 0, 11, 72, 101, 108, 108, 111, 32, 87, 111, 114, 108, 100\n\n ].to_vec();\n\n\n\n q.receive_packet(&packet[..]);\n\n\n\n assert_eq!(messages(&mut q), [\n\n b\"Hello World\".to_vec(),\n\n b\"Hello World\".to_vec(),\n\n b\"Foo\".to_vec(),\n\n b\"Bar\".to_vec(),\n\n b\"Hello World\".to_vec()\n\n ]);\n\n\n\n}\n\n\n","file_path":"src/test/message_queue.rs","rank":60,"score":39758.8705694476},{"content":"#[test]\n\nfn test_receive_invalid_packets() {\n\n\n\n let mut conn = create_connection(None);\n\n\n\n // Empty packet\n\n conn.receive_packet([].to_vec());\n\n\n\n // Garbage packet\n\n conn.receive_packet([\n\n 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14\n\n\n\n ].to_vec());\n\n\n\n}\n\n\n","file_path":"src/test/connection.rs","rank":61,"score":39758.8705694476},{"content":"#[test]\n\nfn test_server_connection_loss() {\n\n\n\n let mut server = Server::<MockSocket, BinaryRateLimiter, NoopPacketModifier>::new(Config {\n\n connection_drop_threshold: Duration::from_millis(100),\n\n .. Config::default()\n\n });\n\n server.listen(\"127.0.0.1:1234\").ok();\n\n\n\n // Accept a incoming connection\n\n server.socket().unwrap().mock_receive(vec![\n\n (\"255.1.1.1:1000\", vec![\n\n 1, 2, 3, 4,\n\n 9, 8, 7, 6,\n\n 0,\n\n 0,\n\n 0, 0, 0, 0\n\n ])\n\n ]);\n\n\n\n assert_eq!(server_events(&mut server), vec![\n","file_path":"src/test/server.rs","rank":62,"score":39758.8705694476},{"content":"#[test]\n\nfn test_client_connection_failure() {\n\n\n\n let mut client = client_init(Config {\n\n connection_init_threshold: Duration::from_millis(100),\n\n .. Config::default()\n\n });\n\n\n\n // Let the connection attempt time out\n\n thread::sleep(Duration::from_millis(200));\n\n\n\n let events = client_events(&mut client);\n\n assert_eq!(events, vec![ClientEvent::ConnectionFailed]);\n\n\n\n client.send(false).ok();\n\n client.send(false).ok();\n\n\n\n // We expect no additional packets to be send once the connection failed\n\n client.socket().unwrap().assert_sent_none();\n\n\n\n}\n\n\n","file_path":"src/test/client.rs","rank":63,"score":39758.8705694476},{"content":"#[test]\n\nfn test_debug_fmt() {\n\n\n\n let mut q = MessageQueue::new(Config::default());\n\n q.send(MessageKind::Instant, b\"Hello World\".to_vec());\n\n\n\n // Check debug fmt support\n\n assert_ne!(format!(\"{:?}\", q), \"\");\n\n\n\n}\n\n\n","file_path":"src/test/message_queue.rs","rank":64,"score":39758.8705694476},{"content":"#[test]\n\nfn test_in_order_duplicates() {\n\n\n\n let mut q = MessageQueue::new(Config::default());\n\n\n\n q.receive_packet(&[\n\n 2, 0, 0, 1, 53, // Expected #1\n\n 2, 1, 0, 1, 54, // Expected #2\n\n 2, 1, 0, 1, 55,\n\n 2, 1, 0, 1, 56,\n\n 2, 2, 0, 1, 57, // Expected #3\n\n 2, 2, 0, 1, 58,\n\n 2, 3, 0, 1, 59 // Expected #4\n\n ]);\n\n\n\n assert_eq!(messages(&mut q), [[53], [54], [57], [59]]);\n\n\n\n}\n\n\n","file_path":"src/test/message_queue.rs","rank":65,"score":39758.8705694476},{"content":"#[test]\n\nfn test_server_connection_close() {\n\n\n\n let mut server = Server::<MockSocket, BinaryRateLimiter, NoopPacketModifier>::new(Config::default());\n\n server.listen(\"127.0.0.1:1234\").ok();\n\n\n\n // Accept incoming connections\n\n server.socket().unwrap().mock_receive(vec![\n\n (\"255.1.1.1:1000\", vec![\n\n 1, 2, 3, 4,\n\n 9, 8, 7, 6,\n\n 0,\n\n 0,\n\n 0, 0, 0, 0\n\n ]),\n\n (\"255.1.1.2:2000\", vec![\n\n 1, 2, 3, 4,\n\n 5, 5, 1, 1,\n\n 0,\n\n 0,\n\n 0, 0, 0, 0\n","file_path":"src/test/server.rs","rank":66,"score":39758.8705694476},{"content":"#[test]\n\nfn test_server_listen_shutdown() {\n\n\n\n let mut server = Server::<MockSocket, BinaryRateLimiter, NoopPacketModifier>::new(Config::default());\n\n\n\n assert!(server.listen(\"127.0.0.1:1234\").is_ok());\n\n\n\n assert_eq!(server.listen(\"127.0.0.1:1234\").unwrap_err().kind(), ErrorKind::AlreadyExists);\n\n assert!(server.socket().is_ok());\n\n\n\n assert!(server.shutdown().is_ok());\n\n assert_eq!(server.socket().unwrap_err().kind(), ErrorKind::NotConnected);\n\n\n\n assert_eq!(server.shutdown().unwrap_err().kind(), ErrorKind::NotConnected);\n\n\n\n}\n\n\n","file_path":"src/test/server.rs","rank":67,"score":39758.8705694476},{"content":"#[test]\n\nfn test_send_write() {\n\n\n\n let mut q = MessageQueue::new(Config::default());\n\n\n\n // Filled from quota\n\n q.send(MessageKind::Instant, b\"Hello World\".to_vec());\n\n q.send(MessageKind::Instant, b\"Hello World\".to_vec());\n\n\n\n // Added by filling buffer\n\n q.send(MessageKind::Instant, b\"Hello World\".to_vec());\n\n\n\n // Put into packet 2\n\n q.send(MessageKind::Instant, b\"Hello World2\".to_vec());\n\n q.send(MessageKind::Instant, b\"Hello World2\".to_vec());\n\n\n\n // Filled from quota\n\n q.send(MessageKind::Reliable, b\"Foo\".to_vec());\n\n\n\n // Put into packet 2 by quota\n\n q.send(MessageKind::Reliable, b\"Foo2\".to_vec());\n","file_path":"src/test/message_queue.rs","rank":68,"score":39758.8705694476},{"content":"#[test]\n\nfn test_client_connection_success() {\n\n\n\n let mut client = client_init(Config {\n\n .. Config::default()\n\n });\n\n\n\n // Mock the receival of the first server packet which acknowledges the client\n\n let id = client.connection().unwrap().id().0;\n\n client.socket().unwrap().mock_receive(vec![\n\n (\"255.1.1.1:5678\", vec![\n\n 1, 2, 3, 4,\n\n (id >> 24) as u8,\n\n (id >> 16) as u8,\n\n (id >> 8) as u8,\n\n id as u8,\n\n 0,\n\n 0,\n\n 0, 0, 0, 0\n\n ])\n\n ]);\n","file_path":"src/test/client.rs","rank":69,"score":39758.8705694476},{"content":"#[test]\n\n#[cfg(target_os = \"linux\")]\n\nfn test_server_flush_auto_delay() {\n\n\n\n let mut server = Server::<MockSocket, BinaryRateLimiter, NoopPacketModifier>::new(Config::default());\n\n server.listen(\"127.0.0.1:1234\").ok();\n\n\n\n let start = Instant::now();\n\n for _ in 0..5 {\n\n server.accept_receive().ok();\n\n server.send(true).ok();\n\n }\n\n assert_millis_since!(start, 167, 33);\n\n\n\n}\n\n\n","file_path":"src/test/server.rs","rank":70,"score":38718.58275569182},{"content":"#[test]\n\nfn test_client_connect_reset_close() {\n\n\n\n let mut client = Client::<MockSocket, BinaryRateLimiter, NoopPacketModifier>::new(Config::default());\n\n\n\n assert!(client.connect(\"255.1.1.1:5678\").is_ok());\n\n\n\n assert_eq!(client.connect(\"255.1.1.1:5678\").unwrap_err().kind(), ErrorKind::AlreadyExists);\n\n assert!(client.socket().is_ok());\n\n\n\n assert!(client.reset().is_ok());\n\n assert!(client.socket().is_ok());\n\n\n\n assert!(client.disconnect().is_ok());\n\n assert_eq!(client.socket().unwrap_err().kind(), ErrorKind::NotConnected);\n\n\n\n assert_eq!(client.disconnect().unwrap_err().kind(), ErrorKind::NotConnected);\n\n assert_eq!(client.reset().unwrap_err().kind(), ErrorKind::NotConnected);\n\n\n\n}\n\n\n","file_path":"src/test/client.rs","rank":71,"score":38718.58275569182},{"content":"#[test]\n\nfn test_receive_read_long() {\n\n\n\n let mut q = MessageQueue::new(Config::default());\n\n let packet = [\n\n 0, 0, 1, 188, 76, 111, 114, 101, 109, 32, 105, 112, 115, 117, 109,\n\n 32, 100, 111, 108, 111, 114, 32, 115, 105, 116, 32, 97, 109, 101,\n\n 116, 44, 32, 99, 111, 110, 115, 101, 99, 116, 101, 116, 117, 114,\n\n 32, 97, 100, 105, 112, 105, 115, 99, 105, 110, 103, 32, 101, 108,\n\n 105, 116, 44, 32, 115, 101, 100, 32, 100, 111, 32, 101, 105, 117,\n\n 115, 109, 111, 100, 32, 116, 101, 109, 112, 111, 114, 32, 105, 110,\n\n 99, 105, 100, 105, 100, 117, 110, 116, 32, 117, 116, 32, 108, 97,\n\n 98, 111, 114, 101, 32, 101, 116, 32, 100, 111, 108, 111, 114, 101,\n\n 32, 109, 97, 103, 110, 97, 32, 97, 108, 105, 113, 117, 97, 46, 32,\n\n 85, 116, 32, 101, 110, 105, 109, 32, 97, 100, 32, 109, 105, 110,\n\n 105, 109, 32, 118, 101, 110, 105, 97, 109, 44, 32, 113, 117, 105,\n\n 115, 32, 110, 111, 115, 116, 114, 117, 100, 32, 101, 120, 101, 114,\n\n 99, 105, 116, 97, 116, 105, 111, 110, 32, 117, 108, 108, 97, 109,\n\n 99, 111, 32, 108, 97, 98, 111, 114, 105, 115, 32, 110, 105, 115,\n\n 105, 32, 117, 116, 32, 97, 108, 105, 113, 117, 105, 112, 32, 101,\n\n 120, 32, 101, 97, 32, 99, 111, 109, 109, 111, 100, 111, 32, 99,\n","file_path":"src/test/message_queue.rs","rank":72,"score":38718.58275569182},{"content":"#[test]\n\nfn test_packet_lost_write() {\n\n\n\n let mut q = MessageQueue::new(Config::default());\n\n\n\n q.lost_packet(&[\n\n // Hello World2\n\n 0, 0, 0, 12, 72, 101, 108, 108, 111, 32, 87, 111, 114, 108, 100, 50,\n\n // Hello World2\n\n 0, 0, 0, 12, 72, 101, 108, 108, 111, 32, 87, 111, 114, 108, 100, 50,\n\n // Foo2\n\n 1, 0, 0, 4, 70, 111, 111, 50,\n\n // Bar2\n\n 2, 1, 0, 4, 66, 97, 114, 50,\n\n // Foo More\n\n 1, 0, 0, 8, 70, 111, 111, 32, 77, 111, 114, 101\n\n ]);\n\n\n\n // Send some more messages\n\n q.send(MessageKind::Instant, b\"Hello World\".to_vec());\n\n q.send(MessageKind::Reliable, b\"Foo5\".to_vec());\n","file_path":"src/test/message_queue.rs","rank":73,"score":38718.58275569182},{"content":"#[test]\n\nfn test_receive_packet_ack_overflow() {\n\n\n\n let mut conn = create_connection(None);\n\n\n\n // Receive more packets than the ack queue can hold\n\n for i in 0..33 {\n\n conn.receive_packet([\n\n 1, 2, 3, 4,\n\n 0, 0, 0, 0,\n\n i,\n\n 0,\n\n 0, 0, 0, 0\n\n\n\n ].to_vec());\n\n }\n\n\n\n // Verify ack bit field\n\n let mut socket = MockSocket::new(conn.local_addr(), 0).unwrap();\n\n let address = conn.peer_addr();\n\n\n","file_path":"src/test/connection.rs","rank":74,"score":38718.58275569182},{"content":"#[test]\n\nfn test_send_sequence_wrap_around() {\n\n\n\n let mut conn = create_connection(None);\n\n let mut socket = MockSocket::new(conn.local_addr(), 0).unwrap();\n\n let address = conn.peer_addr();\n\n\n\n for i in 0..256 {\n\n\n\n conn.send_packet(&mut socket, &address);\n\n\n\n socket.assert_sent(vec![(\"255.1.1.2:5678\", [\n\n // protocol id\n\n 1, 2, 3, 4,\n\n\n\n // connection id\n\n (conn.id().0 >> 24) as u8,\n\n (conn.id().0 >> 16) as u8,\n\n (conn.id().0 >> 8) as u8,\n\n conn.id().0 as u8,\n\n\n","file_path":"src/test/connection.rs","rank":75,"score":38718.58275569182},{"content":"#[test]\n\n#[cfg(target_os = \"linux\")]\n\nfn test_server_auto_delay_with_load() {\n\n\n\n let mut server = Server::<MockSocket, BinaryRateLimiter, NoopPacketModifier>::new(Config::default());\n\n server.listen(\"127.0.0.1:1234\").ok();\n\n\n\n // Without load\n\n let start = Instant::now();\n\n for _ in 0..10 {\n\n server.accept_receive().ok();\n\n server.send(true).ok();\n\n }\n\n\n\n assert_millis_since!(start, 330, 16);\n\n\n\n // With load\n\n let start = Instant::now();\n\n for _ in 0..10 {\n\n server.accept_receive().ok();\n\n thread::sleep(Duration::from_millis(10));\n\n server.send(true).ok();\n","file_path":"src/test/server.rs","rank":76,"score":38718.58275569182},{"content":"#[test]\n\n#[cfg(target_os = \"linux\")]\n\nfn test_client_flush_auto_delay() {\n\n\n\n let mut client = Client::<MockSocket, BinaryRateLimiter, NoopPacketModifier>::new(Config::default());\n\n client.connect(\"255.1.1.1:5678\").ok();\n\n\n\n let start = Instant::now();\n\n for _ in 0..5 {\n\n client.receive().ok();\n\n client.send(true).ok();\n\n }\n\n assert_millis_since!(start, 167, 33);\n\n\n\n}\n\n\n","file_path":"src/test/client.rs","rank":77,"score":38718.58275569182},{"content":"#[test]\n\nfn test_client_flush_without_delay() {\n\n\n\n let mut client = Client::<MockSocket, BinaryRateLimiter, NoopPacketModifier>::new(Config::default());\n\n client.connect(\"255.1.1.1:5678\").ok();\n\n\n\n let start = Instant::now();\n\n for _ in 0..5 {\n\n client.receive().ok();\n\n client.send(false).ok();\n\n }\n\n assert_millis_since!(start, 0, 16);\n\n\n\n}\n\n\n","file_path":"src/test/client.rs","rank":78,"score":38718.58275569182},{"content":"#[test]\n\nfn test_server_flow_without_connections() {\n\n\n\n let mut server = Server::<MockSocket, BinaryRateLimiter, NoopPacketModifier>::new(Config::default());\n\n\n\n assert!(server.listen(\"127.0.0.1:1234\").is_ok());\n\n\n\n assert_eq!(server.accept_receive(), Err(TryRecvError::Empty));\n\n\n\n assert!(server.send(false).is_ok());\n\n\n\n assert!(server.shutdown().is_ok());\n\n\n\n}\n\n\n","file_path":"src/test/server.rs","rank":79,"score":38718.58275569182},{"content":"#[test]\n\nfn test_client_connection_loss_and_reconnect() {\n\n\n\n let mut client = client_init(Config {\n\n connection_drop_threshold: Duration::from_millis(100),\n\n .. Config::default()\n\n });\n\n\n\n // Mock the receival of the first server packet which acknowledges the client\n\n let id = client.connection().unwrap().id().0;\n\n client.socket().unwrap().mock_receive(vec![\n\n (\"255.1.1.1:5678\", vec![\n\n 1, 2, 3, 4,\n\n (id >> 24) as u8,\n\n (id >> 16) as u8,\n\n (id >> 8) as u8,\n\n id as u8,\n\n 0,\n\n 0,\n\n 0, 0, 0, 0\n\n ])\n","file_path":"src/test/client.rs","rank":80,"score":38718.58275569182},{"content":"#[test]\n\n#[cfg(target_os = \"linux\")]\n\nfn test_client_auto_delay_with_load() {\n\n\n\n let mut client = Client::<MockSocket, BinaryRateLimiter, NoopPacketModifier>::new(Config::default());\n\n client.connect(\"255.1.1.1:5678\").ok();\n\n\n\n // Without load\n\n let start = Instant::now();\n\n for _ in 0..10 {\n\n client.receive().ok();\n\n client.send(true).ok();\n\n }\n\n\n\n assert_millis_since!(start, 330, 16);\n\n\n\n // With load\n\n let start = Instant::now();\n\n for _ in 0..10 {\n\n client.receive().ok();\n\n thread::sleep(Duration::from_millis(10));\n\n client.send(true).ok();\n","file_path":"src/test/client.rs","rank":81,"score":38718.58275569182},{"content":"#[test]\n\nfn test_receive_read_out_of_order() {\n\n\n\n let mut q = MessageQueue::new(Config::default());\n\n\n\n // Receive one out of order(#1) \"World\" message\n\n q.receive_packet(&[\n\n 2, 1, 0, 5, 87, 111, 114, 108, 100\n\n ]);\n\n\n\n // We expect no message yet\n\n assert!(messages(&mut q).is_empty());\n\n\n\n // Receive one out of order(#3) \"order!\" message\n\n q.receive_packet(&[\n\n 2, 3, 0, 6, 111, 114, 100, 101, 114, 33\n\n ]);\n\n\n\n // We still expect no message yet\n\n assert!(messages(&mut q).is_empty());\n\n\n","file_path":"src/test/message_queue.rs","rank":82,"score":38718.58275569182},{"content":"#[test]\n\nfn test_send_write_long() {\n\n\n\n let msg = b\"Lorem ipsum dolor sit amet, consectetur adipiscing elit, sed do \\\n\n eiusmod tempor incididunt ut labore et dolore magna aliqua. \\\n\n Ut enim ad minim veniam, quis nostrud exercitation ullamco \\\n\n laboris nisi ut aliquip ex ea commodo consequat. Duis aute irure \\\n\n dolor in reprehenderit in voluptate velit esse cillum dolore eu \\\n\n fugiat nulla pariatur. Excepteur sint occaecat cupidatat non \\\n\n proident, sunt in culpa qui officia deserunt mollit anim id est \\\n\n laborum\";\n\n\n\n let mut q = MessageQueue::new(Config::default());\n\n q.send(MessageKind::Instant, msg.to_vec());\n\n\n\n let mut buffer = Vec::new();\n\n q.send_packet(&mut buffer, 1400);\n\n\n\n assert_eq!(buffer, [\n\n 0, 0, 1, 188, 76, 111, 114, 101, 109, 32, 105, 112, 115, 117, 109,\n\n 32, 100, 111, 108, 111, 114, 32, 115, 105, 116, 32, 97, 109, 101,\n","file_path":"src/test/message_queue.rs","rank":83,"score":38718.58275569182},{"content":"#[test]\n\nfn test_server_connection_address_remap() {\n\n\n\n let mut server = Server::<MockSocket, BinaryRateLimiter, NoopPacketModifier>::new(Config::default());\n\n server.listen(\"127.0.0.1:1234\").ok();\n\n\n\n // Accept a incoming connection\n\n server.socket().unwrap().mock_receive(vec![\n\n (\"255.1.1.1:1000\", vec![\n\n 1, 2, 3, 4,\n\n 9, 8, 7, 6,\n\n 0,\n\n 0,\n\n 0, 0, 0, 0\n\n ])\n\n ]);\n\n\n\n assert_eq!(server_events(&mut server), vec![\n\n ServerEvent::Connection(ConnectionID(151521030))\n\n ]);\n\n\n","file_path":"src/test/server.rs","rank":84,"score":38718.58275569182},{"content":"#[test]\n\nfn test_server_flush_without_delay() {\n\n\n\n let mut server = Server::<MockSocket, BinaryRateLimiter, NoopPacketModifier>::new(Config::default());\n\n server.listen(\"127.0.0.1:1234\").ok();\n\n\n\n let start = Instant::now();\n\n for _ in 0..5 {\n\n server.accept_receive().ok();\n\n server.send(false).ok();\n\n }\n\n assert_millis_since!(start, 0, 16);\n\n\n\n}\n\n\n","file_path":"src/test/server.rs","rank":85,"score":38718.58275569182},{"content":"#[test]\n\nfn test_client_connection_ignore_non_peer() {\n\n\n\n let mut client = client_init(Config {\n\n connection_init_threshold: Duration::from_millis(100),\n\n .. Config::default()\n\n });\n\n\n\n // We expect the client to ignore any packets from peers other than the\n\n // server it is connected to\n\n let id = client.connection().unwrap().id().0;\n\n client.socket().unwrap().mock_receive(vec![\n\n (\"255.1.1.1:5679\", vec![\n\n 1, 2, 3, 4,\n\n (id >> 24) as u8,\n\n (id >> 16) as u8,\n\n (id >> 8) as u8,\n\n id as u8,\n\n 0,\n\n 0,\n\n 0, 0, 0, 0\n\n ])\n\n ]);\n\n\n\n assert_eq!(client_events(&mut client), vec![]);\n\n\n\n}\n\n\n","file_path":"src/test/client.rs","rank":86,"score":37754.60395420192},{"content":"#[test]\n\nfn test_receive_ordered_decoding_wrap_around() {\n\n\n\n let mut q = MessageQueue::new(Config::default());\n\n for i in 0..4096 {\n\n\n\n q.receive_packet(&[\n\n 2 | ((i & 0x0F00) >> 4) as u8, (i as u8), 0, 2, (i >> 8) as u8, i as u8\n\n ]);\n\n\n\n assert_eq!(messages(&mut q), [[(i >> 8) as u8, i as u8]]);\n\n\n\n }\n\n\n\n // Should now expect order=0 again\n\n q.receive_packet(&[\n\n 2, 0, 0, 2, 0, 0\n\n ]);\n\n assert_eq!(messages(&mut q), [[0, 0]]);\n\n\n\n}\n\n\n","file_path":"src/test/message_queue.rs","rank":87,"score":36858.83489265856},{"content":"#[test]\n\nfn test_receive_ordered_encoding_wrap_around() {\n\n\n\n let mut q = MessageQueue::new(Config::default());\n\n for i in 0..4096 {\n\n\n\n q.send(MessageKind::Ordered, [(i >> 8) as u8, i as u8].to_vec());\n\n\n\n let mut buffer = Vec::new();\n\n q.send_packet(&mut buffer, 64);\n\n assert_eq!(buffer, [\n\n 2 | ((i & 0x0F00) >> 4) as u8, (i as u8), 0, 2, (i >> 8) as u8, i as u8].to_vec()\n\n );\n\n\n\n }\n\n\n\n // Should now write order=0 again\n\n q.send(MessageKind::Ordered, [0, 0].to_vec());\n\n\n\n let mut buffer = Vec::new();\n\n q.send_packet(&mut buffer, 64);\n\n assert_eq!(buffer, [2, 0, 0, 2, 0, 0].to_vec());\n\n\n\n}\n\n\n","file_path":"src/test/message_queue.rs","rank":88,"score":36858.83489265856},{"content":" /// Values must be in the range of `0.0` to `1.0` where `0.25` would be a\n\n /// quarter of the tick's sleep time.\n\n ///\n\n /// Example: For a `send_rate` of `30` with a maximum sleep time of `33.33`\n\n /// milliseconds, a `tick_overflow_recovery_rate` value of `0.5` would\n\n /// allow up to `16.66` milliseconds of sleep to be skipped.\n\n ///\n\n /// Values smaller than `0.0` or bigger than `1.0` will have no effect.\n\n ///\n\n /// Default is `1.0`.\n\n pub tick_overflow_recovery_rate: f32\n\n\n\n}\n\n\n\nimpl Default for Config {\n\n\n\n fn default() -> Config {\n\n Config {\n\n send_rate: 30,\n\n protocol_header: [1, 2, 3, 4],\n","file_path":"src/shared/config.rs","rank":89,"score":34049.100006275665},{"content":" /// Maximum time in milliseconds to wait for remote confirmation after\n\n /// programmatically closing a connection. Default is `150`.\n\n pub connection_closing_threshold: Duration,\n\n\n\n /// The percent of available packet bytes to use when serializing\n\n /// `MessageKind::Instant` into a packet via a `MessageQueue`.\n\n pub message_quota_instant: f32,\n\n\n\n /// The percent of available packet bytes to use when serializing\n\n /// `MessageKind::Reliable` into a packet via a `MessageQueue`.\n\n pub message_quota_reliable: f32,\n\n\n\n /// The percent of available packet bytes to use when serializing\n\n /// `MessageKind::Ordered` into a packet via a `MessageQueue`.\n\n pub message_quota_ordered: f32,\n\n\n\n /// Whether to keep track of ticks which exceed their maximum running time\n\n /// and speed up successive ticks in order to keep the desired target\n\n /// `send_rate` stable.\n\n ///\n","file_path":"src/shared/config.rs","rank":90,"score":34046.59921402105},{"content":" /// Each tick has a limit of the number of milliseconds in can take before\n\n /// the `send_rate` drops below the specified ticks per second\n\n /// target (`1000 / send_rate` milliseconds). Ticks which fall below this\n\n /// threshold will normally sleep for the remaining amount of time.\n\n ///\n\n /// Ticks which exceed this threshold will normally cause the `send_rate`\n\n /// to drop below the target; however, with `tick_overflow_recovery`\n\n /// enabled any tick which falls below the threshold will give up some of\n\n /// its remaining sleep time in order to allow the `send_rate` to catch up\n\n /// again.\n\n ///\n\n /// How much of each tick's sleep time is used for speedup purposes is\n\n /// determined by the value of `tick_overflow_recovery`.\n\n ///\n\n /// Default is `true`.\n\n pub tick_overflow_recovery: bool,\n\n\n\n /// Determines how much of each tick's sleep time may be used to reduce the\n\n /// current tick overflow time in order to smooth out the `send_rate`.\n\n ///\n","file_path":"src/shared/config.rs","rank":91,"score":34042.94708190082},{"content":"// Copyright (c) 2015-2017 Ivo Wetzel\n\n\n\n// Licensed under the Apache License, Version 2.0 <LICENSE-APACHE or\n\n// http://www.apache.org/licenses/LICENSE-2.0> or the MIT license\n\n// <LICENSE-MIT or http://opensource.org/licenses/MIT>, at your\n\n// option. This file may not be copied, modified, or distributed\n\n// except according to those terms.\n\n\n\n\n\n// STD Dependencies -----------------------------------------------------------\n\nuse std::time::Duration;\n\n\n\n\n\n/// Structure defining connection and message configuration options.\n\n#[derive(Copy, Clone, Debug, PartialEq)]\n\npub struct Config {\n\n\n\n /// Number of packets send per second. Default is `30`.\n\n pub send_rate: u64,\n\n\n","file_path":"src/shared/config.rs","rank":92,"score":34041.098278179554},{"content":" packet_max_size: 1400,\n\n packet_drop_threshold: Duration::from_millis(1000),\n\n connection_init_threshold: Duration::from_millis(100),\n\n connection_drop_threshold: Duration::from_millis(1000),\n\n connection_closing_threshold: Duration::from_millis(150),\n\n message_quota_instant: 60.0,\n\n message_quota_reliable: 20.0,\n\n message_quota_ordered: 20.0,\n\n tick_overflow_recovery: true,\n\n tick_overflow_recovery_rate: 1.0\n\n }\n\n }\n\n\n\n}\n\n\n","file_path":"src/shared/config.rs","rank":93,"score":34038.90829515442},{"content":" /// Maximum bytes that can be received / send in one packet. Default\n\n /// `1400`.\n\n pub packet_max_size: usize,\n\n\n\n /// 32-Bit Protocol ID used to identify UDP related packets. Default is\n\n /// `[1, 2, 3, 4]`.\n\n pub protocol_header: [u8; 4],\n\n\n\n /// Maximum roundtrip-time in milliseconds before a packet is considered\n\n /// lost. Default is `1000`.\n\n pub packet_drop_threshold: Duration,\n\n\n\n /// Maximum time in milliseconds until the first packet must be received\n\n /// before a connection attempt fails. Default is `100`.\n\n pub connection_init_threshold: Duration,\n\n\n\n /// Maximum time in milliseconds between any two packets before the\n\n /// connection gets dropped. Default is `1000`.\n\n pub connection_drop_threshold: Duration,\n\n\n","file_path":"src/shared/config.rs","rank":94,"score":34036.4653740223},{"content":"// Static Helpers -------------------------------------------------------------\n\nfn order_is_more_recent(a: u16, b: u16) -> bool {\n\n (a > b) && (a - b <= MAX_ORDER_ID / 2)\n\n || (b > a) && (b - a > MAX_ORDER_ID / 2)\n\n}\n\n\n","file_path":"src/shared/message_queue.rs","rank":95,"score":32805.181867537656},{"content":"fn messages_from_packet(packet: &[u8]) -> Vec<Message> {\n\n\n\n let available = packet.len();\n\n let mut index = 0;\n\n let mut messages = Vec::new();\n\n\n\n // Consume as long as message headers can be present\n\n while index < available && available - index >= MESSAGE_HEADER_BYTES {\n\n\n\n // Upper 4 bits of kind are bits 9..11 of order\n\n let order_high = ((packet[index] & 0xF0) as u16) << 4;\n\n let order_low = packet[index + 1] as u16;\n\n\n\n // Byte 2 is the size\n\n let size_high = (packet[index + 2] as u16) << 8;\n\n let size = size_high | packet[index + 3] as u16;\n\n\n\n // Lower 4 bits of byte 0 are the MessageKind\n\n let kind = match packet[index] & 0x0F {\n\n 0 => Some(MessageKind::Instant),\n","file_path":"src/shared/message_queue.rs","rank":96,"score":32556.855098173364},{"content":"// Copyright (c) 2015-2017 Ivo Wetzel\n\n\n\n// Licensed under the Apache License, Version 2.0 <LICENSE-APACHE or\n\n// http://www.apache.org/licenses/LICENSE-2.0> or the MIT license\n\n// <LICENSE-MIT or http://opensource.org/licenses/MIT>, at your\n\n// option. This file may not be copied, modified, or distributed\n\n// except according to those terms.\n\n\n\n// STD Dependencies -----------------------------------------------------------\n\nuse std::fmt;\n\n\n\n\n\n// Internal Dependencies ------------------------------------------------------\n\nuse super::super::Config;\n\n\n\n\n\n/// Trait describing a network congestion avoidance algorithm.\n","file_path":"src/traits/rate_limiter.rs","rank":97,"score":32313.664604644215}],"string":"[\n {\n \"content\": \"fn create_connection(config: Option<Config>) -> Connection<BinaryRateLimiter, NoopPacketModifier> {\\n\\n create_connection_with_modifier::<NoopPacketModifier>(config)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/test/connection.rs\",\n \"rank\": 3,\n \"score\": 102625.29645147541\n },\n {\n \"content\": \"// Helpers --------------------------------------------------------------------\\n\\nfn client_init(config: Config) -> Client<MockSocket, BinaryRateLimiter, NoopPacketModifier> {\\n\\n\\n\\n let mut client = Client::<MockSocket, BinaryRateLimiter, NoopPacketModifier>::new(config);\\n\\n client.connect(\\\"255.1.1.1:5678\\\").ok();\\n\\n\\n\\n // Verify initial connection packet\\n\\n let id = client.connection().unwrap().id().0;\\n\\n client.send(false).ok();\\n\\n client.socket().unwrap().assert_sent(vec![\\n\\n (\\\"255.1.1.1:5678\\\", [\\n\\n 1, 2, 3, 4,\\n\\n (id >> 24) as u8,\\n\\n (id >> 16) as u8,\\n\\n (id >> 8) as u8,\\n\\n id as u8,\\n\\n 0,\\n\\n 0,\\n\\n 0, 0, 0, 0\\n\\n\\n\\n ].to_vec())\\n\\n ]);\\n\\n\\n\\n client\\n\\n\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/test/client.rs\",\n \"rank\": 4,\n \"score\": 100712.6361914995\n },\n {\n \"content\": \"fn seq_bit_index(seq: u32, ack: u32) -> u32 {\\n\\n if seq > ack {\\n\\n ack + (MAX_SEQ_NUMBER - 1 - seq)\\n\\n\\n\\n } else {\\n\\n ack - 1 - seq\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/shared/connection.rs\",\n \"rank\": 5,\n \"score\": 98706.87740606512\n },\n {\n \"content\": \"#[test]\\n\\nfn test_rtt_tick_correction() {\\n\\n\\n\\n let mut conn = create_connection(None);\\n\\n let mut socket = MockSocket::new(conn.local_addr(), 0).unwrap();\\n\\n let address = conn.peer_addr();\\n\\n\\n\\n assert_eq!(conn.rtt(), 0);\\n\\n\\n\\n // First packet\\n\\n conn.send_packet(&mut socket, &address);\\n\\n socket.assert_sent(vec![\\n\\n (\\\"255.1.1.2:5678\\\", [\\n\\n 1, 2, 3, 4,\\n\\n (conn.id().0 >> 24) as u8,\\n\\n (conn.id().0 >> 16) as u8,\\n\\n (conn.id().0 >> 8) as u8,\\n\\n conn.id().0 as u8,\\n\\n 0,\\n\\n 0,\\n\\n 0, 0, 0, 0\\n\",\n \"file_path\": \"src/test/connection.rs\",\n \"rank\": 6,\n \"score\": 97307.07521407463\n },\n {\n \"content\": \"// Helpers --------------------------------------------------------------------\\n\\nfn create_connection_with_modifier<T: PacketModifier>(config: Option<Config>) -> Connection<BinaryRateLimiter, T> {\\n\\n let config = config.unwrap_or_else(Config::default);\\n\\n let local_address: SocketAddr = \\\"127.0.0.1:1234\\\".parse().unwrap();\\n\\n let peer_address: SocketAddr = \\\"255.1.1.2:5678\\\".parse().unwrap();\\n\\n let limiter = BinaryRateLimiter::new(config);\\n\\n let modifier = T::new(config);\\n\\n Connection::new(config, local_address, peer_address, limiter, modifier)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/test/connection.rs\",\n \"rank\": 7,\n \"score\": 95820.29030890358\n },\n {\n \"content\": \"// Static Helpers -------------------------------------------------------------\\n\\nfn moving_average(a: f32, b: Duration) -> f32 {\\n\\n let b = (b.as_secs() as f32) * 1000.0 + (b.subsec_nanos() / 1000000) as f32;\\n\\n (a - (a - b) * 0.10).max(0.0)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/shared/connection.rs\",\n \"rank\": 8,\n \"score\": 94380.18914139559\n },\n {\n \"content\": \"fn seq_is_more_recent(a: u32, b: u32) -> bool {\\n\\n (a > b) && (a - b <= MAX_SEQ_NUMBER / 2) ||\\n\\n (b > a) && (b - a > MAX_SEQ_NUMBER / 2)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/shared/connection.rs\",\n \"rank\": 9,\n \"score\": 94218.3853669351\n },\n {\n \"content\": \"fn seq_was_acked(seq: u32, ack: u32, bitfield: u32) -> bool {\\n\\n if seq == ack {\\n\\n true\\n\\n\\n\\n } else {\\n\\n let bit = seq_bit_index(seq, ack);\\n\\n bit < MAX_ACK_BITS && (bitfield & (1 << bit)) != 0\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/shared/connection.rs\",\n \"rank\": 10,\n \"score\": 93795.16225558077\n },\n {\n \"content\": \"/// Trait describing a network congestion avoidance algorithm.\\n\\npub trait RateLimiter {\\n\\n\\n\\n /// Method that constructs a new rate limiter using the provided configuration.\\n\\n fn new(Config) -> Self where Self: Sized;\\n\\n\\n\\n /// Method implementing a congestion avoidance algorithm based on round\\n\\n /// trip time and packet loss.\\n\\n fn update(&mut self, rtt: u32, packet_loss: f32);\\n\\n\\n\\n /// Method that should return `true` in case the connection is currently\\n\\n /// considered congested and should reduce the number of packets it sends\\n\\n /// per second.\\n\\n fn congested(&self) -> bool;\\n\\n\\n\\n /// Method that returns whether a connection should be currently sending\\n\\n /// packets or not.\\n\\n fn should_send(&self) -> bool;\\n\\n\\n\\n /// Method that resets any internal state of the rate limiter.\\n\\n fn reset(&mut self);\\n\\n\\n\\n}\\n\\n\\n\\nimpl fmt::Debug for RateLimiter {\\n\\n fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {\\n\\n write!(f, \\\"RateLimiter\\\")\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/traits/rate_limiter.rs\",\n \"rank\": 11,\n \"score\": 89438.56064684934\n },\n {\n \"content\": \"// Helpers ---------------------------------------------------------------------\\n\\nfn nanos_from_duration(d: Duration) -> u64 {\\n\\n d.as_secs() * 1000 * 1000000 + d.subsec_nanos() as u64\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/shared/ticker.rs\",\n \"rank\": 12,\n \"score\": 83301.06662775556\n },\n {\n \"content\": \"#[test]\\n\\nfn test_rtt() {\\n\\n\\n\\n let mut conn = create_connection(None);\\n\\n let mut socket = MockSocket::new(conn.local_addr(), 0).unwrap();\\n\\n let address = conn.peer_addr();\\n\\n\\n\\n assert_eq!(conn.rtt(), 0);\\n\\n\\n\\n // First packet\\n\\n conn.send_packet(&mut socket, &address);\\n\\n socket.assert_sent(vec![\\n\\n (\\\"255.1.1.2:5678\\\", [\\n\\n 1, 2, 3, 4,\\n\\n (conn.id().0 >> 24) as u8,\\n\\n (conn.id().0 >> 16) as u8,\\n\\n (conn.id().0 >> 8) as u8,\\n\\n conn.id().0 as u8,\\n\\n 0,\\n\\n 0,\\n\\n 0, 0, 0, 0\\n\",\n \"file_path\": \"src/test/connection.rs\",\n \"rank\": 13,\n \"score\": 73346.28597060584\n },\n {\n \"content\": \"#[test]\\n\\nfn test_set_config() {\\n\\n // TODO how to check that the config was actually modified?\\n\\n let mut conn = create_connection(None);\\n\\n conn.set_config(Config {\\n\\n send_rate: 10,\\n\\n .. Config::default()\\n\\n });\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/test/connection.rs\",\n \"rank\": 14,\n \"score\": 70708.34476124767\n },\n {\n \"content\": \"#[derive(Debug, PartialEq)]\\n\\nenum PacketState {\\n\\n Unknown,\\n\\n Acked,\\n\\n Lost\\n\\n}\\n\\n\\n\\n/// Structure used for packet acknowledgment of sent packets.\\n\",\n \"file_path\": \"src/shared/connection.rs\",\n \"rank\": 15,\n \"score\": 56896.23789175875\n },\n {\n \"content\": \"#[derive(Debug, Eq, PartialEq)]\\n\\nstruct Message {\\n\\n kind: MessageKind,\\n\\n order: u16,\\n\\n size: u16,\\n\\n data: Vec<u8>\\n\\n}\\n\\n\\n\\nimpl Ord for Message {\\n\\n // Explicitly implement the trait so the queue becomes a min-heap\\n\\n // instead of a max-heap.\\n\\n fn cmp(&self, other: &Self) -> cmp::Ordering {\\n\\n other.order.cmp(&self.order)\\n\\n }\\n\\n}\\n\\n\\n\\nimpl PartialOrd for Message {\\n\\n fn partial_cmp(&self, other: &Self) -> Option<cmp::Ordering> {\\n\\n Some(self.cmp(other))\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/shared/message_queue.rs\",\n \"rank\": 16,\n \"score\": 56896.23789175875\n },\n {\n \"content\": \"// Helpers --------------------------------------------------------------------\\n\\nfn map_connection_events<R: RateLimiter, M: PacketModifier>(\\n\\n server_events: &mut VecDeque<ServerEvent>,\\n\\n connection: &mut Connection<R, M>\\n\\n) {\\n\\n let id = connection.id();\\n\\n for event in connection.events() {\\n\\n server_events.push_back(match event {\\n\\n ConnectionEvent::Connected => ServerEvent::Connection(id),\\n\\n ConnectionEvent::Lost(by_remote) => ServerEvent::ConnectionLost(id, by_remote),\\n\\n ConnectionEvent::FailedToConnect => unreachable!(),\\n\\n ConnectionEvent::Closed(by_remote) => ServerEvent::ConnectionClosed(id, by_remote),\\n\\n ConnectionEvent::Message(payload) => ServerEvent::Message(id, payload),\\n\\n ConnectionEvent::CongestionStateChanged(c) => ServerEvent::ConnectionCongestionStateChanged(id, c),\\n\\n ConnectionEvent::PacketLost(payload) => ServerEvent::PacketLost(id, payload)\\n\\n })\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/server.rs\",\n \"rank\": 17,\n \"score\": 56302.8420664489\n },\n {\n \"content\": \"#[derive(Debug)]\\n\\nstruct SentPacketAck {\\n\\n seq: u32,\\n\\n time: Instant,\\n\\n state: PacketState,\\n\\n packet: Option<Vec<u8>>\\n\\n}\\n\\n\\n\\n/// Enum indicating the state of a connection.\\n\\n#[derive(Debug, Copy, Clone, PartialEq)]\\n\\npub enum ConnectionState {\\n\\n\\n\\n /// The connection has been opened but has yet to receive the first\\n\\n /// incoming packet.\\n\\n Connecting,\\n\\n\\n\\n /// The remote has responded and at least one incoming packet has been\\n\\n /// received.\\n\\n Connected,\\n\\n\\n\\n /// The remote did not respond with the first packet within the maximum\\n\",\n \"file_path\": \"src/shared/connection.rs\",\n \"rank\": 18,\n \"score\": 55608.853697523904\n },\n {\n \"content\": \"/// Trait describing optional per-packet payload modification logic.\\n\\npub trait PacketModifier {\\n\\n\\n\\n /// Method that constructs a new packet modifier using the provided configuration.\\n\\n fn new(Config) -> Self where Self: Sized;\\n\\n\\n\\n /// Method that is called for payload modification before a packet is send\\n\\n /// over a connection's underlying socket.\\n\\n ///\\n\\n /// The default implementation does not actually perform any kind of\\n\\n /// modification and leaves the payload to be send untouched.\\n\\n fn outgoing(&mut self, _: &[u8]) -> Option<Vec<u8>> {\\n\\n None\\n\\n }\\n\\n\\n\\n /// Method that is called for payload modification purposes after a packet\\n\\n /// is received over a connection's underlying socket.\\n\\n ///\\n\\n /// The default implementation does not actually perform any kind of\\n\\n /// modification and returns leaves received payload untouched.\\n\\n fn incoming(&mut self, _: &[u8]) -> Option<Vec<u8>> {\\n\",\n \"file_path\": \"src/traits/packet_modifier.rs\",\n \"rank\": 19,\n \"score\": 51354.170321264835\n },\n {\n \"content\": \"/// Trait describing a non-blocking low latency socket.\\n\\npub trait Socket: fmt::Debug {\\n\\n\\n\\n /// Method that tries to bind a new socket at the specified address.\\n\\n fn new<T: net::ToSocketAddrs>(T, usize) -> Result<Self, Error> where Self: Sized;\\n\\n\\n\\n /// Method that attempts to return a incoming packet on this socket without\\n\\n /// blocking.\\n\\n fn try_recv(&mut self) -> Result<(net::SocketAddr, Vec<u8>), TryRecvError>;\\n\\n\\n\\n /// Method sending data on the socket to the given address. On success,\\n\\n /// returns the number of bytes written.\\n\\n fn send_to(\\n\\n &mut self, data: &[u8], addr: net::SocketAddr)\\n\\n\\n\\n -> Result<usize, Error>;\\n\\n\\n\\n /// Method returning the address of the actual, underlying socket.\\n\\n fn local_addr(&self) -> Result<net::SocketAddr, Error>;\\n\\n\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/traits/socket.rs\",\n \"rank\": 20,\n \"score\": 47074.14265211287\n },\n {\n \"content\": \"fn main() {\\n\\n\\n\\n // Create a new server that communicates over a udp socket\\n\\n let mut server = Server::<\\n\\n UdpSocket,\\n\\n BinaryRateLimiter,\\n\\n NoopPacketModifier\\n\\n\\n\\n >::new(Config::default());\\n\\n\\n\\n // Make the server listen on port `1234` on all interfaces.\\n\\n println!(\\\"[Server] Listening...\\\");\\n\\n server.listen(\\\"0.0.0.0:1234\\\").expect(\\\"Failed to bind to socket.\\\");\\n\\n\\n\\n 'main: loop {\\n\\n\\n\\n // Accept incoming connections and fetch their events\\n\\n while let Ok(event) = server.accept_receive() {\\n\\n // Handle events (e.g. Connection, Messages, etc.)\\n\\n match event {\\n\",\n \"file_path\": \"examples/server.rs\",\n \"rank\": 21,\n \"score\": 44898.4193240092\n },\n {\n \"content\": \"fn main() {\\n\\n\\n\\n // Create a new client that communicates over a udp socket\\n\\n let mut client = Client::<\\n\\n UdpSocket,\\n\\n BinaryRateLimiter,\\n\\n NoopPacketModifier\\n\\n\\n\\n >::new(Config::default());\\n\\n\\n\\n // Make the client connect to port `1234` on `localhost`\\n\\n println!(\\\"[Client] Connecting...\\\");\\n\\n client.connect(\\\"127.0.0.1:1234\\\").expect(\\\"Failed to bind to socket.\\\");\\n\\n\\n\\n 'main: loop {\\n\\n\\n\\n // Accept incoming connections and fetch their events\\n\\n while let Ok(event) = client.receive() {\\n\\n // Handle events (e.g. Connection, Messages, etc.)\\n\\n match event {\\n\",\n \"file_path\": \"examples/client.rs\",\n \"rank\": 22,\n \"score\": 44898.4193240092\n },\n {\n \"content\": \"fn client_events(client: &mut Client<MockSocket, BinaryRateLimiter, NoopPacketModifier>) -> Vec<ClientEvent> {\\n\\n client.send(false).ok();\\n\\n let mut events = Vec::new();\\n\\n while let Ok(event) = client.receive() {\\n\\n events.push(event);\\n\\n }\\n\\n events\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/test/client.rs\",\n \"rank\": 23,\n \"score\": 43871.428356658726\n },\n {\n \"content\": \"// Helpers --------------------------------------------------------------------\\n\\nfn server_events(server: &mut Server<MockSocket, BinaryRateLimiter, NoopPacketModifier>) -> Vec<ServerEvent> {\\n\\n server.send(false).ok();\\n\\n let mut events = Vec::new();\\n\\n while let Ok(event) = server.accept_receive() {\\n\\n events.push(event);\\n\\n }\\n\\n events\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/test/server.rs\",\n \"rank\": 24,\n \"score\": 43871.428356658726\n },\n {\n \"content\": \"#[test]\\n\\nfn test_create() {\\n\\n\\n\\n let mut conn = create_connection(None);\\n\\n assert_eq!(conn.open(), true);\\n\\n assert_eq!(conn.congested(), false);\\n\\n assert!(conn.state() == ConnectionState::Connecting);\\n\\n assert_eq!(conn.rtt(), 0);\\n\\n assert_f32_eq!(conn.packet_loss(), 0.0);\\n\\n\\n\\n let local_address: SocketAddr = \\\"127.0.0.1:1234\\\".parse().unwrap();\\n\\n let peer_address: SocketAddr = \\\"255.1.1.2:5678\\\".parse().unwrap();\\n\\n\\n\\n assert_eq!(conn.local_addr(), local_address);\\n\\n assert_eq!(conn.peer_addr(), peer_address);\\n\\n assert_eq!(conn.events().len(), 0);\\n\\n\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/test/connection.rs\",\n \"rank\": 25,\n \"score\": 42107.73290617343\n },\n {\n \"content\": \"#[test]\\n\\nfn test_reset() {\\n\\n let mut conn = create_connection(None);\\n\\n conn.close();\\n\\n assert!(conn.state() == ConnectionState::Closing);\\n\\n\\n\\n conn.reset();\\n\\n assert_eq!(conn.open(), true);\\n\\n assert!(conn.state() == ConnectionState::Connecting);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/test/connection.rs\",\n \"rank\": 26,\n \"score\": 42107.73290617343\n },\n {\n \"content\": \"#[test]\\n\\nfn test_send_failure() {\\n\\n\\n\\n let mut conn = create_connection(None);\\n\\n let mut socket = MockSocket::new(conn.local_addr(), 0).unwrap();\\n\\n let address = conn.peer_addr();\\n\\n\\n\\n conn.send_packet(&mut socket, &address);\\n\\n socket.assert_sent(vec![\\n\\n (\\\"255.1.1.2:5678\\\", [\\n\\n 1, 2, 3, 4,\\n\\n (conn.id().0 >> 24) as u8,\\n\\n (conn.id().0 >> 16) as u8,\\n\\n (conn.id().0 >> 8) as u8,\\n\\n conn.id().0 as u8,\\n\\n 0,\\n\\n 0,\\n\\n 0, 0, 0, 0\\n\\n ].to_vec())\\n\\n ]);\\n\\n\\n\",\n \"file_path\": \"src/test/connection.rs\",\n \"rank\": 27,\n \"score\": 40884.90179687059\n },\n {\n \"content\": \"#[test]\\n\\nfn test_receive_packet() {\\n\\n\\n\\n let mut conn = create_connection(None);\\n\\n\\n\\n assert_eq!(conn.receive_packet([\\n\\n 1, 2, 3, 4,\\n\\n 0, 0, 0, 0, // ConnectionID is ignored by receive_packet)\\n\\n 0, // local sequence number\\n\\n 0, // remote sequence number we confirm\\n\\n 0, 0, 0, 0\\n\\n\\n\\n ].to_vec()), true);\\n\\n\\n\\n // Ignore message with same sequence number\\n\\n assert_eq!(conn.receive_packet([\\n\\n 1, 2, 3, 4,\\n\\n 0, 0, 0, 0, // ConnectionID is ignored by receive_packet)\\n\\n 0, // local sequence number\\n\\n 0, // remote sequence number we confirm\\n\\n 0, 0, 0, 0\\n\",\n \"file_path\": \"src/test/connection.rs\",\n \"rank\": 28,\n \"score\": 40884.90179687059\n },\n {\n \"content\": \"#[test]\\n\\nfn test_debug_fmt() {\\n\\n let mut conn = create_connection(None);\\n\\n let mut socket = MockSocket::new(conn.local_addr(), 0).unwrap();\\n\\n let address = conn.peer_addr();\\n\\n conn.send_packet(&mut socket, &address);\\n\\n assert_ne!(format!(\\\"{:?}\\\", conn), \\\"\\\");\\n\\n}\\n\\n\\n\\n\\n\",\n \"file_path\": \"src/test/connection.rs\",\n \"rank\": 29,\n \"score\": 40884.90179687059\n },\n {\n \"content\": \"#[test]\\n\\nfn test_client_internals() {\\n\\n\\n\\n let mut client = Client::<MockSocket, BinaryRateLimiter, NoopPacketModifier>::new(Config {\\n\\n send_rate: 30,\\n\\n .. Config::default()\\n\\n });\\n\\n\\n\\n assert_eq!(client.socket().unwrap_err().kind(), ErrorKind::NotConnected);\\n\\n\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/test/client.rs\",\n \"rank\": 30,\n \"score\": 40884.90179687059\n },\n {\n \"content\": \"#[test]\\n\\nfn test_server_internals() {\\n\\n\\n\\n let mut server = Server::<MockSocket, BinaryRateLimiter, NoopPacketModifier>::new(Config {\\n\\n send_rate: 30,\\n\\n .. Config::default()\\n\\n });\\n\\n\\n\\n assert_eq!(server.socket().unwrap_err().kind(), ErrorKind::NotConnected);\\n\\n\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/test/server.rs\",\n \"rank\": 31,\n \"score\": 40884.90179687059\n },\n {\n \"content\": \"#[test]\\n\\nfn test_client_configuration() {\\n\\n\\n\\n let config = Config {\\n\\n send_rate: 30,\\n\\n .. Config::default()\\n\\n };\\n\\n\\n\\n let mut client = Client::<MockSocket, BinaryRateLimiter, NoopPacketModifier>::new(config);\\n\\n assert_eq!(client.config(), config);\\n\\n\\n\\n let config = Config {\\n\\n send_rate: 60,\\n\\n .. Config::default()\\n\\n };\\n\\n\\n\\n client.set_config(config);\\n\\n assert_eq!(client.config(), config);\\n\\n\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/test/client.rs\",\n \"rank\": 32,\n \"score\": 40884.90179687059\n },\n {\n \"content\": \"#[test]\\n\\nfn test_close_remote() {\\n\\n\\n\\n let mut conn = create_connection(None);\\n\\n assert!(conn.state() == ConnectionState::Connecting);\\n\\n\\n\\n // Receive initial packet\\n\\n conn.receive_packet([\\n\\n 1, 2, 3, 4,\\n\\n 0, 0, 0, 0, // ConnectionID is ignored by receive_packet)\\n\\n 0, // local sequence number\\n\\n 0, // remote sequence number we confirm\\n\\n 0, 0, 0, 0 // bitfield\\n\\n\\n\\n ].to_vec());\\n\\n\\n\\n assert!(conn.state() == ConnectionState::Connected);\\n\\n\\n\\n let events: Vec<ConnectionEvent> = conn.events().collect();\\n\\n assert_eq!(events, vec![ConnectionEvent::Connected]);\\n\\n\\n\",\n \"file_path\": \"src/test/connection.rs\",\n \"rank\": 33,\n \"score\": 40884.90179687059\n },\n {\n \"content\": \"#[test]\\n\\nfn test_close_local() {\\n\\n\\n\\n let mut conn = create_connection(None);\\n\\n let mut socket = MockSocket::new(conn.local_addr(), 0).unwrap();\\n\\n let address = conn.peer_addr();\\n\\n\\n\\n // Initiate closure\\n\\n conn.close();\\n\\n assert_eq!(conn.open(), true);\\n\\n assert!(conn.state() == ConnectionState::Closing);\\n\\n\\n\\n // Receival of packets should have no effect on the connection state\\n\\n conn.receive_packet([\\n\\n 1, 2, 3, 4,\\n\\n 0, 0, 0, 0, // ConnectionID is ignored by receive_packet)\\n\\n 0, // local sequence number\\n\\n 0, // remote sequence number we confirm\\n\\n 0, 0, 0, 0 // bitfield\\n\\n\\n\\n ].to_vec());\\n\",\n \"file_path\": \"src/test/connection.rs\",\n \"rank\": 34,\n \"score\": 40884.90179687059\n },\n {\n \"content\": \"#[test]\\n\\nfn test_server_disconnected() {\\n\\n\\n\\n let conn_id = ConnectionID(0);\\n\\n\\n\\n let mut server = Server::<MockSocket, BinaryRateLimiter, NoopPacketModifier>::new(Config {\\n\\n send_rate: 30,\\n\\n .. Config::default()\\n\\n });\\n\\n\\n\\n assert_eq!(server.bytes_sent(), 0);\\n\\n assert_eq!(server.bytes_received(), 0);\\n\\n\\n\\n assert_eq!(server.local_addr().unwrap_err().kind(), ErrorKind::AddrNotAvailable);\\n\\n assert_eq!(server.connection(&conn_id).unwrap_err().kind(), ErrorKind::NotConnected);\\n\\n assert_eq!(server.connections().len(), 0);\\n\\n\\n\\n assert_eq!(server.accept_receive(), Err(TryRecvError::Disconnected));\\n\\n assert_eq!(server.send(false).unwrap_err().kind(), ErrorKind::NotConnected);\\n\\n assert_eq!(server.shutdown().unwrap_err().kind(), ErrorKind::NotConnected);\\n\\n\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/test/server.rs\",\n \"rank\": 35,\n \"score\": 40884.90179687059\n },\n {\n \"content\": \"#[test]\\n\\nfn test_client_disconnected() {\\n\\n\\n\\n let mut client = Client::<MockSocket, BinaryRateLimiter, NoopPacketModifier>::new(Config {\\n\\n send_rate: 30,\\n\\n .. Config::default()\\n\\n });\\n\\n\\n\\n assert_eq!(client.bytes_sent(), 0);\\n\\n assert_eq!(client.bytes_received(), 0);\\n\\n\\n\\n assert_eq!(client.peer_addr().unwrap_err().kind(), ErrorKind::AddrNotAvailable);\\n\\n assert_eq!(client.local_addr().unwrap_err().kind(), ErrorKind::AddrNotAvailable);\\n\\n assert_eq!(client.connection().unwrap_err().kind(), ErrorKind::NotConnected);\\n\\n\\n\\n assert_eq!(client.receive(), Err(TryRecvError::Disconnected));\\n\\n assert_eq!(client.send(false).unwrap_err().kind(), ErrorKind::NotConnected);\\n\\n assert_eq!(client.reset().unwrap_err().kind(), ErrorKind::NotConnected);\\n\\n assert_eq!(client.disconnect().unwrap_err().kind(), ErrorKind::NotConnected);\\n\\n\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/test/client.rs\",\n \"rank\": 36,\n \"score\": 40884.90179687059\n },\n {\n \"content\": \"fn write_messages(\\n\\n queue: &mut VecDeque<Message>,\\n\\n packet: &mut Vec<u8>,\\n\\n available: usize,\\n\\n written: &mut usize\\n\\n) {\\n\\n let mut used = 0;\\n\\n while write_message(queue, packet, available, &mut used) {}\\n\\n *written += used;\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/shared/message_queue.rs\",\n \"rank\": 37,\n \"score\": 40884.90179687059\n },\n {\n \"content\": \"#[test]\\n\\nfn test_server_receive() {\\n\\n\\n\\n let mut server = Server::<MockSocket, BinaryRateLimiter, NoopPacketModifier>::new(Config::default());\\n\\n server.listen(\\\"127.0.0.1:1234\\\").ok();\\n\\n\\n\\n // Accept incoming connections\\n\\n server.socket().unwrap().mock_receive(vec![\\n\\n (\\\"255.1.1.1:1000\\\", vec![\\n\\n 1, 2, 3, 4,\\n\\n 9, 8, 7, 6,\\n\\n 0,\\n\\n 0,\\n\\n 0, 0, 0, 0,\\n\\n 0, 0, 0, 3, 66, 97, 122\\n\\n ]),\\n\\n (\\\"255.1.1.2:2000\\\", vec![\\n\\n 1, 2, 3, 4,\\n\\n 5, 5, 1, 1,\\n\\n 0,\\n\\n 0,\\n\",\n \"file_path\": \"src/test/server.rs\",\n \"rank\": 38,\n \"score\": 40884.90179687059\n },\n {\n \"content\": \"#[test]\\n\\nfn test_id_from_packet() {\\n\\n\\n\\n let config = Config {\\n\\n protocol_header: [1, 3, 3, 7],\\n\\n .. Config::default()\\n\\n };\\n\\n\\n\\n // Extract ID from matching protocol header\\n\\n assert_eq!(Connection::<BinaryRateLimiter, NoopPacketModifier>::id_from_packet(\\n\\n &config,\\n\\n &[1, 3, 3, 7, 1, 2, 3, 4]\\n\\n\\n\\n ), Some(ConnectionID(16909060)));\\n\\n\\n\\n // Ignore ID from non-matching protocol header\\n\\n assert_eq!(Connection::<BinaryRateLimiter, NoopPacketModifier>::id_from_packet(\\n\\n &config,\\n\\n &[9, 0, 0, 0, 1, 2, 3, 4]\\n\\n\\n\\n ), None);\\n\",\n \"file_path\": \"src/test/connection.rs\",\n \"rank\": 39,\n \"score\": 40884.90179687059\n },\n {\n \"content\": \"#[test]\\n\\nfn test_server_configuration() {\\n\\n\\n\\n let config = Config {\\n\\n send_rate: 30,\\n\\n .. Config::default()\\n\\n };\\n\\n\\n\\n let mut server = Server::<MockSocket, BinaryRateLimiter, NoopPacketModifier>::new(config);\\n\\n assert_eq!(server.config(), config);\\n\\n\\n\\n let config = Config {\\n\\n send_rate: 60,\\n\\n .. Config::default()\\n\\n };\\n\\n\\n\\n server.set_config(config);\\n\\n assert_eq!(server.config(), config);\\n\\n\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/test/server.rs\",\n \"rank\": 40,\n \"score\": 40884.90179687059\n },\n {\n \"content\": \"#[test]\\n\\nfn test_packet_loss() {\\n\\n\\n\\n let config = Config {\\n\\n // set a low threshold for packet loss\\n\\n packet_drop_threshold: Duration::from_millis(10),\\n\\n .. Config::default()\\n\\n };\\n\\n\\n\\n let mut conn = create_connection(Some(config));\\n\\n let mut socket = MockSocket::new(conn.local_addr(), 0).unwrap();\\n\\n let address = conn.peer_addr();\\n\\n\\n\\n conn.send(MessageKind::Instant, b\\\"Packet Instant\\\".to_vec());\\n\\n conn.send(MessageKind::Reliable, b\\\"Packet Reliable\\\".to_vec());\\n\\n conn.send(MessageKind::Ordered, b\\\"Packet Ordered\\\".to_vec());\\n\\n\\n\\n conn.send_packet(&mut socket, &address);\\n\\n socket.assert_sent(vec![\\n\\n (\\\"255.1.1.2:5678\\\", [\\n\\n 1, 2, 3, 4,\\n\",\n \"file_path\": \"src/test/connection.rs\",\n \"rank\": 41,\n \"score\": 40884.90179687059\n },\n {\n \"content\": \"#[test]\\n\\nfn test_client_send() {\\n\\n\\n\\n let mut client = client_init(Config {\\n\\n connection_drop_threshold: Duration::from_millis(100),\\n\\n .. Config::default()\\n\\n });\\n\\n\\n\\n assert_eq!(client.bytes_sent(), 14);\\n\\n\\n\\n // Mock the receival of the first server packet which acknowledges the client\\n\\n let id = client.connection().unwrap().id().0;\\n\\n client.socket().unwrap().mock_receive(vec![\\n\\n (\\\"255.1.1.1:5678\\\", vec![\\n\\n 1, 2, 3, 4,\\n\\n (id >> 24) as u8,\\n\\n (id >> 16) as u8,\\n\\n (id >> 8) as u8,\\n\\n id as u8,\\n\\n 0,\\n\\n 0,\\n\",\n \"file_path\": \"src/test/client.rs\",\n \"rank\": 42,\n \"score\": 40884.90179687059\n },\n {\n \"content\": \"#[test]\\n\\nfn test_server_send() {\\n\\n\\n\\n let mut server = Server::<MockSocket, BinaryRateLimiter, NoopPacketModifier>::new(Config::default());\\n\\n server.listen(\\\"127.0.0.1:1234\\\").ok();\\n\\n\\n\\n // Accept a incoming connection\\n\\n server.socket().unwrap().mock_receive(vec![\\n\\n (\\\"255.1.1.1:1000\\\", vec![\\n\\n 1, 2, 3, 4,\\n\\n 9, 8, 7, 6,\\n\\n 0,\\n\\n 0,\\n\\n 0, 0, 0, 0\\n\\n ])\\n\\n ]);\\n\\n\\n\\n assert_eq!(server_events(&mut server), vec![\\n\\n ServerEvent::Connection(ConnectionID(151521030))\\n\\n ]);\\n\\n\\n\",\n \"file_path\": \"src/test/server.rs\",\n \"rank\": 43,\n \"score\": 40884.90179687059\n },\n {\n \"content\": \"#[test]\\n\\nfn test_reset() {\\n\\n\\n\\n let mut q = MessageQueue::new(Config::default());\\n\\n q.send(MessageKind::Instant, b\\\"Hello World\\\".to_vec());\\n\\n q.send(MessageKind::Instant, b\\\"Hello World\\\".to_vec());\\n\\n q.send(MessageKind::Reliable, b\\\"Hello World\\\".to_vec());\\n\\n q.send(MessageKind::Ordered, b\\\"Hello World\\\".to_vec());\\n\\n q.send(MessageKind::Ordered, b\\\"Hello World\\\".to_vec());\\n\\n\\n\\n // Reset all queues and order ids\\n\\n q.reset();\\n\\n\\n\\n // Check that nothing gets serialized\\n\\n let mut buffer = Vec::new();\\n\\n q.send_packet(&mut buffer, 64);\\n\\n assert_eq!(buffer, [].to_vec());\\n\\n\\n\\n // Check that local_order_id has been reset\\n\\n q.send(MessageKind::Ordered, b\\\"\\\".to_vec());\\n\\n q.send_packet(&mut buffer, 64);\\n\\n assert_eq!(buffer, [2, 0, 0, 0].to_vec());\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/test/message_queue.rs\",\n \"rank\": 44,\n \"score\": 40884.90179687059\n },\n {\n \"content\": \"#[test]\\n\\nfn test_connecting_failed() {\\n\\n\\n\\n let mut conn = create_connection(None);\\n\\n let mut socket = MockSocket::new(conn.local_addr(), 0).unwrap();\\n\\n let address = conn.peer_addr();\\n\\n\\n\\n thread::sleep(Duration::from_millis(500));\\n\\n conn.send_packet(&mut socket, &address);\\n\\n\\n\\n let events: Vec<ConnectionEvent> = conn.events().collect();\\n\\n assert_eq!(events, vec![ConnectionEvent::FailedToConnect]);\\n\\n\\n\\n // Ignore any further packets\\n\\n conn.receive_packet([\\n\\n 1, 2, 3, 4,\\n\\n 0, 0, 0, 0,\\n\\n 0, 128, 85, 85, 85, 85 // closure packet data\\n\\n\\n\\n ].to_vec());\\n\\n\\n\\n let events: Vec<ConnectionEvent> = conn.events().collect();\\n\\n assert_eq!(events, vec![]);\\n\\n\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/test/connection.rs\",\n \"rank\": 45,\n \"score\": 40884.90179687059\n },\n {\n \"content\": \"#[test]\\n\\nfn test_client_receive() {\\n\\n\\n\\n let mut client = client_init(Config {\\n\\n connection_drop_threshold: Duration::from_millis(100),\\n\\n .. Config::default()\\n\\n });\\n\\n\\n\\n let id = client.connection().unwrap().id().0;\\n\\n client.socket().unwrap().mock_receive(vec![\\n\\n (\\\"255.1.1.1:5678\\\", vec![\\n\\n 1, 2, 3, 4,\\n\\n (id >> 24) as u8,\\n\\n (id >> 16) as u8,\\n\\n (id >> 8) as u8,\\n\\n id as u8,\\n\\n 0,\\n\\n 0,\\n\\n 0, 0, 0, 0,\\n\\n 1, 0, 0, 3, 70, 111, 111,\\n\\n 0, 0, 0, 3, 66, 97, 114\\n\",\n \"file_path\": \"src/test/client.rs\",\n \"rank\": 46,\n \"score\": 40884.90179687059\n },\n {\n \"content\": \"#[test]\\n\\nfn test_server_connection() {\\n\\n\\n\\n let mut server = Server::<MockSocket, BinaryRateLimiter, NoopPacketModifier>::new(Config::default());\\n\\n server.listen(\\\"127.0.0.1:1234\\\").ok();\\n\\n\\n\\n // Accept a incoming connection\\n\\n server.socket().unwrap().mock_receive(vec![\\n\\n (\\\"255.1.1.1:1000\\\", vec![\\n\\n 1, 2, 3, 4,\\n\\n 9, 8, 7, 6,\\n\\n 0,\\n\\n 0,\\n\\n 0, 0, 0, 0\\n\\n ])\\n\\n ]);\\n\\n\\n\\n assert_eq!(server_events(&mut server), vec![\\n\\n ServerEvent::Connection(ConnectionID(151521030))\\n\\n ]);\\n\\n\\n\",\n \"file_path\": \"src/test/server.rs\",\n \"rank\": 47,\n \"score\": 40884.90179687059\n },\n {\n \"content\": \"fn write_message(\\n\\n queue: &mut VecDeque<Message>,\\n\\n packet: &mut Vec<u8>,\\n\\n available: usize,\\n\\n written: &mut usize\\n\\n\\n\\n) -> bool {\\n\\n\\n\\n if queue.is_empty() {\\n\\n false\\n\\n\\n\\n } else {\\n\\n\\n\\n let required = {\\n\\n (queue.front().unwrap().size as usize) + MESSAGE_HEADER_BYTES\\n\\n };\\n\\n\\n\\n // If adding this message would exceed the available bytes, exit\\n\\n if required > available - *written {\\n\\n false\\n\",\n \"file_path\": \"src/shared/message_queue.rs\",\n \"rank\": 48,\n \"score\": 40884.90179687059\n },\n {\n \"content\": \"#[test]\\n\\nfn test_packet_modification() {\\n\\n\\n\\n #[derive(Debug, Copy, Clone)]\\n\\n struct TestPacketModifier;\\n\\n\\n\\n impl PacketModifier for TestPacketModifier {\\n\\n\\n\\n fn new(_: Config) -> TestPacketModifier {\\n\\n TestPacketModifier\\n\\n }\\n\\n\\n\\n fn outgoing(&mut self, data: &[u8]) -> Option<Vec<u8>> {\\n\\n\\n\\n assert_eq!([\\n\\n 0, 0, 0, 3, 70, 111, 111, // Foo\\n\\n 0, 0, 0, 3, 66, 97, 114 // Bar\\n\\n ].to_vec(), data);\\n\\n\\n\\n // Remove messages\\n\\n Some(Vec::new())\\n\",\n \"file_path\": \"src/test/connection.rs\",\n \"rank\": 49,\n \"score\": 40884.90179687059\n },\n {\n \"content\": \"#[test]\\n\\nfn test_client_reset_events() {\\n\\n\\n\\n let mut client = client_init(Config {\\n\\n .. Config::default()\\n\\n });\\n\\n\\n\\n let id = client.connection().unwrap().id().0;\\n\\n client.socket().unwrap().mock_receive(vec![\\n\\n (\\\"255.1.1.1:5678\\\", vec![\\n\\n 1, 2, 3, 4,\\n\\n (id >> 24) as u8,\\n\\n (id >> 16) as u8,\\n\\n (id >> 8) as u8,\\n\\n id as u8,\\n\\n 0,\\n\\n 0,\\n\\n 0, 0, 0, 0\\n\\n ])\\n\\n ]);\\n\\n\\n\",\n \"file_path\": \"src/test/client.rs\",\n \"rank\": 50,\n \"score\": 39758.8705694476\n },\n {\n \"content\": \"#[test]\\n\\nfn test_receive_empty() {\\n\\n\\n\\n let mut q = MessageQueue::new(Config::default());\\n\\n\\n\\n // Receive 2 empty messages\\n\\n q.receive_packet(&[\\n\\n 0, 0, 0, 0,\\n\\n 0, 0, 0, 0\\n\\n ]);\\n\\n\\n\\n assert_eq!(messages(&mut q), [b\\\"\\\", b\\\"\\\"]);\\n\\n\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/test/message_queue.rs\",\n \"rank\": 51,\n \"score\": 39758.8705694476\n },\n {\n \"content\": \"#[test]\\n\\nfn test_send_and_receive_messages() {\\n\\n\\n\\n let mut conn = create_connection(None);\\n\\n let mut socket = MockSocket::new(conn.local_addr(), 0).unwrap();\\n\\n let address = conn.peer_addr();\\n\\n\\n\\n // Test Message Sending\\n\\n conn.send(MessageKind::Instant, b\\\"Foo\\\".to_vec());\\n\\n conn.send(MessageKind::Instant, b\\\"Bar\\\".to_vec());\\n\\n conn.send(MessageKind::Reliable, b\\\"Test\\\".to_vec());\\n\\n conn.send(MessageKind::Ordered, b\\\"Hello\\\".to_vec());\\n\\n conn.send(MessageKind::Ordered, b\\\"World\\\".to_vec());\\n\\n\\n\\n conn.send_packet(&mut socket, &address);\\n\\n socket.assert_sent(vec![\\n\\n (\\\"255.1.1.2:5678\\\", [\\n\\n 1, 2, 3, 4,\\n\\n (conn.id().0 >> 24) as u8,\\n\\n (conn.id().0 >> 16) as u8,\\n\\n (conn.id().0 >> 8) as u8,\\n\",\n \"file_path\": \"src/test/connection.rs\",\n \"rank\": 52,\n \"score\": 39758.8705694476\n },\n {\n \"content\": \"#[test]\\n\\nfn test_client_close_by_local() {\\n\\n\\n\\n let mut client = client_init(Config::default());\\n\\n let id = client.connection().unwrap().id().0;\\n\\n client.socket().unwrap().mock_receive(vec![\\n\\n (\\\"255.1.1.1:5678\\\", vec![\\n\\n 1, 2, 3, 4,\\n\\n (id >> 24) as u8,\\n\\n (id >> 16) as u8,\\n\\n (id >> 8) as u8,\\n\\n id as u8,\\n\\n 0,\\n\\n 0,\\n\\n 0, 0, 0, 0\\n\\n ])\\n\\n ]);\\n\\n\\n\\n assert_eq!(client_events(&mut client), vec![\\n\\n ClientEvent::Connection\\n\\n ]);\\n\",\n \"file_path\": \"src/test/client.rs\",\n \"rank\": 53,\n \"score\": 39758.8705694476\n },\n {\n \"content\": \"#[test]\\n\\nfn test_client_without_connection() {\\n\\n\\n\\n let mut client = Client::<MockSocket, BinaryRateLimiter, NoopPacketModifier>::new(Config::default());\\n\\n\\n\\n assert!(client.connect(\\\"255.1.1.1:5678\\\").is_ok());\\n\\n\\n\\n assert_eq!(client.receive(), Err(TryRecvError::Empty));\\n\\n\\n\\n assert!(client.send(false).is_ok());\\n\\n\\n\\n assert!(client.disconnect().is_ok());\\n\\n\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/test/client.rs\",\n \"rank\": 54,\n \"score\": 39758.8705694476\n },\n {\n \"content\": \"#[test]\\n\\nfn test_client_close_by_remote() {\\n\\n\\n\\n let mut client = client_init(Config::default());\\n\\n let id = client.connection().unwrap().id().0;\\n\\n client.socket().unwrap().mock_receive(vec![\\n\\n (\\\"255.1.1.1:5678\\\", vec![\\n\\n 1, 2, 3, 4,\\n\\n (id >> 24) as u8,\\n\\n (id >> 16) as u8,\\n\\n (id >> 8) as u8,\\n\\n id as u8,\\n\\n 0,\\n\\n 0,\\n\\n 0, 0, 0, 0\\n\\n ])\\n\\n ]);\\n\\n\\n\\n assert_eq!(client_events(&mut client), vec![\\n\\n ClientEvent::Connection\\n\\n ]);\\n\",\n \"file_path\": \"src/test/client.rs\",\n \"rank\": 55,\n \"score\": 39758.8705694476\n },\n {\n \"content\": \"#[test]\\n\\nfn test_out_of_order_duplicates() {\\n\\n\\n\\n let mut q = MessageQueue::new(Config::default());\\n\\n\\n\\n q.receive_packet(&[\\n\\n 2, 0, 0, 1, 53, // Expected #1\\n\\n 2, 2, 0, 1, 54, // Expected #3\\n\\n 2, 2, 0, 1, 55,\\n\\n 2, 2, 0, 1, 56,\\n\\n 2, 1, 0, 1, 57, // Expected #2\\n\\n 2, 4, 0, 1, 58, // Expected #5\\n\\n 2, 3, 0, 1, 59 // Expected #4\\n\\n ]);\\n\\n\\n\\n assert_eq!(messages(&mut q), [[53], [57], [54], [59], [58]]);\\n\\n\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/test/message_queue.rs\",\n \"rank\": 56,\n \"score\": 39758.8705694476\n },\n {\n \"content\": \"#[test]\\n\\nfn test_send_and_receive_packet() {\\n\\n\\n\\n let mut conn = create_connection(None);\\n\\n let mut socket = MockSocket::new(conn.local_addr(), 0).unwrap();\\n\\n let address = conn.peer_addr();\\n\\n\\n\\n // Test Initial Packet\\n\\n conn.send_packet(&mut socket, &address);\\n\\n socket.assert_sent(vec![(\\\"255.1.1.2:5678\\\", [\\n\\n // protocol id\\n\\n 1, 2, 3, 4,\\n\\n\\n\\n // connection id\\n\\n (conn.id().0 >> 24) as u8,\\n\\n (conn.id().0 >> 16) as u8,\\n\\n (conn.id().0 >> 8) as u8,\\n\\n conn.id().0 as u8,\\n\\n\\n\\n 0, // local sequence number\\n\\n 0, // remote sequence number\\n\",\n \"file_path\": \"src/test/connection.rs\",\n \"rank\": 57,\n \"score\": 39758.8705694476\n },\n {\n \"content\": \"#[test]\\n\\nfn test_server_reset_events() {\\n\\n\\n\\n let mut server = Server::<MockSocket, BinaryRateLimiter, NoopPacketModifier>::new(Config::default());\\n\\n server.listen(\\\"127.0.0.1:1234\\\").ok();\\n\\n\\n\\n // Accept a incoming connection\\n\\n server.socket().unwrap().mock_receive(vec![\\n\\n (\\\"255.1.1.1:1000\\\", vec![\\n\\n 1, 2, 3, 4,\\n\\n 9, 8, 7, 6,\\n\\n 0,\\n\\n 0,\\n\\n 0, 0, 0, 0\\n\\n ])\\n\\n ]);\\n\\n\\n\\n // Fetch events from the connections\\n\\n server.accept_receive().ok();\\n\\n server.send(false).ok();\\n\\n\\n\\n // Shutdown should clear events\\n\\n server.shutdown().ok();\\n\\n\\n\\n // Re-bind and make events accesible again\\n\\n server.listen(\\\"127.0.0.1:1234\\\").ok();\\n\\n assert!(server_events(&mut server).is_empty());\\n\\n\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/test/server.rs\",\n \"rank\": 58,\n \"score\": 39758.8705694476\n },\n {\n \"content\": \"#[test]\\n\\nfn test_receive_invalid() {\\n\\n\\n\\n let mut q = MessageQueue::new(Config::default());\\n\\n\\n\\n // Receive a message with a invalid kind\\n\\n q.receive_packet(&[\\n\\n 255, 0, 0, 0\\n\\n ]);\\n\\n\\n\\n assert!(messages(&mut q).is_empty());\\n\\n\\n\\n // Receive a message with incomplete header\\n\\n q.receive_packet(&[\\n\\n 0, 0\\n\\n ]);\\n\\n\\n\\n q.receive_packet(&[\\n\\n 0, 0, 0\\n\\n ]);\\n\\n\\n\\n // Receive a message with incomplete data\\n\\n q.receive_packet(&[\\n\\n 0, 0, 0, 15, 72, 101, 108, 108, 111 // 15 bytes but only 5 in buffer\\n\\n ]);\\n\\n\\n\\n assert_eq!(messages(&mut q), [b\\\"Hello\\\"]);\\n\\n\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/test/message_queue.rs\",\n \"rank\": 59,\n \"score\": 39758.8705694476\n },\n {\n \"content\": \"#[test]\\n\\nfn test_receive_read() {\\n\\n\\n\\n let mut q = MessageQueue::new(Config::default());\\n\\n let packet = [\\n\\n // Hello World\\n\\n 0, 0, 0, 11, 72, 101, 108, 108, 111, 32, 87, 111, 114, 108, 100,\\n\\n // Hello World\\n\\n 0, 0, 0, 11, 72, 101, 108, 108, 111, 32, 87, 111, 114, 108, 100,\\n\\n // Foo\\n\\n 1, 0, 0, 3, 70, 111, 111,\\n\\n // Bar\\n\\n 2, 0, 0, 3, 66, 97, 114,\\n\\n // Hello World\\n\\n 0, 0, 0, 11, 72, 101, 108, 108, 111, 32, 87, 111, 114, 108, 100\\n\\n ].to_vec();\\n\\n\\n\\n q.receive_packet(&packet[..]);\\n\\n\\n\\n assert_eq!(messages(&mut q), [\\n\\n b\\\"Hello World\\\".to_vec(),\\n\\n b\\\"Hello World\\\".to_vec(),\\n\\n b\\\"Foo\\\".to_vec(),\\n\\n b\\\"Bar\\\".to_vec(),\\n\\n b\\\"Hello World\\\".to_vec()\\n\\n ]);\\n\\n\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/test/message_queue.rs\",\n \"rank\": 60,\n \"score\": 39758.8705694476\n },\n {\n \"content\": \"#[test]\\n\\nfn test_receive_invalid_packets() {\\n\\n\\n\\n let mut conn = create_connection(None);\\n\\n\\n\\n // Empty packet\\n\\n conn.receive_packet([].to_vec());\\n\\n\\n\\n // Garbage packet\\n\\n conn.receive_packet([\\n\\n 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14\\n\\n\\n\\n ].to_vec());\\n\\n\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/test/connection.rs\",\n \"rank\": 61,\n \"score\": 39758.8705694476\n },\n {\n \"content\": \"#[test]\\n\\nfn test_server_connection_loss() {\\n\\n\\n\\n let mut server = Server::<MockSocket, BinaryRateLimiter, NoopPacketModifier>::new(Config {\\n\\n connection_drop_threshold: Duration::from_millis(100),\\n\\n .. Config::default()\\n\\n });\\n\\n server.listen(\\\"127.0.0.1:1234\\\").ok();\\n\\n\\n\\n // Accept a incoming connection\\n\\n server.socket().unwrap().mock_receive(vec![\\n\\n (\\\"255.1.1.1:1000\\\", vec![\\n\\n 1, 2, 3, 4,\\n\\n 9, 8, 7, 6,\\n\\n 0,\\n\\n 0,\\n\\n 0, 0, 0, 0\\n\\n ])\\n\\n ]);\\n\\n\\n\\n assert_eq!(server_events(&mut server), vec![\\n\",\n \"file_path\": \"src/test/server.rs\",\n \"rank\": 62,\n \"score\": 39758.8705694476\n },\n {\n \"content\": \"#[test]\\n\\nfn test_client_connection_failure() {\\n\\n\\n\\n let mut client = client_init(Config {\\n\\n connection_init_threshold: Duration::from_millis(100),\\n\\n .. Config::default()\\n\\n });\\n\\n\\n\\n // Let the connection attempt time out\\n\\n thread::sleep(Duration::from_millis(200));\\n\\n\\n\\n let events = client_events(&mut client);\\n\\n assert_eq!(events, vec![ClientEvent::ConnectionFailed]);\\n\\n\\n\\n client.send(false).ok();\\n\\n client.send(false).ok();\\n\\n\\n\\n // We expect no additional packets to be send once the connection failed\\n\\n client.socket().unwrap().assert_sent_none();\\n\\n\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/test/client.rs\",\n \"rank\": 63,\n \"score\": 39758.8705694476\n },\n {\n \"content\": \"#[test]\\n\\nfn test_debug_fmt() {\\n\\n\\n\\n let mut q = MessageQueue::new(Config::default());\\n\\n q.send(MessageKind::Instant, b\\\"Hello World\\\".to_vec());\\n\\n\\n\\n // Check debug fmt support\\n\\n assert_ne!(format!(\\\"{:?}\\\", q), \\\"\\\");\\n\\n\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/test/message_queue.rs\",\n \"rank\": 64,\n \"score\": 39758.8705694476\n },\n {\n \"content\": \"#[test]\\n\\nfn test_in_order_duplicates() {\\n\\n\\n\\n let mut q = MessageQueue::new(Config::default());\\n\\n\\n\\n q.receive_packet(&[\\n\\n 2, 0, 0, 1, 53, // Expected #1\\n\\n 2, 1, 0, 1, 54, // Expected #2\\n\\n 2, 1, 0, 1, 55,\\n\\n 2, 1, 0, 1, 56,\\n\\n 2, 2, 0, 1, 57, // Expected #3\\n\\n 2, 2, 0, 1, 58,\\n\\n 2, 3, 0, 1, 59 // Expected #4\\n\\n ]);\\n\\n\\n\\n assert_eq!(messages(&mut q), [[53], [54], [57], [59]]);\\n\\n\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/test/message_queue.rs\",\n \"rank\": 65,\n \"score\": 39758.8705694476\n },\n {\n \"content\": \"#[test]\\n\\nfn test_server_connection_close() {\\n\\n\\n\\n let mut server = Server::<MockSocket, BinaryRateLimiter, NoopPacketModifier>::new(Config::default());\\n\\n server.listen(\\\"127.0.0.1:1234\\\").ok();\\n\\n\\n\\n // Accept incoming connections\\n\\n server.socket().unwrap().mock_receive(vec![\\n\\n (\\\"255.1.1.1:1000\\\", vec![\\n\\n 1, 2, 3, 4,\\n\\n 9, 8, 7, 6,\\n\\n 0,\\n\\n 0,\\n\\n 0, 0, 0, 0\\n\\n ]),\\n\\n (\\\"255.1.1.2:2000\\\", vec![\\n\\n 1, 2, 3, 4,\\n\\n 5, 5, 1, 1,\\n\\n 0,\\n\\n 0,\\n\\n 0, 0, 0, 0\\n\",\n \"file_path\": \"src/test/server.rs\",\n \"rank\": 66,\n \"score\": 39758.8705694476\n },\n {\n \"content\": \"#[test]\\n\\nfn test_server_listen_shutdown() {\\n\\n\\n\\n let mut server = Server::<MockSocket, BinaryRateLimiter, NoopPacketModifier>::new(Config::default());\\n\\n\\n\\n assert!(server.listen(\\\"127.0.0.1:1234\\\").is_ok());\\n\\n\\n\\n assert_eq!(server.listen(\\\"127.0.0.1:1234\\\").unwrap_err().kind(), ErrorKind::AlreadyExists);\\n\\n assert!(server.socket().is_ok());\\n\\n\\n\\n assert!(server.shutdown().is_ok());\\n\\n assert_eq!(server.socket().unwrap_err().kind(), ErrorKind::NotConnected);\\n\\n\\n\\n assert_eq!(server.shutdown().unwrap_err().kind(), ErrorKind::NotConnected);\\n\\n\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/test/server.rs\",\n \"rank\": 67,\n \"score\": 39758.8705694476\n },\n {\n \"content\": \"#[test]\\n\\nfn test_send_write() {\\n\\n\\n\\n let mut q = MessageQueue::new(Config::default());\\n\\n\\n\\n // Filled from quota\\n\\n q.send(MessageKind::Instant, b\\\"Hello World\\\".to_vec());\\n\\n q.send(MessageKind::Instant, b\\\"Hello World\\\".to_vec());\\n\\n\\n\\n // Added by filling buffer\\n\\n q.send(MessageKind::Instant, b\\\"Hello World\\\".to_vec());\\n\\n\\n\\n // Put into packet 2\\n\\n q.send(MessageKind::Instant, b\\\"Hello World2\\\".to_vec());\\n\\n q.send(MessageKind::Instant, b\\\"Hello World2\\\".to_vec());\\n\\n\\n\\n // Filled from quota\\n\\n q.send(MessageKind::Reliable, b\\\"Foo\\\".to_vec());\\n\\n\\n\\n // Put into packet 2 by quota\\n\\n q.send(MessageKind::Reliable, b\\\"Foo2\\\".to_vec());\\n\",\n \"file_path\": \"src/test/message_queue.rs\",\n \"rank\": 68,\n \"score\": 39758.8705694476\n },\n {\n \"content\": \"#[test]\\n\\nfn test_client_connection_success() {\\n\\n\\n\\n let mut client = client_init(Config {\\n\\n .. Config::default()\\n\\n });\\n\\n\\n\\n // Mock the receival of the first server packet which acknowledges the client\\n\\n let id = client.connection().unwrap().id().0;\\n\\n client.socket().unwrap().mock_receive(vec![\\n\\n (\\\"255.1.1.1:5678\\\", vec![\\n\\n 1, 2, 3, 4,\\n\\n (id >> 24) as u8,\\n\\n (id >> 16) as u8,\\n\\n (id >> 8) as u8,\\n\\n id as u8,\\n\\n 0,\\n\\n 0,\\n\\n 0, 0, 0, 0\\n\\n ])\\n\\n ]);\\n\",\n \"file_path\": \"src/test/client.rs\",\n \"rank\": 69,\n \"score\": 39758.8705694476\n },\n {\n \"content\": \"#[test]\\n\\n#[cfg(target_os = \\\"linux\\\")]\\n\\nfn test_server_flush_auto_delay() {\\n\\n\\n\\n let mut server = Server::<MockSocket, BinaryRateLimiter, NoopPacketModifier>::new(Config::default());\\n\\n server.listen(\\\"127.0.0.1:1234\\\").ok();\\n\\n\\n\\n let start = Instant::now();\\n\\n for _ in 0..5 {\\n\\n server.accept_receive().ok();\\n\\n server.send(true).ok();\\n\\n }\\n\\n assert_millis_since!(start, 167, 33);\\n\\n\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/test/server.rs\",\n \"rank\": 70,\n \"score\": 38718.58275569182\n },\n {\n \"content\": \"#[test]\\n\\nfn test_client_connect_reset_close() {\\n\\n\\n\\n let mut client = Client::<MockSocket, BinaryRateLimiter, NoopPacketModifier>::new(Config::default());\\n\\n\\n\\n assert!(client.connect(\\\"255.1.1.1:5678\\\").is_ok());\\n\\n\\n\\n assert_eq!(client.connect(\\\"255.1.1.1:5678\\\").unwrap_err().kind(), ErrorKind::AlreadyExists);\\n\\n assert!(client.socket().is_ok());\\n\\n\\n\\n assert!(client.reset().is_ok());\\n\\n assert!(client.socket().is_ok());\\n\\n\\n\\n assert!(client.disconnect().is_ok());\\n\\n assert_eq!(client.socket().unwrap_err().kind(), ErrorKind::NotConnected);\\n\\n\\n\\n assert_eq!(client.disconnect().unwrap_err().kind(), ErrorKind::NotConnected);\\n\\n assert_eq!(client.reset().unwrap_err().kind(), ErrorKind::NotConnected);\\n\\n\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/test/client.rs\",\n \"rank\": 71,\n \"score\": 38718.58275569182\n },\n {\n \"content\": \"#[test]\\n\\nfn test_receive_read_long() {\\n\\n\\n\\n let mut q = MessageQueue::new(Config::default());\\n\\n let packet = [\\n\\n 0, 0, 1, 188, 76, 111, 114, 101, 109, 32, 105, 112, 115, 117, 109,\\n\\n 32, 100, 111, 108, 111, 114, 32, 115, 105, 116, 32, 97, 109, 101,\\n\\n 116, 44, 32, 99, 111, 110, 115, 101, 99, 116, 101, 116, 117, 114,\\n\\n 32, 97, 100, 105, 112, 105, 115, 99, 105, 110, 103, 32, 101, 108,\\n\\n 105, 116, 44, 32, 115, 101, 100, 32, 100, 111, 32, 101, 105, 117,\\n\\n 115, 109, 111, 100, 32, 116, 101, 109, 112, 111, 114, 32, 105, 110,\\n\\n 99, 105, 100, 105, 100, 117, 110, 116, 32, 117, 116, 32, 108, 97,\\n\\n 98, 111, 114, 101, 32, 101, 116, 32, 100, 111, 108, 111, 114, 101,\\n\\n 32, 109, 97, 103, 110, 97, 32, 97, 108, 105, 113, 117, 97, 46, 32,\\n\\n 85, 116, 32, 101, 110, 105, 109, 32, 97, 100, 32, 109, 105, 110,\\n\\n 105, 109, 32, 118, 101, 110, 105, 97, 109, 44, 32, 113, 117, 105,\\n\\n 115, 32, 110, 111, 115, 116, 114, 117, 100, 32, 101, 120, 101, 114,\\n\\n 99, 105, 116, 97, 116, 105, 111, 110, 32, 117, 108, 108, 97, 109,\\n\\n 99, 111, 32, 108, 97, 98, 111, 114, 105, 115, 32, 110, 105, 115,\\n\\n 105, 32, 117, 116, 32, 97, 108, 105, 113, 117, 105, 112, 32, 101,\\n\\n 120, 32, 101, 97, 32, 99, 111, 109, 109, 111, 100, 111, 32, 99,\\n\",\n \"file_path\": \"src/test/message_queue.rs\",\n \"rank\": 72,\n \"score\": 38718.58275569182\n },\n {\n \"content\": \"#[test]\\n\\nfn test_packet_lost_write() {\\n\\n\\n\\n let mut q = MessageQueue::new(Config::default());\\n\\n\\n\\n q.lost_packet(&[\\n\\n // Hello World2\\n\\n 0, 0, 0, 12, 72, 101, 108, 108, 111, 32, 87, 111, 114, 108, 100, 50,\\n\\n // Hello World2\\n\\n 0, 0, 0, 12, 72, 101, 108, 108, 111, 32, 87, 111, 114, 108, 100, 50,\\n\\n // Foo2\\n\\n 1, 0, 0, 4, 70, 111, 111, 50,\\n\\n // Bar2\\n\\n 2, 1, 0, 4, 66, 97, 114, 50,\\n\\n // Foo More\\n\\n 1, 0, 0, 8, 70, 111, 111, 32, 77, 111, 114, 101\\n\\n ]);\\n\\n\\n\\n // Send some more messages\\n\\n q.send(MessageKind::Instant, b\\\"Hello World\\\".to_vec());\\n\\n q.send(MessageKind::Reliable, b\\\"Foo5\\\".to_vec());\\n\",\n \"file_path\": \"src/test/message_queue.rs\",\n \"rank\": 73,\n \"score\": 38718.58275569182\n },\n {\n \"content\": \"#[test]\\n\\nfn test_receive_packet_ack_overflow() {\\n\\n\\n\\n let mut conn = create_connection(None);\\n\\n\\n\\n // Receive more packets than the ack queue can hold\\n\\n for i in 0..33 {\\n\\n conn.receive_packet([\\n\\n 1, 2, 3, 4,\\n\\n 0, 0, 0, 0,\\n\\n i,\\n\\n 0,\\n\\n 0, 0, 0, 0\\n\\n\\n\\n ].to_vec());\\n\\n }\\n\\n\\n\\n // Verify ack bit field\\n\\n let mut socket = MockSocket::new(conn.local_addr(), 0).unwrap();\\n\\n let address = conn.peer_addr();\\n\\n\\n\",\n \"file_path\": \"src/test/connection.rs\",\n \"rank\": 74,\n \"score\": 38718.58275569182\n },\n {\n \"content\": \"#[test]\\n\\nfn test_send_sequence_wrap_around() {\\n\\n\\n\\n let mut conn = create_connection(None);\\n\\n let mut socket = MockSocket::new(conn.local_addr(), 0).unwrap();\\n\\n let address = conn.peer_addr();\\n\\n\\n\\n for i in 0..256 {\\n\\n\\n\\n conn.send_packet(&mut socket, &address);\\n\\n\\n\\n socket.assert_sent(vec![(\\\"255.1.1.2:5678\\\", [\\n\\n // protocol id\\n\\n 1, 2, 3, 4,\\n\\n\\n\\n // connection id\\n\\n (conn.id().0 >> 24) as u8,\\n\\n (conn.id().0 >> 16) as u8,\\n\\n (conn.id().0 >> 8) as u8,\\n\\n conn.id().0 as u8,\\n\\n\\n\",\n \"file_path\": \"src/test/connection.rs\",\n \"rank\": 75,\n \"score\": 38718.58275569182\n },\n {\n \"content\": \"#[test]\\n\\n#[cfg(target_os = \\\"linux\\\")]\\n\\nfn test_server_auto_delay_with_load() {\\n\\n\\n\\n let mut server = Server::<MockSocket, BinaryRateLimiter, NoopPacketModifier>::new(Config::default());\\n\\n server.listen(\\\"127.0.0.1:1234\\\").ok();\\n\\n\\n\\n // Without load\\n\\n let start = Instant::now();\\n\\n for _ in 0..10 {\\n\\n server.accept_receive().ok();\\n\\n server.send(true).ok();\\n\\n }\\n\\n\\n\\n assert_millis_since!(start, 330, 16);\\n\\n\\n\\n // With load\\n\\n let start = Instant::now();\\n\\n for _ in 0..10 {\\n\\n server.accept_receive().ok();\\n\\n thread::sleep(Duration::from_millis(10));\\n\\n server.send(true).ok();\\n\",\n \"file_path\": \"src/test/server.rs\",\n \"rank\": 76,\n \"score\": 38718.58275569182\n },\n {\n \"content\": \"#[test]\\n\\n#[cfg(target_os = \\\"linux\\\")]\\n\\nfn test_client_flush_auto_delay() {\\n\\n\\n\\n let mut client = Client::<MockSocket, BinaryRateLimiter, NoopPacketModifier>::new(Config::default());\\n\\n client.connect(\\\"255.1.1.1:5678\\\").ok();\\n\\n\\n\\n let start = Instant::now();\\n\\n for _ in 0..5 {\\n\\n client.receive().ok();\\n\\n client.send(true).ok();\\n\\n }\\n\\n assert_millis_since!(start, 167, 33);\\n\\n\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/test/client.rs\",\n \"rank\": 77,\n \"score\": 38718.58275569182\n },\n {\n \"content\": \"#[test]\\n\\nfn test_client_flush_without_delay() {\\n\\n\\n\\n let mut client = Client::<MockSocket, BinaryRateLimiter, NoopPacketModifier>::new(Config::default());\\n\\n client.connect(\\\"255.1.1.1:5678\\\").ok();\\n\\n\\n\\n let start = Instant::now();\\n\\n for _ in 0..5 {\\n\\n client.receive().ok();\\n\\n client.send(false).ok();\\n\\n }\\n\\n assert_millis_since!(start, 0, 16);\\n\\n\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/test/client.rs\",\n \"rank\": 78,\n \"score\": 38718.58275569182\n },\n {\n \"content\": \"#[test]\\n\\nfn test_server_flow_without_connections() {\\n\\n\\n\\n let mut server = Server::<MockSocket, BinaryRateLimiter, NoopPacketModifier>::new(Config::default());\\n\\n\\n\\n assert!(server.listen(\\\"127.0.0.1:1234\\\").is_ok());\\n\\n\\n\\n assert_eq!(server.accept_receive(), Err(TryRecvError::Empty));\\n\\n\\n\\n assert!(server.send(false).is_ok());\\n\\n\\n\\n assert!(server.shutdown().is_ok());\\n\\n\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/test/server.rs\",\n \"rank\": 79,\n \"score\": 38718.58275569182\n },\n {\n \"content\": \"#[test]\\n\\nfn test_client_connection_loss_and_reconnect() {\\n\\n\\n\\n let mut client = client_init(Config {\\n\\n connection_drop_threshold: Duration::from_millis(100),\\n\\n .. Config::default()\\n\\n });\\n\\n\\n\\n // Mock the receival of the first server packet which acknowledges the client\\n\\n let id = client.connection().unwrap().id().0;\\n\\n client.socket().unwrap().mock_receive(vec![\\n\\n (\\\"255.1.1.1:5678\\\", vec![\\n\\n 1, 2, 3, 4,\\n\\n (id >> 24) as u8,\\n\\n (id >> 16) as u8,\\n\\n (id >> 8) as u8,\\n\\n id as u8,\\n\\n 0,\\n\\n 0,\\n\\n 0, 0, 0, 0\\n\\n ])\\n\",\n \"file_path\": \"src/test/client.rs\",\n \"rank\": 80,\n \"score\": 38718.58275569182\n },\n {\n \"content\": \"#[test]\\n\\n#[cfg(target_os = \\\"linux\\\")]\\n\\nfn test_client_auto_delay_with_load() {\\n\\n\\n\\n let mut client = Client::<MockSocket, BinaryRateLimiter, NoopPacketModifier>::new(Config::default());\\n\\n client.connect(\\\"255.1.1.1:5678\\\").ok();\\n\\n\\n\\n // Without load\\n\\n let start = Instant::now();\\n\\n for _ in 0..10 {\\n\\n client.receive().ok();\\n\\n client.send(true).ok();\\n\\n }\\n\\n\\n\\n assert_millis_since!(start, 330, 16);\\n\\n\\n\\n // With load\\n\\n let start = Instant::now();\\n\\n for _ in 0..10 {\\n\\n client.receive().ok();\\n\\n thread::sleep(Duration::from_millis(10));\\n\\n client.send(true).ok();\\n\",\n \"file_path\": \"src/test/client.rs\",\n \"rank\": 81,\n \"score\": 38718.58275569182\n },\n {\n \"content\": \"#[test]\\n\\nfn test_receive_read_out_of_order() {\\n\\n\\n\\n let mut q = MessageQueue::new(Config::default());\\n\\n\\n\\n // Receive one out of order(#1) \\\"World\\\" message\\n\\n q.receive_packet(&[\\n\\n 2, 1, 0, 5, 87, 111, 114, 108, 100\\n\\n ]);\\n\\n\\n\\n // We expect no message yet\\n\\n assert!(messages(&mut q).is_empty());\\n\\n\\n\\n // Receive one out of order(#3) \\\"order!\\\" message\\n\\n q.receive_packet(&[\\n\\n 2, 3, 0, 6, 111, 114, 100, 101, 114, 33\\n\\n ]);\\n\\n\\n\\n // We still expect no message yet\\n\\n assert!(messages(&mut q).is_empty());\\n\\n\\n\",\n \"file_path\": \"src/test/message_queue.rs\",\n \"rank\": 82,\n \"score\": 38718.58275569182\n },\n {\n \"content\": \"#[test]\\n\\nfn test_send_write_long() {\\n\\n\\n\\n let msg = b\\\"Lorem ipsum dolor sit amet, consectetur adipiscing elit, sed do \\\\\\n\\n eiusmod tempor incididunt ut labore et dolore magna aliqua. \\\\\\n\\n Ut enim ad minim veniam, quis nostrud exercitation ullamco \\\\\\n\\n laboris nisi ut aliquip ex ea commodo consequat. Duis aute irure \\\\\\n\\n dolor in reprehenderit in voluptate velit esse cillum dolore eu \\\\\\n\\n fugiat nulla pariatur. Excepteur sint occaecat cupidatat non \\\\\\n\\n proident, sunt in culpa qui officia deserunt mollit anim id est \\\\\\n\\n laborum\\\";\\n\\n\\n\\n let mut q = MessageQueue::new(Config::default());\\n\\n q.send(MessageKind::Instant, msg.to_vec());\\n\\n\\n\\n let mut buffer = Vec::new();\\n\\n q.send_packet(&mut buffer, 1400);\\n\\n\\n\\n assert_eq!(buffer, [\\n\\n 0, 0, 1, 188, 76, 111, 114, 101, 109, 32, 105, 112, 115, 117, 109,\\n\\n 32, 100, 111, 108, 111, 114, 32, 115, 105, 116, 32, 97, 109, 101,\\n\",\n \"file_path\": \"src/test/message_queue.rs\",\n \"rank\": 83,\n \"score\": 38718.58275569182\n },\n {\n \"content\": \"#[test]\\n\\nfn test_server_connection_address_remap() {\\n\\n\\n\\n let mut server = Server::<MockSocket, BinaryRateLimiter, NoopPacketModifier>::new(Config::default());\\n\\n server.listen(\\\"127.0.0.1:1234\\\").ok();\\n\\n\\n\\n // Accept a incoming connection\\n\\n server.socket().unwrap().mock_receive(vec![\\n\\n (\\\"255.1.1.1:1000\\\", vec![\\n\\n 1, 2, 3, 4,\\n\\n 9, 8, 7, 6,\\n\\n 0,\\n\\n 0,\\n\\n 0, 0, 0, 0\\n\\n ])\\n\\n ]);\\n\\n\\n\\n assert_eq!(server_events(&mut server), vec![\\n\\n ServerEvent::Connection(ConnectionID(151521030))\\n\\n ]);\\n\\n\\n\",\n \"file_path\": \"src/test/server.rs\",\n \"rank\": 84,\n \"score\": 38718.58275569182\n },\n {\n \"content\": \"#[test]\\n\\nfn test_server_flush_without_delay() {\\n\\n\\n\\n let mut server = Server::<MockSocket, BinaryRateLimiter, NoopPacketModifier>::new(Config::default());\\n\\n server.listen(\\\"127.0.0.1:1234\\\").ok();\\n\\n\\n\\n let start = Instant::now();\\n\\n for _ in 0..5 {\\n\\n server.accept_receive().ok();\\n\\n server.send(false).ok();\\n\\n }\\n\\n assert_millis_since!(start, 0, 16);\\n\\n\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/test/server.rs\",\n \"rank\": 85,\n \"score\": 38718.58275569182\n },\n {\n \"content\": \"#[test]\\n\\nfn test_client_connection_ignore_non_peer() {\\n\\n\\n\\n let mut client = client_init(Config {\\n\\n connection_init_threshold: Duration::from_millis(100),\\n\\n .. Config::default()\\n\\n });\\n\\n\\n\\n // We expect the client to ignore any packets from peers other than the\\n\\n // server it is connected to\\n\\n let id = client.connection().unwrap().id().0;\\n\\n client.socket().unwrap().mock_receive(vec![\\n\\n (\\\"255.1.1.1:5679\\\", vec![\\n\\n 1, 2, 3, 4,\\n\\n (id >> 24) as u8,\\n\\n (id >> 16) as u8,\\n\\n (id >> 8) as u8,\\n\\n id as u8,\\n\\n 0,\\n\\n 0,\\n\\n 0, 0, 0, 0\\n\\n ])\\n\\n ]);\\n\\n\\n\\n assert_eq!(client_events(&mut client), vec![]);\\n\\n\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/test/client.rs\",\n \"rank\": 86,\n \"score\": 37754.60395420192\n },\n {\n \"content\": \"#[test]\\n\\nfn test_receive_ordered_decoding_wrap_around() {\\n\\n\\n\\n let mut q = MessageQueue::new(Config::default());\\n\\n for i in 0..4096 {\\n\\n\\n\\n q.receive_packet(&[\\n\\n 2 | ((i & 0x0F00) >> 4) as u8, (i as u8), 0, 2, (i >> 8) as u8, i as u8\\n\\n ]);\\n\\n\\n\\n assert_eq!(messages(&mut q), [[(i >> 8) as u8, i as u8]]);\\n\\n\\n\\n }\\n\\n\\n\\n // Should now expect order=0 again\\n\\n q.receive_packet(&[\\n\\n 2, 0, 0, 2, 0, 0\\n\\n ]);\\n\\n assert_eq!(messages(&mut q), [[0, 0]]);\\n\\n\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/test/message_queue.rs\",\n \"rank\": 87,\n \"score\": 36858.83489265856\n },\n {\n \"content\": \"#[test]\\n\\nfn test_receive_ordered_encoding_wrap_around() {\\n\\n\\n\\n let mut q = MessageQueue::new(Config::default());\\n\\n for i in 0..4096 {\\n\\n\\n\\n q.send(MessageKind::Ordered, [(i >> 8) as u8, i as u8].to_vec());\\n\\n\\n\\n let mut buffer = Vec::new();\\n\\n q.send_packet(&mut buffer, 64);\\n\\n assert_eq!(buffer, [\\n\\n 2 | ((i & 0x0F00) >> 4) as u8, (i as u8), 0, 2, (i >> 8) as u8, i as u8].to_vec()\\n\\n );\\n\\n\\n\\n }\\n\\n\\n\\n // Should now write order=0 again\\n\\n q.send(MessageKind::Ordered, [0, 0].to_vec());\\n\\n\\n\\n let mut buffer = Vec::new();\\n\\n q.send_packet(&mut buffer, 64);\\n\\n assert_eq!(buffer, [2, 0, 0, 2, 0, 0].to_vec());\\n\\n\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/test/message_queue.rs\",\n \"rank\": 88,\n \"score\": 36858.83489265856\n },\n {\n \"content\": \" /// Values must be in the range of `0.0` to `1.0` where `0.25` would be a\\n\\n /// quarter of the tick's sleep time.\\n\\n ///\\n\\n /// Example: For a `send_rate` of `30` with a maximum sleep time of `33.33`\\n\\n /// milliseconds, a `tick_overflow_recovery_rate` value of `0.5` would\\n\\n /// allow up to `16.66` milliseconds of sleep to be skipped.\\n\\n ///\\n\\n /// Values smaller than `0.0` or bigger than `1.0` will have no effect.\\n\\n ///\\n\\n /// Default is `1.0`.\\n\\n pub tick_overflow_recovery_rate: f32\\n\\n\\n\\n}\\n\\n\\n\\nimpl Default for Config {\\n\\n\\n\\n fn default() -> Config {\\n\\n Config {\\n\\n send_rate: 30,\\n\\n protocol_header: [1, 2, 3, 4],\\n\",\n \"file_path\": \"src/shared/config.rs\",\n \"rank\": 89,\n \"score\": 34049.100006275665\n },\n {\n \"content\": \" /// Maximum time in milliseconds to wait for remote confirmation after\\n\\n /// programmatically closing a connection. Default is `150`.\\n\\n pub connection_closing_threshold: Duration,\\n\\n\\n\\n /// The percent of available packet bytes to use when serializing\\n\\n /// `MessageKind::Instant` into a packet via a `MessageQueue`.\\n\\n pub message_quota_instant: f32,\\n\\n\\n\\n /// The percent of available packet bytes to use when serializing\\n\\n /// `MessageKind::Reliable` into a packet via a `MessageQueue`.\\n\\n pub message_quota_reliable: f32,\\n\\n\\n\\n /// The percent of available packet bytes to use when serializing\\n\\n /// `MessageKind::Ordered` into a packet via a `MessageQueue`.\\n\\n pub message_quota_ordered: f32,\\n\\n\\n\\n /// Whether to keep track of ticks which exceed their maximum running time\\n\\n /// and speed up successive ticks in order to keep the desired target\\n\\n /// `send_rate` stable.\\n\\n ///\\n\",\n \"file_path\": \"src/shared/config.rs\",\n \"rank\": 90,\n \"score\": 34046.59921402105\n },\n {\n \"content\": \" /// Each tick has a limit of the number of milliseconds in can take before\\n\\n /// the `send_rate` drops below the specified ticks per second\\n\\n /// target (`1000 / send_rate` milliseconds). Ticks which fall below this\\n\\n /// threshold will normally sleep for the remaining amount of time.\\n\\n ///\\n\\n /// Ticks which exceed this threshold will normally cause the `send_rate`\\n\\n /// to drop below the target; however, with `tick_overflow_recovery`\\n\\n /// enabled any tick which falls below the threshold will give up some of\\n\\n /// its remaining sleep time in order to allow the `send_rate` to catch up\\n\\n /// again.\\n\\n ///\\n\\n /// How much of each tick's sleep time is used for speedup purposes is\\n\\n /// determined by the value of `tick_overflow_recovery`.\\n\\n ///\\n\\n /// Default is `true`.\\n\\n pub tick_overflow_recovery: bool,\\n\\n\\n\\n /// Determines how much of each tick's sleep time may be used to reduce the\\n\\n /// current tick overflow time in order to smooth out the `send_rate`.\\n\\n ///\\n\",\n \"file_path\": \"src/shared/config.rs\",\n \"rank\": 91,\n \"score\": 34042.94708190082\n },\n {\n \"content\": \"// Copyright (c) 2015-2017 Ivo Wetzel\\n\\n\\n\\n// Licensed under the Apache License, Version 2.0 <LICENSE-APACHE or\\n\\n// http://www.apache.org/licenses/LICENSE-2.0> or the MIT license\\n\\n// <LICENSE-MIT or http://opensource.org/licenses/MIT>, at your\\n\\n// option. This file may not be copied, modified, or distributed\\n\\n// except according to those terms.\\n\\n\\n\\n\\n\\n// STD Dependencies -----------------------------------------------------------\\n\\nuse std::time::Duration;\\n\\n\\n\\n\\n\\n/// Structure defining connection and message configuration options.\\n\\n#[derive(Copy, Clone, Debug, PartialEq)]\\n\\npub struct Config {\\n\\n\\n\\n /// Number of packets send per second. Default is `30`.\\n\\n pub send_rate: u64,\\n\\n\\n\",\n \"file_path\": \"src/shared/config.rs\",\n \"rank\": 92,\n \"score\": 34041.098278179554\n },\n {\n \"content\": \" packet_max_size: 1400,\\n\\n packet_drop_threshold: Duration::from_millis(1000),\\n\\n connection_init_threshold: Duration::from_millis(100),\\n\\n connection_drop_threshold: Duration::from_millis(1000),\\n\\n connection_closing_threshold: Duration::from_millis(150),\\n\\n message_quota_instant: 60.0,\\n\\n message_quota_reliable: 20.0,\\n\\n message_quota_ordered: 20.0,\\n\\n tick_overflow_recovery: true,\\n\\n tick_overflow_recovery_rate: 1.0\\n\\n }\\n\\n }\\n\\n\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/shared/config.rs\",\n \"rank\": 93,\n \"score\": 34038.90829515442\n },\n {\n \"content\": \" /// Maximum bytes that can be received / send in one packet. Default\\n\\n /// `1400`.\\n\\n pub packet_max_size: usize,\\n\\n\\n\\n /// 32-Bit Protocol ID used to identify UDP related packets. Default is\\n\\n /// `[1, 2, 3, 4]`.\\n\\n pub protocol_header: [u8; 4],\\n\\n\\n\\n /// Maximum roundtrip-time in milliseconds before a packet is considered\\n\\n /// lost. Default is `1000`.\\n\\n pub packet_drop_threshold: Duration,\\n\\n\\n\\n /// Maximum time in milliseconds until the first packet must be received\\n\\n /// before a connection attempt fails. Default is `100`.\\n\\n pub connection_init_threshold: Duration,\\n\\n\\n\\n /// Maximum time in milliseconds between any two packets before the\\n\\n /// connection gets dropped. Default is `1000`.\\n\\n pub connection_drop_threshold: Duration,\\n\\n\\n\",\n \"file_path\": \"src/shared/config.rs\",\n \"rank\": 94,\n \"score\": 34036.4653740223\n },\n {\n \"content\": \"// Static Helpers -------------------------------------------------------------\\n\\nfn order_is_more_recent(a: u16, b: u16) -> bool {\\n\\n (a > b) && (a - b <= MAX_ORDER_ID / 2)\\n\\n || (b > a) && (b - a > MAX_ORDER_ID / 2)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/shared/message_queue.rs\",\n \"rank\": 95,\n \"score\": 32805.181867537656\n },\n {\n \"content\": \"fn messages_from_packet(packet: &[u8]) -> Vec<Message> {\\n\\n\\n\\n let available = packet.len();\\n\\n let mut index = 0;\\n\\n let mut messages = Vec::new();\\n\\n\\n\\n // Consume as long as message headers can be present\\n\\n while index < available && available - index >= MESSAGE_HEADER_BYTES {\\n\\n\\n\\n // Upper 4 bits of kind are bits 9..11 of order\\n\\n let order_high = ((packet[index] & 0xF0) as u16) << 4;\\n\\n let order_low = packet[index + 1] as u16;\\n\\n\\n\\n // Byte 2 is the size\\n\\n let size_high = (packet[index + 2] as u16) << 8;\\n\\n let size = size_high | packet[index + 3] as u16;\\n\\n\\n\\n // Lower 4 bits of byte 0 are the MessageKind\\n\\n let kind = match packet[index] & 0x0F {\\n\\n 0 => Some(MessageKind::Instant),\\n\",\n \"file_path\": \"src/shared/message_queue.rs\",\n \"rank\": 96,\n \"score\": 32556.855098173364\n },\n {\n \"content\": \"// Copyright (c) 2015-2017 Ivo Wetzel\\n\\n\\n\\n// Licensed under the Apache License, Version 2.0 <LICENSE-APACHE or\\n\\n// http://www.apache.org/licenses/LICENSE-2.0> or the MIT license\\n\\n// <LICENSE-MIT or http://opensource.org/licenses/MIT>, at your\\n\\n// option. This file may not be copied, modified, or distributed\\n\\n// except according to those terms.\\n\\n\\n\\n// STD Dependencies -----------------------------------------------------------\\n\\nuse std::fmt;\\n\\n\\n\\n\\n\\n// Internal Dependencies ------------------------------------------------------\\n\\nuse super::super::Config;\\n\\n\\n\\n\\n\\n/// Trait describing a network congestion avoidance algorithm.\\n\",\n \"file_path\": \"src/traits/rate_limiter.rs\",\n \"rank\": 97,\n \"score\": 32313.664604644215\n }\n]","isConversational":false}}},{"rowIdx":2358,"cells":{"lang":{"kind":"string","value":"Rust"},"file_path":{"kind":"string","value":"pkmnapi-db/src/pic/mod.rs"},"repo_name":{"kind":"string","value":"kevinselwyn/pkmnapi"},"commit":{"kind":"string","value":"170e6b6c9a74e85c377137bc086793898c415125"},"file_code":{"kind":"string","value":"\n\nmod bitplane;\nmod bitstream;\nmod encoding_method;\n\npub use encoding_method::EncodingMethod as PicEncodingMethod;\n\nuse crate::error::{self, Result};\nuse bitplane::*;\nuse bitstream::*;\nuse image::{self, DynamicImage, ImageBuffer, ImageFormat, Luma};\n\n#[derive(Clone, Debug, PartialEq)]\npub struct Pic {\n pub width: u8,\n pub height: u8,\n pub pixels: Vec<u8>,\n pub bytes: usize,\n pub encoding_method: PicEncodingMethod,\n}\n\nimpl Pic {\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n pub fn new(data: &[u8]) -> Result<Self> {\n let mut bitstream = Bitstream::from(data);\n\n let width = bitstream.get(4) as u8;\n let height = bitstream.get(4) as u8;\n\n let primary_buffer = bitstream.get(1) as u8;\n let mut bitplane_1 = Pic::decode_bitplane(width, height, &mut bitstream);\n let encoding_method = PicEncodingMethod::from(\n {\n if bitstream.get(1) == 0x00 {\n 0x01\n } else {\n if bitstream.get(1) == 0x00 {\n 0x02\n } else {\n 0x03\n }\n }\n },\n primary_buffer,\n );\n let mut bitplane_0 = Pic::decode_bitplane(width, height, &mut bitstream);\n\n match encoding_method {\n PicEncodingMethod::ONE(_) => {\n bitplane_1 = bitplane_1.delta_decode(width as usize * 8);\n bitplane_0 = bitplane_0.delta_decode(width as usize * 8);\n }\n PicEncodingMethod::TWO(_) => {\n bitplane_1 = bitplane_1.delta_decode(width as usize * 8);\n bitplane_0 = bitplane_0.clone() ^ bitplane_1.clone();\n }\n PicEncodingMethod::THREE(_) => {\n bitplane_1 = bitplane_1.delta_decode(width as usize * 8);\n bitplane_0 = bitplane_0.delta_decode(width as usize * 8);\n bitplane_0 = bitplane_0.clone() ^ bitplane_1.clone();\n }\n };\n\n let pixels = {\n if encoding_method.value() == 0x00 {\n (bitplane_0 << 0x01) | bitplane_1\n } else {\n (bitplane_1 << 0x01) | bitplane_0\n }\n };\n\n let bytes = ((bitstream.bits as f32) / 8.0).ceil() as usize;\n\n Ok(Pic {\n width,\n height,\n pixels: pixels.data,\n bytes,\n encoding_method,\n })\n }\n\n pub fn encode(&self, encoding_method: PicEncodingMethod) -> Vec<u8> {\n let width = self.width;\n let height = self.height;\n\n let (mut bitplane_0b, mut bitplane_1b) = if encoding_method.value() == 0x00 {\n let pixel_bitplane = Bitplane::from(self.pixels.to_vec());\n\n (\n (pixel_bitplane.clone() & 0x02) >> 0x01,\n pixel_bitplane.clone() & 0x01,\n )\n } else {\n let pixel_bitplane = Bitplane::from(self.pixels.to_vec());\n\n (\n pixel_bitplane.clone() & 0x01,\n (pixel_bitplane.clone() & 0x02) >> 0x01,\n )\n };\n\n let (bitplane_0a, bitplane_1a) = match encoding_method {\n PicEncodingMethod::ONE(_) => {\n let bitplane_1a = bitplane_1b.delta_encode(width as usize * 8);\n let bitplane_0a = bitplane_0b.delta_encode(width as usize * 8);\n\n (bitplane_0a, bitplane_1a)\n }\n PicEncodingMethod::TWO(_) => {\n let bitplane_1a = bitplane_1b.delta_encode(width as usize * 8);\n let bitplane_0a = bitplane_0b.clone() ^ bitplane_1b.clone();\n\n (bitplane_0a, bitplane_1a)\n }\n PicEncodingMethod::THREE(_) => {\n let bitplane_1a = bitplane_1b.delta_encode(width as usize * 8);\n let bitplane_0a = bitplane_0b.delta_encode(width as usize * 8);\n let bitplane_0a = bitplane_0a.clone() ^ bitplane_1a.clone();\n\n (bitplane_0a, bitplane_1a)\n }\n };\n\n let bitplane_0a_raw = Pic::encode_bitplane(width, height, bitplane_0a);\n let bitplane_1a_raw = Pic::encode_bitplane(width, height, bitplane_1a);\n\n let data_bits: Vec<u8> = [\n (0..=3)\n .map(|i| (width & (i << (3 - i))) >> (3 - i))\n .collect(),\n (0..=3)\n .map(|i| (height & (i << (3 - i))) >> (3 - i))\n .collect(),\n vec![encoding_method.value()],\n bitplane_1a_raw,\n encoding_method.to_vec(),\n bitplane_0a_raw,\n ]\n .concat();\n\n let data_bytes = ((data_bits.len() as f32) / 8.0).ceil() as usize;\n let extra_bits = (data_bytes * 8) - data_bits.len();\n let data_bits = [data_bits, vec![0x00; extra_bits]].concat();\n\n let data: Vec<u8> = (0..data_bytes)\n .map(|i| {\n let index = i * 8;\n\n data_bits[index..(index + 8)]\n .iter()\n .enumerate()\n .map(|(i, bit)| bit << (7 - i))\n .fold(0, |acc, val| acc | val)\n })\n .collect();\n\n data\n }\n\n fn from(data: Vec<u8>, format: ImageFormat) -> Result<Self> {\n let raw = match image::load_from_memory_with_format(&data, format) {\n Ok(img) => img,\n Err(_) => return Err(error::Error::PicCouldNotRead),\n };\n\n let img = match raw.as_luma8() {\n Some(img) => img,\n None => return Err(error::Error::PicCouldNotRead),\n };\n\n if img.width() % 8 != 0 || img.height() % 8 != 0 {\n return Err(error::Error::PicWrongSize);\n }\n\n let width = ((img.width() as f32) / 8.0) as u8;\n let height = ((img.height() as f32) / 8.0) as u8;\n let pixels: Vec<u8> = img\n .enumerate_pixels()\n .map(|(_, _, pixel)| {\n let pixel = 3 - (((pixel.0[0] as f32) / 85.0) as u8);\n\n pixel\n })\n .collect();\n\n let encoding_method = PicEncodingMethod::from(0x01, 0x00);\n\n Ok(Pic {\n width,\n height,\n pixels,\n bytes: 0,\n encoding_method,\n })\n }\n\n pub fn from_png(data: Vec<u8>) -> Result<Self> {\n Pic::from(data, ImageFormat::Png)\n }\n\n pub fn from_jpeg(data: Vec<u8>) -> Result<Self> {\n Pic::from(data, ImageFormat::Jpeg)\n }\n\n pub fn decode_bitplane(width: u8, height: u8, bitstream: &mut Bitstream) -> Bitplane {\n let mut pairs: Vec<u8> = vec![];\n let mut packet_type = bitstream.get(1);\n\n loop {\n if pairs.len() >= (width as u32 * height as u32 * 32) as usize {\n break;\n }\n\n if packet_type == 0x00 {\n \n let (length, bits) = bitstream.get_until_zero();\n let value = bitstream.get(bits);\n let run = length + value + 1;\n\n for _ in 0..run {\n pairs.push(0x00);\n }\n\n packet_type = 0x01;\n } else {\n \n loop {\n if pairs.len() >= (width as u32 * height as u32 * 32) as usize {\n break;\n }\n\n let pair = bitstream.get(2);\n\n if pair == 0x00 {\n break;\n }\n\n pairs.push(pair as u8);\n }\n\n packet_type = 0x00;\n }\n }\n\n let mut bitplane = vec![0x00; pairs.len() * 2];\n\n pairs.iter().enumerate().for_each(|(i, pair)| {\n let x = (i / (height as usize * 8)) * 2;\n let y = i % (height as usize * 8);\n let new_i = (y * (height as usize * 8)) + x;\n\n bitplane[new_i] = (pair & 0x02) >> 0x01;\n bitplane[new_i + 1] = pair & 0x01;\n });\n\n Bitplane::from(bitplane)\n }\n\n pub fn encode_bitplane(width: u8, height: u8, bitplane: Bitplane) -> Vec<u8> {\n let mut output = vec![];\n let pixels: Vec<usize> = (0..(width * 8))\n .step_by(2)\n .map(|x| {\n (0..((height as usize) * 8))\n .map(move |y| (y * ((height as usize) * 8)) + (x as usize))\n })\n .flatten()\n .collect();\n let mut pairs = pixels\n .into_iter()\n .map(|i| (bitplane.data[i] << 0x01) | bitplane.data[i + 1])\n .peekable();\n\n let mut packet_type = match pairs.peek() {\n Some(&chunk) if chunk == 0x00 => 0x00,\n _ => 0x01,\n };\n\n output.push(packet_type);\n\n loop {\n if pairs.peek() == None {\n break;\n }\n\n if packet_type == 0x00 {\n \n\n let mut output_data = vec![];\n let run = {\n let mut run = 0;\n\n while pairs.peek() == Some(&0x00) {\n pairs.next();\n run += 1;\n }\n\n run as i32\n };\n let bits = if run == 0x01 {\n 1\n } else {\n (run as f32 + 1.0).log2().floor() as u32\n };\n let value = (run + 1) & !(1 << bits);\n let length = run - value - 1;\n\n (0..bits).for_each(|i| {\n let bit = ((length & (0x01 << (bits - i - 1))) >> (bits - i - 1)) as u8;\n\n output_data.push(bit);\n });\n\n (0..bits).for_each(|i| {\n let bit = ((value & (0x01 << (bits - i - 1))) >> (bits - i - 1)) as u8;\n\n output_data.push(bit);\n });\n\n output.append(&mut output_data);\n\n packet_type = 0x01;\n } else {\n \n\n let mut output_data = vec![];\n\n while pairs.peek() != Some(&0x00) {\n let pair = pairs.next().unwrap();\n\n output_data.push((pair & 0x02) >> 0x01);\n output_data.push(pair & 0x01);\n\n if pairs.peek() == None {\n break;\n }\n }\n\n output_data.push(0x00);\n output_data.push(0x00);\n\n output.append(&mut output_data);\n\n packet_type = 0x00;\n }\n }\n\n output\n }\n\n fn to_img(&self, format: ImageFormat, mirror: bool) -> Result<Vec<u8>> {\n let width = self.width as u32 * 8;\n let height = self.height as u32 * 8;\n\n let img = ImageBuffer::from_fn(width, height, |x, y| {\n let i = (y * width) + {\n if mirror {\n width - x - 1\n } else {\n x\n }\n };\n let pixel = (3 - self.pixels[i as usize]) * 0x55;\n\n Luma([pixel])\n });\n\n let img = DynamicImage::ImageLuma8(img);\n let mut buf = Vec::new();\n\n match img.write_to(&mut buf, format) {\n Ok(_) => {}\n Err(_) => return Err(error::Error::PicCouldNotWrite),\n }\n\n Ok(buf)\n }\n\n pub fn to_png(&self, mirror: bool) -> Result<Vec<u8>> {\n self.to_img(ImageFormat::Png, mirror)\n }\n\n pub fn to_jpeg(&self, mirror: bool) -> Result<Vec<u8>> {\n self.to_img(ImageFormat::Jpeg, mirror)\n }\n}\n"},"prefix":{"kind":"string","value":"\n\nmod bitplane;\nmod bitstream;\nmod encoding_method;\n\npub use encoding_method::EncodingMethod as PicEncodingMethod;\n\nuse crate::error::{self, Result};\nuse bitplane::*;\nuse bitstream::*;\nuse image::{self, DynamicImage, ImageBuffer, ImageFormat, Luma};\n\n#[derive(Clone, Debug, PartialEq)]\npub struct Pic {\n pub width: u8,\n pub height: u8,\n pub pixels: Vec<u8>,\n pub bytes: usize,\n pub encoding_method: PicEncodingMethod,\n}\n\nimpl Pic {\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n pub fn new(data: &[u8]) -> Result<Self> {\n let mut bitstream = Bitstream::from(data);\n\n let width = bitstream.get(4) as u8;\n let height = bitstream.get(4) as u8;\n\n let primary_buffer = bitstream.get(1) as u8;\n let mut bitplane_1 = Pic::decode_bitplane(width, height, &mut bitstream);\n let encoding_method = PicEncodingMethod::from(\n {\n if bitstream.get(1) == 0x00 {\n 0x01\n } else {\n if bitstream.get(1) == 0x00 {\n 0x02\n } else {\n 0x03\n }\n }\n },\n primary_buffer,\n );\n let mut bitplane_0 = Pic::decode_bitplane(width, height, &mut bitstream);\n\n match encoding_method {\n PicEncodingMethod::ONE(_) => {\n bitplane_1 = bitplane_1.delta_decode(width as usize * 8);\n bitplane_0 = bitplane_0.delta_decode(width as usize * 8);\n }\n PicEncodingMethod::TWO(_) => {\n bitplane_1 = bitplane_1.delta_decode(width as usize * 8);\n bitplane_0 = bitplane_0.clone() ^ bitplane_1.clone();\n }\n PicEncodingMethod::THREE(_) => {\n bitplane_1 = bitplane_1.delta_decode(width as usize * 8);\n bitplane_0 = bitplane_0.delta_decode(width as usize * 8);\n bitplane_0 = bitplane_0.clone() ^ bitplane_1.clone();\n }\n };\n\n let pixels = {\n if encoding_method.value() == 0x00 {\n (bitplane_0 << 0x01) | bitplane_1\n } else {\n (bitplane_1 << 0x01) | bitplane_0\n }\n };\n\n let bytes = ((bitstream.bits as f32) / 8.0).ceil() as usize;\n\n Ok(Pic {\n width,\n height,\n pixels: pixels.data,\n bytes,\n encoding_method,\n })\n }\n\n pub fn encode(&self, encoding_method: PicEncodingMethod) -> Vec<u8> {\n let width = self.width;\n let height = self.height;\n\n let (mut bitplane_0b, mut bitplane_1b) = if encoding_method.value() == 0x00 {\n let pixel_bitplane = Bitplane::from(self.pixels.to_vec());\n\n (\n (pixel_bitplane.clone() & 0x02) >> 0x01,\n pixel_bitplane.clone() & 0x01,\n )\n } else {\n let pixel_bitplane = Bitplane::from(self.pixels.to_vec());\n\n (\n pixel_bitplane.clone() & 0x01,\n (pixel_bitplane.clone() & 0x02) >> 0x01,\n )\n };\n\n let (bitplane_0a, bitplane_1a) = match encoding_method {\n PicEncodingMethod::ONE(_) => {\n let bitplane_1a = bitplane_1b.delta_encode(width as usize * 8);\n let bitplane_0a = bitplane_0b.delta_encode(width as usize * 8);\n\n (bitplane_0a, bitplane_1a)\n }\n PicEncodingMethod::TWO(_) => {\n let bitplane_1a = bitplane_1b.delta_encode(width as usize * 8);\n let bitplane_0a = bitplane_0b.clone() ^ bitplane_1b.clone();\n\n (bitplane_0a, bitplane_1a)\n }\n PicEncodingMethod::THREE(_) => {\n let bitplane_1a = bitplane_1b.delta_encode(width as usize * 8);\n let bitplane_0a = bitplane_0b.delta_encode(width as usize * 8);\n let bitplane_0a = bitplane_0a.clone() ^ bitplane_1a.clone();\n\n (bitplane_0a, bitplane_1a)\n }\n };\n\n let bitplane_0a_raw = Pic::encode_bitplane(width, height, bitplane_0a);\n let bitplane_1a_raw = Pic::encode_bitplane(width, height, bitplane_1a);\n\n let data_bits: Vec<u8> = [\n (0..=3)\n .map(|i| (width & (i << (3 - i))) >> (3 - i))\n .collect(),\n (0..=3)\n .map(|i| (height & (i << (3 - i))) >> (3 - i))\n .collect(),\n vec![encoding_method.value()],\n bitplane_1a_raw,\n encoding_method.to_vec(),\n bitplane_0a_raw,\n ]\n .concat();\n\n let data_bytes = ((data_bits.len() as f32) / 8.0).ceil() as usize;\n let extra_bits = (data_bytes * 8) - data_bits.len();\n let data_bits = [data_bits, vec![0x00; extra_bits]].concat();\n\n let data: Vec<u8> = (0..data_bytes)\n .map(|i| {\n let index = i * 8;\n\n data_bits[index..(index + 8)]\n .iter()\n .enumerate()\n .map(|(i, bit)| bit << (7 - i))\n .fold(0, |acc, val| acc | val)\n })\n .collect();\n\n data\n }\n\n fn from(data: Vec<u8>, format: ImageFormat) -> Result<Self> {\n let raw = match image::load_from_memory_with_format(&data, format) {\n Ok(img) => img,\n Err(_) => return Err(error::Error::PicCouldNotRead),\n };\n\n let img = match raw.as_luma8() {\n Some(img) => img,\n None => return Err(error::Error::PicCouldNotRead),\n };\n\n if img.width() % 8 != 0 || img.height() % 8 != 0 {\n return Err(error::Error::PicWrongSize);\n }\n\n let width = ((img.width() as f32) / 8.0) as u8;\n let height = ((img.height() as f32) / 8.0) as u8;\n let pixels: Vec<u8> = img\n .enumerate_pixels()\n .map(|(_, _, pixel)| {\n let pixel = 3 - (((pixel.0[0] as f32) / 85.0) as u8);\n\n pixel\n })\n .collect();\n\n let encoding_method = PicEncodingMethod::from(0x01, 0x00);\n\n "},"suffix":{"kind":"string","value":"\n }\n\n pub fn from_png(data: Vec<u8>) -> Result<Self> {\n Pic::from(data, ImageFormat::Png)\n }\n\n pub fn from_jpeg(data: Vec<u8>) -> Result<Self> {\n Pic::from(data, ImageFormat::Jpeg)\n }\n\n pub fn decode_bitplane(width: u8, height: u8, bitstream: &mut Bitstream) -> Bitplane {\n let mut pairs: Vec<u8> = vec![];\n let mut packet_type = bitstream.get(1);\n\n loop {\n if pairs.len() >= (width as u32 * height as u32 * 32) as usize {\n break;\n }\n\n if packet_type == 0x00 {\n \n let (length, bits) = bitstream.get_until_zero();\n let value = bitstream.get(bits);\n let run = length + value + 1;\n\n for _ in 0..run {\n pairs.push(0x00);\n }\n\n packet_type = 0x01;\n } else {\n \n loop {\n if pairs.len() >= (width as u32 * height as u32 * 32) as usize {\n break;\n }\n\n let pair = bitstream.get(2);\n\n if pair == 0x00 {\n break;\n }\n\n pairs.push(pair as u8);\n }\n\n packet_type = 0x00;\n }\n }\n\n let mut bitplane = vec![0x00; pairs.len() * 2];\n\n pairs.iter().enumerate().for_each(|(i, pair)| {\n let x = (i / (height as usize * 8)) * 2;\n let y = i % (height as usize * 8);\n let new_i = (y * (height as usize * 8)) + x;\n\n bitplane[new_i] = (pair & 0x02) >> 0x01;\n bitplane[new_i + 1] = pair & 0x01;\n });\n\n Bitplane::from(bitplane)\n }\n\n pub fn encode_bitplane(width: u8, height: u8, bitplane: Bitplane) -> Vec<u8> {\n let mut output = vec![];\n let pixels: Vec<usize> = (0..(width * 8))\n .step_by(2)\n .map(|x| {\n (0..((height as usize) * 8))\n .map(move |y| (y * ((height as usize) * 8)) + (x as usize))\n })\n .flatten()\n .collect();\n let mut pairs = pixels\n .into_iter()\n .map(|i| (bitplane.data[i] << 0x01) | bitplane.data[i + 1])\n .peekable();\n\n let mut packet_type = match pairs.peek() {\n Some(&chunk) if chunk == 0x00 => 0x00,\n _ => 0x01,\n };\n\n output.push(packet_type);\n\n loop {\n if pairs.peek() == None {\n break;\n }\n\n if packet_type == 0x00 {\n \n\n let mut output_data = vec![];\n let run = {\n let mut run = 0;\n\n while pairs.peek() == Some(&0x00) {\n pairs.next();\n run += 1;\n }\n\n run as i32\n };\n let bits = if run == 0x01 {\n 1\n } else {\n (run as f32 + 1.0).log2().floor() as u32\n };\n let value = (run + 1) & !(1 << bits);\n let length = run - value - 1;\n\n (0..bits).for_each(|i| {\n let bit = ((length & (0x01 << (bits - i - 1))) >> (bits - i - 1)) as u8;\n\n output_data.push(bit);\n });\n\n (0..bits).for_each(|i| {\n let bit = ((value & (0x01 << (bits - i - 1))) >> (bits - i - 1)) as u8;\n\n output_data.push(bit);\n });\n\n output.append(&mut output_data);\n\n packet_type = 0x01;\n } else {\n \n\n let mut output_data = vec![];\n\n while pairs.peek() != Some(&0x00) {\n let pair = pairs.next().unwrap();\n\n output_data.push((pair & 0x02) >> 0x01);\n output_data.push(pair & 0x01);\n\n if pairs.peek() == None {\n break;\n }\n }\n\n output_data.push(0x00);\n output_data.push(0x00);\n\n output.append(&mut output_data);\n\n packet_type = 0x00;\n }\n }\n\n output\n }\n\n fn to_img(&self, format: ImageFormat, mirror: bool) -> Result<Vec<u8>> {\n let width = self.width as u32 * 8;\n let height = self.height as u32 * 8;\n\n let img = ImageBuffer::from_fn(width, height, |x, y| {\n let i = (y * width) + {\n if mirror {\n width - x - 1\n } else {\n x\n }\n };\n let pixel = (3 - self.pixels[i as usize]) * 0x55;\n\n Luma([pixel])\n });\n\n let img = DynamicImage::ImageLuma8(img);\n let mut buf = Vec::new();\n\n match img.write_to(&mut buf, format) {\n Ok(_) => {}\n Err(_) => return Err(error::Error::PicCouldNotWrite),\n }\n\n Ok(buf)\n }\n\n pub fn to_png(&self, mirror: bool) -> Result<Vec<u8>> {\n self.to_img(ImageFormat::Png, mirror)\n }\n\n pub fn to_jpeg(&self, mirror: bool) -> Result<Vec<u8>> {\n self.to_img(ImageFormat::Jpeg, mirror)\n }\n}\n"},"middle":{"kind":"string","value":"Ok(Pic {\n width,\n height,\n pixels,\n bytes: 0,\n encoding_method,\n })"},"strategy":{"kind":"string","value":"call_expression"},"context_items":{"kind":"list like","value":[{"content":"pub fn get_data_raw(data: Data) -> Vec<u8> {\n\n let mut raw = Vec::new();\n\n\n\n data.stream_to(&mut raw).unwrap();\n\n\n\n raw\n\n}\n\n\n","file_path":"pkmnapi-api/src/utils.rs","rank":0,"score":323389.12652447517},{"content":"pub fn get_etag(if_match: Result<IfMatch, IfMatchError>) -> Result<String, ResponseError> {\n\n match if_match {\n\n Ok(if_match) => Ok(if_match.into_inner()),\n\n Err(_) => Err(ETagErrorMissing::new()),\n\n }\n\n}\n\n\n","file_path":"pkmnapi-api/src/utils.rs","rank":1,"score":249555.0115318573},{"content":"#[allow(dead_code)]\n\npub fn assert_unauthorized(response: &mut Response) -> Result<(), String> {\n\n let response_body = response.body_string().unwrap();\n\n let headers = response.headers();\n\n\n\n let body = json!({\n\n \"data\": {\n\n \"id\": \"error_access_tokens_unauthorized\",\n\n \"type\": \"errors\",\n\n \"attributes\": {\n\n \"message\": \"Authorization header must be set\"\n\n }\n\n }\n\n });\n\n\n\n assert_eq!(response_body, body.to_string());\n\n assert_eq!(response.status(), Status::Unauthorized);\n\n\n\n assert_headers(\n\n headers,\n\n vec![\n\n (\"Content-Type\", \"application/json\"),\n\n (\"Server\", \"pkmnapi/0.1.0\"),\n\n ],\n\n )\n\n}\n\n\n","file_path":"pkmnapi-api/tests/common.rs","rank":2,"score":243935.38348613508},{"content":"#[allow(dead_code)]\n\n#[allow(non_snake_case)]\n\npub fn load_rom() -> Vec<u8> {\n\n let PKMN_ROM = env::var(\"PKMN_ROM\")\n\n .expect(\"Set the PKMN_ROM environment variable to point to the ROM location\");\n\n\n\n fs::read(PKMN_ROM).unwrap()\n\n}\n\n\n","file_path":"pkmnapi-api/tests/common.rs","rank":3,"score":203748.85819862864},{"content":"#[allow(dead_code)]\n\n#[allow(non_snake_case)]\n\npub fn load_sav() -> Vec<u8> {\n\n let PKMN_SAV = env::var(\"PKMN_SAV\")\n\n .expect(\"Set the PKMN_SAV environment variable to point to the SAV location\");\n\n\n\n fs::read(PKMN_SAV).unwrap()\n\n}\n\n\n","file_path":"pkmnapi-api/tests/common.rs","rank":4,"score":203748.85819862864},{"content":"/// Generate eTag\n\n///\n\n/// # Example\n\n///\n\n/// ```\n\n/// use pkmnapi_sql::utils;\n\n///\n\n/// let etag = utils::etag(&\"bar\".to_owned().into_bytes());\n\n///\n\n/// assert_eq!(etag, \"w/\\\"37b51d194a7513e45b56f6524f2d51f2\\\"\");\n\n/// ```\n\npub fn etag(body: &Vec<u8>) -> String {\n\n let content = hash(body);\n\n\n\n format!(\"w/\\\"{}\\\"\", content)\n\n}\n","file_path":"pkmnapi-sql/src/utils.rs","rank":5,"score":191117.4623637281},{"content":"/// Generate hash string\n\n///\n\n/// # Example\n\n///\n\n/// ```\n\n/// use pkmnapi_sql::utils;\n\n///\n\n/// let hash = utils::hash(&\"bar\".to_owned().into_bytes());\n\n///\n\n/// assert_eq!(hash, \"37b51d194a7513e45b56f6524f2d51f2\");\n\n/// ```\n\npub fn hash(value: &Vec<u8>) -> String {\n\n format!(\"{:02x}\", md5::compute(value))\n\n}\n\n\n","file_path":"pkmnapi-sql/src/utils.rs","rank":6,"score":191117.28942506498},{"content":"#[get(\"/maps/pics/<map_id>\", format = \"image/jpeg\", rank = 2)]\n\npub fn get_map_pic_jpeg<'a>(\n\n sql: State<PkmnapiSQL>,\n\n _rate_limit: RateLimit,\n\n access_token: Result<AccessToken, AccessTokenError>,\n\n map_id: u8,\n\n) -> Result<Response<'a>, ResponseError> {\n\n let access_token = utils::get_access_token(access_token)?;\n\n let (db, _) = utils::get_db_with_applied_patches(&sql, &access_token)?;\n\n\n\n let map = db.get_map_pic(&map_id)?;\n\n let img = map.to_jpeg()?;\n\n\n\n let response = Response::build()\n\n .header(ContentType::JPEG)\n\n .header(Header::new(\n\n \"Content-Disposition\",\n\n format!(r#\"attachment; filename=\"map-{}.jpg\"\"#, map_id),\n\n ))\n\n .sized_body(Cursor::new(img))\n\n .finalize();\n\n\n\n Ok(response)\n\n}\n","file_path":"pkmnapi-api/src/routes/map_pics.rs","rank":7,"score":190423.58549159678},{"content":"#[get(\"/maps/pics/<map_id>\", format = \"image/png\", rank = 1)]\n\npub fn get_map_pic_png<'a>(\n\n sql: State<PkmnapiSQL>,\n\n _rate_limit: RateLimit,\n\n access_token: Result<AccessToken, AccessTokenError>,\n\n map_id: u8,\n\n) -> Result<Response<'a>, ResponseError> {\n\n let access_token = utils::get_access_token(access_token)?;\n\n let (db, _) = utils::get_db_with_applied_patches(&sql, &access_token)?;\n\n\n\n let map = db.get_map_pic(&map_id)?;\n\n let img = map.to_png()?;\n\n\n\n let response = Response::build()\n\n .header(ContentType::PNG)\n\n .header(Header::new(\n\n \"Content-Disposition\",\n\n format!(r#\"attachment; filename=\"map-{}.png\"\"#, map_id),\n\n ))\n\n .sized_body(Cursor::new(img))\n\n .finalize();\n\n\n\n Ok(response)\n\n}\n\n\n","file_path":"pkmnapi-api/src/routes/map_pics.rs","rank":8,"score":190423.58549159678},{"content":"#[get(\"/trainers/pics/<trainer_id>?<mirror>\", format = \"image/png\", rank = 1)]\n\npub fn get_trainer_pic_png<'a>(\n\n sql: State<PkmnapiSQL>,\n\n _rate_limit: RateLimit,\n\n access_token: Result<AccessToken, AccessTokenError>,\n\n trainer_id: u8,\n\n mirror: Option<bool>,\n\n) -> Result<Response<'a>, ResponseError> {\n\n let access_token = utils::get_access_token(access_token)?;\n\n let (db, _) = utils::get_db_with_applied_patches(&sql, &access_token)?;\n\n\n\n let pic = db.get_trainer_pic(&trainer_id)?;\n\n let trainer_name = db.get_trainer_name(&trainer_id)?;\n\n let img = pic.to_png(mirror.is_some())?;\n\n\n\n let response = Response::build()\n\n .header(ContentType::PNG)\n\n .header(Header::new(\n\n \"Content-Disposition\",\n\n format!(r#\"attachment; filename=\"{}.png\"\"#, trainer_name.name),\n\n ))\n","file_path":"pkmnapi-api/src/routes/trainer_pics.rs","rank":9,"score":190423.4429910677},{"content":"pub fn get_pokemon_pic_png<'a>(\n\n sql: State<PkmnapiSQL>,\n\n _rate_limit: RateLimit,\n\n access_token: Result<AccessToken, AccessTokenError>,\n\n pokedex_id: u8,\n\n face: Option<String>,\n\n mirror: Option<bool>,\n\n) -> Result<Response<'a>, ResponseError> {\n\n let access_token = utils::get_access_token(access_token)?;\n\n let (db, _) = utils::get_db_with_applied_patches(&sql, &access_token)?;\n\n\n\n let pic = db.get_pokemon_pic(&pokedex_id, &PokemonPicFace::from(face))?;\n\n let pokemon_name = db.get_pokemon_name(&pokedex_id)?;\n\n let img = pic.to_png(mirror.is_some())?;\n\n\n\n let response = Response::build()\n\n .header(ContentType::PNG)\n\n .header(Header::new(\n\n \"Content-Disposition\",\n\n format!(r#\"attachment; filename=\"{}.png\"\"#, pokemon_name.name),\n","file_path":"pkmnapi-api/src/routes/pokemon_pics.rs","rank":10,"score":190412.1779769486},{"content":"pub fn get_pokemon_pic_jpeg<'a>(\n\n sql: State<PkmnapiSQL>,\n\n _rate_limit: RateLimit,\n\n access_token: Result<AccessToken, AccessTokenError>,\n\n pokedex_id: u8,\n\n face: Option<String>,\n\n mirror: Option<bool>,\n\n) -> Result<Response<'a>, ResponseError> {\n\n let access_token = utils::get_access_token(access_token)?;\n\n let (db, _) = utils::get_db_with_applied_patches(&sql, &access_token)?;\n\n\n\n let pic = db.get_pokemon_pic(&pokedex_id, &PokemonPicFace::from(face))?;\n\n let pokemon_name = db.get_pokemon_name(&pokedex_id)?;\n\n let img = pic.to_jpeg(mirror.is_some())?;\n\n\n\n let response = Response::build()\n\n .header(ContentType::JPEG)\n\n .header(Header::new(\n\n \"Content-Disposition\",\n\n format!(r#\"attachment; filename=\"{}.jpg\"\"#, pokemon_name.name),\n","file_path":"pkmnapi-api/src/routes/pokemon_pics.rs","rank":11,"score":190412.1779769486},{"content":"pub fn post_pokemon_pic_jpeg<'a>(\n\n sql: State<PkmnapiSQL>,\n\n _rate_limit: RateLimit,\n\n data: Data,\n\n access_token: Result<AccessToken, AccessTokenError>,\n\n patch_description: Result<PatchDescription, PatchDescriptionError>,\n\n pokedex_id: u8,\n\n face: Option<String>,\n\n method: Option<u8>,\n\n primary: Option<u8>,\n\n) -> Result<status::Accepted<JsonValue>, ResponseError> {\n\n let access_token = utils::get_access_token(access_token)?;\n\n let (db, connection) = utils::get_db(&sql, &access_token)?;\n\n let raw_data = utils::get_data_raw(data);\n\n\n\n let pic = Pic::from_jpeg(raw_data)?;\n\n let encoding_method = PicEncodingMethod::from(method.unwrap_or(0x01), primary.unwrap_or(0x00));\n\n let patch = db.set_pokemon_pic(\n\n &pokedex_id,\n\n &PokemonPicFace::from(face),\n","file_path":"pkmnapi-api/src/routes/pokemon_pics.rs","rank":12,"score":190412.1779769486},{"content":"pub fn post_pokemon_pic_png<'a>(\n\n sql: State<PkmnapiSQL>,\n\n _rate_limit: RateLimit,\n\n data: Data,\n\n access_token: Result<AccessToken, AccessTokenError>,\n\n patch_description: Result<PatchDescription, PatchDescriptionError>,\n\n pokedex_id: u8,\n\n face: Option<String>,\n\n method: Option<u8>,\n\n primary: Option<u8>,\n\n) -> Result<status::Accepted<JsonValue>, ResponseError> {\n\n let access_token = utils::get_access_token(access_token)?;\n\n let (db, connection) = utils::get_db(&sql, &access_token)?;\n\n let raw_data = utils::get_data_raw(data);\n\n\n\n let pic = Pic::from_png(raw_data)?;\n\n let encoding_method = PicEncodingMethod::from(method.unwrap_or(0x01), primary.unwrap_or(0x00));\n\n let patch = db.set_pokemon_pic(\n\n &pokedex_id,\n\n &PokemonPicFace::from(face),\n","file_path":"pkmnapi-api/src/routes/pokemon_pics.rs","rank":13,"score":190412.1779769486},{"content":"pub fn post_trainer_pic_png<'a>(\n\n sql: State<PkmnapiSQL>,\n\n _rate_limit: RateLimit,\n\n data: Data,\n\n access_token: Result<AccessToken, AccessTokenError>,\n\n patch_description: Result<PatchDescription, PatchDescriptionError>,\n\n trainer_id: u8,\n\n method: Option<u8>,\n\n primary: Option<u8>,\n\n) -> Result<status::Accepted<JsonValue>, ResponseError> {\n\n let access_token = utils::get_access_token(access_token)?;\n\n let (db, connection) = utils::get_db(&sql, &access_token)?;\n\n let raw_data = utils::get_data_raw(data);\n\n\n\n let pic = Pic::from_png(raw_data)?;\n\n let encoding_method = PicEncodingMethod::from(method.unwrap_or(0x01), primary.unwrap_or(0x00));\n\n let patch = db.set_trainer_pic(&trainer_id, &pic, encoding_method)?;\n\n\n\n utils::insert_rom_patch(\n\n sql,\n","file_path":"pkmnapi-api/src/routes/trainer_pics.rs","rank":14,"score":190412.1779769486},{"content":"pub fn post_trainer_pic_jpeg<'a>(\n\n sql: State<PkmnapiSQL>,\n\n _rate_limit: RateLimit,\n\n data: Data,\n\n access_token: Result<AccessToken, AccessTokenError>,\n\n patch_description: Result<PatchDescription, PatchDescriptionError>,\n\n trainer_id: u8,\n\n method: Option<u8>,\n\n primary: Option<u8>,\n\n) -> Result<status::Accepted<JsonValue>, ResponseError> {\n\n let access_token = utils::get_access_token(access_token)?;\n\n let (db, connection) = utils::get_db(&sql, &access_token)?;\n\n let raw_data = utils::get_data_raw(data);\n\n\n\n let pic = Pic::from_jpeg(raw_data)?;\n\n let encoding_method = PicEncodingMethod::from(method.unwrap_or(0x01), primary.unwrap_or(0x00));\n\n let patch = db.set_trainer_pic(&trainer_id, &pic, encoding_method)?;\n\n\n\n utils::insert_rom_patch(\n\n sql,\n\n connection,\n\n access_token,\n\n patch,\n\n patch_description,\n\n BaseErrorResponseId::error_trainer_pics,\n\n )?;\n\n\n\n Ok(status::Accepted(Some(json!({}))))\n\n}\n","file_path":"pkmnapi-api/src/routes/trainer_pics.rs","rank":15,"score":190412.1779769486},{"content":"pub fn get_trainer_pic_jpeg<'a>(\n\n sql: State<PkmnapiSQL>,\n\n _rate_limit: RateLimit,\n\n access_token: Result<AccessToken, AccessTokenError>,\n\n trainer_id: u8,\n\n mirror: Option<bool>,\n\n) -> Result<Response<'a>, ResponseError> {\n\n let access_token = utils::get_access_token(access_token)?;\n\n let (db, _) = utils::get_db_with_applied_patches(&sql, &access_token)?;\n\n\n\n let pic = db.get_trainer_pic(&trainer_id)?;\n\n let trainer_name = db.get_trainer_name(&trainer_id)?;\n\n let img = pic.to_jpeg(mirror.is_some())?;\n\n\n\n let response = Response::build()\n\n .header(ContentType::JPEG)\n\n .header(Header::new(\n\n \"Content-Disposition\",\n\n format!(r#\"attachment; filename=\"{}.jpg\"\"#, trainer_name.name),\n\n ))\n","file_path":"pkmnapi-api/src/routes/trainer_pics.rs","rank":16,"score":190412.1779769486},{"content":"pub fn get_data<T>(\n\n data: Result<Json<T>, JsonError>,\n\n error_id: BaseErrorResponseId,\n\n) -> Result<T, ResponseError> {\n\n match data {\n\n Ok(data) => Ok(data.into_inner()),\n\n Err(JsonError::Parse(_, e)) => {\n\n return Err(BadRequestError::new(error_id, Some(e.to_string())));\n\n }\n\n _ => {\n\n return Err(BadRequestError::new(\n\n error_id,\n\n Some(\"An unknown error occurred\".to_owned()),\n\n ));\n\n }\n\n }\n\n}\n\n\n","file_path":"pkmnapi-api/src/utils.rs","rank":17,"score":187959.07458001777},{"content":"#[post(\"/imgs/pokemon_logo\", format = \"image/png\", data = \"<data>\", rank = 1)]\n\npub fn post_pokemon_logo_png<'a>(\n\n sql: State<PkmnapiSQL>,\n\n _rate_limit: RateLimit,\n\n data: Data,\n\n access_token: Result<AccessToken, AccessTokenError>,\n\n patch_description: Result<PatchDescription, PatchDescriptionError>,\n\n) -> Result<status::Accepted<JsonValue>, ResponseError> {\n\n let access_token = utils::get_access_token(access_token)?;\n\n let (db, connection) = utils::get_db(&sql, &access_token)?;\n\n let raw_data = utils::get_data_raw(data);\n\n\n\n let img = Img::from_png(raw_data)?;\n\n let patch = db.set_pokemon_logo_img(&img)?;\n\n\n\n utils::insert_rom_patch(\n\n sql,\n\n connection,\n\n access_token,\n\n patch,\n\n patch_description,\n\n BaseErrorResponseId::error_pokemon_logo_imgs,\n\n )?;\n\n\n\n Ok(status::Accepted(Some(json!({}))))\n\n}\n\n\n","file_path":"pkmnapi-api/src/routes/imgs.rs","rank":18,"score":181059.44703563934},{"content":"#[post(\"/imgs/pokemon_logo\", format = \"image/jpeg\", data = \"<data>\", rank = 2)]\n\npub fn post_pokemon_logo_jpeg<'a>(\n\n sql: State<PkmnapiSQL>,\n\n _rate_limit: RateLimit,\n\n data: Data,\n\n access_token: Result<AccessToken, AccessTokenError>,\n\n patch_description: Result<PatchDescription, PatchDescriptionError>,\n\n) -> Result<status::Accepted<JsonValue>, ResponseError> {\n\n let access_token = utils::get_access_token(access_token)?;\n\n let (db, connection) = utils::get_db(&sql, &access_token)?;\n\n let raw_data = utils::get_data_raw(data);\n\n\n\n let img = Img::from_jpeg(raw_data)?;\n\n let patch = db.set_pokemon_logo_img(&img)?;\n\n\n\n utils::insert_rom_patch(\n\n sql,\n\n connection,\n\n access_token,\n\n patch,\n\n patch_description,\n\n BaseErrorResponseId::error_pokemon_logo_imgs,\n\n )?;\n\n\n\n Ok(status::Accepted(Some(json!({}))))\n\n}\n\n\n","file_path":"pkmnapi-api/src/routes/imgs.rs","rank":19,"score":181059.44703563934},{"content":"#[get(\"/imgs/pokemon_logo\", format = \"image/jpeg\", rank = 2)]\n\npub fn get_pokemon_logo_jpeg<'a>(\n\n sql: State<PkmnapiSQL>,\n\n _rate_limit: RateLimit,\n\n access_token: Result<AccessToken, AccessTokenError>,\n\n) -> Result<Response<'a>, ResponseError> {\n\n let access_token = utils::get_access_token(access_token)?;\n\n let (db, _) = utils::get_db_with_applied_patches(&sql, &access_token)?;\n\n\n\n let pokemon_logo = db.get_pokemon_logo_img()?;\n\n let img = pokemon_logo.to_jpeg()?;\n\n\n\n let response = Response::build()\n\n .header(ContentType::JPEG)\n\n .header(Header::new(\n\n \"Content-Disposition\",\n\n r#\"attachment; filename=\"pokemon_logo.jpg\"\"#,\n\n ))\n\n .sized_body(Cursor::new(img))\n\n .finalize();\n\n\n\n Ok(response)\n\n}\n\n\n","file_path":"pkmnapi-api/src/routes/imgs.rs","rank":20,"score":181053.21488653042},{"content":"#[get(\"/imgs/town_map\", format = \"image/png\", rank = 1)]\n\npub fn get_town_map_png<'a>(\n\n sql: State<PkmnapiSQL>,\n\n _rate_limit: RateLimit,\n\n access_token: Result<AccessToken, AccessTokenError>,\n\n) -> Result<Response<'a>, ResponseError> {\n\n let access_token = utils::get_access_token(access_token)?;\n\n let (db, _) = utils::get_db_with_applied_patches(&sql, &access_token)?;\n\n\n\n let town_map = db.get_town_map_img()?;\n\n let img = town_map.to_png()?;\n\n\n\n let response = Response::build()\n\n .header(ContentType::PNG)\n\n .header(Header::new(\n\n \"Content-Disposition\",\n\n r#\"attachment; filename=\"town_map.png\"\"#,\n\n ))\n\n .sized_body(Cursor::new(img))\n\n .finalize();\n\n\n\n Ok(response)\n\n}\n\n\n","file_path":"pkmnapi-api/src/routes/imgs.rs","rank":21,"score":181053.21488653042},{"content":"#[get(\"/imgs/game_boy\", format = \"image/jpeg\", rank = 2)]\n\npub fn get_game_boy_jpeg<'a>(\n\n sql: State<PkmnapiSQL>,\n\n _rate_limit: RateLimit,\n\n access_token: Result<AccessToken, AccessTokenError>,\n\n) -> Result<Response<'a>, ResponseError> {\n\n let access_token = utils::get_access_token(access_token)?;\n\n let (db, _) = utils::get_db_with_applied_patches(&sql, &access_token)?;\n\n\n\n let game_boy = db.get_game_boy_img()?;\n\n let img = game_boy.to_jpeg()?;\n\n\n\n let response = Response::build()\n\n .header(ContentType::JPEG)\n\n .header(Header::new(\n\n \"Content-Disposition\",\n\n r#\"attachment; filename=\"game_boy.jpg\"\"#,\n\n ))\n\n .sized_body(Cursor::new(img))\n\n .finalize();\n\n\n\n Ok(response)\n\n}\n\n\n","file_path":"pkmnapi-api/src/routes/imgs.rs","rank":22,"score":181053.21488653042},{"content":"#[get(\"/imgs/game_boy\", format = \"image/png\", rank = 1)]\n\npub fn get_game_boy_png<'a>(\n\n sql: State<PkmnapiSQL>,\n\n _rate_limit: RateLimit,\n\n access_token: Result<AccessToken, AccessTokenError>,\n\n) -> Result<Response<'a>, ResponseError> {\n\n let access_token = utils::get_access_token(access_token)?;\n\n let (db, _) = utils::get_db_with_applied_patches(&sql, &access_token)?;\n\n\n\n let game_boy = db.get_game_boy_img()?;\n\n let img = game_boy.to_png()?;\n\n\n\n let response = Response::build()\n\n .header(ContentType::PNG)\n\n .header(Header::new(\n\n \"Content-Disposition\",\n\n r#\"attachment; filename=\"game_boy.png\"\"#,\n\n ))\n\n .sized_body(Cursor::new(img))\n\n .finalize();\n\n\n\n Ok(response)\n\n}\n\n\n","file_path":"pkmnapi-api/src/routes/imgs.rs","rank":23,"score":181053.21488653042},{"content":"#[get(\"/imgs/town_map\", format = \"image/jpeg\", rank = 2)]\n\npub fn get_town_map_jpeg<'a>(\n\n sql: State<PkmnapiSQL>,\n\n _rate_limit: RateLimit,\n\n access_token: Result<AccessToken, AccessTokenError>,\n\n) -> Result<Response<'a>, ResponseError> {\n\n let access_token = utils::get_access_token(access_token)?;\n\n let (db, _) = utils::get_db_with_applied_patches(&sql, &access_token)?;\n\n\n\n let town_map = db.get_town_map_img()?;\n\n let img = town_map.to_jpeg()?;\n\n\n\n let response = Response::build()\n\n .header(ContentType::JPEG)\n\n .header(Header::new(\n\n \"Content-Disposition\",\n\n r#\"attachment; filename=\"town_map.jpg\"\"#,\n\n ))\n\n .sized_body(Cursor::new(img))\n\n .finalize();\n\n\n\n Ok(response)\n\n}\n","file_path":"pkmnapi-api/src/routes/imgs.rs","rank":24,"score":181053.21488653042},{"content":"#[get(\"/imgs/pokemon_logo\", format = \"image/png\", rank = 1)]\n\npub fn get_pokemon_logo_png<'a>(\n\n sql: State<PkmnapiSQL>,\n\n _rate_limit: RateLimit,\n\n access_token: Result<AccessToken, AccessTokenError>,\n\n) -> Result<Response<'a>, ResponseError> {\n\n let access_token = utils::get_access_token(access_token)?;\n\n let (db, _) = utils::get_db_with_applied_patches(&sql, &access_token)?;\n\n\n\n let pokemon_logo = db.get_pokemon_logo_img()?;\n\n let img = pokemon_logo.to_png()?;\n\n\n\n let response = Response::build()\n\n .header(ContentType::PNG)\n\n .header(Header::new(\n\n \"Content-Disposition\",\n\n r#\"attachment; filename=\"pokemon_logo.png\"\"#,\n\n ))\n\n .sized_body(Cursor::new(img))\n\n .finalize();\n\n\n\n Ok(response)\n\n}\n\n\n","file_path":"pkmnapi-api/src/routes/imgs.rs","rank":25,"score":181053.21488653042},{"content":"#[get(\"/roms/patches?<checksum>\", format = \"application/patch\", rank = 2)]\n\npub fn get_rom_patches_raw<'a>(\n\n sql: State<PkmnapiSQL>,\n\n _rate_limit: RateLimit,\n\n access_token: Result<AccessToken, AccessTokenError>,\n\n checksum: Option<bool>,\n\n) -> Result<Response<'a>, ResponseError> {\n\n let access_token = utils::get_access_token(access_token)?;\n\n let (db, connection) = utils::get_db_with_applied_patches(&sql, &access_token)?;\n\n\n\n let patches = match sql.select_rom_patches_by_access_token(&connection, &access_token) {\n\n Ok(patches) => patches,\n\n Err(_) => return Err(RomErrorNoRom::new()),\n\n };\n\n\n\n let header = \"PATCH\".chars().map(|c| c as u8).collect::<Vec<u8>>();\n\n let footer = \"EOF\".chars().map(|c| c as u8).collect::<Vec<u8>>();\n\n let mut body: Vec<u8> = patches\n\n .iter()\n\n .map(|patch| patch.data.to_vec())\n\n .flatten()\n","file_path":"pkmnapi-api/src/routes/rom_patches.rs","rank":26,"score":177905.3978717887},{"content":"#[catch(404)]\n\npub fn not_found(_req: &Request) -> Result<ResponseError, ResponseError> {\n\n Ok(NotFoundError::new(\n\n BaseErrorResponseId::error_not_found,\n\n None,\n\n ))\n\n}\n\n\n","file_path":"pkmnapi-api/src/routes/errors.rs","rank":27,"score":175409.46576456228},{"content":"/// Generate random ID of size length\n\n///\n\n/// # Example\n\n///\n\n/// ```\n\n/// use pkmnapi_sql::utils::*;\n\n///\n\n/// let id = random_id(32);\n\n///\n\n/// assert_eq!(id.len(), 32);\n\n///\n\n/// let id = random_id(64);\n\n///\n\n/// assert_eq!(id.len(), 64);\n\n/// ```\n\npub fn random_id(length: usize) -> String {\n\n let mut rng = thread_rng();\n\n\n\n iter::repeat(())\n\n .map(|()| rng.sample(Alphanumeric))\n\n .take(length)\n\n .collect()\n\n}\n\n\n","file_path":"pkmnapi-sql/src/utils.rs","rank":28,"score":174260.8970826909},{"content":"#[allow(dead_code)]\n\npub fn test_raw<T>(test: T) -> ()\n\nwhere\n\n T: FnOnce() -> Result<(), String> + panic::UnwindSafe,\n\n{\n\n let result = panic::catch_unwind(panic::AssertUnwindSafe(|| {\n\n test().unwrap();\n\n }));\n\n\n\n assert!(result.is_ok())\n\n}\n\n\n","file_path":"pkmnapi-api/tests/common.rs","rank":29,"score":174247.5950707791},{"content":"#[allow(dead_code)]\n\npub fn assert_headers(headers: &HeaderMap<'_>, expected: Vec<(&str, &str)>) -> Result<(), String> {\n\n let mut headers = headers.clone();\n\n\n\n for (key, val) in &expected {\n\n let header = match headers.get_one(key) {\n\n Some(header) => header,\n\n None => return Err(format!(\"Could not find header: {}\", key)),\n\n };\n\n\n\n if val.len() != 0 {\n\n assert_eq!(header, *val);\n\n }\n\n\n\n headers.remove(key);\n\n }\n\n\n\n for header in headers.iter() {\n\n panic!(\"Extra header found: {}\", header);\n\n }\n\n\n\n Ok(())\n\n}\n\n\n","file_path":"pkmnapi-api/tests/common.rs","rank":30,"score":173741.5681792749},{"content":"#[catch(429)]\n\npub fn too_many_requests<'a>(req: &Request) -> Result<Response<'a>, ResponseError> {\n\n let wait_time = match req.guard::<RateLimit>() {\n\n Outcome::Failure((_, RateLimitError::TooManyRequests(wait_time))) => wait_time,\n\n _ => 0,\n\n };\n\n\n\n let response = TooManyRequestsError::new(wait_time);\n\n let body = serde_json::to_string(&response).unwrap();\n\n\n\n let response = Response::build()\n\n .status(Status::TooManyRequests)\n\n .header(ContentType::JSON)\n\n .sized_body(Cursor::new(body))\n\n .finalize();\n\n\n\n Ok(response)\n\n}\n\n\n","file_path":"pkmnapi-api/src/routes/errors.rs","rank":31,"score":169475.90695515898},{"content":"#[catch(500)]\n\npub fn internal_server_error<'a>(_req: &Request) -> Result<Response<'a>, ResponseError> {\n\n let response = InternalServerError::new();\n\n let body = serde_json::to_string(&response).unwrap();\n\n\n\n let response = Response::build()\n\n .status(Status::InternalServerError)\n\n .header(ContentType::JSON)\n\n .sized_body(Cursor::new(body))\n\n .finalize();\n\n\n\n Ok(response)\n\n}\n","file_path":"pkmnapi-api/src/routes/errors.rs","rank":32,"score":166792.19339796045},{"content":"pub fn from_numeric_str<'de, T, D>(deserializer: D) -> Result<T, D::Error>\n\nwhere\n\n T: FromStr,\n\n T::Err: Display,\n\n D: Deserializer<'de>,\n\n{\n\n let s = String::deserialize(deserializer)?;\n\n\n\n T::from_str(&s).map_err(de::Error::custom)\n\n}\n","file_path":"pkmnapi-api/src/utils.rs","rank":33,"score":159600.41422436095},{"content":"pub fn get_db(\n\n sql: &State<PkmnapiSQL>,\n\n access_token: &String,\n\n) -> Result<(PkmnapiDB, PgPooledConnection), ResponseError> {\n\n let connection = sql.get_connection().unwrap();\n\n let rom_data = match sql.select_user_rom_data_by_access_token(&connection, &access_token) {\n\n Ok(Some(rom_data)) => rom_data,\n\n Ok(None) => return Err(RomErrorNoRom::new()),\n\n _ => {\n\n return Err(AccessTokenErrorInvalid::new(\n\n &\"Invalid access token\".to_owned(),\n\n ))\n\n }\n\n };\n\n\n\n let mut db = PkmnapiDB::new(&rom_data.data);\n\n\n\n match sql.select_user_sav_by_access_token(&connection, &access_token) {\n\n Ok(Some(sav)) => {\n\n db.sav(sav.data);\n","file_path":"pkmnapi-api/src/utils.rs","rank":34,"score":145996.01461366832},{"content":"#[openapi]\n\n#[post(\"/trades/<trade_id>\", format = \"application/json\", data = \"<data>\")]\n\npub fn post_trade(\n\n sql: State<PkmnapiSQL>,\n\n _rate_limit: RateLimit,\n\n access_token: Result<AccessToken, AccessTokenError>,\n\n patch_description: Result<PatchDescription, PatchDescriptionError>,\n\n data: Result<Json<TradeRequest>, JsonError>,\n\n trade_id: u8,\n\n) -> Result<status::Accepted<JsonValue>, ResponseError> {\n\n let access_token = utils::get_access_token(access_token)?;\n\n let data = utils::get_data(data, BaseErrorResponseId::error_trades_invalid)?;\n\n let (db, connection) = utils::get_db(&sql, &access_token)?;\n\n\n\n let trade = Trade::new(\n\n data.get_give_pokedex_id(),\n\n data.get_get_pokedex_id(),\n\n data.get_nickname(),\n\n );\n\n\n\n let patch = db.set_trade(&trade_id, &trade)?;\n\n\n","file_path":"pkmnapi-api/src/routes/trades.rs","rank":35,"score":143543.29184331253},{"content":"#[openapi]\n\n#[delete(\"/roms\")]\n\npub fn delete_rom(\n\n sql: State<PkmnapiSQL>,\n\n _rate_limit: RateLimit,\n\n access_token: Result<AccessToken, AccessTokenError>,\n\n if_match: Result<IfMatch, IfMatchError>,\n\n) -> Result<status::NoContent, ResponseError> {\n\n let access_token = utils::get_access_token(access_token)?;\n\n let etag = utils::get_etag(if_match)?;\n\n let connection = sql.get_connection().unwrap();\n\n\n\n match sql.delete_user_rom_by_access_token(&connection, &access_token, &etag) {\n\n Ok(_) => {}\n\n Err(pkmnapi_sql::error::Error::ETagError) => return Err(ETagErrorMismatch::new()),\n\n Err(_) => return Err(RomErrorNoRom::new()),\n\n }\n\n\n\n Ok(status::NoContent)\n\n}\n","file_path":"pkmnapi-api/src/routes/roms.rs","rank":36,"score":143531.09523317707},{"content":"pub fn get_access_token(\n\n access_token: Result<AccessToken, AccessTokenError>,\n\n) -> Result<String, ResponseError> {\n\n match access_token {\n\n Ok(access_token) => Ok(access_token.into_inner()),\n\n Err(_) => Err(AccessTokenErrorUnauthorized::new()),\n\n }\n\n}\n\n\n","file_path":"pkmnapi-api/src/utils.rs","rank":37,"score":143531.09523317707},{"content":"#[openapi]\n\n#[get(\"/trades/<trade_id>\")]\n\npub fn get_trade(\n\n sql: State<PkmnapiSQL>,\n\n _rate_limit: RateLimit,\n\n access_token: Result<AccessToken, AccessTokenError>,\n\n trade_id: u8,\n\n) -> Result<Json<TradeResponse>, ResponseError> {\n\n let access_token = utils::get_access_token(access_token)?;\n\n let (db, _) = utils::get_db_with_applied_patches(&sql, &access_token)?;\n\n\n\n let trade = db.get_trade(&trade_id)?;\n\n let pokedex_ids = vec![trade.give_pokedex_id, trade.get_pokedex_id];\n\n let pokemon_names = db.get_pokemon_name_all(&pokedex_ids)?;\n\n\n\n let response = TradeResponse::new(&trade_id, &trade, &pokemon_names);\n\n\n\n Ok(Json(response))\n\n}\n\n\n","file_path":"pkmnapi-api/src/routes/trades.rs","rank":38,"score":143531.09523317707},{"content":"pub fn insert_rom_patch(\n\n sql: State<PkmnapiSQL>,\n\n connection: PgPooledConnection,\n\n access_token: String,\n\n patch: Patch,\n\n patch_description: Result<PatchDescription, PatchDescriptionError>,\n\n error_id: BaseErrorResponseId,\n\n) -> Result<(), ResponseError> {\n\n let patch_description = get_patch_description(patch_description);\n\n\n\n match sql.insert_rom_patch(\n\n &connection,\n\n &access_token,\n\n &patch.to_raw(),\n\n patch_description,\n\n ) {\n\n Ok(_) => Ok(()),\n\n Err(e) => return Err(NotFoundError::new(error_id, Some(e.to_string()))),\n\n }\n\n}\n\n\n","file_path":"pkmnapi-api/src/utils.rs","rank":39,"score":143531.09523317707},{"content":"#[openapi]\n\n#[get(\"/trades\")]\n\npub fn get_trade_all(\n\n sql: State<PkmnapiSQL>,\n\n _rate_limit: RateLimit,\n\n access_token: Result<AccessToken, AccessTokenError>,\n\n) -> Result<Json<TradeResponseAll>, ResponseError> {\n\n let access_token = utils::get_access_token(access_token)?;\n\n let (db, _) = utils::get_db_with_applied_patches(&sql, &access_token)?;\n\n\n\n let (min_trade_id, max_trade_id) = db.trade_id_bounds();\n\n let trade_ids: Vec<u8> = (min_trade_id..=max_trade_id)\n\n .map(|trade_id| trade_id as u8)\n\n .collect();\n\n let trades = db.get_trade_all(&trade_ids)?;\n\n let pokedex_ids = trades\n\n .iter()\n\n .map(|(_, trade)| vec![trade.give_pokedex_id, trade.get_pokedex_id])\n\n .flatten()\n\n .collect();\n\n let pokemon_names = db.get_pokemon_name_all(&pokedex_ids)?;\n\n\n\n let response = TradeResponseAll::new(&trade_ids, &trades, &pokemon_names);\n\n\n\n Ok(Json(response))\n\n}\n\n\n","file_path":"pkmnapi-api/src/routes/trades.rs","rank":40,"score":143531.09523317707},{"content":"#[openapi]\n\n#[delete(\"/savs\")]\n\npub fn delete_sav(\n\n sql: State<PkmnapiSQL>,\n\n _rate_limit: RateLimit,\n\n access_token: Result<AccessToken, AccessTokenError>,\n\n if_match: Result<IfMatch, IfMatchError>,\n\n) -> Result<status::NoContent, ResponseError> {\n\n let access_token = utils::get_access_token(access_token)?;\n\n let etag = utils::get_etag(if_match)?;\n\n let connection = sql.get_connection().unwrap();\n\n\n\n match sql.delete_user_sav_by_access_token(&connection, &access_token, &etag) {\n\n Ok(_) => {}\n\n Err(pkmnapi_sql::error::Error::ETagError) => return Err(ETagErrorMismatch::new()),\n\n Err(_) => return Err(SavErrorNoSav::new()),\n\n }\n\n\n\n Ok(status::NoContent)\n\n}\n","file_path":"pkmnapi-api/src/routes/savs.rs","rank":41,"score":143531.09523317707},{"content":"pub fn get_patch_description(\n\n patch_description: Result<PatchDescription, PatchDescriptionError>,\n\n) -> Option<String> {\n\n match patch_description {\n\n Ok(patch_description) => patch_description.into_inner(),\n\n Err(_) => None,\n\n }\n\n}\n\n\n","file_path":"pkmnapi-api/src/utils.rs","rank":42,"score":143531.09523317707},{"content":"pub fn setup() -> Client {\n\n let api = Pkmnapi::init();\n\n let client = Client::new(api).unwrap();\n\n\n\n client\n\n}\n\n\n","file_path":"pkmnapi-api/tests/common.rs","rank":43,"score":141430.748405605},{"content":"pub fn get_db_with_applied_patches(\n\n sql: &State<PkmnapiSQL>,\n\n access_token: &String,\n\n) -> Result<(PkmnapiDB, PgPooledConnection), ResponseError> {\n\n let (mut db, connection) = get_db(sql, access_token)?;\n\n\n\n let rom_patches = match sql.select_rom_patches_by_access_token(&connection, &access_token) {\n\n Ok(patches) => patches,\n\n Err(_) => vec![],\n\n };\n\n\n\n let sav_patches = match sql.select_sav_patches_by_access_token(&connection, &access_token) {\n\n Ok(patches) => patches,\n\n Err(_) => vec![],\n\n };\n\n\n\n for patch in rom_patches {\n\n db.apply_patch(patch.data);\n\n }\n\n\n\n if let Some(ref mut sav) = db.sav {\n\n for patch in sav_patches {\n\n sav.apply_patch(patch.data);\n\n }\n\n }\n\n\n\n Ok((db, connection))\n\n}\n\n\n","file_path":"pkmnapi-api/src/utils.rs","rank":44,"score":141184.622873297},{"content":"#[post(\"/savs\", data = \"<data>\")]\n\npub fn post_sav<'a>(\n\n sql: State<PkmnapiSQL>,\n\n _rate_limit: RateLimit,\n\n data: Data,\n\n access_token: Result<AccessToken, AccessTokenError>,\n\n) -> Result<Response<'a>, ResponseError> {\n\n let access_token = utils::get_access_token(access_token)?;\n\n let sav = utils::get_data_raw(data);\n\n\n\n if let Err(_) = Sav::new(&sav) {\n\n return Err(SavErrorInvalidSav::new());\n\n }\n\n\n\n let connection = sql.get_connection().unwrap();\n\n let sav = match sql.update_user_sav_by_access_token(&connection, &access_token, &sav) {\n\n Ok(sav) => sav,\n\n Err(_) => return Err(SavErrorSavExists::new()),\n\n };\n\n\n\n let response = SavResponse::new(&sav);\n","file_path":"pkmnapi-api/src/routes/savs.rs","rank":45,"score":138972.65777739196},{"content":"#[post(\"/roms\", data = \"<data>\")]\n\npub fn post_rom<'a>(\n\n sql: State<PkmnapiSQL>,\n\n _rate_limit: RateLimit,\n\n data: Data,\n\n access_token: Result<AccessToken, AccessTokenError>,\n\n) -> Result<Response<'a>, ResponseError> {\n\n let access_token = utils::get_access_token(access_token)?;\n\n let rom_data = utils::get_data_raw(data);\n\n\n\n let db = match PkmnapiDB::new(&rom_data).build() {\n\n Ok(db) => db,\n\n Err(_) => return Err(RomErrorInvalidRom::new()),\n\n };\n\n\n\n let connection = sql.get_connection().unwrap();\n\n let rom = match sql.update_user_rom_by_access_token(\n\n &connection,\n\n &access_token,\n\n &db.header.title,\n\n &rom_data,\n","file_path":"pkmnapi-api/src/routes/roms.rs","rank":46,"score":138972.65777739196},{"content":"#[get(\"/icons/<icon_id>\", format = \"image/gif\")]\n\npub fn get_icon<'a>(\n\n sql: State<PkmnapiSQL>,\n\n _rate_limit: RateLimit,\n\n access_token: Result<AccessToken, AccessTokenError>,\n\n icon_id: u8,\n\n) -> Result<Response<'a>, ResponseError> {\n\n let access_token = utils::get_access_token(access_token)?;\n\n let (db, _) = utils::get_db_with_applied_patches(&sql, &access_token)?;\n\n\n\n let icon = db.get_icon(&icon_id)?;\n\n let gif = icon.to_gif(26)?;\n\n\n\n let response = Response::build()\n\n .header(ContentType::GIF)\n\n .header(Header::new(\n\n \"Content-Disposition\",\n\n format!(r#\"attachment; filename=\"icon-{}.gif\"\"#, icon_id),\n\n ))\n\n .sized_body(Cursor::new(gif))\n\n .finalize();\n\n\n\n Ok(response)\n\n}\n","file_path":"pkmnapi-api/src/routes/icons.rs","rank":47,"score":138971.72369265676},{"content":"#[get(\"/savs\")]\n\npub fn get_sav<'a>(\n\n sql: State<PkmnapiSQL>,\n\n _rate_limit: RateLimit,\n\n access_token: Result<AccessToken, AccessTokenError>,\n\n) -> Result<Response<'a>, ResponseError> {\n\n let access_token = utils::get_access_token(access_token)?;\n\n\n\n let connection = sql.get_connection().unwrap();\n\n let sav = match sql.select_user_sav_by_access_token(&connection, &access_token) {\n\n Ok(Some(sav)) => sav,\n\n _ => return Err(SavErrorNoSav::new()),\n\n };\n\n\n\n let response = SavResponse::new(&sav);\n\n let body = serde_json::to_string(&response).unwrap();\n\n\n\n let response = Response::build()\n\n .header(ContentType::JSON)\n\n .header(Header::new(\"ETag\", sav.etag))\n\n .sized_body(Cursor::new(body))\n\n .finalize();\n\n\n\n Ok(response)\n\n}\n\n\n","file_path":"pkmnapi-api/src/routes/savs.rs","rank":48,"score":138965.82902511375},{"content":"#[get(\"/roms\")]\n\npub fn get_rom<'a>(\n\n sql: State<PkmnapiSQL>,\n\n _rate_limit: RateLimit,\n\n access_token: Result<AccessToken, AccessTokenError>,\n\n) -> Result<Response<'a>, ResponseError> {\n\n let access_token = utils::get_access_token(access_token)?;\n\n\n\n let connection = sql.get_connection().unwrap();\n\n let rom_sql = match sql.select_user_rom_by_access_token(&connection, &access_token) {\n\n Ok(Some(rom_sql)) => rom_sql,\n\n _ => return Err(RomErrorNoRom::new()),\n\n };\n\n\n\n let response = RomResponse::new(&rom_sql);\n\n let body = serde_json::to_string(&response).unwrap();\n\n\n\n let response = Response::build()\n\n .header(ContentType::JSON)\n\n .header(Header::new(\"ETag\", rom_sql.etag))\n\n .sized_body(Cursor::new(body))\n\n .finalize();\n\n\n\n Ok(response)\n\n}\n\n\n","file_path":"pkmnapi-api/src/routes/roms.rs","rank":49,"score":138965.82902511375},{"content":"#[openapi]\n\n#[delete(\"/access_tokens\", format = \"application/json\", data = \"<data>\")]\n\npub fn delete_access_token(\n\n sql: State<PkmnapiSQL>,\n\n _rate_limit: RateLimit,\n\n data: Result<Json<AccessTokenDeleteRequest>, JsonError>,\n\n access_token: Result<AccessToken, AccessTokenError>,\n\n) -> Result<status::NoContent, ResponseError> {\n\n if access_token.is_ok() {\n\n return Err(AccessTokenErrorForbidden::new());\n\n }\n\n\n\n let data = match data {\n\n Ok(data) => data.into_inner(),\n\n Err(JsonError::Parse(_, e)) => {\n\n return Err(AccessTokenErrorInvalid::new(&e.to_string()));\n\n }\n\n _ => {\n\n return Err(AccessTokenErrorInvalid::new(\n\n &\"An unknown error occurred\".to_owned(),\n\n ));\n\n }\n","file_path":"pkmnapi-api/src/routes/access_tokens.rs","rank":50,"score":138960.57767942655},{"content":"#[openapi]\n\n#[post(\"/player_names\", format = \"application/json\", data = \"<data>\")]\n\npub fn post_player_names(\n\n sql: State<PkmnapiSQL>,\n\n _rate_limit: RateLimit,\n\n access_token: Result<AccessToken, AccessTokenError>,\n\n patch_description: Result<PatchDescription, PatchDescriptionError>,\n\n data: Result<Json<PlayerNamesRequest>, JsonError>,\n\n) -> Result<status::Accepted<JsonValue>, ResponseError> {\n\n let access_token = utils::get_access_token(access_token)?;\n\n let data = utils::get_data(data, BaseErrorResponseId::error_player_names_invalid)?;\n\n let (db, connection) = utils::get_db(&sql, &access_token)?;\n\n\n\n let player_names = PlayerNames {\n\n player: data\n\n .get_player_names()\n\n .iter()\n\n .map(|name| ROMString::from(name))\n\n .collect(),\n\n rival: data\n\n .get_rival_names()\n\n .iter()\n","file_path":"pkmnapi-api/src/routes/player_names.rs","rank":51,"score":138960.57767942655},{"content":"#[openapi]\n\n#[post(\"/access_tokens\", format = \"application/json\", data = \"<data>\")]\n\npub fn post_access_token(\n\n sql: State<PkmnapiSQL>,\n\n _rate_limit: RateLimit,\n\n data: Result<Json<AccessTokenRequest>, JsonError>,\n\n access_token: Result<AccessToken, AccessTokenError>,\n\n) -> Result<status::Created<JsonValue>, ResponseError> {\n\n if access_token.is_ok() {\n\n return Err(AccessTokenErrorForbidden::new());\n\n }\n\n\n\n let data = match data {\n\n Ok(data) => data.into_inner(),\n\n Err(JsonError::Parse(_, e)) => {\n\n return Err(AccessTokenErrorInvalid::new(&e.to_string()));\n\n }\n\n _ => {\n\n return Err(AccessTokenErrorInvalid::new(\n\n &\"An unknown error occurred\".to_owned(),\n\n ));\n\n }\n","file_path":"pkmnapi-api/src/routes/access_tokens.rs","rank":52,"score":138960.57767942655},{"content":"#[openapi]\n\n#[post(\"/items/names/<item_id>\", format = \"application/json\", data = \"<data>\")]\n\npub fn post_item_name(\n\n sql: State<PkmnapiSQL>,\n\n _rate_limit: RateLimit,\n\n access_token: Result<AccessToken, AccessTokenError>,\n\n patch_description: Result<PatchDescription, PatchDescriptionError>,\n\n data: Result<Json<ItemNameRequest>, JsonError>,\n\n item_id: u8,\n\n) -> Result<status::Accepted<JsonValue>, ResponseError> {\n\n let access_token = utils::get_access_token(access_token)?;\n\n let data = utils::get_data(data, BaseErrorResponseId::error_item_names_invalid)?;\n\n let (db, connection) = utils::get_db(&sql, &access_token)?;\n\n\n\n let item_name = ItemName {\n\n name: ROMString::from(data.get_name()),\n\n };\n\n\n\n let patch = db.set_item_name(&item_id, &item_name)?;\n\n\n\n utils::insert_rom_patch(\n\n sql,\n\n connection,\n\n access_token,\n\n patch,\n\n patch_description,\n\n BaseErrorResponseId::error_item_names,\n\n )?;\n\n\n\n Ok(status::Accepted(Some(json!({}))))\n\n}\n","file_path":"pkmnapi-api/src/routes/item_names.rs","rank":53,"score":138960.33850039946},{"content":"#[openapi]\n\n#[post(\"/moves/names/<move_id>\", format = \"application/json\", data = \"<data>\")]\n\npub fn post_move_name(\n\n sql: State<PkmnapiSQL>,\n\n _rate_limit: RateLimit,\n\n access_token: Result<AccessToken, AccessTokenError>,\n\n patch_description: Result<PatchDescription, PatchDescriptionError>,\n\n data: Result<Json<MoveNameRequest>, JsonError>,\n\n move_id: u8,\n\n) -> Result<status::Accepted<JsonValue>, ResponseError> {\n\n let access_token = utils::get_access_token(access_token)?;\n\n let data = utils::get_data(data, BaseErrorResponseId::error_move_names_invalid)?;\n\n let (db, connection) = utils::get_db(&sql, &access_token)?;\n\n\n\n let move_name = MoveName {\n\n name: ROMString::from(data.get_name()),\n\n };\n\n\n\n let patch = db.set_move_name(&move_id, &move_name)?;\n\n\n\n utils::insert_rom_patch(\n\n sql,\n\n connection,\n\n access_token,\n\n patch,\n\n patch_description,\n\n BaseErrorResponseId::error_move_names,\n\n )?;\n\n\n\n Ok(status::Accepted(Some(json!({}))))\n\n}\n","file_path":"pkmnapi-api/src/routes/move_names.rs","rank":54,"score":138960.33850039946},{"content":"#[openapi]\n\n#[post(\"/hms/moves/<hm_id>\", format = \"application/json\", data = \"<data>\")]\n\npub fn post_hm_move(\n\n sql: State<PkmnapiSQL>,\n\n _rate_limit: RateLimit,\n\n access_token: Result<AccessToken, AccessTokenError>,\n\n patch_description: Result<PatchDescription, PatchDescriptionError>,\n\n data: Result<Json<HMMoveRequest>, JsonError>,\n\n hm_id: u8,\n\n) -> Result<status::Accepted<JsonValue>, ResponseError> {\n\n let access_token = utils::get_access_token(access_token)?;\n\n let data = utils::get_data(data, BaseErrorResponseId::error_hms_invalid)?;\n\n let (db, connection) = utils::get_db(&sql, &access_token)?;\n\n\n\n let hm_move = HMMove {\n\n move_id: data.get_move_id(),\n\n };\n\n\n\n let patch = db.set_hm_move(&hm_id, &hm_move)?;\n\n\n\n utils::insert_rom_patch(\n\n sql,\n\n connection,\n\n access_token,\n\n patch,\n\n patch_description,\n\n BaseErrorResponseId::error_hms,\n\n )?;\n\n\n\n Ok(status::Accepted(Some(json!({}))))\n\n}\n","file_path":"pkmnapi-api/src/routes/hm_moves.rs","rank":55,"score":138960.33850039946},{"content":"#[openapi]\n\n#[post(\"/moves/stats/<move_id>\", format = \"application/json\", data = \"<data>\")]\n\npub fn post_move_stats(\n\n sql: State<PkmnapiSQL>,\n\n _rate_limit: RateLimit,\n\n access_token: Result<AccessToken, AccessTokenError>,\n\n patch_description: Result<PatchDescription, PatchDescriptionError>,\n\n data: Result<Json<MoveStatsRequest>, JsonError>,\n\n move_id: u8,\n\n) -> Result<status::Accepted<JsonValue>, ResponseError> {\n\n let access_token = utils::get_access_token(access_token)?;\n\n let data = utils::get_data(data, BaseErrorResponseId::error_move_stats_invalid)?;\n\n let (db, connection) = utils::get_db(&sql, &access_token)?;\n\n\n\n let move_stats = MoveStats {\n\n move_id: move_id,\n\n effect: data.get_effect(),\n\n power: data.get_power(),\n\n type_id: data.get_type_id(),\n\n accuracy: data.get_accuracy(),\n\n pp: data.get_pp(),\n\n };\n","file_path":"pkmnapi-api/src/routes/move_stats.rs","rank":56,"score":138960.33850039946},{"content":"#[openapi]\n\n#[post(\"/marts/items/<mart_id>\", format = \"application/json\", data = \"<data>\")]\n\npub fn post_mart_items(\n\n sql: State<PkmnapiSQL>,\n\n _rate_limit: RateLimit,\n\n access_token: Result<AccessToken, AccessTokenError>,\n\n patch_description: Result<PatchDescription, PatchDescriptionError>,\n\n data: Result<Json<MartItemsRequest>, JsonError>,\n\n mart_id: u8,\n\n) -> Result<status::Accepted<JsonValue>, ResponseError> {\n\n let access_token = utils::get_access_token(access_token)?;\n\n let data = utils::get_data(data, BaseErrorResponseId::error_mart_items_invalid)?;\n\n let (db, connection) = utils::get_db(&sql, &access_token)?;\n\n\n\n let mart_items = data.get_mart_items();\n\n\n\n let patch = db.set_mart_items(&mart_id, &mart_items)?;\n\n\n\n utils::insert_rom_patch(\n\n sql,\n\n connection,\n\n access_token,\n\n patch,\n\n patch_description,\n\n BaseErrorResponseId::error_mart_items,\n\n )?;\n\n\n\n Ok(status::Accepted(Some(json!({}))))\n\n}\n","file_path":"pkmnapi-api/src/routes/mart_items.rs","rank":57,"score":138960.33850039946},{"content":"#[openapi]\n\n#[post(\"/tms/moves/<tm_id>\", format = \"application/json\", data = \"<data>\")]\n\npub fn post_tm_move(\n\n sql: State<PkmnapiSQL>,\n\n _rate_limit: RateLimit,\n\n access_token: Result<AccessToken, AccessTokenError>,\n\n patch_description: Result<PatchDescription, PatchDescriptionError>,\n\n data: Result<Json<TMMoveRequest>, JsonError>,\n\n tm_id: u8,\n\n) -> Result<status::Accepted<JsonValue>, ResponseError> {\n\n let access_token = utils::get_access_token(access_token)?;\n\n let data = utils::get_data(data, BaseErrorResponseId::error_tm_moves_invalid)?;\n\n let (db, connection) = utils::get_db(&sql, &access_token)?;\n\n\n\n let tm_move = TMMove {\n\n move_id: data.get_move_id(),\n\n };\n\n\n\n let patch = db.set_tm_move(&tm_id, &tm_move)?;\n\n\n\n utils::insert_rom_patch(\n\n sql,\n\n connection,\n\n access_token,\n\n patch,\n\n patch_description,\n\n BaseErrorResponseId::error_tm_moves,\n\n )?;\n\n\n\n Ok(status::Accepted(Some(json!({}))))\n\n}\n","file_path":"pkmnapi-api/src/routes/tm_moves.rs","rank":58,"score":138960.33850039946},{"content":"#[openapi]\n\n#[post(\"/maps/pokemon/<map_id>\", format = \"application/json\", data = \"<data>\")]\n\npub fn post_map_pokemon(\n\n sql: State<PkmnapiSQL>,\n\n _rate_limit: RateLimit,\n\n access_token: Result<AccessToken, AccessTokenError>,\n\n patch_description: Result<PatchDescription, PatchDescriptionError>,\n\n data: Result<Json<MapPokemonRequest>, JsonError>,\n\n map_id: u8,\n\n) -> Result<status::Accepted<JsonValue>, ResponseError> {\n\n let access_token = utils::get_access_token(access_token)?;\n\n let data = utils::get_data(data, BaseErrorResponseId::error_map_pokemon_invalid)?;\n\n let (db, connection) = utils::get_db(&sql, &access_token)?;\n\n\n\n let map_pokemon = MapPokemon {\n\n grass: data.get_grass(),\n\n water: data.get_water(),\n\n };\n\n\n\n let patch = db.set_map_pokemon(&map_id, &map_pokemon)?;\n\n\n\n utils::insert_rom_patch(\n","file_path":"pkmnapi-api/src/routes/map_pokemon.rs","rank":59,"score":138960.33850039946},{"content":"#[openapi]\n\n#[post(\"/types/names/<type_id>\", format = \"application/json\", data = \"<data>\")]\n\npub fn post_type_name(\n\n sql: State<PkmnapiSQL>,\n\n _rate_limit: RateLimit,\n\n access_token: Result<AccessToken, AccessTokenError>,\n\n patch_description: Result<PatchDescription, PatchDescriptionError>,\n\n data: Result<Json<TypeNameRequest>, JsonError>,\n\n type_id: u8,\n\n) -> Result<status::Accepted<JsonValue>, ResponseError> {\n\n let access_token = utils::get_access_token(access_token)?;\n\n let data = utils::get_data(data, BaseErrorResponseId::error_type_names_invalid)?;\n\n let (db, connection) = utils::get_db(&sql, &access_token)?;\n\n\n\n let type_name = TypeName {\n\n name: ROMString::from(data.get_name()),\n\n };\n\n\n\n let patch = db.set_type_name(&type_id, &type_name)?;\n\n\n\n utils::insert_rom_patch(\n\n sql,\n\n connection,\n\n access_token,\n\n patch,\n\n patch_description,\n\n BaseErrorResponseId::error_type_names,\n\n )?;\n\n\n\n Ok(status::Accepted(Some(json!({}))))\n\n}\n","file_path":"pkmnapi-api/src/routes/type_names.rs","rank":60,"score":138960.33850039946},{"content":"#[openapi]\n\n#[post(\"/tms/prices/<tm_id>\", format = \"application/json\", data = \"<data>\")]\n\npub fn post_tm_price(\n\n sql: State<PkmnapiSQL>,\n\n _rate_limit: RateLimit,\n\n access_token: Result<AccessToken, AccessTokenError>,\n\n patch_description: Result<PatchDescription, PatchDescriptionError>,\n\n data: Result<Json<TMPriceRequest>, JsonError>,\n\n tm_id: u8,\n\n) -> Result<status::Accepted<JsonValue>, ResponseError> {\n\n let access_token = utils::get_access_token(access_token)?;\n\n let data = utils::get_data(data, BaseErrorResponseId::error_tm_prices_invalid)?;\n\n let (db, connection) = utils::get_db(&sql, &access_token)?;\n\n\n\n let tm_price = TMPrice {\n\n value: data.get_price(),\n\n };\n\n\n\n let patch = db.set_tm_price(&tm_id, &tm_price)?;\n\n\n\n utils::insert_rom_patch(\n\n sql,\n\n connection,\n\n access_token,\n\n patch,\n\n patch_description,\n\n BaseErrorResponseId::error_tm_prices,\n\n )?;\n\n\n\n Ok(status::Accepted(Some(json!({}))))\n\n}\n","file_path":"pkmnapi-api/src/routes/tm_prices.rs","rank":61,"score":138960.33850039946},{"content":"#[openapi]\n\n#[get(\"/pokemon/cries\", format = \"application/json\")]\n\npub fn get_pokemon_cry_all(\n\n sql: State<PkmnapiSQL>,\n\n _rate_limit: RateLimit,\n\n access_token: Result<AccessToken, AccessTokenError>,\n\n) -> Result<Json<PokemonCryResponseAll>, ResponseError> {\n\n let access_token = utils::get_access_token(access_token)?;\n\n let (db, _) = utils::get_db_with_applied_patches(&sql, &access_token)?;\n\n\n\n let (min_pokedex_id, max_pokedex_id) = db.pokedex_id_bounds();\n\n let pokedex_ids: Vec<u8> = (min_pokedex_id..=max_pokedex_id)\n\n .map(|pokedex_id| pokedex_id as u8)\n\n .collect();\n\n let pokemon_cries = db.get_pokemon_cry_all(&pokedex_ids)?;\n\n\n\n let response = PokemonCryResponseAll::new(&pokedex_ids, &pokemon_cries);\n\n\n\n Ok(Json(response))\n\n}\n\n\n","file_path":"pkmnapi-api/src/routes/pokemon_cries.rs","rank":62,"score":138954.154898198},{"content":"#[openapi]\n\n#[get(\"/roms/patches\", format = \"application/json\", rank = 1)]\n\npub fn get_rom_patches(\n\n sql: State<PkmnapiSQL>,\n\n _rate_limit: RateLimit,\n\n access_token: Result<AccessToken, AccessTokenError>,\n\n) -> Result<Json<RomPatchResponseAll>, ResponseError> {\n\n let access_token = utils::get_access_token(access_token)?;\n\n\n\n let connection = sql.get_connection().unwrap();\n\n let patches = match sql.select_rom_patches_by_access_token(&connection, &access_token) {\n\n Ok(patches) => patches,\n\n Err(_) => return Err(RomErrorNoRom::new()),\n\n };\n\n\n\n let response = RomPatchResponseAll::new(&patches);\n\n\n\n Ok(Json(response))\n\n}\n\n\n","file_path":"pkmnapi-api/src/routes/rom_patches.rs","rank":63,"score":138954.0793763084},{"content":"pub fn post_pokemon_moveset(\n\n sql: State<PkmnapiSQL>,\n\n _rate_limit: RateLimit,\n\n access_token: Result<AccessToken, AccessTokenError>,\n\n patch_description: Result<PatchDescription, PatchDescriptionError>,\n\n data: Result<Json<PokemonMovesetRequest>, JsonError>,\n\n pokedex_id: u8,\n\n) -> Result<status::Accepted<JsonValue>, ResponseError> {\n\n let access_token = utils::get_access_token(access_token)?;\n\n let data = utils::get_data(data, BaseErrorResponseId::error_pokemon_movesets_invalid)?;\n\n let (db, connection) = utils::get_db(&sql, &access_token)?;\n\n\n\n let pokemon_moveset = data.get_moveset();\n\n\n\n let patch = db.set_pokemon_moveset(&pokedex_id, &pokemon_moveset)?;\n\n\n\n utils::insert_rom_patch(\n\n sql,\n\n connection,\n\n access_token,\n\n patch,\n\n patch_description,\n\n BaseErrorResponseId::error_pokemon_movesets,\n\n )?;\n\n\n\n Ok(status::Accepted(Some(json!({}))))\n\n}\n","file_path":"pkmnapi-api/src/routes/pokemon_movesets.rs","rank":64,"score":138948.260230655},{"content":"#[openapi]\n\n#[get(\"/hms/moves/<hm_id>\")]\n\npub fn get_hm_move(\n\n sql: State<PkmnapiSQL>,\n\n _rate_limit: RateLimit,\n\n access_token: Result<AccessToken, AccessTokenError>,\n\n hm_id: u8,\n\n) -> Result<Json<HMMoveResponse>, ResponseError> {\n\n let access_token = utils::get_access_token(access_token)?;\n\n let (db, _) = utils::get_db_with_applied_patches(&sql, &access_token)?;\n\n\n\n let hm_move = db.get_hm_move(&hm_id)?;\n\n let move_name = db.get_move_name(&hm_move.move_id)?;\n\n\n\n let response = HMMoveResponse::new(&hm_id, &hm_move, &move_name);\n\n\n\n Ok(Json(response))\n\n}\n\n\n","file_path":"pkmnapi-api/src/routes/hm_moves.rs","rank":65,"score":138948.260230655},{"content":"#[openapi]\n\n#[get(\"/maps/pokemon/<map_id>\")]\n\npub fn get_map_pokemon(\n\n sql: State<PkmnapiSQL>,\n\n _rate_limit: RateLimit,\n\n access_token: Result<AccessToken, AccessTokenError>,\n\n map_id: u8,\n\n) -> Result<Json<MapPokemonResponse>, ResponseError> {\n\n let access_token = utils::get_access_token(access_token)?;\n\n let (db, _) = utils::get_db_with_applied_patches(&sql, &access_token)?;\n\n\n\n let map_pokemon = db.get_map_pokemon(&map_id)?;\n\n let pokedex_ids = vec![\n\n map_pokemon\n\n .grass\n\n .pokemon\n\n .iter()\n\n .map(|pokemon| pokemon.pokedex_id)\n\n .collect::<Vec<u8>>(),\n\n map_pokemon\n\n .water\n\n .pokemon\n","file_path":"pkmnapi-api/src/routes/map_pokemon.rs","rank":66,"score":138948.260230655},{"content":"#[openapi]\n\n#[get(\"/pokemon/icons/<pokedex_id>\")]\n\npub fn get_pokemon_icon(\n\n sql: State<PkmnapiSQL>,\n\n _rate_limit: RateLimit,\n\n access_token: Result<AccessToken, AccessTokenError>,\n\n pokedex_id: u8,\n\n) -> Result<Json<PokemonIconResponse>, ResponseError> {\n\n let access_token = utils::get_access_token(access_token)?;\n\n let (db, _) = utils::get_db_with_applied_patches(&sql, &access_token)?;\n\n\n\n let pokemon_icon = db.get_pokemon_icon(&pokedex_id)?;\n\n\n\n let response = PokemonIconResponse::new(&pokedex_id, &pokemon_icon);\n\n\n\n Ok(Json(response))\n\n}\n\n\n\n#[openapi]\n\n#[post(\n\n \"/pokemon/icons/<pokedex_id>\",\n\n format = \"application/json\",\n\n data = \"<data>\"\n\n)]\n","file_path":"pkmnapi-api/src/routes/pokemon_icons.rs","rank":67,"score":138948.260230655},{"content":"#[openapi]\n\n#[get(\"/pokemon/movesets\")]\n\npub fn get_pokemon_moveset_all(\n\n sql: State<PkmnapiSQL>,\n\n _rate_limit: RateLimit,\n\n access_token: Result<AccessToken, AccessTokenError>,\n\n) -> Result<Json<PokemonMovesetResponseAll>, ResponseError> {\n\n let access_token = utils::get_access_token(access_token)?;\n\n let (db, _) = utils::get_db_with_applied_patches(&sql, &access_token)?;\n\n\n\n let (min_pokedex_id, max_pokedex_id) = db.pokedex_id_bounds();\n\n let pokedex_ids: Vec<u8> = (min_pokedex_id..=max_pokedex_id)\n\n .map(|pokedex_id| pokedex_id as u8)\n\n .collect();\n\n let pokemon_movesets = db.get_pokemon_moveset_all(&pokedex_ids)?;\n\n let move_ids = pokemon_movesets\n\n .iter()\n\n .map(|(_, pokemon_moveset)| pokemon_moveset.to_vec())\n\n .flatten()\n\n .collect();\n\n let move_names = db.get_move_name_all(&move_ids)?;\n\n\n\n let response = PokemonMovesetResponseAll::new(&pokedex_ids, &pokemon_movesets, &move_names);\n\n\n\n Ok(Json(response))\n\n}\n\n\n","file_path":"pkmnapi-api/src/routes/pokemon_movesets.rs","rank":68,"score":138948.260230655},{"content":"#[openapi]\n\n#[get(\"/hms/moves\")]\n\npub fn get_hm_move_all(\n\n sql: State<PkmnapiSQL>,\n\n _rate_limit: RateLimit,\n\n access_token: Result<AccessToken, AccessTokenError>,\n\n) -> Result<Json<HMMoveResponseAll>, ResponseError> {\n\n let access_token = utils::get_access_token(access_token)?;\n\n let (db, _) = utils::get_db_with_applied_patches(&sql, &access_token)?;\n\n\n\n let (min_hm_id, max_hm_id) = db.hm_id_bounds();\n\n let hm_ids: Vec<u8> = (min_hm_id..=max_hm_id).map(|hm_id| hm_id as u8).collect();\n\n let hm_moves = db.get_hm_move_all(&hm_ids)?;\n\n let move_ids: Vec<u8> = hm_moves.iter().map(|(_, hm)| hm.move_id).collect();\n\n let move_names = db.get_move_name_all(&move_ids)?;\n\n\n\n let response = HMMoveResponseAll::new(&hm_ids, &hm_moves, &move_names);\n\n\n\n Ok(Json(response))\n\n}\n\n\n","file_path":"pkmnapi-api/src/routes/hm_moves.rs","rank":69,"score":138948.260230655},{"content":"#[openapi]\n\n#[get(\"/pokemon/machines/<pokedex_id>\")]\n\npub fn get_pokemon_machines(\n\n sql: State<PkmnapiSQL>,\n\n _rate_limit: RateLimit,\n\n access_token: Result<AccessToken, AccessTokenError>,\n\n pokedex_id: u8,\n\n) -> Result<Json<PokemonMachinesResponse>, ResponseError> {\n\n let access_token = utils::get_access_token(access_token)?;\n\n let (db, _) = utils::get_db_with_applied_patches(&sql, &access_token)?;\n\n\n\n let pokemon_machines = db.get_pokemon_machines(&pokedex_id)?;\n\n let tm_ids = pokemon_machines\n\n .iter()\n\n .filter_map(|machine| match machine {\n\n PokemonMachine::TM(tm_id) => Some(*tm_id),\n\n _ => None,\n\n })\n\n .collect();\n\n let tm_moves = db.get_tm_move_all(&tm_ids)?;\n\n let hm_ids = pokemon_machines\n\n .iter()\n","file_path":"pkmnapi-api/src/routes/pokemon_machines.rs","rank":70,"score":138948.260230655},{"content":"#[openapi]\n\n#[get(\"/pokedex/entries\")]\n\npub fn get_pokedex_entry_all(\n\n sql: State<PkmnapiSQL>,\n\n _rate_limit: RateLimit,\n\n access_token: Result<AccessToken, AccessTokenError>,\n\n) -> Result<Json<PokedexEntryResponseAll>, ResponseError> {\n\n let access_token = utils::get_access_token(access_token)?;\n\n let (db, _) = utils::get_db_with_applied_patches(&sql, &access_token)?;\n\n\n\n let (min_pokedex_id, max_pokedex_id) = db.pokedex_id_bounds();\n\n let pokedex_ids: Vec<u8> = (min_pokedex_id..=max_pokedex_id)\n\n .map(|pokedex_id| pokedex_id as u8)\n\n .collect();\n\n let pokedex_entries = db.get_pokedex_entry_all(&pokedex_ids)?;\n\n\n\n let response = PokedexEntryResponseAll::new(&pokedex_ids, &pokedex_entries);\n\n\n\n Ok(Json(response))\n\n}\n\n\n","file_path":"pkmnapi-api/src/routes/pokedex_entries.rs","rank":71,"score":138948.260230655},{"content":"#[openapi]\n\n#[get(\"/moves/names/<move_id>\")]\n\npub fn get_move_name(\n\n sql: State<PkmnapiSQL>,\n\n _rate_limit: RateLimit,\n\n access_token: Result<AccessToken, AccessTokenError>,\n\n move_id: u8,\n\n) -> Result<Json<MoveNameResponse>, ResponseError> {\n\n let access_token = utils::get_access_token(access_token)?;\n\n let (db, _) = utils::get_db_with_applied_patches(&sql, &access_token)?;\n\n\n\n let move_name = db.get_move_name(&move_id)?;\n\n\n\n let response = MoveNameResponse::new(&move_id, &move_name);\n\n\n\n Ok(Json(response))\n\n}\n\n\n","file_path":"pkmnapi-api/src/routes/move_names.rs","rank":72,"score":138948.260230655},{"content":"#[openapi]\n\n#[get(\"/moves/stats\")]\n\npub fn get_move_stats_all(\n\n sql: State<PkmnapiSQL>,\n\n _rate_limit: RateLimit,\n\n access_token: Result<AccessToken, AccessTokenError>,\n\n) -> Result<Json<MoveStatsResponseAll>, ResponseError> {\n\n let access_token = utils::get_access_token(access_token)?;\n\n let (db, _) = utils::get_db_with_applied_patches(&sql, &access_token)?;\n\n\n\n let (min_move_id, max_move_id) = db.move_id_bounds();\n\n let move_ids: Vec<u8> = (min_move_id..=max_move_id)\n\n .map(|move_id| move_id as u8)\n\n .collect();\n\n let move_stats = db.get_move_stats_all(&move_ids)?;\n\n let type_ids = move_stats\n\n .iter()\n\n .map(|(_, move_stats)| move_stats.type_id)\n\n .collect();\n\n let type_names = db.get_type_name_all(&type_ids)?;\n\n\n\n let response = MoveStatsResponseAll::new(&move_ids, &move_stats, &type_names);\n\n\n\n Ok(Json(response))\n\n}\n\n\n","file_path":"pkmnapi-api/src/routes/move_stats.rs","rank":73,"score":138948.260230655},{"content":"#[openapi]\n\n#[get(\"/pokemon/stats/<pokedex_id>\")]\n\npub fn get_pokemon_stats(\n\n sql: State<PkmnapiSQL>,\n\n _rate_limit: RateLimit,\n\n access_token: Result<AccessToken, AccessTokenError>,\n\n pokedex_id: u8,\n\n) -> Result<Json<PokemonStatsResponse>, ResponseError> {\n\n let access_token = utils::get_access_token(access_token)?;\n\n let (db, _) = utils::get_db_with_applied_patches(&sql, &access_token)?;\n\n\n\n let pokemon_stats = db.get_pokemon_stats(&pokedex_id)?;\n\n let type_names = db.get_type_name_all(&pokemon_stats.type_ids)?;\n\n\n\n let response = PokemonStatsResponse::new(&pokedex_id, &pokemon_stats, &type_names);\n\n\n\n Ok(Json(response))\n\n}\n\n\n\n#[openapi]\n\n#[post(\n\n \"/pokemon/stats/<pokedex_id>\",\n\n format = \"application/json\",\n\n data = \"<data>\"\n\n)]\n","file_path":"pkmnapi-api/src/routes/pokemon_stats.rs","rank":74,"score":138948.260230655},{"content":"pub fn post_pokemon_icon(\n\n sql: State<PkmnapiSQL>,\n\n _rate_limit: RateLimit,\n\n access_token: Result<AccessToken, AccessTokenError>,\n\n patch_description: Result<PatchDescription, PatchDescriptionError>,\n\n data: Result<Json<PokemonIconRequest>, JsonError>,\n\n pokedex_id: u8,\n\n) -> Result<status::Accepted<JsonValue>, ResponseError> {\n\n let access_token = utils::get_access_token(access_token)?;\n\n let data = utils::get_data(data, BaseErrorResponseId::error_pokemon_icons_invalid)?;\n\n let (db, connection) = utils::get_db(&sql, &access_token)?;\n\n\n\n let pokemon_icon = PokemonIcon::from(&data.get_icon_id());\n\n\n\n let patch = db.set_pokemon_icon(&pokedex_id, &pokemon_icon)?;\n\n\n\n utils::insert_rom_patch(\n\n sql,\n\n connection,\n\n access_token,\n\n patch,\n\n patch_description,\n\n BaseErrorResponseId::error_pokemon_icons,\n\n )?;\n\n\n\n Ok(status::Accepted(Some(json!({}))))\n\n}\n","file_path":"pkmnapi-api/src/routes/pokemon_icons.rs","rank":75,"score":138948.260230655},{"content":"#[openapi]\n\n#[get(\"/pokedex/entries/<pokedex_id>\")]\n\npub fn get_pokedex_entry(\n\n sql: State<PkmnapiSQL>,\n\n _rate_limit: RateLimit,\n\n access_token: Result<AccessToken, AccessTokenError>,\n\n pokedex_id: u8,\n\n) -> Result<Json<PokedexEntryResponse>, ResponseError> {\n\n let access_token = utils::get_access_token(access_token)?;\n\n let (db, _) = utils::get_db_with_applied_patches(&sql, &access_token)?;\n\n\n\n let pokedex_entry = db.get_pokedex_entry(&pokedex_id)?;\n\n\n\n let response = PokedexEntryResponse::new(&pokedex_id, &pokedex_entry);\n\n\n\n Ok(Json(response))\n\n}\n\n\n\n#[openapi]\n\n#[post(\n\n \"/pokedex/entries/<pokedex_id>\",\n\n format = \"application/json\",\n\n data = \"<data>\"\n\n)]\n","file_path":"pkmnapi-api/src/routes/pokedex_entries.rs","rank":76,"score":138948.260230655},{"content":"#[openapi]\n\n#[get(\"/items/names\")]\n\npub fn get_item_name_all(\n\n sql: State<PkmnapiSQL>,\n\n _rate_limit: RateLimit,\n\n access_token: Result<AccessToken, AccessTokenError>,\n\n) -> Result<Json<ItemNameResponseAll>, ResponseError> {\n\n let access_token = utils::get_access_token(access_token)?;\n\n let (db, _) = utils::get_db_with_applied_patches(&sql, &access_token)?;\n\n\n\n let (min_item_id, max_item_id) = db.item_id_bounds();\n\n let item_ids: Vec<u8> = (min_item_id..=max_item_id)\n\n .map(|item_id| item_id as u8)\n\n .collect();\n\n let item_names = db.get_item_name_all(&item_ids)?;\n\n\n\n let response = ItemNameResponseAll::new(&item_ids, &item_names);\n\n\n\n Ok(Json(response))\n\n}\n\n\n","file_path":"pkmnapi-api/src/routes/item_names.rs","rank":77,"score":138948.260230655},{"content":"#[openapi]\n\n#[get(\"/pokedex/texts\")]\n\npub fn get_pokedex_text_all(\n\n sql: State<PkmnapiSQL>,\n\n _rate_limit: RateLimit,\n\n access_token: Result<AccessToken, AccessTokenError>,\n\n) -> Result<Json<PokedexTextResponseAll>, ResponseError> {\n\n let access_token = utils::get_access_token(access_token)?;\n\n let (db, _) = utils::get_db_with_applied_patches(&sql, &access_token)?;\n\n\n\n let (min_pokedex_id, max_pokedex_id) = db.pokedex_id_bounds();\n\n let pokedex_ids: Vec<u8> = (min_pokedex_id..=max_pokedex_id)\n\n .map(|pokedex_id| pokedex_id as u8)\n\n .collect();\n\n let pokedex_texts = db.get_pokedex_text_all(&pokedex_ids)?;\n\n\n\n let response = PokedexTextResponseAll::new(&pokedex_ids, &pokedex_texts);\n\n\n\n Ok(Json(response))\n\n}\n\n\n","file_path":"pkmnapi-api/src/routes/pokedex_texts.rs","rank":78,"score":138948.260230655},{"content":"#[openapi]\n\n#[get(\"/pokemon/names/<pokedex_id>\")]\n\npub fn get_pokemon_name(\n\n sql: State<PkmnapiSQL>,\n\n _rate_limit: RateLimit,\n\n access_token: Result<AccessToken, AccessTokenError>,\n\n pokedex_id: u8,\n\n) -> Result<Json<PokemonNameResponse>, ResponseError> {\n\n let access_token = utils::get_access_token(access_token)?;\n\n let (db, _) = utils::get_db_with_applied_patches(&sql, &access_token)?;\n\n\n\n let pokemon_name = db.get_pokemon_name(&pokedex_id)?;\n\n\n\n let response = PokemonNameResponse::new(&pokedex_id, &pokemon_name);\n\n\n\n Ok(Json(response))\n\n}\n\n\n\n#[openapi]\n\n#[post(\n\n \"/pokemon/names/<pokedex_id>\",\n\n format = \"application/json\",\n\n data = \"<data>\"\n\n)]\n","file_path":"pkmnapi-api/src/routes/pokemon_names.rs","rank":79,"score":138948.260230655},{"content":"#[openapi]\n\n#[get(\"/moves/names\")]\n\npub fn get_move_name_all(\n\n sql: State<PkmnapiSQL>,\n\n _rate_limit: RateLimit,\n\n access_token: Result<AccessToken, AccessTokenError>,\n\n) -> Result<Json<MoveNameResponseAll>, ResponseError> {\n\n let access_token = utils::get_access_token(access_token)?;\n\n let (db, _) = utils::get_db_with_applied_patches(&sql, &access_token)?;\n\n\n\n let (min_move_id, max_move_id) = db.move_id_bounds();\n\n let move_ids: Vec<u8> = (min_move_id..=max_move_id)\n\n .map(|move_id| move_id as u8)\n\n .collect();\n\n let move_names = db.get_move_name_all(&move_ids)?;\n\n\n\n let response = MoveNameResponseAll::new(&move_ids, &move_names);\n\n\n\n Ok(Json(response))\n\n}\n\n\n","file_path":"pkmnapi-api/src/routes/move_names.rs","rank":80,"score":138948.260230655},{"content":"pub fn post_pokedex_text(\n\n sql: State<PkmnapiSQL>,\n\n _rate_limit: RateLimit,\n\n access_token: Result<AccessToken, AccessTokenError>,\n\n patch_description: Result<PatchDescription, PatchDescriptionError>,\n\n data: Result<Json<PokedexTextRequest>, JsonError>,\n\n pokedex_id: u8,\n\n) -> Result<status::Accepted<JsonValue>, ResponseError> {\n\n let access_token = utils::get_access_token(access_token)?;\n\n let data = utils::get_data(data, BaseErrorResponseId::error_pokedex_texts_invalid)?;\n\n let (db, connection) = utils::get_db(&sql, &access_token)?;\n\n\n\n let pokedex_text = PokedexText {\n\n text: ROMString::from(data.get_text()),\n\n };\n\n\n\n let patch = db.set_pokedex_text(&pokedex_id, &pokedex_text)?;\n\n\n\n utils::insert_rom_patch(\n\n sql,\n\n connection,\n\n access_token,\n\n patch,\n\n patch_description,\n\n BaseErrorResponseId::error_pokedex_texts,\n\n )?;\n\n\n\n Ok(status::Accepted(Some(json!({}))))\n\n}\n","file_path":"pkmnapi-api/src/routes/pokedex_texts.rs","rank":81,"score":138948.260230655},{"content":"#[openapi]\n\n#[get(\"/pokemon/icons\")]\n\npub fn get_pokemon_icon_all(\n\n sql: State<PkmnapiSQL>,\n\n _rate_limit: RateLimit,\n\n access_token: Result<AccessToken, AccessTokenError>,\n\n) -> Result<Json<PokemonIconResponseAll>, ResponseError> {\n\n let access_token = utils::get_access_token(access_token)?;\n\n let (db, _) = utils::get_db_with_applied_patches(&sql, &access_token)?;\n\n\n\n let (min_pokedex_id, max_pokedex_id) = db.pokedex_id_bounds();\n\n let pokedex_ids: Vec<u8> = (min_pokedex_id..=max_pokedex_id)\n\n .map(|pokedex_id| pokedex_id as u8)\n\n .collect();\n\n let pokemon_icons = db.get_pokemon_icon_all(&pokedex_ids)?;\n\n\n\n let response = PokemonIconResponseAll::new(&pokedex_ids, &pokemon_icons);\n\n\n\n Ok(Json(response))\n\n}\n\n\n","file_path":"pkmnapi-api/src/routes/pokemon_icons.rs","rank":82,"score":138948.260230655},{"content":"pub fn post_pokedex_entry(\n\n sql: State<PkmnapiSQL>,\n\n _rate_limit: RateLimit,\n\n access_token: Result<AccessToken, AccessTokenError>,\n\n patch_description: Result<PatchDescription, PatchDescriptionError>,\n\n data: Result<Json<PokedexEntryRequest>, JsonError>,\n\n pokedex_id: u8,\n\n) -> Result<status::Accepted<JsonValue>, ResponseError> {\n\n let access_token = utils::get_access_token(access_token)?;\n\n let data = utils::get_data(data, BaseErrorResponseId::error_pokedex_entries_invalid)?;\n\n let (db, connection) = utils::get_db(&sql, &access_token)?;\n\n\n\n let pokedex_entry = PokedexEntry {\n\n species: ROMString::from(data.get_species()),\n\n height: data.get_height(),\n\n weight: data.get_weight(),\n\n };\n\n\n\n let patch = db.set_pokedex_entry(&pokedex_id, &pokedex_entry)?;\n\n\n","file_path":"pkmnapi-api/src/routes/pokedex_entries.rs","rank":83,"score":138948.260230655},{"content":"#[openapi]\n\n#[get(\"/marts/items\")]\n\npub fn get_mart_items_all(\n\n sql: State<PkmnapiSQL>,\n\n _rate_limit: RateLimit,\n\n access_token: Result<AccessToken, AccessTokenError>,\n\n) -> Result<Json<MartItemsResponseAll>, ResponseError> {\n\n let access_token = utils::get_access_token(access_token)?;\n\n let (db, _) = utils::get_db_with_applied_patches(&sql, &access_token)?;\n\n\n\n let (min_mart_id, max_mart_id) = db.mart_id_bounds();\n\n let mart_ids: Vec<u8> = (min_mart_id..=max_mart_id)\n\n .map(|mart_id| mart_id as u8)\n\n .collect();\n\n let mart_items = db.get_mart_items_all(&mart_ids)?;\n\n let item_ids = mart_items\n\n .iter()\n\n .map(|(_, mart_item)| mart_item)\n\n .flatten()\n\n .filter_map(|mart_item| match mart_item {\n\n MartItem::ITEM(item_id) => Some(*item_id),\n\n _ => None,\n","file_path":"pkmnapi-api/src/routes/mart_items.rs","rank":84,"score":138948.260230655},{"content":"pub fn post_pokemon_stats(\n\n sql: State<PkmnapiSQL>,\n\n _rate_limit: RateLimit,\n\n access_token: Result<AccessToken, AccessTokenError>,\n\n patch_description: Result<PatchDescription, PatchDescriptionError>,\n\n data: Result<Json<PokemonStatsRequest>, JsonError>,\n\n pokedex_id: u8,\n\n) -> Result<status::Accepted<JsonValue>, ResponseError> {\n\n let access_token = utils::get_access_token(access_token)?;\n\n let data = utils::get_data(data, BaseErrorResponseId::error_pokemon_stats_invalid)?;\n\n let (db, connection) = utils::get_db(&sql, &access_token)?;\n\n\n\n let pokemon_stats = PokemonStats {\n\n pokedex_id: pokedex_id,\n\n base_hp: data.get_base_hp(),\n\n base_attack: data.get_base_attack(),\n\n base_defence: data.get_base_defence(),\n\n base_speed: data.get_base_speed(),\n\n base_special: data.get_base_special(),\n\n type_ids: data.get_type_ids(),\n","file_path":"pkmnapi-api/src/routes/pokemon_stats.rs","rank":85,"score":138948.260230655},{"content":"#[openapi]\n\n#[get(\"/pokemon/learnsets\")]\n\npub fn get_pokemon_learnset_all(\n\n sql: State<PkmnapiSQL>,\n\n _rate_limit: RateLimit,\n\n access_token: Result<AccessToken, AccessTokenError>,\n\n) -> Result<Json<PokemonLearnsetResponseAll>, ResponseError> {\n\n let access_token = utils::get_access_token(access_token)?;\n\n let (db, _) = utils::get_db_with_applied_patches(&sql, &access_token)?;\n\n\n\n let (min_pokedex_id, max_pokedex_id) = db.pokedex_id_bounds();\n\n let pokedex_ids: Vec<u8> = (min_pokedex_id..=max_pokedex_id)\n\n .map(|pokedex_id| pokedex_id as u8)\n\n .collect();\n\n let pokemon_learnsets = db.get_pokemon_learnset_all(&pokedex_ids)?;\n\n let move_ids = pokemon_learnsets\n\n .iter()\n\n .map(|(_, pokemon_learnset)| pokemon_learnset)\n\n .flatten()\n\n .map(|learnset| learnset.move_id)\n\n .collect();\n\n let move_names = db.get_move_name_all(&move_ids)?;\n\n\n\n let response = PokemonLearnsetResponseAll::new(&pokedex_ids, &pokemon_learnsets, &move_names);\n\n\n\n Ok(Json(response))\n\n}\n\n\n","file_path":"pkmnapi-api/src/routes/pokemon_learnsets.rs","rank":86,"score":138948.260230655},{"content":"#[openapi]\n\n#[get(\"/hms/names\")]\n\npub fn get_hm_name_all(\n\n sql: State<PkmnapiSQL>,\n\n _rate_limit: RateLimit,\n\n access_token: Result<AccessToken, AccessTokenError>,\n\n) -> Result<Json<HMNameResponseAll>, ResponseError> {\n\n let access_token = utils::get_access_token(access_token)?;\n\n let (db, _) = utils::get_db_with_applied_patches(&sql, &access_token)?;\n\n\n\n let (min_hm_id, max_hm_id) = db.hm_id_bounds();\n\n let hm_ids: Vec<u8> = (min_hm_id..=max_hm_id).map(|hm_id| hm_id as u8).collect();\n\n let hm_names = db.get_hm_name_all(&hm_ids)?;\n\n\n\n let response = HMNameResponseAll::new(&hm_ids, &hm_names);\n\n\n\n Ok(Json(response))\n\n}\n\n\n","file_path":"pkmnapi-api/src/routes/hm_names.rs","rank":87,"score":138948.260230655},{"content":"pub fn post_pokemon_name(\n\n sql: State<PkmnapiSQL>,\n\n _rate_limit: RateLimit,\n\n access_token: Result<AccessToken, AccessTokenError>,\n\n patch_description: Result<PatchDescription, PatchDescriptionError>,\n\n data: Result<Json<PokemonNameRequest>, JsonError>,\n\n pokedex_id: u8,\n\n) -> Result<status::Accepted<JsonValue>, ResponseError> {\n\n let access_token = utils::get_access_token(access_token)?;\n\n let data = utils::get_data(data, BaseErrorResponseId::error_pokemon_names_invalid)?;\n\n let (db, connection) = utils::get_db(&sql, &access_token)?;\n\n\n\n let pokemon_name = PokemonName {\n\n name: ROMString::from(data.get_name()),\n\n };\n\n\n\n let patch = db.set_pokemon_name(&pokedex_id, &pokemon_name)?;\n\n\n\n utils::insert_rom_patch(\n\n sql,\n\n connection,\n\n access_token,\n\n patch,\n\n patch_description,\n\n BaseErrorResponseId::error_pokemon_names,\n\n )?;\n\n\n\n Ok(status::Accepted(Some(json!({}))))\n\n}\n","file_path":"pkmnapi-api/src/routes/pokemon_names.rs","rank":88,"score":138948.260230655},{"content":"#[openapi]\n\n#[get(\"/pokemon/machines\")]\n\npub fn get_pokemon_machines_all(\n\n sql: State<PkmnapiSQL>,\n\n _rate_limit: RateLimit,\n\n access_token: Result<AccessToken, AccessTokenError>,\n\n) -> Result<Json<PokemonMachinesResponseAll>, ResponseError> {\n\n let access_token = utils::get_access_token(access_token)?;\n\n let (db, _) = utils::get_db_with_applied_patches(&sql, &access_token)?;\n\n\n\n let (min_pokedex_id, max_pokedex_id) = db.pokedex_id_bounds();\n\n let pokedex_ids: Vec<u8> = (min_pokedex_id..=max_pokedex_id)\n\n .map(|pokedex_id| pokedex_id as u8)\n\n .collect();\n\n let pokemon_machines = db.get_pokemon_machines_all(&pokedex_ids)?;\n\n let tm_ids = pokemon_machines\n\n .iter()\n\n .map(|(_, machine)| machine)\n\n .flatten()\n\n .filter_map(|machine| match machine {\n\n PokemonMachine::TM(tm_id) => Some(*tm_id),\n\n _ => None,\n","file_path":"pkmnapi-api/src/routes/pokemon_machines.rs","rank":89,"score":138948.260230655},{"content":"#[openapi]\n\n#[get(\"/hms/names/<hm_id>\")]\n\npub fn get_hm_name(\n\n sql: State<PkmnapiSQL>,\n\n _rate_limit: RateLimit,\n\n access_token: Result<AccessToken, AccessTokenError>,\n\n hm_id: u8,\n\n) -> Result<Json<HMNameResponse>, ResponseError> {\n\n let access_token = utils::get_access_token(access_token)?;\n\n let (db, _) = utils::get_db_with_applied_patches(&sql, &access_token)?;\n\n\n\n let hm_name = db.get_hm_name(&hm_id)?;\n\n\n\n let response = HMNameResponse::new(&hm_id, &hm_name);\n\n\n\n Ok(Json(response))\n\n}\n","file_path":"pkmnapi-api/src/routes/hm_names.rs","rank":90,"score":138948.260230655},{"content":"#[openapi]\n\n#[get(\"/maps/pokemon\")]\n\npub fn get_map_pokemon_all(\n\n sql: State<PkmnapiSQL>,\n\n _rate_limit: RateLimit,\n\n access_token: Result<AccessToken, AccessTokenError>,\n\n) -> Result<Json<MapPokemonResponseAll>, ResponseError> {\n\n let access_token = utils::get_access_token(access_token)?;\n\n let (db, _) = utils::get_db_with_applied_patches(&sql, &access_token)?;\n\n\n\n let (min_map_id, max_map_id) = db.map_id_bounds();\n\n let map_ids = (min_map_id..=max_map_id)\n\n .map(|map_id| map_id as u8)\n\n .collect();\n\n let map_pokemon = db.get_map_pokemon_all(&map_ids)?;\n\n let pokedex_ids = map_pokemon\n\n .iter()\n\n .map(|(_, map_pokemon)| {\n\n vec![\n\n map_pokemon\n\n .grass\n\n .pokemon\n","file_path":"pkmnapi-api/src/routes/map_pokemon.rs","rank":91,"score":138948.260230655},{"content":"#[openapi]\n\n#[get(\"/pokemon/names\")]\n\npub fn get_pokemon_name_all(\n\n sql: State<PkmnapiSQL>,\n\n _rate_limit: RateLimit,\n\n access_token: Result<AccessToken, AccessTokenError>,\n\n) -> Result<Json<PokemonNameResponseAll>, ResponseError> {\n\n let access_token = utils::get_access_token(access_token)?;\n\n let (db, _) = utils::get_db_with_applied_patches(&sql, &access_token)?;\n\n\n\n let (min_pokedex_id, max_pokedex_id) = db.pokedex_id_bounds();\n\n let pokedex_ids: Vec<u8> = (min_pokedex_id..=max_pokedex_id)\n\n .map(|pokedex_id| pokedex_id as u8)\n\n .collect();\n\n let pokemon_names = db.get_pokemon_name_all(&pokedex_ids)?;\n\n\n\n let response = PokemonNameResponseAll::new(&pokedex_ids, &pokemon_names);\n\n\n\n Ok(Json(response))\n\n}\n\n\n","file_path":"pkmnapi-api/src/routes/pokemon_names.rs","rank":92,"score":138948.260230655},{"content":"#[openapi]\n\n#[get(\"/items/names/<item_id>\")]\n\npub fn get_item_name(\n\n sql: State<PkmnapiSQL>,\n\n _rate_limit: RateLimit,\n\n access_token: Result<AccessToken, AccessTokenError>,\n\n item_id: u8,\n\n) -> Result<Json<ItemNameResponse>, ResponseError> {\n\n let access_token = utils::get_access_token(access_token)?;\n\n let (db, _) = utils::get_db_with_applied_patches(&sql, &access_token)?;\n\n\n\n let item_name = db.get_item_name(&item_id)?;\n\n\n\n let response = ItemNameResponse::new(&item_id, &item_name);\n\n\n\n Ok(Json(response))\n\n}\n\n\n","file_path":"pkmnapi-api/src/routes/item_names.rs","rank":93,"score":138948.260230655},{"content":"#[openapi]\n\n#[get(\"/marts/items/<mart_id>\")]\n\npub fn get_mart_items(\n\n sql: State<PkmnapiSQL>,\n\n _rate_limit: RateLimit,\n\n access_token: Result<AccessToken, AccessTokenError>,\n\n mart_id: u8,\n\n) -> Result<Json<MartItemsResponse>, ResponseError> {\n\n let access_token = utils::get_access_token(access_token)?;\n\n let (db, _) = utils::get_db_with_applied_patches(&sql, &access_token)?;\n\n\n\n let mart_items = db.get_mart_items(&mart_id)?;\n\n let item_ids = mart_items\n\n .iter()\n\n .filter_map(|mart_item| match mart_item {\n\n MartItem::ITEM(item_id) => Some(*item_id),\n\n _ => None,\n\n })\n\n .collect();\n\n let item_names = db.get_item_name_all(&item_ids)?;\n\n let tm_ids = mart_items\n\n .iter()\n","file_path":"pkmnapi-api/src/routes/mart_items.rs","rank":94,"score":138948.260230655},{"content":"#[openapi]\n\n#[get(\"/moves/stats/<move_id>\")]\n\npub fn get_move_stats(\n\n sql: State<PkmnapiSQL>,\n\n _rate_limit: RateLimit,\n\n access_token: Result<AccessToken, AccessTokenError>,\n\n move_id: u8,\n\n) -> Result<Json<MoveStatsResponse>, ResponseError> {\n\n let access_token = utils::get_access_token(access_token)?;\n\n let (db, _) = utils::get_db_with_applied_patches(&sql, &access_token)?;\n\n\n\n let move_stats = db.get_move_stats(&move_id)?;\n\n let type_name = db.get_type_name(&move_stats.type_id)?;\n\n\n\n let response = MoveStatsResponse::new(&move_id, &move_stats, &type_name);\n\n\n\n Ok(Json(response))\n\n}\n\n\n","file_path":"pkmnapi-api/src/routes/move_stats.rs","rank":95,"score":138948.260230655},{"content":"#[openapi]\n\n#[get(\"/pokedex/texts/<pokedex_id>\")]\n\npub fn get_pokedex_text(\n\n sql: State<PkmnapiSQL>,\n\n _rate_limit: RateLimit,\n\n access_token: Result<AccessToken, AccessTokenError>,\n\n pokedex_id: u8,\n\n) -> Result<Json<PokedexTextResponse>, ResponseError> {\n\n let access_token = utils::get_access_token(access_token)?;\n\n let (db, _) = utils::get_db_with_applied_patches(&sql, &access_token)?;\n\n\n\n let pokedex_text = db.get_pokedex_text(&pokedex_id)?;\n\n\n\n let response = PokedexTextResponse::new(&pokedex_id, &pokedex_text);\n\n\n\n Ok(Json(response))\n\n}\n\n\n\n#[openapi]\n\n#[post(\n\n \"/pokedex/texts/<pokedex_id>\",\n\n format = \"application/json\",\n\n data = \"<data>\"\n\n)]\n","file_path":"pkmnapi-api/src/routes/pokedex_texts.rs","rank":96,"score":138948.260230655},{"content":"#[openapi]\n\n#[get(\"/pokemon/movesets/<pokedex_id>\")]\n\npub fn get_pokemon_moveset(\n\n sql: State<PkmnapiSQL>,\n\n _rate_limit: RateLimit,\n\n access_token: Result<AccessToken, AccessTokenError>,\n\n pokedex_id: u8,\n\n) -> Result<Json<PokemonMovesetResponse>, ResponseError> {\n\n let access_token = utils::get_access_token(access_token)?;\n\n let (db, _) = utils::get_db_with_applied_patches(&sql, &access_token)?;\n\n\n\n let pokemon_moveset = db.get_pokemon_moveset(&pokedex_id)?;\n\n let move_names = db.get_move_name_all(&pokemon_moveset)?;\n\n\n\n let response = PokemonMovesetResponse::new(&pokedex_id, &pokemon_moveset, &move_names);\n\n\n\n Ok(Json(response))\n\n}\n\n\n\n#[openapi]\n\n#[post(\n\n \"/pokemon/movesets/<pokedex_id>\",\n\n format = \"application/json\",\n\n data = \"<data>\"\n\n)]\n","file_path":"pkmnapi-api/src/routes/pokemon_movesets.rs","rank":97,"score":138948.260230655},{"content":"#[openapi]\n\n#[get(\"/pokemon/stats\")]\n\npub fn get_pokemon_stats_all(\n\n sql: State<PkmnapiSQL>,\n\n _rate_limit: RateLimit,\n\n access_token: Result<AccessToken, AccessTokenError>,\n\n) -> Result<Json<PokemonStatsResponseAll>, ResponseError> {\n\n let access_token = utils::get_access_token(access_token)?;\n\n let (db, _) = utils::get_db_with_applied_patches(&sql, &access_token)?;\n\n\n\n let (min_pokedex_id, max_pokedex_id) = db.pokedex_id_bounds();\n\n let pokedex_ids: Vec<u8> = (min_pokedex_id..=max_pokedex_id)\n\n .map(|pokedex_id| pokedex_id as u8)\n\n .collect();\n\n let pokemon_stats = db.get_pokemon_stats_all(&pokedex_ids)?;\n\n let type_ids = pokemon_stats\n\n .iter()\n\n .map(|(_, pokemon_stats)| pokemon_stats.type_ids.to_vec())\n\n .flatten()\n\n .collect();\n\n let type_names = db.get_type_name_all(&type_ids)?;\n\n\n\n let response = PokemonStatsResponseAll::new(&pokedex_ids, &pokemon_stats, &type_names);\n\n\n\n Ok(Json(response))\n\n}\n\n\n","file_path":"pkmnapi-api/src/routes/pokemon_stats.rs","rank":98,"score":138948.260230655},{"content":"pub fn post_pokemon_machines(\n\n sql: State<PkmnapiSQL>,\n\n _rate_limit: RateLimit,\n\n access_token: Result<AccessToken, AccessTokenError>,\n\n patch_description: Result<PatchDescription, PatchDescriptionError>,\n\n data: Result<Json<PokemonMachinesRequest>, JsonError>,\n\n pokedex_id: u8,\n\n) -> Result<status::Accepted<JsonValue>, ResponseError> {\n\n let access_token = utils::get_access_token(access_token)?;\n\n let data = utils::get_data(data, BaseErrorResponseId::error_pokemon_machines_invalid)?;\n\n let (db, connection) = utils::get_db(&sql, &access_token)?;\n\n\n\n let pokemon_machines = data.get_machines();\n\n\n\n let patch = db.set_pokemon_machines(&pokedex_id, &pokemon_machines)?;\n\n\n\n utils::insert_rom_patch(\n\n sql,\n\n connection,\n\n access_token,\n\n patch,\n\n patch_description,\n\n BaseErrorResponseId::error_pokemon_machines,\n\n )?;\n\n\n\n Ok(status::Accepted(Some(json!({}))))\n\n}\n","file_path":"pkmnapi-api/src/routes/pokemon_machines.rs","rank":99,"score":138948.260230655}],"string":"[\n {\n \"content\": \"pub fn get_data_raw(data: Data) -> Vec<u8> {\\n\\n let mut raw = Vec::new();\\n\\n\\n\\n data.stream_to(&mut raw).unwrap();\\n\\n\\n\\n raw\\n\\n}\\n\\n\\n\",\n \"file_path\": \"pkmnapi-api/src/utils.rs\",\n \"rank\": 0,\n \"score\": 323389.12652447517\n },\n {\n \"content\": \"pub fn get_etag(if_match: Result<IfMatch, IfMatchError>) -> Result<String, ResponseError> {\\n\\n match if_match {\\n\\n Ok(if_match) => Ok(if_match.into_inner()),\\n\\n Err(_) => Err(ETagErrorMissing::new()),\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"pkmnapi-api/src/utils.rs\",\n \"rank\": 1,\n \"score\": 249555.0115318573\n },\n {\n \"content\": \"#[allow(dead_code)]\\n\\npub fn assert_unauthorized(response: &mut Response) -> Result<(), String> {\\n\\n let response_body = response.body_string().unwrap();\\n\\n let headers = response.headers();\\n\\n\\n\\n let body = json!({\\n\\n \\\"data\\\": {\\n\\n \\\"id\\\": \\\"error_access_tokens_unauthorized\\\",\\n\\n \\\"type\\\": \\\"errors\\\",\\n\\n \\\"attributes\\\": {\\n\\n \\\"message\\\": \\\"Authorization header must be set\\\"\\n\\n }\\n\\n }\\n\\n });\\n\\n\\n\\n assert_eq!(response_body, body.to_string());\\n\\n assert_eq!(response.status(), Status::Unauthorized);\\n\\n\\n\\n assert_headers(\\n\\n headers,\\n\\n vec![\\n\\n (\\\"Content-Type\\\", \\\"application/json\\\"),\\n\\n (\\\"Server\\\", \\\"pkmnapi/0.1.0\\\"),\\n\\n ],\\n\\n )\\n\\n}\\n\\n\\n\",\n \"file_path\": \"pkmnapi-api/tests/common.rs\",\n \"rank\": 2,\n \"score\": 243935.38348613508\n },\n {\n \"content\": \"#[allow(dead_code)]\\n\\n#[allow(non_snake_case)]\\n\\npub fn load_rom() -> Vec<u8> {\\n\\n let PKMN_ROM = env::var(\\\"PKMN_ROM\\\")\\n\\n .expect(\\\"Set the PKMN_ROM environment variable to point to the ROM location\\\");\\n\\n\\n\\n fs::read(PKMN_ROM).unwrap()\\n\\n}\\n\\n\\n\",\n \"file_path\": \"pkmnapi-api/tests/common.rs\",\n \"rank\": 3,\n \"score\": 203748.85819862864\n },\n {\n \"content\": \"#[allow(dead_code)]\\n\\n#[allow(non_snake_case)]\\n\\npub fn load_sav() -> Vec<u8> {\\n\\n let PKMN_SAV = env::var(\\\"PKMN_SAV\\\")\\n\\n .expect(\\\"Set the PKMN_SAV environment variable to point to the SAV location\\\");\\n\\n\\n\\n fs::read(PKMN_SAV).unwrap()\\n\\n}\\n\\n\\n\",\n \"file_path\": \"pkmnapi-api/tests/common.rs\",\n \"rank\": 4,\n \"score\": 203748.85819862864\n },\n {\n \"content\": \"/// Generate eTag\\n\\n///\\n\\n/// # Example\\n\\n///\\n\\n/// ```\\n\\n/// use pkmnapi_sql::utils;\\n\\n///\\n\\n/// let etag = utils::etag(&\\\"bar\\\".to_owned().into_bytes());\\n\\n///\\n\\n/// assert_eq!(etag, \\\"w/\\\\\\\"37b51d194a7513e45b56f6524f2d51f2\\\\\\\"\\\");\\n\\n/// ```\\n\\npub fn etag(body: &Vec<u8>) -> String {\\n\\n let content = hash(body);\\n\\n\\n\\n format!(\\\"w/\\\\\\\"{}\\\\\\\"\\\", content)\\n\\n}\\n\",\n \"file_path\": \"pkmnapi-sql/src/utils.rs\",\n \"rank\": 5,\n \"score\": 191117.4623637281\n },\n {\n \"content\": \"/// Generate hash string\\n\\n///\\n\\n/// # Example\\n\\n///\\n\\n/// ```\\n\\n/// use pkmnapi_sql::utils;\\n\\n///\\n\\n/// let hash = utils::hash(&\\\"bar\\\".to_owned().into_bytes());\\n\\n///\\n\\n/// assert_eq!(hash, \\\"37b51d194a7513e45b56f6524f2d51f2\\\");\\n\\n/// ```\\n\\npub fn hash(value: &Vec<u8>) -> String {\\n\\n format!(\\\"{:02x}\\\", md5::compute(value))\\n\\n}\\n\\n\\n\",\n \"file_path\": \"pkmnapi-sql/src/utils.rs\",\n \"rank\": 6,\n \"score\": 191117.28942506498\n },\n {\n \"content\": \"#[get(\\\"/maps/pics/<map_id>\\\", format = \\\"image/jpeg\\\", rank = 2)]\\n\\npub fn get_map_pic_jpeg<'a>(\\n\\n sql: State<PkmnapiSQL>,\\n\\n _rate_limit: RateLimit,\\n\\n access_token: Result<AccessToken, AccessTokenError>,\\n\\n map_id: u8,\\n\\n) -> Result<Response<'a>, ResponseError> {\\n\\n let access_token = utils::get_access_token(access_token)?;\\n\\n let (db, _) = utils::get_db_with_applied_patches(&sql, &access_token)?;\\n\\n\\n\\n let map = db.get_map_pic(&map_id)?;\\n\\n let img = map.to_jpeg()?;\\n\\n\\n\\n let response = Response::build()\\n\\n .header(ContentType::JPEG)\\n\\n .header(Header::new(\\n\\n \\\"Content-Disposition\\\",\\n\\n format!(r#\\\"attachment; filename=\\\"map-{}.jpg\\\"\\\"#, map_id),\\n\\n ))\\n\\n .sized_body(Cursor::new(img))\\n\\n .finalize();\\n\\n\\n\\n Ok(response)\\n\\n}\\n\",\n \"file_path\": \"pkmnapi-api/src/routes/map_pics.rs\",\n \"rank\": 7,\n \"score\": 190423.58549159678\n },\n {\n \"content\": \"#[get(\\\"/maps/pics/<map_id>\\\", format = \\\"image/png\\\", rank = 1)]\\n\\npub fn get_map_pic_png<'a>(\\n\\n sql: State<PkmnapiSQL>,\\n\\n _rate_limit: RateLimit,\\n\\n access_token: Result<AccessToken, AccessTokenError>,\\n\\n map_id: u8,\\n\\n) -> Result<Response<'a>, ResponseError> {\\n\\n let access_token = utils::get_access_token(access_token)?;\\n\\n let (db, _) = utils::get_db_with_applied_patches(&sql, &access_token)?;\\n\\n\\n\\n let map = db.get_map_pic(&map_id)?;\\n\\n let img = map.to_png()?;\\n\\n\\n\\n let response = Response::build()\\n\\n .header(ContentType::PNG)\\n\\n .header(Header::new(\\n\\n \\\"Content-Disposition\\\",\\n\\n format!(r#\\\"attachment; filename=\\\"map-{}.png\\\"\\\"#, map_id),\\n\\n ))\\n\\n .sized_body(Cursor::new(img))\\n\\n .finalize();\\n\\n\\n\\n Ok(response)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"pkmnapi-api/src/routes/map_pics.rs\",\n \"rank\": 8,\n \"score\": 190423.58549159678\n },\n {\n \"content\": \"#[get(\\\"/trainers/pics/<trainer_id>?<mirror>\\\", format = \\\"image/png\\\", rank = 1)]\\n\\npub fn get_trainer_pic_png<'a>(\\n\\n sql: State<PkmnapiSQL>,\\n\\n _rate_limit: RateLimit,\\n\\n access_token: Result<AccessToken, AccessTokenError>,\\n\\n trainer_id: u8,\\n\\n mirror: Option<bool>,\\n\\n) -> Result<Response<'a>, ResponseError> {\\n\\n let access_token = utils::get_access_token(access_token)?;\\n\\n let (db, _) = utils::get_db_with_applied_patches(&sql, &access_token)?;\\n\\n\\n\\n let pic = db.get_trainer_pic(&trainer_id)?;\\n\\n let trainer_name = db.get_trainer_name(&trainer_id)?;\\n\\n let img = pic.to_png(mirror.is_some())?;\\n\\n\\n\\n let response = Response::build()\\n\\n .header(ContentType::PNG)\\n\\n .header(Header::new(\\n\\n \\\"Content-Disposition\\\",\\n\\n format!(r#\\\"attachment; filename=\\\"{}.png\\\"\\\"#, trainer_name.name),\\n\\n ))\\n\",\n \"file_path\": \"pkmnapi-api/src/routes/trainer_pics.rs\",\n \"rank\": 9,\n \"score\": 190423.4429910677\n },\n {\n \"content\": \"pub fn get_pokemon_pic_png<'a>(\\n\\n sql: State<PkmnapiSQL>,\\n\\n _rate_limit: RateLimit,\\n\\n access_token: Result<AccessToken, AccessTokenError>,\\n\\n pokedex_id: u8,\\n\\n face: Option<String>,\\n\\n mirror: Option<bool>,\\n\\n) -> Result<Response<'a>, ResponseError> {\\n\\n let access_token = utils::get_access_token(access_token)?;\\n\\n let (db, _) = utils::get_db_with_applied_patches(&sql, &access_token)?;\\n\\n\\n\\n let pic = db.get_pokemon_pic(&pokedex_id, &PokemonPicFace::from(face))?;\\n\\n let pokemon_name = db.get_pokemon_name(&pokedex_id)?;\\n\\n let img = pic.to_png(mirror.is_some())?;\\n\\n\\n\\n let response = Response::build()\\n\\n .header(ContentType::PNG)\\n\\n .header(Header::new(\\n\\n \\\"Content-Disposition\\\",\\n\\n format!(r#\\\"attachment; filename=\\\"{}.png\\\"\\\"#, pokemon_name.name),\\n\",\n \"file_path\": \"pkmnapi-api/src/routes/pokemon_pics.rs\",\n \"rank\": 10,\n \"score\": 190412.1779769486\n },\n {\n \"content\": \"pub fn get_pokemon_pic_jpeg<'a>(\\n\\n sql: State<PkmnapiSQL>,\\n\\n _rate_limit: RateLimit,\\n\\n access_token: Result<AccessToken, AccessTokenError>,\\n\\n pokedex_id: u8,\\n\\n face: Option<String>,\\n\\n mirror: Option<bool>,\\n\\n) -> Result<Response<'a>, ResponseError> {\\n\\n let access_token = utils::get_access_token(access_token)?;\\n\\n let (db, _) = utils::get_db_with_applied_patches(&sql, &access_token)?;\\n\\n\\n\\n let pic = db.get_pokemon_pic(&pokedex_id, &PokemonPicFace::from(face))?;\\n\\n let pokemon_name = db.get_pokemon_name(&pokedex_id)?;\\n\\n let img = pic.to_jpeg(mirror.is_some())?;\\n\\n\\n\\n let response = Response::build()\\n\\n .header(ContentType::JPEG)\\n\\n .header(Header::new(\\n\\n \\\"Content-Disposition\\\",\\n\\n format!(r#\\\"attachment; filename=\\\"{}.jpg\\\"\\\"#, pokemon_name.name),\\n\",\n \"file_path\": \"pkmnapi-api/src/routes/pokemon_pics.rs\",\n \"rank\": 11,\n \"score\": 190412.1779769486\n },\n {\n \"content\": \"pub fn post_pokemon_pic_jpeg<'a>(\\n\\n sql: State<PkmnapiSQL>,\\n\\n _rate_limit: RateLimit,\\n\\n data: Data,\\n\\n access_token: Result<AccessToken, AccessTokenError>,\\n\\n patch_description: Result<PatchDescription, PatchDescriptionError>,\\n\\n pokedex_id: u8,\\n\\n face: Option<String>,\\n\\n method: Option<u8>,\\n\\n primary: Option<u8>,\\n\\n) -> Result<status::Accepted<JsonValue>, ResponseError> {\\n\\n let access_token = utils::get_access_token(access_token)?;\\n\\n let (db, connection) = utils::get_db(&sql, &access_token)?;\\n\\n let raw_data = utils::get_data_raw(data);\\n\\n\\n\\n let pic = Pic::from_jpeg(raw_data)?;\\n\\n let encoding_method = PicEncodingMethod::from(method.unwrap_or(0x01), primary.unwrap_or(0x00));\\n\\n let patch = db.set_pokemon_pic(\\n\\n &pokedex_id,\\n\\n &PokemonPicFace::from(face),\\n\",\n \"file_path\": \"pkmnapi-api/src/routes/pokemon_pics.rs\",\n \"rank\": 12,\n \"score\": 190412.1779769486\n },\n {\n \"content\": \"pub fn post_pokemon_pic_png<'a>(\\n\\n sql: State<PkmnapiSQL>,\\n\\n _rate_limit: RateLimit,\\n\\n data: Data,\\n\\n access_token: Result<AccessToken, AccessTokenError>,\\n\\n patch_description: Result<PatchDescription, PatchDescriptionError>,\\n\\n pokedex_id: u8,\\n\\n face: Option<String>,\\n\\n method: Option<u8>,\\n\\n primary: Option<u8>,\\n\\n) -> Result<status::Accepted<JsonValue>, ResponseError> {\\n\\n let access_token = utils::get_access_token(access_token)?;\\n\\n let (db, connection) = utils::get_db(&sql, &access_token)?;\\n\\n let raw_data = utils::get_data_raw(data);\\n\\n\\n\\n let pic = Pic::from_png(raw_data)?;\\n\\n let encoding_method = PicEncodingMethod::from(method.unwrap_or(0x01), primary.unwrap_or(0x00));\\n\\n let patch = db.set_pokemon_pic(\\n\\n &pokedex_id,\\n\\n &PokemonPicFace::from(face),\\n\",\n \"file_path\": \"pkmnapi-api/src/routes/pokemon_pics.rs\",\n \"rank\": 13,\n \"score\": 190412.1779769486\n },\n {\n \"content\": \"pub fn post_trainer_pic_png<'a>(\\n\\n sql: State<PkmnapiSQL>,\\n\\n _rate_limit: RateLimit,\\n\\n data: Data,\\n\\n access_token: Result<AccessToken, AccessTokenError>,\\n\\n patch_description: Result<PatchDescription, PatchDescriptionError>,\\n\\n trainer_id: u8,\\n\\n method: Option<u8>,\\n\\n primary: Option<u8>,\\n\\n) -> Result<status::Accepted<JsonValue>, ResponseError> {\\n\\n let access_token = utils::get_access_token(access_token)?;\\n\\n let (db, connection) = utils::get_db(&sql, &access_token)?;\\n\\n let raw_data = utils::get_data_raw(data);\\n\\n\\n\\n let pic = Pic::from_png(raw_data)?;\\n\\n let encoding_method = PicEncodingMethod::from(method.unwrap_or(0x01), primary.unwrap_or(0x00));\\n\\n let patch = db.set_trainer_pic(&trainer_id, &pic, encoding_method)?;\\n\\n\\n\\n utils::insert_rom_patch(\\n\\n sql,\\n\",\n \"file_path\": \"pkmnapi-api/src/routes/trainer_pics.rs\",\n \"rank\": 14,\n \"score\": 190412.1779769486\n },\n {\n \"content\": \"pub fn post_trainer_pic_jpeg<'a>(\\n\\n sql: State<PkmnapiSQL>,\\n\\n _rate_limit: RateLimit,\\n\\n data: Data,\\n\\n access_token: Result<AccessToken, AccessTokenError>,\\n\\n patch_description: Result<PatchDescription, PatchDescriptionError>,\\n\\n trainer_id: u8,\\n\\n method: Option<u8>,\\n\\n primary: Option<u8>,\\n\\n) -> Result<status::Accepted<JsonValue>, ResponseError> {\\n\\n let access_token = utils::get_access_token(access_token)?;\\n\\n let (db, connection) = utils::get_db(&sql, &access_token)?;\\n\\n let raw_data = utils::get_data_raw(data);\\n\\n\\n\\n let pic = Pic::from_jpeg(raw_data)?;\\n\\n let encoding_method = PicEncodingMethod::from(method.unwrap_or(0x01), primary.unwrap_or(0x00));\\n\\n let patch = db.set_trainer_pic(&trainer_id, &pic, encoding_method)?;\\n\\n\\n\\n utils::insert_rom_patch(\\n\\n sql,\\n\\n connection,\\n\\n access_token,\\n\\n patch,\\n\\n patch_description,\\n\\n BaseErrorResponseId::error_trainer_pics,\\n\\n )?;\\n\\n\\n\\n Ok(status::Accepted(Some(json!({}))))\\n\\n}\\n\",\n \"file_path\": \"pkmnapi-api/src/routes/trainer_pics.rs\",\n \"rank\": 15,\n \"score\": 190412.1779769486\n },\n {\n \"content\": \"pub fn get_trainer_pic_jpeg<'a>(\\n\\n sql: State<PkmnapiSQL>,\\n\\n _rate_limit: RateLimit,\\n\\n access_token: Result<AccessToken, AccessTokenError>,\\n\\n trainer_id: u8,\\n\\n mirror: Option<bool>,\\n\\n) -> Result<Response<'a>, ResponseError> {\\n\\n let access_token = utils::get_access_token(access_token)?;\\n\\n let (db, _) = utils::get_db_with_applied_patches(&sql, &access_token)?;\\n\\n\\n\\n let pic = db.get_trainer_pic(&trainer_id)?;\\n\\n let trainer_name = db.get_trainer_name(&trainer_id)?;\\n\\n let img = pic.to_jpeg(mirror.is_some())?;\\n\\n\\n\\n let response = Response::build()\\n\\n .header(ContentType::JPEG)\\n\\n .header(Header::new(\\n\\n \\\"Content-Disposition\\\",\\n\\n format!(r#\\\"attachment; filename=\\\"{}.jpg\\\"\\\"#, trainer_name.name),\\n\\n ))\\n\",\n \"file_path\": \"pkmnapi-api/src/routes/trainer_pics.rs\",\n \"rank\": 16,\n \"score\": 190412.1779769486\n },\n {\n \"content\": \"pub fn get_data<T>(\\n\\n data: Result<Json<T>, JsonError>,\\n\\n error_id: BaseErrorResponseId,\\n\\n) -> Result<T, ResponseError> {\\n\\n match data {\\n\\n Ok(data) => Ok(data.into_inner()),\\n\\n Err(JsonError::Parse(_, e)) => {\\n\\n return Err(BadRequestError::new(error_id, Some(e.to_string())));\\n\\n }\\n\\n _ => {\\n\\n return Err(BadRequestError::new(\\n\\n error_id,\\n\\n Some(\\\"An unknown error occurred\\\".to_owned()),\\n\\n ));\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"pkmnapi-api/src/utils.rs\",\n \"rank\": 17,\n \"score\": 187959.07458001777\n },\n {\n \"content\": \"#[post(\\\"/imgs/pokemon_logo\\\", format = \\\"image/png\\\", data = \\\"<data>\\\", rank = 1)]\\n\\npub fn post_pokemon_logo_png<'a>(\\n\\n sql: State<PkmnapiSQL>,\\n\\n _rate_limit: RateLimit,\\n\\n data: Data,\\n\\n access_token: Result<AccessToken, AccessTokenError>,\\n\\n patch_description: Result<PatchDescription, PatchDescriptionError>,\\n\\n) -> Result<status::Accepted<JsonValue>, ResponseError> {\\n\\n let access_token = utils::get_access_token(access_token)?;\\n\\n let (db, connection) = utils::get_db(&sql, &access_token)?;\\n\\n let raw_data = utils::get_data_raw(data);\\n\\n\\n\\n let img = Img::from_png(raw_data)?;\\n\\n let patch = db.set_pokemon_logo_img(&img)?;\\n\\n\\n\\n utils::insert_rom_patch(\\n\\n sql,\\n\\n connection,\\n\\n access_token,\\n\\n patch,\\n\\n patch_description,\\n\\n BaseErrorResponseId::error_pokemon_logo_imgs,\\n\\n )?;\\n\\n\\n\\n Ok(status::Accepted(Some(json!({}))))\\n\\n}\\n\\n\\n\",\n \"file_path\": \"pkmnapi-api/src/routes/imgs.rs\",\n \"rank\": 18,\n \"score\": 181059.44703563934\n },\n {\n \"content\": \"#[post(\\\"/imgs/pokemon_logo\\\", format = \\\"image/jpeg\\\", data = \\\"<data>\\\", rank = 2)]\\n\\npub fn post_pokemon_logo_jpeg<'a>(\\n\\n sql: State<PkmnapiSQL>,\\n\\n _rate_limit: RateLimit,\\n\\n data: Data,\\n\\n access_token: Result<AccessToken, AccessTokenError>,\\n\\n patch_description: Result<PatchDescription, PatchDescriptionError>,\\n\\n) -> Result<status::Accepted<JsonValue>, ResponseError> {\\n\\n let access_token = utils::get_access_token(access_token)?;\\n\\n let (db, connection) = utils::get_db(&sql, &access_token)?;\\n\\n let raw_data = utils::get_data_raw(data);\\n\\n\\n\\n let img = Img::from_jpeg(raw_data)?;\\n\\n let patch = db.set_pokemon_logo_img(&img)?;\\n\\n\\n\\n utils::insert_rom_patch(\\n\\n sql,\\n\\n connection,\\n\\n access_token,\\n\\n patch,\\n\\n patch_description,\\n\\n BaseErrorResponseId::error_pokemon_logo_imgs,\\n\\n )?;\\n\\n\\n\\n Ok(status::Accepted(Some(json!({}))))\\n\\n}\\n\\n\\n\",\n \"file_path\": \"pkmnapi-api/src/routes/imgs.rs\",\n \"rank\": 19,\n \"score\": 181059.44703563934\n },\n {\n \"content\": \"#[get(\\\"/imgs/pokemon_logo\\\", format = \\\"image/jpeg\\\", rank = 2)]\\n\\npub fn get_pokemon_logo_jpeg<'a>(\\n\\n sql: State<PkmnapiSQL>,\\n\\n _rate_limit: RateLimit,\\n\\n access_token: Result<AccessToken, AccessTokenError>,\\n\\n) -> Result<Response<'a>, ResponseError> {\\n\\n let access_token = utils::get_access_token(access_token)?;\\n\\n let (db, _) = utils::get_db_with_applied_patches(&sql, &access_token)?;\\n\\n\\n\\n let pokemon_logo = db.get_pokemon_logo_img()?;\\n\\n let img = pokemon_logo.to_jpeg()?;\\n\\n\\n\\n let response = Response::build()\\n\\n .header(ContentType::JPEG)\\n\\n .header(Header::new(\\n\\n \\\"Content-Disposition\\\",\\n\\n r#\\\"attachment; filename=\\\"pokemon_logo.jpg\\\"\\\"#,\\n\\n ))\\n\\n .sized_body(Cursor::new(img))\\n\\n .finalize();\\n\\n\\n\\n Ok(response)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"pkmnapi-api/src/routes/imgs.rs\",\n \"rank\": 20,\n \"score\": 181053.21488653042\n },\n {\n \"content\": \"#[get(\\\"/imgs/town_map\\\", format = \\\"image/png\\\", rank = 1)]\\n\\npub fn get_town_map_png<'a>(\\n\\n sql: State<PkmnapiSQL>,\\n\\n _rate_limit: RateLimit,\\n\\n access_token: Result<AccessToken, AccessTokenError>,\\n\\n) -> Result<Response<'a>, ResponseError> {\\n\\n let access_token = utils::get_access_token(access_token)?;\\n\\n let (db, _) = utils::get_db_with_applied_patches(&sql, &access_token)?;\\n\\n\\n\\n let town_map = db.get_town_map_img()?;\\n\\n let img = town_map.to_png()?;\\n\\n\\n\\n let response = Response::build()\\n\\n .header(ContentType::PNG)\\n\\n .header(Header::new(\\n\\n \\\"Content-Disposition\\\",\\n\\n r#\\\"attachment; filename=\\\"town_map.png\\\"\\\"#,\\n\\n ))\\n\\n .sized_body(Cursor::new(img))\\n\\n .finalize();\\n\\n\\n\\n Ok(response)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"pkmnapi-api/src/routes/imgs.rs\",\n \"rank\": 21,\n \"score\": 181053.21488653042\n },\n {\n \"content\": \"#[get(\\\"/imgs/game_boy\\\", format = \\\"image/jpeg\\\", rank = 2)]\\n\\npub fn get_game_boy_jpeg<'a>(\\n\\n sql: State<PkmnapiSQL>,\\n\\n _rate_limit: RateLimit,\\n\\n access_token: Result<AccessToken, AccessTokenError>,\\n\\n) -> Result<Response<'a>, ResponseError> {\\n\\n let access_token = utils::get_access_token(access_token)?;\\n\\n let (db, _) = utils::get_db_with_applied_patches(&sql, &access_token)?;\\n\\n\\n\\n let game_boy = db.get_game_boy_img()?;\\n\\n let img = game_boy.to_jpeg()?;\\n\\n\\n\\n let response = Response::build()\\n\\n .header(ContentType::JPEG)\\n\\n .header(Header::new(\\n\\n \\\"Content-Disposition\\\",\\n\\n r#\\\"attachment; filename=\\\"game_boy.jpg\\\"\\\"#,\\n\\n ))\\n\\n .sized_body(Cursor::new(img))\\n\\n .finalize();\\n\\n\\n\\n Ok(response)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"pkmnapi-api/src/routes/imgs.rs\",\n \"rank\": 22,\n \"score\": 181053.21488653042\n },\n {\n \"content\": \"#[get(\\\"/imgs/game_boy\\\", format = \\\"image/png\\\", rank = 1)]\\n\\npub fn get_game_boy_png<'a>(\\n\\n sql: State<PkmnapiSQL>,\\n\\n _rate_limit: RateLimit,\\n\\n access_token: Result<AccessToken, AccessTokenError>,\\n\\n) -> Result<Response<'a>, ResponseError> {\\n\\n let access_token = utils::get_access_token(access_token)?;\\n\\n let (db, _) = utils::get_db_with_applied_patches(&sql, &access_token)?;\\n\\n\\n\\n let game_boy = db.get_game_boy_img()?;\\n\\n let img = game_boy.to_png()?;\\n\\n\\n\\n let response = Response::build()\\n\\n .header(ContentType::PNG)\\n\\n .header(Header::new(\\n\\n \\\"Content-Disposition\\\",\\n\\n r#\\\"attachment; filename=\\\"game_boy.png\\\"\\\"#,\\n\\n ))\\n\\n .sized_body(Cursor::new(img))\\n\\n .finalize();\\n\\n\\n\\n Ok(response)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"pkmnapi-api/src/routes/imgs.rs\",\n \"rank\": 23,\n \"score\": 181053.21488653042\n },\n {\n \"content\": \"#[get(\\\"/imgs/town_map\\\", format = \\\"image/jpeg\\\", rank = 2)]\\n\\npub fn get_town_map_jpeg<'a>(\\n\\n sql: State<PkmnapiSQL>,\\n\\n _rate_limit: RateLimit,\\n\\n access_token: Result<AccessToken, AccessTokenError>,\\n\\n) -> Result<Response<'a>, ResponseError> {\\n\\n let access_token = utils::get_access_token(access_token)?;\\n\\n let (db, _) = utils::get_db_with_applied_patches(&sql, &access_token)?;\\n\\n\\n\\n let town_map = db.get_town_map_img()?;\\n\\n let img = town_map.to_jpeg()?;\\n\\n\\n\\n let response = Response::build()\\n\\n .header(ContentType::JPEG)\\n\\n .header(Header::new(\\n\\n \\\"Content-Disposition\\\",\\n\\n r#\\\"attachment; filename=\\\"town_map.jpg\\\"\\\"#,\\n\\n ))\\n\\n .sized_body(Cursor::new(img))\\n\\n .finalize();\\n\\n\\n\\n Ok(response)\\n\\n}\\n\",\n \"file_path\": \"pkmnapi-api/src/routes/imgs.rs\",\n \"rank\": 24,\n \"score\": 181053.21488653042\n },\n {\n \"content\": \"#[get(\\\"/imgs/pokemon_logo\\\", format = \\\"image/png\\\", rank = 1)]\\n\\npub fn get_pokemon_logo_png<'a>(\\n\\n sql: State<PkmnapiSQL>,\\n\\n _rate_limit: RateLimit,\\n\\n access_token: Result<AccessToken, AccessTokenError>,\\n\\n) -> Result<Response<'a>, ResponseError> {\\n\\n let access_token = utils::get_access_token(access_token)?;\\n\\n let (db, _) = utils::get_db_with_applied_patches(&sql, &access_token)?;\\n\\n\\n\\n let pokemon_logo = db.get_pokemon_logo_img()?;\\n\\n let img = pokemon_logo.to_png()?;\\n\\n\\n\\n let response = Response::build()\\n\\n .header(ContentType::PNG)\\n\\n .header(Header::new(\\n\\n \\\"Content-Disposition\\\",\\n\\n r#\\\"attachment; filename=\\\"pokemon_logo.png\\\"\\\"#,\\n\\n ))\\n\\n .sized_body(Cursor::new(img))\\n\\n .finalize();\\n\\n\\n\\n Ok(response)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"pkmnapi-api/src/routes/imgs.rs\",\n \"rank\": 25,\n \"score\": 181053.21488653042\n },\n {\n \"content\": \"#[get(\\\"/roms/patches?<checksum>\\\", format = \\\"application/patch\\\", rank = 2)]\\n\\npub fn get_rom_patches_raw<'a>(\\n\\n sql: State<PkmnapiSQL>,\\n\\n _rate_limit: RateLimit,\\n\\n access_token: Result<AccessToken, AccessTokenError>,\\n\\n checksum: Option<bool>,\\n\\n) -> Result<Response<'a>, ResponseError> {\\n\\n let access_token = utils::get_access_token(access_token)?;\\n\\n let (db, connection) = utils::get_db_with_applied_patches(&sql, &access_token)?;\\n\\n\\n\\n let patches = match sql.select_rom_patches_by_access_token(&connection, &access_token) {\\n\\n Ok(patches) => patches,\\n\\n Err(_) => return Err(RomErrorNoRom::new()),\\n\\n };\\n\\n\\n\\n let header = \\\"PATCH\\\".chars().map(|c| c as u8).collect::<Vec<u8>>();\\n\\n let footer = \\\"EOF\\\".chars().map(|c| c as u8).collect::<Vec<u8>>();\\n\\n let mut body: Vec<u8> = patches\\n\\n .iter()\\n\\n .map(|patch| patch.data.to_vec())\\n\\n .flatten()\\n\",\n \"file_path\": \"pkmnapi-api/src/routes/rom_patches.rs\",\n \"rank\": 26,\n \"score\": 177905.3978717887\n },\n {\n \"content\": \"#[catch(404)]\\n\\npub fn not_found(_req: &Request) -> Result<ResponseError, ResponseError> {\\n\\n Ok(NotFoundError::new(\\n\\n BaseErrorResponseId::error_not_found,\\n\\n None,\\n\\n ))\\n\\n}\\n\\n\\n\",\n \"file_path\": \"pkmnapi-api/src/routes/errors.rs\",\n \"rank\": 27,\n \"score\": 175409.46576456228\n },\n {\n \"content\": \"/// Generate random ID of size length\\n\\n///\\n\\n/// # Example\\n\\n///\\n\\n/// ```\\n\\n/// use pkmnapi_sql::utils::*;\\n\\n///\\n\\n/// let id = random_id(32);\\n\\n///\\n\\n/// assert_eq!(id.len(), 32);\\n\\n///\\n\\n/// let id = random_id(64);\\n\\n///\\n\\n/// assert_eq!(id.len(), 64);\\n\\n/// ```\\n\\npub fn random_id(length: usize) -> String {\\n\\n let mut rng = thread_rng();\\n\\n\\n\\n iter::repeat(())\\n\\n .map(|()| rng.sample(Alphanumeric))\\n\\n .take(length)\\n\\n .collect()\\n\\n}\\n\\n\\n\",\n \"file_path\": \"pkmnapi-sql/src/utils.rs\",\n \"rank\": 28,\n \"score\": 174260.8970826909\n },\n {\n \"content\": \"#[allow(dead_code)]\\n\\npub fn test_raw<T>(test: T) -> ()\\n\\nwhere\\n\\n T: FnOnce() -> Result<(), String> + panic::UnwindSafe,\\n\\n{\\n\\n let result = panic::catch_unwind(panic::AssertUnwindSafe(|| {\\n\\n test().unwrap();\\n\\n }));\\n\\n\\n\\n assert!(result.is_ok())\\n\\n}\\n\\n\\n\",\n \"file_path\": \"pkmnapi-api/tests/common.rs\",\n \"rank\": 29,\n \"score\": 174247.5950707791\n },\n {\n \"content\": \"#[allow(dead_code)]\\n\\npub fn assert_headers(headers: &HeaderMap<'_>, expected: Vec<(&str, &str)>) -> Result<(), String> {\\n\\n let mut headers = headers.clone();\\n\\n\\n\\n for (key, val) in &expected {\\n\\n let header = match headers.get_one(key) {\\n\\n Some(header) => header,\\n\\n None => return Err(format!(\\\"Could not find header: {}\\\", key)),\\n\\n };\\n\\n\\n\\n if val.len() != 0 {\\n\\n assert_eq!(header, *val);\\n\\n }\\n\\n\\n\\n headers.remove(key);\\n\\n }\\n\\n\\n\\n for header in headers.iter() {\\n\\n panic!(\\\"Extra header found: {}\\\", header);\\n\\n }\\n\\n\\n\\n Ok(())\\n\\n}\\n\\n\\n\",\n \"file_path\": \"pkmnapi-api/tests/common.rs\",\n \"rank\": 30,\n \"score\": 173741.5681792749\n },\n {\n \"content\": \"#[catch(429)]\\n\\npub fn too_many_requests<'a>(req: &Request) -> Result<Response<'a>, ResponseError> {\\n\\n let wait_time = match req.guard::<RateLimit>() {\\n\\n Outcome::Failure((_, RateLimitError::TooManyRequests(wait_time))) => wait_time,\\n\\n _ => 0,\\n\\n };\\n\\n\\n\\n let response = TooManyRequestsError::new(wait_time);\\n\\n let body = serde_json::to_string(&response).unwrap();\\n\\n\\n\\n let response = Response::build()\\n\\n .status(Status::TooManyRequests)\\n\\n .header(ContentType::JSON)\\n\\n .sized_body(Cursor::new(body))\\n\\n .finalize();\\n\\n\\n\\n Ok(response)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"pkmnapi-api/src/routes/errors.rs\",\n \"rank\": 31,\n \"score\": 169475.90695515898\n },\n {\n \"content\": \"#[catch(500)]\\n\\npub fn internal_server_error<'a>(_req: &Request) -> Result<Response<'a>, ResponseError> {\\n\\n let response = InternalServerError::new();\\n\\n let body = serde_json::to_string(&response).unwrap();\\n\\n\\n\\n let response = Response::build()\\n\\n .status(Status::InternalServerError)\\n\\n .header(ContentType::JSON)\\n\\n .sized_body(Cursor::new(body))\\n\\n .finalize();\\n\\n\\n\\n Ok(response)\\n\\n}\\n\",\n \"file_path\": \"pkmnapi-api/src/routes/errors.rs\",\n \"rank\": 32,\n \"score\": 166792.19339796045\n },\n {\n \"content\": \"pub fn from_numeric_str<'de, T, D>(deserializer: D) -> Result<T, D::Error>\\n\\nwhere\\n\\n T: FromStr,\\n\\n T::Err: Display,\\n\\n D: Deserializer<'de>,\\n\\n{\\n\\n let s = String::deserialize(deserializer)?;\\n\\n\\n\\n T::from_str(&s).map_err(de::Error::custom)\\n\\n}\\n\",\n \"file_path\": \"pkmnapi-api/src/utils.rs\",\n \"rank\": 33,\n \"score\": 159600.41422436095\n },\n {\n \"content\": \"pub fn get_db(\\n\\n sql: &State<PkmnapiSQL>,\\n\\n access_token: &String,\\n\\n) -> Result<(PkmnapiDB, PgPooledConnection), ResponseError> {\\n\\n let connection = sql.get_connection().unwrap();\\n\\n let rom_data = match sql.select_user_rom_data_by_access_token(&connection, &access_token) {\\n\\n Ok(Some(rom_data)) => rom_data,\\n\\n Ok(None) => return Err(RomErrorNoRom::new()),\\n\\n _ => {\\n\\n return Err(AccessTokenErrorInvalid::new(\\n\\n &\\\"Invalid access token\\\".to_owned(),\\n\\n ))\\n\\n }\\n\\n };\\n\\n\\n\\n let mut db = PkmnapiDB::new(&rom_data.data);\\n\\n\\n\\n match sql.select_user_sav_by_access_token(&connection, &access_token) {\\n\\n Ok(Some(sav)) => {\\n\\n db.sav(sav.data);\\n\",\n \"file_path\": \"pkmnapi-api/src/utils.rs\",\n \"rank\": 34,\n \"score\": 145996.01461366832\n },\n {\n \"content\": \"#[openapi]\\n\\n#[post(\\\"/trades/<trade_id>\\\", format = \\\"application/json\\\", data = \\\"<data>\\\")]\\n\\npub fn post_trade(\\n\\n sql: State<PkmnapiSQL>,\\n\\n _rate_limit: RateLimit,\\n\\n access_token: Result<AccessToken, AccessTokenError>,\\n\\n patch_description: Result<PatchDescription, PatchDescriptionError>,\\n\\n data: Result<Json<TradeRequest>, JsonError>,\\n\\n trade_id: u8,\\n\\n) -> Result<status::Accepted<JsonValue>, ResponseError> {\\n\\n let access_token = utils::get_access_token(access_token)?;\\n\\n let data = utils::get_data(data, BaseErrorResponseId::error_trades_invalid)?;\\n\\n let (db, connection) = utils::get_db(&sql, &access_token)?;\\n\\n\\n\\n let trade = Trade::new(\\n\\n data.get_give_pokedex_id(),\\n\\n data.get_get_pokedex_id(),\\n\\n data.get_nickname(),\\n\\n );\\n\\n\\n\\n let patch = db.set_trade(&trade_id, &trade)?;\\n\\n\\n\",\n \"file_path\": \"pkmnapi-api/src/routes/trades.rs\",\n \"rank\": 35,\n \"score\": 143543.29184331253\n },\n {\n \"content\": \"#[openapi]\\n\\n#[delete(\\\"/roms\\\")]\\n\\npub fn delete_rom(\\n\\n sql: State<PkmnapiSQL>,\\n\\n _rate_limit: RateLimit,\\n\\n access_token: Result<AccessToken, AccessTokenError>,\\n\\n if_match: Result<IfMatch, IfMatchError>,\\n\\n) -> Result<status::NoContent, ResponseError> {\\n\\n let access_token = utils::get_access_token(access_token)?;\\n\\n let etag = utils::get_etag(if_match)?;\\n\\n let connection = sql.get_connection().unwrap();\\n\\n\\n\\n match sql.delete_user_rom_by_access_token(&connection, &access_token, &etag) {\\n\\n Ok(_) => {}\\n\\n Err(pkmnapi_sql::error::Error::ETagError) => return Err(ETagErrorMismatch::new()),\\n\\n Err(_) => return Err(RomErrorNoRom::new()),\\n\\n }\\n\\n\\n\\n Ok(status::NoContent)\\n\\n}\\n\",\n \"file_path\": \"pkmnapi-api/src/routes/roms.rs\",\n \"rank\": 36,\n \"score\": 143531.09523317707\n },\n {\n \"content\": \"pub fn get_access_token(\\n\\n access_token: Result<AccessToken, AccessTokenError>,\\n\\n) -> Result<String, ResponseError> {\\n\\n match access_token {\\n\\n Ok(access_token) => Ok(access_token.into_inner()),\\n\\n Err(_) => Err(AccessTokenErrorUnauthorized::new()),\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"pkmnapi-api/src/utils.rs\",\n \"rank\": 37,\n \"score\": 143531.09523317707\n },\n {\n \"content\": \"#[openapi]\\n\\n#[get(\\\"/trades/<trade_id>\\\")]\\n\\npub fn get_trade(\\n\\n sql: State<PkmnapiSQL>,\\n\\n _rate_limit: RateLimit,\\n\\n access_token: Result<AccessToken, AccessTokenError>,\\n\\n trade_id: u8,\\n\\n) -> Result<Json<TradeResponse>, ResponseError> {\\n\\n let access_token = utils::get_access_token(access_token)?;\\n\\n let (db, _) = utils::get_db_with_applied_patches(&sql, &access_token)?;\\n\\n\\n\\n let trade = db.get_trade(&trade_id)?;\\n\\n let pokedex_ids = vec![trade.give_pokedex_id, trade.get_pokedex_id];\\n\\n let pokemon_names = db.get_pokemon_name_all(&pokedex_ids)?;\\n\\n\\n\\n let response = TradeResponse::new(&trade_id, &trade, &pokemon_names);\\n\\n\\n\\n Ok(Json(response))\\n\\n}\\n\\n\\n\",\n \"file_path\": \"pkmnapi-api/src/routes/trades.rs\",\n \"rank\": 38,\n \"score\": 143531.09523317707\n },\n {\n \"content\": \"pub fn insert_rom_patch(\\n\\n sql: State<PkmnapiSQL>,\\n\\n connection: PgPooledConnection,\\n\\n access_token: String,\\n\\n patch: Patch,\\n\\n patch_description: Result<PatchDescription, PatchDescriptionError>,\\n\\n error_id: BaseErrorResponseId,\\n\\n) -> Result<(), ResponseError> {\\n\\n let patch_description = get_patch_description(patch_description);\\n\\n\\n\\n match sql.insert_rom_patch(\\n\\n &connection,\\n\\n &access_token,\\n\\n &patch.to_raw(),\\n\\n patch_description,\\n\\n ) {\\n\\n Ok(_) => Ok(()),\\n\\n Err(e) => return Err(NotFoundError::new(error_id, Some(e.to_string()))),\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"pkmnapi-api/src/utils.rs\",\n \"rank\": 39,\n \"score\": 143531.09523317707\n },\n {\n \"content\": \"#[openapi]\\n\\n#[get(\\\"/trades\\\")]\\n\\npub fn get_trade_all(\\n\\n sql: State<PkmnapiSQL>,\\n\\n _rate_limit: RateLimit,\\n\\n access_token: Result<AccessToken, AccessTokenError>,\\n\\n) -> Result<Json<TradeResponseAll>, ResponseError> {\\n\\n let access_token = utils::get_access_token(access_token)?;\\n\\n let (db, _) = utils::get_db_with_applied_patches(&sql, &access_token)?;\\n\\n\\n\\n let (min_trade_id, max_trade_id) = db.trade_id_bounds();\\n\\n let trade_ids: Vec<u8> = (min_trade_id..=max_trade_id)\\n\\n .map(|trade_id| trade_id as u8)\\n\\n .collect();\\n\\n let trades = db.get_trade_all(&trade_ids)?;\\n\\n let pokedex_ids = trades\\n\\n .iter()\\n\\n .map(|(_, trade)| vec![trade.give_pokedex_id, trade.get_pokedex_id])\\n\\n .flatten()\\n\\n .collect();\\n\\n let pokemon_names = db.get_pokemon_name_all(&pokedex_ids)?;\\n\\n\\n\\n let response = TradeResponseAll::new(&trade_ids, &trades, &pokemon_names);\\n\\n\\n\\n Ok(Json(response))\\n\\n}\\n\\n\\n\",\n \"file_path\": \"pkmnapi-api/src/routes/trades.rs\",\n \"rank\": 40,\n \"score\": 143531.09523317707\n },\n {\n \"content\": \"#[openapi]\\n\\n#[delete(\\\"/savs\\\")]\\n\\npub fn delete_sav(\\n\\n sql: State<PkmnapiSQL>,\\n\\n _rate_limit: RateLimit,\\n\\n access_token: Result<AccessToken, AccessTokenError>,\\n\\n if_match: Result<IfMatch, IfMatchError>,\\n\\n) -> Result<status::NoContent, ResponseError> {\\n\\n let access_token = utils::get_access_token(access_token)?;\\n\\n let etag = utils::get_etag(if_match)?;\\n\\n let connection = sql.get_connection().unwrap();\\n\\n\\n\\n match sql.delete_user_sav_by_access_token(&connection, &access_token, &etag) {\\n\\n Ok(_) => {}\\n\\n Err(pkmnapi_sql::error::Error::ETagError) => return Err(ETagErrorMismatch::new()),\\n\\n Err(_) => return Err(SavErrorNoSav::new()),\\n\\n }\\n\\n\\n\\n Ok(status::NoContent)\\n\\n}\\n\",\n \"file_path\": \"pkmnapi-api/src/routes/savs.rs\",\n \"rank\": 41,\n \"score\": 143531.09523317707\n },\n {\n \"content\": \"pub fn get_patch_description(\\n\\n patch_description: Result<PatchDescription, PatchDescriptionError>,\\n\\n) -> Option<String> {\\n\\n match patch_description {\\n\\n Ok(patch_description) => patch_description.into_inner(),\\n\\n Err(_) => None,\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"pkmnapi-api/src/utils.rs\",\n \"rank\": 42,\n \"score\": 143531.09523317707\n },\n {\n \"content\": \"pub fn setup() -> Client {\\n\\n let api = Pkmnapi::init();\\n\\n let client = Client::new(api).unwrap();\\n\\n\\n\\n client\\n\\n}\\n\\n\\n\",\n \"file_path\": \"pkmnapi-api/tests/common.rs\",\n \"rank\": 43,\n \"score\": 141430.748405605\n },\n {\n \"content\": \"pub fn get_db_with_applied_patches(\\n\\n sql: &State<PkmnapiSQL>,\\n\\n access_token: &String,\\n\\n) -> Result<(PkmnapiDB, PgPooledConnection), ResponseError> {\\n\\n let (mut db, connection) = get_db(sql, access_token)?;\\n\\n\\n\\n let rom_patches = match sql.select_rom_patches_by_access_token(&connection, &access_token) {\\n\\n Ok(patches) => patches,\\n\\n Err(_) => vec![],\\n\\n };\\n\\n\\n\\n let sav_patches = match sql.select_sav_patches_by_access_token(&connection, &access_token) {\\n\\n Ok(patches) => patches,\\n\\n Err(_) => vec![],\\n\\n };\\n\\n\\n\\n for patch in rom_patches {\\n\\n db.apply_patch(patch.data);\\n\\n }\\n\\n\\n\\n if let Some(ref mut sav) = db.sav {\\n\\n for patch in sav_patches {\\n\\n sav.apply_patch(patch.data);\\n\\n }\\n\\n }\\n\\n\\n\\n Ok((db, connection))\\n\\n}\\n\\n\\n\",\n \"file_path\": \"pkmnapi-api/src/utils.rs\",\n \"rank\": 44,\n \"score\": 141184.622873297\n },\n {\n \"content\": \"#[post(\\\"/savs\\\", data = \\\"<data>\\\")]\\n\\npub fn post_sav<'a>(\\n\\n sql: State<PkmnapiSQL>,\\n\\n _rate_limit: RateLimit,\\n\\n data: Data,\\n\\n access_token: Result<AccessToken, AccessTokenError>,\\n\\n) -> Result<Response<'a>, ResponseError> {\\n\\n let access_token = utils::get_access_token(access_token)?;\\n\\n let sav = utils::get_data_raw(data);\\n\\n\\n\\n if let Err(_) = Sav::new(&sav) {\\n\\n return Err(SavErrorInvalidSav::new());\\n\\n }\\n\\n\\n\\n let connection = sql.get_connection().unwrap();\\n\\n let sav = match sql.update_user_sav_by_access_token(&connection, &access_token, &sav) {\\n\\n Ok(sav) => sav,\\n\\n Err(_) => return Err(SavErrorSavExists::new()),\\n\\n };\\n\\n\\n\\n let response = SavResponse::new(&sav);\\n\",\n \"file_path\": \"pkmnapi-api/src/routes/savs.rs\",\n \"rank\": 45,\n \"score\": 138972.65777739196\n },\n {\n \"content\": \"#[post(\\\"/roms\\\", data = \\\"<data>\\\")]\\n\\npub fn post_rom<'a>(\\n\\n sql: State<PkmnapiSQL>,\\n\\n _rate_limit: RateLimit,\\n\\n data: Data,\\n\\n access_token: Result<AccessToken, AccessTokenError>,\\n\\n) -> Result<Response<'a>, ResponseError> {\\n\\n let access_token = utils::get_access_token(access_token)?;\\n\\n let rom_data = utils::get_data_raw(data);\\n\\n\\n\\n let db = match PkmnapiDB::new(&rom_data).build() {\\n\\n Ok(db) => db,\\n\\n Err(_) => return Err(RomErrorInvalidRom::new()),\\n\\n };\\n\\n\\n\\n let connection = sql.get_connection().unwrap();\\n\\n let rom = match sql.update_user_rom_by_access_token(\\n\\n &connection,\\n\\n &access_token,\\n\\n &db.header.title,\\n\\n &rom_data,\\n\",\n \"file_path\": \"pkmnapi-api/src/routes/roms.rs\",\n \"rank\": 46,\n \"score\": 138972.65777739196\n },\n {\n \"content\": \"#[get(\\\"/icons/<icon_id>\\\", format = \\\"image/gif\\\")]\\n\\npub fn get_icon<'a>(\\n\\n sql: State<PkmnapiSQL>,\\n\\n _rate_limit: RateLimit,\\n\\n access_token: Result<AccessToken, AccessTokenError>,\\n\\n icon_id: u8,\\n\\n) -> Result<Response<'a>, ResponseError> {\\n\\n let access_token = utils::get_access_token(access_token)?;\\n\\n let (db, _) = utils::get_db_with_applied_patches(&sql, &access_token)?;\\n\\n\\n\\n let icon = db.get_icon(&icon_id)?;\\n\\n let gif = icon.to_gif(26)?;\\n\\n\\n\\n let response = Response::build()\\n\\n .header(ContentType::GIF)\\n\\n .header(Header::new(\\n\\n \\\"Content-Disposition\\\",\\n\\n format!(r#\\\"attachment; filename=\\\"icon-{}.gif\\\"\\\"#, icon_id),\\n\\n ))\\n\\n .sized_body(Cursor::new(gif))\\n\\n .finalize();\\n\\n\\n\\n Ok(response)\\n\\n}\\n\",\n \"file_path\": \"pkmnapi-api/src/routes/icons.rs\",\n \"rank\": 47,\n \"score\": 138971.72369265676\n },\n {\n \"content\": \"#[get(\\\"/savs\\\")]\\n\\npub fn get_sav<'a>(\\n\\n sql: State<PkmnapiSQL>,\\n\\n _rate_limit: RateLimit,\\n\\n access_token: Result<AccessToken, AccessTokenError>,\\n\\n) -> Result<Response<'a>, ResponseError> {\\n\\n let access_token = utils::get_access_token(access_token)?;\\n\\n\\n\\n let connection = sql.get_connection().unwrap();\\n\\n let sav = match sql.select_user_sav_by_access_token(&connection, &access_token) {\\n\\n Ok(Some(sav)) => sav,\\n\\n _ => return Err(SavErrorNoSav::new()),\\n\\n };\\n\\n\\n\\n let response = SavResponse::new(&sav);\\n\\n let body = serde_json::to_string(&response).unwrap();\\n\\n\\n\\n let response = Response::build()\\n\\n .header(ContentType::JSON)\\n\\n .header(Header::new(\\\"ETag\\\", sav.etag))\\n\\n .sized_body(Cursor::new(body))\\n\\n .finalize();\\n\\n\\n\\n Ok(response)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"pkmnapi-api/src/routes/savs.rs\",\n \"rank\": 48,\n \"score\": 138965.82902511375\n },\n {\n \"content\": \"#[get(\\\"/roms\\\")]\\n\\npub fn get_rom<'a>(\\n\\n sql: State<PkmnapiSQL>,\\n\\n _rate_limit: RateLimit,\\n\\n access_token: Result<AccessToken, AccessTokenError>,\\n\\n) -> Result<Response<'a>, ResponseError> {\\n\\n let access_token = utils::get_access_token(access_token)?;\\n\\n\\n\\n let connection = sql.get_connection().unwrap();\\n\\n let rom_sql = match sql.select_user_rom_by_access_token(&connection, &access_token) {\\n\\n Ok(Some(rom_sql)) => rom_sql,\\n\\n _ => return Err(RomErrorNoRom::new()),\\n\\n };\\n\\n\\n\\n let response = RomResponse::new(&rom_sql);\\n\\n let body = serde_json::to_string(&response).unwrap();\\n\\n\\n\\n let response = Response::build()\\n\\n .header(ContentType::JSON)\\n\\n .header(Header::new(\\\"ETag\\\", rom_sql.etag))\\n\\n .sized_body(Cursor::new(body))\\n\\n .finalize();\\n\\n\\n\\n Ok(response)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"pkmnapi-api/src/routes/roms.rs\",\n \"rank\": 49,\n \"score\": 138965.82902511375\n },\n {\n \"content\": \"#[openapi]\\n\\n#[delete(\\\"/access_tokens\\\", format = \\\"application/json\\\", data = \\\"<data>\\\")]\\n\\npub fn delete_access_token(\\n\\n sql: State<PkmnapiSQL>,\\n\\n _rate_limit: RateLimit,\\n\\n data: Result<Json<AccessTokenDeleteRequest>, JsonError>,\\n\\n access_token: Result<AccessToken, AccessTokenError>,\\n\\n) -> Result<status::NoContent, ResponseError> {\\n\\n if access_token.is_ok() {\\n\\n return Err(AccessTokenErrorForbidden::new());\\n\\n }\\n\\n\\n\\n let data = match data {\\n\\n Ok(data) => data.into_inner(),\\n\\n Err(JsonError::Parse(_, e)) => {\\n\\n return Err(AccessTokenErrorInvalid::new(&e.to_string()));\\n\\n }\\n\\n _ => {\\n\\n return Err(AccessTokenErrorInvalid::new(\\n\\n &\\\"An unknown error occurred\\\".to_owned(),\\n\\n ));\\n\\n }\\n\",\n \"file_path\": \"pkmnapi-api/src/routes/access_tokens.rs\",\n \"rank\": 50,\n \"score\": 138960.57767942655\n },\n {\n \"content\": \"#[openapi]\\n\\n#[post(\\\"/player_names\\\", format = \\\"application/json\\\", data = \\\"<data>\\\")]\\n\\npub fn post_player_names(\\n\\n sql: State<PkmnapiSQL>,\\n\\n _rate_limit: RateLimit,\\n\\n access_token: Result<AccessToken, AccessTokenError>,\\n\\n patch_description: Result<PatchDescription, PatchDescriptionError>,\\n\\n data: Result<Json<PlayerNamesRequest>, JsonError>,\\n\\n) -> Result<status::Accepted<JsonValue>, ResponseError> {\\n\\n let access_token = utils::get_access_token(access_token)?;\\n\\n let data = utils::get_data(data, BaseErrorResponseId::error_player_names_invalid)?;\\n\\n let (db, connection) = utils::get_db(&sql, &access_token)?;\\n\\n\\n\\n let player_names = PlayerNames {\\n\\n player: data\\n\\n .get_player_names()\\n\\n .iter()\\n\\n .map(|name| ROMString::from(name))\\n\\n .collect(),\\n\\n rival: data\\n\\n .get_rival_names()\\n\\n .iter()\\n\",\n \"file_path\": \"pkmnapi-api/src/routes/player_names.rs\",\n \"rank\": 51,\n \"score\": 138960.57767942655\n },\n {\n \"content\": \"#[openapi]\\n\\n#[post(\\\"/access_tokens\\\", format = \\\"application/json\\\", data = \\\"<data>\\\")]\\n\\npub fn post_access_token(\\n\\n sql: State<PkmnapiSQL>,\\n\\n _rate_limit: RateLimit,\\n\\n data: Result<Json<AccessTokenRequest>, JsonError>,\\n\\n access_token: Result<AccessToken, AccessTokenError>,\\n\\n) -> Result<status::Created<JsonValue>, ResponseError> {\\n\\n if access_token.is_ok() {\\n\\n return Err(AccessTokenErrorForbidden::new());\\n\\n }\\n\\n\\n\\n let data = match data {\\n\\n Ok(data) => data.into_inner(),\\n\\n Err(JsonError::Parse(_, e)) => {\\n\\n return Err(AccessTokenErrorInvalid::new(&e.to_string()));\\n\\n }\\n\\n _ => {\\n\\n return Err(AccessTokenErrorInvalid::new(\\n\\n &\\\"An unknown error occurred\\\".to_owned(),\\n\\n ));\\n\\n }\\n\",\n \"file_path\": \"pkmnapi-api/src/routes/access_tokens.rs\",\n \"rank\": 52,\n \"score\": 138960.57767942655\n },\n {\n \"content\": \"#[openapi]\\n\\n#[post(\\\"/items/names/<item_id>\\\", format = \\\"application/json\\\", data = \\\"<data>\\\")]\\n\\npub fn post_item_name(\\n\\n sql: State<PkmnapiSQL>,\\n\\n _rate_limit: RateLimit,\\n\\n access_token: Result<AccessToken, AccessTokenError>,\\n\\n patch_description: Result<PatchDescription, PatchDescriptionError>,\\n\\n data: Result<Json<ItemNameRequest>, JsonError>,\\n\\n item_id: u8,\\n\\n) -> Result<status::Accepted<JsonValue>, ResponseError> {\\n\\n let access_token = utils::get_access_token(access_token)?;\\n\\n let data = utils::get_data(data, BaseErrorResponseId::error_item_names_invalid)?;\\n\\n let (db, connection) = utils::get_db(&sql, &access_token)?;\\n\\n\\n\\n let item_name = ItemName {\\n\\n name: ROMString::from(data.get_name()),\\n\\n };\\n\\n\\n\\n let patch = db.set_item_name(&item_id, &item_name)?;\\n\\n\\n\\n utils::insert_rom_patch(\\n\\n sql,\\n\\n connection,\\n\\n access_token,\\n\\n patch,\\n\\n patch_description,\\n\\n BaseErrorResponseId::error_item_names,\\n\\n )?;\\n\\n\\n\\n Ok(status::Accepted(Some(json!({}))))\\n\\n}\\n\",\n \"file_path\": \"pkmnapi-api/src/routes/item_names.rs\",\n \"rank\": 53,\n \"score\": 138960.33850039946\n },\n {\n \"content\": \"#[openapi]\\n\\n#[post(\\\"/moves/names/<move_id>\\\", format = \\\"application/json\\\", data = \\\"<data>\\\")]\\n\\npub fn post_move_name(\\n\\n sql: State<PkmnapiSQL>,\\n\\n _rate_limit: RateLimit,\\n\\n access_token: Result<AccessToken, AccessTokenError>,\\n\\n patch_description: Result<PatchDescription, PatchDescriptionError>,\\n\\n data: Result<Json<MoveNameRequest>, JsonError>,\\n\\n move_id: u8,\\n\\n) -> Result<status::Accepted<JsonValue>, ResponseError> {\\n\\n let access_token = utils::get_access_token(access_token)?;\\n\\n let data = utils::get_data(data, BaseErrorResponseId::error_move_names_invalid)?;\\n\\n let (db, connection) = utils::get_db(&sql, &access_token)?;\\n\\n\\n\\n let move_name = MoveName {\\n\\n name: ROMString::from(data.get_name()),\\n\\n };\\n\\n\\n\\n let patch = db.set_move_name(&move_id, &move_name)?;\\n\\n\\n\\n utils::insert_rom_patch(\\n\\n sql,\\n\\n connection,\\n\\n access_token,\\n\\n patch,\\n\\n patch_description,\\n\\n BaseErrorResponseId::error_move_names,\\n\\n )?;\\n\\n\\n\\n Ok(status::Accepted(Some(json!({}))))\\n\\n}\\n\",\n \"file_path\": \"pkmnapi-api/src/routes/move_names.rs\",\n \"rank\": 54,\n \"score\": 138960.33850039946\n },\n {\n \"content\": \"#[openapi]\\n\\n#[post(\\\"/hms/moves/<hm_id>\\\", format = \\\"application/json\\\", data = \\\"<data>\\\")]\\n\\npub fn post_hm_move(\\n\\n sql: State<PkmnapiSQL>,\\n\\n _rate_limit: RateLimit,\\n\\n access_token: Result<AccessToken, AccessTokenError>,\\n\\n patch_description: Result<PatchDescription, PatchDescriptionError>,\\n\\n data: Result<Json<HMMoveRequest>, JsonError>,\\n\\n hm_id: u8,\\n\\n) -> Result<status::Accepted<JsonValue>, ResponseError> {\\n\\n let access_token = utils::get_access_token(access_token)?;\\n\\n let data = utils::get_data(data, BaseErrorResponseId::error_hms_invalid)?;\\n\\n let (db, connection) = utils::get_db(&sql, &access_token)?;\\n\\n\\n\\n let hm_move = HMMove {\\n\\n move_id: data.get_move_id(),\\n\\n };\\n\\n\\n\\n let patch = db.set_hm_move(&hm_id, &hm_move)?;\\n\\n\\n\\n utils::insert_rom_patch(\\n\\n sql,\\n\\n connection,\\n\\n access_token,\\n\\n patch,\\n\\n patch_description,\\n\\n BaseErrorResponseId::error_hms,\\n\\n )?;\\n\\n\\n\\n Ok(status::Accepted(Some(json!({}))))\\n\\n}\\n\",\n \"file_path\": \"pkmnapi-api/src/routes/hm_moves.rs\",\n \"rank\": 55,\n \"score\": 138960.33850039946\n },\n {\n \"content\": \"#[openapi]\\n\\n#[post(\\\"/moves/stats/<move_id>\\\", format = \\\"application/json\\\", data = \\\"<data>\\\")]\\n\\npub fn post_move_stats(\\n\\n sql: State<PkmnapiSQL>,\\n\\n _rate_limit: RateLimit,\\n\\n access_token: Result<AccessToken, AccessTokenError>,\\n\\n patch_description: Result<PatchDescription, PatchDescriptionError>,\\n\\n data: Result<Json<MoveStatsRequest>, JsonError>,\\n\\n move_id: u8,\\n\\n) -> Result<status::Accepted<JsonValue>, ResponseError> {\\n\\n let access_token = utils::get_access_token(access_token)?;\\n\\n let data = utils::get_data(data, BaseErrorResponseId::error_move_stats_invalid)?;\\n\\n let (db, connection) = utils::get_db(&sql, &access_token)?;\\n\\n\\n\\n let move_stats = MoveStats {\\n\\n move_id: move_id,\\n\\n effect: data.get_effect(),\\n\\n power: data.get_power(),\\n\\n type_id: data.get_type_id(),\\n\\n accuracy: data.get_accuracy(),\\n\\n pp: data.get_pp(),\\n\\n };\\n\",\n \"file_path\": \"pkmnapi-api/src/routes/move_stats.rs\",\n \"rank\": 56,\n \"score\": 138960.33850039946\n },\n {\n \"content\": \"#[openapi]\\n\\n#[post(\\\"/marts/items/<mart_id>\\\", format = \\\"application/json\\\", data = \\\"<data>\\\")]\\n\\npub fn post_mart_items(\\n\\n sql: State<PkmnapiSQL>,\\n\\n _rate_limit: RateLimit,\\n\\n access_token: Result<AccessToken, AccessTokenError>,\\n\\n patch_description: Result<PatchDescription, PatchDescriptionError>,\\n\\n data: Result<Json<MartItemsRequest>, JsonError>,\\n\\n mart_id: u8,\\n\\n) -> Result<status::Accepted<JsonValue>, ResponseError> {\\n\\n let access_token = utils::get_access_token(access_token)?;\\n\\n let data = utils::get_data(data, BaseErrorResponseId::error_mart_items_invalid)?;\\n\\n let (db, connection) = utils::get_db(&sql, &access_token)?;\\n\\n\\n\\n let mart_items = data.get_mart_items();\\n\\n\\n\\n let patch = db.set_mart_items(&mart_id, &mart_items)?;\\n\\n\\n\\n utils::insert_rom_patch(\\n\\n sql,\\n\\n connection,\\n\\n access_token,\\n\\n patch,\\n\\n patch_description,\\n\\n BaseErrorResponseId::error_mart_items,\\n\\n )?;\\n\\n\\n\\n Ok(status::Accepted(Some(json!({}))))\\n\\n}\\n\",\n \"file_path\": \"pkmnapi-api/src/routes/mart_items.rs\",\n \"rank\": 57,\n \"score\": 138960.33850039946\n },\n {\n \"content\": \"#[openapi]\\n\\n#[post(\\\"/tms/moves/<tm_id>\\\", format = \\\"application/json\\\", data = \\\"<data>\\\")]\\n\\npub fn post_tm_move(\\n\\n sql: State<PkmnapiSQL>,\\n\\n _rate_limit: RateLimit,\\n\\n access_token: Result<AccessToken, AccessTokenError>,\\n\\n patch_description: Result<PatchDescription, PatchDescriptionError>,\\n\\n data: Result<Json<TMMoveRequest>, JsonError>,\\n\\n tm_id: u8,\\n\\n) -> Result<status::Accepted<JsonValue>, ResponseError> {\\n\\n let access_token = utils::get_access_token(access_token)?;\\n\\n let data = utils::get_data(data, BaseErrorResponseId::error_tm_moves_invalid)?;\\n\\n let (db, connection) = utils::get_db(&sql, &access_token)?;\\n\\n\\n\\n let tm_move = TMMove {\\n\\n move_id: data.get_move_id(),\\n\\n };\\n\\n\\n\\n let patch = db.set_tm_move(&tm_id, &tm_move)?;\\n\\n\\n\\n utils::insert_rom_patch(\\n\\n sql,\\n\\n connection,\\n\\n access_token,\\n\\n patch,\\n\\n patch_description,\\n\\n BaseErrorResponseId::error_tm_moves,\\n\\n )?;\\n\\n\\n\\n Ok(status::Accepted(Some(json!({}))))\\n\\n}\\n\",\n \"file_path\": \"pkmnapi-api/src/routes/tm_moves.rs\",\n \"rank\": 58,\n \"score\": 138960.33850039946\n },\n {\n \"content\": \"#[openapi]\\n\\n#[post(\\\"/maps/pokemon/<map_id>\\\", format = \\\"application/json\\\", data = \\\"<data>\\\")]\\n\\npub fn post_map_pokemon(\\n\\n sql: State<PkmnapiSQL>,\\n\\n _rate_limit: RateLimit,\\n\\n access_token: Result<AccessToken, AccessTokenError>,\\n\\n patch_description: Result<PatchDescription, PatchDescriptionError>,\\n\\n data: Result<Json<MapPokemonRequest>, JsonError>,\\n\\n map_id: u8,\\n\\n) -> Result<status::Accepted<JsonValue>, ResponseError> {\\n\\n let access_token = utils::get_access_token(access_token)?;\\n\\n let data = utils::get_data(data, BaseErrorResponseId::error_map_pokemon_invalid)?;\\n\\n let (db, connection) = utils::get_db(&sql, &access_token)?;\\n\\n\\n\\n let map_pokemon = MapPokemon {\\n\\n grass: data.get_grass(),\\n\\n water: data.get_water(),\\n\\n };\\n\\n\\n\\n let patch = db.set_map_pokemon(&map_id, &map_pokemon)?;\\n\\n\\n\\n utils::insert_rom_patch(\\n\",\n \"file_path\": \"pkmnapi-api/src/routes/map_pokemon.rs\",\n \"rank\": 59,\n \"score\": 138960.33850039946\n },\n {\n \"content\": \"#[openapi]\\n\\n#[post(\\\"/types/names/<type_id>\\\", format = \\\"application/json\\\", data = \\\"<data>\\\")]\\n\\npub fn post_type_name(\\n\\n sql: State<PkmnapiSQL>,\\n\\n _rate_limit: RateLimit,\\n\\n access_token: Result<AccessToken, AccessTokenError>,\\n\\n patch_description: Result<PatchDescription, PatchDescriptionError>,\\n\\n data: Result<Json<TypeNameRequest>, JsonError>,\\n\\n type_id: u8,\\n\\n) -> Result<status::Accepted<JsonValue>, ResponseError> {\\n\\n let access_token = utils::get_access_token(access_token)?;\\n\\n let data = utils::get_data(data, BaseErrorResponseId::error_type_names_invalid)?;\\n\\n let (db, connection) = utils::get_db(&sql, &access_token)?;\\n\\n\\n\\n let type_name = TypeName {\\n\\n name: ROMString::from(data.get_name()),\\n\\n };\\n\\n\\n\\n let patch = db.set_type_name(&type_id, &type_name)?;\\n\\n\\n\\n utils::insert_rom_patch(\\n\\n sql,\\n\\n connection,\\n\\n access_token,\\n\\n patch,\\n\\n patch_description,\\n\\n BaseErrorResponseId::error_type_names,\\n\\n )?;\\n\\n\\n\\n Ok(status::Accepted(Some(json!({}))))\\n\\n}\\n\",\n \"file_path\": \"pkmnapi-api/src/routes/type_names.rs\",\n \"rank\": 60,\n \"score\": 138960.33850039946\n },\n {\n \"content\": \"#[openapi]\\n\\n#[post(\\\"/tms/prices/<tm_id>\\\", format = \\\"application/json\\\", data = \\\"<data>\\\")]\\n\\npub fn post_tm_price(\\n\\n sql: State<PkmnapiSQL>,\\n\\n _rate_limit: RateLimit,\\n\\n access_token: Result<AccessToken, AccessTokenError>,\\n\\n patch_description: Result<PatchDescription, PatchDescriptionError>,\\n\\n data: Result<Json<TMPriceRequest>, JsonError>,\\n\\n tm_id: u8,\\n\\n) -> Result<status::Accepted<JsonValue>, ResponseError> {\\n\\n let access_token = utils::get_access_token(access_token)?;\\n\\n let data = utils::get_data(data, BaseErrorResponseId::error_tm_prices_invalid)?;\\n\\n let (db, connection) = utils::get_db(&sql, &access_token)?;\\n\\n\\n\\n let tm_price = TMPrice {\\n\\n value: data.get_price(),\\n\\n };\\n\\n\\n\\n let patch = db.set_tm_price(&tm_id, &tm_price)?;\\n\\n\\n\\n utils::insert_rom_patch(\\n\\n sql,\\n\\n connection,\\n\\n access_token,\\n\\n patch,\\n\\n patch_description,\\n\\n BaseErrorResponseId::error_tm_prices,\\n\\n )?;\\n\\n\\n\\n Ok(status::Accepted(Some(json!({}))))\\n\\n}\\n\",\n \"file_path\": \"pkmnapi-api/src/routes/tm_prices.rs\",\n \"rank\": 61,\n \"score\": 138960.33850039946\n },\n {\n \"content\": \"#[openapi]\\n\\n#[get(\\\"/pokemon/cries\\\", format = \\\"application/json\\\")]\\n\\npub fn get_pokemon_cry_all(\\n\\n sql: State<PkmnapiSQL>,\\n\\n _rate_limit: RateLimit,\\n\\n access_token: Result<AccessToken, AccessTokenError>,\\n\\n) -> Result<Json<PokemonCryResponseAll>, ResponseError> {\\n\\n let access_token = utils::get_access_token(access_token)?;\\n\\n let (db, _) = utils::get_db_with_applied_patches(&sql, &access_token)?;\\n\\n\\n\\n let (min_pokedex_id, max_pokedex_id) = db.pokedex_id_bounds();\\n\\n let pokedex_ids: Vec<u8> = (min_pokedex_id..=max_pokedex_id)\\n\\n .map(|pokedex_id| pokedex_id as u8)\\n\\n .collect();\\n\\n let pokemon_cries = db.get_pokemon_cry_all(&pokedex_ids)?;\\n\\n\\n\\n let response = PokemonCryResponseAll::new(&pokedex_ids, &pokemon_cries);\\n\\n\\n\\n Ok(Json(response))\\n\\n}\\n\\n\\n\",\n \"file_path\": \"pkmnapi-api/src/routes/pokemon_cries.rs\",\n \"rank\": 62,\n \"score\": 138954.154898198\n },\n {\n \"content\": \"#[openapi]\\n\\n#[get(\\\"/roms/patches\\\", format = \\\"application/json\\\", rank = 1)]\\n\\npub fn get_rom_patches(\\n\\n sql: State<PkmnapiSQL>,\\n\\n _rate_limit: RateLimit,\\n\\n access_token: Result<AccessToken, AccessTokenError>,\\n\\n) -> Result<Json<RomPatchResponseAll>, ResponseError> {\\n\\n let access_token = utils::get_access_token(access_token)?;\\n\\n\\n\\n let connection = sql.get_connection().unwrap();\\n\\n let patches = match sql.select_rom_patches_by_access_token(&connection, &access_token) {\\n\\n Ok(patches) => patches,\\n\\n Err(_) => return Err(RomErrorNoRom::new()),\\n\\n };\\n\\n\\n\\n let response = RomPatchResponseAll::new(&patches);\\n\\n\\n\\n Ok(Json(response))\\n\\n}\\n\\n\\n\",\n \"file_path\": \"pkmnapi-api/src/routes/rom_patches.rs\",\n \"rank\": 63,\n \"score\": 138954.0793763084\n },\n {\n \"content\": \"pub fn post_pokemon_moveset(\\n\\n sql: State<PkmnapiSQL>,\\n\\n _rate_limit: RateLimit,\\n\\n access_token: Result<AccessToken, AccessTokenError>,\\n\\n patch_description: Result<PatchDescription, PatchDescriptionError>,\\n\\n data: Result<Json<PokemonMovesetRequest>, JsonError>,\\n\\n pokedex_id: u8,\\n\\n) -> Result<status::Accepted<JsonValue>, ResponseError> {\\n\\n let access_token = utils::get_access_token(access_token)?;\\n\\n let data = utils::get_data(data, BaseErrorResponseId::error_pokemon_movesets_invalid)?;\\n\\n let (db, connection) = utils::get_db(&sql, &access_token)?;\\n\\n\\n\\n let pokemon_moveset = data.get_moveset();\\n\\n\\n\\n let patch = db.set_pokemon_moveset(&pokedex_id, &pokemon_moveset)?;\\n\\n\\n\\n utils::insert_rom_patch(\\n\\n sql,\\n\\n connection,\\n\\n access_token,\\n\\n patch,\\n\\n patch_description,\\n\\n BaseErrorResponseId::error_pokemon_movesets,\\n\\n )?;\\n\\n\\n\\n Ok(status::Accepted(Some(json!({}))))\\n\\n}\\n\",\n \"file_path\": \"pkmnapi-api/src/routes/pokemon_movesets.rs\",\n \"rank\": 64,\n \"score\": 138948.260230655\n },\n {\n \"content\": \"#[openapi]\\n\\n#[get(\\\"/hms/moves/<hm_id>\\\")]\\n\\npub fn get_hm_move(\\n\\n sql: State<PkmnapiSQL>,\\n\\n _rate_limit: RateLimit,\\n\\n access_token: Result<AccessToken, AccessTokenError>,\\n\\n hm_id: u8,\\n\\n) -> Result<Json<HMMoveResponse>, ResponseError> {\\n\\n let access_token = utils::get_access_token(access_token)?;\\n\\n let (db, _) = utils::get_db_with_applied_patches(&sql, &access_token)?;\\n\\n\\n\\n let hm_move = db.get_hm_move(&hm_id)?;\\n\\n let move_name = db.get_move_name(&hm_move.move_id)?;\\n\\n\\n\\n let response = HMMoveResponse::new(&hm_id, &hm_move, &move_name);\\n\\n\\n\\n Ok(Json(response))\\n\\n}\\n\\n\\n\",\n \"file_path\": \"pkmnapi-api/src/routes/hm_moves.rs\",\n \"rank\": 65,\n \"score\": 138948.260230655\n },\n {\n \"content\": \"#[openapi]\\n\\n#[get(\\\"/maps/pokemon/<map_id>\\\")]\\n\\npub fn get_map_pokemon(\\n\\n sql: State<PkmnapiSQL>,\\n\\n _rate_limit: RateLimit,\\n\\n access_token: Result<AccessToken, AccessTokenError>,\\n\\n map_id: u8,\\n\\n) -> Result<Json<MapPokemonResponse>, ResponseError> {\\n\\n let access_token = utils::get_access_token(access_token)?;\\n\\n let (db, _) = utils::get_db_with_applied_patches(&sql, &access_token)?;\\n\\n\\n\\n let map_pokemon = db.get_map_pokemon(&map_id)?;\\n\\n let pokedex_ids = vec![\\n\\n map_pokemon\\n\\n .grass\\n\\n .pokemon\\n\\n .iter()\\n\\n .map(|pokemon| pokemon.pokedex_id)\\n\\n .collect::<Vec<u8>>(),\\n\\n map_pokemon\\n\\n .water\\n\\n .pokemon\\n\",\n \"file_path\": \"pkmnapi-api/src/routes/map_pokemon.rs\",\n \"rank\": 66,\n \"score\": 138948.260230655\n },\n {\n \"content\": \"#[openapi]\\n\\n#[get(\\\"/pokemon/icons/<pokedex_id>\\\")]\\n\\npub fn get_pokemon_icon(\\n\\n sql: State<PkmnapiSQL>,\\n\\n _rate_limit: RateLimit,\\n\\n access_token: Result<AccessToken, AccessTokenError>,\\n\\n pokedex_id: u8,\\n\\n) -> Result<Json<PokemonIconResponse>, ResponseError> {\\n\\n let access_token = utils::get_access_token(access_token)?;\\n\\n let (db, _) = utils::get_db_with_applied_patches(&sql, &access_token)?;\\n\\n\\n\\n let pokemon_icon = db.get_pokemon_icon(&pokedex_id)?;\\n\\n\\n\\n let response = PokemonIconResponse::new(&pokedex_id, &pokemon_icon);\\n\\n\\n\\n Ok(Json(response))\\n\\n}\\n\\n\\n\\n#[openapi]\\n\\n#[post(\\n\\n \\\"/pokemon/icons/<pokedex_id>\\\",\\n\\n format = \\\"application/json\\\",\\n\\n data = \\\"<data>\\\"\\n\\n)]\\n\",\n \"file_path\": \"pkmnapi-api/src/routes/pokemon_icons.rs\",\n \"rank\": 67,\n \"score\": 138948.260230655\n },\n {\n \"content\": \"#[openapi]\\n\\n#[get(\\\"/pokemon/movesets\\\")]\\n\\npub fn get_pokemon_moveset_all(\\n\\n sql: State<PkmnapiSQL>,\\n\\n _rate_limit: RateLimit,\\n\\n access_token: Result<AccessToken, AccessTokenError>,\\n\\n) -> Result<Json<PokemonMovesetResponseAll>, ResponseError> {\\n\\n let access_token = utils::get_access_token(access_token)?;\\n\\n let (db, _) = utils::get_db_with_applied_patches(&sql, &access_token)?;\\n\\n\\n\\n let (min_pokedex_id, max_pokedex_id) = db.pokedex_id_bounds();\\n\\n let pokedex_ids: Vec<u8> = (min_pokedex_id..=max_pokedex_id)\\n\\n .map(|pokedex_id| pokedex_id as u8)\\n\\n .collect();\\n\\n let pokemon_movesets = db.get_pokemon_moveset_all(&pokedex_ids)?;\\n\\n let move_ids = pokemon_movesets\\n\\n .iter()\\n\\n .map(|(_, pokemon_moveset)| pokemon_moveset.to_vec())\\n\\n .flatten()\\n\\n .collect();\\n\\n let move_names = db.get_move_name_all(&move_ids)?;\\n\\n\\n\\n let response = PokemonMovesetResponseAll::new(&pokedex_ids, &pokemon_movesets, &move_names);\\n\\n\\n\\n Ok(Json(response))\\n\\n}\\n\\n\\n\",\n \"file_path\": \"pkmnapi-api/src/routes/pokemon_movesets.rs\",\n \"rank\": 68,\n \"score\": 138948.260230655\n },\n {\n \"content\": \"#[openapi]\\n\\n#[get(\\\"/hms/moves\\\")]\\n\\npub fn get_hm_move_all(\\n\\n sql: State<PkmnapiSQL>,\\n\\n _rate_limit: RateLimit,\\n\\n access_token: Result<AccessToken, AccessTokenError>,\\n\\n) -> Result<Json<HMMoveResponseAll>, ResponseError> {\\n\\n let access_token = utils::get_access_token(access_token)?;\\n\\n let (db, _) = utils::get_db_with_applied_patches(&sql, &access_token)?;\\n\\n\\n\\n let (min_hm_id, max_hm_id) = db.hm_id_bounds();\\n\\n let hm_ids: Vec<u8> = (min_hm_id..=max_hm_id).map(|hm_id| hm_id as u8).collect();\\n\\n let hm_moves = db.get_hm_move_all(&hm_ids)?;\\n\\n let move_ids: Vec<u8> = hm_moves.iter().map(|(_, hm)| hm.move_id).collect();\\n\\n let move_names = db.get_move_name_all(&move_ids)?;\\n\\n\\n\\n let response = HMMoveResponseAll::new(&hm_ids, &hm_moves, &move_names);\\n\\n\\n\\n Ok(Json(response))\\n\\n}\\n\\n\\n\",\n \"file_path\": \"pkmnapi-api/src/routes/hm_moves.rs\",\n \"rank\": 69,\n \"score\": 138948.260230655\n },\n {\n \"content\": \"#[openapi]\\n\\n#[get(\\\"/pokemon/machines/<pokedex_id>\\\")]\\n\\npub fn get_pokemon_machines(\\n\\n sql: State<PkmnapiSQL>,\\n\\n _rate_limit: RateLimit,\\n\\n access_token: Result<AccessToken, AccessTokenError>,\\n\\n pokedex_id: u8,\\n\\n) -> Result<Json<PokemonMachinesResponse>, ResponseError> {\\n\\n let access_token = utils::get_access_token(access_token)?;\\n\\n let (db, _) = utils::get_db_with_applied_patches(&sql, &access_token)?;\\n\\n\\n\\n let pokemon_machines = db.get_pokemon_machines(&pokedex_id)?;\\n\\n let tm_ids = pokemon_machines\\n\\n .iter()\\n\\n .filter_map(|machine| match machine {\\n\\n PokemonMachine::TM(tm_id) => Some(*tm_id),\\n\\n _ => None,\\n\\n })\\n\\n .collect();\\n\\n let tm_moves = db.get_tm_move_all(&tm_ids)?;\\n\\n let hm_ids = pokemon_machines\\n\\n .iter()\\n\",\n \"file_path\": \"pkmnapi-api/src/routes/pokemon_machines.rs\",\n \"rank\": 70,\n \"score\": 138948.260230655\n },\n {\n \"content\": \"#[openapi]\\n\\n#[get(\\\"/pokedex/entries\\\")]\\n\\npub fn get_pokedex_entry_all(\\n\\n sql: State<PkmnapiSQL>,\\n\\n _rate_limit: RateLimit,\\n\\n access_token: Result<AccessToken, AccessTokenError>,\\n\\n) -> Result<Json<PokedexEntryResponseAll>, ResponseError> {\\n\\n let access_token = utils::get_access_token(access_token)?;\\n\\n let (db, _) = utils::get_db_with_applied_patches(&sql, &access_token)?;\\n\\n\\n\\n let (min_pokedex_id, max_pokedex_id) = db.pokedex_id_bounds();\\n\\n let pokedex_ids: Vec<u8> = (min_pokedex_id..=max_pokedex_id)\\n\\n .map(|pokedex_id| pokedex_id as u8)\\n\\n .collect();\\n\\n let pokedex_entries = db.get_pokedex_entry_all(&pokedex_ids)?;\\n\\n\\n\\n let response = PokedexEntryResponseAll::new(&pokedex_ids, &pokedex_entries);\\n\\n\\n\\n Ok(Json(response))\\n\\n}\\n\\n\\n\",\n \"file_path\": \"pkmnapi-api/src/routes/pokedex_entries.rs\",\n \"rank\": 71,\n \"score\": 138948.260230655\n },\n {\n \"content\": \"#[openapi]\\n\\n#[get(\\\"/moves/names/<move_id>\\\")]\\n\\npub fn get_move_name(\\n\\n sql: State<PkmnapiSQL>,\\n\\n _rate_limit: RateLimit,\\n\\n access_token: Result<AccessToken, AccessTokenError>,\\n\\n move_id: u8,\\n\\n) -> Result<Json<MoveNameResponse>, ResponseError> {\\n\\n let access_token = utils::get_access_token(access_token)?;\\n\\n let (db, _) = utils::get_db_with_applied_patches(&sql, &access_token)?;\\n\\n\\n\\n let move_name = db.get_move_name(&move_id)?;\\n\\n\\n\\n let response = MoveNameResponse::new(&move_id, &move_name);\\n\\n\\n\\n Ok(Json(response))\\n\\n}\\n\\n\\n\",\n \"file_path\": \"pkmnapi-api/src/routes/move_names.rs\",\n \"rank\": 72,\n \"score\": 138948.260230655\n },\n {\n \"content\": \"#[openapi]\\n\\n#[get(\\\"/moves/stats\\\")]\\n\\npub fn get_move_stats_all(\\n\\n sql: State<PkmnapiSQL>,\\n\\n _rate_limit: RateLimit,\\n\\n access_token: Result<AccessToken, AccessTokenError>,\\n\\n) -> Result<Json<MoveStatsResponseAll>, ResponseError> {\\n\\n let access_token = utils::get_access_token(access_token)?;\\n\\n let (db, _) = utils::get_db_with_applied_patches(&sql, &access_token)?;\\n\\n\\n\\n let (min_move_id, max_move_id) = db.move_id_bounds();\\n\\n let move_ids: Vec<u8> = (min_move_id..=max_move_id)\\n\\n .map(|move_id| move_id as u8)\\n\\n .collect();\\n\\n let move_stats = db.get_move_stats_all(&move_ids)?;\\n\\n let type_ids = move_stats\\n\\n .iter()\\n\\n .map(|(_, move_stats)| move_stats.type_id)\\n\\n .collect();\\n\\n let type_names = db.get_type_name_all(&type_ids)?;\\n\\n\\n\\n let response = MoveStatsResponseAll::new(&move_ids, &move_stats, &type_names);\\n\\n\\n\\n Ok(Json(response))\\n\\n}\\n\\n\\n\",\n \"file_path\": \"pkmnapi-api/src/routes/move_stats.rs\",\n \"rank\": 73,\n \"score\": 138948.260230655\n },\n {\n \"content\": \"#[openapi]\\n\\n#[get(\\\"/pokemon/stats/<pokedex_id>\\\")]\\n\\npub fn get_pokemon_stats(\\n\\n sql: State<PkmnapiSQL>,\\n\\n _rate_limit: RateLimit,\\n\\n access_token: Result<AccessToken, AccessTokenError>,\\n\\n pokedex_id: u8,\\n\\n) -> Result<Json<PokemonStatsResponse>, ResponseError> {\\n\\n let access_token = utils::get_access_token(access_token)?;\\n\\n let (db, _) = utils::get_db_with_applied_patches(&sql, &access_token)?;\\n\\n\\n\\n let pokemon_stats = db.get_pokemon_stats(&pokedex_id)?;\\n\\n let type_names = db.get_type_name_all(&pokemon_stats.type_ids)?;\\n\\n\\n\\n let response = PokemonStatsResponse::new(&pokedex_id, &pokemon_stats, &type_names);\\n\\n\\n\\n Ok(Json(response))\\n\\n}\\n\\n\\n\\n#[openapi]\\n\\n#[post(\\n\\n \\\"/pokemon/stats/<pokedex_id>\\\",\\n\\n format = \\\"application/json\\\",\\n\\n data = \\\"<data>\\\"\\n\\n)]\\n\",\n \"file_path\": \"pkmnapi-api/src/routes/pokemon_stats.rs\",\n \"rank\": 74,\n \"score\": 138948.260230655\n },\n {\n \"content\": \"pub fn post_pokemon_icon(\\n\\n sql: State<PkmnapiSQL>,\\n\\n _rate_limit: RateLimit,\\n\\n access_token: Result<AccessToken, AccessTokenError>,\\n\\n patch_description: Result<PatchDescription, PatchDescriptionError>,\\n\\n data: Result<Json<PokemonIconRequest>, JsonError>,\\n\\n pokedex_id: u8,\\n\\n) -> Result<status::Accepted<JsonValue>, ResponseError> {\\n\\n let access_token = utils::get_access_token(access_token)?;\\n\\n let data = utils::get_data(data, BaseErrorResponseId::error_pokemon_icons_invalid)?;\\n\\n let (db, connection) = utils::get_db(&sql, &access_token)?;\\n\\n\\n\\n let pokemon_icon = PokemonIcon::from(&data.get_icon_id());\\n\\n\\n\\n let patch = db.set_pokemon_icon(&pokedex_id, &pokemon_icon)?;\\n\\n\\n\\n utils::insert_rom_patch(\\n\\n sql,\\n\\n connection,\\n\\n access_token,\\n\\n patch,\\n\\n patch_description,\\n\\n BaseErrorResponseId::error_pokemon_icons,\\n\\n )?;\\n\\n\\n\\n Ok(status::Accepted(Some(json!({}))))\\n\\n}\\n\",\n \"file_path\": \"pkmnapi-api/src/routes/pokemon_icons.rs\",\n \"rank\": 75,\n \"score\": 138948.260230655\n },\n {\n \"content\": \"#[openapi]\\n\\n#[get(\\\"/pokedex/entries/<pokedex_id>\\\")]\\n\\npub fn get_pokedex_entry(\\n\\n sql: State<PkmnapiSQL>,\\n\\n _rate_limit: RateLimit,\\n\\n access_token: Result<AccessToken, AccessTokenError>,\\n\\n pokedex_id: u8,\\n\\n) -> Result<Json<PokedexEntryResponse>, ResponseError> {\\n\\n let access_token = utils::get_access_token(access_token)?;\\n\\n let (db, _) = utils::get_db_with_applied_patches(&sql, &access_token)?;\\n\\n\\n\\n let pokedex_entry = db.get_pokedex_entry(&pokedex_id)?;\\n\\n\\n\\n let response = PokedexEntryResponse::new(&pokedex_id, &pokedex_entry);\\n\\n\\n\\n Ok(Json(response))\\n\\n}\\n\\n\\n\\n#[openapi]\\n\\n#[post(\\n\\n \\\"/pokedex/entries/<pokedex_id>\\\",\\n\\n format = \\\"application/json\\\",\\n\\n data = \\\"<data>\\\"\\n\\n)]\\n\",\n \"file_path\": \"pkmnapi-api/src/routes/pokedex_entries.rs\",\n \"rank\": 76,\n \"score\": 138948.260230655\n },\n {\n \"content\": \"#[openapi]\\n\\n#[get(\\\"/items/names\\\")]\\n\\npub fn get_item_name_all(\\n\\n sql: State<PkmnapiSQL>,\\n\\n _rate_limit: RateLimit,\\n\\n access_token: Result<AccessToken, AccessTokenError>,\\n\\n) -> Result<Json<ItemNameResponseAll>, ResponseError> {\\n\\n let access_token = utils::get_access_token(access_token)?;\\n\\n let (db, _) = utils::get_db_with_applied_patches(&sql, &access_token)?;\\n\\n\\n\\n let (min_item_id, max_item_id) = db.item_id_bounds();\\n\\n let item_ids: Vec<u8> = (min_item_id..=max_item_id)\\n\\n .map(|item_id| item_id as u8)\\n\\n .collect();\\n\\n let item_names = db.get_item_name_all(&item_ids)?;\\n\\n\\n\\n let response = ItemNameResponseAll::new(&item_ids, &item_names);\\n\\n\\n\\n Ok(Json(response))\\n\\n}\\n\\n\\n\",\n \"file_path\": \"pkmnapi-api/src/routes/item_names.rs\",\n \"rank\": 77,\n \"score\": 138948.260230655\n },\n {\n \"content\": \"#[openapi]\\n\\n#[get(\\\"/pokedex/texts\\\")]\\n\\npub fn get_pokedex_text_all(\\n\\n sql: State<PkmnapiSQL>,\\n\\n _rate_limit: RateLimit,\\n\\n access_token: Result<AccessToken, AccessTokenError>,\\n\\n) -> Result<Json<PokedexTextResponseAll>, ResponseError> {\\n\\n let access_token = utils::get_access_token(access_token)?;\\n\\n let (db, _) = utils::get_db_with_applied_patches(&sql, &access_token)?;\\n\\n\\n\\n let (min_pokedex_id, max_pokedex_id) = db.pokedex_id_bounds();\\n\\n let pokedex_ids: Vec<u8> = (min_pokedex_id..=max_pokedex_id)\\n\\n .map(|pokedex_id| pokedex_id as u8)\\n\\n .collect();\\n\\n let pokedex_texts = db.get_pokedex_text_all(&pokedex_ids)?;\\n\\n\\n\\n let response = PokedexTextResponseAll::new(&pokedex_ids, &pokedex_texts);\\n\\n\\n\\n Ok(Json(response))\\n\\n}\\n\\n\\n\",\n \"file_path\": \"pkmnapi-api/src/routes/pokedex_texts.rs\",\n \"rank\": 78,\n \"score\": 138948.260230655\n },\n {\n \"content\": \"#[openapi]\\n\\n#[get(\\\"/pokemon/names/<pokedex_id>\\\")]\\n\\npub fn get_pokemon_name(\\n\\n sql: State<PkmnapiSQL>,\\n\\n _rate_limit: RateLimit,\\n\\n access_token: Result<AccessToken, AccessTokenError>,\\n\\n pokedex_id: u8,\\n\\n) -> Result<Json<PokemonNameResponse>, ResponseError> {\\n\\n let access_token = utils::get_access_token(access_token)?;\\n\\n let (db, _) = utils::get_db_with_applied_patches(&sql, &access_token)?;\\n\\n\\n\\n let pokemon_name = db.get_pokemon_name(&pokedex_id)?;\\n\\n\\n\\n let response = PokemonNameResponse::new(&pokedex_id, &pokemon_name);\\n\\n\\n\\n Ok(Json(response))\\n\\n}\\n\\n\\n\\n#[openapi]\\n\\n#[post(\\n\\n \\\"/pokemon/names/<pokedex_id>\\\",\\n\\n format = \\\"application/json\\\",\\n\\n data = \\\"<data>\\\"\\n\\n)]\\n\",\n \"file_path\": \"pkmnapi-api/src/routes/pokemon_names.rs\",\n \"rank\": 79,\n \"score\": 138948.260230655\n },\n {\n \"content\": \"#[openapi]\\n\\n#[get(\\\"/moves/names\\\")]\\n\\npub fn get_move_name_all(\\n\\n sql: State<PkmnapiSQL>,\\n\\n _rate_limit: RateLimit,\\n\\n access_token: Result<AccessToken, AccessTokenError>,\\n\\n) -> Result<Json<MoveNameResponseAll>, ResponseError> {\\n\\n let access_token = utils::get_access_token(access_token)?;\\n\\n let (db, _) = utils::get_db_with_applied_patches(&sql, &access_token)?;\\n\\n\\n\\n let (min_move_id, max_move_id) = db.move_id_bounds();\\n\\n let move_ids: Vec<u8> = (min_move_id..=max_move_id)\\n\\n .map(|move_id| move_id as u8)\\n\\n .collect();\\n\\n let move_names = db.get_move_name_all(&move_ids)?;\\n\\n\\n\\n let response = MoveNameResponseAll::new(&move_ids, &move_names);\\n\\n\\n\\n Ok(Json(response))\\n\\n}\\n\\n\\n\",\n \"file_path\": \"pkmnapi-api/src/routes/move_names.rs\",\n \"rank\": 80,\n \"score\": 138948.260230655\n },\n {\n \"content\": \"pub fn post_pokedex_text(\\n\\n sql: State<PkmnapiSQL>,\\n\\n _rate_limit: RateLimit,\\n\\n access_token: Result<AccessToken, AccessTokenError>,\\n\\n patch_description: Result<PatchDescription, PatchDescriptionError>,\\n\\n data: Result<Json<PokedexTextRequest>, JsonError>,\\n\\n pokedex_id: u8,\\n\\n) -> Result<status::Accepted<JsonValue>, ResponseError> {\\n\\n let access_token = utils::get_access_token(access_token)?;\\n\\n let data = utils::get_data(data, BaseErrorResponseId::error_pokedex_texts_invalid)?;\\n\\n let (db, connection) = utils::get_db(&sql, &access_token)?;\\n\\n\\n\\n let pokedex_text = PokedexText {\\n\\n text: ROMString::from(data.get_text()),\\n\\n };\\n\\n\\n\\n let patch = db.set_pokedex_text(&pokedex_id, &pokedex_text)?;\\n\\n\\n\\n utils::insert_rom_patch(\\n\\n sql,\\n\\n connection,\\n\\n access_token,\\n\\n patch,\\n\\n patch_description,\\n\\n BaseErrorResponseId::error_pokedex_texts,\\n\\n )?;\\n\\n\\n\\n Ok(status::Accepted(Some(json!({}))))\\n\\n}\\n\",\n \"file_path\": \"pkmnapi-api/src/routes/pokedex_texts.rs\",\n \"rank\": 81,\n \"score\": 138948.260230655\n },\n {\n \"content\": \"#[openapi]\\n\\n#[get(\\\"/pokemon/icons\\\")]\\n\\npub fn get_pokemon_icon_all(\\n\\n sql: State<PkmnapiSQL>,\\n\\n _rate_limit: RateLimit,\\n\\n access_token: Result<AccessToken, AccessTokenError>,\\n\\n) -> Result<Json<PokemonIconResponseAll>, ResponseError> {\\n\\n let access_token = utils::get_access_token(access_token)?;\\n\\n let (db, _) = utils::get_db_with_applied_patches(&sql, &access_token)?;\\n\\n\\n\\n let (min_pokedex_id, max_pokedex_id) = db.pokedex_id_bounds();\\n\\n let pokedex_ids: Vec<u8> = (min_pokedex_id..=max_pokedex_id)\\n\\n .map(|pokedex_id| pokedex_id as u8)\\n\\n .collect();\\n\\n let pokemon_icons = db.get_pokemon_icon_all(&pokedex_ids)?;\\n\\n\\n\\n let response = PokemonIconResponseAll::new(&pokedex_ids, &pokemon_icons);\\n\\n\\n\\n Ok(Json(response))\\n\\n}\\n\\n\\n\",\n \"file_path\": \"pkmnapi-api/src/routes/pokemon_icons.rs\",\n \"rank\": 82,\n \"score\": 138948.260230655\n },\n {\n \"content\": \"pub fn post_pokedex_entry(\\n\\n sql: State<PkmnapiSQL>,\\n\\n _rate_limit: RateLimit,\\n\\n access_token: Result<AccessToken, AccessTokenError>,\\n\\n patch_description: Result<PatchDescription, PatchDescriptionError>,\\n\\n data: Result<Json<PokedexEntryRequest>, JsonError>,\\n\\n pokedex_id: u8,\\n\\n) -> Result<status::Accepted<JsonValue>, ResponseError> {\\n\\n let access_token = utils::get_access_token(access_token)?;\\n\\n let data = utils::get_data(data, BaseErrorResponseId::error_pokedex_entries_invalid)?;\\n\\n let (db, connection) = utils::get_db(&sql, &access_token)?;\\n\\n\\n\\n let pokedex_entry = PokedexEntry {\\n\\n species: ROMString::from(data.get_species()),\\n\\n height: data.get_height(),\\n\\n weight: data.get_weight(),\\n\\n };\\n\\n\\n\\n let patch = db.set_pokedex_entry(&pokedex_id, &pokedex_entry)?;\\n\\n\\n\",\n \"file_path\": \"pkmnapi-api/src/routes/pokedex_entries.rs\",\n \"rank\": 83,\n \"score\": 138948.260230655\n },\n {\n \"content\": \"#[openapi]\\n\\n#[get(\\\"/marts/items\\\")]\\n\\npub fn get_mart_items_all(\\n\\n sql: State<PkmnapiSQL>,\\n\\n _rate_limit: RateLimit,\\n\\n access_token: Result<AccessToken, AccessTokenError>,\\n\\n) -> Result<Json<MartItemsResponseAll>, ResponseError> {\\n\\n let access_token = utils::get_access_token(access_token)?;\\n\\n let (db, _) = utils::get_db_with_applied_patches(&sql, &access_token)?;\\n\\n\\n\\n let (min_mart_id, max_mart_id) = db.mart_id_bounds();\\n\\n let mart_ids: Vec<u8> = (min_mart_id..=max_mart_id)\\n\\n .map(|mart_id| mart_id as u8)\\n\\n .collect();\\n\\n let mart_items = db.get_mart_items_all(&mart_ids)?;\\n\\n let item_ids = mart_items\\n\\n .iter()\\n\\n .map(|(_, mart_item)| mart_item)\\n\\n .flatten()\\n\\n .filter_map(|mart_item| match mart_item {\\n\\n MartItem::ITEM(item_id) => Some(*item_id),\\n\\n _ => None,\\n\",\n \"file_path\": \"pkmnapi-api/src/routes/mart_items.rs\",\n \"rank\": 84,\n \"score\": 138948.260230655\n },\n {\n \"content\": \"pub fn post_pokemon_stats(\\n\\n sql: State<PkmnapiSQL>,\\n\\n _rate_limit: RateLimit,\\n\\n access_token: Result<AccessToken, AccessTokenError>,\\n\\n patch_description: Result<PatchDescription, PatchDescriptionError>,\\n\\n data: Result<Json<PokemonStatsRequest>, JsonError>,\\n\\n pokedex_id: u8,\\n\\n) -> Result<status::Accepted<JsonValue>, ResponseError> {\\n\\n let access_token = utils::get_access_token(access_token)?;\\n\\n let data = utils::get_data(data, BaseErrorResponseId::error_pokemon_stats_invalid)?;\\n\\n let (db, connection) = utils::get_db(&sql, &access_token)?;\\n\\n\\n\\n let pokemon_stats = PokemonStats {\\n\\n pokedex_id: pokedex_id,\\n\\n base_hp: data.get_base_hp(),\\n\\n base_attack: data.get_base_attack(),\\n\\n base_defence: data.get_base_defence(),\\n\\n base_speed: data.get_base_speed(),\\n\\n base_special: data.get_base_special(),\\n\\n type_ids: data.get_type_ids(),\\n\",\n \"file_path\": \"pkmnapi-api/src/routes/pokemon_stats.rs\",\n \"rank\": 85,\n \"score\": 138948.260230655\n },\n {\n \"content\": \"#[openapi]\\n\\n#[get(\\\"/pokemon/learnsets\\\")]\\n\\npub fn get_pokemon_learnset_all(\\n\\n sql: State<PkmnapiSQL>,\\n\\n _rate_limit: RateLimit,\\n\\n access_token: Result<AccessToken, AccessTokenError>,\\n\\n) -> Result<Json<PokemonLearnsetResponseAll>, ResponseError> {\\n\\n let access_token = utils::get_access_token(access_token)?;\\n\\n let (db, _) = utils::get_db_with_applied_patches(&sql, &access_token)?;\\n\\n\\n\\n let (min_pokedex_id, max_pokedex_id) = db.pokedex_id_bounds();\\n\\n let pokedex_ids: Vec<u8> = (min_pokedex_id..=max_pokedex_id)\\n\\n .map(|pokedex_id| pokedex_id as u8)\\n\\n .collect();\\n\\n let pokemon_learnsets = db.get_pokemon_learnset_all(&pokedex_ids)?;\\n\\n let move_ids = pokemon_learnsets\\n\\n .iter()\\n\\n .map(|(_, pokemon_learnset)| pokemon_learnset)\\n\\n .flatten()\\n\\n .map(|learnset| learnset.move_id)\\n\\n .collect();\\n\\n let move_names = db.get_move_name_all(&move_ids)?;\\n\\n\\n\\n let response = PokemonLearnsetResponseAll::new(&pokedex_ids, &pokemon_learnsets, &move_names);\\n\\n\\n\\n Ok(Json(response))\\n\\n}\\n\\n\\n\",\n \"file_path\": \"pkmnapi-api/src/routes/pokemon_learnsets.rs\",\n \"rank\": 86,\n \"score\": 138948.260230655\n },\n {\n \"content\": \"#[openapi]\\n\\n#[get(\\\"/hms/names\\\")]\\n\\npub fn get_hm_name_all(\\n\\n sql: State<PkmnapiSQL>,\\n\\n _rate_limit: RateLimit,\\n\\n access_token: Result<AccessToken, AccessTokenError>,\\n\\n) -> Result<Json<HMNameResponseAll>, ResponseError> {\\n\\n let access_token = utils::get_access_token(access_token)?;\\n\\n let (db, _) = utils::get_db_with_applied_patches(&sql, &access_token)?;\\n\\n\\n\\n let (min_hm_id, max_hm_id) = db.hm_id_bounds();\\n\\n let hm_ids: Vec<u8> = (min_hm_id..=max_hm_id).map(|hm_id| hm_id as u8).collect();\\n\\n let hm_names = db.get_hm_name_all(&hm_ids)?;\\n\\n\\n\\n let response = HMNameResponseAll::new(&hm_ids, &hm_names);\\n\\n\\n\\n Ok(Json(response))\\n\\n}\\n\\n\\n\",\n \"file_path\": \"pkmnapi-api/src/routes/hm_names.rs\",\n \"rank\": 87,\n \"score\": 138948.260230655\n },\n {\n \"content\": \"pub fn post_pokemon_name(\\n\\n sql: State<PkmnapiSQL>,\\n\\n _rate_limit: RateLimit,\\n\\n access_token: Result<AccessToken, AccessTokenError>,\\n\\n patch_description: Result<PatchDescription, PatchDescriptionError>,\\n\\n data: Result<Json<PokemonNameRequest>, JsonError>,\\n\\n pokedex_id: u8,\\n\\n) -> Result<status::Accepted<JsonValue>, ResponseError> {\\n\\n let access_token = utils::get_access_token(access_token)?;\\n\\n let data = utils::get_data(data, BaseErrorResponseId::error_pokemon_names_invalid)?;\\n\\n let (db, connection) = utils::get_db(&sql, &access_token)?;\\n\\n\\n\\n let pokemon_name = PokemonName {\\n\\n name: ROMString::from(data.get_name()),\\n\\n };\\n\\n\\n\\n let patch = db.set_pokemon_name(&pokedex_id, &pokemon_name)?;\\n\\n\\n\\n utils::insert_rom_patch(\\n\\n sql,\\n\\n connection,\\n\\n access_token,\\n\\n patch,\\n\\n patch_description,\\n\\n BaseErrorResponseId::error_pokemon_names,\\n\\n )?;\\n\\n\\n\\n Ok(status::Accepted(Some(json!({}))))\\n\\n}\\n\",\n \"file_path\": \"pkmnapi-api/src/routes/pokemon_names.rs\",\n \"rank\": 88,\n \"score\": 138948.260230655\n },\n {\n \"content\": \"#[openapi]\\n\\n#[get(\\\"/pokemon/machines\\\")]\\n\\npub fn get_pokemon_machines_all(\\n\\n sql: State<PkmnapiSQL>,\\n\\n _rate_limit: RateLimit,\\n\\n access_token: Result<AccessToken, AccessTokenError>,\\n\\n) -> Result<Json<PokemonMachinesResponseAll>, ResponseError> {\\n\\n let access_token = utils::get_access_token(access_token)?;\\n\\n let (db, _) = utils::get_db_with_applied_patches(&sql, &access_token)?;\\n\\n\\n\\n let (min_pokedex_id, max_pokedex_id) = db.pokedex_id_bounds();\\n\\n let pokedex_ids: Vec<u8> = (min_pokedex_id..=max_pokedex_id)\\n\\n .map(|pokedex_id| pokedex_id as u8)\\n\\n .collect();\\n\\n let pokemon_machines = db.get_pokemon_machines_all(&pokedex_ids)?;\\n\\n let tm_ids = pokemon_machines\\n\\n .iter()\\n\\n .map(|(_, machine)| machine)\\n\\n .flatten()\\n\\n .filter_map(|machine| match machine {\\n\\n PokemonMachine::TM(tm_id) => Some(*tm_id),\\n\\n _ => None,\\n\",\n \"file_path\": \"pkmnapi-api/src/routes/pokemon_machines.rs\",\n \"rank\": 89,\n \"score\": 138948.260230655\n },\n {\n \"content\": \"#[openapi]\\n\\n#[get(\\\"/hms/names/<hm_id>\\\")]\\n\\npub fn get_hm_name(\\n\\n sql: State<PkmnapiSQL>,\\n\\n _rate_limit: RateLimit,\\n\\n access_token: Result<AccessToken, AccessTokenError>,\\n\\n hm_id: u8,\\n\\n) -> Result<Json<HMNameResponse>, ResponseError> {\\n\\n let access_token = utils::get_access_token(access_token)?;\\n\\n let (db, _) = utils::get_db_with_applied_patches(&sql, &access_token)?;\\n\\n\\n\\n let hm_name = db.get_hm_name(&hm_id)?;\\n\\n\\n\\n let response = HMNameResponse::new(&hm_id, &hm_name);\\n\\n\\n\\n Ok(Json(response))\\n\\n}\\n\",\n \"file_path\": \"pkmnapi-api/src/routes/hm_names.rs\",\n \"rank\": 90,\n \"score\": 138948.260230655\n },\n {\n \"content\": \"#[openapi]\\n\\n#[get(\\\"/maps/pokemon\\\")]\\n\\npub fn get_map_pokemon_all(\\n\\n sql: State<PkmnapiSQL>,\\n\\n _rate_limit: RateLimit,\\n\\n access_token: Result<AccessToken, AccessTokenError>,\\n\\n) -> Result<Json<MapPokemonResponseAll>, ResponseError> {\\n\\n let access_token = utils::get_access_token(access_token)?;\\n\\n let (db, _) = utils::get_db_with_applied_patches(&sql, &access_token)?;\\n\\n\\n\\n let (min_map_id, max_map_id) = db.map_id_bounds();\\n\\n let map_ids = (min_map_id..=max_map_id)\\n\\n .map(|map_id| map_id as u8)\\n\\n .collect();\\n\\n let map_pokemon = db.get_map_pokemon_all(&map_ids)?;\\n\\n let pokedex_ids = map_pokemon\\n\\n .iter()\\n\\n .map(|(_, map_pokemon)| {\\n\\n vec![\\n\\n map_pokemon\\n\\n .grass\\n\\n .pokemon\\n\",\n \"file_path\": \"pkmnapi-api/src/routes/map_pokemon.rs\",\n \"rank\": 91,\n \"score\": 138948.260230655\n },\n {\n \"content\": \"#[openapi]\\n\\n#[get(\\\"/pokemon/names\\\")]\\n\\npub fn get_pokemon_name_all(\\n\\n sql: State<PkmnapiSQL>,\\n\\n _rate_limit: RateLimit,\\n\\n access_token: Result<AccessToken, AccessTokenError>,\\n\\n) -> Result<Json<PokemonNameResponseAll>, ResponseError> {\\n\\n let access_token = utils::get_access_token(access_token)?;\\n\\n let (db, _) = utils::get_db_with_applied_patches(&sql, &access_token)?;\\n\\n\\n\\n let (min_pokedex_id, max_pokedex_id) = db.pokedex_id_bounds();\\n\\n let pokedex_ids: Vec<u8> = (min_pokedex_id..=max_pokedex_id)\\n\\n .map(|pokedex_id| pokedex_id as u8)\\n\\n .collect();\\n\\n let pokemon_names = db.get_pokemon_name_all(&pokedex_ids)?;\\n\\n\\n\\n let response = PokemonNameResponseAll::new(&pokedex_ids, &pokemon_names);\\n\\n\\n\\n Ok(Json(response))\\n\\n}\\n\\n\\n\",\n \"file_path\": \"pkmnapi-api/src/routes/pokemon_names.rs\",\n \"rank\": 92,\n \"score\": 138948.260230655\n },\n {\n \"content\": \"#[openapi]\\n\\n#[get(\\\"/items/names/<item_id>\\\")]\\n\\npub fn get_item_name(\\n\\n sql: State<PkmnapiSQL>,\\n\\n _rate_limit: RateLimit,\\n\\n access_token: Result<AccessToken, AccessTokenError>,\\n\\n item_id: u8,\\n\\n) -> Result<Json<ItemNameResponse>, ResponseError> {\\n\\n let access_token = utils::get_access_token(access_token)?;\\n\\n let (db, _) = utils::get_db_with_applied_patches(&sql, &access_token)?;\\n\\n\\n\\n let item_name = db.get_item_name(&item_id)?;\\n\\n\\n\\n let response = ItemNameResponse::new(&item_id, &item_name);\\n\\n\\n\\n Ok(Json(response))\\n\\n}\\n\\n\\n\",\n \"file_path\": \"pkmnapi-api/src/routes/item_names.rs\",\n \"rank\": 93,\n \"score\": 138948.260230655\n },\n {\n \"content\": \"#[openapi]\\n\\n#[get(\\\"/marts/items/<mart_id>\\\")]\\n\\npub fn get_mart_items(\\n\\n sql: State<PkmnapiSQL>,\\n\\n _rate_limit: RateLimit,\\n\\n access_token: Result<AccessToken, AccessTokenError>,\\n\\n mart_id: u8,\\n\\n) -> Result<Json<MartItemsResponse>, ResponseError> {\\n\\n let access_token = utils::get_access_token(access_token)?;\\n\\n let (db, _) = utils::get_db_with_applied_patches(&sql, &access_token)?;\\n\\n\\n\\n let mart_items = db.get_mart_items(&mart_id)?;\\n\\n let item_ids = mart_items\\n\\n .iter()\\n\\n .filter_map(|mart_item| match mart_item {\\n\\n MartItem::ITEM(item_id) => Some(*item_id),\\n\\n _ => None,\\n\\n })\\n\\n .collect();\\n\\n let item_names = db.get_item_name_all(&item_ids)?;\\n\\n let tm_ids = mart_items\\n\\n .iter()\\n\",\n \"file_path\": \"pkmnapi-api/src/routes/mart_items.rs\",\n \"rank\": 94,\n \"score\": 138948.260230655\n },\n {\n \"content\": \"#[openapi]\\n\\n#[get(\\\"/moves/stats/<move_id>\\\")]\\n\\npub fn get_move_stats(\\n\\n sql: State<PkmnapiSQL>,\\n\\n _rate_limit: RateLimit,\\n\\n access_token: Result<AccessToken, AccessTokenError>,\\n\\n move_id: u8,\\n\\n) -> Result<Json<MoveStatsResponse>, ResponseError> {\\n\\n let access_token = utils::get_access_token(access_token)?;\\n\\n let (db, _) = utils::get_db_with_applied_patches(&sql, &access_token)?;\\n\\n\\n\\n let move_stats = db.get_move_stats(&move_id)?;\\n\\n let type_name = db.get_type_name(&move_stats.type_id)?;\\n\\n\\n\\n let response = MoveStatsResponse::new(&move_id, &move_stats, &type_name);\\n\\n\\n\\n Ok(Json(response))\\n\\n}\\n\\n\\n\",\n \"file_path\": \"pkmnapi-api/src/routes/move_stats.rs\",\n \"rank\": 95,\n \"score\": 138948.260230655\n },\n {\n \"content\": \"#[openapi]\\n\\n#[get(\\\"/pokedex/texts/<pokedex_id>\\\")]\\n\\npub fn get_pokedex_text(\\n\\n sql: State<PkmnapiSQL>,\\n\\n _rate_limit: RateLimit,\\n\\n access_token: Result<AccessToken, AccessTokenError>,\\n\\n pokedex_id: u8,\\n\\n) -> Result<Json<PokedexTextResponse>, ResponseError> {\\n\\n let access_token = utils::get_access_token(access_token)?;\\n\\n let (db, _) = utils::get_db_with_applied_patches(&sql, &access_token)?;\\n\\n\\n\\n let pokedex_text = db.get_pokedex_text(&pokedex_id)?;\\n\\n\\n\\n let response = PokedexTextResponse::new(&pokedex_id, &pokedex_text);\\n\\n\\n\\n Ok(Json(response))\\n\\n}\\n\\n\\n\\n#[openapi]\\n\\n#[post(\\n\\n \\\"/pokedex/texts/<pokedex_id>\\\",\\n\\n format = \\\"application/json\\\",\\n\\n data = \\\"<data>\\\"\\n\\n)]\\n\",\n \"file_path\": \"pkmnapi-api/src/routes/pokedex_texts.rs\",\n \"rank\": 96,\n \"score\": 138948.260230655\n },\n {\n \"content\": \"#[openapi]\\n\\n#[get(\\\"/pokemon/movesets/<pokedex_id>\\\")]\\n\\npub fn get_pokemon_moveset(\\n\\n sql: State<PkmnapiSQL>,\\n\\n _rate_limit: RateLimit,\\n\\n access_token: Result<AccessToken, AccessTokenError>,\\n\\n pokedex_id: u8,\\n\\n) -> Result<Json<PokemonMovesetResponse>, ResponseError> {\\n\\n let access_token = utils::get_access_token(access_token)?;\\n\\n let (db, _) = utils::get_db_with_applied_patches(&sql, &access_token)?;\\n\\n\\n\\n let pokemon_moveset = db.get_pokemon_moveset(&pokedex_id)?;\\n\\n let move_names = db.get_move_name_all(&pokemon_moveset)?;\\n\\n\\n\\n let response = PokemonMovesetResponse::new(&pokedex_id, &pokemon_moveset, &move_names);\\n\\n\\n\\n Ok(Json(response))\\n\\n}\\n\\n\\n\\n#[openapi]\\n\\n#[post(\\n\\n \\\"/pokemon/movesets/<pokedex_id>\\\",\\n\\n format = \\\"application/json\\\",\\n\\n data = \\\"<data>\\\"\\n\\n)]\\n\",\n \"file_path\": \"pkmnapi-api/src/routes/pokemon_movesets.rs\",\n \"rank\": 97,\n \"score\": 138948.260230655\n },\n {\n \"content\": \"#[openapi]\\n\\n#[get(\\\"/pokemon/stats\\\")]\\n\\npub fn get_pokemon_stats_all(\\n\\n sql: State<PkmnapiSQL>,\\n\\n _rate_limit: RateLimit,\\n\\n access_token: Result<AccessToken, AccessTokenError>,\\n\\n) -> Result<Json<PokemonStatsResponseAll>, ResponseError> {\\n\\n let access_token = utils::get_access_token(access_token)?;\\n\\n let (db, _) = utils::get_db_with_applied_patches(&sql, &access_token)?;\\n\\n\\n\\n let (min_pokedex_id, max_pokedex_id) = db.pokedex_id_bounds();\\n\\n let pokedex_ids: Vec<u8> = (min_pokedex_id..=max_pokedex_id)\\n\\n .map(|pokedex_id| pokedex_id as u8)\\n\\n .collect();\\n\\n let pokemon_stats = db.get_pokemon_stats_all(&pokedex_ids)?;\\n\\n let type_ids = pokemon_stats\\n\\n .iter()\\n\\n .map(|(_, pokemon_stats)| pokemon_stats.type_ids.to_vec())\\n\\n .flatten()\\n\\n .collect();\\n\\n let type_names = db.get_type_name_all(&type_ids)?;\\n\\n\\n\\n let response = PokemonStatsResponseAll::new(&pokedex_ids, &pokemon_stats, &type_names);\\n\\n\\n\\n Ok(Json(response))\\n\\n}\\n\\n\\n\",\n \"file_path\": \"pkmnapi-api/src/routes/pokemon_stats.rs\",\n \"rank\": 98,\n \"score\": 138948.260230655\n },\n {\n \"content\": \"pub fn post_pokemon_machines(\\n\\n sql: State<PkmnapiSQL>,\\n\\n _rate_limit: RateLimit,\\n\\n access_token: Result<AccessToken, AccessTokenError>,\\n\\n patch_description: Result<PatchDescription, PatchDescriptionError>,\\n\\n data: Result<Json<PokemonMachinesRequest>, JsonError>,\\n\\n pokedex_id: u8,\\n\\n) -> Result<status::Accepted<JsonValue>, ResponseError> {\\n\\n let access_token = utils::get_access_token(access_token)?;\\n\\n let data = utils::get_data(data, BaseErrorResponseId::error_pokemon_machines_invalid)?;\\n\\n let (db, connection) = utils::get_db(&sql, &access_token)?;\\n\\n\\n\\n let pokemon_machines = data.get_machines();\\n\\n\\n\\n let patch = db.set_pokemon_machines(&pokedex_id, &pokemon_machines)?;\\n\\n\\n\\n utils::insert_rom_patch(\\n\\n sql,\\n\\n connection,\\n\\n access_token,\\n\\n patch,\\n\\n patch_description,\\n\\n BaseErrorResponseId::error_pokemon_machines,\\n\\n )?;\\n\\n\\n\\n Ok(status::Accepted(Some(json!({}))))\\n\\n}\\n\",\n \"file_path\": \"pkmnapi-api/src/routes/pokemon_machines.rs\",\n \"rank\": 99,\n \"score\": 138948.260230655\n }\n]","isConversational":false}}},{"rowIdx":2359,"cells":{"lang":{"kind":"string","value":"Rust"},"file_path":{"kind":"string","value":"yarte_codegen/src/wasm/client/each.rs"},"repo_name":{"kind":"string","value":"dskleingeld/yarte"},"commit":{"kind":"string","value":"f3cd2db21fc4c64f74ef08f988357a282defee96"},"file_code":{"kind":"string","value":"use std::{collections::HashSet, iter};\n\nuse proc_macro2::TokenStream;\nuse quote::{format_ident, quote};\nuse syn::{parse2, Expr, Ident};\n\nuse yarte_dom::dom::{Each, ExprId, VarId};\n\nuse super::{\n component::get_component,\n state::{InsertPath, Len, Parent, State, Step},\n utils::*,\n BlackBox, WASMCodeGen,\n};\n\nimpl<'a> WASMCodeGen<'a> {\n #[inline]\n pub(super) fn gen_each(\n &mut self,\n id: ExprId,\n Each {\n args,\n body,\n expr,\n var,\n }: Each,\n fragment: bool,\n last: bool,\n insert_point: &[InsertPath],\n ) {\n \n let current_bb = self.current_bb();\n\n \n let (key, index) = var;\n let var_id = vec![key];\n let mut var_id_index = vec![key];\n let mut bases = HashSet::new();\n bases.insert(key);\n if let Some(index) = index {\n var_id_index.push(index);\n bases.insert(index);\n }\n\n \n let parent_id = if fragment {\n self.parent_node()\n } else {\n self.stack.last().steps.len()\n };\n\n \n self.stack.push(State {\n id: Parent::Expr(id),\n bases,\n parent_id,\n current_bb,\n ..Default::default()\n });\n\n \n let component = get_component(id, body.iter(), self);\n self.cur_mut().component = Some(component);\n\n \n self.step(body);\n\n let vdom = get_vdom_ident(id);\n let component_ty = get_component_ty_ident(id);\n let table = get_table_ident(id);\n \n let table_dom = get_table_dom_ident(id);\n\n \n let mut curr = self.stack.pop();\n\n \n let old_on = self.stack.last().id;\n let (base, _) = self.bb_t_root(var_id.into_iter());\n curr.add_t_root(base);\n\n \n curr.black_box.push(BlackBox {\n doc: \"root dom element\".to_string(),\n name: get_field_root_ident(),\n ty: parse2(quote!(yarte_wasm_app::web::Element)).unwrap(),\n });\n\n \n self.helpers.extend(curr.get_black_box(&component_ty));\n self.helpers\n .extend(get_drop(&component_ty, iter::once(get_field_root_ident())));\n\n \n for (_, path) in curr\n .path_nodes\n .iter_mut()\n .chain(curr.path_events.iter_mut())\n {\n if path.starts_with(&[Step::FirstChild, Step::FirstChild]) {\n \n path.remove(0);\n } else {\n todo!(\"multi node expressions\");\n }\n }\n\n let current_bb = &curr.current_bb;\n\n \n let build_args: TokenStream = quote!(#args)\n .to_string()\n .replace(\"self .\", \"\")\n .parse()\n .unwrap();\n let build = Self::build_each(\n &curr,\n build_args,\n &expr,\n &component_ty,\n &insert_point,\n &vdom,\n &table,\n &table_dom,\n );\n\n let parent = match old_on {\n Parent::Expr(id) => {\n let ident = get_vdom_ident(id);\n quote!(#ident)\n }\n Parent::Body | Parent::Head => quote!(#current_bb.#table_dom),\n };\n let (new, cached) = self.new_each(\n &curr,\n curr.component.as_ref().expect(\"some component\"),\n &component_ty,\n last,\n insert_point,\n &vdom,\n quote!(#current_bb.#table_dom),\n Some(parent),\n );\n let render = self.render_each(\n &curr,\n new,\n cached,\n &args,\n &expr,\n fragment,\n &vdom,\n quote!(#current_bb.#table),\n quote!(#current_bb.#table_dom),\n key,\n );\n let (new, cached) = self.new_each(\n &curr,\n curr.component.as_ref().expect(\"some component\"),\n &component_ty,\n last,\n &insert_point,\n &vdom,\n quote!(#table_dom),\n None,\n );\n\n let mut vars = self.solver.expr_inner_var(&id).clone();\n\n for (i, _) in &curr.buff_render {\n for j in i {\n if !var_id_index.contains(&self.solver.var_base(j)) {\n vars.insert(*j);\n }\n }\n }\n\n let last = self.stack.last_mut();\n last.buff_render.push((vars, render));\n last.buff_build.push(build);\n last.buff_new.push(if let Some(cached) = cached {\n quote! {\n let __cached__ = #cached;\n let mut #table: Vec<#component_ty> = vec![];\n for #expr in #args.skip(__dom_len__) {\n #table.push({ #new });\n }\n }\n } else {\n quote! {\n let mut #table: Vec<#component_ty> = vec![];\n for #expr in #args.skip(__dom_len__) {\n #table.push({ #new });\n }\n }\n });\n if !curr.path_events.is_empty() {\n let root = get_field_root_ident();\n let steps = get_steps(curr.path_events.iter(), quote!(#vdom.#root));\n let hydrate = curr.buff_hydrate;\n let hydrate = quote! {\n for (#vdom, #expr) in #current_bb.#table\n .iter_mut()\n .zip(#args)\n {\n #steps\n #(#hydrate)*\n }\n };\n last.buff_hydrate.push(hydrate);\n }\n last.path_nodes\n .push((table_dom.clone(), last.steps[..parent_id].to_vec()));\n last.black_box.push(BlackBox {\n doc: \"Each Virtual DOM node\".to_string(),\n name: table,\n ty: parse2(quote!(Vec<#component_ty>)).unwrap(),\n });\n last.black_box.push(BlackBox {\n doc: \"Each DOM Element\".to_string(),\n name: table_dom,\n ty: parse2(quote!(yarte_wasm_app::web::Element)).unwrap(),\n });\n }\n\n fn new_each(\n &self,\n curr: &State,\n component: &Ident,\n component_ty: &Ident,\n last: bool,\n insert_point: &[InsertPath],\n vdom: &Ident,\n table_dom: TokenStream,\n parent: Option<TokenStream>,\n ) -> (TokenStream, Option<TokenStream>) {\n let bb = self.global_bb_ident();\n let tmp = format_ident!(\"__tmp__\");\n let froot = get_field_root_ident();\n let steps = get_steps(\n curr.path_nodes.iter().chain(curr.path_events.iter()),\n quote!(#tmp),\n );\n let fields = curr.get_black_box_fields(&tmp, false);\n\n let (insert_point, cached) = if last {\n (\n quote!(#table_dom.append_child(&#vdom.#froot).unwrap_throw();),\n None,\n )\n } else {\n let len: Len = insert_point.into();\n let base = len.base as u32 + 1;\n let mut tokens = quote!(#base);\n for i in &len.expr {\n let ident = get_table_ident(*i);\n if let Some(parent) = &parent {\n tokens.extend(quote!(+ #parent.#ident.len() as u32))\n } else {\n tokens.extend(quote!(+ #ident.len() as u32))\n }\n }\n\n (\n quote!(#table_dom.insert_before(&#vdom.#froot, __cached__.as_ref()).unwrap_throw();),\n Some(if parent.is_some() {\n quote!(#table_dom.children().item(#tokens + __dom_len__ as u32).map(yarte_wasm_app::JsCast::unchecked_into::<yarte_wasm_app::web::Node>))\n } else {\n quote!(#table_dom.children().item(#tokens).map(yarte_wasm_app::JsCast::unchecked_into::<yarte_wasm_app::web::Node>))\n }),\n )\n };\n\n let build = &curr.buff_new;\n (\n quote! {\n let #tmp = yarte_wasm_app::JsCast::unchecked_into::<yarte_wasm_app::web::Element>(self.#bb.#component\n .clone_node_with_deep(true)\n .unwrap_throw());\n #steps\n #(#build)*\n let #vdom = #component_ty { #fields };\n #insert_point\n #vdom\n },\n cached,\n )\n }\n\n #[inline]\n fn build_each(\n curr: &State,\n args: TokenStream,\n expr: &Expr,\n component_ty: &Ident,\n insert_point: &[InsertPath],\n vdom: &Ident,\n table: &Ident,\n table_dom: &Ident,\n ) -> TokenStream {\n let froot = get_field_root_ident();\n let steps = get_steps(curr.path_nodes.iter(), quote!(#vdom));\n let fields = curr.get_black_box_fields(vdom, true);\n let build = &curr.buff_build;\n\n let insert_point = {\n let len: Len = insert_point.into();\n let base = len.base as u32;\n let mut tokens = quote!(#base);\n for i in &len.expr {\n let ident = get_table_ident(*i);\n tokens.extend(quote!(+ #ident.len() as u32))\n }\n\n quote!(#table_dom.children().item(#tokens).unwrap_throw())\n };\n\n quote! {\n let mut #table: Vec<#component_ty> = vec![];\n for #expr in #args {\n let #vdom = #table.last().map(|__x__| __x__.#froot.next_element_sibling().unwrap_throw()).unwrap_or_else(|| #insert_point);\n #steps\n #(#build)*\n #table.push(#component_ty { #fields });\n }\n }\n }\n\n #[inline]\n fn render_each(\n &self,\n curr: &State,\n new: TokenStream,\n cached: Option<TokenStream>,\n args: &Expr,\n expr: &Expr,\n fragment: bool,\n vdom: &Ident,\n table: TokenStream,\n table_dom: TokenStream,\n each_base: VarId,\n ) -> TokenStream {\n let froot = get_field_root_ident();\n\n \n \n \n let new_block = if let Some(cached) = &cached {\n quote! {\n let __cached__ = #cached;\n for #expr in #args.skip(__dom_len__) {\n #table.push({ #new });\n }\n }\n } else {\n quote! {\n for #expr in #args.skip(__dom_len__) {\n #table.push({ #new });\n }\n }\n };\n let render = if curr.buff_render.is_empty() {\n quote!()\n } else {\n \n let parents = curr.get_render_hash().into_iter().any(|(i, _)| {\n for j in i {\n let base = self.solver.var_base(&j);\n if base != each_base {\n return true;\n }\n }\n false\n });\n\n let render = self.render(curr);\n assert!(!render.is_empty());\n if parents {\n quote! {\n for (#vdom, #expr) in #table\n .iter_mut()\n .zip(#args)\n {\n #render\n #vdom.t_root = yarte_wasm_app::YNumber::zero();\n }\n }\n } else {\n quote! {\n for (#vdom, #expr) in #table\n .iter_mut()\n .zip(#args)\n .filter(|(__d__, _)| yarte_wasm_app::YNumber::neq_zero(__d__.t_root))\n {\n #render\n #vdom.t_root = yarte_wasm_app::YNumber::zero();\n }\n }\n }\n };\n let body = quote! {\n #render\n if __dom_len__ < __data_len__ { #new_block } else {\n #table.drain(__data_len__..);\n }\n };\n\n \n let data_len = if true {\n quote!(let __data_len__ = #args.size_hint().0;)\n } else {\n quote!(let __data_len__ = #args.count();)\n };\n if fragment {\n quote! {\n let __dom_len__ = #table.len();\n #data_len\n #body\n }\n } else {\n quote! {\n let __dom_len__ = #table.len();\n #data_len;\n if __data_len__ == 0 {\n #table_dom.set_text_content(None);\n #table.clear()\n } else { #body }\n }\n }\n }\n}\n"},"prefix":{"kind":"string","value":"use std::{collections::HashSet, iter};\n\nuse proc_macro2::TokenStream;\nuse quote::{format_ident, quote};\nuse syn::{parse2, Expr, Ident};\n\nuse yarte_dom::dom::{Each, ExprId, VarId};\n\nuse super::{\n component::get_component,\n state::{InsertPath, Len, Parent, State, Step},\n utils::*,\n BlackBox, WASMCodeGen,\n};\n\nimpl<'a> WASMCodeGen<'a> {\n #[inline]\n pub(super) fn gen_each(\n &mut self,\n id: ExprId,\n Each {\n args,\n body,\n expr,\n var,\n }: Each,\n fragment: bool,\n last: bool,\n insert_point: &[InsertPath],\n ) {\n \n let current_bb = self.current_bb();\n\n \n let (key, index) = var;\n let var_id = vec![key];\n let mut var_id_index = vec![key];\n let mut bases = HashSet::new();\n bases.insert(key);\n if let Some(index) = index {\n var_id_index.push(index);\n bases.insert(index);\n }\n\n \n let parent_id = if fragment {\n self.parent_node()\n } else {\n self.stack.last().steps.len()\n };\n\n \n self.stack.push(State {\n id: Parent::Expr(id),\n bases,\n parent_id,\n current_bb,\n ..Default::default()\n });\n\n \n let component = get_component(id, body.iter(), self);\n self.cur_mut().component = Some(component);\n\n \n self.step(body);\n\n let vdom = get_vdom_ident(id);\n let component_ty = get_component_ty_ident(id);\n let table = get_table_ident(id);\n \n let table_dom = get_table_dom_ident(id);\n\n \n let mut curr = self.stack.pop();\n\n \n let old_on = self.stack.last().id;\n let (base, _) = self.bb_t_root(var_id.into_iter());\n curr.add_t_root(base);\n\n \n curr.black_box.push(BlackBox {\n doc: \"root dom element\".to_string(),\n name: get_field_root_ident(),\n ty: parse2(quote!(yarte_wasm_app::web::Element)).unwrap(),\n });\n\n \n self.helpers.extend(curr.get_black_box(&component_ty));\n self.helpers\n .extend(get_drop(&component_ty, iter::once(get_field_root_ident())));\n\n \n for (_, path) in curr\n .path_nodes\n .iter_mut()\n .chain(curr.path_events.iter_mut())\n {\n if path.starts_with(&[Step::FirstChild, Step::FirstChild]) {\n \n path.remove(0);\n } else {\n todo!(\"multi node expressions\");\n }\n }\n\n let current_bb = &curr.current_bb;\n\n \n let build_args: TokenStream = quote!(#args)\n .to_string()\n .replace(\"self .\", \"\")\n .parse()\n .unwrap();\n let build = Self::build_each(\n &curr,\n build_args,\n &expr,\n &component_ty,\n &insert_point,\n &vdom,\n &table,\n &table_dom,\n );\n\n let parent = match old_on {\n Parent::Expr(id) => {\n let ident = get_vdom_ident(id);\n quote!(#ident)\n }\n Parent::Body | Parent::Head => quote!(#current_bb.#table_dom),\n };\n let (new, cached) = self.new_each(\n &curr,\n curr.component.as_ref().expect(\"some component\"),\n &component_ty,\n last,\n insert_point,\n &vdom,\n quote!(#current_bb.#table_dom),\n Some(parent),\n );\n let render = self.render_each(\n &curr,\n new,\n cached,\n &args,\n &expr,\n fragment,\n &vdom,\n quote!(#current_bb.#table),\n quote!(#current_bb.#table_dom),\n key,\n );\n let (new, cached) = self.new_each(\n &curr,\n curr.component.as_ref().expect(\"some component\"),\n &component_ty,\n last,\n &insert_point,\n &vdom,\n quote!(#table_dom),\n None,\n );\n\n let mut vars = self.solver.expr_inner_var(&id).clone();\n\n for (i, _) in &curr.buff_render {\n for j in i {\n if !var_id_index.contains(&self.solver.var_base(j)) {\n vars.insert(*j);\n }\n }\n }\n\n let last = self.stack.last_mut();\n last.buff_render.push((vars, render));\n last.buff_build.push(build);\n last.buff_new.push(if let Some(cached) = cached {\n quote! {\n let __cached__ = #cached;\n let mut #table: Vec<#component_ty> = vec![];\n for #expr in #args.skip(__dom_len__) {\n #table.push({ #new });\n }\n }\n } else {\n quote! {\n let mut #table: Vec<#component_ty> = vec![];\n for #expr in #args.skip(__dom_len__) {\n #table.push({ #new });\n }\n }\n });\n if !curr.path_events.is_empty() {\n let root = get_field_root_ident();\n let steps = get_steps(curr.path_events.iter(), quote!(#vdom.#root));\n let hydrate = curr.buff_hydrate;\n let hydrate = quote! {\n for (#vdom, #expr) in #current_bb.#table\n .iter_mut()\n .zip(#args)\n {\n #steps\n #(#hydrate)*\n }\n };\n last.buff_hydrate.push(hydrate);\n }\n last.path_nodes\n .push((table_dom.clone(), last.steps[..parent_id].to_vec()));\n last.black_box.push(BlackBox {\n doc: \"Each Virtual DOM node\".to_string(),\n name: table,\n ty: parse2(quote!(Vec<#component_ty>)).unwrap(),\n });\n last.black_box.push(BlackBox {\n doc: \"Each DOM Element\".to_string(),\n name: table_dom,\n ty: parse2(quote!(yarte_wasm_app::web::Element)).unwrap(),\n });\n }\n\n fn new_each(\n &self,\n curr: &State,\n component: &Ident,\n component_ty: &Ident,\n last: bool,\n insert_point: &[InsertPath],\n vdom: &Ident,\n table_dom: TokenStream,\n parent: Option<TokenStream>,\n ) -> (TokenStream, Option<TokenStream>) {\n let bb = self.global_bb_ident();\n let tmp = format_ident!(\"__tmp__\");\n let froot = get_field_root_ident();\n let steps = get_steps(\n curr.path_nodes.iter().chain(curr.path_events.iter()),\n quote!(#tmp),\n );\n let fields = curr.get_black_box_fields(&tmp, false);\n\n let (insert_point, cached) = if last {\n (\n quote!(#table_dom.append_child(&#vdom.#froot).unwrap_throw();),\n None,\n )\n } else {\n let len: Len = insert_point.into();\n let base = len.base as u32 + 1;\n let mut tokens = quote!(#base);\n for i in &len.expr {\n let ident = get_table_ident(*i);\n if let Some(parent) = &parent {\n tokens.extend(quote!(+ #parent.#ident.len() as u32))\n } else {\n tokens.extend(quote!(+ #ident.len() as u32))\n }\n }\n\n (\n quote!(#table_dom.insert_before(&#vdom.#froot, __cached__.as_ref()).unwrap_throw();),\n Some(if parent.is_some() {\n quote!(#table_dom.children().item(#tokens + __dom_len__ as u32).map(yarte_wasm_app::JsCast::unchecked_into::<yarte_wasm_app::web::Node>))\n } else {\n quote!(#table_dom.children().item(#tokens).map(yarte_wasm_app::JsCast::unchecked_into::<yarte_wasm_app::web::Node>))\n }),\n )\n };\n\n let build = &curr.buff_new;\n (\n quote! {\n let #tmp = yarte_wasm_app::JsCast::unchecked_into::<yarte_wasm_app::web::Element>(self.#bb.#component\n .clone_node_with_deep(true)\n .unwrap_throw());\n #steps\n #(#build)*\n let #vdom = #component_ty { #fields };\n #insert_point\n #vdom\n },\n cached,\n )\n }\n\n #[inline]\n fn build_each(\n curr: &State,\n args: TokenStream,\n expr: &Expr,\n component_ty: &Ident,\n insert_point: &[InsertPath],\n vdom: &Ident,\n table: &Ident,\n table_dom: &Ident,\n ) -> TokenStream {\n let froot = get_field_root_ident();\n let steps = get_steps(curr.path_nodes.iter(), quote!(#vdom));\n let fields = curr.get_black_box_fields(vdom, true);\n let build = &curr.buff_build;\n\n let insert_point = {\n let len: Len = insert_point.into();\n let base = len.base as u32;\n let mut tokens = quote!(#base);\n for i in &len.expr {\n let ident = get_table_ident(*i);\n tokens.extend(quote!(+ #ident.len() as u32))\n }\n\n quote!(#table_dom.children().item(#tokens).unwrap_throw())\n };\n\n quote! {\n let mut #table: Vec<#component_ty> = vec![];\n for #expr in #args {\n let #vdom = #table.last().map(|__x__| __x__.#froot.next_element_sibling().unwrap_throw()).unwrap_or_else(|| #insert_point);\n #steps\n #(#build)*\n #table.push(#component_ty { #fields });\n }\n }\n }\n\n #[inline]\n fn render_each(\n &self,\n curr: &State,\n new: TokenStream,\n cached: Option<TokenStream>,\n args: &Expr,\n expr: &Expr,\n fragment: bool,\n vdom: &Ident,\n table: TokenStream,\n table_dom: TokenStream,\n each_base: VarId,\n ) -> TokenStream {\n let froot = get_field_root_ident();\n\n \n \n \n let new_block = if let Some(cached) = &cached {\n quote! {\n let __cached__ = #cached;\n for #expr in #args.skip(__dom_len__) {\n #table.push({ #new });\n }\n }\n } else {\n quote! {\n for #expr in #args.skip(__dom_len__) {\n #table.push({ #new });\n }\n }\n };\n let render = if curr.buff_render.is_empty() {\n quote!()\n } else {\n \n let parents = curr.get_render_hash().into_iter().any(|(i, _)| {\n for j in i {\n let base = self.solver.var_base(&j);\n if base != each_base {\n return true;\n }\n }\n "},"suffix":{"kind":"string","value":"\n}\n"},"middle":{"kind":"string","value":"false\n });\n\n let render = self.render(curr);\n assert!(!render.is_empty());\n if parents {\n quote! {\n for (#vdom, #expr) in #table\n .iter_mut()\n .zip(#args)\n {\n #render\n #vdom.t_root = yarte_wasm_app::YNumber::zero();\n }\n }\n } else {\n quote! {\n for (#vdom, #expr) in #table\n .iter_mut()\n .zip(#args)\n .filter(|(__d__, _)| yarte_wasm_app::YNumber::neq_zero(__d__.t_root))\n {\n #render\n #vdom.t_root = yarte_wasm_app::YNumber::zero();\n }\n }\n }\n };\n let body = quote! {\n #render\n if __dom_len__ < __data_len__ { #new_block } else {\n #table.drain(__data_len__..);\n }\n };\n\n \n let data_len = if true {\n quote!(let __data_len__ = #args.size_hint().0;)\n } else {\n quote!(let __data_len__ = #args.count();)\n };\n if fragment {\n quote! {\n let __dom_len__ = #table.len();\n #data_len\n #body\n }\n } else {\n quote! {\n let __dom_len__ = #table.len();\n #data_len;\n if __data_len__ == 0 {\n #table_dom.set_text_content(None);\n #table.clear()\n } else { #body }\n }\n }\n }"},"strategy":{"kind":"string","value":"function_block-function_prefix_line"},"context_items":{"kind":"list like","value":[{"content":"pub fn resolve_if_block<'a>(expr: &'a Expr, id: usize, builder: &'a mut DOMBuilder) -> Vec<VarId> {\n\n ResolveIf::new(builder, id).resolve(expr)\n\n}\n\n\n","file_path":"yarte_dom/src/dom/resolve.rs","rank":0,"score":414137.18538381014},{"content":"#[inline]\n\npub fn get_component_ty_ident(id: ExprId) -> Ident {\n\n const TY: &str = \"YComponent\";\n\n format_ident!(\"{}{}\", TY, id)\n\n}\n\n\n","file_path":"yarte_codegen/src/wasm/client/utils.rs","rank":1,"score":408357.4633154533},{"content":"#[inline]\n\npub fn get_table_dom_ident(id: ExprId) -> Ident {\n\n const TABLE_DOM: &str = \"__ytable_dom__\";\n\n format_ident!(\"{}{}\", TABLE_DOM, id)\n\n}\n\n\n","file_path":"yarte_codegen/src/wasm/client/utils.rs","rank":2,"score":408125.95136279624},{"content":"pub fn resolve_expr<'a>(expr: &'a Expr, builder: &'a mut DOMBuilder) -> Vec<VarId> {\n\n ResolveExpr::new(builder).resolve(expr)\n\n}\n\n\n","file_path":"yarte_dom/src/dom/resolve.rs","rank":3,"score":405610.81656452577},{"content":"#[inline]\n\npub fn get_vdom_ident(id: ExprId) -> Ident {\n\n const ELEM: &str = \"__dom__\";\n\n format_ident!(\"{}{}\", ELEM, id)\n\n}\n\n\n\n#[inline]\n","file_path":"yarte_codegen/src/wasm/client/utils.rs","rank":4,"score":375531.79158537457},{"content":"#[inline]\n\npub fn get_table_ident(id: ExprId) -> Ident {\n\n const TABLE: &str = \"__ytable__\";\n\n format_ident!(\"{}{}\", TABLE, id)\n\n}\n\n\n","file_path":"yarte_codegen/src/wasm/client/utils.rs","rank":5,"score":375469.21312720847},{"content":"#[inline]\n\npub fn get_node_ident(id: ExprId) -> Ident {\n\n const NODE: &str = \"__ynode__\";\n\n format_ident!(\"{}{}\", NODE, id)\n\n}\n\n\n","file_path":"yarte_codegen/src/wasm/client/utils.rs","rank":6,"score":375466.38787151326},{"content":"#[inline]\n\npub fn is_state(Field { attrs, ty, .. }: &Field) -> bool {\n\n !(is_inner(attrs) || is_black_box(ty))\n\n}\n\n\n","file_path":"yarte_codegen/src/wasm/client/utils.rs","rank":7,"score":365426.19585628825},{"content":"pub fn all_children_text<'a, I: Iterator<Item = &'a Node> + Clone>(mut doc: I) -> bool {\n\n !doc.clone().all(|x| {\n\n if let Node::Elem(Element::Text(_)) = x {\n\n true\n\n } else {\n\n false\n\n }\n\n }) && doc.all(|x| match x {\n\n Node::Elem(Element::Text(_)) => true,\n\n Node::Expr(e) => match e {\n\n Expression::IfElse(_, block) => {\n\n let IfElse { ifs, if_else, els } = &**block;\n\n all_if_block_text(ifs)\n\n && if_else.iter().all(|x| all_if_block_text(x))\n\n && els\n\n .as_ref()\n\n .map(|x| all_children_text(x.iter()))\n\n .unwrap_or(true)\n\n }\n\n Expression::Each(_, block) => {\n\n let Each { body, .. } = &**block;\n\n all_children_text(body.iter())\n\n }\n\n Expression::Local(..) => false,\n\n _ => true,\n\n },\n\n _ => false,\n\n })\n\n}\n\n\n","file_path":"yarte_codegen/src/wasm/client/utils.rs","rank":8,"score":356903.29014134884},{"content":"pub fn resolve_local<'a>(expr: &'a Local, id: usize, builder: &'a mut DOMBuilder) -> VarId {\n\n ResolveLocal::new(builder, id).resolve(expr)\n\n}\n\n\n","file_path":"yarte_dom/src/dom/resolve.rs","rank":9,"score":343773.5975843109},{"content":"pub fn get_split_32(mut bits: &[bool]) -> Punctuated<syn::Expr, Token![,]> {\n\n let mut buff = Punctuated::new();\n\n while !bits.is_empty() {\n\n let (current, next) = bits.split_at(32);\n\n bits = next;\n\n let current = get_number_u32(current);\n\n buff.push(parse2(quote!(#current)).unwrap());\n\n }\n\n\n\n buff\n\n}\n\n\n","file_path":"yarte_codegen/src/wasm/client/utils.rs","rank":10,"score":340610.0975568709},{"content":"#[inline]\n\npub fn get_drop<I: Iterator<Item = Ident>>(component: &Ident, roots: I) -> TokenStream {\n\n let mut tokens = TokenStream::new();\n\n for root in roots {\n\n tokens.extend(quote!(self.#root.remove();));\n\n }\n\n quote! {\n\n impl Drop for #component {\n\n fn drop(&mut self) {\n\n #tokens\n\n }\n\n }\n\n }\n\n}\n","file_path":"yarte_codegen/src/wasm/client/utils.rs","rank":11,"score":339173.3927908804},{"content":"fn fields_to_args(f: &Fields, i: &Ident) -> (Punctuated<Ident, Token![,]>, TokenStream) {\n\n let mut pun = Punctuated::new();\n\n match f {\n\n Fields::Named(FieldsNamed { named, .. }) => {\n\n let mut buff: Punctuated<Ident, Token![,]> = Punctuated::new();\n\n for i in named {\n\n let ident = i.ident.as_ref().unwrap();\n\n buff.push(ident.clone());\n\n pun.push(ident.clone());\n\n }\n\n\n\n (pun, quote!(#i { #buff }))\n\n }\n\n Fields::Unnamed(FieldsUnnamed { unnamed, .. }) => {\n\n let mut buff: Punctuated<Ident, Token![,]> = Punctuated::new();\n\n for (c, _) in unnamed.into_iter().enumerate() {\n\n let ident = format_ident!(\"_{}\", c);\n\n buff.push(ident.clone());\n\n pun.push(ident);\n\n }\n\n\n\n (pun, quote!(#i( #buff )))\n\n }\n\n Fields::Unit => (pun, quote!(#i)),\n\n }\n\n}\n\n\n","file_path":"yarte_codegen/src/wasm/client/messages.rs","rank":12,"score":331988.41798061616},{"content":"fn _zip(head: &str, expr: &mut Iter<Vec<String>>, buff: &mut Vec<String>) {\n\n if let Some(first) = expr.next() {\n\n for i in first {\n\n let head = head.to_owned() + \" \" + &i;\n\n _zip(&head, &mut expr.clone(), buff)\n\n }\n\n } else {\n\n buff.push(head.into());\n\n }\n\n}\n","file_path":"yarte_wasm_app/benches/codegen/src/lib.rs","rank":13,"score":325451.1541558801},{"content":"pub fn get_insert_point<'b, I: Iterator<Item = &'b Node>>(nodes: I) -> Vec<InsertPath> {\n\n let mut insert = vec![];\n\n // TODO: inline nodes, expressions, ...\n\n for e in nodes {\n\n match e {\n\n Node::Elem(Element::Node { .. }) => insert.push(InsertPath::Before),\n\n Node::Expr(Expression::Each(id, _)) | Node::Expr(Expression::IfElse(id, _)) => {\n\n insert.push(InsertPath::Expr(*id))\n\n }\n\n _ => (),\n\n }\n\n }\n\n\n\n insert\n\n}\n\n\n","file_path":"yarte_codegen/src/wasm/client/utils.rs","rank":14,"score":311623.82707639},{"content":"fn get_children<I: Iterator<Item = ParseNodeId>>(children: I, sink: &mut Sink) -> Vec<TreeElement> {\n\n use ParseElement::*;\n\n let mut tree = vec![];\n\n for child in children {\n\n match sink.nodes.remove(&child).expect(\"Child\") {\n\n Text(mut s) => {\n\n if let Some(TreeElement::Text(last)) = tree.last_mut() {\n\n last.extend(s.drain(..));\n\n } else {\n\n tree.push(TreeElement::Text(s))\n\n }\n\n }\n\n Node {\n\n name,\n\n attrs,\n\n children,\n\n ..\n\n } => tree.push(TreeElement::Node {\n\n name,\n\n attrs,\n","file_path":"yarte_dom/src/serialize.rs","rank":15,"score":307187.778141371},{"content":"pub fn expand_match_token(body: &TokenStream) -> syn::Expr {\n\n let match_token = syn::parse2::<MatchToken>(body.clone());\n\n let ast = expand_match_token_macro(match_token.unwrap());\n\n syn::parse2(ast.into()).unwrap()\n\n}\n\n\n","file_path":"yarte_html/macros/match_token.rs","rank":16,"score":305247.4278850975},{"content":"fn gen<C>(codegen: &mut C, v: Vec<HIR>, parent: &str) -> TokenStream\n\nwhere\n\n C: CodeGen + EachCodeGen + IfElseCodeGen,\n\n{\n\n let mut tokens = TokenStream::new();\n\n let parent = format_ident!(\"{}\", parent);\n\n for i in v {\n\n use HIR::*;\n\n tokens.extend(match i {\n\n Local(a) => quote!(#a),\n\n Lit(a) => literal(a, &parent),\n\n Safe(a) => quote!(buf_cur += &(#a).__render_it_safe(&mut buf[buf_cur..])?;),\n\n Expr(a) => quote!(buf_cur += &(#a).__render_it(&mut buf[buf_cur..])?;),\n\n Each(a) => codegen.gen_each(*a),\n\n IfElse(a) => codegen.gen_if_else(*a),\n\n })\n\n }\n\n tokens\n\n}\n\n\n","file_path":"yarte_codegen/src/fixed.rs","rank":17,"score":296510.142756877},{"content":"/// Push literal at cursor with length\n\nfn eat_lit<'a>(nodes: &mut Vec<SNode<'a>>, i: Cursor<'a>, len: usize) {\n\n let lit = &i.rest[..len];\n\n if !lit.is_empty() {\n\n let (l, lit, r) = trim(lit);\n\n let ins = Span {\n\n lo: i.off + (l.len() as u32),\n\n hi: i.off + ((len - r.len()) as u32),\n\n };\n\n let out = Span {\n\n lo: i.off,\n\n hi: i.off + (len as u32),\n\n };\n\n nodes.push(S(Node::Lit(l, S(lit, ins), r), out));\n\n }\n\n}\n\n\n","file_path":"yarte_parser/src/lib.rs","rank":18,"score":286351.71563536534},{"content":"fn literal(a: String, parent: &Ident) -> TokenStream {\n\n let len = a.len();\n\n let b = a.as_bytes();\n\n // https://github.com/torvalds/linux/blob/master/arch/x86/lib/memcpy_64.S\n\n // https://software.intel.com/content/www/us/en/develop/download/intel-64-and-ia-32-architectures-optimization-reference-manual.html\n\n match len {\n\n 0 => unreachable!(),\n\n // For 1 to 3 bytes, is mostly faster write byte-by-byte\n\n 1..=3 => {\n\n let range: TokenStream = write_bb(b);\n\n quote! {{\n\n #[doc = #a]\n\n __yarte_check_write!(#len, {\n\n #range\n\n buf_cur += #len;\n\n })\n\n }}\n\n }\n\n 4..=15 => {\n\n quote! {{\n","file_path":"yarte_codegen/src/fixed.rs","rank":19,"score":280424.8333878564},{"content":"// TODO: multiple roots\n\npub fn get_field_root_ident() -> Ident {\n\n const ROOT: &str = \"__root\";\n\n format_ident!(\"{}\", ROOT)\n\n}\n\n\n","file_path":"yarte_codegen/src/wasm/client/utils.rs","rank":20,"score":277893.46342993045},{"content":"pub fn get_t_root_type(len: usize) -> (TokenStream, usize) {\n\n match len {\n\n 0..=8 => (quote!(u8), 8),\n\n 9..=16 => (quote!(u16), 16),\n\n 17..=32 => (quote!(u32), 32),\n\n 33..=64 => (quote!(yarte_wasm_app::U64), 64),\n\n 65..=128 => (quote!(yarte_wasm_app::U128), 128),\n\n 129..=256 => (quote!(yarte_wasm_app::U256), 256),\n\n _ => todo!(\"more than 256 variables per context\"),\n\n }\n\n}\n\n\n","file_path":"yarte_codegen/src/wasm/client/utils.rs","rank":21,"score":270677.11924508424},{"content":"/// Eat expression Node\n\nfn expr(i: Cursor, lws: bool) -> PResult<Node> {\n\n match at_helper(i, lws) {\n\n Ok(x) => return Ok(x),\n\n Err(e @ LexError::Fail(..)) => return Err(e),\n\n _ => (),\n\n }\n\n\n\n let mut at = 0;\n\n let (c, rws, s) = loop {\n\n if let Some(j) = i.adv_find(at, '}') {\n\n if 0 < at + j && i.adv_starts_with(at + j - 1, \"~}}\") {\n\n break (i.adv(at + j + 2), true, &i.rest[..at + j - 1]);\n\n } else if i.adv_starts_with(at + j + 1, \"}\") {\n\n break (i.adv(at + j + 2), false, &i.rest[..at + j]);\n\n }\n\n\n\n at += j + 1;\n\n } else {\n\n return Err(LexError::Next(\n\n PError::Expr(DOption::None),\n","file_path":"yarte_parser/src/lib.rs","rank":22,"score":270426.2344273931},{"content":"#[inline]\n\nfn is_tuple_index(ident: &[u8]) -> bool {\n\n 1 < ident.len() && ident[0] == b'_' && ident[1..].iter().all(|x| x.is_ascii_digit())\n\n}\n","file_path":"yarte_hir/src/lib.rs","rank":23,"score":266299.72368436016},{"content":"pub fn get_number_u32(bits: &[bool]) -> u32 {\n\n let mut n = 0;\n\n for (i, b) in bits.iter().enumerate() {\n\n if *b {\n\n n += 1 << i as u32\n\n }\n\n }\n\n n\n\n}\n\n\n","file_path":"yarte_codegen/src/wasm/client/utils.rs","rank":24,"score":257841.2271885164},{"content":"fn gen<C>(codegen: &mut C, v: Vec<HIR>, buf: TokenStream) -> TokenStream\n\nwhere\n\n C: CodeGen + EachCodeGen + IfElseCodeGen,\n\n{\n\n let mut tokens = TokenStream::new();\n\n for i in v {\n\n use HIR::*;\n\n tokens.extend(match i {\n\n Local(a) => quote!(#a),\n\n Lit(a) => literal(a, &buf),\n\n Safe(a) => quote!(&(#a).__render_itb_safe(buf_ref!(#buf));),\n\n Expr(a) => quote!(&(#a).__render_itb(buf_ref!(#buf));),\n\n Each(a) => codegen.gen_each(*a),\n\n IfElse(a) => codegen.gen_if_else(*a),\n\n })\n\n }\n\n tokens\n\n}\n\n\n","file_path":"yarte_codegen/src/bytes.rs","rank":25,"score":256635.05804513174},{"content":"fn resolve_node(ir: HIR, buff: &mut Vec<HIR>, opts: SerializerOpt) -> ParseResult<()> {\n\n match ir {\n\n HIR::Each(each) => {\n\n let HEach { args, body, expr } = *each;\n\n buff.push(HIR::Each(Box::new(HEach {\n\n args,\n\n expr,\n\n body: to_domfmt(body, opts)?,\n\n })))\n\n }\n\n HIR::IfElse(if_else) => {\n\n let HIfElse { ifs, if_else, els } = *if_else;\n\n let mut buf_if_else = vec![];\n\n for (expr, body) in if_else {\n\n buf_if_else.push((expr, to_domfmt(body, opts)?));\n\n }\n\n let els = if let Some(els) = els {\n\n Some(to_domfmt(els, opts)?)\n\n } else {\n\n None\n","file_path":"yarte_dom/src/dom_fmt.rs","rank":26,"score":255570.6570071935},{"content":"// TODO: Fix me!!\n\npub fn get_steps<'b, I: Iterator<Item = &'b PathNode>>(\n\n mut nodes: I,\n\n parent: TokenStream,\n\n) -> TokenStream {\n\n let mut buff = vec![];\n\n let mut stack = vec![];\n\n if let Some((ident, path)) = nodes.next() {\n\n buff.push((parent.clone(), ident.clone(), PathStep(path.iter())));\n\n stack.push((ident, path))\n\n }\n\n for (ident, path) in nodes {\n\n let mut check = true;\n\n for (i, last) in stack.iter().rev() {\n\n if path.starts_with(last) {\n\n // TODO: assert_ne!(last.len(), path.len());\n\n buff.push((\n\n quote!(#i),\n\n ident.clone(),\n\n PathStep(path[last.len()..].iter()),\n\n ));\n","file_path":"yarte_codegen/src/wasm/client/utils.rs","rank":27,"score":255328.19209467008},{"content":"fn add_scripts(s: &Struct, sink: &mut Sink, ir: &mut Vec<HIR>) {\n\n let mut body: Option<usize> = None;\n\n use ParseElement::*;\n\n match sink.nodes.values().next() {\n\n Some(Document(children)) => {\n\n if let Some(Node { name, children, .. }) = sink.nodes.get(&children[0]) {\n\n if let y_name!(\"html\") = name.local {\n\n for i in children {\n\n if let Some(Node { name, .. }) = sink.nodes.get(i) {\n\n if let y_name!(\"body\") = name.local {\n\n body = Some(*i);\n\n }\n\n }\n\n }\n\n }\n\n }\n\n }\n\n _ => panic!(\"Need <!doctype html>\"),\n\n }\n\n\n","file_path":"yarte_dom/src/dom_fmt.rs","rank":28,"score":252507.06321011594},{"content":"fn gen<C>(codegen: &mut C, v: Vec<HIR>) -> TokenStream\n\nwhere\n\n C: CodeGen + EachCodeGen + IfElseCodeGen,\n\n{\n\n let mut tokens = TokenStream::new();\n\n for i in v {\n\n use HIR::*;\n\n tokens.extend(match i {\n\n Local(a) => quote!(#a),\n\n Lit(a) => quote!(_fmt.write_str(#a)?;),\n\n Safe(a) => quote!(&(#a).fmt(_fmt)?;),\n\n Expr(a) => quote!(&(#a).__renders_it(_fmt)?;),\n\n Each(a) => codegen.gen_each(*a),\n\n IfElse(a) => codegen.gen_if_else(*a),\n\n })\n\n }\n\n tokens\n\n}\n\n\n\npub struct HTMLCodeGen;\n","file_path":"yarte_codegen/src/html.rs","rank":29,"score":251329.97927475793},{"content":"#[inline]\n\npub fn is_black_box(ty: &Type) -> bool {\n\n BB_TYPE.with(|black| ty.eq(&black))\n\n}\n\n\n","file_path":"yarte_codegen/src/wasm/client/utils.rs","rank":30,"score":248939.09332980646},{"content":"#[inline]\n\nfn delete(app: &mut Test, id: u32, _addr: &Addr<Test>) {\n\n let index = app.fortunes.iter().position(|x| x.id == id).unwrap();\n\n app.fortunes.remove(index);\n\n // TODO: macro\n\n // TODO: when index\n\n app.black_box.__ytable__1.remove(index);\n\n}\n\n\n","file_path":"example_wasm/client/src/lib.rs","rank":31,"score":248853.95951726363},{"content":"pub fn expand(from: &Path, to: &Path) {\n\n let mut source = String::new();\n\n File::open(from)\n\n .unwrap()\n\n .read_to_string(&mut source)\n\n .unwrap();\n\n let ast = syn::parse_file(&source).expect(\"Parsing rules.rs module\");\n\n let mut m = MatchTokenParser {};\n\n let ast = m.fold_file(ast);\n\n let code = ast\n\n .into_token_stream()\n\n .to_string()\n\n .replace(\"{ \", \"{\\n\")\n\n .replace(\" }\", \"\\n}\");\n\n File::create(to)\n\n .unwrap()\n\n .write_all(code.as_bytes())\n\n .unwrap();\n\n}\n\n\n","file_path":"yarte_html/macros/match_token.rs","rank":32,"score":247465.6868936246},{"content":"pub fn to_wasmfmt(mut ir: Vec<HIR>, s: &Struct) -> ParseResult<Vec<HIR>> {\n\n let html = get_html(&ir);\n\n let sink = match parse_document(&html) {\n\n Ok(mut sink) => {\n\n add_scripts(s, &mut sink, &mut ir);\n\n sink\n\n }\n\n Err(_) => parse_fragment(&html)?,\n\n };\n\n\n\n serialize_domfmt(sink, ir, SerializerOpt { wasm: true })\n\n}\n\n\n","file_path":"yarte_dom/src/dom_fmt.rs","rank":33,"score":246596.3964430797},{"content":"// Helpers\n\nfn build_big_table(size: usize) -> Vec<Vec<usize>> {\n\n let mut table = Vec::with_capacity(size);\n\n for _ in 0..size {\n\n let mut inner = Vec::with_capacity(size);\n\n for i in 0..size {\n\n inner.push(i);\n\n }\n\n table.push(inner);\n\n }\n\n\n\n table\n\n}\n\n\n","file_path":"benches/src/all.rs","rank":34,"score":244102.35285460937},{"content":"#[inline]\n\nfn par(i: Cursor, lws: bool) -> PResult<Node> {\n\n match expr_partial_block(i, lws) {\n\n Ok(x) => Ok(x),\n\n Err(_) => partial(i, lws).map(|(c, p)| (c, Node::Partial(p))),\n\n }\n\n}\n\n\n\n/// Eat partial expression\n","file_path":"yarte_parser/src/lib.rs","rank":35,"score":242168.98778072908},{"content":"#[inline]\n\npub fn get_body_ident() -> Ident {\n\n format_ident!(\"__ybody\")\n\n}\n\n\n","file_path":"yarte_codegen/src/wasm/client/utils.rs","rank":36,"score":241464.60382482153},{"content":"#[inline]\n\npub fn get_t_root_ident() -> Ident {\n\n const T_ROOT: &str = \"t_root\";\n\n format_ident!(\"{}\", T_ROOT)\n\n}\n\n\n","file_path":"yarte_codegen/src/wasm/client/utils.rs","rank":37,"score":241458.37848605064},{"content":"pub fn get_number_u8(bits: Vec<bool>) -> u8 {\n\n let mut n = 0;\n\n for (i, b) in bits.into_iter().enumerate() {\n\n if b {\n\n n += 1 << i as u8\n\n }\n\n }\n\n n\n\n}\n\n\n","file_path":"yarte_codegen/src/wasm/client/utils.rs","rank":38,"score":236596.23847459292},{"content":"pub fn get_number_u16(bits: Vec<bool>) -> u16 {\n\n let mut n = 0;\n\n for (i, b) in bits.into_iter().enumerate() {\n\n if b {\n\n n += 1 << i as u16\n\n }\n\n }\n\n n\n\n}\n\n\n","file_path":"yarte_codegen/src/wasm/client/utils.rs","rank":39,"score":236596.23847459292},{"content":"fn expr_partial_block(c: Cursor, lws: bool) -> PResult<Node> {\n\n do_parse!(\n\n c,\n\n ws >> tag!(PARTIAL_BLOCK) >> rws: end_expr >> (Node::Block((lws, rws)))\n\n )\n\n}\n\n\n","file_path":"yarte_parser/src/lib.rs","rank":40,"score":235101.23790218367},{"content":"fn serialize_domfmt(sink: Sink, mut ir: Vec<HIR>, opts: SerializerOpt) -> ParseResult<Vec<HIR>> {\n\n let mut writer = Vec::new();\n\n serialize(&mut writer, sink.into(), opts).expect(\"some serialize node\");\n\n\n\n let html = String::from_utf8(writer).expect(\"\");\n\n let mut chunks = html.split(MARK).peekable();\n\n\n\n if let Some(first) = chunks.peek() {\n\n if first.is_empty() {\n\n chunks.next();\n\n }\n\n }\n\n let mut ir = ir.drain(..).filter(|x| match x {\n\n HIR::Lit(_) => false,\n\n _ => true,\n\n });\n\n\n\n let mut buff = vec![];\n\n for chunk in chunks {\n\n if chunk.is_empty() {\n","file_path":"yarte_dom/src/dom_fmt.rs","rank":41,"score":233130.23318307282},{"content":"#[inline]\n\nfn _io_big_table<W: std::io::Write>(f: &mut W, table: &Vec<Vec<usize>>) -> std::io::Result<()> {\n\n f.write_all(b\"<table>\")?;\n\n for i in table {\n\n f.write_all(b\"<tr>\")?;\n\n for j in i {\n\n f.write_all(b\"<td>\")?;\n\n write!(f, \"{}\", j)?;\n\n f.write_all(b\"</td>\")?;\n\n }\n\n f.write_all(b\"</tr>\")?;\n\n }\n\n f.write_all(b\"</table>\")\n\n}\n\n\n","file_path":"benches/src/all.rs","rank":42,"score":230621.97527177812},{"content":"/// A constructor for an element.\n\n///\n\n/// # Examples\n\n///\n\n/// Create an element like `<div class=\"test-class-name\"></div>`:\n\npub fn create_element<Sink>(sink: &mut Sink, name: QualName, attrs: Vec<Attribute>) -> Sink::Handle\n\nwhere\n\n Sink: TreeSink,\n\n{\n\n let mut flags = ElementFlags::default();\n\n match name.expanded() {\n\n expanded_name!(html \"template\") => flags.template = true,\n\n expanded_name!(mathml \"annotation-xml\") => {\n\n flags.mathml_annotation_xml_integration_point = attrs.iter().any(|attr| {\n\n attr.name.expanded() == expanded_name!(\"\", \"encoding\")\n\n && (attr.value.eq_ignore_ascii_case(\"text/html\")\n\n || attr.value.eq_ignore_ascii_case(\"application/xhtml+xml\"))\n\n })\n\n }\n\n _ => {}\n\n }\n\n sink.create_element(name, attrs, flags)\n\n}\n\n\n","file_path":"yarte_html/src/interface.rs","rank":43,"score":230528.2985799085},{"content":"pub fn is_marquee(name: &QualName) -> bool {\n\n YARTE_TAG.with(|x| *x.local == *name.local)\n\n}\n\n\n","file_path":"yarte_html/src/tree_builder/mod.rs","rank":44,"score":221316.08045231982},{"content":"pub fn parse_id(s: &str) -> Option<u32> {\n\n if &s[..S_LEN] == S && s[S_LEN..].chars().all(|x| x.is_ascii_hexdigit()) {\n\n u32::from_str_radix(&s[S_LEN..], 16).ok()\n\n } else {\n\n None\n\n }\n\n}\n\n\n","file_path":"yarte_html/src/utils.rs","rank":45,"score":220947.16641494058},{"content":"fn expand_match_token_macro(match_token: MatchToken) -> TokenStream {\n\n let mut arms = match_token.arms;\n\n let to_be_matched = match_token.ident;\n\n // Handle the last arm specially at the end.\n\n let last_arm = arms.pop().unwrap();\n\n\n\n // Tags we've seen, used for detecting duplicates.\n\n let mut seen_tags: HashSet<Tag> = HashSet::new();\n\n\n\n // Case arms for wildcard matching. We collect these and\n\n // emit them later.\n\n let mut wildcards_patterns: Vec<TokenStream> = Vec::new();\n\n let mut wildcards_expressions: Vec<syn::Expr> = Vec::new();\n\n\n\n // Tags excluded (by an 'else' RHS) from wildcard matching.\n\n let mut wild_excluded_patterns: Vec<TokenStream> = Vec::new();\n\n\n\n let mut arms_code = Vec::new();\n\n\n\n for MatchTokenArm { binding, lhs, rhs } in arms {\n","file_path":"yarte_html/macros/match_token.rs","rank":46,"score":220692.5703609248},{"content":"pub fn get_component<'a, I: Iterator<Item = &'a Node>>(\n\n id: ExprId,\n\n doc: I,\n\n builder: &mut WASMCodeGen,\n\n) -> Ident {\n\n ComponentBuilder::new(id, builder).build(doc)\n\n}\n\n\n\nconst HEAD: &str = \"__n__\";\n\n\n","file_path":"yarte_codegen/src/wasm/client/component.rs","rank":47,"score":219831.44353178793},{"content":"#[allow(unused_variables)]\n\nfn get_closure(msg: &syn::Expr) -> (TokenStream, TokenStream) {\n\n use syn::Expr::*;\n\n let (msg, cloned) = match msg {\n\n Path(ExprPath { attrs, qself, path }) => (quote!(#msg), quote!()),\n\n Call(ExprCall {\n\n attrs, func, args, ..\n\n }) => {\n\n let mut new: Punctuated<Ident, Token![,]> = Punctuated::new();\n\n let mut cloned = TokenStream::new();\n\n for (count, arg) in args.iter().enumerate() {\n\n let ident = format_ident!(\"__cloned__{}\", count);\n\n cloned.extend(quote!(let #ident = (#arg).clone();));\n\n new.push(ident);\n\n }\n\n (quote!(#func(#new)), cloned)\n\n }\n\n Struct(ExprStruct {\n\n attrs,\n\n path,\n\n fields,\n","file_path":"yarte_codegen/src/wasm/client/events.rs","rank":48,"score":219640.31919343869},{"content":"pub fn get_mark_id(s: &str) -> Option<u32> {\n\n if is_mark(s) {\n\n u32::from_str_radix(&s[MARK_LEN + S_LEN..], 16).ok()\n\n } else {\n\n None\n\n }\n\n}\n\n\n\n#[cfg(test)]\n\n#[allow(non_snake_case)]\n\nmod test {\n\n use super::{is_ascii_alnum, lower_ascii_letter};\n\n use mac::test_eq;\n\n\n\n test_eq!(lower_letter_a_is_a, lower_ascii_letter('a'), Some('a'));\n\n test_eq!(lower_letter_A_is_a, lower_ascii_letter('A'), Some('a'));\n\n test_eq!(lower_letter_symbol_is_None, lower_ascii_letter('!'), None);\n\n test_eq!(\n\n lower_letter_nonascii_is_None,\n\n lower_ascii_letter('\\u{a66e}'),\n\n None\n\n );\n\n\n\n test_eq!(is_alnum_a, is_ascii_alnum('a'), true);\n\n test_eq!(is_alnum_A, is_ascii_alnum('A'), true);\n\n test_eq!(is_alnum_1, is_ascii_alnum('1'), true);\n\n test_eq!(is_not_alnum_symbol, is_ascii_alnum('!'), false);\n\n test_eq!(is_not_alnum_nonascii, is_ascii_alnum('\\u{a66e}'), false);\n\n}\n","file_path":"yarte_html/src/utils.rs","rank":49,"score":217216.59898790787},{"content":"#[inline(always)]\n\npub fn default_scope(name: ExpandedName) -> bool {\n\n html_default_scope(name)\n\n || mathml_text_integration_point(name)\n\n || svg_html_integration_point(name)\n\n}\n\n\n\ndeclare_tag_set!(pub list_item_scope = [default_scope] + \"ol\" \"ul\");\n\ndeclare_tag_set!(pub button_scope = [default_scope] + \"button\");\n\n\n\ndeclare_tag_set!(pub cursory_implied_end =\n\n \"dd\" \"dt\" \"li\" \"option\" \"optgroup\" \"p\" \"rb\" \"rp\" \"rt\" \"rtc\");\n\n\n\ndeclare_tag_set!(pub heading_tag = \"h1\" \"h2\" \"h3\" \"h4\" \"h5\" \"h6\");\n\n\n\ndeclare_tag_set!(pub special_tag =\n\n \"address\" \"applet\" \"area\" \"article\" \"aside\" \"base\" \"basefont\" \"bgsound\" \"blockquote\" \"body\"\n\n \"br\" \"button\" \"caption\" \"center\" \"col\" \"colgroup\" \"dd\" \"details\" \"dir\" \"div\" \"dl\" \"dt\" \"embed\"\n\n \"fieldset\" \"figcaption\" \"figure\" \"footer\" \"form\" \"frame\" \"frameset\" \"h1\" \"h2\" \"h3\" \"h4\" \"h5\"\n\n \"h6\" \"head\" \"header\" \"hgroup\" \"hr\" \"html\" \"iframe\" \"img\" \"input\" \"isindex\" \"li\" \"link\"\n\n \"listing\" \"main\" \"marquee\" \"menu\" \"meta\" \"nav\" \"noembed\" \"noframes\" \"noscript\"\n\n \"object\" \"ol\" \"p\" \"param\" \"plaintext\" \"pre\" \"script\" \"section\" \"select\" \"source\" \"style\"\n\n \"summary\" \"table\" \"tbody\" \"td\" \"template\" \"textarea\" \"tfoot\" \"th\" \"thead\" \"title\" \"tr\" \"track\"\n\n \"ul\" \"wbr\" \"xmp\");\n\n//§ END\n\n\n","file_path":"yarte_html/src/tree_builder/tag_sets.rs","rank":50,"score":216558.99207256292},{"content":"pub fn parse_fragment(doc: &str) -> ParseResult<Sink> {\n\n let parser = driver::parse_fragment(Sink::default(), get_marquee(), vec![]).from_utf8();\n\n parser.one(doc.as_bytes()).and_then(|mut a| {\n\n a.nodes\n\n .remove(&0)\n\n .and_then(|_| {\n\n if let Some(ParseElement::Node { name, .. }) = a.nodes.get_mut(&2) {\n\n *name = get_marquee();\n\n Some(a)\n\n } else {\n\n None\n\n }\n\n })\n\n .ok_or_else(Vec::new)\n\n })\n\n}\n","file_path":"yarte_dom/src/sink.rs","rank":51,"score":213569.1285956973},{"content":"fn tokens(i: TokenStream, wlog: bool) -> String {\n\n let config = &Config::new(\"\");\n\n let der = parse2(i).unwrap();\n\n let s = visit_derive(&der, config).unwrap();\n\n let mut src = BTreeMap::new();\n\n src.insert(s.path.clone(), s.src.clone());\n\n let sources = parse(get_cursor(&s.path, &s.src)).unwrap();\n\n let mut ctx = BTreeMap::new();\n\n ctx.insert(&s.path, sources);\n\n\n\n let ir = generate(config, &s, &ctx, Default::default())\n\n .unwrap_or_else(|e| emitter(&src, config, e.into_iter()));\n\n clean();\n\n\n\n let res = WASMCodeGen::new(&s).gen(ir).to_string();\n\n if wlog {\n\n log(&res, \"Test\".into(), &config.debug);\n\n }\n\n res\n\n}\n\n\n","file_path":"yarte_codegen/src/wasm/client/tests/mod.rs","rank":52,"score":212626.9150366335},{"content":"/// Parse syn expression comma separated list\n\nfn eat_expr_list(i: &str) -> Result<Vec<Expr>, MiddleError> {\n\n parse_str::<ExprList>(i)\n\n .map(Into::into)\n\n .map_err(|e| MiddleError::new(i, e))\n\n}\n\n\n","file_path":"yarte_parser/src/lib.rs","rank":53,"score":208587.61611025035},{"content":"#[inline(always)]\n\npub fn empty_set(_: ExpandedName) -> bool {\n\n false\n\n}\n\n\n\ndeclare_tag_set!(pub html_default_scope =\n\n \"applet\" \"caption\" \"html\" \"table\" \"td\" \"th\" \"marquee\" \"object\" \"template\");\n\n\n","file_path":"yarte_html/src/tree_builder/tag_sets.rs","rank":54,"score":206593.55440433102},{"content":"fn build_teams() -> Vec<Team> {\n\n vec![\n\n Team {\n\n name: \"Jiangsu\".into(),\n\n score: 43,\n\n },\n\n Team {\n\n name: \"Beijing\".into(),\n\n score: 27,\n\n },\n\n Team {\n\n name: \"Guangzhou\".into(),\n\n score: 22,\n\n },\n\n Team {\n\n name: \"Shandong\".into(),\n\n score: 12,\n\n },\n\n ]\n\n}\n\n\n","file_path":"benches/src/all.rs","rank":55,"score":203901.75017268548},{"content":"fn to_domfmt_init(ir: Vec<HIR>) -> ParseResult<Vec<HIR>> {\n\n let html = get_html(&ir);\n\n let sink = match parse_document(&html) {\n\n Ok(a) => a,\n\n Err(_) => parse_fragment(&html)?,\n\n };\n\n\n\n serialize_domfmt(sink, ir, Default::default())\n\n}\n\n\n","file_path":"yarte_dom/src/dom_fmt.rs","rank":56,"score":201625.8539472382},{"content":"pub fn get_leaf_text(children: Document, solver: &Solver) -> (BTreeSet<VarId>, TokenStream) {\n\n LeafTextBuilder::new(solver).build(children)\n\n}\n\n\n","file_path":"yarte_codegen/src/wasm/client/leaf_text.rs","rank":57,"score":201584.45367562753},{"content":"#[inline]\n\nfn at_helper(i: Cursor, lws: bool) -> PResult<Node> {\n\n let (c, (name, args, rws)) = do_parse!(\n\n i,\n\n ws >> tag!(\"@\")\n\n >> name: call!(spanned, identifier)\n\n >> args: args_list\n\n >> rws: end_expr\n\n >> ((name, args, rws))\n\n )?;\n\n\n\n macro_rules! check_args_len {\n\n ($len:expr) => {\n\n if args.t().len() != $len {\n\n return Err(LexError::Fail(PError::AtHelperArgsLen($len), args.span()));\n\n }\n\n };\n\n }\n\n match *name.t() {\n\n JSON => {\n\n check_args_len!(1);\n","file_path":"yarte_parser/src/lib.rs","rank":58,"score":201392.16200866314},{"content":"/// Eat safe Node\n\nfn safe(i: Cursor, lws: bool) -> PResult<Node> {\n\n let mut at = 0;\n\n let (c, rws, s) = loop {\n\n if let Some(j) = i.adv_find(at, '}') {\n\n let n = &i.rest[at + j + 1..];\n\n if n.starts_with(\"~}}\") {\n\n break (i.adv(at + j + 4), true, &i.rest[..at + j]);\n\n } else if n.starts_with(\"}}\") {\n\n break (i.adv(at + j + 3), false, &i.rest[..at + j]);\n\n }\n\n\n\n at += j + 1;\n\n } else {\n\n return Err(LexError::Next(PError::Safe(DOption::None), Span::from(i)));\n\n }\n\n };\n\n\n\n let (_, s, _) = trim(s);\n\n eat_expr(s)\n\n .map(|e| {\n","file_path":"yarte_parser/src/lib.rs","rank":59,"score":201391.95357238268},{"content":"/// Eat raw Node\n\nfn raw(i: Cursor, a_lws: bool) -> PResult<Node> {\n\n let (i, a_rws) = end_expr(i)?;\n\n let mut at = 0;\n\n\n\n let (c, (j, b_ws)) = loop {\n\n if let Some(j) = i.adv_find(at, '{') {\n\n let n = i.adv(at + j + 1);\n\n if n.chars().next().map(|x| '{' == x).unwrap_or(false) {\n\n if let Ok((c, ws)) = do_parse!(\n\n n.adv(1),\n\n lws: opt!(tag!(\"~\")) >> tag!(\"/R\") >> rws: end_expr >> ((lws.is_some(), rws))\n\n ) {\n\n break (c, (&i.rest[..at + j], ws));\n\n } else {\n\n at += j + 4;\n\n }\n\n } else {\n\n at += j + 1;\n\n }\n\n } else {\n","file_path":"yarte_parser/src/lib.rs","rank":60,"score":201391.95357238268},{"content":"/// Eat helper Node\n\nfn hel(i: Cursor, a_lws: bool) -> PResult<Node> {\n\n if i.starts_with(\">\") {\n\n return partial_block(i.adv(1), a_lws).map(|(c, x)| (c, Node::PartialBlock(x)));\n\n }\n\n\n\n let (i, (above_ws, ident, args)) = do_parse!(\n\n i,\n\n ws >> ident: call!(spanned, identifier)\n\n >> args: arguments\n\n >> rws: end_expr\n\n >> (((a_lws, rws), ident, args))\n\n )?;\n\n\n\n if ident.0.eq(\"if\") {\n\n return if_else(above_ws, i, args);\n\n }\n\n\n\n let (c, (below_ws, block, c_ident)) = do_parse!(\n\n i,\n\n block: eat\n","file_path":"yarte_parser/src/lib.rs","rank":61,"score":201391.95357238268},{"content":"fn res(c: Cursor, lws: bool) -> PResult<Node> {\n\n do_parse!(\n\n c,\n\n ws >> expr: arguments >> rws: end_expr >> (Node::RExpr((lws, rws), expr))\n\n )\n\n}\n\n\n\n/// Wrap Partial into the Node\n","file_path":"yarte_parser/src/lib.rs","rank":62,"score":201386.68999182188},{"content":"fn write_bb(b: &[u8], buf: &TokenStream) -> TokenStream {\n\n b.iter()\n\n .enumerate()\n\n .map(|(i, b)| {\n\n quote! {\n\n *#buf.buf_ptr().add(#i) = #b;\n\n }\n\n })\n\n .flatten()\n\n .collect()\n\n}\n\n\n\npub struct HTMLBytesCodeGen<'a> {\n\n buf: &'a syn::Expr,\n\n}\n\n\n\nimpl<'a> HTMLBytesCodeGen<'a> {\n\n pub fn new(buf: &syn::Expr) -> HTMLBytesCodeGen {\n\n HTMLBytesCodeGen { buf }\n\n }\n","file_path":"yarte_codegen/src/bytes.rs","rank":63,"score":196672.3116659344},{"content":"fn make_tag_pattern(binding: &TokenStream, tag: Tag) -> TokenStream {\n\n let kind = match tag.kind {\n\n TagKind::StartTag => quote!(crate::tokenizer::StartTag),\n\n TagKind::EndTag => quote!(crate::tokenizer::EndTag),\n\n };\n\n let name_field = if let Some(name) = tag.name {\n\n let name = name.to_string();\n\n quote!(name: y_name!(#name),)\n\n } else {\n\n quote!()\n\n };\n\n quote! {\n\n crate::tree_builder::types::TagToken(#binding crate::tokenizer::Tag { kind: #kind, #name_field .. })\n\n }\n\n}\n","file_path":"yarte_html/macros/match_token.rs","rank":64,"score":195793.97248582955},{"content":"fn eat_partials(mut i: Cursor) -> PResult<Vec<Partial>> {\n\n let mut nodes = vec![];\n\n\n\n loop {\n\n if let Some(j) = i.find('{') {\n\n macro_rules! _switch {\n\n ($n:expr, $t:expr, $ws:expr) => {\n\n match $n {\n\n b'>' => {\n\n let i = i.adv(j + 3 + $t);\n\n match partial_block(i, $ws) {\n\n Ok((i, n)) => {\n\n nodes.push(n);\n\n i\n\n }\n\n Err(e @ LexError::Fail(..)) => break Err(e),\n\n Err(LexError::Next(..)) => i,\n\n }\n\n }\n\n b'R' => {\n","file_path":"yarte_parser/src/pre_partials.rs","rank":65,"score":195649.8728981492},{"content":"#[inline]\n\nfn if_else(abode_ws: Ws, i: Cursor, args: SExpr) -> PResult<Node> {\n\n let mut nodes = vec![];\n\n let mut tail = None;\n\n\n\n let (mut i, first) = eat_if(i)?;\n\n\n\n loop {\n\n if let Ok((c, lws)) = do_parse!(\n\n i,\n\n lws: opt!(tag!(\"~\")) >> ws >> tag!(ELSE) >> (lws.is_some())\n\n ) {\n\n if let Ok((c, _)) = tag!(skip_ws(c), IF) {\n\n let (c, b) = map_fail!(do_parse!(\n\n c,\n\n ws >> args: arguments\n\n >> rws: end_expr\n\n >> block: eat_if\n\n >> (((lws, rws), args, block))\n\n ))?;\n\n nodes.push(b);\n","file_path":"yarte_parser/src/lib.rs","rank":66,"score":195258.60452733014},{"content":"#[proc_macro]\n\npub fn zip_with_spaces(token: TokenStream) -> TokenStream {\n\n let expr: ExprList = parse(token).unwrap();\n\n let expr: Vec<Vec<String>> = expr.into();\n\n let mut expr = expr.iter();\n\n let first = expr.next().expect(\"Need minimum two element\");\n\n let mut buff = vec![];\n\n for i in first {\n\n _zip(i, &mut expr.clone(), &mut buff)\n\n }\n\n let len = buff.len();\n\n\n\n quote!(static ZIPPED: [&str; #len] = [#(#buff),*];).into()\n\n}\n\n\n","file_path":"yarte_wasm_app/benches/codegen/src/lib.rs","rank":67,"score":193898.83467211915},{"content":"#[inline]\n\npub fn get_self_id() -> u64 {\n\n SELF_ID.with(|x| *x)\n\n}\n\n\n","file_path":"yarte_codegen/src/wasm/client/utils.rs","rank":68,"score":192810.44938961728},{"content":"fn is_ident_start(c: char) -> bool {\n\n ('a' <= c && c <= 'z')\n\n || ('A' <= c && c <= 'Z')\n\n || c == '_'\n\n || (c > '\\x7f' && UnicodeXID::is_xid_start(c))\n\n}\n\n\n","file_path":"yarte_parser/src/lib.rs","rank":69,"score":192590.184692809},{"content":"fn is_ident_continue(c: char) -> bool {\n\n ('a' <= c && c <= 'z')\n\n || ('A' <= c && c <= 'Z')\n\n || c == '_'\n\n || ('0' <= c && c <= '9')\n\n || (c > '\\x7f' && UnicodeXID::is_xid_continue(c))\n\n}\n\n\n","file_path":"yarte_parser/src/lib.rs","rank":70,"score":192590.184692809},{"content":"fn to_domfmt(ir: Vec<HIR>, opts: SerializerOpt) -> ParseResult<Vec<HIR>> {\n\n let html = get_html(&ir);\n\n serialize_domfmt(parse_fragment(&html)?, ir, opts)\n\n}\n\n\n","file_path":"yarte_dom/src/dom_fmt.rs","rank":71,"score":191988.68022267864},{"content":"fn write_bb(b: &[u8]) -> TokenStream {\n\n b.iter()\n\n .enumerate()\n\n .map(|(i, b)| {\n\n quote! {\n\n *buf_ptr!().add(buf_cur + #i) = #b;\n\n }\n\n })\n\n .flatten()\n\n .collect()\n\n}\n\n\n\nimpl<'a, T: CodeGen> CodeGen for FixedCodeGen<'a, T> {\n\n fn gen(&mut self, v: Vec<HIR>) -> TokenStream {\n\n let mut tokens = TokenStream::new();\n\n\n\n self.template(v, &mut tokens);\n\n\n\n tokens\n\n }\n","file_path":"yarte_codegen/src/fixed.rs","rank":72,"score":189130.2472921813},{"content":"pub fn is_mark(s: &str) -> bool {\n\n s.len() == MARK_LEN + HASH_LEN && &s[..MARK_LEN] == MARK && parse_id(&s[MARK_LEN..]).is_some()\n\n}\n\n\n","file_path":"yarte_html/src/utils.rs","rank":73,"score":188498.4307690896},{"content":"fn write_3_bytes_bb(b: &mut criterion::Bencher) {\n\n const BYTES: usize = 3;\n\n unsafe {\n\n b.iter(|| {\n\n const LEN: usize = BYTES * STEPS;\n\n let mut buf: [u8; LEN] = MaybeUninit::uninit().assume_init();\n\n let mut curr = 0;\n\n let buf_ptr = buf.as_mut_ptr();\n\n for _ in 0..STEPS {\n\n if LEN < curr + BYTES {\n\n panic!(\"buffer overflow\");\n\n } else {\n\n *buf_ptr.add(curr) = b'a';\n\n *buf_ptr.add(curr + 1) = b'a';\n\n *buf_ptr.add(curr + 2) = b'a';\n\n curr += BYTES;\n\n }\n\n }\n\n black_box(&buf[..curr]);\n\n })\n\n }\n\n}\n\n\n","file_path":"benches/src/all.rs","rank":74,"score":188081.02976334246},{"content":"/// Is the character an ASCII alphanumeric character?\n\npub fn is_ascii_alnum(c: char) -> bool {\n\n matches!(c, '0'..='9' | 'a'..='z' | 'A'..='Z')\n\n}\n\n\n","file_path":"yarte_html/src/utils.rs","rank":75,"score":185439.5064912872},{"content":"/// ASCII whitespace characters, as defined by\n\n/// tree construction modes that treat them specially.\n\npub fn is_ascii_whitespace(c: char) -> bool {\n\n matches!(c, '\\t' | '\\r' | '\\n' | '\\x0C' | ' ')\n\n}\n\n\n\npub const MARK: &str = \"yartehashhtmlexpressionsattt\";\n\nconst MARK_LEN: usize = MARK.len();\n\nconst S: &str = \"0x\";\n\nconst S_LEN: usize = S.len();\n\n// 0x00_00_00_00\n\npub const HASH_LEN: usize = 10;\n\n\n","file_path":"yarte_html/src/utils.rs","rank":76,"score":185439.5064912872},{"content":"fn parse(rest: &str) -> Vec<SNode> {\n\n _parse(Cursor { rest, off: 0 }).unwrap()\n\n}\n\n\n","file_path":"yarte_parser/src/test.rs","rank":77,"score":182650.03100207425},{"content":"/// Eat whitespace flag in end of expressions `.. }}` or `.. ~}}`\n\nfn end_expr(i: Cursor) -> PResult<bool> {\n\n let c = skip_ws(i);\n\n if c.starts_with(\"~}}\") {\n\n Ok((c.adv(3), true))\n\n } else if c.starts_with(\"}}\") {\n\n Ok((c.adv(2), false))\n\n } else {\n\n Err(LexError::Fail(\n\n PError::EndExpression,\n\n Span::from_cursor(i, c),\n\n ))\n\n }\n\n}\n\n\n","file_path":"yarte_parser/src/lib.rs","rank":78,"score":182536.60386503692},{"content":"fn big_table(b: &mut criterion::Bencher, size: usize) {\n\n let t = BigTable {\n\n table: build_big_table(size),\n\n };\n\n b.iter(|| t.call().unwrap());\n\n}\n\n\n","file_path":"benches/src/all.rs","rank":79,"score":178306.91834108363},{"content":"#[test]\n\nfn test_with_index() {\n\n let t = WithSuperIndexTemplate {\n\n this: &[Holder { hold: 127 }],\n\n };\n\n assert_eq!(\"Hello, 1271271!\", t.call().unwrap());\n\n}\n","file_path":"yarte/tests/super.rs","rank":80,"score":176410.7416287016},{"content":"#[test]\n\nfn test_with_fields() {\n\n let t = WithFieldsTemplate {\n\n names: (\n\n Name {\n\n first: \"foo\",\n\n last: \"bar\",\n\n },\n\n Name {\n\n first: \"fOO\",\n\n last: \"bAR\",\n\n },\n\n ),\n\n };\n\n assert_eq!(\"Hello, foo bar and fOO bAR!\", t.call().unwrap());\n\n}\n\n\n","file_path":"yarte/tests/expressions.rs","rank":81,"score":176255.46263745846},{"content":"#[test]\n\nfn test_let_if_some() {\n\n let t = LetIfSomeTemplate { cond: Some(false) };\n\n assert_eq!(\"Hello, bar!\", t.call().unwrap());\n\n}\n\n\n","file_path":"yarte/tests/expressions.rs","rank":82,"score":176185.78980165158},{"content":"#[test]\n\nfn test_let_with() {\n\n let t = LetWithTemplate { name: \"world\" };\n\n assert_eq!(\"Hello, worldworld!\", t.call().unwrap());\n\n}\n\n\n","file_path":"yarte/tests/expressions.rs","rank":83,"score":176185.78980165158},{"content":"#[test]\n\nfn test_let_if() {\n\n let t = LetIfTemplate { cond: true };\n\n assert_eq!(\"Hello, true false foo!\", t.call().unwrap());\n\n}\n\n\n","file_path":"yarte/tests/expressions.rs","rank":84,"score":176185.78980165158},{"content":"#[test]\n\nfn test_let() {\n\n let t = LetTemplate { name: \"world\" };\n\n assert_eq!(\"Hello, world!\", t.call().unwrap());\n\n}\n\n\n","file_path":"yarte/tests/expressions.rs","rank":85,"score":176185.78980165158},{"content":"#[test]\n\nfn test_match() {\n\n let t = MatchTemplate { a: Err(Error) };\n\n assert_eq!(\"&\", t.call().unwrap());\n\n\n\n let t = MatchTemplate { a: Ok(\"1\") };\n\n assert_eq!(\"1\", t.call().unwrap());\n\n}\n\n\n","file_path":"yarte/tests/expressions.rs","rank":86,"score":176157.78647271486},{"content":"fn io_big_table(b: &mut criterion::Bencher, size: usize) {\n\n let table = build_big_table(size);\n\n let mut buf = vec![];\n\n let _ = _io_big_table(&mut buf, &table);\n\n let len = buf.len();\n\n b.iter(|| {\n\n let mut buf = Vec::with_capacity(len);\n\n _io_big_table(&mut buf, &table).unwrap();\n\n buf\n\n });\n\n}\n\n\n","file_path":"benches/src/all.rs","rank":87,"score":175392.73490759052},{"content":"fn fixed_big_table(b: &mut criterion::Bencher, size: usize) {\n\n let t = BigTableF {\n\n table: build_big_table(size),\n\n };\n\n b.iter(|| {\n\n black_box(unsafe { t.call(&mut [MaybeUninit::uninit(); 109915]) }.unwrap());\n\n });\n\n}\n\n\n","file_path":"benches/src/all.rs","rank":88,"score":175392.73490759052},{"content":"fn bytes_big_table(b: &mut criterion::Bencher, size: usize) {\n\n let t = BigTableB {\n\n table: build_big_table(size),\n\n };\n\n b.iter(|| t.call::<BytesMut>(109915));\n\n}\n\n\n","file_path":"benches/src/all.rs","rank":89,"score":175392.73490759052},{"content":"fn big_table_text(b: &mut criterion::Bencher, size: usize) {\n\n let t = BigTableDisplay {\n\n table: build_big_table(size),\n\n };\n\n b.iter(|| t.call().unwrap());\n\n}\n\n\n\n// Bytes\n","file_path":"benches/src/all.rs","rank":90,"score":175392.73490759052},{"content":"fn fmt_big_table(b: &mut criterion::Bencher, size: usize) {\n\n let t = BigTableFmt {\n\n table: build_big_table(size),\n\n };\n\n let mut buf = String::with_capacity(t.to_string().len());\n\n b.iter(|| {\n\n buf.clear();\n\n write!(buf, \"{}\", t).unwrap();\n\n });\n\n}\n\n\n","file_path":"benches/src/all.rs","rank":91,"score":175392.73490759052},{"content":"fn raw_big_table(b: &mut criterion::Bencher, size: usize) {\n\n unsafe {\n\n let table = build_big_table(size);\n\n const LEN: usize = 109915;\n\n\n\n b.iter(|| {\n\n let mut buf: [u8; LEN] = MaybeUninit::uninit().assume_init();\n\n let mut curr = 0;\n\n macro_rules! buf_ptr {\n\n () => {\n\n &mut buf as *mut _ as *mut u8\n\n };\n\n }\n\n\n\n macro_rules! write_b {\n\n ($b:expr) => {\n\n if LEN < curr + $b.len() {\n\n panic!(\"buffer overflow\");\n\n } else {\n\n for i in $b {\n","file_path":"benches/src/all.rs","rank":92,"score":175392.73490759052},{"content":"pub fn check_attr_is_text(attr: Attribute) -> bool {\n\n attr.value.len() == 1\n\n && match attr.value[0] {\n\n ExprOrText::Text(..) => true,\n\n ExprOrText::Expr(..) => false,\n\n }\n\n}\n\n\n","file_path":"yarte_codegen/src/wasm/client/utils.rs","rank":93,"score":174527.71040102688},{"content":"pub fn parse_document(doc: &str) -> ParseResult<Sink> {\n\n let parser = driver::parse_document(Sink::default()).from_utf8();\n\n\n\n parser.one(doc.as_bytes())\n\n}\n\n\n","file_path":"yarte_dom/src/sink.rs","rank":94,"score":173700.6099892016},{"content":"#[inline]\n\npub fn is_inner(attrs: &[syn::Attribute]) -> bool {\n\n attrs.iter().any(|attr| attr.path.is_ident(\"inner\"))\n\n}\n\n\n","file_path":"yarte_codegen/src/wasm/client/utils.rs","rank":95,"score":173534.0937544771},{"content":"fn run_n(app: &mut NonKeyed, n: usize) {\n\n let update_n = min(n, app.data.len());\n\n\n\n // ?? #macro mark_data_update(for i in\n\n for (i, (dom, row)) in app\n\n .tbody_children\n\n .iter_mut()\n\n .zip(app.data.iter_mut())\n\n .enumerate()\n\n .take(update_n)\n\n {\n\n row.id = app.id + i as usize;\n\n row.label = (*ZIPPED.choose(&mut app.rng).unwrap()).to_string();\n\n // or #macro mark_data_\n\n dom.t_root = 0xFF;\n\n // /macro\n\n }\n\n // /macro\n\n\n\n for i in update_n..n {\n","file_path":"yarte_wasm_app/benches/src/handler.rs","rank":96,"score":173117.58982431918},{"content":"#[test]\n\nfn test_self_method() {\n\n let t = SelfMethodTemplate { s: \"foo\" };\n\n assert_eq!(t.call().unwrap(), \"foo\");\n\n}\n\n\n","file_path":"yarte/tests/expressions.rs","rank":97,"score":172700.41347005198},{"content":"#[test]\n\nfn test_let_else_if_some() {\n\n let t = LetElseIfSomeTemplate {\n\n cond: Some(false),\n\n check: Some(false),\n\n };\n\n assert_eq!(\"Hello, bar!\", t.call().unwrap());\n\n let t = LetElseIfSomeTemplate {\n\n cond: Some(true),\n\n check: Some(false),\n\n };\n\n assert_eq!(\"Hello, foo!\", t.call().unwrap());\n\n let t = LetElseIfSomeTemplate {\n\n cond: None,\n\n check: Some(true),\n\n };\n\n assert_eq!(\"Hello, baa!\", t.call().unwrap());\n\n let t = LetElseIfSomeTemplate {\n\n cond: None,\n\n check: Some(false),\n\n };\n\n assert_eq!(\"Hello, fun!\", t.call().unwrap());\n\n let t = LetElseIfSomeTemplate {\n\n cond: None,\n\n check: None,\n\n };\n\n assert_eq!(\"Hello, None!\", t.call().unwrap());\n\n}\n\n\n","file_path":"yarte/tests/expressions.rs","rank":98,"score":172635.92956636127},{"content":"#[test]\n\nfn test_let_closure() {\n\n let t = LetClosureTemplate { name: \"world\" };\n\n assert_eq!(\"worldworld\", t.call().unwrap());\n\n}\n\n\n","file_path":"yarte/tests/expressions.rs","rank":99,"score":172635.92956636127}],"string":"[\n {\n \"content\": \"pub fn resolve_if_block<'a>(expr: &'a Expr, id: usize, builder: &'a mut DOMBuilder) -> Vec<VarId> {\\n\\n ResolveIf::new(builder, id).resolve(expr)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"yarte_dom/src/dom/resolve.rs\",\n \"rank\": 0,\n \"score\": 414137.18538381014\n },\n {\n \"content\": \"#[inline]\\n\\npub fn get_component_ty_ident(id: ExprId) -> Ident {\\n\\n const TY: &str = \\\"YComponent\\\";\\n\\n format_ident!(\\\"{}{}\\\", TY, id)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"yarte_codegen/src/wasm/client/utils.rs\",\n \"rank\": 1,\n \"score\": 408357.4633154533\n },\n {\n \"content\": \"#[inline]\\n\\npub fn get_table_dom_ident(id: ExprId) -> Ident {\\n\\n const TABLE_DOM: &str = \\\"__ytable_dom__\\\";\\n\\n format_ident!(\\\"{}{}\\\", TABLE_DOM, id)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"yarte_codegen/src/wasm/client/utils.rs\",\n \"rank\": 2,\n \"score\": 408125.95136279624\n },\n {\n \"content\": \"pub fn resolve_expr<'a>(expr: &'a Expr, builder: &'a mut DOMBuilder) -> Vec<VarId> {\\n\\n ResolveExpr::new(builder).resolve(expr)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"yarte_dom/src/dom/resolve.rs\",\n \"rank\": 3,\n \"score\": 405610.81656452577\n },\n {\n \"content\": \"#[inline]\\n\\npub fn get_vdom_ident(id: ExprId) -> Ident {\\n\\n const ELEM: &str = \\\"__dom__\\\";\\n\\n format_ident!(\\\"{}{}\\\", ELEM, id)\\n\\n}\\n\\n\\n\\n#[inline]\\n\",\n \"file_path\": \"yarte_codegen/src/wasm/client/utils.rs\",\n \"rank\": 4,\n \"score\": 375531.79158537457\n },\n {\n \"content\": \"#[inline]\\n\\npub fn get_table_ident(id: ExprId) -> Ident {\\n\\n const TABLE: &str = \\\"__ytable__\\\";\\n\\n format_ident!(\\\"{}{}\\\", TABLE, id)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"yarte_codegen/src/wasm/client/utils.rs\",\n \"rank\": 5,\n \"score\": 375469.21312720847\n },\n {\n \"content\": \"#[inline]\\n\\npub fn get_node_ident(id: ExprId) -> Ident {\\n\\n const NODE: &str = \\\"__ynode__\\\";\\n\\n format_ident!(\\\"{}{}\\\", NODE, id)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"yarte_codegen/src/wasm/client/utils.rs\",\n \"rank\": 6,\n \"score\": 375466.38787151326\n },\n {\n \"content\": \"#[inline]\\n\\npub fn is_state(Field { attrs, ty, .. }: &Field) -> bool {\\n\\n !(is_inner(attrs) || is_black_box(ty))\\n\\n}\\n\\n\\n\",\n \"file_path\": \"yarte_codegen/src/wasm/client/utils.rs\",\n \"rank\": 7,\n \"score\": 365426.19585628825\n },\n {\n \"content\": \"pub fn all_children_text<'a, I: Iterator<Item = &'a Node> + Clone>(mut doc: I) -> bool {\\n\\n !doc.clone().all(|x| {\\n\\n if let Node::Elem(Element::Text(_)) = x {\\n\\n true\\n\\n } else {\\n\\n false\\n\\n }\\n\\n }) && doc.all(|x| match x {\\n\\n Node::Elem(Element::Text(_)) => true,\\n\\n Node::Expr(e) => match e {\\n\\n Expression::IfElse(_, block) => {\\n\\n let IfElse { ifs, if_else, els } = &**block;\\n\\n all_if_block_text(ifs)\\n\\n && if_else.iter().all(|x| all_if_block_text(x))\\n\\n && els\\n\\n .as_ref()\\n\\n .map(|x| all_children_text(x.iter()))\\n\\n .unwrap_or(true)\\n\\n }\\n\\n Expression::Each(_, block) => {\\n\\n let Each { body, .. } = &**block;\\n\\n all_children_text(body.iter())\\n\\n }\\n\\n Expression::Local(..) => false,\\n\\n _ => true,\\n\\n },\\n\\n _ => false,\\n\\n })\\n\\n}\\n\\n\\n\",\n \"file_path\": \"yarte_codegen/src/wasm/client/utils.rs\",\n \"rank\": 8,\n \"score\": 356903.29014134884\n },\n {\n \"content\": \"pub fn resolve_local<'a>(expr: &'a Local, id: usize, builder: &'a mut DOMBuilder) -> VarId {\\n\\n ResolveLocal::new(builder, id).resolve(expr)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"yarte_dom/src/dom/resolve.rs\",\n \"rank\": 9,\n \"score\": 343773.5975843109\n },\n {\n \"content\": \"pub fn get_split_32(mut bits: &[bool]) -> Punctuated<syn::Expr, Token![,]> {\\n\\n let mut buff = Punctuated::new();\\n\\n while !bits.is_empty() {\\n\\n let (current, next) = bits.split_at(32);\\n\\n bits = next;\\n\\n let current = get_number_u32(current);\\n\\n buff.push(parse2(quote!(#current)).unwrap());\\n\\n }\\n\\n\\n\\n buff\\n\\n}\\n\\n\\n\",\n \"file_path\": \"yarte_codegen/src/wasm/client/utils.rs\",\n \"rank\": 10,\n \"score\": 340610.0975568709\n },\n {\n \"content\": \"#[inline]\\n\\npub fn get_drop<I: Iterator<Item = Ident>>(component: &Ident, roots: I) -> TokenStream {\\n\\n let mut tokens = TokenStream::new();\\n\\n for root in roots {\\n\\n tokens.extend(quote!(self.#root.remove();));\\n\\n }\\n\\n quote! {\\n\\n impl Drop for #component {\\n\\n fn drop(&mut self) {\\n\\n #tokens\\n\\n }\\n\\n }\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"yarte_codegen/src/wasm/client/utils.rs\",\n \"rank\": 11,\n \"score\": 339173.3927908804\n },\n {\n \"content\": \"fn fields_to_args(f: &Fields, i: &Ident) -> (Punctuated<Ident, Token![,]>, TokenStream) {\\n\\n let mut pun = Punctuated::new();\\n\\n match f {\\n\\n Fields::Named(FieldsNamed { named, .. }) => {\\n\\n let mut buff: Punctuated<Ident, Token![,]> = Punctuated::new();\\n\\n for i in named {\\n\\n let ident = i.ident.as_ref().unwrap();\\n\\n buff.push(ident.clone());\\n\\n pun.push(ident.clone());\\n\\n }\\n\\n\\n\\n (pun, quote!(#i { #buff }))\\n\\n }\\n\\n Fields::Unnamed(FieldsUnnamed { unnamed, .. }) => {\\n\\n let mut buff: Punctuated<Ident, Token![,]> = Punctuated::new();\\n\\n for (c, _) in unnamed.into_iter().enumerate() {\\n\\n let ident = format_ident!(\\\"_{}\\\", c);\\n\\n buff.push(ident.clone());\\n\\n pun.push(ident);\\n\\n }\\n\\n\\n\\n (pun, quote!(#i( #buff )))\\n\\n }\\n\\n Fields::Unit => (pun, quote!(#i)),\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"yarte_codegen/src/wasm/client/messages.rs\",\n \"rank\": 12,\n \"score\": 331988.41798061616\n },\n {\n \"content\": \"fn _zip(head: &str, expr: &mut Iter<Vec<String>>, buff: &mut Vec<String>) {\\n\\n if let Some(first) = expr.next() {\\n\\n for i in first {\\n\\n let head = head.to_owned() + \\\" \\\" + &i;\\n\\n _zip(&head, &mut expr.clone(), buff)\\n\\n }\\n\\n } else {\\n\\n buff.push(head.into());\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"yarte_wasm_app/benches/codegen/src/lib.rs\",\n \"rank\": 13,\n \"score\": 325451.1541558801\n },\n {\n \"content\": \"pub fn get_insert_point<'b, I: Iterator<Item = &'b Node>>(nodes: I) -> Vec<InsertPath> {\\n\\n let mut insert = vec![];\\n\\n // TODO: inline nodes, expressions, ...\\n\\n for e in nodes {\\n\\n match e {\\n\\n Node::Elem(Element::Node { .. }) => insert.push(InsertPath::Before),\\n\\n Node::Expr(Expression::Each(id, _)) | Node::Expr(Expression::IfElse(id, _)) => {\\n\\n insert.push(InsertPath::Expr(*id))\\n\\n }\\n\\n _ => (),\\n\\n }\\n\\n }\\n\\n\\n\\n insert\\n\\n}\\n\\n\\n\",\n \"file_path\": \"yarte_codegen/src/wasm/client/utils.rs\",\n \"rank\": 14,\n \"score\": 311623.82707639\n },\n {\n \"content\": \"fn get_children<I: Iterator<Item = ParseNodeId>>(children: I, sink: &mut Sink) -> Vec<TreeElement> {\\n\\n use ParseElement::*;\\n\\n let mut tree = vec![];\\n\\n for child in children {\\n\\n match sink.nodes.remove(&child).expect(\\\"Child\\\") {\\n\\n Text(mut s) => {\\n\\n if let Some(TreeElement::Text(last)) = tree.last_mut() {\\n\\n last.extend(s.drain(..));\\n\\n } else {\\n\\n tree.push(TreeElement::Text(s))\\n\\n }\\n\\n }\\n\\n Node {\\n\\n name,\\n\\n attrs,\\n\\n children,\\n\\n ..\\n\\n } => tree.push(TreeElement::Node {\\n\\n name,\\n\\n attrs,\\n\",\n \"file_path\": \"yarte_dom/src/serialize.rs\",\n \"rank\": 15,\n \"score\": 307187.778141371\n },\n {\n \"content\": \"pub fn expand_match_token(body: &TokenStream) -> syn::Expr {\\n\\n let match_token = syn::parse2::<MatchToken>(body.clone());\\n\\n let ast = expand_match_token_macro(match_token.unwrap());\\n\\n syn::parse2(ast.into()).unwrap()\\n\\n}\\n\\n\\n\",\n \"file_path\": \"yarte_html/macros/match_token.rs\",\n \"rank\": 16,\n \"score\": 305247.4278850975\n },\n {\n \"content\": \"fn gen<C>(codegen: &mut C, v: Vec<HIR>, parent: &str) -> TokenStream\\n\\nwhere\\n\\n C: CodeGen + EachCodeGen + IfElseCodeGen,\\n\\n{\\n\\n let mut tokens = TokenStream::new();\\n\\n let parent = format_ident!(\\\"{}\\\", parent);\\n\\n for i in v {\\n\\n use HIR::*;\\n\\n tokens.extend(match i {\\n\\n Local(a) => quote!(#a),\\n\\n Lit(a) => literal(a, &parent),\\n\\n Safe(a) => quote!(buf_cur += &(#a).__render_it_safe(&mut buf[buf_cur..])?;),\\n\\n Expr(a) => quote!(buf_cur += &(#a).__render_it(&mut buf[buf_cur..])?;),\\n\\n Each(a) => codegen.gen_each(*a),\\n\\n IfElse(a) => codegen.gen_if_else(*a),\\n\\n })\\n\\n }\\n\\n tokens\\n\\n}\\n\\n\\n\",\n \"file_path\": \"yarte_codegen/src/fixed.rs\",\n \"rank\": 17,\n \"score\": 296510.142756877\n },\n {\n \"content\": \"/// Push literal at cursor with length\\n\\nfn eat_lit<'a>(nodes: &mut Vec<SNode<'a>>, i: Cursor<'a>, len: usize) {\\n\\n let lit = &i.rest[..len];\\n\\n if !lit.is_empty() {\\n\\n let (l, lit, r) = trim(lit);\\n\\n let ins = Span {\\n\\n lo: i.off + (l.len() as u32),\\n\\n hi: i.off + ((len - r.len()) as u32),\\n\\n };\\n\\n let out = Span {\\n\\n lo: i.off,\\n\\n hi: i.off + (len as u32),\\n\\n };\\n\\n nodes.push(S(Node::Lit(l, S(lit, ins), r), out));\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"yarte_parser/src/lib.rs\",\n \"rank\": 18,\n \"score\": 286351.71563536534\n },\n {\n \"content\": \"fn literal(a: String, parent: &Ident) -> TokenStream {\\n\\n let len = a.len();\\n\\n let b = a.as_bytes();\\n\\n // https://github.com/torvalds/linux/blob/master/arch/x86/lib/memcpy_64.S\\n\\n // https://software.intel.com/content/www/us/en/develop/download/intel-64-and-ia-32-architectures-optimization-reference-manual.html\\n\\n match len {\\n\\n 0 => unreachable!(),\\n\\n // For 1 to 3 bytes, is mostly faster write byte-by-byte\\n\\n 1..=3 => {\\n\\n let range: TokenStream = write_bb(b);\\n\\n quote! {{\\n\\n #[doc = #a]\\n\\n __yarte_check_write!(#len, {\\n\\n #range\\n\\n buf_cur += #len;\\n\\n })\\n\\n }}\\n\\n }\\n\\n 4..=15 => {\\n\\n quote! {{\\n\",\n \"file_path\": \"yarte_codegen/src/fixed.rs\",\n \"rank\": 19,\n \"score\": 280424.8333878564\n },\n {\n \"content\": \"// TODO: multiple roots\\n\\npub fn get_field_root_ident() -> Ident {\\n\\n const ROOT: &str = \\\"__root\\\";\\n\\n format_ident!(\\\"{}\\\", ROOT)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"yarte_codegen/src/wasm/client/utils.rs\",\n \"rank\": 20,\n \"score\": 277893.46342993045\n },\n {\n \"content\": \"pub fn get_t_root_type(len: usize) -> (TokenStream, usize) {\\n\\n match len {\\n\\n 0..=8 => (quote!(u8), 8),\\n\\n 9..=16 => (quote!(u16), 16),\\n\\n 17..=32 => (quote!(u32), 32),\\n\\n 33..=64 => (quote!(yarte_wasm_app::U64), 64),\\n\\n 65..=128 => (quote!(yarte_wasm_app::U128), 128),\\n\\n 129..=256 => (quote!(yarte_wasm_app::U256), 256),\\n\\n _ => todo!(\\\"more than 256 variables per context\\\"),\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"yarte_codegen/src/wasm/client/utils.rs\",\n \"rank\": 21,\n \"score\": 270677.11924508424\n },\n {\n \"content\": \"/// Eat expression Node\\n\\nfn expr(i: Cursor, lws: bool) -> PResult<Node> {\\n\\n match at_helper(i, lws) {\\n\\n Ok(x) => return Ok(x),\\n\\n Err(e @ LexError::Fail(..)) => return Err(e),\\n\\n _ => (),\\n\\n }\\n\\n\\n\\n let mut at = 0;\\n\\n let (c, rws, s) = loop {\\n\\n if let Some(j) = i.adv_find(at, '}') {\\n\\n if 0 < at + j && i.adv_starts_with(at + j - 1, \\\"~}}\\\") {\\n\\n break (i.adv(at + j + 2), true, &i.rest[..at + j - 1]);\\n\\n } else if i.adv_starts_with(at + j + 1, \\\"}\\\") {\\n\\n break (i.adv(at + j + 2), false, &i.rest[..at + j]);\\n\\n }\\n\\n\\n\\n at += j + 1;\\n\\n } else {\\n\\n return Err(LexError::Next(\\n\\n PError::Expr(DOption::None),\\n\",\n \"file_path\": \"yarte_parser/src/lib.rs\",\n \"rank\": 22,\n \"score\": 270426.2344273931\n },\n {\n \"content\": \"#[inline]\\n\\nfn is_tuple_index(ident: &[u8]) -> bool {\\n\\n 1 < ident.len() && ident[0] == b'_' && ident[1..].iter().all(|x| x.is_ascii_digit())\\n\\n}\\n\",\n \"file_path\": \"yarte_hir/src/lib.rs\",\n \"rank\": 23,\n \"score\": 266299.72368436016\n },\n {\n \"content\": \"pub fn get_number_u32(bits: &[bool]) -> u32 {\\n\\n let mut n = 0;\\n\\n for (i, b) in bits.iter().enumerate() {\\n\\n if *b {\\n\\n n += 1 << i as u32\\n\\n }\\n\\n }\\n\\n n\\n\\n}\\n\\n\\n\",\n \"file_path\": \"yarte_codegen/src/wasm/client/utils.rs\",\n \"rank\": 24,\n \"score\": 257841.2271885164\n },\n {\n \"content\": \"fn gen<C>(codegen: &mut C, v: Vec<HIR>, buf: TokenStream) -> TokenStream\\n\\nwhere\\n\\n C: CodeGen + EachCodeGen + IfElseCodeGen,\\n\\n{\\n\\n let mut tokens = TokenStream::new();\\n\\n for i in v {\\n\\n use HIR::*;\\n\\n tokens.extend(match i {\\n\\n Local(a) => quote!(#a),\\n\\n Lit(a) => literal(a, &buf),\\n\\n Safe(a) => quote!(&(#a).__render_itb_safe(buf_ref!(#buf));),\\n\\n Expr(a) => quote!(&(#a).__render_itb(buf_ref!(#buf));),\\n\\n Each(a) => codegen.gen_each(*a),\\n\\n IfElse(a) => codegen.gen_if_else(*a),\\n\\n })\\n\\n }\\n\\n tokens\\n\\n}\\n\\n\\n\",\n \"file_path\": \"yarte_codegen/src/bytes.rs\",\n \"rank\": 25,\n \"score\": 256635.05804513174\n },\n {\n \"content\": \"fn resolve_node(ir: HIR, buff: &mut Vec<HIR>, opts: SerializerOpt) -> ParseResult<()> {\\n\\n match ir {\\n\\n HIR::Each(each) => {\\n\\n let HEach { args, body, expr } = *each;\\n\\n buff.push(HIR::Each(Box::new(HEach {\\n\\n args,\\n\\n expr,\\n\\n body: to_domfmt(body, opts)?,\\n\\n })))\\n\\n }\\n\\n HIR::IfElse(if_else) => {\\n\\n let HIfElse { ifs, if_else, els } = *if_else;\\n\\n let mut buf_if_else = vec![];\\n\\n for (expr, body) in if_else {\\n\\n buf_if_else.push((expr, to_domfmt(body, opts)?));\\n\\n }\\n\\n let els = if let Some(els) = els {\\n\\n Some(to_domfmt(els, opts)?)\\n\\n } else {\\n\\n None\\n\",\n \"file_path\": \"yarte_dom/src/dom_fmt.rs\",\n \"rank\": 26,\n \"score\": 255570.6570071935\n },\n {\n \"content\": \"// TODO: Fix me!!\\n\\npub fn get_steps<'b, I: Iterator<Item = &'b PathNode>>(\\n\\n mut nodes: I,\\n\\n parent: TokenStream,\\n\\n) -> TokenStream {\\n\\n let mut buff = vec![];\\n\\n let mut stack = vec![];\\n\\n if let Some((ident, path)) = nodes.next() {\\n\\n buff.push((parent.clone(), ident.clone(), PathStep(path.iter())));\\n\\n stack.push((ident, path))\\n\\n }\\n\\n for (ident, path) in nodes {\\n\\n let mut check = true;\\n\\n for (i, last) in stack.iter().rev() {\\n\\n if path.starts_with(last) {\\n\\n // TODO: assert_ne!(last.len(), path.len());\\n\\n buff.push((\\n\\n quote!(#i),\\n\\n ident.clone(),\\n\\n PathStep(path[last.len()..].iter()),\\n\\n ));\\n\",\n \"file_path\": \"yarte_codegen/src/wasm/client/utils.rs\",\n \"rank\": 27,\n \"score\": 255328.19209467008\n },\n {\n \"content\": \"fn add_scripts(s: &Struct, sink: &mut Sink, ir: &mut Vec<HIR>) {\\n\\n let mut body: Option<usize> = None;\\n\\n use ParseElement::*;\\n\\n match sink.nodes.values().next() {\\n\\n Some(Document(children)) => {\\n\\n if let Some(Node { name, children, .. }) = sink.nodes.get(&children[0]) {\\n\\n if let y_name!(\\\"html\\\") = name.local {\\n\\n for i in children {\\n\\n if let Some(Node { name, .. }) = sink.nodes.get(i) {\\n\\n if let y_name!(\\\"body\\\") = name.local {\\n\\n body = Some(*i);\\n\\n }\\n\\n }\\n\\n }\\n\\n }\\n\\n }\\n\\n }\\n\\n _ => panic!(\\\"Need <!doctype html>\\\"),\\n\\n }\\n\\n\\n\",\n \"file_path\": \"yarte_dom/src/dom_fmt.rs\",\n \"rank\": 28,\n \"score\": 252507.06321011594\n },\n {\n \"content\": \"fn gen<C>(codegen: &mut C, v: Vec<HIR>) -> TokenStream\\n\\nwhere\\n\\n C: CodeGen + EachCodeGen + IfElseCodeGen,\\n\\n{\\n\\n let mut tokens = TokenStream::new();\\n\\n for i in v {\\n\\n use HIR::*;\\n\\n tokens.extend(match i {\\n\\n Local(a) => quote!(#a),\\n\\n Lit(a) => quote!(_fmt.write_str(#a)?;),\\n\\n Safe(a) => quote!(&(#a).fmt(_fmt)?;),\\n\\n Expr(a) => quote!(&(#a).__renders_it(_fmt)?;),\\n\\n Each(a) => codegen.gen_each(*a),\\n\\n IfElse(a) => codegen.gen_if_else(*a),\\n\\n })\\n\\n }\\n\\n tokens\\n\\n}\\n\\n\\n\\npub struct HTMLCodeGen;\\n\",\n \"file_path\": \"yarte_codegen/src/html.rs\",\n \"rank\": 29,\n \"score\": 251329.97927475793\n },\n {\n \"content\": \"#[inline]\\n\\npub fn is_black_box(ty: &Type) -> bool {\\n\\n BB_TYPE.with(|black| ty.eq(&black))\\n\\n}\\n\\n\\n\",\n \"file_path\": \"yarte_codegen/src/wasm/client/utils.rs\",\n \"rank\": 30,\n \"score\": 248939.09332980646\n },\n {\n \"content\": \"#[inline]\\n\\nfn delete(app: &mut Test, id: u32, _addr: &Addr<Test>) {\\n\\n let index = app.fortunes.iter().position(|x| x.id == id).unwrap();\\n\\n app.fortunes.remove(index);\\n\\n // TODO: macro\\n\\n // TODO: when index\\n\\n app.black_box.__ytable__1.remove(index);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"example_wasm/client/src/lib.rs\",\n \"rank\": 31,\n \"score\": 248853.95951726363\n },\n {\n \"content\": \"pub fn expand(from: &Path, to: &Path) {\\n\\n let mut source = String::new();\\n\\n File::open(from)\\n\\n .unwrap()\\n\\n .read_to_string(&mut source)\\n\\n .unwrap();\\n\\n let ast = syn::parse_file(&source).expect(\\\"Parsing rules.rs module\\\");\\n\\n let mut m = MatchTokenParser {};\\n\\n let ast = m.fold_file(ast);\\n\\n let code = ast\\n\\n .into_token_stream()\\n\\n .to_string()\\n\\n .replace(\\\"{ \\\", \\\"{\\\\n\\\")\\n\\n .replace(\\\" }\\\", \\\"\\\\n}\\\");\\n\\n File::create(to)\\n\\n .unwrap()\\n\\n .write_all(code.as_bytes())\\n\\n .unwrap();\\n\\n}\\n\\n\\n\",\n \"file_path\": \"yarte_html/macros/match_token.rs\",\n \"rank\": 32,\n \"score\": 247465.6868936246\n },\n {\n \"content\": \"pub fn to_wasmfmt(mut ir: Vec<HIR>, s: &Struct) -> ParseResult<Vec<HIR>> {\\n\\n let html = get_html(&ir);\\n\\n let sink = match parse_document(&html) {\\n\\n Ok(mut sink) => {\\n\\n add_scripts(s, &mut sink, &mut ir);\\n\\n sink\\n\\n }\\n\\n Err(_) => parse_fragment(&html)?,\\n\\n };\\n\\n\\n\\n serialize_domfmt(sink, ir, SerializerOpt { wasm: true })\\n\\n}\\n\\n\\n\",\n \"file_path\": \"yarte_dom/src/dom_fmt.rs\",\n \"rank\": 33,\n \"score\": 246596.3964430797\n },\n {\n \"content\": \"// Helpers\\n\\nfn build_big_table(size: usize) -> Vec<Vec<usize>> {\\n\\n let mut table = Vec::with_capacity(size);\\n\\n for _ in 0..size {\\n\\n let mut inner = Vec::with_capacity(size);\\n\\n for i in 0..size {\\n\\n inner.push(i);\\n\\n }\\n\\n table.push(inner);\\n\\n }\\n\\n\\n\\n table\\n\\n}\\n\\n\\n\",\n \"file_path\": \"benches/src/all.rs\",\n \"rank\": 34,\n \"score\": 244102.35285460937\n },\n {\n \"content\": \"#[inline]\\n\\nfn par(i: Cursor, lws: bool) -> PResult<Node> {\\n\\n match expr_partial_block(i, lws) {\\n\\n Ok(x) => Ok(x),\\n\\n Err(_) => partial(i, lws).map(|(c, p)| (c, Node::Partial(p))),\\n\\n }\\n\\n}\\n\\n\\n\\n/// Eat partial expression\\n\",\n \"file_path\": \"yarte_parser/src/lib.rs\",\n \"rank\": 35,\n \"score\": 242168.98778072908\n },\n {\n \"content\": \"#[inline]\\n\\npub fn get_body_ident() -> Ident {\\n\\n format_ident!(\\\"__ybody\\\")\\n\\n}\\n\\n\\n\",\n \"file_path\": \"yarte_codegen/src/wasm/client/utils.rs\",\n \"rank\": 36,\n \"score\": 241464.60382482153\n },\n {\n \"content\": \"#[inline]\\n\\npub fn get_t_root_ident() -> Ident {\\n\\n const T_ROOT: &str = \\\"t_root\\\";\\n\\n format_ident!(\\\"{}\\\", T_ROOT)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"yarte_codegen/src/wasm/client/utils.rs\",\n \"rank\": 37,\n \"score\": 241458.37848605064\n },\n {\n \"content\": \"pub fn get_number_u8(bits: Vec<bool>) -> u8 {\\n\\n let mut n = 0;\\n\\n for (i, b) in bits.into_iter().enumerate() {\\n\\n if b {\\n\\n n += 1 << i as u8\\n\\n }\\n\\n }\\n\\n n\\n\\n}\\n\\n\\n\",\n \"file_path\": \"yarte_codegen/src/wasm/client/utils.rs\",\n \"rank\": 38,\n \"score\": 236596.23847459292\n },\n {\n \"content\": \"pub fn get_number_u16(bits: Vec<bool>) -> u16 {\\n\\n let mut n = 0;\\n\\n for (i, b) in bits.into_iter().enumerate() {\\n\\n if b {\\n\\n n += 1 << i as u16\\n\\n }\\n\\n }\\n\\n n\\n\\n}\\n\\n\\n\",\n \"file_path\": \"yarte_codegen/src/wasm/client/utils.rs\",\n \"rank\": 39,\n \"score\": 236596.23847459292\n },\n {\n \"content\": \"fn expr_partial_block(c: Cursor, lws: bool) -> PResult<Node> {\\n\\n do_parse!(\\n\\n c,\\n\\n ws >> tag!(PARTIAL_BLOCK) >> rws: end_expr >> (Node::Block((lws, rws)))\\n\\n )\\n\\n}\\n\\n\\n\",\n \"file_path\": \"yarte_parser/src/lib.rs\",\n \"rank\": 40,\n \"score\": 235101.23790218367\n },\n {\n \"content\": \"fn serialize_domfmt(sink: Sink, mut ir: Vec<HIR>, opts: SerializerOpt) -> ParseResult<Vec<HIR>> {\\n\\n let mut writer = Vec::new();\\n\\n serialize(&mut writer, sink.into(), opts).expect(\\\"some serialize node\\\");\\n\\n\\n\\n let html = String::from_utf8(writer).expect(\\\"\\\");\\n\\n let mut chunks = html.split(MARK).peekable();\\n\\n\\n\\n if let Some(first) = chunks.peek() {\\n\\n if first.is_empty() {\\n\\n chunks.next();\\n\\n }\\n\\n }\\n\\n let mut ir = ir.drain(..).filter(|x| match x {\\n\\n HIR::Lit(_) => false,\\n\\n _ => true,\\n\\n });\\n\\n\\n\\n let mut buff = vec![];\\n\\n for chunk in chunks {\\n\\n if chunk.is_empty() {\\n\",\n \"file_path\": \"yarte_dom/src/dom_fmt.rs\",\n \"rank\": 41,\n \"score\": 233130.23318307282\n },\n {\n \"content\": \"#[inline]\\n\\nfn _io_big_table<W: std::io::Write>(f: &mut W, table: &Vec<Vec<usize>>) -> std::io::Result<()> {\\n\\n f.write_all(b\\\"<table>\\\")?;\\n\\n for i in table {\\n\\n f.write_all(b\\\"<tr>\\\")?;\\n\\n for j in i {\\n\\n f.write_all(b\\\"<td>\\\")?;\\n\\n write!(f, \\\"{}\\\", j)?;\\n\\n f.write_all(b\\\"</td>\\\")?;\\n\\n }\\n\\n f.write_all(b\\\"</tr>\\\")?;\\n\\n }\\n\\n f.write_all(b\\\"</table>\\\")\\n\\n}\\n\\n\\n\",\n \"file_path\": \"benches/src/all.rs\",\n \"rank\": 42,\n \"score\": 230621.97527177812\n },\n {\n \"content\": \"/// A constructor for an element.\\n\\n///\\n\\n/// # Examples\\n\\n///\\n\\n/// Create an element like `<div class=\\\"test-class-name\\\"></div>`:\\n\\npub fn create_element<Sink>(sink: &mut Sink, name: QualName, attrs: Vec<Attribute>) -> Sink::Handle\\n\\nwhere\\n\\n Sink: TreeSink,\\n\\n{\\n\\n let mut flags = ElementFlags::default();\\n\\n match name.expanded() {\\n\\n expanded_name!(html \\\"template\\\") => flags.template = true,\\n\\n expanded_name!(mathml \\\"annotation-xml\\\") => {\\n\\n flags.mathml_annotation_xml_integration_point = attrs.iter().any(|attr| {\\n\\n attr.name.expanded() == expanded_name!(\\\"\\\", \\\"encoding\\\")\\n\\n && (attr.value.eq_ignore_ascii_case(\\\"text/html\\\")\\n\\n || attr.value.eq_ignore_ascii_case(\\\"application/xhtml+xml\\\"))\\n\\n })\\n\\n }\\n\\n _ => {}\\n\\n }\\n\\n sink.create_element(name, attrs, flags)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"yarte_html/src/interface.rs\",\n \"rank\": 43,\n \"score\": 230528.2985799085\n },\n {\n \"content\": \"pub fn is_marquee(name: &QualName) -> bool {\\n\\n YARTE_TAG.with(|x| *x.local == *name.local)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"yarte_html/src/tree_builder/mod.rs\",\n \"rank\": 44,\n \"score\": 221316.08045231982\n },\n {\n \"content\": \"pub fn parse_id(s: &str) -> Option<u32> {\\n\\n if &s[..S_LEN] == S && s[S_LEN..].chars().all(|x| x.is_ascii_hexdigit()) {\\n\\n u32::from_str_radix(&s[S_LEN..], 16).ok()\\n\\n } else {\\n\\n None\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"yarte_html/src/utils.rs\",\n \"rank\": 45,\n \"score\": 220947.16641494058\n },\n {\n \"content\": \"fn expand_match_token_macro(match_token: MatchToken) -> TokenStream {\\n\\n let mut arms = match_token.arms;\\n\\n let to_be_matched = match_token.ident;\\n\\n // Handle the last arm specially at the end.\\n\\n let last_arm = arms.pop().unwrap();\\n\\n\\n\\n // Tags we've seen, used for detecting duplicates.\\n\\n let mut seen_tags: HashSet<Tag> = HashSet::new();\\n\\n\\n\\n // Case arms for wildcard matching. We collect these and\\n\\n // emit them later.\\n\\n let mut wildcards_patterns: Vec<TokenStream> = Vec::new();\\n\\n let mut wildcards_expressions: Vec<syn::Expr> = Vec::new();\\n\\n\\n\\n // Tags excluded (by an 'else' RHS) from wildcard matching.\\n\\n let mut wild_excluded_patterns: Vec<TokenStream> = Vec::new();\\n\\n\\n\\n let mut arms_code = Vec::new();\\n\\n\\n\\n for MatchTokenArm { binding, lhs, rhs } in arms {\\n\",\n \"file_path\": \"yarte_html/macros/match_token.rs\",\n \"rank\": 46,\n \"score\": 220692.5703609248\n },\n {\n \"content\": \"pub fn get_component<'a, I: Iterator<Item = &'a Node>>(\\n\\n id: ExprId,\\n\\n doc: I,\\n\\n builder: &mut WASMCodeGen,\\n\\n) -> Ident {\\n\\n ComponentBuilder::new(id, builder).build(doc)\\n\\n}\\n\\n\\n\\nconst HEAD: &str = \\\"__n__\\\";\\n\\n\\n\",\n \"file_path\": \"yarte_codegen/src/wasm/client/component.rs\",\n \"rank\": 47,\n \"score\": 219831.44353178793\n },\n {\n \"content\": \"#[allow(unused_variables)]\\n\\nfn get_closure(msg: &syn::Expr) -> (TokenStream, TokenStream) {\\n\\n use syn::Expr::*;\\n\\n let (msg, cloned) = match msg {\\n\\n Path(ExprPath { attrs, qself, path }) => (quote!(#msg), quote!()),\\n\\n Call(ExprCall {\\n\\n attrs, func, args, ..\\n\\n }) => {\\n\\n let mut new: Punctuated<Ident, Token![,]> = Punctuated::new();\\n\\n let mut cloned = TokenStream::new();\\n\\n for (count, arg) in args.iter().enumerate() {\\n\\n let ident = format_ident!(\\\"__cloned__{}\\\", count);\\n\\n cloned.extend(quote!(let #ident = (#arg).clone();));\\n\\n new.push(ident);\\n\\n }\\n\\n (quote!(#func(#new)), cloned)\\n\\n }\\n\\n Struct(ExprStruct {\\n\\n attrs,\\n\\n path,\\n\\n fields,\\n\",\n \"file_path\": \"yarte_codegen/src/wasm/client/events.rs\",\n \"rank\": 48,\n \"score\": 219640.31919343869\n },\n {\n \"content\": \"pub fn get_mark_id(s: &str) -> Option<u32> {\\n\\n if is_mark(s) {\\n\\n u32::from_str_radix(&s[MARK_LEN + S_LEN..], 16).ok()\\n\\n } else {\\n\\n None\\n\\n }\\n\\n}\\n\\n\\n\\n#[cfg(test)]\\n\\n#[allow(non_snake_case)]\\n\\nmod test {\\n\\n use super::{is_ascii_alnum, lower_ascii_letter};\\n\\n use mac::test_eq;\\n\\n\\n\\n test_eq!(lower_letter_a_is_a, lower_ascii_letter('a'), Some('a'));\\n\\n test_eq!(lower_letter_A_is_a, lower_ascii_letter('A'), Some('a'));\\n\\n test_eq!(lower_letter_symbol_is_None, lower_ascii_letter('!'), None);\\n\\n test_eq!(\\n\\n lower_letter_nonascii_is_None,\\n\\n lower_ascii_letter('\\\\u{a66e}'),\\n\\n None\\n\\n );\\n\\n\\n\\n test_eq!(is_alnum_a, is_ascii_alnum('a'), true);\\n\\n test_eq!(is_alnum_A, is_ascii_alnum('A'), true);\\n\\n test_eq!(is_alnum_1, is_ascii_alnum('1'), true);\\n\\n test_eq!(is_not_alnum_symbol, is_ascii_alnum('!'), false);\\n\\n test_eq!(is_not_alnum_nonascii, is_ascii_alnum('\\\\u{a66e}'), false);\\n\\n}\\n\",\n \"file_path\": \"yarte_html/src/utils.rs\",\n \"rank\": 49,\n \"score\": 217216.59898790787\n },\n {\n \"content\": \"#[inline(always)]\\n\\npub fn default_scope(name: ExpandedName) -> bool {\\n\\n html_default_scope(name)\\n\\n || mathml_text_integration_point(name)\\n\\n || svg_html_integration_point(name)\\n\\n}\\n\\n\\n\\ndeclare_tag_set!(pub list_item_scope = [default_scope] + \\\"ol\\\" \\\"ul\\\");\\n\\ndeclare_tag_set!(pub button_scope = [default_scope] + \\\"button\\\");\\n\\n\\n\\ndeclare_tag_set!(pub cursory_implied_end =\\n\\n \\\"dd\\\" \\\"dt\\\" \\\"li\\\" \\\"option\\\" \\\"optgroup\\\" \\\"p\\\" \\\"rb\\\" \\\"rp\\\" \\\"rt\\\" \\\"rtc\\\");\\n\\n\\n\\ndeclare_tag_set!(pub heading_tag = \\\"h1\\\" \\\"h2\\\" \\\"h3\\\" \\\"h4\\\" \\\"h5\\\" \\\"h6\\\");\\n\\n\\n\\ndeclare_tag_set!(pub special_tag =\\n\\n \\\"address\\\" \\\"applet\\\" \\\"area\\\" \\\"article\\\" \\\"aside\\\" \\\"base\\\" \\\"basefont\\\" \\\"bgsound\\\" \\\"blockquote\\\" \\\"body\\\"\\n\\n \\\"br\\\" \\\"button\\\" \\\"caption\\\" \\\"center\\\" \\\"col\\\" \\\"colgroup\\\" \\\"dd\\\" \\\"details\\\" \\\"dir\\\" \\\"div\\\" \\\"dl\\\" \\\"dt\\\" \\\"embed\\\"\\n\\n \\\"fieldset\\\" \\\"figcaption\\\" \\\"figure\\\" \\\"footer\\\" \\\"form\\\" \\\"frame\\\" \\\"frameset\\\" \\\"h1\\\" \\\"h2\\\" \\\"h3\\\" \\\"h4\\\" \\\"h5\\\"\\n\\n \\\"h6\\\" \\\"head\\\" \\\"header\\\" \\\"hgroup\\\" \\\"hr\\\" \\\"html\\\" \\\"iframe\\\" \\\"img\\\" \\\"input\\\" \\\"isindex\\\" \\\"li\\\" \\\"link\\\"\\n\\n \\\"listing\\\" \\\"main\\\" \\\"marquee\\\" \\\"menu\\\" \\\"meta\\\" \\\"nav\\\" \\\"noembed\\\" \\\"noframes\\\" \\\"noscript\\\"\\n\\n \\\"object\\\" \\\"ol\\\" \\\"p\\\" \\\"param\\\" \\\"plaintext\\\" \\\"pre\\\" \\\"script\\\" \\\"section\\\" \\\"select\\\" \\\"source\\\" \\\"style\\\"\\n\\n \\\"summary\\\" \\\"table\\\" \\\"tbody\\\" \\\"td\\\" \\\"template\\\" \\\"textarea\\\" \\\"tfoot\\\" \\\"th\\\" \\\"thead\\\" \\\"title\\\" \\\"tr\\\" \\\"track\\\"\\n\\n \\\"ul\\\" \\\"wbr\\\" \\\"xmp\\\");\\n\\n//§ END\\n\\n\\n\",\n \"file_path\": \"yarte_html/src/tree_builder/tag_sets.rs\",\n \"rank\": 50,\n \"score\": 216558.99207256292\n },\n {\n \"content\": \"pub fn parse_fragment(doc: &str) -> ParseResult<Sink> {\\n\\n let parser = driver::parse_fragment(Sink::default(), get_marquee(), vec![]).from_utf8();\\n\\n parser.one(doc.as_bytes()).and_then(|mut a| {\\n\\n a.nodes\\n\\n .remove(&0)\\n\\n .and_then(|_| {\\n\\n if let Some(ParseElement::Node { name, .. }) = a.nodes.get_mut(&2) {\\n\\n *name = get_marquee();\\n\\n Some(a)\\n\\n } else {\\n\\n None\\n\\n }\\n\\n })\\n\\n .ok_or_else(Vec::new)\\n\\n })\\n\\n}\\n\",\n \"file_path\": \"yarte_dom/src/sink.rs\",\n \"rank\": 51,\n \"score\": 213569.1285956973\n },\n {\n \"content\": \"fn tokens(i: TokenStream, wlog: bool) -> String {\\n\\n let config = &Config::new(\\\"\\\");\\n\\n let der = parse2(i).unwrap();\\n\\n let s = visit_derive(&der, config).unwrap();\\n\\n let mut src = BTreeMap::new();\\n\\n src.insert(s.path.clone(), s.src.clone());\\n\\n let sources = parse(get_cursor(&s.path, &s.src)).unwrap();\\n\\n let mut ctx = BTreeMap::new();\\n\\n ctx.insert(&s.path, sources);\\n\\n\\n\\n let ir = generate(config, &s, &ctx, Default::default())\\n\\n .unwrap_or_else(|e| emitter(&src, config, e.into_iter()));\\n\\n clean();\\n\\n\\n\\n let res = WASMCodeGen::new(&s).gen(ir).to_string();\\n\\n if wlog {\\n\\n log(&res, \\\"Test\\\".into(), &config.debug);\\n\\n }\\n\\n res\\n\\n}\\n\\n\\n\",\n \"file_path\": \"yarte_codegen/src/wasm/client/tests/mod.rs\",\n \"rank\": 52,\n \"score\": 212626.9150366335\n },\n {\n \"content\": \"/// Parse syn expression comma separated list\\n\\nfn eat_expr_list(i: &str) -> Result<Vec<Expr>, MiddleError> {\\n\\n parse_str::<ExprList>(i)\\n\\n .map(Into::into)\\n\\n .map_err(|e| MiddleError::new(i, e))\\n\\n}\\n\\n\\n\",\n \"file_path\": \"yarte_parser/src/lib.rs\",\n \"rank\": 53,\n \"score\": 208587.61611025035\n },\n {\n \"content\": \"#[inline(always)]\\n\\npub fn empty_set(_: ExpandedName) -> bool {\\n\\n false\\n\\n}\\n\\n\\n\\ndeclare_tag_set!(pub html_default_scope =\\n\\n \\\"applet\\\" \\\"caption\\\" \\\"html\\\" \\\"table\\\" \\\"td\\\" \\\"th\\\" \\\"marquee\\\" \\\"object\\\" \\\"template\\\");\\n\\n\\n\",\n \"file_path\": \"yarte_html/src/tree_builder/tag_sets.rs\",\n \"rank\": 54,\n \"score\": 206593.55440433102\n },\n {\n \"content\": \"fn build_teams() -> Vec<Team> {\\n\\n vec![\\n\\n Team {\\n\\n name: \\\"Jiangsu\\\".into(),\\n\\n score: 43,\\n\\n },\\n\\n Team {\\n\\n name: \\\"Beijing\\\".into(),\\n\\n score: 27,\\n\\n },\\n\\n Team {\\n\\n name: \\\"Guangzhou\\\".into(),\\n\\n score: 22,\\n\\n },\\n\\n Team {\\n\\n name: \\\"Shandong\\\".into(),\\n\\n score: 12,\\n\\n },\\n\\n ]\\n\\n}\\n\\n\\n\",\n \"file_path\": \"benches/src/all.rs\",\n \"rank\": 55,\n \"score\": 203901.75017268548\n },\n {\n \"content\": \"fn to_domfmt_init(ir: Vec<HIR>) -> ParseResult<Vec<HIR>> {\\n\\n let html = get_html(&ir);\\n\\n let sink = match parse_document(&html) {\\n\\n Ok(a) => a,\\n\\n Err(_) => parse_fragment(&html)?,\\n\\n };\\n\\n\\n\\n serialize_domfmt(sink, ir, Default::default())\\n\\n}\\n\\n\\n\",\n \"file_path\": \"yarte_dom/src/dom_fmt.rs\",\n \"rank\": 56,\n \"score\": 201625.8539472382\n },\n {\n \"content\": \"pub fn get_leaf_text(children: Document, solver: &Solver) -> (BTreeSet<VarId>, TokenStream) {\\n\\n LeafTextBuilder::new(solver).build(children)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"yarte_codegen/src/wasm/client/leaf_text.rs\",\n \"rank\": 57,\n \"score\": 201584.45367562753\n },\n {\n \"content\": \"#[inline]\\n\\nfn at_helper(i: Cursor, lws: bool) -> PResult<Node> {\\n\\n let (c, (name, args, rws)) = do_parse!(\\n\\n i,\\n\\n ws >> tag!(\\\"@\\\")\\n\\n >> name: call!(spanned, identifier)\\n\\n >> args: args_list\\n\\n >> rws: end_expr\\n\\n >> ((name, args, rws))\\n\\n )?;\\n\\n\\n\\n macro_rules! check_args_len {\\n\\n ($len:expr) => {\\n\\n if args.t().len() != $len {\\n\\n return Err(LexError::Fail(PError::AtHelperArgsLen($len), args.span()));\\n\\n }\\n\\n };\\n\\n }\\n\\n match *name.t() {\\n\\n JSON => {\\n\\n check_args_len!(1);\\n\",\n \"file_path\": \"yarte_parser/src/lib.rs\",\n \"rank\": 58,\n \"score\": 201392.16200866314\n },\n {\n \"content\": \"/// Eat safe Node\\n\\nfn safe(i: Cursor, lws: bool) -> PResult<Node> {\\n\\n let mut at = 0;\\n\\n let (c, rws, s) = loop {\\n\\n if let Some(j) = i.adv_find(at, '}') {\\n\\n let n = &i.rest[at + j + 1..];\\n\\n if n.starts_with(\\\"~}}\\\") {\\n\\n break (i.adv(at + j + 4), true, &i.rest[..at + j]);\\n\\n } else if n.starts_with(\\\"}}\\\") {\\n\\n break (i.adv(at + j + 3), false, &i.rest[..at + j]);\\n\\n }\\n\\n\\n\\n at += j + 1;\\n\\n } else {\\n\\n return Err(LexError::Next(PError::Safe(DOption::None), Span::from(i)));\\n\\n }\\n\\n };\\n\\n\\n\\n let (_, s, _) = trim(s);\\n\\n eat_expr(s)\\n\\n .map(|e| {\\n\",\n \"file_path\": \"yarte_parser/src/lib.rs\",\n \"rank\": 59,\n \"score\": 201391.95357238268\n },\n {\n \"content\": \"/// Eat raw Node\\n\\nfn raw(i: Cursor, a_lws: bool) -> PResult<Node> {\\n\\n let (i, a_rws) = end_expr(i)?;\\n\\n let mut at = 0;\\n\\n\\n\\n let (c, (j, b_ws)) = loop {\\n\\n if let Some(j) = i.adv_find(at, '{') {\\n\\n let n = i.adv(at + j + 1);\\n\\n if n.chars().next().map(|x| '{' == x).unwrap_or(false) {\\n\\n if let Ok((c, ws)) = do_parse!(\\n\\n n.adv(1),\\n\\n lws: opt!(tag!(\\\"~\\\")) >> tag!(\\\"/R\\\") >> rws: end_expr >> ((lws.is_some(), rws))\\n\\n ) {\\n\\n break (c, (&i.rest[..at + j], ws));\\n\\n } else {\\n\\n at += j + 4;\\n\\n }\\n\\n } else {\\n\\n at += j + 1;\\n\\n }\\n\\n } else {\\n\",\n \"file_path\": \"yarte_parser/src/lib.rs\",\n \"rank\": 60,\n \"score\": 201391.95357238268\n },\n {\n \"content\": \"/// Eat helper Node\\n\\nfn hel(i: Cursor, a_lws: bool) -> PResult<Node> {\\n\\n if i.starts_with(\\\">\\\") {\\n\\n return partial_block(i.adv(1), a_lws).map(|(c, x)| (c, Node::PartialBlock(x)));\\n\\n }\\n\\n\\n\\n let (i, (above_ws, ident, args)) = do_parse!(\\n\\n i,\\n\\n ws >> ident: call!(spanned, identifier)\\n\\n >> args: arguments\\n\\n >> rws: end_expr\\n\\n >> (((a_lws, rws), ident, args))\\n\\n )?;\\n\\n\\n\\n if ident.0.eq(\\\"if\\\") {\\n\\n return if_else(above_ws, i, args);\\n\\n }\\n\\n\\n\\n let (c, (below_ws, block, c_ident)) = do_parse!(\\n\\n i,\\n\\n block: eat\\n\",\n \"file_path\": \"yarte_parser/src/lib.rs\",\n \"rank\": 61,\n \"score\": 201391.95357238268\n },\n {\n \"content\": \"fn res(c: Cursor, lws: bool) -> PResult<Node> {\\n\\n do_parse!(\\n\\n c,\\n\\n ws >> expr: arguments >> rws: end_expr >> (Node::RExpr((lws, rws), expr))\\n\\n )\\n\\n}\\n\\n\\n\\n/// Wrap Partial into the Node\\n\",\n \"file_path\": \"yarte_parser/src/lib.rs\",\n \"rank\": 62,\n \"score\": 201386.68999182188\n },\n {\n \"content\": \"fn write_bb(b: &[u8], buf: &TokenStream) -> TokenStream {\\n\\n b.iter()\\n\\n .enumerate()\\n\\n .map(|(i, b)| {\\n\\n quote! {\\n\\n *#buf.buf_ptr().add(#i) = #b;\\n\\n }\\n\\n })\\n\\n .flatten()\\n\\n .collect()\\n\\n}\\n\\n\\n\\npub struct HTMLBytesCodeGen<'a> {\\n\\n buf: &'a syn::Expr,\\n\\n}\\n\\n\\n\\nimpl<'a> HTMLBytesCodeGen<'a> {\\n\\n pub fn new(buf: &syn::Expr) -> HTMLBytesCodeGen {\\n\\n HTMLBytesCodeGen { buf }\\n\\n }\\n\",\n \"file_path\": \"yarte_codegen/src/bytes.rs\",\n \"rank\": 63,\n \"score\": 196672.3116659344\n },\n {\n \"content\": \"fn make_tag_pattern(binding: &TokenStream, tag: Tag) -> TokenStream {\\n\\n let kind = match tag.kind {\\n\\n TagKind::StartTag => quote!(crate::tokenizer::StartTag),\\n\\n TagKind::EndTag => quote!(crate::tokenizer::EndTag),\\n\\n };\\n\\n let name_field = if let Some(name) = tag.name {\\n\\n let name = name.to_string();\\n\\n quote!(name: y_name!(#name),)\\n\\n } else {\\n\\n quote!()\\n\\n };\\n\\n quote! {\\n\\n crate::tree_builder::types::TagToken(#binding crate::tokenizer::Tag { kind: #kind, #name_field .. })\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"yarte_html/macros/match_token.rs\",\n \"rank\": 64,\n \"score\": 195793.97248582955\n },\n {\n \"content\": \"fn eat_partials(mut i: Cursor) -> PResult<Vec<Partial>> {\\n\\n let mut nodes = vec![];\\n\\n\\n\\n loop {\\n\\n if let Some(j) = i.find('{') {\\n\\n macro_rules! _switch {\\n\\n ($n:expr, $t:expr, $ws:expr) => {\\n\\n match $n {\\n\\n b'>' => {\\n\\n let i = i.adv(j + 3 + $t);\\n\\n match partial_block(i, $ws) {\\n\\n Ok((i, n)) => {\\n\\n nodes.push(n);\\n\\n i\\n\\n }\\n\\n Err(e @ LexError::Fail(..)) => break Err(e),\\n\\n Err(LexError::Next(..)) => i,\\n\\n }\\n\\n }\\n\\n b'R' => {\\n\",\n \"file_path\": \"yarte_parser/src/pre_partials.rs\",\n \"rank\": 65,\n \"score\": 195649.8728981492\n },\n {\n \"content\": \"#[inline]\\n\\nfn if_else(abode_ws: Ws, i: Cursor, args: SExpr) -> PResult<Node> {\\n\\n let mut nodes = vec![];\\n\\n let mut tail = None;\\n\\n\\n\\n let (mut i, first) = eat_if(i)?;\\n\\n\\n\\n loop {\\n\\n if let Ok((c, lws)) = do_parse!(\\n\\n i,\\n\\n lws: opt!(tag!(\\\"~\\\")) >> ws >> tag!(ELSE) >> (lws.is_some())\\n\\n ) {\\n\\n if let Ok((c, _)) = tag!(skip_ws(c), IF) {\\n\\n let (c, b) = map_fail!(do_parse!(\\n\\n c,\\n\\n ws >> args: arguments\\n\\n >> rws: end_expr\\n\\n >> block: eat_if\\n\\n >> (((lws, rws), args, block))\\n\\n ))?;\\n\\n nodes.push(b);\\n\",\n \"file_path\": \"yarte_parser/src/lib.rs\",\n \"rank\": 66,\n \"score\": 195258.60452733014\n },\n {\n \"content\": \"#[proc_macro]\\n\\npub fn zip_with_spaces(token: TokenStream) -> TokenStream {\\n\\n let expr: ExprList = parse(token).unwrap();\\n\\n let expr: Vec<Vec<String>> = expr.into();\\n\\n let mut expr = expr.iter();\\n\\n let first = expr.next().expect(\\\"Need minimum two element\\\");\\n\\n let mut buff = vec![];\\n\\n for i in first {\\n\\n _zip(i, &mut expr.clone(), &mut buff)\\n\\n }\\n\\n let len = buff.len();\\n\\n\\n\\n quote!(static ZIPPED: [&str; #len] = [#(#buff),*];).into()\\n\\n}\\n\\n\\n\",\n \"file_path\": \"yarte_wasm_app/benches/codegen/src/lib.rs\",\n \"rank\": 67,\n \"score\": 193898.83467211915\n },\n {\n \"content\": \"#[inline]\\n\\npub fn get_self_id() -> u64 {\\n\\n SELF_ID.with(|x| *x)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"yarte_codegen/src/wasm/client/utils.rs\",\n \"rank\": 68,\n \"score\": 192810.44938961728\n },\n {\n \"content\": \"fn is_ident_start(c: char) -> bool {\\n\\n ('a' <= c && c <= 'z')\\n\\n || ('A' <= c && c <= 'Z')\\n\\n || c == '_'\\n\\n || (c > '\\\\x7f' && UnicodeXID::is_xid_start(c))\\n\\n}\\n\\n\\n\",\n \"file_path\": \"yarte_parser/src/lib.rs\",\n \"rank\": 69,\n \"score\": 192590.184692809\n },\n {\n \"content\": \"fn is_ident_continue(c: char) -> bool {\\n\\n ('a' <= c && c <= 'z')\\n\\n || ('A' <= c && c <= 'Z')\\n\\n || c == '_'\\n\\n || ('0' <= c && c <= '9')\\n\\n || (c > '\\\\x7f' && UnicodeXID::is_xid_continue(c))\\n\\n}\\n\\n\\n\",\n \"file_path\": \"yarte_parser/src/lib.rs\",\n \"rank\": 70,\n \"score\": 192590.184692809\n },\n {\n \"content\": \"fn to_domfmt(ir: Vec<HIR>, opts: SerializerOpt) -> ParseResult<Vec<HIR>> {\\n\\n let html = get_html(&ir);\\n\\n serialize_domfmt(parse_fragment(&html)?, ir, opts)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"yarte_dom/src/dom_fmt.rs\",\n \"rank\": 71,\n \"score\": 191988.68022267864\n },\n {\n \"content\": \"fn write_bb(b: &[u8]) -> TokenStream {\\n\\n b.iter()\\n\\n .enumerate()\\n\\n .map(|(i, b)| {\\n\\n quote! {\\n\\n *buf_ptr!().add(buf_cur + #i) = #b;\\n\\n }\\n\\n })\\n\\n .flatten()\\n\\n .collect()\\n\\n}\\n\\n\\n\\nimpl<'a, T: CodeGen> CodeGen for FixedCodeGen<'a, T> {\\n\\n fn gen(&mut self, v: Vec<HIR>) -> TokenStream {\\n\\n let mut tokens = TokenStream::new();\\n\\n\\n\\n self.template(v, &mut tokens);\\n\\n\\n\\n tokens\\n\\n }\\n\",\n \"file_path\": \"yarte_codegen/src/fixed.rs\",\n \"rank\": 72,\n \"score\": 189130.2472921813\n },\n {\n \"content\": \"pub fn is_mark(s: &str) -> bool {\\n\\n s.len() == MARK_LEN + HASH_LEN && &s[..MARK_LEN] == MARK && parse_id(&s[MARK_LEN..]).is_some()\\n\\n}\\n\\n\\n\",\n \"file_path\": \"yarte_html/src/utils.rs\",\n \"rank\": 73,\n \"score\": 188498.4307690896\n },\n {\n \"content\": \"fn write_3_bytes_bb(b: &mut criterion::Bencher) {\\n\\n const BYTES: usize = 3;\\n\\n unsafe {\\n\\n b.iter(|| {\\n\\n const LEN: usize = BYTES * STEPS;\\n\\n let mut buf: [u8; LEN] = MaybeUninit::uninit().assume_init();\\n\\n let mut curr = 0;\\n\\n let buf_ptr = buf.as_mut_ptr();\\n\\n for _ in 0..STEPS {\\n\\n if LEN < curr + BYTES {\\n\\n panic!(\\\"buffer overflow\\\");\\n\\n } else {\\n\\n *buf_ptr.add(curr) = b'a';\\n\\n *buf_ptr.add(curr + 1) = b'a';\\n\\n *buf_ptr.add(curr + 2) = b'a';\\n\\n curr += BYTES;\\n\\n }\\n\\n }\\n\\n black_box(&buf[..curr]);\\n\\n })\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"benches/src/all.rs\",\n \"rank\": 74,\n \"score\": 188081.02976334246\n },\n {\n \"content\": \"/// Is the character an ASCII alphanumeric character?\\n\\npub fn is_ascii_alnum(c: char) -> bool {\\n\\n matches!(c, '0'..='9' | 'a'..='z' | 'A'..='Z')\\n\\n}\\n\\n\\n\",\n \"file_path\": \"yarte_html/src/utils.rs\",\n \"rank\": 75,\n \"score\": 185439.5064912872\n },\n {\n \"content\": \"/// ASCII whitespace characters, as defined by\\n\\n/// tree construction modes that treat them specially.\\n\\npub fn is_ascii_whitespace(c: char) -> bool {\\n\\n matches!(c, '\\\\t' | '\\\\r' | '\\\\n' | '\\\\x0C' | ' ')\\n\\n}\\n\\n\\n\\npub const MARK: &str = \\\"yartehashhtmlexpressionsattt\\\";\\n\\nconst MARK_LEN: usize = MARK.len();\\n\\nconst S: &str = \\\"0x\\\";\\n\\nconst S_LEN: usize = S.len();\\n\\n// 0x00_00_00_00\\n\\npub const HASH_LEN: usize = 10;\\n\\n\\n\",\n \"file_path\": \"yarte_html/src/utils.rs\",\n \"rank\": 76,\n \"score\": 185439.5064912872\n },\n {\n \"content\": \"fn parse(rest: &str) -> Vec<SNode> {\\n\\n _parse(Cursor { rest, off: 0 }).unwrap()\\n\\n}\\n\\n\\n\",\n \"file_path\": \"yarte_parser/src/test.rs\",\n \"rank\": 77,\n \"score\": 182650.03100207425\n },\n {\n \"content\": \"/// Eat whitespace flag in end of expressions `.. }}` or `.. ~}}`\\n\\nfn end_expr(i: Cursor) -> PResult<bool> {\\n\\n let c = skip_ws(i);\\n\\n if c.starts_with(\\\"~}}\\\") {\\n\\n Ok((c.adv(3), true))\\n\\n } else if c.starts_with(\\\"}}\\\") {\\n\\n Ok((c.adv(2), false))\\n\\n } else {\\n\\n Err(LexError::Fail(\\n\\n PError::EndExpression,\\n\\n Span::from_cursor(i, c),\\n\\n ))\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"yarte_parser/src/lib.rs\",\n \"rank\": 78,\n \"score\": 182536.60386503692\n },\n {\n \"content\": \"fn big_table(b: &mut criterion::Bencher, size: usize) {\\n\\n let t = BigTable {\\n\\n table: build_big_table(size),\\n\\n };\\n\\n b.iter(|| t.call().unwrap());\\n\\n}\\n\\n\\n\",\n \"file_path\": \"benches/src/all.rs\",\n \"rank\": 79,\n \"score\": 178306.91834108363\n },\n {\n \"content\": \"#[test]\\n\\nfn test_with_index() {\\n\\n let t = WithSuperIndexTemplate {\\n\\n this: &[Holder { hold: 127 }],\\n\\n };\\n\\n assert_eq!(\\\"Hello, 1271271!\\\", t.call().unwrap());\\n\\n}\\n\",\n \"file_path\": \"yarte/tests/super.rs\",\n \"rank\": 80,\n \"score\": 176410.7416287016\n },\n {\n \"content\": \"#[test]\\n\\nfn test_with_fields() {\\n\\n let t = WithFieldsTemplate {\\n\\n names: (\\n\\n Name {\\n\\n first: \\\"foo\\\",\\n\\n last: \\\"bar\\\",\\n\\n },\\n\\n Name {\\n\\n first: \\\"fOO\\\",\\n\\n last: \\\"bAR\\\",\\n\\n },\\n\\n ),\\n\\n };\\n\\n assert_eq!(\\\"Hello, foo bar and fOO bAR!\\\", t.call().unwrap());\\n\\n}\\n\\n\\n\",\n \"file_path\": \"yarte/tests/expressions.rs\",\n \"rank\": 81,\n \"score\": 176255.46263745846\n },\n {\n \"content\": \"#[test]\\n\\nfn test_let_if_some() {\\n\\n let t = LetIfSomeTemplate { cond: Some(false) };\\n\\n assert_eq!(\\\"Hello, bar!\\\", t.call().unwrap());\\n\\n}\\n\\n\\n\",\n \"file_path\": \"yarte/tests/expressions.rs\",\n \"rank\": 82,\n \"score\": 176185.78980165158\n },\n {\n \"content\": \"#[test]\\n\\nfn test_let_with() {\\n\\n let t = LetWithTemplate { name: \\\"world\\\" };\\n\\n assert_eq!(\\\"Hello, worldworld!\\\", t.call().unwrap());\\n\\n}\\n\\n\\n\",\n \"file_path\": \"yarte/tests/expressions.rs\",\n \"rank\": 83,\n \"score\": 176185.78980165158\n },\n {\n \"content\": \"#[test]\\n\\nfn test_let_if() {\\n\\n let t = LetIfTemplate { cond: true };\\n\\n assert_eq!(\\\"Hello, true false foo!\\\", t.call().unwrap());\\n\\n}\\n\\n\\n\",\n \"file_path\": \"yarte/tests/expressions.rs\",\n \"rank\": 84,\n \"score\": 176185.78980165158\n },\n {\n \"content\": \"#[test]\\n\\nfn test_let() {\\n\\n let t = LetTemplate { name: \\\"world\\\" };\\n\\n assert_eq!(\\\"Hello, world!\\\", t.call().unwrap());\\n\\n}\\n\\n\\n\",\n \"file_path\": \"yarte/tests/expressions.rs\",\n \"rank\": 85,\n \"score\": 176185.78980165158\n },\n {\n \"content\": \"#[test]\\n\\nfn test_match() {\\n\\n let t = MatchTemplate { a: Err(Error) };\\n\\n assert_eq!(\\\"&\\\", t.call().unwrap());\\n\\n\\n\\n let t = MatchTemplate { a: Ok(\\\"1\\\") };\\n\\n assert_eq!(\\\"1\\\", t.call().unwrap());\\n\\n}\\n\\n\\n\",\n \"file_path\": \"yarte/tests/expressions.rs\",\n \"rank\": 86,\n \"score\": 176157.78647271486\n },\n {\n \"content\": \"fn io_big_table(b: &mut criterion::Bencher, size: usize) {\\n\\n let table = build_big_table(size);\\n\\n let mut buf = vec![];\\n\\n let _ = _io_big_table(&mut buf, &table);\\n\\n let len = buf.len();\\n\\n b.iter(|| {\\n\\n let mut buf = Vec::with_capacity(len);\\n\\n _io_big_table(&mut buf, &table).unwrap();\\n\\n buf\\n\\n });\\n\\n}\\n\\n\\n\",\n \"file_path\": \"benches/src/all.rs\",\n \"rank\": 87,\n \"score\": 175392.73490759052\n },\n {\n \"content\": \"fn fixed_big_table(b: &mut criterion::Bencher, size: usize) {\\n\\n let t = BigTableF {\\n\\n table: build_big_table(size),\\n\\n };\\n\\n b.iter(|| {\\n\\n black_box(unsafe { t.call(&mut [MaybeUninit::uninit(); 109915]) }.unwrap());\\n\\n });\\n\\n}\\n\\n\\n\",\n \"file_path\": \"benches/src/all.rs\",\n \"rank\": 88,\n \"score\": 175392.73490759052\n },\n {\n \"content\": \"fn bytes_big_table(b: &mut criterion::Bencher, size: usize) {\\n\\n let t = BigTableB {\\n\\n table: build_big_table(size),\\n\\n };\\n\\n b.iter(|| t.call::<BytesMut>(109915));\\n\\n}\\n\\n\\n\",\n \"file_path\": \"benches/src/all.rs\",\n \"rank\": 89,\n \"score\": 175392.73490759052\n },\n {\n \"content\": \"fn big_table_text(b: &mut criterion::Bencher, size: usize) {\\n\\n let t = BigTableDisplay {\\n\\n table: build_big_table(size),\\n\\n };\\n\\n b.iter(|| t.call().unwrap());\\n\\n}\\n\\n\\n\\n// Bytes\\n\",\n \"file_path\": \"benches/src/all.rs\",\n \"rank\": 90,\n \"score\": 175392.73490759052\n },\n {\n \"content\": \"fn fmt_big_table(b: &mut criterion::Bencher, size: usize) {\\n\\n let t = BigTableFmt {\\n\\n table: build_big_table(size),\\n\\n };\\n\\n let mut buf = String::with_capacity(t.to_string().len());\\n\\n b.iter(|| {\\n\\n buf.clear();\\n\\n write!(buf, \\\"{}\\\", t).unwrap();\\n\\n });\\n\\n}\\n\\n\\n\",\n \"file_path\": \"benches/src/all.rs\",\n \"rank\": 91,\n \"score\": 175392.73490759052\n },\n {\n \"content\": \"fn raw_big_table(b: &mut criterion::Bencher, size: usize) {\\n\\n unsafe {\\n\\n let table = build_big_table(size);\\n\\n const LEN: usize = 109915;\\n\\n\\n\\n b.iter(|| {\\n\\n let mut buf: [u8; LEN] = MaybeUninit::uninit().assume_init();\\n\\n let mut curr = 0;\\n\\n macro_rules! buf_ptr {\\n\\n () => {\\n\\n &mut buf as *mut _ as *mut u8\\n\\n };\\n\\n }\\n\\n\\n\\n macro_rules! write_b {\\n\\n ($b:expr) => {\\n\\n if LEN < curr + $b.len() {\\n\\n panic!(\\\"buffer overflow\\\");\\n\\n } else {\\n\\n for i in $b {\\n\",\n \"file_path\": \"benches/src/all.rs\",\n \"rank\": 92,\n \"score\": 175392.73490759052\n },\n {\n \"content\": \"pub fn check_attr_is_text(attr: Attribute) -> bool {\\n\\n attr.value.len() == 1\\n\\n && match attr.value[0] {\\n\\n ExprOrText::Text(..) => true,\\n\\n ExprOrText::Expr(..) => false,\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"yarte_codegen/src/wasm/client/utils.rs\",\n \"rank\": 93,\n \"score\": 174527.71040102688\n },\n {\n \"content\": \"pub fn parse_document(doc: &str) -> ParseResult<Sink> {\\n\\n let parser = driver::parse_document(Sink::default()).from_utf8();\\n\\n\\n\\n parser.one(doc.as_bytes())\\n\\n}\\n\\n\\n\",\n \"file_path\": \"yarte_dom/src/sink.rs\",\n \"rank\": 94,\n \"score\": 173700.6099892016\n },\n {\n \"content\": \"#[inline]\\n\\npub fn is_inner(attrs: &[syn::Attribute]) -> bool {\\n\\n attrs.iter().any(|attr| attr.path.is_ident(\\\"inner\\\"))\\n\\n}\\n\\n\\n\",\n \"file_path\": \"yarte_codegen/src/wasm/client/utils.rs\",\n \"rank\": 95,\n \"score\": 173534.0937544771\n },\n {\n \"content\": \"fn run_n(app: &mut NonKeyed, n: usize) {\\n\\n let update_n = min(n, app.data.len());\\n\\n\\n\\n // ?? #macro mark_data_update(for i in\\n\\n for (i, (dom, row)) in app\\n\\n .tbody_children\\n\\n .iter_mut()\\n\\n .zip(app.data.iter_mut())\\n\\n .enumerate()\\n\\n .take(update_n)\\n\\n {\\n\\n row.id = app.id + i as usize;\\n\\n row.label = (*ZIPPED.choose(&mut app.rng).unwrap()).to_string();\\n\\n // or #macro mark_data_\\n\\n dom.t_root = 0xFF;\\n\\n // /macro\\n\\n }\\n\\n // /macro\\n\\n\\n\\n for i in update_n..n {\\n\",\n \"file_path\": \"yarte_wasm_app/benches/src/handler.rs\",\n \"rank\": 96,\n \"score\": 173117.58982431918\n },\n {\n \"content\": \"#[test]\\n\\nfn test_self_method() {\\n\\n let t = SelfMethodTemplate { s: \\\"foo\\\" };\\n\\n assert_eq!(t.call().unwrap(), \\\"foo\\\");\\n\\n}\\n\\n\\n\",\n \"file_path\": \"yarte/tests/expressions.rs\",\n \"rank\": 97,\n \"score\": 172700.41347005198\n },\n {\n \"content\": \"#[test]\\n\\nfn test_let_else_if_some() {\\n\\n let t = LetElseIfSomeTemplate {\\n\\n cond: Some(false),\\n\\n check: Some(false),\\n\\n };\\n\\n assert_eq!(\\\"Hello, bar!\\\", t.call().unwrap());\\n\\n let t = LetElseIfSomeTemplate {\\n\\n cond: Some(true),\\n\\n check: Some(false),\\n\\n };\\n\\n assert_eq!(\\\"Hello, foo!\\\", t.call().unwrap());\\n\\n let t = LetElseIfSomeTemplate {\\n\\n cond: None,\\n\\n check: Some(true),\\n\\n };\\n\\n assert_eq!(\\\"Hello, baa!\\\", t.call().unwrap());\\n\\n let t = LetElseIfSomeTemplate {\\n\\n cond: None,\\n\\n check: Some(false),\\n\\n };\\n\\n assert_eq!(\\\"Hello, fun!\\\", t.call().unwrap());\\n\\n let t = LetElseIfSomeTemplate {\\n\\n cond: None,\\n\\n check: None,\\n\\n };\\n\\n assert_eq!(\\\"Hello, None!\\\", t.call().unwrap());\\n\\n}\\n\\n\\n\",\n \"file_path\": \"yarte/tests/expressions.rs\",\n \"rank\": 98,\n \"score\": 172635.92956636127\n },\n {\n \"content\": \"#[test]\\n\\nfn test_let_closure() {\\n\\n let t = LetClosureTemplate { name: \\\"world\\\" };\\n\\n assert_eq!(\\\"worldworld\\\", t.call().unwrap());\\n\\n}\\n\\n\\n\",\n \"file_path\": \"yarte/tests/expressions.rs\",\n \"rank\": 99,\n \"score\": 172635.92956636127\n }\n]","isConversational":false}}},{"rowIdx":2360,"cells":{"lang":{"kind":"string","value":"Rust"},"file_path":{"kind":"string","value":"src/atsame70q21b/usbhs/usbhs_deveptier_intrpt_mode.rs"},"repo_name":{"kind":"string","value":"tstellanova/atsame7x-pac"},"commit":{"kind":"string","value":"f7e24c71181651c141d0727379147c388661ce0e"},"file_code":{"kind":"string","value":"#[doc = \"Writer for register USBHS_DEVEPTIER_INTRPT_MODE[%s]\"]\npub type W = crate::W<u32, super::USBHS_DEVEPTIER_INTRPT_MODE>;\n#[doc = \"Register USBHS_DEVEPTIER_INTRPT_MODE[%s]\n`reset()`'s with value 0\"]\nimpl crate::ResetValue for super::USBHS_DEVEPTIER_INTRPT_MODE {\n type Type = u32;\n #[inline(always)]\n fn reset_value() -> Self::Type {\n 0\n }\n}\n#[doc = \"Write proxy for field `TXINES`\"]\npub struct TXINES_W<'a> {\n w: &'a mut W,\n}\nimpl<'a> TXINES_W<'a> {\n #[doc = r\"Sets the field bit\"]\n #[inline(always)]\n pub fn set_bit(self) -> &'a mut W {\n self.bit(true)\n }\n #[doc = r\"Clears the field bit\"]\n #[inline(always)]\n pub fn clear_bit(self) -> &'a mut W {\n self.bit(false)\n }\n #[doc = r\"Writes raw bits to the field\"]\n #[inline(always)]\n pub fn bit(self, value: bool) -> &'a mut W {\n self.w.bits = (self.w.bits & !0x01) | ((value as u32) & 0x01);\n self.w\n }\n}\n#[doc = \"Write proxy for field `RXOUTES`\"]\npub struct RXOUTES_W<'a> {\n w: &'a mut W,\n}\nimpl<'a> RXOUTES_W<'a> {\n #[doc = r\"Sets the field bit\"]\n #[inline(always)]\n pub fn set_bit(self) -> &'a mut W {\n self.bit(true)\n }\n #[doc = r\"Clears the field bit\"]\n #[inline(always)]\n pub fn clear_bit(self) -> &'a mut W {\n self.bit(false)\n }\n #[doc = r\"Writes raw bits to the field\"]\n #[inline(always)]\n pub fn bit(self, value: bool) -> &'a mut W {\n self.w.bits = (self.w.bits & !(0x01 << 1)) | (((value as u32) & 0x01) << 1);\n self.w\n }\n}\n#[doc = \"Write proxy for field `RXSTPES`\"]\npub struct RXSTPES_W<'a> {\n w: &'a mut W,\n}\nimpl<'a> RXSTPES_W<'a> {\n #[doc = r\"Sets the field bit\"]\n #[inline(always)]\n pub fn set_bit(self) -> &'a mut W {\n self.bit(true)\n }\n #[doc = r\"Clears the field bit\"]\n #[inline(always)]\n pub fn clear_bit(self) -> &'a mut W {\n self.bit(false)\n }\n #[doc = r\"Writes raw bits to the field\"]\n #[inline(always)]\n pub fn bit(self, value: bool) -> &'a mut W {\n self.w.bits = (self.w.bits & !(0x01 << 2)) | (((value as u32) & 0x01) << 2);\n self.w\n }\n}\n#[doc = \"Write proxy for field `NAKOUTES`\"]\npub struct NAKOUTES_W<'a> {\n w: &'a mut W,\n}\nimpl<'a> NAKOUTES_W<'a> {\n #[doc = r\"Sets the field bit\"]\n #[inline(always)]\n pub fn set_bit(self) -> &'a mut W {\n self.bit(true)\n }\n #[doc = r\"Clears the field bit\"]\n #[inline(always)]\n pub fn clear_bit(self) -> &'a mut W {\n self.bit(false)\n }\n #[doc = r\"Writes raw bits to the field\"]\n #[inline(always)]\n pub fn bit(self, value: bool) -> &'a mut W {\n self.w.bits = (self.w.bits & !(0x01 << 3)) | (((value as u32) & 0x01) << 3);\n self.w\n }\n}\n#[doc = \"Write proxy for field `NAKINES`\"]\npub struct NAKINES_W<'a> {\n w: &'a mut W,\n}\nimpl<'a> NAKINES_W<'a> {\n #[doc = r\"Sets the field bit\"]\n #[inline(always)]\n pub fn set_bit(self) -> &'a mut W {\n self.bit(true)\n }\n #[doc = r\"Clears the field bit\"]\n #[inline(always)]\n pub fn clear_bit(self) -> &'a mut W {\n self.bit(false)\n }\n #[doc = r\"Writes raw bits to the field\"]\n #[inline(always)]\n pub fn bit(self, value: bool) -> &'a mut W {\n self.w.bits = (self.w.bits & !(0x01 << 4)) | (((value as u32) & 0x01) << 4);\n self.w\n }\n}\n#[doc = \"Write proxy for field `OVERFES`\"]\npub struct OVERFES_W<'a> {\n w: &'a mut W,\n}\nimpl<'a> OVERFES_W<'a> {\n #[doc = r\"Sets the field bit\"]\n #[inline(always)]\n pub fn set_bit(self) -> &'a mut W {\n self.bit(true)\n }\n #[doc = r\"Clears the field bit\"]\n #[inline(always)]\n pub fn clear_bit(self) -> &'a mut W {\n self.bit(false)\n }\n #[doc = r\"Writes raw bits to the field\"]\n #[inline(always)]\n pub fn bit(self, value: bool) -> &'a mut W {\n self.w.bits = (self.w.bits & !(0x01 << 5)) | (((value as u32) & 0x01) << 5);\n self.w\n }\n}\n#[doc = \"Write proxy for field `STALLEDES`\"]\npub struct STALLEDES_W<'a> {\n w: &'a mut W,\n}\nimpl<'a> STALLEDES_W<'a> {\n #[doc = r\"Sets the field bit\"]\n #[inline(always)]\n pub fn set_bit(self) -> &'a mut W {\n self.bit(true)\n }\n #[doc = r\"Clears the field bit\"]\n #[inline(always)]\n pub fn clear_bit(self) -> &'a mut W {\n self.bit(false)\n }\n #[doc = r\"Writes raw bits to the field\"]\n #[inline(always)]\n pub fn bit(self, value: bool) -> &'a mut W {\n self.w.bits = (self.w.bits & !(0x01 << 6)) | (((value as u32) & 0x01) << 6);\n self.w\n }\n}\n#[doc = \"Write proxy for field `SHORTPACKETES`\"]\npub struct SHORTPACKETES_W<'a> {\n w: &'a mut W,\n}\nimpl<'a> SHORTPACKETES_W<'a> {\n #[doc = r\"Sets the field bit\"]\n #[inline(always)]\n pub fn set_bit(self) -> &'a mut W {\n self.bit(true)\n }\n #[doc = r\"Clears the field bit\"]\n #[inline(always)]\n pub fn clear_bit(self) -> &'a mut W {\n self.bit(false)\n }\n #[doc = r\"Writes raw bits to the field\"]\n #[inline(always)]\n pub fn bit(self, value: bool) -> &'a mut W {\n self.w.bits = (self.w.bits & !(0x01 << 7)) | (((value as u32) & 0x01) << 7);\n self.w\n }\n}\n#[doc = \"Write proxy for field `NBUSYBKES`\"]\npub struct NBUSYBKES_W<'a> {\n w: &'a mut W,\n}\nimpl<'a> NBUSYBKES_W<'a> {\n #[doc = r\"Sets the field bit\"]\n #[inline(always)]\n pub fn set_bit(self) -> &'a mut W {\n self.bit(true)\n }\n #[doc = r\"Clears the field bit\"]\n #[inline(always)]\n pub fn clear_bit(self) -> &'a mut W {\n self.bit(false)\n }\n #[doc = r\"Writes raw bits to the field\"]\n #[inline(always)]\n pub fn bit(self, value: bool) -> &'a mut W {\n self.w.bits = (self.w.bits & !(0x01 << 12)) | (((value as u32) & 0x01) << 12);\n self.w\n }\n}\n#[doc = \"Write proxy for field `KILLBKS`\"]\npub struct KILLBKS_W<'a> {\n w: &'a mut W,\n}\nimpl<'a> KILLBKS_W<'a> {\n #[doc = r\"Sets the field bit\"]\n #[inline(always)]\n pub fn set_bit(self) -> &'a mut W {\n self.bit(true)\n }\n #[doc = r\"Clears the field bit\"]\n #[inline(always)]\n pub fn clear_bit(self) -> &'a mut W {\n self.bit(false)\n }\n #[doc = r\"Writes raw bits to the field\"]\n #[inline(always)]\n pub fn bit(self, value: bool) -> &'a mut W {\n self.w.bits = (self.w.bits & !(0x01 << 13)) | (((value as u32) & 0x01) << 13);\n self.w\n }\n}\n#[doc = \"Write proxy for field `FIFOCONS`\"]\npub struct FIFOCONS_W<'a> {\n w: &'a mut W,\n}\nimpl<'a> FIFOCONS_W<'a> {\n #[doc = r\"Sets the field bit\"]\n #[inline(always)]\n pub fn set_bit(self) -> &'a mut W {\n self.bit(true)\n }\n #[doc = r\"Clears the field bit\"]\n #[inline(always)]\n pub fn clear_bit(self) -> &'a mut W {\n self.bit(false)\n }\n #[doc = r\"Writes raw bits to the field\"]\n #[inline(always)]\n pub fn bit(self, value: bool) -> &'a mut W {\n self.w.bits = (self.w.bits & !(0x01 << 14)) | (((value as u32) & 0x01) << 14);\n self.w\n }\n}\n#[doc = \"Write proxy for field `EPDISHDMAS`\"]\npub struct EPDISHDMAS_W<'a> {\n w: &'a mut W,\n}\nimpl<'a> EPDISHDMAS_W<'a> {\n #[doc = r\"Sets the field bit\"]\n #[inline(always)]\n pub fn set_bit(self) -> &'a mut W {\n self.bit(true)\n }\n #[doc = r\"Clears the field bit\"]\n #[inline(always)]\n pub fn clear_bit(self) -> &'a mut W {\n self.bit(false)\n }\n #[doc = r\"Writes raw bits to the field\"]\n #[inline(always)]\n pub fn bit(self, value: bool) -> &'a mut W {\n self.w.bits = (self.w.bits & !(0x01 << 16)) | (((value as u32) & 0x01) << 16);\n self.w\n }\n}\n#[doc = \"Write proxy for field `NYETDISS`\"]\npub struct NYETDISS_W<'a> {\n w: &'a mut W,\n}\nimpl<'a> NYETDISS_W<'a> {\n #[doc = r\"Sets the field bit\"]\n #[inline(always)]\n pub fn set_bit(self) -> &'a mut W {\n self.bit(true)\n }\n #[doc = r\"Clears the field bit\"]\n #[inline(always)]\n pub fn clear_bit(self) -> &'a mut W {\n self.bit(false)\n }\n #[doc = r\"Writes raw bits to the field\"]\n #[inline(always)]\n pub fn bit(self, value: bool) -> &'a mut W {\n self.w.bits = (self.w.bits & !(0x01 << 17)) | (((value as u32) & 0x01) << 17);\n self.w\n }\n}\n#[doc = \"Write proxy for field `RSTDTS`\"]\npub struct RSTDTS_W<'a> {\n w: &'a mut W,\n}\nimpl<'a> RSTDTS_W<'a> {\n #[doc = r\"Sets the field bit\"]\n #[inline(always)]\n pub fn set_bit(self) -> &'a mut W {\n self.bit(true)\n }\n #[doc = r\"Clears the field bit\"]\n #[inline(always)]\n pub fn clear_bit(self) -> &'a mut W {\n self.bit(false)\n }\n #[doc = r\"Writes raw bits to the field\"]\n #[inline(always)]\n pub fn bit(self, value: bool) -> &'a mut W {\n self.w.bits = (self.w.bits & !(0x01 << 18)) | (((value as u32) & 0x01) << 18);\n self.w\n }\n}\n#[doc = \"Write proxy for field `STALLRQS`\"]\npub struct STALLRQS_W<'a> {\n w: &'a mut W,\n}\nimpl<'a> STALLRQS_W<'a> {\n #[doc = r\"Sets the field bit\"]\n #[inline(always)]\n pub fn set_bit(self) -> &'a mut W {\n self.bit(true)\n }\n #[doc = r\"Clears the field bit\"]\n #[inline(always)]\n pub fn clear_bit(self) -> &'a mut W {\n self.bit(false)\n }\n #[doc = r\"Writes raw bits to the field\"]\n #[inline(always)]\n pub fn bit(self, value: bool) -> &'a mut W {\n self.w.bits = (self.w.bits & !(0x01 << 19)) | (((value as u32) & 0x01) << 19);\n self.w\n }\n}\nimpl W {\n #[doc = \"Bit 0 - Transmitted IN Data Interrupt Enable\"]\n #[inline(always)]\n pub fn txines(&mut self) -> TXINES_W {\n TXINES_W { w: self }\n }\n #[doc = \"Bit 1 - Received OUT Data Interrupt Enable\"]\n #[inline(always)]\n pub fn rxoutes(&mut self) -> RXOUTES_W {\n RXOUTES_W { w: self }\n }\n #[doc = \"Bit 2 - Received SETUP Interrupt Enable\"]\n #[inline(always)]\n pub fn rxstpes(&mut self) -> RXSTPES_W {\n RXSTPES_W { w: self }\n }\n #[doc = \"Bit 3 - NAKed OUT Interrupt Enable\"]\n #[inline(always)]\n pub fn nakoutes(&mut self) -> NAKOUTES_W {\n NAKOUTES_W { w: self }\n }\n #[doc = \"Bit 4 - NAKed IN Interrupt Enable\"]\n #[inline(always)]\n pub fn nakines(&mut self) -> NAKINES_W {\n NAKINES_W { w: self }\n }\n #[doc = \"Bit 5 - Overflow Interrupt Enable\"]\n #[inline(always)]\n pub fn overfes(&mut self) -> OVERFES_W {\n OVERFES_W { w: self }\n }\n #[doc = \"Bit 6 - STALLed Interrupt Enable\"]\n #[inline(always)]\n pub fn stalledes(&mut self) -> STALLEDES_W {\n STALLEDES_W { w: self }\n }\n #[doc = \"Bit 7 - Short Packet Interrupt Enable\"]\n #[inline(always)]\n pub fn shortpacketes(&mut self) -> SHORTPACKETES_W {\n SHORTPACKETES_W { w: self }\n }\n #[doc = \"Bit 12 - Number of Busy Banks Interrupt Enable\"]\n #[inline(always)]\n pub fn nbusybkes(&mut self) -> NBUSYBKES_W {\n NBUSYBKES_W { w: self }\n }\n #[doc = \"Bit 13 - Kill IN Bank\"]\n #[inline(always)]\n pub fn killbks(&mut self) -> KILLBKS_W {\n KILLBKS_W { w: self }\n }\n #[doc = \"Bit 14 - FIFO Control\"]\n #[inline(always)]\n pub fn fifocons(&mut self) -> FIFOCONS_W {\n FIFOCONS_W { w: self }\n }\n #[doc = \"Bit 16 - Endpoint Interrupts Disable HDMA Request Enable\"]\n #[inline(always)]\n pub fn epdishdmas(&mut self) -> EPDISHDMAS_W {\n EPDISHDMAS_W { w: self }\n }\n #[doc = \"Bit 17 - NYET Token Disable Enable\"]\n #[inline(always)]\n pub fn nyetdiss(&mut self) -> NYETDISS_W {\n NYETDISS_W { w: self }\n }\n #[doc = \"Bit 18 - Reset Data Toggle Enable\"]\n #[inline(always)]\n pub fn rstdts(&mut self) -> RSTDTS_W {\n RSTDTS_W { w: self }\n }\n #[doc = \"Bit 19 - STALL Request Enable\"]\n #[inline(always)]\n pub fn stallrqs(&mut self) -> STALLRQS_W {\n STALLRQS_W { w: self }\n }\n}\n"},"prefix":{"kind":"string","value":"#[doc = \"Writer for register USBHS_DEVEPTIER_INTRPT_MODE[%s]\"]\npub type W = crate::W<u32, super::USBHS_DEVEPTIER_INTRPT_MODE>;\n#[doc = \"Register USBHS_DEVEPTIER_INTRPT_MODE[%s]\n`reset()`'s with value 0\"]\nimpl crate::ResetValue for super::USBHS_DEVEPTIER_INTRPT_MODE {\n type Type = u32;\n #[inline(always)]\n fn reset_value() -> Self::Type {\n 0\n }\n}\n#[doc = \"Write proxy for field `TXINES`\"]\npub struct TXINES_W<'a> {\n w: &'a mut W,\n}\nimpl<'a> TXINES_W<'a> {\n #[doc = r\"Sets the field bit\"]\n #[inline(always)]\n pub fn set_bit(self) -> &'a mut W {\n self.bit(true)\n }\n #[doc = r\"Clears the field bit\"]\n #[inline(always)]\n pub fn clear_bit(self) -> &'a mut W {\n self.bit(false)\n }\n #[doc = r\"Writes raw bits to the field\"]\n #[inline(always)]\n pub fn bit(self, value: bool) -> &'a mut W {\n self.w.bits = (self.w.bits & !0x01) | ((value as u32) & 0x01);\n self.w\n }\n}\n#[doc = \"Write proxy for field `RXOUTES`\"]\npub struct RXOUTES_W<'a> {\n w: &'a mut W,\n}\nimpl<'a> RXOUTES_W<'a> {\n #[doc = r\"Sets the field bit\"]\n #[inline(always)]\n pub fn set_bit(self) -> &'a mut W {\n self.bit(true)\n }\n #[doc = r\"Clears the field bit\"]\n #[inline(always)]\n pub fn clear_bit(self) -> &'a mut W {\n self.bit(false)\n }\n #[doc = r\"Writes raw bits to the field\"]\n #[inline(always)]\n pub fn bit(self, value: bool) -> &'a mut W {\n self.w.bits = (self.w.bits & !(0x01 << 1)) | (((value as u32) & 0x01) << 1);\n self.w\n }\n}\n#[doc = \"Write proxy for field `RXSTPES`\"]\npub struct RXSTPES_W<'a> {\n w: &'a mut W,\n}\nimpl<'a> RXSTPES_W<'a> {\n #[doc = r\"Sets the field bit\"]\n #[inline(always)]\n pub fn set_bit(self) -> &'a mut W {\n self.bit(true)\n }\n #[doc = r\"Clears the field bit\"]\n #[inline(always)]\n pub fn clear_bit(self) -> &'a mut W {\n self.bit(false)\n }\n #[doc = r\"Writes raw bits to the field\"]\n #[inline(always)]\n pub fn bit(self, value: bool) -> &'a mut W {\n self.w.bits = (self.w.bits & !(0x01 << 2)) | (((value as u32) & 0x01) << 2);\n self.w\n }\n}\n#[doc = \"Write proxy for field `NAKOUTES`\"]\npub struct NAKOUTES_W<'a> {\n w: &'a mut W,\n}\nimpl<'a> NAKOUTES_W<'a> {\n #[doc = r\"Sets the field bit\"]\n #[inline(always)]\n pub fn set_bit(self) -> &'a mut W {\n self.bit(true)\n }\n #[doc = r\"Clears the field bit\"]\n #[inline(always)]\n pub fn clear_bit(self) -> &'a mut W {\n self.bit(false)\n }\n #[doc = r\"Writes raw bits to the field\"]\n #[inline(always)]\n pub fn bit(self, value: bool) -> &'a mut W {\n self.w.bits = (self.w.bits & !(0x01 << 3)) | (((value as u3"},"suffix":{"kind":"string","value":"#[inline(always)]\n pub fn clear_bit(self) -> &'a mut W {\n self.bit(false)\n }\n #[doc = r\"Writes raw bits to the field\"]\n #[inline(always)]\n pub fn bit(self, value: bool) -> &'a mut W {\n self.w.bits = (self.w.bits & !(0x01 << 7)) | (((value as u32) & 0x01) << 7);\n self.w\n }\n}\n#[doc = \"Write proxy for field `NBUSYBKES`\"]\npub struct NBUSYBKES_W<'a> {\n w: &'a mut W,\n}\nimpl<'a> NBUSYBKES_W<'a> {\n #[doc = r\"Sets the field bit\"]\n #[inline(always)]\n pub fn set_bit(self) -> &'a mut W {\n self.bit(true)\n }\n #[doc = r\"Clears the field bit\"]\n #[inline(always)]\n pub fn clear_bit(self) -> &'a mut W {\n self.bit(false)\n }\n #[doc = r\"Writes raw bits to the field\"]\n #[inline(always)]\n pub fn bit(self, value: bool) -> &'a mut W {\n self.w.bits = (self.w.bits & !(0x01 << 12)) | (((value as u32) & 0x01) << 12);\n self.w\n }\n}\n#[doc = \"Write proxy for field `KILLBKS`\"]\npub struct KILLBKS_W<'a> {\n w: &'a mut W,\n}\nimpl<'a> KILLBKS_W<'a> {\n #[doc = r\"Sets the field bit\"]\n #[inline(always)]\n pub fn set_bit(self) -> &'a mut W {\n self.bit(true)\n }\n #[doc = r\"Clears the field bit\"]\n #[inline(always)]\n pub fn clear_bit(self) -> &'a mut W {\n self.bit(false)\n }\n #[doc = r\"Writes raw bits to the field\"]\n #[inline(always)]\n pub fn bit(self, value: bool) -> &'a mut W {\n self.w.bits = (self.w.bits & !(0x01 << 13)) | (((value as u32) & 0x01) << 13);\n self.w\n }\n}\n#[doc = \"Write proxy for field `FIFOCONS`\"]\npub struct FIFOCONS_W<'a> {\n w: &'a mut W,\n}\nimpl<'a> FIFOCONS_W<'a> {\n #[doc = r\"Sets the field bit\"]\n #[inline(always)]\n pub fn set_bit(self) -> &'a mut W {\n self.bit(true)\n }\n #[doc = r\"Clears the field bit\"]\n #[inline(always)]\n pub fn clear_bit(self) -> &'a mut W {\n self.bit(false)\n }\n #[doc = r\"Writes raw bits to the field\"]\n #[inline(always)]\n pub fn bit(self, value: bool) -> &'a mut W {\n self.w.bits = (self.w.bits & !(0x01 << 14)) | (((value as u32) & 0x01) << 14);\n self.w\n }\n}\n#[doc = \"Write proxy for field `EPDISHDMAS`\"]\npub struct EPDISHDMAS_W<'a> {\n w: &'a mut W,\n}\nimpl<'a> EPDISHDMAS_W<'a> {\n #[doc = r\"Sets the field bit\"]\n #[inline(always)]\n pub fn set_bit(self) -> &'a mut W {\n self.bit(true)\n }\n #[doc = r\"Clears the field bit\"]\n #[inline(always)]\n pub fn clear_bit(self) -> &'a mut W {\n self.bit(false)\n }\n #[doc = r\"Writes raw bits to the field\"]\n #[inline(always)]\n pub fn bit(self, value: bool) -> &'a mut W {\n self.w.bits = (self.w.bits & !(0x01 << 16)) | (((value as u32) & 0x01) << 16);\n self.w\n }\n}\n#[doc = \"Write proxy for field `NYETDISS`\"]\npub struct NYETDISS_W<'a> {\n w: &'a mut W,\n}\nimpl<'a> NYETDISS_W<'a> {\n #[doc = r\"Sets the field bit\"]\n #[inline(always)]\n pub fn set_bit(self) -> &'a mut W {\n self.bit(true)\n }\n #[doc = r\"Clears the field bit\"]\n #[inline(always)]\n pub fn clear_bit(self) -> &'a mut W {\n self.bit(false)\n }\n #[doc = r\"Writes raw bits to the field\"]\n #[inline(always)]\n pub fn bit(self, value: bool) -> &'a mut W {\n self.w.bits = (self.w.bits & !(0x01 << 17)) | (((value as u32) & 0x01) << 17);\n self.w\n }\n}\n#[doc = \"Write proxy for field `RSTDTS`\"]\npub struct RSTDTS_W<'a> {\n w: &'a mut W,\n}\nimpl<'a> RSTDTS_W<'a> {\n #[doc = r\"Sets the field bit\"]\n #[inline(always)]\n pub fn set_bit(self) -> &'a mut W {\n self.bit(true)\n }\n #[doc = r\"Clears the field bit\"]\n #[inline(always)]\n pub fn clear_bit(self) -> &'a mut W {\n self.bit(false)\n }\n #[doc = r\"Writes raw bits to the field\"]\n #[inline(always)]\n pub fn bit(self, value: bool) -> &'a mut W {\n self.w.bits = (self.w.bits & !(0x01 << 18)) | (((value as u32) & 0x01) << 18);\n self.w\n }\n}\n#[doc = \"Write proxy for field `STALLRQS`\"]\npub struct STALLRQS_W<'a> {\n w: &'a mut W,\n}\nimpl<'a> STALLRQS_W<'a> {\n #[doc = r\"Sets the field bit\"]\n #[inline(always)]\n pub fn set_bit(self) -> &'a mut W {\n self.bit(true)\n }\n #[doc = r\"Clears the field bit\"]\n #[inline(always)]\n pub fn clear_bit(self) -> &'a mut W {\n self.bit(false)\n }\n #[doc = r\"Writes raw bits to the field\"]\n #[inline(always)]\n pub fn bit(self, value: bool) -> &'a mut W {\n self.w.bits = (self.w.bits & !(0x01 << 19)) | (((value as u32) & 0x01) << 19);\n self.w\n }\n}\nimpl W {\n #[doc = \"Bit 0 - Transmitted IN Data Interrupt Enable\"]\n #[inline(always)]\n pub fn txines(&mut self) -> TXINES_W {\n TXINES_W { w: self }\n }\n #[doc = \"Bit 1 - Received OUT Data Interrupt Enable\"]\n #[inline(always)]\n pub fn rxoutes(&mut self) -> RXOUTES_W {\n RXOUTES_W { w: self }\n }\n #[doc = \"Bit 2 - Received SETUP Interrupt Enable\"]\n #[inline(always)]\n pub fn rxstpes(&mut self) -> RXSTPES_W {\n RXSTPES_W { w: self }\n }\n #[doc = \"Bit 3 - NAKed OUT Interrupt Enable\"]\n #[inline(always)]\n pub fn nakoutes(&mut self) -> NAKOUTES_W {\n NAKOUTES_W { w: self }\n }\n #[doc = \"Bit 4 - NAKed IN Interrupt Enable\"]\n #[inline(always)]\n pub fn nakines(&mut self) -> NAKINES_W {\n NAKINES_W { w: self }\n }\n #[doc = \"Bit 5 - Overflow Interrupt Enable\"]\n #[inline(always)]\n pub fn overfes(&mut self) -> OVERFES_W {\n OVERFES_W { w: self }\n }\n #[doc = \"Bit 6 - STALLed Interrupt Enable\"]\n #[inline(always)]\n pub fn stalledes(&mut self) -> STALLEDES_W {\n STALLEDES_W { w: self }\n }\n #[doc = \"Bit 7 - Short Packet Interrupt Enable\"]\n #[inline(always)]\n pub fn shortpacketes(&mut self) -> SHORTPACKETES_W {\n SHORTPACKETES_W { w: self }\n }\n #[doc = \"Bit 12 - Number of Busy Banks Interrupt Enable\"]\n #[inline(always)]\n pub fn nbusybkes(&mut self) -> NBUSYBKES_W {\n NBUSYBKES_W { w: self }\n }\n #[doc = \"Bit 13 - Kill IN Bank\"]\n #[inline(always)]\n pub fn killbks(&mut self) -> KILLBKS_W {\n KILLBKS_W { w: self }\n }\n #[doc = \"Bit 14 - FIFO Control\"]\n #[inline(always)]\n pub fn fifocons(&mut self) -> FIFOCONS_W {\n FIFOCONS_W { w: self }\n }\n #[doc = \"Bit 16 - Endpoint Interrupts Disable HDMA Request Enable\"]\n #[inline(always)]\n pub fn epdishdmas(&mut self) -> EPDISHDMAS_W {\n EPDISHDMAS_W { w: self }\n }\n #[doc = \"Bit 17 - NYET Token Disable Enable\"]\n #[inline(always)]\n pub fn nyetdiss(&mut self) -> NYETDISS_W {\n NYETDISS_W { w: self }\n }\n #[doc = \"Bit 18 - Reset Data Toggle Enable\"]\n #[inline(always)]\n pub fn rstdts(&mut self) -> RSTDTS_W {\n RSTDTS_W { w: self }\n }\n #[doc = \"Bit 19 - STALL Request Enable\"]\n #[inline(always)]\n pub fn stallrqs(&mut self) -> STALLRQS_W {\n STALLRQS_W { w: self }\n }\n}\n"},"middle":{"kind":"string","value":"2) & 0x01) << 3);\n self.w\n }\n}\n#[doc = \"Write proxy for field `NAKINES`\"]\npub struct NAKINES_W<'a> {\n w: &'a mut W,\n}\nimpl<'a> NAKINES_W<'a> {\n #[doc = r\"Sets the field bit\"]\n #[inline(always)]\n pub fn set_bit(self) -> &'a mut W {\n self.bit(true)\n }\n #[doc = r\"Clears the field bit\"]\n #[inline(always)]\n pub fn clear_bit(self) -> &'a mut W {\n self.bit(false)\n }\n #[doc = r\"Writes raw bits to the field\"]\n #[inline(always)]\n pub fn bit(self, value: bool) -> &'a mut W {\n self.w.bits = (self.w.bits & !(0x01 << 4)) | (((value as u32) & 0x01) << 4);\n self.w\n }\n}\n#[doc = \"Write proxy for field `OVERFES`\"]\npub struct OVERFES_W<'a> {\n w: &'a mut W,\n}\nimpl<'a> OVERFES_W<'a> {\n #[doc = r\"Sets the field bit\"]\n #[inline(always)]\n pub fn set_bit(self) -> &'a mut W {\n self.bit(true)\n }\n #[doc = r\"Clears the field bit\"]\n #[inline(always)]\n pub fn clear_bit(self) -> &'a mut W {\n self.bit(false)\n }\n #[doc = r\"Writes raw bits to the field\"]\n #[inline(always)]\n pub fn bit(self, value: bool) -> &'a mut W {\n self.w.bits = (self.w.bits & !(0x01 << 5)) | (((value as u32) & 0x01) << 5);\n self.w\n }\n}\n#[doc = \"Write proxy for field `STALLEDES`\"]\npub struct STALLEDES_W<'a> {\n w: &'a mut W,\n}\nimpl<'a> STALLEDES_W<'a> {\n #[doc = r\"Sets the field bit\"]\n #[inline(always)]\n pub fn set_bit(self) -> &'a mut W {\n self.bit(true)\n }\n #[doc = r\"Clears the field bit\"]\n #[inline(always)]\n pub fn clear_bit(self) -> &'a mut W {\n self.bit(false)\n }\n #[doc = r\"Writes raw bits to the field\"]\n #[inline(always)]\n pub fn bit(self, value: bool) -> &'a mut W {\n self.w.bits = (self.w.bits & !(0x01 << 6)) | (((value as u32) & 0x01) << 6);\n self.w\n }\n}\n#[doc = \"Write proxy for field `SHORTPACKETES`\"]\npub struct SHORTPACKETES_W<'a> {\n w: &'a mut W,\n}\nimpl<'a> SHORTPACKETES_W<'a> {\n #[doc = r\"Sets the field bit\"]\n #[inline(always)]\n pub fn set_bit(self) -> &'a mut W {\n self.bit(true)\n }\n #[doc = r\"Clears the field bit\"]\n "},"strategy":{"kind":"string","value":"random"},"context_items":{"kind":"list like","value":[],"string":"[]","isConversational":false}}},{"rowIdx":2361,"cells":{"lang":{"kind":"string","value":"Rust"},"file_path":{"kind":"string","value":"crate/workspace_tests/src/game_input/system/shared_controller_input_update_system.rs"},"repo_name":{"kind":"string","value":"Lighty0410/autexousious"},"commit":{"kind":"string","value":"99d142d8fdbf2076f3fd929f61b8140d47cf6b86"},"file_code":{"kind":"string","value":"#[cfg(test)]\nmod tests {\n use std::any;\n\n use amethyst::{\n ecs::{Builder, Entity, Join, ReadStorage, WorldExt, WriteStorage},\n Error,\n };\n use amethyst_test::AmethystApplication;\n use game_input_model::{\n config::{ControlBindings, ControllerId},\n play::{ControllerInput, InputControlled, SharedInputControlled},\n };\n\n use game_input::SharedControllerInputUpdateSystem;\n\n #[test]\n fn merges_axes_controller_input_with_limit_correction() -> Result<(), Error> {\n let controller_count = 3;\n AmethystApplication::ui_base::<ControlBindings>()\n .with_system(\n SharedControllerInputUpdateSystem::new(),\n any::type_name::<SharedControllerInputUpdateSystem>(),\n &[],\n )\n .with_effect(move |world| {\n let controller_entities = (0..controller_count)\n .map(|n| {\n let controller_id = n as ControllerId;\n world\n .create_entity()\n .with(InputControlled::new(controller_id))\n .with(ControllerInput::default())\n .build()\n })\n .collect::<Vec<Entity>>();\n world.insert(controller_entities);\n\n let entity = world.create_entity().with(SharedInputControlled).build();\n world.insert(entity);\n })\n .with_assertion(|world| {\n let store = world.read_storage::<ControllerInput>();\n assert_eq!(\n Some(&ControllerInput::new(0., 0., false, false, false, false)),\n store.join().next()\n );\n })\n .with_effect(|world| {\n let (input_controlleds, mut controller_inputs) = world.system_data::<(\n ReadStorage<'_, InputControlled>,\n WriteStorage<'_, ControllerInput>,\n )>();\n (&input_controlleds, &mut controller_inputs)\n .join()\n .for_each(|(_, controller_input)| {\n controller_input.x_axis_value = -1.;\n controller_input.z_axis_value = 1.;\n });\n })\n .with_assertion(|world| {\n let entity = *world.read_resource::<Entity>();\n let store = world.read_storage::<ControllerInput>();\n assert_eq!(\n Some(&ControllerInput::new(-1., 1., false, false, false, false)),\n store.get(entity)\n );\n })\n .with_effect(|world| {\n let (input_controlleds, mut controller_inputs) = world.system_data::<(\n ReadStorage<'_, InputControlled>,\n WriteStorage<'_, ControllerInput>,\n )>();\n (&input_controlleds, &mut controller_inputs)\n .join()\n .for_each(|(_, controller_input)| {\n controller_input.x_axis_value = 1.;\n controller_input.z_axis_value = -1.;\n });\n })\n .with_assertion(|world| {\n let entity = *world.read_resource::<Entity>();\n let store = world.read_storage::<ControllerInput>();\n assert_eq!(\n Some(&ControllerInput::new(1., -1., false, false, false, false)),\n store.get(entity)\n );\n })\n .with_effect(|world| {\n let controller_entities = world\n .read_resource::<Vec<Entity>>()\n .iter()\n .map(|e| *e)\n .collect::<Vec<_>>();\n\n controller_entities.into_iter().for_each(|entity| {\n world\n .delete_entity(entity)\n .expect(\"Failed to delete entity.\")\n });\n })\n .with_assertion(|world| {\n \n let entity = *world.read_resource::<Entity>();\n let store = world.read_storage::<ControllerInput>();\n assert_eq!(\n Some(&ControllerInput::new(0., 0., false, false, false, false)),\n store.get(entity)\n );\n })\n .run()\n }\n\n #[test]\n fn merges_action_controller_input() -> Result<(), Error> {\n AmethystApplication::ui_base::<ControlBindings>()\n .with_system(\n SharedControllerInputUpdateSystem::new(),\n any::type_name::<SharedControllerInputUpdateSystem>(),\n &[],\n )\n .with_effect(|world| {\n let entity = world.create_entity().with(SharedInputControlled).build();\n world.insert(entity);\n })\n .with_assertion(|world| {\n let entity = *world.read_resource::<Entity>();\n let store = world.read_storage::<ControllerInput>();\n assert_eq!(\n Some(&ControllerInput::new(0., 0., false, false, false, false)),\n store.get(entity)\n );\n })\n .with_effect(|world| {\n let mut jump_attack_pressed = ControllerInput::default();\n jump_attack_pressed.attack = true;\n jump_attack_pressed.jump = true;\n\n let entity_0 = world\n .create_entity()\n .with(InputControlled::new(0))\n .with(jump_attack_pressed)\n .build();\n\n let mut defend_special_pressed = ControllerInput::default();\n defend_special_pressed.defend = true;\n defend_special_pressed.special = true;\n\n let entity_1 = world\n .create_entity()\n .with(InputControlled::new(0))\n .with(defend_special_pressed)\n .build();\n\n let controller_entities = vec![entity_0, entity_1];\n world.insert(controller_entities);\n })\n .with_assertion(|world| {\n let entity = *world.read_resource::<Entity>();\n let store = world.read_storage::<ControllerInput>();\n assert_eq!(\n Some(&ControllerInput::new(0., 0., true, true, true, true)),\n store.get(entity)\n );\n })\n .with_effect(|world| {\n let entities = world\n .read_resource::<Vec<Entity>>()\n .iter()\n .map(|e| *e)\n .collect::<Vec<_>>();\n\n world\n .delete_entity(*entities.first().expect(\"Expected entity to exist.\"))\n .expect(\"Failed to delete `jump_attack` entity.\");\n })\n .with_assertion(|world| {\n \n let entity = *world.read_resource::<Entity>();\n let store = world.read_storage::<ControllerInput>();\n assert_eq!(\n Some(&ControllerInput::new(0., 0., true, false, false, true)),\n store.get(entity)\n );\n })\n .run()\n }\n}\n"},"prefix":{"kind":"string","value":"#[cfg(test)]\nmod tests {\n use std::any;\n\n use amethyst::{\n ecs::{Builder, Entity, Join, ReadStorage, WorldExt, WriteStorage},\n Error,\n };\n use amethyst_test::AmethystApplication;\n use game_input_model::{\n config::{ControlBindings, ControllerId},\n play::{ControllerInput, InputControlled, SharedInputControlled},\n };\n\n use game_input::SharedControllerInputUpdateSystem;\n\n #[test]\n fn merges_axes_controller_input_with_limit_correction() -> Result<(), Error> {\n let controller_count = 3;\n AmethystApplication::ui_base::<ControlBindings>()\n .with_system(\n SharedControllerInputUpdateSystem::new(),\n any::type_name::<SharedControllerInputUpdateSystem>(),\n &[],\n )\n .with_effect(move |world| {\n let controller_entities = (0..controller_count)\n .map(|n| {\n let controller_id = n as ControllerId;\n world\n .create_entity()\n .with(InputContr"},"suffix":{"kind":"string","value":" .expect(\"Failed to delete entity.\")\n });\n })\n .with_assertion(|world| {\n \n let entity = *world.read_resource::<Entity>();\n let store = world.read_storage::<ControllerInput>();\n assert_eq!(\n Some(&ControllerInput::new(0., 0., false, false, false, false)),\n store.get(entity)\n );\n })\n .run()\n }\n\n #[test]\n fn merges_action_controller_input() -> Result<(), Error> {\n AmethystApplication::ui_base::<ControlBindings>()\n .with_system(\n SharedControllerInputUpdateSystem::new(),\n any::type_name::<SharedControllerInputUpdateSystem>(),\n &[],\n )\n .with_effect(|world| {\n let entity = world.create_entity().with(SharedInputControlled).build();\n world.insert(entity);\n })\n .with_assertion(|world| {\n let entity = *world.read_resource::<Entity>();\n let store = world.read_storage::<ControllerInput>();\n assert_eq!(\n Some(&ControllerInput::new(0., 0., false, false, false, false)),\n store.get(entity)\n );\n })\n .with_effect(|world| {\n let mut jump_attack_pressed = ControllerInput::default();\n jump_attack_pressed.attack = true;\n jump_attack_pressed.jump = true;\n\n let entity_0 = world\n .create_entity()\n .with(InputControlled::new(0))\n .with(jump_attack_pressed)\n .build();\n\n let mut defend_special_pressed = ControllerInput::default();\n defend_special_pressed.defend = true;\n defend_special_pressed.special = true;\n\n let entity_1 = world\n .create_entity()\n .with(InputControlled::new(0))\n .with(defend_special_pressed)\n .build();\n\n let controller_entities = vec![entity_0, entity_1];\n world.insert(controller_entities);\n })\n .with_assertion(|world| {\n let entity = *world.read_resource::<Entity>();\n let store = world.read_storage::<ControllerInput>();\n assert_eq!(\n Some(&ControllerInput::new(0., 0., true, true, true, true)),\n store.get(entity)\n );\n })\n .with_effect(|world| {\n let entities = world\n .read_resource::<Vec<Entity>>()\n .iter()\n .map(|e| *e)\n .collect::<Vec<_>>();\n\n world\n .delete_entity(*entities.first().expect(\"Expected entity to exist.\"))\n .expect(\"Failed to delete `jump_attack` entity.\");\n })\n .with_assertion(|world| {\n \n let entity = *world.read_resource::<Entity>();\n let store = world.read_storage::<ControllerInput>();\n assert_eq!(\n Some(&ControllerInput::new(0., 0., true, false, false, true)),\n store.get(entity)\n );\n })\n .run()\n }\n}\n"},"middle":{"kind":"string","value":"olled::new(controller_id))\n .with(ControllerInput::default())\n .build()\n })\n .collect::<Vec<Entity>>();\n world.insert(controller_entities);\n\n let entity = world.create_entity().with(SharedInputControlled).build();\n world.insert(entity);\n })\n .with_assertion(|world| {\n let store = world.read_storage::<ControllerInput>();\n assert_eq!(\n Some(&ControllerInput::new(0., 0., false, false, false, false)),\n store.join().next()\n );\n })\n .with_effect(|world| {\n let (input_controlleds, mut controller_inputs) = world.system_data::<(\n ReadStorage<'_, InputControlled>,\n WriteStorage<'_, ControllerInput>,\n )>();\n (&input_controlleds, &mut controller_inputs)\n .join()\n .for_each(|(_, controller_input)| {\n controller_input.x_axis_value = -1.;\n controller_input.z_axis_value = 1.;\n });\n })\n .with_assertion(|world| {\n let entity = *world.read_resource::<Entity>();\n let store = world.read_storage::<ControllerInput>();\n assert_eq!(\n Some(&ControllerInput::new(-1., 1., false, false, false, false)),\n store.get(entity)\n );\n })\n .with_effect(|world| {\n let (input_controlleds, mut controller_inputs) = world.system_data::<(\n ReadStorage<'_, InputControlled>,\n WriteStorage<'_, ControllerInput>,\n )>();\n (&input_controlleds, &mut controller_inputs)\n .join()\n .for_each(|(_, controller_input)| {\n controller_input.x_axis_value = 1.;\n controller_input.z_axis_value = -1.;\n });\n })\n .with_assertion(|world| {\n let entity = *world.read_resource::<Entity>();\n let store = world.read_storage::<ControllerInput>();\n assert_eq!(\n Some(&ControllerInput::new(1., -1., false, false, false, false)),\n store.get(entity)\n );\n })\n .with_effect(|world| {\n let controller_entities = world\n .read_resource::<Vec<Entity>>()\n .iter()\n .map(|e| *e)\n .collect::<Vec<_>>();\n\n controller_entities.into_iter().for_each(|entity| {\n world\n .delete_entity(entity)\n "},"strategy":{"kind":"string","value":"function_block-random_span"},"context_items":{"kind":"list like","value":[{"content":"#[test]\n\nfn read_and_exit() -> Result<(), OutputError> {\n\n let command = CargoBuild::new()\n\n .example(\"01_read_and_exit\")\n\n .current_release()\n\n .run()\n\n .expect(\"Failed to create `cargo` command\")\n\n .command();\n\n Command::from_std(command)\n\n .write_stdin(\"exit\\n\")\n\n .ok()?\n\n .assert()\n\n .success();\n\n Ok(())\n\n}\n\n\n","file_path":"crate/stdio_input/tests/integration_test.rs","rank":0,"score":236240.39583181933},{"content":"#[test]\n\nfn read_and_exit_timeout() -> Result<(), OutputError> {\n\n let command = CargoBuild::new()\n\n .example(\"01_read_and_exit\")\n\n .current_release()\n\n .run()\n\n .expect(\"Failed to create `cargo` command\")\n\n .command();\n\n\n\n Command::from_std(command)\n\n .args(&[\"-t\", \"0\"])\n\n .write_stdin(\"abc\\n\")\n\n .ok()?\n\n .assert()\n\n .success();\n\n Ok(())\n\n}\n","file_path":"crate/stdio_input/tests/integration_test.rs","rank":1,"score":232586.00871141808},{"content":"#[test]\n\n#[ignore] // Can't test on X through CI.\n\nfn start_and_exit() -> Result<(), OutputError> {\n\n let command = CargoBuild::new()\n\n .bin(\"will\")\n\n .current_release()\n\n .run()\n\n .expect(\"Failed to create `cargo` command\")\n\n .command();\n\n Command::from_std(command)\n\n .write_stdin(\"exit\\n\")\n\n .ok()?\n\n .assert()\n\n .success();\n\n\n\n Ok(())\n\n}\n","file_path":"app/will/tests/001_start_and_exit.rs","rank":2,"score":227750.20841416426},{"content":"fn main() -> Result<(), Error> {\n\n let mut will_config = AppFile::find(WILL_CONFIG)\n\n .and_then(|will_config_path| IoUtils::read_file(&will_config_path).map_err(Error::from))\n\n .and_then(|bytes| String::from_utf8(bytes).map_err(Error::from))\n\n .and_then(|will_config_toml| {\n\n WillConfig::from_args_with_toml(&will_config_toml).map_err(|e| Error::from(e.compat()))\n\n })\n\n .unwrap_or_else(|e| {\n\n eprintln!(\"{}\", e);\n\n WillConfig::from_args()\n\n });\n\n\n\n let session_server_config = session_server_config(&will_config);\n\n\n\n logger_setup(will_config.logger_config.take())?;\n\n debug!(\"will_config: {:?}\", will_config);\n\n\n\n let assets_dir = AppDir::assets()?;\n\n\n\n let game_mode_selection_state =\n","file_path":"app/will/src/main.rs","rank":3,"score":214996.17123408156},{"content":"fn main() -> Result<(), Error> {\n\n let opt = Opt::from_args();\n\n\n\n logger_setup(opt.logger_config)?;\n\n\n\n let tcp_listener = TcpListener::bind((opt.address, opt.port))?;\n\n tcp_listener.set_nonblocking(true)?;\n\n\n\n let assets_dir = application_root_dir()?.join(\"./\");\n\n\n\n let game_data = GameDataBuilder::default()\n\n .with_bundle(TcpNetworkBundle::new(\n\n Some(tcp_listener),\n\n TCP_RECV_BUFFER_SIZE,\n\n ))?\n\n .with_system_desc(\n\n NetListenerSystemDesc::default(),\n\n any::type_name::<NetListenerSystem>(),\n\n &[\"network_recv\"],\n\n )\n","file_path":"app/session_server/src/main.rs","rank":4,"score":211542.62221924687},{"content":"fn run(opt: &Opt) -> Result<(), Error> {\n\n let mut intercepts = RobotState::default_intercepts();\n\n if let Some(timeout) = opt.timeout {\n\n intercepts.push(Rc::new(RefCell::new(FixedTimeoutIntercept::new(\n\n Duration::from_millis(timeout),\n\n ))));\n\n }\n\n\n\n let state = RobotState::new_with_intercepts(Box::new(EmptyState), intercepts);\n\n let game_data = GameDataBuilder::default().with_bundle(StdioInputBundle::new())?;\n\n let assets_dir = format!(\"{}/assets\", env!(\"CARGO_MANIFEST_DIR\"));\n\n CoreApplication::<_, _, StateEventReader>::new(assets_dir, state, game_data)?.run();\n\n Ok(())\n\n}\n\n\n","file_path":"crate/stdio_input/examples/01_read_and_exit.rs","rank":5,"score":193210.67323894255},{"content":"fn logger_setup(logger_config_path: Option<PathBuf>) -> Result<(), Error> {\n\n let is_user_specified = logger_config_path.is_some();\n\n\n\n // If the user specified a logger configuration path, use that.\n\n // Otherwise fallback to a default.\n\n let logger_config_path = logger_config_path.unwrap_or_else(|| PathBuf::from(LOGGER_CONFIG));\n\n let logger_config_path = if logger_config_path.is_relative() {\n\n let app_dir = application_root_dir()?;\n\n app_dir.join(logger_config_path)\n\n } else {\n\n logger_config_path\n\n };\n\n\n\n let logger_config: LoggerConfig = if logger_config_path.exists() {\n\n let logger_file = File::open(&logger_config_path)?;\n\n let mut logger_file_reader = BufReader::new(logger_file);\n\n let logger_config = serde_yaml::from_reader(&mut logger_file_reader)?;\n\n\n\n Ok(logger_config)\n\n } else if is_user_specified {\n","file_path":"app/will/src/main.rs","rank":6,"score":181315.83802514456},{"content":"fn logger_setup(logger_config_path: Option<PathBuf>) -> Result<(), Error> {\n\n let is_user_specified = logger_config_path.is_some();\n\n\n\n // If the user specified a logger configuration path, use that.\n\n // Otherwise fallback to a default.\n\n let logger_config_path = logger_config_path.unwrap_or_else(|| PathBuf::from(LOGGER_CONFIG));\n\n let logger_config_path = if logger_config_path.is_relative() {\n\n let app_dir = application_root_dir()?;\n\n app_dir.join(logger_config_path)\n\n } else {\n\n logger_config_path\n\n };\n\n\n\n let logger_config: LoggerConfig = if logger_config_path.exists() {\n\n let logger_file = File::open(&logger_config_path)?;\n\n let mut logger_file_reader = BufReader::new(logger_file);\n\n let logger_config = serde_yaml::from_reader(&mut logger_file_reader)?;\n\n\n\n Ok(logger_config)\n\n } else if is_user_specified {\n","file_path":"app/session_server/src/main.rs","rank":7,"score":178750.86219584654},{"content":"#[test]\n\nfn syntax_errors() {\n\n let command = \"echo (echo one); echo $( (echo one); echo ) two; echo $(echo one\";\n\n let results = StatementSplitter::new(command).collect::<Vec<_>>();\n\n assert_eq!(results[0], Err(StatementError::InvalidCharacter('(', 6)));\n\n assert_eq!(results[1], Err(StatementError::InvalidCharacter('(', 26)));\n\n assert_eq!(results[2], Err(StatementError::InvalidCharacter(')', 43)));\n\n assert_eq!(results[3], Err(StatementError::UnterminatedSubshell));\n\n assert_eq!(results.len(), 4);\n\n\n\n let command = \">echo\";\n\n let results = StatementSplitter::new(command).collect::<Vec<_>>();\n\n assert_eq!(\n\n results[0],\n\n Err(StatementError::ExpectedCommandButFound(\"redirection\"))\n\n );\n\n assert_eq!(results.len(), 1);\n\n\n\n let command = \"echo $((foo bar baz)\";\n\n let results = StatementSplitter::new(command).collect::<Vec<_>>();\n\n assert_eq!(results[0], Err(StatementError::UnterminatedArithmetic));\n\n assert_eq!(results.len(), 1);\n\n}\n\n\n","file_path":"crate/stdio_input/src/ion/splitter.rs","rank":8,"score":121464.86258713328},{"content":"use amethyst::ecs::{storage::NullStorage, Component};\n\n\n\n/// ID tag for entities created in the `SessionJoinState`.\n\n#[derive(Clone, Component, Copy, Debug, Default, PartialEq)]\n\n#[storage(NullStorage)]\n\npub struct SessionJoinEntity;\n","file_path":"crate/session_join_model/src/session_join_entity.rs","rank":9,"score":111879.27992080968},{"content":"use serde::{Deserialize, Serialize};\n\nuse strum_macros::EnumString;\n\n\n\n/// Error when attempting to join a session.\n\n#[derive(Clone, Copy, Debug, Deserialize, EnumString, PartialEq, Serialize)]\n\n#[strum(serialize_all = \"snake_case\")]\n\npub enum SessionJoinError {\n\n /// The session code does not exist on the server.\n\n SessionCodeNotFound,\n\n}\n","file_path":"crate/session_join_model/src/play/session_join_error.rs","rank":10,"score":109932.35545105969},{"content":"#[cfg(test)]\n\nmod test {\n\n use amethyst::{ecs::WorldExt, shrev::EventChannel, Error};\n\n use amethyst_test::AmethystApplication;\n\n use stdio_spi::VariantAndTokens;\n\n\n\n use session_join_stdio::SessionJoinStdioBundle;\n\n\n\n #[test]\n\n fn bundle_should_add_mapper_system_to_dispatcher() -> Result<(), Error> {\n\n AmethystApplication::blank()\n\n .with_bundle(SessionJoinStdioBundle::new())\n\n // kcov-ignore-start\n\n .with_effect(|world| {\n\n world.read_resource::<EventChannel<VariantAndTokens>>();\n\n })\n\n // kcov-ignore-end\n\n .run()\n\n }\n\n}\n","file_path":"crate/workspace_tests/src/session_join_stdio/session_join_stdio_bundle.rs","rank":11,"score":103537.80569631088},{"content":"#[cfg(test)]\n\nmod tests {\n\n use amethyst::{\n\n ecs::{Read, SystemData, World, WorldExt, WriteExpect},\n\n shrev::{EventChannel, ReaderId},\n\n Error,\n\n };\n\n use amethyst_test::AmethystApplication;\n\n use game_input_model::loaded::{PlayerController, PlayerControllers};\n\n use net_model::play::NetMessageEvent;\n\n use network_session_model::play::{SessionCode, SessionDeviceName, SessionStatus};\n\n use session_join_model::{play::SessionJoinRequestParams, SessionJoinEvent};\n\n\n\n use session_join_play::SessionJoinRequestSystemDesc;\n\n\n\n #[test]\n\n fn does_nothing_when_no_session_join_event() -> Result<(), Error> {\n\n run_test(\n\n SetupParams {\n\n session_status: SessionStatus::None,\n","file_path":"crate/workspace_tests/src/session_join_play/system/session_join_request_system.rs","rank":12,"score":101822.67905696807},{"content":"#[cfg(test)]\n\nmod tests {\n\n use std::net::{Ipv4Addr, SocketAddr};\n\n\n\n use amethyst::{\n\n ecs::{Read, WorldExt},\n\n Error,\n\n };\n\n use amethyst_test::AmethystApplication;\n\n use game_input_model::{\n\n loaded::{PlayerController, PlayerControllers},\n\n play::ControllerIdOffset,\n\n };\n\n use net_model::play::{NetData, NetEventChannel};\n\n use network_session_model::play::{\n\n Session, SessionCode, SessionDevice, SessionDeviceId, SessionDeviceName, SessionDevices,\n\n SessionStatus,\n\n };\n\n use session_join_model::{play::SessionAcceptResponse, SessionJoinEvent};\n\n\n","file_path":"crate/workspace_tests/src/session_join_play/system/session_join_response_system.rs","rank":13,"score":101816.21590365133},{"content":"\n\n fn run_test(\n\n SetupParams {\n\n session_status: session_status_setup,\n\n session_join_event,\n\n }: SetupParams,\n\n ExpectedParams {\n\n session_status: session_status_expected,\n\n net_message_event: net_message_event_expected,\n\n }: ExpectedParams,\n\n ) -> Result<(), Error> {\n\n AmethystApplication::blank()\n\n .with_setup(<Read<'_, EventChannel<NetMessageEvent>> as SystemData>::setup)\n\n .with_setup(setup_net_message_event_reader)\n\n .with_system_desc(SessionJoinRequestSystemDesc::default(), \"\", &[])\n\n .with_resource(session_status_setup)\n\n .with_effect(move |world| {\n\n if let Some(session_join_event) = session_join_event {\n\n world\n\n .write_resource::<EventChannel<SessionJoinEvent>>()\n","file_path":"crate/workspace_tests/src/session_join_play/system/session_join_request_system.rs","rank":14,"score":101808.0568279413},{"content":"#[cfg(test)]\n\nmod tests {\n\n use game_input_model::{\n\n loaded::{PlayerController, PlayerControllers},\n\n play::ControllerIdOffset,\n\n };\n\n use network_session_model::play::{\n\n Session, SessionCode, SessionDevice, SessionDeviceId, SessionDeviceName, SessionDevices,\n\n };\n\n use session_join_model::{\n\n play::{SessionAcceptResponse, SessionJoinRequestParams},\n\n SessionJoinEvent,\n\n };\n\n use stdio_spi::StdinMapper;\n\n\n\n use session_join_stdio::SessionJoinEventStdinMapper;\n\n\n\n #[test]\n\n fn maps_session_join_request_event() {\n\n let session_device_name = SessionDeviceName::from(String::from(\"エイズリエル\"));\n","file_path":"crate/workspace_tests/src/session_join_stdio/session_join_event_stdin_mapper.rs","rank":15,"score":101806.21409961548},{"content":" }: SetupParams,\n\n ExpectedParams {\n\n session_code: session_code_expected,\n\n session_device_id: session_device_id_expected,\n\n session_devices: session_devices_expected,\n\n session_status: session_status_expected,\n\n player_controllers: player_controllers_expected,\n\n controller_id_offset: controller_id_offset_expected,\n\n }: ExpectedParams,\n\n ) -> Result<(), Error> {\n\n AmethystApplication::blank()\n\n .with_system_desc(SessionJoinResponseSystemDesc::default(), \"\", &[])\n\n .with_setup(move |world| {\n\n world.insert(session_code_setup);\n\n world.insert(session_device_id_setup);\n\n world.insert(session_devices_setup);\n\n world.insert(session_status_setup);\n\n })\n\n .with_effect(move |world| {\n\n if let Some(session_join_event) = session_join_event {\n","file_path":"crate/workspace_tests/src/session_join_play/system/session_join_response_system.rs","rank":16,"score":101805.57789703211},{"content":" run_test(\n\n SetupParams {\n\n session_status: SessionStatus::None,\n\n session_join_event: Some(session_join_event.clone()),\n\n },\n\n ExpectedParams {\n\n session_status: SessionStatus::JoinRequested {\n\n session_code: SessionCode::new(String::from(\"abcd\")),\n\n },\n\n net_message_event: Some(NetMessageEvent::SessionJoinEvent(session_join_event)),\n\n },\n\n )\n\n }\n\n\n\n #[test]\n\n fn ignores_session_join_request_when_already_requested() -> Result<(), Error> {\n\n run_test(\n\n SetupParams {\n\n session_status: SessionStatus::JoinRequested {\n\n session_code: SessionCode::new(String::from(\"abcd\")),\n","file_path":"crate/workspace_tests/src/session_join_play/system/session_join_request_system.rs","rank":17,"score":101804.16837800015},{"content":" use session_join_play::SessionJoinResponseSystemDesc;\n\n\n\n #[test]\n\n fn does_nothing_when_no_session_join_event() -> Result<(), Error> {\n\n run_test(\n\n SetupParams {\n\n session_code: SessionCode::new(String::from(\"abcd\")),\n\n session_device_id: SessionDeviceId::new(123),\n\n session_devices: SessionDevices::new(vec![]),\n\n session_status: SessionStatus::None,\n\n session_join_event: None,\n\n },\n\n ExpectedParams {\n\n session_code: SessionCode::new(String::from(\"abcd\")),\n\n session_device_id: SessionDeviceId::new(123),\n\n session_devices: SessionDevices::new(vec![]),\n\n session_status: SessionStatus::None,\n\n player_controllers: PlayerControllers::default(),\n\n controller_id_offset: ControllerIdOffset::default(),\n\n },\n","file_path":"crate/workspace_tests/src/session_join_play/system/session_join_response_system.rs","rank":18,"score":101803.77377831002},{"content":" session_join_event: None,\n\n },\n\n ExpectedParams {\n\n session_status: SessionStatus::None,\n\n net_message_event: None,\n\n },\n\n )\n\n }\n\n\n\n #[test]\n\n fn inserts_resources_on_session_accepted() -> Result<(), Error> {\n\n let session_join_event = SessionJoinEvent::SessionJoinRequest(SessionJoinRequestParams {\n\n session_code: SessionCode::new(String::from(\"abcd\")),\n\n session_device_name: SessionDeviceName::new(String::from(\"azriel\")),\n\n player_controllers: PlayerControllers::new(vec![PlayerController::new(\n\n 0,\n\n String::from(\"p0\"),\n\n )]),\n\n });\n\n\n","file_path":"crate/workspace_tests/src/session_join_play/system/session_join_request_system.rs","rank":19,"score":101802.18259301834},{"content":" )\n\n }\n\n\n\n #[test]\n\n fn inserts_resources_on_session_accepted() -> Result<(), Error> {\n\n let player_controllers = PlayerControllers::new(vec![\n\n PlayerController::new(0, String::from(\"p0\")),\n\n PlayerController::new(1, String::from(\"p1\")),\n\n PlayerController::new(2, String::from(\"p2\")),\n\n ]);\n\n\n\n run_test(\n\n SetupParams {\n\n session_code: SessionCode::new(String::from(\"abcd\")),\n\n session_device_id: SessionDeviceId::new(123),\n\n session_devices: SessionDevices::new(vec![]),\n\n session_status: SessionStatus::JoinRequested {\n\n session_code: SessionCode::new(String::from(\"defg\")),\n\n },\n\n session_join_event: Some(SessionJoinEvent::SessionAccept(SessionAcceptResponse {\n","file_path":"crate/workspace_tests/src/session_join_play/system/session_join_response_system.rs","rank":20,"score":101801.56918209407},{"content":" let session_code = SessionCode::from(String::from(\"abcd\"));\n\n let player_controllers =\n\n PlayerControllers::new(vec![PlayerController::new(0, String::from(\"p0\"))]);\n\n let args = SessionJoinEvent::SessionJoinRequest(SessionJoinRequestParams {\n\n session_device_name,\n\n session_code,\n\n player_controllers,\n\n });\n\n\n\n let result = SessionJoinEventStdinMapper::map(&(), args.clone());\n\n\n\n assert!(result.is_ok());\n\n assert_eq!(args, result.unwrap())\n\n }\n\n\n\n #[test]\n\n fn maps_join_cancel_event() {\n\n let args = SessionJoinEvent::JoinCancel;\n\n\n\n let result = SessionJoinEventStdinMapper::map(&(), args.clone());\n","file_path":"crate/workspace_tests/src/session_join_stdio/session_join_event_stdin_mapper.rs","rank":21,"score":101801.46078986165},{"content":" let controller_id_offset = ControllerIdOffset::new(0);\n\n let args = SessionJoinEvent::SessionAccept(SessionAcceptResponse {\n\n session_device_id,\n\n session: Session {\n\n session_code,\n\n session_devices,\n\n },\n\n player_controllers,\n\n controller_id_offset,\n\n });\n\n\n\n let result = SessionJoinEventStdinMapper::map(&(), args.clone());\n\n\n\n assert!(result.is_ok());\n\n assert_eq!(args, result.unwrap())\n\n }\n\n\n\n #[test]\n\n fn maps_back_event() {\n\n let args = SessionJoinEvent::Back;\n\n\n\n let result = SessionJoinEventStdinMapper::map(&(), args.clone());\n\n\n\n assert!(result.is_ok());\n\n assert_eq!(args, result.unwrap())\n\n }\n\n}\n","file_path":"crate/workspace_tests/src/session_join_stdio/session_join_event_stdin_mapper.rs","rank":22,"score":101801.04173459833},{"content":" SessionDeviceId::new(234),\n\n SessionDeviceName::new(String::from(\"azriel\")),\n\n PlayerControllers::new(vec![PlayerController::new(0, String::from(\"p0\"))]),\n\n )]),\n\n session_status: SessionStatus::JoinEstablished,\n\n player_controllers,\n\n controller_id_offset: ControllerIdOffset::new(3),\n\n },\n\n )\n\n }\n\n\n\n #[test]\n\n fn ignores_session_accept_event_when_no_longer_waiting() -> Result<(), Error> {\n\n let player_controllers = PlayerControllers::new(vec![\n\n PlayerController::new(0, String::from(\"p0\")),\n\n PlayerController::new(1, String::from(\"p1\")),\n\n PlayerController::new(2, String::from(\"p2\")),\n\n ]);\n\n\n\n run_test(\n","file_path":"crate/workspace_tests/src/session_join_play/system/session_join_response_system.rs","rank":23,"score":101800.16402558838},{"content":" })\n\n .run()\n\n }\n\n\n\n fn setup_net_message_event_reader(world: &mut World) {\n\n let net_message_event_rid = world\n\n .write_resource::<EventChannel<NetMessageEvent>>()\n\n .register_reader();\n\n world.insert(net_message_event_rid);\n\n }\n\n\n\n struct SetupParams {\n\n session_status: SessionStatus,\n\n session_join_event: Option<SessionJoinEvent>,\n\n }\n\n\n\n struct ExpectedParams {\n\n session_status: SessionStatus,\n\n net_message_event: Option<NetMessageEvent>,\n\n }\n\n}\n","file_path":"crate/workspace_tests/src/session_join_play/system/session_join_request_system.rs","rank":24,"score":101796.71545011982},{"content":" let socket_addr = SocketAddr::from((Ipv4Addr::LOCALHOST, 1234));\n\n world\n\n .write_resource::<NetEventChannel<SessionJoinEvent>>()\n\n .single_write(NetData {\n\n socket_addr,\n\n data: session_join_event,\n\n });\n\n }\n\n })\n\n .with_assertion(move |world| {\n\n let (\n\n session_code,\n\n session_device_id,\n\n session_devices,\n\n session_status,\n\n player_controllers,\n\n controller_id_offset,\n\n ) = world.system_data::<(\n\n Read<'_, SessionCode>,\n\n Read<'_, SessionDeviceId>,\n","file_path":"crate/workspace_tests/src/session_join_play/system/session_join_response_system.rs","rank":25,"score":101796.3608989087},{"content":"\n\n assert!(result.is_ok());\n\n assert_eq!(args, result.unwrap())\n\n }\n\n\n\n #[test]\n\n fn maps_session_accept_event() {\n\n let session_code = SessionCode::from(String::from(\"abcd\"));\n\n let session_device_id = SessionDeviceId::new(1);\n\n let session_devices = SessionDevices::new(vec![\n\n SessionDevice {\n\n id: SessionDeviceId::new(1),\n\n name: SessionDeviceName::from(String::from(\"エイズリエル\")),\n\n player_controllers: PlayerControllers::new(vec![PlayerController::new(\n\n 0,\n\n String::from(\"p0\"),\n\n )]),\n\n },\n\n SessionDevice {\n\n id: SessionDeviceId::new(2),\n","file_path":"crate/workspace_tests/src/session_join_stdio/session_join_event_stdin_mapper.rs","rank":26,"score":101793.72148352458},{"content":" .single_write(session_join_event);\n\n }\n\n })\n\n .with_assertion(move |world| {\n\n let (session_status, mut net_message_event_rid, net_message_ec) = world\n\n .system_data::<(\n\n Read<'_, SessionStatus>,\n\n WriteExpect<'_, ReaderId<NetMessageEvent>>,\n\n Read<'_, EventChannel<NetMessageEvent>>,\n\n )>();\n\n let session_status = &*session_status;\n\n let net_message_event = net_message_ec.read(&mut *net_message_event_rid).next();\n\n\n\n assert_eq!(\n\n (\n\n &session_status_expected,\n\n net_message_event_expected.as_ref()\n\n ),\n\n (session_status, net_message_event)\n\n );\n","file_path":"crate/workspace_tests/src/session_join_play/system/session_join_request_system.rs","rank":27,"score":101793.40093562688},{"content":" })),\n\n },\n\n ExpectedParams {\n\n session_code: SessionCode::new(String::from(\"abcd\")),\n\n session_device_id: SessionDeviceId::new(123),\n\n session_devices: SessionDevices::new(vec![]),\n\n session_status: SessionStatus::None,\n\n player_controllers: PlayerControllers::default(),\n\n controller_id_offset: ControllerIdOffset::default(),\n\n },\n\n )\n\n }\n\n\n\n fn run_test(\n\n SetupParams {\n\n session_code: session_code_setup,\n\n session_device_id: session_device_id_setup,\n\n session_devices: session_devices_setup,\n\n session_status: session_status_setup,\n\n session_join_event,\n","file_path":"crate/workspace_tests/src/session_join_play/system/session_join_response_system.rs","rank":28,"score":101792.05284696059},{"content":" },\n\n session_join_event: Some(SessionJoinEvent::SessionJoinRequest(\n\n SessionJoinRequestParams {\n\n session_code: SessionCode::new(String::from(\"abcd\")),\n\n session_device_name: SessionDeviceName::new(String::from(\"azriel\")),\n\n player_controllers: PlayerControllers::new(vec![PlayerController::new(\n\n 0,\n\n String::from(\"p0\"),\n\n )]),\n\n },\n\n )),\n\n },\n\n ExpectedParams {\n\n session_status: SessionStatus::JoinRequested {\n\n session_code: SessionCode::new(String::from(\"abcd\")),\n\n },\n\n net_message_event: None,\n\n },\n\n )\n\n }\n","file_path":"crate/workspace_tests/src/session_join_play/system/session_join_request_system.rs","rank":29,"score":101792.03472510248},{"content":" })\n\n .run()\n\n }\n\n\n\n struct SetupParams {\n\n session_code: SessionCode,\n\n session_device_id: SessionDeviceId,\n\n session_devices: SessionDevices,\n\n session_status: SessionStatus,\n\n session_join_event: Option<SessionJoinEvent>,\n\n }\n\n\n\n struct ExpectedParams {\n\n session_code: SessionCode,\n\n session_device_id: SessionDeviceId,\n\n session_devices: SessionDevices,\n\n session_status: SessionStatus,\n\n player_controllers: PlayerControllers,\n\n controller_id_offset: ControllerIdOffset,\n\n }\n\n}\n","file_path":"crate/workspace_tests/src/session_join_play/system/session_join_response_system.rs","rank":30,"score":101790.48992786677},{"content":" SetupParams {\n\n session_code: SessionCode::new(String::from(\"abcd\")),\n\n session_device_id: SessionDeviceId::new(123),\n\n session_devices: SessionDevices::new(vec![]),\n\n session_status: SessionStatus::None,\n\n session_join_event: Some(SessionJoinEvent::SessionAccept(SessionAcceptResponse {\n\n session_device_id: SessionDeviceId::new(234),\n\n session: Session {\n\n session_code: SessionCode::new(String::from(\"defg\")),\n\n session_devices: SessionDevices::new(vec![SessionDevice::new(\n\n SessionDeviceId::new(234),\n\n SessionDeviceName::new(String::from(\"azriel\")),\n\n PlayerControllers::new(vec![PlayerController::new(\n\n 0,\n\n String::from(\"p0\"),\n\n )]),\n\n )]),\n\n },\n\n player_controllers,\n\n controller_id_offset: ControllerIdOffset::new(3),\n","file_path":"crate/workspace_tests/src/session_join_play/system/session_join_response_system.rs","rank":31,"score":101789.76688959847},{"content":" );\n\n\n\n assert_eq!(\n\n (\n\n &session_code_expected,\n\n &session_device_id_expected,\n\n &session_devices_expected,\n\n &session_status_expected,\n\n &player_controllers_expected,\n\n &controller_id_offset_expected,\n\n ),\n\n (\n\n session_code,\n\n session_device_id,\n\n session_devices,\n\n session_status,\n\n player_controllers,\n\n controller_id_offset,\n\n )\n\n );\n","file_path":"crate/workspace_tests/src/session_join_play/system/session_join_response_system.rs","rank":32,"score":101785.51264086738},{"content":" session_device_id: SessionDeviceId::new(234),\n\n session: Session {\n\n session_code: SessionCode::new(String::from(\"defg\")),\n\n session_devices: SessionDevices::new(vec![SessionDevice::new(\n\n SessionDeviceId::new(234),\n\n SessionDeviceName::new(String::from(\"azriel\")),\n\n PlayerControllers::new(vec![PlayerController::new(\n\n 0,\n\n String::from(\"p0\"),\n\n )]),\n\n )]),\n\n },\n\n player_controllers: player_controllers.clone(),\n\n controller_id_offset: ControllerIdOffset::new(3),\n\n })),\n\n },\n\n ExpectedParams {\n\n session_code: SessionCode::new(String::from(\"defg\")),\n\n session_device_id: SessionDeviceId::new(234),\n\n session_devices: SessionDevices::new(vec![SessionDevice::new(\n","file_path":"crate/workspace_tests/src/session_join_play/system/session_join_response_system.rs","rank":33,"score":101785.51264086738},{"content":" Read<'_, SessionDevices>,\n\n Read<'_, SessionStatus>,\n\n Read<'_, PlayerControllers>,\n\n Read<'_, ControllerIdOffset>,\n\n )>();\n\n\n\n let (\n\n session_code,\n\n session_device_id,\n\n session_devices,\n\n session_status,\n\n player_controllers,\n\n controller_id_offset,\n\n ) = (\n\n &*session_code,\n\n &*session_device_id,\n\n &*session_devices,\n\n &*session_status,\n\n &*player_controllers,\n\n &*controller_id_offset,\n","file_path":"crate/workspace_tests/src/session_join_play/system/session_join_response_system.rs","rank":34,"score":101785.51264086738},{"content":" name: SessionDeviceName::from(String::from(\"バイロン\")),\n\n player_controllers: PlayerControllers::new(vec![PlayerController::new(\n\n 1,\n\n String::from(\"p1\"),\n\n )]),\n\n },\n\n SessionDevice {\n\n id: SessionDeviceId::new(3),\n\n name: SessionDeviceName::from(String::from(\"カルロー\")),\n\n player_controllers: PlayerControllers::new(vec![PlayerController::new(\n\n 2,\n\n String::from(\"p2\"),\n\n )]),\n\n },\n\n ]);\n\n let player_controllers = PlayerControllers::new(vec![\n\n PlayerController::new(0, String::from(\"p0\")),\n\n PlayerController::new(1, String::from(\"p1\")),\n\n PlayerController::new(2, String::from(\"p2\")),\n\n ]);\n","file_path":"crate/workspace_tests/src/session_join_stdio/session_join_event_stdin_mapper.rs","rank":35,"score":101785.51264086738},{"content":"#[cfg(test)]\n\nmod test {\n\n use amethyst::{GameData, State, Trans};\n\n\n\n use debug_util_amethyst::{assert_eq_opt_trans, assert_eq_trans};\n\n\n\n #[macro_use]\n\n macro_rules! test_opt_trans_panic {\n\n ($test_name:ident, $message:expr, $expected:expr, $actual:expr) => {\n\n #[test]\n\n #[should_panic(expected = $message)]\n\n fn $test_name() {\n\n assert_eq_opt_trans::<GameData<'static, 'static>, ()>($expected, $actual);\n\n } // kcov-ignore\n\n };\n\n }\n\n\n\n #[test]\n\n fn assert_eq_trans_does_not_panic_on_same_trans_discriminant() {\n\n assert_eq_trans::<GameData<'static, 'static>, ()>(&Trans::None, &Trans::None);\n","file_path":"crate/workspace_tests/src/debug_util_amethyst.rs","rank":36,"score":98773.27871120021},{"content":" assert_eq_trans(\n\n &Trans::Push(Box::new(MockState)),\n\n &Trans::Push(Box::new(MockState)),\n\n ); // kcov-ignore\n\n }\n\n\n\n #[test]\n\n #[should_panic(expected = \"Expected `None` but got `Push`.\")]\n\n fn assert_eq_trans_panics_on_different_trans_discriminant() {\n\n assert_eq_trans(&Trans::None, &Trans::Push(Box::new(MockState)));\n\n } // kcov-ignore\n\n\n\n #[test]\n\n fn assert_eq_opt_trans_does_not_panic_on_none_none() {\n\n assert_eq_opt_trans::<GameData<'static, 'static>, ()>(None, None);\n\n }\n\n\n\n #[test]\n\n fn assert_eq_opt_trans_does_not_panic_on_same_discriminant() {\n\n assert_eq_opt_trans::<GameData<'static, 'static>, ()>(\n","file_path":"crate/workspace_tests/src/debug_util_amethyst.rs","rank":37,"score":98759.08406834274},{"content":" Some(Trans::None).as_ref(),\n\n Some(Trans::None).as_ref(),\n\n );\n\n assert_eq_opt_trans(\n\n Some(Trans::Push(Box::new(MockState))).as_ref(),\n\n Some(Trans::Push(Box::new(MockState))).as_ref(),\n\n ); // kcov-ignore\n\n }\n\n\n\n test_opt_trans_panic!(\n\n assert_eq_opt_trans_panics_on_some_none,\n\n \"Expected `Some(Pop)` but got `None`.\",\n\n Some(Trans::Pop).as_ref(),\n\n None\n\n );\n\n\n\n test_opt_trans_panic!(\n\n assert_eq_opt_trans_panics_on_none_some,\n\n \"Expected `None` but got `Some(Pop)`.\",\n\n None,\n","file_path":"crate/workspace_tests/src/debug_util_amethyst.rs","rank":38,"score":98758.71759485404},{"content":" Some(Trans::Pop).as_ref()\n\n );\n\n\n\n test_opt_trans_panic!(\n\n assert_eq_opt_trans_panics_on_different_trans_discriminant,\n\n \"Expected `Some(Pop)` but got `Some(Push)`.\",\n\n Some(Trans::Pop).as_ref(),\n\n Some(Trans::Push(Box::new(MockState))).as_ref()\n\n );\n\n\n\n struct MockState;\n\n impl State<GameData<'static, 'static>, ()> for MockState {}\n\n}\n","file_path":"crate/workspace_tests/src/debug_util_amethyst.rs","rank":39,"score":98757.94477804625},{"content":"mod session_join_event_stdin_mapper;\n\nmod session_join_stdio_bundle;\n","file_path":"crate/workspace_tests/src/session_join_stdio.rs","rank":40,"score":98667.3034096502},{"content":"mod system;\n","file_path":"crate/workspace_tests/src/session_join_play.rs","rank":41,"score":98660.23713094695},{"content":"mod session_join_request_system;\n\nmod session_join_response_system;\n","file_path":"crate/workspace_tests/src/session_join_play/system.rs","rank":42,"score":96433.29419685899},{"content":"#[cfg(test)]\n\nmod tests {\n\n use amethyst::{\n\n core::TransformBundle,\n\n ecs::{Builder, World, WorldExt},\n\n renderer::{types::DefaultBackend, RenderEmptyBundle},\n\n shred::SystemData,\n\n Error,\n\n };\n\n use amethyst_test::AmethystApplication;\n\n use collision_model::loaded::{HitTransition, HittingTransition};\n\n use map_model::play::MapUnboundedDelete;\n\n\n\n use energy_prefab::{EnergyComponentStorages, EnergyEntityAugmenter};\n\n\n\n #[test]\n\n fn augments_entity_with_energy_components() -> Result<(), Error> {\n\n let assertion = |world: &mut World| {\n\n let entity = world.create_entity().build();\n\n {\n","file_path":"crate/workspace_tests/src/energy_prefab/energy_entity_augmenter.rs","rank":43,"score":94361.49624750746},{"content":"#[cfg(test)]\n\nmod test {\n\n use std::{iter::FromIterator, str::FromStr};\n\n\n\n use amethyst::{\n\n assets::{AssetStorage, Loader, Processor},\n\n ecs::{Builder, Read, ReadExpect, World, WorldExt, Write},\n\n shred::SystemData,\n\n Error,\n\n };\n\n use amethyst_test::AmethystApplication;\n\n use asset_model::{\n\n config::AssetSlug,\n\n loaded::{AssetId, AssetIdMappings},\n\n };\n\n use character_model::{\n\n config::{CharacterDefinition, CharacterSequenceName},\n\n loaded::AssetCharacterDefinitionHandle,\n\n play::RunCounter,\n\n };\n","file_path":"crate/workspace_tests/src/character_prefab/character_entity_augmenter.rs","rank":44,"score":94349.54560658289},{"content":" use charge_model::{\n\n config::{ChargeDelay, ChargeLimit, ChargeUseMode},\n\n play::{ChargeRetention, ChargeTrackerClock},\n\n };\n\n use game_input_model::play::ControllerInput;\n\n use map_model::play::MapBounded;\n\n use object_model::{config::Mass, play::HealthPoints};\n\n use object_status_model::config::StunPoints;\n\n use sequence_model::loaded::{AssetSequenceIdMappings, SequenceIdMappings};\n\n\n\n use character_prefab::{\n\n CharacterComponentStorages, CharacterEntityAugmenter, CharacterSpawningResources,\n\n };\n\n\n\n #[test]\n\n fn augments_entity_with_character_components() -> Result<(), Error> {\n\n let assertion = |world: &mut World| {\n\n let entity = world.create_entity().build();\n\n {\n\n let asset_id = *world.read_resource::<AssetId>();\n","file_path":"crate/workspace_tests/src/character_prefab/character_entity_augmenter.rs","rank":45,"score":94346.8811787931},{"content":" assert!(world.read_storage::<ChargeLimit>().contains(entity));\n\n assert!(world.read_storage::<ChargeDelay>().contains(entity));\n\n assert!(world.read_storage::<ChargeUseMode>().contains(entity));\n\n assert!(world.read_storage::<ChargeRetention>().contains(entity));\n\n };\n\n\n\n AmethystApplication::blank()\n\n .with_system(Processor::<CharacterDefinition>::new(), \"\", &[])\n\n .with_setup(|world| {\n\n <Read<'_, AssetIdMappings> as SystemData>::setup(world);\n\n <CharacterSpawningResources as SystemData>::setup(world);\n\n <CharacterComponentStorages as SystemData>::setup(world);\n\n })\n\n .with_effect(|world| {\n\n let asset_id = {\n\n let mut asset_id_mappings = world.write_resource::<AssetIdMappings>();\n\n let asset_slug =\n\n AssetSlug::from_str(\"test/char\").expect(\"Expected asset slug to be valid.\");\n\n asset_id_mappings.insert(asset_slug)\n\n };\n","file_path":"crate/workspace_tests/src/character_prefab/character_entity_augmenter.rs","rank":46,"score":94341.07652098649},{"content":" let mut energy_component_storages = EnergyComponentStorages::fetch(&world);\n\n EnergyEntityAugmenter::augment(entity, &mut energy_component_storages);\n\n }\n\n\n\n assert!(world.read_storage::<MapUnboundedDelete>().contains(entity));\n\n assert!(world.read_storage::<HitTransition>().contains(entity));\n\n assert!(world.read_storage::<HittingTransition>().contains(entity));\n\n };\n\n\n\n AmethystApplication::blank()\n\n .with_bundle(TransformBundle::new())\n\n .with_bundle(RenderEmptyBundle::<DefaultBackend>::new())\n\n .with_effect(|world| {\n\n <EnergyComponentStorages as SystemData>::setup(world);\n\n })\n\n .with_assertion(assertion)\n\n .run_isolated()\n\n }\n\n}\n","file_path":"crate/workspace_tests/src/energy_prefab/energy_entity_augmenter.rs","rank":47,"score":94336.7873825122},{"content":" let (character_spawning_resources, mut character_component_storages) = world\n\n .system_data::<(\n\n CharacterSpawningResources<'_>,\n\n CharacterComponentStorages<'_>,\n\n )>();\n\n CharacterEntityAugmenter::augment(\n\n &character_spawning_resources,\n\n &mut character_component_storages,\n\n asset_id,\n\n entity,\n\n );\n\n }\n\n\n\n assert!(world.read_storage::<ControllerInput>().contains(entity));\n\n assert!(world.read_storage::<HealthPoints>().contains(entity));\n\n assert!(world.read_storage::<StunPoints>().contains(entity));\n\n assert!(world.read_storage::<RunCounter>().contains(entity));\n\n assert!(world.read_storage::<Mass>().contains(entity));\n\n assert!(world.read_storage::<MapBounded>().contains(entity));\n\n assert!(world.read_storage::<ChargeTrackerClock>().contains(entity));\n","file_path":"crate/workspace_tests/src/character_prefab/character_entity_augmenter.rs","rank":48,"score":94334.25496520814},{"content":"\n\n let character_definition_handle = loader.load_from_data(\n\n character_definition,\n\n (),\n\n &*character_definition_assets,\n\n );\n\n asset_character_definition_handle.insert(asset_id, character_definition_handle);\n\n }\n\n\n\n world.insert(asset_id);\n\n })\n\n .with_assertion(assertion)\n\n .run()\n\n }\n\n}\n","file_path":"crate/workspace_tests/src/character_prefab/character_entity_augmenter.rs","rank":49,"score":94325.45707713174},{"content":"\n\n {\n\n let (\n\n loader,\n\n mut asset_sequence_id_mappings_character,\n\n mut asset_character_definition_handle,\n\n character_definition_assets,\n\n ) = world.system_data::<(\n\n ReadExpect<'_, Loader>,\n\n Write<'_, AssetSequenceIdMappings<CharacterSequenceName>>,\n\n Write<'_, AssetCharacterDefinitionHandle>,\n\n Read<'_, AssetStorage<CharacterDefinition>>,\n\n )>();\n\n\n\n let character_definition = CharacterDefinition::default();\n\n\n\n let sequence_id_mappings = SequenceIdMappings::from_iter(\n\n character_definition.object_definition.sequences.keys(),\n\n );\n\n asset_sequence_id_mappings_character.insert(asset_id, sequence_id_mappings);\n","file_path":"crate/workspace_tests/src/character_prefab/character_entity_augmenter.rs","rank":50,"score":94324.20563441417},{"content":"#[cfg(test)]\n\nmod tests {\n\n use game_input_stdio::GameInputStdioError;\n\n\n\n #[test]\n\n fn fmt_display_is_user_friendly() {\n\n assert_eq!(\n\n \"Failed to find entity with an `InputControlled` component with the specified controller ID: `4`.\\n\\\n\n The following controller IDs are associated with entities:\\n\\\n\n \\n\\\n\n * 0\\n\\\n\n * 1\\n\\\n\n \\n\\\n\n \",\n\n format!(\"{}\", GameInputStdioError::EntityWithControllerIdNotFound { controller_id: 4, existent_controllers: vec![0, 1] })\n\n );\n\n }\n\n}\n","file_path":"crate/workspace_tests/src/game_input_stdio/game_input_stdio_error.rs","rank":51,"score":90371.69472689544},{"content":"#[cfg(test)]\n\nmod tests {\n\n use asset_model::config::{AssetSlugBuildError, AssetSlugSegment};\n\n\n\n #[test]\n\n fn namespace_must_be_specified() {\n\n assert_eq!(\n\n \"Namespace is a required value.\",\n\n String::from(AssetSlugBuildError::NoValueProvided {\n\n segment: AssetSlugSegment::Namespace\n\n })\n\n );\n\n }\n\n\n\n #[test]\n\n fn namespace_must_not_be_empty() {\n\n assert_eq!(\n\n \"Namespace must not be empty.\",\n\n String::from(AssetSlugBuildError::SegmentEmpty {\n\n segment: AssetSlugSegment::Namespace\n","file_path":"crate/workspace_tests/src/asset_model/config/asset_slug_build_error.rs","rank":52,"score":90365.94519701114},{"content":"#[cfg(test)]\n\nmod tests {\n\n use amethyst::{\n\n ecs::{Builder, Entities, Entity, WorldExt},\n\n Error,\n\n };\n\n use amethyst_test::AmethystApplication;\n\n use parent_model::play::ParentEntity;\n\n\n\n use parent_play::ChildEntityDeleteSystem;\n\n\n\n #[test]\n\n fn deletes_entities_when_parent_entity_is_dead() -> Result<(), Error> {\n\n AmethystApplication::blank()\n\n .with_system(ChildEntityDeleteSystem::new(), \"\", &[])\n\n .with_effect(|world| {\n\n let entity_parent = world.create_entity().build();\n\n let entity_child = world\n\n .create_entity()\n\n .with(ParentEntity::new(entity_parent))\n","file_path":"crate/workspace_tests/src/parent_play/system/child_entity_delete_system.rs","rank":53,"score":90362.9702356666},{"content":"\n\n #[test]\n\n fn name_must_not_contain_forward_slash() {\n\n assert_eq!(\n\n \"Name must not contain the '/' character: `a/b`.\",\n\n String::from(AssetSlugBuildError::SegmentContainsForwardSlash {\n\n segment: AssetSlugSegment::Name,\n\n value: String::from(\"a/b\")\n\n })\n\n );\n\n }\n\n\n\n #[test]\n\n fn from_str_returns_err_when_too_few_segments() {\n\n assert_eq!(\n\n \"Expected exactly one `/` in asset slug string: `test`.\",\n\n String::from(AssetSlugBuildError::InvalidSegmentCount {\n\n value: String::from(\"test\")\n\n })\n\n );\n","file_path":"crate/workspace_tests/src/asset_model/config/asset_slug_build_error.rs","rank":54,"score":90358.40968660216},{"content":" }\n\n\n\n #[test]\n\n fn from_str_returns_err_when_too_many_segments() {\n\n assert_eq!(\n\n \"Expected exactly one `/` in asset slug string: `test/abc/def`.\",\n\n String::from(AssetSlugBuildError::InvalidSegmentCount {\n\n value: String::from(\"test/abc/def\")\n\n })\n\n );\n\n }\n\n\n\n #[test]\n\n fn from_str_returns_err_from_builder_when_invalid() {\n\n assert_eq!(\n\n \"Name must not contain whitespace: `a b`.\",\n\n String::from(AssetSlugBuildError::SegmentContainsWhitespace {\n\n segment: AssetSlugSegment::Name,\n\n value: String::from(\"a b\")\n\n })\n\n );\n\n }\n\n}\n","file_path":"crate/workspace_tests/src/asset_model/config/asset_slug_build_error.rs","rank":55,"score":90358.31399822916},{"content":" \"Namespace must not contain the '/' character: `a/b`.\",\n\n String::from(AssetSlugBuildError::SegmentContainsForwardSlash {\n\n segment: AssetSlugSegment::Namespace,\n\n value: String::from(\"a/b\")\n\n })\n\n );\n\n }\n\n\n\n #[test]\n\n fn name_must_be_specified() {\n\n assert_eq!(\n\n \"Name is a required value.\",\n\n String::from(AssetSlugBuildError::NoValueProvided {\n\n segment: AssetSlugSegment::Name\n\n })\n\n );\n\n }\n\n\n\n #[test]\n\n fn name_must_not_be_empty() {\n","file_path":"crate/workspace_tests/src/asset_model/config/asset_slug_build_error.rs","rank":56,"score":90357.6884720852},{"content":" assert_eq!(\n\n \"Name must not be empty.\",\n\n String::from(AssetSlugBuildError::SegmentEmpty {\n\n segment: AssetSlugSegment::Name\n\n })\n\n );\n\n }\n\n\n\n #[test]\n\n fn name_must_not_contain_control_character() {\n\n assert_eq!(\n\n \"Name must not contain control character: `a\\\\u{9c}b`.\",\n\n String::from(AssetSlugBuildError::SegmentContainsControlChar {\n\n segment: AssetSlugSegment::Name,\n\n value: String::from(\"ab\")\n\n })\n\n );\n\n }\n\n\n\n #[test]\n","file_path":"crate/workspace_tests/src/asset_model/config/asset_slug_build_error.rs","rank":57,"score":90357.51201867082},{"content":" })\n\n );\n\n }\n\n\n\n #[test]\n\n fn namespace_must_not_contain_control_character() {\n\n assert_eq!(\n\n \"Namespace must not contain control character: `a\\\\u{9c}b`.\",\n\n String::from(AssetSlugBuildError::SegmentContainsControlChar {\n\n segment: AssetSlugSegment::Namespace,\n\n value: String::from(\"ab\")\n\n })\n\n );\n\n }\n\n\n\n #[test]\n\n fn namespace_must_not_start_with_numeric_character() {\n\n assert_eq!(\n\n \"Namespace must not start with numeric character: `1ab`.\",\n\n String::from(AssetSlugBuildError::SegmentStartsWithNumericChar {\n","file_path":"crate/workspace_tests/src/asset_model/config/asset_slug_build_error.rs","rank":58,"score":90357.2307661326},{"content":" segment: AssetSlugSegment::Namespace,\n\n value: String::from(\"1ab\")\n\n })\n\n );\n\n }\n\n\n\n #[test]\n\n fn namespace_must_not_contain_whitespace() {\n\n assert_eq!(\n\n \"Namespace must not contain whitespace: `a b`.\",\n\n String::from(AssetSlugBuildError::SegmentContainsWhitespace {\n\n segment: AssetSlugSegment::Namespace,\n\n value: String::from(\"a b\")\n\n })\n\n );\n\n }\n\n\n\n #[test]\n\n fn namespace_must_not_contain_forward_slash() {\n\n assert_eq!(\n","file_path":"crate/workspace_tests/src/asset_model/config/asset_slug_build_error.rs","rank":59,"score":90356.50522784698},{"content":" fn name_must_not_start_with_numeric_character() {\n\n assert_eq!(\n\n \"Name must not start with numeric character: `1ab`.\",\n\n String::from(AssetSlugBuildError::SegmentStartsWithNumericChar {\n\n segment: AssetSlugSegment::Name,\n\n value: String::from(\"1ab\")\n\n })\n\n );\n\n }\n\n\n\n #[test]\n\n fn name_must_not_contain_whitespace() {\n\n assert_eq!(\n\n \"Name must not contain whitespace: `a b`.\",\n\n String::from(AssetSlugBuildError::SegmentContainsWhitespace {\n\n segment: AssetSlugSegment::Name,\n\n value: String::from(\"a b\")\n\n })\n\n );\n\n }\n","file_path":"crate/workspace_tests/src/asset_model/config/asset_slug_build_error.rs","rank":60,"score":90355.68560592474},{"content":" .with_assertion(|world| {\n\n let (entity_parent, entity_child) = *world.read_resource::<(Entity, Entity)>();\n\n let entities = world.system_data::<Entities<'_>>();\n\n\n\n assert!(!entities.is_alive(entity_parent));\n\n assert!(!entities.is_alive(entity_child));\n\n })\n\n .run()\n\n }\n\n\n\n #[test]\n\n fn ignores_entities_without_parent_entity_component() -> Result<(), Error> {\n\n AmethystApplication::blank()\n\n .with_system(ChildEntityDeleteSystem::new(), \"\", &[])\n\n .with_effect(|world| {\n\n let entity_parent = world.create_entity().build();\n\n let entity_other = world.create_entity().build();\n\n\n\n world.insert((entity_parent, entity_other));\n\n })\n","file_path":"crate/workspace_tests/src/parent_play/system/child_entity_delete_system.rs","rank":61,"score":90348.52079479316},{"content":" .build();\n\n\n\n world.insert((entity_parent, entity_child));\n\n })\n\n .with_assertion(|world| {\n\n let (entity_parent, entity_child) = *world.read_resource::<(Entity, Entity)>();\n\n let entities = world.system_data::<Entities<'_>>();\n\n\n\n assert!(entities.is_alive(entity_parent));\n\n assert!(entities.is_alive(entity_child));\n\n })\n\n .with_effect(|world| {\n\n let (entity_parent, _entity_child) = *world.read_resource::<(Entity, Entity)>();\n\n let entities = world.system_data::<Entities<'_>>();\n\n\n\n entities\n\n .delete(entity_parent)\n\n .expect(\"Failed to delete `entity_parent`.\");\n\n })\n\n .with_effect(|_| {}) // Wait for one more tick.\n","file_path":"crate/workspace_tests/src/parent_play/system/child_entity_delete_system.rs","rank":62,"score":90335.07542737876},{"content":" .with_effect(|world| {\n\n let (entity_parent, _entity_other) = *world.read_resource::<(Entity, Entity)>();\n\n let entities = world.system_data::<Entities<'_>>();\n\n\n\n entities\n\n .delete(entity_parent)\n\n .expect(\"Failed to delete `entity_parent`.\");\n\n })\n\n .with_effect(|_| {}) // Wait for one more tick.\n\n .with_assertion(|world| {\n\n let (entity_parent, entity_other) = *world.read_resource::<(Entity, Entity)>();\n\n let entities = world.system_data::<Entities<'_>>();\n\n\n\n assert!(!entities.is_alive(entity_parent));\n\n assert!(entities.is_alive(entity_other));\n\n })\n\n .run()\n\n }\n\n}\n","file_path":"crate/workspace_tests/src/parent_play/system/child_entity_delete_system.rs","rank":63,"score":90335.04753566557},{"content":"/// Asserts that the `Trans` objects, disregarding their `State`, are equal.\n\n///\n\n/// This `panic!`s with a readable error message when the assertion fails.\n\n///\n\n/// # Parameters\n\n///\n\n/// * `expected`: The `Trans` that is desired.\n\n/// * `actual`: The `Trans` that was acquired.\n\n///\n\n/// # Examples\n\n///\n\n/// Successful assertion:\n\n///\n\n/// ```rust\n\n/// # extern crate amethyst;\n\n/// # extern crate debug_util_amethyst;\n\n/// #\n\n/// # use amethyst::prelude::*;\n\n/// # use debug_util_amethyst::assert_eq_trans;\n\n/// #\n\n/// // ok\n\n/// assert_eq_trans::<(), ()>(&Trans::None, &Trans::None);\n\n/// ```\n\n///\n\n/// Failing assertion:\n\n///\n\n/// ```rust,should_panic\n\n/// # extern crate amethyst;\n\n/// # extern crate debug_util_amethyst;\n\n/// #\n\n/// # use amethyst::prelude::*;\n\n/// # use debug_util_amethyst::assert_eq_trans;\n\n/// #\n\n/// // panic: Expected `Trans::None` but got `Trans::Pop`.\n\n/// assert_eq_trans::<(), ()>(&Trans::None, &Trans::Pop);\n\n/// ```\n\n///\n\n/// # Panics\n\n///\n\n/// When the expected and actual `Trans` differ.\n\npub fn assert_eq_trans<T, E>(expected: &Trans<T, E>, actual: &Trans<T, E>) {\n\n assert_eq!(\n\n discriminant(expected),\n\n discriminant(actual),\n\n \"Expected `{:?}` but got `{:?}`.\",\n\n expected,\n\n actual\n\n );\n\n}\n\n\n","file_path":"crate/debug_util_amethyst/src/lib.rs","rank":64,"score":88752.32992608017},{"content":"/// Asserts that the `Trans` objects contained in the `Option`s, disregarding their `State`, are\n\n/// equal.\n\n///\n\n/// This `panic!`s with a readable error message when the assertion fails.\n\n///\n\n/// # Parameters\n\n///\n\n/// * `expected`: The `Option<Trans>` that is desired.\n\n/// * `actual`: The `Option<Trans>` that was acquired.\n\n///\n\n/// # Examples\n\n///\n\n/// Successful assertion:\n\n///\n\n/// ```rust\n\n/// # extern crate amethyst;\n\n/// # extern crate debug_util_amethyst;\n\n/// #\n\n/// # use amethyst::prelude::*;\n\n/// # use debug_util_amethyst::assert_eq_opt_trans;\n\n/// #\n\n/// assert_eq_opt_trans::<(), ()>(None, None);\n\n/// assert_eq_opt_trans::<(), ()>(Some(Trans::None).as_ref(), Some(Trans::None).as_ref());\n\n/// ```\n\n///\n\n/// Failing assertion:\n\n///\n\n/// ```rust,should_panic\n\n/// # extern crate amethyst;\n\n/// # extern crate debug_util_amethyst;\n\n/// #\n\n/// # use amethyst::prelude::*;\n\n/// # use debug_util_amethyst::assert_eq_opt_trans;\n\n/// #\n\n/// // panic: Expected `Some(Trans::None)` but got `Some(Trans::Pop)`.\n\n/// assert_eq_opt_trans::<(), ()>(Some(Trans::None).as_ref(), Some(Trans::Pop).as_ref());\n\n/// ```\n\n///\n\n/// # Panics\n\n///\n\n/// When the expected and actual `Trans` differ.\n\npub fn assert_eq_opt_trans<T, E>(expected: Option<&Trans<T, E>>, actual: Option<&Trans<T, E>>) {\n\n match (expected, actual) {\n\n (Some(expected_trans), Some(actual_trans)) => assert_eq!(\n\n discriminant(expected_trans),\n\n discriminant(actual_trans),\n\n \"Expected `{:?}` but got `{:?}`.\",\n\n expected,\n\n actual\n\n ),\n\n (Some(_), None) => panic!(\"Expected `{:?}` but got `None`.\", expected),\n\n (None, Some(_)) => panic!(\"Expected `None` but got `{:?}`.\", actual),\n\n (None, None) => {}\n\n };\n\n}\n","file_path":"crate/debug_util_amethyst/src/lib.rs","rank":65,"score":83872.25058419157},{"content":"/// Returns an function implementation for the `ComponentData::to_owned` trait method.\n\npub fn to_owned_fn_impl(component_copy: bool, to_owned_fn: Option<Path>) -> TokenStream {\n\n if component_copy {\n\n quote! {\n\n fn to_owned(component: &Self::Component) -> Self::Component {\n\n *component\n\n }\n\n }\n\n } else {\n\n let to_owned_fn = to_owned_fn.unwrap_or_else(|| parse_quote!(std::clone::Clone::clone));\n\n\n\n quote! {\n\n fn to_owned(component: &Self::Component) -> Self::Component {\n\n #to_owned_fn(component)\n\n }\n\n }\n\n }\n\n}\n","file_path":"crate/sequence_model_derive/src/to_owned_fn_impl.rs","rank":66,"score":77581.33129643837},{"content":"#[test]\n\nfn quotes() {\n\n let command = \"echo \\\"This ;'is a test\\\"; echo 'This ;\\\" is also a test'\";\n\n let results = StatementSplitter::new(command).collect::<Vec<_>>();\n\n assert_eq!(results.len(), 2);\n\n assert_eq!(\n\n results[0],\n\n Ok(StatementVariant::Default(\"echo \\\"This ;'is a test\\\"\"))\n\n );\n\n assert_eq!(\n\n results[1],\n\n Ok(StatementVariant::Default(\"echo 'This ;\\\" is also a test'\"))\n\n );\n\n}\n\n\n","file_path":"crate/stdio_input/src/ion/splitter.rs","rank":67,"score":72937.58664003076},{"content":"#[test]\n\nfn variants() {\n\n let command = r#\"echo \"Hello!\"; echo \"How are you doing?\" && echo \"I'm just an ordinary test.\" || echo \"Helping by making sure your code works right.\"; echo \"Have a good day!\"\"#;\n\n let results = StatementSplitter::new(command).collect::<Vec<_>>();\n\n assert_eq!(results.len(), 5);\n\n assert_eq!(\n\n results[0],\n\n Ok(StatementVariant::Default(r#\"echo \"Hello!\"\"#))\n\n );\n\n assert_eq!(\n\n results[1],\n\n Ok(StatementVariant::Default(r#\"echo \"How are you doing?\"\"#))\n\n );\n\n assert_eq!(\n\n results[2],\n\n Ok(StatementVariant::And(\n\n r#\"echo \"I'm just an ordinary test.\"\"#\n\n ))\n\n );\n\n assert_eq!(\n\n results[3],\n\n Ok(StatementVariant::Or(\n\n r#\"echo \"Helping by making sure your code works right.\"\"#\n\n ))\n\n );\n\n assert_eq!(\n\n results[4],\n\n Ok(StatementVariant::Default(r#\"echo \"Have a good day!\"\"#))\n\n );\n\n}\n","file_path":"crate/stdio_input/src/ion/splitter.rs","rank":68,"score":72937.58664003076},{"content":"#[test]\n\nfn processes() {\n\n let command = \"echo $(seq 1 10); echo $(seq 1 10)\";\n\n for statement in StatementSplitter::new(command) {\n\n assert_eq!(statement, Ok(StatementVariant::Default(\"echo $(seq 1 10)\")));\n\n }\n\n}\n\n\n","file_path":"crate/stdio_input/src/ion/splitter.rs","rank":69,"score":72937.58664003076},{"content":"#[test]\n\nfn comments() {\n\n let command = \"echo $(echo one # two); echo three # four\";\n\n let results = StatementSplitter::new(command).collect::<Vec<_>>();\n\n assert_eq!(results.len(), 2);\n\n assert_eq!(\n\n results[0],\n\n Ok(StatementVariant::Default(\"echo $(echo one # two)\"))\n\n );\n\n assert_eq!(results[1], Ok(StatementVariant::Default(\"echo three\")));\n\n}\n\n\n","file_path":"crate/stdio_input/src/ion/splitter.rs","rank":70,"score":72937.58664003076},{"content":"#[test]\n\nfn methods() {\n\n let command = \"echo $join(array, ', '); echo @join(var, ', ')\";\n\n let statements = StatementSplitter::new(command).collect::<Vec<_>>();\n\n assert_eq!(\n\n statements[0],\n\n Ok(StatementVariant::Default(\"echo $join(array, ', ')\"))\n\n );\n\n assert_eq!(\n\n statements[1],\n\n Ok(StatementVariant::Default(\"echo @join(var, ', ')\"))\n\n );\n\n assert_eq!(statements.len(), 2);\n\n}\n\n\n","file_path":"crate/stdio_input/src/ion/splitter.rs","rank":71,"score":72937.58664003076},{"content":"fn main() {\n\n amethyst::start_logger(LoggerConfig {\n\n level_filter: if cfg!(debug_assertions) {\n\n LogLevelFilter::Debug\n\n } else {\n\n LogLevelFilter::Info\n\n },\n\n ..Default::default()\n\n });\n\n\n\n let opt = Opt::from_args();\n\n if let Err(e) = run(&opt) {\n\n println!(\"Failed to execute example: {}\", e);\n\n process::exit(1);\n\n }\n\n}\n","file_path":"crate/stdio_input/examples/01_read_and_exit.rs","rank":72,"score":72931.4534092138},{"content":"#[test]\n\nfn nested_process() {\n\n let command = \"echo $(echo one $(echo two) three)\";\n\n let results = StatementSplitter::new(command).collect::<Vec<_>>();\n\n assert_eq!(results.len(), 1);\n\n assert_eq!(results[0], Ok(StatementVariant::Default(command)));\n\n\n\n let command = \"echo $(echo $(echo one; echo two); echo two)\";\n\n let results = StatementSplitter::new(command).collect::<Vec<_>>();\n\n assert_eq!(results.len(), 1);\n\n assert_eq!(results[0], Ok(StatementVariant::Default(command)));\n\n}\n\n\n","file_path":"crate/stdio_input/src/ion/splitter.rs","rank":73,"score":71786.94777048778},{"content":"#[test]\n\nfn braced_variables() {\n\n let command = \"echo ${foo}bar ${bar}baz ${baz}quux @{zardoz}wibble\";\n\n let results = StatementSplitter::new(command).collect::<Vec<_>>();\n\n assert_eq!(results.len(), 1);\n\n assert_eq!(results[0], Ok(StatementVariant::Default(command)));\n\n}\n\n\n","file_path":"crate/stdio_input/src/ion/splitter.rs","rank":74,"score":71786.94777048778},{"content":"#[test]\n\nfn process_with_statements() {\n\n let command = \"echo $(seq 1 10; seq 1 10)\";\n\n for statement in StatementSplitter::new(command) {\n\n assert_eq!(statement, Ok(StatementVariant::Default(command)));\n\n }\n\n}\n\n\n","file_path":"crate/stdio_input/src/ion/splitter.rs","rank":75,"score":71786.94777048778},{"content":"#[test]\n\nfn array_processes() {\n\n let command = \"echo @(echo one; sleep 1); echo @(echo one; sleep 1)\";\n\n for statement in StatementSplitter::new(command) {\n\n assert_eq!(\n\n statement,\n\n Ok(StatementVariant::Default(\"echo @(echo one; sleep 1)\"))\n\n );\n\n }\n\n}\n\n\n","file_path":"crate/stdio_input/src/ion/splitter.rs","rank":76,"score":71786.94777048778},{"content":"#[test]\n\nfn nested_array_process() {\n\n let command = \"echo @(echo one @(echo two) three)\";\n\n let results = StatementSplitter::new(command).collect::<Vec<_>>();\n\n assert_eq!(results.len(), 1);\n\n assert_eq!(results[0], Ok(StatementVariant::Default(command)));\n\n\n\n let command = \"echo @(echo @(echo one; echo two); echo two)\";\n\n let results = StatementSplitter::new(command).collect::<Vec<_>>();\n\n assert_eq!(results.len(), 1);\n\n assert_eq!(results[0], Ok(StatementVariant::Default(command)));\n\n}\n\n\n","file_path":"crate/stdio_input/src/ion/splitter.rs","rank":77,"score":70687.26918433848},{"content":"fn begins_with_vowel(word: &str) -> bool {\n\n if let Some('A') | Some('E') | Some('I') | Some('O') | Some('U') = word.chars().next() {\n\n true\n\n } else {\n\n false\n\n }\n\n}\n","file_path":"crate/asset_derive/src/lib.rs","rank":78,"score":64571.91798319912},{"content":"/// Returns true if the byte matches [^A-Za-z0-9_]\n\nfn is_invalid(byte: u8) -> bool {\n\n byte <= 47\n\n || (byte >= 58 && byte <= 64)\n\n || (byte >= 91 && byte <= 94)\n\n || byte == 96\n\n || (byte >= 123 && byte <= 127)\n\n}\n\n\n\n#[derive(Debug, PartialEq)]\n\npub enum StatementVariant<'a> {\n\n And(&'a str),\n\n Or(&'a str),\n\n Default(&'a str),\n\n}\n\n\n\n#[derive(Debug)]\n\npub struct StatementSplitter<'a> {\n\n data: &'a str,\n\n read: usize,\n\n start: usize,\n","file_path":"crate/stdio_input/src/ion/splitter.rs","rank":79,"score":64571.91798319912},{"content":"/// Generates the `FrameComponentData` implementation.\n\npub fn frame_component_data_impl(\n\n mut ast: DeriveInput,\n\n args: ComponentDataAttributeArgs,\n\n) -> TokenStream {\n\n let ComponentDataAttributeArgs {\n\n component_path,\n\n component_copy,\n\n to_owned_fn,\n\n } = args;\n\n\n\n ast.assert_fields_unit();\n\n derive_append(&mut ast);\n\n fields_append(&mut ast, &component_path);\n\n\n\n let type_name = &ast.ident;\n\n let to_owned_fn_impl = to_owned_fn_impl(component_copy, to_owned_fn);\n\n\n\n let fn_new_doc = format!(\"Returns a new `{}`.\", type_name);\n\n\n\n let token_stream_2 = quote! {\n","file_path":"crate/sequence_model_derive/src/frame_component_data_impl.rs","rank":80,"score":63851.62282267952},{"content":"/// Generates the `SequenceComponentData` implementation.\n\npub fn sequence_component_data_impl(\n\n mut ast: DeriveInput,\n\n args: ComponentDataAttributeArgs,\n\n) -> TokenStream {\n\n let ComponentDataAttributeArgs {\n\n component_path,\n\n component_copy,\n\n to_owned_fn,\n\n } = args;\n\n\n\n ast.assert_fields_unit();\n\n derive_append(&mut ast);\n\n fields_append(&mut ast, &component_path);\n\n\n\n let type_name = &ast.ident;\n\n let (impl_generics, ty_generics, where_clause) = ast.generics.split_for_impl();\n\n let to_owned_fn_impl = to_owned_fn_impl(component_copy, to_owned_fn);\n\n\n\n let fn_new_doc = format!(\"Returns a new `{}`.\", type_name);\n\n\n","file_path":"crate/sequence_model_derive/src/sequence_component_data_impl.rs","rank":81,"score":63851.62282267952},{"content":"/// Returns whether the type is known to be `Eq + Ord`.\n\n///\n\n/// Note: This is a static list, so any types not in the following list will give a false `false`:\n\nfn is_eq_ord(ty: &Type) -> bool {\n\n if let Type::Path(TypePath { path, .. }) = ty {\n\n path.segments\n\n .last()\n\n .map(|segment| {\n\n let ty_ident = &segment.ident;\n\n KNOWN_TYPES_EQ_ORD\n\n .iter()\n\n .any(|known_ty| ty_ident == known_ty)\n\n })\n\n .unwrap_or(false)\n\n } else {\n\n false\n\n }\n\n}\n","file_path":"crate/numeric_newtype_derive/src/lib.rs","rank":82,"score":63564.50459388443},{"content":"use amethyst::{GameData, State, StateData, Trans};\n\nuse application_event::AppEvent;\n\nuse application_state::{AppState, AppStateBuilder};\n\nuse derivative::Derivative;\n\nuse derive_new::new;\n\nuse log::debug;\n\nuse network_session_model::play::SessionStatus;\n\nuse session_join_model::{SessionJoinEntity, SessionJoinEvent};\n\nuse session_lobby::{SessionLobbyStateBuilder, SessionLobbyStateDelegate};\n\nuse state_registry::StateId;\n\n\n\n/// `State` where session joining takes place.\n\n///\n\n/// This state is not intended to be constructed directly, but through the\n\n/// [`SessionJoinStateBuilder`][state_builder].\n\n///\n\n/// [state_builder]: network_mode_selection_state/struct.SessionJoinStateBuilder.html\n\npub type SessionJoinState = AppState<'static, 'static, SessionJoinStateDelegate, SessionJoinEntity>;\n\n\n\n/// Builder for a `SessionJoinState`.\n","file_path":"crate/session_join/src/session_join_state.rs","rank":83,"score":63124.65088324821},{"content":"///\n\n/// `SystemBundle`s to run in the `SessionJoinState`'s dispatcher are registered on this builder.\n\npub type SessionJoinStateBuilder =\n\n AppStateBuilder<'static, 'static, SessionJoinStateDelegate, SessionJoinEntity>;\n\n\n\n/// Delegate `State` for session joining.\n\n///\n\n/// This state is not intended to be used directly, but wrapped in an `AppState`. The\n\n/// `SessionJoinState` is an alias with this as a delegate state.\n\n#[derive(Derivative, new)]\n\n#[derivative(Debug)]\n\npub struct SessionJoinStateDelegate;\n\n\n\nimpl SessionJoinStateDelegate {\n\n fn initialize_state(data: StateData<'_, GameData<'static, 'static>>) {\n\n data.world.insert(StateId::SessionJoin);\n\n data.world.insert(SessionStatus::None);\n\n }\n\n}\n\n\n","file_path":"crate/session_join/src/session_join_state.rs","rank":84,"score":63122.25951359018},{"content":"impl State<GameData<'static, 'static>, AppEvent> for SessionJoinStateDelegate {\n\n fn on_start(&mut self, data: StateData<'_, GameData<'static, 'static>>) {\n\n Self::initialize_state(data);\n\n }\n\n\n\n fn on_resume(&mut self, data: StateData<'_, GameData<'static, 'static>>) {\n\n Self::initialize_state(data);\n\n }\n\n\n\n fn handle_event(\n\n &mut self,\n\n _data: StateData<'_, GameData<'static, 'static>>,\n\n event: AppEvent,\n\n ) -> Trans<GameData<'static, 'static>, AppEvent> {\n\n if let AppEvent::SessionJoin(session_join_event) = event {\n\n debug!(\"Received session_join_event: {:?}\", session_join_event);\n\n match session_join_event {\n\n SessionJoinEvent::SessionAccept(_) => {\n\n let session_lobby_state =\n\n SessionLobbyStateBuilder::new(SessionLobbyStateDelegate::new()).build();\n","file_path":"crate/session_join/src/session_join_state.rs","rank":85,"score":63111.479039491416},{"content":" Trans::Push(Box::new(session_lobby_state))\n\n }\n\n SessionJoinEvent::Back => Trans::Pop,\n\n _ => Trans::None,\n\n }\n\n } else {\n\n Trans::None\n\n }\n\n }\n\n}\n","file_path":"crate/session_join/src/session_join_state.rs","rank":86,"score":63110.22374841251},{"content":"fn fields_append(ast: &mut DeriveInput) {\n\n let fields: FieldsUnnamed = parse_quote! {(pub logic_clock::LogicClock)};\n\n ast.append_unnamed(fields);\n\n}\n","file_path":"crate/logic_clock_derive/src/lib.rs","rank":87,"score":62598.92882014894},{"content":"fn derive_append(ast: &mut DeriveInput) {\n\n let derives = parse_quote!(\n\n Clone,\n\n Component,\n\n Copy,\n\n Debug,\n\n Default,\n\n Deref,\n\n DerefMut,\n\n Deserialize,\n\n From,\n\n Hash,\n\n PartialEq,\n\n Eq,\n\n Serialize,\n\n );\n\n\n\n ast.append_derives(derives);\n\n}\n\n\n","file_path":"crate/logic_clock_derive/src/lib.rs","rank":88,"score":62598.92882014894},{"content":"use serde::{Deserialize, Serialize};\n\nuse structopt_derive::StructOpt;\n\n\n\nuse crate::play::{SessionAcceptResponse, SessionJoinRequestParams, SessionRejectResponse};\n\n\n\n/// Session join state events.\n\n///\n\n/// # Examples\n\n///\n\n/// When read in as a command, the command string should look like the following:\n\n///\n\n/// * `session_join session_join_request --session-code abcd --device-name azriel --player-controllers \"0:azriel 1:friend_a`\n\n/// * `session_join join_cancel`\n\n/// * `session_join session_accept --session-code abcd --session-devices \"0:azriel::0:azriel::1:friend_a 1:byron::0:friend_b 2:carlo::0:friend_c\" --session-device-id 2`\n\n/// * `session_join back`\n\n///\n\n/// **Note:** The `session_accept` subcommand is designed to be received from the server, so sending\n\n/// this as a local command may cause undefined behaviour.\n\n#[derive(Clone, Debug, Deserialize, PartialEq, Serialize, StructOpt)]\n\n#[serde(deny_unknown_fields, rename_all = \"snake_case\")]\n","file_path":"crate/session_join_model/src/session_join_event.rs","rank":89,"score":62220.23110904797},{"content":"#[structopt(rename_all = \"snake_case\")]\n\npub enum SessionJoinEvent {\n\n /// Player entered a session code.\n\n SessionJoinRequest(SessionJoinRequestParams),\n\n /// Player cancelled the request to join.\n\n JoinCancel,\n\n /// Server accepted the client's request.\n\n SessionAccept(SessionAcceptResponse),\n\n /// Server rejected the client's request.\n\n SessionReject(SessionRejectResponse),\n\n /// Return to the previous menu.\n\n Back,\n\n}\n","file_path":"crate/session_join_model/src/session_join_event.rs","rank":90,"score":62215.853694931895},{"content":"#[cfg(test)]\n\nmod tests {\n\n use object_model::config::{ObjectFrame, ObjectSequence};\n\n use sequence_model::config::{Sequence, SequenceEndTransition, Wait};\n\n use serde_yaml;\n\n use sprite_model::config::SpriteRef;\n\n\n\n use test_object_model::config::{TestObjectFrame, TestObjectSequence};\n\n\n\n const SEQUENCE_WITH_FRAMES_EMPTY: &str = \"frames: []\";\n\n const SEQUENCE_WITH_INPUT_REACTIONS: &str = r#\"---\n\nframes:\n\n - wait: 2\n\n sprite: { sheet: 0, index: 4 }\n\n\"#;\n\n\n\n #[test]\n\n fn sequence_with_empty_frames_list_deserializes_successfully() {\n\n let sequence = serde_yaml::from_str::<TestObjectSequence>(SEQUENCE_WITH_FRAMES_EMPTY)\n\n .expect(\"Failed to deserialize sequence.\");\n","file_path":"crate/workspace_tests/src/test_object_model/config/test_object_sequence.rs","rank":91,"score":62204.14952158106},{"content":"\n\n let expected = TestObjectSequence::new(ObjectSequence::default());\n\n assert_eq!(expected, sequence);\n\n }\n\n\n\n #[test]\n\n fn sequence_with_input_reactions() {\n\n let sequence = serde_yaml::from_str::<TestObjectSequence>(SEQUENCE_WITH_INPUT_REACTIONS)\n\n .expect(\"Failed to deserialize sequence.\");\n\n\n\n let frames = vec![TestObjectFrame::new(ObjectFrame {\n\n wait: Wait::new(2),\n\n sprite: SpriteRef::new(0, 4),\n\n ..Default::default()\n\n })];\n\n let expected = TestObjectSequence::new(ObjectSequence {\n\n sequence: Sequence {\n\n next: SequenceEndTransition::None,\n\n frames,\n\n },\n\n ..Default::default()\n\n });\n\n\n\n assert_eq!(expected, sequence);\n\n }\n\n}\n","file_path":"crate/workspace_tests/src/test_object_model/config/test_object_sequence.rs","rank":92,"score":62194.71484432296},{"content":"use std::any;\n\n\n\nuse amethyst::{\n\n core::bundle::SystemBundle,\n\n ecs::{DispatcherBuilder, World},\n\n Error,\n\n};\n\nuse application_event::AppEventVariant;\n\nuse derive_new::new;\n\nuse stdio_spi::MapperSystem;\n\n\n\nuse crate::SessionJoinEventStdinMapper;\n\n\n\n/// Adds a `MapperSystem<SessionJoinEventStdinMapper>` to the `World`.\n\n#[derive(Debug, new)]\n\npub struct SessionJoinStdioBundle;\n\n\n\nimpl<'a, 'b> SystemBundle<'a, 'b> for SessionJoinStdioBundle {\n\n fn build(\n\n self,\n","file_path":"crate/session_join_stdio/src/session_join_stdio_bundle.rs","rank":93,"score":61362.606856344144},{"content":" _world: &mut World,\n\n builder: &mut DispatcherBuilder<'a, 'b>,\n\n ) -> Result<(), Error> {\n\n builder.add(\n\n MapperSystem::<SessionJoinEventStdinMapper>::new(AppEventVariant::SessionJoin),\n\n any::type_name::<MapperSystem<SessionJoinEventStdinMapper>>(),\n\n &[],\n\n ); // kcov-ignore\n\n Ok(())\n\n }\n\n}\n","file_path":"crate/session_join_stdio/src/session_join_stdio_bundle.rs","rank":94,"score":61358.65092057328},{"content":"fn session_server_config(will_config: &WillConfig) -> SessionServerConfig {\n\n SessionServerConfig {\n\n address: will_config.session_server_address,\n\n port: will_config.session_server_port,\n\n }\n\n}\n\n\n","file_path":"app/will/src/main.rs","rank":95,"score":60783.280773305625},{"content":"use amethyst::Error;\n\nuse session_join_model::SessionJoinEvent;\n\nuse stdio_spi::StdinMapper;\n\n\n\n/// Builds a `SessionJoinEvent` from stdin tokens.\n\n#[derive(Debug)]\n\npub struct SessionJoinEventStdinMapper;\n\n\n\nimpl StdinMapper for SessionJoinEventStdinMapper {\n\n type SystemData = ();\n\n type Event = SessionJoinEvent;\n\n type Args = SessionJoinEvent;\n\n\n\n fn map(_: &(), args: Self::Args) -> Result<Self::Event, Error> {\n\n Ok(args)\n\n }\n\n}\n","file_path":"crate/session_join_stdio/src/session_join_event_stdin_mapper.rs","rank":96,"score":60515.937677677735},{"content":"use amethyst::{\n\n derive::SystemDesc,\n\n ecs::{Read, System, World, Write},\n\n shred::{ResourceId, SystemData},\n\n shrev::{EventChannel, ReaderId},\n\n};\n\nuse derivative::Derivative;\n\nuse derive_new::new;\n\nuse game_input_model::{loaded::PlayerControllers, play::ControllerIdOffset};\n\nuse log::debug;\n\nuse net_model::play::{NetData, NetEventChannel};\n\nuse network_session_model::play::{\n\n Session, SessionCode, SessionDeviceId, SessionDevices, SessionStatus,\n\n};\n\nuse session_join_model::{play::SessionAcceptResponse, SessionJoinEvent};\n\n\n\n/// Records the session code and devices in the world when accepted into a session.\n\n#[derive(Debug, SystemDesc, new)]\n\n#[system_desc(name(SessionJoinResponseSystemDesc))]\n\npub struct SessionJoinResponseSystem {\n","file_path":"crate/session_join_play/src/system/session_join_response_system.rs","rank":97,"score":60509.76208301525},{"content":"use amethyst::{\n\n derive::SystemDesc,\n\n ecs::{Read, System, World, Write},\n\n shred::{ResourceId, SystemData},\n\n shrev::{EventChannel, ReaderId},\n\n};\n\nuse derivative::Derivative;\n\nuse derive_new::new;\n\nuse net_model::play::NetMessageEvent;\n\nuse network_session_model::play::SessionStatus;\n\nuse session_join_model::SessionJoinEvent;\n\n\n\n/// Sends requests to a game server to join a session.\n\n#[derive(Debug, SystemDesc, new)]\n\n#[system_desc(name(SessionJoinRequestSystemDesc))]\n\npub struct SessionJoinRequestSystem {\n\n /// Reader ID for the `SessionJoinEvent` channel.\n\n #[system_desc(event_channel_reader)]\n\n session_join_event_rid: ReaderId<SessionJoinEvent>,\n\n}\n","file_path":"crate/session_join_play/src/system/session_join_request_system.rs","rank":98,"score":60509.65091180855},{"content":"use serde::{Deserialize, Serialize};\n\n\n\n/// Configuration parameters to send a `SessionJoinEvent`.\n\n///\n\n/// This excludes `SessionJoinEvent::SessionAccept` because that should be sent from the session\n\n/// server. For testing purposes, you may still use stdin.\n\n#[derive(Clone, Copy, Debug, Deserialize, PartialEq, Serialize)]\n\n#[serde(deny_unknown_fields, rename_all = \"snake_case\")]\n\npub enum SessionJoinEventCommand {\n\n /// Player entered a session code.\n\n ///\n\n /// The `SessionJoinRequestParams` is specially looked up by code.\n\n SessionJoinRequest,\n\n /// Player cancelled the request to join.\n\n JoinCancel,\n\n /// Return to the previous menu.\n\n Back,\n\n}\n","file_path":"crate/session_join_model/src/config/session_join_event_command.rs","rank":99,"score":60505.93226641827}],"string":"[\n {\n \"content\": \"#[test]\\n\\nfn read_and_exit() -> Result<(), OutputError> {\\n\\n let command = CargoBuild::new()\\n\\n .example(\\\"01_read_and_exit\\\")\\n\\n .current_release()\\n\\n .run()\\n\\n .expect(\\\"Failed to create `cargo` command\\\")\\n\\n .command();\\n\\n Command::from_std(command)\\n\\n .write_stdin(\\\"exit\\\\n\\\")\\n\\n .ok()?\\n\\n .assert()\\n\\n .success();\\n\\n Ok(())\\n\\n}\\n\\n\\n\",\n \"file_path\": \"crate/stdio_input/tests/integration_test.rs\",\n \"rank\": 0,\n \"score\": 236240.39583181933\n },\n {\n \"content\": \"#[test]\\n\\nfn read_and_exit_timeout() -> Result<(), OutputError> {\\n\\n let command = CargoBuild::new()\\n\\n .example(\\\"01_read_and_exit\\\")\\n\\n .current_release()\\n\\n .run()\\n\\n .expect(\\\"Failed to create `cargo` command\\\")\\n\\n .command();\\n\\n\\n\\n Command::from_std(command)\\n\\n .args(&[\\\"-t\\\", \\\"0\\\"])\\n\\n .write_stdin(\\\"abc\\\\n\\\")\\n\\n .ok()?\\n\\n .assert()\\n\\n .success();\\n\\n Ok(())\\n\\n}\\n\",\n \"file_path\": \"crate/stdio_input/tests/integration_test.rs\",\n \"rank\": 1,\n \"score\": 232586.00871141808\n },\n {\n \"content\": \"#[test]\\n\\n#[ignore] // Can't test on X through CI.\\n\\nfn start_and_exit() -> Result<(), OutputError> {\\n\\n let command = CargoBuild::new()\\n\\n .bin(\\\"will\\\")\\n\\n .current_release()\\n\\n .run()\\n\\n .expect(\\\"Failed to create `cargo` command\\\")\\n\\n .command();\\n\\n Command::from_std(command)\\n\\n .write_stdin(\\\"exit\\\\n\\\")\\n\\n .ok()?\\n\\n .assert()\\n\\n .success();\\n\\n\\n\\n Ok(())\\n\\n}\\n\",\n \"file_path\": \"app/will/tests/001_start_and_exit.rs\",\n \"rank\": 2,\n \"score\": 227750.20841416426\n },\n {\n \"content\": \"fn main() -> Result<(), Error> {\\n\\n let mut will_config = AppFile::find(WILL_CONFIG)\\n\\n .and_then(|will_config_path| IoUtils::read_file(&will_config_path).map_err(Error::from))\\n\\n .and_then(|bytes| String::from_utf8(bytes).map_err(Error::from))\\n\\n .and_then(|will_config_toml| {\\n\\n WillConfig::from_args_with_toml(&will_config_toml).map_err(|e| Error::from(e.compat()))\\n\\n })\\n\\n .unwrap_or_else(|e| {\\n\\n eprintln!(\\\"{}\\\", e);\\n\\n WillConfig::from_args()\\n\\n });\\n\\n\\n\\n let session_server_config = session_server_config(&will_config);\\n\\n\\n\\n logger_setup(will_config.logger_config.take())?;\\n\\n debug!(\\\"will_config: {:?}\\\", will_config);\\n\\n\\n\\n let assets_dir = AppDir::assets()?;\\n\\n\\n\\n let game_mode_selection_state =\\n\",\n \"file_path\": \"app/will/src/main.rs\",\n \"rank\": 3,\n \"score\": 214996.17123408156\n },\n {\n \"content\": \"fn main() -> Result<(), Error> {\\n\\n let opt = Opt::from_args();\\n\\n\\n\\n logger_setup(opt.logger_config)?;\\n\\n\\n\\n let tcp_listener = TcpListener::bind((opt.address, opt.port))?;\\n\\n tcp_listener.set_nonblocking(true)?;\\n\\n\\n\\n let assets_dir = application_root_dir()?.join(\\\"./\\\");\\n\\n\\n\\n let game_data = GameDataBuilder::default()\\n\\n .with_bundle(TcpNetworkBundle::new(\\n\\n Some(tcp_listener),\\n\\n TCP_RECV_BUFFER_SIZE,\\n\\n ))?\\n\\n .with_system_desc(\\n\\n NetListenerSystemDesc::default(),\\n\\n any::type_name::<NetListenerSystem>(),\\n\\n &[\\\"network_recv\\\"],\\n\\n )\\n\",\n \"file_path\": \"app/session_server/src/main.rs\",\n \"rank\": 4,\n \"score\": 211542.62221924687\n },\n {\n \"content\": \"fn run(opt: &Opt) -> Result<(), Error> {\\n\\n let mut intercepts = RobotState::default_intercepts();\\n\\n if let Some(timeout) = opt.timeout {\\n\\n intercepts.push(Rc::new(RefCell::new(FixedTimeoutIntercept::new(\\n\\n Duration::from_millis(timeout),\\n\\n ))));\\n\\n }\\n\\n\\n\\n let state = RobotState::new_with_intercepts(Box::new(EmptyState), intercepts);\\n\\n let game_data = GameDataBuilder::default().with_bundle(StdioInputBundle::new())?;\\n\\n let assets_dir = format!(\\\"{}/assets\\\", env!(\\\"CARGO_MANIFEST_DIR\\\"));\\n\\n CoreApplication::<_, _, StateEventReader>::new(assets_dir, state, game_data)?.run();\\n\\n Ok(())\\n\\n}\\n\\n\\n\",\n \"file_path\": \"crate/stdio_input/examples/01_read_and_exit.rs\",\n \"rank\": 5,\n \"score\": 193210.67323894255\n },\n {\n \"content\": \"fn logger_setup(logger_config_path: Option<PathBuf>) -> Result<(), Error> {\\n\\n let is_user_specified = logger_config_path.is_some();\\n\\n\\n\\n // If the user specified a logger configuration path, use that.\\n\\n // Otherwise fallback to a default.\\n\\n let logger_config_path = logger_config_path.unwrap_or_else(|| PathBuf::from(LOGGER_CONFIG));\\n\\n let logger_config_path = if logger_config_path.is_relative() {\\n\\n let app_dir = application_root_dir()?;\\n\\n app_dir.join(logger_config_path)\\n\\n } else {\\n\\n logger_config_path\\n\\n };\\n\\n\\n\\n let logger_config: LoggerConfig = if logger_config_path.exists() {\\n\\n let logger_file = File::open(&logger_config_path)?;\\n\\n let mut logger_file_reader = BufReader::new(logger_file);\\n\\n let logger_config = serde_yaml::from_reader(&mut logger_file_reader)?;\\n\\n\\n\\n Ok(logger_config)\\n\\n } else if is_user_specified {\\n\",\n \"file_path\": \"app/will/src/main.rs\",\n \"rank\": 6,\n \"score\": 181315.83802514456\n },\n {\n \"content\": \"fn logger_setup(logger_config_path: Option<PathBuf>) -> Result<(), Error> {\\n\\n let is_user_specified = logger_config_path.is_some();\\n\\n\\n\\n // If the user specified a logger configuration path, use that.\\n\\n // Otherwise fallback to a default.\\n\\n let logger_config_path = logger_config_path.unwrap_or_else(|| PathBuf::from(LOGGER_CONFIG));\\n\\n let logger_config_path = if logger_config_path.is_relative() {\\n\\n let app_dir = application_root_dir()?;\\n\\n app_dir.join(logger_config_path)\\n\\n } else {\\n\\n logger_config_path\\n\\n };\\n\\n\\n\\n let logger_config: LoggerConfig = if logger_config_path.exists() {\\n\\n let logger_file = File::open(&logger_config_path)?;\\n\\n let mut logger_file_reader = BufReader::new(logger_file);\\n\\n let logger_config = serde_yaml::from_reader(&mut logger_file_reader)?;\\n\\n\\n\\n Ok(logger_config)\\n\\n } else if is_user_specified {\\n\",\n \"file_path\": \"app/session_server/src/main.rs\",\n \"rank\": 7,\n \"score\": 178750.86219584654\n },\n {\n \"content\": \"#[test]\\n\\nfn syntax_errors() {\\n\\n let command = \\\"echo (echo one); echo $( (echo one); echo ) two; echo $(echo one\\\";\\n\\n let results = StatementSplitter::new(command).collect::<Vec<_>>();\\n\\n assert_eq!(results[0], Err(StatementError::InvalidCharacter('(', 6)));\\n\\n assert_eq!(results[1], Err(StatementError::InvalidCharacter('(', 26)));\\n\\n assert_eq!(results[2], Err(StatementError::InvalidCharacter(')', 43)));\\n\\n assert_eq!(results[3], Err(StatementError::UnterminatedSubshell));\\n\\n assert_eq!(results.len(), 4);\\n\\n\\n\\n let command = \\\">echo\\\";\\n\\n let results = StatementSplitter::new(command).collect::<Vec<_>>();\\n\\n assert_eq!(\\n\\n results[0],\\n\\n Err(StatementError::ExpectedCommandButFound(\\\"redirection\\\"))\\n\\n );\\n\\n assert_eq!(results.len(), 1);\\n\\n\\n\\n let command = \\\"echo $((foo bar baz)\\\";\\n\\n let results = StatementSplitter::new(command).collect::<Vec<_>>();\\n\\n assert_eq!(results[0], Err(StatementError::UnterminatedArithmetic));\\n\\n assert_eq!(results.len(), 1);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"crate/stdio_input/src/ion/splitter.rs\",\n \"rank\": 8,\n \"score\": 121464.86258713328\n },\n {\n \"content\": \"use amethyst::ecs::{storage::NullStorage, Component};\\n\\n\\n\\n/// ID tag for entities created in the `SessionJoinState`.\\n\\n#[derive(Clone, Component, Copy, Debug, Default, PartialEq)]\\n\\n#[storage(NullStorage)]\\n\\npub struct SessionJoinEntity;\\n\",\n \"file_path\": \"crate/session_join_model/src/session_join_entity.rs\",\n \"rank\": 9,\n \"score\": 111879.27992080968\n },\n {\n \"content\": \"use serde::{Deserialize, Serialize};\\n\\nuse strum_macros::EnumString;\\n\\n\\n\\n/// Error when attempting to join a session.\\n\\n#[derive(Clone, Copy, Debug, Deserialize, EnumString, PartialEq, Serialize)]\\n\\n#[strum(serialize_all = \\\"snake_case\\\")]\\n\\npub enum SessionJoinError {\\n\\n /// The session code does not exist on the server.\\n\\n SessionCodeNotFound,\\n\\n}\\n\",\n \"file_path\": \"crate/session_join_model/src/play/session_join_error.rs\",\n \"rank\": 10,\n \"score\": 109932.35545105969\n },\n {\n \"content\": \"#[cfg(test)]\\n\\nmod test {\\n\\n use amethyst::{ecs::WorldExt, shrev::EventChannel, Error};\\n\\n use amethyst_test::AmethystApplication;\\n\\n use stdio_spi::VariantAndTokens;\\n\\n\\n\\n use session_join_stdio::SessionJoinStdioBundle;\\n\\n\\n\\n #[test]\\n\\n fn bundle_should_add_mapper_system_to_dispatcher() -> Result<(), Error> {\\n\\n AmethystApplication::blank()\\n\\n .with_bundle(SessionJoinStdioBundle::new())\\n\\n // kcov-ignore-start\\n\\n .with_effect(|world| {\\n\\n world.read_resource::<EventChannel<VariantAndTokens>>();\\n\\n })\\n\\n // kcov-ignore-end\\n\\n .run()\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"crate/workspace_tests/src/session_join_stdio/session_join_stdio_bundle.rs\",\n \"rank\": 11,\n \"score\": 103537.80569631088\n },\n {\n \"content\": \"#[cfg(test)]\\n\\nmod tests {\\n\\n use amethyst::{\\n\\n ecs::{Read, SystemData, World, WorldExt, WriteExpect},\\n\\n shrev::{EventChannel, ReaderId},\\n\\n Error,\\n\\n };\\n\\n use amethyst_test::AmethystApplication;\\n\\n use game_input_model::loaded::{PlayerController, PlayerControllers};\\n\\n use net_model::play::NetMessageEvent;\\n\\n use network_session_model::play::{SessionCode, SessionDeviceName, SessionStatus};\\n\\n use session_join_model::{play::SessionJoinRequestParams, SessionJoinEvent};\\n\\n\\n\\n use session_join_play::SessionJoinRequestSystemDesc;\\n\\n\\n\\n #[test]\\n\\n fn does_nothing_when_no_session_join_event() -> Result<(), Error> {\\n\\n run_test(\\n\\n SetupParams {\\n\\n session_status: SessionStatus::None,\\n\",\n \"file_path\": \"crate/workspace_tests/src/session_join_play/system/session_join_request_system.rs\",\n \"rank\": 12,\n \"score\": 101822.67905696807\n },\n {\n \"content\": \"#[cfg(test)]\\n\\nmod tests {\\n\\n use std::net::{Ipv4Addr, SocketAddr};\\n\\n\\n\\n use amethyst::{\\n\\n ecs::{Read, WorldExt},\\n\\n Error,\\n\\n };\\n\\n use amethyst_test::AmethystApplication;\\n\\n use game_input_model::{\\n\\n loaded::{PlayerController, PlayerControllers},\\n\\n play::ControllerIdOffset,\\n\\n };\\n\\n use net_model::play::{NetData, NetEventChannel};\\n\\n use network_session_model::play::{\\n\\n Session, SessionCode, SessionDevice, SessionDeviceId, SessionDeviceName, SessionDevices,\\n\\n SessionStatus,\\n\\n };\\n\\n use session_join_model::{play::SessionAcceptResponse, SessionJoinEvent};\\n\\n\\n\",\n \"file_path\": \"crate/workspace_tests/src/session_join_play/system/session_join_response_system.rs\",\n \"rank\": 13,\n \"score\": 101816.21590365133\n },\n {\n \"content\": \"\\n\\n fn run_test(\\n\\n SetupParams {\\n\\n session_status: session_status_setup,\\n\\n session_join_event,\\n\\n }: SetupParams,\\n\\n ExpectedParams {\\n\\n session_status: session_status_expected,\\n\\n net_message_event: net_message_event_expected,\\n\\n }: ExpectedParams,\\n\\n ) -> Result<(), Error> {\\n\\n AmethystApplication::blank()\\n\\n .with_setup(<Read<'_, EventChannel<NetMessageEvent>> as SystemData>::setup)\\n\\n .with_setup(setup_net_message_event_reader)\\n\\n .with_system_desc(SessionJoinRequestSystemDesc::default(), \\\"\\\", &[])\\n\\n .with_resource(session_status_setup)\\n\\n .with_effect(move |world| {\\n\\n if let Some(session_join_event) = session_join_event {\\n\\n world\\n\\n .write_resource::<EventChannel<SessionJoinEvent>>()\\n\",\n \"file_path\": \"crate/workspace_tests/src/session_join_play/system/session_join_request_system.rs\",\n \"rank\": 14,\n \"score\": 101808.0568279413\n },\n {\n \"content\": \"#[cfg(test)]\\n\\nmod tests {\\n\\n use game_input_model::{\\n\\n loaded::{PlayerController, PlayerControllers},\\n\\n play::ControllerIdOffset,\\n\\n };\\n\\n use network_session_model::play::{\\n\\n Session, SessionCode, SessionDevice, SessionDeviceId, SessionDeviceName, SessionDevices,\\n\\n };\\n\\n use session_join_model::{\\n\\n play::{SessionAcceptResponse, SessionJoinRequestParams},\\n\\n SessionJoinEvent,\\n\\n };\\n\\n use stdio_spi::StdinMapper;\\n\\n\\n\\n use session_join_stdio::SessionJoinEventStdinMapper;\\n\\n\\n\\n #[test]\\n\\n fn maps_session_join_request_event() {\\n\\n let session_device_name = SessionDeviceName::from(String::from(\\\"エイズリエル\\\"));\\n\",\n \"file_path\": \"crate/workspace_tests/src/session_join_stdio/session_join_event_stdin_mapper.rs\",\n \"rank\": 15,\n \"score\": 101806.21409961548\n },\n {\n \"content\": \" }: SetupParams,\\n\\n ExpectedParams {\\n\\n session_code: session_code_expected,\\n\\n session_device_id: session_device_id_expected,\\n\\n session_devices: session_devices_expected,\\n\\n session_status: session_status_expected,\\n\\n player_controllers: player_controllers_expected,\\n\\n controller_id_offset: controller_id_offset_expected,\\n\\n }: ExpectedParams,\\n\\n ) -> Result<(), Error> {\\n\\n AmethystApplication::blank()\\n\\n .with_system_desc(SessionJoinResponseSystemDesc::default(), \\\"\\\", &[])\\n\\n .with_setup(move |world| {\\n\\n world.insert(session_code_setup);\\n\\n world.insert(session_device_id_setup);\\n\\n world.insert(session_devices_setup);\\n\\n world.insert(session_status_setup);\\n\\n })\\n\\n .with_effect(move |world| {\\n\\n if let Some(session_join_event) = session_join_event {\\n\",\n \"file_path\": \"crate/workspace_tests/src/session_join_play/system/session_join_response_system.rs\",\n \"rank\": 16,\n \"score\": 101805.57789703211\n },\n {\n \"content\": \" run_test(\\n\\n SetupParams {\\n\\n session_status: SessionStatus::None,\\n\\n session_join_event: Some(session_join_event.clone()),\\n\\n },\\n\\n ExpectedParams {\\n\\n session_status: SessionStatus::JoinRequested {\\n\\n session_code: SessionCode::new(String::from(\\\"abcd\\\")),\\n\\n },\\n\\n net_message_event: Some(NetMessageEvent::SessionJoinEvent(session_join_event)),\\n\\n },\\n\\n )\\n\\n }\\n\\n\\n\\n #[test]\\n\\n fn ignores_session_join_request_when_already_requested() -> Result<(), Error> {\\n\\n run_test(\\n\\n SetupParams {\\n\\n session_status: SessionStatus::JoinRequested {\\n\\n session_code: SessionCode::new(String::from(\\\"abcd\\\")),\\n\",\n \"file_path\": \"crate/workspace_tests/src/session_join_play/system/session_join_request_system.rs\",\n \"rank\": 17,\n \"score\": 101804.16837800015\n },\n {\n \"content\": \" use session_join_play::SessionJoinResponseSystemDesc;\\n\\n\\n\\n #[test]\\n\\n fn does_nothing_when_no_session_join_event() -> Result<(), Error> {\\n\\n run_test(\\n\\n SetupParams {\\n\\n session_code: SessionCode::new(String::from(\\\"abcd\\\")),\\n\\n session_device_id: SessionDeviceId::new(123),\\n\\n session_devices: SessionDevices::new(vec![]),\\n\\n session_status: SessionStatus::None,\\n\\n session_join_event: None,\\n\\n },\\n\\n ExpectedParams {\\n\\n session_code: SessionCode::new(String::from(\\\"abcd\\\")),\\n\\n session_device_id: SessionDeviceId::new(123),\\n\\n session_devices: SessionDevices::new(vec![]),\\n\\n session_status: SessionStatus::None,\\n\\n player_controllers: PlayerControllers::default(),\\n\\n controller_id_offset: ControllerIdOffset::default(),\\n\\n },\\n\",\n \"file_path\": \"crate/workspace_tests/src/session_join_play/system/session_join_response_system.rs\",\n \"rank\": 18,\n \"score\": 101803.77377831002\n },\n {\n \"content\": \" session_join_event: None,\\n\\n },\\n\\n ExpectedParams {\\n\\n session_status: SessionStatus::None,\\n\\n net_message_event: None,\\n\\n },\\n\\n )\\n\\n }\\n\\n\\n\\n #[test]\\n\\n fn inserts_resources_on_session_accepted() -> Result<(), Error> {\\n\\n let session_join_event = SessionJoinEvent::SessionJoinRequest(SessionJoinRequestParams {\\n\\n session_code: SessionCode::new(String::from(\\\"abcd\\\")),\\n\\n session_device_name: SessionDeviceName::new(String::from(\\\"azriel\\\")),\\n\\n player_controllers: PlayerControllers::new(vec![PlayerController::new(\\n\\n 0,\\n\\n String::from(\\\"p0\\\"),\\n\\n )]),\\n\\n });\\n\\n\\n\",\n \"file_path\": \"crate/workspace_tests/src/session_join_play/system/session_join_request_system.rs\",\n \"rank\": 19,\n \"score\": 101802.18259301834\n },\n {\n \"content\": \" )\\n\\n }\\n\\n\\n\\n #[test]\\n\\n fn inserts_resources_on_session_accepted() -> Result<(), Error> {\\n\\n let player_controllers = PlayerControllers::new(vec![\\n\\n PlayerController::new(0, String::from(\\\"p0\\\")),\\n\\n PlayerController::new(1, String::from(\\\"p1\\\")),\\n\\n PlayerController::new(2, String::from(\\\"p2\\\")),\\n\\n ]);\\n\\n\\n\\n run_test(\\n\\n SetupParams {\\n\\n session_code: SessionCode::new(String::from(\\\"abcd\\\")),\\n\\n session_device_id: SessionDeviceId::new(123),\\n\\n session_devices: SessionDevices::new(vec![]),\\n\\n session_status: SessionStatus::JoinRequested {\\n\\n session_code: SessionCode::new(String::from(\\\"defg\\\")),\\n\\n },\\n\\n session_join_event: Some(SessionJoinEvent::SessionAccept(SessionAcceptResponse {\\n\",\n \"file_path\": \"crate/workspace_tests/src/session_join_play/system/session_join_response_system.rs\",\n \"rank\": 20,\n \"score\": 101801.56918209407\n },\n {\n \"content\": \" let session_code = SessionCode::from(String::from(\\\"abcd\\\"));\\n\\n let player_controllers =\\n\\n PlayerControllers::new(vec![PlayerController::new(0, String::from(\\\"p0\\\"))]);\\n\\n let args = SessionJoinEvent::SessionJoinRequest(SessionJoinRequestParams {\\n\\n session_device_name,\\n\\n session_code,\\n\\n player_controllers,\\n\\n });\\n\\n\\n\\n let result = SessionJoinEventStdinMapper::map(&(), args.clone());\\n\\n\\n\\n assert!(result.is_ok());\\n\\n assert_eq!(args, result.unwrap())\\n\\n }\\n\\n\\n\\n #[test]\\n\\n fn maps_join_cancel_event() {\\n\\n let args = SessionJoinEvent::JoinCancel;\\n\\n\\n\\n let result = SessionJoinEventStdinMapper::map(&(), args.clone());\\n\",\n \"file_path\": \"crate/workspace_tests/src/session_join_stdio/session_join_event_stdin_mapper.rs\",\n \"rank\": 21,\n \"score\": 101801.46078986165\n },\n {\n \"content\": \" let controller_id_offset = ControllerIdOffset::new(0);\\n\\n let args = SessionJoinEvent::SessionAccept(SessionAcceptResponse {\\n\\n session_device_id,\\n\\n session: Session {\\n\\n session_code,\\n\\n session_devices,\\n\\n },\\n\\n player_controllers,\\n\\n controller_id_offset,\\n\\n });\\n\\n\\n\\n let result = SessionJoinEventStdinMapper::map(&(), args.clone());\\n\\n\\n\\n assert!(result.is_ok());\\n\\n assert_eq!(args, result.unwrap())\\n\\n }\\n\\n\\n\\n #[test]\\n\\n fn maps_back_event() {\\n\\n let args = SessionJoinEvent::Back;\\n\\n\\n\\n let result = SessionJoinEventStdinMapper::map(&(), args.clone());\\n\\n\\n\\n assert!(result.is_ok());\\n\\n assert_eq!(args, result.unwrap())\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"crate/workspace_tests/src/session_join_stdio/session_join_event_stdin_mapper.rs\",\n \"rank\": 22,\n \"score\": 101801.04173459833\n },\n {\n \"content\": \" SessionDeviceId::new(234),\\n\\n SessionDeviceName::new(String::from(\\\"azriel\\\")),\\n\\n PlayerControllers::new(vec![PlayerController::new(0, String::from(\\\"p0\\\"))]),\\n\\n )]),\\n\\n session_status: SessionStatus::JoinEstablished,\\n\\n player_controllers,\\n\\n controller_id_offset: ControllerIdOffset::new(3),\\n\\n },\\n\\n )\\n\\n }\\n\\n\\n\\n #[test]\\n\\n fn ignores_session_accept_event_when_no_longer_waiting() -> Result<(), Error> {\\n\\n let player_controllers = PlayerControllers::new(vec![\\n\\n PlayerController::new(0, String::from(\\\"p0\\\")),\\n\\n PlayerController::new(1, String::from(\\\"p1\\\")),\\n\\n PlayerController::new(2, String::from(\\\"p2\\\")),\\n\\n ]);\\n\\n\\n\\n run_test(\\n\",\n \"file_path\": \"crate/workspace_tests/src/session_join_play/system/session_join_response_system.rs\",\n \"rank\": 23,\n \"score\": 101800.16402558838\n },\n {\n \"content\": \" })\\n\\n .run()\\n\\n }\\n\\n\\n\\n fn setup_net_message_event_reader(world: &mut World) {\\n\\n let net_message_event_rid = world\\n\\n .write_resource::<EventChannel<NetMessageEvent>>()\\n\\n .register_reader();\\n\\n world.insert(net_message_event_rid);\\n\\n }\\n\\n\\n\\n struct SetupParams {\\n\\n session_status: SessionStatus,\\n\\n session_join_event: Option<SessionJoinEvent>,\\n\\n }\\n\\n\\n\\n struct ExpectedParams {\\n\\n session_status: SessionStatus,\\n\\n net_message_event: Option<NetMessageEvent>,\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"crate/workspace_tests/src/session_join_play/system/session_join_request_system.rs\",\n \"rank\": 24,\n \"score\": 101796.71545011982\n },\n {\n \"content\": \" let socket_addr = SocketAddr::from((Ipv4Addr::LOCALHOST, 1234));\\n\\n world\\n\\n .write_resource::<NetEventChannel<SessionJoinEvent>>()\\n\\n .single_write(NetData {\\n\\n socket_addr,\\n\\n data: session_join_event,\\n\\n });\\n\\n }\\n\\n })\\n\\n .with_assertion(move |world| {\\n\\n let (\\n\\n session_code,\\n\\n session_device_id,\\n\\n session_devices,\\n\\n session_status,\\n\\n player_controllers,\\n\\n controller_id_offset,\\n\\n ) = world.system_data::<(\\n\\n Read<'_, SessionCode>,\\n\\n Read<'_, SessionDeviceId>,\\n\",\n \"file_path\": \"crate/workspace_tests/src/session_join_play/system/session_join_response_system.rs\",\n \"rank\": 25,\n \"score\": 101796.3608989087\n },\n {\n \"content\": \"\\n\\n assert!(result.is_ok());\\n\\n assert_eq!(args, result.unwrap())\\n\\n }\\n\\n\\n\\n #[test]\\n\\n fn maps_session_accept_event() {\\n\\n let session_code = SessionCode::from(String::from(\\\"abcd\\\"));\\n\\n let session_device_id = SessionDeviceId::new(1);\\n\\n let session_devices = SessionDevices::new(vec![\\n\\n SessionDevice {\\n\\n id: SessionDeviceId::new(1),\\n\\n name: SessionDeviceName::from(String::from(\\\"エイズリエル\\\")),\\n\\n player_controllers: PlayerControllers::new(vec![PlayerController::new(\\n\\n 0,\\n\\n String::from(\\\"p0\\\"),\\n\\n )]),\\n\\n },\\n\\n SessionDevice {\\n\\n id: SessionDeviceId::new(2),\\n\",\n \"file_path\": \"crate/workspace_tests/src/session_join_stdio/session_join_event_stdin_mapper.rs\",\n \"rank\": 26,\n \"score\": 101793.72148352458\n },\n {\n \"content\": \" .single_write(session_join_event);\\n\\n }\\n\\n })\\n\\n .with_assertion(move |world| {\\n\\n let (session_status, mut net_message_event_rid, net_message_ec) = world\\n\\n .system_data::<(\\n\\n Read<'_, SessionStatus>,\\n\\n WriteExpect<'_, ReaderId<NetMessageEvent>>,\\n\\n Read<'_, EventChannel<NetMessageEvent>>,\\n\\n )>();\\n\\n let session_status = &*session_status;\\n\\n let net_message_event = net_message_ec.read(&mut *net_message_event_rid).next();\\n\\n\\n\\n assert_eq!(\\n\\n (\\n\\n &session_status_expected,\\n\\n net_message_event_expected.as_ref()\\n\\n ),\\n\\n (session_status, net_message_event)\\n\\n );\\n\",\n \"file_path\": \"crate/workspace_tests/src/session_join_play/system/session_join_request_system.rs\",\n \"rank\": 27,\n \"score\": 101793.40093562688\n },\n {\n \"content\": \" })),\\n\\n },\\n\\n ExpectedParams {\\n\\n session_code: SessionCode::new(String::from(\\\"abcd\\\")),\\n\\n session_device_id: SessionDeviceId::new(123),\\n\\n session_devices: SessionDevices::new(vec![]),\\n\\n session_status: SessionStatus::None,\\n\\n player_controllers: PlayerControllers::default(),\\n\\n controller_id_offset: ControllerIdOffset::default(),\\n\\n },\\n\\n )\\n\\n }\\n\\n\\n\\n fn run_test(\\n\\n SetupParams {\\n\\n session_code: session_code_setup,\\n\\n session_device_id: session_device_id_setup,\\n\\n session_devices: session_devices_setup,\\n\\n session_status: session_status_setup,\\n\\n session_join_event,\\n\",\n \"file_path\": \"crate/workspace_tests/src/session_join_play/system/session_join_response_system.rs\",\n \"rank\": 28,\n \"score\": 101792.05284696059\n },\n {\n \"content\": \" },\\n\\n session_join_event: Some(SessionJoinEvent::SessionJoinRequest(\\n\\n SessionJoinRequestParams {\\n\\n session_code: SessionCode::new(String::from(\\\"abcd\\\")),\\n\\n session_device_name: SessionDeviceName::new(String::from(\\\"azriel\\\")),\\n\\n player_controllers: PlayerControllers::new(vec![PlayerController::new(\\n\\n 0,\\n\\n String::from(\\\"p0\\\"),\\n\\n )]),\\n\\n },\\n\\n )),\\n\\n },\\n\\n ExpectedParams {\\n\\n session_status: SessionStatus::JoinRequested {\\n\\n session_code: SessionCode::new(String::from(\\\"abcd\\\")),\\n\\n },\\n\\n net_message_event: None,\\n\\n },\\n\\n )\\n\\n }\\n\",\n \"file_path\": \"crate/workspace_tests/src/session_join_play/system/session_join_request_system.rs\",\n \"rank\": 29,\n \"score\": 101792.03472510248\n },\n {\n \"content\": \" })\\n\\n .run()\\n\\n }\\n\\n\\n\\n struct SetupParams {\\n\\n session_code: SessionCode,\\n\\n session_device_id: SessionDeviceId,\\n\\n session_devices: SessionDevices,\\n\\n session_status: SessionStatus,\\n\\n session_join_event: Option<SessionJoinEvent>,\\n\\n }\\n\\n\\n\\n struct ExpectedParams {\\n\\n session_code: SessionCode,\\n\\n session_device_id: SessionDeviceId,\\n\\n session_devices: SessionDevices,\\n\\n session_status: SessionStatus,\\n\\n player_controllers: PlayerControllers,\\n\\n controller_id_offset: ControllerIdOffset,\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"crate/workspace_tests/src/session_join_play/system/session_join_response_system.rs\",\n \"rank\": 30,\n \"score\": 101790.48992786677\n },\n {\n \"content\": \" SetupParams {\\n\\n session_code: SessionCode::new(String::from(\\\"abcd\\\")),\\n\\n session_device_id: SessionDeviceId::new(123),\\n\\n session_devices: SessionDevices::new(vec![]),\\n\\n session_status: SessionStatus::None,\\n\\n session_join_event: Some(SessionJoinEvent::SessionAccept(SessionAcceptResponse {\\n\\n session_device_id: SessionDeviceId::new(234),\\n\\n session: Session {\\n\\n session_code: SessionCode::new(String::from(\\\"defg\\\")),\\n\\n session_devices: SessionDevices::new(vec![SessionDevice::new(\\n\\n SessionDeviceId::new(234),\\n\\n SessionDeviceName::new(String::from(\\\"azriel\\\")),\\n\\n PlayerControllers::new(vec![PlayerController::new(\\n\\n 0,\\n\\n String::from(\\\"p0\\\"),\\n\\n )]),\\n\\n )]),\\n\\n },\\n\\n player_controllers,\\n\\n controller_id_offset: ControllerIdOffset::new(3),\\n\",\n \"file_path\": \"crate/workspace_tests/src/session_join_play/system/session_join_response_system.rs\",\n \"rank\": 31,\n \"score\": 101789.76688959847\n },\n {\n \"content\": \" );\\n\\n\\n\\n assert_eq!(\\n\\n (\\n\\n &session_code_expected,\\n\\n &session_device_id_expected,\\n\\n &session_devices_expected,\\n\\n &session_status_expected,\\n\\n &player_controllers_expected,\\n\\n &controller_id_offset_expected,\\n\\n ),\\n\\n (\\n\\n session_code,\\n\\n session_device_id,\\n\\n session_devices,\\n\\n session_status,\\n\\n player_controllers,\\n\\n controller_id_offset,\\n\\n )\\n\\n );\\n\",\n \"file_path\": \"crate/workspace_tests/src/session_join_play/system/session_join_response_system.rs\",\n \"rank\": 32,\n \"score\": 101785.51264086738\n },\n {\n \"content\": \" session_device_id: SessionDeviceId::new(234),\\n\\n session: Session {\\n\\n session_code: SessionCode::new(String::from(\\\"defg\\\")),\\n\\n session_devices: SessionDevices::new(vec![SessionDevice::new(\\n\\n SessionDeviceId::new(234),\\n\\n SessionDeviceName::new(String::from(\\\"azriel\\\")),\\n\\n PlayerControllers::new(vec![PlayerController::new(\\n\\n 0,\\n\\n String::from(\\\"p0\\\"),\\n\\n )]),\\n\\n )]),\\n\\n },\\n\\n player_controllers: player_controllers.clone(),\\n\\n controller_id_offset: ControllerIdOffset::new(3),\\n\\n })),\\n\\n },\\n\\n ExpectedParams {\\n\\n session_code: SessionCode::new(String::from(\\\"defg\\\")),\\n\\n session_device_id: SessionDeviceId::new(234),\\n\\n session_devices: SessionDevices::new(vec![SessionDevice::new(\\n\",\n \"file_path\": \"crate/workspace_tests/src/session_join_play/system/session_join_response_system.rs\",\n \"rank\": 33,\n \"score\": 101785.51264086738\n },\n {\n \"content\": \" Read<'_, SessionDevices>,\\n\\n Read<'_, SessionStatus>,\\n\\n Read<'_, PlayerControllers>,\\n\\n Read<'_, ControllerIdOffset>,\\n\\n )>();\\n\\n\\n\\n let (\\n\\n session_code,\\n\\n session_device_id,\\n\\n session_devices,\\n\\n session_status,\\n\\n player_controllers,\\n\\n controller_id_offset,\\n\\n ) = (\\n\\n &*session_code,\\n\\n &*session_device_id,\\n\\n &*session_devices,\\n\\n &*session_status,\\n\\n &*player_controllers,\\n\\n &*controller_id_offset,\\n\",\n \"file_path\": \"crate/workspace_tests/src/session_join_play/system/session_join_response_system.rs\",\n \"rank\": 34,\n \"score\": 101785.51264086738\n },\n {\n \"content\": \" name: SessionDeviceName::from(String::from(\\\"バイロン\\\")),\\n\\n player_controllers: PlayerControllers::new(vec![PlayerController::new(\\n\\n 1,\\n\\n String::from(\\\"p1\\\"),\\n\\n )]),\\n\\n },\\n\\n SessionDevice {\\n\\n id: SessionDeviceId::new(3),\\n\\n name: SessionDeviceName::from(String::from(\\\"カルロー\\\")),\\n\\n player_controllers: PlayerControllers::new(vec![PlayerController::new(\\n\\n 2,\\n\\n String::from(\\\"p2\\\"),\\n\\n )]),\\n\\n },\\n\\n ]);\\n\\n let player_controllers = PlayerControllers::new(vec![\\n\\n PlayerController::new(0, String::from(\\\"p0\\\")),\\n\\n PlayerController::new(1, String::from(\\\"p1\\\")),\\n\\n PlayerController::new(2, String::from(\\\"p2\\\")),\\n\\n ]);\\n\",\n \"file_path\": \"crate/workspace_tests/src/session_join_stdio/session_join_event_stdin_mapper.rs\",\n \"rank\": 35,\n \"score\": 101785.51264086738\n },\n {\n \"content\": \"#[cfg(test)]\\n\\nmod test {\\n\\n use amethyst::{GameData, State, Trans};\\n\\n\\n\\n use debug_util_amethyst::{assert_eq_opt_trans, assert_eq_trans};\\n\\n\\n\\n #[macro_use]\\n\\n macro_rules! test_opt_trans_panic {\\n\\n ($test_name:ident, $message:expr, $expected:expr, $actual:expr) => {\\n\\n #[test]\\n\\n #[should_panic(expected = $message)]\\n\\n fn $test_name() {\\n\\n assert_eq_opt_trans::<GameData<'static, 'static>, ()>($expected, $actual);\\n\\n } // kcov-ignore\\n\\n };\\n\\n }\\n\\n\\n\\n #[test]\\n\\n fn assert_eq_trans_does_not_panic_on_same_trans_discriminant() {\\n\\n assert_eq_trans::<GameData<'static, 'static>, ()>(&Trans::None, &Trans::None);\\n\",\n \"file_path\": \"crate/workspace_tests/src/debug_util_amethyst.rs\",\n \"rank\": 36,\n \"score\": 98773.27871120021\n },\n {\n \"content\": \" assert_eq_trans(\\n\\n &Trans::Push(Box::new(MockState)),\\n\\n &Trans::Push(Box::new(MockState)),\\n\\n ); // kcov-ignore\\n\\n }\\n\\n\\n\\n #[test]\\n\\n #[should_panic(expected = \\\"Expected `None` but got `Push`.\\\")]\\n\\n fn assert_eq_trans_panics_on_different_trans_discriminant() {\\n\\n assert_eq_trans(&Trans::None, &Trans::Push(Box::new(MockState)));\\n\\n } // kcov-ignore\\n\\n\\n\\n #[test]\\n\\n fn assert_eq_opt_trans_does_not_panic_on_none_none() {\\n\\n assert_eq_opt_trans::<GameData<'static, 'static>, ()>(None, None);\\n\\n }\\n\\n\\n\\n #[test]\\n\\n fn assert_eq_opt_trans_does_not_panic_on_same_discriminant() {\\n\\n assert_eq_opt_trans::<GameData<'static, 'static>, ()>(\\n\",\n \"file_path\": \"crate/workspace_tests/src/debug_util_amethyst.rs\",\n \"rank\": 37,\n \"score\": 98759.08406834274\n },\n {\n \"content\": \" Some(Trans::None).as_ref(),\\n\\n Some(Trans::None).as_ref(),\\n\\n );\\n\\n assert_eq_opt_trans(\\n\\n Some(Trans::Push(Box::new(MockState))).as_ref(),\\n\\n Some(Trans::Push(Box::new(MockState))).as_ref(),\\n\\n ); // kcov-ignore\\n\\n }\\n\\n\\n\\n test_opt_trans_panic!(\\n\\n assert_eq_opt_trans_panics_on_some_none,\\n\\n \\\"Expected `Some(Pop)` but got `None`.\\\",\\n\\n Some(Trans::Pop).as_ref(),\\n\\n None\\n\\n );\\n\\n\\n\\n test_opt_trans_panic!(\\n\\n assert_eq_opt_trans_panics_on_none_some,\\n\\n \\\"Expected `None` but got `Some(Pop)`.\\\",\\n\\n None,\\n\",\n \"file_path\": \"crate/workspace_tests/src/debug_util_amethyst.rs\",\n \"rank\": 38,\n \"score\": 98758.71759485404\n },\n {\n \"content\": \" Some(Trans::Pop).as_ref()\\n\\n );\\n\\n\\n\\n test_opt_trans_panic!(\\n\\n assert_eq_opt_trans_panics_on_different_trans_discriminant,\\n\\n \\\"Expected `Some(Pop)` but got `Some(Push)`.\\\",\\n\\n Some(Trans::Pop).as_ref(),\\n\\n Some(Trans::Push(Box::new(MockState))).as_ref()\\n\\n );\\n\\n\\n\\n struct MockState;\\n\\n impl State<GameData<'static, 'static>, ()> for MockState {}\\n\\n}\\n\",\n \"file_path\": \"crate/workspace_tests/src/debug_util_amethyst.rs\",\n \"rank\": 39,\n \"score\": 98757.94477804625\n },\n {\n \"content\": \"mod session_join_event_stdin_mapper;\\n\\nmod session_join_stdio_bundle;\\n\",\n \"file_path\": \"crate/workspace_tests/src/session_join_stdio.rs\",\n \"rank\": 40,\n \"score\": 98667.3034096502\n },\n {\n \"content\": \"mod system;\\n\",\n \"file_path\": \"crate/workspace_tests/src/session_join_play.rs\",\n \"rank\": 41,\n \"score\": 98660.23713094695\n },\n {\n \"content\": \"mod session_join_request_system;\\n\\nmod session_join_response_system;\\n\",\n \"file_path\": \"crate/workspace_tests/src/session_join_play/system.rs\",\n \"rank\": 42,\n \"score\": 96433.29419685899\n },\n {\n \"content\": \"#[cfg(test)]\\n\\nmod tests {\\n\\n use amethyst::{\\n\\n core::TransformBundle,\\n\\n ecs::{Builder, World, WorldExt},\\n\\n renderer::{types::DefaultBackend, RenderEmptyBundle},\\n\\n shred::SystemData,\\n\\n Error,\\n\\n };\\n\\n use amethyst_test::AmethystApplication;\\n\\n use collision_model::loaded::{HitTransition, HittingTransition};\\n\\n use map_model::play::MapUnboundedDelete;\\n\\n\\n\\n use energy_prefab::{EnergyComponentStorages, EnergyEntityAugmenter};\\n\\n\\n\\n #[test]\\n\\n fn augments_entity_with_energy_components() -> Result<(), Error> {\\n\\n let assertion = |world: &mut World| {\\n\\n let entity = world.create_entity().build();\\n\\n {\\n\",\n \"file_path\": \"crate/workspace_tests/src/energy_prefab/energy_entity_augmenter.rs\",\n \"rank\": 43,\n \"score\": 94361.49624750746\n },\n {\n \"content\": \"#[cfg(test)]\\n\\nmod test {\\n\\n use std::{iter::FromIterator, str::FromStr};\\n\\n\\n\\n use amethyst::{\\n\\n assets::{AssetStorage, Loader, Processor},\\n\\n ecs::{Builder, Read, ReadExpect, World, WorldExt, Write},\\n\\n shred::SystemData,\\n\\n Error,\\n\\n };\\n\\n use amethyst_test::AmethystApplication;\\n\\n use asset_model::{\\n\\n config::AssetSlug,\\n\\n loaded::{AssetId, AssetIdMappings},\\n\\n };\\n\\n use character_model::{\\n\\n config::{CharacterDefinition, CharacterSequenceName},\\n\\n loaded::AssetCharacterDefinitionHandle,\\n\\n play::RunCounter,\\n\\n };\\n\",\n \"file_path\": \"crate/workspace_tests/src/character_prefab/character_entity_augmenter.rs\",\n \"rank\": 44,\n \"score\": 94349.54560658289\n },\n {\n \"content\": \" use charge_model::{\\n\\n config::{ChargeDelay, ChargeLimit, ChargeUseMode},\\n\\n play::{ChargeRetention, ChargeTrackerClock},\\n\\n };\\n\\n use game_input_model::play::ControllerInput;\\n\\n use map_model::play::MapBounded;\\n\\n use object_model::{config::Mass, play::HealthPoints};\\n\\n use object_status_model::config::StunPoints;\\n\\n use sequence_model::loaded::{AssetSequenceIdMappings, SequenceIdMappings};\\n\\n\\n\\n use character_prefab::{\\n\\n CharacterComponentStorages, CharacterEntityAugmenter, CharacterSpawningResources,\\n\\n };\\n\\n\\n\\n #[test]\\n\\n fn augments_entity_with_character_components() -> Result<(), Error> {\\n\\n let assertion = |world: &mut World| {\\n\\n let entity = world.create_entity().build();\\n\\n {\\n\\n let asset_id = *world.read_resource::<AssetId>();\\n\",\n \"file_path\": \"crate/workspace_tests/src/character_prefab/character_entity_augmenter.rs\",\n \"rank\": 45,\n \"score\": 94346.8811787931\n },\n {\n \"content\": \" assert!(world.read_storage::<ChargeLimit>().contains(entity));\\n\\n assert!(world.read_storage::<ChargeDelay>().contains(entity));\\n\\n assert!(world.read_storage::<ChargeUseMode>().contains(entity));\\n\\n assert!(world.read_storage::<ChargeRetention>().contains(entity));\\n\\n };\\n\\n\\n\\n AmethystApplication::blank()\\n\\n .with_system(Processor::<CharacterDefinition>::new(), \\\"\\\", &[])\\n\\n .with_setup(|world| {\\n\\n <Read<'_, AssetIdMappings> as SystemData>::setup(world);\\n\\n <CharacterSpawningResources as SystemData>::setup(world);\\n\\n <CharacterComponentStorages as SystemData>::setup(world);\\n\\n })\\n\\n .with_effect(|world| {\\n\\n let asset_id = {\\n\\n let mut asset_id_mappings = world.write_resource::<AssetIdMappings>();\\n\\n let asset_slug =\\n\\n AssetSlug::from_str(\\\"test/char\\\").expect(\\\"Expected asset slug to be valid.\\\");\\n\\n asset_id_mappings.insert(asset_slug)\\n\\n };\\n\",\n \"file_path\": \"crate/workspace_tests/src/character_prefab/character_entity_augmenter.rs\",\n \"rank\": 46,\n \"score\": 94341.07652098649\n },\n {\n \"content\": \" let mut energy_component_storages = EnergyComponentStorages::fetch(&world);\\n\\n EnergyEntityAugmenter::augment(entity, &mut energy_component_storages);\\n\\n }\\n\\n\\n\\n assert!(world.read_storage::<MapUnboundedDelete>().contains(entity));\\n\\n assert!(world.read_storage::<HitTransition>().contains(entity));\\n\\n assert!(world.read_storage::<HittingTransition>().contains(entity));\\n\\n };\\n\\n\\n\\n AmethystApplication::blank()\\n\\n .with_bundle(TransformBundle::new())\\n\\n .with_bundle(RenderEmptyBundle::<DefaultBackend>::new())\\n\\n .with_effect(|world| {\\n\\n <EnergyComponentStorages as SystemData>::setup(world);\\n\\n })\\n\\n .with_assertion(assertion)\\n\\n .run_isolated()\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"crate/workspace_tests/src/energy_prefab/energy_entity_augmenter.rs\",\n \"rank\": 47,\n \"score\": 94336.7873825122\n },\n {\n \"content\": \" let (character_spawning_resources, mut character_component_storages) = world\\n\\n .system_data::<(\\n\\n CharacterSpawningResources<'_>,\\n\\n CharacterComponentStorages<'_>,\\n\\n )>();\\n\\n CharacterEntityAugmenter::augment(\\n\\n &character_spawning_resources,\\n\\n &mut character_component_storages,\\n\\n asset_id,\\n\\n entity,\\n\\n );\\n\\n }\\n\\n\\n\\n assert!(world.read_storage::<ControllerInput>().contains(entity));\\n\\n assert!(world.read_storage::<HealthPoints>().contains(entity));\\n\\n assert!(world.read_storage::<StunPoints>().contains(entity));\\n\\n assert!(world.read_storage::<RunCounter>().contains(entity));\\n\\n assert!(world.read_storage::<Mass>().contains(entity));\\n\\n assert!(world.read_storage::<MapBounded>().contains(entity));\\n\\n assert!(world.read_storage::<ChargeTrackerClock>().contains(entity));\\n\",\n \"file_path\": \"crate/workspace_tests/src/character_prefab/character_entity_augmenter.rs\",\n \"rank\": 48,\n \"score\": 94334.25496520814\n },\n {\n \"content\": \"\\n\\n let character_definition_handle = loader.load_from_data(\\n\\n character_definition,\\n\\n (),\\n\\n &*character_definition_assets,\\n\\n );\\n\\n asset_character_definition_handle.insert(asset_id, character_definition_handle);\\n\\n }\\n\\n\\n\\n world.insert(asset_id);\\n\\n })\\n\\n .with_assertion(assertion)\\n\\n .run()\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"crate/workspace_tests/src/character_prefab/character_entity_augmenter.rs\",\n \"rank\": 49,\n \"score\": 94325.45707713174\n },\n {\n \"content\": \"\\n\\n {\\n\\n let (\\n\\n loader,\\n\\n mut asset_sequence_id_mappings_character,\\n\\n mut asset_character_definition_handle,\\n\\n character_definition_assets,\\n\\n ) = world.system_data::<(\\n\\n ReadExpect<'_, Loader>,\\n\\n Write<'_, AssetSequenceIdMappings<CharacterSequenceName>>,\\n\\n Write<'_, AssetCharacterDefinitionHandle>,\\n\\n Read<'_, AssetStorage<CharacterDefinition>>,\\n\\n )>();\\n\\n\\n\\n let character_definition = CharacterDefinition::default();\\n\\n\\n\\n let sequence_id_mappings = SequenceIdMappings::from_iter(\\n\\n character_definition.object_definition.sequences.keys(),\\n\\n );\\n\\n asset_sequence_id_mappings_character.insert(asset_id, sequence_id_mappings);\\n\",\n \"file_path\": \"crate/workspace_tests/src/character_prefab/character_entity_augmenter.rs\",\n \"rank\": 50,\n \"score\": 94324.20563441417\n },\n {\n \"content\": \"#[cfg(test)]\\n\\nmod tests {\\n\\n use game_input_stdio::GameInputStdioError;\\n\\n\\n\\n #[test]\\n\\n fn fmt_display_is_user_friendly() {\\n\\n assert_eq!(\\n\\n \\\"Failed to find entity with an `InputControlled` component with the specified controller ID: `4`.\\\\n\\\\\\n\\n The following controller IDs are associated with entities:\\\\n\\\\\\n\\n \\\\n\\\\\\n\\n * 0\\\\n\\\\\\n\\n * 1\\\\n\\\\\\n\\n \\\\n\\\\\\n\\n \\\",\\n\\n format!(\\\"{}\\\", GameInputStdioError::EntityWithControllerIdNotFound { controller_id: 4, existent_controllers: vec![0, 1] })\\n\\n );\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"crate/workspace_tests/src/game_input_stdio/game_input_stdio_error.rs\",\n \"rank\": 51,\n \"score\": 90371.69472689544\n },\n {\n \"content\": \"#[cfg(test)]\\n\\nmod tests {\\n\\n use asset_model::config::{AssetSlugBuildError, AssetSlugSegment};\\n\\n\\n\\n #[test]\\n\\n fn namespace_must_be_specified() {\\n\\n assert_eq!(\\n\\n \\\"Namespace is a required value.\\\",\\n\\n String::from(AssetSlugBuildError::NoValueProvided {\\n\\n segment: AssetSlugSegment::Namespace\\n\\n })\\n\\n );\\n\\n }\\n\\n\\n\\n #[test]\\n\\n fn namespace_must_not_be_empty() {\\n\\n assert_eq!(\\n\\n \\\"Namespace must not be empty.\\\",\\n\\n String::from(AssetSlugBuildError::SegmentEmpty {\\n\\n segment: AssetSlugSegment::Namespace\\n\",\n \"file_path\": \"crate/workspace_tests/src/asset_model/config/asset_slug_build_error.rs\",\n \"rank\": 52,\n \"score\": 90365.94519701114\n },\n {\n \"content\": \"#[cfg(test)]\\n\\nmod tests {\\n\\n use amethyst::{\\n\\n ecs::{Builder, Entities, Entity, WorldExt},\\n\\n Error,\\n\\n };\\n\\n use amethyst_test::AmethystApplication;\\n\\n use parent_model::play::ParentEntity;\\n\\n\\n\\n use parent_play::ChildEntityDeleteSystem;\\n\\n\\n\\n #[test]\\n\\n fn deletes_entities_when_parent_entity_is_dead() -> Result<(), Error> {\\n\\n AmethystApplication::blank()\\n\\n .with_system(ChildEntityDeleteSystem::new(), \\\"\\\", &[])\\n\\n .with_effect(|world| {\\n\\n let entity_parent = world.create_entity().build();\\n\\n let entity_child = world\\n\\n .create_entity()\\n\\n .with(ParentEntity::new(entity_parent))\\n\",\n \"file_path\": \"crate/workspace_tests/src/parent_play/system/child_entity_delete_system.rs\",\n \"rank\": 53,\n \"score\": 90362.9702356666\n },\n {\n \"content\": \"\\n\\n #[test]\\n\\n fn name_must_not_contain_forward_slash() {\\n\\n assert_eq!(\\n\\n \\\"Name must not contain the '/' character: `a/b`.\\\",\\n\\n String::from(AssetSlugBuildError::SegmentContainsForwardSlash {\\n\\n segment: AssetSlugSegment::Name,\\n\\n value: String::from(\\\"a/b\\\")\\n\\n })\\n\\n );\\n\\n }\\n\\n\\n\\n #[test]\\n\\n fn from_str_returns_err_when_too_few_segments() {\\n\\n assert_eq!(\\n\\n \\\"Expected exactly one `/` in asset slug string: `test`.\\\",\\n\\n String::from(AssetSlugBuildError::InvalidSegmentCount {\\n\\n value: String::from(\\\"test\\\")\\n\\n })\\n\\n );\\n\",\n \"file_path\": \"crate/workspace_tests/src/asset_model/config/asset_slug_build_error.rs\",\n \"rank\": 54,\n \"score\": 90358.40968660216\n },\n {\n \"content\": \" }\\n\\n\\n\\n #[test]\\n\\n fn from_str_returns_err_when_too_many_segments() {\\n\\n assert_eq!(\\n\\n \\\"Expected exactly one `/` in asset slug string: `test/abc/def`.\\\",\\n\\n String::from(AssetSlugBuildError::InvalidSegmentCount {\\n\\n value: String::from(\\\"test/abc/def\\\")\\n\\n })\\n\\n );\\n\\n }\\n\\n\\n\\n #[test]\\n\\n fn from_str_returns_err_from_builder_when_invalid() {\\n\\n assert_eq!(\\n\\n \\\"Name must not contain whitespace: `a b`.\\\",\\n\\n String::from(AssetSlugBuildError::SegmentContainsWhitespace {\\n\\n segment: AssetSlugSegment::Name,\\n\\n value: String::from(\\\"a b\\\")\\n\\n })\\n\\n );\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"crate/workspace_tests/src/asset_model/config/asset_slug_build_error.rs\",\n \"rank\": 55,\n \"score\": 90358.31399822916\n },\n {\n \"content\": \" \\\"Namespace must not contain the '/' character: `a/b`.\\\",\\n\\n String::from(AssetSlugBuildError::SegmentContainsForwardSlash {\\n\\n segment: AssetSlugSegment::Namespace,\\n\\n value: String::from(\\\"a/b\\\")\\n\\n })\\n\\n );\\n\\n }\\n\\n\\n\\n #[test]\\n\\n fn name_must_be_specified() {\\n\\n assert_eq!(\\n\\n \\\"Name is a required value.\\\",\\n\\n String::from(AssetSlugBuildError::NoValueProvided {\\n\\n segment: AssetSlugSegment::Name\\n\\n })\\n\\n );\\n\\n }\\n\\n\\n\\n #[test]\\n\\n fn name_must_not_be_empty() {\\n\",\n \"file_path\": \"crate/workspace_tests/src/asset_model/config/asset_slug_build_error.rs\",\n \"rank\": 56,\n \"score\": 90357.6884720852\n },\n {\n \"content\": \" assert_eq!(\\n\\n \\\"Name must not be empty.\\\",\\n\\n String::from(AssetSlugBuildError::SegmentEmpty {\\n\\n segment: AssetSlugSegment::Name\\n\\n })\\n\\n );\\n\\n }\\n\\n\\n\\n #[test]\\n\\n fn name_must_not_contain_control_character() {\\n\\n assert_eq!(\\n\\n \\\"Name must not contain control character: `a\\\\\\\\u{9c}b`.\\\",\\n\\n String::from(AssetSlugBuildError::SegmentContainsControlChar {\\n\\n segment: AssetSlugSegment::Name,\\n\\n value: String::from(\\\"ab\\\")\\n\\n })\\n\\n );\\n\\n }\\n\\n\\n\\n #[test]\\n\",\n \"file_path\": \"crate/workspace_tests/src/asset_model/config/asset_slug_build_error.rs\",\n \"rank\": 57,\n \"score\": 90357.51201867082\n },\n {\n \"content\": \" })\\n\\n );\\n\\n }\\n\\n\\n\\n #[test]\\n\\n fn namespace_must_not_contain_control_character() {\\n\\n assert_eq!(\\n\\n \\\"Namespace must not contain control character: `a\\\\\\\\u{9c}b`.\\\",\\n\\n String::from(AssetSlugBuildError::SegmentContainsControlChar {\\n\\n segment: AssetSlugSegment::Namespace,\\n\\n value: String::from(\\\"ab\\\")\\n\\n })\\n\\n );\\n\\n }\\n\\n\\n\\n #[test]\\n\\n fn namespace_must_not_start_with_numeric_character() {\\n\\n assert_eq!(\\n\\n \\\"Namespace must not start with numeric character: `1ab`.\\\",\\n\\n String::from(AssetSlugBuildError::SegmentStartsWithNumericChar {\\n\",\n \"file_path\": \"crate/workspace_tests/src/asset_model/config/asset_slug_build_error.rs\",\n \"rank\": 58,\n \"score\": 90357.2307661326\n },\n {\n \"content\": \" segment: AssetSlugSegment::Namespace,\\n\\n value: String::from(\\\"1ab\\\")\\n\\n })\\n\\n );\\n\\n }\\n\\n\\n\\n #[test]\\n\\n fn namespace_must_not_contain_whitespace() {\\n\\n assert_eq!(\\n\\n \\\"Namespace must not contain whitespace: `a b`.\\\",\\n\\n String::from(AssetSlugBuildError::SegmentContainsWhitespace {\\n\\n segment: AssetSlugSegment::Namespace,\\n\\n value: String::from(\\\"a b\\\")\\n\\n })\\n\\n );\\n\\n }\\n\\n\\n\\n #[test]\\n\\n fn namespace_must_not_contain_forward_slash() {\\n\\n assert_eq!(\\n\",\n \"file_path\": \"crate/workspace_tests/src/asset_model/config/asset_slug_build_error.rs\",\n \"rank\": 59,\n \"score\": 90356.50522784698\n },\n {\n \"content\": \" fn name_must_not_start_with_numeric_character() {\\n\\n assert_eq!(\\n\\n \\\"Name must not start with numeric character: `1ab`.\\\",\\n\\n String::from(AssetSlugBuildError::SegmentStartsWithNumericChar {\\n\\n segment: AssetSlugSegment::Name,\\n\\n value: String::from(\\\"1ab\\\")\\n\\n })\\n\\n );\\n\\n }\\n\\n\\n\\n #[test]\\n\\n fn name_must_not_contain_whitespace() {\\n\\n assert_eq!(\\n\\n \\\"Name must not contain whitespace: `a b`.\\\",\\n\\n String::from(AssetSlugBuildError::SegmentContainsWhitespace {\\n\\n segment: AssetSlugSegment::Name,\\n\\n value: String::from(\\\"a b\\\")\\n\\n })\\n\\n );\\n\\n }\\n\",\n \"file_path\": \"crate/workspace_tests/src/asset_model/config/asset_slug_build_error.rs\",\n \"rank\": 60,\n \"score\": 90355.68560592474\n },\n {\n \"content\": \" .with_assertion(|world| {\\n\\n let (entity_parent, entity_child) = *world.read_resource::<(Entity, Entity)>();\\n\\n let entities = world.system_data::<Entities<'_>>();\\n\\n\\n\\n assert!(!entities.is_alive(entity_parent));\\n\\n assert!(!entities.is_alive(entity_child));\\n\\n })\\n\\n .run()\\n\\n }\\n\\n\\n\\n #[test]\\n\\n fn ignores_entities_without_parent_entity_component() -> Result<(), Error> {\\n\\n AmethystApplication::blank()\\n\\n .with_system(ChildEntityDeleteSystem::new(), \\\"\\\", &[])\\n\\n .with_effect(|world| {\\n\\n let entity_parent = world.create_entity().build();\\n\\n let entity_other = world.create_entity().build();\\n\\n\\n\\n world.insert((entity_parent, entity_other));\\n\\n })\\n\",\n \"file_path\": \"crate/workspace_tests/src/parent_play/system/child_entity_delete_system.rs\",\n \"rank\": 61,\n \"score\": 90348.52079479316\n },\n {\n \"content\": \" .build();\\n\\n\\n\\n world.insert((entity_parent, entity_child));\\n\\n })\\n\\n .with_assertion(|world| {\\n\\n let (entity_parent, entity_child) = *world.read_resource::<(Entity, Entity)>();\\n\\n let entities = world.system_data::<Entities<'_>>();\\n\\n\\n\\n assert!(entities.is_alive(entity_parent));\\n\\n assert!(entities.is_alive(entity_child));\\n\\n })\\n\\n .with_effect(|world| {\\n\\n let (entity_parent, _entity_child) = *world.read_resource::<(Entity, Entity)>();\\n\\n let entities = world.system_data::<Entities<'_>>();\\n\\n\\n\\n entities\\n\\n .delete(entity_parent)\\n\\n .expect(\\\"Failed to delete `entity_parent`.\\\");\\n\\n })\\n\\n .with_effect(|_| {}) // Wait for one more tick.\\n\",\n \"file_path\": \"crate/workspace_tests/src/parent_play/system/child_entity_delete_system.rs\",\n \"rank\": 62,\n \"score\": 90335.07542737876\n },\n {\n \"content\": \" .with_effect(|world| {\\n\\n let (entity_parent, _entity_other) = *world.read_resource::<(Entity, Entity)>();\\n\\n let entities = world.system_data::<Entities<'_>>();\\n\\n\\n\\n entities\\n\\n .delete(entity_parent)\\n\\n .expect(\\\"Failed to delete `entity_parent`.\\\");\\n\\n })\\n\\n .with_effect(|_| {}) // Wait for one more tick.\\n\\n .with_assertion(|world| {\\n\\n let (entity_parent, entity_other) = *world.read_resource::<(Entity, Entity)>();\\n\\n let entities = world.system_data::<Entities<'_>>();\\n\\n\\n\\n assert!(!entities.is_alive(entity_parent));\\n\\n assert!(entities.is_alive(entity_other));\\n\\n })\\n\\n .run()\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"crate/workspace_tests/src/parent_play/system/child_entity_delete_system.rs\",\n \"rank\": 63,\n \"score\": 90335.04753566557\n },\n {\n \"content\": \"/// Asserts that the `Trans` objects, disregarding their `State`, are equal.\\n\\n///\\n\\n/// This `panic!`s with a readable error message when the assertion fails.\\n\\n///\\n\\n/// # Parameters\\n\\n///\\n\\n/// * `expected`: The `Trans` that is desired.\\n\\n/// * `actual`: The `Trans` that was acquired.\\n\\n///\\n\\n/// # Examples\\n\\n///\\n\\n/// Successful assertion:\\n\\n///\\n\\n/// ```rust\\n\\n/// # extern crate amethyst;\\n\\n/// # extern crate debug_util_amethyst;\\n\\n/// #\\n\\n/// # use amethyst::prelude::*;\\n\\n/// # use debug_util_amethyst::assert_eq_trans;\\n\\n/// #\\n\\n/// // ok\\n\\n/// assert_eq_trans::<(), ()>(&Trans::None, &Trans::None);\\n\\n/// ```\\n\\n///\\n\\n/// Failing assertion:\\n\\n///\\n\\n/// ```rust,should_panic\\n\\n/// # extern crate amethyst;\\n\\n/// # extern crate debug_util_amethyst;\\n\\n/// #\\n\\n/// # use amethyst::prelude::*;\\n\\n/// # use debug_util_amethyst::assert_eq_trans;\\n\\n/// #\\n\\n/// // panic: Expected `Trans::None` but got `Trans::Pop`.\\n\\n/// assert_eq_trans::<(), ()>(&Trans::None, &Trans::Pop);\\n\\n/// ```\\n\\n///\\n\\n/// # Panics\\n\\n///\\n\\n/// When the expected and actual `Trans` differ.\\n\\npub fn assert_eq_trans<T, E>(expected: &Trans<T, E>, actual: &Trans<T, E>) {\\n\\n assert_eq!(\\n\\n discriminant(expected),\\n\\n discriminant(actual),\\n\\n \\\"Expected `{:?}` but got `{:?}`.\\\",\\n\\n expected,\\n\\n actual\\n\\n );\\n\\n}\\n\\n\\n\",\n \"file_path\": \"crate/debug_util_amethyst/src/lib.rs\",\n \"rank\": 64,\n \"score\": 88752.32992608017\n },\n {\n \"content\": \"/// Asserts that the `Trans` objects contained in the `Option`s, disregarding their `State`, are\\n\\n/// equal.\\n\\n///\\n\\n/// This `panic!`s with a readable error message when the assertion fails.\\n\\n///\\n\\n/// # Parameters\\n\\n///\\n\\n/// * `expected`: The `Option<Trans>` that is desired.\\n\\n/// * `actual`: The `Option<Trans>` that was acquired.\\n\\n///\\n\\n/// # Examples\\n\\n///\\n\\n/// Successful assertion:\\n\\n///\\n\\n/// ```rust\\n\\n/// # extern crate amethyst;\\n\\n/// # extern crate debug_util_amethyst;\\n\\n/// #\\n\\n/// # use amethyst::prelude::*;\\n\\n/// # use debug_util_amethyst::assert_eq_opt_trans;\\n\\n/// #\\n\\n/// assert_eq_opt_trans::<(), ()>(None, None);\\n\\n/// assert_eq_opt_trans::<(), ()>(Some(Trans::None).as_ref(), Some(Trans::None).as_ref());\\n\\n/// ```\\n\\n///\\n\\n/// Failing assertion:\\n\\n///\\n\\n/// ```rust,should_panic\\n\\n/// # extern crate amethyst;\\n\\n/// # extern crate debug_util_amethyst;\\n\\n/// #\\n\\n/// # use amethyst::prelude::*;\\n\\n/// # use debug_util_amethyst::assert_eq_opt_trans;\\n\\n/// #\\n\\n/// // panic: Expected `Some(Trans::None)` but got `Some(Trans::Pop)`.\\n\\n/// assert_eq_opt_trans::<(), ()>(Some(Trans::None).as_ref(), Some(Trans::Pop).as_ref());\\n\\n/// ```\\n\\n///\\n\\n/// # Panics\\n\\n///\\n\\n/// When the expected and actual `Trans` differ.\\n\\npub fn assert_eq_opt_trans<T, E>(expected: Option<&Trans<T, E>>, actual: Option<&Trans<T, E>>) {\\n\\n match (expected, actual) {\\n\\n (Some(expected_trans), Some(actual_trans)) => assert_eq!(\\n\\n discriminant(expected_trans),\\n\\n discriminant(actual_trans),\\n\\n \\\"Expected `{:?}` but got `{:?}`.\\\",\\n\\n expected,\\n\\n actual\\n\\n ),\\n\\n (Some(_), None) => panic!(\\\"Expected `{:?}` but got `None`.\\\", expected),\\n\\n (None, Some(_)) => panic!(\\\"Expected `None` but got `{:?}`.\\\", actual),\\n\\n (None, None) => {}\\n\\n };\\n\\n}\\n\",\n \"file_path\": \"crate/debug_util_amethyst/src/lib.rs\",\n \"rank\": 65,\n \"score\": 83872.25058419157\n },\n {\n \"content\": \"/// Returns an function implementation for the `ComponentData::to_owned` trait method.\\n\\npub fn to_owned_fn_impl(component_copy: bool, to_owned_fn: Option<Path>) -> TokenStream {\\n\\n if component_copy {\\n\\n quote! {\\n\\n fn to_owned(component: &Self::Component) -> Self::Component {\\n\\n *component\\n\\n }\\n\\n }\\n\\n } else {\\n\\n let to_owned_fn = to_owned_fn.unwrap_or_else(|| parse_quote!(std::clone::Clone::clone));\\n\\n\\n\\n quote! {\\n\\n fn to_owned(component: &Self::Component) -> Self::Component {\\n\\n #to_owned_fn(component)\\n\\n }\\n\\n }\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"crate/sequence_model_derive/src/to_owned_fn_impl.rs\",\n \"rank\": 66,\n \"score\": 77581.33129643837\n },\n {\n \"content\": \"#[test]\\n\\nfn quotes() {\\n\\n let command = \\\"echo \\\\\\\"This ;'is a test\\\\\\\"; echo 'This ;\\\\\\\" is also a test'\\\";\\n\\n let results = StatementSplitter::new(command).collect::<Vec<_>>();\\n\\n assert_eq!(results.len(), 2);\\n\\n assert_eq!(\\n\\n results[0],\\n\\n Ok(StatementVariant::Default(\\\"echo \\\\\\\"This ;'is a test\\\\\\\"\\\"))\\n\\n );\\n\\n assert_eq!(\\n\\n results[1],\\n\\n Ok(StatementVariant::Default(\\\"echo 'This ;\\\\\\\" is also a test'\\\"))\\n\\n );\\n\\n}\\n\\n\\n\",\n \"file_path\": \"crate/stdio_input/src/ion/splitter.rs\",\n \"rank\": 67,\n \"score\": 72937.58664003076\n },\n {\n \"content\": \"#[test]\\n\\nfn variants() {\\n\\n let command = r#\\\"echo \\\"Hello!\\\"; echo \\\"How are you doing?\\\" && echo \\\"I'm just an ordinary test.\\\" || echo \\\"Helping by making sure your code works right.\\\"; echo \\\"Have a good day!\\\"\\\"#;\\n\\n let results = StatementSplitter::new(command).collect::<Vec<_>>();\\n\\n assert_eq!(results.len(), 5);\\n\\n assert_eq!(\\n\\n results[0],\\n\\n Ok(StatementVariant::Default(r#\\\"echo \\\"Hello!\\\"\\\"#))\\n\\n );\\n\\n assert_eq!(\\n\\n results[1],\\n\\n Ok(StatementVariant::Default(r#\\\"echo \\\"How are you doing?\\\"\\\"#))\\n\\n );\\n\\n assert_eq!(\\n\\n results[2],\\n\\n Ok(StatementVariant::And(\\n\\n r#\\\"echo \\\"I'm just an ordinary test.\\\"\\\"#\\n\\n ))\\n\\n );\\n\\n assert_eq!(\\n\\n results[3],\\n\\n Ok(StatementVariant::Or(\\n\\n r#\\\"echo \\\"Helping by making sure your code works right.\\\"\\\"#\\n\\n ))\\n\\n );\\n\\n assert_eq!(\\n\\n results[4],\\n\\n Ok(StatementVariant::Default(r#\\\"echo \\\"Have a good day!\\\"\\\"#))\\n\\n );\\n\\n}\\n\",\n \"file_path\": \"crate/stdio_input/src/ion/splitter.rs\",\n \"rank\": 68,\n \"score\": 72937.58664003076\n },\n {\n \"content\": \"#[test]\\n\\nfn processes() {\\n\\n let command = \\\"echo $(seq 1 10); echo $(seq 1 10)\\\";\\n\\n for statement in StatementSplitter::new(command) {\\n\\n assert_eq!(statement, Ok(StatementVariant::Default(\\\"echo $(seq 1 10)\\\")));\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"crate/stdio_input/src/ion/splitter.rs\",\n \"rank\": 69,\n \"score\": 72937.58664003076\n },\n {\n \"content\": \"#[test]\\n\\nfn comments() {\\n\\n let command = \\\"echo $(echo one # two); echo three # four\\\";\\n\\n let results = StatementSplitter::new(command).collect::<Vec<_>>();\\n\\n assert_eq!(results.len(), 2);\\n\\n assert_eq!(\\n\\n results[0],\\n\\n Ok(StatementVariant::Default(\\\"echo $(echo one # two)\\\"))\\n\\n );\\n\\n assert_eq!(results[1], Ok(StatementVariant::Default(\\\"echo three\\\")));\\n\\n}\\n\\n\\n\",\n \"file_path\": \"crate/stdio_input/src/ion/splitter.rs\",\n \"rank\": 70,\n \"score\": 72937.58664003076\n },\n {\n \"content\": \"#[test]\\n\\nfn methods() {\\n\\n let command = \\\"echo $join(array, ', '); echo @join(var, ', ')\\\";\\n\\n let statements = StatementSplitter::new(command).collect::<Vec<_>>();\\n\\n assert_eq!(\\n\\n statements[0],\\n\\n Ok(StatementVariant::Default(\\\"echo $join(array, ', ')\\\"))\\n\\n );\\n\\n assert_eq!(\\n\\n statements[1],\\n\\n Ok(StatementVariant::Default(\\\"echo @join(var, ', ')\\\"))\\n\\n );\\n\\n assert_eq!(statements.len(), 2);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"crate/stdio_input/src/ion/splitter.rs\",\n \"rank\": 71,\n \"score\": 72937.58664003076\n },\n {\n \"content\": \"fn main() {\\n\\n amethyst::start_logger(LoggerConfig {\\n\\n level_filter: if cfg!(debug_assertions) {\\n\\n LogLevelFilter::Debug\\n\\n } else {\\n\\n LogLevelFilter::Info\\n\\n },\\n\\n ..Default::default()\\n\\n });\\n\\n\\n\\n let opt = Opt::from_args();\\n\\n if let Err(e) = run(&opt) {\\n\\n println!(\\\"Failed to execute example: {}\\\", e);\\n\\n process::exit(1);\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"crate/stdio_input/examples/01_read_and_exit.rs\",\n \"rank\": 72,\n \"score\": 72931.4534092138\n },\n {\n \"content\": \"#[test]\\n\\nfn nested_process() {\\n\\n let command = \\\"echo $(echo one $(echo two) three)\\\";\\n\\n let results = StatementSplitter::new(command).collect::<Vec<_>>();\\n\\n assert_eq!(results.len(), 1);\\n\\n assert_eq!(results[0], Ok(StatementVariant::Default(command)));\\n\\n\\n\\n let command = \\\"echo $(echo $(echo one; echo two); echo two)\\\";\\n\\n let results = StatementSplitter::new(command).collect::<Vec<_>>();\\n\\n assert_eq!(results.len(), 1);\\n\\n assert_eq!(results[0], Ok(StatementVariant::Default(command)));\\n\\n}\\n\\n\\n\",\n \"file_path\": \"crate/stdio_input/src/ion/splitter.rs\",\n \"rank\": 73,\n \"score\": 71786.94777048778\n },\n {\n \"content\": \"#[test]\\n\\nfn braced_variables() {\\n\\n let command = \\\"echo ${foo}bar ${bar}baz ${baz}quux @{zardoz}wibble\\\";\\n\\n let results = StatementSplitter::new(command).collect::<Vec<_>>();\\n\\n assert_eq!(results.len(), 1);\\n\\n assert_eq!(results[0], Ok(StatementVariant::Default(command)));\\n\\n}\\n\\n\\n\",\n \"file_path\": \"crate/stdio_input/src/ion/splitter.rs\",\n \"rank\": 74,\n \"score\": 71786.94777048778\n },\n {\n \"content\": \"#[test]\\n\\nfn process_with_statements() {\\n\\n let command = \\\"echo $(seq 1 10; seq 1 10)\\\";\\n\\n for statement in StatementSplitter::new(command) {\\n\\n assert_eq!(statement, Ok(StatementVariant::Default(command)));\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"crate/stdio_input/src/ion/splitter.rs\",\n \"rank\": 75,\n \"score\": 71786.94777048778\n },\n {\n \"content\": \"#[test]\\n\\nfn array_processes() {\\n\\n let command = \\\"echo @(echo one; sleep 1); echo @(echo one; sleep 1)\\\";\\n\\n for statement in StatementSplitter::new(command) {\\n\\n assert_eq!(\\n\\n statement,\\n\\n Ok(StatementVariant::Default(\\\"echo @(echo one; sleep 1)\\\"))\\n\\n );\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"crate/stdio_input/src/ion/splitter.rs\",\n \"rank\": 76,\n \"score\": 71786.94777048778\n },\n {\n \"content\": \"#[test]\\n\\nfn nested_array_process() {\\n\\n let command = \\\"echo @(echo one @(echo two) three)\\\";\\n\\n let results = StatementSplitter::new(command).collect::<Vec<_>>();\\n\\n assert_eq!(results.len(), 1);\\n\\n assert_eq!(results[0], Ok(StatementVariant::Default(command)));\\n\\n\\n\\n let command = \\\"echo @(echo @(echo one; echo two); echo two)\\\";\\n\\n let results = StatementSplitter::new(command).collect::<Vec<_>>();\\n\\n assert_eq!(results.len(), 1);\\n\\n assert_eq!(results[0], Ok(StatementVariant::Default(command)));\\n\\n}\\n\\n\\n\",\n \"file_path\": \"crate/stdio_input/src/ion/splitter.rs\",\n \"rank\": 77,\n \"score\": 70687.26918433848\n },\n {\n \"content\": \"fn begins_with_vowel(word: &str) -> bool {\\n\\n if let Some('A') | Some('E') | Some('I') | Some('O') | Some('U') = word.chars().next() {\\n\\n true\\n\\n } else {\\n\\n false\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"crate/asset_derive/src/lib.rs\",\n \"rank\": 78,\n \"score\": 64571.91798319912\n },\n {\n \"content\": \"/// Returns true if the byte matches [^A-Za-z0-9_]\\n\\nfn is_invalid(byte: u8) -> bool {\\n\\n byte <= 47\\n\\n || (byte >= 58 && byte <= 64)\\n\\n || (byte >= 91 && byte <= 94)\\n\\n || byte == 96\\n\\n || (byte >= 123 && byte <= 127)\\n\\n}\\n\\n\\n\\n#[derive(Debug, PartialEq)]\\n\\npub enum StatementVariant<'a> {\\n\\n And(&'a str),\\n\\n Or(&'a str),\\n\\n Default(&'a str),\\n\\n}\\n\\n\\n\\n#[derive(Debug)]\\n\\npub struct StatementSplitter<'a> {\\n\\n data: &'a str,\\n\\n read: usize,\\n\\n start: usize,\\n\",\n \"file_path\": \"crate/stdio_input/src/ion/splitter.rs\",\n \"rank\": 79,\n \"score\": 64571.91798319912\n },\n {\n \"content\": \"/// Generates the `FrameComponentData` implementation.\\n\\npub fn frame_component_data_impl(\\n\\n mut ast: DeriveInput,\\n\\n args: ComponentDataAttributeArgs,\\n\\n) -> TokenStream {\\n\\n let ComponentDataAttributeArgs {\\n\\n component_path,\\n\\n component_copy,\\n\\n to_owned_fn,\\n\\n } = args;\\n\\n\\n\\n ast.assert_fields_unit();\\n\\n derive_append(&mut ast);\\n\\n fields_append(&mut ast, &component_path);\\n\\n\\n\\n let type_name = &ast.ident;\\n\\n let to_owned_fn_impl = to_owned_fn_impl(component_copy, to_owned_fn);\\n\\n\\n\\n let fn_new_doc = format!(\\\"Returns a new `{}`.\\\", type_name);\\n\\n\\n\\n let token_stream_2 = quote! {\\n\",\n \"file_path\": \"crate/sequence_model_derive/src/frame_component_data_impl.rs\",\n \"rank\": 80,\n \"score\": 63851.62282267952\n },\n {\n \"content\": \"/// Generates the `SequenceComponentData` implementation.\\n\\npub fn sequence_component_data_impl(\\n\\n mut ast: DeriveInput,\\n\\n args: ComponentDataAttributeArgs,\\n\\n) -> TokenStream {\\n\\n let ComponentDataAttributeArgs {\\n\\n component_path,\\n\\n component_copy,\\n\\n to_owned_fn,\\n\\n } = args;\\n\\n\\n\\n ast.assert_fields_unit();\\n\\n derive_append(&mut ast);\\n\\n fields_append(&mut ast, &component_path);\\n\\n\\n\\n let type_name = &ast.ident;\\n\\n let (impl_generics, ty_generics, where_clause) = ast.generics.split_for_impl();\\n\\n let to_owned_fn_impl = to_owned_fn_impl(component_copy, to_owned_fn);\\n\\n\\n\\n let fn_new_doc = format!(\\\"Returns a new `{}`.\\\", type_name);\\n\\n\\n\",\n \"file_path\": \"crate/sequence_model_derive/src/sequence_component_data_impl.rs\",\n \"rank\": 81,\n \"score\": 63851.62282267952\n },\n {\n \"content\": \"/// Returns whether the type is known to be `Eq + Ord`.\\n\\n///\\n\\n/// Note: This is a static list, so any types not in the following list will give a false `false`:\\n\\nfn is_eq_ord(ty: &Type) -> bool {\\n\\n if let Type::Path(TypePath { path, .. }) = ty {\\n\\n path.segments\\n\\n .last()\\n\\n .map(|segment| {\\n\\n let ty_ident = &segment.ident;\\n\\n KNOWN_TYPES_EQ_ORD\\n\\n .iter()\\n\\n .any(|known_ty| ty_ident == known_ty)\\n\\n })\\n\\n .unwrap_or(false)\\n\\n } else {\\n\\n false\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"crate/numeric_newtype_derive/src/lib.rs\",\n \"rank\": 82,\n \"score\": 63564.50459388443\n },\n {\n \"content\": \"use amethyst::{GameData, State, StateData, Trans};\\n\\nuse application_event::AppEvent;\\n\\nuse application_state::{AppState, AppStateBuilder};\\n\\nuse derivative::Derivative;\\n\\nuse derive_new::new;\\n\\nuse log::debug;\\n\\nuse network_session_model::play::SessionStatus;\\n\\nuse session_join_model::{SessionJoinEntity, SessionJoinEvent};\\n\\nuse session_lobby::{SessionLobbyStateBuilder, SessionLobbyStateDelegate};\\n\\nuse state_registry::StateId;\\n\\n\\n\\n/// `State` where session joining takes place.\\n\\n///\\n\\n/// This state is not intended to be constructed directly, but through the\\n\\n/// [`SessionJoinStateBuilder`][state_builder].\\n\\n///\\n\\n/// [state_builder]: network_mode_selection_state/struct.SessionJoinStateBuilder.html\\n\\npub type SessionJoinState = AppState<'static, 'static, SessionJoinStateDelegate, SessionJoinEntity>;\\n\\n\\n\\n/// Builder for a `SessionJoinState`.\\n\",\n \"file_path\": \"crate/session_join/src/session_join_state.rs\",\n \"rank\": 83,\n \"score\": 63124.65088324821\n },\n {\n \"content\": \"///\\n\\n/// `SystemBundle`s to run in the `SessionJoinState`'s dispatcher are registered on this builder.\\n\\npub type SessionJoinStateBuilder =\\n\\n AppStateBuilder<'static, 'static, SessionJoinStateDelegate, SessionJoinEntity>;\\n\\n\\n\\n/// Delegate `State` for session joining.\\n\\n///\\n\\n/// This state is not intended to be used directly, but wrapped in an `AppState`. The\\n\\n/// `SessionJoinState` is an alias with this as a delegate state.\\n\\n#[derive(Derivative, new)]\\n\\n#[derivative(Debug)]\\n\\npub struct SessionJoinStateDelegate;\\n\\n\\n\\nimpl SessionJoinStateDelegate {\\n\\n fn initialize_state(data: StateData<'_, GameData<'static, 'static>>) {\\n\\n data.world.insert(StateId::SessionJoin);\\n\\n data.world.insert(SessionStatus::None);\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"crate/session_join/src/session_join_state.rs\",\n \"rank\": 84,\n \"score\": 63122.25951359018\n },\n {\n \"content\": \"impl State<GameData<'static, 'static>, AppEvent> for SessionJoinStateDelegate {\\n\\n fn on_start(&mut self, data: StateData<'_, GameData<'static, 'static>>) {\\n\\n Self::initialize_state(data);\\n\\n }\\n\\n\\n\\n fn on_resume(&mut self, data: StateData<'_, GameData<'static, 'static>>) {\\n\\n Self::initialize_state(data);\\n\\n }\\n\\n\\n\\n fn handle_event(\\n\\n &mut self,\\n\\n _data: StateData<'_, GameData<'static, 'static>>,\\n\\n event: AppEvent,\\n\\n ) -> Trans<GameData<'static, 'static>, AppEvent> {\\n\\n if let AppEvent::SessionJoin(session_join_event) = event {\\n\\n debug!(\\\"Received session_join_event: {:?}\\\", session_join_event);\\n\\n match session_join_event {\\n\\n SessionJoinEvent::SessionAccept(_) => {\\n\\n let session_lobby_state =\\n\\n SessionLobbyStateBuilder::new(SessionLobbyStateDelegate::new()).build();\\n\",\n \"file_path\": \"crate/session_join/src/session_join_state.rs\",\n \"rank\": 85,\n \"score\": 63111.479039491416\n },\n {\n \"content\": \" Trans::Push(Box::new(session_lobby_state))\\n\\n }\\n\\n SessionJoinEvent::Back => Trans::Pop,\\n\\n _ => Trans::None,\\n\\n }\\n\\n } else {\\n\\n Trans::None\\n\\n }\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"crate/session_join/src/session_join_state.rs\",\n \"rank\": 86,\n \"score\": 63110.22374841251\n },\n {\n \"content\": \"fn fields_append(ast: &mut DeriveInput) {\\n\\n let fields: FieldsUnnamed = parse_quote! {(pub logic_clock::LogicClock)};\\n\\n ast.append_unnamed(fields);\\n\\n}\\n\",\n \"file_path\": \"crate/logic_clock_derive/src/lib.rs\",\n \"rank\": 87,\n \"score\": 62598.92882014894\n },\n {\n \"content\": \"fn derive_append(ast: &mut DeriveInput) {\\n\\n let derives = parse_quote!(\\n\\n Clone,\\n\\n Component,\\n\\n Copy,\\n\\n Debug,\\n\\n Default,\\n\\n Deref,\\n\\n DerefMut,\\n\\n Deserialize,\\n\\n From,\\n\\n Hash,\\n\\n PartialEq,\\n\\n Eq,\\n\\n Serialize,\\n\\n );\\n\\n\\n\\n ast.append_derives(derives);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"crate/logic_clock_derive/src/lib.rs\",\n \"rank\": 88,\n \"score\": 62598.92882014894\n },\n {\n \"content\": \"use serde::{Deserialize, Serialize};\\n\\nuse structopt_derive::StructOpt;\\n\\n\\n\\nuse crate::play::{SessionAcceptResponse, SessionJoinRequestParams, SessionRejectResponse};\\n\\n\\n\\n/// Session join state events.\\n\\n///\\n\\n/// # Examples\\n\\n///\\n\\n/// When read in as a command, the command string should look like the following:\\n\\n///\\n\\n/// * `session_join session_join_request --session-code abcd --device-name azriel --player-controllers \\\"0:azriel 1:friend_a`\\n\\n/// * `session_join join_cancel`\\n\\n/// * `session_join session_accept --session-code abcd --session-devices \\\"0:azriel::0:azriel::1:friend_a 1:byron::0:friend_b 2:carlo::0:friend_c\\\" --session-device-id 2`\\n\\n/// * `session_join back`\\n\\n///\\n\\n/// **Note:** The `session_accept` subcommand is designed to be received from the server, so sending\\n\\n/// this as a local command may cause undefined behaviour.\\n\\n#[derive(Clone, Debug, Deserialize, PartialEq, Serialize, StructOpt)]\\n\\n#[serde(deny_unknown_fields, rename_all = \\\"snake_case\\\")]\\n\",\n \"file_path\": \"crate/session_join_model/src/session_join_event.rs\",\n \"rank\": 89,\n \"score\": 62220.23110904797\n },\n {\n \"content\": \"#[structopt(rename_all = \\\"snake_case\\\")]\\n\\npub enum SessionJoinEvent {\\n\\n /// Player entered a session code.\\n\\n SessionJoinRequest(SessionJoinRequestParams),\\n\\n /// Player cancelled the request to join.\\n\\n JoinCancel,\\n\\n /// Server accepted the client's request.\\n\\n SessionAccept(SessionAcceptResponse),\\n\\n /// Server rejected the client's request.\\n\\n SessionReject(SessionRejectResponse),\\n\\n /// Return to the previous menu.\\n\\n Back,\\n\\n}\\n\",\n \"file_path\": \"crate/session_join_model/src/session_join_event.rs\",\n \"rank\": 90,\n \"score\": 62215.853694931895\n },\n {\n \"content\": \"#[cfg(test)]\\n\\nmod tests {\\n\\n use object_model::config::{ObjectFrame, ObjectSequence};\\n\\n use sequence_model::config::{Sequence, SequenceEndTransition, Wait};\\n\\n use serde_yaml;\\n\\n use sprite_model::config::SpriteRef;\\n\\n\\n\\n use test_object_model::config::{TestObjectFrame, TestObjectSequence};\\n\\n\\n\\n const SEQUENCE_WITH_FRAMES_EMPTY: &str = \\\"frames: []\\\";\\n\\n const SEQUENCE_WITH_INPUT_REACTIONS: &str = r#\\\"---\\n\\nframes:\\n\\n - wait: 2\\n\\n sprite: { sheet: 0, index: 4 }\\n\\n\\\"#;\\n\\n\\n\\n #[test]\\n\\n fn sequence_with_empty_frames_list_deserializes_successfully() {\\n\\n let sequence = serde_yaml::from_str::<TestObjectSequence>(SEQUENCE_WITH_FRAMES_EMPTY)\\n\\n .expect(\\\"Failed to deserialize sequence.\\\");\\n\",\n \"file_path\": \"crate/workspace_tests/src/test_object_model/config/test_object_sequence.rs\",\n \"rank\": 91,\n \"score\": 62204.14952158106\n },\n {\n \"content\": \"\\n\\n let expected = TestObjectSequence::new(ObjectSequence::default());\\n\\n assert_eq!(expected, sequence);\\n\\n }\\n\\n\\n\\n #[test]\\n\\n fn sequence_with_input_reactions() {\\n\\n let sequence = serde_yaml::from_str::<TestObjectSequence>(SEQUENCE_WITH_INPUT_REACTIONS)\\n\\n .expect(\\\"Failed to deserialize sequence.\\\");\\n\\n\\n\\n let frames = vec![TestObjectFrame::new(ObjectFrame {\\n\\n wait: Wait::new(2),\\n\\n sprite: SpriteRef::new(0, 4),\\n\\n ..Default::default()\\n\\n })];\\n\\n let expected = TestObjectSequence::new(ObjectSequence {\\n\\n sequence: Sequence {\\n\\n next: SequenceEndTransition::None,\\n\\n frames,\\n\\n },\\n\\n ..Default::default()\\n\\n });\\n\\n\\n\\n assert_eq!(expected, sequence);\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"crate/workspace_tests/src/test_object_model/config/test_object_sequence.rs\",\n \"rank\": 92,\n \"score\": 62194.71484432296\n },\n {\n \"content\": \"use std::any;\\n\\n\\n\\nuse amethyst::{\\n\\n core::bundle::SystemBundle,\\n\\n ecs::{DispatcherBuilder, World},\\n\\n Error,\\n\\n};\\n\\nuse application_event::AppEventVariant;\\n\\nuse derive_new::new;\\n\\nuse stdio_spi::MapperSystem;\\n\\n\\n\\nuse crate::SessionJoinEventStdinMapper;\\n\\n\\n\\n/// Adds a `MapperSystem<SessionJoinEventStdinMapper>` to the `World`.\\n\\n#[derive(Debug, new)]\\n\\npub struct SessionJoinStdioBundle;\\n\\n\\n\\nimpl<'a, 'b> SystemBundle<'a, 'b> for SessionJoinStdioBundle {\\n\\n fn build(\\n\\n self,\\n\",\n \"file_path\": \"crate/session_join_stdio/src/session_join_stdio_bundle.rs\",\n \"rank\": 93,\n \"score\": 61362.606856344144\n },\n {\n \"content\": \" _world: &mut World,\\n\\n builder: &mut DispatcherBuilder<'a, 'b>,\\n\\n ) -> Result<(), Error> {\\n\\n builder.add(\\n\\n MapperSystem::<SessionJoinEventStdinMapper>::new(AppEventVariant::SessionJoin),\\n\\n any::type_name::<MapperSystem<SessionJoinEventStdinMapper>>(),\\n\\n &[],\\n\\n ); // kcov-ignore\\n\\n Ok(())\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"crate/session_join_stdio/src/session_join_stdio_bundle.rs\",\n \"rank\": 94,\n \"score\": 61358.65092057328\n },\n {\n \"content\": \"fn session_server_config(will_config: &WillConfig) -> SessionServerConfig {\\n\\n SessionServerConfig {\\n\\n address: will_config.session_server_address,\\n\\n port: will_config.session_server_port,\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"app/will/src/main.rs\",\n \"rank\": 95,\n \"score\": 60783.280773305625\n },\n {\n \"content\": \"use amethyst::Error;\\n\\nuse session_join_model::SessionJoinEvent;\\n\\nuse stdio_spi::StdinMapper;\\n\\n\\n\\n/// Builds a `SessionJoinEvent` from stdin tokens.\\n\\n#[derive(Debug)]\\n\\npub struct SessionJoinEventStdinMapper;\\n\\n\\n\\nimpl StdinMapper for SessionJoinEventStdinMapper {\\n\\n type SystemData = ();\\n\\n type Event = SessionJoinEvent;\\n\\n type Args = SessionJoinEvent;\\n\\n\\n\\n fn map(_: &(), args: Self::Args) -> Result<Self::Event, Error> {\\n\\n Ok(args)\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"crate/session_join_stdio/src/session_join_event_stdin_mapper.rs\",\n \"rank\": 96,\n \"score\": 60515.937677677735\n },\n {\n \"content\": \"use amethyst::{\\n\\n derive::SystemDesc,\\n\\n ecs::{Read, System, World, Write},\\n\\n shred::{ResourceId, SystemData},\\n\\n shrev::{EventChannel, ReaderId},\\n\\n};\\n\\nuse derivative::Derivative;\\n\\nuse derive_new::new;\\n\\nuse game_input_model::{loaded::PlayerControllers, play::ControllerIdOffset};\\n\\nuse log::debug;\\n\\nuse net_model::play::{NetData, NetEventChannel};\\n\\nuse network_session_model::play::{\\n\\n Session, SessionCode, SessionDeviceId, SessionDevices, SessionStatus,\\n\\n};\\n\\nuse session_join_model::{play::SessionAcceptResponse, SessionJoinEvent};\\n\\n\\n\\n/// Records the session code and devices in the world when accepted into a session.\\n\\n#[derive(Debug, SystemDesc, new)]\\n\\n#[system_desc(name(SessionJoinResponseSystemDesc))]\\n\\npub struct SessionJoinResponseSystem {\\n\",\n \"file_path\": \"crate/session_join_play/src/system/session_join_response_system.rs\",\n \"rank\": 97,\n \"score\": 60509.76208301525\n },\n {\n \"content\": \"use amethyst::{\\n\\n derive::SystemDesc,\\n\\n ecs::{Read, System, World, Write},\\n\\n shred::{ResourceId, SystemData},\\n\\n shrev::{EventChannel, ReaderId},\\n\\n};\\n\\nuse derivative::Derivative;\\n\\nuse derive_new::new;\\n\\nuse net_model::play::NetMessageEvent;\\n\\nuse network_session_model::play::SessionStatus;\\n\\nuse session_join_model::SessionJoinEvent;\\n\\n\\n\\n/// Sends requests to a game server to join a session.\\n\\n#[derive(Debug, SystemDesc, new)]\\n\\n#[system_desc(name(SessionJoinRequestSystemDesc))]\\n\\npub struct SessionJoinRequestSystem {\\n\\n /// Reader ID for the `SessionJoinEvent` channel.\\n\\n #[system_desc(event_channel_reader)]\\n\\n session_join_event_rid: ReaderId<SessionJoinEvent>,\\n\\n}\\n\",\n \"file_path\": \"crate/session_join_play/src/system/session_join_request_system.rs\",\n \"rank\": 98,\n \"score\": 60509.65091180855\n },\n {\n \"content\": \"use serde::{Deserialize, Serialize};\\n\\n\\n\\n/// Configuration parameters to send a `SessionJoinEvent`.\\n\\n///\\n\\n/// This excludes `SessionJoinEvent::SessionAccept` because that should be sent from the session\\n\\n/// server. For testing purposes, you may still use stdin.\\n\\n#[derive(Clone, Copy, Debug, Deserialize, PartialEq, Serialize)]\\n\\n#[serde(deny_unknown_fields, rename_all = \\\"snake_case\\\")]\\n\\npub enum SessionJoinEventCommand {\\n\\n /// Player entered a session code.\\n\\n ///\\n\\n /// The `SessionJoinRequestParams` is specially looked up by code.\\n\\n SessionJoinRequest,\\n\\n /// Player cancelled the request to join.\\n\\n JoinCancel,\\n\\n /// Return to the previous menu.\\n\\n Back,\\n\\n}\\n\",\n \"file_path\": \"crate/session_join_model/src/config/session_join_event_command.rs\",\n \"rank\": 99,\n \"score\": 60505.93226641827\n }\n]","isConversational":false}}},{"rowIdx":2362,"cells":{"lang":{"kind":"string","value":"Rust"},"file_path":{"kind":"string","value":"binding-generator/src/smart_ptr.rs"},"repo_name":{"kind":"string","value":"tanxxjun321/opencv-rust"},"commit":{"kind":"string","value":"1cfceeba79eb8fffce3c8ae698c56cdf2d4e5ff5"},"file_code":{"kind":"string","value":"use std::{\n\tborrow::Cow,\n\tfmt,\n};\n\nuse clang::Entity;\nuse maplit::hashmap;\nuse once_cell::sync::Lazy;\n\nuse crate::{\n\tConstness,\n\tCompiledInterpolation,\n\tDefaultElement,\n\tDefinitionLocation,\n\tElement,\n\tEntityElement,\n\tGeneratedElement,\n\tGeneratorEnv,\n\tReturnTypeWrapper,\n\tStrExt,\n\ttype_ref::TemplateArg,\n\tTypeRef,\n};\n\n#[derive(Clone)]\npub struct SmartPtr<'tu, 'g> {\n\tentity: Entity<'tu>,\n\tgen_env: &'g GeneratorEnv<'tu>,\n}\n\nimpl<'tu, 'g> SmartPtr<'tu, 'g> {\n\tpub fn new(entity: Entity<'tu>, gen_env: &'g GeneratorEnv<'tu>) -> Self {\n\t\tSelf { entity, gen_env }\n\t}\n\n\tpub fn type_ref(&self) -> TypeRef<'tu, 'g> {\n\t\tTypeRef::new(self.entity.get_type().expect(\"Can't get smartptr type\"), self.gen_env)\n\t}\n\n\tpub fn pointee(&self) -> TypeRef<'tu, 'g> {\n\t\tself.type_ref().template_specialization_args().into_iter()\n\t\t\t.find_map(|a| if let TemplateArg::Typename(type_ref) = a {\n\t\t\t\tSome(type_ref)\n\t\t\t} else {\n\t\t\t\tNone\n\t\t\t}).expect(\"smart pointer template argument list is empty\")\n\t}\n\n\tpub fn dependent_types(&self) -> Vec<Box<dyn GeneratedElement + 'g>> {\n\t\tlet canon = self.type_ref().canonical_clang();\n\t\tlet mut out = vec![\n\t\t\tBox::new(ReturnTypeWrapper::new(canon.clone(), self.gen_env, DefinitionLocation::Module)) as Box<dyn GeneratedElement>\n\t\t];\n\t\tif self.pointee().as_typedef().is_some() {\n\t\t\tout.extend(canon.dependent_types())\n\t\t}\n\t\tout\n\t}\n\n\tpub fn rust_localalias(&self) -> Cow<str> {\n\t\tformat!(\"PtrOf{typ}\", typ=self.pointee().rust_safe_id()).into()\n\t}\n\n\tpub fn rust_fullalias(&self) -> Cow<str> {\n\t\tformat!(\"types::{}\", self.rust_localalias()).into()\n\t}\n}\n\nimpl<'tu> EntityElement<'tu> for SmartPtr<'tu, '_> {\n\tfn entity(&self) -> Entity<'tu> {\n\t\tself.entity\n\t}\n}\n\nimpl Element for SmartPtr<'_, '_> {\n\tfn is_excluded(&self) -> bool {\n\t\tDefaultElement::is_excluded(self) || self.pointee().is_excluded()\n\t}\n\n\tfn is_ignored(&self) -> bool {\n\t\tDefaultElement::is_ignored(self) || self.pointee().is_ignored()\n\t}\n\n\tfn is_system(&self) -> bool {\n\t\tDefaultElement::is_system(self)\n\t}\n\n\tfn is_public(&self) -> bool {\n\t\tDefaultElement::is_public(self)\n\t}\n\n\tfn usr(&self) -> Cow<str> {\n\t\tDefaultElement::usr(self)\n\t}\n\n\tfn rendered_doc_comment_with_prefix(&self, prefix: &str, opencv_version: &str) -> String {\n\t\tDefaultElement::rendered_doc_comment_with_prefix(self, prefix, opencv_version)\n\t}\n\n\tfn cpp_namespace(&self) -> Cow<str> {\n\t\t\"cv\".into()\n\t}\n\n\tfn cpp_localname(&self) -> Cow<str> {\n\t\t\"Ptr\".into()\n\t}\n\n\tfn rust_module(&self) -> Cow<str> {\n\t\tself.pointee().rust_module().into_owned().into()\n\t}\n\n\tfn rust_namespace(&self) -> Cow<str> {\n\t\t\"core\".into()\n\t}\n\n\tfn rust_leafname(&self) -> Cow<str> {\n\t\tformat!(\"Ptr::<{typ}>\", typ=self.pointee().rust_full()).into()\n\t}\n\n\tfn rust_localname(&self) -> Cow<str> {\n\t\tDefaultElement::rust_localname(self)\n\t}\n}\n\nimpl GeneratedElement for SmartPtr<'_, '_> {\n\tfn element_safe_id(&self) -> String {\n\t\tformat!(\"{}-{}\", self.rust_module(), self.rust_localalias())\n\t}\n\n\tfn gen_rust(&self, _opencv_version: &str) -> String {\n\t\tstatic TPL: Lazy<CompiledInterpolation> = Lazy::new(\n\t\t\t|| include_str!(\"../tpl/smart_ptr/rust.tpl.rs\").compile_interpolation()\n\t\t);\n\n\t\tstatic TRAIT_CAST_TPL: Lazy<CompiledInterpolation> = Lazy::new(\n\t\t\t|| include_str!(\"../tpl/smart_ptr/trait_cast.tpl.rs\").compile_interpolation()\n\t\t);\n\n\t\tlet type_ref = self.type_ref();\n\t\tlet pointee = self.pointee();\n\t\tlet pointee_type = pointee.canonical();\n\n\t\tlet mut inter_vars = hashmap! {\n\t\t\t\"rust_localalias\" => self.rust_localalias(),\n\t\t\t\"rust_full\" => self.rust_fullname(),\n\t\t\t\"rust_extern_const\" => type_ref.rust_extern_with_const(Constness::Const),\n\t\t\t\"rust_extern_mut\" => type_ref.rust_extern_with_const(Constness::Mut),\n\t\t\t\"inner_rust_full\" => pointee_type.rust_full(),\n\t\t};\n\n\t\tlet mut impls = String::new();\n\t\tif let Some(cls) = pointee_type.as_class() {\n\t\t\tif cls.is_trait() {\n\t\t\t\tlet mut all_bases = cls.all_bases();\n\t\t\t\tall_bases.insert(cls);\n\t\t\t\tlet mut all_bases = all_bases.into_iter()\n\t\t\t\t\t.filter(|b| !b.is_excluded())\n\t\t\t\t\t.collect::<Vec<_>>();\n\t\t\t\tall_bases.sort_unstable_by(|a, b| a.cpp_localname().cmp(&b.cpp_localname()));\n\t\t\t\tfor base in all_bases {\n\t\t\t\t\tinter_vars.insert(\"base_rust_local\", base.rust_localname().into_owned().into());\n\t\t\t\t\tinter_vars.insert(\"base_rust_full\", base.rust_trait_fullname().into_owned().into());\n\t\t\t\t\timpls += &TRAIT_CAST_TPL.interpolate(&inter_vars);\n\t\t\t\t}\n\t\t\t}\n\t\t};\n\t\tinter_vars.insert(\"impls\", impls.into());\n\t\tTPL.interpolate(&inter_vars)\n\t}\n\n\tfn gen_cpp(&self) -> String {\n\t\tstatic TPL: Lazy<CompiledInterpolation> = Lazy::new(\n\t\t\t|| include_str!(\"../tpl/smart_ptr/cpp.tpl.cpp\").compile_interpolation()\n\t\t);\n\n\t\tlet type_ref = self.type_ref();\n\t\tlet pointee_type = self.pointee();\n\n\t\tlet mut inner_cpp_extern = pointee_type.cpp_extern_return();\n\t\tif !pointee_type.is_by_ptr() {\n\t\t\tinner_cpp_extern.to_mut().push('*');\n\t\t}\n\n\t\tTPL.interpolate(&hashmap! {\n\t\t\t\"rust_localalias\" => self.rust_localalias(),\n\t\t\t\"cpp_extern\" => type_ref.cpp_extern(),\n\t\t\t\"cpp_full\" => type_ref.cpp_full(),\n\t\t\t\"inner_cpp_full\" => pointee_type.cpp_full(),\n\t\t\t\"inner_cpp_extern\" => inner_cpp_extern,\n\t\t})\n\t}\n}\n\nimpl fmt::Display for SmartPtr<'_, '_> {\n\tfn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {\n\t\twrite!(f, \"{}\", self.entity.get_display_name().expect(\"Can't get display name\"))\n\t}\n}\n\nimpl fmt::Debug for SmartPtr<'_, '_> {\n\tfn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {\n\t\tlet mut debug_struct = f.debug_struct(\"SmartPtr\");\n\t\tself.update_debug_struct(&mut debug_struct)\n\t\t\t.field(\"export_config\", &self.gen_env.get_export_config(self.entity))\n\t\t\t.field(\"pointee\", &self.pointee())\n\t\t\t.finish()\n\t}\n}\n"},"prefix":{"kind":"string","value":"use std::{\n\tborrow::Cow,\n\tfmt,\n};\n\nuse clang::Entity;\nuse maplit::hashmap;\nuse once_cell::sync::Lazy;\n\nuse crate::{\n\tConstness,\n\tCompiledInterpolation,\n\tDefaultElement,\n\tDefinitionLocation,\n\tElement,\n\tEntityElement,\n\tGeneratedElement,\n\tGeneratorEnv,\n\tReturnTypeWrapper,\n\tStrExt,\n\ttype_ref::TemplateArg,\n\tTypeRef,\n};\n\n#[derive(Clone)]\npub struct SmartPtr<'tu, 'g> {\n\tentity: Entity<'tu>,\n\tgen_env: &'g GeneratorEnv<'tu>,\n}\n\nimpl<'tu, 'g> SmartPtr<'tu, 'g> {\n\tpub fn new(entity: Entity<'tu>, gen_env: &'g GeneratorEnv<'tu>) -> Self {\n\t\tSelf { entity, gen_env }\n\t}\n\n\tpub fn type_ref(&self) -> TypeRef<'tu, 'g> {\n\t\tTypeRef::new(self.entity.get_type().expect(\"Can't get smartptr type\"), self.gen_env)\n\t}\n\n\tpub fn pointee(&self) -> TypeRef<'tu, 'g> {\n\t\tself.type_ref().template_specialization_args().into_iter()\n\t\t\t.find_map(|a| if let TemplateArg::Typename(type_ref) = a {\n\t\t\t\tSome(type_ref)\n\t\t\t} else {\n\t\t\t\tNone\n\t\t\t}).expect(\"smart pointer template argument list is empty\")\n\t}\n\n\tpub fn dependent_types(&self) -> Vec<Box<dyn GeneratedElement + 'g>> {\n\t\tlet canon = self.type_ref().canonical_clang();\n\t\tlet mut out = vec![\n\t\t\tBox::new(ReturnTypeWrapper::new(canon.clone(), self.gen_env, DefinitionLocation::Module)) as Box<dyn GeneratedElement>\n\t\t];\n\t\tif self.pointee().as_typedef().is_some() {\n\t\t\tout.extend(canon.dependent_types())\n\t\t}\n\t\tout\n\t}\n\n\tpub fn rust_localalias(&self) -> Cow<str> {\n\t\tformat!(\"PtrOf{typ}\", typ=self.pointee().rust_safe_id()).into()\n\t}\n\n\tpub fn rust_fullalias(&self) -> Cow<str> {\n\t\tformat!(\"types::{}\", self.rust_localalias()).into()\n\t}\n}\n\nimpl<'tu> EntityElement<'tu> for Sm"},"suffix":{"kind":"string","value":"ment_safe_id(&self) -> String {\n\t\tformat!(\"{}-{}\", self.rust_module(), self.rust_localalias())\n\t}\n\n\tfn gen_rust(&self, _opencv_version: &str) -> String {\n\t\tstatic TPL: Lazy<CompiledInterpolation> = Lazy::new(\n\t\t\t|| include_str!(\"../tpl/smart_ptr/rust.tpl.rs\").compile_interpolation()\n\t\t);\n\n\t\tstatic TRAIT_CAST_TPL: Lazy<CompiledInterpolation> = Lazy::new(\n\t\t\t|| include_str!(\"../tpl/smart_ptr/trait_cast.tpl.rs\").compile_interpolation()\n\t\t);\n\n\t\tlet type_ref = self.type_ref();\n\t\tlet pointee = self.pointee();\n\t\tlet pointee_type = pointee.canonical();\n\n\t\tlet mut inter_vars = hashmap! {\n\t\t\t\"rust_localalias\" => self.rust_localalias(),\n\t\t\t\"rust_full\" => self.rust_fullname(),\n\t\t\t\"rust_extern_const\" => type_ref.rust_extern_with_const(Constness::Const),\n\t\t\t\"rust_extern_mut\" => type_ref.rust_extern_with_const(Constness::Mut),\n\t\t\t\"inner_rust_full\" => pointee_type.rust_full(),\n\t\t};\n\n\t\tlet mut impls = String::new();\n\t\tif let Some(cls) = pointee_type.as_class() {\n\t\t\tif cls.is_trait() {\n\t\t\t\tlet mut all_bases = cls.all_bases();\n\t\t\t\tall_bases.insert(cls);\n\t\t\t\tlet mut all_bases = all_bases.into_iter()\n\t\t\t\t\t.filter(|b| !b.is_excluded())\n\t\t\t\t\t.collect::<Vec<_>>();\n\t\t\t\tall_bases.sort_unstable_by(|a, b| a.cpp_localname().cmp(&b.cpp_localname()));\n\t\t\t\tfor base in all_bases {\n\t\t\t\t\tinter_vars.insert(\"base_rust_local\", base.rust_localname().into_owned().into());\n\t\t\t\t\tinter_vars.insert(\"base_rust_full\", base.rust_trait_fullname().into_owned().into());\n\t\t\t\t\timpls += &TRAIT_CAST_TPL.interpolate(&inter_vars);\n\t\t\t\t}\n\t\t\t}\n\t\t};\n\t\tinter_vars.insert(\"impls\", impls.into());\n\t\tTPL.interpolate(&inter_vars)\n\t}\n\n\tfn gen_cpp(&self) -> String {\n\t\tstatic TPL: Lazy<CompiledInterpolation> = Lazy::new(\n\t\t\t|| include_str!(\"../tpl/smart_ptr/cpp.tpl.cpp\").compile_interpolation()\n\t\t);\n\n\t\tlet type_ref = self.type_ref();\n\t\tlet pointee_type = self.pointee();\n\n\t\tlet mut inner_cpp_extern = pointee_type.cpp_extern_return();\n\t\tif !pointee_type.is_by_ptr() {\n\t\t\tinner_cpp_extern.to_mut().push('*');\n\t\t}\n\n\t\tTPL.interpolate(&hashmap! {\n\t\t\t\"rust_localalias\" => self.rust_localalias(),\n\t\t\t\"cpp_extern\" => type_ref.cpp_extern(),\n\t\t\t\"cpp_full\" => type_ref.cpp_full(),\n\t\t\t\"inner_cpp_full\" => pointee_type.cpp_full(),\n\t\t\t\"inner_cpp_extern\" => inner_cpp_extern,\n\t\t})\n\t}\n}\n\nimpl fmt::Display for SmartPtr<'_, '_> {\n\tfn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {\n\t\twrite!(f, \"{}\", self.entity.get_display_name().expect(\"Can't get display name\"))\n\t}\n}\n\nimpl fmt::Debug for SmartPtr<'_, '_> {\n\tfn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {\n\t\tlet mut debug_struct = f.debug_struct(\"SmartPtr\");\n\t\tself.update_debug_struct(&mut debug_struct)\n\t\t\t.field(\"export_config\", &self.gen_env.get_export_config(self.entity))\n\t\t\t.field(\"pointee\", &self.pointee())\n\t\t\t.finish()\n\t}\n}\n"},"middle":{"kind":"string","value":"artPtr<'tu, '_> {\n\tfn entity(&self) -> Entity<'tu> {\n\t\tself.entity\n\t}\n}\n\nimpl Element for SmartPtr<'_, '_> {\n\tfn is_excluded(&self) -> bool {\n\t\tDefaultElement::is_excluded(self) || self.pointee().is_excluded()\n\t}\n\n\tfn is_ignored(&self) -> bool {\n\t\tDefaultElement::is_ignored(self) || self.pointee().is_ignored()\n\t}\n\n\tfn is_system(&self) -> bool {\n\t\tDefaultElement::is_system(self)\n\t}\n\n\tfn is_public(&self) -> bool {\n\t\tDefaultElement::is_public(self)\n\t}\n\n\tfn usr(&self) -> Cow<str> {\n\t\tDefaultElement::usr(self)\n\t}\n\n\tfn rendered_doc_comment_with_prefix(&self, prefix: &str, opencv_version: &str) -> String {\n\t\tDefaultElement::rendered_doc_comment_with_prefix(self, prefix, opencv_version)\n\t}\n\n\tfn cpp_namespace(&self) -> Cow<str> {\n\t\t\"cv\".into()\n\t}\n\n\tfn cpp_localname(&self) -> Cow<str> {\n\t\t\"Ptr\".into()\n\t}\n\n\tfn rust_module(&self) -> Cow<str> {\n\t\tself.pointee().rust_module().into_owned().into()\n\t}\n\n\tfn rust_namespace(&self) -> Cow<str> {\n\t\t\"core\".into()\n\t}\n\n\tfn rust_leafname(&self) -> Cow<str> {\n\t\tformat!(\"Ptr::<{typ}>\", typ=self.pointee().rust_full()).into()\n\t}\n\n\tfn rust_localname(&self) -> Cow<str> {\n\t\tDefaultElement::rust_localname(self)\n\t}\n}\n\nimpl GeneratedElement for SmartPtr<'_, '_> {\n\tfn ele"},"strategy":{"kind":"string","value":"random"},"context_items":{"kind":"list like","value":[{"content":"/// Default face detector\n\n/// This function is mainly utilized by the implementation of a Facemark Algorithm.\n\n/// End users are advised to use function Facemark::getFaces which can be manually defined\n\n/// and circumvented to the algorithm by Facemark::setFaceDetector.\n\n/// \n\n/// ## Parameters\n\n/// * image: The input image to be processed.\n\n/// * faces: Output of the function which represent region of interest of the detected faces.\n\n/// Each face is stored in cv::Rect container.\n\n/// * params: detector parameters\n\n/// \n\n/// <B>Example of usage</B>\n\n/// ```ignore\n\n/// std::vector<cv::Rect> faces;\n\n/// CParams params(\"haarcascade_frontalface_alt.xml\");\n\n/// cv::face::getFaces(frame, faces, ¶ms);\n\n/// for(int j=0;j<faces.size();j++){\n\n/// cv::rectangle(frame, faces[j], cv::Scalar(255,0,255));\n\n/// }\n\n/// cv::imshow(\"detection\", frame);\n\n/// ```\n\n/// \n\npub fn get_faces(image: &dyn core::ToInputArray, faces: &mut dyn core::ToOutputArray, params: &mut crate::face::CParams) -> Result<bool> {\n\n\tinput_array_arg!(image);\n\n\toutput_array_arg!(faces);\n\n\tunsafe { sys::cv_face_getFaces_const__InputArrayX_const__OutputArrayX_CParamsX(image.as_raw__InputArray(), faces.as_raw__OutputArray(), params.as_raw_mut_CParams()) }.into_result()\n\n}\n\n\n","file_path":"src/opencv/hub/face.rs","rank":0,"score":368041.34328718204},{"content":"pub fn dump_input_output_array(argument: &mut dyn core::ToInputOutputArray) -> Result<String> {\n\n\tinput_output_array_arg!(argument);\n\n\tunsafe { sys::cv_utils_dumpInputOutputArray_const__InputOutputArrayX(argument.as_raw__InputOutputArray()) }.into_result().map(|s| unsafe { crate::templ::receive_string(s as *mut String) })\n\n}\n\n\n","file_path":"src/opencv/hub/core.rs","rank":1,"score":365292.8294835172},{"content":"/// Default face detector\n\n/// This function is mainly utilized by the implementation of a Facemark Algorithm.\n\n/// End users are advised to use function Facemark::getFaces which can be manually defined\n\n/// and circumvented to the algorithm by Facemark::setFaceDetector.\n\n/// \n\n/// ## Parameters\n\n/// * image: The input image to be processed.\n\n/// * faces: Output of the function which represent region of interest of the detected faces.\n\n/// Each face is stored in cv::Rect container.\n\n/// * params: detector parameters\n\n/// \n\n/// <B>Example of usage</B>\n\n/// ```ignore\n\n/// std::vector<cv::Rect> faces;\n\n/// CParams params(\"haarcascade_frontalface_alt.xml\");\n\n/// cv::face::getFaces(frame, faces, ¶ms);\n\n/// for(int j=0;j<faces.size();j++){\n\n/// cv::rectangle(frame, faces[j], cv::Scalar(255,0,255));\n\n/// }\n\n/// cv::imshow(\"detection\", frame);\n\n/// ```\n\n/// \n\npub fn get_faces(image: &dyn core::ToInputArray, faces: &mut dyn core::ToOutputArray, params: &mut crate::face::CParams) -> Result<bool> {\n\n\tinput_array_arg!(image);\n\n\toutput_array_arg!(faces);\n\n\tunsafe { sys::cv_face_getFaces_const__InputArrayX_const__OutputArrayX_CParamsX(image.as_raw__InputArray(), faces.as_raw__OutputArray(), params.as_raw_mut_CParams()) }.into_result()\n\n}\n\n\n","file_path":"bindings/rust/opencv_4/hub/face.rs","rank":2,"score":364408.2548113236},{"content":"/// Default face detector\n\n/// This function is mainly utilized by the implementation of a Facemark Algorithm.\n\n/// End users are advised to use function Facemark::getFaces which can be manually defined\n\n/// and circumvented to the algorithm by Facemark::setFaceDetector.\n\n/// \n\n/// ## Parameters\n\n/// * image: The input image to be processed.\n\n/// * faces: Output of the function which represent region of interest of the detected faces.\n\n/// Each face is stored in cv::Rect container.\n\n/// * params: detector parameters\n\n/// \n\n/// <B>Example of usage</B>\n\n/// ```ignore\n\n/// std::vector<cv::Rect> faces;\n\n/// CParams params(\"haarcascade_frontalface_alt.xml\");\n\n/// cv::face::getFaces(frame, faces, ¶ms);\n\n/// for(int j=0;j<faces.size();j++){\n\n/// cv::rectangle(frame, faces[j], cv::Scalar(255,0,255));\n\n/// }\n\n/// cv::imshow(\"detection\", frame);\n\n/// ```\n\n/// \n\npub fn get_faces(image: &dyn core::ToInputArray, faces: &mut dyn core::ToOutputArray, params: &mut crate::face::CParams) -> Result<bool> {\n\n\tinput_array_arg!(image);\n\n\toutput_array_arg!(faces);\n\n\tunsafe { sys::cv_face_getFaces_const__InputArrayX_const__OutputArrayX_CParamsX(image.as_raw__InputArray(), faces.as_raw__OutputArray(), params.as_raw_mut_CParams()) }.into_result()\n\n}\n\n\n","file_path":"bindings/rust/opencv_34/hub/face.rs","rank":3,"score":364408.2548113236},{"content":"pub fn dump_input_output_array_of_arrays(argument: &mut dyn core::ToInputOutputArray) -> Result<String> {\n\n\tinput_output_array_arg!(argument);\n\n\tunsafe { sys::cv_utils_dumpInputOutputArrayOfArrays_const__InputOutputArrayX(argument.as_raw__InputOutputArray()) }.into_result().map(|s| unsafe { crate::templ::receive_string(s as *mut String) })\n\n}\n\n\n","file_path":"src/opencv/hub/core.rs","rank":4,"score":361387.9693319682},{"content":"pub fn dump_input_output_array(argument: &mut dyn core::ToInputOutputArray) -> Result<String> {\n\n\tinput_output_array_arg!(argument);\n\n\tunsafe { sys::cv_utils_dumpInputOutputArray_const__InputOutputArrayX(argument.as_raw__InputOutputArray()) }.into_result().map(|s| unsafe { crate::templ::receive_string(s as *mut String) })\n\n}\n\n\n","file_path":"bindings/rust/opencv_34/hub/core.rs","rank":5,"score":361387.96933196817},{"content":"pub fn dump_input_output_array(argument: &mut dyn core::ToInputOutputArray) -> Result<String> {\n\n\tinput_output_array_arg!(argument);\n\n\tunsafe { sys::cv_utils_dumpInputOutputArray_const__InputOutputArrayX(argument.as_raw__InputOutputArray()) }.into_result().map(|s| unsafe { crate::templ::receive_string(s as *mut String) })\n\n}\n\n\n","file_path":"bindings/rust/opencv_4/hub/core.rs","rank":6,"score":361387.9693319682},{"content":"pub trait Element: fmt::Debug {\n\n\tfn update_debug_struct<'dref, 'a, 'b>(&self, struct_debug: &'dref mut fmt::DebugStruct<'a, 'b>) -> &'dref mut fmt::DebugStruct<'a, 'b> {\n\n\t\tstruct_debug.field(\"cpp_fullname\", &self.cpp_fullname())\n\n\t\t\t.field(\"rust_fullname\", &self.rust_fullname())\n\n\t\t\t.field(\"identifier\", &self.identifier())\n\n\t\t\t.field(\"is_excluded\", &self.is_excluded())\n\n\t\t\t.field(\"is_ignored\", &self.is_ignored())\n\n\t\t\t.field(\"is_system\", &self.is_system())\n\n\t\t\t.field(\"is_public\", &self.is_public())\n\n\t}\n\n\n\n\t/// true if an element shouldn't be generated\n\n\tfn is_excluded(&self) -> bool {\n\n\t\tDefaultElement::is_excluded(self)\n\n\t}\n\n\n\n\t/// true if there shouldn't be any references to that element\n\n\tfn is_ignored(&self) -> bool {\n\n\t\tDefaultElement::is_ignored(self)\n\n\t}\n","file_path":"binding-generator/src/element.rs","rank":7,"score":360998.14232778776},{"content":"pub fn flann_distance_type() -> Result<crate::flann::flann_distance_t> {\n\n\tunsafe { sys::cvflann_flann_distance_type() }.into_result()\n\n}\n\n\n","file_path":"src/opencv/hub/flann.rs","rank":8,"score":359096.656046537},{"content":"pub fn dump_input_output_array_of_arrays(argument: &mut dyn core::ToInputOutputArray) -> Result<String> {\n\n\tinput_output_array_arg!(argument);\n\n\tunsafe { sys::cv_utils_dumpInputOutputArrayOfArrays_const__InputOutputArrayX(argument.as_raw__InputOutputArray()) }.into_result().map(|s| unsafe { crate::templ::receive_string(s as *mut String) })\n\n}\n\n\n","file_path":"bindings/rust/opencv_34/hub/core.rs","rank":9,"score":357639.2504828869},{"content":"pub fn dump_input_output_array_of_arrays(argument: &mut dyn core::ToInputOutputArray) -> Result<String> {\n\n\tinput_output_array_arg!(argument);\n\n\tunsafe { sys::cv_utils_dumpInputOutputArrayOfArrays_const__InputOutputArrayX(argument.as_raw__InputOutputArray()) }.into_result().map(|s| unsafe { crate::templ::receive_string(s as *mut String) })\n\n}\n\n\n","file_path":"bindings/rust/opencv_4/hub/core.rs","rank":10,"score":357639.250482887},{"content":"pub fn flann_distance_type() -> Result<crate::flann::flann_distance_t> {\n\n\tunsafe { sys::cvflann_flann_distance_type() }.into_result()\n\n}\n\n\n","file_path":"bindings/rust/opencv_34/hub/flann.rs","rank":11,"score":354254.69159927516},{"content":"pub fn flann_distance_type() -> Result<crate::flann::flann_distance_t> {\n\n\tunsafe { sys::cvflann_flann_distance_type() }.into_result()\n\n}\n\n\n","file_path":"bindings/rust/opencv_32/hub/flann.rs","rank":12,"score":354254.6915992751},{"content":"pub fn flann_distance_type() -> Result<crate::flann::flann_distance_t> {\n\n\tunsafe { sys::cvflann_flann_distance_type() }.into_result()\n\n}\n\n\n","file_path":"bindings/rust/opencv_4/hub/flann.rs","rank":13,"score":354254.6915992751},{"content":"#[allow(unused)]\n\npub fn dbg_clang_type(type_ref: Type) {\n\n\tstruct TypeWrapper<'tu>(Type<'tu>);\n\n\n\n\timpl fmt::Debug for TypeWrapper<'_> {\n\n\t\tfn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {\n\n\t\t\tf.debug_struct(\"Type\")\n\n\t\t\t\t.field(\"kind\", &self.0.get_kind())\n\n\t\t\t\t.field(\"display_name\", &self.0.get_display_name())\n\n\t\t\t\t.field(\"alignof\", &self.0.get_alignof())\n\n\t\t\t\t.field(\"sizeof\", &self.0.get_sizeof())\n\n\t\t\t\t.field(\"address_space\", &self.0.get_address_space())\n\n\t\t\t\t.field(\"argument_types\", &self.0.get_argument_types())\n\n\t\t\t\t.field(\"calling_convention\", &self.0.get_calling_convention())\n\n\t\t\t\t.field(\"canonical_type\", &self.0.get_canonical_type())\n\n\t\t\t\t.field(\"class_type\", &self.0.get_class_type())\n\n\t\t\t\t.field(\"declaration\", &self.0.get_declaration())\n\n\t\t\t\t.field(\"elaborated_type\", &self.0.get_elaborated_type())\n\n\t\t\t\t.field(\"element_type\", &self.0.get_element_type())\n\n\t\t\t\t.field(\"exception_specification\", &self.0.get_exception_specification())\n\n\t\t\t\t.field(\"fields\", &self.0.get_fields())\n","file_path":"binding-generator/src/generator.rs","rank":14,"score":353651.79600233934},{"content":"fn get_debug<'tu>(e: &(impl EntityElement<'tu> + fmt::Display)) -> String {\n\n\tif false {\n\n\t\tlet loc = e.entity()\n\n\t\t\t.get_location().expect(\"Can't get entity location\")\n\n\t\t\t.get_file_location();\n\n\n\n\t\tformat!(\n\n\t\t\t\"// {} {}:{}\",\n\n\t\t\te,\n\n\t\t\tcanonicalize(loc.file.expect(\"Can't get file for debug\").get_path()).expect(\"Can't canonicalize path\").display(),\n\n\t\t\tloc.line\n\n\t\t)\n\n\t} else {\n\n\t\t\"\".to_string()\n\n\t}\n\n}\n\n\n","file_path":"binding-generator/src/lib.rs","rank":15,"score":350004.2295481536},{"content":"/// ////////////////////////////////////////////////////////////////////////////////////////////\n\n/// Computing normals for mesh\n\n/// ## Parameters\n\n/// * mesh: Input mesh.\n\n/// * normals: Normals at very point in the mesh of type CV_64FC3.\n\npub fn compute_normals(mesh: &crate::viz::Mesh, normals: &mut dyn core::ToOutputArray) -> Result<()> {\n\n\toutput_array_arg!(normals);\n\n\tunsafe { sys::cv_viz_computeNormals_const_MeshX_const__OutputArrayX(mesh.as_raw_Mesh(), normals.as_raw__OutputArray()) }.into_result()\n\n}\n\n\n","file_path":"src/opencv/hub/viz.rs","rank":16,"score":346723.93925292627},{"content":"pub fn get_available_targets(be: crate::dnn::Backend) -> Result<core::Vector::<crate::dnn::Target>> {\n\n\tunsafe { sys::cv_dnn_getAvailableTargets_Backend(be) }.into_result().map(|ptr| unsafe { core::Vector::<crate::dnn::Target>::from_raw(ptr) })\n\n}\n\n\n","file_path":"src/opencv/hub/dnn.rs","rank":17,"score":345590.5215973981},{"content":"/// ////////////////////////////////////////////////////////////////////////////////////////////\n\n/// Computing normals for mesh\n\n/// ## Parameters\n\n/// * mesh: Input mesh.\n\n/// * normals: Normals at very point in the mesh of type CV_64FC3.\n\npub fn compute_normals(mesh: &crate::viz::Mesh, normals: &mut dyn core::ToOutputArray) -> Result<()> {\n\n\toutput_array_arg!(normals);\n\n\tunsafe { sys::cv_viz_computeNormals_const_MeshX_const__OutputArrayX(mesh.as_raw_Mesh(), normals.as_raw__OutputArray()) }.into_result()\n\n}\n\n\n","file_path":"bindings/rust/opencv_34/hub/viz.rs","rank":18,"score":342822.25974761206},{"content":"/// ////////////////////////////////////////////////////////////////////////////////////////////\n\n/// Computing normals for mesh\n\n/// ## Parameters\n\n/// * mesh: Input mesh.\n\n/// * normals: Normals at very point in the mesh of type CV_64FC3.\n\npub fn compute_normals(mesh: &crate::viz::Mesh, normals: &mut dyn core::ToOutputArray) -> Result<()> {\n\n\toutput_array_arg!(normals);\n\n\tunsafe { sys::cv_viz_computeNormals_const_MeshX_const__OutputArrayX(mesh.as_raw_Mesh(), normals.as_raw__OutputArray()) }.into_result()\n\n}\n\n\n","file_path":"bindings/rust/opencv_4/hub/viz.rs","rank":19,"score":342822.25974761206},{"content":"struct RefOrVoid<const void>{ typedef const void type; };\n\n\n\ntemplate<>\n","file_path":"headers/3.4/opencv2/core/cvstd.hpp","rank":20,"score":342442.1123118049},{"content":"struct RefOrVoid<const void>{ typedef const void type; };\n\n\n\ntemplate<>\n","file_path":"headers/3.2/opencv2/core/cvstd.hpp","rank":21,"score":342442.1123118049},{"content":"pub fn set_distance_type(distance_type: crate::flann::flann_distance_t, order: i32) -> Result<()> {\n\n\tunsafe { sys::cvflann_set_distance_type_flann_distance_t_int(distance_type, order) }.into_result()\n\n}\n\n\n","file_path":"src/opencv/hub/flann.rs","rank":22,"score":342346.11095574393},{"content":"pub fn get_available_targets(be: crate::dnn::Backend) -> Result<core::Vector::<crate::dnn::Target>> {\n\n\tunsafe { sys::cv_dnn_getAvailableTargets_Backend(be) }.into_result().map(|ptr| unsafe { core::Vector::<crate::dnn::Target>::from_raw(ptr) })\n\n}\n\n\n","file_path":"bindings/rust/opencv_4/hub/dnn.rs","rank":23,"score":341573.82323896023},{"content":"pub fn get_available_targets(be: crate::dnn::Backend) -> Result<core::Vector::<crate::dnn::Target>> {\n\n\tunsafe { sys::cv_dnn_getAvailableTargets_Backend(be) }.into_result().map(|ptr| unsafe { core::Vector::<crate::dnn::Target>::from_raw(ptr) })\n\n}\n\n\n","file_path":"bindings/rust/opencv_34/hub/dnn.rs","rank":24,"score":341573.82323896023},{"content":"/// Returns list of all available backends\n\npub fn get_backends() -> Result<core::Vector::<crate::videoio::VideoCaptureAPIs>> {\n\n\tunsafe { sys::cv_videoio_registry_getBackends() }.into_result().map(|ptr| unsafe { core::Vector::<crate::videoio::VideoCaptureAPIs>::from_raw(ptr) })\n\n}\n\n\n","file_path":"src/opencv/hub/videoio.rs","rank":25,"score":338588.3489260447},{"content":"/// Retrieves a window by its name.\n\n/// \n\n/// ## Parameters\n\n/// * window_name: Name of the window that is to be retrieved.\n\n/// \n\n/// This function returns a Viz3d object with the given name.\n\n/// \n\n/// \n\n/// Note: If the window with that name already exists, that window is returned. Otherwise, new window is\n\n/// created with the given name, and it is returned.\n\n/// \n\n/// \n\n/// Note: Window names are automatically prefixed by \"Viz - \" if it is not done by the user.\n\n/// ```ignore\n\n/// /// window and window_2 are the same windows.\n\n/// viz::Viz3d window = viz::getWindowByName(\"myWindow\");\n\n/// viz::Viz3d window_2 = viz::getWindowByName(\"Viz - myWindow\");\n\n/// ```\n\n/// \n\npub fn get_window_by_name(window_name: &str) -> Result<crate::viz::Viz3d> {\n\n\tstring_arg!(window_name);\n\n\tunsafe { sys::cv_viz_getWindowByName_const_StringX(window_name.as_ptr()) }.into_result().map(|ptr| unsafe { crate::viz::Viz3d::from_raw(ptr) })\n\n}\n\n\n","file_path":"src/opencv/hub/viz.rs","rank":26,"score":338587.6026167049},{"content":"pub fn set_distance_type(distance_type: crate::flann::flann_distance_t, order: i32) -> Result<()> {\n\n\tunsafe { sys::cvflann_set_distance_type_flann_distance_t_int(distance_type, order) }.into_result()\n\n}\n\n\n","file_path":"bindings/rust/opencv_32/hub/flann.rs","rank":27,"score":338339.2593646527},{"content":"pub fn set_distance_type(distance_type: crate::flann::flann_distance_t, order: i32) -> Result<()> {\n\n\tunsafe { sys::cvflann_set_distance_type_flann_distance_t_int(distance_type, order) }.into_result()\n\n}\n\n\n","file_path":"bindings/rust/opencv_4/hub/flann.rs","rank":28,"score":338339.2593646527},{"content":"pub fn set_distance_type(distance_type: crate::flann::flann_distance_t, order: i32) -> Result<()> {\n\n\tunsafe { sys::cvflann_set_distance_type_flann_distance_t_int(distance_type, order) }.into_result()\n\n}\n\n\n","file_path":"bindings/rust/opencv_34/hub/flann.rs","rank":29,"score":338339.2593646527},{"content":"struct ParamType<_Tp, typename std::enable_if< std::is_enum<_Tp>::value >::type>\n\n{\n\n typedef typename std::underlying_type<_Tp>::type const_param_type;\n\n typedef typename std::underlying_type<_Tp>::type member_type;\n\n\n\n static const Param type = Param::INT;\n\n};\n\n\n\n//! @} core_basic\n\n\n\n} //namespace cv\n\n\n\n#include \"opencv2/core/operations.hpp\"\n\n#include \"opencv2/core/cvstd.inl.hpp\"\n\n#include \"opencv2/core/utility.hpp\"\n\n#include \"opencv2/core/optim.hpp\"\n\n#include \"opencv2/core/ovx.hpp\"\n\n\n\n#endif /*OPENCV_CORE_HPP*/\n","file_path":"headers/4/opencv2/core.hpp","rank":30,"score":337611.5716482389},{"content":"/// Returns list of all builtin backends\n\npub fn get_backends() -> Result<core::Vector::<crate::videoio::VideoCaptureAPIs>> {\n\n\tunsafe { sys::cv_videoio_registry_getBackends() }.into_result().map(|ptr| unsafe { core::Vector::<crate::videoio::VideoCaptureAPIs>::from_raw(ptr) })\n\n}\n\n\n","file_path":"bindings/rust/opencv_34/hub/videoio.rs","rank":31,"score":334151.4315409174},{"content":"/// Returns list of all available backends\n\npub fn get_backends() -> Result<core::Vector::<crate::videoio::VideoCaptureAPIs>> {\n\n\tunsafe { sys::cv_videoio_registry_getBackends() }.into_result().map(|ptr| unsafe { core::Vector::<crate::videoio::VideoCaptureAPIs>::from_raw(ptr) })\n\n}\n\n\n","file_path":"bindings/rust/opencv_4/hub/videoio.rs","rank":32,"score":334151.4315409174},{"content":"/// Returns list of available backends which works via `cv::VideoWriter()`\n\npub fn get_writer_backends() -> Result<core::Vector::<crate::videoio::VideoCaptureAPIs>> {\n\n\tunsafe { sys::cv_videoio_registry_getWriterBackends() }.into_result().map(|ptr| unsafe { core::Vector::<crate::videoio::VideoCaptureAPIs>::from_raw(ptr) })\n\n}\n\n\n","file_path":"src/opencv/hub/videoio.rs","rank":33,"score":334151.1290005192},{"content":"/// Returns list of available backends which works via `cv::VideoCapture(filename)`\n\npub fn get_stream_backends() -> Result<core::Vector::<crate::videoio::VideoCaptureAPIs>> {\n\n\tunsafe { sys::cv_videoio_registry_getStreamBackends() }.into_result().map(|ptr| unsafe { core::Vector::<crate::videoio::VideoCaptureAPIs>::from_raw(ptr) })\n\n}\n\n\n","file_path":"src/opencv/hub/videoio.rs","rank":34,"score":334151.071269074},{"content":"/// Returns list of available backends which works via `cv::VideoCapture(int index)`\n\npub fn get_camera_backends() -> Result<core::Vector::<crate::videoio::VideoCaptureAPIs>> {\n\n\tunsafe { sys::cv_videoio_registry_getCameraBackends() }.into_result().map(|ptr| unsafe { core::Vector::<crate::videoio::VideoCaptureAPIs>::from_raw(ptr) })\n\n}\n\n\n","file_path":"src/opencv/hub/videoio.rs","rank":35,"score":334151.01441399904},{"content":"/// Retrieves a window by its name.\n\n/// \n\n/// ## Parameters\n\n/// * window_name: Name of the window that is to be retrieved.\n\n/// \n\n/// This function returns a Viz3d object with the given name.\n\n/// \n\n/// \n\n/// Note: If the window with that name already exists, that window is returned. Otherwise, new window is\n\n/// created with the given name, and it is returned.\n\n/// \n\n/// \n\n/// Note: Window names are automatically prefixed by \"Viz - \" if it is not done by the user.\n\n/// ```ignore\n\n/// /// window and window_2 are the same windows.\n\n/// viz::Viz3d window = viz::getWindowByName(\"myWindow\");\n\n/// viz::Viz3d window_2 = viz::getWindowByName(\"Viz - myWindow\");\n\n/// ```\n\n/// \n\npub fn get_window_by_name(window_name: &str) -> Result<crate::viz::Viz3d> {\n\n\tstring_arg!(window_name);\n\n\tunsafe { sys::cv_viz_getWindowByName_const_StringX(window_name.as_ptr()) }.into_result().map(|ptr| unsafe { crate::viz::Viz3d::from_raw(ptr) })\n\n}\n\n\n","file_path":"bindings/rust/opencv_34/hub/viz.rs","rank":36,"score":334150.6852315775},{"content":"/// Retrieves a window by its name.\n\n/// \n\n/// ## Parameters\n\n/// * window_name: Name of the window that is to be retrieved.\n\n/// \n\n/// This function returns a Viz3d object with the given name.\n\n/// \n\n/// \n\n/// Note: If the window with that name already exists, that window is returned. Otherwise, new window is\n\n/// created with the given name, and it is returned.\n\n/// \n\n/// \n\n/// Note: Window names are automatically prefixed by \"Viz - \" if it is not done by the user.\n\n/// ```ignore\n\n/// /// window and window_2 are the same windows.\n\n/// viz::Viz3d window = viz::getWindowByName(\"myWindow\");\n\n/// viz::Viz3d window_2 = viz::getWindowByName(\"Viz - myWindow\");\n\n/// ```\n\n/// \n\npub fn get_window_by_name(window_name: &str) -> Result<crate::viz::Viz3d> {\n\n\tstring_arg!(window_name);\n\n\tunsafe { sys::cv_viz_getWindowByName_const_StringX(window_name.as_ptr()) }.into_result().map(|ptr| unsafe { crate::viz::Viz3d::from_raw(ptr) })\n\n}\n\n\n","file_path":"bindings/rust/opencv_4/hub/viz.rs","rank":37,"score":334150.6852315775},{"content":"/// Returns backend API name or \"UnknownVideoAPI(xxx)\"\n\n/// ## Parameters\n\n/// * api: backend ID (#VideoCaptureAPIs)\n\npub fn get_backend_name(api: crate::videoio::VideoCaptureAPIs) -> Result<String> {\n\n\tunsafe { sys::cv_videoio_registry_getBackendName_VideoCaptureAPIs(api) }.into_result().map(|s| unsafe { crate::templ::receive_string(s as *mut String) })\n\n}\n\n\n","file_path":"src/opencv/hub/videoio.rs","rank":38,"score":334143.58054070093},{"content":"/// Returns one of the predefined dictionaries defined in PREDEFINED_DICTIONARY_NAME\n\npub fn get_predefined_dictionary(name: crate::aruco::PREDEFINED_DICTIONARY_NAME) -> Result<core::Ptr::<crate::aruco::Dictionary>> {\n\n\tunsafe { sys::cv_aruco_getPredefinedDictionary_PREDEFINED_DICTIONARY_NAME(name) }.into_result().map(|ptr| unsafe { core::Ptr::<crate::aruco::Dictionary>::from_raw(ptr) })\n\n}\n\n\n","file_path":"src/opencv/hub/aruco.rs","rank":39,"score":333987.38021911285},{"content":"/// extracts Channel of Interest from CvMat or IplImage and makes cv::Mat out of it.\n\n/// \n\n/// ## C++ default parameters\n\n/// * coi: -1\n\npub fn extract_image_coi(arr: *const c_void, coiimg: &mut dyn core::ToOutputArray, coi: i32) -> Result<()> {\n\n\toutput_array_arg!(coiimg);\n\n\tunsafe { sys::cv_extractImageCOI_const_CvArrX_const__OutputArrayX_int(arr, coiimg.as_raw__OutputArray(), coi) }.into_result()\n\n}\n\n\n","file_path":"bindings/rust/opencv_32/hub/core.rs","rank":40,"score":331046.38601711305},{"content":"/// extracts Channel of Interest from CvMat or IplImage and makes cv::Mat out of it.\n\n/// \n\n/// ## C++ default parameters\n\n/// * coi: -1\n\npub fn extract_image_coi(arr: *const c_void, coiimg: &mut dyn core::ToOutputArray, coi: i32) -> Result<()> {\n\n\toutput_array_arg!(coiimg);\n\n\tunsafe { sys::cv_extractImageCOI_const_CvArrX_const__OutputArrayX_int(arr, coiimg.as_raw__OutputArray(), coi) }.into_result()\n\n}\n\n\n","file_path":"bindings/rust/opencv_34/hub/core.rs","rank":41,"score":331046.3860171131},{"content":"/// Returns one of the predefined dictionaries defined in PREDEFINED_DICTIONARY_NAME\n\npub fn get_predefined_dictionary(name: crate::aruco::PREDEFINED_DICTIONARY_NAME) -> Result<core::Ptr::<crate::aruco::Dictionary>> {\n\n\tunsafe { sys::cv_aruco_getPredefinedDictionary_PREDEFINED_DICTIONARY_NAME(name) }.into_result().map(|ptr| unsafe { core::Ptr::<crate::aruco::Dictionary>::from_raw(ptr) })\n\n}\n\n\n","file_path":"bindings/rust/opencv_34/hub/aruco.rs","rank":42,"score":330401.05642774736},{"content":"/// Returns one of the predefined dictionaries defined in PREDEFINED_DICTIONARY_NAME\n\npub fn get_predefined_dictionary(name: crate::aruco::PREDEFINED_DICTIONARY_NAME) -> Result<core::Ptr::<crate::aruco::Dictionary>> {\n\n\tunsafe { sys::cv_aruco_getPredefinedDictionary_PREDEFINED_DICTIONARY_NAME(name) }.into_result().map(|ptr| unsafe { core::Ptr::<crate::aruco::Dictionary>::from_raw(ptr) })\n\n}\n\n\n","file_path":"bindings/rust/opencv_32/hub/aruco.rs","rank":43,"score":330401.05642774736},{"content":"/// Returns one of the predefined dictionaries defined in PREDEFINED_DICTIONARY_NAME\n\npub fn get_predefined_dictionary(name: crate::aruco::PREDEFINED_DICTIONARY_NAME) -> Result<core::Ptr::<crate::aruco::Dictionary>> {\n\n\tunsafe { sys::cv_aruco_getPredefinedDictionary_PREDEFINED_DICTIONARY_NAME(name) }.into_result().map(|ptr| unsafe { core::Ptr::<crate::aruco::Dictionary>::from_raw(ptr) })\n\n}\n\n\n","file_path":"bindings/rust/opencv_4/hub/aruco.rs","rank":44,"score":330401.05642774736},{"content":"/// Tries to make panorama more horizontal (or vertical).\n\n/// \n\n/// ## Parameters\n\n/// * rmats: Camera rotation matrices.\n\n/// * kind: Correction kind, see detail::WaveCorrectKind.\n\npub fn wave_correct(rmats: &mut core::Vector::<core::Mat>, kind: crate::stitching::Detail_WaveCorrectKind) -> Result<()> {\n\n\tunsafe { sys::cv_detail_waveCorrect_vector_Mat_X_WaveCorrectKind(rmats.as_raw_mut_VectorOfMat(), kind) }.into_result()\n\n}\n\n\n","file_path":"src/opencv/hub/stitching.rs","rank":45,"score":330331.41334474727},{"content":"/// Returns list of available backends which works via `cv::VideoWriter()`\n\npub fn get_writer_backends() -> Result<core::Vector::<crate::videoio::VideoCaptureAPIs>> {\n\n\tunsafe { sys::cv_videoio_registry_getWriterBackends() }.into_result().map(|ptr| unsafe { core::Vector::<crate::videoio::VideoCaptureAPIs>::from_raw(ptr) })\n\n}\n\n\n","file_path":"bindings/rust/opencv_34/hub/videoio.rs","rank":46,"score":329902.948324037},{"content":"/// Returns list of available backends which works via `cv::VideoWriter()`\n\npub fn get_writer_backends() -> Result<core::Vector::<crate::videoio::VideoCaptureAPIs>> {\n\n\tunsafe { sys::cv_videoio_registry_getWriterBackends() }.into_result().map(|ptr| unsafe { core::Vector::<crate::videoio::VideoCaptureAPIs>::from_raw(ptr) })\n\n}\n\n\n","file_path":"bindings/rust/opencv_4/hub/videoio.rs","rank":47,"score":329902.9483240371},{"content":"/// Returns list of available backends which works via `cv::VideoCapture(filename)`\n\npub fn get_stream_backends() -> Result<core::Vector::<crate::videoio::VideoCaptureAPIs>> {\n\n\tunsafe { sys::cv_videoio_registry_getStreamBackends() }.into_result().map(|ptr| unsafe { core::Vector::<crate::videoio::VideoCaptureAPIs>::from_raw(ptr) })\n\n}\n\n\n","file_path":"bindings/rust/opencv_34/hub/videoio.rs","rank":48,"score":329902.89059259184},{"content":"/// Returns list of available backends which works via `cv::VideoCapture(filename)`\n\npub fn get_stream_backends() -> Result<core::Vector::<crate::videoio::VideoCaptureAPIs>> {\n\n\tunsafe { sys::cv_videoio_registry_getStreamBackends() }.into_result().map(|ptr| unsafe { core::Vector::<crate::videoio::VideoCaptureAPIs>::from_raw(ptr) })\n\n}\n\n\n","file_path":"bindings/rust/opencv_4/hub/videoio.rs","rank":49,"score":329902.89059259184},{"content":"/// Returns list of available backends which works via `cv::VideoCapture(int index)`\n\npub fn get_camera_backends() -> Result<core::Vector::<crate::videoio::VideoCaptureAPIs>> {\n\n\tunsafe { sys::cv_videoio_registry_getCameraBackends() }.into_result().map(|ptr| unsafe { core::Vector::<crate::videoio::VideoCaptureAPIs>::from_raw(ptr) })\n\n}\n\n\n","file_path":"bindings/rust/opencv_34/hub/videoio.rs","rank":50,"score":329902.83373751683},{"content":"/// Returns list of available backends which works via `cv::VideoCapture(int index)`\n\npub fn get_camera_backends() -> Result<core::Vector::<crate::videoio::VideoCaptureAPIs>> {\n\n\tunsafe { sys::cv_videoio_registry_getCameraBackends() }.into_result().map(|ptr| unsafe { core::Vector::<crate::videoio::VideoCaptureAPIs>::from_raw(ptr) })\n\n}\n\n\n","file_path":"bindings/rust/opencv_4/hub/videoio.rs","rank":51,"score":329902.8337375169},{"content":"/// Returns backend API name or \"UnknownVideoAPI(xxx)\"\n\n/// ## Parameters\n\n/// * api: backend ID (#VideoCaptureAPIs)\n\npub fn get_backend_name(api: crate::videoio::VideoCaptureAPIs) -> Result<String> {\n\n\tunsafe { sys::cv_videoio_registry_getBackendName_VideoCaptureAPIs(api) }.into_result().map(|s| unsafe { crate::templ::receive_string(s as *mut String) })\n\n}\n\n\n","file_path":"bindings/rust/opencv_4/hub/videoio.rs","rank":52,"score":329895.3998642188},{"content":"/// Returns backend API name or \"unknown\"\n\n/// ## Parameters\n\n/// * api: backend ID (#VideoCaptureAPIs)\n\npub fn get_backend_name(api: crate::videoio::VideoCaptureAPIs) -> Result<String> {\n\n\tunsafe { sys::cv_videoio_registry_getBackendName_VideoCaptureAPIs(api) }.into_result().map(|s| unsafe { crate::templ::receive_string(s as *mut String) })\n\n}\n\n\n","file_path":"bindings/rust/opencv_34/hub/videoio.rs","rank":53,"score":329895.3998642187},{"content":"pub fn find_max_spanning_tree(num_images: i32, pairwise_matches: &core::Vector::<crate::stitching::Detail_MatchesInfo>, span_tree: &mut crate::stitching::Detail_Graph, centers: &mut core::Vector::<i32>) -> Result<()> {\n\n\tunsafe { sys::cv_detail_findMaxSpanningTree_int_const_vector_MatchesInfo_X_GraphX_vector_int_X(num_images, pairwise_matches.as_raw_VectorOfDetail_MatchesInfo(), span_tree.as_raw_mut_Detail_Graph(), centers.as_raw_mut_VectorOfi32()) }.into_result()\n\n}\n\n\n","file_path":"src/opencv/hub/stitching.rs","rank":54,"score":328698.60302064446},{"content":"/// Tries to make panorama more horizontal (or vertical).\n\n/// \n\n/// ## Parameters\n\n/// * rmats: Camera rotation matrices.\n\n/// * kind: Correction kind, see detail::WaveCorrectKind.\n\npub fn wave_correct(rmats: &mut core::Vector::<core::Mat>, kind: crate::stitching::Detail_WaveCorrectKind) -> Result<()> {\n\n\tunsafe { sys::cv_detail_waveCorrect_vector_Mat_X_WaveCorrectKind(rmats.as_raw_mut_VectorOfMat(), kind) }.into_result()\n\n}\n\n\n","file_path":"bindings/rust/opencv_32/hub/stitching.rs","rank":55,"score":326870.9589527078},{"content":"/// Tries to make panorama more horizontal (or vertical).\n\n/// \n\n/// ## Parameters\n\n/// * rmats: Camera rotation matrices.\n\n/// * kind: Correction kind, see detail::WaveCorrectKind.\n\npub fn wave_correct(rmats: &mut core::Vector::<core::Mat>, kind: crate::stitching::Detail_WaveCorrectKind) -> Result<()> {\n\n\tunsafe { sys::cv_detail_waveCorrect_vector_Mat_X_WaveCorrectKind(rmats.as_raw_mut_VectorOfMat(), kind) }.into_result()\n\n}\n\n\n","file_path":"bindings/rust/opencv_4/hub/stitching.rs","rank":56,"score":326870.9589527078},{"content":"/// Tries to make panorama more horizontal (or vertical).\n\n/// \n\n/// ## Parameters\n\n/// * rmats: Camera rotation matrices.\n\n/// * kind: Correction kind, see detail::WaveCorrectKind.\n\npub fn wave_correct(rmats: &mut core::Vector::<core::Mat>, kind: crate::stitching::Detail_WaveCorrectKind) -> Result<()> {\n\n\tunsafe { sys::cv_detail_waveCorrect_vector_Mat_X_WaveCorrectKind(rmats.as_raw_mut_VectorOfMat(), kind) }.into_result()\n\n}\n\n\n","file_path":"bindings/rust/opencv_34/hub/stitching.rs","rank":57,"score":326870.9589527078},{"content":"pub fn find_max_spanning_tree(num_images: i32, pairwise_matches: &core::Vector::<crate::stitching::Detail_MatchesInfo>, span_tree: &mut crate::stitching::Detail_Graph, centers: &mut core::Vector::<i32>) -> Result<()> {\n\n\tunsafe { sys::cv_detail_findMaxSpanningTree_int_const_vector_MatchesInfo_X_GraphX_vector_int_X(num_images, pairwise_matches.as_raw_VectorOfDetail_MatchesInfo(), span_tree.as_raw_mut_Detail_Graph(), centers.as_raw_mut_VectorOfi32()) }.into_result()\n\n}\n\n\n","file_path":"bindings/rust/opencv_32/hub/stitching.rs","rank":58,"score":326355.32681065635},{"content":"pub fn find_max_spanning_tree(num_images: i32, pairwise_matches: &core::Vector::<crate::stitching::Detail_MatchesInfo>, span_tree: &mut crate::stitching::Detail_Graph, centers: &mut core::Vector::<i32>) -> Result<()> {\n\n\tunsafe { sys::cv_detail_findMaxSpanningTree_int_const_vector_MatchesInfo_X_GraphX_vector_int_X(num_images, pairwise_matches.as_raw_VectorOfDetail_MatchesInfo(), span_tree.as_raw_mut_Detail_Graph(), centers.as_raw_mut_VectorOfi32()) }.into_result()\n\n}\n\n\n","file_path":"bindings/rust/opencv_34/hub/stitching.rs","rank":59,"score":326355.32681065635},{"content":"pub fn find_max_spanning_tree(num_images: i32, pairwise_matches: &core::Vector::<crate::stitching::Detail_MatchesInfo>, span_tree: &mut crate::stitching::Detail_Graph, centers: &mut core::Vector::<i32>) -> Result<()> {\n\n\tunsafe { sys::cv_detail_findMaxSpanningTree_int_const_vector_MatchesInfo_X_GraphX_vector_int_X(num_images, pairwise_matches.as_raw_VectorOfDetail_MatchesInfo(), span_tree.as_raw_mut_Detail_Graph(), centers.as_raw_mut_VectorOfi32()) }.into_result()\n\n}\n\n\n","file_path":"bindings/rust/opencv_4/hub/stitching.rs","rank":60,"score":326355.32681065635},{"content":"#[cfg(not(target_os = \"windows\"))]\n\npub fn get_impl(impl_: &mut core::Vector::<i32>, fun_name: &mut core::Vector::<String>) -> Result<i32> {\n\n\tunsafe { sys::cv_getImpl_vector_int_X_vector_String_X(impl_.as_raw_mut_VectorOfi32(), fun_name.as_raw_mut_VectorOfString()) }.into_result()\n\n}\n\n\n","file_path":"src/opencv/hub/core.rs","rank":61,"score":326321.8278127527},{"content":"pub fn leave_biggest_component(features: &mut core::Vector::<crate::stitching::Detail_ImageFeatures>, pairwise_matches: &mut core::Vector::<crate::stitching::Detail_MatchesInfo>, conf_threshold: f32) -> Result<core::Vector::<i32>> {\n\n\tunsafe { sys::cv_detail_leaveBiggestComponent_vector_ImageFeatures_X_vector_MatchesInfo_X_float(features.as_raw_mut_VectorOfDetail_ImageFeatures(), pairwise_matches.as_raw_mut_VectorOfDetail_MatchesInfo(), conf_threshold) }.into_result().map(|ptr| unsafe { core::Vector::<i32>::from_raw(ptr) })\n\n}\n\n\n","file_path":"src/opencv/hub/stitching.rs","rank":62,"score":325449.16985929105},{"content":"struct RefOrVoid<const volatile void>{ typedef const volatile void type; };\n\n\n","file_path":"headers/3.4/opencv2/core/cvstd.hpp","rank":63,"score":324607.13550913415},{"content":"struct RefOrVoid<const volatile void>{ typedef const volatile void type; };\n\n\n","file_path":"headers/3.2/opencv2/core/cvstd.hpp","rank":64,"score":324607.13550913415},{"content":"pub fn get_platfoms_info(platform_info: &mut core::Vector::<core::PlatformInfo>) -> Result<()> {\n\n\tunsafe { sys::cv_ocl_getPlatfomsInfo_vector_PlatformInfo_X(platform_info.as_raw_mut_VectorOfPlatformInfo()) }.into_result()\n\n}\n\n\n","file_path":"src/opencv/hub/core.rs","rank":65,"score":324580.5006951},{"content":"/// Returns Inference Engine VPU type.\n\n/// \n\n/// See values of `CV_DNN_INFERENCE_ENGINE_VPU_TYPE_*` macros.\n\npub fn get_inference_engine_vpu_type() -> Result<String> {\n\n\tunsafe { sys::cv_dnn_getInferenceEngineVPUType() }.into_result().map(|s| unsafe { crate::templ::receive_string(s as *mut String) })\n\n}\n\n\n","file_path":"src/opencv/hub/dnn.rs","rank":66,"score":323583.1833192666},{"content":"/// Returns Inference Engine internal backend API.\n\n/// \n\n/// See values of `CV_DNN_BACKEND_INFERENCE_ENGINE_*` macros.\n\n/// \n\n/// Default value is controlled through `OPENCV_DNN_BACKEND_INFERENCE_ENGINE_TYPE` runtime parameter (environment variable).\n\npub fn get_inference_engine_backend_type() -> Result<String> {\n\n\tunsafe { sys::cv_dnn_getInferenceEngineBackendType() }.into_result().map(|s| unsafe { crate::templ::receive_string(s as *mut String) })\n\n}\n\n\n","file_path":"src/opencv/hub/dnn.rs","rank":67,"score":323581.22477518197},{"content":"pub fn leave_biggest_component(features: &mut core::Vector::<crate::stitching::Detail_ImageFeatures>, pairwise_matches: &mut core::Vector::<crate::stitching::Detail_MatchesInfo>, conf_threshold: f32) -> Result<core::Vector::<i32>> {\n\n\tunsafe { sys::cv_detail_leaveBiggestComponent_vector_ImageFeatures_X_vector_MatchesInfo_X_float(features.as_raw_mut_VectorOfDetail_ImageFeatures(), pairwise_matches.as_raw_mut_VectorOfDetail_MatchesInfo(), conf_threshold) }.into_result().map(|ptr| unsafe { core::Vector::<i32>::from_raw(ptr) })\n\n}\n\n\n","file_path":"bindings/rust/opencv_32/hub/stitching.rs","rank":68,"score":323105.893649303},{"content":"pub fn leave_biggest_component(features: &mut core::Vector::<crate::stitching::Detail_ImageFeatures>, pairwise_matches: &mut core::Vector::<crate::stitching::Detail_MatchesInfo>, conf_threshold: f32) -> Result<core::Vector::<i32>> {\n\n\tunsafe { sys::cv_detail_leaveBiggestComponent_vector_ImageFeatures_X_vector_MatchesInfo_X_float(features.as_raw_mut_VectorOfDetail_ImageFeatures(), pairwise_matches.as_raw_mut_VectorOfDetail_MatchesInfo(), conf_threshold) }.into_result().map(|ptr| unsafe { core::Vector::<i32>::from_raw(ptr) })\n\n}\n\n\n","file_path":"bindings/rust/opencv_34/hub/stitching.rs","rank":69,"score":323105.893649303},{"content":"pub fn leave_biggest_component(features: &mut core::Vector::<crate::stitching::Detail_ImageFeatures>, pairwise_matches: &mut core::Vector::<crate::stitching::Detail_MatchesInfo>, conf_threshold: f32) -> Result<core::Vector::<i32>> {\n\n\tunsafe { sys::cv_detail_leaveBiggestComponent_vector_ImageFeatures_X_vector_MatchesInfo_X_float(features.as_raw_mut_VectorOfDetail_ImageFeatures(), pairwise_matches.as_raw_mut_VectorOfDetail_MatchesInfo(), conf_threshold) }.into_result().map(|ptr| unsafe { core::Vector::<i32>::from_raw(ptr) })\n\n}\n\n\n","file_path":"bindings/rust/opencv_4/hub/stitching.rs","rank":70,"score":323105.893649303},{"content":"/// A utility to load list of paths to training image and annotation file.\n\n/// ## Parameters\n\n/// * imageList: The specified file contains paths to the training images.\n\n/// * annotationList: The specified file contains paths to the training annotations.\n\n/// * images: The loaded paths of training images.\n\n/// * annotations: The loaded paths of annotation files.\n\n/// \n\n/// Example of usage:\n\n/// ```ignore\n\n/// String imageFiles = \"images_path.txt\";\n\n/// String ptsFiles = \"annotations_path.txt\";\n\n/// std::vector<String> images_train;\n\n/// std::vector<String> landmarks_train;\n\n/// loadDatasetList(imageFiles,ptsFiles,images_train,landmarks_train);\n\n/// ```\n\n/// \n\npub fn load_dataset_list(image_list: &str, annotation_list: &str, images: &mut core::Vector::<String>, annotations: &mut core::Vector::<String>) -> Result<bool> {\n\n\tstring_arg!(image_list);\n\n\tstring_arg!(annotation_list);\n\n\tunsafe { sys::cv_face_loadDatasetList_String_String_vector_String_X_vector_String_X(image_list.as_ptr() as _, annotation_list.as_ptr() as _, images.as_raw_mut_VectorOfString(), annotations.as_raw_mut_VectorOfString()) }.into_result()\n\n}\n\n\n","file_path":"src/opencv/hub/face.rs","rank":71,"score":322783.50747706543},{"content":"#[cfg(not(target_os = \"windows\"))]\n\npub fn get_impl(impl_: &mut core::Vector::<i32>, fun_name: &mut core::Vector::<String>) -> Result<i32> {\n\n\tunsafe { sys::cv_getImpl_vector_int_X_vector_String_X(impl_.as_raw_mut_VectorOfi32(), fun_name.as_raw_mut_VectorOfString()) }.into_result()\n\n}\n\n\n","file_path":"bindings/rust/opencv_32/hub/core.rs","rank":72,"score":322736.1618639411},{"content":"#[cfg(not(target_os = \"windows\"))]\n\npub fn get_impl(impl_: &mut core::Vector::<i32>, fun_name: &mut core::Vector::<String>) -> Result<i32> {\n\n\tunsafe { sys::cv_getImpl_vector_int_X_vector_String_X(impl_.as_raw_mut_VectorOfi32(), fun_name.as_raw_mut_VectorOfString()) }.into_result()\n\n}\n\n\n","file_path":"bindings/rust/opencv_34/hub/core.rs","rank":73,"score":322736.1618639411},{"content":"#[cfg(not(target_os = \"windows\"))]\n\npub fn get_impl(impl_: &mut core::Vector::<i32>, fun_name: &mut core::Vector::<String>) -> Result<i32> {\n\n\tunsafe { sys::cv_getImpl_vector_int_X_vector_String_X(impl_.as_raw_mut_VectorOfi32(), fun_name.as_raw_mut_VectorOfString()) }.into_result()\n\n}\n\n\n","file_path":"bindings/rust/opencv_4/hub/core.rs","rank":74,"score":322736.1618639411},{"content":"#[test]\n\nfn vec() -> Result<()> {\n\n let mut m = Mat::new_rows_cols_with_default(10, 10, Vec3b::typ(), Scalar::default())?;\n\n let mut ps = types::VectorOfMat::new();\n\n assert_eq!(ps.len(), 0);\n\n let mut p1 = unsafe { Mat::new_rows_cols(3, 2, i32::typ()) }?;\n\n p1.at_row_mut::<i32>(0)?.copy_from_slice(&[0, 0]);\n\n p1.at_row_mut::<i32>(1)?.copy_from_slice(&[0, 9]);\n\n p1.at_row_mut::<i32>(2)?.copy_from_slice(&[9, 9]);\n\n ps.push(p1);\n\n assert_eq!(ps.len(), 1);\n\n #[cfg(not(feature = \"opencv-4\"))]\n\n use self::core::LINE_8;\n\n #[cfg(feature = \"opencv-4\")]\n\n use self::imgproc::LINE_8;\n\n imgproc::fill_poly(&mut m, &ps, Scalar::new(127., 127., 127., 0.), LINE_8, 0, Point::default())?;\n\n assert_eq!(*m.at_2d::<Vec3b>(0, 0)?, Vec3b::from([127, 127, 127]));\n\n assert_eq!(*m.at_2d::<Vec3b>(0, 9)?, Vec3b::default());\n\n assert_eq!(*m.at_2d::<Vec3b>(9, 9)?, Vec3b::from([127, 127, 127]));\n\n Ok(())\n\n}\n\n\n","file_path":"tests/types.rs","rank":75,"score":322427.41556475917},{"content":"/// ///////////////////////////////////////////////////////////////////////////\n\npub fn matches_graph_as_string(pathes: &mut core::Vector::<String>, pairwise_matches: &mut core::Vector::<crate::stitching::Detail_MatchesInfo>, conf_threshold: f32) -> Result<String> {\n\n\tunsafe { sys::cv_detail_matchesGraphAsString_vector_String_X_vector_MatchesInfo_X_float(pathes.as_raw_mut_VectorOfString(), pairwise_matches.as_raw_mut_VectorOfDetail_MatchesInfo(), conf_threshold) }.into_result().map(|s| unsafe { crate::templ::receive_string(s as *mut String) })\n\n}\n\n\n","file_path":"src/opencv/hub/stitching.rs","rank":76,"score":321064.8729559347},{"content":"pub fn create_frame_source_empty() -> Result<core::Ptr::<dyn crate::superres::Superres_FrameSource>> {\n\n\tunsafe { sys::cv_superres_createFrameSource_Empty() }.into_result().map(|ptr| unsafe { core::Ptr::<dyn crate::superres::Superres_FrameSource>::from_raw(ptr) })\n\n}\n\n\n","file_path":"src/opencv/hub/superres.rs","rank":77,"score":320728.92648750177},{"content":"pub fn get_platfoms_info(platform_info: &mut core::Vector::<core::PlatformInfo>) -> Result<()> {\n\n\tunsafe { sys::cv_ocl_getPlatfomsInfo_vector_PlatformInfo_X(platform_info.as_raw_mut_VectorOfPlatformInfo()) }.into_result()\n\n}\n\n\n","file_path":"bindings/rust/opencv_4/hub/core.rs","rank":78,"score":320510.0215410307},{"content":"pub fn get_platfoms_info(platform_info: &mut core::Vector::<core::PlatformInfo>) -> Result<()> {\n\n\tunsafe { sys::cv_ocl_getPlatfomsInfo_vector_PlatformInfo_X(platform_info.as_raw_mut_VectorOfPlatformInfo()) }.into_result()\n\n}\n\n\n","file_path":"bindings/rust/opencv_34/hub/core.rs","rank":79,"score":320510.02154103067},{"content":"pub fn get_platfoms_info(platform_info: &mut core::Vector::<core::PlatformInfo>) -> Result<()> {\n\n\tunsafe { sys::cv_ocl_getPlatfomsInfo_vector_PlatformInfo_X(platform_info.as_raw_mut_VectorOfPlatformInfo()) }.into_result()\n\n}\n\n\n","file_path":"bindings/rust/opencv_32/hub/core.rs","rank":80,"score":320510.0215410307},{"content":"#[deprecated = \"use Stitcher::create\"]\n\npub fn create_stitcher(try_use_gpu: bool) -> Result<core::Ptr::<crate::stitching::Stitcher>> {\n\n\tunsafe { sys::cv_createStitcher_bool(try_use_gpu) }.into_result().map(|ptr| unsafe { core::Ptr::<crate::stitching::Stitcher>::from_raw(ptr) })\n\n}\n\n\n","file_path":"src/opencv/hub/stitching.rs","rank":81,"score":320052.95334232226},{"content":"/// Returns one of the predefined dictionaries referenced by DICT_*.\n\npub fn get_predefined_dictionary_i32(dict: i32) -> Result<core::Ptr::<crate::aruco::Dictionary>> {\n\n\tunsafe { sys::cv_aruco_getPredefinedDictionary_int(dict) }.into_result().map(|ptr| unsafe { core::Ptr::<crate::aruco::Dictionary>::from_raw(ptr) })\n\n}\n\n\n","file_path":"src/opencv/hub/aruco.rs","rank":82,"score":320031.29225224245},{"content":"/// A utility to load list of paths to training image and annotation file.\n\n/// ## Parameters\n\n/// * imageList: The specified file contains paths to the training images.\n\n/// * annotationList: The specified file contains paths to the training annotations.\n\n/// * images: The loaded paths of training images.\n\n/// * annotations: The loaded paths of annotation files.\n\n/// \n\n/// Example of usage:\n\n/// ```ignore\n\n/// String imageFiles = \"images_path.txt\";\n\n/// String ptsFiles = \"annotations_path.txt\";\n\n/// std::vector<String> images_train;\n\n/// std::vector<String> landmarks_train;\n\n/// loadDatasetList(imageFiles,ptsFiles,images_train,landmarks_train);\n\n/// ```\n\n/// \n\npub fn load_dataset_list(image_list: &str, annotation_list: &str, images: &mut core::Vector::<String>, annotations: &mut core::Vector::<String>) -> Result<bool> {\n\n\tstring_arg!(image_list);\n\n\tstring_arg!(annotation_list);\n\n\tunsafe { sys::cv_face_loadDatasetList_String_String_vector_String_X_vector_String_X(image_list.as_ptr() as _, annotation_list.as_ptr() as _, images.as_raw_mut_VectorOfString(), annotations.as_raw_mut_VectorOfString()) }.into_result()\n\n}\n\n\n","file_path":"bindings/rust/opencv_34/hub/face.rs","rank":83,"score":319896.20690517896},{"content":"/// A utility to load list of paths to training image and annotation file.\n\n/// ## Parameters\n\n/// * imageList: The specified file contains paths to the training images.\n\n/// * annotationList: The specified file contains paths to the training annotations.\n\n/// * images: The loaded paths of training images.\n\n/// * annotations: The loaded paths of annotation files.\n\n/// \n\n/// Example of usage:\n\n/// ```ignore\n\n/// String imageFiles = \"images_path.txt\";\n\n/// String ptsFiles = \"annotations_path.txt\";\n\n/// std::vector<String> images_train;\n\n/// std::vector<String> landmarks_train;\n\n/// loadDatasetList(imageFiles,ptsFiles,images_train,landmarks_train);\n\n/// ```\n\n/// \n\npub fn load_dataset_list(image_list: &str, annotation_list: &str, images: &mut core::Vector::<String>, annotations: &mut core::Vector::<String>) -> Result<bool> {\n\n\tstring_arg!(image_list);\n\n\tstring_arg!(annotation_list);\n\n\tunsafe { sys::cv_face_loadDatasetList_String_String_vector_String_X_vector_String_X(image_list.as_ptr() as _, annotation_list.as_ptr() as _, images.as_raw_mut_VectorOfString(), annotations.as_raw_mut_VectorOfString()) }.into_result()\n\n}\n\n\n","file_path":"bindings/rust/opencv_4/hub/face.rs","rank":84,"score":319896.20690517896},{"content":"/// Detects corners using the FAST algorithm\n\n/// \n\n/// ## Parameters\n\n/// * image: grayscale image where keypoints (corners) are detected.\n\n/// * keypoints: keypoints detected on the image.\n\n/// * threshold: threshold on difference between intensity of the central pixel and pixels of a\n\n/// circle around this pixel.\n\n/// * nonmaxSuppression: if true, non-maximum suppression is applied to detected corners\n\n/// (keypoints).\n\n/// * type: one of the three neighborhoods as defined in the paper:\n\n/// FastFeatureDetector::TYPE_9_16, FastFeatureDetector::TYPE_7_12,\n\n/// FastFeatureDetector::TYPE_5_8\n\n/// \n\n/// Detects corners using the FAST algorithm by [Rosten06](https://docs.opencv.org/4.3.0/d0/de3/citelist.html#CITEREF_Rosten06) .\n\n/// \n\n/// \n\n/// Note: In Python API, types are given as cv.FAST_FEATURE_DETECTOR_TYPE_5_8,\n\n/// cv.FAST_FEATURE_DETECTOR_TYPE_7_12 and cv.FAST_FEATURE_DETECTOR_TYPE_9_16. For corner\n\n/// detection, use cv.FAST.detect() method.\n\npub fn FAST_with_type(image: &dyn core::ToInputArray, keypoints: &mut core::Vector::<core::KeyPoint>, threshold: i32, nonmax_suppression: bool, typ: crate::features2d::FastFeatureDetector_DetectorType) -> Result<()> {\n\n\tinput_array_arg!(image);\n\n\tunsafe { sys::cv_FAST_const__InputArrayX_vector_KeyPoint_X_int_bool_DetectorType(image.as_raw__InputArray(), keypoints.as_raw_mut_VectorOfKeyPoint(), threshold, nonmax_suppression, typ) }.into_result()\n\n}\n\n\n","file_path":"src/opencv/hub/features2d.rs","rank":85,"score":318709.3566708168},{"content":"/// Detects corners using the AGAST algorithm\n\n/// \n\n/// ## Parameters\n\n/// * image: grayscale image where keypoints (corners) are detected.\n\n/// * keypoints: keypoints detected on the image.\n\n/// * threshold: threshold on difference between intensity of the central pixel and pixels of a\n\n/// circle around this pixel.\n\n/// * nonmaxSuppression: if true, non-maximum suppression is applied to detected corners\n\n/// (keypoints).\n\n/// * type: one of the four neighborhoods as defined in the paper:\n\n/// AgastFeatureDetector::AGAST_5_8, AgastFeatureDetector::AGAST_7_12d,\n\n/// AgastFeatureDetector::AGAST_7_12s, AgastFeatureDetector::OAST_9_16\n\n/// \n\n/// For non-Intel platforms, there is a tree optimised variant of AGAST with same numerical results.\n\n/// The 32-bit binary tree tables were generated automatically from original code using perl script.\n\n/// The perl script and examples of tree generation are placed in features2d/doc folder.\n\n/// Detects corners using the AGAST algorithm by [mair2010_agast](https://docs.opencv.org/4.3.0/d0/de3/citelist.html#CITEREF_mair2010_agast) .\n\npub fn AGAST_with_type(image: &dyn core::ToInputArray, keypoints: &mut core::Vector::<core::KeyPoint>, threshold: i32, nonmax_suppression: bool, typ: crate::features2d::AgastFeatureDetector_DetectorType) -> Result<()> {\n\n\tinput_array_arg!(image);\n\n\tunsafe { sys::cv_AGAST_const__InputArrayX_vector_KeyPoint_X_int_bool_DetectorType(image.as_raw__InputArray(), keypoints.as_raw_mut_VectorOfKeyPoint(), threshold, nonmax_suppression, typ) }.into_result()\n\n}\n\n\n","file_path":"src/opencv/hub/features2d.rs","rank":86,"score":318704.5714937166},{"content":"/// Returns Inference Engine VPU type.\n\n/// \n\n/// See values of `CV_DNN_INFERENCE_ENGINE_VPU_TYPE_*` macros.\n\npub fn get_inference_engine_vpu_type() -> Result<String> {\n\n\tunsafe { sys::cv_dnn_getInferenceEngineVPUType() }.into_result().map(|s| unsafe { crate::templ::receive_string(s as *mut String) })\n\n}\n\n\n","file_path":"bindings/rust/opencv_34/hub/dnn.rs","rank":87,"score":318507.2066226825},{"content":"/// Returns Inference Engine VPU type.\n\n/// \n\n/// See values of `CV_DNN_INFERENCE_ENGINE_VPU_TYPE_*` macros.\n\npub fn get_inference_engine_vpu_type() -> Result<String> {\n\n\tunsafe { sys::cv_dnn_getInferenceEngineVPUType() }.into_result().map(|s| unsafe { crate::templ::receive_string(s as *mut String) })\n\n}\n\n\n","file_path":"bindings/rust/opencv_4/hub/dnn.rs","rank":88,"score":318507.2066226825},{"content":"/// Returns Inference Engine internal backend API.\n\n/// \n\n/// See values of `CV_DNN_BACKEND_INFERENCE_ENGINE_*` macros.\n\n/// \n\n/// Default value is controlled through `OPENCV_DNN_BACKEND_INFERENCE_ENGINE_TYPE` runtime parameter (environment variable).\n\npub fn get_inference_engine_backend_type() -> Result<String> {\n\n\tunsafe { sys::cv_dnn_getInferenceEngineBackendType() }.into_result().map(|s| unsafe { crate::templ::receive_string(s as *mut String) })\n\n}\n\n\n","file_path":"bindings/rust/opencv_34/hub/dnn.rs","rank":89,"score":318505.2480785978},{"content":"/// Returns Inference Engine internal backend API.\n\n/// \n\n/// See values of `CV_DNN_BACKEND_INFERENCE_ENGINE_*` macros.\n\n/// \n\n/// Default value is controlled through `OPENCV_DNN_BACKEND_INFERENCE_ENGINE_TYPE` runtime parameter (environment variable).\n\npub fn get_inference_engine_backend_type() -> Result<String> {\n\n\tunsafe { sys::cv_dnn_getInferenceEngineBackendType() }.into_result().map(|s| unsafe { crate::templ::receive_string(s as *mut String) })\n\n}\n\n\n","file_path":"bindings/rust/opencv_4/hub/dnn.rs","rank":90,"score":318505.2480785978},{"content":"/// ///////////////////////////////////////////////////////////////////////////\n\npub fn matches_graph_as_string(pathes: &mut core::Vector::<String>, pairwise_matches: &mut core::Vector::<crate::stitching::Detail_MatchesInfo>, conf_threshold: f32) -> Result<String> {\n\n\tunsafe { sys::cv_detail_matchesGraphAsString_vector_String_X_vector_MatchesInfo_X_float(pathes.as_raw_mut_VectorOfString(), pairwise_matches.as_raw_mut_VectorOfDetail_MatchesInfo(), conf_threshold) }.into_result().map(|s| unsafe { crate::templ::receive_string(s as *mut String) })\n\n}\n\n\n","file_path":"bindings/rust/opencv_34/hub/stitching.rs","rank":91,"score":318337.0085526083},{"content":"/// ///////////////////////////////////////////////////////////////////////////\n\npub fn matches_graph_as_string(pathes: &mut core::Vector::<String>, pairwise_matches: &mut core::Vector::<crate::stitching::Detail_MatchesInfo>, conf_threshold: f32) -> Result<String> {\n\n\tunsafe { sys::cv_detail_matchesGraphAsString_vector_String_X_vector_MatchesInfo_X_float(pathes.as_raw_mut_VectorOfString(), pairwise_matches.as_raw_mut_VectorOfDetail_MatchesInfo(), conf_threshold) }.into_result().map(|s| unsafe { crate::templ::receive_string(s as *mut String) })\n\n}\n\n\n","file_path":"bindings/rust/opencv_4/hub/stitching.rs","rank":92,"score":318337.00855260843},{"content":"/// ///////////////////////////////////////////////////////////////////////////\n\npub fn matches_graph_as_string(pathes: &mut core::Vector::<String>, pairwise_matches: &mut core::Vector::<crate::stitching::Detail_MatchesInfo>, conf_threshold: f32) -> Result<String> {\n\n\tunsafe { sys::cv_detail_matchesGraphAsString_vector_String_X_vector_MatchesInfo_X_float(pathes.as_raw_mut_VectorOfString(), pairwise_matches.as_raw_mut_VectorOfDetail_MatchesInfo(), conf_threshold) }.into_result().map(|s| unsafe { crate::templ::receive_string(s as *mut String) })\n\n}\n\n\n","file_path":"bindings/rust/opencv_32/hub/stitching.rs","rank":93,"score":318337.0085526083},{"content":"pub fn create_frame_source_empty() -> Result<core::Ptr::<dyn crate::superres::Superres_FrameSource>> {\n\n\tunsafe { sys::cv_superres_createFrameSource_Empty() }.into_result().map(|ptr| unsafe { core::Ptr::<dyn crate::superres::Superres_FrameSource>::from_raw(ptr) })\n\n}\n\n\n","file_path":"bindings/rust/opencv_34/hub/superres.rs","rank":94,"score":316823.30215462006},{"content":"pub fn create_frame_source_empty() -> Result<core::Ptr::<dyn crate::superres::Superres_FrameSource>> {\n\n\tunsafe { sys::cv_superres_createFrameSource_Empty() }.into_result().map(|ptr| unsafe { core::Ptr::<dyn crate::superres::Superres_FrameSource>::from_raw(ptr) })\n\n}\n\n\n","file_path":"bindings/rust/opencv_32/hub/superres.rs","rank":95,"score":316823.30215462006},{"content":"pub fn create_frame_source_empty() -> Result<core::Ptr::<dyn crate::superres::Superres_FrameSource>> {\n\n\tunsafe { sys::cv_superres_createFrameSource_Empty() }.into_result().map(|ptr| unsafe { core::Ptr::<dyn crate::superres::Superres_FrameSource>::from_raw(ptr) })\n\n}\n\n\n","file_path":"bindings/rust/opencv_4/hub/superres.rs","rank":96,"score":316823.30215462006},{"content":"#[deprecated = \"use Stitcher::create\"]\n\npub fn create_stitcher(try_use_gpu: bool) -> Result<core::Ptr::<crate::stitching::Stitcher>> {\n\n\tunsafe { sys::cv_createStitcher_bool(try_use_gpu) }.into_result().map(|ptr| unsafe { core::Ptr::<crate::stitching::Stitcher>::from_raw(ptr) })\n\n}\n\n\n","file_path":"bindings/rust/opencv_4/hub/stitching.rs","rank":97,"score":315981.4261271474},{"content":"#[deprecated = \"use Stitcher::create\"]\n\npub fn create_stitcher_scans(try_use_gpu: bool) -> Result<core::Ptr::<crate::stitching::Stitcher>> {\n\n\tunsafe { sys::cv_createStitcherScans_bool(try_use_gpu) }.into_result().map(|ptr| unsafe { core::Ptr::<crate::stitching::Stitcher>::from_raw(ptr) })\n\n}\n\n\n\n#[cfg(not(target_os = \"windows\"))]\n\n/// \n\n/// **Deprecated**: use Stitcher::create\n\n/// \n\n/// ## C++ default parameters\n\n/// * try_use_gpu: false\n","file_path":"src/opencv/hub/stitching.rs","rank":98,"score":315981.4261271474},{"content":"/// ## C++ default parameters\n\n/// * try_use_gpu: false\n\npub fn create_stitcher(try_use_gpu: bool) -> Result<core::Ptr::<crate::stitching::Stitcher>> {\n\n\tunsafe { sys::cv_createStitcher_bool(try_use_gpu) }.into_result().map(|ptr| unsafe { core::Ptr::<crate::stitching::Stitcher>::from_raw(ptr) })\n\n}\n\n\n","file_path":"bindings/rust/opencv_34/hub/stitching.rs","rank":99,"score":315981.24601461197}],"string":"[\n {\n \"content\": \"/// Default face detector\\n\\n/// This function is mainly utilized by the implementation of a Facemark Algorithm.\\n\\n/// End users are advised to use function Facemark::getFaces which can be manually defined\\n\\n/// and circumvented to the algorithm by Facemark::setFaceDetector.\\n\\n/// \\n\\n/// ## Parameters\\n\\n/// * image: The input image to be processed.\\n\\n/// * faces: Output of the function which represent region of interest of the detected faces.\\n\\n/// Each face is stored in cv::Rect container.\\n\\n/// * params: detector parameters\\n\\n/// \\n\\n/// <B>Example of usage</B>\\n\\n/// ```ignore\\n\\n/// std::vector<cv::Rect> faces;\\n\\n/// CParams params(\\\"haarcascade_frontalface_alt.xml\\\");\\n\\n/// cv::face::getFaces(frame, faces, ¶ms);\\n\\n/// for(int j=0;j<faces.size();j++){\\n\\n/// cv::rectangle(frame, faces[j], cv::Scalar(255,0,255));\\n\\n/// }\\n\\n/// cv::imshow(\\\"detection\\\", frame);\\n\\n/// ```\\n\\n/// \\n\\npub fn get_faces(image: &dyn core::ToInputArray, faces: &mut dyn core::ToOutputArray, params: &mut crate::face::CParams) -> Result<bool> {\\n\\n\\tinput_array_arg!(image);\\n\\n\\toutput_array_arg!(faces);\\n\\n\\tunsafe { sys::cv_face_getFaces_const__InputArrayX_const__OutputArrayX_CParamsX(image.as_raw__InputArray(), faces.as_raw__OutputArray(), params.as_raw_mut_CParams()) }.into_result()\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/opencv/hub/face.rs\",\n \"rank\": 0,\n \"score\": 368041.34328718204\n },\n {\n \"content\": \"pub fn dump_input_output_array(argument: &mut dyn core::ToInputOutputArray) -> Result<String> {\\n\\n\\tinput_output_array_arg!(argument);\\n\\n\\tunsafe { sys::cv_utils_dumpInputOutputArray_const__InputOutputArrayX(argument.as_raw__InputOutputArray()) }.into_result().map(|s| unsafe { crate::templ::receive_string(s as *mut String) })\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/opencv/hub/core.rs\",\n \"rank\": 1,\n \"score\": 365292.8294835172\n },\n {\n \"content\": \"/// Default face detector\\n\\n/// This function is mainly utilized by the implementation of a Facemark Algorithm.\\n\\n/// End users are advised to use function Facemark::getFaces which can be manually defined\\n\\n/// and circumvented to the algorithm by Facemark::setFaceDetector.\\n\\n/// \\n\\n/// ## Parameters\\n\\n/// * image: The input image to be processed.\\n\\n/// * faces: Output of the function which represent region of interest of the detected faces.\\n\\n/// Each face is stored in cv::Rect container.\\n\\n/// * params: detector parameters\\n\\n/// \\n\\n/// <B>Example of usage</B>\\n\\n/// ```ignore\\n\\n/// std::vector<cv::Rect> faces;\\n\\n/// CParams params(\\\"haarcascade_frontalface_alt.xml\\\");\\n\\n/// cv::face::getFaces(frame, faces, ¶ms);\\n\\n/// for(int j=0;j<faces.size();j++){\\n\\n/// cv::rectangle(frame, faces[j], cv::Scalar(255,0,255));\\n\\n/// }\\n\\n/// cv::imshow(\\\"detection\\\", frame);\\n\\n/// ```\\n\\n/// \\n\\npub fn get_faces(image: &dyn core::ToInputArray, faces: &mut dyn core::ToOutputArray, params: &mut crate::face::CParams) -> Result<bool> {\\n\\n\\tinput_array_arg!(image);\\n\\n\\toutput_array_arg!(faces);\\n\\n\\tunsafe { sys::cv_face_getFaces_const__InputArrayX_const__OutputArrayX_CParamsX(image.as_raw__InputArray(), faces.as_raw__OutputArray(), params.as_raw_mut_CParams()) }.into_result()\\n\\n}\\n\\n\\n\",\n \"file_path\": \"bindings/rust/opencv_4/hub/face.rs\",\n \"rank\": 2,\n \"score\": 364408.2548113236\n },\n {\n \"content\": \"/// Default face detector\\n\\n/// This function is mainly utilized by the implementation of a Facemark Algorithm.\\n\\n/// End users are advised to use function Facemark::getFaces which can be manually defined\\n\\n/// and circumvented to the algorithm by Facemark::setFaceDetector.\\n\\n/// \\n\\n/// ## Parameters\\n\\n/// * image: The input image to be processed.\\n\\n/// * faces: Output of the function which represent region of interest of the detected faces.\\n\\n/// Each face is stored in cv::Rect container.\\n\\n/// * params: detector parameters\\n\\n/// \\n\\n/// <B>Example of usage</B>\\n\\n/// ```ignore\\n\\n/// std::vector<cv::Rect> faces;\\n\\n/// CParams params(\\\"haarcascade_frontalface_alt.xml\\\");\\n\\n/// cv::face::getFaces(frame, faces, ¶ms);\\n\\n/// for(int j=0;j<faces.size();j++){\\n\\n/// cv::rectangle(frame, faces[j], cv::Scalar(255,0,255));\\n\\n/// }\\n\\n/// cv::imshow(\\\"detection\\\", frame);\\n\\n/// ```\\n\\n/// \\n\\npub fn get_faces(image: &dyn core::ToInputArray, faces: &mut dyn core::ToOutputArray, params: &mut crate::face::CParams) -> Result<bool> {\\n\\n\\tinput_array_arg!(image);\\n\\n\\toutput_array_arg!(faces);\\n\\n\\tunsafe { sys::cv_face_getFaces_const__InputArrayX_const__OutputArrayX_CParamsX(image.as_raw__InputArray(), faces.as_raw__OutputArray(), params.as_raw_mut_CParams()) }.into_result()\\n\\n}\\n\\n\\n\",\n \"file_path\": \"bindings/rust/opencv_34/hub/face.rs\",\n \"rank\": 3,\n \"score\": 364408.2548113236\n },\n {\n \"content\": \"pub fn dump_input_output_array_of_arrays(argument: &mut dyn core::ToInputOutputArray) -> Result<String> {\\n\\n\\tinput_output_array_arg!(argument);\\n\\n\\tunsafe { sys::cv_utils_dumpInputOutputArrayOfArrays_const__InputOutputArrayX(argument.as_raw__InputOutputArray()) }.into_result().map(|s| unsafe { crate::templ::receive_string(s as *mut String) })\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/opencv/hub/core.rs\",\n \"rank\": 4,\n \"score\": 361387.9693319682\n },\n {\n \"content\": \"pub fn dump_input_output_array(argument: &mut dyn core::ToInputOutputArray) -> Result<String> {\\n\\n\\tinput_output_array_arg!(argument);\\n\\n\\tunsafe { sys::cv_utils_dumpInputOutputArray_const__InputOutputArrayX(argument.as_raw__InputOutputArray()) }.into_result().map(|s| unsafe { crate::templ::receive_string(s as *mut String) })\\n\\n}\\n\\n\\n\",\n \"file_path\": \"bindings/rust/opencv_34/hub/core.rs\",\n \"rank\": 5,\n \"score\": 361387.96933196817\n },\n {\n \"content\": \"pub fn dump_input_output_array(argument: &mut dyn core::ToInputOutputArray) -> Result<String> {\\n\\n\\tinput_output_array_arg!(argument);\\n\\n\\tunsafe { sys::cv_utils_dumpInputOutputArray_const__InputOutputArrayX(argument.as_raw__InputOutputArray()) }.into_result().map(|s| unsafe { crate::templ::receive_string(s as *mut String) })\\n\\n}\\n\\n\\n\",\n \"file_path\": \"bindings/rust/opencv_4/hub/core.rs\",\n \"rank\": 6,\n \"score\": 361387.9693319682\n },\n {\n \"content\": \"pub trait Element: fmt::Debug {\\n\\n\\tfn update_debug_struct<'dref, 'a, 'b>(&self, struct_debug: &'dref mut fmt::DebugStruct<'a, 'b>) -> &'dref mut fmt::DebugStruct<'a, 'b> {\\n\\n\\t\\tstruct_debug.field(\\\"cpp_fullname\\\", &self.cpp_fullname())\\n\\n\\t\\t\\t.field(\\\"rust_fullname\\\", &self.rust_fullname())\\n\\n\\t\\t\\t.field(\\\"identifier\\\", &self.identifier())\\n\\n\\t\\t\\t.field(\\\"is_excluded\\\", &self.is_excluded())\\n\\n\\t\\t\\t.field(\\\"is_ignored\\\", &self.is_ignored())\\n\\n\\t\\t\\t.field(\\\"is_system\\\", &self.is_system())\\n\\n\\t\\t\\t.field(\\\"is_public\\\", &self.is_public())\\n\\n\\t}\\n\\n\\n\\n\\t/// true if an element shouldn't be generated\\n\\n\\tfn is_excluded(&self) -> bool {\\n\\n\\t\\tDefaultElement::is_excluded(self)\\n\\n\\t}\\n\\n\\n\\n\\t/// true if there shouldn't be any references to that element\\n\\n\\tfn is_ignored(&self) -> bool {\\n\\n\\t\\tDefaultElement::is_ignored(self)\\n\\n\\t}\\n\",\n \"file_path\": \"binding-generator/src/element.rs\",\n \"rank\": 7,\n \"score\": 360998.14232778776\n },\n {\n \"content\": \"pub fn flann_distance_type() -> Result<crate::flann::flann_distance_t> {\\n\\n\\tunsafe { sys::cvflann_flann_distance_type() }.into_result()\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/opencv/hub/flann.rs\",\n \"rank\": 8,\n \"score\": 359096.656046537\n },\n {\n \"content\": \"pub fn dump_input_output_array_of_arrays(argument: &mut dyn core::ToInputOutputArray) -> Result<String> {\\n\\n\\tinput_output_array_arg!(argument);\\n\\n\\tunsafe { sys::cv_utils_dumpInputOutputArrayOfArrays_const__InputOutputArrayX(argument.as_raw__InputOutputArray()) }.into_result().map(|s| unsafe { crate::templ::receive_string(s as *mut String) })\\n\\n}\\n\\n\\n\",\n \"file_path\": \"bindings/rust/opencv_34/hub/core.rs\",\n \"rank\": 9,\n \"score\": 357639.2504828869\n },\n {\n \"content\": \"pub fn dump_input_output_array_of_arrays(argument: &mut dyn core::ToInputOutputArray) -> Result<String> {\\n\\n\\tinput_output_array_arg!(argument);\\n\\n\\tunsafe { sys::cv_utils_dumpInputOutputArrayOfArrays_const__InputOutputArrayX(argument.as_raw__InputOutputArray()) }.into_result().map(|s| unsafe { crate::templ::receive_string(s as *mut String) })\\n\\n}\\n\\n\\n\",\n \"file_path\": \"bindings/rust/opencv_4/hub/core.rs\",\n \"rank\": 10,\n \"score\": 357639.250482887\n },\n {\n \"content\": \"pub fn flann_distance_type() -> Result<crate::flann::flann_distance_t> {\\n\\n\\tunsafe { sys::cvflann_flann_distance_type() }.into_result()\\n\\n}\\n\\n\\n\",\n \"file_path\": \"bindings/rust/opencv_34/hub/flann.rs\",\n \"rank\": 11,\n \"score\": 354254.69159927516\n },\n {\n \"content\": \"pub fn flann_distance_type() -> Result<crate::flann::flann_distance_t> {\\n\\n\\tunsafe { sys::cvflann_flann_distance_type() }.into_result()\\n\\n}\\n\\n\\n\",\n \"file_path\": \"bindings/rust/opencv_32/hub/flann.rs\",\n \"rank\": 12,\n \"score\": 354254.6915992751\n },\n {\n \"content\": \"pub fn flann_distance_type() -> Result<crate::flann::flann_distance_t> {\\n\\n\\tunsafe { sys::cvflann_flann_distance_type() }.into_result()\\n\\n}\\n\\n\\n\",\n \"file_path\": \"bindings/rust/opencv_4/hub/flann.rs\",\n \"rank\": 13,\n \"score\": 354254.6915992751\n },\n {\n \"content\": \"#[allow(unused)]\\n\\npub fn dbg_clang_type(type_ref: Type) {\\n\\n\\tstruct TypeWrapper<'tu>(Type<'tu>);\\n\\n\\n\\n\\timpl fmt::Debug for TypeWrapper<'_> {\\n\\n\\t\\tfn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {\\n\\n\\t\\t\\tf.debug_struct(\\\"Type\\\")\\n\\n\\t\\t\\t\\t.field(\\\"kind\\\", &self.0.get_kind())\\n\\n\\t\\t\\t\\t.field(\\\"display_name\\\", &self.0.get_display_name())\\n\\n\\t\\t\\t\\t.field(\\\"alignof\\\", &self.0.get_alignof())\\n\\n\\t\\t\\t\\t.field(\\\"sizeof\\\", &self.0.get_sizeof())\\n\\n\\t\\t\\t\\t.field(\\\"address_space\\\", &self.0.get_address_space())\\n\\n\\t\\t\\t\\t.field(\\\"argument_types\\\", &self.0.get_argument_types())\\n\\n\\t\\t\\t\\t.field(\\\"calling_convention\\\", &self.0.get_calling_convention())\\n\\n\\t\\t\\t\\t.field(\\\"canonical_type\\\", &self.0.get_canonical_type())\\n\\n\\t\\t\\t\\t.field(\\\"class_type\\\", &self.0.get_class_type())\\n\\n\\t\\t\\t\\t.field(\\\"declaration\\\", &self.0.get_declaration())\\n\\n\\t\\t\\t\\t.field(\\\"elaborated_type\\\", &self.0.get_elaborated_type())\\n\\n\\t\\t\\t\\t.field(\\\"element_type\\\", &self.0.get_element_type())\\n\\n\\t\\t\\t\\t.field(\\\"exception_specification\\\", &self.0.get_exception_specification())\\n\\n\\t\\t\\t\\t.field(\\\"fields\\\", &self.0.get_fields())\\n\",\n \"file_path\": \"binding-generator/src/generator.rs\",\n \"rank\": 14,\n \"score\": 353651.79600233934\n },\n {\n \"content\": \"fn get_debug<'tu>(e: &(impl EntityElement<'tu> + fmt::Display)) -> String {\\n\\n\\tif false {\\n\\n\\t\\tlet loc = e.entity()\\n\\n\\t\\t\\t.get_location().expect(\\\"Can't get entity location\\\")\\n\\n\\t\\t\\t.get_file_location();\\n\\n\\n\\n\\t\\tformat!(\\n\\n\\t\\t\\t\\\"// {} {}:{}\\\",\\n\\n\\t\\t\\te,\\n\\n\\t\\t\\tcanonicalize(loc.file.expect(\\\"Can't get file for debug\\\").get_path()).expect(\\\"Can't canonicalize path\\\").display(),\\n\\n\\t\\t\\tloc.line\\n\\n\\t\\t)\\n\\n\\t} else {\\n\\n\\t\\t\\\"\\\".to_string()\\n\\n\\t}\\n\\n}\\n\\n\\n\",\n \"file_path\": \"binding-generator/src/lib.rs\",\n \"rank\": 15,\n \"score\": 350004.2295481536\n },\n {\n \"content\": \"/// ////////////////////////////////////////////////////////////////////////////////////////////\\n\\n/// Computing normals for mesh\\n\\n/// ## Parameters\\n\\n/// * mesh: Input mesh.\\n\\n/// * normals: Normals at very point in the mesh of type CV_64FC3.\\n\\npub fn compute_normals(mesh: &crate::viz::Mesh, normals: &mut dyn core::ToOutputArray) -> Result<()> {\\n\\n\\toutput_array_arg!(normals);\\n\\n\\tunsafe { sys::cv_viz_computeNormals_const_MeshX_const__OutputArrayX(mesh.as_raw_Mesh(), normals.as_raw__OutputArray()) }.into_result()\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/opencv/hub/viz.rs\",\n \"rank\": 16,\n \"score\": 346723.93925292627\n },\n {\n \"content\": \"pub fn get_available_targets(be: crate::dnn::Backend) -> Result<core::Vector::<crate::dnn::Target>> {\\n\\n\\tunsafe { sys::cv_dnn_getAvailableTargets_Backend(be) }.into_result().map(|ptr| unsafe { core::Vector::<crate::dnn::Target>::from_raw(ptr) })\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/opencv/hub/dnn.rs\",\n \"rank\": 17,\n \"score\": 345590.5215973981\n },\n {\n \"content\": \"/// ////////////////////////////////////////////////////////////////////////////////////////////\\n\\n/// Computing normals for mesh\\n\\n/// ## Parameters\\n\\n/// * mesh: Input mesh.\\n\\n/// * normals: Normals at very point in the mesh of type CV_64FC3.\\n\\npub fn compute_normals(mesh: &crate::viz::Mesh, normals: &mut dyn core::ToOutputArray) -> Result<()> {\\n\\n\\toutput_array_arg!(normals);\\n\\n\\tunsafe { sys::cv_viz_computeNormals_const_MeshX_const__OutputArrayX(mesh.as_raw_Mesh(), normals.as_raw__OutputArray()) }.into_result()\\n\\n}\\n\\n\\n\",\n \"file_path\": \"bindings/rust/opencv_34/hub/viz.rs\",\n \"rank\": 18,\n \"score\": 342822.25974761206\n },\n {\n \"content\": \"/// ////////////////////////////////////////////////////////////////////////////////////////////\\n\\n/// Computing normals for mesh\\n\\n/// ## Parameters\\n\\n/// * mesh: Input mesh.\\n\\n/// * normals: Normals at very point in the mesh of type CV_64FC3.\\n\\npub fn compute_normals(mesh: &crate::viz::Mesh, normals: &mut dyn core::ToOutputArray) -> Result<()> {\\n\\n\\toutput_array_arg!(normals);\\n\\n\\tunsafe { sys::cv_viz_computeNormals_const_MeshX_const__OutputArrayX(mesh.as_raw_Mesh(), normals.as_raw__OutputArray()) }.into_result()\\n\\n}\\n\\n\\n\",\n \"file_path\": \"bindings/rust/opencv_4/hub/viz.rs\",\n \"rank\": 19,\n \"score\": 342822.25974761206\n },\n {\n \"content\": \"struct RefOrVoid<const void>{ typedef const void type; };\\n\\n\\n\\ntemplate<>\\n\",\n \"file_path\": \"headers/3.4/opencv2/core/cvstd.hpp\",\n \"rank\": 20,\n \"score\": 342442.1123118049\n },\n {\n \"content\": \"struct RefOrVoid<const void>{ typedef const void type; };\\n\\n\\n\\ntemplate<>\\n\",\n \"file_path\": \"headers/3.2/opencv2/core/cvstd.hpp\",\n \"rank\": 21,\n \"score\": 342442.1123118049\n },\n {\n \"content\": \"pub fn set_distance_type(distance_type: crate::flann::flann_distance_t, order: i32) -> Result<()> {\\n\\n\\tunsafe { sys::cvflann_set_distance_type_flann_distance_t_int(distance_type, order) }.into_result()\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/opencv/hub/flann.rs\",\n \"rank\": 22,\n \"score\": 342346.11095574393\n },\n {\n \"content\": \"pub fn get_available_targets(be: crate::dnn::Backend) -> Result<core::Vector::<crate::dnn::Target>> {\\n\\n\\tunsafe { sys::cv_dnn_getAvailableTargets_Backend(be) }.into_result().map(|ptr| unsafe { core::Vector::<crate::dnn::Target>::from_raw(ptr) })\\n\\n}\\n\\n\\n\",\n \"file_path\": \"bindings/rust/opencv_4/hub/dnn.rs\",\n \"rank\": 23,\n \"score\": 341573.82323896023\n },\n {\n \"content\": \"pub fn get_available_targets(be: crate::dnn::Backend) -> Result<core::Vector::<crate::dnn::Target>> {\\n\\n\\tunsafe { sys::cv_dnn_getAvailableTargets_Backend(be) }.into_result().map(|ptr| unsafe { core::Vector::<crate::dnn::Target>::from_raw(ptr) })\\n\\n}\\n\\n\\n\",\n \"file_path\": \"bindings/rust/opencv_34/hub/dnn.rs\",\n \"rank\": 24,\n \"score\": 341573.82323896023\n },\n {\n \"content\": \"/// Returns list of all available backends\\n\\npub fn get_backends() -> Result<core::Vector::<crate::videoio::VideoCaptureAPIs>> {\\n\\n\\tunsafe { sys::cv_videoio_registry_getBackends() }.into_result().map(|ptr| unsafe { core::Vector::<crate::videoio::VideoCaptureAPIs>::from_raw(ptr) })\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/opencv/hub/videoio.rs\",\n \"rank\": 25,\n \"score\": 338588.3489260447\n },\n {\n \"content\": \"/// Retrieves a window by its name.\\n\\n/// \\n\\n/// ## Parameters\\n\\n/// * window_name: Name of the window that is to be retrieved.\\n\\n/// \\n\\n/// This function returns a Viz3d object with the given name.\\n\\n/// \\n\\n/// \\n\\n/// Note: If the window with that name already exists, that window is returned. Otherwise, new window is\\n\\n/// created with the given name, and it is returned.\\n\\n/// \\n\\n/// \\n\\n/// Note: Window names are automatically prefixed by \\\"Viz - \\\" if it is not done by the user.\\n\\n/// ```ignore\\n\\n/// /// window and window_2 are the same windows.\\n\\n/// viz::Viz3d window = viz::getWindowByName(\\\"myWindow\\\");\\n\\n/// viz::Viz3d window_2 = viz::getWindowByName(\\\"Viz - myWindow\\\");\\n\\n/// ```\\n\\n/// \\n\\npub fn get_window_by_name(window_name: &str) -> Result<crate::viz::Viz3d> {\\n\\n\\tstring_arg!(window_name);\\n\\n\\tunsafe { sys::cv_viz_getWindowByName_const_StringX(window_name.as_ptr()) }.into_result().map(|ptr| unsafe { crate::viz::Viz3d::from_raw(ptr) })\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/opencv/hub/viz.rs\",\n \"rank\": 26,\n \"score\": 338587.6026167049\n },\n {\n \"content\": \"pub fn set_distance_type(distance_type: crate::flann::flann_distance_t, order: i32) -> Result<()> {\\n\\n\\tunsafe { sys::cvflann_set_distance_type_flann_distance_t_int(distance_type, order) }.into_result()\\n\\n}\\n\\n\\n\",\n \"file_path\": \"bindings/rust/opencv_32/hub/flann.rs\",\n \"rank\": 27,\n \"score\": 338339.2593646527\n },\n {\n \"content\": \"pub fn set_distance_type(distance_type: crate::flann::flann_distance_t, order: i32) -> Result<()> {\\n\\n\\tunsafe { sys::cvflann_set_distance_type_flann_distance_t_int(distance_type, order) }.into_result()\\n\\n}\\n\\n\\n\",\n \"file_path\": \"bindings/rust/opencv_4/hub/flann.rs\",\n \"rank\": 28,\n \"score\": 338339.2593646527\n },\n {\n \"content\": \"pub fn set_distance_type(distance_type: crate::flann::flann_distance_t, order: i32) -> Result<()> {\\n\\n\\tunsafe { sys::cvflann_set_distance_type_flann_distance_t_int(distance_type, order) }.into_result()\\n\\n}\\n\\n\\n\",\n \"file_path\": \"bindings/rust/opencv_34/hub/flann.rs\",\n \"rank\": 29,\n \"score\": 338339.2593646527\n },\n {\n \"content\": \"struct ParamType<_Tp, typename std::enable_if< std::is_enum<_Tp>::value >::type>\\n\\n{\\n\\n typedef typename std::underlying_type<_Tp>::type const_param_type;\\n\\n typedef typename std::underlying_type<_Tp>::type member_type;\\n\\n\\n\\n static const Param type = Param::INT;\\n\\n};\\n\\n\\n\\n//! @} core_basic\\n\\n\\n\\n} //namespace cv\\n\\n\\n\\n#include \\\"opencv2/core/operations.hpp\\\"\\n\\n#include \\\"opencv2/core/cvstd.inl.hpp\\\"\\n\\n#include \\\"opencv2/core/utility.hpp\\\"\\n\\n#include \\\"opencv2/core/optim.hpp\\\"\\n\\n#include \\\"opencv2/core/ovx.hpp\\\"\\n\\n\\n\\n#endif /*OPENCV_CORE_HPP*/\\n\",\n \"file_path\": \"headers/4/opencv2/core.hpp\",\n \"rank\": 30,\n \"score\": 337611.5716482389\n },\n {\n \"content\": \"/// Returns list of all builtin backends\\n\\npub fn get_backends() -> Result<core::Vector::<crate::videoio::VideoCaptureAPIs>> {\\n\\n\\tunsafe { sys::cv_videoio_registry_getBackends() }.into_result().map(|ptr| unsafe { core::Vector::<crate::videoio::VideoCaptureAPIs>::from_raw(ptr) })\\n\\n}\\n\\n\\n\",\n \"file_path\": \"bindings/rust/opencv_34/hub/videoio.rs\",\n \"rank\": 31,\n \"score\": 334151.4315409174\n },\n {\n \"content\": \"/// Returns list of all available backends\\n\\npub fn get_backends() -> Result<core::Vector::<crate::videoio::VideoCaptureAPIs>> {\\n\\n\\tunsafe { sys::cv_videoio_registry_getBackends() }.into_result().map(|ptr| unsafe { core::Vector::<crate::videoio::VideoCaptureAPIs>::from_raw(ptr) })\\n\\n}\\n\\n\\n\",\n \"file_path\": \"bindings/rust/opencv_4/hub/videoio.rs\",\n \"rank\": 32,\n \"score\": 334151.4315409174\n },\n {\n \"content\": \"/// Returns list of available backends which works via `cv::VideoWriter()`\\n\\npub fn get_writer_backends() -> Result<core::Vector::<crate::videoio::VideoCaptureAPIs>> {\\n\\n\\tunsafe { sys::cv_videoio_registry_getWriterBackends() }.into_result().map(|ptr| unsafe { core::Vector::<crate::videoio::VideoCaptureAPIs>::from_raw(ptr) })\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/opencv/hub/videoio.rs\",\n \"rank\": 33,\n \"score\": 334151.1290005192\n },\n {\n \"content\": \"/// Returns list of available backends which works via `cv::VideoCapture(filename)`\\n\\npub fn get_stream_backends() -> Result<core::Vector::<crate::videoio::VideoCaptureAPIs>> {\\n\\n\\tunsafe { sys::cv_videoio_registry_getStreamBackends() }.into_result().map(|ptr| unsafe { core::Vector::<crate::videoio::VideoCaptureAPIs>::from_raw(ptr) })\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/opencv/hub/videoio.rs\",\n \"rank\": 34,\n \"score\": 334151.071269074\n },\n {\n \"content\": \"/// Returns list of available backends which works via `cv::VideoCapture(int index)`\\n\\npub fn get_camera_backends() -> Result<core::Vector::<crate::videoio::VideoCaptureAPIs>> {\\n\\n\\tunsafe { sys::cv_videoio_registry_getCameraBackends() }.into_result().map(|ptr| unsafe { core::Vector::<crate::videoio::VideoCaptureAPIs>::from_raw(ptr) })\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/opencv/hub/videoio.rs\",\n \"rank\": 35,\n \"score\": 334151.01441399904\n },\n {\n \"content\": \"/// Retrieves a window by its name.\\n\\n/// \\n\\n/// ## Parameters\\n\\n/// * window_name: Name of the window that is to be retrieved.\\n\\n/// \\n\\n/// This function returns a Viz3d object with the given name.\\n\\n/// \\n\\n/// \\n\\n/// Note: If the window with that name already exists, that window is returned. Otherwise, new window is\\n\\n/// created with the given name, and it is returned.\\n\\n/// \\n\\n/// \\n\\n/// Note: Window names are automatically prefixed by \\\"Viz - \\\" if it is not done by the user.\\n\\n/// ```ignore\\n\\n/// /// window and window_2 are the same windows.\\n\\n/// viz::Viz3d window = viz::getWindowByName(\\\"myWindow\\\");\\n\\n/// viz::Viz3d window_2 = viz::getWindowByName(\\\"Viz - myWindow\\\");\\n\\n/// ```\\n\\n/// \\n\\npub fn get_window_by_name(window_name: &str) -> Result<crate::viz::Viz3d> {\\n\\n\\tstring_arg!(window_name);\\n\\n\\tunsafe { sys::cv_viz_getWindowByName_const_StringX(window_name.as_ptr()) }.into_result().map(|ptr| unsafe { crate::viz::Viz3d::from_raw(ptr) })\\n\\n}\\n\\n\\n\",\n \"file_path\": \"bindings/rust/opencv_34/hub/viz.rs\",\n \"rank\": 36,\n \"score\": 334150.6852315775\n },\n {\n \"content\": \"/// Retrieves a window by its name.\\n\\n/// \\n\\n/// ## Parameters\\n\\n/// * window_name: Name of the window that is to be retrieved.\\n\\n/// \\n\\n/// This function returns a Viz3d object with the given name.\\n\\n/// \\n\\n/// \\n\\n/// Note: If the window with that name already exists, that window is returned. Otherwise, new window is\\n\\n/// created with the given name, and it is returned.\\n\\n/// \\n\\n/// \\n\\n/// Note: Window names are automatically prefixed by \\\"Viz - \\\" if it is not done by the user.\\n\\n/// ```ignore\\n\\n/// /// window and window_2 are the same windows.\\n\\n/// viz::Viz3d window = viz::getWindowByName(\\\"myWindow\\\");\\n\\n/// viz::Viz3d window_2 = viz::getWindowByName(\\\"Viz - myWindow\\\");\\n\\n/// ```\\n\\n/// \\n\\npub fn get_window_by_name(window_name: &str) -> Result<crate::viz::Viz3d> {\\n\\n\\tstring_arg!(window_name);\\n\\n\\tunsafe { sys::cv_viz_getWindowByName_const_StringX(window_name.as_ptr()) }.into_result().map(|ptr| unsafe { crate::viz::Viz3d::from_raw(ptr) })\\n\\n}\\n\\n\\n\",\n \"file_path\": \"bindings/rust/opencv_4/hub/viz.rs\",\n \"rank\": 37,\n \"score\": 334150.6852315775\n },\n {\n \"content\": \"/// Returns backend API name or \\\"UnknownVideoAPI(xxx)\\\"\\n\\n/// ## Parameters\\n\\n/// * api: backend ID (#VideoCaptureAPIs)\\n\\npub fn get_backend_name(api: crate::videoio::VideoCaptureAPIs) -> Result<String> {\\n\\n\\tunsafe { sys::cv_videoio_registry_getBackendName_VideoCaptureAPIs(api) }.into_result().map(|s| unsafe { crate::templ::receive_string(s as *mut String) })\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/opencv/hub/videoio.rs\",\n \"rank\": 38,\n \"score\": 334143.58054070093\n },\n {\n \"content\": \"/// Returns one of the predefined dictionaries defined in PREDEFINED_DICTIONARY_NAME\\n\\npub fn get_predefined_dictionary(name: crate::aruco::PREDEFINED_DICTIONARY_NAME) -> Result<core::Ptr::<crate::aruco::Dictionary>> {\\n\\n\\tunsafe { sys::cv_aruco_getPredefinedDictionary_PREDEFINED_DICTIONARY_NAME(name) }.into_result().map(|ptr| unsafe { core::Ptr::<crate::aruco::Dictionary>::from_raw(ptr) })\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/opencv/hub/aruco.rs\",\n \"rank\": 39,\n \"score\": 333987.38021911285\n },\n {\n \"content\": \"/// extracts Channel of Interest from CvMat or IplImage and makes cv::Mat out of it.\\n\\n/// \\n\\n/// ## C++ default parameters\\n\\n/// * coi: -1\\n\\npub fn extract_image_coi(arr: *const c_void, coiimg: &mut dyn core::ToOutputArray, coi: i32) -> Result<()> {\\n\\n\\toutput_array_arg!(coiimg);\\n\\n\\tunsafe { sys::cv_extractImageCOI_const_CvArrX_const__OutputArrayX_int(arr, coiimg.as_raw__OutputArray(), coi) }.into_result()\\n\\n}\\n\\n\\n\",\n \"file_path\": \"bindings/rust/opencv_32/hub/core.rs\",\n \"rank\": 40,\n \"score\": 331046.38601711305\n },\n {\n \"content\": \"/// extracts Channel of Interest from CvMat or IplImage and makes cv::Mat out of it.\\n\\n/// \\n\\n/// ## C++ default parameters\\n\\n/// * coi: -1\\n\\npub fn extract_image_coi(arr: *const c_void, coiimg: &mut dyn core::ToOutputArray, coi: i32) -> Result<()> {\\n\\n\\toutput_array_arg!(coiimg);\\n\\n\\tunsafe { sys::cv_extractImageCOI_const_CvArrX_const__OutputArrayX_int(arr, coiimg.as_raw__OutputArray(), coi) }.into_result()\\n\\n}\\n\\n\\n\",\n \"file_path\": \"bindings/rust/opencv_34/hub/core.rs\",\n \"rank\": 41,\n \"score\": 331046.3860171131\n },\n {\n \"content\": \"/// Returns one of the predefined dictionaries defined in PREDEFINED_DICTIONARY_NAME\\n\\npub fn get_predefined_dictionary(name: crate::aruco::PREDEFINED_DICTIONARY_NAME) -> Result<core::Ptr::<crate::aruco::Dictionary>> {\\n\\n\\tunsafe { sys::cv_aruco_getPredefinedDictionary_PREDEFINED_DICTIONARY_NAME(name) }.into_result().map(|ptr| unsafe { core::Ptr::<crate::aruco::Dictionary>::from_raw(ptr) })\\n\\n}\\n\\n\\n\",\n \"file_path\": \"bindings/rust/opencv_34/hub/aruco.rs\",\n \"rank\": 42,\n \"score\": 330401.05642774736\n },\n {\n \"content\": \"/// Returns one of the predefined dictionaries defined in PREDEFINED_DICTIONARY_NAME\\n\\npub fn get_predefined_dictionary(name: crate::aruco::PREDEFINED_DICTIONARY_NAME) -> Result<core::Ptr::<crate::aruco::Dictionary>> {\\n\\n\\tunsafe { sys::cv_aruco_getPredefinedDictionary_PREDEFINED_DICTIONARY_NAME(name) }.into_result().map(|ptr| unsafe { core::Ptr::<crate::aruco::Dictionary>::from_raw(ptr) })\\n\\n}\\n\\n\\n\",\n \"file_path\": \"bindings/rust/opencv_32/hub/aruco.rs\",\n \"rank\": 43,\n \"score\": 330401.05642774736\n },\n {\n \"content\": \"/// Returns one of the predefined dictionaries defined in PREDEFINED_DICTIONARY_NAME\\n\\npub fn get_predefined_dictionary(name: crate::aruco::PREDEFINED_DICTIONARY_NAME) -> Result<core::Ptr::<crate::aruco::Dictionary>> {\\n\\n\\tunsafe { sys::cv_aruco_getPredefinedDictionary_PREDEFINED_DICTIONARY_NAME(name) }.into_result().map(|ptr| unsafe { core::Ptr::<crate::aruco::Dictionary>::from_raw(ptr) })\\n\\n}\\n\\n\\n\",\n \"file_path\": \"bindings/rust/opencv_4/hub/aruco.rs\",\n \"rank\": 44,\n \"score\": 330401.05642774736\n },\n {\n \"content\": \"/// Tries to make panorama more horizontal (or vertical).\\n\\n/// \\n\\n/// ## Parameters\\n\\n/// * rmats: Camera rotation matrices.\\n\\n/// * kind: Correction kind, see detail::WaveCorrectKind.\\n\\npub fn wave_correct(rmats: &mut core::Vector::<core::Mat>, kind: crate::stitching::Detail_WaveCorrectKind) -> Result<()> {\\n\\n\\tunsafe { sys::cv_detail_waveCorrect_vector_Mat_X_WaveCorrectKind(rmats.as_raw_mut_VectorOfMat(), kind) }.into_result()\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/opencv/hub/stitching.rs\",\n \"rank\": 45,\n \"score\": 330331.41334474727\n },\n {\n \"content\": \"/// Returns list of available backends which works via `cv::VideoWriter()`\\n\\npub fn get_writer_backends() -> Result<core::Vector::<crate::videoio::VideoCaptureAPIs>> {\\n\\n\\tunsafe { sys::cv_videoio_registry_getWriterBackends() }.into_result().map(|ptr| unsafe { core::Vector::<crate::videoio::VideoCaptureAPIs>::from_raw(ptr) })\\n\\n}\\n\\n\\n\",\n \"file_path\": \"bindings/rust/opencv_34/hub/videoio.rs\",\n \"rank\": 46,\n \"score\": 329902.948324037\n },\n {\n \"content\": \"/// Returns list of available backends which works via `cv::VideoWriter()`\\n\\npub fn get_writer_backends() -> Result<core::Vector::<crate::videoio::VideoCaptureAPIs>> {\\n\\n\\tunsafe { sys::cv_videoio_registry_getWriterBackends() }.into_result().map(|ptr| unsafe { core::Vector::<crate::videoio::VideoCaptureAPIs>::from_raw(ptr) })\\n\\n}\\n\\n\\n\",\n \"file_path\": \"bindings/rust/opencv_4/hub/videoio.rs\",\n \"rank\": 47,\n \"score\": 329902.9483240371\n },\n {\n \"content\": \"/// Returns list of available backends which works via `cv::VideoCapture(filename)`\\n\\npub fn get_stream_backends() -> Result<core::Vector::<crate::videoio::VideoCaptureAPIs>> {\\n\\n\\tunsafe { sys::cv_videoio_registry_getStreamBackends() }.into_result().map(|ptr| unsafe { core::Vector::<crate::videoio::VideoCaptureAPIs>::from_raw(ptr) })\\n\\n}\\n\\n\\n\",\n \"file_path\": \"bindings/rust/opencv_34/hub/videoio.rs\",\n \"rank\": 48,\n \"score\": 329902.89059259184\n },\n {\n \"content\": \"/// Returns list of available backends which works via `cv::VideoCapture(filename)`\\n\\npub fn get_stream_backends() -> Result<core::Vector::<crate::videoio::VideoCaptureAPIs>> {\\n\\n\\tunsafe { sys::cv_videoio_registry_getStreamBackends() }.into_result().map(|ptr| unsafe { core::Vector::<crate::videoio::VideoCaptureAPIs>::from_raw(ptr) })\\n\\n}\\n\\n\\n\",\n \"file_path\": \"bindings/rust/opencv_4/hub/videoio.rs\",\n \"rank\": 49,\n \"score\": 329902.89059259184\n },\n {\n \"content\": \"/// Returns list of available backends which works via `cv::VideoCapture(int index)`\\n\\npub fn get_camera_backends() -> Result<core::Vector::<crate::videoio::VideoCaptureAPIs>> {\\n\\n\\tunsafe { sys::cv_videoio_registry_getCameraBackends() }.into_result().map(|ptr| unsafe { core::Vector::<crate::videoio::VideoCaptureAPIs>::from_raw(ptr) })\\n\\n}\\n\\n\\n\",\n \"file_path\": \"bindings/rust/opencv_34/hub/videoio.rs\",\n \"rank\": 50,\n \"score\": 329902.83373751683\n },\n {\n \"content\": \"/// Returns list of available backends which works via `cv::VideoCapture(int index)`\\n\\npub fn get_camera_backends() -> Result<core::Vector::<crate::videoio::VideoCaptureAPIs>> {\\n\\n\\tunsafe { sys::cv_videoio_registry_getCameraBackends() }.into_result().map(|ptr| unsafe { core::Vector::<crate::videoio::VideoCaptureAPIs>::from_raw(ptr) })\\n\\n}\\n\\n\\n\",\n \"file_path\": \"bindings/rust/opencv_4/hub/videoio.rs\",\n \"rank\": 51,\n \"score\": 329902.8337375169\n },\n {\n \"content\": \"/// Returns backend API name or \\\"UnknownVideoAPI(xxx)\\\"\\n\\n/// ## Parameters\\n\\n/// * api: backend ID (#VideoCaptureAPIs)\\n\\npub fn get_backend_name(api: crate::videoio::VideoCaptureAPIs) -> Result<String> {\\n\\n\\tunsafe { sys::cv_videoio_registry_getBackendName_VideoCaptureAPIs(api) }.into_result().map(|s| unsafe { crate::templ::receive_string(s as *mut String) })\\n\\n}\\n\\n\\n\",\n \"file_path\": \"bindings/rust/opencv_4/hub/videoio.rs\",\n \"rank\": 52,\n \"score\": 329895.3998642188\n },\n {\n \"content\": \"/// Returns backend API name or \\\"unknown\\\"\\n\\n/// ## Parameters\\n\\n/// * api: backend ID (#VideoCaptureAPIs)\\n\\npub fn get_backend_name(api: crate::videoio::VideoCaptureAPIs) -> Result<String> {\\n\\n\\tunsafe { sys::cv_videoio_registry_getBackendName_VideoCaptureAPIs(api) }.into_result().map(|s| unsafe { crate::templ::receive_string(s as *mut String) })\\n\\n}\\n\\n\\n\",\n \"file_path\": \"bindings/rust/opencv_34/hub/videoio.rs\",\n \"rank\": 53,\n \"score\": 329895.3998642187\n },\n {\n \"content\": \"pub fn find_max_spanning_tree(num_images: i32, pairwise_matches: &core::Vector::<crate::stitching::Detail_MatchesInfo>, span_tree: &mut crate::stitching::Detail_Graph, centers: &mut core::Vector::<i32>) -> Result<()> {\\n\\n\\tunsafe { sys::cv_detail_findMaxSpanningTree_int_const_vector_MatchesInfo_X_GraphX_vector_int_X(num_images, pairwise_matches.as_raw_VectorOfDetail_MatchesInfo(), span_tree.as_raw_mut_Detail_Graph(), centers.as_raw_mut_VectorOfi32()) }.into_result()\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/opencv/hub/stitching.rs\",\n \"rank\": 54,\n \"score\": 328698.60302064446\n },\n {\n \"content\": \"/// Tries to make panorama more horizontal (or vertical).\\n\\n/// \\n\\n/// ## Parameters\\n\\n/// * rmats: Camera rotation matrices.\\n\\n/// * kind: Correction kind, see detail::WaveCorrectKind.\\n\\npub fn wave_correct(rmats: &mut core::Vector::<core::Mat>, kind: crate::stitching::Detail_WaveCorrectKind) -> Result<()> {\\n\\n\\tunsafe { sys::cv_detail_waveCorrect_vector_Mat_X_WaveCorrectKind(rmats.as_raw_mut_VectorOfMat(), kind) }.into_result()\\n\\n}\\n\\n\\n\",\n \"file_path\": \"bindings/rust/opencv_32/hub/stitching.rs\",\n \"rank\": 55,\n \"score\": 326870.9589527078\n },\n {\n \"content\": \"/// Tries to make panorama more horizontal (or vertical).\\n\\n/// \\n\\n/// ## Parameters\\n\\n/// * rmats: Camera rotation matrices.\\n\\n/// * kind: Correction kind, see detail::WaveCorrectKind.\\n\\npub fn wave_correct(rmats: &mut core::Vector::<core::Mat>, kind: crate::stitching::Detail_WaveCorrectKind) -> Result<()> {\\n\\n\\tunsafe { sys::cv_detail_waveCorrect_vector_Mat_X_WaveCorrectKind(rmats.as_raw_mut_VectorOfMat(), kind) }.into_result()\\n\\n}\\n\\n\\n\",\n \"file_path\": \"bindings/rust/opencv_4/hub/stitching.rs\",\n \"rank\": 56,\n \"score\": 326870.9589527078\n },\n {\n \"content\": \"/// Tries to make panorama more horizontal (or vertical).\\n\\n/// \\n\\n/// ## Parameters\\n\\n/// * rmats: Camera rotation matrices.\\n\\n/// * kind: Correction kind, see detail::WaveCorrectKind.\\n\\npub fn wave_correct(rmats: &mut core::Vector::<core::Mat>, kind: crate::stitching::Detail_WaveCorrectKind) -> Result<()> {\\n\\n\\tunsafe { sys::cv_detail_waveCorrect_vector_Mat_X_WaveCorrectKind(rmats.as_raw_mut_VectorOfMat(), kind) }.into_result()\\n\\n}\\n\\n\\n\",\n \"file_path\": \"bindings/rust/opencv_34/hub/stitching.rs\",\n \"rank\": 57,\n \"score\": 326870.9589527078\n },\n {\n \"content\": \"pub fn find_max_spanning_tree(num_images: i32, pairwise_matches: &core::Vector::<crate::stitching::Detail_MatchesInfo>, span_tree: &mut crate::stitching::Detail_Graph, centers: &mut core::Vector::<i32>) -> Result<()> {\\n\\n\\tunsafe { sys::cv_detail_findMaxSpanningTree_int_const_vector_MatchesInfo_X_GraphX_vector_int_X(num_images, pairwise_matches.as_raw_VectorOfDetail_MatchesInfo(), span_tree.as_raw_mut_Detail_Graph(), centers.as_raw_mut_VectorOfi32()) }.into_result()\\n\\n}\\n\\n\\n\",\n \"file_path\": \"bindings/rust/opencv_32/hub/stitching.rs\",\n \"rank\": 58,\n \"score\": 326355.32681065635\n },\n {\n \"content\": \"pub fn find_max_spanning_tree(num_images: i32, pairwise_matches: &core::Vector::<crate::stitching::Detail_MatchesInfo>, span_tree: &mut crate::stitching::Detail_Graph, centers: &mut core::Vector::<i32>) -> Result<()> {\\n\\n\\tunsafe { sys::cv_detail_findMaxSpanningTree_int_const_vector_MatchesInfo_X_GraphX_vector_int_X(num_images, pairwise_matches.as_raw_VectorOfDetail_MatchesInfo(), span_tree.as_raw_mut_Detail_Graph(), centers.as_raw_mut_VectorOfi32()) }.into_result()\\n\\n}\\n\\n\\n\",\n \"file_path\": \"bindings/rust/opencv_34/hub/stitching.rs\",\n \"rank\": 59,\n \"score\": 326355.32681065635\n },\n {\n \"content\": \"pub fn find_max_spanning_tree(num_images: i32, pairwise_matches: &core::Vector::<crate::stitching::Detail_MatchesInfo>, span_tree: &mut crate::stitching::Detail_Graph, centers: &mut core::Vector::<i32>) -> Result<()> {\\n\\n\\tunsafe { sys::cv_detail_findMaxSpanningTree_int_const_vector_MatchesInfo_X_GraphX_vector_int_X(num_images, pairwise_matches.as_raw_VectorOfDetail_MatchesInfo(), span_tree.as_raw_mut_Detail_Graph(), centers.as_raw_mut_VectorOfi32()) }.into_result()\\n\\n}\\n\\n\\n\",\n \"file_path\": \"bindings/rust/opencv_4/hub/stitching.rs\",\n \"rank\": 60,\n \"score\": 326355.32681065635\n },\n {\n \"content\": \"#[cfg(not(target_os = \\\"windows\\\"))]\\n\\npub fn get_impl(impl_: &mut core::Vector::<i32>, fun_name: &mut core::Vector::<String>) -> Result<i32> {\\n\\n\\tunsafe { sys::cv_getImpl_vector_int_X_vector_String_X(impl_.as_raw_mut_VectorOfi32(), fun_name.as_raw_mut_VectorOfString()) }.into_result()\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/opencv/hub/core.rs\",\n \"rank\": 61,\n \"score\": 326321.8278127527\n },\n {\n \"content\": \"pub fn leave_biggest_component(features: &mut core::Vector::<crate::stitching::Detail_ImageFeatures>, pairwise_matches: &mut core::Vector::<crate::stitching::Detail_MatchesInfo>, conf_threshold: f32) -> Result<core::Vector::<i32>> {\\n\\n\\tunsafe { sys::cv_detail_leaveBiggestComponent_vector_ImageFeatures_X_vector_MatchesInfo_X_float(features.as_raw_mut_VectorOfDetail_ImageFeatures(), pairwise_matches.as_raw_mut_VectorOfDetail_MatchesInfo(), conf_threshold) }.into_result().map(|ptr| unsafe { core::Vector::<i32>::from_raw(ptr) })\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/opencv/hub/stitching.rs\",\n \"rank\": 62,\n \"score\": 325449.16985929105\n },\n {\n \"content\": \"struct RefOrVoid<const volatile void>{ typedef const volatile void type; };\\n\\n\\n\",\n \"file_path\": \"headers/3.4/opencv2/core/cvstd.hpp\",\n \"rank\": 63,\n \"score\": 324607.13550913415\n },\n {\n \"content\": \"struct RefOrVoid<const volatile void>{ typedef const volatile void type; };\\n\\n\\n\",\n \"file_path\": \"headers/3.2/opencv2/core/cvstd.hpp\",\n \"rank\": 64,\n \"score\": 324607.13550913415\n },\n {\n \"content\": \"pub fn get_platfoms_info(platform_info: &mut core::Vector::<core::PlatformInfo>) -> Result<()> {\\n\\n\\tunsafe { sys::cv_ocl_getPlatfomsInfo_vector_PlatformInfo_X(platform_info.as_raw_mut_VectorOfPlatformInfo()) }.into_result()\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/opencv/hub/core.rs\",\n \"rank\": 65,\n \"score\": 324580.5006951\n },\n {\n \"content\": \"/// Returns Inference Engine VPU type.\\n\\n/// \\n\\n/// See values of `CV_DNN_INFERENCE_ENGINE_VPU_TYPE_*` macros.\\n\\npub fn get_inference_engine_vpu_type() -> Result<String> {\\n\\n\\tunsafe { sys::cv_dnn_getInferenceEngineVPUType() }.into_result().map(|s| unsafe { crate::templ::receive_string(s as *mut String) })\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/opencv/hub/dnn.rs\",\n \"rank\": 66,\n \"score\": 323583.1833192666\n },\n {\n \"content\": \"/// Returns Inference Engine internal backend API.\\n\\n/// \\n\\n/// See values of `CV_DNN_BACKEND_INFERENCE_ENGINE_*` macros.\\n\\n/// \\n\\n/// Default value is controlled through `OPENCV_DNN_BACKEND_INFERENCE_ENGINE_TYPE` runtime parameter (environment variable).\\n\\npub fn get_inference_engine_backend_type() -> Result<String> {\\n\\n\\tunsafe { sys::cv_dnn_getInferenceEngineBackendType() }.into_result().map(|s| unsafe { crate::templ::receive_string(s as *mut String) })\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/opencv/hub/dnn.rs\",\n \"rank\": 67,\n \"score\": 323581.22477518197\n },\n {\n \"content\": \"pub fn leave_biggest_component(features: &mut core::Vector::<crate::stitching::Detail_ImageFeatures>, pairwise_matches: &mut core::Vector::<crate::stitching::Detail_MatchesInfo>, conf_threshold: f32) -> Result<core::Vector::<i32>> {\\n\\n\\tunsafe { sys::cv_detail_leaveBiggestComponent_vector_ImageFeatures_X_vector_MatchesInfo_X_float(features.as_raw_mut_VectorOfDetail_ImageFeatures(), pairwise_matches.as_raw_mut_VectorOfDetail_MatchesInfo(), conf_threshold) }.into_result().map(|ptr| unsafe { core::Vector::<i32>::from_raw(ptr) })\\n\\n}\\n\\n\\n\",\n \"file_path\": \"bindings/rust/opencv_32/hub/stitching.rs\",\n \"rank\": 68,\n \"score\": 323105.893649303\n },\n {\n \"content\": \"pub fn leave_biggest_component(features: &mut core::Vector::<crate::stitching::Detail_ImageFeatures>, pairwise_matches: &mut core::Vector::<crate::stitching::Detail_MatchesInfo>, conf_threshold: f32) -> Result<core::Vector::<i32>> {\\n\\n\\tunsafe { sys::cv_detail_leaveBiggestComponent_vector_ImageFeatures_X_vector_MatchesInfo_X_float(features.as_raw_mut_VectorOfDetail_ImageFeatures(), pairwise_matches.as_raw_mut_VectorOfDetail_MatchesInfo(), conf_threshold) }.into_result().map(|ptr| unsafe { core::Vector::<i32>::from_raw(ptr) })\\n\\n}\\n\\n\\n\",\n \"file_path\": \"bindings/rust/opencv_34/hub/stitching.rs\",\n \"rank\": 69,\n \"score\": 323105.893649303\n },\n {\n \"content\": \"pub fn leave_biggest_component(features: &mut core::Vector::<crate::stitching::Detail_ImageFeatures>, pairwise_matches: &mut core::Vector::<crate::stitching::Detail_MatchesInfo>, conf_threshold: f32) -> Result<core::Vector::<i32>> {\\n\\n\\tunsafe { sys::cv_detail_leaveBiggestComponent_vector_ImageFeatures_X_vector_MatchesInfo_X_float(features.as_raw_mut_VectorOfDetail_ImageFeatures(), pairwise_matches.as_raw_mut_VectorOfDetail_MatchesInfo(), conf_threshold) }.into_result().map(|ptr| unsafe { core::Vector::<i32>::from_raw(ptr) })\\n\\n}\\n\\n\\n\",\n \"file_path\": \"bindings/rust/opencv_4/hub/stitching.rs\",\n \"rank\": 70,\n \"score\": 323105.893649303\n },\n {\n \"content\": \"/// A utility to load list of paths to training image and annotation file.\\n\\n/// ## Parameters\\n\\n/// * imageList: The specified file contains paths to the training images.\\n\\n/// * annotationList: The specified file contains paths to the training annotations.\\n\\n/// * images: The loaded paths of training images.\\n\\n/// * annotations: The loaded paths of annotation files.\\n\\n/// \\n\\n/// Example of usage:\\n\\n/// ```ignore\\n\\n/// String imageFiles = \\\"images_path.txt\\\";\\n\\n/// String ptsFiles = \\\"annotations_path.txt\\\";\\n\\n/// std::vector<String> images_train;\\n\\n/// std::vector<String> landmarks_train;\\n\\n/// loadDatasetList(imageFiles,ptsFiles,images_train,landmarks_train);\\n\\n/// ```\\n\\n/// \\n\\npub fn load_dataset_list(image_list: &str, annotation_list: &str, images: &mut core::Vector::<String>, annotations: &mut core::Vector::<String>) -> Result<bool> {\\n\\n\\tstring_arg!(image_list);\\n\\n\\tstring_arg!(annotation_list);\\n\\n\\tunsafe { sys::cv_face_loadDatasetList_String_String_vector_String_X_vector_String_X(image_list.as_ptr() as _, annotation_list.as_ptr() as _, images.as_raw_mut_VectorOfString(), annotations.as_raw_mut_VectorOfString()) }.into_result()\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/opencv/hub/face.rs\",\n \"rank\": 71,\n \"score\": 322783.50747706543\n },\n {\n \"content\": \"#[cfg(not(target_os = \\\"windows\\\"))]\\n\\npub fn get_impl(impl_: &mut core::Vector::<i32>, fun_name: &mut core::Vector::<String>) -> Result<i32> {\\n\\n\\tunsafe { sys::cv_getImpl_vector_int_X_vector_String_X(impl_.as_raw_mut_VectorOfi32(), fun_name.as_raw_mut_VectorOfString()) }.into_result()\\n\\n}\\n\\n\\n\",\n \"file_path\": \"bindings/rust/opencv_32/hub/core.rs\",\n \"rank\": 72,\n \"score\": 322736.1618639411\n },\n {\n \"content\": \"#[cfg(not(target_os = \\\"windows\\\"))]\\n\\npub fn get_impl(impl_: &mut core::Vector::<i32>, fun_name: &mut core::Vector::<String>) -> Result<i32> {\\n\\n\\tunsafe { sys::cv_getImpl_vector_int_X_vector_String_X(impl_.as_raw_mut_VectorOfi32(), fun_name.as_raw_mut_VectorOfString()) }.into_result()\\n\\n}\\n\\n\\n\",\n \"file_path\": \"bindings/rust/opencv_34/hub/core.rs\",\n \"rank\": 73,\n \"score\": 322736.1618639411\n },\n {\n \"content\": \"#[cfg(not(target_os = \\\"windows\\\"))]\\n\\npub fn get_impl(impl_: &mut core::Vector::<i32>, fun_name: &mut core::Vector::<String>) -> Result<i32> {\\n\\n\\tunsafe { sys::cv_getImpl_vector_int_X_vector_String_X(impl_.as_raw_mut_VectorOfi32(), fun_name.as_raw_mut_VectorOfString()) }.into_result()\\n\\n}\\n\\n\\n\",\n \"file_path\": \"bindings/rust/opencv_4/hub/core.rs\",\n \"rank\": 74,\n \"score\": 322736.1618639411\n },\n {\n \"content\": \"#[test]\\n\\nfn vec() -> Result<()> {\\n\\n let mut m = Mat::new_rows_cols_with_default(10, 10, Vec3b::typ(), Scalar::default())?;\\n\\n let mut ps = types::VectorOfMat::new();\\n\\n assert_eq!(ps.len(), 0);\\n\\n let mut p1 = unsafe { Mat::new_rows_cols(3, 2, i32::typ()) }?;\\n\\n p1.at_row_mut::<i32>(0)?.copy_from_slice(&[0, 0]);\\n\\n p1.at_row_mut::<i32>(1)?.copy_from_slice(&[0, 9]);\\n\\n p1.at_row_mut::<i32>(2)?.copy_from_slice(&[9, 9]);\\n\\n ps.push(p1);\\n\\n assert_eq!(ps.len(), 1);\\n\\n #[cfg(not(feature = \\\"opencv-4\\\"))]\\n\\n use self::core::LINE_8;\\n\\n #[cfg(feature = \\\"opencv-4\\\")]\\n\\n use self::imgproc::LINE_8;\\n\\n imgproc::fill_poly(&mut m, &ps, Scalar::new(127., 127., 127., 0.), LINE_8, 0, Point::default())?;\\n\\n assert_eq!(*m.at_2d::<Vec3b>(0, 0)?, Vec3b::from([127, 127, 127]));\\n\\n assert_eq!(*m.at_2d::<Vec3b>(0, 9)?, Vec3b::default());\\n\\n assert_eq!(*m.at_2d::<Vec3b>(9, 9)?, Vec3b::from([127, 127, 127]));\\n\\n Ok(())\\n\\n}\\n\\n\\n\",\n \"file_path\": \"tests/types.rs\",\n \"rank\": 75,\n \"score\": 322427.41556475917\n },\n {\n \"content\": \"/// ///////////////////////////////////////////////////////////////////////////\\n\\npub fn matches_graph_as_string(pathes: &mut core::Vector::<String>, pairwise_matches: &mut core::Vector::<crate::stitching::Detail_MatchesInfo>, conf_threshold: f32) -> Result<String> {\\n\\n\\tunsafe { sys::cv_detail_matchesGraphAsString_vector_String_X_vector_MatchesInfo_X_float(pathes.as_raw_mut_VectorOfString(), pairwise_matches.as_raw_mut_VectorOfDetail_MatchesInfo(), conf_threshold) }.into_result().map(|s| unsafe { crate::templ::receive_string(s as *mut String) })\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/opencv/hub/stitching.rs\",\n \"rank\": 76,\n \"score\": 321064.8729559347\n },\n {\n \"content\": \"pub fn create_frame_source_empty() -> Result<core::Ptr::<dyn crate::superres::Superres_FrameSource>> {\\n\\n\\tunsafe { sys::cv_superres_createFrameSource_Empty() }.into_result().map(|ptr| unsafe { core::Ptr::<dyn crate::superres::Superres_FrameSource>::from_raw(ptr) })\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/opencv/hub/superres.rs\",\n \"rank\": 77,\n \"score\": 320728.92648750177\n },\n {\n \"content\": \"pub fn get_platfoms_info(platform_info: &mut core::Vector::<core::PlatformInfo>) -> Result<()> {\\n\\n\\tunsafe { sys::cv_ocl_getPlatfomsInfo_vector_PlatformInfo_X(platform_info.as_raw_mut_VectorOfPlatformInfo()) }.into_result()\\n\\n}\\n\\n\\n\",\n \"file_path\": \"bindings/rust/opencv_4/hub/core.rs\",\n \"rank\": 78,\n \"score\": 320510.0215410307\n },\n {\n \"content\": \"pub fn get_platfoms_info(platform_info: &mut core::Vector::<core::PlatformInfo>) -> Result<()> {\\n\\n\\tunsafe { sys::cv_ocl_getPlatfomsInfo_vector_PlatformInfo_X(platform_info.as_raw_mut_VectorOfPlatformInfo()) }.into_result()\\n\\n}\\n\\n\\n\",\n \"file_path\": \"bindings/rust/opencv_34/hub/core.rs\",\n \"rank\": 79,\n \"score\": 320510.02154103067\n },\n {\n \"content\": \"pub fn get_platfoms_info(platform_info: &mut core::Vector::<core::PlatformInfo>) -> Result<()> {\\n\\n\\tunsafe { sys::cv_ocl_getPlatfomsInfo_vector_PlatformInfo_X(platform_info.as_raw_mut_VectorOfPlatformInfo()) }.into_result()\\n\\n}\\n\\n\\n\",\n \"file_path\": \"bindings/rust/opencv_32/hub/core.rs\",\n \"rank\": 80,\n \"score\": 320510.0215410307\n },\n {\n \"content\": \"#[deprecated = \\\"use Stitcher::create\\\"]\\n\\npub fn create_stitcher(try_use_gpu: bool) -> Result<core::Ptr::<crate::stitching::Stitcher>> {\\n\\n\\tunsafe { sys::cv_createStitcher_bool(try_use_gpu) }.into_result().map(|ptr| unsafe { core::Ptr::<crate::stitching::Stitcher>::from_raw(ptr) })\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/opencv/hub/stitching.rs\",\n \"rank\": 81,\n \"score\": 320052.95334232226\n },\n {\n \"content\": \"/// Returns one of the predefined dictionaries referenced by DICT_*.\\n\\npub fn get_predefined_dictionary_i32(dict: i32) -> Result<core::Ptr::<crate::aruco::Dictionary>> {\\n\\n\\tunsafe { sys::cv_aruco_getPredefinedDictionary_int(dict) }.into_result().map(|ptr| unsafe { core::Ptr::<crate::aruco::Dictionary>::from_raw(ptr) })\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/opencv/hub/aruco.rs\",\n \"rank\": 82,\n \"score\": 320031.29225224245\n },\n {\n \"content\": \"/// A utility to load list of paths to training image and annotation file.\\n\\n/// ## Parameters\\n\\n/// * imageList: The specified file contains paths to the training images.\\n\\n/// * annotationList: The specified file contains paths to the training annotations.\\n\\n/// * images: The loaded paths of training images.\\n\\n/// * annotations: The loaded paths of annotation files.\\n\\n/// \\n\\n/// Example of usage:\\n\\n/// ```ignore\\n\\n/// String imageFiles = \\\"images_path.txt\\\";\\n\\n/// String ptsFiles = \\\"annotations_path.txt\\\";\\n\\n/// std::vector<String> images_train;\\n\\n/// std::vector<String> landmarks_train;\\n\\n/// loadDatasetList(imageFiles,ptsFiles,images_train,landmarks_train);\\n\\n/// ```\\n\\n/// \\n\\npub fn load_dataset_list(image_list: &str, annotation_list: &str, images: &mut core::Vector::<String>, annotations: &mut core::Vector::<String>) -> Result<bool> {\\n\\n\\tstring_arg!(image_list);\\n\\n\\tstring_arg!(annotation_list);\\n\\n\\tunsafe { sys::cv_face_loadDatasetList_String_String_vector_String_X_vector_String_X(image_list.as_ptr() as _, annotation_list.as_ptr() as _, images.as_raw_mut_VectorOfString(), annotations.as_raw_mut_VectorOfString()) }.into_result()\\n\\n}\\n\\n\\n\",\n \"file_path\": \"bindings/rust/opencv_34/hub/face.rs\",\n \"rank\": 83,\n \"score\": 319896.20690517896\n },\n {\n \"content\": \"/// A utility to load list of paths to training image and annotation file.\\n\\n/// ## Parameters\\n\\n/// * imageList: The specified file contains paths to the training images.\\n\\n/// * annotationList: The specified file contains paths to the training annotations.\\n\\n/// * images: The loaded paths of training images.\\n\\n/// * annotations: The loaded paths of annotation files.\\n\\n/// \\n\\n/// Example of usage:\\n\\n/// ```ignore\\n\\n/// String imageFiles = \\\"images_path.txt\\\";\\n\\n/// String ptsFiles = \\\"annotations_path.txt\\\";\\n\\n/// std::vector<String> images_train;\\n\\n/// std::vector<String> landmarks_train;\\n\\n/// loadDatasetList(imageFiles,ptsFiles,images_train,landmarks_train);\\n\\n/// ```\\n\\n/// \\n\\npub fn load_dataset_list(image_list: &str, annotation_list: &str, images: &mut core::Vector::<String>, annotations: &mut core::Vector::<String>) -> Result<bool> {\\n\\n\\tstring_arg!(image_list);\\n\\n\\tstring_arg!(annotation_list);\\n\\n\\tunsafe { sys::cv_face_loadDatasetList_String_String_vector_String_X_vector_String_X(image_list.as_ptr() as _, annotation_list.as_ptr() as _, images.as_raw_mut_VectorOfString(), annotations.as_raw_mut_VectorOfString()) }.into_result()\\n\\n}\\n\\n\\n\",\n \"file_path\": \"bindings/rust/opencv_4/hub/face.rs\",\n \"rank\": 84,\n \"score\": 319896.20690517896\n },\n {\n \"content\": \"/// Detects corners using the FAST algorithm\\n\\n/// \\n\\n/// ## Parameters\\n\\n/// * image: grayscale image where keypoints (corners) are detected.\\n\\n/// * keypoints: keypoints detected on the image.\\n\\n/// * threshold: threshold on difference between intensity of the central pixel and pixels of a\\n\\n/// circle around this pixel.\\n\\n/// * nonmaxSuppression: if true, non-maximum suppression is applied to detected corners\\n\\n/// (keypoints).\\n\\n/// * type: one of the three neighborhoods as defined in the paper:\\n\\n/// FastFeatureDetector::TYPE_9_16, FastFeatureDetector::TYPE_7_12,\\n\\n/// FastFeatureDetector::TYPE_5_8\\n\\n/// \\n\\n/// Detects corners using the FAST algorithm by [Rosten06](https://docs.opencv.org/4.3.0/d0/de3/citelist.html#CITEREF_Rosten06) .\\n\\n/// \\n\\n/// \\n\\n/// Note: In Python API, types are given as cv.FAST_FEATURE_DETECTOR_TYPE_5_8,\\n\\n/// cv.FAST_FEATURE_DETECTOR_TYPE_7_12 and cv.FAST_FEATURE_DETECTOR_TYPE_9_16. For corner\\n\\n/// detection, use cv.FAST.detect() method.\\n\\npub fn FAST_with_type(image: &dyn core::ToInputArray, keypoints: &mut core::Vector::<core::KeyPoint>, threshold: i32, nonmax_suppression: bool, typ: crate::features2d::FastFeatureDetector_DetectorType) -> Result<()> {\\n\\n\\tinput_array_arg!(image);\\n\\n\\tunsafe { sys::cv_FAST_const__InputArrayX_vector_KeyPoint_X_int_bool_DetectorType(image.as_raw__InputArray(), keypoints.as_raw_mut_VectorOfKeyPoint(), threshold, nonmax_suppression, typ) }.into_result()\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/opencv/hub/features2d.rs\",\n \"rank\": 85,\n \"score\": 318709.3566708168\n },\n {\n \"content\": \"/// Detects corners using the AGAST algorithm\\n\\n/// \\n\\n/// ## Parameters\\n\\n/// * image: grayscale image where keypoints (corners) are detected.\\n\\n/// * keypoints: keypoints detected on the image.\\n\\n/// * threshold: threshold on difference between intensity of the central pixel and pixels of a\\n\\n/// circle around this pixel.\\n\\n/// * nonmaxSuppression: if true, non-maximum suppression is applied to detected corners\\n\\n/// (keypoints).\\n\\n/// * type: one of the four neighborhoods as defined in the paper:\\n\\n/// AgastFeatureDetector::AGAST_5_8, AgastFeatureDetector::AGAST_7_12d,\\n\\n/// AgastFeatureDetector::AGAST_7_12s, AgastFeatureDetector::OAST_9_16\\n\\n/// \\n\\n/// For non-Intel platforms, there is a tree optimised variant of AGAST with same numerical results.\\n\\n/// The 32-bit binary tree tables were generated automatically from original code using perl script.\\n\\n/// The perl script and examples of tree generation are placed in features2d/doc folder.\\n\\n/// Detects corners using the AGAST algorithm by [mair2010_agast](https://docs.opencv.org/4.3.0/d0/de3/citelist.html#CITEREF_mair2010_agast) .\\n\\npub fn AGAST_with_type(image: &dyn core::ToInputArray, keypoints: &mut core::Vector::<core::KeyPoint>, threshold: i32, nonmax_suppression: bool, typ: crate::features2d::AgastFeatureDetector_DetectorType) -> Result<()> {\\n\\n\\tinput_array_arg!(image);\\n\\n\\tunsafe { sys::cv_AGAST_const__InputArrayX_vector_KeyPoint_X_int_bool_DetectorType(image.as_raw__InputArray(), keypoints.as_raw_mut_VectorOfKeyPoint(), threshold, nonmax_suppression, typ) }.into_result()\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/opencv/hub/features2d.rs\",\n \"rank\": 86,\n \"score\": 318704.5714937166\n },\n {\n \"content\": \"/// Returns Inference Engine VPU type.\\n\\n/// \\n\\n/// See values of `CV_DNN_INFERENCE_ENGINE_VPU_TYPE_*` macros.\\n\\npub fn get_inference_engine_vpu_type() -> Result<String> {\\n\\n\\tunsafe { sys::cv_dnn_getInferenceEngineVPUType() }.into_result().map(|s| unsafe { crate::templ::receive_string(s as *mut String) })\\n\\n}\\n\\n\\n\",\n \"file_path\": \"bindings/rust/opencv_34/hub/dnn.rs\",\n \"rank\": 87,\n \"score\": 318507.2066226825\n },\n {\n \"content\": \"/// Returns Inference Engine VPU type.\\n\\n/// \\n\\n/// See values of `CV_DNN_INFERENCE_ENGINE_VPU_TYPE_*` macros.\\n\\npub fn get_inference_engine_vpu_type() -> Result<String> {\\n\\n\\tunsafe { sys::cv_dnn_getInferenceEngineVPUType() }.into_result().map(|s| unsafe { crate::templ::receive_string(s as *mut String) })\\n\\n}\\n\\n\\n\",\n \"file_path\": \"bindings/rust/opencv_4/hub/dnn.rs\",\n \"rank\": 88,\n \"score\": 318507.2066226825\n },\n {\n \"content\": \"/// Returns Inference Engine internal backend API.\\n\\n/// \\n\\n/// See values of `CV_DNN_BACKEND_INFERENCE_ENGINE_*` macros.\\n\\n/// \\n\\n/// Default value is controlled through `OPENCV_DNN_BACKEND_INFERENCE_ENGINE_TYPE` runtime parameter (environment variable).\\n\\npub fn get_inference_engine_backend_type() -> Result<String> {\\n\\n\\tunsafe { sys::cv_dnn_getInferenceEngineBackendType() }.into_result().map(|s| unsafe { crate::templ::receive_string(s as *mut String) })\\n\\n}\\n\\n\\n\",\n \"file_path\": \"bindings/rust/opencv_34/hub/dnn.rs\",\n \"rank\": 89,\n \"score\": 318505.2480785978\n },\n {\n \"content\": \"/// Returns Inference Engine internal backend API.\\n\\n/// \\n\\n/// See values of `CV_DNN_BACKEND_INFERENCE_ENGINE_*` macros.\\n\\n/// \\n\\n/// Default value is controlled through `OPENCV_DNN_BACKEND_INFERENCE_ENGINE_TYPE` runtime parameter (environment variable).\\n\\npub fn get_inference_engine_backend_type() -> Result<String> {\\n\\n\\tunsafe { sys::cv_dnn_getInferenceEngineBackendType() }.into_result().map(|s| unsafe { crate::templ::receive_string(s as *mut String) })\\n\\n}\\n\\n\\n\",\n \"file_path\": \"bindings/rust/opencv_4/hub/dnn.rs\",\n \"rank\": 90,\n \"score\": 318505.2480785978\n },\n {\n \"content\": \"/// ///////////////////////////////////////////////////////////////////////////\\n\\npub fn matches_graph_as_string(pathes: &mut core::Vector::<String>, pairwise_matches: &mut core::Vector::<crate::stitching::Detail_MatchesInfo>, conf_threshold: f32) -> Result<String> {\\n\\n\\tunsafe { sys::cv_detail_matchesGraphAsString_vector_String_X_vector_MatchesInfo_X_float(pathes.as_raw_mut_VectorOfString(), pairwise_matches.as_raw_mut_VectorOfDetail_MatchesInfo(), conf_threshold) }.into_result().map(|s| unsafe { crate::templ::receive_string(s as *mut String) })\\n\\n}\\n\\n\\n\",\n \"file_path\": \"bindings/rust/opencv_34/hub/stitching.rs\",\n \"rank\": 91,\n \"score\": 318337.0085526083\n },\n {\n \"content\": \"/// ///////////////////////////////////////////////////////////////////////////\\n\\npub fn matches_graph_as_string(pathes: &mut core::Vector::<String>, pairwise_matches: &mut core::Vector::<crate::stitching::Detail_MatchesInfo>, conf_threshold: f32) -> Result<String> {\\n\\n\\tunsafe { sys::cv_detail_matchesGraphAsString_vector_String_X_vector_MatchesInfo_X_float(pathes.as_raw_mut_VectorOfString(), pairwise_matches.as_raw_mut_VectorOfDetail_MatchesInfo(), conf_threshold) }.into_result().map(|s| unsafe { crate::templ::receive_string(s as *mut String) })\\n\\n}\\n\\n\\n\",\n \"file_path\": \"bindings/rust/opencv_4/hub/stitching.rs\",\n \"rank\": 92,\n \"score\": 318337.00855260843\n },\n {\n \"content\": \"/// ///////////////////////////////////////////////////////////////////////////\\n\\npub fn matches_graph_as_string(pathes: &mut core::Vector::<String>, pairwise_matches: &mut core::Vector::<crate::stitching::Detail_MatchesInfo>, conf_threshold: f32) -> Result<String> {\\n\\n\\tunsafe { sys::cv_detail_matchesGraphAsString_vector_String_X_vector_MatchesInfo_X_float(pathes.as_raw_mut_VectorOfString(), pairwise_matches.as_raw_mut_VectorOfDetail_MatchesInfo(), conf_threshold) }.into_result().map(|s| unsafe { crate::templ::receive_string(s as *mut String) })\\n\\n}\\n\\n\\n\",\n \"file_path\": \"bindings/rust/opencv_32/hub/stitching.rs\",\n \"rank\": 93,\n \"score\": 318337.0085526083\n },\n {\n \"content\": \"pub fn create_frame_source_empty() -> Result<core::Ptr::<dyn crate::superres::Superres_FrameSource>> {\\n\\n\\tunsafe { sys::cv_superres_createFrameSource_Empty() }.into_result().map(|ptr| unsafe { core::Ptr::<dyn crate::superres::Superres_FrameSource>::from_raw(ptr) })\\n\\n}\\n\\n\\n\",\n \"file_path\": \"bindings/rust/opencv_34/hub/superres.rs\",\n \"rank\": 94,\n \"score\": 316823.30215462006\n },\n {\n \"content\": \"pub fn create_frame_source_empty() -> Result<core::Ptr::<dyn crate::superres::Superres_FrameSource>> {\\n\\n\\tunsafe { sys::cv_superres_createFrameSource_Empty() }.into_result().map(|ptr| unsafe { core::Ptr::<dyn crate::superres::Superres_FrameSource>::from_raw(ptr) })\\n\\n}\\n\\n\\n\",\n \"file_path\": \"bindings/rust/opencv_32/hub/superres.rs\",\n \"rank\": 95,\n \"score\": 316823.30215462006\n },\n {\n \"content\": \"pub fn create_frame_source_empty() -> Result<core::Ptr::<dyn crate::superres::Superres_FrameSource>> {\\n\\n\\tunsafe { sys::cv_superres_createFrameSource_Empty() }.into_result().map(|ptr| unsafe { core::Ptr::<dyn crate::superres::Superres_FrameSource>::from_raw(ptr) })\\n\\n}\\n\\n\\n\",\n \"file_path\": \"bindings/rust/opencv_4/hub/superres.rs\",\n \"rank\": 96,\n \"score\": 316823.30215462006\n },\n {\n \"content\": \"#[deprecated = \\\"use Stitcher::create\\\"]\\n\\npub fn create_stitcher(try_use_gpu: bool) -> Result<core::Ptr::<crate::stitching::Stitcher>> {\\n\\n\\tunsafe { sys::cv_createStitcher_bool(try_use_gpu) }.into_result().map(|ptr| unsafe { core::Ptr::<crate::stitching::Stitcher>::from_raw(ptr) })\\n\\n}\\n\\n\\n\",\n \"file_path\": \"bindings/rust/opencv_4/hub/stitching.rs\",\n \"rank\": 97,\n \"score\": 315981.4261271474\n },\n {\n \"content\": \"#[deprecated = \\\"use Stitcher::create\\\"]\\n\\npub fn create_stitcher_scans(try_use_gpu: bool) -> Result<core::Ptr::<crate::stitching::Stitcher>> {\\n\\n\\tunsafe { sys::cv_createStitcherScans_bool(try_use_gpu) }.into_result().map(|ptr| unsafe { core::Ptr::<crate::stitching::Stitcher>::from_raw(ptr) })\\n\\n}\\n\\n\\n\\n#[cfg(not(target_os = \\\"windows\\\"))]\\n\\n/// \\n\\n/// **Deprecated**: use Stitcher::create\\n\\n/// \\n\\n/// ## C++ default parameters\\n\\n/// * try_use_gpu: false\\n\",\n \"file_path\": \"src/opencv/hub/stitching.rs\",\n \"rank\": 98,\n \"score\": 315981.4261271474\n },\n {\n \"content\": \"/// ## C++ default parameters\\n\\n/// * try_use_gpu: false\\n\\npub fn create_stitcher(try_use_gpu: bool) -> Result<core::Ptr::<crate::stitching::Stitcher>> {\\n\\n\\tunsafe { sys::cv_createStitcher_bool(try_use_gpu) }.into_result().map(|ptr| unsafe { core::Ptr::<crate::stitching::Stitcher>::from_raw(ptr) })\\n\\n}\\n\\n\\n\",\n \"file_path\": \"bindings/rust/opencv_34/hub/stitching.rs\",\n \"rank\": 99,\n \"score\": 315981.24601461197\n }\n]","isConversational":false}}},{"rowIdx":2363,"cells":{"lang":{"kind":"string","value":"Rust"},"file_path":{"kind":"string","value":"src/database.rs"},"repo_name":{"kind":"string","value":"chongyi/inspirer-rs"},"commit":{"kind":"string","value":"78cf180162e9ba302b16a6873629e56cfb318b4f"},"file_code":{"kind":"string","value":"use actix::*;\nuse actix_web::*;\nuse diesel;\nuse diesel::prelude::MysqlConnection;\nuse diesel::r2d2::{ Pool, PooledConnection, ConnectionManager };\nuse diesel::sql_types;\n\nuse error::Error;\n\npub struct DatabaseExecutor(pub Pool<ConnectionManager<MysqlConnection>>);\n\npub type Conn = PooledConnection<ConnectionManager<MysqlConnection>>;\n\nno_arg_sql_function!(last_insert_id, sql_types::Unsigned<sql_types::BigInt>);\n\n#[macro_export]\nmacro_rules! last_insert_id {\n ($conn:expr, $table:expr) => {\n {\n use $crate::diesel;\n use $crate::database::last_insert_id as lastid;\n use $crate::error::database::map_database_error as map_db_err;\n let generated_id: u64 = diesel::select(lastid)\n .first($conn)\n .map_err(map_db_err($table))?;\n\n generated_id\n }\n };\n}\n\n#[macro_export]\nmacro_rules! delete_by_id {\n ($conn:expr => ($table:ident # = $id:expr)) => {\n delete_by_id!($conn => ($table id = $id))\n };\n ($conn:expr => ($table:ident $id_field:ident = $id:expr)) => {\n {\n use $crate::error::database::map_database_error as map_db_err;\n diesel::delete($table)\n .filter($id_field.eq($id))\n .execute($conn)\n .map_err(map_db_err(Some(stringify!($table))))\n }\n };\n}\n\n#[macro_export]\nmacro_rules! find_by_id {\n ($conn:expr => ($table:ident # = $id:expr => $ty:ty)) => {\n find_by_id!($conn => ($table id = $id => $ty))\n };\n ($conn:expr => ($table:ident($fields:expr) # = $id:expr => $ty:ty)) => {\n find_by_id!($conn => ($table($fields) id = $id => $ty))\n };\n ($conn:expr => ($table:ident $id_field:ident = $id:expr => $ty:ty)) => {\n {\n use $crate::error::database::map_database_error as map_db_err;\n $table\n .filter($id_field.eq($id))\n .first::<$ty>($conn)\n .map_err(map_db_err(Some(stringify!($table))))\n }\n };\n ($conn:expr => ($table:ident($fields:expr) $id_field:ident = $id:expr => $ty:ty)) => {\n {\n use $crate::error::database::map_database_error as map_db_err;\n $table\n .select($fields)\n .filter($id_field.eq($id))\n .first::<$ty>($conn)\n .map_err(map_db_err(Some(stringify!($table))))\n }\n };\n ($conn:expr => ($table:ident($fields:expr) filter($filter:expr) => $ty:ty)) => {\n {\n use $crate::error::database::map_database_error as map_db_err;\n $table\n .select($fields)\n .filter($filter)\n .first::<$ty>($conn)\n .map_err(map_db_err(Some(stringify!($table))))\n }\n };\n}\n\n#[macro_export]\nmacro_rules! update_by_id {\n ($conn:expr => ($table:ident # = $id:expr; <- $update:expr)) => {\n update_by_id!($conn => ($table id = $id; <- $update))\n };\n ($conn:expr => ($table:ident $id_field:ident = $id:expr; <- $update:expr)) => {\n update_by_id!($conn => ($table filter($id_field.eq($id)); <- $update))\n };\n ($conn:expr => ($table:ident filter($filter:expr); <- $update:expr)) => {\n {\n use $crate::error::database::map_database_error as map_db_err;\n diesel::update($table)\n .set($update)\n .filter($filter)\n .execute($conn)\n .map_err(map_db_err(Some(stringify!($table))))\n }\n };\n}\n\n#[macro_export]\nmacro_rules! paginator {\n ($conn:ident, $w:ident, $rt:ty, $lg:block) => {\n {\n use $crate::message::PaginatedListMessage as PaginatedMessage;\n use $crate::error::database::map_database_error as map_db_err;\n use $crate::result::Result as UResult;\n let paginator = || -> UResult<PaginatedMessage<$rt>> {\n let counter = || { $lg };\n let getter = || { $lg };\n\n let count = counter().count().first::<i64>($conn).map_err(map_db_err(Some(\"<paginating>\")))?;\n let results = getter()\n .limit($w.per_page)\n .offset(($w.page - 1) * $w.per_page)\n .load::<$rt>($conn).map_err(map_db_err(Some(\"<paginating>\")))?;\n\n Ok(PaginatedMessage { list: results, total: count, page: $w.page, per_page: $w.per_page })\n };\n\n paginator\n }\n };\n ($conn:ident, $fields:expr, $w:ident, $rt:ty, $lg:block) => {\n {\n use $crate::message::PaginatedListMessage as PaginatedMessage;\n use $crate::error::database::map_database_error as map_db_err;\n use $crate::result::Result as UResult;\n let paginator = || -> UResult<PaginatedMessage<$rt>> {\n let counter = || { $lg };\n let getter = || { $lg };\n\n let count = counter().count().first::<i64>($conn).map_err(map_db_err(Some(\"<paginating>\")))?;\n let results = getter()\n .select($fields)\n .limit($w.per_page)\n .offset(($w.page - 1) * $w.per_page)\n .load::<$rt>($conn).map_err(map_db_err(Some(\"<paginating>\")))?;\n\n Ok(PaginatedMessage { list: results, total: count, page: $w.page, per_page: $w.per_page })\n };\n\n paginator\n }\n };\n}\n\nimpl Actor for DatabaseExecutor {\n type Context = SyncContext<Self>;\n}\n\nimpl DatabaseExecutor {\n pub fn connection(&mut self) -> Result<Conn, Error> {\n Ok(self.0.get().map_err(Error::database_connection_get_error)?)\n }\n}"},"prefix":{"kind":"string","value":"use actix::*;\nuse actix_web::*;\nuse diesel;\nuse diesel::prelude::MysqlConnection;\nuse diesel::r2d2::{ Pool, PooledConnection, ConnectionManager };\nuse diesel::sql_types;\n\nuse error::Error;\n\npub struct DatabaseExecutor(pub Pool<ConnectionManager<MysqlConnection>>);\n\npub type Conn = PooledConnection<ConnectionManager<MysqlConnection>>;\n\nno_arg_sql_function!(last_insert_id, sql_types::Unsigned<sql_types::BigInt>);\n\n#[macro_export]\nmacro_rules! last_insert_id {\n ($conn:expr, $table:expr) => {\n {\n use $crate::diesel;\n use $crate::database::last_insert_id as lastid;\n use $crate::error::database::map_database_error as map_db_err;\n let generated_id: u64 = diesel::select(lastid)\n .first($conn)\n .map_err(map_db_err($table))?;\n\n generated_id\n }\n };\n}\n\n#[macro_export]\nmacro_rules! delete_by_id {\n ($conn:expr => ($table:ident # = $id:expr)) => {\n delete_by_id!($conn => ($table id = $id))\n };\n ($conn:expr => ($table:ident $id_field:ident = $id:expr)) ="},"suffix":{"kind":"string","value":"ome(stringify!($table))))\n }\n };\n}\n\n#[macro_export]\nmacro_rules! update_by_id {\n ($conn:expr => ($table:ident # = $id:expr; <- $update:expr)) => {\n update_by_id!($conn => ($table id = $id; <- $update))\n };\n ($conn:expr => ($table:ident $id_field:ident = $id:expr; <- $update:expr)) => {\n update_by_id!($conn => ($table filter($id_field.eq($id)); <- $update))\n };\n ($conn:expr => ($table:ident filter($filter:expr); <- $update:expr)) => {\n {\n use $crate::error::database::map_database_error as map_db_err;\n diesel::update($table)\n .set($update)\n .filter($filter)\n .execute($conn)\n .map_err(map_db_err(Some(stringify!($table))))\n }\n };\n}\n\n#[macro_export]\nmacro_rules! paginator {\n ($conn:ident, $w:ident, $rt:ty, $lg:block) => {\n {\n use $crate::message::PaginatedListMessage as PaginatedMessage;\n use $crate::error::database::map_database_error as map_db_err;\n use $crate::result::Result as UResult;\n let paginator = || -> UResult<PaginatedMessage<$rt>> {\n let counter = || { $lg };\n let getter = || { $lg };\n\n let count = counter().count().first::<i64>($conn).map_err(map_db_err(Some(\"<paginating>\")))?;\n let results = getter()\n .limit($w.per_page)\n .offset(($w.page - 1) * $w.per_page)\n .load::<$rt>($conn).map_err(map_db_err(Some(\"<paginating>\")))?;\n\n Ok(PaginatedMessage { list: results, total: count, page: $w.page, per_page: $w.per_page })\n };\n\n paginator\n }\n };\n ($conn:ident, $fields:expr, $w:ident, $rt:ty, $lg:block) => {\n {\n use $crate::message::PaginatedListMessage as PaginatedMessage;\n use $crate::error::database::map_database_error as map_db_err;\n use $crate::result::Result as UResult;\n let paginator = || -> UResult<PaginatedMessage<$rt>> {\n let counter = || { $lg };\n let getter = || { $lg };\n\n let count = counter().count().first::<i64>($conn).map_err(map_db_err(Some(\"<paginating>\")))?;\n let results = getter()\n .select($fields)\n .limit($w.per_page)\n .offset(($w.page - 1) * $w.per_page)\n .load::<$rt>($conn).map_err(map_db_err(Some(\"<paginating>\")))?;\n\n Ok(PaginatedMessage { list: results, total: count, page: $w.page, per_page: $w.per_page })\n };\n\n paginator\n }\n };\n}\n\nimpl Actor for DatabaseExecutor {\n type Context = SyncContext<Self>;\n}\n\nimpl DatabaseExecutor {\n pub fn connection(&mut self) -> Result<Conn, Error> {\n Ok(self.0.get().map_err(Error::database_connection_get_error)?)\n }\n}"},"middle":{"kind":"string","value":"> {\n {\n use $crate::error::database::map_database_error as map_db_err;\n diesel::delete($table)\n .filter($id_field.eq($id))\n .execute($conn)\n .map_err(map_db_err(Some(stringify!($table))))\n }\n };\n}\n\n#[macro_export]\nmacro_rules! find_by_id {\n ($conn:expr => ($table:ident # = $id:expr => $ty:ty)) => {\n find_by_id!($conn => ($table id = $id => $ty))\n };\n ($conn:expr => ($table:ident($fields:expr) # = $id:expr => $ty:ty)) => {\n find_by_id!($conn => ($table($fields) id = $id => $ty))\n };\n ($conn:expr => ($table:ident $id_field:ident = $id:expr => $ty:ty)) => {\n {\n use $crate::error::database::map_database_error as map_db_err;\n $table\n .filter($id_field.eq($id))\n .first::<$ty>($conn)\n .map_err(map_db_err(Some(stringify!($table))))\n }\n };\n ($conn:expr => ($table:ident($fields:expr) $id_field:ident = $id:expr => $ty:ty)) => {\n {\n use $crate::error::database::map_database_error as map_db_err;\n $table\n .select($fields)\n .filter($id_field.eq($id))\n .first::<$ty>($conn)\n .map_err(map_db_err(Some(stringify!($table))))\n }\n };\n ($conn:expr => ($table:ident($fields:expr) filter($filter:expr) => $ty:ty)) => {\n {\n use $crate::error::database::map_database_error as map_db_err;\n $table\n .select($fields)\n .filter($filter)\n .first::<$ty>($conn)\n .map_err(map_db_err(S"},"strategy":{"kind":"string","value":"random"},"context_items":{"kind":"list like","value":[{"content":"#[derive(Deserialize, Debug, Clone)]\n\nstruct CreateContent {\n\n\n\n}\n\n\n","file_path":"src/controllers/admin/content.rs","rank":0,"score":48109.37637340417},{"content":"pub fn map_database_error(target: Option<&'static str>) -> impl FnOnce(DieselError) -> Error {\n\n move |err: DieselError| {\n\n let target = target.unwrap_or(\"[unknown]\");\n\n match err {\n\n DieselError::NotFound => Error::not_found_error::<DieselError>(None, Some(error_msg(NOT_FOUND, \"Resource or data not found.\", Some(ErrorDetail::String(format!(\"Target table: {}\", target)))))),\n\n DieselError::DatabaseError(kind, info) => {\n\n let mut detail = HashMap::new();\n\n detail.insert(\"message\".to_string(), Some(ErrorDetail::String(info.message().to_string())));\n\n detail.insert(\"table\".to_string(), info.table_name().map(|v| ErrorDetail::String(v.to_string())));\n\n detail.insert(\"detail\".to_string(), info.details().map(|v| ErrorDetail::String(v.to_string())));\n\n\n\n match kind {\n\n DieselDatabaseErrorKind::UniqueViolation => Error::conflict::<DieselError>(None, Some(error_msg(CONFLICT, \"Data conflict.\", Some(ErrorDetail::Hash(detail))))),\n\n _ => Error::internal_server_error::<DieselError>(None, Some(error_msg(UNKNOWN_DB_ERROR, \"Unknown database error.\", Some(ErrorDetail::Hash(detail)))))\n\n }\n\n }\n\n _ => Error::internal_server_error::<DieselError>(None, Some(error_msg(UNKNOWN_DB_ERROR, \"Unknown database error.\", Some(ErrorDetail::String(format!(\"Table: {}, Error: {:?}\", target, err))))))\n\n }\n\n }\n\n}\n","file_path":"src/error/database.rs","rank":1,"score":45537.47044392771},{"content":"pub fn error_handler<S, T: AsRef<HttpRequest<S>>>(req: T) -> impl FnOnce(Error) -> ActixError {\n\n let json = if let Ok(Some(mime)) = req.as_ref().mime_type() {\n\n mime.subtype() == mime::JSON || mime.suffix() == Some(mime::JSON)\n\n } else {\n\n false\n\n };\n\n\n\n move |err: Error| {\n\n if json {\n\n let json = JsonError(err);\n\n json.into()\n\n } else {\n\n let html = HtmlError(err);\n\n html.into()\n\n }\n\n }\n\n}\n\n\n\n#[derive(Fail, Debug, Serialize)]\n\n#[fail(display = \"code: {}, error: {}\", code, message)]\n","file_path":"src/error/mod.rs","rank":2,"score":41113.94079029152},{"content":"type PaginatedCategoryList = Result<PaginatedListMessage<CategoryDisplay>>;\n\n\n\n#[derive(Debug, Clone, Serialize, Deserialize, Queryable)]\n\npub struct CategoryBase {\n\n pub id: u32,\n\n pub name: String,\n\n pub display_name: String,\n\n}\n\n\n\n#[derive(Deserialize, Insertable, Debug)]\n\n#[table_name = \"categories\"]\n\npub struct NewCategory {\n\n pub name: String,\n\n pub display_name: String,\n\n pub description: String,\n\n pub sort: Option<i16>,\n\n}\n\n\n\n#[derive(Debug, Clone, Serialize, Deserialize, Queryable)]\n\npub struct CategoryDisplay {\n","file_path":"src/models/category.rs","rank":3,"score":37437.94859368881},{"content":"pub fn convert_string_to_bool(origin: String) -> bool {\n\n match origin.as_str() {\n\n \"true\" | \"TRUE\" | \"1\" => true,\n\n \"false\" | \"FALSE\" | \"0\" => false,\n\n _ => false,\n\n }\n\n}","file_path":"src/utils/helper.rs","rank":4,"score":35834.50996894282},{"content":"pub fn home(req: HttpRequest<AppState>) -> impl Responder {\n\n let ref_req = Rc::new(req);\n\n let req_for_contents = Rc::clone(&ref_req);\n\n let req_for_pushes = Rc::clone(&ref_req);\n\n let req_for_recommends = Rc::clone(&ref_req);\n\n let req_for_err = Rc::clone(&ref_req);\n\n\n\n let default_content = Pagination {\n\n page: 1,\n\n per_page: 10,\n\n filter: Some(content::GetContents::default()),\n\n };\n\n\n\n let default_pushes = Pagination {\n\n page: 1,\n\n per_page: 3,\n\n filter: Some(push_message::GetPushMessages::default()),\n\n };\n\n\n\n let default_recommends = recommend::GetRecommendContents::default();\n","file_path":"src/controllers/blog/index.rs","rank":5,"score":31832.26623770537},{"content":"pub fn source(req: HttpRequest<AppState>) -> impl Responder {\n\n let ref_req = Rc::new(req);\n\n let req_for_contents = Rc::clone(&ref_req);\n\n let req_for_err = Rc::clone(&ref_req);\n\n\n\n match req_for_contents.match_info().get(\"name\") {\n\n Some(name) => {\n\n if req_for_contents.state().static_assets_handle {\n\n if name == \"favicon.ico\" {\n\n use std::io::ErrorKind;\n\n use std::path::PathBuf;\n\n\n\n let req_for_static = Rc::clone(&ref_req);\n\n let req_for_error = Rc::clone(&ref_req);\n\n let directory = Arc::clone(&req_for_static.state().public_path);\n\n let path = match *directory {\n\n Some(ref ref_directory) => PathBuf::from(ref_directory).join(name),\n\n None => panic!(\"Error: Fatal system logic error\"),\n\n };\n\n\n","file_path":"src/controllers/blog/content.rs","rank":6,"score":31832.26623770537},{"content":"pub fn content(req: HttpRequest<AppState>) -> impl Responder {\n\n let ref_req = Rc::new(req);\n\n let req_for_err = Rc::clone(&ref_req);\n\n\n\n match find_content(ref_req, None) {\n\n Ok(fut) => {\n\n fut\n\n .and_then(|res| {\n\n #[derive(Serialize)]\n\n struct Content {\n\n title: String,\n\n content: String,\n\n published_at_o: Option<NaiveDateTime>,\n\n published_at: Option<String>,\n\n }\n\n\n\n let origin: content::ContentFullDisplay = res?;\n\n let data = Content {\n\n content: markdown_to_html(&origin.content.unwrap_or(String::from(\"\")), &ComrakOptions::default()),\n\n title: origin.title,\n","file_path":"src/controllers/blog/content.rs","rank":7,"score":31832.26623770537},{"content":"pub fn create(req: HttpRequest<AppState>) -> impl Responder {\n\n let req_ref = Rc::new(req);\n\n\n\n \"\"\n\n}","file_path":"src/controllers/admin/content.rs","rank":8,"score":31832.26623770537},{"content":"pub fn rss(req: HttpRequest<AppState>) -> impl Responder {\n\n let req_ref = Rc::new(req);\n\n let req_for_db = Rc::clone(&req_ref);\n\n let req_for_data = Rc::clone(&req_ref);\n\n let req_for_err = Rc::clone(&req_ref);\n\n let setting = get_site_setting();\n\n let mut channel: Channel = ChannelBuilder::default()\n\n .title(\"Inspirer blog article\")\n\n .link(setting.site.home)\n\n .description(\"An RSS feed.\")\n\n .build()\n\n .unwrap();\n\n\n\n let default_getter = content::GetContents {\n\n category: Some(content::CategoryMatcher::NotZero),\n\n content_type: Some(1),\n\n ..Default::default()\n\n };\n\n let default_content = Pagination::new(Some(1), Some(10), Some(default_getter));\n\n\n","file_path":"src/controllers/blog/rss.rs","rank":9,"score":31832.26623770537},{"content":"pub fn admin_routes<S>(scope: Scope<S>) -> Scope<S>\n\n where HttpRequest<AppState>: FromRequest<S>\n\n{\n\n scope\n\n .route(\"/authentication\", Method::POST, admin::authorization::authorization)\n\n .nested(\"\", |scope| {\n\n scope.middleware(MAuthenticate)\n\n .route(\"/session/current-user\", Method::GET, admin::user::get_current_user_info)\n\n .route(\"/category\", Method::GET, admin::category::get_category_list)\n\n .route(\"/category\", Method::POST, admin::category::create_category)\n\n .route(\"/category/{id:\\\\d+}\", Method::DELETE, admin::category::delete_category)\n\n .route(\"/category/{id:\\\\d+}\", Method::PUT, admin::category::update_category)\n\n .route(\"/category/{id:\\\\d+}\", Method::GET, admin::category::get_category)\n\n .route(\"/content\", Method::POST, admin::content::create_content)\n\n .route(\"/content\", Method::GET, admin::content::get_content_list)\n\n .route(\"/content/{id:\\\\d+}\", Method::GET, admin::content::get_content)\n\n .route(\"/content/{id:\\\\d+}\", Method::DELETE, admin::content::delete_content)\n\n .route(\"/content/{id:\\\\d+}\", Method::PUT, admin::content::update_content)\n\n })\n\n}","file_path":"src/routes/admin.rs","rank":10,"score":31711.13939920818},{"content":"pub fn article_list(req: HttpRequest<AppState>) -> impl Responder {\n\n let ref_req = Rc::new(req);\n\n let mut default_content = Pagination::<content::GetContents>::from_request(Rc::clone(&ref_req));\n\n let mut default_getter = content::GetContents::default();\n\n\n\n default_getter.category = Some(content::CategoryMatcher::NotZero);\n\n default_getter.content_type = Some(1);\n\n default_content.filter = Some(default_getter);\n\n\n\n content_list(ref_req, default_content)\n\n}\n\n\n","file_path":"src/controllers/blog/content.rs","rank":11,"score":31220.06336997304},{"content":"pub fn blog_routes<S: 'static>(scope: Scope<S>) -> Scope<S>\n\n where HttpRequest<AppState>: FromRequest<S>\n\n{\n\n scope\n\n .route(\"/\", Method::GET, blog::index::home)\n\n .route(\"/article\", Method::GET, blog::content::article_list)\n\n .resource(\"/article/{name}\", |r| {\n\n r.name(\"article\");\n\n r.method(Method::GET).with(blog::content::content);\n\n })\n\n .route(\"/push\", Method::GET, blog::push_message::push_message_list)\n\n .route(\"/feed\", Method::GET, blog::rss::rss)\n\n .route(\"/{name}\", Method::GET, blog::content::source)\n\n}","file_path":"src/routes/blog.rs","rank":12,"score":30368.982808860044},{"content":"pub fn push_message_list(req: HttpRequest<AppState>) -> impl Responder {\n\n let ref_req = Rc::new(req);\n\n let req_for_pushes = Rc::clone(&ref_req);\n\n let req_for_err = Rc::clone(&ref_req);\n\n let query_message = Pagination::<push_message::GetPushMessages>::from_request(Rc::clone(&ref_req));\n\n\n\n req_for_pushes.state().database.send(query_message).from_err()\n\n .and_then(|push_messages| {\n\n let push_messages: PaginatedListMessage<push_message::PushMessageDisplay> = push_messages?;\n\n let mut list: Vec<PushMessage> = vec![];\n\n\n\n for item in push_messages.list {\n\n list.push(PushMessage {\n\n id: item.id,\n\n content: item.content,\n\n created_at: item.created_at.format(\"%Y-%m-%d\").to_string(),\n\n created_at_o: item.created_at,\n\n })\n\n }\n\n\n","file_path":"src/controllers/blog/push_message.rs","rank":13,"score":30107.196058896465},{"content":"alter table `contents`\n\n add column `as_page` tinyint(1) not null default 0 comment '是否可以作为单页面' after `category_id`;\n\n\n","file_path":"migrations/2018-08-29-084801_version_1_1_migration/up.sql","rank":14,"score":25806.324259473},{"content":"alter table `contents`\n\n drop column `as_page`;\n\n\n","file_path":"migrations/2018-08-29-084801_version_1_1_migration/down.sql","rank":15,"score":25806.324259473},{"content":"create table if not exists `subjects` (\n\n `id` int unsigned not null auto_increment,\n\n `name` varchar(255) character set utf8mb4 collate utf8mb4_general_ci,\n\n `title` varchar(255) character set utf8mb4 collate utf8mb4_general_ci not null,\n\n `keywords` varchar(255) character set utf8mb4 collate utf8mb4_general_ci not null default '',\n\n `description` varchar(500) character set utf8mb4 collate utf8mb4_general_ci not null default '',\n\n `sort` smallint not null default 0,\n\n `created_at` timestamp not null default current_timestamp,\n\n `updated_at` timestamp null on update current_timestamp,\n\n primary key (`id`),\n\n unique key `union_name` (`name`),\n\n key `search_title` (`name`, `title`)\n\n) character set = utf8mb4 collate = utf8mb4_general_ci comment = '专题表';\n\n\n","file_path":"migrations/2018-06-26-090532_version_1_0_migration/up.sql","rank":16,"score":24680.997942494858},{"content":"DROP TABLE IF EXISTS `contents`;\n","file_path":"migrations/2018-06-26-090532_version_1_0_migration/down.sql","rank":17,"score":24680.997942494858},{"content":"create table if not exists `contents` (\n\n `id` int unsigned not null auto_increment,\n\n `name` varchar(255) character set utf8mb4 collate utf8mb4_general_ci,\n\n `title` varchar(255) character set utf8mb4 collate utf8mb4_general_ci not null,\n\n `category_id` int unsigned default null,\n\n `keywords` varchar(255) character set utf8mb4 collate utf8mb4_general_ci not null default '',\n\n `description` varchar(500) character set utf8mb4 collate utf8mb4_general_ci not null default '',\n\n `sort` smallint not null default 0,\n\n `content_type` smallint unsigned not null default 1,\n\n `content` mediumtext character set utf8mb4 collate utf8mb4_general_ci null,\n\n `display` tinyint(1) not null default 1,\n\n `published_at` timestamp null,\n\n `modified_at` timestamp null,\n\n `created_at` timestamp not null default current_timestamp,\n\n `updated_at` timestamp null on update current_timestamp,\n\n primary key (`id`),\n\n unique key `union_name` (`name`),\n\n key `search_title` (`name`, `title`)\n\n) character set = utf8mb4 collate = utf8mb4_general_ci comment = '内容表';\n\n\n","file_path":"migrations/2018-06-26-090532_version_1_0_migration/up.sql","rank":18,"score":24680.997942494858},{"content":"DROP TABLE IF EXISTS `categories`;\n","file_path":"migrations/2018-06-26-090532_version_1_0_migration/down.sql","rank":19,"score":24680.997942494858},{"content":"DROP TABLE IF EXISTS `subjects`;\n","file_path":"migrations/2018-06-26-090532_version_1_0_migration/down.sql","rank":20,"score":24680.997942494858},{"content":"create table if not exists `categories` (\n\n `id` int unsigned not null auto_increment,\n\n `name` varchar(255) character set utf8mb4 collate utf8mb4_general_ci not null,\n\n `display_name` varchar(255) character set utf8mb4 collate utf8mb4_general_ci not null,\n\n `keywords` varchar(255) character set utf8mb4 collate utf8mb4_general_ci not null default '',\n\n `description` varchar(500) character set utf8mb4 collate utf8mb4_general_ci not null default '',\n\n `sort` smallint(4) not null default 0,\n\n `created_at` timestamp not null default current_timestamp,\n\n `updated_at` timestamp null on update current_timestamp,\n\n primary key (`id`),\n\n unique key `union_name` (`name`)\n\n) character set = utf8mb4 collate = utf8mb4_general_ci comment = '内容分类表';\n\n\n","file_path":"migrations/2018-06-26-090532_version_1_0_migration/up.sql","rank":21,"score":24680.997942494858},{"content":"pub fn error_msg<T: Into<String>>(code: u16, msg: T, body: Option<ErrorDetail>) -> ErrorMessage<ErrorDetail> {\n\n ErrorMessage::<ErrorDetail> {\n\n code,\n\n msg: msg.into(),\n\n body\n\n }\n\n}\n\n\n","file_path":"src/error/mod.rs","rank":22,"score":24253.366237227114},{"content":"create table if not exists `recommend_contents` (\n\n `id` int unsigned not null auto_increment,\n\n `content_id` int unsigned default null,\n\n `source` varchar(500) character set utf8mb4 collate utf8mb4_general_ci not null,\n\n `title` varchar(255) character set utf8mb4 collate utf8mb4_general_ci not null,\n\n `summary` varchar(500) character set utf8mb4 collate utf8mb4_general_ci not null,\n\n `created_at` timestamp not null default current_timestamp,\n\n `updated_at` timestamp null on update current_timestamp,\n\n primary key (`id`),\n\n key `content` (`content_id`)\n\n) character set = utf8mb4 collate = utf8mb4_general_ci comment = '推荐内容表';","file_path":"migrations/2018-08-29-084801_version_1_1_migration/up.sql","rank":23,"score":23649.714084302428},{"content":"create table if not exists `push_messages` (\n\n `id` int unsigned not null auto_increment,\n\n `content` varchar(500) character set utf8mb4 collate utf8mb4_general_ci not null,\n\n `sort` smallint not null default 0,\n\n `created_at` timestamp not null default current_timestamp,\n\n `updated_at` timestamp null on update current_timestamp,\n\n primary key (`id`),\n\n key `search` (`content`)\n\n) character set = utf8mb4 collate = utf8mb4_general_ci comment = 'PUSH 消息表';\n\n\n","file_path":"migrations/2018-06-26-090532_version_1_0_migration/up.sql","rank":24,"score":23649.714084302428},{"content":"DROP TABLE IF EXISTS `subject_relates`;","file_path":"migrations/2018-06-26-090532_version_1_0_migration/down.sql","rank":25,"score":23649.714084302428},{"content":"DROP TABLE IF EXISTS `push_messages`;\n","file_path":"migrations/2018-06-26-090532_version_1_0_migration/down.sql","rank":26,"score":23649.714084302428},{"content":"create table if not exists `subject_relates` (\n\n `subject_id` int unsigned not null,\n\n `content_id` int unsigned not null,\n\n `sort` smallint not null default 0,\n\n `created_at` timestamp not null default current_timestamp,\n\n `updated_at` timestamp null on update current_timestamp,\n\n primary key (`subject_id`, `content_id`)\n\n) comment = '专题内容关联表';","file_path":"migrations/2018-06-26-090532_version_1_0_migration/up.sql","rank":27,"score":23649.714084302428},{"content":"drop table if exists `recommend_contents`;","file_path":"migrations/2018-08-29-084801_version_1_1_migration/down.sql","rank":28,"score":23649.714084302428},{"content":"fn find_content(req: Rc<HttpRequest<AppState>>, filter: Option<FindFilter>) -> StdResult<impl Future<Item=Result<content::ContentFullDisplay>, Error=Error>, ActixError> {\n\n let req_for_contents = Rc::clone(&req);\n\n let req_for_err = Rc::clone(&req);\n\n let name = match req_for_contents.match_info().get(\"name\") {\n\n Some(name) => {\n\n let numeric = regex::Regex::new(r\"^\\d+$\").unwrap();\n\n let name_string = regex::Regex::new(r\"^\\w+(-\\w+)*$\").unwrap();\n\n\n\n if numeric.is_match(name) {\n\n let id = name.parse::<u32>().unwrap();\n\n Ok(content::Find::ById(id))\n\n } else if name_string.is_match(name) {\n\n Ok(content::Find::ByName(name.into()))\n\n } else {\n\n Err(error_handler(req_for_err)(Error::bad_request_error(Some(\"[param]\"), None)))\n\n }\n\n }\n\n None => Err(error_handler(req_for_err)(Error::bad_request_error(Some(\"[param]\"), None))),\n\n };\n\n\n\n name.map(move |name| {\n\n req_for_contents.state().database\n\n .send(content::FindContent {\n\n inner: name,\n\n filter,\n\n })\n\n .from_err()\n\n })\n\n}\n\n\n","file_path":"src/controllers/blog/content.rs","rank":29,"score":12266.476914902847},{"content":"use actix::{Message, Handler};\n\nuse diesel;\n\nuse diesel::*;\n\nuse chrono::NaiveDateTime;\n\n\n\nuse result::Result;\n\nuse database::{DatabaseExecutor, Conn, last_insert_id};\n\nuse message::{PaginatedListMessage, Pagination, UpdateByID};\n\nuse error::{Error, database::map_database_error};\n\nuse schema::push_messages;\n\n\n\n#[derive(Deserialize, Insertable, Debug)]\n\n#[table_name = \"push_messages\"]\n\npub struct NewPushMessage {\n\n pub content: String,\n\n}\n\n\n\n#[derive(Deserialize, AsChangeset, Debug)]\n\n#[table_name = \"push_messages\"]\n\npub struct UpdatePushMessage {\n","file_path":"src/models/push_message.rs","rank":32,"score":15.560294586319692},{"content":"use actix::{Message, Handler};\n\nuse diesel;\n\nuse diesel::*;\n\nuse chrono::NaiveDateTime;\n\n\n\nuse result::Result;\n\nuse database::{DatabaseExecutor, Conn, last_insert_id};\n\nuse message::{PaginatedListMessage, Pagination, UpdateByID};\n\nuse error::{Error, database::map_database_error};\n\nuse schema::contents;\n\nuse schema::contents::dsl as column;\n\nuse models::category::FindCategory;\n\n\n\n#[derive(Deserialize, Insertable, Debug)]\n\n#[table_name = \"contents\"]\n\npub struct NewContent {\n\n pub name: Option<String>,\n\n pub title: String,\n\n pub category_id: Option<u32>,\n\n pub keywords: String,\n","file_path":"src/models/content.rs","rank":33,"score":15.214014857159071},{"content":"use std::collections::{HashMap, HashSet};\n\n\n\nuse actix::{Message, Handler};\n\nuse diesel;\n\nuse diesel::*;\n\nuse chrono::NaiveDateTime;\n\n\n\nuse result::Result;\n\nuse database::{DatabaseExecutor, Conn, last_insert_id};\n\nuse message::{PaginatedListMessage, Pagination, UpdateByID};\n\nuse error::{Error, database::map_database_error};\n\n\n\nuse schema::subjects;\n\nuse schema::subject_relates;\n\n\n\npub struct Subject;\n\n\n\n#[derive(Deserialize, Insertable, Debug)]\n\n#[table_name = \"subjects\"]\n\npub struct NewSubject {\n","file_path":"src/models/subject.rs","rank":34,"score":14.943558846573772},{"content":"use actix::{Message, Handler};\n\nuse diesel;\n\nuse diesel::*;\n\nuse diesel::dsl::exists;\n\nuse chrono::NaiveDateTime;\n\n\n\nuse result::Result;\n\nuse database::{DatabaseExecutor, Conn, last_insert_id};\n\nuse message::{PaginatedListMessage, Pagination, UpdateByID};\n\nuse error::{Error, database::map_database_error};\n\nuse schema::recommend_contents;\n\n\n\n#[derive(Serialize, Deserialize, Debug, Clone, Queryable)]\n\npub struct RecommendContentDisplay {\n\n pub id: u32,\n\n pub content_id: Option<u32>,\n\n pub source: String,\n\n pub title: String,\n\n pub summary: String,\n\n pub created_at: NaiveDateTime,\n","file_path":"src/models/recommend.rs","rank":35,"score":14.536159707878902},{"content":"use std::rc::Rc;\n\nuse std::sync::Arc;\n\nuse actix::*;\n\nuse actix::dev::{Request, ToEnvelope};\n\nuse diesel::{sql_query, RunQueryDsl};\n\nuse diesel::prelude::MysqlConnection;\n\nuse diesel::r2d2::{ConnectionManager, Pool};\n\nuse database::DatabaseExecutor;\n\n\n\npub struct Config {\n\n pub static_assets_handle: bool,\n\n pub static_assets_path: Option<String>,\n\n pub public_path: Option<String>,\n\n pub database_url: String,\n\n pub database_timezone: Option<String>,\n\n}\n\n\n\n#[derive(Clone)]\n\npub struct AppState {\n\n pub static_assets_handle: bool,\n","file_path":"src/state.rs","rank":36,"score":12.995140067614457},{"content":" use schema::categories::dsl::*;\n\n\n\n Ok(\n\n categories\n\n .filter(name.eq(category_name))\n\n .first::<CategoryFullDisplay>(connection)\n\n .map_err(map_database_error(Some(\"categories\")))?\n\n )\n\n }\n\n\n\n pub fn create(connection: &Conn, category: NewCategory) -> Result<u64> {\n\n use schema::categories::dsl::*;\n\n\n\n diesel::insert_into(categories)\n\n .values(category)\n\n .execute(connection)\n\n .map_err(map_database_error(Some(\"categories\")))?;\n\n\n\n let generated_id: u64 = diesel::select(last_insert_id)\n\n .first(connection)\n","file_path":"src/models/category.rs","rank":38,"score":12.696405077869231},{"content":" .map_err(map_database_error(Some(\"contents\")))?;\n\n\n\n let generated_id: u64 = diesel::select(last_insert_id)\n\n .first(connection)\n\n .map_err(map_database_error(Some(\"contents\")))?;\n\n\n\n Ok(generated_id as u32)\n\n }\n\n\n\n pub fn delete(connection: &Conn, target: u32) -> Result<usize> {\n\n use schema::contents::dsl::*;\n\n\n\n let count = delete_by_id!(connection => (\n\n contents # = target\n\n ))?;\n\n\n\n Ok(count)\n\n }\n\n\n\n pub fn publish(connection: &Conn, target: u32) -> Result<Option<ContentFullDisplay>> {\n","file_path":"src/models/content.rs","rank":39,"score":12.536911278812902},{"content":"use actix::{Message, Handler};\n\nuse diesel;\n\nuse diesel::*;\n\nuse diesel::dsl::exists;\n\nuse chrono::NaiveDateTime;\n\n\n\nuse result::Result;\n\nuse database::{DatabaseExecutor, Conn, last_insert_id};\n\nuse message::{PaginatedListMessage, Pagination, UpdateByID};\n\nuse error::{Error, database::map_database_error};\n\nuse schema::categories;\n\nuse schema::categories::dsl as column;\n\nuse regex::Regex;\n\n\n","file_path":"src/models/category.rs","rank":40,"score":12.522930379247322},{"content":" };\n\n\n\n Self::create(connection, creator)\n\n }\n\n\n\n pub fn create(connection: &Conn, data: NewRecommendContent) -> Result<u32> {\n\n use schema::recommend_contents::dsl::*;\n\n\n\n diesel::insert_into(recommend_contents)\n\n .values(&data)\n\n .execute(connection)\n\n .map_err(map_database_error(Some(\"recommend_contents\")))?;\n\n\n\n let generated_id: u64 = diesel::select(last_insert_id)\n\n .first(connection)\n\n .map_err(map_database_error(Some(\"recommend_contents\")))?;\n\n\n\n Ok(generated_id as u32)\n\n }\n\n\n","file_path":"src/models/recommend.rs","rank":41,"score":11.842601221020233},{"content":" .values(&data)\n\n .execute(connection)\n\n .map_err(map_database_error(Some(\"push_messages\")))?;\n\n\n\n let generated_id: u64 = diesel::select(last_insert_id)\n\n .first(connection)\n\n .map_err(map_database_error(Some(\"push_messages\")))?;\n\n\n\n Ok(generated_id as u32)\n\n }\n\n\n\n pub fn find_by_id(connection: &Conn, target: u32) -> Result<PushMessageDisplay> {\n\n use schema::push_messages::dsl::*;\n\n\n\n find_by_id!(connection => (\n\n push_messages # = target => PushMessageDisplay\n\n ))\n\n }\n\n\n\n pub fn update(connection: &Conn, target: u32, data: UpdatePushMessage) -> Result<Option<PushMessageDisplay>> {\n","file_path":"src/models/push_message.rs","rank":43,"score":11.563568780598185},{"content":"\n\nimpl Content {\n\n pub const DISPLAY_COLUMNS: (\n\n column::id, column::name, column::title,\n\n column::category_id, column::keywords, column::description,\n\n column::sort, column::content_type, column::display,\n\n column::published_at, column::modified_at\n\n ) = (\n\n column::id, column::name, column::title,\n\n column::category_id, column::keywords, column::description,\n\n column::sort, column::content_type, column::display,\n\n column::published_at, column::modified_at\n\n );\n\n\n\n pub fn create(connection: &Conn, data: NewContent) -> Result<u32> {\n\n use schema::contents::dsl::*;\n\n\n\n diesel::insert_into(contents)\n\n .values(&data)\n\n .execute(connection)\n","file_path":"src/models/content.rs","rank":44,"score":11.329146997951185},{"content":" pub fn get_relate_base_info_list(connection: &Conn, target: u32, display: bool) -> Result<Vec<SubjectRelateBaseInfo>> {\n\n use schema::contents;\n\n use schema::subject_relates as sr;\n\n\n\n sr::table\n\n .inner_join(contents::table.on(\n\n sr::content_id.eq(contents::id)\n\n .and(contents::display.eq(display))\n\n ))\n\n .select((contents::id, contents::name, contents::title, contents::category_id, contents::sort, contents::content_type, contents::display, sr::sort))\n\n .filter(sr::subject_id.eq(target))\n\n .order_by((sr::sort.desc(), contents::sort.desc()))\n\n .load::<SubjectRelateBaseInfo>(connection)\n\n .map_err(map_database_error(Some(\"subject_relates\")))\n\n }\n\n}\n\n\n\n#[derive(Clone, Debug, Copy)]\n\npub struct GetRelateList {\n\n pub target: u32,\n\n pub display: bool\n\n}","file_path":"src/models/subject.rs","rank":45,"score":11.199991508797991},{"content":" pub updated_at: Option<NaiveDateTime>,\n\n}\n\n\n\n#[derive(Deserialize, Insertable, Debug)]\n\n#[table_name = \"recommend_contents\"]\n\npub struct NewRecommendContent {\n\n pub content_id: u32,\n\n pub source: String,\n\n pub title: String,\n\n pub summary: String,\n\n}\n\n\n\npub struct RecommendContent;\n\n\n\nimpl RecommendContent {\n\n pub fn push(connection: &Conn, origin_id: u32, summary: Option<String>) -> Result<u32> {\n\n use super::content::Content;\n\n\n\n let result = Content::find_by_id(connection, origin_id, None)?;\n\n let id = result.id.to_string();\n","file_path":"src/models/recommend.rs","rank":47,"score":10.907087877127099},{"content":" }\n\n\n\n Ok(())\n\n })\n\n }\n\n\n\n pub fn find_by_id(connection: &Conn, target: u32) -> Result<SubjectDisplay> {\n\n use schema::subjects::dsl::*;\n\n\n\n find_by_id!(connection => (\n\n subjects # = target => SubjectDisplay\n\n ))\n\n }\n\n\n\n pub fn find_by_name(connection: &Conn, target: String) -> Result<SubjectDisplay> {\n\n use schema::subjects::dsl::*;\n\n\n\n find_by_id!(connection => (\n\n subjects name = target => SubjectDisplay\n\n ))\n","file_path":"src/models/subject.rs","rank":48,"score":10.268277467260889},{"content":" use schema::contents::dsl::*;\n\n use chrono::Utc;\n\n\n\n let count = diesel::update(contents)\n\n .set((display.eq(true), published_at.eq(Some(Utc::now().naive_local()))))\n\n .filter(id.eq(target))\n\n .execute(connection)\n\n .map_err(map_database_error(Some(\"contents\")))?;\n\n\n\n if count > 0 {\n\n Ok(Self::find_by_id(connection, target, None).ok())\n\n } else {\n\n Ok(None)\n\n }\n\n }\n\n\n\n pub fn unpublish(connection: &Conn, target: u32) -> Result<Option<ContentFullDisplay>> {\n\n use schema::contents::dsl::*;\n\n\n\n let count = diesel::update(contents)\n","file_path":"src/models/content.rs","rank":49,"score":10.180613389921602},{"content":" .map_err(map_database_error(Some(\"categories\")))?;\n\n\n\n Ok(generated_id)\n\n }\n\n\n\n pub fn delete(connection: &Conn, category_id: u32) -> Result<usize> {\n\n use schema::categories::dsl::*;\n\n\n\n let count = delete_by_id!(connection => (categories # = category_id))?;\n\n\n\n Ok(count)\n\n }\n\n\n\n pub fn update(connection: &Conn, category_id: u32, update: UpdateCategory) -> Result<Option<CategoryFullDisplay>> {\n\n use schema::categories::dsl::*;\n\n\n\n let count = update_by_id!(connection => (\n\n categories # = category_id; <- &update\n\n ))?;\n\n\n","file_path":"src/models/category.rs","rank":50,"score":10.07740334235989},{"content":" pub sort: Option<i16>,\n\n}\n\n\n\n#[derive(Debug, Clone, Serialize, Deserialize, Queryable)]\n\npub struct PushMessageDisplay {\n\n pub id: u32,\n\n pub content: String,\n\n pub sort: i16,\n\n pub created_at: NaiveDateTime,\n\n pub updated_at: Option<NaiveDateTime>,\n\n}\n\n\n\npub struct PushMessage;\n\n\n\nimpl PushMessage {\n\n\n\n pub fn create(connection: &Conn, data: NewPushMessage) -> Result<u32> {\n\n use schema::push_messages::dsl::*;\n\n\n\n diesel::insert_into(push_messages)\n","file_path":"src/models/push_message.rs","rank":51,"score":9.633276836257073},{"content":" }\n\n\n\n pub fn update(connection: &Conn, target: u32, update: UpdateSubject) -> Result<Option<SubjectDisplay>> {\n\n use schema::subjects::dsl::*;\n\n\n\n let count = update_by_id!(connection => (\n\n subjects # = target; <- &update\n\n ))?;\n\n\n\n if count > 0 {\n\n Ok(Self::find_by_id(connection, target).ok())\n\n } else {\n\n Ok(None)\n\n }\n\n }\n\n\n\n pub fn delete(connection: &Conn, target: u32) -> Result<(usize, usize)> {\n\n use schema::subjects::dsl::*;\n\n\n\n connection.transaction(|| {\n","file_path":"src/models/subject.rs","rank":52,"score":9.555999533163517},{"content":" }\n\n\n\n query.order((sort.desc(), created_at.desc(), id.desc()))\n\n });\n\n\n\n paginator()\n\n }\n\n\n\n pub fn find_by_id(connection: &Conn, category_id: u32) -> Result<CategoryFullDisplay> {\n\n use schema::categories::dsl::*;\n\n\n\n Ok(\n\n categories\n\n .filter(id.eq(category_id))\n\n .first::<CategoryFullDisplay>(connection)\n\n .map_err(map_database_error(Some(\"categories\")))?\n\n )\n\n }\n\n\n\n pub fn find_by_name(connection: &Conn, category_name: String) -> Result<CategoryFullDisplay> {\n","file_path":"src/models/category.rs","rank":53,"score":9.293064031392081},{"content":" pub content_type: u16,\n\n pub published_at: Option<NaiveDateTime>,\n\n pub modified_at: Option<NaiveDateTime>,\n\n pub display: bool,\n\n pub relate_sort: i16,\n\n}\n\n\n\nimpl Subject {\n\n pub fn create(connection: &Conn, create: CreateSubject) -> Result<u32> {\n\n use schema::subjects::dsl::*;\n\n\n\n connection.transaction(move || {\n\n let rows: usize = diesel::insert_into(subjects)\n\n .values(&create.subject)\n\n .execute(connection)\n\n .map_err(map_database_error(Some(\"subjects\")))?;\n\n\n\n if rows < 1 {\n\n return Err(Error::internal_server_error(Some(\"[unknown]\"), None));\n\n }\n","file_path":"src/models/subject.rs","rank":54,"score":9.230255738204312},{"content":"use std::collections::HashMap;\n\nuse std::fmt;\n\nuse message::ErrorMessage;\n\nuse diesel::result::{\n\n Error as DieselError,\n\n DatabaseErrorKind as DieselDatabaseErrorKind,\n\n};\n\n\n\nuse super::error_msg;\n\nuse super::Error;\n\nuse super::ErrorDetail;\n\n\n\npub const NOT_FOUND: u16 = 10022;\n\npub const CONFLICT: u16 = 10013;\n\npub const GET_CONNECTION_ERROR: u16 = 10001;\n\npub const UNKNOWN_DB_ERROR: u16 = 10099;\n\n\n","file_path":"src/error/database.rs","rank":55,"score":9.220502430197985},{"content":"use std::borrow::BorrowMut;\n\nuse std::collections::HashMap;\n\nuse actix::MailboxError;\n\nuse actix_web::{HttpRequest, HttpResponse, HttpMessage, http::StatusCode};\n\nuse actix_web::error::{Error as ActixError, ResponseError};\n\nuse std::fmt::{self, Formatter};\n\nuse message::ErrorMessage;\n\nuse tera::{Context, Tera};\n\nuse template::TEMPLATES;\n\nuse mime;\n\n\n\npub mod database;\n\n\n\npub const UNKNOWN_ERROR: u16 = 65535;\n\npub const ACTOR_MAILBOX_ERROR: u16 = 60001;\n\n\n","file_path":"src/error/mod.rs","rank":56,"score":9.089622123078314},{"content":"\n\n let generated_id: u64 = diesel::select(last_insert_id)\n\n .first(connection)\n\n .map_err(map_database_error(Some(\"subjects\")))?;\n\n let generated_id = generated_id as u32;\n\n\n\n match create.relates {\n\n Some(relates) => {\n\n use schema::subject_relates::dsl::*;\n\n\n\n let mut create_relates = Vec::with_capacity(10);\n\n for relate in relates {\n\n create_relates.push(\n\n (subject_id.eq(generated_id), content_id.eq(relate.content_id), sort.eq(relate.sort.unwrap_or(0)))\n\n );\n\n }\n\n\n\n if create_relates.len() > 0 {\n\n diesel::insert_into(subject_relates)\n\n .values(&create_relates)\n","file_path":"src/models/subject.rs","rank":57,"score":8.842495405221767},{"content":" pub description: String,\n\n pub sort: i16,\n\n pub content_type: u16,\n\n pub content: Option<String>,\n\n pub display: bool,\n\n pub published_at: Option<NaiveDateTime>,\n\n pub as_page: bool,\n\n}\n\n\n\n#[derive(Deserialize, AsChangeset, Debug)]\n\n#[table_name = \"contents\"]\n\npub struct UpdateContent {\n\n pub name: Option<String>,\n\n pub title: Option<String>,\n\n pub category_id: Option<u32>,\n\n pub keywords: Option<String>,\n\n pub description: Option<String>,\n\n pub sort: Option<i16>,\n\n pub content_type: Option<u16>,\n\n pub content: Option<String>,\n","file_path":"src/models/content.rs","rank":58,"score":8.715968505739173},{"content":" let count = delete_by_id!(connection => (subjects # = target))?;\n\n if count > 0 {\n\n use schema::subject_relates::dsl::*;\n\n let relates_count = delete_by_id!(connection => (subject_relates subject_id = target))?;\n\n\n\n Ok((count, relates_count))\n\n } else {\n\n Ok((count, 0))\n\n }\n\n })\n\n }\n\n\n\n pub fn get_list(connection: &Conn) {}\n\n\n\n pub fn get_relate_list(connection: &Conn, paginated: Pagination<GetRelateList>) -> Result<PaginatedListMessage<SubjectRelateInfo>> {\n\n use schema::contents;\n\n use schema::subject_relates as sr;\n\n\n\n let target = paginated.filter.ok_or(Error::bad_request_error(Some(\"[param]\"), None))?.target;\n\n let display = paginated.filter.ok_or(Error::bad_request_error(Some(\"[param]\"), None))?.display;\n","file_path":"src/models/subject.rs","rank":59,"score":8.686555919456504},{"content":" query = query.filter(content.like(format!(\"%{}%\", &v)));\n\n }\n\n }\n\n\n\n query.order((sort.desc(), created_at.desc()))\n\n });\n\n\n\n paginator()\n\n }\n\n\n\n pub fn delete(connection: &Conn, target: u32) -> Result<usize> {\n\n use schema::push_messages::dsl::*;\n\n\n\n let count = delete_by_id!(connection => (\n\n push_messages # = target\n\n ))?;\n\n\n\n Ok(count)\n\n }\n\n}\n","file_path":"src/models/push_message.rs","rank":60,"score":7.77304245888177},{"content":"pub struct SubjectRelateBaseInfo {\n\n pub id: u32,\n\n pub name: Option<String>,\n\n pub title: String,\n\n pub category_id: Option<u32>,\n\n pub content_sort: i16,\n\n pub content_type: u16,\n\n pub display: bool,\n\n pub relate_sort: i16,\n\n}\n\n\n\n#[derive(Debug, Clone, Serialize, Deserialize, Queryable)]\n\npub struct SubjectRelateInfo {\n\n pub id: u32,\n\n pub name: Option<String>,\n\n pub title: String,\n\n pub category_id: Option<u32>,\n\n pub description: String,\n\n pub keywords: String,\n\n pub content_sort: i16,\n","file_path":"src/models/subject.rs","rank":61,"score":7.749685817807141},{"content":" .execute(connection)\n\n .map_err(map_database_error(Some(\"subject_relates\")))?;\n\n }\n\n }\n\n None => (),\n\n };\n\n\n\n Ok(generated_id)\n\n })\n\n }\n\n\n\n pub fn sync_relates(connection: &Conn, target: u32, sync: Vec<SubjectRelate>) -> Result<()> {\n\n use schema::subject_relates::dsl::*;\n\n\n\n let mut key_index = Vec::with_capacity(sync.len());\n\n\n\n for item in &sync {\n\n key_index.push(item.content_id);\n\n }\n\n\n","file_path":"src/models/subject.rs","rank":62,"score":7.703710709495733},{"content":" .unwrap_or(1);\n\n let per_page = query.get(\"per_page\")\n\n .map(|v| v.parse::<i64>().unwrap_or(Self::DEFAULT_PER_PAGE))\n\n .unwrap_or(Self::DEFAULT_PER_PAGE);\n\n\n\n Pagination::<T> {\n\n page,\n\n per_page,\n\n filter: None\n\n }\n\n }\n\n}\n\n\n\n#[derive(Copy, Clone)]\n\npub struct UpdateByID<T> {\n\n pub id: u32,\n\n pub update: T,\n\n}\n\n\n\n#[derive(Deserialize,Serialize, Debug)]\n\npub struct CreatedObjectIdMessage {\n\n pub id: u64,\n\n}\n\n\n\n#[derive(Deserialize,Serialize, Debug)]\n\npub struct DeletedObjectMessage {\n\n pub count: u32,\n\n}","file_path":"src/message.rs","rank":63,"score":7.561086769200411},{"content":" use schema::push_messages::dsl::*;\n\n\n\n let count = update_by_id!(connection => (\n\n push_messages # = target; <- &data\n\n ))?;\n\n\n\n if count > 0 {\n\n Ok(Self::find_by_id(connection, target).ok())\n\n } else {\n\n Ok(None)\n\n }\n\n }\n\n\n\n pub fn get_list(connection: &Conn, c: Pagination<GetPushMessages>) -> Result<PaginatedListMessage<PushMessageDisplay>> {\n\n use schema::push_messages::dsl::*;\n\n\n\n let paginator = paginator!(connection, c, PushMessageDisplay, {\n\n let mut query = push_messages.into_boxed();\n\n if let Some(filter) = c.clone().filter {\n\n if let Some(v) = filter.keywords {\n","file_path":"src/models/push_message.rs","rank":64,"score":7.5015358583754415},{"content":" None => (),\n\n };\n\n\n\n query.first::<ContentFullDisplay>(connection).map_err(map_database_error(Some(\"contents\")))\n\n }\n\n\n\n pub fn update(connection: &Conn, target: u32, data: UpdateContent) -> Result<Option<ContentFullDisplay>> {\n\n use schema::contents::dsl::*;\n\n\n\n let count = update_by_id!(connection => (\n\n contents # = target; <- &data\n\n ))?;\n\n\n\n if count > 0 {\n\n Ok(Self::find_by_id(connection, target, None).ok())\n\n } else {\n\n Ok(None)\n\n }\n\n }\n\n\n","file_path":"src/models/content.rs","rank":65,"score":7.436678591594777},{"content":"use error::ErrorDetail;\n\nuse actix_web::HttpRequest;\n\n\n\n/// 错误消息体\n\n///\n\n/// 错误消息体最终会转换为对应的 JSON 格式。\n\n#[derive(Deserialize, Serialize, Debug)]\n\npub struct ErrorMessage<T> {\n\n /// 错误代码，`u16` 类型，默认为 65535，意为未知服务错误\n\n pub code: u16,\n\n /// 错误消息，`String` 类型。该字段简要描述错误信息\n\n pub msg: String,\n\n /// 错误详情\n\n pub body: Option<T>,\n\n}\n\n\n\nimpl<T> ErrorMessage<T> {\n\n pub fn new(code: u16, msg: String, body: Option<T>) -> Self {\n\n ErrorMessage::<T> {\n\n code,\n","file_path":"src/message.rs","rank":66,"score":7.247960934054548},{"content":" if count > 0 {\n\n Ok(Self::find_by_id(connection, category_id).ok())\n\n } else {\n\n Ok(None)\n\n }\n\n }\n\n\n\n pub fn exists(connection: &Conn, category: String) -> Result<bool> {\n\n use schema::categories::dsl::*;\n\n\n\n let regex = Regex::new(r\"^\\d+$\").unwrap();\n\n\n\n if regex.is_match(&category) {\n\n let category_id = category.parse::<u32>().unwrap();\n\n select(exists(categories.filter(id.eq(category_id))))\n\n .get_result(connection).map_err(map_database_error(Some(\"categories\")))\n\n } else {\n\n select(exists(categories.filter(name.eq(category))))\n\n .get_result(connection).map_err(map_database_error(Some(\"categories\")))\n\n }\n","file_path":"src/models/category.rs","rank":67,"score":7.210289165154416},{"content":"\n\n let paginator = paginator!(\n\n connection,\n\n (contents::id, contents::name, contents::title, contents::category_id, contents::description, contents::keywords, contents::sort, contents::content_type, contents::published_at, contents::modified_at, contents::display, sr::sort),\n\n paginated,\n\n SubjectRelateInfo,\n\n {\n\n\n\n sr::table\n\n .inner_join(contents::table.on(\n\n sr::content_id.eq(contents::id)\n\n .and(contents::display.eq(display))\n\n ))\n\n .filter(sr::subject_id.eq(target))\n\n .order_by((sr::sort.desc(), contents::sort.desc()))\n\n });\n\n\n\n paginator()\n\n }\n\n\n","file_path":"src/models/subject.rs","rank":68,"score":7.152829787901771},{"content":" pub display: Option<bool>,\n\n pub published_at: Option<NaiveDateTime>,\n\n pub modified_at: Option<NaiveDateTime>,\n\n}\n\n\n\n#[derive(Debug, Clone, Serialize, Deserialize, Queryable)]\n\npub struct ContentDisplay {\n\n pub id: u32,\n\n pub name: Option<String>,\n\n pub title: String,\n\n pub category_id: Option<u32>,\n\n pub keywords: String,\n\n pub description: String,\n\n pub sort: i16,\n\n pub content_type: u16,\n\n pub display: bool,\n\n pub published_at: Option<NaiveDateTime>,\n\n pub modified_at: Option<NaiveDateTime>,\n\n}\n\n\n","file_path":"src/models/content.rs","rank":69,"score":7.085722736439804},{"content":"use chrono::NaiveDateTime;\n\n\n\npub mod index;\n\npub mod content;\n\npub mod push_message;\n\npub mod rss;\n\n\n\n#[derive(Serialize)]\n\npub struct Content {\n\n pub id: u32,\n\n pub name: Option<String>,\n\n pub title: String,\n\n pub description: String,\n\n pub published_at_o: Option<NaiveDateTime>,\n\n pub published_at: Option<String>,\n\n}\n\n\n\n#[derive(Serialize)]\n\npub struct PushMessage {\n\n pub id: u32,\n\n pub content: String,\n\n pub created_at: String,\n\n pub created_at_o: NaiveDateTime,\n\n}","file_path":"src/controllers/blog/mod.rs","rank":70,"score":7.057686213766122},{"content":"use actix_web::{HttpRequest, HttpResponse, Result};\n\nuse actix_web::middleware::{Middleware, Started};\n\nuse actix_web::middleware::session::RequestSession;\n\n\n\nuse util::auth::PrivateClaims;\n\nuse util::message::ErrorMessage;\n\n\n\npub struct Authenticate;\n\n\n\nimpl<S> Middleware<S> for Authenticate {\n\n fn start(&self, req: &mut HttpRequest<S>) -> Result<Started> {\n\n if let Some(_) = req.session().get::<PrivateClaims>(\"claims\")? {\n\n Ok(Started::Done)\n\n } else {\n\n Ok(Started::Response(HttpResponse::Unauthorized().json(ErrorMessage::<String> {\n\n code: 10014,\n\n msg: \"Invalid authentication token.\".to_owned(),\n\n body: None,\n\n })))\n\n }\n\n }\n\n}","file_path":"src/middlewares/authenticate.rs","rank":71,"score":7.0037147547386},{"content":"#[derive(Debug, Clone, Serialize, Deserialize, Queryable)]\n\npub struct ContentFullDisplay {\n\n pub id: u32,\n\n pub name: Option<String>,\n\n pub title: String,\n\n pub category_id: Option<u32>,\n\n pub as_page: bool,\n\n pub keywords: String,\n\n pub description: String,\n\n pub sort: i16,\n\n pub content_type: u16,\n\n pub content: Option<String>,\n\n pub display: bool,\n\n pub published_at: Option<NaiveDateTime>,\n\n pub modified_at: Option<NaiveDateTime>,\n\n pub created_at: NaiveDateTime,\n\n pub updated_at: Option<NaiveDateTime>,\n\n}\n\n\n\npub struct Content;\n","file_path":"src/models/content.rs","rank":72,"score":6.9854144427317575},{"content":" .set((display.eq(false), published_at.eq::<Option<NaiveDateTime>>(None)))\n\n .filter(id.eq(target))\n\n .execute(connection)\n\n .map_err(map_database_error(Some(\"contents\")))?;\n\n\n\n if count > 0 {\n\n Ok(Self::find_by_id(connection, target, None).ok())\n\n } else {\n\n Ok(None)\n\n }\n\n }\n\n\n\n pub fn find_by_id(connection: &Conn, target: u32, find_filter: Option<FindFilter>) -> Result<ContentFullDisplay> {\n\n use schema::contents::dsl::*;\n\n\n\n let mut query = contents.filter(id.eq(target)).into_boxed();\n\n\n\n match find_filter {\n\n Some(filter) => {\n\n if let Some(filter_as_page) = filter.as_page {\n","file_path":"src/models/content.rs","rank":73,"score":6.974175010776383},{"content":"#[macro_use] extern crate diesel;\n\n#[macro_use] extern crate serde_derive;\n\n#[macro_use] extern crate failure;\n\n#[macro_use] extern crate lazy_static;\n\n#[macro_use] extern crate tera;\n\n#[macro_use] extern crate log;\n\n\n\nextern crate serde;\n\nextern crate serde_json;\n\nextern crate actix;\n\nextern crate actix_web;\n\nextern crate mime;\n\nextern crate chrono;\n\nextern crate futures;\n\nextern crate regex;\n\nextern crate comrak;\n\nextern crate toml;\n\nextern crate rss;\n\nextern crate url;\n\nextern crate tempdir;\n","file_path":"src/lib.rs","rank":74,"score":6.955643549973848},{"content":" pub fn get_list(connection: &Conn, c: Pagination<GetContents>) -> Result<PaginatedListMessage<ContentDisplay>> {\n\n use schema::contents::dsl::*;\n\n\n\n let paginator = paginator!(connection, Self::DISPLAY_COLUMNS, c, ContentDisplay, {\n\n let mut query = contents.into_boxed();\n\n if let Some(filter) = c.clone().filter {\n\n if let Some(v) = filter.search {\n\n query = query.filter(name.like(format!(\"%{}%\", &v)).or(title.like(format!(\"%{}%\", &v))));\n\n }\n\n\n\n if let Some(v) = filter.display {\n\n query = query.filter(display.eq(v));\n\n }\n\n\n\n if let Some(v) = filter.content_type {\n\n query = query.filter(content_type.eq(v));\n\n }\n\n\n\n if let Some(v) = filter.category {\n\n match v {\n","file_path":"src/models/content.rs","rank":75,"score":6.936510760871123},{"content":"pub struct Category;\n\n\n\nimpl Category {\n\n const DISPLAY_COLUMNS: (\n\n column::id, column::name, column::display_name,\n\n column::description, column::created_at, column::updated_at\n\n ) = (\n\n column::id, column::name, column::display_name,\n\n column::description, column::created_at, column::updated_at\n\n );\n\n\n\n pub fn get_list(connection: &Conn, c: Pagination<GetCategoryList>) -> PaginatedCategoryList {\n\n use schema::categories::dsl::*;\n\n\n\n let paginator = paginator!(connection, Self::DISPLAY_COLUMNS, c, CategoryDisplay, {\n\n let mut query = categories.into_boxed();\n\n if let Some(filter) = c.clone().filter {\n\n if let Some(v) = filter.name {\n\n query = query.filter(name.like(format!(\"%{}%\", v)));\n\n }\n","file_path":"src/models/category.rs","rank":76,"score":6.883381235141501},{"content":"\n\n fn handle(&mut self, finder: DeleteCategory, _: &mut Self::Context) -> Self::Result {\n\n Category::delete(&self.connection()?, finder.0)\n\n }\n\n}\n\n\n\n#[derive(AsChangeset, Deserialize)]\n\n#[table_name = \"categories\"]\n\npub struct UpdateCategory {\n\n pub name: Option<String>,\n\n pub display_name: Option<String>,\n\n pub description: Option<String>,\n\n pub sort: Option<i16>,\n\n}\n\n\n\nimpl Message for UpdateByID<UpdateCategory> {\n\n type Result = Result<Option<CategoryFullDisplay>>;\n\n}\n\n\n\nimpl Handler<UpdateByID<UpdateCategory>> for DatabaseExecutor {\n","file_path":"src/models/category.rs","rank":77,"score":6.744896212942711},{"content":" pub name: Option<String>,\n\n pub title: String,\n\n pub keywords: String,\n\n pub description: String,\n\n pub sort: i16,\n\n}\n\n\n\n#[derive(Deserialize, AsChangeset, Debug)]\n\n#[table_name = \"subjects\"]\n\npub struct UpdateSubject {\n\n pub name: Option<String>,\n\n pub title: Option<String>,\n\n pub keywords: Option<String>,\n\n pub description: Option<String>,\n\n pub sort: Option<i16>,\n\n}\n\n\n\n#[derive(Debug, Clone, Serialize, Deserialize, Queryable)]\n\npub struct SubjectDisplay {\n\n pub id: u32,\n","file_path":"src/models/subject.rs","rank":79,"score":6.637769540290594},{"content":" keywords -> Varchar,\n\n description -> Varchar,\n\n sort -> Smallint,\n\n content_type -> Unsigned<Smallint>,\n\n content -> Nullable<Mediumtext>,\n\n display -> Bool,\n\n published_at -> Nullable<Timestamp>,\n\n modified_at -> Nullable<Timestamp>,\n\n created_at -> Timestamp,\n\n updated_at -> Nullable<Timestamp>,\n\n }\n\n}\n\n\n\ntable! {\n\n push_messages (id) {\n\n id -> Unsigned<Integer>,\n\n content -> Varchar,\n\n sort -> Smallint,\n\n created_at -> Timestamp,\n\n updated_at -> Nullable<Timestamp>,\n","file_path":"src/schema.rs","rank":80,"score":6.564037706423671},{"content":" }\n\n}\n\n\n\ntable! {\n\n recommend_contents (id) {\n\n id -> Unsigned<Integer>,\n\n content_id -> Nullable<Unsigned<Integer>>,\n\n source -> Varchar,\n\n title -> Varchar,\n\n summary -> Varchar,\n\n created_at -> Timestamp,\n\n updated_at -> Nullable<Timestamp>,\n\n }\n\n}\n\n\n\ntable! {\n\n subjects (id) {\n\n id -> Unsigned<Integer>,\n\n name -> Nullable<Varchar>,\n\n title -> Varchar,\n","file_path":"src/schema.rs","rank":81,"score":6.338395229310613},{"content":"use actix_web::{Scope, http::Method, HttpRequest, FromRequest};\n\n\n\nuse state::AppState;\n\nuse controllers::blog;\n\n\n","file_path":"src/routes/blog.rs","rank":82,"score":6.162324658306051},{"content":"use super::Content;\n\n\n\nuse std::rc::Rc;\n\nuse std::sync::Arc;\n\nuse std::result::Result as StdResult;\n\nuse chrono::NaiveDateTime;\n\nuse futures::future::{Future, ok as FutOk, err as FutErr};\n\nuse actix_web::{HttpRequest, HttpResponse, Responder, AsyncResponder, HttpMessage, error::Error as ActixError};\n\nuse actix_web::fs::NamedFile;\n\nuse comrak::{markdown_to_html, ComrakOptions};\n\nuse tera::Context;\n\nuse regex;\n\n\n\nuse result::Result;\n\nuse state::AppState;\n\nuse message::{Pagination, PaginatedListMessage};\n\nuse models::content::{self, FindFilter};\n\nuse template::{get_global_context, TEMPLATES};\n\nuse error::{Error, error_handler};\n\n\n","file_path":"src/controllers/blog/content.rs","rank":83,"score":6.1567853717402965},{"content":"table! {\n\n categories (id) {\n\n id -> Unsigned<Integer>,\n\n name -> Varchar,\n\n display_name -> Varchar,\n\n keywords -> Varchar,\n\n description -> Varchar,\n\n sort -> Smallint,\n\n created_at -> Timestamp,\n\n updated_at -> Nullable<Timestamp>,\n\n }\n\n}\n\n\n\ntable! {\n\n contents (id) {\n\n id -> Unsigned<Integer>,\n\n name -> Nullable<Varchar>,\n\n title -> Varchar,\n\n category_id -> Nullable<Unsigned<Integer>>,\n\n as_page -> Bool,\n","file_path":"src/schema.rs","rank":84,"score":6.134093926523832},{"content":"use std::rc::Rc;\n\nuse actix_web::{HttpRequest, HttpResponse, AsyncResponder, Responder, HttpMessage};\n\nuse actix_web::http;\n\nuse futures::future::Future;\n\nuse rss::{ChannelBuilder, Channel, Item, ItemBuilder};\n\nuse url::Url;\n\nuse comrak::{markdown_to_html, ComrakOptions};\n\n\n\nuse state::AppState;\n\nuse message::{Pagination, PaginatedListMessage};\n\nuse template::get_site_setting;\n\nuse error::{Error, error_handler};\n\nuse models::content;\n\n\n","file_path":"src/controllers/blog/rss.rs","rank":85,"score":6.06100588614272},{"content":"use super::PushMessage;\n\n\n\nuse std::rc::Rc;\n\nuse futures::future::{Future, ok as FutOk, err as FutErr};\n\nuse actix_web::{HttpRequest, HttpResponse, Responder, AsyncResponder, HttpMessage, error::Error as ActixError};\n\nuse tera::Context;\n\n\n\nuse message::{Pagination, PaginatedListMessage};\n\nuse models::push_message;\n\nuse state::AppState;\n\nuse template::{get_global_context, TEMPLATES};\n\nuse error::error_handler;\n\n\n","file_path":"src/controllers/blog/push_message.rs","rank":86,"score":6.03577134626952},{"content":"use actix_web::{Scope, http::Method, HttpRequest, FromRequest};\n\n\n\nuse state::AppState;\n\nuse controllers::admin;\n\nuse middlewares::authenticate::Authenticate as MAuthenticate;\n\n\n","file_path":"src/routes/admin.rs","rank":87,"score":6.009748435205569},{"content":" keywords -> Varchar,\n\n description -> Varchar,\n\n sort -> Smallint,\n\n created_at -> Timestamp,\n\n updated_at -> Nullable<Timestamp>,\n\n }\n\n}\n\n\n\ntable! {\n\n subject_relates (subject_id, content_id) {\n\n subject_id -> Unsigned<Integer>,\n\n content_id -> Unsigned<Integer>,\n\n sort -> Smallint,\n\n created_at -> Timestamp,\n\n updated_at -> Nullable<Timestamp>,\n\n }\n\n}\n\n\n\nallow_tables_to_appear_in_same_query!(\n\n categories,\n\n contents,\n\n push_messages,\n\n recommend_contents,\n\n subjects,\n\n subject_relates,\n\n);\n","file_path":"src/schema.rs","rank":88,"score":5.779652299930901},{"content":"use std::rc::Rc;\n\nuse actix_web::{HttpRequest, HttpResponse, AsyncResponder, Responder, HttpMessage};\n\n\n\nuse state::AppState;\n\nuse models::content;\n\n\n\n#[derive(Deserialize, Debug, Clone)]\n","file_path":"src/controllers/admin/content.rs","rank":89,"score":5.774222966805732},{"content":" NotZero,\n\n Index(FindCategory),\n\n}\n\n\n\n#[derive(Clone, Debug)]\n\npub struct GetContents {\n\n pub search: Option<String>,\n\n pub category: Option<CategoryMatcher>,\n\n pub display: Option<bool>,\n\n pub content_type: Option<u16>,\n\n}\n\n\n\nimpl Default for GetContents {\n\n fn default() -> Self {\n\n GetContents {\n\n search: None,\n\n category: None,\n\n display: Some(true),\n\n content_type: None,\n\n }\n","file_path":"src/models/content.rs","rank":90,"score":5.765217495568928},{"content":" pub fn get_recommend_contents(connection: &Conn, count: Option<u32>) -> Result<Vec<RecommendContentDisplay>> {\n\n use schema::recommend_contents::dsl::*;\n\n\n\n recommend_contents\n\n .order((created_at.desc(), id.desc()))\n\n .limit(count.map(From::from).unwrap_or(3))\n\n .load::<RecommendContentDisplay>(connection)\n\n .map_err(map_database_error(Some(\"recommend_contents\")))\n\n }\n\n}\n\n\n\n#[derive(Default)]\n\npub struct GetRecommendContents(pub Option<u32>);\n\n\n\nimpl Message for GetRecommendContents {\n\n type Result = Result<Vec<RecommendContentDisplay>>;\n\n}\n\n\n\nimpl Handler<GetRecommendContents> for DatabaseExecutor {\n\n type Result = <GetRecommendContents as Message>::Result;\n\n\n\n fn handle(&mut self, msg: GetRecommendContents, _: &mut Self::Context) -> <Self as Handler<GetRecommendContents>>::Result {\n\n RecommendContent::get_recommend_contents(&self.connection()?, msg.0)\n\n }\n\n}","file_path":"src/models/recommend.rs","rank":91,"score":5.596978372349168},{"content":" pub static_assets_path: Arc<Option<String>>,\n\n pub public_path: Arc<Option<String>>,\n\n /// 通过该字段对数据库进行访问以及操作\n\n pub database: Addr<DatabaseExecutor>,\n\n}\n\n\n\nimpl AppState {\n\n pub fn new(config: Config) -> Self {\n\n let timezone = config.database_timezone;\n\n let manager = ConnectionManager::<MysqlConnection>::new(config.database_url);\n\n let pool = Pool::builder().build(manager).expect(\"Error: Failed to build pool\");\n\n\n\n let addr = SyncArbiter::start(8, move || {\n\n let cloned = pool.clone();\n\n let connection = &cloned.get().expect(\"Error: Connection initialize error.\");\n\n let timezone = timezone.clone();\n\n\n\n if let Some(timezone) = timezone {\n\n sql_query(format!(\"set time_zone='{}'\", timezone))\n\n .execute(connection)\n","file_path":"src/state.rs","rank":92,"score":5.582452705505543},{"content":"pub struct FindFilter {\n\n pub as_page: Option<bool>\n\n}\n\n\n\npub struct FindContent {\n\n pub inner: Find,\n\n pub filter: Option<FindFilter>\n\n}\n\n\n\nimpl Message for FindContent {\n\n type Result = Result<ContentFullDisplay>;\n\n}\n\n\n\nimpl Handler<FindContent> for DatabaseExecutor {\n\n type Result = <FindContent as Message>::Result;\n\n\n\n fn handle(&mut self, msg: FindContent, _: &mut Self::Context) -> Self::Result {\n\n match msg.inner {\n\n Find::ByName(name) => Content::find_by_name(&self.connection()?, name, msg.filter),\n\n Find::ById(id) => Content::find_by_id(&self.connection()?, id, msg.filter)\n\n }\n\n }\n\n}\n\n\n\npub struct CreateContent {\n\n\n\n}","file_path":"src/models/content.rs","rank":93,"score":5.547491779101183},{"content":" pub id: u32,\n\n pub name: String,\n\n pub display_name: String,\n\n pub description: String,\n\n pub created_at: NaiveDateTime,\n\n pub updated_at: Option<NaiveDateTime>,\n\n}\n\n\n\n#[derive(Debug, Clone, Serialize, Deserialize, Queryable)]\n\npub struct CategoryFullDisplay {\n\n pub id: u32,\n\n pub name: String,\n\n pub display_name: String,\n\n pub keywords: String,\n\n pub description: String,\n\n pub sort: i16,\n\n pub created_at: NaiveDateTime,\n\n pub updated_at: Option<NaiveDateTime>,\n\n}\n\n\n","file_path":"src/models/category.rs","rank":94,"score":5.539897949014887},{"content":" }\n\n },\n\n Err(_) => SiteSetting::default()\n\n }\n\n }\n\n\n\n pub fn get_global_context() -> Context {\n\n let mut context = Context::new();\n\n let setting: SiteSetting = get_site_setting();\n\n\n\n context.add(\"__site_setting\", &setting);\n\n context\n\n }\n\n}\n\n\n\npub mod state;\n\npub mod routes;\n\npub mod utils;\n\n\n\npub mod result {\n\n use std::result::Result as StdResult;\n\n use error::Error;\n\n\n\n pub type Result<T> = StdResult<T, Error>;\n\n}","file_path":"src/lib.rs","rank":95,"score":5.374491715604766},{"content":"use super::{PushMessage, Content};\n\n\n\nuse std::rc::Rc;\n\nuse futures::future::{Future, ok as FutOk, err as FutErr};\n\nuse actix_web::{HttpRequest, HttpResponse, Responder, AsyncResponder, HttpMessage};\n\nuse comrak::{markdown_to_html, ComrakOptions};\n\nuse tera::Context;\n\n\n\nuse state::AppState;\n\nuse message::Pagination;\n\nuse models::{push_message, content, recommend};\n\nuse template::{get_global_context, TEMPLATES};\n\nuse error::error_handler;\n\n\n","file_path":"src/controllers/blog/index.rs","rank":96,"score":5.259538809924145},{"content":" connection.transaction(move || {\n\n diesel::delete(subject_relates)\n\n .filter(\n\n subject_id.eq(target).and(content_id.ne_all(key_index))\n\n )\n\n .execute(connection)\n\n .map_err(map_database_error(Some(\"subject_relates\")))?;\n\n\n\n let mut create_relates = Vec::with_capacity(sync.len());\n\n for relate in sync {\n\n create_relates.push(\n\n (subject_id.eq(target), content_id.eq(relate.content_id), sort.eq(relate.sort.unwrap_or(0)))\n\n );\n\n }\n\n\n\n if create_relates.len() > 0 {\n\n diesel::replace_into(subject_relates)\n\n .values(&create_relates)\n\n .execute(connection)\n\n .map_err(map_database_error(Some(\"subject_relates\")))?;\n","file_path":"src/models/subject.rs","rank":97,"score":5.2332914790169},{"content":" pub name: Option<String>,\n\n pub title: String,\n\n pub keywords: String,\n\n pub description: String,\n\n pub sort: i16,\n\n pub created_at: NaiveDateTime,\n\n pub updated_at: Option<NaiveDateTime>,\n\n}\n\n\n\npub struct SubjectRelate {\n\n pub content_id: u32,\n\n pub sort: Option<i16>,\n\n}\n\n\n\npub struct CreateSubject {\n\n pub subject: NewSubject,\n\n pub relates: Option<Vec<SubjectRelate>>,\n\n}\n\n\n\n#[derive(Debug, Clone, Serialize, Deserialize, Queryable)]\n","file_path":"src/models/subject.rs","rank":98,"score":4.92040375484316}],"string":"[\n {\n \"content\": \"#[derive(Deserialize, Debug, Clone)]\\n\\nstruct CreateContent {\\n\\n\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/controllers/admin/content.rs\",\n \"rank\": 0,\n \"score\": 48109.37637340417\n },\n {\n \"content\": \"pub fn map_database_error(target: Option<&'static str>) -> impl FnOnce(DieselError) -> Error {\\n\\n move |err: DieselError| {\\n\\n let target = target.unwrap_or(\\\"[unknown]\\\");\\n\\n match err {\\n\\n DieselError::NotFound => Error::not_found_error::<DieselError>(None, Some(error_msg(NOT_FOUND, \\\"Resource or data not found.\\\", Some(ErrorDetail::String(format!(\\\"Target table: {}\\\", target)))))),\\n\\n DieselError::DatabaseError(kind, info) => {\\n\\n let mut detail = HashMap::new();\\n\\n detail.insert(\\\"message\\\".to_string(), Some(ErrorDetail::String(info.message().to_string())));\\n\\n detail.insert(\\\"table\\\".to_string(), info.table_name().map(|v| ErrorDetail::String(v.to_string())));\\n\\n detail.insert(\\\"detail\\\".to_string(), info.details().map(|v| ErrorDetail::String(v.to_string())));\\n\\n\\n\\n match kind {\\n\\n DieselDatabaseErrorKind::UniqueViolation => Error::conflict::<DieselError>(None, Some(error_msg(CONFLICT, \\\"Data conflict.\\\", Some(ErrorDetail::Hash(detail))))),\\n\\n _ => Error::internal_server_error::<DieselError>(None, Some(error_msg(UNKNOWN_DB_ERROR, \\\"Unknown database error.\\\", Some(ErrorDetail::Hash(detail)))))\\n\\n }\\n\\n }\\n\\n _ => Error::internal_server_error::<DieselError>(None, Some(error_msg(UNKNOWN_DB_ERROR, \\\"Unknown database error.\\\", Some(ErrorDetail::String(format!(\\\"Table: {}, Error: {:?}\\\", target, err))))))\\n\\n }\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/error/database.rs\",\n \"rank\": 1,\n \"score\": 45537.47044392771\n },\n {\n \"content\": \"pub fn error_handler<S, T: AsRef<HttpRequest<S>>>(req: T) -> impl FnOnce(Error) -> ActixError {\\n\\n let json = if let Ok(Some(mime)) = req.as_ref().mime_type() {\\n\\n mime.subtype() == mime::JSON || mime.suffix() == Some(mime::JSON)\\n\\n } else {\\n\\n false\\n\\n };\\n\\n\\n\\n move |err: Error| {\\n\\n if json {\\n\\n let json = JsonError(err);\\n\\n json.into()\\n\\n } else {\\n\\n let html = HtmlError(err);\\n\\n html.into()\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\n#[derive(Fail, Debug, Serialize)]\\n\\n#[fail(display = \\\"code: {}, error: {}\\\", code, message)]\\n\",\n \"file_path\": \"src/error/mod.rs\",\n \"rank\": 2,\n \"score\": 41113.94079029152\n },\n {\n \"content\": \"type PaginatedCategoryList = Result<PaginatedListMessage<CategoryDisplay>>;\\n\\n\\n\\n#[derive(Debug, Clone, Serialize, Deserialize, Queryable)]\\n\\npub struct CategoryBase {\\n\\n pub id: u32,\\n\\n pub name: String,\\n\\n pub display_name: String,\\n\\n}\\n\\n\\n\\n#[derive(Deserialize, Insertable, Debug)]\\n\\n#[table_name = \\\"categories\\\"]\\n\\npub struct NewCategory {\\n\\n pub name: String,\\n\\n pub display_name: String,\\n\\n pub description: String,\\n\\n pub sort: Option<i16>,\\n\\n}\\n\\n\\n\\n#[derive(Debug, Clone, Serialize, Deserialize, Queryable)]\\n\\npub struct CategoryDisplay {\\n\",\n \"file_path\": \"src/models/category.rs\",\n \"rank\": 3,\n \"score\": 37437.94859368881\n },\n {\n \"content\": \"pub fn convert_string_to_bool(origin: String) -> bool {\\n\\n match origin.as_str() {\\n\\n \\\"true\\\" | \\\"TRUE\\\" | \\\"1\\\" => true,\\n\\n \\\"false\\\" | \\\"FALSE\\\" | \\\"0\\\" => false,\\n\\n _ => false,\\n\\n }\\n\\n}\",\n \"file_path\": \"src/utils/helper.rs\",\n \"rank\": 4,\n \"score\": 35834.50996894282\n },\n {\n \"content\": \"pub fn home(req: HttpRequest<AppState>) -> impl Responder {\\n\\n let ref_req = Rc::new(req);\\n\\n let req_for_contents = Rc::clone(&ref_req);\\n\\n let req_for_pushes = Rc::clone(&ref_req);\\n\\n let req_for_recommends = Rc::clone(&ref_req);\\n\\n let req_for_err = Rc::clone(&ref_req);\\n\\n\\n\\n let default_content = Pagination {\\n\\n page: 1,\\n\\n per_page: 10,\\n\\n filter: Some(content::GetContents::default()),\\n\\n };\\n\\n\\n\\n let default_pushes = Pagination {\\n\\n page: 1,\\n\\n per_page: 3,\\n\\n filter: Some(push_message::GetPushMessages::default()),\\n\\n };\\n\\n\\n\\n let default_recommends = recommend::GetRecommendContents::default();\\n\",\n \"file_path\": \"src/controllers/blog/index.rs\",\n \"rank\": 5,\n \"score\": 31832.26623770537\n },\n {\n \"content\": \"pub fn source(req: HttpRequest<AppState>) -> impl Responder {\\n\\n let ref_req = Rc::new(req);\\n\\n let req_for_contents = Rc::clone(&ref_req);\\n\\n let req_for_err = Rc::clone(&ref_req);\\n\\n\\n\\n match req_for_contents.match_info().get(\\\"name\\\") {\\n\\n Some(name) => {\\n\\n if req_for_contents.state().static_assets_handle {\\n\\n if name == \\\"favicon.ico\\\" {\\n\\n use std::io::ErrorKind;\\n\\n use std::path::PathBuf;\\n\\n\\n\\n let req_for_static = Rc::clone(&ref_req);\\n\\n let req_for_error = Rc::clone(&ref_req);\\n\\n let directory = Arc::clone(&req_for_static.state().public_path);\\n\\n let path = match *directory {\\n\\n Some(ref ref_directory) => PathBuf::from(ref_directory).join(name),\\n\\n None => panic!(\\\"Error: Fatal system logic error\\\"),\\n\\n };\\n\\n\\n\",\n \"file_path\": \"src/controllers/blog/content.rs\",\n \"rank\": 6,\n \"score\": 31832.26623770537\n },\n {\n \"content\": \"pub fn content(req: HttpRequest<AppState>) -> impl Responder {\\n\\n let ref_req = Rc::new(req);\\n\\n let req_for_err = Rc::clone(&ref_req);\\n\\n\\n\\n match find_content(ref_req, None) {\\n\\n Ok(fut) => {\\n\\n fut\\n\\n .and_then(|res| {\\n\\n #[derive(Serialize)]\\n\\n struct Content {\\n\\n title: String,\\n\\n content: String,\\n\\n published_at_o: Option<NaiveDateTime>,\\n\\n published_at: Option<String>,\\n\\n }\\n\\n\\n\\n let origin: content::ContentFullDisplay = res?;\\n\\n let data = Content {\\n\\n content: markdown_to_html(&origin.content.unwrap_or(String::from(\\\"\\\")), &ComrakOptions::default()),\\n\\n title: origin.title,\\n\",\n \"file_path\": \"src/controllers/blog/content.rs\",\n \"rank\": 7,\n \"score\": 31832.26623770537\n },\n {\n \"content\": \"pub fn create(req: HttpRequest<AppState>) -> impl Responder {\\n\\n let req_ref = Rc::new(req);\\n\\n\\n\\n \\\"\\\"\\n\\n}\",\n \"file_path\": \"src/controllers/admin/content.rs\",\n \"rank\": 8,\n \"score\": 31832.26623770537\n },\n {\n \"content\": \"pub fn rss(req: HttpRequest<AppState>) -> impl Responder {\\n\\n let req_ref = Rc::new(req);\\n\\n let req_for_db = Rc::clone(&req_ref);\\n\\n let req_for_data = Rc::clone(&req_ref);\\n\\n let req_for_err = Rc::clone(&req_ref);\\n\\n let setting = get_site_setting();\\n\\n let mut channel: Channel = ChannelBuilder::default()\\n\\n .title(\\\"Inspirer blog article\\\")\\n\\n .link(setting.site.home)\\n\\n .description(\\\"An RSS feed.\\\")\\n\\n .build()\\n\\n .unwrap();\\n\\n\\n\\n let default_getter = content::GetContents {\\n\\n category: Some(content::CategoryMatcher::NotZero),\\n\\n content_type: Some(1),\\n\\n ..Default::default()\\n\\n };\\n\\n let default_content = Pagination::new(Some(1), Some(10), Some(default_getter));\\n\\n\\n\",\n \"file_path\": \"src/controllers/blog/rss.rs\",\n \"rank\": 9,\n \"score\": 31832.26623770537\n },\n {\n \"content\": \"pub fn admin_routes<S>(scope: Scope<S>) -> Scope<S>\\n\\n where HttpRequest<AppState>: FromRequest<S>\\n\\n{\\n\\n scope\\n\\n .route(\\\"/authentication\\\", Method::POST, admin::authorization::authorization)\\n\\n .nested(\\\"\\\", |scope| {\\n\\n scope.middleware(MAuthenticate)\\n\\n .route(\\\"/session/current-user\\\", Method::GET, admin::user::get_current_user_info)\\n\\n .route(\\\"/category\\\", Method::GET, admin::category::get_category_list)\\n\\n .route(\\\"/category\\\", Method::POST, admin::category::create_category)\\n\\n .route(\\\"/category/{id:\\\\\\\\d+}\\\", Method::DELETE, admin::category::delete_category)\\n\\n .route(\\\"/category/{id:\\\\\\\\d+}\\\", Method::PUT, admin::category::update_category)\\n\\n .route(\\\"/category/{id:\\\\\\\\d+}\\\", Method::GET, admin::category::get_category)\\n\\n .route(\\\"/content\\\", Method::POST, admin::content::create_content)\\n\\n .route(\\\"/content\\\", Method::GET, admin::content::get_content_list)\\n\\n .route(\\\"/content/{id:\\\\\\\\d+}\\\", Method::GET, admin::content::get_content)\\n\\n .route(\\\"/content/{id:\\\\\\\\d+}\\\", Method::DELETE, admin::content::delete_content)\\n\\n .route(\\\"/content/{id:\\\\\\\\d+}\\\", Method::PUT, admin::content::update_content)\\n\\n })\\n\\n}\",\n \"file_path\": \"src/routes/admin.rs\",\n \"rank\": 10,\n \"score\": 31711.13939920818\n },\n {\n \"content\": \"pub fn article_list(req: HttpRequest<AppState>) -> impl Responder {\\n\\n let ref_req = Rc::new(req);\\n\\n let mut default_content = Pagination::<content::GetContents>::from_request(Rc::clone(&ref_req));\\n\\n let mut default_getter = content::GetContents::default();\\n\\n\\n\\n default_getter.category = Some(content::CategoryMatcher::NotZero);\\n\\n default_getter.content_type = Some(1);\\n\\n default_content.filter = Some(default_getter);\\n\\n\\n\\n content_list(ref_req, default_content)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/controllers/blog/content.rs\",\n \"rank\": 11,\n \"score\": 31220.06336997304\n },\n {\n \"content\": \"pub fn blog_routes<S: 'static>(scope: Scope<S>) -> Scope<S>\\n\\n where HttpRequest<AppState>: FromRequest<S>\\n\\n{\\n\\n scope\\n\\n .route(\\\"/\\\", Method::GET, blog::index::home)\\n\\n .route(\\\"/article\\\", Method::GET, blog::content::article_list)\\n\\n .resource(\\\"/article/{name}\\\", |r| {\\n\\n r.name(\\\"article\\\");\\n\\n r.method(Method::GET).with(blog::content::content);\\n\\n })\\n\\n .route(\\\"/push\\\", Method::GET, blog::push_message::push_message_list)\\n\\n .route(\\\"/feed\\\", Method::GET, blog::rss::rss)\\n\\n .route(\\\"/{name}\\\", Method::GET, blog::content::source)\\n\\n}\",\n \"file_path\": \"src/routes/blog.rs\",\n \"rank\": 12,\n \"score\": 30368.982808860044\n },\n {\n \"content\": \"pub fn push_message_list(req: HttpRequest<AppState>) -> impl Responder {\\n\\n let ref_req = Rc::new(req);\\n\\n let req_for_pushes = Rc::clone(&ref_req);\\n\\n let req_for_err = Rc::clone(&ref_req);\\n\\n let query_message = Pagination::<push_message::GetPushMessages>::from_request(Rc::clone(&ref_req));\\n\\n\\n\\n req_for_pushes.state().database.send(query_message).from_err()\\n\\n .and_then(|push_messages| {\\n\\n let push_messages: PaginatedListMessage<push_message::PushMessageDisplay> = push_messages?;\\n\\n let mut list: Vec<PushMessage> = vec![];\\n\\n\\n\\n for item in push_messages.list {\\n\\n list.push(PushMessage {\\n\\n id: item.id,\\n\\n content: item.content,\\n\\n created_at: item.created_at.format(\\\"%Y-%m-%d\\\").to_string(),\\n\\n created_at_o: item.created_at,\\n\\n })\\n\\n }\\n\\n\\n\",\n \"file_path\": \"src/controllers/blog/push_message.rs\",\n \"rank\": 13,\n \"score\": 30107.196058896465\n },\n {\n \"content\": \"alter table `contents`\\n\\n add column `as_page` tinyint(1) not null default 0 comment '是否可以作为单页面' after `category_id`;\\n\\n\\n\",\n \"file_path\": \"migrations/2018-08-29-084801_version_1_1_migration/up.sql\",\n \"rank\": 14,\n \"score\": 25806.324259473\n },\n {\n \"content\": \"alter table `contents`\\n\\n drop column `as_page`;\\n\\n\\n\",\n \"file_path\": \"migrations/2018-08-29-084801_version_1_1_migration/down.sql\",\n \"rank\": 15,\n \"score\": 25806.324259473\n },\n {\n \"content\": \"create table if not exists `subjects` (\\n\\n `id` int unsigned not null auto_increment,\\n\\n `name` varchar(255) character set utf8mb4 collate utf8mb4_general_ci,\\n\\n `title` varchar(255) character set utf8mb4 collate utf8mb4_general_ci not null,\\n\\n `keywords` varchar(255) character set utf8mb4 collate utf8mb4_general_ci not null default '',\\n\\n `description` varchar(500) character set utf8mb4 collate utf8mb4_general_ci not null default '',\\n\\n `sort` smallint not null default 0,\\n\\n `created_at` timestamp not null default current_timestamp,\\n\\n `updated_at` timestamp null on update current_timestamp,\\n\\n primary key (`id`),\\n\\n unique key `union_name` (`name`),\\n\\n key `search_title` (`name`, `title`)\\n\\n) character set = utf8mb4 collate = utf8mb4_general_ci comment = '专题表';\\n\\n\\n\",\n \"file_path\": \"migrations/2018-06-26-090532_version_1_0_migration/up.sql\",\n \"rank\": 16,\n \"score\": 24680.997942494858\n },\n {\n \"content\": \"DROP TABLE IF EXISTS `contents`;\\n\",\n \"file_path\": \"migrations/2018-06-26-090532_version_1_0_migration/down.sql\",\n \"rank\": 17,\n \"score\": 24680.997942494858\n },\n {\n \"content\": \"create table if not exists `contents` (\\n\\n `id` int unsigned not null auto_increment,\\n\\n `name` varchar(255) character set utf8mb4 collate utf8mb4_general_ci,\\n\\n `title` varchar(255) character set utf8mb4 collate utf8mb4_general_ci not null,\\n\\n `category_id` int unsigned default null,\\n\\n `keywords` varchar(255) character set utf8mb4 collate utf8mb4_general_ci not null default '',\\n\\n `description` varchar(500) character set utf8mb4 collate utf8mb4_general_ci not null default '',\\n\\n `sort` smallint not null default 0,\\n\\n `content_type` smallint unsigned not null default 1,\\n\\n `content` mediumtext character set utf8mb4 collate utf8mb4_general_ci null,\\n\\n `display` tinyint(1) not null default 1,\\n\\n `published_at` timestamp null,\\n\\n `modified_at` timestamp null,\\n\\n `created_at` timestamp not null default current_timestamp,\\n\\n `updated_at` timestamp null on update current_timestamp,\\n\\n primary key (`id`),\\n\\n unique key `union_name` (`name`),\\n\\n key `search_title` (`name`, `title`)\\n\\n) character set = utf8mb4 collate = utf8mb4_general_ci comment = '内容表';\\n\\n\\n\",\n \"file_path\": \"migrations/2018-06-26-090532_version_1_0_migration/up.sql\",\n \"rank\": 18,\n \"score\": 24680.997942494858\n },\n {\n \"content\": \"DROP TABLE IF EXISTS `categories`;\\n\",\n \"file_path\": \"migrations/2018-06-26-090532_version_1_0_migration/down.sql\",\n \"rank\": 19,\n \"score\": 24680.997942494858\n },\n {\n \"content\": \"DROP TABLE IF EXISTS `subjects`;\\n\",\n \"file_path\": \"migrations/2018-06-26-090532_version_1_0_migration/down.sql\",\n \"rank\": 20,\n \"score\": 24680.997942494858\n },\n {\n \"content\": \"create table if not exists `categories` (\\n\\n `id` int unsigned not null auto_increment,\\n\\n `name` varchar(255) character set utf8mb4 collate utf8mb4_general_ci not null,\\n\\n `display_name` varchar(255) character set utf8mb4 collate utf8mb4_general_ci not null,\\n\\n `keywords` varchar(255) character set utf8mb4 collate utf8mb4_general_ci not null default '',\\n\\n `description` varchar(500) character set utf8mb4 collate utf8mb4_general_ci not null default '',\\n\\n `sort` smallint(4) not null default 0,\\n\\n `created_at` timestamp not null default current_timestamp,\\n\\n `updated_at` timestamp null on update current_timestamp,\\n\\n primary key (`id`),\\n\\n unique key `union_name` (`name`)\\n\\n) character set = utf8mb4 collate = utf8mb4_general_ci comment = '内容分类表';\\n\\n\\n\",\n \"file_path\": \"migrations/2018-06-26-090532_version_1_0_migration/up.sql\",\n \"rank\": 21,\n \"score\": 24680.997942494858\n },\n {\n \"content\": \"pub fn error_msg<T: Into<String>>(code: u16, msg: T, body: Option<ErrorDetail>) -> ErrorMessage<ErrorDetail> {\\n\\n ErrorMessage::<ErrorDetail> {\\n\\n code,\\n\\n msg: msg.into(),\\n\\n body\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/error/mod.rs\",\n \"rank\": 22,\n \"score\": 24253.366237227114\n },\n {\n \"content\": \"create table if not exists `recommend_contents` (\\n\\n `id` int unsigned not null auto_increment,\\n\\n `content_id` int unsigned default null,\\n\\n `source` varchar(500) character set utf8mb4 collate utf8mb4_general_ci not null,\\n\\n `title` varchar(255) character set utf8mb4 collate utf8mb4_general_ci not null,\\n\\n `summary` varchar(500) character set utf8mb4 collate utf8mb4_general_ci not null,\\n\\n `created_at` timestamp not null default current_timestamp,\\n\\n `updated_at` timestamp null on update current_timestamp,\\n\\n primary key (`id`),\\n\\n key `content` (`content_id`)\\n\\n) character set = utf8mb4 collate = utf8mb4_general_ci comment = '推荐内容表';\",\n \"file_path\": \"migrations/2018-08-29-084801_version_1_1_migration/up.sql\",\n \"rank\": 23,\n \"score\": 23649.714084302428\n },\n {\n \"content\": \"create table if not exists `push_messages` (\\n\\n `id` int unsigned not null auto_increment,\\n\\n `content` varchar(500) character set utf8mb4 collate utf8mb4_general_ci not null,\\n\\n `sort` smallint not null default 0,\\n\\n `created_at` timestamp not null default current_timestamp,\\n\\n `updated_at` timestamp null on update current_timestamp,\\n\\n primary key (`id`),\\n\\n key `search` (`content`)\\n\\n) character set = utf8mb4 collate = utf8mb4_general_ci comment = 'PUSH 消息表';\\n\\n\\n\",\n \"file_path\": \"migrations/2018-06-26-090532_version_1_0_migration/up.sql\",\n \"rank\": 24,\n \"score\": 23649.714084302428\n },\n {\n \"content\": \"DROP TABLE IF EXISTS `subject_relates`;\",\n \"file_path\": \"migrations/2018-06-26-090532_version_1_0_migration/down.sql\",\n \"rank\": 25,\n \"score\": 23649.714084302428\n },\n {\n \"content\": \"DROP TABLE IF EXISTS `push_messages`;\\n\",\n \"file_path\": \"migrations/2018-06-26-090532_version_1_0_migration/down.sql\",\n \"rank\": 26,\n \"score\": 23649.714084302428\n },\n {\n \"content\": \"create table if not exists `subject_relates` (\\n\\n `subject_id` int unsigned not null,\\n\\n `content_id` int unsigned not null,\\n\\n `sort` smallint not null default 0,\\n\\n `created_at` timestamp not null default current_timestamp,\\n\\n `updated_at` timestamp null on update current_timestamp,\\n\\n primary key (`subject_id`, `content_id`)\\n\\n) comment = '专题内容关联表';\",\n \"file_path\": \"migrations/2018-06-26-090532_version_1_0_migration/up.sql\",\n \"rank\": 27,\n \"score\": 23649.714084302428\n },\n {\n \"content\": \"drop table if exists `recommend_contents`;\",\n \"file_path\": \"migrations/2018-08-29-084801_version_1_1_migration/down.sql\",\n \"rank\": 28,\n \"score\": 23649.714084302428\n },\n {\n \"content\": \"fn find_content(req: Rc<HttpRequest<AppState>>, filter: Option<FindFilter>) -> StdResult<impl Future<Item=Result<content::ContentFullDisplay>, Error=Error>, ActixError> {\\n\\n let req_for_contents = Rc::clone(&req);\\n\\n let req_for_err = Rc::clone(&req);\\n\\n let name = match req_for_contents.match_info().get(\\\"name\\\") {\\n\\n Some(name) => {\\n\\n let numeric = regex::Regex::new(r\\\"^\\\\d+$\\\").unwrap();\\n\\n let name_string = regex::Regex::new(r\\\"^\\\\w+(-\\\\w+)*$\\\").unwrap();\\n\\n\\n\\n if numeric.is_match(name) {\\n\\n let id = name.parse::<u32>().unwrap();\\n\\n Ok(content::Find::ById(id))\\n\\n } else if name_string.is_match(name) {\\n\\n Ok(content::Find::ByName(name.into()))\\n\\n } else {\\n\\n Err(error_handler(req_for_err)(Error::bad_request_error(Some(\\\"[param]\\\"), None)))\\n\\n }\\n\\n }\\n\\n None => Err(error_handler(req_for_err)(Error::bad_request_error(Some(\\\"[param]\\\"), None))),\\n\\n };\\n\\n\\n\\n name.map(move |name| {\\n\\n req_for_contents.state().database\\n\\n .send(content::FindContent {\\n\\n inner: name,\\n\\n filter,\\n\\n })\\n\\n .from_err()\\n\\n })\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/controllers/blog/content.rs\",\n \"rank\": 29,\n \"score\": 12266.476914902847\n },\n {\n \"content\": \"use actix::{Message, Handler};\\n\\nuse diesel;\\n\\nuse diesel::*;\\n\\nuse chrono::NaiveDateTime;\\n\\n\\n\\nuse result::Result;\\n\\nuse database::{DatabaseExecutor, Conn, last_insert_id};\\n\\nuse message::{PaginatedListMessage, Pagination, UpdateByID};\\n\\nuse error::{Error, database::map_database_error};\\n\\nuse schema::push_messages;\\n\\n\\n\\n#[derive(Deserialize, Insertable, Debug)]\\n\\n#[table_name = \\\"push_messages\\\"]\\n\\npub struct NewPushMessage {\\n\\n pub content: String,\\n\\n}\\n\\n\\n\\n#[derive(Deserialize, AsChangeset, Debug)]\\n\\n#[table_name = \\\"push_messages\\\"]\\n\\npub struct UpdatePushMessage {\\n\",\n \"file_path\": \"src/models/push_message.rs\",\n \"rank\": 32,\n \"score\": 15.560294586319692\n },\n {\n \"content\": \"use actix::{Message, Handler};\\n\\nuse diesel;\\n\\nuse diesel::*;\\n\\nuse chrono::NaiveDateTime;\\n\\n\\n\\nuse result::Result;\\n\\nuse database::{DatabaseExecutor, Conn, last_insert_id};\\n\\nuse message::{PaginatedListMessage, Pagination, UpdateByID};\\n\\nuse error::{Error, database::map_database_error};\\n\\nuse schema::contents;\\n\\nuse schema::contents::dsl as column;\\n\\nuse models::category::FindCategory;\\n\\n\\n\\n#[derive(Deserialize, Insertable, Debug)]\\n\\n#[table_name = \\\"contents\\\"]\\n\\npub struct NewContent {\\n\\n pub name: Option<String>,\\n\\n pub title: String,\\n\\n pub category_id: Option<u32>,\\n\\n pub keywords: String,\\n\",\n \"file_path\": \"src/models/content.rs\",\n \"rank\": 33,\n \"score\": 15.214014857159071\n },\n {\n \"content\": \"use std::collections::{HashMap, HashSet};\\n\\n\\n\\nuse actix::{Message, Handler};\\n\\nuse diesel;\\n\\nuse diesel::*;\\n\\nuse chrono::NaiveDateTime;\\n\\n\\n\\nuse result::Result;\\n\\nuse database::{DatabaseExecutor, Conn, last_insert_id};\\n\\nuse message::{PaginatedListMessage, Pagination, UpdateByID};\\n\\nuse error::{Error, database::map_database_error};\\n\\n\\n\\nuse schema::subjects;\\n\\nuse schema::subject_relates;\\n\\n\\n\\npub struct Subject;\\n\\n\\n\\n#[derive(Deserialize, Insertable, Debug)]\\n\\n#[table_name = \\\"subjects\\\"]\\n\\npub struct NewSubject {\\n\",\n \"file_path\": \"src/models/subject.rs\",\n \"rank\": 34,\n \"score\": 14.943558846573772\n },\n {\n \"content\": \"use actix::{Message, Handler};\\n\\nuse diesel;\\n\\nuse diesel::*;\\n\\nuse diesel::dsl::exists;\\n\\nuse chrono::NaiveDateTime;\\n\\n\\n\\nuse result::Result;\\n\\nuse database::{DatabaseExecutor, Conn, last_insert_id};\\n\\nuse message::{PaginatedListMessage, Pagination, UpdateByID};\\n\\nuse error::{Error, database::map_database_error};\\n\\nuse schema::recommend_contents;\\n\\n\\n\\n#[derive(Serialize, Deserialize, Debug, Clone, Queryable)]\\n\\npub struct RecommendContentDisplay {\\n\\n pub id: u32,\\n\\n pub content_id: Option<u32>,\\n\\n pub source: String,\\n\\n pub title: String,\\n\\n pub summary: String,\\n\\n pub created_at: NaiveDateTime,\\n\",\n \"file_path\": \"src/models/recommend.rs\",\n \"rank\": 35,\n \"score\": 14.536159707878902\n },\n {\n \"content\": \"use std::rc::Rc;\\n\\nuse std::sync::Arc;\\n\\nuse actix::*;\\n\\nuse actix::dev::{Request, ToEnvelope};\\n\\nuse diesel::{sql_query, RunQueryDsl};\\n\\nuse diesel::prelude::MysqlConnection;\\n\\nuse diesel::r2d2::{ConnectionManager, Pool};\\n\\nuse database::DatabaseExecutor;\\n\\n\\n\\npub struct Config {\\n\\n pub static_assets_handle: bool,\\n\\n pub static_assets_path: Option<String>,\\n\\n pub public_path: Option<String>,\\n\\n pub database_url: String,\\n\\n pub database_timezone: Option<String>,\\n\\n}\\n\\n\\n\\n#[derive(Clone)]\\n\\npub struct AppState {\\n\\n pub static_assets_handle: bool,\\n\",\n \"file_path\": \"src/state.rs\",\n \"rank\": 36,\n \"score\": 12.995140067614457\n },\n {\n \"content\": \" use schema::categories::dsl::*;\\n\\n\\n\\n Ok(\\n\\n categories\\n\\n .filter(name.eq(category_name))\\n\\n .first::<CategoryFullDisplay>(connection)\\n\\n .map_err(map_database_error(Some(\\\"categories\\\")))?\\n\\n )\\n\\n }\\n\\n\\n\\n pub fn create(connection: &Conn, category: NewCategory) -> Result<u64> {\\n\\n use schema::categories::dsl::*;\\n\\n\\n\\n diesel::insert_into(categories)\\n\\n .values(category)\\n\\n .execute(connection)\\n\\n .map_err(map_database_error(Some(\\\"categories\\\")))?;\\n\\n\\n\\n let generated_id: u64 = diesel::select(last_insert_id)\\n\\n .first(connection)\\n\",\n \"file_path\": \"src/models/category.rs\",\n \"rank\": 38,\n \"score\": 12.696405077869231\n },\n {\n \"content\": \" .map_err(map_database_error(Some(\\\"contents\\\")))?;\\n\\n\\n\\n let generated_id: u64 = diesel::select(last_insert_id)\\n\\n .first(connection)\\n\\n .map_err(map_database_error(Some(\\\"contents\\\")))?;\\n\\n\\n\\n Ok(generated_id as u32)\\n\\n }\\n\\n\\n\\n pub fn delete(connection: &Conn, target: u32) -> Result<usize> {\\n\\n use schema::contents::dsl::*;\\n\\n\\n\\n let count = delete_by_id!(connection => (\\n\\n contents # = target\\n\\n ))?;\\n\\n\\n\\n Ok(count)\\n\\n }\\n\\n\\n\\n pub fn publish(connection: &Conn, target: u32) -> Result<Option<ContentFullDisplay>> {\\n\",\n \"file_path\": \"src/models/content.rs\",\n \"rank\": 39,\n \"score\": 12.536911278812902\n },\n {\n \"content\": \"use actix::{Message, Handler};\\n\\nuse diesel;\\n\\nuse diesel::*;\\n\\nuse diesel::dsl::exists;\\n\\nuse chrono::NaiveDateTime;\\n\\n\\n\\nuse result::Result;\\n\\nuse database::{DatabaseExecutor, Conn, last_insert_id};\\n\\nuse message::{PaginatedListMessage, Pagination, UpdateByID};\\n\\nuse error::{Error, database::map_database_error};\\n\\nuse schema::categories;\\n\\nuse schema::categories::dsl as column;\\n\\nuse regex::Regex;\\n\\n\\n\",\n \"file_path\": \"src/models/category.rs\",\n \"rank\": 40,\n \"score\": 12.522930379247322\n },\n {\n \"content\": \" };\\n\\n\\n\\n Self::create(connection, creator)\\n\\n }\\n\\n\\n\\n pub fn create(connection: &Conn, data: NewRecommendContent) -> Result<u32> {\\n\\n use schema::recommend_contents::dsl::*;\\n\\n\\n\\n diesel::insert_into(recommend_contents)\\n\\n .values(&data)\\n\\n .execute(connection)\\n\\n .map_err(map_database_error(Some(\\\"recommend_contents\\\")))?;\\n\\n\\n\\n let generated_id: u64 = diesel::select(last_insert_id)\\n\\n .first(connection)\\n\\n .map_err(map_database_error(Some(\\\"recommend_contents\\\")))?;\\n\\n\\n\\n Ok(generated_id as u32)\\n\\n }\\n\\n\\n\",\n \"file_path\": \"src/models/recommend.rs\",\n \"rank\": 41,\n \"score\": 11.842601221020233\n },\n {\n \"content\": \" .values(&data)\\n\\n .execute(connection)\\n\\n .map_err(map_database_error(Some(\\\"push_messages\\\")))?;\\n\\n\\n\\n let generated_id: u64 = diesel::select(last_insert_id)\\n\\n .first(connection)\\n\\n .map_err(map_database_error(Some(\\\"push_messages\\\")))?;\\n\\n\\n\\n Ok(generated_id as u32)\\n\\n }\\n\\n\\n\\n pub fn find_by_id(connection: &Conn, target: u32) -> Result<PushMessageDisplay> {\\n\\n use schema::push_messages::dsl::*;\\n\\n\\n\\n find_by_id!(connection => (\\n\\n push_messages # = target => PushMessageDisplay\\n\\n ))\\n\\n }\\n\\n\\n\\n pub fn update(connection: &Conn, target: u32, data: UpdatePushMessage) -> Result<Option<PushMessageDisplay>> {\\n\",\n \"file_path\": \"src/models/push_message.rs\",\n \"rank\": 43,\n \"score\": 11.563568780598185\n },\n {\n \"content\": \"\\n\\nimpl Content {\\n\\n pub const DISPLAY_COLUMNS: (\\n\\n column::id, column::name, column::title,\\n\\n column::category_id, column::keywords, column::description,\\n\\n column::sort, column::content_type, column::display,\\n\\n column::published_at, column::modified_at\\n\\n ) = (\\n\\n column::id, column::name, column::title,\\n\\n column::category_id, column::keywords, column::description,\\n\\n column::sort, column::content_type, column::display,\\n\\n column::published_at, column::modified_at\\n\\n );\\n\\n\\n\\n pub fn create(connection: &Conn, data: NewContent) -> Result<u32> {\\n\\n use schema::contents::dsl::*;\\n\\n\\n\\n diesel::insert_into(contents)\\n\\n .values(&data)\\n\\n .execute(connection)\\n\",\n \"file_path\": \"src/models/content.rs\",\n \"rank\": 44,\n \"score\": 11.329146997951185\n },\n {\n \"content\": \" pub fn get_relate_base_info_list(connection: &Conn, target: u32, display: bool) -> Result<Vec<SubjectRelateBaseInfo>> {\\n\\n use schema::contents;\\n\\n use schema::subject_relates as sr;\\n\\n\\n\\n sr::table\\n\\n .inner_join(contents::table.on(\\n\\n sr::content_id.eq(contents::id)\\n\\n .and(contents::display.eq(display))\\n\\n ))\\n\\n .select((contents::id, contents::name, contents::title, contents::category_id, contents::sort, contents::content_type, contents::display, sr::sort))\\n\\n .filter(sr::subject_id.eq(target))\\n\\n .order_by((sr::sort.desc(), contents::sort.desc()))\\n\\n .load::<SubjectRelateBaseInfo>(connection)\\n\\n .map_err(map_database_error(Some(\\\"subject_relates\\\")))\\n\\n }\\n\\n}\\n\\n\\n\\n#[derive(Clone, Debug, Copy)]\\n\\npub struct GetRelateList {\\n\\n pub target: u32,\\n\\n pub display: bool\\n\\n}\",\n \"file_path\": \"src/models/subject.rs\",\n \"rank\": 45,\n \"score\": 11.199991508797991\n },\n {\n \"content\": \" pub updated_at: Option<NaiveDateTime>,\\n\\n}\\n\\n\\n\\n#[derive(Deserialize, Insertable, Debug)]\\n\\n#[table_name = \\\"recommend_contents\\\"]\\n\\npub struct NewRecommendContent {\\n\\n pub content_id: u32,\\n\\n pub source: String,\\n\\n pub title: String,\\n\\n pub summary: String,\\n\\n}\\n\\n\\n\\npub struct RecommendContent;\\n\\n\\n\\nimpl RecommendContent {\\n\\n pub fn push(connection: &Conn, origin_id: u32, summary: Option<String>) -> Result<u32> {\\n\\n use super::content::Content;\\n\\n\\n\\n let result = Content::find_by_id(connection, origin_id, None)?;\\n\\n let id = result.id.to_string();\\n\",\n \"file_path\": \"src/models/recommend.rs\",\n \"rank\": 47,\n \"score\": 10.907087877127099\n },\n {\n \"content\": \" }\\n\\n\\n\\n Ok(())\\n\\n })\\n\\n }\\n\\n\\n\\n pub fn find_by_id(connection: &Conn, target: u32) -> Result<SubjectDisplay> {\\n\\n use schema::subjects::dsl::*;\\n\\n\\n\\n find_by_id!(connection => (\\n\\n subjects # = target => SubjectDisplay\\n\\n ))\\n\\n }\\n\\n\\n\\n pub fn find_by_name(connection: &Conn, target: String) -> Result<SubjectDisplay> {\\n\\n use schema::subjects::dsl::*;\\n\\n\\n\\n find_by_id!(connection => (\\n\\n subjects name = target => SubjectDisplay\\n\\n ))\\n\",\n \"file_path\": \"src/models/subject.rs\",\n \"rank\": 48,\n \"score\": 10.268277467260889\n },\n {\n \"content\": \" use schema::contents::dsl::*;\\n\\n use chrono::Utc;\\n\\n\\n\\n let count = diesel::update(contents)\\n\\n .set((display.eq(true), published_at.eq(Some(Utc::now().naive_local()))))\\n\\n .filter(id.eq(target))\\n\\n .execute(connection)\\n\\n .map_err(map_database_error(Some(\\\"contents\\\")))?;\\n\\n\\n\\n if count > 0 {\\n\\n Ok(Self::find_by_id(connection, target, None).ok())\\n\\n } else {\\n\\n Ok(None)\\n\\n }\\n\\n }\\n\\n\\n\\n pub fn unpublish(connection: &Conn, target: u32) -> Result<Option<ContentFullDisplay>> {\\n\\n use schema::contents::dsl::*;\\n\\n\\n\\n let count = diesel::update(contents)\\n\",\n \"file_path\": \"src/models/content.rs\",\n \"rank\": 49,\n \"score\": 10.180613389921602\n },\n {\n \"content\": \" .map_err(map_database_error(Some(\\\"categories\\\")))?;\\n\\n\\n\\n Ok(generated_id)\\n\\n }\\n\\n\\n\\n pub fn delete(connection: &Conn, category_id: u32) -> Result<usize> {\\n\\n use schema::categories::dsl::*;\\n\\n\\n\\n let count = delete_by_id!(connection => (categories # = category_id))?;\\n\\n\\n\\n Ok(count)\\n\\n }\\n\\n\\n\\n pub fn update(connection: &Conn, category_id: u32, update: UpdateCategory) -> Result<Option<CategoryFullDisplay>> {\\n\\n use schema::categories::dsl::*;\\n\\n\\n\\n let count = update_by_id!(connection => (\\n\\n categories # = category_id; <- &update\\n\\n ))?;\\n\\n\\n\",\n \"file_path\": \"src/models/category.rs\",\n \"rank\": 50,\n \"score\": 10.07740334235989\n },\n {\n \"content\": \" pub sort: Option<i16>,\\n\\n}\\n\\n\\n\\n#[derive(Debug, Clone, Serialize, Deserialize, Queryable)]\\n\\npub struct PushMessageDisplay {\\n\\n pub id: u32,\\n\\n pub content: String,\\n\\n pub sort: i16,\\n\\n pub created_at: NaiveDateTime,\\n\\n pub updated_at: Option<NaiveDateTime>,\\n\\n}\\n\\n\\n\\npub struct PushMessage;\\n\\n\\n\\nimpl PushMessage {\\n\\n\\n\\n pub fn create(connection: &Conn, data: NewPushMessage) -> Result<u32> {\\n\\n use schema::push_messages::dsl::*;\\n\\n\\n\\n diesel::insert_into(push_messages)\\n\",\n \"file_path\": \"src/models/push_message.rs\",\n \"rank\": 51,\n \"score\": 9.633276836257073\n },\n {\n \"content\": \" }\\n\\n\\n\\n pub fn update(connection: &Conn, target: u32, update: UpdateSubject) -> Result<Option<SubjectDisplay>> {\\n\\n use schema::subjects::dsl::*;\\n\\n\\n\\n let count = update_by_id!(connection => (\\n\\n subjects # = target; <- &update\\n\\n ))?;\\n\\n\\n\\n if count > 0 {\\n\\n Ok(Self::find_by_id(connection, target).ok())\\n\\n } else {\\n\\n Ok(None)\\n\\n }\\n\\n }\\n\\n\\n\\n pub fn delete(connection: &Conn, target: u32) -> Result<(usize, usize)> {\\n\\n use schema::subjects::dsl::*;\\n\\n\\n\\n connection.transaction(|| {\\n\",\n \"file_path\": \"src/models/subject.rs\",\n \"rank\": 52,\n \"score\": 9.555999533163517\n },\n {\n \"content\": \" }\\n\\n\\n\\n query.order((sort.desc(), created_at.desc(), id.desc()))\\n\\n });\\n\\n\\n\\n paginator()\\n\\n }\\n\\n\\n\\n pub fn find_by_id(connection: &Conn, category_id: u32) -> Result<CategoryFullDisplay> {\\n\\n use schema::categories::dsl::*;\\n\\n\\n\\n Ok(\\n\\n categories\\n\\n .filter(id.eq(category_id))\\n\\n .first::<CategoryFullDisplay>(connection)\\n\\n .map_err(map_database_error(Some(\\\"categories\\\")))?\\n\\n )\\n\\n }\\n\\n\\n\\n pub fn find_by_name(connection: &Conn, category_name: String) -> Result<CategoryFullDisplay> {\\n\",\n \"file_path\": \"src/models/category.rs\",\n \"rank\": 53,\n \"score\": 9.293064031392081\n },\n {\n \"content\": \" pub content_type: u16,\\n\\n pub published_at: Option<NaiveDateTime>,\\n\\n pub modified_at: Option<NaiveDateTime>,\\n\\n pub display: bool,\\n\\n pub relate_sort: i16,\\n\\n}\\n\\n\\n\\nimpl Subject {\\n\\n pub fn create(connection: &Conn, create: CreateSubject) -> Result<u32> {\\n\\n use schema::subjects::dsl::*;\\n\\n\\n\\n connection.transaction(move || {\\n\\n let rows: usize = diesel::insert_into(subjects)\\n\\n .values(&create.subject)\\n\\n .execute(connection)\\n\\n .map_err(map_database_error(Some(\\\"subjects\\\")))?;\\n\\n\\n\\n if rows < 1 {\\n\\n return Err(Error::internal_server_error(Some(\\\"[unknown]\\\"), None));\\n\\n }\\n\",\n \"file_path\": \"src/models/subject.rs\",\n \"rank\": 54,\n \"score\": 9.230255738204312\n },\n {\n \"content\": \"use std::collections::HashMap;\\n\\nuse std::fmt;\\n\\nuse message::ErrorMessage;\\n\\nuse diesel::result::{\\n\\n Error as DieselError,\\n\\n DatabaseErrorKind as DieselDatabaseErrorKind,\\n\\n};\\n\\n\\n\\nuse super::error_msg;\\n\\nuse super::Error;\\n\\nuse super::ErrorDetail;\\n\\n\\n\\npub const NOT_FOUND: u16 = 10022;\\n\\npub const CONFLICT: u16 = 10013;\\n\\npub const GET_CONNECTION_ERROR: u16 = 10001;\\n\\npub const UNKNOWN_DB_ERROR: u16 = 10099;\\n\\n\\n\",\n \"file_path\": \"src/error/database.rs\",\n \"rank\": 55,\n \"score\": 9.220502430197985\n },\n {\n \"content\": \"use std::borrow::BorrowMut;\\n\\nuse std::collections::HashMap;\\n\\nuse actix::MailboxError;\\n\\nuse actix_web::{HttpRequest, HttpResponse, HttpMessage, http::StatusCode};\\n\\nuse actix_web::error::{Error as ActixError, ResponseError};\\n\\nuse std::fmt::{self, Formatter};\\n\\nuse message::ErrorMessage;\\n\\nuse tera::{Context, Tera};\\n\\nuse template::TEMPLATES;\\n\\nuse mime;\\n\\n\\n\\npub mod database;\\n\\n\\n\\npub const UNKNOWN_ERROR: u16 = 65535;\\n\\npub const ACTOR_MAILBOX_ERROR: u16 = 60001;\\n\\n\\n\",\n \"file_path\": \"src/error/mod.rs\",\n \"rank\": 56,\n \"score\": 9.089622123078314\n },\n {\n \"content\": \"\\n\\n let generated_id: u64 = diesel::select(last_insert_id)\\n\\n .first(connection)\\n\\n .map_err(map_database_error(Some(\\\"subjects\\\")))?;\\n\\n let generated_id = generated_id as u32;\\n\\n\\n\\n match create.relates {\\n\\n Some(relates) => {\\n\\n use schema::subject_relates::dsl::*;\\n\\n\\n\\n let mut create_relates = Vec::with_capacity(10);\\n\\n for relate in relates {\\n\\n create_relates.push(\\n\\n (subject_id.eq(generated_id), content_id.eq(relate.content_id), sort.eq(relate.sort.unwrap_or(0)))\\n\\n );\\n\\n }\\n\\n\\n\\n if create_relates.len() > 0 {\\n\\n diesel::insert_into(subject_relates)\\n\\n .values(&create_relates)\\n\",\n \"file_path\": \"src/models/subject.rs\",\n \"rank\": 57,\n \"score\": 8.842495405221767\n },\n {\n \"content\": \" pub description: String,\\n\\n pub sort: i16,\\n\\n pub content_type: u16,\\n\\n pub content: Option<String>,\\n\\n pub display: bool,\\n\\n pub published_at: Option<NaiveDateTime>,\\n\\n pub as_page: bool,\\n\\n}\\n\\n\\n\\n#[derive(Deserialize, AsChangeset, Debug)]\\n\\n#[table_name = \\\"contents\\\"]\\n\\npub struct UpdateContent {\\n\\n pub name: Option<String>,\\n\\n pub title: Option<String>,\\n\\n pub category_id: Option<u32>,\\n\\n pub keywords: Option<String>,\\n\\n pub description: Option<String>,\\n\\n pub sort: Option<i16>,\\n\\n pub content_type: Option<u16>,\\n\\n pub content: Option<String>,\\n\",\n \"file_path\": \"src/models/content.rs\",\n \"rank\": 58,\n \"score\": 8.715968505739173\n },\n {\n \"content\": \" let count = delete_by_id!(connection => (subjects # = target))?;\\n\\n if count > 0 {\\n\\n use schema::subject_relates::dsl::*;\\n\\n let relates_count = delete_by_id!(connection => (subject_relates subject_id = target))?;\\n\\n\\n\\n Ok((count, relates_count))\\n\\n } else {\\n\\n Ok((count, 0))\\n\\n }\\n\\n })\\n\\n }\\n\\n\\n\\n pub fn get_list(connection: &Conn) {}\\n\\n\\n\\n pub fn get_relate_list(connection: &Conn, paginated: Pagination<GetRelateList>) -> Result<PaginatedListMessage<SubjectRelateInfo>> {\\n\\n use schema::contents;\\n\\n use schema::subject_relates as sr;\\n\\n\\n\\n let target = paginated.filter.ok_or(Error::bad_request_error(Some(\\\"[param]\\\"), None))?.target;\\n\\n let display = paginated.filter.ok_or(Error::bad_request_error(Some(\\\"[param]\\\"), None))?.display;\\n\",\n \"file_path\": \"src/models/subject.rs\",\n \"rank\": 59,\n \"score\": 8.686555919456504\n },\n {\n \"content\": \" query = query.filter(content.like(format!(\\\"%{}%\\\", &v)));\\n\\n }\\n\\n }\\n\\n\\n\\n query.order((sort.desc(), created_at.desc()))\\n\\n });\\n\\n\\n\\n paginator()\\n\\n }\\n\\n\\n\\n pub fn delete(connection: &Conn, target: u32) -> Result<usize> {\\n\\n use schema::push_messages::dsl::*;\\n\\n\\n\\n let count = delete_by_id!(connection => (\\n\\n push_messages # = target\\n\\n ))?;\\n\\n\\n\\n Ok(count)\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/models/push_message.rs\",\n \"rank\": 60,\n \"score\": 7.77304245888177\n },\n {\n \"content\": \"pub struct SubjectRelateBaseInfo {\\n\\n pub id: u32,\\n\\n pub name: Option<String>,\\n\\n pub title: String,\\n\\n pub category_id: Option<u32>,\\n\\n pub content_sort: i16,\\n\\n pub content_type: u16,\\n\\n pub display: bool,\\n\\n pub relate_sort: i16,\\n\\n}\\n\\n\\n\\n#[derive(Debug, Clone, Serialize, Deserialize, Queryable)]\\n\\npub struct SubjectRelateInfo {\\n\\n pub id: u32,\\n\\n pub name: Option<String>,\\n\\n pub title: String,\\n\\n pub category_id: Option<u32>,\\n\\n pub description: String,\\n\\n pub keywords: String,\\n\\n pub content_sort: i16,\\n\",\n \"file_path\": \"src/models/subject.rs\",\n \"rank\": 61,\n \"score\": 7.749685817807141\n },\n {\n \"content\": \" .execute(connection)\\n\\n .map_err(map_database_error(Some(\\\"subject_relates\\\")))?;\\n\\n }\\n\\n }\\n\\n None => (),\\n\\n };\\n\\n\\n\\n Ok(generated_id)\\n\\n })\\n\\n }\\n\\n\\n\\n pub fn sync_relates(connection: &Conn, target: u32, sync: Vec<SubjectRelate>) -> Result<()> {\\n\\n use schema::subject_relates::dsl::*;\\n\\n\\n\\n let mut key_index = Vec::with_capacity(sync.len());\\n\\n\\n\\n for item in &sync {\\n\\n key_index.push(item.content_id);\\n\\n }\\n\\n\\n\",\n \"file_path\": \"src/models/subject.rs\",\n \"rank\": 62,\n \"score\": 7.703710709495733\n },\n {\n \"content\": \" .unwrap_or(1);\\n\\n let per_page = query.get(\\\"per_page\\\")\\n\\n .map(|v| v.parse::<i64>().unwrap_or(Self::DEFAULT_PER_PAGE))\\n\\n .unwrap_or(Self::DEFAULT_PER_PAGE);\\n\\n\\n\\n Pagination::<T> {\\n\\n page,\\n\\n per_page,\\n\\n filter: None\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\n#[derive(Copy, Clone)]\\n\\npub struct UpdateByID<T> {\\n\\n pub id: u32,\\n\\n pub update: T,\\n\\n}\\n\\n\\n\\n#[derive(Deserialize,Serialize, Debug)]\\n\\npub struct CreatedObjectIdMessage {\\n\\n pub id: u64,\\n\\n}\\n\\n\\n\\n#[derive(Deserialize,Serialize, Debug)]\\n\\npub struct DeletedObjectMessage {\\n\\n pub count: u32,\\n\\n}\",\n \"file_path\": \"src/message.rs\",\n \"rank\": 63,\n \"score\": 7.561086769200411\n },\n {\n \"content\": \" use schema::push_messages::dsl::*;\\n\\n\\n\\n let count = update_by_id!(connection => (\\n\\n push_messages # = target; <- &data\\n\\n ))?;\\n\\n\\n\\n if count > 0 {\\n\\n Ok(Self::find_by_id(connection, target).ok())\\n\\n } else {\\n\\n Ok(None)\\n\\n }\\n\\n }\\n\\n\\n\\n pub fn get_list(connection: &Conn, c: Pagination<GetPushMessages>) -> Result<PaginatedListMessage<PushMessageDisplay>> {\\n\\n use schema::push_messages::dsl::*;\\n\\n\\n\\n let paginator = paginator!(connection, c, PushMessageDisplay, {\\n\\n let mut query = push_messages.into_boxed();\\n\\n if let Some(filter) = c.clone().filter {\\n\\n if let Some(v) = filter.keywords {\\n\",\n \"file_path\": \"src/models/push_message.rs\",\n \"rank\": 64,\n \"score\": 7.5015358583754415\n },\n {\n \"content\": \" None => (),\\n\\n };\\n\\n\\n\\n query.first::<ContentFullDisplay>(connection).map_err(map_database_error(Some(\\\"contents\\\")))\\n\\n }\\n\\n\\n\\n pub fn update(connection: &Conn, target: u32, data: UpdateContent) -> Result<Option<ContentFullDisplay>> {\\n\\n use schema::contents::dsl::*;\\n\\n\\n\\n let count = update_by_id!(connection => (\\n\\n contents # = target; <- &data\\n\\n ))?;\\n\\n\\n\\n if count > 0 {\\n\\n Ok(Self::find_by_id(connection, target, None).ok())\\n\\n } else {\\n\\n Ok(None)\\n\\n }\\n\\n }\\n\\n\\n\",\n \"file_path\": \"src/models/content.rs\",\n \"rank\": 65,\n \"score\": 7.436678591594777\n },\n {\n \"content\": \"use error::ErrorDetail;\\n\\nuse actix_web::HttpRequest;\\n\\n\\n\\n/// 错误消息体\\n\\n///\\n\\n/// 错误消息体最终会转换为对应的 JSON 格式。\\n\\n#[derive(Deserialize, Serialize, Debug)]\\n\\npub struct ErrorMessage<T> {\\n\\n /// 错误代码，`u16` 类型，默认为 65535，意为未知服务错误\\n\\n pub code: u16,\\n\\n /// 错误消息，`String` 类型。该字段简要描述错误信息\\n\\n pub msg: String,\\n\\n /// 错误详情\\n\\n pub body: Option<T>,\\n\\n}\\n\\n\\n\\nimpl<T> ErrorMessage<T> {\\n\\n pub fn new(code: u16, msg: String, body: Option<T>) -> Self {\\n\\n ErrorMessage::<T> {\\n\\n code,\\n\",\n \"file_path\": \"src/message.rs\",\n \"rank\": 66,\n \"score\": 7.247960934054548\n },\n {\n \"content\": \" if count > 0 {\\n\\n Ok(Self::find_by_id(connection, category_id).ok())\\n\\n } else {\\n\\n Ok(None)\\n\\n }\\n\\n }\\n\\n\\n\\n pub fn exists(connection: &Conn, category: String) -> Result<bool> {\\n\\n use schema::categories::dsl::*;\\n\\n\\n\\n let regex = Regex::new(r\\\"^\\\\d+$\\\").unwrap();\\n\\n\\n\\n if regex.is_match(&category) {\\n\\n let category_id = category.parse::<u32>().unwrap();\\n\\n select(exists(categories.filter(id.eq(category_id))))\\n\\n .get_result(connection).map_err(map_database_error(Some(\\\"categories\\\")))\\n\\n } else {\\n\\n select(exists(categories.filter(name.eq(category))))\\n\\n .get_result(connection).map_err(map_database_error(Some(\\\"categories\\\")))\\n\\n }\\n\",\n \"file_path\": \"src/models/category.rs\",\n \"rank\": 67,\n \"score\": 7.210289165154416\n },\n {\n \"content\": \"\\n\\n let paginator = paginator!(\\n\\n connection,\\n\\n (contents::id, contents::name, contents::title, contents::category_id, contents::description, contents::keywords, contents::sort, contents::content_type, contents::published_at, contents::modified_at, contents::display, sr::sort),\\n\\n paginated,\\n\\n SubjectRelateInfo,\\n\\n {\\n\\n\\n\\n sr::table\\n\\n .inner_join(contents::table.on(\\n\\n sr::content_id.eq(contents::id)\\n\\n .and(contents::display.eq(display))\\n\\n ))\\n\\n .filter(sr::subject_id.eq(target))\\n\\n .order_by((sr::sort.desc(), contents::sort.desc()))\\n\\n });\\n\\n\\n\\n paginator()\\n\\n }\\n\\n\\n\",\n \"file_path\": \"src/models/subject.rs\",\n \"rank\": 68,\n \"score\": 7.152829787901771\n },\n {\n \"content\": \" pub display: Option<bool>,\\n\\n pub published_at: Option<NaiveDateTime>,\\n\\n pub modified_at: Option<NaiveDateTime>,\\n\\n}\\n\\n\\n\\n#[derive(Debug, Clone, Serialize, Deserialize, Queryable)]\\n\\npub struct ContentDisplay {\\n\\n pub id: u32,\\n\\n pub name: Option<String>,\\n\\n pub title: String,\\n\\n pub category_id: Option<u32>,\\n\\n pub keywords: String,\\n\\n pub description: String,\\n\\n pub sort: i16,\\n\\n pub content_type: u16,\\n\\n pub display: bool,\\n\\n pub published_at: Option<NaiveDateTime>,\\n\\n pub modified_at: Option<NaiveDateTime>,\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/models/content.rs\",\n \"rank\": 69,\n \"score\": 7.085722736439804\n },\n {\n \"content\": \"use chrono::NaiveDateTime;\\n\\n\\n\\npub mod index;\\n\\npub mod content;\\n\\npub mod push_message;\\n\\npub mod rss;\\n\\n\\n\\n#[derive(Serialize)]\\n\\npub struct Content {\\n\\n pub id: u32,\\n\\n pub name: Option<String>,\\n\\n pub title: String,\\n\\n pub description: String,\\n\\n pub published_at_o: Option<NaiveDateTime>,\\n\\n pub published_at: Option<String>,\\n\\n}\\n\\n\\n\\n#[derive(Serialize)]\\n\\npub struct PushMessage {\\n\\n pub id: u32,\\n\\n pub content: String,\\n\\n pub created_at: String,\\n\\n pub created_at_o: NaiveDateTime,\\n\\n}\",\n \"file_path\": \"src/controllers/blog/mod.rs\",\n \"rank\": 70,\n \"score\": 7.057686213766122\n },\n {\n \"content\": \"use actix_web::{HttpRequest, HttpResponse, Result};\\n\\nuse actix_web::middleware::{Middleware, Started};\\n\\nuse actix_web::middleware::session::RequestSession;\\n\\n\\n\\nuse util::auth::PrivateClaims;\\n\\nuse util::message::ErrorMessage;\\n\\n\\n\\npub struct Authenticate;\\n\\n\\n\\nimpl<S> Middleware<S> for Authenticate {\\n\\n fn start(&self, req: &mut HttpRequest<S>) -> Result<Started> {\\n\\n if let Some(_) = req.session().get::<PrivateClaims>(\\\"claims\\\")? {\\n\\n Ok(Started::Done)\\n\\n } else {\\n\\n Ok(Started::Response(HttpResponse::Unauthorized().json(ErrorMessage::<String> {\\n\\n code: 10014,\\n\\n msg: \\\"Invalid authentication token.\\\".to_owned(),\\n\\n body: None,\\n\\n })))\\n\\n }\\n\\n }\\n\\n}\",\n \"file_path\": \"src/middlewares/authenticate.rs\",\n \"rank\": 71,\n \"score\": 7.0037147547386\n },\n {\n \"content\": \"#[derive(Debug, Clone, Serialize, Deserialize, Queryable)]\\n\\npub struct ContentFullDisplay {\\n\\n pub id: u32,\\n\\n pub name: Option<String>,\\n\\n pub title: String,\\n\\n pub category_id: Option<u32>,\\n\\n pub as_page: bool,\\n\\n pub keywords: String,\\n\\n pub description: String,\\n\\n pub sort: i16,\\n\\n pub content_type: u16,\\n\\n pub content: Option<String>,\\n\\n pub display: bool,\\n\\n pub published_at: Option<NaiveDateTime>,\\n\\n pub modified_at: Option<NaiveDateTime>,\\n\\n pub created_at: NaiveDateTime,\\n\\n pub updated_at: Option<NaiveDateTime>,\\n\\n}\\n\\n\\n\\npub struct Content;\\n\",\n \"file_path\": \"src/models/content.rs\",\n \"rank\": 72,\n \"score\": 6.9854144427317575\n },\n {\n \"content\": \" .set((display.eq(false), published_at.eq::<Option<NaiveDateTime>>(None)))\\n\\n .filter(id.eq(target))\\n\\n .execute(connection)\\n\\n .map_err(map_database_error(Some(\\\"contents\\\")))?;\\n\\n\\n\\n if count > 0 {\\n\\n Ok(Self::find_by_id(connection, target, None).ok())\\n\\n } else {\\n\\n Ok(None)\\n\\n }\\n\\n }\\n\\n\\n\\n pub fn find_by_id(connection: &Conn, target: u32, find_filter: Option<FindFilter>) -> Result<ContentFullDisplay> {\\n\\n use schema::contents::dsl::*;\\n\\n\\n\\n let mut query = contents.filter(id.eq(target)).into_boxed();\\n\\n\\n\\n match find_filter {\\n\\n Some(filter) => {\\n\\n if let Some(filter_as_page) = filter.as_page {\\n\",\n \"file_path\": \"src/models/content.rs\",\n \"rank\": 73,\n \"score\": 6.974175010776383\n },\n {\n \"content\": \"#[macro_use] extern crate diesel;\\n\\n#[macro_use] extern crate serde_derive;\\n\\n#[macro_use] extern crate failure;\\n\\n#[macro_use] extern crate lazy_static;\\n\\n#[macro_use] extern crate tera;\\n\\n#[macro_use] extern crate log;\\n\\n\\n\\nextern crate serde;\\n\\nextern crate serde_json;\\n\\nextern crate actix;\\n\\nextern crate actix_web;\\n\\nextern crate mime;\\n\\nextern crate chrono;\\n\\nextern crate futures;\\n\\nextern crate regex;\\n\\nextern crate comrak;\\n\\nextern crate toml;\\n\\nextern crate rss;\\n\\nextern crate url;\\n\\nextern crate tempdir;\\n\",\n \"file_path\": \"src/lib.rs\",\n \"rank\": 74,\n \"score\": 6.955643549973848\n },\n {\n \"content\": \" pub fn get_list(connection: &Conn, c: Pagination<GetContents>) -> Result<PaginatedListMessage<ContentDisplay>> {\\n\\n use schema::contents::dsl::*;\\n\\n\\n\\n let paginator = paginator!(connection, Self::DISPLAY_COLUMNS, c, ContentDisplay, {\\n\\n let mut query = contents.into_boxed();\\n\\n if let Some(filter) = c.clone().filter {\\n\\n if let Some(v) = filter.search {\\n\\n query = query.filter(name.like(format!(\\\"%{}%\\\", &v)).or(title.like(format!(\\\"%{}%\\\", &v))));\\n\\n }\\n\\n\\n\\n if let Some(v) = filter.display {\\n\\n query = query.filter(display.eq(v));\\n\\n }\\n\\n\\n\\n if let Some(v) = filter.content_type {\\n\\n query = query.filter(content_type.eq(v));\\n\\n }\\n\\n\\n\\n if let Some(v) = filter.category {\\n\\n match v {\\n\",\n \"file_path\": \"src/models/content.rs\",\n \"rank\": 75,\n \"score\": 6.936510760871123\n },\n {\n \"content\": \"pub struct Category;\\n\\n\\n\\nimpl Category {\\n\\n const DISPLAY_COLUMNS: (\\n\\n column::id, column::name, column::display_name,\\n\\n column::description, column::created_at, column::updated_at\\n\\n ) = (\\n\\n column::id, column::name, column::display_name,\\n\\n column::description, column::created_at, column::updated_at\\n\\n );\\n\\n\\n\\n pub fn get_list(connection: &Conn, c: Pagination<GetCategoryList>) -> PaginatedCategoryList {\\n\\n use schema::categories::dsl::*;\\n\\n\\n\\n let paginator = paginator!(connection, Self::DISPLAY_COLUMNS, c, CategoryDisplay, {\\n\\n let mut query = categories.into_boxed();\\n\\n if let Some(filter) = c.clone().filter {\\n\\n if let Some(v) = filter.name {\\n\\n query = query.filter(name.like(format!(\\\"%{}%\\\", v)));\\n\\n }\\n\",\n \"file_path\": \"src/models/category.rs\",\n \"rank\": 76,\n \"score\": 6.883381235141501\n },\n {\n \"content\": \"\\n\\n fn handle(&mut self, finder: DeleteCategory, _: &mut Self::Context) -> Self::Result {\\n\\n Category::delete(&self.connection()?, finder.0)\\n\\n }\\n\\n}\\n\\n\\n\\n#[derive(AsChangeset, Deserialize)]\\n\\n#[table_name = \\\"categories\\\"]\\n\\npub struct UpdateCategory {\\n\\n pub name: Option<String>,\\n\\n pub display_name: Option<String>,\\n\\n pub description: Option<String>,\\n\\n pub sort: Option<i16>,\\n\\n}\\n\\n\\n\\nimpl Message for UpdateByID<UpdateCategory> {\\n\\n type Result = Result<Option<CategoryFullDisplay>>;\\n\\n}\\n\\n\\n\\nimpl Handler<UpdateByID<UpdateCategory>> for DatabaseExecutor {\\n\",\n \"file_path\": \"src/models/category.rs\",\n \"rank\": 77,\n \"score\": 6.744896212942711\n },\n {\n \"content\": \" pub name: Option<String>,\\n\\n pub title: String,\\n\\n pub keywords: String,\\n\\n pub description: String,\\n\\n pub sort: i16,\\n\\n}\\n\\n\\n\\n#[derive(Deserialize, AsChangeset, Debug)]\\n\\n#[table_name = \\\"subjects\\\"]\\n\\npub struct UpdateSubject {\\n\\n pub name: Option<String>,\\n\\n pub title: Option<String>,\\n\\n pub keywords: Option<String>,\\n\\n pub description: Option<String>,\\n\\n pub sort: Option<i16>,\\n\\n}\\n\\n\\n\\n#[derive(Debug, Clone, Serialize, Deserialize, Queryable)]\\n\\npub struct SubjectDisplay {\\n\\n pub id: u32,\\n\",\n \"file_path\": \"src/models/subject.rs\",\n \"rank\": 79,\n \"score\": 6.637769540290594\n },\n {\n \"content\": \" keywords -> Varchar,\\n\\n description -> Varchar,\\n\\n sort -> Smallint,\\n\\n content_type -> Unsigned<Smallint>,\\n\\n content -> Nullable<Mediumtext>,\\n\\n display -> Bool,\\n\\n published_at -> Nullable<Timestamp>,\\n\\n modified_at -> Nullable<Timestamp>,\\n\\n created_at -> Timestamp,\\n\\n updated_at -> Nullable<Timestamp>,\\n\\n }\\n\\n}\\n\\n\\n\\ntable! {\\n\\n push_messages (id) {\\n\\n id -> Unsigned<Integer>,\\n\\n content -> Varchar,\\n\\n sort -> Smallint,\\n\\n created_at -> Timestamp,\\n\\n updated_at -> Nullable<Timestamp>,\\n\",\n \"file_path\": \"src/schema.rs\",\n \"rank\": 80,\n \"score\": 6.564037706423671\n },\n {\n \"content\": \" }\\n\\n}\\n\\n\\n\\ntable! {\\n\\n recommend_contents (id) {\\n\\n id -> Unsigned<Integer>,\\n\\n content_id -> Nullable<Unsigned<Integer>>,\\n\\n source -> Varchar,\\n\\n title -> Varchar,\\n\\n summary -> Varchar,\\n\\n created_at -> Timestamp,\\n\\n updated_at -> Nullable<Timestamp>,\\n\\n }\\n\\n}\\n\\n\\n\\ntable! {\\n\\n subjects (id) {\\n\\n id -> Unsigned<Integer>,\\n\\n name -> Nullable<Varchar>,\\n\\n title -> Varchar,\\n\",\n \"file_path\": \"src/schema.rs\",\n \"rank\": 81,\n \"score\": 6.338395229310613\n },\n {\n \"content\": \"use actix_web::{Scope, http::Method, HttpRequest, FromRequest};\\n\\n\\n\\nuse state::AppState;\\n\\nuse controllers::blog;\\n\\n\\n\",\n \"file_path\": \"src/routes/blog.rs\",\n \"rank\": 82,\n \"score\": 6.162324658306051\n },\n {\n \"content\": \"use super::Content;\\n\\n\\n\\nuse std::rc::Rc;\\n\\nuse std::sync::Arc;\\n\\nuse std::result::Result as StdResult;\\n\\nuse chrono::NaiveDateTime;\\n\\nuse futures::future::{Future, ok as FutOk, err as FutErr};\\n\\nuse actix_web::{HttpRequest, HttpResponse, Responder, AsyncResponder, HttpMessage, error::Error as ActixError};\\n\\nuse actix_web::fs::NamedFile;\\n\\nuse comrak::{markdown_to_html, ComrakOptions};\\n\\nuse tera::Context;\\n\\nuse regex;\\n\\n\\n\\nuse result::Result;\\n\\nuse state::AppState;\\n\\nuse message::{Pagination, PaginatedListMessage};\\n\\nuse models::content::{self, FindFilter};\\n\\nuse template::{get_global_context, TEMPLATES};\\n\\nuse error::{Error, error_handler};\\n\\n\\n\",\n \"file_path\": \"src/controllers/blog/content.rs\",\n \"rank\": 83,\n \"score\": 6.1567853717402965\n },\n {\n \"content\": \"table! {\\n\\n categories (id) {\\n\\n id -> Unsigned<Integer>,\\n\\n name -> Varchar,\\n\\n display_name -> Varchar,\\n\\n keywords -> Varchar,\\n\\n description -> Varchar,\\n\\n sort -> Smallint,\\n\\n created_at -> Timestamp,\\n\\n updated_at -> Nullable<Timestamp>,\\n\\n }\\n\\n}\\n\\n\\n\\ntable! {\\n\\n contents (id) {\\n\\n id -> Unsigned<Integer>,\\n\\n name -> Nullable<Varchar>,\\n\\n title -> Varchar,\\n\\n category_id -> Nullable<Unsigned<Integer>>,\\n\\n as_page -> Bool,\\n\",\n \"file_path\": \"src/schema.rs\",\n \"rank\": 84,\n \"score\": 6.134093926523832\n },\n {\n \"content\": \"use std::rc::Rc;\\n\\nuse actix_web::{HttpRequest, HttpResponse, AsyncResponder, Responder, HttpMessage};\\n\\nuse actix_web::http;\\n\\nuse futures::future::Future;\\n\\nuse rss::{ChannelBuilder, Channel, Item, ItemBuilder};\\n\\nuse url::Url;\\n\\nuse comrak::{markdown_to_html, ComrakOptions};\\n\\n\\n\\nuse state::AppState;\\n\\nuse message::{Pagination, PaginatedListMessage};\\n\\nuse template::get_site_setting;\\n\\nuse error::{Error, error_handler};\\n\\nuse models::content;\\n\\n\\n\",\n \"file_path\": \"src/controllers/blog/rss.rs\",\n \"rank\": 85,\n \"score\": 6.06100588614272\n },\n {\n \"content\": \"use super::PushMessage;\\n\\n\\n\\nuse std::rc::Rc;\\n\\nuse futures::future::{Future, ok as FutOk, err as FutErr};\\n\\nuse actix_web::{HttpRequest, HttpResponse, Responder, AsyncResponder, HttpMessage, error::Error as ActixError};\\n\\nuse tera::Context;\\n\\n\\n\\nuse message::{Pagination, PaginatedListMessage};\\n\\nuse models::push_message;\\n\\nuse state::AppState;\\n\\nuse template::{get_global_context, TEMPLATES};\\n\\nuse error::error_handler;\\n\\n\\n\",\n \"file_path\": \"src/controllers/blog/push_message.rs\",\n \"rank\": 86,\n \"score\": 6.03577134626952\n },\n {\n \"content\": \"use actix_web::{Scope, http::Method, HttpRequest, FromRequest};\\n\\n\\n\\nuse state::AppState;\\n\\nuse controllers::admin;\\n\\nuse middlewares::authenticate::Authenticate as MAuthenticate;\\n\\n\\n\",\n \"file_path\": \"src/routes/admin.rs\",\n \"rank\": 87,\n \"score\": 6.009748435205569\n },\n {\n \"content\": \" keywords -> Varchar,\\n\\n description -> Varchar,\\n\\n sort -> Smallint,\\n\\n created_at -> Timestamp,\\n\\n updated_at -> Nullable<Timestamp>,\\n\\n }\\n\\n}\\n\\n\\n\\ntable! {\\n\\n subject_relates (subject_id, content_id) {\\n\\n subject_id -> Unsigned<Integer>,\\n\\n content_id -> Unsigned<Integer>,\\n\\n sort -> Smallint,\\n\\n created_at -> Timestamp,\\n\\n updated_at -> Nullable<Timestamp>,\\n\\n }\\n\\n}\\n\\n\\n\\nallow_tables_to_appear_in_same_query!(\\n\\n categories,\\n\\n contents,\\n\\n push_messages,\\n\\n recommend_contents,\\n\\n subjects,\\n\\n subject_relates,\\n\\n);\\n\",\n \"file_path\": \"src/schema.rs\",\n \"rank\": 88,\n \"score\": 5.779652299930901\n },\n {\n \"content\": \"use std::rc::Rc;\\n\\nuse actix_web::{HttpRequest, HttpResponse, AsyncResponder, Responder, HttpMessage};\\n\\n\\n\\nuse state::AppState;\\n\\nuse models::content;\\n\\n\\n\\n#[derive(Deserialize, Debug, Clone)]\\n\",\n \"file_path\": \"src/controllers/admin/content.rs\",\n \"rank\": 89,\n \"score\": 5.774222966805732\n },\n {\n \"content\": \" NotZero,\\n\\n Index(FindCategory),\\n\\n}\\n\\n\\n\\n#[derive(Clone, Debug)]\\n\\npub struct GetContents {\\n\\n pub search: Option<String>,\\n\\n pub category: Option<CategoryMatcher>,\\n\\n pub display: Option<bool>,\\n\\n pub content_type: Option<u16>,\\n\\n}\\n\\n\\n\\nimpl Default for GetContents {\\n\\n fn default() -> Self {\\n\\n GetContents {\\n\\n search: None,\\n\\n category: None,\\n\\n display: Some(true),\\n\\n content_type: None,\\n\\n }\\n\",\n \"file_path\": \"src/models/content.rs\",\n \"rank\": 90,\n \"score\": 5.765217495568928\n },\n {\n \"content\": \" pub fn get_recommend_contents(connection: &Conn, count: Option<u32>) -> Result<Vec<RecommendContentDisplay>> {\\n\\n use schema::recommend_contents::dsl::*;\\n\\n\\n\\n recommend_contents\\n\\n .order((created_at.desc(), id.desc()))\\n\\n .limit(count.map(From::from).unwrap_or(3))\\n\\n .load::<RecommendContentDisplay>(connection)\\n\\n .map_err(map_database_error(Some(\\\"recommend_contents\\\")))\\n\\n }\\n\\n}\\n\\n\\n\\n#[derive(Default)]\\n\\npub struct GetRecommendContents(pub Option<u32>);\\n\\n\\n\\nimpl Message for GetRecommendContents {\\n\\n type Result = Result<Vec<RecommendContentDisplay>>;\\n\\n}\\n\\n\\n\\nimpl Handler<GetRecommendContents> for DatabaseExecutor {\\n\\n type Result = <GetRecommendContents as Message>::Result;\\n\\n\\n\\n fn handle(&mut self, msg: GetRecommendContents, _: &mut Self::Context) -> <Self as Handler<GetRecommendContents>>::Result {\\n\\n RecommendContent::get_recommend_contents(&self.connection()?, msg.0)\\n\\n }\\n\\n}\",\n \"file_path\": \"src/models/recommend.rs\",\n \"rank\": 91,\n \"score\": 5.596978372349168\n },\n {\n \"content\": \" pub static_assets_path: Arc<Option<String>>,\\n\\n pub public_path: Arc<Option<String>>,\\n\\n /// 通过该字段对数据库进行访问以及操作\\n\\n pub database: Addr<DatabaseExecutor>,\\n\\n}\\n\\n\\n\\nimpl AppState {\\n\\n pub fn new(config: Config) -> Self {\\n\\n let timezone = config.database_timezone;\\n\\n let manager = ConnectionManager::<MysqlConnection>::new(config.database_url);\\n\\n let pool = Pool::builder().build(manager).expect(\\\"Error: Failed to build pool\\\");\\n\\n\\n\\n let addr = SyncArbiter::start(8, move || {\\n\\n let cloned = pool.clone();\\n\\n let connection = &cloned.get().expect(\\\"Error: Connection initialize error.\\\");\\n\\n let timezone = timezone.clone();\\n\\n\\n\\n if let Some(timezone) = timezone {\\n\\n sql_query(format!(\\\"set time_zone='{}'\\\", timezone))\\n\\n .execute(connection)\\n\",\n \"file_path\": \"src/state.rs\",\n \"rank\": 92,\n \"score\": 5.582452705505543\n },\n {\n \"content\": \"pub struct FindFilter {\\n\\n pub as_page: Option<bool>\\n\\n}\\n\\n\\n\\npub struct FindContent {\\n\\n pub inner: Find,\\n\\n pub filter: Option<FindFilter>\\n\\n}\\n\\n\\n\\nimpl Message for FindContent {\\n\\n type Result = Result<ContentFullDisplay>;\\n\\n}\\n\\n\\n\\nimpl Handler<FindContent> for DatabaseExecutor {\\n\\n type Result = <FindContent as Message>::Result;\\n\\n\\n\\n fn handle(&mut self, msg: FindContent, _: &mut Self::Context) -> Self::Result {\\n\\n match msg.inner {\\n\\n Find::ByName(name) => Content::find_by_name(&self.connection()?, name, msg.filter),\\n\\n Find::ById(id) => Content::find_by_id(&self.connection()?, id, msg.filter)\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\npub struct CreateContent {\\n\\n\\n\\n}\",\n \"file_path\": \"src/models/content.rs\",\n \"rank\": 93,\n \"score\": 5.547491779101183\n },\n {\n \"content\": \" pub id: u32,\\n\\n pub name: String,\\n\\n pub display_name: String,\\n\\n pub description: String,\\n\\n pub created_at: NaiveDateTime,\\n\\n pub updated_at: Option<NaiveDateTime>,\\n\\n}\\n\\n\\n\\n#[derive(Debug, Clone, Serialize, Deserialize, Queryable)]\\n\\npub struct CategoryFullDisplay {\\n\\n pub id: u32,\\n\\n pub name: String,\\n\\n pub display_name: String,\\n\\n pub keywords: String,\\n\\n pub description: String,\\n\\n pub sort: i16,\\n\\n pub created_at: NaiveDateTime,\\n\\n pub updated_at: Option<NaiveDateTime>,\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/models/category.rs\",\n \"rank\": 94,\n \"score\": 5.539897949014887\n },\n {\n \"content\": \" }\\n\\n },\\n\\n Err(_) => SiteSetting::default()\\n\\n }\\n\\n }\\n\\n\\n\\n pub fn get_global_context() -> Context {\\n\\n let mut context = Context::new();\\n\\n let setting: SiteSetting = get_site_setting();\\n\\n\\n\\n context.add(\\\"__site_setting\\\", &setting);\\n\\n context\\n\\n }\\n\\n}\\n\\n\\n\\npub mod state;\\n\\npub mod routes;\\n\\npub mod utils;\\n\\n\\n\\npub mod result {\\n\\n use std::result::Result as StdResult;\\n\\n use error::Error;\\n\\n\\n\\n pub type Result<T> = StdResult<T, Error>;\\n\\n}\",\n \"file_path\": \"src/lib.rs\",\n \"rank\": 95,\n \"score\": 5.374491715604766\n },\n {\n \"content\": \"use super::{PushMessage, Content};\\n\\n\\n\\nuse std::rc::Rc;\\n\\nuse futures::future::{Future, ok as FutOk, err as FutErr};\\n\\nuse actix_web::{HttpRequest, HttpResponse, Responder, AsyncResponder, HttpMessage};\\n\\nuse comrak::{markdown_to_html, ComrakOptions};\\n\\nuse tera::Context;\\n\\n\\n\\nuse state::AppState;\\n\\nuse message::Pagination;\\n\\nuse models::{push_message, content, recommend};\\n\\nuse template::{get_global_context, TEMPLATES};\\n\\nuse error::error_handler;\\n\\n\\n\",\n \"file_path\": \"src/controllers/blog/index.rs\",\n \"rank\": 96,\n \"score\": 5.259538809924145\n },\n {\n \"content\": \" connection.transaction(move || {\\n\\n diesel::delete(subject_relates)\\n\\n .filter(\\n\\n subject_id.eq(target).and(content_id.ne_all(key_index))\\n\\n )\\n\\n .execute(connection)\\n\\n .map_err(map_database_error(Some(\\\"subject_relates\\\")))?;\\n\\n\\n\\n let mut create_relates = Vec::with_capacity(sync.len());\\n\\n for relate in sync {\\n\\n create_relates.push(\\n\\n (subject_id.eq(target), content_id.eq(relate.content_id), sort.eq(relate.sort.unwrap_or(0)))\\n\\n );\\n\\n }\\n\\n\\n\\n if create_relates.len() > 0 {\\n\\n diesel::replace_into(subject_relates)\\n\\n .values(&create_relates)\\n\\n .execute(connection)\\n\\n .map_err(map_database_error(Some(\\\"subject_relates\\\")))?;\\n\",\n \"file_path\": \"src/models/subject.rs\",\n \"rank\": 97,\n \"score\": 5.2332914790169\n },\n {\n \"content\": \" pub name: Option<String>,\\n\\n pub title: String,\\n\\n pub keywords: String,\\n\\n pub description: String,\\n\\n pub sort: i16,\\n\\n pub created_at: NaiveDateTime,\\n\\n pub updated_at: Option<NaiveDateTime>,\\n\\n}\\n\\n\\n\\npub struct SubjectRelate {\\n\\n pub content_id: u32,\\n\\n pub sort: Option<i16>,\\n\\n}\\n\\n\\n\\npub struct CreateSubject {\\n\\n pub subject: NewSubject,\\n\\n pub relates: Option<Vec<SubjectRelate>>,\\n\\n}\\n\\n\\n\\n#[derive(Debug, Clone, Serialize, Deserialize, Queryable)]\\n\",\n \"file_path\": \"src/models/subject.rs\",\n \"rank\": 98,\n \"score\": 4.92040375484316\n }\n]","isConversational":false}}},{"rowIdx":2364,"cells":{"lang":{"kind":"string","value":"Rust"},"file_path":{"kind":"string","value":"src/rocksdb_options.rs"},"repo_name":{"kind":"string","value":"susytech/susy-rocksdb"},"commit":{"kind":"string","value":"2ca57972fb6661863c72c1bf8549d63122305be6"},"file_code":{"kind":"string","value":"\n\nextern crate libc;\nuse self::libc::{c_int, size_t};\nuse std::ffi::CString;\nuse std::mem;\n\nuse rocksdb_ffi;\nuse merge_operator::{self, MergeOperands, MergeOperatorCallback,\n full_merge_callback, partial_merge_callback};\nuse comparator::{self, ComparatorCallback, compare_callback};\n\npub enum IndexType {\n BinarySearch,\n HashSearch,\n}\n\npub struct BlockBasedOptions {\n inner: rocksdb_ffi::DBBlockBasedTableOptions,\n filter: Option<rocksdb_ffi::DBFilterPolicy>,\n}\n\npub struct Options {\n pub inner: rocksdb_ffi::DBOptions,\n}\n\npub struct WriteOptions {\n pub inner: rocksdb_ffi::DBWriteOptions,\n}\n\npub struct Cache {\n pub inner: rocksdb_ffi::DBCache,\n}\n\nimpl Drop for Options {\n fn drop(&mut self) {\n unsafe {\n rocksdb_ffi::rocksdb_options_destroy(self.inner);\n }\n }\n}\n\nimpl Drop for BlockBasedOptions {\n fn drop(&mut self) {\n unsafe {\n rocksdb_ffi::rocksdb_block_based_options_destroy(self.inner);\n }\n }\n}\n\nimpl Drop for WriteOptions {\n fn drop(&mut self) {\n unsafe {\n rocksdb_ffi::rocksdb_writeoptions_destroy(self.inner);\n }\n }\n}\n\nimpl BlockBasedOptions {\n pub fn new() -> BlockBasedOptions {\n let block_opts = unsafe {\n rocksdb_ffi::rocksdb_block_based_options_create()\n };\n if block_opts.is_null() {\n panic!(\"Could not create rocksdb block based options\".to_string());\n }\n BlockBasedOptions { inner: block_opts, filter: None }\n }\n\n pub fn set_block_size(&mut self, size: usize) {\n unsafe {\n rocksdb_ffi::rocksdb_block_based_options_set_block_size(self.inner,\n size);\n }\n }\n\n pub fn set_index_type(&mut self, index_type: IndexType) {\n let it = match index_type {\n IndexType::BinarySearch => rocksdb_ffi::BLOCK_BASED_INDEX_TYPE_BINARY_SEARCH,\n IndexType::HashSearch => rocksdb_ffi::BLOCK_BASED_INDEX_TYPE_HASH_SEARCH,\n };\n unsafe {\n rocksdb_ffi::rocksdb_block_based_options_set_index_type(self.inner, it);\n }\n }\n\n pub fn set_cache(&mut self, cache: Cache) {\n unsafe { rocksdb_ffi::rocksdb_block_based_options_set_block_cache(self.inner, cache.inner); }\n }\n\n pub fn set_filter(&mut self, bits: i32) {\n unsafe {\n let new_filter = rocksdb_ffi::rocksdb_filterpolicy_create_bloom(bits);\n rocksdb_ffi::rocksdb_block_based_options_set_filter_policy(self.inner, new_filter);\n self.filter = Some(new_filter);\n }\n }\n}\n\nunsafe impl Sync for BlockBasedOptions {}\n\nunsafe impl Send for BlockBasedOptions {}\n\nimpl Options {\n pub fn new() -> Options {\n unsafe {\n let opts = rocksdb_ffi::rocksdb_options_create();\n if opts.is_null() {\n panic!(\"Could not create rocksdb options\".to_string());\n }\n Options { inner: opts }\n }\n }\n\n pub fn increase_parallelism(&mut self, parallelism: i32) {\n unsafe {\n rocksdb_ffi::rocksdb_options_increase_parallelism(self.inner,\n parallelism);\n }\n }\n\n pub fn optimize_level_style_compaction(&mut self,\n memtable_memory_budget: i32) {\n unsafe {\n rocksdb_ffi::rocksdb_options_optimize_level_style_compaction(\n self.inner, memtable_memory_budget);\n }\n }\n\n pub fn create_if_missing(&mut self, create_if_missing: bool) {\n unsafe {\n rocksdb_ffi::rocksdb_options_set_create_if_missing(\n self.inner, create_if_missing);\n }\n }\n\n pub fn add_merge_operator<'a>(&mut self,\n name: &str,\n merge_fn: fn(&[u8],\n Option<&[u8]>,\n &mut MergeOperands)\n -> Vec<u8>) {\n let cb = Box::new(MergeOperatorCallback {\n name: CString::new(name.as_bytes()).unwrap(),\n merge_fn: merge_fn,\n });\n\n unsafe {\n let mo = rocksdb_ffi::rocksdb_mergeoperator_create(\n mem::transmute(cb),\n merge_operator::destructor_callback,\n full_merge_callback,\n partial_merge_callback,\n None,\n merge_operator::name_callback);\n rocksdb_ffi::rocksdb_options_set_merge_operator(self.inner, mo);\n }\n }\n\n pub fn add_comparator<'a>(&mut self,\n name: &str,\n compare_fn: fn(&[u8], &[u8]) -> i32) {\n let cb = Box::new(ComparatorCallback {\n name: CString::new(name.as_bytes()).unwrap(),\n f: compare_fn,\n });\n\n unsafe {\n let cmp = rocksdb_ffi::rocksdb_comparator_create(\n mem::transmute(cb),\n comparator::destructor_callback,\n compare_callback,\n comparator::name_callback);\n rocksdb_ffi::rocksdb_options_set_comparator(self.inner, cmp);\n }\n }\n\n pub fn set_prefix_extractor_fixed_size<'a>(&mut self, size: usize) {\n unsafe {\n let st = rocksdb_ffi::rocksdb_slicetransform_create_fixed_prefix(size);\n rocksdb_ffi::rocksdb_options_set_prefix_extractor(self.inner, st);\n }\n }\n\n pub fn set_block_cache_size_mb(&mut self, cache_size: u64) {\n unsafe {\n rocksdb_ffi::rocksdb_options_optimize_for_point_lookup(self.inner,\n cache_size);\n }\n }\n\n pub fn set_max_open_files(&mut self, nfiles: c_int) {\n unsafe {\n rocksdb_ffi::rocksdb_options_set_max_open_files(self.inner, nfiles);\n }\n }\n\n pub fn set_use_fsync(&mut self, useit: bool) {\n unsafe {\n match useit {\n true => {\n rocksdb_ffi::rocksdb_options_set_use_fsync(self.inner, 1)\n }\n false => {\n rocksdb_ffi::rocksdb_options_set_use_fsync(self.inner, 0)\n }\n }\n }\n }\n\n pub fn set_bytes_per_sync(&mut self, nbytes: u64) {\n unsafe {\n rocksdb_ffi::rocksdb_options_set_bytes_per_sync(self.inner, nbytes);\n }\n }\n\n pub fn set_table_cache_num_shard_bits(&mut self, nbits: c_int) {\n unsafe {\n rocksdb_ffi::rocksdb_options_set_table_cache_numshardbits(self.inner,\n nbits);\n }\n }\n\n pub fn set_min_write_buffer_number(&mut self, nbuf: c_int) {\n unsafe {\n rocksdb_ffi::rocksdb_options_set_min_write_buffer_number_to_merge(\n self.inner, nbuf);\n }\n }\n\n pub fn set_max_write_buffer_number(&mut self, nbuf: c_int) {\n unsafe {\n rocksdb_ffi::rocksdb_options_set_max_write_buffer_number(self.inner,\n nbuf);\n }\n }\n\n pub fn set_write_buffer_size(&mut self, size: size_t) {\n unsafe {\n rocksdb_ffi::rocksdb_options_set_write_buffer_size(self.inner,\n size);\n }\n }\n\n pub fn set_db_write_buffer_size(&mut self, size: size_t) {\n unsafe {\n rocksdb_ffi::rocksdb_options_set_db_write_buffer_size(self.inner,\n size);\n }\n }\n\n pub fn set_target_file_size_base(&mut self, size: u64) {\n unsafe {\n rocksdb_ffi::rocksdb_options_set_target_file_size_base(self.inner,\n size);\n }\n }\n\n pub fn set_target_file_size_multiplier(&mut self, size: c_int) {\n unsafe {\n rocksdb_ffi::rocksdb_options_set_target_file_size_multiplier(self.inner, size);\n }\n }\n\n pub fn set_min_write_buffer_number_to_merge(&mut self, to_merge: c_int) {\n unsafe {\n rocksdb_ffi::rocksdb_options_set_min_write_buffer_number_to_merge(\n self.inner, to_merge);\n }\n }\n\n pub fn set_level_zero_slowdown_writes_trigger(&mut self, n: c_int) {\n unsafe {\n rocksdb_ffi::rocksdb_options_set_level0_slowdown_writes_trigger(\n self.inner, n);\n }\n }\n\n pub fn set_level_zero_stop_writes_trigger(&mut self, n: c_int) {\n unsafe {\n rocksdb_ffi::rocksdb_options_set_level0_stop_writes_trigger(\n self.inner, n);\n }\n }\n\n pub fn set_compaction_style(&mut self,\n style: rocksdb_ffi::DBCompactionStyle) {\n unsafe {\n rocksdb_ffi::rocksdb_options_set_compaction_style(self.inner,\n style);\n }\n }\n\n pub fn set_max_background_compactions(&mut self, n: c_int) {\n unsafe {\n rocksdb_ffi::rocksdb_options_set_max_background_compactions(\n self.inner, n);\n }\n }\n\n pub fn set_max_background_flushes(&mut self, n: c_int) {\n unsafe {\n rocksdb_ffi::rocksdb_options_set_max_background_flushes(self.inner,\n n);\n }\n }\n\n pub fn set_disable_auto_compactions(&mut self, disable: bool) {\n unsafe {\n match disable {\n true =>\n rocksdb_ffi::rocksdb_options_set_disable_auto_compactions(\n self.inner, 1),\n false =>\n rocksdb_ffi::rocksdb_options_set_disable_auto_compactions(\n self.inner, 0),\n }\n }\n }\n\n pub fn set_block_based_table_factory(&mut self,\n factory: &BlockBasedOptions) {\n unsafe {\n rocksdb_ffi::rocksdb_options_set_block_based_table_factory(self.inner, factory.inner);\n }\n }\n\n pub fn set_parsed_options(&mut self, opts: &str) -> Result<(), String> {\n unsafe {\n let new_inner_options = rocksdb_ffi::rocksdb_options_create();\n if new_inner_options.is_null() {\n panic!(\"Could not create rocksdb options\".to_string());\n }\n\n let mut err: *const i8 = 0 as *const i8;\n let err_ptr: *mut *const i8 = &mut err;\n\n let c_opts = CString::new(opts.as_bytes()).unwrap();\n let c_opts_ptr = c_opts.as_ptr();\n\n rocksdb_ffi::rocksdb_get_options_from_string(self.inner, c_opts_ptr as *const _, new_inner_options, err_ptr);\n if !err.is_null() {\n return Err(rocksdb_ffi::error_message(err))\n }\n rocksdb_ffi::rocksdb_options_destroy(mem::replace(&mut self.inner, new_inner_options));\n Ok(())\n }\n }\n}\n\nimpl WriteOptions {\n pub fn new() -> WriteOptions {\n let write_opts = unsafe { rocksdb_ffi::rocksdb_writeoptions_create() };\n if write_opts.is_null() {\n panic!(\"Could not create rocksdb write options\".to_string());\n }\n WriteOptions { inner: write_opts }\n }\n pub fn set_sync(&mut self, sync: bool) {\n unsafe {\n rocksdb_ffi::rocksdb_writeoptions_set_sync(self.inner, sync);\n }\n }\n\n pub fn disable_wal(&mut self, disable: bool) {\n unsafe {\n if disable {\n rocksdb_ffi::rocksdb_writeoptions_disable_WAL(self.inner, 1);\n } else {\n rocksdb_ffi::rocksdb_writeoptions_disable_WAL(self.inner, 0);\n }\n }\n }\n}\n\nunsafe impl Sync for WriteOptions {}\n\nunsafe impl Send for WriteOptions {}\n\nimpl Cache {\n pub fn new(bytes: usize) -> Cache {\n Cache { inner: unsafe { rocksdb_ffi::rocksdb_cache_create_lru(bytes) } }\n }\n}\n\nimpl Drop for Cache {\n fn drop(&mut self) {\n unsafe { rocksdb_ffi::rocksdb_cache_destroy(self.inner); }\n }\n}\n\nunsafe impl Sync for Cache {}\n\nunsafe impl Send for Cache {}\n"},"prefix":{"kind":"string","value":"\n\nextern crate libc;\nuse self::libc::{c_int, size_t};\nuse std::ffi::CString;\nuse std::mem;\n\nuse rocksdb_ffi;\nuse merge_operator::{self, MergeOperands, MergeOperatorCallback,\n full_merge_callback, partial_merge_callback};\nuse comparator::{self, ComparatorCallback, compare_callback};\n\npub enum IndexType {\n BinarySearch,\n HashSearch,\n}\n\npub struct BlockBasedOptions {\n inner: rocksdb_ffi::DBBlockBasedTableOptions,\n filter: Option<rocksdb_ffi::DBFilterPolicy>,\n}\n\npub struct Options {\n pub inner: rocksdb_ffi::DBOptions,\n}\n\npub struct WriteOptions {\n pub inner: rocksdb_ffi::DBWriteOptions,\n}\n\npub struct Cache {\n pub inner: rocksdb_ffi::DBCache,\n}\n\nimpl Drop for Options {\n fn drop(&mut self) {\n unsafe {\n rocksdb_ffi::rocksdb_options_destroy(self.inner);\n }\n }\n}\n\nimpl Drop for BlockBasedOptions {\n fn drop(&mut self) {\n unsafe {\n rocksdb_ffi::rocksdb_block_based_options_destroy(self.inner);\n }\n }\n}\n\nimpl Drop for WriteOptions {\n fn drop(&mut self) {\n unsafe {\n rocksdb_ffi::rocksdb_writeoptions_destroy(self.inner);\n }\n }\n}\n\nimpl BlockBasedOptions {\n "},"suffix":{"kind":"string","value":"\n\n pub fn set_block_size(&mut self, size: usize) {\n unsafe {\n rocksdb_ffi::rocksdb_block_based_options_set_block_size(self.inner,\n size);\n }\n }\n\n pub fn set_index_type(&mut self, index_type: IndexType) {\n let it = match index_type {\n IndexType::BinarySearch => rocksdb_ffi::BLOCK_BASED_INDEX_TYPE_BINARY_SEARCH,\n IndexType::HashSearch => rocksdb_ffi::BLOCK_BASED_INDEX_TYPE_HASH_SEARCH,\n };\n unsafe {\n rocksdb_ffi::rocksdb_block_based_options_set_index_type(self.inner, it);\n }\n }\n\n pub fn set_cache(&mut self, cache: Cache) {\n unsafe { rocksdb_ffi::rocksdb_block_based_options_set_block_cache(self.inner, cache.inner); }\n }\n\n pub fn set_filter(&mut self, bits: i32) {\n unsafe {\n let new_filter = rocksdb_ffi::rocksdb_filterpolicy_create_bloom(bits);\n rocksdb_ffi::rocksdb_block_based_options_set_filter_policy(self.inner, new_filter);\n self.filter = Some(new_filter);\n }\n }\n}\n\nunsafe impl Sync for BlockBasedOptions {}\n\nunsafe impl Send for BlockBasedOptions {}\n\nimpl Options {\n pub fn new() -> Options {\n unsafe {\n let opts = rocksdb_ffi::rocksdb_options_create();\n if opts.is_null() {\n panic!(\"Could not create rocksdb options\".to_string());\n }\n Options { inner: opts }\n }\n }\n\n pub fn increase_parallelism(&mut self, parallelism: i32) {\n unsafe {\n rocksdb_ffi::rocksdb_options_increase_parallelism(self.inner,\n parallelism);\n }\n }\n\n pub fn optimize_level_style_compaction(&mut self,\n memtable_memory_budget: i32) {\n unsafe {\n rocksdb_ffi::rocksdb_options_optimize_level_style_compaction(\n self.inner, memtable_memory_budget);\n }\n }\n\n pub fn create_if_missing(&mut self, create_if_missing: bool) {\n unsafe {\n rocksdb_ffi::rocksdb_options_set_create_if_missing(\n self.inner, create_if_missing);\n }\n }\n\n pub fn add_merge_operator<'a>(&mut self,\n name: &str,\n merge_fn: fn(&[u8],\n Option<&[u8]>,\n &mut MergeOperands)\n -> Vec<u8>) {\n let cb = Box::new(MergeOperatorCallback {\n name: CString::new(name.as_bytes()).unwrap(),\n merge_fn: merge_fn,\n });\n\n unsafe {\n let mo = rocksdb_ffi::rocksdb_mergeoperator_create(\n mem::transmute(cb),\n merge_operator::destructor_callback,\n full_merge_callback,\n partial_merge_callback,\n None,\n merge_operator::name_callback);\n rocksdb_ffi::rocksdb_options_set_merge_operator(self.inner, mo);\n }\n }\n\n pub fn add_comparator<'a>(&mut self,\n name: &str,\n compare_fn: fn(&[u8], &[u8]) -> i32) {\n let cb = Box::new(ComparatorCallback {\n name: CString::new(name.as_bytes()).unwrap(),\n f: compare_fn,\n });\n\n unsafe {\n let cmp = rocksdb_ffi::rocksdb_comparator_create(\n mem::transmute(cb),\n comparator::destructor_callback,\n compare_callback,\n comparator::name_callback);\n rocksdb_ffi::rocksdb_options_set_comparator(self.inner, cmp);\n }\n }\n\n pub fn set_prefix_extractor_fixed_size<'a>(&mut self, size: usize) {\n unsafe {\n let st = rocksdb_ffi::rocksdb_slicetransform_create_fixed_prefix(size);\n rocksdb_ffi::rocksdb_options_set_prefix_extractor(self.inner, st);\n }\n }\n\n pub fn set_block_cache_size_mb(&mut self, cache_size: u64) {\n unsafe {\n rocksdb_ffi::rocksdb_options_optimize_for_point_lookup(self.inner,\n cache_size);\n }\n }\n\n pub fn set_max_open_files(&mut self, nfiles: c_int) {\n unsafe {\n rocksdb_ffi::rocksdb_options_set_max_open_files(self.inner, nfiles);\n }\n }\n\n pub fn set_use_fsync(&mut self, useit: bool) {\n unsafe {\n match useit {\n true => {\n rocksdb_ffi::rocksdb_options_set_use_fsync(self.inner, 1)\n }\n false => {\n rocksdb_ffi::rocksdb_options_set_use_fsync(self.inner, 0)\n }\n }\n }\n }\n\n pub fn set_bytes_per_sync(&mut self, nbytes: u64) {\n unsafe {\n rocksdb_ffi::rocksdb_options_set_bytes_per_sync(self.inner, nbytes);\n }\n }\n\n pub fn set_table_cache_num_shard_bits(&mut self, nbits: c_int) {\n unsafe {\n rocksdb_ffi::rocksdb_options_set_table_cache_numshardbits(self.inner,\n nbits);\n }\n }\n\n pub fn set_min_write_buffer_number(&mut self, nbuf: c_int) {\n unsafe {\n rocksdb_ffi::rocksdb_options_set_min_write_buffer_number_to_merge(\n self.inner, nbuf);\n }\n }\n\n pub fn set_max_write_buffer_number(&mut self, nbuf: c_int) {\n unsafe {\n rocksdb_ffi::rocksdb_options_set_max_write_buffer_number(self.inner,\n nbuf);\n }\n }\n\n pub fn set_write_buffer_size(&mut self, size: size_t) {\n unsafe {\n rocksdb_ffi::rocksdb_options_set_write_buffer_size(self.inner,\n size);\n }\n }\n\n pub fn set_db_write_buffer_size(&mut self, size: size_t) {\n unsafe {\n rocksdb_ffi::rocksdb_options_set_db_write_buffer_size(self.inner,\n size);\n }\n }\n\n pub fn set_target_file_size_base(&mut self, size: u64) {\n unsafe {\n rocksdb_ffi::rocksdb_options_set_target_file_size_base(self.inner,\n size);\n }\n }\n\n pub fn set_target_file_size_multiplier(&mut self, size: c_int) {\n unsafe {\n rocksdb_ffi::rocksdb_options_set_target_file_size_multiplier(self.inner, size);\n }\n }\n\n pub fn set_min_write_buffer_number_to_merge(&mut self, to_merge: c_int) {\n unsafe {\n rocksdb_ffi::rocksdb_options_set_min_write_buffer_number_to_merge(\n self.inner, to_merge);\n }\n }\n\n pub fn set_level_zero_slowdown_writes_trigger(&mut self, n: c_int) {\n unsafe {\n rocksdb_ffi::rocksdb_options_set_level0_slowdown_writes_trigger(\n self.inner, n);\n }\n }\n\n pub fn set_level_zero_stop_writes_trigger(&mut self, n: c_int) {\n unsafe {\n rocksdb_ffi::rocksdb_options_set_level0_stop_writes_trigger(\n self.inner, n);\n }\n }\n\n pub fn set_compaction_style(&mut self,\n style: rocksdb_ffi::DBCompactionStyle) {\n unsafe {\n rocksdb_ffi::rocksdb_options_set_compaction_style(self.inner,\n style);\n }\n }\n\n pub fn set_max_background_compactions(&mut self, n: c_int) {\n unsafe {\n rocksdb_ffi::rocksdb_options_set_max_background_compactions(\n self.inner, n);\n }\n }\n\n pub fn set_max_background_flushes(&mut self, n: c_int) {\n unsafe {\n rocksdb_ffi::rocksdb_options_set_max_background_flushes(self.inner,\n n);\n }\n }\n\n pub fn set_disable_auto_compactions(&mut self, disable: bool) {\n unsafe {\n match disable {\n true =>\n rocksdb_ffi::rocksdb_options_set_disable_auto_compactions(\n self.inner, 1),\n false =>\n rocksdb_ffi::rocksdb_options_set_disable_auto_compactions(\n self.inner, 0),\n }\n }\n }\n\n pub fn set_block_based_table_factory(&mut self,\n factory: &BlockBasedOptions) {\n unsafe {\n rocksdb_ffi::rocksdb_options_set_block_based_table_factory(self.inner, factory.inner);\n }\n }\n\n pub fn set_parsed_options(&mut self, opts: &str) -> Result<(), String> {\n unsafe {\n let new_inner_options = rocksdb_ffi::rocksdb_options_create();\n if new_inner_options.is_null() {\n panic!(\"Could not create rocksdb options\".to_string());\n }\n\n let mut err: *const i8 = 0 as *const i8;\n let err_ptr: *mut *const i8 = &mut err;\n\n let c_opts = CString::new(opts.as_bytes()).unwrap();\n let c_opts_ptr = c_opts.as_ptr();\n\n rocksdb_ffi::rocksdb_get_options_from_string(self.inner, c_opts_ptr as *const _, new_inner_options, err_ptr);\n if !err.is_null() {\n return Err(rocksdb_ffi::error_message(err))\n }\n rocksdb_ffi::rocksdb_options_destroy(mem::replace(&mut self.inner, new_inner_options));\n Ok(())\n }\n }\n}\n\nimpl WriteOptions {\n pub fn new() -> WriteOptions {\n let write_opts = unsafe { rocksdb_ffi::rocksdb_writeoptions_create() };\n if write_opts.is_null() {\n panic!(\"Could not create rocksdb write options\".to_string());\n }\n WriteOptions { inner: write_opts }\n }\n pub fn set_sync(&mut self, sync: bool) {\n unsafe {\n rocksdb_ffi::rocksdb_writeoptions_set_sync(self.inner, sync);\n }\n }\n\n pub fn disable_wal(&mut self, disable: bool) {\n unsafe {\n if disable {\n rocksdb_ffi::rocksdb_writeoptions_disable_WAL(self.inner, 1);\n } else {\n rocksdb_ffi::rocksdb_writeoptions_disable_WAL(self.inner, 0);\n }\n }\n }\n}\n\nunsafe impl Sync for WriteOptions {}\n\nunsafe impl Send for WriteOptions {}\n\nimpl Cache {\n pub fn new(bytes: usize) -> Cache {\n Cache { inner: unsafe { rocksdb_ffi::rocksdb_cache_create_lru(bytes) } }\n }\n}\n\nimpl Drop for Cache {\n fn drop(&mut self) {\n unsafe { rocksdb_ffi::rocksdb_cache_destroy(self.inner); }\n }\n}\n\nunsafe impl Sync for Cache {}\n\nunsafe impl Send for Cache {}\n"},"middle":{"kind":"string","value":"pub fn new() -> BlockBasedOptions {\n let block_opts = unsafe {\n rocksdb_ffi::rocksdb_block_based_options_create()\n };\n if block_opts.is_null() {\n panic!(\"Could not create rocksdb block based options\".to_string());\n }\n BlockBasedOptions { inner: block_opts, filter: None }\n }"},"strategy":{"kind":"string","value":"function_block-full_function"},"context_items":{"kind":"list like","value":[{"content":"pub fn new_cache(capacity: size_t) -> DBCache {\n\n unsafe { rocksdb_cache_create_lru(capacity) }\n\n}\n\n\n\n#[repr(C)]\n\npub enum DBCompressionType {\n\n DBNoCompression = 0,\n\n DBSnappyCompression = 1,\n\n DBZlibCompression = 2,\n\n DBBz2Compression = 3,\n\n DBLz4Compression = 4,\n\n DBLz4hcCompression = 5,\n\n}\n\n\n\n#[repr(C)]\n\npub enum DBCompactionStyle {\n\n DBLevelCompaction = 0,\n\n DBUniversalCompaction = 1,\n\n DBFifoCompaction = 2,\n\n}\n\n\n\n#[repr(C)]\n\npub enum DBUniversalCompactionStyle {\n\n rocksdb_similar_size_compaction_stop_style = 0,\n\n rocksdb_total_size_compaction_stop_style = 1,\n\n}\n\n\n","file_path":"susy-rocksdb-sys/src/ffi.rs","rank":0,"score":266092.27223118604},{"content":"struct LRUCacheOptions {\n\n // Capacity of the cache.\n\n size_t capacity = 0;\n\n\n\n // Cache is sharded into 2^num_shard_bits shards,\n\n // by hash of key. Refer to NewLRUCache for further\n\n // information.\n\n int num_shard_bits = -1;\n\n\n\n // If strict_capacity_limit is set,\n\n // insert to the cache will fail when cache is full.\n\n bool strict_capacity_limit = false;\n\n\n\n // Percentage of cache reserved for high priority entries.\n\n double high_pri_pool_ratio = 0.0;\n\n\n\n LRUCacheOptions() {}\n\n LRUCacheOptions(size_t _capacity, int _num_shard_bits,\n\n bool _strict_capacity_limit, double _high_pri_pool_ratio)\n\n : capacity(_capacity),\n","file_path":"susy-rocksdb-sys/rocksdb/include/rocksdb/cache.h","rank":1,"score":240588.95682970548},{"content":"// IngestExternalFileOptions is used by IngestExternalFile()\n\nstruct IngestExternalFileOptions {\n\n // Can be set to true to move the files instead of copying them.\n\n bool move_files = false;\n\n // If set to false, an ingested file keys could appear in existing snapshots\n\n // that where created before the file was ingested.\n\n bool snapshot_consistency = true;\n\n // If set to false, IngestExternalFile() will fail if the file key range\n\n // overlaps with existing keys or tombstones in the DB.\n\n bool allow_global_seqno = true;\n\n // If set to false and the file key range overlaps with the memtable key range\n\n // (memtable flush required), IngestExternalFile will fail.\n\n bool allow_blocking_flush = true;\n\n // Set to true if you would like duplicate keys in the file being ingested\n\n // to be skipped rather than overwriting existing data under that key.\n\n // Usecase: back-fill of some historical data in the database without\n\n // over-writing existing newer version of data.\n\n // This option could only be used if the DB has been running\n\n // with allow_ingest_behind=true since the dawn of time.\n\n // All files will be ingested at the bottommost level with seqno=0.\n\n bool ingest_behind = false;\n\n};\n\n\n\n} // namespace rocksdb\n\n\n\n#endif // STORAGE_ROCKSDB_INCLUDE_OPTIONS_H_\n","file_path":"susy-rocksdb-sys/rocksdb/include/rocksdb/options.h","rank":2,"score":237424.15602121002},{"content":"pub fn new_bloom_filter(bits: c_int) -> DBFilterPolicy {\n\n unsafe { rocksdb_filterpolicy_create_bloom(bits) }\n\n}\n\n\n","file_path":"susy-rocksdb-sys/src/ffi.rs","rank":3,"score":234741.7334280406},{"content":"struct ExternalSstFileInfo;\n","file_path":"susy-rocksdb-sys/rocksdb/db/db_impl.h","rank":4,"score":223263.91375849393},{"content":"struct RocksLuaCompactionFilterOptions {\n\n // The lua script in string that implements all necessary CompactionFilter\n\n // virtual functions. The specified lua_script must implement the following\n\n // functions, which are Name and Filter, as described below.\n\n //\n\n // 0. The Name function simply returns a string representing the name of\n\n // the lua script. If there's any erorr in the Name function, an\n\n // empty string will be used.\n\n // --- Example\n\n // function Name()\n\n // return \"DefaultLuaCompactionFilter\"\n\n // end\n\n //\n\n //\n\n // 1. The script must contains a function called Filter, which implements\n\n // CompactionFilter::Filter() , takes three input arguments, and returns\n\n // three values as the following API:\n\n //\n\n // function Filter(level, key, existing_value)\n\n // ...\n","file_path":"susy-rocksdb-sys/rocksdb/include/rocksdb/utilities/lua/rocks_lua_compaction_filter.h","rank":5,"score":220759.55330205295},{"content":" enum class WalProcessingOption {\n\n // Continue processing as usual\n\n kContinueProcessing = 0,\n\n // Ignore the current record but continue processing of log(s)\n\n kIgnoreCurrentRecord = 1,\n\n // Stop replay of logs and discard logs\n\n // Logs won't be replayed on subsequent recovery\n\n kStopReplay = 2,\n\n // Corrupted record detected by filter\n\n kCorruptedRecord = 3,\n\n // Marker for enum count\n\n kWalProcessingOptionMax = 4\n\n };\n\n\n\n virtual ~WalFilter() {}\n\n\n\n // Provide ColumnFamily->LogNumber map to filter\n\n // so that filter can determine whether a log number applies to a given \n\n // column family (i.e. that log hasn't been flushed to SST already for the\n\n // column family).\n","file_path":"susy-rocksdb-sys/rocksdb/include/rocksdb/wal_filter.h","rank":6,"score":212987.4931344085},{"content":"struct rocksdb_writeoptions_t { WriteOptions rep; };\n","file_path":"susy-rocksdb-sys/rocksdb/db/c.cc","rank":7,"score":211020.67042703804},{"content":"struct ThreadPoolImpl::Impl {\n\n\n\n Impl();\n\n ~Impl();\n\n\n\n void JoinThreads(bool wait_for_jobs_to_complete);\n\n\n\n void SetBackgroundThreadsInternal(int num, bool allow_reduce);\n\n int GetBackgroundThreads();\n\n\n\n unsigned int GetQueueLen() const {\n\n return queue_len_.load(std::memory_order_relaxed);\n\n }\n\n\n\n void LowerIOPriority();\n\n\n\n void LowerCPUPriority();\n\n\n\n void WakeUpAllThreads() {\n\n bgsignal_.notify_all();\n","file_path":"susy-rocksdb-sys/rocksdb/util/threadpool_imp.cc","rank":8,"score":207365.18188090815},{"content":"struct rocksdb_ingestexternalfileoptions_t { IngestExternalFileOptions rep; };\n","file_path":"susy-rocksdb-sys/rocksdb/db/c.cc","rank":9,"score":204562.45756093747},{"content":"// Cache entry meta data.\n\nstruct CacheHandle {\n\n Slice key;\n\n uint32_t hash;\n\n void* value;\n\n size_t charge;\n\n void (*deleter)(const Slice&, void* value);\n\n\n\n // Flags and counters associated with the cache handle:\n\n // lowest bit: n-cache bit\n\n // second lowest bit: usage bit\n\n // the rest bits: reference count\n\n // The handle is unused when flags equals to 0. The thread decreases the count\n\n // to 0 is responsible to put the handle back to recycle_ and cleanup memory.\n\n std::atomic<uint32_t> flags;\n\n\n\n CacheHandle() = default;\n\n\n\n CacheHandle(const CacheHandle& a) { *this = a; }\n\n\n\n CacheHandle(const Slice& k, void* v,\n","file_path":"susy-rocksdb-sys/rocksdb/cache/clock_cache.cc","rank":10,"score":187179.98409964904},{"content":"// Key of hash map. We store hash value with the key for convenience.\n\nstruct CacheKey {\n\n Slice key;\n\n uint32_t hash_value;\n\n\n\n CacheKey() = default;\n\n\n\n CacheKey(const Slice& k, uint32_t h) {\n\n key = k;\n\n hash_value = h;\n\n }\n\n\n\n static bool equal(const CacheKey& a, const CacheKey& b) {\n\n return a.hash_value == b.hash_value && a.key == b.key;\n\n }\n\n\n\n static size_t hash(const CacheKey& a) {\n\n return static_cast<size_t>(a.hash_value);\n\n }\n\n};\n\n\n","file_path":"susy-rocksdb-sys/rocksdb/cache/clock_cache.cc","rank":11,"score":187172.79289240445},{"content":"struct Options;\n","file_path":"susy-rocksdb-sys/rocksdb/include/rocksdb/options.h","rank":12,"score":183718.45887691664},{"content":"struct LRUHandle {\n\n void* value;\n\n void (*deleter)(const Slice&, void* value);\n\n LRUHandle* next_hash;\n\n LRUHandle* next;\n\n LRUHandle* prev;\n\n size_t charge; // TODO(opt): Only allow uint32_t?\n\n size_t key_length;\n\n uint32_t refs; // a number of refs to this entry\n\n // cache itself is counted as 1\n\n\n\n // Include the following flags:\n\n // in_cache: whether this entry is referenced by the hash table.\n\n // is_high_pri: whether this entry is high priority entry.\n\n // in_high_pri_pool: whether this entry is in high-pri pool.\n\n char flags;\n\n\n\n uint32_t hash; // Hash of key(); used for fast sharding and comparisons\n\n\n\n char key_data[1]; // Beginning of key\n","file_path":"susy-rocksdb-sys/rocksdb/cache/lru_cache.h","rank":13,"score":182581.37388073117},{"content":"#[test]\n\nfn external() {\n\n let path = \"_rust_rocksdb_externaltest\";\n\n {\n\n let db = DB::open_default(path).unwrap();\n\n let p = db.put(b\"k1\", b\"v1111\");\n\n assert!(p.is_ok());\n\n let r: Result<Option<DBVector>, String> = db.get(b\"k1\");\n\n assert!(r.unwrap().unwrap().to_utf8().unwrap() == \"v1111\");\n\n assert!(db.delete(b\"k1\").is_ok());\n\n assert!(db.get(b\"k1\").unwrap().is_none());\n\n }\n\n let opts = Options::new();\n\n let result = DB::destroy(&opts, path);\n\n assert!(result.is_ok());\n\n}\n\n\n","file_path":"src/rocksdb.rs","rank":14,"score":182036.24582243018},{"content":"// Persistent Cache Config\n\n//\n\n// This struct captures all the options that are used to configure persistent\n\n// cache. Some of the terminologies used in naming the options are\n\n//\n\n// dispatch size :\n\n// This is the size in which IO is dispatched to the device\n\n//\n\n// write buffer size :\n\n// This is the size of an individual write buffer size. Write buffers are\n\n// grouped to form buffered file.\n\n//\n\n// cache size :\n\n// This is the logical maximum for the cache size\n\n//\n\n// qdepth :\n\n// This is the max number of IOs that can issues to the device in parallel\n\n//\n\n// pepeling :\n\n// The writer code path follows pipelined architecture, which means the\n\n// operations are handed off from one stage to another\n\n//\n\n// pipelining backlog size :\n\n// With the pipelined architecture, there can always be backlogging of ops in\n\n// pipeline queues. This is the maximum backlog size after which ops are dropped\n\n// from queue\n\nstruct PersistentCacheConfig {\n\n explicit PersistentCacheConfig(\n\n Env* const _env, const std::string& _path, const uint64_t _cache_size,\n\n const std::shared_ptr<Logger>& _log,\n\n const uint32_t _write_buffer_size = 1 * 1024 * 1024 /*1MB*/) {\n\n env = _env;\n\n path = _path;\n\n log = _log;\n\n cache_size = _cache_size;\n\n writer_dispatch_size = write_buffer_size = _write_buffer_size;\n\n }\n\n\n\n //\n\n // Validate the settings. Our intentions are to catch erroneous settings ahead\n\n // of time instead going violating invariants or causing dead locks.\n\n //\n\n Status ValidateSettings() const {\n\n // (1) check pre-conditions for variables\n\n if (!env || path.empty()) {\n\n return Status::InvalidArgument(\"empty or null args\");\n","file_path":"susy-rocksdb-sys/rocksdb/utilities/persistent_cache/persistent_cache_tier.h","rank":15,"score":181874.68833106817},{"content":"// CompactionOptions are used in CompactFiles() call.\n\nstruct CompactionOptions {\n\n // Compaction output compression type\n\n // Default: snappy\n\n CompressionType compression;\n\n // Compaction will create files of size `output_file_size_limit`.\n\n // Default: MAX, which means that compaction will create a single file\n\n uint64_t output_file_size_limit;\n\n // If > 0, it will replace the option in the DBOptions for this compaction.\n\n uint32_t max_subcompactions;\n\n\n\n CompactionOptions()\n\n : compression(kSnappyCompression),\n\n output_file_size_limit(std::numeric_limits<uint64_t>::max()),\n\n max_subcompactions(0) {}\n\n};\n\n\n","file_path":"susy-rocksdb-sys/rocksdb/include/rocksdb/options.h","rank":16,"score":181600.95161362842},{"content":"// Options that control read operations\n\nstruct ReadOptions {\n\n // If \"snapshot\" is non-nullptr, read as of the supplied snapshot\n\n // (which must belong to the DB that is being read and which must\n\n // not have been released). If \"snapshot\" is nullptr, use an implicit\n\n // snapshot of the state at the beginning of this read operation.\n\n // Default: nullptr\n\n const Snapshot* snapshot;\n\n\n\n // `iterate_lower_bound` defines the smallest key at which the backward\n\n // iterator can return an entry. Once the bound is passed, Valid() will be\n\n // false. `iterate_lower_bound` is inclusive ie the bound value is a valid\n\n // entry.\n\n //\n\n // If prefix_extractor is not null, the Seek target and `iterate_lower_bound`\n\n // need to have the same prefix. This is because ordering is not guaranteed\n\n // outside of prefix domain.\n\n //\n\n // Default: nullptr\n\n const Slice* iterate_lower_bound;\n\n\n","file_path":"susy-rocksdb-sys/rocksdb/include/rocksdb/options.h","rank":17,"score":181594.05269545078},{"content":"// Options that control flush operations\n\nstruct FlushOptions {\n\n // If true, the flush will wait until the flush is done.\n\n // Default: true\n\n bool wait;\n\n\n\n FlushOptions() : wait(true) {}\n\n};\n\n\n\n// Create a Logger from provided DBOptions\n\nextern Status CreateLoggerFromOptions(const std::string& dbname,\n\n const DBOptions& options,\n\n std::shared_ptr<Logger>* logger);\n\n\n","file_path":"susy-rocksdb-sys/rocksdb/include/rocksdb/options.h","rank":18,"score":181594.05269545078},{"content":"// Options that control write operations\n\nstruct WriteOptions {\n\n // If true, the write will be flushed from the operating system\n\n // buffer cache (by calling WritableFile::Sync()) before the write\n\n // is considered complete. If this flag is true, writes will be\n\n // slower.\n\n //\n\n // If this flag is false, and the machine crashes, some recent\n\n // writes may be lost. Note that if it is just the process that\n\n // crashes (i.e., the machine does not reboot), no writes will be\n\n // lost even if sync==false.\n\n //\n\n // In other words, a DB write with sync==false has similar\n\n // crash semantics as the \"write()\" system call. A DB write\n\n // with sync==true has similar crash semantics to a \"write()\"\n\n // system call followed by \"fdatasync()\".\n\n //\n\n // Default: false\n\n bool sync;\n\n\n\n // If true, writes will not first go to the write ahead log,\n","file_path":"susy-rocksdb-sys/rocksdb/include/rocksdb/options.h","rank":19,"score":181594.05269545078},{"content":"struct Options;\n\n\n","file_path":"susy-rocksdb-sys/rocksdb/include/rocksdb/advanced_options.h","rank":20,"score":181587.15677161235},{"content":"struct DBOptions {\n\n // The function recovers options to the option as in version 4.6.\n\n DBOptions* OldDefaults(int rocksdb_major_version = 4,\n\n int rocksdb_minor_version = 6);\n\n\n\n // Some functions that make it easier to optimize RocksDB\n\n\n\n // Use this if your DB is very small (like under 1GB) and you don't want to\n\n // spend lots of memory for memtables.\n\n DBOptions* OptimizeForSmallDb();\n\n\n\n#ifndef ROCKSDB_LITE\n\n // By default, RocksDB uses only one background thread for flush and\n\n // compaction. Calling this function will set it up such that total of\n\n // `total_threads` is used. Good value for `total_threads` is the number of\n\n // cores. You almost definitely want to call this function if your system is\n\n // bottlenecked by RocksDB.\n\n DBOptions* IncreaseParallelism(int total_threads = 16);\n\n#endif // ROCKSDB_LITE\n\n\n","file_path":"susy-rocksdb-sys/rocksdb/include/rocksdb/options.h","rank":21,"score":181587.15677161235},{"content":"#[test]\n\nfn options() {\n\n let mut opts = Options::new();\n\n assert!(opts.set_parsed_options(\"rate_limiter_bytes_per_sec=1024\").is_ok());\n\n}\n","file_path":"src/rocksdb.rs","rank":22,"score":180988.7460630066},{"content":"struct CleanupContext {\n\n // List of values to be deleted, along with the key and deleter.\n\n autovector<CacheHandle> to_delete_value;\n\n\n\n // List of keys to be deleted.\n\n autovector<const char*> to_delete_key;\n\n};\n\n\n","file_path":"susy-rocksdb-sys/rocksdb/cache/clock_cache.cc","rank":23,"score":180506.00766139073},{"content":"// Per-thread state for concurrent executions of the same benchmark.\n\nstruct ThreadState {\n\n uint32_t tid;\n\n Random rnd;\n\n SharedState* shared;\n\n\n\n ThreadState(uint32_t index, SharedState* _shared)\n\n : tid(index), rnd(1000 + index), shared(_shared) {}\n\n};\n\n} // namespace\n\n\n","file_path":"susy-rocksdb-sys/rocksdb/cache/cache_bench.cc","rank":24,"score":180506.00766139073},{"content":"struct CacheRecord {\n\n CacheRecord() {}\n\n CacheRecord(const Slice& key, const Slice& val)\n\n : hdr_(MAGIC, static_cast<uint32_t>(key.size()),\n\n static_cast<uint32_t>(val.size())),\n\n key_(key),\n\n val_(val) {\n\n hdr_.crc_ = ComputeCRC();\n\n }\n\n\n\n uint32_t ComputeCRC() const;\n\n bool Serialize(std::vector<CacheWriteBuffer*>* bufs, size_t* woff);\n\n bool Deserialize(const Slice& buf);\n\n\n\n static uint32_t CalcSize(const Slice& key, const Slice& val) {\n\n return static_cast<uint32_t>(sizeof(CacheRecordHeader) + key.size() +\n\n val.size());\n\n }\n\n\n\n static const uint32_t MAGIC = 0xfefa;\n","file_path":"susy-rocksdb-sys/rocksdb/utilities/persistent_cache/block_cache_tier_file.cc","rank":25,"score":180169.70628233106},{"content":"enum OptionSection : char {\n\n kOptionSectionVersion = 0,\n\n kOptionSectionDBOptions,\n\n kOptionSectionCFOptions,\n\n kOptionSectionTableOptions,\n\n kOptionSectionUnknown\n\n};\n\n\n\nstatic const std::string opt_section_titles[] = {\n\n \"Version\", \"DBOptions\", \"CFOptions\", \"TableOptions/\", \"Unknown\"};\n\n\n\nStatus PersistRocksDBOptions(const DBOptions& db_opt,\n\n const std::vector<std::string>& cf_names,\n\n const std::vector<ColumnFamilyOptions>& cf_opts,\n\n const std::string& file_name, Env* env);\n\n\n\nextern bool AreEqualOptions(\n\n const char* opt1, const char* opt2, const OptionTypeInfo& type_info,\n\n const std::string& opt_name,\n\n const std::unordered_map<std::string, std::string>* opt_map);\n\n\n","file_path":"susy-rocksdb-sys/rocksdb/options/options_parser.h","rank":26,"score":179861.8227482228},{"content":"// CompactRangeOptions is used by CompactRange() call.\n\nstruct CompactRangeOptions {\n\n // If true, no other compaction will run at the same time as this\n\n // manual compaction\n\n bool exclusive_manual_compaction = true;\n\n // If true, compacted files will be moved to the minimum level capable\n\n // of holding the data or given level (specified non-negative target_level).\n\n bool change_level = false;\n\n // If change_level is true and target_level have non-negative value, compacted\n\n // files will be moved to target_level.\n\n int target_level = -1;\n\n // Compaction outputs will be placed in options.db_paths[target_path_id].\n\n // Behavior is undefined if target_path_id is out of range.\n\n uint32_t target_path_id = 0;\n\n // By default level based compaction will only compact the bottommost level\n\n // if there is a compaction filter\n\n BottommostLevelCompaction bottommost_level_compaction =\n\n BottommostLevelCompaction::kIfHaveCompactionFilter;\n\n // If true, will execute immediately even if doing so would cause the DB to\n\n // enter write stall mode. Otherwise, it'll sleep until load is low enough.\n\n bool allow_write_stall = false;\n\n // If > 0, it will replace the option in the DBOptions for this compaction.\n\n uint32_t max_subcompactions = 0;\n\n};\n\n\n","file_path":"susy-rocksdb-sys/rocksdb/include/rocksdb/options.h","rank":27,"score":179537.1725435744},{"content":"// Compression options for different compression algorithms like Zlib\n\nstruct CompressionOptions {\n\n int window_bits;\n\n int level;\n\n int strategy;\n\n\n\n // Maximum size of dictionaries used to prime the compression library.\n\n // Enabling dictionary can improve compression ratios when there are\n\n // repetitions across data blocks.\n\n //\n\n // The dictionary is created by sampling the SST file data. If\n\n // `zstd_max_train_bytes` is nonzero, the samples are passed through zstd's\n\n // dictionary generator. Otherwise, the random samples are used directly as\n\n // the dictionary.\n\n //\n\n // When compression dictionary is disabled, we compress and write each block\n\n // before buffering data for the next one. When compression dictionary is\n\n // enabled, we buffer all SST file data in-memory so we can sample it, as data\n\n // can only be compressed and written after the dictionary has been finalized.\n\n // So users of this feature may see increased memory usage.\n\n //\n","file_path":"susy-rocksdb-sys/rocksdb/include/rocksdb/advanced_options.h","rank":28,"score":179530.2206135632},{"content":"struct Options;\n","file_path":"susy-rocksdb-sys/rocksdb/include/rocksdb/utilities/leveldb_options.h","rank":29,"score":179523.48379431159},{"content":"// Context information of a compaction run\n\nstruct CompactionFilterContext {\n\n // Does this compaction run include all data files\n\n bool is_full_compaction;\n\n // Is this compaction requested by the client (true),\n\n // or is it occurring as an automatic compaction process\n\n bool is_manual_compaction;\n\n};\n\n\n\n// CompactionFilter allows an application to modify/delete a key-value at\n\n// the time of compaction.\n\n\n","file_path":"susy-rocksdb-sys/rocksdb/include/rocksdb/compaction_filter.h","rank":30,"score":178579.83267578672},{"content":"//\n\n// CacheRecord\n\n//\n\n// Cache record represents the record on disk\n\n//\n\n// +--------+---------+----------+------------+---------------+-------------+\n\n// | magic | crc | key size | value size | key data | value data |\n\n// +--------+---------+----------+------------+---------------+-------------+\n\n// <-- 4 --><-- 4 --><-- 4 --><-- 4 --><-- key size --><-- v-size -->\n\n//\n\nstruct CacheRecordHeader {\n\n CacheRecordHeader()\n\n : magic_(0), crc_(0), key_size_(0), val_size_(0) {}\n\n CacheRecordHeader(const uint32_t magic, const uint32_t key_size,\n\n const uint32_t val_size)\n\n : magic_(magic), crc_(0), key_size_(key_size), val_size_(val_size) {}\n\n\n\n uint32_t magic_;\n\n uint32_t crc_;\n\n uint32_t key_size_;\n\n uint32_t val_size_;\n\n};\n\n\n","file_path":"susy-rocksdb-sys/rocksdb/utilities/persistent_cache/block_cache_tier_file.cc","rank":31,"score":178547.0411531015},{"content":"struct CompactionOptionsFIFO {\n\n // once the total sum of table files reaches this, we will delete the oldest\n\n // table file\n\n // Default: 1GB\n\n uint64_t max_table_files_size;\n\n\n\n // Drop files older than TTL. TTL based deletion will take precedence over\n\n // size based deletion if ttl > 0.\n\n // delete if sst_file_creation_time < (current_time - ttl)\n\n // unit: seconds. Ex: 1 day = 1 * 24 * 60 * 60\n\n // Default: 0 (disabled)\n\n uint64_t ttl = 0;\n\n\n\n // If true, try to do compaction to compact smaller files into larger ones.\n\n // Minimum files to compact follows options.level0_file_num_compaction_trigger\n\n // and compaction won't trigger if average compact bytes per del file is\n\n // larger than options.write_buffer_size. This is to protect large files\n\n // from being compacted again.\n\n // Default: false;\n\n bool allow_compaction = false;\n\n\n\n CompactionOptionsFIFO() : max_table_files_size(1 * 1024 * 1024 * 1024) {}\n\n CompactionOptionsFIFO(uint64_t _max_table_files_size, bool _allow_compaction,\n\n uint64_t _ttl = 0)\n\n : max_table_files_size(_max_table_files_size),\n\n ttl(_ttl),\n\n allow_compaction(_allow_compaction) {}\n\n};\n\n\n","file_path":"susy-rocksdb-sys/rocksdb/include/rocksdb/advanced_options.h","rank":32,"score":177524.11794527562},{"content":"// Options to control the behavior of a database (passed to\n\n// DB::Open). A LevelDBOptions object can be initialized as though\n\n// it were a LevelDB Options object, and then it can be converted into\n\n// a RocksDB Options object.\n\nstruct LevelDBOptions {\n\n // -------------------\n\n // Parameters that affect behavior\n\n\n\n // Comparator used to define the order of keys in the table.\n\n // Default: a comparator that uses lexicographic byte-wise ordering\n\n //\n\n // REQUIRES: The client must ensure that the comparator supplied\n\n // here has the same name and orders keys *exactly* the same as the\n\n // comparator provided to previous open calls on the same DB.\n\n const Comparator* comparator;\n\n\n\n // If true, the database will be created if it is missing.\n\n // Default: false\n\n bool create_if_missing;\n\n\n\n // If true, an error is raised if the database already exists.\n\n // Default: false\n\n bool error_if_exists;\n\n\n","file_path":"susy-rocksdb-sys/rocksdb/include/rocksdb/utilities/leveldb_options.h","rank":33,"score":175594.09024255176},{"content":"struct AdvancedColumnFamilyOptions {\n\n // The maximum number of write buffers that are built up in memory.\n\n // The default and the minimum number is 2, so that when 1 write buffer\n\n // is being flushed to storage, new writes can continue to the other\n\n // write buffer.\n\n // If max_write_buffer_number > 3, writing will be slowed down to\n\n // options.delayed_write_rate if we are writing to the last write buffer\n\n // allowed.\n\n //\n\n // Default: 2\n\n //\n\n // Dynamically changeable through SetOptions() API\n\n int max_write_buffer_number = 2;\n\n\n\n // The minimum number of write buffers that will be merged togsophy\n\n // before writing to storage. If set to 1, then\n\n // all write buffers are flushed to L0 as individual files and this increases\n\n // read amplification because a get request has to check in all of these\n\n // files. Also, an in-memory merge may result in writing lesser\n\n // data to storage if there are duplicate records in each of these\n","file_path":"susy-rocksdb-sys/rocksdb/include/rocksdb/advanced_options.h","rank":34,"score":175585.95938802726},{"content":"//\n\n// Block Cache Tier Metadata\n\n//\n\n// The BlockCacheTierMetadata holds all the metadata associated with block\n\n// cache. It\n\n// fundamentally contains 2 indexes and an LRU.\n\n//\n\n// Block Cache Index\n\n//\n\n// This is a forward index that maps a given key to a LBA (Logical Block\n\n// Address). LBA is a disk pointer that points to a record on the cache.\n\n//\n\n// LBA = { cache-id, offset, size }\n\n//\n\n// Cache File Index\n\n//\n\n// This is a forward index that maps a given cache-id to a cache file object.\n\n// Typically you would lookup using LBA and use the object to read or write\n\nstruct BlockInfo {\n\n explicit BlockInfo(const Slice& key, const LBA& lba = LBA())\n\n : key_(key.ToString()), lba_(lba) {}\n\n\n\n std::string key_;\n\n LBA lba_;\n\n};\n\n\n","file_path":"susy-rocksdb-sys/rocksdb/utilities/persistent_cache/block_cache_tier_metadata.h","rank":35,"score":174670.405918601},{"content":"struct BlockInfo;\n\n\n","file_path":"susy-rocksdb-sys/rocksdb/utilities/persistent_cache/block_cache_tier_file.h","rank":36,"score":174655.1499024587},{"content":"// Represents a logical record on device\n\n//\n\n// (L)ogical (B)lock (Address = { cache-file-id, offset, size }\n\nstruct LogicalBlockAddress {\n\n LogicalBlockAddress() {}\n\n explicit LogicalBlockAddress(const uint32_t cache_id, const uint32_t off,\n\n const uint16_t size)\n\n : cache_id_(cache_id), off_(off), size_(size) {}\n\n\n\n uint32_t cache_id_ = 0;\n\n uint32_t off_ = 0;\n\n uint32_t size_ = 0;\n\n};\n\n\n\ntypedef LogicalBlockAddress LBA;\n\n\n","file_path":"susy-rocksdb-sys/rocksdb/utilities/persistent_cache/block_cache_tier_file.h","rank":37,"score":172826.90917079948},{"content":"struct Options;\n","file_path":"susy-rocksdb-sys/rocksdb/db/builder.h","rank":38,"score":172209.98306923162},{"content":"struct Options;\n","file_path":"susy-rocksdb-sys/rocksdb/include/rocksdb/db.h","rank":39,"score":169686.92687313867},{"content":"struct ReadOptions;\n\n\n\nextern bool ShouldReportDetailedTime(Env* env, Statistics* stats);\n\n\n\n// the length of the magic number in bytes.\n\nconst int kMagicNumberLengthByte = 8;\n\n\n","file_path":"susy-rocksdb-sys/rocksdb/table/format.h","rank":40,"score":169686.92687313867},{"content":"struct EnvOptions;\n","file_path":"susy-rocksdb-sys/rocksdb/db/builder.h","rank":41,"score":169686.92687313867},{"content":"struct Options;\n\n\n\nusing std::unique_ptr;\n\n\n","file_path":"susy-rocksdb-sys/rocksdb/include/rocksdb/table.h","rank":42,"score":169686.92687313867},{"content":"struct FileDescriptor;\n","file_path":"susy-rocksdb-sys/rocksdb/db/table_cache.h","rank":43,"score":168066.9467432976},{"content":"struct JobContext;\n","file_path":"susy-rocksdb-sys/rocksdb/db/db_impl.h","rank":44,"score":167993.93202401337},{"content":"struct rocksdb_options_t { Options rep; };\n","file_path":"susy-rocksdb-sys/rocksdb/db/c.cc","rank":45,"score":167925.1125480077},{"content":"//\n\n// An application can issue a read request (via Get/Iterators) and specify\n\n// if that read should process data that ALREADY resides on a specified cache\n\n// level. For example, if an application specifies kBlockCacheTier then the\n\n// Get call will process data that is already processed in the memtable or\n\n// the block cache. It will not page in data from the OS cache or data that\n\n// resides in storage.\n\nenum ReadTier {\n\n kReadAllTier = 0x0, // data in memtable, block cache, OS cache or storage\n\n kBlockCacheTier = 0x1, // data in memtable or block cache\n\n kPersistedTier = 0x2, // persisted data. When WAL is disabled, this option\n\n // will skip data in memtable.\n\n // Note that this ReadTier currently only supports\n\n // Get and MultiGet and does not support iterators.\n\n kMemtableTier = 0x3 // data in memtable. used for memtable-only iterators.\n\n};\n\n\n","file_path":"susy-rocksdb-sys/rocksdb/include/rocksdb/options.h","rank":46,"score":167764.1765036183},{"content":"// Options while opening a file to read/write\n\nstruct EnvOptions {\n\n\n\n // Construct with default Options\n\n EnvOptions();\n\n\n\n // Construct from Options\n\n explicit EnvOptions(const DBOptions& options);\n\n\n\n // If true, then use mmap to read data\n\n bool use_mmap_reads = false;\n\n\n\n // If true, then use mmap to write data\n\n bool use_mmap_writes = true;\n\n\n\n // If true, then use O_DIRECT for reading data\n\n bool use_direct_reads = false;\n\n\n\n // If true, then use O_DIRECT for writing data\n\n bool use_direct_writes = false;\n\n\n","file_path":"susy-rocksdb-sys/rocksdb/include/rocksdb/env.h","rank":47,"score":167268.05253253313},{"content":"struct rocksdb_optimistictransaction_options_t {\n\n OptimisticTransactionOptions rep;\n\n};\n\n\n","file_path":"susy-rocksdb-sys/rocksdb/db/c.cc","rank":48,"score":167261.21047205682},{"content":"struct WriteOptions;\n","file_path":"susy-rocksdb-sys/rocksdb/include/rocksdb/db.h","rank":49,"score":167261.21047205682},{"content":"struct CompactionOptions;\n","file_path":"susy-rocksdb-sys/rocksdb/include/rocksdb/db.h","rank":50,"score":167261.21047205682},{"content":"struct rocksdb_transactiondb_options_t {\n\n TransactionDBOptions rep;\n\n};\n","file_path":"susy-rocksdb-sys/rocksdb/db/c.cc","rank":51,"score":167261.21047205682},{"content":"struct ReadOptions;\n","file_path":"susy-rocksdb-sys/rocksdb/table/table_reader.h","rank":52,"score":167261.21047205682},{"content":"struct Options;\n","file_path":"susy-rocksdb-sys/rocksdb/table/plain_table_reader.h","rank":53,"score":167261.21047205682},{"content":"struct DbPath {\n\n std::string path;\n\n uint64_t target_size; // Target size of total files under the path, in byte.\n\n\n\n DbPath() : target_size(0) {}\n\n DbPath(const std::string& p, uint64_t t) : path(p), target_size(t) {}\n\n};\n\n\n\n\n","file_path":"susy-rocksdb-sys/rocksdb/include/rocksdb/options.h","rank":54,"score":167261.21047205682},{"content":"struct DbPath;\n\n\n","file_path":"susy-rocksdb-sys/rocksdb/include/rocksdb/options.h","rank":55,"score":167261.21047205682},{"content":"struct rocksdb_transaction_options_t {\n\n TransactionOptions rep;\n\n};\n","file_path":"susy-rocksdb-sys/rocksdb/db/c.cc","rank":56,"score":167261.21047205682},{"content":"struct EnvOptions;\n","file_path":"susy-rocksdb-sys/rocksdb/include/rocksdb/table.h","rank":57,"score":167261.21047205682},{"content":"struct DBOptions;\n","file_path":"susy-rocksdb-sys/rocksdb/include/rocksdb/env.h","rank":58,"score":167261.21047205682},{"content":"struct ReadOptions;\n","file_path":"susy-rocksdb-sys/rocksdb/include/rocksdb/db.h","rank":59,"score":167261.21047205682},{"content":"struct FlushOptions;\n","file_path":"susy-rocksdb-sys/rocksdb/include/rocksdb/db.h","rank":60,"score":167261.21047205682},{"content":"struct DBOptions;\n","file_path":"susy-rocksdb-sys/rocksdb/include/rocksdb/db.h","rank":61,"score":167261.21047205682},{"content":"struct ColumnFamilyOptions : public AdvancedColumnFamilyOptions {\n\n // The function recovers options to a previous version. Only 4.6 or later\n\n // versions are supported.\n\n ColumnFamilyOptions* OldDefaults(int rocksdb_major_version = 4,\n\n int rocksdb_minor_version = 6);\n\n\n\n // Some functions that make it easier to optimize RocksDB\n\n // Use this if your DB is very small (like under 1GB) and you don't want to\n\n // spend lots of memory for memtables.\n\n ColumnFamilyOptions* OptimizeForSmallDb();\n\n\n\n // Use this if you don't need to keep the data sorted, i.e. you'll never use\n\n // an iterator, only Put() and Get() API calls\n\n //\n\n // Not supported in ROCKSDB_LITE\n\n ColumnFamilyOptions* OptimizeForPointLookup(\n\n uint64_t block_cache_size_mb);\n\n\n\n // Default values for some parameters in ColumnFamilyOptions are not\n\n // optimized for heavy workloads and big datasets, which means you might\n","file_path":"susy-rocksdb-sys/rocksdb/include/rocksdb/options.h","rank":62,"score":165915.62589989576},{"content":"struct LRUElement {\n\n explicit LRUElement() : next_(nullptr), prev_(nullptr), refs_(0) {}\n\n\n\n virtual ~LRUElement() { assert(!refs_); }\n\n\n\n T* next_;\n\n T* prev_;\n\n std::atomic<size_t> refs_;\n\n};\n\n\n\n// LRU implementation\n\n//\n\n// In place LRU implementation. There is no copy or allocation involved when\n\n// inserting or removing an element. This makes the data structure slim\n\ntemplate <class T>\n","file_path":"susy-rocksdb-sys/rocksdb/utilities/persistent_cache/lrulist.h","rank":63,"score":165717.7951194635},{"content":"struct BlockContents;\n\n\n","file_path":"susy-rocksdb-sys/rocksdb/table/persistent_cache_helper.h","rank":64,"score":165717.7951194635},{"content":"struct MemTableInfo;\n\n\n","file_path":"susy-rocksdb-sys/rocksdb/db/db_impl.h","rank":65,"score":165646.1622032075},{"content":"struct IterState {\n\n IterState(DBImpl* _db, InstrumentedMutex* _mu, SuperVersion* _super_version,\n\n bool _background_purge)\n\n : db(_db),\n\n mu(_mu),\n\n super_version(_super_version),\n\n background_purge(_background_purge) {}\n\n\n\n DBImpl* db;\n\n InstrumentedMutex* mu;\n\n SuperVersion* super_version;\n\n bool background_purge;\n\n};\n\n\n\nstatic void CleanupIteratorState(void* arg1, void* /*arg2*/) {\n\n IterState* state = reinterpret_cast<IterState*>(arg1);\n\n\n\n if (state->super_version->Unref()) {\n\n // Job id == 0 means that this is not our background process, but rather\n\n // user thread\n","file_path":"susy-rocksdb-sys/rocksdb/db/db_impl.cc","rank":66,"score":165646.1622032075},{"content":"// Options for customizing ldb tool (beyond the DB Options)\n\nstruct LDBOptions {\n\n // Create LDBOptions with default values for all fields\n\n LDBOptions();\n\n\n\n // Key formatter that converts a slice to a readable string.\n\n // Default: Slice::ToString()\n\n std::shared_ptr<SliceFormatter> key_formatter;\n\n\n\n std::string print_help_header = \"ldb - RocksDB Tool\";\n\n};\n\n\n","file_path":"susy-rocksdb-sys/rocksdb/include/rocksdb/ldb_tool.h","rank":67,"score":164935.10546252917},{"content":"struct TableBuilderOptions {\n\n TableBuilderOptions(\n\n const ImmutableCFOptions& _ioptions,\n\n const InternalKeyComparator& _internal_comparator,\n\n const std::vector<std::unique_ptr<IntTblPropCollectorFactory>>*\n\n _int_tbl_prop_collector_factories,\n\n CompressionType _compression_type,\n\n const CompressionOptions& _compression_opts,\n\n const std::string* _compression_dict, bool _skip_filters,\n\n const std::string& _column_family_name, int _level,\n\n const uint64_t _creation_time = 0, const int64_t _oldest_key_time = 0)\n\n : ioptions(_ioptions),\n\n internal_comparator(_internal_comparator),\n\n int_tbl_prop_collector_factories(_int_tbl_prop_collector_factories),\n\n compression_type(_compression_type),\n\n compression_opts(_compression_opts),\n\n compression_dict(_compression_dict),\n\n skip_filters(_skip_filters),\n\n column_family_name(_column_family_name),\n\n level(_level),\n","file_path":"susy-rocksdb-sys/rocksdb/table/table_builder.h","rank":68,"score":164927.30740126083},{"content":"struct Options;\n\n\n","file_path":"susy-rocksdb-sys/rocksdb/include/rocksdb/flush_block_policy.h","rank":69,"score":164927.30740126083},{"content":"struct ReadOptions;\n","file_path":"susy-rocksdb-sys/rocksdb/table/two_level_iterator.h","rank":70,"score":164927.30740126083},{"content":"struct CompactRangeOptions;\n","file_path":"susy-rocksdb-sys/rocksdb/include/rocksdb/db.h","rank":71,"score":164927.30740126083},{"content":"struct TableReaderOptions {\n\n // @param skip_filters Disables loading/accessing the filter block\n\n TableReaderOptions(const ImmutableCFOptions& _ioptions,\n\n const EnvOptions& _env_options,\n\n const InternalKeyComparator& _internal_comparator,\n\n bool _skip_filters = false, int _level = -1)\n\n : ioptions(_ioptions),\n\n env_options(_env_options),\n\n internal_comparator(_internal_comparator),\n\n skip_filters(_skip_filters),\n\n level(_level) {}\n\n\n\n const ImmutableCFOptions& ioptions;\n\n const EnvOptions& env_options;\n\n const InternalKeyComparator& internal_comparator;\n\n // This is only used for BlockBasedTable (reader)\n\n bool skip_filters;\n\n // what level this table/file is on, -1 for \"not set, don't know\"\n\n int level;\n\n};\n\n\n","file_path":"susy-rocksdb-sys/rocksdb/table/table_builder.h","rank":72,"score":164927.30740126083},{"content":"struct ColumnFamilyOptions;\n","file_path":"susy-rocksdb-sys/rocksdb/include/rocksdb/db.h","rank":73,"score":164927.30740126083},{"content":"struct ImmutableMemTableOptions {\n\n explicit ImmutableMemTableOptions(const ImmutableCFOptions& ioptions,\n\n const MutableCFOptions& mutable_cf_options);\n\n size_t arena_block_size;\n\n uint32_t memtable_prefix_bloom_bits;\n\n size_t memtable_huge_page_size;\n\n bool inplace_update_support;\n\n size_t inplace_update_num_locks;\n\n UpdateStatus (*inplace_callback)(char* existing_value,\n\n uint32_t* existing_value_size,\n\n Slice delta_value,\n\n std::string* merged_value);\n\n size_t max_successive_merges;\n\n Statistics* statistics;\n\n MergeOperator* merge_operator;\n\n Logger* info_log;\n\n};\n\n\n","file_path":"susy-rocksdb-sys/rocksdb/db/memtable.h","rank":74,"score":164927.30740126083},{"content":"struct ReadOptions;\n","file_path":"susy-rocksdb-sys/rocksdb/table/plain_table_reader.h","rank":75,"score":164927.30740126083},{"content":"struct TableReaderOptions;\n","file_path":"susy-rocksdb-sys/rocksdb/include/rocksdb/table.h","rank":76,"score":164927.30740126083},{"content":"struct TableBuilderOptions;\n","file_path":"susy-rocksdb-sys/rocksdb/include/rocksdb/table.h","rank":77,"score":164927.30740126083},{"content":"struct ImmutableDBOptions;\n","file_path":"susy-rocksdb-sys/rocksdb/include/rocksdb/env.h","rank":78,"score":164927.30740126083},{"content":"struct MutableDBOptions;\n","file_path":"susy-rocksdb-sys/rocksdb/include/rocksdb/env.h","rank":79,"score":164927.30740126083},{"content":"struct OptionsOverride {\n\n std::shared_ptr<const FilterPolicy> filter_policy = nullptr;\n\n // These will be used only if filter_policy is set\n\n bool partition_filters = false;\n\n uint64_t metadata_block_size = 1024;\n\n BlockBasedTableOptions::IndexType index_type =\n\n BlockBasedTableOptions::IndexType::kBinarySearch;\n\n\n\n // Used as a bit mask of individual enums in which to skip an XF test point\n\n int skip_policy = 0;\n\n};\n\n\n\n} // namespace anon\n\n\n","file_path":"susy-rocksdb-sys/rocksdb/db/db_test_util.h","rank":80,"score":164927.30740126083},{"content":"struct rocksdb_universal_compaction_options_t {\n\n rocksdb::CompactionOptionsUniversal *rep;\n\n};\n\n\n\nstatic bool SaveError(char** errptr, const Status& s) {\n\n assert(errptr != nullptr);\n\n if (s.ok()) {\n\n return false;\n\n } else if (*errptr == nullptr) {\n\n *errptr = strdup(s.ToString().c_str());\n\n } else {\n\n // TODO(sanjay): Merge with existing error?\n\n // This is a bug if *errptr is not created by malloc()\n\n free(*errptr);\n\n *errptr = strdup(s.ToString().c_str());\n\n }\n\n return true;\n\n}\n\n\n\nstatic char* CopyString(const std::string& str) {\n","file_path":"susy-rocksdb-sys/rocksdb/db/c.cc","rank":81,"score":164927.30740126083},{"content":"struct EnvOptions;\n\n\n\nusing std::unique_ptr;\n","file_path":"susy-rocksdb-sys/rocksdb/table/adaptive_table_factory.h","rank":82,"score":164927.30740126083},{"content":"struct EnvOptions;\n\n\n\nusing std::unique_ptr;\n","file_path":"susy-rocksdb-sys/rocksdb/table/plain_table_factory.h","rank":83,"score":164927.30740126083},{"content":"struct PlainTableOptions {\n\n // @user_key_len: plain table has optimization for fix-sized keys, which can\n\n // be specified via user_key_len. Alternatively, you can pass\n\n // `kPlainTableVariableLength` if your keys have variable\n\n // lengths.\n\n uint32_t user_key_len = kPlainTableVariableLength;\n\n\n\n // @bloom_bits_per_key: the number of bits used for bloom filer per prefix.\n\n // You may disable it by passing a zero.\n\n int bloom_bits_per_key = 10;\n\n\n\n // @hash_table_ratio: the desired utilization of the hash table used for\n\n // prefix hashing.\n\n // hash_table_ratio = number of prefixes / #buckets in the\n\n // hash table\n\n double hash_table_ratio = 0.75;\n\n\n\n // @index_sparseness: inside each prefix, need to build one index record for\n\n // how many keys for binary search inside each hash bucket.\n\n // For encoding type kPrefix, the value will be used when\n","file_path":"susy-rocksdb-sys/rocksdb/include/rocksdb/table.h","rank":84,"score":164927.30740126083},{"content":"struct CuckooTableOptions {\n\n // Determines the utilization of hash tables. Smaller values\n\n // result in larger hash tables with fewer collisions.\n\n double hash_table_ratio = 0.9;\n\n // A property used by builder to determine the depth to go to\n\n // to search for a path to displace elements in case of\n\n // collision. See Builder.MakeSpaceForKey method. Higher\n\n // values result in more efficient hash tables with fewer\n\n // lookups but take more time to build.\n\n uint32_t max_search_depth = 100;\n\n // In case of collision while inserting, the builder\n\n // attempts to insert in the next cuckoo_block_size\n\n // locations before skipping over to the next Cuckoo hash\n\n // function. This makes lookups more cache friendly in case\n\n // of collisions.\n\n uint32_t cuckoo_block_size = 5;\n\n // If this option is enabled, user key is treated as uint64_t and its value\n\n // is used as hash value directly. This option changes builder's behavior.\n\n // Reader ignore this option and behave according to what specified in table\n\n // property.\n","file_path":"susy-rocksdb-sys/rocksdb/include/rocksdb/table.h","rank":85,"score":164927.30740126083},{"content":"struct rocksdb_restore_options_t { RestoreOptions rep; };\n","file_path":"susy-rocksdb-sys/rocksdb/db/c.cc","rank":86,"score":163987.58814172336},{"content":"struct ExternalFileIngestionInfo {\n\n // the name of the column family\n\n std::string cf_name;\n\n // Path of the file outside the DB\n\n std::string external_file_path;\n\n // Path of the file inside the DB\n\n std::string internal_file_path;\n\n // The global sequence number assigned to keys in this file\n\n SequenceNumber global_seqno;\n\n // Table properties of the table being flushed\n\n TableProperties table_properties;\n\n};\n\n\n","file_path":"susy-rocksdb-sys/rocksdb/include/rocksdb/listener.h","rank":87,"score":163591.41145768674},{"content":"struct ExternalSstFileInfo;\n","file_path":"susy-rocksdb-sys/rocksdb/include/rocksdb/db.h","rank":88,"score":163591.41145768674},{"content":"// Options to control the behavior of a database (passed to DB::Open)\n\nstruct Options : public DBOptions, public ColumnFamilyOptions {\n\n // Create an Options object with default values for all fields.\n\n Options() : DBOptions(), ColumnFamilyOptions() {}\n\n\n\n Options(const DBOptions& db_options,\n\n const ColumnFamilyOptions& column_family_options)\n\n : DBOptions(db_options), ColumnFamilyOptions(column_family_options) {}\n\n\n\n // The function recovers options to the option as in version 4.6.\n\n Options* OldDefaults(int rocksdb_major_version = 4,\n\n int rocksdb_minor_version = 6);\n\n\n\n void Dump(Logger* log) const;\n\n\n\n void DumpCFOptions(Logger* log) const;\n\n\n\n // Some functions that make it easier to optimize RocksDB\n\n\n\n // Set appropriate parameters for bulk loading.\n\n // The reason that this is a function that returns \"this\" instead of a\n","file_path":"susy-rocksdb-sys/rocksdb/include/rocksdb/options.h","rank":89,"score":163485.27615073015},{"content":"struct WriteOptions;\n\n\n\nOptimisticTransaction::OptimisticTransaction(\n\n OptimisticTransactionDB* txn_db, const WriteOptions& write_options,\n\n const OptimisticTransactionOptions& txn_options)\n\n : TransactionBaseImpl(txn_db->GetBaseDB(), write_options), txn_db_(txn_db) {\n\n Initialize(txn_options);\n\n}\n\n\n\nvoid OptimisticTransaction::Initialize(\n\n const OptimisticTransactionOptions& txn_options) {\n\n if (txn_options.set_snapshot) {\n\n SetSnapshot();\n\n }\n\n}\n\n\n\nvoid OptimisticTransaction::Reinitialize(\n\n OptimisticTransactionDB* txn_db, const WriteOptions& write_options,\n\n const OptimisticTransactionOptions& txn_options) {\n\n TransactionBaseImpl::Reinitialize(txn_db->GetBaseDB(), write_options);\n","file_path":"susy-rocksdb-sys/rocksdb/utilities/transactions/optimistic_transaction.cc","rank":90,"score":162680.10177896434},{"content":"struct ComparatorJniCallbackOptions {\n\n // Use adaptive mutex, which spins in the user space before resorting\n\n // to kernel. This could reduce context switch when the mutex is not\n\n // heavily contended. However, if the mutex is hot, we could end up\n\n // wasting spin time.\n\n // Default: false\n\n bool use_adaptive_mutex;\n\n\n\n ComparatorJniCallbackOptions() : use_adaptive_mutex(false) {\n\n }\n\n};\n\n\n\n/**\n\n * This class acts as a bridge between C++\n\n * and Java. The methods in this class will be\n\n * called back from the RocksDB storage engine (C++)\n\n * we then callback to the appropriate Java method\n\n * this enables Comparators to be implemented in Java.\n\n *\n\n * The design of this Comparator caches the Java Slice\n\n * objects that are used in the compare and findShortestSeparator\n\n * method callbacks. Instead of creating new objects for each callback\n\n * of those functions, by reuse via setHandle we are a lot\n\n * faster; Unfortunately this means that we have to\n\n * introduce independent locking in regions of each of those methods\n\n * via the mutexs mtx_compare and mtx_findShortestSeparator respectively\n\n */\n","file_path":"susy-rocksdb-sys/rocksdb/java/rocksjni/comparatorjnicallback.h","rank":91,"score":162680.10177896434},{"content":"// For advanced user only\n\nstruct BlockBasedTableOptions {\n\n // @flush_block_policy_factory creates the instances of flush block policy.\n\n // which provides a configurable way to determine when to flush a block in\n\n // the block based tables. If not set, table builder will use the default\n\n // block flush policy, which cut blocks by block size (please refer to\n\n // `FlushBlockBySizePolicy`).\n\n std::shared_ptr<FlushBlockPolicyFactory> flush_block_policy_factory;\n\n\n\n // TODO(kailiu) Temporarily disable this feature by making the default value\n\n // to be false.\n\n //\n\n // Indicating if we'd put index/filter blocks to the block cache.\n\n // If not specified, each \"table reader\" object will pre-load index/filter\n\n // block during table initialization.\n\n bool cache_index_and_filter_blocks = false;\n\n\n\n // If cache_index_and_filter_blocks is enabled, cache index and filter\n\n // blocks with high priority. If set to true, depending on implementation of\n\n // block cache, index and filter blocks may be less likely to be evicted\n\n // than data blocks.\n","file_path":"susy-rocksdb-sys/rocksdb/include/rocksdb/table.h","rank":92,"score":162680.10177896434},{"content":"struct RestoreOptions {\n\n // If true, restore won't overwrite the existing log files in wal_dir. It will\n\n // also move all log files from archive directory to wal_dir. Use this option\n\n // in combination with BackupableDBOptions::backup_log_files = false for\n\n // persisting in-memory databases.\n\n // Default: false\n\n bool keep_log_files;\n\n\n\n explicit RestoreOptions(bool _keep_log_files = false)\n\n : keep_log_files(_keep_log_files) {}\n\n};\n\n\n\ntypedef uint32_t BackupID;\n\n\n","file_path":"susy-rocksdb-sys/rocksdb/include/rocksdb/utilities/backupable_db.h","rank":93,"score":162680.10177896434},{"content":"struct DumpOptions {\n\n // Database that will be dumped\n\n std::string db_path;\n\n // File location that will contain dump output\n\n std::string dump_location;\n\n // Don't include db information header in the dump\n\n bool anonymous = false;\n\n};\n\n\n","file_path":"susy-rocksdb-sys/rocksdb/include/rocksdb/db_dump_tool.h","rank":94,"score":162680.10177896434},{"content":"struct UndumpOptions {\n\n // Database that we will load the dumped file into\n\n std::string db_path;\n\n // File location of the dumped file that will be loaded\n\n std::string dump_location;\n\n // Compact the db after loading the dumped file\n\n bool compact_db = false;\n\n};\n\n\n","file_path":"susy-rocksdb-sys/rocksdb/include/rocksdb/db_dump_tool.h","rank":95,"score":162680.10177896434},{"content":"struct EnvOptions;\n","file_path":"susy-rocksdb-sys/rocksdb/table/block_based_table_reader.h","rank":96,"score":162680.10177896434},{"content":"struct EnvOptions;\n\n\n\nusing std::unique_ptr;\n","file_path":"susy-rocksdb-sys/rocksdb/table/block_based_table_factory.h","rank":97,"score":162680.10177896434},{"content":"struct ReadOptions;\n","file_path":"susy-rocksdb-sys/rocksdb/table/block_based_table_reader.h","rank":98,"score":162680.10177896434},{"content":"struct TransactionOptions {\n\n // Setting set_snapshot=true is the same as calling\n\n // Transaction::SetSnapshot().\n\n bool set_snapshot = false;\n\n\n\n // Setting to true means that before acquiring locks, this transaction will\n\n // check if doing so will cause a deadlock. If so, it will return with\n\n // Status::Busy. The user should retry their transaction.\n\n bool deadlock_detect = false;\n\n\n\n // If set, it states that the CommitTimeWriteBatch represents the latest state\n\n // of the application, has only one sub-batch, i.e., no duplicate keys, and\n\n // meant to be used later during recovery. It enables an optimization to\n\n // postpone updating the memtable with CommitTimeWriteBatch to only\n\n // SwitchMemtable or recovery.\n\n bool use_only_the_last_commit_time_batch_for_recovery = false;\n\n\n\n // TODO(agiardullo): TransactionDB does not yet support comparators that allow\n\n // two non-equal keys to be equivalent. Ie, cmp->Compare(a,b) should only\n\n // return 0 if\n","file_path":"susy-rocksdb-sys/rocksdb/include/rocksdb/utilities/transaction_db.h","rank":99,"score":162680.10177896434}],"string":"[\n {\n \"content\": \"pub fn new_cache(capacity: size_t) -> DBCache {\\n\\n unsafe { rocksdb_cache_create_lru(capacity) }\\n\\n}\\n\\n\\n\\n#[repr(C)]\\n\\npub enum DBCompressionType {\\n\\n DBNoCompression = 0,\\n\\n DBSnappyCompression = 1,\\n\\n DBZlibCompression = 2,\\n\\n DBBz2Compression = 3,\\n\\n DBLz4Compression = 4,\\n\\n DBLz4hcCompression = 5,\\n\\n}\\n\\n\\n\\n#[repr(C)]\\n\\npub enum DBCompactionStyle {\\n\\n DBLevelCompaction = 0,\\n\\n DBUniversalCompaction = 1,\\n\\n DBFifoCompaction = 2,\\n\\n}\\n\\n\\n\\n#[repr(C)]\\n\\npub enum DBUniversalCompactionStyle {\\n\\n rocksdb_similar_size_compaction_stop_style = 0,\\n\\n rocksdb_total_size_compaction_stop_style = 1,\\n\\n}\\n\\n\\n\",\n \"file_path\": \"susy-rocksdb-sys/src/ffi.rs\",\n \"rank\": 0,\n \"score\": 266092.27223118604\n },\n {\n \"content\": \"struct LRUCacheOptions {\\n\\n // Capacity of the cache.\\n\\n size_t capacity = 0;\\n\\n\\n\\n // Cache is sharded into 2^num_shard_bits shards,\\n\\n // by hash of key. Refer to NewLRUCache for further\\n\\n // information.\\n\\n int num_shard_bits = -1;\\n\\n\\n\\n // If strict_capacity_limit is set,\\n\\n // insert to the cache will fail when cache is full.\\n\\n bool strict_capacity_limit = false;\\n\\n\\n\\n // Percentage of cache reserved for high priority entries.\\n\\n double high_pri_pool_ratio = 0.0;\\n\\n\\n\\n LRUCacheOptions() {}\\n\\n LRUCacheOptions(size_t _capacity, int _num_shard_bits,\\n\\n bool _strict_capacity_limit, double _high_pri_pool_ratio)\\n\\n : capacity(_capacity),\\n\",\n \"file_path\": \"susy-rocksdb-sys/rocksdb/include/rocksdb/cache.h\",\n \"rank\": 1,\n \"score\": 240588.95682970548\n },\n {\n \"content\": \"// IngestExternalFileOptions is used by IngestExternalFile()\\n\\nstruct IngestExternalFileOptions {\\n\\n // Can be set to true to move the files instead of copying them.\\n\\n bool move_files = false;\\n\\n // If set to false, an ingested file keys could appear in existing snapshots\\n\\n // that where created before the file was ingested.\\n\\n bool snapshot_consistency = true;\\n\\n // If set to false, IngestExternalFile() will fail if the file key range\\n\\n // overlaps with existing keys or tombstones in the DB.\\n\\n bool allow_global_seqno = true;\\n\\n // If set to false and the file key range overlaps with the memtable key range\\n\\n // (memtable flush required), IngestExternalFile will fail.\\n\\n bool allow_blocking_flush = true;\\n\\n // Set to true if you would like duplicate keys in the file being ingested\\n\\n // to be skipped rather than overwriting existing data under that key.\\n\\n // Usecase: back-fill of some historical data in the database without\\n\\n // over-writing existing newer version of data.\\n\\n // This option could only be used if the DB has been running\\n\\n // with allow_ingest_behind=true since the dawn of time.\\n\\n // All files will be ingested at the bottommost level with seqno=0.\\n\\n bool ingest_behind = false;\\n\\n};\\n\\n\\n\\n} // namespace rocksdb\\n\\n\\n\\n#endif // STORAGE_ROCKSDB_INCLUDE_OPTIONS_H_\\n\",\n \"file_path\": \"susy-rocksdb-sys/rocksdb/include/rocksdb/options.h\",\n \"rank\": 2,\n \"score\": 237424.15602121002\n },\n {\n \"content\": \"pub fn new_bloom_filter(bits: c_int) -> DBFilterPolicy {\\n\\n unsafe { rocksdb_filterpolicy_create_bloom(bits) }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"susy-rocksdb-sys/src/ffi.rs\",\n \"rank\": 3,\n \"score\": 234741.7334280406\n },\n {\n \"content\": \"struct ExternalSstFileInfo;\\n\",\n \"file_path\": \"susy-rocksdb-sys/rocksdb/db/db_impl.h\",\n \"rank\": 4,\n \"score\": 223263.91375849393\n },\n {\n \"content\": \"struct RocksLuaCompactionFilterOptions {\\n\\n // The lua script in string that implements all necessary CompactionFilter\\n\\n // virtual functions. The specified lua_script must implement the following\\n\\n // functions, which are Name and Filter, as described below.\\n\\n //\\n\\n // 0. The Name function simply returns a string representing the name of\\n\\n // the lua script. If there's any erorr in the Name function, an\\n\\n // empty string will be used.\\n\\n // --- Example\\n\\n // function Name()\\n\\n // return \\\"DefaultLuaCompactionFilter\\\"\\n\\n // end\\n\\n //\\n\\n //\\n\\n // 1. The script must contains a function called Filter, which implements\\n\\n // CompactionFilter::Filter() , takes three input arguments, and returns\\n\\n // three values as the following API:\\n\\n //\\n\\n // function Filter(level, key, existing_value)\\n\\n // ...\\n\",\n \"file_path\": \"susy-rocksdb-sys/rocksdb/include/rocksdb/utilities/lua/rocks_lua_compaction_filter.h\",\n \"rank\": 5,\n \"score\": 220759.55330205295\n },\n {\n \"content\": \" enum class WalProcessingOption {\\n\\n // Continue processing as usual\\n\\n kContinueProcessing = 0,\\n\\n // Ignore the current record but continue processing of log(s)\\n\\n kIgnoreCurrentRecord = 1,\\n\\n // Stop replay of logs and discard logs\\n\\n // Logs won't be replayed on subsequent recovery\\n\\n kStopReplay = 2,\\n\\n // Corrupted record detected by filter\\n\\n kCorruptedRecord = 3,\\n\\n // Marker for enum count\\n\\n kWalProcessingOptionMax = 4\\n\\n };\\n\\n\\n\\n virtual ~WalFilter() {}\\n\\n\\n\\n // Provide ColumnFamily->LogNumber map to filter\\n\\n // so that filter can determine whether a log number applies to a given \\n\\n // column family (i.e. that log hasn't been flushed to SST already for the\\n\\n // column family).\\n\",\n \"file_path\": \"susy-rocksdb-sys/rocksdb/include/rocksdb/wal_filter.h\",\n \"rank\": 6,\n \"score\": 212987.4931344085\n },\n {\n \"content\": \"struct rocksdb_writeoptions_t { WriteOptions rep; };\\n\",\n \"file_path\": \"susy-rocksdb-sys/rocksdb/db/c.cc\",\n \"rank\": 7,\n \"score\": 211020.67042703804\n },\n {\n \"content\": \"struct ThreadPoolImpl::Impl {\\n\\n\\n\\n Impl();\\n\\n ~Impl();\\n\\n\\n\\n void JoinThreads(bool wait_for_jobs_to_complete);\\n\\n\\n\\n void SetBackgroundThreadsInternal(int num, bool allow_reduce);\\n\\n int GetBackgroundThreads();\\n\\n\\n\\n unsigned int GetQueueLen() const {\\n\\n return queue_len_.load(std::memory_order_relaxed);\\n\\n }\\n\\n\\n\\n void LowerIOPriority();\\n\\n\\n\\n void LowerCPUPriority();\\n\\n\\n\\n void WakeUpAllThreads() {\\n\\n bgsignal_.notify_all();\\n\",\n \"file_path\": \"susy-rocksdb-sys/rocksdb/util/threadpool_imp.cc\",\n \"rank\": 8,\n \"score\": 207365.18188090815\n },\n {\n \"content\": \"struct rocksdb_ingestexternalfileoptions_t { IngestExternalFileOptions rep; };\\n\",\n \"file_path\": \"susy-rocksdb-sys/rocksdb/db/c.cc\",\n \"rank\": 9,\n \"score\": 204562.45756093747\n },\n {\n \"content\": \"// Cache entry meta data.\\n\\nstruct CacheHandle {\\n\\n Slice key;\\n\\n uint32_t hash;\\n\\n void* value;\\n\\n size_t charge;\\n\\n void (*deleter)(const Slice&, void* value);\\n\\n\\n\\n // Flags and counters associated with the cache handle:\\n\\n // lowest bit: n-cache bit\\n\\n // second lowest bit: usage bit\\n\\n // the rest bits: reference count\\n\\n // The handle is unused when flags equals to 0. The thread decreases the count\\n\\n // to 0 is responsible to put the handle back to recycle_ and cleanup memory.\\n\\n std::atomic<uint32_t> flags;\\n\\n\\n\\n CacheHandle() = default;\\n\\n\\n\\n CacheHandle(const CacheHandle& a) { *this = a; }\\n\\n\\n\\n CacheHandle(const Slice& k, void* v,\\n\",\n \"file_path\": \"susy-rocksdb-sys/rocksdb/cache/clock_cache.cc\",\n \"rank\": 10,\n \"score\": 187179.98409964904\n },\n {\n \"content\": \"// Key of hash map. We store hash value with the key for convenience.\\n\\nstruct CacheKey {\\n\\n Slice key;\\n\\n uint32_t hash_value;\\n\\n\\n\\n CacheKey() = default;\\n\\n\\n\\n CacheKey(const Slice& k, uint32_t h) {\\n\\n key = k;\\n\\n hash_value = h;\\n\\n }\\n\\n\\n\\n static bool equal(const CacheKey& a, const CacheKey& b) {\\n\\n return a.hash_value == b.hash_value && a.key == b.key;\\n\\n }\\n\\n\\n\\n static size_t hash(const CacheKey& a) {\\n\\n return static_cast<size_t>(a.hash_value);\\n\\n }\\n\\n};\\n\\n\\n\",\n \"file_path\": \"susy-rocksdb-sys/rocksdb/cache/clock_cache.cc\",\n \"rank\": 11,\n \"score\": 187172.79289240445\n },\n {\n \"content\": \"struct Options;\\n\",\n \"file_path\": \"susy-rocksdb-sys/rocksdb/include/rocksdb/options.h\",\n \"rank\": 12,\n \"score\": 183718.45887691664\n },\n {\n \"content\": \"struct LRUHandle {\\n\\n void* value;\\n\\n void (*deleter)(const Slice&, void* value);\\n\\n LRUHandle* next_hash;\\n\\n LRUHandle* next;\\n\\n LRUHandle* prev;\\n\\n size_t charge; // TODO(opt): Only allow uint32_t?\\n\\n size_t key_length;\\n\\n uint32_t refs; // a number of refs to this entry\\n\\n // cache itself is counted as 1\\n\\n\\n\\n // Include the following flags:\\n\\n // in_cache: whether this entry is referenced by the hash table.\\n\\n // is_high_pri: whether this entry is high priority entry.\\n\\n // in_high_pri_pool: whether this entry is in high-pri pool.\\n\\n char flags;\\n\\n\\n\\n uint32_t hash; // Hash of key(); used for fast sharding and comparisons\\n\\n\\n\\n char key_data[1]; // Beginning of key\\n\",\n \"file_path\": \"susy-rocksdb-sys/rocksdb/cache/lru_cache.h\",\n \"rank\": 13,\n \"score\": 182581.37388073117\n },\n {\n \"content\": \"#[test]\\n\\nfn external() {\\n\\n let path = \\\"_rust_rocksdb_externaltest\\\";\\n\\n {\\n\\n let db = DB::open_default(path).unwrap();\\n\\n let p = db.put(b\\\"k1\\\", b\\\"v1111\\\");\\n\\n assert!(p.is_ok());\\n\\n let r: Result<Option<DBVector>, String> = db.get(b\\\"k1\\\");\\n\\n assert!(r.unwrap().unwrap().to_utf8().unwrap() == \\\"v1111\\\");\\n\\n assert!(db.delete(b\\\"k1\\\").is_ok());\\n\\n assert!(db.get(b\\\"k1\\\").unwrap().is_none());\\n\\n }\\n\\n let opts = Options::new();\\n\\n let result = DB::destroy(&opts, path);\\n\\n assert!(result.is_ok());\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/rocksdb.rs\",\n \"rank\": 14,\n \"score\": 182036.24582243018\n },\n {\n \"content\": \"// Persistent Cache Config\\n\\n//\\n\\n// This struct captures all the options that are used to configure persistent\\n\\n// cache. Some of the terminologies used in naming the options are\\n\\n//\\n\\n// dispatch size :\\n\\n// This is the size in which IO is dispatched to the device\\n\\n//\\n\\n// write buffer size :\\n\\n// This is the size of an individual write buffer size. Write buffers are\\n\\n// grouped to form buffered file.\\n\\n//\\n\\n// cache size :\\n\\n// This is the logical maximum for the cache size\\n\\n//\\n\\n// qdepth :\\n\\n// This is the max number of IOs that can issues to the device in parallel\\n\\n//\\n\\n// pepeling :\\n\\n// The writer code path follows pipelined architecture, which means the\\n\\n// operations are handed off from one stage to another\\n\\n//\\n\\n// pipelining backlog size :\\n\\n// With the pipelined architecture, there can always be backlogging of ops in\\n\\n// pipeline queues. This is the maximum backlog size after which ops are dropped\\n\\n// from queue\\n\\nstruct PersistentCacheConfig {\\n\\n explicit PersistentCacheConfig(\\n\\n Env* const _env, const std::string& _path, const uint64_t _cache_size,\\n\\n const std::shared_ptr<Logger>& _log,\\n\\n const uint32_t _write_buffer_size = 1 * 1024 * 1024 /*1MB*/) {\\n\\n env = _env;\\n\\n path = _path;\\n\\n log = _log;\\n\\n cache_size = _cache_size;\\n\\n writer_dispatch_size = write_buffer_size = _write_buffer_size;\\n\\n }\\n\\n\\n\\n //\\n\\n // Validate the settings. Our intentions are to catch erroneous settings ahead\\n\\n // of time instead going violating invariants or causing dead locks.\\n\\n //\\n\\n Status ValidateSettings() const {\\n\\n // (1) check pre-conditions for variables\\n\\n if (!env || path.empty()) {\\n\\n return Status::InvalidArgument(\\\"empty or null args\\\");\\n\",\n \"file_path\": \"susy-rocksdb-sys/rocksdb/utilities/persistent_cache/persistent_cache_tier.h\",\n \"rank\": 15,\n \"score\": 181874.68833106817\n },\n {\n \"content\": \"// CompactionOptions are used in CompactFiles() call.\\n\\nstruct CompactionOptions {\\n\\n // Compaction output compression type\\n\\n // Default: snappy\\n\\n CompressionType compression;\\n\\n // Compaction will create files of size `output_file_size_limit`.\\n\\n // Default: MAX, which means that compaction will create a single file\\n\\n uint64_t output_file_size_limit;\\n\\n // If > 0, it will replace the option in the DBOptions for this compaction.\\n\\n uint32_t max_subcompactions;\\n\\n\\n\\n CompactionOptions()\\n\\n : compression(kSnappyCompression),\\n\\n output_file_size_limit(std::numeric_limits<uint64_t>::max()),\\n\\n max_subcompactions(0) {}\\n\\n};\\n\\n\\n\",\n \"file_path\": \"susy-rocksdb-sys/rocksdb/include/rocksdb/options.h\",\n \"rank\": 16,\n \"score\": 181600.95161362842\n },\n {\n \"content\": \"// Options that control read operations\\n\\nstruct ReadOptions {\\n\\n // If \\\"snapshot\\\" is non-nullptr, read as of the supplied snapshot\\n\\n // (which must belong to the DB that is being read and which must\\n\\n // not have been released). If \\\"snapshot\\\" is nullptr, use an implicit\\n\\n // snapshot of the state at the beginning of this read operation.\\n\\n // Default: nullptr\\n\\n const Snapshot* snapshot;\\n\\n\\n\\n // `iterate_lower_bound` defines the smallest key at which the backward\\n\\n // iterator can return an entry. Once the bound is passed, Valid() will be\\n\\n // false. `iterate_lower_bound` is inclusive ie the bound value is a valid\\n\\n // entry.\\n\\n //\\n\\n // If prefix_extractor is not null, the Seek target and `iterate_lower_bound`\\n\\n // need to have the same prefix. This is because ordering is not guaranteed\\n\\n // outside of prefix domain.\\n\\n //\\n\\n // Default: nullptr\\n\\n const Slice* iterate_lower_bound;\\n\\n\\n\",\n \"file_path\": \"susy-rocksdb-sys/rocksdb/include/rocksdb/options.h\",\n \"rank\": 17,\n \"score\": 181594.05269545078\n },\n {\n \"content\": \"// Options that control flush operations\\n\\nstruct FlushOptions {\\n\\n // If true, the flush will wait until the flush is done.\\n\\n // Default: true\\n\\n bool wait;\\n\\n\\n\\n FlushOptions() : wait(true) {}\\n\\n};\\n\\n\\n\\n// Create a Logger from provided DBOptions\\n\\nextern Status CreateLoggerFromOptions(const std::string& dbname,\\n\\n const DBOptions& options,\\n\\n std::shared_ptr<Logger>* logger);\\n\\n\\n\",\n \"file_path\": \"susy-rocksdb-sys/rocksdb/include/rocksdb/options.h\",\n \"rank\": 18,\n \"score\": 181594.05269545078\n },\n {\n \"content\": \"// Options that control write operations\\n\\nstruct WriteOptions {\\n\\n // If true, the write will be flushed from the operating system\\n\\n // buffer cache (by calling WritableFile::Sync()) before the write\\n\\n // is considered complete. If this flag is true, writes will be\\n\\n // slower.\\n\\n //\\n\\n // If this flag is false, and the machine crashes, some recent\\n\\n // writes may be lost. Note that if it is just the process that\\n\\n // crashes (i.e., the machine does not reboot), no writes will be\\n\\n // lost even if sync==false.\\n\\n //\\n\\n // In other words, a DB write with sync==false has similar\\n\\n // crash semantics as the \\\"write()\\\" system call. A DB write\\n\\n // with sync==true has similar crash semantics to a \\\"write()\\\"\\n\\n // system call followed by \\\"fdatasync()\\\".\\n\\n //\\n\\n // Default: false\\n\\n bool sync;\\n\\n\\n\\n // If true, writes will not first go to the write ahead log,\\n\",\n \"file_path\": \"susy-rocksdb-sys/rocksdb/include/rocksdb/options.h\",\n \"rank\": 19,\n \"score\": 181594.05269545078\n },\n {\n \"content\": \"struct Options;\\n\\n\\n\",\n \"file_path\": \"susy-rocksdb-sys/rocksdb/include/rocksdb/advanced_options.h\",\n \"rank\": 20,\n \"score\": 181587.15677161235\n },\n {\n \"content\": \"struct DBOptions {\\n\\n // The function recovers options to the option as in version 4.6.\\n\\n DBOptions* OldDefaults(int rocksdb_major_version = 4,\\n\\n int rocksdb_minor_version = 6);\\n\\n\\n\\n // Some functions that make it easier to optimize RocksDB\\n\\n\\n\\n // Use this if your DB is very small (like under 1GB) and you don't want to\\n\\n // spend lots of memory for memtables.\\n\\n DBOptions* OptimizeForSmallDb();\\n\\n\\n\\n#ifndef ROCKSDB_LITE\\n\\n // By default, RocksDB uses only one background thread for flush and\\n\\n // compaction. Calling this function will set it up such that total of\\n\\n // `total_threads` is used. Good value for `total_threads` is the number of\\n\\n // cores. You almost definitely want to call this function if your system is\\n\\n // bottlenecked by RocksDB.\\n\\n DBOptions* IncreaseParallelism(int total_threads = 16);\\n\\n#endif // ROCKSDB_LITE\\n\\n\\n\",\n \"file_path\": \"susy-rocksdb-sys/rocksdb/include/rocksdb/options.h\",\n \"rank\": 21,\n \"score\": 181587.15677161235\n },\n {\n \"content\": \"#[test]\\n\\nfn options() {\\n\\n let mut opts = Options::new();\\n\\n assert!(opts.set_parsed_options(\\\"rate_limiter_bytes_per_sec=1024\\\").is_ok());\\n\\n}\\n\",\n \"file_path\": \"src/rocksdb.rs\",\n \"rank\": 22,\n \"score\": 180988.7460630066\n },\n {\n \"content\": \"struct CleanupContext {\\n\\n // List of values to be deleted, along with the key and deleter.\\n\\n autovector<CacheHandle> to_delete_value;\\n\\n\\n\\n // List of keys to be deleted.\\n\\n autovector<const char*> to_delete_key;\\n\\n};\\n\\n\\n\",\n \"file_path\": \"susy-rocksdb-sys/rocksdb/cache/clock_cache.cc\",\n \"rank\": 23,\n \"score\": 180506.00766139073\n },\n {\n \"content\": \"// Per-thread state for concurrent executions of the same benchmark.\\n\\nstruct ThreadState {\\n\\n uint32_t tid;\\n\\n Random rnd;\\n\\n SharedState* shared;\\n\\n\\n\\n ThreadState(uint32_t index, SharedState* _shared)\\n\\n : tid(index), rnd(1000 + index), shared(_shared) {}\\n\\n};\\n\\n} // namespace\\n\\n\\n\",\n \"file_path\": \"susy-rocksdb-sys/rocksdb/cache/cache_bench.cc\",\n \"rank\": 24,\n \"score\": 180506.00766139073\n },\n {\n \"content\": \"struct CacheRecord {\\n\\n CacheRecord() {}\\n\\n CacheRecord(const Slice& key, const Slice& val)\\n\\n : hdr_(MAGIC, static_cast<uint32_t>(key.size()),\\n\\n static_cast<uint32_t>(val.size())),\\n\\n key_(key),\\n\\n val_(val) {\\n\\n hdr_.crc_ = ComputeCRC();\\n\\n }\\n\\n\\n\\n uint32_t ComputeCRC() const;\\n\\n bool Serialize(std::vector<CacheWriteBuffer*>* bufs, size_t* woff);\\n\\n bool Deserialize(const Slice& buf);\\n\\n\\n\\n static uint32_t CalcSize(const Slice& key, const Slice& val) {\\n\\n return static_cast<uint32_t>(sizeof(CacheRecordHeader) + key.size() +\\n\\n val.size());\\n\\n }\\n\\n\\n\\n static const uint32_t MAGIC = 0xfefa;\\n\",\n \"file_path\": \"susy-rocksdb-sys/rocksdb/utilities/persistent_cache/block_cache_tier_file.cc\",\n \"rank\": 25,\n \"score\": 180169.70628233106\n },\n {\n \"content\": \"enum OptionSection : char {\\n\\n kOptionSectionVersion = 0,\\n\\n kOptionSectionDBOptions,\\n\\n kOptionSectionCFOptions,\\n\\n kOptionSectionTableOptions,\\n\\n kOptionSectionUnknown\\n\\n};\\n\\n\\n\\nstatic const std::string opt_section_titles[] = {\\n\\n \\\"Version\\\", \\\"DBOptions\\\", \\\"CFOptions\\\", \\\"TableOptions/\\\", \\\"Unknown\\\"};\\n\\n\\n\\nStatus PersistRocksDBOptions(const DBOptions& db_opt,\\n\\n const std::vector<std::string>& cf_names,\\n\\n const std::vector<ColumnFamilyOptions>& cf_opts,\\n\\n const std::string& file_name, Env* env);\\n\\n\\n\\nextern bool AreEqualOptions(\\n\\n const char* opt1, const char* opt2, const OptionTypeInfo& type_info,\\n\\n const std::string& opt_name,\\n\\n const std::unordered_map<std::string, std::string>* opt_map);\\n\\n\\n\",\n \"file_path\": \"susy-rocksdb-sys/rocksdb/options/options_parser.h\",\n \"rank\": 26,\n \"score\": 179861.8227482228\n },\n {\n \"content\": \"// CompactRangeOptions is used by CompactRange() call.\\n\\nstruct CompactRangeOptions {\\n\\n // If true, no other compaction will run at the same time as this\\n\\n // manual compaction\\n\\n bool exclusive_manual_compaction = true;\\n\\n // If true, compacted files will be moved to the minimum level capable\\n\\n // of holding the data or given level (specified non-negative target_level).\\n\\n bool change_level = false;\\n\\n // If change_level is true and target_level have non-negative value, compacted\\n\\n // files will be moved to target_level.\\n\\n int target_level = -1;\\n\\n // Compaction outputs will be placed in options.db_paths[target_path_id].\\n\\n // Behavior is undefined if target_path_id is out of range.\\n\\n uint32_t target_path_id = 0;\\n\\n // By default level based compaction will only compact the bottommost level\\n\\n // if there is a compaction filter\\n\\n BottommostLevelCompaction bottommost_level_compaction =\\n\\n BottommostLevelCompaction::kIfHaveCompactionFilter;\\n\\n // If true, will execute immediately even if doing so would cause the DB to\\n\\n // enter write stall mode. Otherwise, it'll sleep until load is low enough.\\n\\n bool allow_write_stall = false;\\n\\n // If > 0, it will replace the option in the DBOptions for this compaction.\\n\\n uint32_t max_subcompactions = 0;\\n\\n};\\n\\n\\n\",\n \"file_path\": \"susy-rocksdb-sys/rocksdb/include/rocksdb/options.h\",\n \"rank\": 27,\n \"score\": 179537.1725435744\n },\n {\n \"content\": \"// Compression options for different compression algorithms like Zlib\\n\\nstruct CompressionOptions {\\n\\n int window_bits;\\n\\n int level;\\n\\n int strategy;\\n\\n\\n\\n // Maximum size of dictionaries used to prime the compression library.\\n\\n // Enabling dictionary can improve compression ratios when there are\\n\\n // repetitions across data blocks.\\n\\n //\\n\\n // The dictionary is created by sampling the SST file data. If\\n\\n // `zstd_max_train_bytes` is nonzero, the samples are passed through zstd's\\n\\n // dictionary generator. Otherwise, the random samples are used directly as\\n\\n // the dictionary.\\n\\n //\\n\\n // When compression dictionary is disabled, we compress and write each block\\n\\n // before buffering data for the next one. When compression dictionary is\\n\\n // enabled, we buffer all SST file data in-memory so we can sample it, as data\\n\\n // can only be compressed and written after the dictionary has been finalized.\\n\\n // So users of this feature may see increased memory usage.\\n\\n //\\n\",\n \"file_path\": \"susy-rocksdb-sys/rocksdb/include/rocksdb/advanced_options.h\",\n \"rank\": 28,\n \"score\": 179530.2206135632\n },\n {\n \"content\": \"struct Options;\\n\",\n \"file_path\": \"susy-rocksdb-sys/rocksdb/include/rocksdb/utilities/leveldb_options.h\",\n \"rank\": 29,\n \"score\": 179523.48379431159\n },\n {\n \"content\": \"// Context information of a compaction run\\n\\nstruct CompactionFilterContext {\\n\\n // Does this compaction run include all data files\\n\\n bool is_full_compaction;\\n\\n // Is this compaction requested by the client (true),\\n\\n // or is it occurring as an automatic compaction process\\n\\n bool is_manual_compaction;\\n\\n};\\n\\n\\n\\n// CompactionFilter allows an application to modify/delete a key-value at\\n\\n// the time of compaction.\\n\\n\\n\",\n \"file_path\": \"susy-rocksdb-sys/rocksdb/include/rocksdb/compaction_filter.h\",\n \"rank\": 30,\n \"score\": 178579.83267578672\n },\n {\n \"content\": \"//\\n\\n// CacheRecord\\n\\n//\\n\\n// Cache record represents the record on disk\\n\\n//\\n\\n// +--------+---------+----------+------------+---------------+-------------+\\n\\n// | magic | crc | key size | value size | key data | value data |\\n\\n// +--------+---------+----------+------------+---------------+-------------+\\n\\n// <-- 4 --><-- 4 --><-- 4 --><-- 4 --><-- key size --><-- v-size -->\\n\\n//\\n\\nstruct CacheRecordHeader {\\n\\n CacheRecordHeader()\\n\\n : magic_(0), crc_(0), key_size_(0), val_size_(0) {}\\n\\n CacheRecordHeader(const uint32_t magic, const uint32_t key_size,\\n\\n const uint32_t val_size)\\n\\n : magic_(magic), crc_(0), key_size_(key_size), val_size_(val_size) {}\\n\\n\\n\\n uint32_t magic_;\\n\\n uint32_t crc_;\\n\\n uint32_t key_size_;\\n\\n uint32_t val_size_;\\n\\n};\\n\\n\\n\",\n \"file_path\": \"susy-rocksdb-sys/rocksdb/utilities/persistent_cache/block_cache_tier_file.cc\",\n \"rank\": 31,\n \"score\": 178547.0411531015\n },\n {\n \"content\": \"struct CompactionOptionsFIFO {\\n\\n // once the total sum of table files reaches this, we will delete the oldest\\n\\n // table file\\n\\n // Default: 1GB\\n\\n uint64_t max_table_files_size;\\n\\n\\n\\n // Drop files older than TTL. TTL based deletion will take precedence over\\n\\n // size based deletion if ttl > 0.\\n\\n // delete if sst_file_creation_time < (current_time - ttl)\\n\\n // unit: seconds. Ex: 1 day = 1 * 24 * 60 * 60\\n\\n // Default: 0 (disabled)\\n\\n uint64_t ttl = 0;\\n\\n\\n\\n // If true, try to do compaction to compact smaller files into larger ones.\\n\\n // Minimum files to compact follows options.level0_file_num_compaction_trigger\\n\\n // and compaction won't trigger if average compact bytes per del file is\\n\\n // larger than options.write_buffer_size. This is to protect large files\\n\\n // from being compacted again.\\n\\n // Default: false;\\n\\n bool allow_compaction = false;\\n\\n\\n\\n CompactionOptionsFIFO() : max_table_files_size(1 * 1024 * 1024 * 1024) {}\\n\\n CompactionOptionsFIFO(uint64_t _max_table_files_size, bool _allow_compaction,\\n\\n uint64_t _ttl = 0)\\n\\n : max_table_files_size(_max_table_files_size),\\n\\n ttl(_ttl),\\n\\n allow_compaction(_allow_compaction) {}\\n\\n};\\n\\n\\n\",\n \"file_path\": \"susy-rocksdb-sys/rocksdb/include/rocksdb/advanced_options.h\",\n \"rank\": 32,\n \"score\": 177524.11794527562\n },\n {\n \"content\": \"// Options to control the behavior of a database (passed to\\n\\n// DB::Open). A LevelDBOptions object can be initialized as though\\n\\n// it were a LevelDB Options object, and then it can be converted into\\n\\n// a RocksDB Options object.\\n\\nstruct LevelDBOptions {\\n\\n // -------------------\\n\\n // Parameters that affect behavior\\n\\n\\n\\n // Comparator used to define the order of keys in the table.\\n\\n // Default: a comparator that uses lexicographic byte-wise ordering\\n\\n //\\n\\n // REQUIRES: The client must ensure that the comparator supplied\\n\\n // here has the same name and orders keys *exactly* the same as the\\n\\n // comparator provided to previous open calls on the same DB.\\n\\n const Comparator* comparator;\\n\\n\\n\\n // If true, the database will be created if it is missing.\\n\\n // Default: false\\n\\n bool create_if_missing;\\n\\n\\n\\n // If true, an error is raised if the database already exists.\\n\\n // Default: false\\n\\n bool error_if_exists;\\n\\n\\n\",\n \"file_path\": \"susy-rocksdb-sys/rocksdb/include/rocksdb/utilities/leveldb_options.h\",\n \"rank\": 33,\n \"score\": 175594.09024255176\n },\n {\n \"content\": \"struct AdvancedColumnFamilyOptions {\\n\\n // The maximum number of write buffers that are built up in memory.\\n\\n // The default and the minimum number is 2, so that when 1 write buffer\\n\\n // is being flushed to storage, new writes can continue to the other\\n\\n // write buffer.\\n\\n // If max_write_buffer_number > 3, writing will be slowed down to\\n\\n // options.delayed_write_rate if we are writing to the last write buffer\\n\\n // allowed.\\n\\n //\\n\\n // Default: 2\\n\\n //\\n\\n // Dynamically changeable through SetOptions() API\\n\\n int max_write_buffer_number = 2;\\n\\n\\n\\n // The minimum number of write buffers that will be merged togsophy\\n\\n // before writing to storage. If set to 1, then\\n\\n // all write buffers are flushed to L0 as individual files and this increases\\n\\n // read amplification because a get request has to check in all of these\\n\\n // files. Also, an in-memory merge may result in writing lesser\\n\\n // data to storage if there are duplicate records in each of these\\n\",\n \"file_path\": \"susy-rocksdb-sys/rocksdb/include/rocksdb/advanced_options.h\",\n \"rank\": 34,\n \"score\": 175585.95938802726\n },\n {\n \"content\": \"//\\n\\n// Block Cache Tier Metadata\\n\\n//\\n\\n// The BlockCacheTierMetadata holds all the metadata associated with block\\n\\n// cache. It\\n\\n// fundamentally contains 2 indexes and an LRU.\\n\\n//\\n\\n// Block Cache Index\\n\\n//\\n\\n// This is a forward index that maps a given key to a LBA (Logical Block\\n\\n// Address). LBA is a disk pointer that points to a record on the cache.\\n\\n//\\n\\n// LBA = { cache-id, offset, size }\\n\\n//\\n\\n// Cache File Index\\n\\n//\\n\\n// This is a forward index that maps a given cache-id to a cache file object.\\n\\n// Typically you would lookup using LBA and use the object to read or write\\n\\nstruct BlockInfo {\\n\\n explicit BlockInfo(const Slice& key, const LBA& lba = LBA())\\n\\n : key_(key.ToString()), lba_(lba) {}\\n\\n\\n\\n std::string key_;\\n\\n LBA lba_;\\n\\n};\\n\\n\\n\",\n \"file_path\": \"susy-rocksdb-sys/rocksdb/utilities/persistent_cache/block_cache_tier_metadata.h\",\n \"rank\": 35,\n \"score\": 174670.405918601\n },\n {\n \"content\": \"struct BlockInfo;\\n\\n\\n\",\n \"file_path\": \"susy-rocksdb-sys/rocksdb/utilities/persistent_cache/block_cache_tier_file.h\",\n \"rank\": 36,\n \"score\": 174655.1499024587\n },\n {\n \"content\": \"// Represents a logical record on device\\n\\n//\\n\\n// (L)ogical (B)lock (Address = { cache-file-id, offset, size }\\n\\nstruct LogicalBlockAddress {\\n\\n LogicalBlockAddress() {}\\n\\n explicit LogicalBlockAddress(const uint32_t cache_id, const uint32_t off,\\n\\n const uint16_t size)\\n\\n : cache_id_(cache_id), off_(off), size_(size) {}\\n\\n\\n\\n uint32_t cache_id_ = 0;\\n\\n uint32_t off_ = 0;\\n\\n uint32_t size_ = 0;\\n\\n};\\n\\n\\n\\ntypedef LogicalBlockAddress LBA;\\n\\n\\n\",\n \"file_path\": \"susy-rocksdb-sys/rocksdb/utilities/persistent_cache/block_cache_tier_file.h\",\n \"rank\": 37,\n \"score\": 172826.90917079948\n },\n {\n \"content\": \"struct Options;\\n\",\n \"file_path\": \"susy-rocksdb-sys/rocksdb/db/builder.h\",\n \"rank\": 38,\n \"score\": 172209.98306923162\n },\n {\n \"content\": \"struct Options;\\n\",\n \"file_path\": \"susy-rocksdb-sys/rocksdb/include/rocksdb/db.h\",\n \"rank\": 39,\n \"score\": 169686.92687313867\n },\n {\n \"content\": \"struct ReadOptions;\\n\\n\\n\\nextern bool ShouldReportDetailedTime(Env* env, Statistics* stats);\\n\\n\\n\\n// the length of the magic number in bytes.\\n\\nconst int kMagicNumberLengthByte = 8;\\n\\n\\n\",\n \"file_path\": \"susy-rocksdb-sys/rocksdb/table/format.h\",\n \"rank\": 40,\n \"score\": 169686.92687313867\n },\n {\n \"content\": \"struct EnvOptions;\\n\",\n \"file_path\": \"susy-rocksdb-sys/rocksdb/db/builder.h\",\n \"rank\": 41,\n \"score\": 169686.92687313867\n },\n {\n \"content\": \"struct Options;\\n\\n\\n\\nusing std::unique_ptr;\\n\\n\\n\",\n \"file_path\": \"susy-rocksdb-sys/rocksdb/include/rocksdb/table.h\",\n \"rank\": 42,\n \"score\": 169686.92687313867\n },\n {\n \"content\": \"struct FileDescriptor;\\n\",\n \"file_path\": \"susy-rocksdb-sys/rocksdb/db/table_cache.h\",\n \"rank\": 43,\n \"score\": 168066.9467432976\n },\n {\n \"content\": \"struct JobContext;\\n\",\n \"file_path\": \"susy-rocksdb-sys/rocksdb/db/db_impl.h\",\n \"rank\": 44,\n \"score\": 167993.93202401337\n },\n {\n \"content\": \"struct rocksdb_options_t { Options rep; };\\n\",\n \"file_path\": \"susy-rocksdb-sys/rocksdb/db/c.cc\",\n \"rank\": 45,\n \"score\": 167925.1125480077\n },\n {\n \"content\": \"//\\n\\n// An application can issue a read request (via Get/Iterators) and specify\\n\\n// if that read should process data that ALREADY resides on a specified cache\\n\\n// level. For example, if an application specifies kBlockCacheTier then the\\n\\n// Get call will process data that is already processed in the memtable or\\n\\n// the block cache. It will not page in data from the OS cache or data that\\n\\n// resides in storage.\\n\\nenum ReadTier {\\n\\n kReadAllTier = 0x0, // data in memtable, block cache, OS cache or storage\\n\\n kBlockCacheTier = 0x1, // data in memtable or block cache\\n\\n kPersistedTier = 0x2, // persisted data. When WAL is disabled, this option\\n\\n // will skip data in memtable.\\n\\n // Note that this ReadTier currently only supports\\n\\n // Get and MultiGet and does not support iterators.\\n\\n kMemtableTier = 0x3 // data in memtable. used for memtable-only iterators.\\n\\n};\\n\\n\\n\",\n \"file_path\": \"susy-rocksdb-sys/rocksdb/include/rocksdb/options.h\",\n \"rank\": 46,\n \"score\": 167764.1765036183\n },\n {\n \"content\": \"// Options while opening a file to read/write\\n\\nstruct EnvOptions {\\n\\n\\n\\n // Construct with default Options\\n\\n EnvOptions();\\n\\n\\n\\n // Construct from Options\\n\\n explicit EnvOptions(const DBOptions& options);\\n\\n\\n\\n // If true, then use mmap to read data\\n\\n bool use_mmap_reads = false;\\n\\n\\n\\n // If true, then use mmap to write data\\n\\n bool use_mmap_writes = true;\\n\\n\\n\\n // If true, then use O_DIRECT for reading data\\n\\n bool use_direct_reads = false;\\n\\n\\n\\n // If true, then use O_DIRECT for writing data\\n\\n bool use_direct_writes = false;\\n\\n\\n\",\n \"file_path\": \"susy-rocksdb-sys/rocksdb/include/rocksdb/env.h\",\n \"rank\": 47,\n \"score\": 167268.05253253313\n },\n {\n \"content\": \"struct rocksdb_optimistictransaction_options_t {\\n\\n OptimisticTransactionOptions rep;\\n\\n};\\n\\n\\n\",\n \"file_path\": \"susy-rocksdb-sys/rocksdb/db/c.cc\",\n \"rank\": 48,\n \"score\": 167261.21047205682\n },\n {\n \"content\": \"struct WriteOptions;\\n\",\n \"file_path\": \"susy-rocksdb-sys/rocksdb/include/rocksdb/db.h\",\n \"rank\": 49,\n \"score\": 167261.21047205682\n },\n {\n \"content\": \"struct CompactionOptions;\\n\",\n \"file_path\": \"susy-rocksdb-sys/rocksdb/include/rocksdb/db.h\",\n \"rank\": 50,\n \"score\": 167261.21047205682\n },\n {\n \"content\": \"struct rocksdb_transactiondb_options_t {\\n\\n TransactionDBOptions rep;\\n\\n};\\n\",\n \"file_path\": \"susy-rocksdb-sys/rocksdb/db/c.cc\",\n \"rank\": 51,\n \"score\": 167261.21047205682\n },\n {\n \"content\": \"struct ReadOptions;\\n\",\n \"file_path\": \"susy-rocksdb-sys/rocksdb/table/table_reader.h\",\n \"rank\": 52,\n \"score\": 167261.21047205682\n },\n {\n \"content\": \"struct Options;\\n\",\n \"file_path\": \"susy-rocksdb-sys/rocksdb/table/plain_table_reader.h\",\n \"rank\": 53,\n \"score\": 167261.21047205682\n },\n {\n \"content\": \"struct DbPath {\\n\\n std::string path;\\n\\n uint64_t target_size; // Target size of total files under the path, in byte.\\n\\n\\n\\n DbPath() : target_size(0) {}\\n\\n DbPath(const std::string& p, uint64_t t) : path(p), target_size(t) {}\\n\\n};\\n\\n\\n\\n\\n\",\n \"file_path\": \"susy-rocksdb-sys/rocksdb/include/rocksdb/options.h\",\n \"rank\": 54,\n \"score\": 167261.21047205682\n },\n {\n \"content\": \"struct DbPath;\\n\\n\\n\",\n \"file_path\": \"susy-rocksdb-sys/rocksdb/include/rocksdb/options.h\",\n \"rank\": 55,\n \"score\": 167261.21047205682\n },\n {\n \"content\": \"struct rocksdb_transaction_options_t {\\n\\n TransactionOptions rep;\\n\\n};\\n\",\n \"file_path\": \"susy-rocksdb-sys/rocksdb/db/c.cc\",\n \"rank\": 56,\n \"score\": 167261.21047205682\n },\n {\n \"content\": \"struct EnvOptions;\\n\",\n \"file_path\": \"susy-rocksdb-sys/rocksdb/include/rocksdb/table.h\",\n \"rank\": 57,\n \"score\": 167261.21047205682\n },\n {\n \"content\": \"struct DBOptions;\\n\",\n \"file_path\": \"susy-rocksdb-sys/rocksdb/include/rocksdb/env.h\",\n \"rank\": 58,\n \"score\": 167261.21047205682\n },\n {\n \"content\": \"struct ReadOptions;\\n\",\n \"file_path\": \"susy-rocksdb-sys/rocksdb/include/rocksdb/db.h\",\n \"rank\": 59,\n \"score\": 167261.21047205682\n },\n {\n \"content\": \"struct FlushOptions;\\n\",\n \"file_path\": \"susy-rocksdb-sys/rocksdb/include/rocksdb/db.h\",\n \"rank\": 60,\n \"score\": 167261.21047205682\n },\n {\n \"content\": \"struct DBOptions;\\n\",\n \"file_path\": \"susy-rocksdb-sys/rocksdb/include/rocksdb/db.h\",\n \"rank\": 61,\n \"score\": 167261.21047205682\n },\n {\n \"content\": \"struct ColumnFamilyOptions : public AdvancedColumnFamilyOptions {\\n\\n // The function recovers options to a previous version. Only 4.6 or later\\n\\n // versions are supported.\\n\\n ColumnFamilyOptions* OldDefaults(int rocksdb_major_version = 4,\\n\\n int rocksdb_minor_version = 6);\\n\\n\\n\\n // Some functions that make it easier to optimize RocksDB\\n\\n // Use this if your DB is very small (like under 1GB) and you don't want to\\n\\n // spend lots of memory for memtables.\\n\\n ColumnFamilyOptions* OptimizeForSmallDb();\\n\\n\\n\\n // Use this if you don't need to keep the data sorted, i.e. you'll never use\\n\\n // an iterator, only Put() and Get() API calls\\n\\n //\\n\\n // Not supported in ROCKSDB_LITE\\n\\n ColumnFamilyOptions* OptimizeForPointLookup(\\n\\n uint64_t block_cache_size_mb);\\n\\n\\n\\n // Default values for some parameters in ColumnFamilyOptions are not\\n\\n // optimized for heavy workloads and big datasets, which means you might\\n\",\n \"file_path\": \"susy-rocksdb-sys/rocksdb/include/rocksdb/options.h\",\n \"rank\": 62,\n \"score\": 165915.62589989576\n },\n {\n \"content\": \"struct LRUElement {\\n\\n explicit LRUElement() : next_(nullptr), prev_(nullptr), refs_(0) {}\\n\\n\\n\\n virtual ~LRUElement() { assert(!refs_); }\\n\\n\\n\\n T* next_;\\n\\n T* prev_;\\n\\n std::atomic<size_t> refs_;\\n\\n};\\n\\n\\n\\n// LRU implementation\\n\\n//\\n\\n// In place LRU implementation. There is no copy or allocation involved when\\n\\n// inserting or removing an element. This makes the data structure slim\\n\\ntemplate <class T>\\n\",\n \"file_path\": \"susy-rocksdb-sys/rocksdb/utilities/persistent_cache/lrulist.h\",\n \"rank\": 63,\n \"score\": 165717.7951194635\n },\n {\n \"content\": \"struct BlockContents;\\n\\n\\n\",\n \"file_path\": \"susy-rocksdb-sys/rocksdb/table/persistent_cache_helper.h\",\n \"rank\": 64,\n \"score\": 165717.7951194635\n },\n {\n \"content\": \"struct MemTableInfo;\\n\\n\\n\",\n \"file_path\": \"susy-rocksdb-sys/rocksdb/db/db_impl.h\",\n \"rank\": 65,\n \"score\": 165646.1622032075\n },\n {\n \"content\": \"struct IterState {\\n\\n IterState(DBImpl* _db, InstrumentedMutex* _mu, SuperVersion* _super_version,\\n\\n bool _background_purge)\\n\\n : db(_db),\\n\\n mu(_mu),\\n\\n super_version(_super_version),\\n\\n background_purge(_background_purge) {}\\n\\n\\n\\n DBImpl* db;\\n\\n InstrumentedMutex* mu;\\n\\n SuperVersion* super_version;\\n\\n bool background_purge;\\n\\n};\\n\\n\\n\\nstatic void CleanupIteratorState(void* arg1, void* /*arg2*/) {\\n\\n IterState* state = reinterpret_cast<IterState*>(arg1);\\n\\n\\n\\n if (state->super_version->Unref()) {\\n\\n // Job id == 0 means that this is not our background process, but rather\\n\\n // user thread\\n\",\n \"file_path\": \"susy-rocksdb-sys/rocksdb/db/db_impl.cc\",\n \"rank\": 66,\n \"score\": 165646.1622032075\n },\n {\n \"content\": \"// Options for customizing ldb tool (beyond the DB Options)\\n\\nstruct LDBOptions {\\n\\n // Create LDBOptions with default values for all fields\\n\\n LDBOptions();\\n\\n\\n\\n // Key formatter that converts a slice to a readable string.\\n\\n // Default: Slice::ToString()\\n\\n std::shared_ptr<SliceFormatter> key_formatter;\\n\\n\\n\\n std::string print_help_header = \\\"ldb - RocksDB Tool\\\";\\n\\n};\\n\\n\\n\",\n \"file_path\": \"susy-rocksdb-sys/rocksdb/include/rocksdb/ldb_tool.h\",\n \"rank\": 67,\n \"score\": 164935.10546252917\n },\n {\n \"content\": \"struct TableBuilderOptions {\\n\\n TableBuilderOptions(\\n\\n const ImmutableCFOptions& _ioptions,\\n\\n const InternalKeyComparator& _internal_comparator,\\n\\n const std::vector<std::unique_ptr<IntTblPropCollectorFactory>>*\\n\\n _int_tbl_prop_collector_factories,\\n\\n CompressionType _compression_type,\\n\\n const CompressionOptions& _compression_opts,\\n\\n const std::string* _compression_dict, bool _skip_filters,\\n\\n const std::string& _column_family_name, int _level,\\n\\n const uint64_t _creation_time = 0, const int64_t _oldest_key_time = 0)\\n\\n : ioptions(_ioptions),\\n\\n internal_comparator(_internal_comparator),\\n\\n int_tbl_prop_collector_factories(_int_tbl_prop_collector_factories),\\n\\n compression_type(_compression_type),\\n\\n compression_opts(_compression_opts),\\n\\n compression_dict(_compression_dict),\\n\\n skip_filters(_skip_filters),\\n\\n column_family_name(_column_family_name),\\n\\n level(_level),\\n\",\n \"file_path\": \"susy-rocksdb-sys/rocksdb/table/table_builder.h\",\n \"rank\": 68,\n \"score\": 164927.30740126083\n },\n {\n \"content\": \"struct Options;\\n\\n\\n\",\n \"file_path\": \"susy-rocksdb-sys/rocksdb/include/rocksdb/flush_block_policy.h\",\n \"rank\": 69,\n \"score\": 164927.30740126083\n },\n {\n \"content\": \"struct ReadOptions;\\n\",\n \"file_path\": \"susy-rocksdb-sys/rocksdb/table/two_level_iterator.h\",\n \"rank\": 70,\n \"score\": 164927.30740126083\n },\n {\n \"content\": \"struct CompactRangeOptions;\\n\",\n \"file_path\": \"susy-rocksdb-sys/rocksdb/include/rocksdb/db.h\",\n \"rank\": 71,\n \"score\": 164927.30740126083\n },\n {\n \"content\": \"struct TableReaderOptions {\\n\\n // @param skip_filters Disables loading/accessing the filter block\\n\\n TableReaderOptions(const ImmutableCFOptions& _ioptions,\\n\\n const EnvOptions& _env_options,\\n\\n const InternalKeyComparator& _internal_comparator,\\n\\n bool _skip_filters = false, int _level = -1)\\n\\n : ioptions(_ioptions),\\n\\n env_options(_env_options),\\n\\n internal_comparator(_internal_comparator),\\n\\n skip_filters(_skip_filters),\\n\\n level(_level) {}\\n\\n\\n\\n const ImmutableCFOptions& ioptions;\\n\\n const EnvOptions& env_options;\\n\\n const InternalKeyComparator& internal_comparator;\\n\\n // This is only used for BlockBasedTable (reader)\\n\\n bool skip_filters;\\n\\n // what level this table/file is on, -1 for \\\"not set, don't know\\\"\\n\\n int level;\\n\\n};\\n\\n\\n\",\n \"file_path\": \"susy-rocksdb-sys/rocksdb/table/table_builder.h\",\n \"rank\": 72,\n \"score\": 164927.30740126083\n },\n {\n \"content\": \"struct ColumnFamilyOptions;\\n\",\n \"file_path\": \"susy-rocksdb-sys/rocksdb/include/rocksdb/db.h\",\n \"rank\": 73,\n \"score\": 164927.30740126083\n },\n {\n \"content\": \"struct ImmutableMemTableOptions {\\n\\n explicit ImmutableMemTableOptions(const ImmutableCFOptions& ioptions,\\n\\n const MutableCFOptions& mutable_cf_options);\\n\\n size_t arena_block_size;\\n\\n uint32_t memtable_prefix_bloom_bits;\\n\\n size_t memtable_huge_page_size;\\n\\n bool inplace_update_support;\\n\\n size_t inplace_update_num_locks;\\n\\n UpdateStatus (*inplace_callback)(char* existing_value,\\n\\n uint32_t* existing_value_size,\\n\\n Slice delta_value,\\n\\n std::string* merged_value);\\n\\n size_t max_successive_merges;\\n\\n Statistics* statistics;\\n\\n MergeOperator* merge_operator;\\n\\n Logger* info_log;\\n\\n};\\n\\n\\n\",\n \"file_path\": \"susy-rocksdb-sys/rocksdb/db/memtable.h\",\n \"rank\": 74,\n \"score\": 164927.30740126083\n },\n {\n \"content\": \"struct ReadOptions;\\n\",\n \"file_path\": \"susy-rocksdb-sys/rocksdb/table/plain_table_reader.h\",\n \"rank\": 75,\n \"score\": 164927.30740126083\n },\n {\n \"content\": \"struct TableReaderOptions;\\n\",\n \"file_path\": \"susy-rocksdb-sys/rocksdb/include/rocksdb/table.h\",\n \"rank\": 76,\n \"score\": 164927.30740126083\n },\n {\n \"content\": \"struct TableBuilderOptions;\\n\",\n \"file_path\": \"susy-rocksdb-sys/rocksdb/include/rocksdb/table.h\",\n \"rank\": 77,\n \"score\": 164927.30740126083\n },\n {\n \"content\": \"struct ImmutableDBOptions;\\n\",\n \"file_path\": \"susy-rocksdb-sys/rocksdb/include/rocksdb/env.h\",\n \"rank\": 78,\n \"score\": 164927.30740126083\n },\n {\n \"content\": \"struct MutableDBOptions;\\n\",\n \"file_path\": \"susy-rocksdb-sys/rocksdb/include/rocksdb/env.h\",\n \"rank\": 79,\n \"score\": 164927.30740126083\n },\n {\n \"content\": \"struct OptionsOverride {\\n\\n std::shared_ptr<const FilterPolicy> filter_policy = nullptr;\\n\\n // These will be used only if filter_policy is set\\n\\n bool partition_filters = false;\\n\\n uint64_t metadata_block_size = 1024;\\n\\n BlockBasedTableOptions::IndexType index_type =\\n\\n BlockBasedTableOptions::IndexType::kBinarySearch;\\n\\n\\n\\n // Used as a bit mask of individual enums in which to skip an XF test point\\n\\n int skip_policy = 0;\\n\\n};\\n\\n\\n\\n} // namespace anon\\n\\n\\n\",\n \"file_path\": \"susy-rocksdb-sys/rocksdb/db/db_test_util.h\",\n \"rank\": 80,\n \"score\": 164927.30740126083\n },\n {\n \"content\": \"struct rocksdb_universal_compaction_options_t {\\n\\n rocksdb::CompactionOptionsUniversal *rep;\\n\\n};\\n\\n\\n\\nstatic bool SaveError(char** errptr, const Status& s) {\\n\\n assert(errptr != nullptr);\\n\\n if (s.ok()) {\\n\\n return false;\\n\\n } else if (*errptr == nullptr) {\\n\\n *errptr = strdup(s.ToString().c_str());\\n\\n } else {\\n\\n // TODO(sanjay): Merge with existing error?\\n\\n // This is a bug if *errptr is not created by malloc()\\n\\n free(*errptr);\\n\\n *errptr = strdup(s.ToString().c_str());\\n\\n }\\n\\n return true;\\n\\n}\\n\\n\\n\\nstatic char* CopyString(const std::string& str) {\\n\",\n \"file_path\": \"susy-rocksdb-sys/rocksdb/db/c.cc\",\n \"rank\": 81,\n \"score\": 164927.30740126083\n },\n {\n \"content\": \"struct EnvOptions;\\n\\n\\n\\nusing std::unique_ptr;\\n\",\n \"file_path\": \"susy-rocksdb-sys/rocksdb/table/adaptive_table_factory.h\",\n \"rank\": 82,\n \"score\": 164927.30740126083\n },\n {\n \"content\": \"struct EnvOptions;\\n\\n\\n\\nusing std::unique_ptr;\\n\",\n \"file_path\": \"susy-rocksdb-sys/rocksdb/table/plain_table_factory.h\",\n \"rank\": 83,\n \"score\": 164927.30740126083\n },\n {\n \"content\": \"struct PlainTableOptions {\\n\\n // @user_key_len: plain table has optimization for fix-sized keys, which can\\n\\n // be specified via user_key_len. Alternatively, you can pass\\n\\n // `kPlainTableVariableLength` if your keys have variable\\n\\n // lengths.\\n\\n uint32_t user_key_len = kPlainTableVariableLength;\\n\\n\\n\\n // @bloom_bits_per_key: the number of bits used for bloom filer per prefix.\\n\\n // You may disable it by passing a zero.\\n\\n int bloom_bits_per_key = 10;\\n\\n\\n\\n // @hash_table_ratio: the desired utilization of the hash table used for\\n\\n // prefix hashing.\\n\\n // hash_table_ratio = number of prefixes / #buckets in the\\n\\n // hash table\\n\\n double hash_table_ratio = 0.75;\\n\\n\\n\\n // @index_sparseness: inside each prefix, need to build one index record for\\n\\n // how many keys for binary search inside each hash bucket.\\n\\n // For encoding type kPrefix, the value will be used when\\n\",\n \"file_path\": \"susy-rocksdb-sys/rocksdb/include/rocksdb/table.h\",\n \"rank\": 84,\n \"score\": 164927.30740126083\n },\n {\n \"content\": \"struct CuckooTableOptions {\\n\\n // Determines the utilization of hash tables. Smaller values\\n\\n // result in larger hash tables with fewer collisions.\\n\\n double hash_table_ratio = 0.9;\\n\\n // A property used by builder to determine the depth to go to\\n\\n // to search for a path to displace elements in case of\\n\\n // collision. See Builder.MakeSpaceForKey method. Higher\\n\\n // values result in more efficient hash tables with fewer\\n\\n // lookups but take more time to build.\\n\\n uint32_t max_search_depth = 100;\\n\\n // In case of collision while inserting, the builder\\n\\n // attempts to insert in the next cuckoo_block_size\\n\\n // locations before skipping over to the next Cuckoo hash\\n\\n // function. This makes lookups more cache friendly in case\\n\\n // of collisions.\\n\\n uint32_t cuckoo_block_size = 5;\\n\\n // If this option is enabled, user key is treated as uint64_t and its value\\n\\n // is used as hash value directly. This option changes builder's behavior.\\n\\n // Reader ignore this option and behave according to what specified in table\\n\\n // property.\\n\",\n \"file_path\": \"susy-rocksdb-sys/rocksdb/include/rocksdb/table.h\",\n \"rank\": 85,\n \"score\": 164927.30740126083\n },\n {\n \"content\": \"struct rocksdb_restore_options_t { RestoreOptions rep; };\\n\",\n \"file_path\": \"susy-rocksdb-sys/rocksdb/db/c.cc\",\n \"rank\": 86,\n \"score\": 163987.58814172336\n },\n {\n \"content\": \"struct ExternalFileIngestionInfo {\\n\\n // the name of the column family\\n\\n std::string cf_name;\\n\\n // Path of the file outside the DB\\n\\n std::string external_file_path;\\n\\n // Path of the file inside the DB\\n\\n std::string internal_file_path;\\n\\n // The global sequence number assigned to keys in this file\\n\\n SequenceNumber global_seqno;\\n\\n // Table properties of the table being flushed\\n\\n TableProperties table_properties;\\n\\n};\\n\\n\\n\",\n \"file_path\": \"susy-rocksdb-sys/rocksdb/include/rocksdb/listener.h\",\n \"rank\": 87,\n \"score\": 163591.41145768674\n },\n {\n \"content\": \"struct ExternalSstFileInfo;\\n\",\n \"file_path\": \"susy-rocksdb-sys/rocksdb/include/rocksdb/db.h\",\n \"rank\": 88,\n \"score\": 163591.41145768674\n },\n {\n \"content\": \"// Options to control the behavior of a database (passed to DB::Open)\\n\\nstruct Options : public DBOptions, public ColumnFamilyOptions {\\n\\n // Create an Options object with default values for all fields.\\n\\n Options() : DBOptions(), ColumnFamilyOptions() {}\\n\\n\\n\\n Options(const DBOptions& db_options,\\n\\n const ColumnFamilyOptions& column_family_options)\\n\\n : DBOptions(db_options), ColumnFamilyOptions(column_family_options) {}\\n\\n\\n\\n // The function recovers options to the option as in version 4.6.\\n\\n Options* OldDefaults(int rocksdb_major_version = 4,\\n\\n int rocksdb_minor_version = 6);\\n\\n\\n\\n void Dump(Logger* log) const;\\n\\n\\n\\n void DumpCFOptions(Logger* log) const;\\n\\n\\n\\n // Some functions that make it easier to optimize RocksDB\\n\\n\\n\\n // Set appropriate parameters for bulk loading.\\n\\n // The reason that this is a function that returns \\\"this\\\" instead of a\\n\",\n \"file_path\": \"susy-rocksdb-sys/rocksdb/include/rocksdb/options.h\",\n \"rank\": 89,\n \"score\": 163485.27615073015\n },\n {\n \"content\": \"struct WriteOptions;\\n\\n\\n\\nOptimisticTransaction::OptimisticTransaction(\\n\\n OptimisticTransactionDB* txn_db, const WriteOptions& write_options,\\n\\n const OptimisticTransactionOptions& txn_options)\\n\\n : TransactionBaseImpl(txn_db->GetBaseDB(), write_options), txn_db_(txn_db) {\\n\\n Initialize(txn_options);\\n\\n}\\n\\n\\n\\nvoid OptimisticTransaction::Initialize(\\n\\n const OptimisticTransactionOptions& txn_options) {\\n\\n if (txn_options.set_snapshot) {\\n\\n SetSnapshot();\\n\\n }\\n\\n}\\n\\n\\n\\nvoid OptimisticTransaction::Reinitialize(\\n\\n OptimisticTransactionDB* txn_db, const WriteOptions& write_options,\\n\\n const OptimisticTransactionOptions& txn_options) {\\n\\n TransactionBaseImpl::Reinitialize(txn_db->GetBaseDB(), write_options);\\n\",\n \"file_path\": \"susy-rocksdb-sys/rocksdb/utilities/transactions/optimistic_transaction.cc\",\n \"rank\": 90,\n \"score\": 162680.10177896434\n },\n {\n \"content\": \"struct ComparatorJniCallbackOptions {\\n\\n // Use adaptive mutex, which spins in the user space before resorting\\n\\n // to kernel. This could reduce context switch when the mutex is not\\n\\n // heavily contended. However, if the mutex is hot, we could end up\\n\\n // wasting spin time.\\n\\n // Default: false\\n\\n bool use_adaptive_mutex;\\n\\n\\n\\n ComparatorJniCallbackOptions() : use_adaptive_mutex(false) {\\n\\n }\\n\\n};\\n\\n\\n\\n/**\\n\\n * This class acts as a bridge between C++\\n\\n * and Java. The methods in this class will be\\n\\n * called back from the RocksDB storage engine (C++)\\n\\n * we then callback to the appropriate Java method\\n\\n * this enables Comparators to be implemented in Java.\\n\\n *\\n\\n * The design of this Comparator caches the Java Slice\\n\\n * objects that are used in the compare and findShortestSeparator\\n\\n * method callbacks. Instead of creating new objects for each callback\\n\\n * of those functions, by reuse via setHandle we are a lot\\n\\n * faster; Unfortunately this means that we have to\\n\\n * introduce independent locking in regions of each of those methods\\n\\n * via the mutexs mtx_compare and mtx_findShortestSeparator respectively\\n\\n */\\n\",\n \"file_path\": \"susy-rocksdb-sys/rocksdb/java/rocksjni/comparatorjnicallback.h\",\n \"rank\": 91,\n \"score\": 162680.10177896434\n },\n {\n \"content\": \"// For advanced user only\\n\\nstruct BlockBasedTableOptions {\\n\\n // @flush_block_policy_factory creates the instances of flush block policy.\\n\\n // which provides a configurable way to determine when to flush a block in\\n\\n // the block based tables. If not set, table builder will use the default\\n\\n // block flush policy, which cut blocks by block size (please refer to\\n\\n // `FlushBlockBySizePolicy`).\\n\\n std::shared_ptr<FlushBlockPolicyFactory> flush_block_policy_factory;\\n\\n\\n\\n // TODO(kailiu) Temporarily disable this feature by making the default value\\n\\n // to be false.\\n\\n //\\n\\n // Indicating if we'd put index/filter blocks to the block cache.\\n\\n // If not specified, each \\\"table reader\\\" object will pre-load index/filter\\n\\n // block during table initialization.\\n\\n bool cache_index_and_filter_blocks = false;\\n\\n\\n\\n // If cache_index_and_filter_blocks is enabled, cache index and filter\\n\\n // blocks with high priority. If set to true, depending on implementation of\\n\\n // block cache, index and filter blocks may be less likely to be evicted\\n\\n // than data blocks.\\n\",\n \"file_path\": \"susy-rocksdb-sys/rocksdb/include/rocksdb/table.h\",\n \"rank\": 92,\n \"score\": 162680.10177896434\n },\n {\n \"content\": \"struct RestoreOptions {\\n\\n // If true, restore won't overwrite the existing log files in wal_dir. It will\\n\\n // also move all log files from archive directory to wal_dir. Use this option\\n\\n // in combination with BackupableDBOptions::backup_log_files = false for\\n\\n // persisting in-memory databases.\\n\\n // Default: false\\n\\n bool keep_log_files;\\n\\n\\n\\n explicit RestoreOptions(bool _keep_log_files = false)\\n\\n : keep_log_files(_keep_log_files) {}\\n\\n};\\n\\n\\n\\ntypedef uint32_t BackupID;\\n\\n\\n\",\n \"file_path\": \"susy-rocksdb-sys/rocksdb/include/rocksdb/utilities/backupable_db.h\",\n \"rank\": 93,\n \"score\": 162680.10177896434\n },\n {\n \"content\": \"struct DumpOptions {\\n\\n // Database that will be dumped\\n\\n std::string db_path;\\n\\n // File location that will contain dump output\\n\\n std::string dump_location;\\n\\n // Don't include db information header in the dump\\n\\n bool anonymous = false;\\n\\n};\\n\\n\\n\",\n \"file_path\": \"susy-rocksdb-sys/rocksdb/include/rocksdb/db_dump_tool.h\",\n \"rank\": 94,\n \"score\": 162680.10177896434\n },\n {\n \"content\": \"struct UndumpOptions {\\n\\n // Database that we will load the dumped file into\\n\\n std::string db_path;\\n\\n // File location of the dumped file that will be loaded\\n\\n std::string dump_location;\\n\\n // Compact the db after loading the dumped file\\n\\n bool compact_db = false;\\n\\n};\\n\\n\\n\",\n \"file_path\": \"susy-rocksdb-sys/rocksdb/include/rocksdb/db_dump_tool.h\",\n \"rank\": 95,\n \"score\": 162680.10177896434\n },\n {\n \"content\": \"struct EnvOptions;\\n\",\n \"file_path\": \"susy-rocksdb-sys/rocksdb/table/block_based_table_reader.h\",\n \"rank\": 96,\n \"score\": 162680.10177896434\n },\n {\n \"content\": \"struct EnvOptions;\\n\\n\\n\\nusing std::unique_ptr;\\n\",\n \"file_path\": \"susy-rocksdb-sys/rocksdb/table/block_based_table_factory.h\",\n \"rank\": 97,\n \"score\": 162680.10177896434\n },\n {\n \"content\": \"struct ReadOptions;\\n\",\n \"file_path\": \"susy-rocksdb-sys/rocksdb/table/block_based_table_reader.h\",\n \"rank\": 98,\n \"score\": 162680.10177896434\n },\n {\n \"content\": \"struct TransactionOptions {\\n\\n // Setting set_snapshot=true is the same as calling\\n\\n // Transaction::SetSnapshot().\\n\\n bool set_snapshot = false;\\n\\n\\n\\n // Setting to true means that before acquiring locks, this transaction will\\n\\n // check if doing so will cause a deadlock. If so, it will return with\\n\\n // Status::Busy. The user should retry their transaction.\\n\\n bool deadlock_detect = false;\\n\\n\\n\\n // If set, it states that the CommitTimeWriteBatch represents the latest state\\n\\n // of the application, has only one sub-batch, i.e., no duplicate keys, and\\n\\n // meant to be used later during recovery. It enables an optimization to\\n\\n // postpone updating the memtable with CommitTimeWriteBatch to only\\n\\n // SwitchMemtable or recovery.\\n\\n bool use_only_the_last_commit_time_batch_for_recovery = false;\\n\\n\\n\\n // TODO(agiardullo): TransactionDB does not yet support comparators that allow\\n\\n // two non-equal keys to be equivalent. Ie, cmp->Compare(a,b) should only\\n\\n // return 0 if\\n\",\n \"file_path\": \"susy-rocksdb-sys/rocksdb/include/rocksdb/utilities/transaction_db.h\",\n \"rank\": 99,\n \"score\": 162680.10177896434\n }\n]","isConversational":false}}},{"rowIdx":2365,"cells":{"lang":{"kind":"string","value":"Rust"},"file_path":{"kind":"string","value":"src/lib.rs"},"repo_name":{"kind":"string","value":"newAM/clap-num"},"commit":{"kind":"string","value":"7d23825a4976b41bfd5d6f8ce70bcfa4ca434fc1"},"file_code":{"kind":"string","value":"\n\n#![doc(html_root_url = \"https://docs.rs/clap-num/0.2.0\")]\n#![deny(missing_docs)]\n\nuse core::convert::TryFrom;\nuse core::str::FromStr;\nuse num_traits::identities::Zero;\nuse num_traits::{sign, CheckedAdd, CheckedMul, CheckedSub, Num};\n\nfn check_range<T: Ord + std::fmt::Display>(val: T, min: T, max: T) -> Result<T, String>\nwhere\n T: FromStr,\n <T as std::str::FromStr>::Err: std::fmt::Display,\n{\n if val > max {\n Err(format!(\"exceeds maximum of {}\", max))\n } else if val < min {\n Err(format!(\"exceeds minimum of {}\", min))\n } else {\n Ok(val)\n }\n}\n\npub fn number_range<T: Ord + PartialOrd + std::fmt::Display>(\n s: &str,\n min: T,\n max: T,\n) -> Result<T, String>\nwhere\n T: FromStr,\n <T as std::str::FromStr>::Err: std::fmt::Display,\n{\n debug_assert!(min <= max, \"minimum of {} exceeds maximum of {}\", min, max);\n let val = s.parse::<T>().map_err(stringify)?;\n check_range(val, min, max)\n}\n\nstatic OVERFLOW_MSG: &str = \"number too large to fit in target type\";\n\nfn stringify<T: std::fmt::Display>(e: T) -> String {\n format!(\"{}\", e)\n}\n\nfn overflow_err<T>(_: T) -> String {\n OVERFLOW_MSG.to_string()\n}\n\nfn find_si_symbol(s: &str) -> (u128, usize, Option<usize>) {\n for (i, c) in s.chars().enumerate() {\n match c {\n 'Y' => return (1_000_000_000_000_000_000_000_000, 24, Some(i)),\n 'Z' => return (1_000_000_000_000_000_000_000, 21, Some(i)),\n 'E' => return (1_000_000_000_000_000_000, 18, Some(i)),\n 'P' => return (1_000_000_000_000_000, 15, Some(i)),\n 'T' => return (1_000_000_000_000, 12, Some(i)),\n 'G' => return (1_000_000_000, 9, Some(i)),\n 'M' => return (1_000_000, 6, Some(i)),\n 'k' => return (1_000, 3, Some(i)),\n _ => continue,\n };\n }\n (1, 0, None)\n}\n\nfn find_decimal(s: &str) -> Option<usize> {\n for (i, c) in s.chars().enumerate() {\n if c == '.' {\n return Some(i);\n }\n }\n None\n}\n\nfn parse_post<T>(post: &str, digits: usize, decimal: bool) -> Result<T, String>\nwhere\n <T as std::str::FromStr>::Err: std::fmt::Display,\n T: std::cmp::PartialOrd + std::str::FromStr,\n{\n \n let mut post = post[1..].to_string();\n \n if decimal {\n post.pop();\n }\n if post.len() > digits {\n Err(String::from(\"not an integer\"))\n } else {\n while post.len() < digits {\n post.push('0');\n }\n post.parse::<T>().map_err(stringify)\n }\n}\n\npub fn si_number<T>(s: &str) -> Result<T, String>\nwhere\n <T as std::convert::TryFrom<u128>>::Error: std::fmt::Display,\n <T as std::str::FromStr>::Err: std::fmt::Display,\n T: CheckedAdd,\n T: CheckedMul,\n T: CheckedSub,\n T: FromStr,\n T: std::cmp::PartialOrd,\n T: TryFrom<u128>,\n T: Zero,\n{\n let (multiplier, digits, si_index) = find_si_symbol(s);\n let multiplier = T::try_from(multiplier).map_err(overflow_err)?;\n\n \n if let Some(idx) = si_index {\n if idx == 0 {\n return Err(\"no value found before SI symbol\".to_string());\n };\n let (pre_si, post_si) = s.split_at(idx);\n\n \n let (pre, post) = if post_si.len() > 1 {\n (\n pre_si.parse::<T>().map_err(stringify)?,\n parse_post(&post_si, digits, false)?,\n )\n \n } else if let Some(idx) = find_decimal(pre_si) {\n let (pre_dec, post_dec) = s.split_at(idx);\n let post_dec = parse_post(&post_dec, digits, true)?;\n (pre_dec.parse::<T>().map_err(stringify)?, post_dec)\n \n } else {\n (pre_si.parse::<T>().map_err(stringify)?, T::zero())\n };\n\n let pre = pre\n .checked_mul(&multiplier)\n .ok_or_else(|| OVERFLOW_MSG.to_string())?;\n\n if pre >= T::zero() {\n pre.checked_add(&post)\n .ok_or_else(|| OVERFLOW_MSG.to_string())\n } else {\n pre.checked_sub(&post)\n .ok_or_else(|| OVERFLOW_MSG.to_string())\n }\n } else {\n \n s.parse::<T>().map_err(stringify)\n }\n}\n\npub fn si_number_range<T: Ord + PartialOrd + std::fmt::Display>(\n s: &str,\n min: T,\n max: T,\n) -> Result<T, String>\nwhere\n <T as std::convert::TryFrom<u128>>::Error: std::fmt::Display,\n <T as std::str::FromStr>::Err: std::fmt::Display,\n T: CheckedAdd,\n T: CheckedMul,\n T: CheckedSub,\n T: FromStr,\n T: std::cmp::PartialOrd,\n T: TryFrom<u128>,\n T: Zero,\n{\n let val = si_number(s)?;\n check_range(val, min, max)\n}\n\npub fn maybe_hex<T: Num + sign::Unsigned>(s: &str) -> Result<T, String>\nwhere\n <T as num_traits::Num>::FromStrRadixErr: std::fmt::Display,\n{\n const HEX_PREFIX: &str = \"0x\";\n const HEX_PREFIX_LEN: usize = HEX_PREFIX.len();\n\n let result = if s.to_ascii_lowercase().starts_with(HEX_PREFIX) {\n T::from_str_radix(&s[HEX_PREFIX_LEN..], 16)\n } else {\n T::from_str_radix(s, 10)\n };\n\n match result {\n Ok(v) => Ok(v),\n Err(e) => Err(format!(\"{}\", e)),\n }\n}\n\npub fn maybe_hex_range<T: Num + sign::Unsigned>(s: &str, min: T, max: T) -> Result<T, String>\nwhere\n <T as num_traits::Num>::FromStrRadixErr: std::fmt::Display,\n <T as std::str::FromStr>::Err: std::fmt::Display,\n T: FromStr,\n T: std::fmt::Display,\n T: std::cmp::Ord,\n{\n let val = maybe_hex(s)?;\n check_range(val, min, max)\n}\n"},"prefix":{"kind":"string","value":"\n\n#![doc(html_root_url = \"https://docs.rs/clap-num/0.2.0\")]\n#![deny(missing_docs)]\n\nuse core::convert::TryFrom;\nuse core::str::FromStr;\nuse num_traits::identities::Zero;\nuse num_traits::{sign, CheckedAdd, CheckedMul, CheckedSub, Num};\n\nfn check_range<T: Ord + std::fmt::Display>(val: T, min: T, max: T) -> Result<T, String>\nwhere\n T: FromStr,\n <T as std::str::FromStr>::Err: std::fmt::Display,\n{\n if val > max {\n Err(format!(\"exceeds maximum of {}\", max))\n } else if val < min {\n Err(format!(\"exceeds minimum of {}\", min))\n } else {\n Ok(val)\n }\n}\n\npub fn number_range<T: Ord + PartialOrd + std::fmt::Display>(\n s: &str,\n min: T,\n max: T,\n) -> Result<T, String>\nwhere\n T: FromStr,\n <T as std::str::FromStr>::Err: std::fmt::Display,\n{\n debug_assert!(min <= max, \"minimum of {} exceeds maximum of {}\", min, max);\n let val = s.parse::<T>().map_err(stringify)?;\n check_range(val, min, max)\n}\n\nstatic OVERFLOW_MSG: &str = \"number too large to fit in target type\";\n\nfn stringify<T: std::fmt::Display>(e: T) -> String {\n format!(\"{}\", e)\n}\n\nfn overflow_err<T>(_: T) -> String {\n OVERFLOW_MSG.to_string()\n}\n\nfn find_si_symbol(s: &str) -> (u128, usize, Option<usize>) {\n for (i, c) in s.chars().enumerate() {\n match c {\n 'Y' => return (1_000_000_000_000_000_000_000_000, 24, Some(i)),\n 'Z' => return (1_000_000_000_000_000_000_000, 21, Some(i)),\n 'E' => return (1_000_000_000_000_000_000, 18, Some(i)),\n 'P' => return (1_000_000_000_000_000, 15, Some(i)),\n 'T' => return (1_000_000_000_000, 12, Some(i)),\n 'G' => return (1_000_"},"suffix":{"kind":"string","value":" pre.checked_add(&post)\n .ok_or_else(|| OVERFLOW_MSG.to_string())\n } else {\n pre.checked_sub(&post)\n .ok_or_else(|| OVERFLOW_MSG.to_string())\n }\n } else {\n \n s.parse::<T>().map_err(stringify)\n }\n}\n\npub fn si_number_range<T: Ord + PartialOrd + std::fmt::Display>(\n s: &str,\n min: T,\n max: T,\n) -> Result<T, String>\nwhere\n <T as std::convert::TryFrom<u128>>::Error: std::fmt::Display,\n <T as std::str::FromStr>::Err: std::fmt::Display,\n T: CheckedAdd,\n T: CheckedMul,\n T: CheckedSub,\n T: FromStr,\n T: std::cmp::PartialOrd,\n T: TryFrom<u128>,\n T: Zero,\n{\n let val = si_number(s)?;\n check_range(val, min, max)\n}\n\npub fn maybe_hex<T: Num + sign::Unsigned>(s: &str) -> Result<T, String>\nwhere\n <T as num_traits::Num>::FromStrRadixErr: std::fmt::Display,\n{\n const HEX_PREFIX: &str = \"0x\";\n const HEX_PREFIX_LEN: usize = HEX_PREFIX.len();\n\n let result = if s.to_ascii_lowercase().starts_with(HEX_PREFIX) {\n T::from_str_radix(&s[HEX_PREFIX_LEN..], 16)\n } else {\n T::from_str_radix(s, 10)\n };\n\n match result {\n Ok(v) => Ok(v),\n Err(e) => Err(format!(\"{}\", e)),\n }\n}\n\npub fn maybe_hex_range<T: Num + sign::Unsigned>(s: &str, min: T, max: T) -> Result<T, String>\nwhere\n <T as num_traits::Num>::FromStrRadixErr: std::fmt::Display,\n <T as std::str::FromStr>::Err: std::fmt::Display,\n T: FromStr,\n T: std::fmt::Display,\n T: std::cmp::Ord,\n{\n let val = maybe_hex(s)?;\n check_range(val, min, max)\n}\n"},"middle":{"kind":"string","value":"000_000, 9, Some(i)),\n 'M' => return (1_000_000, 6, Some(i)),\n 'k' => return (1_000, 3, Some(i)),\n _ => continue,\n };\n }\n (1, 0, None)\n}\n\nfn find_decimal(s: &str) -> Option<usize> {\n for (i, c) in s.chars().enumerate() {\n if c == '.' {\n return Some(i);\n }\n }\n None\n}\n\nfn parse_post<T>(post: &str, digits: usize, decimal: bool) -> Result<T, String>\nwhere\n <T as std::str::FromStr>::Err: std::fmt::Display,\n T: std::cmp::PartialOrd + std::str::FromStr,\n{\n \n let mut post = post[1..].to_string();\n \n if decimal {\n post.pop();\n }\n if post.len() > digits {\n Err(String::from(\"not an integer\"))\n } else {\n while post.len() < digits {\n post.push('0');\n }\n post.parse::<T>().map_err(stringify)\n }\n}\n\npub fn si_number<T>(s: &str) -> Result<T, String>\nwhere\n <T as std::convert::TryFrom<u128>>::Error: std::fmt::Display,\n <T as std::str::FromStr>::Err: std::fmt::Display,\n T: CheckedAdd,\n T: CheckedMul,\n T: CheckedSub,\n T: FromStr,\n T: std::cmp::PartialOrd,\n T: TryFrom<u128>,\n T: Zero,\n{\n let (multiplier, digits, si_index) = find_si_symbol(s);\n let multiplier = T::try_from(multiplier).map_err(overflow_err)?;\n\n \n if let Some(idx) = si_index {\n if idx == 0 {\n return Err(\"no value found before SI symbol\".to_string());\n };\n let (pre_si, post_si) = s.split_at(idx);\n\n \n let (pre, post) = if post_si.len() > 1 {\n (\n pre_si.parse::<T>().map_err(stringify)?,\n parse_post(&post_si, digits, false)?,\n )\n \n } else if let Some(idx) = find_decimal(pre_si) {\n let (pre_dec, post_dec) = s.split_at(idx);\n let post_dec = parse_post(&post_dec, digits, true)?;\n (pre_dec.parse::<T>().map_err(stringify)?, post_dec)\n \n } else {\n (pre_si.parse::<T>().map_err(stringify)?, T::zero())\n };\n\n let pre = pre\n .checked_mul(&multiplier)\n .ok_or_else(|| OVERFLOW_MSG.to_string())?;\n\n if pre >= T::zero() {\n "},"strategy":{"kind":"string","value":"random"},"context_items":{"kind":"list like","value":[{"content":"fn less_than_100(s: &str) -> Result<u8, String> {\n\n number_range(s, 0, 99)\n\n}\n\n\n","file_path":"examples/change.rs","rank":7,"score":74407.00790011589},{"content":"#[test]\n\nfn test_readme_deps() {\n\n version_sync::assert_markdown_deps_updated!(\"README.md\");\n\n}\n\n\n","file_path":"tests/version-numbers.rs","rank":12,"score":39037.61840984814},{"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":"tests/version-numbers.rs","rank":13,"score":37608.22559669669},{"content":"fn main() {\n\n let args = Change::parse();\n\n println!(\"Change: {} cents\", args.cents);\n\n}\n","file_path":"examples/change.rs","rank":14,"score":26783.007473439844},{"content":"fn main() {\n\n let args = Args::parse();\n\n println!(\"Resistance: {} ohms\", args.resistance)\n\n}\n","file_path":"examples/resistance.rs","rank":15,"score":26783.007473439844},{"content":" \"number too large to fit in target type\"\n\n );\n\n neg!(nan, \"nan\", 0, 0, \"invalid digit found in string\");\n\n\n\n #[test]\n\n #[should_panic]\n\n fn min_max_debug_assert() {\n\n let _ = number_range(\"\", 2, 1);\n\n }\n\n}\n\n\n\n// integration tests with clap\n\n#[cfg(test)]\n\nmod integration {\n\n use super::*;\n\n\n\n fn human_livable_temperature(s: &str) -> Result<i8, String> {\n\n number_range(s, -40, 60)\n\n }\n\n\n","file_path":"tests/number_range.rs","rank":16,"score":17555.962083633454},{"content":"use clap::Clap;\n\nuse clap_num::number_range;\n\n\n\n// standalone basic tests\n\n#[cfg(test)]\n\nmod basic {\n\n use super::*;\n\n\n\n macro_rules! pos {\n\n ($NAME:ident, $VAL:expr, $MIN:expr, $MAX:expr, $RESULT:expr) => {\n\n #[test]\n\n fn $NAME() {\n\n assert_eq!(number_range($VAL, $MIN, $MAX), Ok($RESULT));\n\n }\n\n };\n\n }\n\n\n\n macro_rules! neg {\n\n ($NAME:ident, $VAL:expr, $MIN:expr, $MAX:expr, $RESULT:expr) => {\n\n #[test]\n","file_path":"tests/number_range.rs","rank":17,"score":17554.169499169},{"content":" fn $NAME() {\n\n assert_eq!(number_range($VAL, $MIN, $MAX), Err(String::from($RESULT)));\n\n }\n\n };\n\n }\n\n\n\n pos!(simple, \"123\", 12u8, 200u8, 123u8);\n\n pos!(zero, \"0\", 0u8, 0u8, 0u8);\n\n pos!(neg, \"-1\", -10i8, 10i8, -1);\n\n pos!(min_limit, \"-5\", -5i8, -5i8, -5i8);\n\n pos!(max_limit, \"65535\", 0, std::u16::MAX, std::u16::MAX);\n\n\n\n neg!(decimal, \"1.1\", -10i8, 10i8, \"invalid digit found in string\");\n\n neg!(min, \"-1\", 0i8, 0i8, \"exceeds minimum of 0\");\n\n neg!(max, \"1\", 0i8, 0i8, \"exceeds maximum of 0\");\n\n neg!(\n\n overflow,\n\n \"256\",\n\n 0,\n\n std::u8::MAX,\n","file_path":"tests/number_range.rs","rank":18,"score":17553.746479553258},{"content":" fn $NAME() {\n\n let num: Result<$TYPE, String> = si_number($VAL);\n\n assert_eq!(num, Err(String::from($RESULT)));\n\n }\n\n };\n\n }\n\n\n\n // basic positive path\n\n pos!(zero, \"0\", 0u8);\n\n pos!(one, \"1\", 1u8);\n\n pos!(neg_one, \"-1\", -1i8);\n\n pos!(limit, \"255\", 255u8);\n\n\n\n // basic positive path with Si suffix\n\n pos!(kilo, \"1k\", 1_000u16);\n\n pos!(mega, \"1M\", 1_000_000u32);\n\n pos!(giga, \"1G\", 1_000_000_000u64);\n\n pos!(tera, \"1T\", 1_000_000_000_000u64);\n\n pos!(peta, \"1P\", 1_000_000_000_000_000u64);\n\n pos!(exa, \"1E\", 1_000_000_000_000_000_000u64);\n","file_path":"tests/si_number.rs","rank":19,"score":17553.476789576896},{"content":" u8,\n\n \"number too large to fit in target type\"\n\n );\n\n\n\n neg!(multiple_suffix, \"1kk\", u16, \"invalid digit found in string\");\n\n}\n\n\n\n// integration tests with clap\n\n#[cfg(test)]\n\nmod integration {\n\n use super::*;\n\n\n\n #[derive(Clap)]\n\n struct Args {\n\n #[clap(long, parse(try_from_str=si_number))]\n\n resistance: u128,\n\n }\n\n\n\n // positive path\n\n macro_rules! pos {\n","file_path":"tests/si_number.rs","rank":20,"score":17553.463484733587},{"content":"use clap::Clap;\n\nuse clap_num::si_number;\n\n\n\n// standalone basic tests\n\n#[cfg(test)]\n\nmod basic {\n\n use super::*;\n\n\n\n macro_rules! pos {\n\n ($NAME:ident, $VAL:expr, $RESULT:expr) => {\n\n #[test]\n\n fn $NAME() {\n\n assert_eq!(si_number($VAL), Ok($RESULT));\n\n }\n\n };\n\n }\n\n\n\n macro_rules! neg {\n\n ($NAME:ident, $VAL:expr, $TYPE:ident, $RESULT:expr) => {\n\n #[test]\n","file_path":"tests/si_number.rs","rank":21,"score":17551.617470029567},{"content":"\n\n // negative path\n\n macro_rules! neg {\n\n ($NAME:ident, $VAL:expr, $RESULT:expr) => {\n\n #[test]\n\n fn $NAME() {\n\n let opt = Thermostat::try_parse_from(&[\"\", \"--temperature\", $VAL]);\n\n match opt {\n\n Err(e) => {\n\n assert!(format!(\"{:?}\", e).contains($RESULT));\n\n }\n\n _ => unreachable!(),\n\n };\n\n }\n\n };\n\n }\n\n\n\n pos!(simple, \"50\", 50);\n\n pos!(zero, \"0\", 0);\n\n pos!(negative, \"-30\", -30);\n\n pos!(positive_limit, \"60\", 60);\n\n pos!(negative_limit, \"-40\", -40);\n\n\n\n neg!(too_small, \"-41\", \"exceeds minimum of -40\");\n\n neg!(too_large, \"61\", \"exceeds maximum of 60\");\n\n}\n","file_path":"tests/number_range.rs","rank":22,"score":17550.65767366596},{"content":"\n\n pos!(dec_ending_si, \"1.k\", 1_000u16);\n\n\n\n neg!(mixed_1, \"1K23.45\", u16, \"invalid digit found in string\");\n\n neg!(mixed_2, \"1.23k45\", u16, \"invalid digit found in string\");\n\n\n\n neg!(trailing_dec, \"1.\", u8, \"invalid digit found in string\");\n\n\n\n pos!(\n\n big,\n\n \"1Y123456789987654321\",\n\n 1_123_456_789_987_654_321_000_000u128\n\n );\n\n\n\n neg!(leading_si, \"k1\", u16, \"no value found before SI symbol\");\n\n\n\n neg!(overflow, \"1k\", u8, \"number too large to fit in target type\");\n\n neg!(\n\n normal_overflow,\n\n \"300\",\n","file_path":"tests/si_number.rs","rank":23,"score":17550.28329997542},{"content":" ($NAME:ident, $VAL:expr, $RESULT:expr) => {\n\n #[test]\n\n fn $NAME() {\n\n let opt = Args::parse_from(&[\"\", \"--resistance\", $VAL]);\n\n assert_eq!(opt.resistance, $RESULT);\n\n }\n\n };\n\n }\n\n\n\n // negative path\n\n macro_rules! neg {\n\n ($NAME:ident, $VAL:expr, $RESULT:expr) => {\n\n #[test]\n\n fn $NAME() {\n\n let opt = Args::try_parse_from(&[\"\", \"--resistance\", $VAL]);\n\n match opt {\n\n Err(e) => {\n\n assert!(format!(\"{:?}\", e).contains($RESULT));\n\n }\n\n _ => unreachable!(),\n","file_path":"tests/si_number.rs","rank":24,"score":17547.239217335995},{"content":" #[derive(Clap, Debug)]\n\n struct Thermostat {\n\n #[clap(\n\n long,\n\n parse(try_from_str=human_livable_temperature),\n\n allow_hyphen_values=true\n\n )]\n\n temperature: i8,\n\n }\n\n\n\n // positive path\n\n macro_rules! pos {\n\n ($NAME:ident, $VAL:expr, $RESULT:expr) => {\n\n #[test]\n\n fn $NAME() {\n\n let opt = Thermostat::parse_from(&[\"\", \"--temperature\", $VAL]);\n\n assert_eq!(opt.temperature, $RESULT);\n\n }\n\n };\n\n }\n","file_path":"tests/number_range.rs","rank":25,"score":17546.719591915968},{"content":" pos!(zetta, \"1Z\", 1_000_000_000_000_000_000_000u128);\n\n pos!(yotta, \"1Y\", 1_000_000_000_000_000_000_000_000u128);\n\n\n\n pos!(trailing_1, \"1k2\", 1_200u16);\n\n pos!(trailing_2, \"1k23\", 1_230u16);\n\n pos!(trailing_3, \"1k234\", 1_234u16);\n\n neg!(trailing_4, \"1k2345\", u16, \"not an integer\");\n\n pos!(trailing_do_nothing, \"1k000\", 1_000u16);\n\n pos!(negative_trailing, \"-1k234\", -1_234i16);\n\n\n\n pos!(leading_2, \"12k123\", 12_123u16);\n\n pos!(leading_3, \"123k123\", 123_123u32);\n\n pos!(leading_4, \"1234k123\", 1_234_123i32);\n\n pos!(negative_leading, \"-123k123\", -123_123i32);\n\n\n\n pos!(dec_1, \"1.2k\", 1_200u16);\n\n pos!(dec_2, \"1.23k\", 1_230u16);\n\n pos!(dec_3, \"1.234k\", 1_234u16);\n\n neg!(dec_4, \"1.2345k\", u16, \"not an integer\");\n\n pos!(dec_do_nothing, \"1.000k\", 1_000u16);\n","file_path":"tests/si_number.rs","rank":26,"score":17546.22568406502},{"content":" };\n\n }\n\n };\n\n }\n\n\n\n pos!(simple_0, \"1k123\", 1123);\n\n pos!(simple_1, \"456789k123\", 456789123);\n\n pos!(simple_2, \"1M1\", 1_100_000);\n\n\n\n neg!(big, \"999999999999999999999Y\", \"too large\");\n\n neg!(invalid, \"1k1k\", \"invalid digit\");\n\n neg!(precise, \"1k1111\", \"not an integer\");\n\n neg!(leading_prefix, \"k123\", \"no value found before SI symbol\");\n\n}\n","file_path":"tests/si_number.rs","rank":27,"score":17545.08760143218},{"content":"// See https://crates.io/crates/version-sync\n\n\n\n#[test]\n","file_path":"tests/version-numbers.rs","rank":28,"score":17543.518778618465},{"content":"\n\n[](https://crates.io/crates/clap-num)\n\n[](https://docs.rs/clap-num/)\n\n[](https://github.com/newAM/clap-num/actions)\n\n\n\n# clap-num\n\n\n\nclap V3 number parsers.\n\n\n\nThis crate contains functions to validate and parse numerical values from\n\nstrings provided by [clap v3].\n\n\n\n## Example\n\n\n\nThis example allow values for `--frequency` between 800 Hz and 3.333 MHz,\n\nwith SI symbols.\n\n\n\n```rust\n\nuse clap::Clap;\n\nuse clap_num::si_number_range;\n\n\n\nfn frequency(s: &str) -> Result<u32, String> {\n\n si_number_range(s, 800, 3_333_000)\n\n}\n\n\n\n#[derive(Clap, Debug)]\n\nstruct Args {\n\n #[clap(short, long, parse(try_from_str=frequency))]\n\n frequency: Option<u32>,\n\n}\n\n\n\nlet args = Args::parse();\n\nprintln!(\"{:?}\", args);\n\n```\n\n\n\n[clap v3]: https://github.com/clap-rs/clap\n","file_path":"README.md","rank":29,"score":12623.308211480049},{"content":"# Changelog\n\nAll notable changes to this project will be documented in this file.\n\n\n\nThe format is based on [Keep a Changelog](https://keepachangelog.com/en/1.0.0/),\n\nand this project adheres to [Semantic Versioning](https://semver.org/spec/v2.0.0.html).\n\n\n\n## [Unreleased]\n\n### Fixed\n\n- Fixed typos in documentation.\n\n\n\n## [0.2.0] - 2020-10-18\n\n### Added\n\n- Added `maybe_hex` and `maybe_hex_range` functions.\n\n- Added a changelog.\n\n\n\n[Unreleased]: https://github.com/newAM/clap-num/compare/0.2.0...HEAD\n\n[0.2.0]: https://github.com/newAM/clap-num/releases/tag/0.2.0\n\n\n","file_path":"CHANGELOG.md","rank":30,"score":12618.414658895901},{"content":"use clap::Clap;\n\nuse clap_num::number_range;\n\n\n","file_path":"examples/change.rs","rank":32,"score":6.178412258345768},{"content":"use clap::Clap;\n\nuse clap_num::si_number;\n\n\n\n#[derive(Clap)]\n","file_path":"examples/resistance.rs","rank":33,"score":5.994221035379587},{"content":" fn $NAME() {\n\n let val: Result<u64, String> = maybe_hex($VAL);\n\n assert_eq!(val, Err(String::from($RESULT)));\n\n }\n\n };\n\n }\n\n\n\n pos!(simple, \"123\", 123u8);\n\n pos!(zero_dec, \"0\", 0u16);\n\n pos!(zero_hex, \"0x0\", 0u16);\n\n pos!(one_dec, \"1\", 1u64);\n\n pos!(one_hex, \"0x1\", 1u64);\n\n pos!(leading_zero, \"001\", 1u64);\n\n pos!(case, \"0XABcDE\", 703710u32);\n\n\n\n neg!(\n\n missing_suffix,\n\n \"0x\",\n\n \"cannot parse integer from empty string\"\n\n );\n\n neg!(dec_with_hex, \"1A\", \"invalid digit found in string\");\n\n neg!(non_hex_digit, \"0x12G\", \"invalid digit found in string\");\n\n}\n","file_path":"tests/maybe_hex.rs","rank":35,"score":5.049022098868902},{"content":"use clap_num::maybe_hex;\n\n\n\n#[cfg(test)]\n\nmod basic {\n\n use super::*;\n\n\n\n // positive path\n\n macro_rules! pos {\n\n ($NAME:ident, $VAL:expr, $RESULT:expr) => {\n\n #[test]\n\n fn $NAME() {\n\n assert_eq!(maybe_hex($VAL), Ok($RESULT));\n\n }\n\n };\n\n }\n\n\n\n // negative path\n\n macro_rules! neg {\n\n ($NAME:ident, $VAL:expr, $RESULT:expr) => {\n\n #[test]\n","file_path":"tests/maybe_hex.rs","rank":36,"score":5.03284685743152}],"string":"[\n {\n \"content\": \"fn less_than_100(s: &str) -> Result<u8, String> {\\n\\n number_range(s, 0, 99)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"examples/change.rs\",\n \"rank\": 7,\n \"score\": 74407.00790011589\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\": \"tests/version-numbers.rs\",\n \"rank\": 12,\n \"score\": 39037.61840984814\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\",\n \"file_path\": \"tests/version-numbers.rs\",\n \"rank\": 13,\n \"score\": 37608.22559669669\n },\n {\n \"content\": \"fn main() {\\n\\n let args = Change::parse();\\n\\n println!(\\\"Change: {} cents\\\", args.cents);\\n\\n}\\n\",\n \"file_path\": \"examples/change.rs\",\n \"rank\": 14,\n \"score\": 26783.007473439844\n },\n {\n \"content\": \"fn main() {\\n\\n let args = Args::parse();\\n\\n println!(\\\"Resistance: {} ohms\\\", args.resistance)\\n\\n}\\n\",\n \"file_path\": \"examples/resistance.rs\",\n \"rank\": 15,\n \"score\": 26783.007473439844\n },\n {\n \"content\": \" \\\"number too large to fit in target type\\\"\\n\\n );\\n\\n neg!(nan, \\\"nan\\\", 0, 0, \\\"invalid digit found in string\\\");\\n\\n\\n\\n #[test]\\n\\n #[should_panic]\\n\\n fn min_max_debug_assert() {\\n\\n let _ = number_range(\\\"\\\", 2, 1);\\n\\n }\\n\\n}\\n\\n\\n\\n// integration tests with clap\\n\\n#[cfg(test)]\\n\\nmod integration {\\n\\n use super::*;\\n\\n\\n\\n fn human_livable_temperature(s: &str) -> Result<i8, String> {\\n\\n number_range(s, -40, 60)\\n\\n }\\n\\n\\n\",\n \"file_path\": \"tests/number_range.rs\",\n \"rank\": 16,\n \"score\": 17555.962083633454\n },\n {\n \"content\": \"use clap::Clap;\\n\\nuse clap_num::number_range;\\n\\n\\n\\n// standalone basic tests\\n\\n#[cfg(test)]\\n\\nmod basic {\\n\\n use super::*;\\n\\n\\n\\n macro_rules! pos {\\n\\n ($NAME:ident, $VAL:expr, $MIN:expr, $MAX:expr, $RESULT:expr) => {\\n\\n #[test]\\n\\n fn $NAME() {\\n\\n assert_eq!(number_range($VAL, $MIN, $MAX), Ok($RESULT));\\n\\n }\\n\\n };\\n\\n }\\n\\n\\n\\n macro_rules! neg {\\n\\n ($NAME:ident, $VAL:expr, $MIN:expr, $MAX:expr, $RESULT:expr) => {\\n\\n #[test]\\n\",\n \"file_path\": \"tests/number_range.rs\",\n \"rank\": 17,\n \"score\": 17554.169499169\n },\n {\n \"content\": \" fn $NAME() {\\n\\n assert_eq!(number_range($VAL, $MIN, $MAX), Err(String::from($RESULT)));\\n\\n }\\n\\n };\\n\\n }\\n\\n\\n\\n pos!(simple, \\\"123\\\", 12u8, 200u8, 123u8);\\n\\n pos!(zero, \\\"0\\\", 0u8, 0u8, 0u8);\\n\\n pos!(neg, \\\"-1\\\", -10i8, 10i8, -1);\\n\\n pos!(min_limit, \\\"-5\\\", -5i8, -5i8, -5i8);\\n\\n pos!(max_limit, \\\"65535\\\", 0, std::u16::MAX, std::u16::MAX);\\n\\n\\n\\n neg!(decimal, \\\"1.1\\\", -10i8, 10i8, \\\"invalid digit found in string\\\");\\n\\n neg!(min, \\\"-1\\\", 0i8, 0i8, \\\"exceeds minimum of 0\\\");\\n\\n neg!(max, \\\"1\\\", 0i8, 0i8, \\\"exceeds maximum of 0\\\");\\n\\n neg!(\\n\\n overflow,\\n\\n \\\"256\\\",\\n\\n 0,\\n\\n std::u8::MAX,\\n\",\n \"file_path\": \"tests/number_range.rs\",\n \"rank\": 18,\n \"score\": 17553.746479553258\n },\n {\n \"content\": \" fn $NAME() {\\n\\n let num: Result<$TYPE, String> = si_number($VAL);\\n\\n assert_eq!(num, Err(String::from($RESULT)));\\n\\n }\\n\\n };\\n\\n }\\n\\n\\n\\n // basic positive path\\n\\n pos!(zero, \\\"0\\\", 0u8);\\n\\n pos!(one, \\\"1\\\", 1u8);\\n\\n pos!(neg_one, \\\"-1\\\", -1i8);\\n\\n pos!(limit, \\\"255\\\", 255u8);\\n\\n\\n\\n // basic positive path with Si suffix\\n\\n pos!(kilo, \\\"1k\\\", 1_000u16);\\n\\n pos!(mega, \\\"1M\\\", 1_000_000u32);\\n\\n pos!(giga, \\\"1G\\\", 1_000_000_000u64);\\n\\n pos!(tera, \\\"1T\\\", 1_000_000_000_000u64);\\n\\n pos!(peta, \\\"1P\\\", 1_000_000_000_000_000u64);\\n\\n pos!(exa, \\\"1E\\\", 1_000_000_000_000_000_000u64);\\n\",\n \"file_path\": \"tests/si_number.rs\",\n \"rank\": 19,\n \"score\": 17553.476789576896\n },\n {\n \"content\": \" u8,\\n\\n \\\"number too large to fit in target type\\\"\\n\\n );\\n\\n\\n\\n neg!(multiple_suffix, \\\"1kk\\\", u16, \\\"invalid digit found in string\\\");\\n\\n}\\n\\n\\n\\n// integration tests with clap\\n\\n#[cfg(test)]\\n\\nmod integration {\\n\\n use super::*;\\n\\n\\n\\n #[derive(Clap)]\\n\\n struct Args {\\n\\n #[clap(long, parse(try_from_str=si_number))]\\n\\n resistance: u128,\\n\\n }\\n\\n\\n\\n // positive path\\n\\n macro_rules! pos {\\n\",\n \"file_path\": \"tests/si_number.rs\",\n \"rank\": 20,\n \"score\": 17553.463484733587\n },\n {\n \"content\": \"use clap::Clap;\\n\\nuse clap_num::si_number;\\n\\n\\n\\n// standalone basic tests\\n\\n#[cfg(test)]\\n\\nmod basic {\\n\\n use super::*;\\n\\n\\n\\n macro_rules! pos {\\n\\n ($NAME:ident, $VAL:expr, $RESULT:expr) => {\\n\\n #[test]\\n\\n fn $NAME() {\\n\\n assert_eq!(si_number($VAL), Ok($RESULT));\\n\\n }\\n\\n };\\n\\n }\\n\\n\\n\\n macro_rules! neg {\\n\\n ($NAME:ident, $VAL:expr, $TYPE:ident, $RESULT:expr) => {\\n\\n #[test]\\n\",\n \"file_path\": \"tests/si_number.rs\",\n \"rank\": 21,\n \"score\": 17551.617470029567\n },\n {\n \"content\": \"\\n\\n // negative path\\n\\n macro_rules! neg {\\n\\n ($NAME:ident, $VAL:expr, $RESULT:expr) => {\\n\\n #[test]\\n\\n fn $NAME() {\\n\\n let opt = Thermostat::try_parse_from(&[\\\"\\\", \\\"--temperature\\\", $VAL]);\\n\\n match opt {\\n\\n Err(e) => {\\n\\n assert!(format!(\\\"{:?}\\\", e).contains($RESULT));\\n\\n }\\n\\n _ => unreachable!(),\\n\\n };\\n\\n }\\n\\n };\\n\\n }\\n\\n\\n\\n pos!(simple, \\\"50\\\", 50);\\n\\n pos!(zero, \\\"0\\\", 0);\\n\\n pos!(negative, \\\"-30\\\", -30);\\n\\n pos!(positive_limit, \\\"60\\\", 60);\\n\\n pos!(negative_limit, \\\"-40\\\", -40);\\n\\n\\n\\n neg!(too_small, \\\"-41\\\", \\\"exceeds minimum of -40\\\");\\n\\n neg!(too_large, \\\"61\\\", \\\"exceeds maximum of 60\\\");\\n\\n}\\n\",\n \"file_path\": \"tests/number_range.rs\",\n \"rank\": 22,\n \"score\": 17550.65767366596\n },\n {\n \"content\": \"\\n\\n pos!(dec_ending_si, \\\"1.k\\\", 1_000u16);\\n\\n\\n\\n neg!(mixed_1, \\\"1K23.45\\\", u16, \\\"invalid digit found in string\\\");\\n\\n neg!(mixed_2, \\\"1.23k45\\\", u16, \\\"invalid digit found in string\\\");\\n\\n\\n\\n neg!(trailing_dec, \\\"1.\\\", u8, \\\"invalid digit found in string\\\");\\n\\n\\n\\n pos!(\\n\\n big,\\n\\n \\\"1Y123456789987654321\\\",\\n\\n 1_123_456_789_987_654_321_000_000u128\\n\\n );\\n\\n\\n\\n neg!(leading_si, \\\"k1\\\", u16, \\\"no value found before SI symbol\\\");\\n\\n\\n\\n neg!(overflow, \\\"1k\\\", u8, \\\"number too large to fit in target type\\\");\\n\\n neg!(\\n\\n normal_overflow,\\n\\n \\\"300\\\",\\n\",\n \"file_path\": \"tests/si_number.rs\",\n \"rank\": 23,\n \"score\": 17550.28329997542\n },\n {\n \"content\": \" ($NAME:ident, $VAL:expr, $RESULT:expr) => {\\n\\n #[test]\\n\\n fn $NAME() {\\n\\n let opt = Args::parse_from(&[\\\"\\\", \\\"--resistance\\\", $VAL]);\\n\\n assert_eq!(opt.resistance, $RESULT);\\n\\n }\\n\\n };\\n\\n }\\n\\n\\n\\n // negative path\\n\\n macro_rules! neg {\\n\\n ($NAME:ident, $VAL:expr, $RESULT:expr) => {\\n\\n #[test]\\n\\n fn $NAME() {\\n\\n let opt = Args::try_parse_from(&[\\\"\\\", \\\"--resistance\\\", $VAL]);\\n\\n match opt {\\n\\n Err(e) => {\\n\\n assert!(format!(\\\"{:?}\\\", e).contains($RESULT));\\n\\n }\\n\\n _ => unreachable!(),\\n\",\n \"file_path\": \"tests/si_number.rs\",\n \"rank\": 24,\n \"score\": 17547.239217335995\n },\n {\n \"content\": \" #[derive(Clap, Debug)]\\n\\n struct Thermostat {\\n\\n #[clap(\\n\\n long,\\n\\n parse(try_from_str=human_livable_temperature),\\n\\n allow_hyphen_values=true\\n\\n )]\\n\\n temperature: i8,\\n\\n }\\n\\n\\n\\n // positive path\\n\\n macro_rules! pos {\\n\\n ($NAME:ident, $VAL:expr, $RESULT:expr) => {\\n\\n #[test]\\n\\n fn $NAME() {\\n\\n let opt = Thermostat::parse_from(&[\\\"\\\", \\\"--temperature\\\", $VAL]);\\n\\n assert_eq!(opt.temperature, $RESULT);\\n\\n }\\n\\n };\\n\\n }\\n\",\n \"file_path\": \"tests/number_range.rs\",\n \"rank\": 25,\n \"score\": 17546.719591915968\n },\n {\n \"content\": \" pos!(zetta, \\\"1Z\\\", 1_000_000_000_000_000_000_000u128);\\n\\n pos!(yotta, \\\"1Y\\\", 1_000_000_000_000_000_000_000_000u128);\\n\\n\\n\\n pos!(trailing_1, \\\"1k2\\\", 1_200u16);\\n\\n pos!(trailing_2, \\\"1k23\\\", 1_230u16);\\n\\n pos!(trailing_3, \\\"1k234\\\", 1_234u16);\\n\\n neg!(trailing_4, \\\"1k2345\\\", u16, \\\"not an integer\\\");\\n\\n pos!(trailing_do_nothing, \\\"1k000\\\", 1_000u16);\\n\\n pos!(negative_trailing, \\\"-1k234\\\", -1_234i16);\\n\\n\\n\\n pos!(leading_2, \\\"12k123\\\", 12_123u16);\\n\\n pos!(leading_3, \\\"123k123\\\", 123_123u32);\\n\\n pos!(leading_4, \\\"1234k123\\\", 1_234_123i32);\\n\\n pos!(negative_leading, \\\"-123k123\\\", -123_123i32);\\n\\n\\n\\n pos!(dec_1, \\\"1.2k\\\", 1_200u16);\\n\\n pos!(dec_2, \\\"1.23k\\\", 1_230u16);\\n\\n pos!(dec_3, \\\"1.234k\\\", 1_234u16);\\n\\n neg!(dec_4, \\\"1.2345k\\\", u16, \\\"not an integer\\\");\\n\\n pos!(dec_do_nothing, \\\"1.000k\\\", 1_000u16);\\n\",\n \"file_path\": \"tests/si_number.rs\",\n \"rank\": 26,\n \"score\": 17546.22568406502\n },\n {\n \"content\": \" };\\n\\n }\\n\\n };\\n\\n }\\n\\n\\n\\n pos!(simple_0, \\\"1k123\\\", 1123);\\n\\n pos!(simple_1, \\\"456789k123\\\", 456789123);\\n\\n pos!(simple_2, \\\"1M1\\\", 1_100_000);\\n\\n\\n\\n neg!(big, \\\"999999999999999999999Y\\\", \\\"too large\\\");\\n\\n neg!(invalid, \\\"1k1k\\\", \\\"invalid digit\\\");\\n\\n neg!(precise, \\\"1k1111\\\", \\\"not an integer\\\");\\n\\n neg!(leading_prefix, \\\"k123\\\", \\\"no value found before SI symbol\\\");\\n\\n}\\n\",\n \"file_path\": \"tests/si_number.rs\",\n \"rank\": 27,\n \"score\": 17545.08760143218\n },\n {\n \"content\": \"// See https://crates.io/crates/version-sync\\n\\n\\n\\n#[test]\\n\",\n \"file_path\": \"tests/version-numbers.rs\",\n \"rank\": 28,\n \"score\": 17543.518778618465\n },\n {\n \"content\": \"\\n\\n[](https://crates.io/crates/clap-num)\\n\\n[](https://docs.rs/clap-num/)\\n\\n[](https://github.com/newAM/clap-num/actions)\\n\\n\\n\\n# clap-num\\n\\n\\n\\nclap V3 number parsers.\\n\\n\\n\\nThis crate contains functions to validate and parse numerical values from\\n\\nstrings provided by [clap v3].\\n\\n\\n\\n## Example\\n\\n\\n\\nThis example allow values for `--frequency` between 800 Hz and 3.333 MHz,\\n\\nwith SI symbols.\\n\\n\\n\\n```rust\\n\\nuse clap::Clap;\\n\\nuse clap_num::si_number_range;\\n\\n\\n\\nfn frequency(s: &str) -> Result<u32, String> {\\n\\n si_number_range(s, 800, 3_333_000)\\n\\n}\\n\\n\\n\\n#[derive(Clap, Debug)]\\n\\nstruct Args {\\n\\n #[clap(short, long, parse(try_from_str=frequency))]\\n\\n frequency: Option<u32>,\\n\\n}\\n\\n\\n\\nlet args = Args::parse();\\n\\nprintln!(\\\"{:?}\\\", args);\\n\\n```\\n\\n\\n\\n[clap v3]: https://github.com/clap-rs/clap\\n\",\n \"file_path\": \"README.md\",\n \"rank\": 29,\n \"score\": 12623.308211480049\n },\n {\n \"content\": \"# Changelog\\n\\nAll notable changes to this project will be documented in this file.\\n\\n\\n\\nThe format is based on [Keep a Changelog](https://keepachangelog.com/en/1.0.0/),\\n\\nand this project adheres to [Semantic Versioning](https://semver.org/spec/v2.0.0.html).\\n\\n\\n\\n## [Unreleased]\\n\\n### Fixed\\n\\n- Fixed typos in documentation.\\n\\n\\n\\n## [0.2.0] - 2020-10-18\\n\\n### Added\\n\\n- Added `maybe_hex` and `maybe_hex_range` functions.\\n\\n- Added a changelog.\\n\\n\\n\\n[Unreleased]: https://github.com/newAM/clap-num/compare/0.2.0...HEAD\\n\\n[0.2.0]: https://github.com/newAM/clap-num/releases/tag/0.2.0\\n\\n\\n\",\n \"file_path\": \"CHANGELOG.md\",\n \"rank\": 30,\n \"score\": 12618.414658895901\n },\n {\n \"content\": \"use clap::Clap;\\n\\nuse clap_num::number_range;\\n\\n\\n\",\n \"file_path\": \"examples/change.rs\",\n \"rank\": 32,\n \"score\": 6.178412258345768\n },\n {\n \"content\": \"use clap::Clap;\\n\\nuse clap_num::si_number;\\n\\n\\n\\n#[derive(Clap)]\\n\",\n \"file_path\": \"examples/resistance.rs\",\n \"rank\": 33,\n \"score\": 5.994221035379587\n },\n {\n \"content\": \" fn $NAME() {\\n\\n let val: Result<u64, String> = maybe_hex($VAL);\\n\\n assert_eq!(val, Err(String::from($RESULT)));\\n\\n }\\n\\n };\\n\\n }\\n\\n\\n\\n pos!(simple, \\\"123\\\", 123u8);\\n\\n pos!(zero_dec, \\\"0\\\", 0u16);\\n\\n pos!(zero_hex, \\\"0x0\\\", 0u16);\\n\\n pos!(one_dec, \\\"1\\\", 1u64);\\n\\n pos!(one_hex, \\\"0x1\\\", 1u64);\\n\\n pos!(leading_zero, \\\"001\\\", 1u64);\\n\\n pos!(case, \\\"0XABcDE\\\", 703710u32);\\n\\n\\n\\n neg!(\\n\\n missing_suffix,\\n\\n \\\"0x\\\",\\n\\n \\\"cannot parse integer from empty string\\\"\\n\\n );\\n\\n neg!(dec_with_hex, \\\"1A\\\", \\\"invalid digit found in string\\\");\\n\\n neg!(non_hex_digit, \\\"0x12G\\\", \\\"invalid digit found in string\\\");\\n\\n}\\n\",\n \"file_path\": \"tests/maybe_hex.rs\",\n \"rank\": 35,\n \"score\": 5.049022098868902\n },\n {\n \"content\": \"use clap_num::maybe_hex;\\n\\n\\n\\n#[cfg(test)]\\n\\nmod basic {\\n\\n use super::*;\\n\\n\\n\\n // positive path\\n\\n macro_rules! pos {\\n\\n ($NAME:ident, $VAL:expr, $RESULT:expr) => {\\n\\n #[test]\\n\\n fn $NAME() {\\n\\n assert_eq!(maybe_hex($VAL), Ok($RESULT));\\n\\n }\\n\\n };\\n\\n }\\n\\n\\n\\n // negative path\\n\\n macro_rules! neg {\\n\\n ($NAME:ident, $VAL:expr, $RESULT:expr) => {\\n\\n #[test]\\n\",\n \"file_path\": \"tests/maybe_hex.rs\",\n \"rank\": 36,\n \"score\": 5.03284685743152\n }\n]","isConversational":false}}},{"rowIdx":2366,"cells":{"lang":{"kind":"string","value":"Rust"},"file_path":{"kind":"string","value":"game/src/sandbox/score.rs"},"repo_name":{"kind":"string","value":"jinzhong2/abstreet"},"commit":{"kind":"string","value":"e1c5edc76d636af4f3e4593efc25055bdd637dd7"},"file_code":{"kind":"string","value":"use crate::game::{State, Transition, WizardState};\nuse crate::sandbox::gameplay::{cmp_count_fewer, cmp_count_more, cmp_duration_shorter};\nuse crate::ui::UI;\nuse abstutil::prettyprint_usize;\nuse ezgui::{\n hotkey, Choice, Color, EventCtx, GfxCtx, HorizontalAlignment, Key, Line, ModalMenu, Text,\n VerticalAlignment, Wizard,\n};\nuse geom::{Duration, Statistic};\nuse sim::{TripID, TripMode};\nuse std::collections::BTreeSet;\n\npub struct Scoreboard {\n menu: ModalMenu,\n summary: Text,\n}\n\nimpl Scoreboard {\n pub fn new(ctx: &mut EventCtx, ui: &UI) -> Scoreboard {\n let menu = ModalMenu::new(\n \"Finished trips summary\",\n vec![\n (hotkey(Key::Escape), \"quit\"),\n (hotkey(Key::B), \"browse trips\"),\n ],\n ctx,\n );\n\n let (now_all, now_aborted, now_per_mode) = ui\n .primary\n .sim\n .get_analytics()\n .all_finished_trips(ui.primary.sim.time());\n let (baseline_all, baseline_aborted, baseline_per_mode) =\n ui.prebaked.all_finished_trips(ui.primary.sim.time());\n\n \n let mut txt = Text::new();\n txt.add_appended(vec![\n Line(\"Finished trips as of \"),\n Line(ui.primary.sim.time().ampm_tostring()).fg(Color::CYAN),\n ]);\n txt.add_appended(vec![\n Line(format!(\n \" {} aborted trips (\",\n prettyprint_usize(now_aborted)\n )),\n cmp_count_fewer(now_aborted, baseline_aborted),\n Line(\")\"),\n ]);\n \n txt.add_appended(vec![\n Line(format!(\n \"{} total finished trips (\",\n prettyprint_usize(now_all.count())\n )),\n cmp_count_more(now_all.count(), baseline_all.count()),\n Line(\")\"),\n ]);\n if now_all.count() > 0 && baseline_all.count() > 0 {\n for stat in Statistic::all() {\n txt.add(Line(format!(\n \" {}: {} \",\n stat,\n now_all.select(stat).minimal_tostring()\n )));\n txt.append_all(cmp_duration_shorter(\n now_all.select(stat),\n baseline_all.select(stat),\n ));\n }\n }\n\n for mode in TripMode::all() {\n let a = &now_per_mode[&mode];\n let b = &baseline_per_mode[&mode];\n txt.add_appended(vec![\n Line(format!(\"{} {} trips (\", prettyprint_usize(a.count()), mode)),\n cmp_count_more(a.count(), b.count()),\n Line(\")\"),\n ]);\n if a.count() > 0 && b.count() > 0 {\n for stat in Statistic::all() {\n txt.add(Line(format!(\n \" {}: {} \",\n stat,\n a.select(stat).minimal_tostring()\n )));\n txt.append_all(cmp_duration_shorter(a.select(stat), b.select(stat)));\n }\n }\n }\n\n Scoreboard { menu, summary: txt }\n }\n}\n\nimpl State for Scoreboard {\n fn event(&mut self, ctx: &mut EventCtx, _: &mut UI) -> Transition {\n self.menu.event(ctx);\n if self.menu.action(\"quit\") {\n return Transition::Pop;\n }\n if self.menu.action(\"browse trips\") {\n return Transition::Push(WizardState::new(Box::new(browse_trips)));\n }\n Transition::Keep\n }\n\n fn draw(&self, g: &mut GfxCtx, _: &UI) {\n g.draw_blocking_text(\n &self.summary,\n (HorizontalAlignment::Center, VerticalAlignment::Center),\n );\n self.menu.draw(g);\n }\n}\n\nfn browse_trips(wiz: &mut Wizard, ctx: &mut EventCtx, ui: &mut UI) -> Option<Transition> {\n let mut wizard = wiz.wrap(ctx);\n let (_, mode) = wizard.choose(\"Browse which trips?\", || {\n let trips = ui.primary.sim.get_finished_trips();\n let modes = trips\n .finished_trips\n .iter()\n .map(|(_, m, _)| *m)\n .collect::<BTreeSet<TripMode>>();\n TripMode::all()\n .into_iter()\n .map(|m| Choice::new(m.to_string(), m).active(modes.contains(&m)))\n .collect()\n })?;\n wizard.choose(\"Examine which trip?\", || {\n let trips = ui.primary.sim.get_finished_trips();\n let mut filtered: Vec<&(TripID, TripMode, Duration)> = trips\n .finished_trips\n .iter()\n .filter(|(_, m, _)| *m == mode)\n .collect();\n filtered.sort_by_key(|(_, _, dt)| *dt);\n filtered.reverse();\n filtered\n .into_iter()\n \n .map(|(id, _, dt)| Choice::new(format!(\"{} taking {}\", id, dt), *id))\n .collect()\n })?;\n \n Some(Transition::Pop)\n}\n"},"prefix":{"kind":"string","value":"use crate::game::{State, Transition, WizardState};\nuse crate::sandbox::gameplay::{cmp_count_fewer, cmp_count_more, cmp_duration_shorter};\nuse crate::ui::UI;\nuse abstutil::prettyprint_usize;\nuse ezgui::{\n hotkey, Choice, Color, EventCtx, GfxCtx, HorizontalAlignment, Key, Line, ModalMenu, Text,\n VerticalAlignment, Wizard,\n};\nuse geom::{Duration, Statistic};\nuse sim::{TripID, TripMode};\nuse std::collections::BTreeSet;\n\npub struct Scoreboard {\n menu: ModalMenu,\n summary: Text,\n}\n\nimpl Scoreboard {\n pub fn new(ctx: &mut EventCtx, ui: &UI) -> Scoreboard {\n let menu = ModalMenu::new(\n \"Finished trips summary\",\n vec![\n (hotkey(Key::Escape), \"quit\"),\n (hotkey(Key::B), \"browse trips\"),\n ],\n ctx,\n );\n\n let (now_all, now_aborted, now_per_mode) = ui\n .primary\n .sim\n .get_analytics()\n .all_finished_trips(ui.primary.sim.time());\n let (baseline_all, baseline_aborted, baseline_per_mode) =\n ui.prebaked.all_finished_trips(ui.primary.sim.time());\n\n \n let mut txt = Text::new();\n txt.add_appended(vec![\n Line(\"Finished trips as of \"),\n Line(ui.primary.sim.time().ampm_tostring()).fg(Color::CYAN),\n ]);\n txt.add_appended(vec![\n Line(format!(\n \" {} aborted trips (\",\n prettyprint_usize(now_aborted)\n )),\n cmp_count_fewer(now_aborted, baseline_aborted),\n Line(\")\"),\n ]);\n \n txt.add_appended(vec![\n Line(format!(\n \"{} total finished trips (\",\n prettyprint_usize(now_all.count())\n )),\n cmp_count_more(now_all.count(), baseline_all.count()),\n Line(\")\"),\n ]);\n if now_all.count() > 0 && baseline_all.count() > 0 {\n for stat in Statistic::all() {\n txt.add(Line(format!(\n \" {}: {} \",\n stat,\n now_all.select(stat).minimal_tostring()\n )));\n txt.append_all(cmp_duration_shorter(\n now_all.select(stat),\n baseline_all.select(stat),\n ));\n }\n }\n\n for mode in TripMode::all() {\n let a = &now_per_mode[&mode];\n let b = &baseline_per_mode[&mode];\n txt.add_appended(vec![\n Line(format!(\"{} {} trips (\", prettyprint_usize(a.count()), mode)),\n cmp_count_more(a.count(), b.count()),\n Line(\")\"),\n ]);\n if a.count() > 0 && b.count() > 0 {\n for stat in Statistic::all() {\n txt.add(Line(format!(\n \" {}: {} \",\n stat,\n a.select(stat).minimal_tostring()\n )));\n txt.append_all(cmp_duration_shorter(a.select(stat), b.select(stat)));\n }\n }\n }\n\n Scoreboard { menu, summary: txt }\n }\n}\n\nimpl State for Scoreboard {\n fn event(&mut self, ctx: &mut EventCtx, _: &mut UI) -> Transition {\n self.menu.event(ctx);\n if self.menu.action(\"quit\") {\n "},"suffix":{"kind":"string","value":"\n\n fn draw(&self, g: &mut GfxCtx, _: &UI) {\n g.draw_blocking_text(\n &self.summary,\n (HorizontalAlignment::Center, VerticalAlignment::Center),\n );\n self.menu.draw(g);\n }\n}\n\nfn browse_trips(wiz: &mut Wizard, ctx: &mut EventCtx, ui: &mut UI) -> Option<Transition> {\n let mut wizard = wiz.wrap(ctx);\n let (_, mode) = wizard.choose(\"Browse which trips?\", || {\n let trips = ui.primary.sim.get_finished_trips();\n let modes = trips\n .finished_trips\n .iter()\n .map(|(_, m, _)| *m)\n .collect::<BTreeSet<TripMode>>();\n TripMode::all()\n .into_iter()\n .map(|m| Choice::new(m.to_string(), m).active(modes.contains(&m)))\n .collect()\n })?;\n wizard.choose(\"Examine which trip?\", || {\n let trips = ui.primary.sim.get_finished_trips();\n let mut filtered: Vec<&(TripID, TripMode, Duration)> = trips\n .finished_trips\n .iter()\n .filter(|(_, m, _)| *m == mode)\n .collect();\n filtered.sort_by_key(|(_, _, dt)| *dt);\n filtered.reverse();\n filtered\n .into_iter()\n \n .map(|(id, _, dt)| Choice::new(format!(\"{} taking {}\", id, dt), *id))\n .collect()\n })?;\n \n Some(Transition::Pop)\n}\n"},"middle":{"kind":"string","value":"return Transition::Pop;\n }\n if self.menu.action(\"browse trips\") {\n return Transition::Push(WizardState::new(Box::new(browse_trips)));\n }\n Transition::Keep\n }"},"strategy":{"kind":"string","value":"function_block-function_prefix_line"},"context_items":{"kind":"list like","value":[{"content":"fn pick_color(wiz: &mut Wizard, ctx: &mut EventCtx, ui: &mut UI) -> Option<Transition> {\n\n let name = wiz\n\n .wrap(ctx)\n\n .choose_string(\"Change which color?\", || ui.cs.color_names())?;\n\n Some(Transition::Replace(Box::new(ColorChanger {\n\n name: name.clone(),\n\n original: ui.cs.get_modified(&name),\n\n menu: ModalMenu::new(\n\n &format!(\"Color Picker for {}\", name),\n\n vec![\n\n (hotkey(Key::Backspace), \"revert\"),\n\n (hotkey(Key::Escape), \"finalize\"),\n\n ],\n\n ctx,\n\n ),\n\n })))\n\n}\n\n\n","file_path":"game/src/debug/color_picker.rs","rank":0,"score":469391.84547574806},{"content":"fn browse_trips(wiz: &mut Wizard, ctx: &mut EventCtx, ui: &mut UI) -> Option<Transition> {\n\n let mut wizard = wiz.wrap(ctx);\n\n let mode = wizard\n\n .choose(\"Browse which trips?\", || {\n\n let trips = CompareTrips::new(\n\n ui.primary.sim.get_finished_trips(),\n\n ui.secondary.as_ref().unwrap().sim.get_finished_trips(),\n\n );\n\n let modes = trips\n\n .finished_trips\n\n .iter()\n\n .map(|(_, m, _, _)| *m)\n\n .collect::<BTreeSet<TripMode>>();\n\n TripMode::all()\n\n .into_iter()\n\n .map(|m| Choice::new(m.to_string(), m).active(modes.contains(&m)))\n\n .collect()\n\n })?\n\n .1;\n\n wizard.choose(\"Examine which trip?\", || {\n","file_path":"game/src/abtest/score.rs","rank":2,"score":460723.0853968681},{"content":"fn splash_screen(raw_wizard: &mut Wizard, ctx: &mut EventCtx, ui: &mut UI) -> Option<Transition> {\n\n let mut wizard = raw_wizard.wrap(ctx);\n\n let sandbox = \"Sandbox mode\";\n\n let challenge = \"Challenge mode\";\n\n let abtest = \"A/B Test Mode (internal/unfinished)\";\n\n let tutorial = \"Tutorial (unfinished)\";\n\n let mission = \"Internal developer tools\";\n\n let about = \"About\";\n\n let quit = \"Quit\";\n\n\n\n let dev = ui.primary.current_flags.dev;\n\n\n\n match wizard\n\n .choose(\"Welcome to A/B Street!\", || {\n\n vec![\n\n Some(Choice::new(sandbox, ()).key(Key::S)),\n\n Some(Choice::new(challenge, ()).key(Key::C)),\n\n if dev {\n\n Some(Choice::new(abtest, ()).key(Key::A))\n\n } else {\n","file_path":"game/src/splash_screen.rs","rank":3,"score":434944.1580555311},{"content":"fn warp_to(wiz: &mut Wizard, ctx: &mut EventCtx, ui: &mut UI) -> Option<Transition> {\n\n let mut wizard = wiz.wrap(ctx);\n\n let to = wizard.input_string(\"Warp to what?\")?;\n\n if let Some((id, pt, cam_zoom)) = warp_point(&to, &ui.primary) {\n\n return Some(Transition::ReplaceWithMode(\n\n Warping::new(ctx, pt, Some(cam_zoom), id, &mut ui.primary),\n\n EventLoopMode::Animation,\n\n ));\n\n }\n\n wizard.acknowledge(\"Bad warp ID\", || vec![format!(\"{} isn't a valid ID\", to)])?;\n\n Some(Transition::Pop)\n\n}\n\n\n\npub struct Warping {\n\n warper: Warper,\n\n id: Option<ID>,\n\n}\n\n\n\nimpl Warping {\n\n pub fn new(\n","file_path":"game/src/common/warp.rs","rank":4,"score":429930.2773317317},{"content":"fn jump_to_time(wiz: &mut Wizard, ctx: &mut EventCtx, ui: &mut UI) -> Option<Transition> {\n\n let t = wiz.wrap(ctx).input_time_slider(\n\n \"Jump to what time?\",\n\n ui.primary.sim.time(),\n\n Duration::END_OF_DAY,\n\n )?;\n\n let dt = t - ui.primary.sim.time();\n\n ctx.loading_screen(&format!(\"step forwards {}\", dt), |_, mut timer| {\n\n ui.primary.sim.timed_step(&ui.primary.map, dt, &mut timer);\n\n if let Some(ref mut s) = ui.secondary {\n\n s.sim.timed_step(&s.map, dt, &mut timer);\n\n }\n\n });\n\n Some(Transition::Pop)\n\n}\n","file_path":"game/src/common/time.rs","rank":5,"score":425683.857977089},{"content":"fn load_scenario(wiz: &mut Wizard, ctx: &mut EventCtx, ui: &mut UI) -> Option<Transition> {\n\n let map_name = ui.primary.map.get_name().to_string();\n\n let s = wiz.wrap(ctx).choose_string(\"Load which scenario?\", || {\n\n abstutil::list_all_objects(abstutil::SCENARIOS, &map_name)\n\n })?;\n\n let scenario = abstutil::read_binary(\n\n &abstutil::path1_bin(&map_name, abstutil::SCENARIOS, &s),\n\n &mut Timer::throwaway(),\n\n )\n\n .unwrap();\n\n Some(Transition::Replace(Box::new(\n\n scenario::ScenarioManager::new(scenario, ctx, ui),\n\n )))\n\n}\n\n\n","file_path":"game/src/mission/mod.rs","rank":6,"score":425683.857977089},{"content":"fn search_osm(wiz: &mut Wizard, ctx: &mut EventCtx, ui: &mut UI) -> Option<Transition> {\n\n let filter = wiz.wrap(ctx).input_string(\"Search for what?\")?;\n\n let mut ids = HashSet::new();\n\n let mut batch = GeomBatch::new();\n\n\n\n let map = &ui.primary.map;\n\n let color = ui.cs.get_def(\"search result\", Color::RED);\n\n for r in map.all_roads() {\n\n if r.osm_tags\n\n .iter()\n\n .any(|(k, v)| format!(\"{} = {}\", k, v).contains(&filter))\n\n {\n\n for l in r.all_lanes() {\n\n ids.insert(ID::Lane(l));\n\n }\n\n batch.push(color, r.get_thick_polygon().unwrap());\n\n }\n\n }\n\n for b in map.all_buildings() {\n\n if b.osm_tags\n","file_path":"game/src/debug/mod.rs","rank":7,"score":425683.857977089},{"content":"fn load_edits(wiz: &mut Wizard, ctx: &mut EventCtx, ui: &mut UI) -> Option<Transition> {\n\n let mut wizard = wiz.wrap(ctx);\n\n\n\n if ui.primary.map.get_edits().dirty {\n\n let save = \"save edits\";\n\n let discard = \"discard\";\n\n if wizard\n\n .choose_string(\"Save current edits first?\", || vec![save, discard])?\n\n .as_str()\n\n == save\n\n {\n\n save_edits(&mut wizard, ui)?;\n\n wizard.reset();\n\n }\n\n }\n\n\n\n // TODO Exclude current\n\n let map_name = ui.primary.map.get_name().to_string();\n\n let (_, new_edits) = wizard.choose(\"Load which map edits?\", || {\n\n let mut list = Choice::from(abstutil::load_all_objects(abstutil::EDITS, &map_name));\n\n list.push(Choice::new(\"no_edits\", MapEdits::new(map_name.clone())));\n\n list\n\n })?;\n\n apply_map_edits(&mut ui.primary, &ui.cs, ctx, new_edits);\n\n ui.primary.map.mark_edits_fresh();\n\n Some(Transition::Pop)\n\n}\n\n\n","file_path":"game/src/edit/mod.rs","rank":8,"score":425683.857977089},{"content":"fn load_savestate(wiz: &mut Wizard, ctx: &mut EventCtx, ui: &mut UI) -> Option<Transition> {\n\n let path = ui.primary.sim.save_dir();\n\n\n\n let ss = wiz.wrap(ctx).choose_string(\"Load which savestate?\", || {\n\n abstutil::list_dir(std::path::Path::new(&path))\n\n })?;\n\n\n\n ctx.loading_screen(\"load savestate\", |ctx, mut timer| {\n\n ui.primary.sim = Sim::load_savestate(ss, &mut timer).expect(\"Can't load savestate\");\n\n ui.recalculate_current_selection(ctx);\n\n });\n\n Some(Transition::Pop)\n\n}\n","file_path":"game/src/sandbox/mod.rs","rank":9,"score":425683.857977089},{"content":"fn choose_shortcut(wiz: &mut Wizard, ctx: &mut EventCtx, ui: &mut UI) -> Option<Transition> {\n\n let center = ctx\n\n .canvas\n\n .center_to_map_pt()\n\n .forcibly_to_gps(&ui.primary.map.get_gps_bounds());\n\n let cam_zoom = ctx.canvas.cam_zoom;\n\n\n\n let mut wizard = wiz.wrap(ctx);\n\n let (_, mut s) = wizard.choose(\"Jump to which shortcut?\", || {\n\n // TODO Handle >9\n\n // TODO Allow deleting\n\n let keys = vec![\n\n Key::Num1,\n\n Key::Num2,\n\n Key::Num3,\n\n Key::Num4,\n\n Key::Num5,\n\n Key::Num6,\n\n Key::Num7,\n\n Key::Num8,\n","file_path":"game/src/common/shortcuts.rs","rank":10,"score":425683.857977089},{"content":"fn change_scenario(wiz: &mut Wizard, ctx: &mut EventCtx, ui: &mut UI) -> Option<Transition> {\n\n let num_agents = ui.primary.current_flags.num_agents;\n\n let builtin = if let Some(n) = num_agents {\n\n format!(\"random scenario with {} agents\", n)\n\n } else {\n\n \"random scenario with some agents\".to_string()\n\n };\n\n let scenario_name = wiz\n\n .wrap(ctx)\n\n .choose_string(\"Instantiate which scenario?\", || {\n\n let mut list =\n\n abstutil::list_all_objects(abstutil::SCENARIOS, ui.primary.map.get_name());\n\n list.push(builtin.clone());\n\n list.push(\"just buses\".to_string());\n\n list\n\n })?;\n\n Some(Transition::PopThenReplace(Box::new(SandboxMode::new(\n\n ctx,\n\n ui,\n\n GameplayMode::PlayScenario(scenario_name),\n\n ))))\n\n}\n\n\n","file_path":"game/src/sandbox/gameplay/mod.rs","rank":11,"score":421580.9841398108},{"content":"fn create_new_scenario(wiz: &mut Wizard, ctx: &mut EventCtx, ui: &mut UI) -> Option<Transition> {\n\n let name = wiz.wrap(ctx).input_string(\"Name the scenario\")?;\n\n let mut s = Scenario::empty(&ui.primary.map);\n\n s.seed_buses = true;\n\n s.scenario_name = name;\n\n Some(Transition::Replace(Box::new(\n\n scenario::ScenarioManager::new(s, ctx, ui),\n\n )))\n\n}\n\n\n","file_path":"game/src/mission/mod.rs","rank":12,"score":421580.9841398109},{"content":"fn pick_ab_test(wiz: &mut Wizard, ctx: &mut EventCtx, ui: &mut UI) -> Option<Transition> {\n\n let mut wizard = wiz.wrap(ctx);\n\n let load_existing = \"Load existing A/B test\";\n\n let create_new = \"Create new A/B test\";\n\n let ab_test = if wizard.choose_string(\"What A/B test to manage?\", || {\n\n vec![load_existing, create_new]\n\n })? == load_existing\n\n {\n\n wizard\n\n .choose(\"Load which A/B test?\", || {\n\n Choice::from(abstutil::load_all_objects(\n\n abstutil::AB_TESTS,\n\n ui.primary.map.get_name(),\n\n ))\n\n })?\n\n .1\n\n } else {\n\n let test_name = wizard.input_string(\"Name the A/B test\")?;\n\n let map_name = ui.primary.map.get_name();\n\n\n","file_path":"game/src/abtest/setup.rs","rank":13,"score":421580.98413981084},{"content":"fn load_map(wiz: &mut Wizard, ctx: &mut EventCtx, ui: &mut UI) -> Option<Transition> {\n\n if let Some(name) = wiz.wrap(ctx).choose_string(\"Load which map?\", || {\n\n let current_map = ui.primary.map.get_name();\n\n abstutil::list_all_objects(\"maps\", \"\")\n\n .into_iter()\n\n .filter(|n| n != current_map)\n\n .collect()\n\n }) {\n\n ui.switch_map(ctx, &name);\n\n Some(Transition::PopThenReplace(Box::new(SandboxMode::new(\n\n ctx,\n\n ui,\n\n // TODO If we were playing a scenario, load that one...\n\n GameplayMode::Freeform,\n\n ))))\n\n } else if wiz.aborted() {\n\n Some(Transition::Pop)\n\n } else {\n\n None\n\n }\n\n}\n\n\n","file_path":"game/src/sandbox/gameplay/mod.rs","rank":14,"score":421580.9841398108},{"content":"pub fn faster_trips_panel(mode: TripMode, ui: &UI) -> Text {\n\n let time = ui.primary.sim.time();\n\n let now = ui.primary.sim.get_analytics().finished_trips(time, mode);\n\n let baseline = ui.prebaked.finished_trips(time, mode);\n\n\n\n // Enable to debug why sim results don't match prebaked.\n\n if false && !now.seems_eq(&baseline) {\n\n abstutil::write_json(\n\n \"../current_sim.json\",\n\n &ui.primary.sim.get_analytics().finished_trips,\n\n )\n\n .unwrap();\n\n let filtered = ui\n\n .prebaked\n\n .finished_trips\n\n .iter()\n\n .filter(|(t, _, _, _)| *t <= time)\n\n .cloned()\n\n .collect::<Vec<_>>();\n\n abstutil::write_json(\"../prebaked.json\", &filtered).unwrap();\n","file_path":"game/src/sandbox/gameplay/faster_trips.rs","rank":15,"score":416868.61594283406},{"content":"pub fn save_edits(wizard: &mut WrappedWizard, ui: &mut UI) -> Option<()> {\n\n let map = &mut ui.primary.map;\n\n\n\n let rename = if map.get_edits().edits_name == \"no_edits\" {\n\n Some(wizard.input_string(\"Name these map edits\")?)\n\n } else {\n\n None\n\n };\n\n // TODO Don't allow naming them no_edits!\n\n\n\n // TODO Do it this weird way to avoid saving edits on every event. :P\n\n // TODO Do some kind of versioning? Don't ask this if the file doesn't exist yet?\n\n let save = \"save edits\";\n\n let cancel = \"cancel\";\n\n if wizard\n\n .choose_string(\"Overwrite edits?\", || vec![save, cancel])?\n\n .as_str()\n\n == save\n\n {\n\n if let Some(name) = rename {\n\n let mut edits = map.get_edits().clone();\n\n edits.edits_name = name;\n\n map.apply_edits(edits, &mut Timer::new(\"name map edits\"));\n\n }\n\n map.save_edits();\n\n }\n\n Some(())\n\n}\n\n\n","file_path":"game/src/edit/mod.rs","rank":16,"score":375298.1232267339},{"content":"pub fn spawn_agents_around(i: IntersectionID, ui: &mut UI, ctx: &EventCtx) {\n\n let map = &ui.primary.map;\n\n let sim = &mut ui.primary.sim;\n\n let mut rng = ui.primary.current_flags.sim_flags.make_rng();\n\n\n\n for l in &map.get_i(i).incoming_lanes {\n\n let lane = map.get_l(*l);\n\n if lane.is_driving() || lane.is_biking() {\n\n for _ in 0..10 {\n\n let vehicle_spec = if rng.gen_bool(0.7) && lane.is_driving() {\n\n Scenario::rand_car(&mut rng)\n\n } else {\n\n Scenario::rand_bike(&mut rng)\n\n };\n\n if vehicle_spec.length > lane.length() {\n\n continue;\n\n }\n\n sim.schedule_trip(\n\n sim.time(),\n\n TripSpec::CarAppearing {\n","file_path":"game/src/sandbox/gameplay/spawner.rs","rank":17,"score":373050.42673103453},{"content":"fn launch_test(test: &ABTest, ui: &mut UI, ctx: &mut EventCtx) -> ABTestMode {\n\n let secondary = ctx.loading_screen(\n\n &format!(\"Launching A/B test {}\", test.test_name),\n\n |ctx, mut timer| {\n\n let scenario: Scenario = abstutil::read_binary(\n\n &abstutil::path1_bin(&test.map_name, abstutil::SCENARIOS, &test.scenario_name),\n\n &mut timer,\n\n )\n\n .expect(\"loading scenario failed\");\n\n\n\n {\n\n timer.start(\"load primary\");\n\n if ui.primary.current_flags.sim_flags.rng_seed.is_none() {\n\n ui.primary.current_flags.sim_flags.rng_seed = Some(42);\n\n }\n\n ui.primary.current_flags.sim_flags.opts.run_name =\n\n format!(\"{} with {}\", test.test_name, test.edits1_name);\n\n ui.primary.current_flags.sim_flags.opts.savestate_every = None;\n\n\n\n apply_map_edits(\n","file_path":"game/src/abtest/setup.rs","rank":18,"score":357893.03784804826},{"content":"// For easy ModalMenu construction\n\npub fn hotkey(key: Key) -> Option<MultiKey> {\n\n Some(MultiKey { key, lctrl: false })\n\n}\n\n\n","file_path":"ezgui/src/event.rs","rank":19,"score":353982.7012900219},{"content":"fn bus_route_panel(id: BusRouteID, ui: &UI, stat: Statistic) -> Text {\n\n let now = ui\n\n .primary\n\n .sim\n\n .get_analytics()\n\n .bus_arrivals(ui.primary.sim.time(), id);\n\n let baseline = ui.prebaked.bus_arrivals(ui.primary.sim.time(), id);\n\n\n\n let route = ui.primary.map.get_br(id);\n\n let mut txt = Text::new();\n\n txt.add(Line(format!(\"{} delay between stops\", stat)));\n\n for idx1 in 0..route.stops.len() {\n\n let idx2 = if idx1 == route.stops.len() - 1 {\n\n 0\n\n } else {\n\n idx1 + 1\n\n };\n\n // TODO Also display number of arrivals...\n\n txt.add(Line(format!(\"Stop {}->{}: \", idx1 + 1, idx2 + 1)));\n\n if let Some(ref stats1) = now.get(&route.stops[idx2]) {\n","file_path":"game/src/sandbox/gameplay/optimize_bus.rs","rank":20,"score":342330.131176606},{"content":"fn launch_savestate(test: &ABTest, ss_path: String, ui: &mut UI, ctx: &mut EventCtx) -> ABTestMode {\n\n ctx.loading_screen(\n\n &format!(\"Launch A/B test from savestate {}\", ss_path),\n\n |ctx, mut timer| {\n\n let ss: ABTestSavestate = abstutil::read_binary(&ss_path, &mut timer).unwrap();\n\n\n\n timer.start(\"setup primary\");\n\n ui.primary.map = ss.primary_map;\n\n ui.primary.sim = ss.primary_sim;\n\n ui.primary.draw_map = DrawMap::new(\n\n &ui.primary.map,\n\n &ui.primary.current_flags,\n\n &ui.cs,\n\n ctx,\n\n &mut timer,\n\n );\n\n timer.stop(\"setup primary\");\n\n\n\n timer.start(\"setup secondary\");\n\n let secondary = PerMapUI {\n","file_path":"game/src/abtest/setup.rs","rank":21,"score":340032.78856819053},{"content":"fn color_for_mode(m: TripMode, ui: &UI) -> Color {\n\n match m {\n\n TripMode::Walk => ui.cs.get(\"unzoomed pedestrian\"),\n\n TripMode::Bike => ui.cs.get(\"unzoomed bike\"),\n\n TripMode::Transit => ui.cs.get(\"unzoomed bus\"),\n\n TripMode::Drive => ui.cs.get(\"unzoomed car\"),\n\n }\n\n}\n","file_path":"game/src/sandbox/overlays.rs","rank":22,"score":338405.07968383096},{"content":"#[allow(non_snake_case)]\n\npub fn Line<S: Into<String>>(text: S) -> TextSpan {\n\n TextSpan {\n\n text: text.into(),\n\n fg_color: FG_COLOR,\n\n size: None,\n\n }\n\n}\n\n\n\n#[derive(Debug, Clone)]\n\npub struct Text {\n\n // The bg_color will cover the entire block, but some lines can have extra highlighting.\n\n lines: Vec<(Option<Color>, Vec<TextSpan>)>,\n\n bg_color: Option<Color>,\n\n pub override_width: Option<f64>,\n\n pub override_height: Option<f64>,\n\n}\n\n\n\nimpl Text {\n\n pub fn new() -> Text {\n\n Text {\n","file_path":"ezgui/src/text.rs","rank":23,"score":330901.12930167606},{"content":"fn show_route(trip: TripID, ui: &UI, ctx: &EventCtx) -> RouteViewer {\n\n let time = ui.primary.sim.time();\n\n match ui.primary.sim.trip_to_agent(trip) {\n\n TripResult::Ok(agent) => RouteViewer::Active(\n\n time,\n\n trip,\n\n ui.primary\n\n .sim\n\n .trace_route(agent, &ui.primary.map, None)\n\n .map(|trace| {\n\n let mut zoomed = GeomBatch::new();\n\n zoomed.extend(\n\n ui.cs.get(\"route\").alpha(0.8),\n\n dashed_lines(\n\n &trace,\n\n Distance::meters(0.75),\n\n Distance::meters(1.0),\n\n Distance::meters(0.4),\n\n ),\n\n );\n","file_path":"game/src/common/route_viewer.rs","rank":24,"score":329875.32701468025},{"content":"fn info_for(id: ID, ui: &UI, ctx: &EventCtx) -> Text {\n\n let (map, sim, draw_map) = (&ui.primary.map, &ui.primary.sim, &ui.primary.draw_map);\n\n let mut txt = Text::new();\n\n // TODO Technically we should recalculate all of this as the window resizes, then.\n\n txt.override_width = Some(0.7 * ctx.canvas.window_width);\n\n txt.override_height = Some(0.7 * ctx.canvas.window_height);\n\n\n\n txt.extend(&CommonState::default_osd(id.clone(), ui));\n\n txt.highlight_last_line(Color::BLUE);\n\n let id_color = ui.cs.get(\"OSD ID color\");\n\n let name_color = ui.cs.get(\"OSD name color\");\n\n\n\n match id {\n\n ID::Road(_) => unreachable!(),\n\n ID::Lane(id) => {\n\n let l = map.get_l(id);\n\n let r = map.get_r(l.parent);\n\n\n\n txt.add_appended(vec![\n\n Line(\"Parent \"),\n","file_path":"game/src/common/info.rs","rank":25,"score":329365.6760593519},{"content":"fn change_traffic_signal(signal: ControlTrafficSignal, ui: &mut UI, ctx: &mut EventCtx) {\n\n let mut edits = ui.primary.map.get_edits().clone();\n\n // TODO Only record one command for the entire session. Otherwise, we can exit this editor and\n\n // undo a few times, potentially ending at an invalid state!\n\n if edits\n\n .commands\n\n .last()\n\n .map(|cmd| match cmd {\n\n EditCmd::ChangeTrafficSignal(ref s) => s.id == signal.id,\n\n _ => false,\n\n })\n\n .unwrap_or(false)\n\n {\n\n edits.commands.pop();\n\n }\n\n edits.commands.push(EditCmd::ChangeTrafficSignal(signal));\n\n apply_map_edits(&mut ui.primary, &ui.cs, ctx, edits);\n\n}\n\n\n","file_path":"game/src/edit/traffic_signals.rs","rank":26,"score":327836.1712071957},{"content":"pub fn clip_trips(map: &Map, timer: &mut Timer) -> (Vec<Trip>, HashMap<BuildingID, Parcel>) {\n\n let popdat: PopDat = abstutil::read_binary(\"../data/shapes/popdat.bin\", timer)\n\n .expect(\"Couldn't load popdat.bin\");\n\n\n\n let mut osm_id_to_bldg = HashMap::new();\n\n for b in map.all_buildings() {\n\n osm_id_to_bldg.insert(b.osm_way_id, b.id);\n\n }\n\n let bounds = map.get_gps_bounds();\n\n // TODO Figure out why some polygon centers are broken\n\n let incoming_borders_walking: Vec<(IntersectionID, LonLat)> = map\n\n .all_incoming_borders()\n\n .into_iter()\n\n .filter(|i| {\n\n !i.get_outgoing_lanes(map, PathConstraints::Pedestrian)\n\n .is_empty()\n\n })\n\n .filter_map(|i| i.polygon.center().to_gps(bounds).map(|pt| (i.id, pt)))\n\n .collect();\n\n let incoming_borders_driving: Vec<(IntersectionID, LonLat)> = map\n","file_path":"popdat/src/trips.rs","rank":27,"score":312916.9330061356},{"content":"fn bus_delays(id: BusRouteID, ui: &UI, ctx: &mut EventCtx) -> Plot<Duration> {\n\n let route = ui.primary.map.get_br(id);\n\n let mut delays_per_stop = ui\n\n .primary\n\n .sim\n\n .get_analytics()\n\n .bus_arrivals_over_time(ui.primary.sim.time(), id);\n\n\n\n let mut series = Vec::new();\n\n for idx1 in 0..route.stops.len() {\n\n let idx2 = if idx1 == route.stops.len() - 1 {\n\n 0\n\n } else {\n\n idx1 + 1\n\n };\n\n series.push(Series {\n\n label: format!(\"Stop {}->{}\", idx1 + 1, idx2 + 1),\n\n color: rotating_color_total(idx1, route.stops.len()),\n\n pts: delays_per_stop\n\n .remove(&route.stops[idx2])\n","file_path":"game/src/sandbox/gameplay/optimize_bus.rs","rank":28,"score":297941.00168824464},{"content":"pub fn rotating_color_total(idx: usize, total: usize) -> Color {\n\n if total > 9 {\n\n return rotating_color_total(idx, 9);\n\n }\n\n if total < 3 {\n\n return rotating_color_total(idx, 3);\n\n }\n\n\n\n // TODO Cache this\n\n // TODO This palette doesn't contrast well with other stuff\n\n let colors: Vec<Color> =\n\n colorbrewer::get_color_ramp(colorbrewer::Palette::YlOrBr, total as u32)\n\n .unwrap()\n\n .into_iter()\n\n .map(Color::from_hex)\n\n .collect();\n\n\n\n colors[idx % total]\n\n}\n","file_path":"game/src/helpers.rs","rank":29,"score":297585.12337163475},{"content":"fn styled_kv(txt: &mut Text, tags: &BTreeMap<String, String>) {\n\n for (k, v) in tags {\n\n txt.add_appended(vec![\n\n Line(k).fg(Color::RED),\n\n Line(\" = \"),\n\n Line(v).fg(Color::CYAN),\n\n ]);\n\n }\n\n}\n","file_path":"game/src/common/info.rs","rank":30,"score":295441.06538251974},{"content":"fn preview_all_intersections(model: &Model, ctx: &EventCtx) -> (Drawable, Vec<(Text, Pt2D)>) {\n\n let mut batch = GeomBatch::new();\n\n let mut timer = Timer::new(\"preview all intersections\");\n\n timer.start_iter(\"preview\", model.map.intersections.len());\n\n for i in model.map.intersections.keys() {\n\n timer.next();\n\n if model.map.roads_per_intersection(*i).is_empty() {\n\n continue;\n\n }\n\n let (intersection, _, _) = model.map.preview_intersection(*i, &mut timer);\n\n batch.push(Color::ORANGE.alpha(0.5), intersection);\n\n }\n\n (ctx.prerender.upload(batch), Vec::new())\n\n}\n\n\n","file_path":"map_editor/src/main.rs","rank":31,"score":291981.256090564},{"content":"fn find_overlapping_intersections(model: &Model, ctx: &EventCtx) -> (Drawable, Vec<(Text, Pt2D)>) {\n\n let mut timer = Timer::new(\"find overlapping intersections\");\n\n let mut polygons = Vec::new();\n\n for i in model.map.intersections.keys() {\n\n if model.map.roads_per_intersection(*i).is_empty() {\n\n continue;\n\n }\n\n let (intersection, _, _) = model.map.preview_intersection(*i, &mut timer);\n\n polygons.push((*i, intersection));\n\n }\n\n\n\n let mut overlap = Vec::new();\n\n timer.start_iter(\n\n \"terrible quadratic intersection check\",\n\n polygons.len().pow(2),\n\n );\n\n for (i1, poly1) in &polygons {\n\n for (i2, poly2) in &polygons {\n\n timer.next();\n\n if i1 >= i2 {\n","file_path":"map_editor/src/main.rs","rank":32,"score":288933.1588072788},{"content":"pub fn lctrl(key: Key) -> Option<MultiKey> {\n\n Some(MultiKey { key, lctrl: true })\n\n}\n","file_path":"ezgui/src/event.rs","rank":33,"score":279930.0323458883},{"content":"pub fn run<G: GUI, F: FnOnce(&mut EventCtx) -> G>(settings: Settings, make_gui: F) {\n\n let events_loop = glutin::EventsLoop::new();\n\n let window = glutin::WindowBuilder::new()\n\n .with_title(settings.window_title)\n\n .with_dimensions(glutin::dpi::LogicalSize::new(\n\n settings.initial_dims.0,\n\n settings.initial_dims.1,\n\n ));\n\n // multisampling: 2 looks bad, 4 looks fine\n\n //\n\n // The Z values are very simple:\n\n // 1.0: The buffer is reset every frame\n\n // 0.5: Map-space geometry and text\n\n // 0.1: Screen-space text\n\n // 0.0: Screen-space geometry\n\n // Had weird issues with Z buffering not working as intended, so this is slightly more\n\n // complicated than necessary to work.\n\n let context = glutin::ContextBuilder::new()\n\n .with_multisampling(4)\n\n .with_depth_buffer(2);\n","file_path":"ezgui/src/runner.rs","rank":34,"score":277198.5378321532},{"content":"// TODO Word wrap\n\npub fn msg<S: Into<String>>(title: &'static str, lines: Vec<S>) -> Box<dyn State> {\n\n let str_lines: Vec<String> = lines.into_iter().map(|l| l.into()).collect();\n\n WizardState::new(Box::new(move |wiz, ctx, _| {\n\n wiz.wrap(ctx).acknowledge(title, || str_lines.clone())?;\n\n Some(Transition::Pop)\n\n }))\n\n}\n","file_path":"game/src/game.rs","rank":35,"score":269988.93738607364},{"content":"pub fn run(t: &mut TestRunner) {\n\n t.run_slow(\"bus_reaches_stops\", |h| {\n\n let mut flags = SimFlags::for_test(\"bus_reaches_stops\");\n\n flags.opts.savestate_every = Some(Duration::seconds(30.0));\n\n let (map, mut sim, _) = flags.load(&mut Timer::throwaway());\n\n let route = map.get_bus_route(\"49\").unwrap();\n\n let buses = sim.seed_bus_route(route, &map, &mut Timer::throwaway());\n\n let bus = buses[0];\n\n h.setup_done(&sim);\n\n\n\n let mut expectations: Vec<Event> = Vec::new();\n\n // TODO assert stuff about other buses as well, although the timing is a little unclear\n\n for stop in route.stops.iter().skip(1) {\n\n expectations.push(Event::BusArrivedAtStop(bus, route.id, *stop));\n\n expectations.push(Event::BusDepartedFromStop(bus, route.id, *stop));\n\n }\n\n\n\n sim.run_until_expectations_met(&map, expectations, Duration::minutes(10));\n\n // Make sure buses don't block a sim from being considered done\n\n sim.just_run_until_done(&map, Some(Duration::minutes(11)));\n","file_path":"tests/src/transit.rs","rank":36,"score":263582.92976958357},{"content":"pub fn run(t: &mut TestRunner) {\n\n t.run_slow(\"bike_from_border\", |h| {\n\n let mut flags = SimFlags::for_test(\"bike_from_border\");\n\n flags.opts.savestate_every = Some(Duration::seconds(30.0));\n\n let (map, mut sim, mut rng) = flags.load(&mut Timer::throwaway());\n\n // TODO Hardcoding IDs is fragile\n\n let goal_bldg = BuildingID(319);\n\n let (ped, bike) = sim.schedule_trip(\n\n Duration::ZERO,\n\n TripSpec::UsingBike {\n\n start: SidewalkSpot::start_at_border(IntersectionID(186), &map).unwrap(),\n\n vehicle: Scenario::rand_bike(&mut rng),\n\n goal: DrivingGoal::ParkNear(goal_bldg),\n\n ped_speed: Scenario::rand_ped_speed(&mut rng),\n\n },\n\n &map,\n\n );\n\n sim.spawn_all_trips(&map, &mut Timer::throwaway(), false);\n\n h.setup_done(&sim);\n\n\n","file_path":"tests/src/trips.rs","rank":37,"score":263457.37648314197},{"content":"pub fn run(t: &mut TestRunner) {\n\n t.run_slow(\"serialization\", |_| {\n\n let (map, mut sim, mut rng) =\n\n SimFlags::for_test(\"serialization\").load(&mut Timer::throwaway());\n\n Scenario::small_run(&map).instantiate(&mut sim, &map, &mut rng, &mut Timer::throwaway());\n\n\n\n // Does savestating produce the same string?\n\n let save1 = abstutil::to_json(&sim);\n\n let save2 = abstutil::to_json(&sim);\n\n assert_eq!(save1, save2);\n\n });\n\n\n\n t.run_slow(\"from_scratch\", |_| {\n\n println!(\"Creating two simulations\");\n\n let flags = SimFlags::for_test(\"from_scratch_1\");\n\n let (map, mut sim1, _) = flags.load(&mut Timer::throwaway());\n\n let mut sim2 = Sim::new(\n\n &map,\n\n SimOptions::new(\"from_scratch_2\"),\n\n &mut Timer::throwaway(),\n","file_path":"tests/src/sim_determinism.rs","rank":38,"score":258092.130080642},{"content":"pub fn run(t: &mut TestRunner) {\n\n t.run_slow(\"small_spawn_completes\", |h| {\n\n let mut flags = SimFlags::for_test(\"aorta_model_completes\");\n\n flags.opts.savestate_every = Some(Duration::seconds(30.0));\n\n let (map, mut sim, mut rng) = flags.load(&mut Timer::throwaway());\n\n Scenario::small_run(&map).instantiate(&mut sim, &map, &mut rng, &mut Timer::throwaway());\n\n h.setup_done(&sim);\n\n sim.just_run_until_done(&map, Some(Duration::minutes(70)));\n\n });\n\n}\n","file_path":"tests/src/sim_completion.rs","rank":39,"score":258092.130080642},{"content":"pub fn draw_text_bubble(\n\n g: &mut GfxCtx,\n\n top_left: ScreenPt,\n\n txt: &Text,\n\n // Callers almost always calculate this anyway\n\n (total_width, total_height): (f64, f64),\n\n) -> ScreenRectangle {\n\n // TODO Is it expensive to constantly change uniforms and the shader program?\n\n g.fork_screenspace();\n\n\n\n if let Some(c) = txt.bg_color {\n\n g.draw_polygon(\n\n c,\n\n &Polygon::rectangle_topleft(\n\n Pt2D::new(top_left.x, top_left.y),\n\n Distance::meters(total_width),\n\n Distance::meters(total_height),\n\n ),\n\n );\n\n }\n","file_path":"ezgui/src/text.rs","rank":40,"score":255879.61953778082},{"content":"pub fn draw_text_bubble_mapspace(\n\n g: &mut GfxCtx,\n\n top_left: Pt2D,\n\n txt: &Text,\n\n // Callers almost always calculate this anyway\n\n (total_width, total_height): (f64, f64),\n\n) {\n\n if let Some(c) = txt.bg_color {\n\n g.draw_polygon(\n\n c,\n\n &Polygon::rectangle_topleft(\n\n Pt2D::new(top_left.x(), top_left.y()),\n\n Distance::meters(total_width / SCALE_DOWN),\n\n Distance::meters(total_height / SCALE_DOWN),\n\n ),\n\n );\n\n }\n\n\n\n let mut y = top_left.y();\n\n for (line_color, line) in &txt.lines {\n","file_path":"ezgui/src/text.rs","rank":41,"score":251371.76176486752},{"content":"pub fn trips_to_scenario(map: &Map, timer: &mut Timer) -> Scenario {\n\n let (trips, _) = clip_trips(map, timer);\n\n // TODO Don't clone trips for parallelize\n\n let individ_trips = timer\n\n .parallelize(\"turn PSRC trips into SpawnTrips\", trips.clone(), |trip| {\n\n trip.to_spawn_trip(map)\n\n })\n\n .into_iter()\n\n .flatten()\n\n .collect();\n\n\n\n // How many parked cars do we need to spawn near each building?\n\n // TODO This assumes trips are instantaneous. At runtime, somebody might try to use a parked\n\n // car from a building, but one hasn't been delivered yet.\n\n let mut individ_parked_cars = BTreeMap::new();\n\n let mut avail_per_bldg = BTreeMap::new();\n\n for b in map.all_buildings() {\n\n individ_parked_cars.insert(b.id, 0);\n\n avail_per_bldg.insert(b.id, 0);\n\n }\n","file_path":"popdat/src/trips.rs","rank":42,"score":249763.60967639403},{"content":"// TODO Temporarily public for debugging.\n\n// TODO This should just draw the turn geometry thickened, once that's stable.\n\npub fn calculate_corners(i: &Intersection, map: &Map, timer: &mut Timer) -> Vec<Polygon> {\n\n let mut corners = Vec::new();\n\n\n\n for turn in &map.get_turns_in_intersection(i.id) {\n\n if turn.turn_type == TurnType::SharedSidewalkCorner {\n\n // Avoid double-rendering\n\n if map.get_l(turn.id.src).dst_i != i.id {\n\n continue;\n\n }\n\n\n\n // Special case for dead-ends: just thicken the geometry.\n\n if i.roads.len() == 1 {\n\n corners.push(turn.geom.make_polygons(LANE_THICKNESS));\n\n continue;\n\n }\n\n\n\n let l1 = map.get_l(turn.id.src);\n\n let l2 = map.get_l(turn.id.dst);\n\n\n\n let src_line = l1.last_line().shift_left(LANE_THICKNESS / 2.0);\n","file_path":"game/src/render/intersection.rs","rank":43,"score":244464.1609574018},{"content":"fn color_turn_type(t: TurnType, ui: &UI) -> Color {\n\n match t {\n\n TurnType::SharedSidewalkCorner => {\n\n ui.cs.get_def(\"shared sidewalk corner turn\", Color::BLACK)\n\n }\n\n TurnType::Crosswalk => ui.cs.get_def(\"crosswalk turn\", Color::WHITE),\n\n TurnType::Straight => ui.cs.get_def(\"straight turn\", Color::BLUE),\n\n TurnType::LaneChangeLeft => ui.cs.get_def(\"change lanes left turn\", Color::CYAN),\n\n TurnType::LaneChangeRight => ui.cs.get_def(\"change lanes right turn\", Color::PURPLE),\n\n TurnType::Right => ui.cs.get_def(\"right turn\", Color::GREEN),\n\n TurnType::Left => ui.cs.get_def(\"left turn\", Color::RED),\n\n }\n\n}\n\n\n","file_path":"game/src/common/turn_cycler.rs","rank":44,"score":238229.42178648995},{"content":"fn gridlock_panel(ui: &UI) -> Text {\n\n let (now_all, _, now_per_mode) = ui\n\n .primary\n\n .sim\n\n .get_analytics()\n\n .all_finished_trips(ui.primary.sim.time());\n\n let (baseline_all, _, baseline_per_mode) =\n\n ui.prebaked.all_finished_trips(ui.primary.sim.time());\n\n\n\n let mut txt = Text::new();\n\n txt.add_appended(vec![\n\n Line(format!(\n\n \"{} total finished trips (\",\n\n prettyprint_usize(now_all.count())\n\n )),\n\n cmp_count_fewer(now_all.count(), baseline_all.count()),\n\n Line(\")\"),\n\n ]);\n\n\n\n for mode in TripMode::all() {\n","file_path":"game/src/sandbox/gameplay/create_gridlock.rs","rank":45,"score":237743.3100591523},{"content":"#[derive(Serialize, Deserialize, PartialEq, Debug)]\n\nstruct Trip {\n\n id: TripID,\n\n spawned_at: Duration,\n\n finished_at: Option<Duration>,\n\n aborted: bool,\n\n legs: VecDeque<TripLeg>,\n\n mode: TripMode,\n\n start: TripStart,\n\n end: TripEnd,\n\n}\n\n\n\nimpl Trip {\n\n fn uses_car(&self, id: CarID, home: BuildingID) -> bool {\n\n self.legs.iter().any(|l| match l {\n\n TripLeg::Walk(_, _, ref walk_to) => match walk_to.connection {\n\n SidewalkPOI::DeferredParkingSpot(b, _) => b == home,\n\n _ => false,\n\n },\n\n // No need to look up the contents of a SidewalkPOI::ParkingSpot. If a trip uses a\n\n // specific parked car, then there'll be a TripLeg::Drive with it already.\n","file_path":"sim/src/trips.rs","rank":46,"score":237407.07685323246},{"content":"fn input_weighted_usize(wizard: &mut WrappedWizard, query: &str) -> Option<WeightedUsizeChoice> {\n\n wizard.input_something(\n\n query,\n\n None,\n\n Box::new(|line| WeightedUsizeChoice::parse(&line)),\n\n )\n\n}\n\n\n","file_path":"game/src/mission/scenario.rs","rank":47,"score":235184.00223951737},{"content":"fn debug_all_routes(ui: &mut UI) -> AllRoutesViewer {\n\n let mut traces: Vec<PolyLine> = Vec::new();\n\n let trips: Vec<TripID> = ui\n\n .primary\n\n .sim\n\n .get_trip_positions(&ui.primary.map)\n\n .canonical_pt_per_trip\n\n .keys()\n\n .cloned()\n\n .collect();\n\n for trip in trips {\n\n if let Some(agent) = ui.primary.sim.trip_to_agent(trip).ok() {\n\n if let Some(trace) = ui.primary.sim.trace_route(agent, &ui.primary.map, None) {\n\n traces.push(trace);\n\n }\n\n }\n\n }\n\n AllRoutesViewer::Active(ui.primary.sim.time(), traces)\n\n}\n","file_path":"game/src/debug/routes.rs","rank":48,"score":232914.3706008448},{"content":"fn clip_tracts(popdat: &PopDat, ui: &UI, timer: &mut Timer) -> BTreeMap<String, Tract> {\n\n // TODO Partial clipping could be neat, except it'd be confusing to interpret totals.\n\n let mut results = BTreeMap::new();\n\n timer.start_iter(\"clip tracts\", popdat.tracts.len());\n\n for (name, tract) in &popdat.tracts {\n\n timer.next();\n\n if let Some(pts) = ui.primary.map.get_gps_bounds().try_convert(&tract.pts) {\n\n // TODO We should actually make sure the polygon is completely contained within the\n\n // map's boundary.\n\n let polygon = Polygon::new(&pts);\n\n\n\n // TODO Don't just use the center...\n\n let mut num_bldgs = 0;\n\n let mut num_parking_spots = 0;\n\n for id in ui\n\n .primary\n\n .draw_map\n\n .get_matching_objects(polygon.get_bounds())\n\n {\n\n match id {\n","file_path":"game/src/mission/dataviz.rs","rank":49,"score":230913.79685996688},{"content":"pub fn retain_btreeset<K: Ord + Clone, F: FnMut(&K) -> bool>(set: &mut BTreeSet<K>, mut keep: F) {\n\n let mut remove: Vec<K> = Vec::new();\n\n for k in set.iter() {\n\n if !keep(k) {\n\n remove.push(k.clone());\n\n }\n\n }\n\n for k in remove {\n\n set.remove(&k);\n\n }\n\n}\n\n\n","file_path":"abstutil/src/collections.rs","rank":50,"score":229692.44074913766},{"content":"pub fn rotating_color(idx: usize) -> Color {\n\n rotating_color_total(idx, 9)\n\n}\n\n\n","file_path":"game/src/helpers.rs","rank":51,"score":229460.189631555},{"content":"fn bar_chart(g: &mut GfxCtx, data: &BTreeMap<String, Estimate>) {\n\n let mut max = 0;\n\n let mut sum = 0;\n\n for (name, est) in data {\n\n if name == \"Total:\" {\n\n continue;\n\n }\n\n max = max.max(est.value);\n\n sum += est.value;\n\n }\n\n\n\n let mut labels = Text::new().no_bg();\n\n for (name, est) in data {\n\n if name == \"Total:\" {\n\n continue;\n\n }\n\n labels.add_appended(vec![\n\n Line(format!(\"{} (\", name)).size(40),\n\n Line(format!(\n\n \"{}%\",\n","file_path":"game/src/mission/dataviz.rs","rank":52,"score":228568.26743738714},{"content":"struct Choice {\n\n hotkey: Option<MultiKey>,\n\n label: String,\n\n active: bool,\n\n}\n\n\n\nimpl ModalMenu {\n\n pub fn new<S: Into<String>>(\n\n title: S,\n\n raw_choices: Vec<(Option<MultiKey>, &str)>,\n\n ctx: &EventCtx,\n\n ) -> ModalMenu {\n\n let mut m = ModalMenu {\n\n title: title.into(),\n\n info: Text::new(),\n\n chosen_action: None,\n\n choices: raw_choices\n\n .into_iter()\n\n .map(|(hotkey, label)| Choice {\n\n hotkey,\n","file_path":"ezgui/src/widgets/modal_menu.rs","rank":53,"score":225838.6062609991},{"content":"// Shorter is better\n\npub fn cmp_duration_shorter(now: Duration, baseline: Duration) -> Vec<TextSpan> {\n\n if now.epsilon_eq(baseline) {\n\n vec![Line(\" (same as baseline)\")]\n\n } else if now < baseline {\n\n vec![\n\n Line(\" (\"),\n\n Line((baseline - now).minimal_tostring()).fg(Color::GREEN),\n\n Line(\" faster)\"),\n\n ]\n\n } else if now > baseline {\n\n vec![\n\n Line(\" (\"),\n\n Line((now - baseline).minimal_tostring()).fg(Color::RED),\n\n Line(\" slower)\"),\n\n ]\n\n } else {\n\n unreachable!()\n\n }\n\n}\n\n\n","file_path":"game/src/sandbox/gameplay/mod.rs","rank":54,"score":223676.59320843784},{"content":"#[derive(Serialize, Deserialize, Derivative)]\n\n#[derivative(PartialEq)]\n\nstruct State {\n\n id: IntersectionID,\n\n accepted: BTreeSet<Request>,\n\n // Track when a request is first made.\n\n #[serde(\n\n serialize_with = \"serialize_btreemap\",\n\n deserialize_with = \"deserialize_btreemap\"\n\n )]\n\n waiting: BTreeMap<Request, Duration>,\n\n // TODO Can we move this to analytics?\n\n #[derivative(PartialEq = \"ignore\")]\n\n #[serde(skip_serializing, skip_deserializing)]\n\n delays: DurationHistogram,\n\n}\n\n\n\nimpl IntersectionSimState {\n\n pub fn new(\n\n map: &Map,\n\n scheduler: &mut Scheduler,\n\n use_freeform_policy_everywhere: bool,\n","file_path":"sim/src/mechanics/intersection.rs","rank":55,"score":222202.41033719748},{"content":"// (original direction, reversed direction)\n\npub fn get_lane_types(osm_tags: &BTreeMap<String, String>) -> (Vec<LaneType>, Vec<LaneType>) {\n\n if let Some(s) = osm_tags.get(osm::SYNTHETIC_LANES) {\n\n if let Some(spec) = RoadSpec::parse(s.to_string()) {\n\n return (spec.fwd, spec.back);\n\n } else {\n\n panic!(\"Bad {} RoadSpec: {}\", osm::SYNTHETIC_LANES, s);\n\n }\n\n }\n\n\n\n // Easy special cases first.\n\n if osm_tags.get(\"junction\") == Some(&\"roundabout\".to_string()) {\n\n return (vec![LaneType::Driving, LaneType::Sidewalk], Vec::new());\n\n }\n\n if osm_tags.get(osm::HIGHWAY) == Some(&\"footway\".to_string()) {\n\n return (vec![LaneType::Sidewalk], Vec::new());\n\n }\n\n\n\n // TODO Reversible roads should be handled differently?\n\n let oneway = osm_tags.get(\"oneway\") == Some(&\"yes\".to_string())\n\n || osm_tags.get(\"oneway\") == Some(&\"reversible\".to_string());\n","file_path":"map_model/src/make/initial/lane_specs.rs","rank":56,"score":219670.58061121887},{"content":"pub fn contains_duplicates<T: Ord>(vec: &Vec<T>) -> bool {\n\n let mut set = BTreeSet::new();\n\n for item in vec {\n\n if set.contains(item) {\n\n return true;\n\n }\n\n set.insert(item);\n\n }\n\n false\n\n}\n","file_path":"abstutil/src/collections.rs","rank":57,"score":219640.15744336866},{"content":"pub fn run(t: &mut TestRunner) {\n\n // TODO Lots of boilerplate between these two. Can we do better?\n\n\n\n /*t.run_slow(\"park_on_goal_st\", |h| {\n\n let (map, mut sim, mut rng) = SimFlags::synthetic_test(\"parking_test\", \"park_on_goal_st\")\n\n .load(&mut Timer::throwaway());\n\n let north_bldg = map.bldg(\"north\").id;\n\n let south_bldg = map.bldg(\"south\").id;\n\n let north_parking = map.parking_lane(\"north\", 23).id;\n\n let south_parking = map.parking_lane(\"south\", 23).id;\n\n\n\n let (spot, car) =\n\n h.seed_parked_cars(&mut sim, &mut rng, south_parking, Some(south_bldg), vec![2])[0];\n\n // Fill up some of the first spots, forcing parking to happen at spot 4\n\n h.seed_parked_cars(&mut sim, &mut rng, north_parking, None, (0..4).collect());\n\n h.seed_parked_cars(&mut sim, &mut rng, north_parking, None, (5..10).collect());\n\n sim.schedule_trip(\n\n Duration::ZERO,\n\n TripSpec::UsingParkedCar {\n\n start: SidewalkSpot::building(south_bldg, &map),\n","file_path":"tests/src/parking.rs","rank":58,"score":219237.63469927508},{"content":"#[allow(clippy::unreadable_literal)]\n\npub fn run(t: &mut TestRunner) {\n\n t.run_fast(\"dist_along_horiz_line\", |_| {\n\n let l = Line::new(\n\n Pt2D::new(147.17832753158294, 1651.034235433578),\n\n Pt2D::new(185.9754103560146, 1651.0342354335778),\n\n );\n\n let pt = Pt2D::new(179.1628455160347, 1651.0342354335778);\n\n\n\n assert!(l.contains_pt(pt));\n\n assert!(l.dist_along_of_point(pt).is_some());\n\n });\n\n\n\n t.run_fast(\"trim_with_epsilon\", |_| {\n\n /*\n\n // EPSILON_DIST needs to be tuned correctly, or this point seems like it's not on the line.\n\n let mut pl = PolyLine::new(vec![\n\n Pt2D::new(1130.2653468611902, 2124.099702776818),\n\n Pt2D::new(1175.9652436108408, 2124.1094748373457),\n\n Pt2D::new(1225.8319649025132, 2124.120594334445),\n\n ]);\n","file_path":"tests/src/geom.rs","rank":59,"score":219237.63469927508},{"content":"fn calculate_driving_lines(lane: &Lane, parent: &Road, timer: &mut Timer) -> Vec<Polygon> {\n\n // The leftmost lanes don't have dashed lines.\n\n let (dir, idx) = parent.dir_and_offset(lane.id);\n\n if idx == 0 || (dir && parent.children_forwards[idx - 1].1 == LaneType::SharedLeftTurn) {\n\n return Vec::new();\n\n }\n\n let lane_edge_pts = lane\n\n .lane_center_pts\n\n .shift_left(LANE_THICKNESS / 2.0)\n\n .get(timer);\n\n dashed_lines(\n\n &lane_edge_pts,\n\n Distance::meters(0.25),\n\n Distance::meters(1.0),\n\n Distance::meters(1.5),\n\n )\n\n}\n\n\n","file_path":"game/src/render/lane.rs","rank":60,"score":219172.8739922067},{"content":"fn edit_scenario(map: &Map, scenario: &mut Scenario, mut wizard: WrappedWizard) -> Option<()> {\n\n let seed_parked = \"Seed parked cars\";\n\n let spawn = \"Spawn agents\";\n\n let spawn_border = \"Spawn agents from a border\";\n\n let randomize = \"Randomly spawn stuff from/to every neighborhood\";\n\n match wizard\n\n .choose_string(\"What kind of edit?\", || {\n\n vec![seed_parked, spawn, spawn_border, randomize]\n\n })?\n\n .as_str()\n\n {\n\n x if x == seed_parked => {\n\n scenario.seed_parked_cars.push(SeedParkedCars {\n\n neighborhood: choose_neighborhood(\n\n map,\n\n &mut wizard,\n\n \"Seed parked cars in what area?\",\n\n )?,\n\n cars_per_building: input_weighted_usize(\n\n &mut wizard,\n","file_path":"game/src/mission/scenario.rs","rank":61,"score":218638.25986555155},{"content":"pub fn challenges_picker() -> Box<dyn State> {\n\n WizardState::new(Box::new(move |wiz, ctx, _| {\n\n let (_, challenge) = wiz.wrap(ctx).choose(\"Play which challenge?\", || {\n\n all_challenges()\n\n .into_iter()\n\n .map(|c| Choice::new(c.title.clone(), c))\n\n .collect()\n\n })?;\n\n\n\n let edits = abstutil::list_all_objects(abstutil::EDITS, &challenge.map_name);\n\n let mut summary = Text::new();\n\n for l in &challenge.description {\n\n summary.add(Line(l));\n\n }\n\n summary.add(Line(\"\"));\n\n summary.add(Line(format!(\"{} proposals:\", edits.len())));\n\n summary.add(Line(\"\"));\n\n for e in edits {\n\n summary.add(Line(format!(\"- {} (untested)\", e)));\n\n }\n","file_path":"game/src/challenges.rs","rank":62,"score":216985.74584982672},{"content":"fn finish(dir_path: &str, filenames: Vec<String>, num_tiles_x: usize, num_tiles_y: usize) {\n\n {\n\n let mut args = filenames.clone();\n\n args.push(\"-mode\".to_string());\n\n args.push(\"Concatenate\".to_string());\n\n args.push(\"-tile\".to_string());\n\n args.push(format!(\"{}x{}\", num_tiles_x, num_tiles_y));\n\n args.push(\"full.png\".to_string());\n\n\n\n let mut file = fs::File::create(format!(\"{}/combine.sh\", dir_path)).unwrap();\n\n writeln!(file, \"#!/bin/bash\\n\").unwrap();\n\n writeln!(file, \"montage {}\", args.join(\" \")).unwrap();\n\n writeln!(file, \"rm -f combine.sh\").unwrap();\n\n }\n\n\n\n {\n\n let output = process::Command::new(\"md5sum\")\n\n .args(\n\n &filenames\n\n .into_iter()\n","file_path":"ezgui/src/widgets/screenshot.rs","rank":63,"score":216709.52470633993},{"content":"pub fn run(t: &mut TestRunner) {\n\n t.run_slow(\"convert_osm_twice\", |_| {\n\n let flags = convert_osm::Flags {\n\n osm: \"../data/input/montlake.osm\".to_string(),\n\n parking_shapes: Some(\"../data/shapes/blockface.bin\".to_string()),\n\n offstreet_parking: Some(\"../data/input/offstreet_parking.kml\".to_string()),\n\n sidewalks: Some(\"../data/shapes/sidewalks.bin\".to_string()),\n\n gtfs: Some(\"../data/input/google_transit_2018_18_08\".to_string()),\n\n neighborhoods: Some(\"../data/input/neighborhoods.geojson\".to_string()),\n\n clip: Some(abstutil::path_polygon(\"montlake\")),\n\n output: \"convert_osm_twice.bin\".to_string(),\n\n };\n\n\n\n let map1 = convert_osm::convert(&flags, &mut abstutil::Timer::throwaway());\n\n let map2 = convert_osm::convert(&flags, &mut abstutil::Timer::throwaway());\n\n\n\n if abstutil::to_json(&map1) != abstutil::to_json(&map2) {\n\n // TODO tmp files\n\n abstutil::write_json(\"map1.json\", &map1).unwrap();\n\n abstutil::write_json(\"map2.json\", &map2).unwrap();\n","file_path":"tests/src/map_conversion.rs","rank":64,"score":215859.5019868964},{"content":"pub fn wraparound_get<T>(vec: &Vec<T>, idx: isize) -> &T {\n\n let len = vec.len() as isize;\n\n let idx = idx % len;\n\n let idx = if idx >= 0 { idx } else { idx + len };\n\n &vec[idx as usize]\n\n}\n\n\n","file_path":"abstutil/src/collections.rs","rank":65,"score":214282.17902296237},{"content":"// TODO This needs to update turn restrictions too\n\npub fn clip_map(map: &mut RawMap, timer: &mut Timer) {\n\n timer.start(\"clipping map to boundary\");\n\n\n\n // So we can use retain_btreemap without borrowing issues\n\n let boundary_polygon = map.boundary_polygon.clone();\n\n let boundary_lines: Vec<PolyLine> = map\n\n .boundary_polygon\n\n .points()\n\n .windows(2)\n\n .map(|pair| PolyLine::new(pair.to_vec()))\n\n .collect();\n\n\n\n // This is kind of indirect and slow, but first pass -- just remove roads that start or end\n\n // outside the boundary polygon.\n\n retain_btreemap(&mut map.roads, |_, r| {\n\n let first_in = boundary_polygon.contains_pt(r.center_points[0]);\n\n let last_in = boundary_polygon.contains_pt(*r.center_points.last().unwrap());\n\n first_in || last_in\n\n });\n\n\n","file_path":"convert_osm/src/clip.rs","rank":66,"score":213765.78823087417},{"content":"fn close_off_polygon(mut pts: Vec<Pt2D>) -> Vec<Pt2D> {\n\n if pts.last().unwrap().approx_eq(pts[0], Distance::meters(0.1)) {\n\n pts.pop();\n\n }\n\n pts.push(pts[0]);\n\n pts\n\n}\n","file_path":"map_model/src/make/initial/geometry.rs","rank":67,"score":213495.47393169493},{"content":"pub fn get_lane_specs(osm_tags: &BTreeMap<String, String>) -> Vec<LaneSpec> {\n\n let (side1_types, side2_types) = lane_specs::get_lane_types(osm_tags);\n\n\n\n let mut specs: Vec<LaneSpec> = Vec::new();\n\n for lane_type in side1_types {\n\n specs.push(LaneSpec {\n\n lane_type,\n\n reverse_pts: false,\n\n });\n\n }\n\n for lane_type in side2_types {\n\n specs.push(LaneSpec {\n\n lane_type,\n\n reverse_pts: true,\n\n });\n\n }\n\n if specs.is_empty() {\n\n panic!(\"Road with tags {:?} wound up with no lanes!\", osm_tags);\n\n }\n\n specs\n\n}\n","file_path":"map_model/src/make/initial/mod.rs","rank":68,"score":212063.540394945},{"content":"// Add all possible protected groups to existing phases.\n\nfn expand_all_phases(phases: &mut Vec<Phase>, turn_groups: &BTreeMap<TurnGroupID, TurnGroup>) {\n\n for phase in phases.iter_mut() {\n\n for g in turn_groups.keys() {\n\n if phase.could_be_protected(*g, turn_groups) {\n\n phase.protected_groups.insert(*g);\n\n }\n\n }\n\n }\n\n}\n\n\n\nconst PROTECTED: bool = true;\n\nconst YIELD: bool = false;\n\n\n","file_path":"map_model/src/traffic_signals.rs","rank":69,"score":207555.51355756642},{"content":"pub fn remove_disconnected_roads(map: &mut RawMap, timer: &mut Timer) {\n\n timer.start(\"removing disconnected roads\");\n\n // This is a simple floodfill, not Tarjan's. Assumes all roads bidirectional.\n\n // All the usizes are indices into the original list of roads\n\n\n\n let mut next_roads: MultiMap<OriginalIntersection, OriginalRoad> = MultiMap::new();\n\n for id in map.roads.keys() {\n\n next_roads.insert(id.i1, *id);\n\n next_roads.insert(id.i2, *id);\n\n }\n\n\n\n let mut partitions: Vec<Vec<OriginalRoad>> = Vec::new();\n\n let mut unvisited_roads: BTreeSet<OriginalRoad> = map.roads.keys().cloned().collect();\n\n\n\n while !unvisited_roads.is_empty() {\n\n let mut queue_roads: Vec<OriginalRoad> = vec![*unvisited_roads.iter().next().unwrap()];\n\n let mut current_partition: Vec<OriginalRoad> = Vec::new();\n\n while !queue_roads.is_empty() {\n\n let current = queue_roads.pop().unwrap();\n\n if !unvisited_roads.contains(¤t) {\n","file_path":"map_model/src/make/remove_disconnected.rs","rank":70,"score":206689.69580372667},{"content":"// TODO Validate the intersection exists? Let them pick it with the cursor?\n\nfn choose_intersection(wizard: &mut WrappedWizard, query: &str) -> Option<IntersectionID> {\n\n wizard.input_something(\n\n query,\n\n None,\n\n Box::new(|line| usize::from_str_radix(&line, 10).ok().map(IntersectionID)),\n\n )\n\n}\n\n\n","file_path":"game/src/mission/scenario.rs","rank":71,"score":203862.3439029249},{"content":"fn pick_neighborhood(map: &Map, mut wizard: WrappedWizard) -> Option<NeighborhoodBuilder> {\n\n let load_existing = \"Load existing neighborhood\";\n\n let create_new = \"Create new neighborhood\";\n\n if wizard.choose_string(\"What neighborhood to edit?\", || {\n\n vec![load_existing, create_new]\n\n })? == load_existing\n\n {\n\n load_neighborhood_builder(map, &mut wizard, \"Load which neighborhood?\")\n\n } else {\n\n let name = wizard.input_string(\"Name the neighborhood\")?;\n\n Some(NeighborhoodBuilder {\n\n name,\n\n map_name: map.get_name().to_string(),\n\n points: Vec::new(),\n\n })\n\n }\n\n}\n\n\n","file_path":"game/src/mission/neighborhood.rs","rank":72,"score":203856.68227428332},{"content":"pub fn import_trips(\n\n parcels_path: &str,\n\n trips_path: &str,\n\n timer: &mut Timer,\n\n) -> Result<(Vec<Trip>, BTreeMap<i64, Parcel>), failure::Error> {\n\n let (parcels, metadata) = import_parcels(parcels_path, timer)?;\n\n\n\n let mut trips = Vec::new();\n\n let (reader, done) = FileWithProgress::new(trips_path)?;\n\n for rec in csv::Reader::from_reader(reader).records() {\n\n let rec = rec?;\n\n\n\n // opcl\n\n let from = skip_fail!(parcels.get(rec[15].trim_end_matches(\".0\"))).clone();\n\n // dpcl\n\n let to = skip_fail!(parcels.get(rec[6].trim_end_matches(\".0\"))).clone();\n\n\n\n if from.osm_building == to.osm_building {\n\n // TODO Plumb along pass-through trips later\n\n if from.osm_building.is_some() {\n","file_path":"popdat/src/psrc.rs","rank":73,"score":202534.06735025224},{"content":"pub fn stack_vertically(\n\n orientation: ContainerOrientation,\n\n canvas: &Canvas,\n\n widgets: Vec<&mut dyn Widget>,\n\n) {\n\n assert!(!widgets.is_empty());\n\n\n\n let dims_per_widget: Vec<ScreenDims> = widgets.iter().map(|w| w.get_dims()).collect();\n\n let total_width = dims_per_widget\n\n .iter()\n\n .map(|d| d.width)\n\n .max_by_key(|x| NotNan::new(*x).unwrap())\n\n .unwrap();\n\n let total_height: f64 = dims_per_widget.iter().map(|d| d.height).sum();\n\n\n\n let mut top_left = match orientation {\n\n ContainerOrientation::TopLeft => ScreenPt::new(0.0, 0.0),\n\n ContainerOrientation::TopRight => ScreenPt::new(canvas.window_width - total_width, 0.0),\n\n ContainerOrientation::Centered => {\n\n let mut pt = canvas.center_to_screen_pt();\n","file_path":"ezgui/src/layout.rs","rank":74,"score":202061.976937329},{"content":"pub fn dashed_lines(\n\n pl: &PolyLine,\n\n width: Distance,\n\n dash_len: Distance,\n\n dash_separation: Distance,\n\n) -> Vec<Polygon> {\n\n if pl.length() < dash_separation * 2.0 + EPSILON_DIST {\n\n return vec![pl.make_polygons(width)];\n\n }\n\n // Don't draw the dashes too close to the ends.\n\n pl.exact_slice(dash_separation, pl.length() - dash_separation)\n\n .dashed_polygons(width, dash_len, dash_separation)\n\n}\n\n\n\npub struct DrawCtx<'a> {\n\n pub cs: &'a ColorScheme,\n\n pub map: &'a Map,\n\n pub draw_map: &'a DrawMap,\n\n pub sim: &'a Sim,\n\n}\n","file_path":"game/src/render/mod.rs","rank":75,"score":198941.3229740174},{"content":"pub fn list_dir(dir: &std::path::Path) -> Vec<String> {\n\n let mut files: Vec<String> = Vec::new();\n\n match std::fs::read_dir(dir) {\n\n Ok(iter) => {\n\n for entry in iter {\n\n files.push(entry.unwrap().path().to_str().unwrap().to_string());\n\n }\n\n }\n\n Err(ref e) if e.kind() == ErrorKind::NotFound => {}\n\n Err(e) => panic!(\"Couldn't read_dir {:?}: {}\", dir, e),\n\n };\n\n files.sort();\n\n files\n\n}\n\n\n","file_path":"abstutil/src/io.rs","rank":76,"score":197381.04494453658},{"content":"pub fn load(dir_path: &str) -> Result<Vec<Route>, Error> {\n\n println!(\"Loading GTFS from {}\", dir_path);\n\n let timer = Instant::now();\n\n\n\n let mut route_id_to_name: HashMap<String, String> = HashMap::new();\n\n for rec in csv::Reader::from_reader(File::open(format!(\"{}/routes.txt\", dir_path))?).records() {\n\n let rec = rec?;\n\n route_id_to_name.insert(rec[0].to_string(), rec[2].to_string());\n\n }\n\n\n\n let mut stop_id_to_pt: HashMap<String, LonLat> = HashMap::new();\n\n for rec in csv::Reader::from_reader(File::open(format!(\"{}/stops.txt\", dir_path))?).records() {\n\n let rec = rec?;\n\n let lon: f64 = rec[5].parse()?;\n\n let lat: f64 = rec[4].parse()?;\n\n stop_id_to_pt.insert(rec[0].to_string(), LonLat::new(lon, lat));\n\n }\n\n\n\n let mut trip_id_to_route_id_and_direction: HashMap<String, (String, bool)> = HashMap::new();\n\n for rec in csv::Reader::from_reader(File::open(format!(\"{}/trips.txt\", dir_path))?).records() {\n","file_path":"gtfs/src/lib.rs","rank":77,"score":197381.04494453658},{"content":"fn create_swarm(ui: &mut UI, from: LaneID, to: LaneID, count: usize, duration: Duration) {\n\n let mut scenario = Scenario::empty(&ui.primary.map);\n\n scenario.scenario_name = \"swarm\".to_string();\n\n scenario.border_spawn_over_time.push(BorderSpawnOverTime {\n\n num_peds: 0,\n\n num_cars: count,\n\n num_bikes: 0,\n\n start_time: ui.primary.sim.time() + SMALL_DT,\n\n stop_time: ui.primary.sim.time() + SMALL_DT + duration,\n\n start_from_border: ui\n\n .primary\n\n .map\n\n .get_l(from)\n\n .get_directed_parent(&ui.primary.map),\n\n goal: OriginDestination::EndOfRoad(\n\n ui.primary\n\n .map\n\n .get_l(to)\n\n .get_directed_parent(&ui.primary.map),\n\n ),\n","file_path":"game/src/sandbox/gameplay/spawner.rs","rank":78,"score":196275.8921152898},{"content":"fn choose_neighborhood(map: &Map, wizard: &mut WrappedWizard, query: &str) -> Option<String> {\n\n // Load the full object, since we usually visualize the neighborhood when menuing over it\n\n wizard\n\n .choose(query, || {\n\n Choice::from(Neighborhood::load_all(map.get_name(), map.get_gps_bounds()))\n\n })\n\n .map(|(n, _)| n)\n\n}\n\n\n","file_path":"game/src/mission/scenario.rs","rank":79,"score":195991.00463555864},{"content":"// Need to explain this trick -- basically keeps consistency between two different simulations when\n\n// each one might make slightly different sequences of calls to the RNG.\n\npub fn fork_rng(base_rng: &mut XorShiftRng) -> XorShiftRng {\n\n XorShiftRng::from_seed([base_rng.next_u32() as u8; 16])\n\n}\n\n\n\n// Represents the probability of sampling 0, 1, 2, 3... The sum can be anything.\n\n#[derive(Clone, Debug, Serialize, Deserialize)]\n\npub struct WeightedUsizeChoice {\n\n pub weights: Vec<usize>,\n\n}\n\n\n\nimpl WeightedUsizeChoice {\n\n pub fn parse(string: &str) -> Option<WeightedUsizeChoice> {\n\n let parts: Vec<&str> = string.split(',').collect();\n\n if parts.is_empty() {\n\n return None;\n\n }\n\n let mut weights: Vec<usize> = Vec::new();\n\n for x in parts.into_iter() {\n\n let x = x.parse::<usize>().ok()?;\n\n weights.push(x);\n\n }\n\n Some(WeightedUsizeChoice { weights })\n\n }\n\n\n\n pub fn sample(&self, rng: &mut XorShiftRng) -> usize {\n\n WeightedIndex::new(&self.weights).unwrap().sample(rng)\n\n }\n\n}\n","file_path":"abstutil/src/random.rs","rank":80,"score":195199.13747981816},{"content":"// Just list all things from a directory, return sorted by name, with file extension removed.\n\n// Hacky that map_name can be blank. ;)\n\npub fn list_all_objects(dir: &str, map_name: &str) -> Vec<String> {\n\n let mut results: BTreeSet<String> = BTreeSet::new();\n\n match std::fs::read_dir(format!(\"../data/{}/{}\", dir, map_name)) {\n\n Ok(iter) => {\n\n for entry in iter {\n\n let filename = entry.unwrap().file_name();\n\n let path = Path::new(&filename);\n\n if path.to_string_lossy().ends_with(\".swp\") {\n\n continue;\n\n }\n\n let name = path\n\n .file_stem()\n\n .unwrap()\n\n .to_os_string()\n\n .into_string()\n\n .unwrap();\n\n results.insert(name);\n\n }\n\n }\n\n Err(ref e) if e.kind() == ErrorKind::NotFound => {}\n\n Err(e) => panic!(e),\n\n };\n\n results.into_iter().collect()\n\n}\n\n\n","file_path":"abstutil/src/io.rs","rank":81,"score":194605.53851960582},{"content":"fn choose_scenario(map_name: &str, wizard: &mut WrappedWizard, query: &str) -> Option<String> {\n\n wizard.choose_string(query, || {\n\n abstutil::list_all_objects(abstutil::SCENARIOS, map_name)\n\n })\n\n}\n\n\n","file_path":"game/src/abtest/setup.rs","rank":82,"score":193721.68560863798},{"content":"pub fn convert(flags: &Flags, timer: &mut abstutil::Timer) -> RawMap {\n\n let mut map = split_ways::split_up_roads(\n\n osm_reader::extract_osm(&flags.osm, &flags.clip, timer),\n\n timer,\n\n );\n\n clip::clip_map(&mut map, timer);\n\n\n\n // Need to do a first pass of removing cul-de-sacs here, or we wind up with loop PolyLines when doing the parking hint matching.\n\n abstutil::retain_btreemap(&mut map.roads, |r, _| r.i1 != r.i2);\n\n\n\n if let Some(ref path) = flags.parking_shapes {\n\n use_parking_hints(&mut map, path, timer);\n\n }\n\n if let Some(ref path) = flags.offstreet_parking {\n\n use_offstreet_parking(&mut map, path, timer);\n\n }\n\n if let Some(ref path) = flags.sidewalks {\n\n use_sidewalk_hints(&mut map, path, timer);\n\n }\n\n if let Some(ref path) = flags.gtfs {\n","file_path":"convert_osm/src/lib.rs","rank":83,"score":188667.77601208986},{"content":"fn calculate_border_arrows(i: &Intersection, r: &Road, timer: &mut Timer) -> Vec<Polygon> {\n\n let mut result = Vec::new();\n\n\n\n // These arrows should point from the void to the road\n\n if !i.outgoing_lanes.is_empty() {\n\n // The line starts at the border and points down the road\n\n let (line, width) = if r.dst_i == i.id {\n\n let width = (r.children_forwards.len() as f64) * LANE_THICKNESS;\n\n (\n\n r.center_pts.last_line().shift_left(width / 2.0).reverse(),\n\n width,\n\n )\n\n } else {\n\n let width = (r.children_forwards.len() as f64) * LANE_THICKNESS;\n\n (r.center_pts.first_line().shift_right(width / 2.0), width)\n\n };\n\n result.push(\n\n // DEGENERATE_INTERSECTION_HALF_LENGTH is 5m...\n\n PolyLine::new(vec![\n\n line.unbounded_dist_along(Distance::meters(-9.5)),\n","file_path":"game/src/render/intersection.rs","rank":84,"score":187444.314440739},{"content":"fn warp_point(line: &str, primary: &PerMapUI) -> Option<(Option<ID>, Pt2D, f64)> {\n\n if line.is_empty() {\n\n return None;\n\n }\n\n // TODO Weird magic shortcut to go to last spot. What should this be?\n\n if line == \"j\" {\n\n if let Some((pt, zoom)) = primary.last_warped_from {\n\n return Some((None, pt, zoom));\n\n }\n\n return None;\n\n }\n\n\n\n let id = match usize::from_str_radix(&line[1..line.len()], 10) {\n\n Ok(idx) => match line.chars().next().unwrap() {\n\n 'r' => {\n\n let r = primary.map.maybe_get_r(RoadID(idx))?;\n\n ID::Lane(r.children_forwards[0].0)\n\n }\n\n 'l' => ID::Lane(LaneID(idx)),\n\n 'i' => ID::Intersection(IntersectionID(idx)),\n","file_path":"game/src/common/warp.rs","rank":85,"score":187349.68538826093},{"content":"#[derive(Serialize, Deserialize, PartialEq)]\n\nstruct Bus {\n\n car: CarID,\n\n route: BusRouteID,\n\n // Where does each passenger want to deboard?\n\n passengers: Vec<(PedestrianID, BusStopID)>,\n\n state: BusState,\n\n}\n\n\n","file_path":"sim/src/transit.rs","rank":86,"score":186641.26374252306},{"content":"#[derive(Serialize, Deserialize, PartialEq)]\n\nstruct Route {\n\n stops: Vec<StopForRoute>,\n\n buses: Vec<CarID>,\n\n}\n\n\n","file_path":"sim/src/transit.rs","rank":87,"score":186641.26374252306},{"content":"pub fn fix_bus_route(map: &Map, r: &mut BusRoute) -> bool {\n\n // Trim out stops if needed; map borders sometimes mean some paths don't work.\n\n let mut stops = Vec::new();\n\n for stop in r.stops.drain(..) {\n\n if stops.is_empty() {\n\n stops.push(stop);\n\n } else {\n\n if check_stops(*stops.last().unwrap(), stop, map) {\n\n stops.push(stop);\n\n }\n\n }\n\n }\n\n // Don't forget the last and first\n\n while stops.len() >= 2 {\n\n if check_stops(*stops.last().unwrap(), stops[0], map) {\n\n break;\n\n }\n\n // TODO Or the front one\n\n stops.pop();\n\n }\n\n r.stops = stops;\n\n r.stops.len() >= 2\n\n}\n\n\n","file_path":"map_model/src/make/bus_stops.rs","rank":88,"score":186508.4197135209},{"content":"fn calculate_turn_markings(map: &Map, lane: &Lane, timer: &mut Timer) -> Vec<Polygon> {\n\n let mut results = Vec::new();\n\n\n\n // Are there multiple driving lanes on this side of the road?\n\n if map\n\n .find_closest_lane(lane.id, vec![LaneType::Driving])\n\n .is_err()\n\n {\n\n return results;\n\n }\n\n if lane.length() < Distance::meters(7.0) {\n\n return results;\n\n }\n\n\n\n let thickness = Distance::meters(0.2);\n\n\n\n let common_base = lane.lane_center_pts.exact_slice(\n\n lane.length() - Distance::meters(7.0),\n\n lane.length() - Distance::meters(5.0),\n\n );\n","file_path":"game/src/render/lane.rs","rank":89,"score":182485.36629298347},{"content":"#[derive(Serialize, Deserialize, PartialEq)]\n\nstruct StopForRoute {\n\n id: BusStopID,\n\n driving_pos: Position,\n\n path_to_next_stop: Path,\n\n next_stop_idx: StopIdx,\n\n}\n\n\n","file_path":"sim/src/transit.rs","rank":90,"score":182446.9970714596},{"content":"fn use_offstreet_parking(map: &mut RawMap, path: &str, timer: &mut Timer) {\n\n timer.start(\"match offstreet parking points\");\n\n let shapes = kml::load(path, &map.gps_bounds, timer).expect(\"loading offstreet_parking failed\");\n\n\n\n let mut closest: FindClosest<OriginalBuilding> = FindClosest::new(&map.gps_bounds.to_bounds());\n\n for (id, b) in &map.buildings {\n\n closest.add(*id, b.polygon.points());\n\n }\n\n\n\n // TODO Another function just to use ?. Try blocks would rock.\n\n let mut handle_shape: Box<dyn FnMut(kml::ExtraShape) -> Option<()>> = Box::new(|s| {\n\n assert_eq!(s.points.len(), 1);\n\n let pt = Pt2D::from_gps(s.points[0], &map.gps_bounds)?;\n\n let (id, _) = closest.closest_pt(pt, Distance::meters(50.0))?;\n\n // TODO Handle parking lots.\n\n if !map.buildings[&id].polygon.contains_pt(pt) {\n\n return None;\n\n }\n\n let name = s.attributes.get(\"DEA_FACILITY_NAME\")?.to_string();\n\n let num_stalls = s.attributes.get(\"DEA_STALLS\")?.parse::<usize>().ok()?;\n","file_path":"convert_osm/src/lib.rs","rank":91,"score":180005.93866193263},{"content":"fn use_parking_hints(map: &mut RawMap, path: &str, timer: &mut Timer) {\n\n timer.start(\"apply parking hints\");\n\n let shapes: ExtraShapes = abstutil::read_binary(path, timer).expect(\"loading blockface failed\");\n\n\n\n // Match shapes with the nearest road + direction (true for forwards)\n\n let mut closest: FindClosest<(OriginalRoad, bool)> =\n\n FindClosest::new(&map.gps_bounds.to_bounds());\n\n for (id, r) in &map.roads {\n\n let center = PolyLine::new(r.center_points.clone());\n\n closest.add(\n\n (*id, true),\n\n center.shift_right(LANE_THICKNESS).get(timer).points(),\n\n );\n\n closest.add(\n\n (*id, false),\n\n center.shift_left(LANE_THICKNESS).get(timer).points(),\n\n );\n\n }\n\n\n\n for s in shapes.shapes.into_iter() {\n","file_path":"convert_osm/src/lib.rs","rank":92,"score":180005.93866193263},{"content":"fn use_sidewalk_hints(map: &mut RawMap, path: &str, timer: &mut Timer) {\n\n timer.start(\"apply sidewalk hints\");\n\n let shapes: ExtraShapes = abstutil::read_binary(path, timer).unwrap();\n\n\n\n // Match shapes with the nearest road + direction (true for forwards)\n\n let mut closest: FindClosest<(OriginalRoad, bool)> =\n\n FindClosest::new(&map.gps_bounds.to_bounds());\n\n for (id, r) in &map.roads {\n\n let center = PolyLine::new(r.center_points.clone());\n\n closest.add(\n\n (*id, true),\n\n center.shift_right(LANE_THICKNESS).get(timer).points(),\n\n );\n\n closest.add(\n\n (*id, false),\n\n center.shift_left(LANE_THICKNESS).get(timer).points(),\n\n );\n\n }\n\n\n\n for s in shapes.shapes.into_iter() {\n","file_path":"convert_osm/src/lib.rs","rank":93,"score":180005.93866193263},{"content":"fn calculate_sidewalk_lines(lane: &Lane) -> Vec<Polygon> {\n\n let tile_every = LANE_THICKNESS;\n\n\n\n let length = lane.length();\n\n\n\n let mut result = Vec::new();\n\n // Start away from the intersections\n\n let mut dist_along = tile_every;\n\n while dist_along < length - tile_every {\n\n let (pt, angle) = lane.dist_along(dist_along);\n\n // Reuse perp_line. Project away an arbitrary amount\n\n let pt2 = pt.project_away(Distance::meters(1.0), angle);\n\n result.push(\n\n perp_line(Line::new(pt, pt2), LANE_THICKNESS).make_polygons(Distance::meters(0.25)),\n\n );\n\n dist_along += tile_every;\n\n }\n\n\n\n result\n\n}\n\n\n","file_path":"game/src/render/lane.rs","rank":94,"score":179374.14576208714},{"content":"fn calculate_parking_lines(lane: &Lane) -> Vec<Polygon> {\n\n // meters, but the dims get annoying below to remove\n\n let leg_length = Distance::meters(1.0);\n\n\n\n let mut result = Vec::new();\n\n let num_spots = lane.number_parking_spots();\n\n if num_spots > 0 {\n\n for idx in 0..=num_spots {\n\n let (pt, lane_angle) = lane.dist_along(PARKING_SPOT_LENGTH * (1.0 + idx as f64));\n\n let perp_angle = lane_angle.rotate_degs(270.0);\n\n // Find the outside of the lane. Actually, shift inside a little bit, since the line will\n\n // have thickness, but shouldn't really intersect the adjacent line when drawn.\n\n let t_pt = pt.project_away(LANE_THICKNESS * 0.4, perp_angle);\n\n // The perp leg\n\n let p1 = t_pt.project_away(leg_length, perp_angle.opposite());\n\n result.push(Line::new(t_pt, p1).make_polygons(Distance::meters(0.25)));\n\n // Upper leg\n\n let p2 = t_pt.project_away(leg_length, lane_angle);\n\n result.push(Line::new(t_pt, p2).make_polygons(Distance::meters(0.25)));\n\n // Lower leg\n\n let p3 = t_pt.project_away(leg_length, lane_angle.opposite());\n\n result.push(Line::new(t_pt, p3).make_polygons(Distance::meters(0.25)));\n\n }\n\n }\n\n\n\n result\n\n}\n\n\n","file_path":"game/src/render/lane.rs","rank":95,"score":179374.14576208714},{"content":"pub fn path_camera_state(map_name: &str) -> String {\n\n format!(\"../data/camera_state/{}.json\", map_name)\n\n}\n\n\n","file_path":"abstutil/src/lib.rs","rank":96,"score":177749.5960812691},{"content":"// Load all serialized things from a directory, return sorted by name, with file extension removed.\n\n// Detects JSON or binary.\n\npub fn load_all_objects<T: DeserializeOwned>(dir: &str, map_name: &str) -> Vec<(String, T)> {\n\n let mut timer = Timer::new(&format!(\n\n \"load_all_objects from ../data/{}/{}/\",\n\n dir, map_name\n\n ));\n\n let mut tree: BTreeMap<String, T> = BTreeMap::new();\n\n match std::fs::read_dir(format!(\"../data/{}/{}/\", dir, map_name)) {\n\n Ok(iter) => {\n\n for entry in iter {\n\n let filename = entry.unwrap().file_name();\n\n let path = Path::new(&filename);\n\n let path_str = path.to_string_lossy();\n\n if path_str.ends_with(\".swp\") {\n\n continue;\n\n }\n\n let name = path\n\n .file_stem()\n\n .unwrap()\n\n .to_os_string()\n\n .into_string()\n","file_path":"abstutil/src/io.rs","rank":97,"score":176819.88723320133},{"content":"fn pts_to_line_string(raw_pts: &Vec<Pt2D>) -> geo::LineString<f64> {\n\n let pts: Vec<geo::Point<f64>> = raw_pts\n\n .iter()\n\n .map(|pt| geo::Point::new(pt.x(), pt.y()))\n\n .collect();\n\n pts.into()\n\n}\n","file_path":"geom/src/find_closest.rs","rank":98,"score":174903.68035820633},{"content":"struct UI {\n\n model: Model,\n\n state: State,\n\n menu: ModalMenu,\n\n sidebar: Text,\n\n\n\n last_id: Option<ID>,\n\n}\n\n\n","file_path":"map_editor/src/main.rs","rank":99,"score":174602.27125593636}],"string":"[\n {\n \"content\": \"fn pick_color(wiz: &mut Wizard, ctx: &mut EventCtx, ui: &mut UI) -> Option<Transition> {\\n\\n let name = wiz\\n\\n .wrap(ctx)\\n\\n .choose_string(\\\"Change which color?\\\", || ui.cs.color_names())?;\\n\\n Some(Transition::Replace(Box::new(ColorChanger {\\n\\n name: name.clone(),\\n\\n original: ui.cs.get_modified(&name),\\n\\n menu: ModalMenu::new(\\n\\n &format!(\\\"Color Picker for {}\\\", name),\\n\\n vec![\\n\\n (hotkey(Key::Backspace), \\\"revert\\\"),\\n\\n (hotkey(Key::Escape), \\\"finalize\\\"),\\n\\n ],\\n\\n ctx,\\n\\n ),\\n\\n })))\\n\\n}\\n\\n\\n\",\n \"file_path\": \"game/src/debug/color_picker.rs\",\n \"rank\": 0,\n \"score\": 469391.84547574806\n },\n {\n \"content\": \"fn browse_trips(wiz: &mut Wizard, ctx: &mut EventCtx, ui: &mut UI) -> Option<Transition> {\\n\\n let mut wizard = wiz.wrap(ctx);\\n\\n let mode = wizard\\n\\n .choose(\\\"Browse which trips?\\\", || {\\n\\n let trips = CompareTrips::new(\\n\\n ui.primary.sim.get_finished_trips(),\\n\\n ui.secondary.as_ref().unwrap().sim.get_finished_trips(),\\n\\n );\\n\\n let modes = trips\\n\\n .finished_trips\\n\\n .iter()\\n\\n .map(|(_, m, _, _)| *m)\\n\\n .collect::<BTreeSet<TripMode>>();\\n\\n TripMode::all()\\n\\n .into_iter()\\n\\n .map(|m| Choice::new(m.to_string(), m).active(modes.contains(&m)))\\n\\n .collect()\\n\\n })?\\n\\n .1;\\n\\n wizard.choose(\\\"Examine which trip?\\\", || {\\n\",\n \"file_path\": \"game/src/abtest/score.rs\",\n \"rank\": 2,\n \"score\": 460723.0853968681\n },\n {\n \"content\": \"fn splash_screen(raw_wizard: &mut Wizard, ctx: &mut EventCtx, ui: &mut UI) -> Option<Transition> {\\n\\n let mut wizard = raw_wizard.wrap(ctx);\\n\\n let sandbox = \\\"Sandbox mode\\\";\\n\\n let challenge = \\\"Challenge mode\\\";\\n\\n let abtest = \\\"A/B Test Mode (internal/unfinished)\\\";\\n\\n let tutorial = \\\"Tutorial (unfinished)\\\";\\n\\n let mission = \\\"Internal developer tools\\\";\\n\\n let about = \\\"About\\\";\\n\\n let quit = \\\"Quit\\\";\\n\\n\\n\\n let dev = ui.primary.current_flags.dev;\\n\\n\\n\\n match wizard\\n\\n .choose(\\\"Welcome to A/B Street!\\\", || {\\n\\n vec![\\n\\n Some(Choice::new(sandbox, ()).key(Key::S)),\\n\\n Some(Choice::new(challenge, ()).key(Key::C)),\\n\\n if dev {\\n\\n Some(Choice::new(abtest, ()).key(Key::A))\\n\\n } else {\\n\",\n \"file_path\": \"game/src/splash_screen.rs\",\n \"rank\": 3,\n \"score\": 434944.1580555311\n },\n {\n \"content\": \"fn warp_to(wiz: &mut Wizard, ctx: &mut EventCtx, ui: &mut UI) -> Option<Transition> {\\n\\n let mut wizard = wiz.wrap(ctx);\\n\\n let to = wizard.input_string(\\\"Warp to what?\\\")?;\\n\\n if let Some((id, pt, cam_zoom)) = warp_point(&to, &ui.primary) {\\n\\n return Some(Transition::ReplaceWithMode(\\n\\n Warping::new(ctx, pt, Some(cam_zoom), id, &mut ui.primary),\\n\\n EventLoopMode::Animation,\\n\\n ));\\n\\n }\\n\\n wizard.acknowledge(\\\"Bad warp ID\\\", || vec![format!(\\\"{} isn't a valid ID\\\", to)])?;\\n\\n Some(Transition::Pop)\\n\\n}\\n\\n\\n\\npub struct Warping {\\n\\n warper: Warper,\\n\\n id: Option<ID>,\\n\\n}\\n\\n\\n\\nimpl Warping {\\n\\n pub fn new(\\n\",\n \"file_path\": \"game/src/common/warp.rs\",\n \"rank\": 4,\n \"score\": 429930.2773317317\n },\n {\n \"content\": \"fn jump_to_time(wiz: &mut Wizard, ctx: &mut EventCtx, ui: &mut UI) -> Option<Transition> {\\n\\n let t = wiz.wrap(ctx).input_time_slider(\\n\\n \\\"Jump to what time?\\\",\\n\\n ui.primary.sim.time(),\\n\\n Duration::END_OF_DAY,\\n\\n )?;\\n\\n let dt = t - ui.primary.sim.time();\\n\\n ctx.loading_screen(&format!(\\\"step forwards {}\\\", dt), |_, mut timer| {\\n\\n ui.primary.sim.timed_step(&ui.primary.map, dt, &mut timer);\\n\\n if let Some(ref mut s) = ui.secondary {\\n\\n s.sim.timed_step(&s.map, dt, &mut timer);\\n\\n }\\n\\n });\\n\\n Some(Transition::Pop)\\n\\n}\\n\",\n \"file_path\": \"game/src/common/time.rs\",\n \"rank\": 5,\n \"score\": 425683.857977089\n },\n {\n \"content\": \"fn load_scenario(wiz: &mut Wizard, ctx: &mut EventCtx, ui: &mut UI) -> Option<Transition> {\\n\\n let map_name = ui.primary.map.get_name().to_string();\\n\\n let s = wiz.wrap(ctx).choose_string(\\\"Load which scenario?\\\", || {\\n\\n abstutil::list_all_objects(abstutil::SCENARIOS, &map_name)\\n\\n })?;\\n\\n let scenario = abstutil::read_binary(\\n\\n &abstutil::path1_bin(&map_name, abstutil::SCENARIOS, &s),\\n\\n &mut Timer::throwaway(),\\n\\n )\\n\\n .unwrap();\\n\\n Some(Transition::Replace(Box::new(\\n\\n scenario::ScenarioManager::new(scenario, ctx, ui),\\n\\n )))\\n\\n}\\n\\n\\n\",\n \"file_path\": \"game/src/mission/mod.rs\",\n \"rank\": 6,\n \"score\": 425683.857977089\n },\n {\n \"content\": \"fn search_osm(wiz: &mut Wizard, ctx: &mut EventCtx, ui: &mut UI) -> Option<Transition> {\\n\\n let filter = wiz.wrap(ctx).input_string(\\\"Search for what?\\\")?;\\n\\n let mut ids = HashSet::new();\\n\\n let mut batch = GeomBatch::new();\\n\\n\\n\\n let map = &ui.primary.map;\\n\\n let color = ui.cs.get_def(\\\"search result\\\", Color::RED);\\n\\n for r in map.all_roads() {\\n\\n if r.osm_tags\\n\\n .iter()\\n\\n .any(|(k, v)| format!(\\\"{} = {}\\\", k, v).contains(&filter))\\n\\n {\\n\\n for l in r.all_lanes() {\\n\\n ids.insert(ID::Lane(l));\\n\\n }\\n\\n batch.push(color, r.get_thick_polygon().unwrap());\\n\\n }\\n\\n }\\n\\n for b in map.all_buildings() {\\n\\n if b.osm_tags\\n\",\n \"file_path\": \"game/src/debug/mod.rs\",\n \"rank\": 7,\n \"score\": 425683.857977089\n },\n {\n \"content\": \"fn load_edits(wiz: &mut Wizard, ctx: &mut EventCtx, ui: &mut UI) -> Option<Transition> {\\n\\n let mut wizard = wiz.wrap(ctx);\\n\\n\\n\\n if ui.primary.map.get_edits().dirty {\\n\\n let save = \\\"save edits\\\";\\n\\n let discard = \\\"discard\\\";\\n\\n if wizard\\n\\n .choose_string(\\\"Save current edits first?\\\", || vec![save, discard])?\\n\\n .as_str()\\n\\n == save\\n\\n {\\n\\n save_edits(&mut wizard, ui)?;\\n\\n wizard.reset();\\n\\n }\\n\\n }\\n\\n\\n\\n // TODO Exclude current\\n\\n let map_name = ui.primary.map.get_name().to_string();\\n\\n let (_, new_edits) = wizard.choose(\\\"Load which map edits?\\\", || {\\n\\n let mut list = Choice::from(abstutil::load_all_objects(abstutil::EDITS, &map_name));\\n\\n list.push(Choice::new(\\\"no_edits\\\", MapEdits::new(map_name.clone())));\\n\\n list\\n\\n })?;\\n\\n apply_map_edits(&mut ui.primary, &ui.cs, ctx, new_edits);\\n\\n ui.primary.map.mark_edits_fresh();\\n\\n Some(Transition::Pop)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"game/src/edit/mod.rs\",\n \"rank\": 8,\n \"score\": 425683.857977089\n },\n {\n \"content\": \"fn load_savestate(wiz: &mut Wizard, ctx: &mut EventCtx, ui: &mut UI) -> Option<Transition> {\\n\\n let path = ui.primary.sim.save_dir();\\n\\n\\n\\n let ss = wiz.wrap(ctx).choose_string(\\\"Load which savestate?\\\", || {\\n\\n abstutil::list_dir(std::path::Path::new(&path))\\n\\n })?;\\n\\n\\n\\n ctx.loading_screen(\\\"load savestate\\\", |ctx, mut timer| {\\n\\n ui.primary.sim = Sim::load_savestate(ss, &mut timer).expect(\\\"Can't load savestate\\\");\\n\\n ui.recalculate_current_selection(ctx);\\n\\n });\\n\\n Some(Transition::Pop)\\n\\n}\\n\",\n \"file_path\": \"game/src/sandbox/mod.rs\",\n \"rank\": 9,\n \"score\": 425683.857977089\n },\n {\n \"content\": \"fn choose_shortcut(wiz: &mut Wizard, ctx: &mut EventCtx, ui: &mut UI) -> Option<Transition> {\\n\\n let center = ctx\\n\\n .canvas\\n\\n .center_to_map_pt()\\n\\n .forcibly_to_gps(&ui.primary.map.get_gps_bounds());\\n\\n let cam_zoom = ctx.canvas.cam_zoom;\\n\\n\\n\\n let mut wizard = wiz.wrap(ctx);\\n\\n let (_, mut s) = wizard.choose(\\\"Jump to which shortcut?\\\", || {\\n\\n // TODO Handle >9\\n\\n // TODO Allow deleting\\n\\n let keys = vec![\\n\\n Key::Num1,\\n\\n Key::Num2,\\n\\n Key::Num3,\\n\\n Key::Num4,\\n\\n Key::Num5,\\n\\n Key::Num6,\\n\\n Key::Num7,\\n\\n Key::Num8,\\n\",\n \"file_path\": \"game/src/common/shortcuts.rs\",\n \"rank\": 10,\n \"score\": 425683.857977089\n },\n {\n \"content\": \"fn change_scenario(wiz: &mut Wizard, ctx: &mut EventCtx, ui: &mut UI) -> Option<Transition> {\\n\\n let num_agents = ui.primary.current_flags.num_agents;\\n\\n let builtin = if let Some(n) = num_agents {\\n\\n format!(\\\"random scenario with {} agents\\\", n)\\n\\n } else {\\n\\n \\\"random scenario with some agents\\\".to_string()\\n\\n };\\n\\n let scenario_name = wiz\\n\\n .wrap(ctx)\\n\\n .choose_string(\\\"Instantiate which scenario?\\\", || {\\n\\n let mut list =\\n\\n abstutil::list_all_objects(abstutil::SCENARIOS, ui.primary.map.get_name());\\n\\n list.push(builtin.clone());\\n\\n list.push(\\\"just buses\\\".to_string());\\n\\n list\\n\\n })?;\\n\\n Some(Transition::PopThenReplace(Box::new(SandboxMode::new(\\n\\n ctx,\\n\\n ui,\\n\\n GameplayMode::PlayScenario(scenario_name),\\n\\n ))))\\n\\n}\\n\\n\\n\",\n \"file_path\": \"game/src/sandbox/gameplay/mod.rs\",\n \"rank\": 11,\n \"score\": 421580.9841398108\n },\n {\n \"content\": \"fn create_new_scenario(wiz: &mut Wizard, ctx: &mut EventCtx, ui: &mut UI) -> Option<Transition> {\\n\\n let name = wiz.wrap(ctx).input_string(\\\"Name the scenario\\\")?;\\n\\n let mut s = Scenario::empty(&ui.primary.map);\\n\\n s.seed_buses = true;\\n\\n s.scenario_name = name;\\n\\n Some(Transition::Replace(Box::new(\\n\\n scenario::ScenarioManager::new(s, ctx, ui),\\n\\n )))\\n\\n}\\n\\n\\n\",\n \"file_path\": \"game/src/mission/mod.rs\",\n \"rank\": 12,\n \"score\": 421580.9841398109\n },\n {\n \"content\": \"fn pick_ab_test(wiz: &mut Wizard, ctx: &mut EventCtx, ui: &mut UI) -> Option<Transition> {\\n\\n let mut wizard = wiz.wrap(ctx);\\n\\n let load_existing = \\\"Load existing A/B test\\\";\\n\\n let create_new = \\\"Create new A/B test\\\";\\n\\n let ab_test = if wizard.choose_string(\\\"What A/B test to manage?\\\", || {\\n\\n vec![load_existing, create_new]\\n\\n })? == load_existing\\n\\n {\\n\\n wizard\\n\\n .choose(\\\"Load which A/B test?\\\", || {\\n\\n Choice::from(abstutil::load_all_objects(\\n\\n abstutil::AB_TESTS,\\n\\n ui.primary.map.get_name(),\\n\\n ))\\n\\n })?\\n\\n .1\\n\\n } else {\\n\\n let test_name = wizard.input_string(\\\"Name the A/B test\\\")?;\\n\\n let map_name = ui.primary.map.get_name();\\n\\n\\n\",\n \"file_path\": \"game/src/abtest/setup.rs\",\n \"rank\": 13,\n \"score\": 421580.98413981084\n },\n {\n \"content\": \"fn load_map(wiz: &mut Wizard, ctx: &mut EventCtx, ui: &mut UI) -> Option<Transition> {\\n\\n if let Some(name) = wiz.wrap(ctx).choose_string(\\\"Load which map?\\\", || {\\n\\n let current_map = ui.primary.map.get_name();\\n\\n abstutil::list_all_objects(\\\"maps\\\", \\\"\\\")\\n\\n .into_iter()\\n\\n .filter(|n| n != current_map)\\n\\n .collect()\\n\\n }) {\\n\\n ui.switch_map(ctx, &name);\\n\\n Some(Transition::PopThenReplace(Box::new(SandboxMode::new(\\n\\n ctx,\\n\\n ui,\\n\\n // TODO If we were playing a scenario, load that one...\\n\\n GameplayMode::Freeform,\\n\\n ))))\\n\\n } else if wiz.aborted() {\\n\\n Some(Transition::Pop)\\n\\n } else {\\n\\n None\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"game/src/sandbox/gameplay/mod.rs\",\n \"rank\": 14,\n \"score\": 421580.9841398108\n },\n {\n \"content\": \"pub fn faster_trips_panel(mode: TripMode, ui: &UI) -> Text {\\n\\n let time = ui.primary.sim.time();\\n\\n let now = ui.primary.sim.get_analytics().finished_trips(time, mode);\\n\\n let baseline = ui.prebaked.finished_trips(time, mode);\\n\\n\\n\\n // Enable to debug why sim results don't match prebaked.\\n\\n if false && !now.seems_eq(&baseline) {\\n\\n abstutil::write_json(\\n\\n \\\"../current_sim.json\\\",\\n\\n &ui.primary.sim.get_analytics().finished_trips,\\n\\n )\\n\\n .unwrap();\\n\\n let filtered = ui\\n\\n .prebaked\\n\\n .finished_trips\\n\\n .iter()\\n\\n .filter(|(t, _, _, _)| *t <= time)\\n\\n .cloned()\\n\\n .collect::<Vec<_>>();\\n\\n abstutil::write_json(\\\"../prebaked.json\\\", &filtered).unwrap();\\n\",\n \"file_path\": \"game/src/sandbox/gameplay/faster_trips.rs\",\n \"rank\": 15,\n \"score\": 416868.61594283406\n },\n {\n \"content\": \"pub fn save_edits(wizard: &mut WrappedWizard, ui: &mut UI) -> Option<()> {\\n\\n let map = &mut ui.primary.map;\\n\\n\\n\\n let rename = if map.get_edits().edits_name == \\\"no_edits\\\" {\\n\\n Some(wizard.input_string(\\\"Name these map edits\\\")?)\\n\\n } else {\\n\\n None\\n\\n };\\n\\n // TODO Don't allow naming them no_edits!\\n\\n\\n\\n // TODO Do it this weird way to avoid saving edits on every event. :P\\n\\n // TODO Do some kind of versioning? Don't ask this if the file doesn't exist yet?\\n\\n let save = \\\"save edits\\\";\\n\\n let cancel = \\\"cancel\\\";\\n\\n if wizard\\n\\n .choose_string(\\\"Overwrite edits?\\\", || vec![save, cancel])?\\n\\n .as_str()\\n\\n == save\\n\\n {\\n\\n if let Some(name) = rename {\\n\\n let mut edits = map.get_edits().clone();\\n\\n edits.edits_name = name;\\n\\n map.apply_edits(edits, &mut Timer::new(\\\"name map edits\\\"));\\n\\n }\\n\\n map.save_edits();\\n\\n }\\n\\n Some(())\\n\\n}\\n\\n\\n\",\n \"file_path\": \"game/src/edit/mod.rs\",\n \"rank\": 16,\n \"score\": 375298.1232267339\n },\n {\n \"content\": \"pub fn spawn_agents_around(i: IntersectionID, ui: &mut UI, ctx: &EventCtx) {\\n\\n let map = &ui.primary.map;\\n\\n let sim = &mut ui.primary.sim;\\n\\n let mut rng = ui.primary.current_flags.sim_flags.make_rng();\\n\\n\\n\\n for l in &map.get_i(i).incoming_lanes {\\n\\n let lane = map.get_l(*l);\\n\\n if lane.is_driving() || lane.is_biking() {\\n\\n for _ in 0..10 {\\n\\n let vehicle_spec = if rng.gen_bool(0.7) && lane.is_driving() {\\n\\n Scenario::rand_car(&mut rng)\\n\\n } else {\\n\\n Scenario::rand_bike(&mut rng)\\n\\n };\\n\\n if vehicle_spec.length > lane.length() {\\n\\n continue;\\n\\n }\\n\\n sim.schedule_trip(\\n\\n sim.time(),\\n\\n TripSpec::CarAppearing {\\n\",\n \"file_path\": \"game/src/sandbox/gameplay/spawner.rs\",\n \"rank\": 17,\n \"score\": 373050.42673103453\n },\n {\n \"content\": \"fn launch_test(test: &ABTest, ui: &mut UI, ctx: &mut EventCtx) -> ABTestMode {\\n\\n let secondary = ctx.loading_screen(\\n\\n &format!(\\\"Launching A/B test {}\\\", test.test_name),\\n\\n |ctx, mut timer| {\\n\\n let scenario: Scenario = abstutil::read_binary(\\n\\n &abstutil::path1_bin(&test.map_name, abstutil::SCENARIOS, &test.scenario_name),\\n\\n &mut timer,\\n\\n )\\n\\n .expect(\\\"loading scenario failed\\\");\\n\\n\\n\\n {\\n\\n timer.start(\\\"load primary\\\");\\n\\n if ui.primary.current_flags.sim_flags.rng_seed.is_none() {\\n\\n ui.primary.current_flags.sim_flags.rng_seed = Some(42);\\n\\n }\\n\\n ui.primary.current_flags.sim_flags.opts.run_name =\\n\\n format!(\\\"{} with {}\\\", test.test_name, test.edits1_name);\\n\\n ui.primary.current_flags.sim_flags.opts.savestate_every = None;\\n\\n\\n\\n apply_map_edits(\\n\",\n \"file_path\": \"game/src/abtest/setup.rs\",\n \"rank\": 18,\n \"score\": 357893.03784804826\n },\n {\n \"content\": \"// For easy ModalMenu construction\\n\\npub fn hotkey(key: Key) -> Option<MultiKey> {\\n\\n Some(MultiKey { key, lctrl: false })\\n\\n}\\n\\n\\n\",\n \"file_path\": \"ezgui/src/event.rs\",\n \"rank\": 19,\n \"score\": 353982.7012900219\n },\n {\n \"content\": \"fn bus_route_panel(id: BusRouteID, ui: &UI, stat: Statistic) -> Text {\\n\\n let now = ui\\n\\n .primary\\n\\n .sim\\n\\n .get_analytics()\\n\\n .bus_arrivals(ui.primary.sim.time(), id);\\n\\n let baseline = ui.prebaked.bus_arrivals(ui.primary.sim.time(), id);\\n\\n\\n\\n let route = ui.primary.map.get_br(id);\\n\\n let mut txt = Text::new();\\n\\n txt.add(Line(format!(\\\"{} delay between stops\\\", stat)));\\n\\n for idx1 in 0..route.stops.len() {\\n\\n let idx2 = if idx1 == route.stops.len() - 1 {\\n\\n 0\\n\\n } else {\\n\\n idx1 + 1\\n\\n };\\n\\n // TODO Also display number of arrivals...\\n\\n txt.add(Line(format!(\\\"Stop {}->{}: \\\", idx1 + 1, idx2 + 1)));\\n\\n if let Some(ref stats1) = now.get(&route.stops[idx2]) {\\n\",\n \"file_path\": \"game/src/sandbox/gameplay/optimize_bus.rs\",\n \"rank\": 20,\n \"score\": 342330.131176606\n },\n {\n \"content\": \"fn launch_savestate(test: &ABTest, ss_path: String, ui: &mut UI, ctx: &mut EventCtx) -> ABTestMode {\\n\\n ctx.loading_screen(\\n\\n &format!(\\\"Launch A/B test from savestate {}\\\", ss_path),\\n\\n |ctx, mut timer| {\\n\\n let ss: ABTestSavestate = abstutil::read_binary(&ss_path, &mut timer).unwrap();\\n\\n\\n\\n timer.start(\\\"setup primary\\\");\\n\\n ui.primary.map = ss.primary_map;\\n\\n ui.primary.sim = ss.primary_sim;\\n\\n ui.primary.draw_map = DrawMap::new(\\n\\n &ui.primary.map,\\n\\n &ui.primary.current_flags,\\n\\n &ui.cs,\\n\\n ctx,\\n\\n &mut timer,\\n\\n );\\n\\n timer.stop(\\\"setup primary\\\");\\n\\n\\n\\n timer.start(\\\"setup secondary\\\");\\n\\n let secondary = PerMapUI {\\n\",\n \"file_path\": \"game/src/abtest/setup.rs\",\n \"rank\": 21,\n \"score\": 340032.78856819053\n },\n {\n \"content\": \"fn color_for_mode(m: TripMode, ui: &UI) -> Color {\\n\\n match m {\\n\\n TripMode::Walk => ui.cs.get(\\\"unzoomed pedestrian\\\"),\\n\\n TripMode::Bike => ui.cs.get(\\\"unzoomed bike\\\"),\\n\\n TripMode::Transit => ui.cs.get(\\\"unzoomed bus\\\"),\\n\\n TripMode::Drive => ui.cs.get(\\\"unzoomed car\\\"),\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"game/src/sandbox/overlays.rs\",\n \"rank\": 22,\n \"score\": 338405.07968383096\n },\n {\n \"content\": \"#[allow(non_snake_case)]\\n\\npub fn Line<S: Into<String>>(text: S) -> TextSpan {\\n\\n TextSpan {\\n\\n text: text.into(),\\n\\n fg_color: FG_COLOR,\\n\\n size: None,\\n\\n }\\n\\n}\\n\\n\\n\\n#[derive(Debug, Clone)]\\n\\npub struct Text {\\n\\n // The bg_color will cover the entire block, but some lines can have extra highlighting.\\n\\n lines: Vec<(Option<Color>, Vec<TextSpan>)>,\\n\\n bg_color: Option<Color>,\\n\\n pub override_width: Option<f64>,\\n\\n pub override_height: Option<f64>,\\n\\n}\\n\\n\\n\\nimpl Text {\\n\\n pub fn new() -> Text {\\n\\n Text {\\n\",\n \"file_path\": \"ezgui/src/text.rs\",\n \"rank\": 23,\n \"score\": 330901.12930167606\n },\n {\n \"content\": \"fn show_route(trip: TripID, ui: &UI, ctx: &EventCtx) -> RouteViewer {\\n\\n let time = ui.primary.sim.time();\\n\\n match ui.primary.sim.trip_to_agent(trip) {\\n\\n TripResult::Ok(agent) => RouteViewer::Active(\\n\\n time,\\n\\n trip,\\n\\n ui.primary\\n\\n .sim\\n\\n .trace_route(agent, &ui.primary.map, None)\\n\\n .map(|trace| {\\n\\n let mut zoomed = GeomBatch::new();\\n\\n zoomed.extend(\\n\\n ui.cs.get(\\\"route\\\").alpha(0.8),\\n\\n dashed_lines(\\n\\n &trace,\\n\\n Distance::meters(0.75),\\n\\n Distance::meters(1.0),\\n\\n Distance::meters(0.4),\\n\\n ),\\n\\n );\\n\",\n \"file_path\": \"game/src/common/route_viewer.rs\",\n \"rank\": 24,\n \"score\": 329875.32701468025\n },\n {\n \"content\": \"fn info_for(id: ID, ui: &UI, ctx: &EventCtx) -> Text {\\n\\n let (map, sim, draw_map) = (&ui.primary.map, &ui.primary.sim, &ui.primary.draw_map);\\n\\n let mut txt = Text::new();\\n\\n // TODO Technically we should recalculate all of this as the window resizes, then.\\n\\n txt.override_width = Some(0.7 * ctx.canvas.window_width);\\n\\n txt.override_height = Some(0.7 * ctx.canvas.window_height);\\n\\n\\n\\n txt.extend(&CommonState::default_osd(id.clone(), ui));\\n\\n txt.highlight_last_line(Color::BLUE);\\n\\n let id_color = ui.cs.get(\\\"OSD ID color\\\");\\n\\n let name_color = ui.cs.get(\\\"OSD name color\\\");\\n\\n\\n\\n match id {\\n\\n ID::Road(_) => unreachable!(),\\n\\n ID::Lane(id) => {\\n\\n let l = map.get_l(id);\\n\\n let r = map.get_r(l.parent);\\n\\n\\n\\n txt.add_appended(vec![\\n\\n Line(\\\"Parent \\\"),\\n\",\n \"file_path\": \"game/src/common/info.rs\",\n \"rank\": 25,\n \"score\": 329365.6760593519\n },\n {\n \"content\": \"fn change_traffic_signal(signal: ControlTrafficSignal, ui: &mut UI, ctx: &mut EventCtx) {\\n\\n let mut edits = ui.primary.map.get_edits().clone();\\n\\n // TODO Only record one command for the entire session. Otherwise, we can exit this editor and\\n\\n // undo a few times, potentially ending at an invalid state!\\n\\n if edits\\n\\n .commands\\n\\n .last()\\n\\n .map(|cmd| match cmd {\\n\\n EditCmd::ChangeTrafficSignal(ref s) => s.id == signal.id,\\n\\n _ => false,\\n\\n })\\n\\n .unwrap_or(false)\\n\\n {\\n\\n edits.commands.pop();\\n\\n }\\n\\n edits.commands.push(EditCmd::ChangeTrafficSignal(signal));\\n\\n apply_map_edits(&mut ui.primary, &ui.cs, ctx, edits);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"game/src/edit/traffic_signals.rs\",\n \"rank\": 26,\n \"score\": 327836.1712071957\n },\n {\n \"content\": \"pub fn clip_trips(map: &Map, timer: &mut Timer) -> (Vec<Trip>, HashMap<BuildingID, Parcel>) {\\n\\n let popdat: PopDat = abstutil::read_binary(\\\"../data/shapes/popdat.bin\\\", timer)\\n\\n .expect(\\\"Couldn't load popdat.bin\\\");\\n\\n\\n\\n let mut osm_id_to_bldg = HashMap::new();\\n\\n for b in map.all_buildings() {\\n\\n osm_id_to_bldg.insert(b.osm_way_id, b.id);\\n\\n }\\n\\n let bounds = map.get_gps_bounds();\\n\\n // TODO Figure out why some polygon centers are broken\\n\\n let incoming_borders_walking: Vec<(IntersectionID, LonLat)> = map\\n\\n .all_incoming_borders()\\n\\n .into_iter()\\n\\n .filter(|i| {\\n\\n !i.get_outgoing_lanes(map, PathConstraints::Pedestrian)\\n\\n .is_empty()\\n\\n })\\n\\n .filter_map(|i| i.polygon.center().to_gps(bounds).map(|pt| (i.id, pt)))\\n\\n .collect();\\n\\n let incoming_borders_driving: Vec<(IntersectionID, LonLat)> = map\\n\",\n \"file_path\": \"popdat/src/trips.rs\",\n \"rank\": 27,\n \"score\": 312916.9330061356\n },\n {\n \"content\": \"fn bus_delays(id: BusRouteID, ui: &UI, ctx: &mut EventCtx) -> Plot<Duration> {\\n\\n let route = ui.primary.map.get_br(id);\\n\\n let mut delays_per_stop = ui\\n\\n .primary\\n\\n .sim\\n\\n .get_analytics()\\n\\n .bus_arrivals_over_time(ui.primary.sim.time(), id);\\n\\n\\n\\n let mut series = Vec::new();\\n\\n for idx1 in 0..route.stops.len() {\\n\\n let idx2 = if idx1 == route.stops.len() - 1 {\\n\\n 0\\n\\n } else {\\n\\n idx1 + 1\\n\\n };\\n\\n series.push(Series {\\n\\n label: format!(\\\"Stop {}->{}\\\", idx1 + 1, idx2 + 1),\\n\\n color: rotating_color_total(idx1, route.stops.len()),\\n\\n pts: delays_per_stop\\n\\n .remove(&route.stops[idx2])\\n\",\n \"file_path\": \"game/src/sandbox/gameplay/optimize_bus.rs\",\n \"rank\": 28,\n \"score\": 297941.00168824464\n },\n {\n \"content\": \"pub fn rotating_color_total(idx: usize, total: usize) -> Color {\\n\\n if total > 9 {\\n\\n return rotating_color_total(idx, 9);\\n\\n }\\n\\n if total < 3 {\\n\\n return rotating_color_total(idx, 3);\\n\\n }\\n\\n\\n\\n // TODO Cache this\\n\\n // TODO This palette doesn't contrast well with other stuff\\n\\n let colors: Vec<Color> =\\n\\n colorbrewer::get_color_ramp(colorbrewer::Palette::YlOrBr, total as u32)\\n\\n .unwrap()\\n\\n .into_iter()\\n\\n .map(Color::from_hex)\\n\\n .collect();\\n\\n\\n\\n colors[idx % total]\\n\\n}\\n\",\n \"file_path\": \"game/src/helpers.rs\",\n \"rank\": 29,\n \"score\": 297585.12337163475\n },\n {\n \"content\": \"fn styled_kv(txt: &mut Text, tags: &BTreeMap<String, String>) {\\n\\n for (k, v) in tags {\\n\\n txt.add_appended(vec![\\n\\n Line(k).fg(Color::RED),\\n\\n Line(\\\" = \\\"),\\n\\n Line(v).fg(Color::CYAN),\\n\\n ]);\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"game/src/common/info.rs\",\n \"rank\": 30,\n \"score\": 295441.06538251974\n },\n {\n \"content\": \"fn preview_all_intersections(model: &Model, ctx: &EventCtx) -> (Drawable, Vec<(Text, Pt2D)>) {\\n\\n let mut batch = GeomBatch::new();\\n\\n let mut timer = Timer::new(\\\"preview all intersections\\\");\\n\\n timer.start_iter(\\\"preview\\\", model.map.intersections.len());\\n\\n for i in model.map.intersections.keys() {\\n\\n timer.next();\\n\\n if model.map.roads_per_intersection(*i).is_empty() {\\n\\n continue;\\n\\n }\\n\\n let (intersection, _, _) = model.map.preview_intersection(*i, &mut timer);\\n\\n batch.push(Color::ORANGE.alpha(0.5), intersection);\\n\\n }\\n\\n (ctx.prerender.upload(batch), Vec::new())\\n\\n}\\n\\n\\n\",\n \"file_path\": \"map_editor/src/main.rs\",\n \"rank\": 31,\n \"score\": 291981.256090564\n },\n {\n \"content\": \"fn find_overlapping_intersections(model: &Model, ctx: &EventCtx) -> (Drawable, Vec<(Text, Pt2D)>) {\\n\\n let mut timer = Timer::new(\\\"find overlapping intersections\\\");\\n\\n let mut polygons = Vec::new();\\n\\n for i in model.map.intersections.keys() {\\n\\n if model.map.roads_per_intersection(*i).is_empty() {\\n\\n continue;\\n\\n }\\n\\n let (intersection, _, _) = model.map.preview_intersection(*i, &mut timer);\\n\\n polygons.push((*i, intersection));\\n\\n }\\n\\n\\n\\n let mut overlap = Vec::new();\\n\\n timer.start_iter(\\n\\n \\\"terrible quadratic intersection check\\\",\\n\\n polygons.len().pow(2),\\n\\n );\\n\\n for (i1, poly1) in &polygons {\\n\\n for (i2, poly2) in &polygons {\\n\\n timer.next();\\n\\n if i1 >= i2 {\\n\",\n \"file_path\": \"map_editor/src/main.rs\",\n \"rank\": 32,\n \"score\": 288933.1588072788\n },\n {\n \"content\": \"pub fn lctrl(key: Key) -> Option<MultiKey> {\\n\\n Some(MultiKey { key, lctrl: true })\\n\\n}\\n\",\n \"file_path\": \"ezgui/src/event.rs\",\n \"rank\": 33,\n \"score\": 279930.0323458883\n },\n {\n \"content\": \"pub fn run<G: GUI, F: FnOnce(&mut EventCtx) -> G>(settings: Settings, make_gui: F) {\\n\\n let events_loop = glutin::EventsLoop::new();\\n\\n let window = glutin::WindowBuilder::new()\\n\\n .with_title(settings.window_title)\\n\\n .with_dimensions(glutin::dpi::LogicalSize::new(\\n\\n settings.initial_dims.0,\\n\\n settings.initial_dims.1,\\n\\n ));\\n\\n // multisampling: 2 looks bad, 4 looks fine\\n\\n //\\n\\n // The Z values are very simple:\\n\\n // 1.0: The buffer is reset every frame\\n\\n // 0.5: Map-space geometry and text\\n\\n // 0.1: Screen-space text\\n\\n // 0.0: Screen-space geometry\\n\\n // Had weird issues with Z buffering not working as intended, so this is slightly more\\n\\n // complicated than necessary to work.\\n\\n let context = glutin::ContextBuilder::new()\\n\\n .with_multisampling(4)\\n\\n .with_depth_buffer(2);\\n\",\n \"file_path\": \"ezgui/src/runner.rs\",\n \"rank\": 34,\n \"score\": 277198.5378321532\n },\n {\n \"content\": \"// TODO Word wrap\\n\\npub fn msg<S: Into<String>>(title: &'static str, lines: Vec<S>) -> Box<dyn State> {\\n\\n let str_lines: Vec<String> = lines.into_iter().map(|l| l.into()).collect();\\n\\n WizardState::new(Box::new(move |wiz, ctx, _| {\\n\\n wiz.wrap(ctx).acknowledge(title, || str_lines.clone())?;\\n\\n Some(Transition::Pop)\\n\\n }))\\n\\n}\\n\",\n \"file_path\": \"game/src/game.rs\",\n \"rank\": 35,\n \"score\": 269988.93738607364\n },\n {\n \"content\": \"pub fn run(t: &mut TestRunner) {\\n\\n t.run_slow(\\\"bus_reaches_stops\\\", |h| {\\n\\n let mut flags = SimFlags::for_test(\\\"bus_reaches_stops\\\");\\n\\n flags.opts.savestate_every = Some(Duration::seconds(30.0));\\n\\n let (map, mut sim, _) = flags.load(&mut Timer::throwaway());\\n\\n let route = map.get_bus_route(\\\"49\\\").unwrap();\\n\\n let buses = sim.seed_bus_route(route, &map, &mut Timer::throwaway());\\n\\n let bus = buses[0];\\n\\n h.setup_done(&sim);\\n\\n\\n\\n let mut expectations: Vec<Event> = Vec::new();\\n\\n // TODO assert stuff about other buses as well, although the timing is a little unclear\\n\\n for stop in route.stops.iter().skip(1) {\\n\\n expectations.push(Event::BusArrivedAtStop(bus, route.id, *stop));\\n\\n expectations.push(Event::BusDepartedFromStop(bus, route.id, *stop));\\n\\n }\\n\\n\\n\\n sim.run_until_expectations_met(&map, expectations, Duration::minutes(10));\\n\\n // Make sure buses don't block a sim from being considered done\\n\\n sim.just_run_until_done(&map, Some(Duration::minutes(11)));\\n\",\n \"file_path\": \"tests/src/transit.rs\",\n \"rank\": 36,\n \"score\": 263582.92976958357\n },\n {\n \"content\": \"pub fn run(t: &mut TestRunner) {\\n\\n t.run_slow(\\\"bike_from_border\\\", |h| {\\n\\n let mut flags = SimFlags::for_test(\\\"bike_from_border\\\");\\n\\n flags.opts.savestate_every = Some(Duration::seconds(30.0));\\n\\n let (map, mut sim, mut rng) = flags.load(&mut Timer::throwaway());\\n\\n // TODO Hardcoding IDs is fragile\\n\\n let goal_bldg = BuildingID(319);\\n\\n let (ped, bike) = sim.schedule_trip(\\n\\n Duration::ZERO,\\n\\n TripSpec::UsingBike {\\n\\n start: SidewalkSpot::start_at_border(IntersectionID(186), &map).unwrap(),\\n\\n vehicle: Scenario::rand_bike(&mut rng),\\n\\n goal: DrivingGoal::ParkNear(goal_bldg),\\n\\n ped_speed: Scenario::rand_ped_speed(&mut rng),\\n\\n },\\n\\n &map,\\n\\n );\\n\\n sim.spawn_all_trips(&map, &mut Timer::throwaway(), false);\\n\\n h.setup_done(&sim);\\n\\n\\n\",\n \"file_path\": \"tests/src/trips.rs\",\n \"rank\": 37,\n \"score\": 263457.37648314197\n },\n {\n \"content\": \"pub fn run(t: &mut TestRunner) {\\n\\n t.run_slow(\\\"serialization\\\", |_| {\\n\\n let (map, mut sim, mut rng) =\\n\\n SimFlags::for_test(\\\"serialization\\\").load(&mut Timer::throwaway());\\n\\n Scenario::small_run(&map).instantiate(&mut sim, &map, &mut rng, &mut Timer::throwaway());\\n\\n\\n\\n // Does savestating produce the same string?\\n\\n let save1 = abstutil::to_json(&sim);\\n\\n let save2 = abstutil::to_json(&sim);\\n\\n assert_eq!(save1, save2);\\n\\n });\\n\\n\\n\\n t.run_slow(\\\"from_scratch\\\", |_| {\\n\\n println!(\\\"Creating two simulations\\\");\\n\\n let flags = SimFlags::for_test(\\\"from_scratch_1\\\");\\n\\n let (map, mut sim1, _) = flags.load(&mut Timer::throwaway());\\n\\n let mut sim2 = Sim::new(\\n\\n &map,\\n\\n SimOptions::new(\\\"from_scratch_2\\\"),\\n\\n &mut Timer::throwaway(),\\n\",\n \"file_path\": \"tests/src/sim_determinism.rs\",\n \"rank\": 38,\n \"score\": 258092.130080642\n },\n {\n \"content\": \"pub fn run(t: &mut TestRunner) {\\n\\n t.run_slow(\\\"small_spawn_completes\\\", |h| {\\n\\n let mut flags = SimFlags::for_test(\\\"aorta_model_completes\\\");\\n\\n flags.opts.savestate_every = Some(Duration::seconds(30.0));\\n\\n let (map, mut sim, mut rng) = flags.load(&mut Timer::throwaway());\\n\\n Scenario::small_run(&map).instantiate(&mut sim, &map, &mut rng, &mut Timer::throwaway());\\n\\n h.setup_done(&sim);\\n\\n sim.just_run_until_done(&map, Some(Duration::minutes(70)));\\n\\n });\\n\\n}\\n\",\n \"file_path\": \"tests/src/sim_completion.rs\",\n \"rank\": 39,\n \"score\": 258092.130080642\n },\n {\n \"content\": \"pub fn draw_text_bubble(\\n\\n g: &mut GfxCtx,\\n\\n top_left: ScreenPt,\\n\\n txt: &Text,\\n\\n // Callers almost always calculate this anyway\\n\\n (total_width, total_height): (f64, f64),\\n\\n) -> ScreenRectangle {\\n\\n // TODO Is it expensive to constantly change uniforms and the shader program?\\n\\n g.fork_screenspace();\\n\\n\\n\\n if let Some(c) = txt.bg_color {\\n\\n g.draw_polygon(\\n\\n c,\\n\\n &Polygon::rectangle_topleft(\\n\\n Pt2D::new(top_left.x, top_left.y),\\n\\n Distance::meters(total_width),\\n\\n Distance::meters(total_height),\\n\\n ),\\n\\n );\\n\\n }\\n\",\n \"file_path\": \"ezgui/src/text.rs\",\n \"rank\": 40,\n \"score\": 255879.61953778082\n },\n {\n \"content\": \"pub fn draw_text_bubble_mapspace(\\n\\n g: &mut GfxCtx,\\n\\n top_left: Pt2D,\\n\\n txt: &Text,\\n\\n // Callers almost always calculate this anyway\\n\\n (total_width, total_height): (f64, f64),\\n\\n) {\\n\\n if let Some(c) = txt.bg_color {\\n\\n g.draw_polygon(\\n\\n c,\\n\\n &Polygon::rectangle_topleft(\\n\\n Pt2D::new(top_left.x(), top_left.y()),\\n\\n Distance::meters(total_width / SCALE_DOWN),\\n\\n Distance::meters(total_height / SCALE_DOWN),\\n\\n ),\\n\\n );\\n\\n }\\n\\n\\n\\n let mut y = top_left.y();\\n\\n for (line_color, line) in &txt.lines {\\n\",\n \"file_path\": \"ezgui/src/text.rs\",\n \"rank\": 41,\n \"score\": 251371.76176486752\n },\n {\n \"content\": \"pub fn trips_to_scenario(map: &Map, timer: &mut Timer) -> Scenario {\\n\\n let (trips, _) = clip_trips(map, timer);\\n\\n // TODO Don't clone trips for parallelize\\n\\n let individ_trips = timer\\n\\n .parallelize(\\\"turn PSRC trips into SpawnTrips\\\", trips.clone(), |trip| {\\n\\n trip.to_spawn_trip(map)\\n\\n })\\n\\n .into_iter()\\n\\n .flatten()\\n\\n .collect();\\n\\n\\n\\n // How many parked cars do we need to spawn near each building?\\n\\n // TODO This assumes trips are instantaneous. At runtime, somebody might try to use a parked\\n\\n // car from a building, but one hasn't been delivered yet.\\n\\n let mut individ_parked_cars = BTreeMap::new();\\n\\n let mut avail_per_bldg = BTreeMap::new();\\n\\n for b in map.all_buildings() {\\n\\n individ_parked_cars.insert(b.id, 0);\\n\\n avail_per_bldg.insert(b.id, 0);\\n\\n }\\n\",\n \"file_path\": \"popdat/src/trips.rs\",\n \"rank\": 42,\n \"score\": 249763.60967639403\n },\n {\n \"content\": \"// TODO Temporarily public for debugging.\\n\\n// TODO This should just draw the turn geometry thickened, once that's stable.\\n\\npub fn calculate_corners(i: &Intersection, map: &Map, timer: &mut Timer) -> Vec<Polygon> {\\n\\n let mut corners = Vec::new();\\n\\n\\n\\n for turn in &map.get_turns_in_intersection(i.id) {\\n\\n if turn.turn_type == TurnType::SharedSidewalkCorner {\\n\\n // Avoid double-rendering\\n\\n if map.get_l(turn.id.src).dst_i != i.id {\\n\\n continue;\\n\\n }\\n\\n\\n\\n // Special case for dead-ends: just thicken the geometry.\\n\\n if i.roads.len() == 1 {\\n\\n corners.push(turn.geom.make_polygons(LANE_THICKNESS));\\n\\n continue;\\n\\n }\\n\\n\\n\\n let l1 = map.get_l(turn.id.src);\\n\\n let l2 = map.get_l(turn.id.dst);\\n\\n\\n\\n let src_line = l1.last_line().shift_left(LANE_THICKNESS / 2.0);\\n\",\n \"file_path\": \"game/src/render/intersection.rs\",\n \"rank\": 43,\n \"score\": 244464.1609574018\n },\n {\n \"content\": \"fn color_turn_type(t: TurnType, ui: &UI) -> Color {\\n\\n match t {\\n\\n TurnType::SharedSidewalkCorner => {\\n\\n ui.cs.get_def(\\\"shared sidewalk corner turn\\\", Color::BLACK)\\n\\n }\\n\\n TurnType::Crosswalk => ui.cs.get_def(\\\"crosswalk turn\\\", Color::WHITE),\\n\\n TurnType::Straight => ui.cs.get_def(\\\"straight turn\\\", Color::BLUE),\\n\\n TurnType::LaneChangeLeft => ui.cs.get_def(\\\"change lanes left turn\\\", Color::CYAN),\\n\\n TurnType::LaneChangeRight => ui.cs.get_def(\\\"change lanes right turn\\\", Color::PURPLE),\\n\\n TurnType::Right => ui.cs.get_def(\\\"right turn\\\", Color::GREEN),\\n\\n TurnType::Left => ui.cs.get_def(\\\"left turn\\\", Color::RED),\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"game/src/common/turn_cycler.rs\",\n \"rank\": 44,\n \"score\": 238229.42178648995\n },\n {\n \"content\": \"fn gridlock_panel(ui: &UI) -> Text {\\n\\n let (now_all, _, now_per_mode) = ui\\n\\n .primary\\n\\n .sim\\n\\n .get_analytics()\\n\\n .all_finished_trips(ui.primary.sim.time());\\n\\n let (baseline_all, _, baseline_per_mode) =\\n\\n ui.prebaked.all_finished_trips(ui.primary.sim.time());\\n\\n\\n\\n let mut txt = Text::new();\\n\\n txt.add_appended(vec![\\n\\n Line(format!(\\n\\n \\\"{} total finished trips (\\\",\\n\\n prettyprint_usize(now_all.count())\\n\\n )),\\n\\n cmp_count_fewer(now_all.count(), baseline_all.count()),\\n\\n Line(\\\")\\\"),\\n\\n ]);\\n\\n\\n\\n for mode in TripMode::all() {\\n\",\n \"file_path\": \"game/src/sandbox/gameplay/create_gridlock.rs\",\n \"rank\": 45,\n \"score\": 237743.3100591523\n },\n {\n \"content\": \"#[derive(Serialize, Deserialize, PartialEq, Debug)]\\n\\nstruct Trip {\\n\\n id: TripID,\\n\\n spawned_at: Duration,\\n\\n finished_at: Option<Duration>,\\n\\n aborted: bool,\\n\\n legs: VecDeque<TripLeg>,\\n\\n mode: TripMode,\\n\\n start: TripStart,\\n\\n end: TripEnd,\\n\\n}\\n\\n\\n\\nimpl Trip {\\n\\n fn uses_car(&self, id: CarID, home: BuildingID) -> bool {\\n\\n self.legs.iter().any(|l| match l {\\n\\n TripLeg::Walk(_, _, ref walk_to) => match walk_to.connection {\\n\\n SidewalkPOI::DeferredParkingSpot(b, _) => b == home,\\n\\n _ => false,\\n\\n },\\n\\n // No need to look up the contents of a SidewalkPOI::ParkingSpot. If a trip uses a\\n\\n // specific parked car, then there'll be a TripLeg::Drive with it already.\\n\",\n \"file_path\": \"sim/src/trips.rs\",\n \"rank\": 46,\n \"score\": 237407.07685323246\n },\n {\n \"content\": \"fn input_weighted_usize(wizard: &mut WrappedWizard, query: &str) -> Option<WeightedUsizeChoice> {\\n\\n wizard.input_something(\\n\\n query,\\n\\n None,\\n\\n Box::new(|line| WeightedUsizeChoice::parse(&line)),\\n\\n )\\n\\n}\\n\\n\\n\",\n \"file_path\": \"game/src/mission/scenario.rs\",\n \"rank\": 47,\n \"score\": 235184.00223951737\n },\n {\n \"content\": \"fn debug_all_routes(ui: &mut UI) -> AllRoutesViewer {\\n\\n let mut traces: Vec<PolyLine> = Vec::new();\\n\\n let trips: Vec<TripID> = ui\\n\\n .primary\\n\\n .sim\\n\\n .get_trip_positions(&ui.primary.map)\\n\\n .canonical_pt_per_trip\\n\\n .keys()\\n\\n .cloned()\\n\\n .collect();\\n\\n for trip in trips {\\n\\n if let Some(agent) = ui.primary.sim.trip_to_agent(trip).ok() {\\n\\n if let Some(trace) = ui.primary.sim.trace_route(agent, &ui.primary.map, None) {\\n\\n traces.push(trace);\\n\\n }\\n\\n }\\n\\n }\\n\\n AllRoutesViewer::Active(ui.primary.sim.time(), traces)\\n\\n}\\n\",\n \"file_path\": \"game/src/debug/routes.rs\",\n \"rank\": 48,\n \"score\": 232914.3706008448\n },\n {\n \"content\": \"fn clip_tracts(popdat: &PopDat, ui: &UI, timer: &mut Timer) -> BTreeMap<String, Tract> {\\n\\n // TODO Partial clipping could be neat, except it'd be confusing to interpret totals.\\n\\n let mut results = BTreeMap::new();\\n\\n timer.start_iter(\\\"clip tracts\\\", popdat.tracts.len());\\n\\n for (name, tract) in &popdat.tracts {\\n\\n timer.next();\\n\\n if let Some(pts) = ui.primary.map.get_gps_bounds().try_convert(&tract.pts) {\\n\\n // TODO We should actually make sure the polygon is completely contained within the\\n\\n // map's boundary.\\n\\n let polygon = Polygon::new(&pts);\\n\\n\\n\\n // TODO Don't just use the center...\\n\\n let mut num_bldgs = 0;\\n\\n let mut num_parking_spots = 0;\\n\\n for id in ui\\n\\n .primary\\n\\n .draw_map\\n\\n .get_matching_objects(polygon.get_bounds())\\n\\n {\\n\\n match id {\\n\",\n \"file_path\": \"game/src/mission/dataviz.rs\",\n \"rank\": 49,\n \"score\": 230913.79685996688\n },\n {\n \"content\": \"pub fn retain_btreeset<K: Ord + Clone, F: FnMut(&K) -> bool>(set: &mut BTreeSet<K>, mut keep: F) {\\n\\n let mut remove: Vec<K> = Vec::new();\\n\\n for k in set.iter() {\\n\\n if !keep(k) {\\n\\n remove.push(k.clone());\\n\\n }\\n\\n }\\n\\n for k in remove {\\n\\n set.remove(&k);\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"abstutil/src/collections.rs\",\n \"rank\": 50,\n \"score\": 229692.44074913766\n },\n {\n \"content\": \"pub fn rotating_color(idx: usize) -> Color {\\n\\n rotating_color_total(idx, 9)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"game/src/helpers.rs\",\n \"rank\": 51,\n \"score\": 229460.189631555\n },\n {\n \"content\": \"fn bar_chart(g: &mut GfxCtx, data: &BTreeMap<String, Estimate>) {\\n\\n let mut max = 0;\\n\\n let mut sum = 0;\\n\\n for (name, est) in data {\\n\\n if name == \\\"Total:\\\" {\\n\\n continue;\\n\\n }\\n\\n max = max.max(est.value);\\n\\n sum += est.value;\\n\\n }\\n\\n\\n\\n let mut labels = Text::new().no_bg();\\n\\n for (name, est) in data {\\n\\n if name == \\\"Total:\\\" {\\n\\n continue;\\n\\n }\\n\\n labels.add_appended(vec![\\n\\n Line(format!(\\\"{} (\\\", name)).size(40),\\n\\n Line(format!(\\n\\n \\\"{}%\\\",\\n\",\n \"file_path\": \"game/src/mission/dataviz.rs\",\n \"rank\": 52,\n \"score\": 228568.26743738714\n },\n {\n \"content\": \"struct Choice {\\n\\n hotkey: Option<MultiKey>,\\n\\n label: String,\\n\\n active: bool,\\n\\n}\\n\\n\\n\\nimpl ModalMenu {\\n\\n pub fn new<S: Into<String>>(\\n\\n title: S,\\n\\n raw_choices: Vec<(Option<MultiKey>, &str)>,\\n\\n ctx: &EventCtx,\\n\\n ) -> ModalMenu {\\n\\n let mut m = ModalMenu {\\n\\n title: title.into(),\\n\\n info: Text::new(),\\n\\n chosen_action: None,\\n\\n choices: raw_choices\\n\\n .into_iter()\\n\\n .map(|(hotkey, label)| Choice {\\n\\n hotkey,\\n\",\n \"file_path\": \"ezgui/src/widgets/modal_menu.rs\",\n \"rank\": 53,\n \"score\": 225838.6062609991\n },\n {\n \"content\": \"// Shorter is better\\n\\npub fn cmp_duration_shorter(now: Duration, baseline: Duration) -> Vec<TextSpan> {\\n\\n if now.epsilon_eq(baseline) {\\n\\n vec![Line(\\\" (same as baseline)\\\")]\\n\\n } else if now < baseline {\\n\\n vec![\\n\\n Line(\\\" (\\\"),\\n\\n Line((baseline - now).minimal_tostring()).fg(Color::GREEN),\\n\\n Line(\\\" faster)\\\"),\\n\\n ]\\n\\n } else if now > baseline {\\n\\n vec![\\n\\n Line(\\\" (\\\"),\\n\\n Line((now - baseline).minimal_tostring()).fg(Color::RED),\\n\\n Line(\\\" slower)\\\"),\\n\\n ]\\n\\n } else {\\n\\n unreachable!()\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"game/src/sandbox/gameplay/mod.rs\",\n \"rank\": 54,\n \"score\": 223676.59320843784\n },\n {\n \"content\": \"#[derive(Serialize, Deserialize, Derivative)]\\n\\n#[derivative(PartialEq)]\\n\\nstruct State {\\n\\n id: IntersectionID,\\n\\n accepted: BTreeSet<Request>,\\n\\n // Track when a request is first made.\\n\\n #[serde(\\n\\n serialize_with = \\\"serialize_btreemap\\\",\\n\\n deserialize_with = \\\"deserialize_btreemap\\\"\\n\\n )]\\n\\n waiting: BTreeMap<Request, Duration>,\\n\\n // TODO Can we move this to analytics?\\n\\n #[derivative(PartialEq = \\\"ignore\\\")]\\n\\n #[serde(skip_serializing, skip_deserializing)]\\n\\n delays: DurationHistogram,\\n\\n}\\n\\n\\n\\nimpl IntersectionSimState {\\n\\n pub fn new(\\n\\n map: &Map,\\n\\n scheduler: &mut Scheduler,\\n\\n use_freeform_policy_everywhere: bool,\\n\",\n \"file_path\": \"sim/src/mechanics/intersection.rs\",\n \"rank\": 55,\n \"score\": 222202.41033719748\n },\n {\n \"content\": \"// (original direction, reversed direction)\\n\\npub fn get_lane_types(osm_tags: &BTreeMap<String, String>) -> (Vec<LaneType>, Vec<LaneType>) {\\n\\n if let Some(s) = osm_tags.get(osm::SYNTHETIC_LANES) {\\n\\n if let Some(spec) = RoadSpec::parse(s.to_string()) {\\n\\n return (spec.fwd, spec.back);\\n\\n } else {\\n\\n panic!(\\\"Bad {} RoadSpec: {}\\\", osm::SYNTHETIC_LANES, s);\\n\\n }\\n\\n }\\n\\n\\n\\n // Easy special cases first.\\n\\n if osm_tags.get(\\\"junction\\\") == Some(&\\\"roundabout\\\".to_string()) {\\n\\n return (vec![LaneType::Driving, LaneType::Sidewalk], Vec::new());\\n\\n }\\n\\n if osm_tags.get(osm::HIGHWAY) == Some(&\\\"footway\\\".to_string()) {\\n\\n return (vec![LaneType::Sidewalk], Vec::new());\\n\\n }\\n\\n\\n\\n // TODO Reversible roads should be handled differently?\\n\\n let oneway = osm_tags.get(\\\"oneway\\\") == Some(&\\\"yes\\\".to_string())\\n\\n || osm_tags.get(\\\"oneway\\\") == Some(&\\\"reversible\\\".to_string());\\n\",\n \"file_path\": \"map_model/src/make/initial/lane_specs.rs\",\n \"rank\": 56,\n \"score\": 219670.58061121887\n },\n {\n \"content\": \"pub fn contains_duplicates<T: Ord>(vec: &Vec<T>) -> bool {\\n\\n let mut set = BTreeSet::new();\\n\\n for item in vec {\\n\\n if set.contains(item) {\\n\\n return true;\\n\\n }\\n\\n set.insert(item);\\n\\n }\\n\\n false\\n\\n}\\n\",\n \"file_path\": \"abstutil/src/collections.rs\",\n \"rank\": 57,\n \"score\": 219640.15744336866\n },\n {\n \"content\": \"pub fn run(t: &mut TestRunner) {\\n\\n // TODO Lots of boilerplate between these two. Can we do better?\\n\\n\\n\\n /*t.run_slow(\\\"park_on_goal_st\\\", |h| {\\n\\n let (map, mut sim, mut rng) = SimFlags::synthetic_test(\\\"parking_test\\\", \\\"park_on_goal_st\\\")\\n\\n .load(&mut Timer::throwaway());\\n\\n let north_bldg = map.bldg(\\\"north\\\").id;\\n\\n let south_bldg = map.bldg(\\\"south\\\").id;\\n\\n let north_parking = map.parking_lane(\\\"north\\\", 23).id;\\n\\n let south_parking = map.parking_lane(\\\"south\\\", 23).id;\\n\\n\\n\\n let (spot, car) =\\n\\n h.seed_parked_cars(&mut sim, &mut rng, south_parking, Some(south_bldg), vec![2])[0];\\n\\n // Fill up some of the first spots, forcing parking to happen at spot 4\\n\\n h.seed_parked_cars(&mut sim, &mut rng, north_parking, None, (0..4).collect());\\n\\n h.seed_parked_cars(&mut sim, &mut rng, north_parking, None, (5..10).collect());\\n\\n sim.schedule_trip(\\n\\n Duration::ZERO,\\n\\n TripSpec::UsingParkedCar {\\n\\n start: SidewalkSpot::building(south_bldg, &map),\\n\",\n \"file_path\": \"tests/src/parking.rs\",\n \"rank\": 58,\n \"score\": 219237.63469927508\n },\n {\n \"content\": \"#[allow(clippy::unreadable_literal)]\\n\\npub fn run(t: &mut TestRunner) {\\n\\n t.run_fast(\\\"dist_along_horiz_line\\\", |_| {\\n\\n let l = Line::new(\\n\\n Pt2D::new(147.17832753158294, 1651.034235433578),\\n\\n Pt2D::new(185.9754103560146, 1651.0342354335778),\\n\\n );\\n\\n let pt = Pt2D::new(179.1628455160347, 1651.0342354335778);\\n\\n\\n\\n assert!(l.contains_pt(pt));\\n\\n assert!(l.dist_along_of_point(pt).is_some());\\n\\n });\\n\\n\\n\\n t.run_fast(\\\"trim_with_epsilon\\\", |_| {\\n\\n /*\\n\\n // EPSILON_DIST needs to be tuned correctly, or this point seems like it's not on the line.\\n\\n let mut pl = PolyLine::new(vec![\\n\\n Pt2D::new(1130.2653468611902, 2124.099702776818),\\n\\n Pt2D::new(1175.9652436108408, 2124.1094748373457),\\n\\n Pt2D::new(1225.8319649025132, 2124.120594334445),\\n\\n ]);\\n\",\n \"file_path\": \"tests/src/geom.rs\",\n \"rank\": 59,\n \"score\": 219237.63469927508\n },\n {\n \"content\": \"fn calculate_driving_lines(lane: &Lane, parent: &Road, timer: &mut Timer) -> Vec<Polygon> {\\n\\n // The leftmost lanes don't have dashed lines.\\n\\n let (dir, idx) = parent.dir_and_offset(lane.id);\\n\\n if idx == 0 || (dir && parent.children_forwards[idx - 1].1 == LaneType::SharedLeftTurn) {\\n\\n return Vec::new();\\n\\n }\\n\\n let lane_edge_pts = lane\\n\\n .lane_center_pts\\n\\n .shift_left(LANE_THICKNESS / 2.0)\\n\\n .get(timer);\\n\\n dashed_lines(\\n\\n &lane_edge_pts,\\n\\n Distance::meters(0.25),\\n\\n Distance::meters(1.0),\\n\\n Distance::meters(1.5),\\n\\n )\\n\\n}\\n\\n\\n\",\n \"file_path\": \"game/src/render/lane.rs\",\n \"rank\": 60,\n \"score\": 219172.8739922067\n },\n {\n \"content\": \"fn edit_scenario(map: &Map, scenario: &mut Scenario, mut wizard: WrappedWizard) -> Option<()> {\\n\\n let seed_parked = \\\"Seed parked cars\\\";\\n\\n let spawn = \\\"Spawn agents\\\";\\n\\n let spawn_border = \\\"Spawn agents from a border\\\";\\n\\n let randomize = \\\"Randomly spawn stuff from/to every neighborhood\\\";\\n\\n match wizard\\n\\n .choose_string(\\\"What kind of edit?\\\", || {\\n\\n vec![seed_parked, spawn, spawn_border, randomize]\\n\\n })?\\n\\n .as_str()\\n\\n {\\n\\n x if x == seed_parked => {\\n\\n scenario.seed_parked_cars.push(SeedParkedCars {\\n\\n neighborhood: choose_neighborhood(\\n\\n map,\\n\\n &mut wizard,\\n\\n \\\"Seed parked cars in what area?\\\",\\n\\n )?,\\n\\n cars_per_building: input_weighted_usize(\\n\\n &mut wizard,\\n\",\n \"file_path\": \"game/src/mission/scenario.rs\",\n \"rank\": 61,\n \"score\": 218638.25986555155\n },\n {\n \"content\": \"pub fn challenges_picker() -> Box<dyn State> {\\n\\n WizardState::new(Box::new(move |wiz, ctx, _| {\\n\\n let (_, challenge) = wiz.wrap(ctx).choose(\\\"Play which challenge?\\\", || {\\n\\n all_challenges()\\n\\n .into_iter()\\n\\n .map(|c| Choice::new(c.title.clone(), c))\\n\\n .collect()\\n\\n })?;\\n\\n\\n\\n let edits = abstutil::list_all_objects(abstutil::EDITS, &challenge.map_name);\\n\\n let mut summary = Text::new();\\n\\n for l in &challenge.description {\\n\\n summary.add(Line(l));\\n\\n }\\n\\n summary.add(Line(\\\"\\\"));\\n\\n summary.add(Line(format!(\\\"{} proposals:\\\", edits.len())));\\n\\n summary.add(Line(\\\"\\\"));\\n\\n for e in edits {\\n\\n summary.add(Line(format!(\\\"- {} (untested)\\\", e)));\\n\\n }\\n\",\n \"file_path\": \"game/src/challenges.rs\",\n \"rank\": 62,\n \"score\": 216985.74584982672\n },\n {\n \"content\": \"fn finish(dir_path: &str, filenames: Vec<String>, num_tiles_x: usize, num_tiles_y: usize) {\\n\\n {\\n\\n let mut args = filenames.clone();\\n\\n args.push(\\\"-mode\\\".to_string());\\n\\n args.push(\\\"Concatenate\\\".to_string());\\n\\n args.push(\\\"-tile\\\".to_string());\\n\\n args.push(format!(\\\"{}x{}\\\", num_tiles_x, num_tiles_y));\\n\\n args.push(\\\"full.png\\\".to_string());\\n\\n\\n\\n let mut file = fs::File::create(format!(\\\"{}/combine.sh\\\", dir_path)).unwrap();\\n\\n writeln!(file, \\\"#!/bin/bash\\\\n\\\").unwrap();\\n\\n writeln!(file, \\\"montage {}\\\", args.join(\\\" \\\")).unwrap();\\n\\n writeln!(file, \\\"rm -f combine.sh\\\").unwrap();\\n\\n }\\n\\n\\n\\n {\\n\\n let output = process::Command::new(\\\"md5sum\\\")\\n\\n .args(\\n\\n &filenames\\n\\n .into_iter()\\n\",\n \"file_path\": \"ezgui/src/widgets/screenshot.rs\",\n \"rank\": 63,\n \"score\": 216709.52470633993\n },\n {\n \"content\": \"pub fn run(t: &mut TestRunner) {\\n\\n t.run_slow(\\\"convert_osm_twice\\\", |_| {\\n\\n let flags = convert_osm::Flags {\\n\\n osm: \\\"../data/input/montlake.osm\\\".to_string(),\\n\\n parking_shapes: Some(\\\"../data/shapes/blockface.bin\\\".to_string()),\\n\\n offstreet_parking: Some(\\\"../data/input/offstreet_parking.kml\\\".to_string()),\\n\\n sidewalks: Some(\\\"../data/shapes/sidewalks.bin\\\".to_string()),\\n\\n gtfs: Some(\\\"../data/input/google_transit_2018_18_08\\\".to_string()),\\n\\n neighborhoods: Some(\\\"../data/input/neighborhoods.geojson\\\".to_string()),\\n\\n clip: Some(abstutil::path_polygon(\\\"montlake\\\")),\\n\\n output: \\\"convert_osm_twice.bin\\\".to_string(),\\n\\n };\\n\\n\\n\\n let map1 = convert_osm::convert(&flags, &mut abstutil::Timer::throwaway());\\n\\n let map2 = convert_osm::convert(&flags, &mut abstutil::Timer::throwaway());\\n\\n\\n\\n if abstutil::to_json(&map1) != abstutil::to_json(&map2) {\\n\\n // TODO tmp files\\n\\n abstutil::write_json(\\\"map1.json\\\", &map1).unwrap();\\n\\n abstutil::write_json(\\\"map2.json\\\", &map2).unwrap();\\n\",\n \"file_path\": \"tests/src/map_conversion.rs\",\n \"rank\": 64,\n \"score\": 215859.5019868964\n },\n {\n \"content\": \"pub fn wraparound_get<T>(vec: &Vec<T>, idx: isize) -> &T {\\n\\n let len = vec.len() as isize;\\n\\n let idx = idx % len;\\n\\n let idx = if idx >= 0 { idx } else { idx + len };\\n\\n &vec[idx as usize]\\n\\n}\\n\\n\\n\",\n \"file_path\": \"abstutil/src/collections.rs\",\n \"rank\": 65,\n \"score\": 214282.17902296237\n },\n {\n \"content\": \"// TODO This needs to update turn restrictions too\\n\\npub fn clip_map(map: &mut RawMap, timer: &mut Timer) {\\n\\n timer.start(\\\"clipping map to boundary\\\");\\n\\n\\n\\n // So we can use retain_btreemap without borrowing issues\\n\\n let boundary_polygon = map.boundary_polygon.clone();\\n\\n let boundary_lines: Vec<PolyLine> = map\\n\\n .boundary_polygon\\n\\n .points()\\n\\n .windows(2)\\n\\n .map(|pair| PolyLine::new(pair.to_vec()))\\n\\n .collect();\\n\\n\\n\\n // This is kind of indirect and slow, but first pass -- just remove roads that start or end\\n\\n // outside the boundary polygon.\\n\\n retain_btreemap(&mut map.roads, |_, r| {\\n\\n let first_in = boundary_polygon.contains_pt(r.center_points[0]);\\n\\n let last_in = boundary_polygon.contains_pt(*r.center_points.last().unwrap());\\n\\n first_in || last_in\\n\\n });\\n\\n\\n\",\n \"file_path\": \"convert_osm/src/clip.rs\",\n \"rank\": 66,\n \"score\": 213765.78823087417\n },\n {\n \"content\": \"fn close_off_polygon(mut pts: Vec<Pt2D>) -> Vec<Pt2D> {\\n\\n if pts.last().unwrap().approx_eq(pts[0], Distance::meters(0.1)) {\\n\\n pts.pop();\\n\\n }\\n\\n pts.push(pts[0]);\\n\\n pts\\n\\n}\\n\",\n \"file_path\": \"map_model/src/make/initial/geometry.rs\",\n \"rank\": 67,\n \"score\": 213495.47393169493\n },\n {\n \"content\": \"pub fn get_lane_specs(osm_tags: &BTreeMap<String, String>) -> Vec<LaneSpec> {\\n\\n let (side1_types, side2_types) = lane_specs::get_lane_types(osm_tags);\\n\\n\\n\\n let mut specs: Vec<LaneSpec> = Vec::new();\\n\\n for lane_type in side1_types {\\n\\n specs.push(LaneSpec {\\n\\n lane_type,\\n\\n reverse_pts: false,\\n\\n });\\n\\n }\\n\\n for lane_type in side2_types {\\n\\n specs.push(LaneSpec {\\n\\n lane_type,\\n\\n reverse_pts: true,\\n\\n });\\n\\n }\\n\\n if specs.is_empty() {\\n\\n panic!(\\\"Road with tags {:?} wound up with no lanes!\\\", osm_tags);\\n\\n }\\n\\n specs\\n\\n}\\n\",\n \"file_path\": \"map_model/src/make/initial/mod.rs\",\n \"rank\": 68,\n \"score\": 212063.540394945\n },\n {\n \"content\": \"// Add all possible protected groups to existing phases.\\n\\nfn expand_all_phases(phases: &mut Vec<Phase>, turn_groups: &BTreeMap<TurnGroupID, TurnGroup>) {\\n\\n for phase in phases.iter_mut() {\\n\\n for g in turn_groups.keys() {\\n\\n if phase.could_be_protected(*g, turn_groups) {\\n\\n phase.protected_groups.insert(*g);\\n\\n }\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\nconst PROTECTED: bool = true;\\n\\nconst YIELD: bool = false;\\n\\n\\n\",\n \"file_path\": \"map_model/src/traffic_signals.rs\",\n \"rank\": 69,\n \"score\": 207555.51355756642\n },\n {\n \"content\": \"pub fn remove_disconnected_roads(map: &mut RawMap, timer: &mut Timer) {\\n\\n timer.start(\\\"removing disconnected roads\\\");\\n\\n // This is a simple floodfill, not Tarjan's. Assumes all roads bidirectional.\\n\\n // All the usizes are indices into the original list of roads\\n\\n\\n\\n let mut next_roads: MultiMap<OriginalIntersection, OriginalRoad> = MultiMap::new();\\n\\n for id in map.roads.keys() {\\n\\n next_roads.insert(id.i1, *id);\\n\\n next_roads.insert(id.i2, *id);\\n\\n }\\n\\n\\n\\n let mut partitions: Vec<Vec<OriginalRoad>> = Vec::new();\\n\\n let mut unvisited_roads: BTreeSet<OriginalRoad> = map.roads.keys().cloned().collect();\\n\\n\\n\\n while !unvisited_roads.is_empty() {\\n\\n let mut queue_roads: Vec<OriginalRoad> = vec![*unvisited_roads.iter().next().unwrap()];\\n\\n let mut current_partition: Vec<OriginalRoad> = Vec::new();\\n\\n while !queue_roads.is_empty() {\\n\\n let current = queue_roads.pop().unwrap();\\n\\n if !unvisited_roads.contains(¤t) {\\n\",\n \"file_path\": \"map_model/src/make/remove_disconnected.rs\",\n \"rank\": 70,\n \"score\": 206689.69580372667\n },\n {\n \"content\": \"// TODO Validate the intersection exists? Let them pick it with the cursor?\\n\\nfn choose_intersection(wizard: &mut WrappedWizard, query: &str) -> Option<IntersectionID> {\\n\\n wizard.input_something(\\n\\n query,\\n\\n None,\\n\\n Box::new(|line| usize::from_str_radix(&line, 10).ok().map(IntersectionID)),\\n\\n )\\n\\n}\\n\\n\\n\",\n \"file_path\": \"game/src/mission/scenario.rs\",\n \"rank\": 71,\n \"score\": 203862.3439029249\n },\n {\n \"content\": \"fn pick_neighborhood(map: &Map, mut wizard: WrappedWizard) -> Option<NeighborhoodBuilder> {\\n\\n let load_existing = \\\"Load existing neighborhood\\\";\\n\\n let create_new = \\\"Create new neighborhood\\\";\\n\\n if wizard.choose_string(\\\"What neighborhood to edit?\\\", || {\\n\\n vec![load_existing, create_new]\\n\\n })? == load_existing\\n\\n {\\n\\n load_neighborhood_builder(map, &mut wizard, \\\"Load which neighborhood?\\\")\\n\\n } else {\\n\\n let name = wizard.input_string(\\\"Name the neighborhood\\\")?;\\n\\n Some(NeighborhoodBuilder {\\n\\n name,\\n\\n map_name: map.get_name().to_string(),\\n\\n points: Vec::new(),\\n\\n })\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"game/src/mission/neighborhood.rs\",\n \"rank\": 72,\n \"score\": 203856.68227428332\n },\n {\n \"content\": \"pub fn import_trips(\\n\\n parcels_path: &str,\\n\\n trips_path: &str,\\n\\n timer: &mut Timer,\\n\\n) -> Result<(Vec<Trip>, BTreeMap<i64, Parcel>), failure::Error> {\\n\\n let (parcels, metadata) = import_parcels(parcels_path, timer)?;\\n\\n\\n\\n let mut trips = Vec::new();\\n\\n let (reader, done) = FileWithProgress::new(trips_path)?;\\n\\n for rec in csv::Reader::from_reader(reader).records() {\\n\\n let rec = rec?;\\n\\n\\n\\n // opcl\\n\\n let from = skip_fail!(parcels.get(rec[15].trim_end_matches(\\\".0\\\"))).clone();\\n\\n // dpcl\\n\\n let to = skip_fail!(parcels.get(rec[6].trim_end_matches(\\\".0\\\"))).clone();\\n\\n\\n\\n if from.osm_building == to.osm_building {\\n\\n // TODO Plumb along pass-through trips later\\n\\n if from.osm_building.is_some() {\\n\",\n \"file_path\": \"popdat/src/psrc.rs\",\n \"rank\": 73,\n \"score\": 202534.06735025224\n },\n {\n \"content\": \"pub fn stack_vertically(\\n\\n orientation: ContainerOrientation,\\n\\n canvas: &Canvas,\\n\\n widgets: Vec<&mut dyn Widget>,\\n\\n) {\\n\\n assert!(!widgets.is_empty());\\n\\n\\n\\n let dims_per_widget: Vec<ScreenDims> = widgets.iter().map(|w| w.get_dims()).collect();\\n\\n let total_width = dims_per_widget\\n\\n .iter()\\n\\n .map(|d| d.width)\\n\\n .max_by_key(|x| NotNan::new(*x).unwrap())\\n\\n .unwrap();\\n\\n let total_height: f64 = dims_per_widget.iter().map(|d| d.height).sum();\\n\\n\\n\\n let mut top_left = match orientation {\\n\\n ContainerOrientation::TopLeft => ScreenPt::new(0.0, 0.0),\\n\\n ContainerOrientation::TopRight => ScreenPt::new(canvas.window_width - total_width, 0.0),\\n\\n ContainerOrientation::Centered => {\\n\\n let mut pt = canvas.center_to_screen_pt();\\n\",\n \"file_path\": \"ezgui/src/layout.rs\",\n \"rank\": 74,\n \"score\": 202061.976937329\n },\n {\n \"content\": \"pub fn dashed_lines(\\n\\n pl: &PolyLine,\\n\\n width: Distance,\\n\\n dash_len: Distance,\\n\\n dash_separation: Distance,\\n\\n) -> Vec<Polygon> {\\n\\n if pl.length() < dash_separation * 2.0 + EPSILON_DIST {\\n\\n return vec![pl.make_polygons(width)];\\n\\n }\\n\\n // Don't draw the dashes too close to the ends.\\n\\n pl.exact_slice(dash_separation, pl.length() - dash_separation)\\n\\n .dashed_polygons(width, dash_len, dash_separation)\\n\\n}\\n\\n\\n\\npub struct DrawCtx<'a> {\\n\\n pub cs: &'a ColorScheme,\\n\\n pub map: &'a Map,\\n\\n pub draw_map: &'a DrawMap,\\n\\n pub sim: &'a Sim,\\n\\n}\\n\",\n \"file_path\": \"game/src/render/mod.rs\",\n \"rank\": 75,\n \"score\": 198941.3229740174\n },\n {\n \"content\": \"pub fn list_dir(dir: &std::path::Path) -> Vec<String> {\\n\\n let mut files: Vec<String> = Vec::new();\\n\\n match std::fs::read_dir(dir) {\\n\\n Ok(iter) => {\\n\\n for entry in iter {\\n\\n files.push(entry.unwrap().path().to_str().unwrap().to_string());\\n\\n }\\n\\n }\\n\\n Err(ref e) if e.kind() == ErrorKind::NotFound => {}\\n\\n Err(e) => panic!(\\\"Couldn't read_dir {:?}: {}\\\", dir, e),\\n\\n };\\n\\n files.sort();\\n\\n files\\n\\n}\\n\\n\\n\",\n \"file_path\": \"abstutil/src/io.rs\",\n \"rank\": 76,\n \"score\": 197381.04494453658\n },\n {\n \"content\": \"pub fn load(dir_path: &str) -> Result<Vec<Route>, Error> {\\n\\n println!(\\\"Loading GTFS from {}\\\", dir_path);\\n\\n let timer = Instant::now();\\n\\n\\n\\n let mut route_id_to_name: HashMap<String, String> = HashMap::new();\\n\\n for rec in csv::Reader::from_reader(File::open(format!(\\\"{}/routes.txt\\\", dir_path))?).records() {\\n\\n let rec = rec?;\\n\\n route_id_to_name.insert(rec[0].to_string(), rec[2].to_string());\\n\\n }\\n\\n\\n\\n let mut stop_id_to_pt: HashMap<String, LonLat> = HashMap::new();\\n\\n for rec in csv::Reader::from_reader(File::open(format!(\\\"{}/stops.txt\\\", dir_path))?).records() {\\n\\n let rec = rec?;\\n\\n let lon: f64 = rec[5].parse()?;\\n\\n let lat: f64 = rec[4].parse()?;\\n\\n stop_id_to_pt.insert(rec[0].to_string(), LonLat::new(lon, lat));\\n\\n }\\n\\n\\n\\n let mut trip_id_to_route_id_and_direction: HashMap<String, (String, bool)> = HashMap::new();\\n\\n for rec in csv::Reader::from_reader(File::open(format!(\\\"{}/trips.txt\\\", dir_path))?).records() {\\n\",\n \"file_path\": \"gtfs/src/lib.rs\",\n \"rank\": 77,\n \"score\": 197381.04494453658\n },\n {\n \"content\": \"fn create_swarm(ui: &mut UI, from: LaneID, to: LaneID, count: usize, duration: Duration) {\\n\\n let mut scenario = Scenario::empty(&ui.primary.map);\\n\\n scenario.scenario_name = \\\"swarm\\\".to_string();\\n\\n scenario.border_spawn_over_time.push(BorderSpawnOverTime {\\n\\n num_peds: 0,\\n\\n num_cars: count,\\n\\n num_bikes: 0,\\n\\n start_time: ui.primary.sim.time() + SMALL_DT,\\n\\n stop_time: ui.primary.sim.time() + SMALL_DT + duration,\\n\\n start_from_border: ui\\n\\n .primary\\n\\n .map\\n\\n .get_l(from)\\n\\n .get_directed_parent(&ui.primary.map),\\n\\n goal: OriginDestination::EndOfRoad(\\n\\n ui.primary\\n\\n .map\\n\\n .get_l(to)\\n\\n .get_directed_parent(&ui.primary.map),\\n\\n ),\\n\",\n \"file_path\": \"game/src/sandbox/gameplay/spawner.rs\",\n \"rank\": 78,\n \"score\": 196275.8921152898\n },\n {\n \"content\": \"fn choose_neighborhood(map: &Map, wizard: &mut WrappedWizard, query: &str) -> Option<String> {\\n\\n // Load the full object, since we usually visualize the neighborhood when menuing over it\\n\\n wizard\\n\\n .choose(query, || {\\n\\n Choice::from(Neighborhood::load_all(map.get_name(), map.get_gps_bounds()))\\n\\n })\\n\\n .map(|(n, _)| n)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"game/src/mission/scenario.rs\",\n \"rank\": 79,\n \"score\": 195991.00463555864\n },\n {\n \"content\": \"// Need to explain this trick -- basically keeps consistency between two different simulations when\\n\\n// each one might make slightly different sequences of calls to the RNG.\\n\\npub fn fork_rng(base_rng: &mut XorShiftRng) -> XorShiftRng {\\n\\n XorShiftRng::from_seed([base_rng.next_u32() as u8; 16])\\n\\n}\\n\\n\\n\\n// Represents the probability of sampling 0, 1, 2, 3... The sum can be anything.\\n\\n#[derive(Clone, Debug, Serialize, Deserialize)]\\n\\npub struct WeightedUsizeChoice {\\n\\n pub weights: Vec<usize>,\\n\\n}\\n\\n\\n\\nimpl WeightedUsizeChoice {\\n\\n pub fn parse(string: &str) -> Option<WeightedUsizeChoice> {\\n\\n let parts: Vec<&str> = string.split(',').collect();\\n\\n if parts.is_empty() {\\n\\n return None;\\n\\n }\\n\\n let mut weights: Vec<usize> = Vec::new();\\n\\n for x in parts.into_iter() {\\n\\n let x = x.parse::<usize>().ok()?;\\n\\n weights.push(x);\\n\\n }\\n\\n Some(WeightedUsizeChoice { weights })\\n\\n }\\n\\n\\n\\n pub fn sample(&self, rng: &mut XorShiftRng) -> usize {\\n\\n WeightedIndex::new(&self.weights).unwrap().sample(rng)\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"abstutil/src/random.rs\",\n \"rank\": 80,\n \"score\": 195199.13747981816\n },\n {\n \"content\": \"// Just list all things from a directory, return sorted by name, with file extension removed.\\n\\n// Hacky that map_name can be blank. ;)\\n\\npub fn list_all_objects(dir: &str, map_name: &str) -> Vec<String> {\\n\\n let mut results: BTreeSet<String> = BTreeSet::new();\\n\\n match std::fs::read_dir(format!(\\\"../data/{}/{}\\\", dir, map_name)) {\\n\\n Ok(iter) => {\\n\\n for entry in iter {\\n\\n let filename = entry.unwrap().file_name();\\n\\n let path = Path::new(&filename);\\n\\n if path.to_string_lossy().ends_with(\\\".swp\\\") {\\n\\n continue;\\n\\n }\\n\\n let name = path\\n\\n .file_stem()\\n\\n .unwrap()\\n\\n .to_os_string()\\n\\n .into_string()\\n\\n .unwrap();\\n\\n results.insert(name);\\n\\n }\\n\\n }\\n\\n Err(ref e) if e.kind() == ErrorKind::NotFound => {}\\n\\n Err(e) => panic!(e),\\n\\n };\\n\\n results.into_iter().collect()\\n\\n}\\n\\n\\n\",\n \"file_path\": \"abstutil/src/io.rs\",\n \"rank\": 81,\n \"score\": 194605.53851960582\n },\n {\n \"content\": \"fn choose_scenario(map_name: &str, wizard: &mut WrappedWizard, query: &str) -> Option<String> {\\n\\n wizard.choose_string(query, || {\\n\\n abstutil::list_all_objects(abstutil::SCENARIOS, map_name)\\n\\n })\\n\\n}\\n\\n\\n\",\n \"file_path\": \"game/src/abtest/setup.rs\",\n \"rank\": 82,\n \"score\": 193721.68560863798\n },\n {\n \"content\": \"pub fn convert(flags: &Flags, timer: &mut abstutil::Timer) -> RawMap {\\n\\n let mut map = split_ways::split_up_roads(\\n\\n osm_reader::extract_osm(&flags.osm, &flags.clip, timer),\\n\\n timer,\\n\\n );\\n\\n clip::clip_map(&mut map, timer);\\n\\n\\n\\n // Need to do a first pass of removing cul-de-sacs here, or we wind up with loop PolyLines when doing the parking hint matching.\\n\\n abstutil::retain_btreemap(&mut map.roads, |r, _| r.i1 != r.i2);\\n\\n\\n\\n if let Some(ref path) = flags.parking_shapes {\\n\\n use_parking_hints(&mut map, path, timer);\\n\\n }\\n\\n if let Some(ref path) = flags.offstreet_parking {\\n\\n use_offstreet_parking(&mut map, path, timer);\\n\\n }\\n\\n if let Some(ref path) = flags.sidewalks {\\n\\n use_sidewalk_hints(&mut map, path, timer);\\n\\n }\\n\\n if let Some(ref path) = flags.gtfs {\\n\",\n \"file_path\": \"convert_osm/src/lib.rs\",\n \"rank\": 83,\n \"score\": 188667.77601208986\n },\n {\n \"content\": \"fn calculate_border_arrows(i: &Intersection, r: &Road, timer: &mut Timer) -> Vec<Polygon> {\\n\\n let mut result = Vec::new();\\n\\n\\n\\n // These arrows should point from the void to the road\\n\\n if !i.outgoing_lanes.is_empty() {\\n\\n // The line starts at the border and points down the road\\n\\n let (line, width) = if r.dst_i == i.id {\\n\\n let width = (r.children_forwards.len() as f64) * LANE_THICKNESS;\\n\\n (\\n\\n r.center_pts.last_line().shift_left(width / 2.0).reverse(),\\n\\n width,\\n\\n )\\n\\n } else {\\n\\n let width = (r.children_forwards.len() as f64) * LANE_THICKNESS;\\n\\n (r.center_pts.first_line().shift_right(width / 2.0), width)\\n\\n };\\n\\n result.push(\\n\\n // DEGENERATE_INTERSECTION_HALF_LENGTH is 5m...\\n\\n PolyLine::new(vec![\\n\\n line.unbounded_dist_along(Distance::meters(-9.5)),\\n\",\n \"file_path\": \"game/src/render/intersection.rs\",\n \"rank\": 84,\n \"score\": 187444.314440739\n },\n {\n \"content\": \"fn warp_point(line: &str, primary: &PerMapUI) -> Option<(Option<ID>, Pt2D, f64)> {\\n\\n if line.is_empty() {\\n\\n return None;\\n\\n }\\n\\n // TODO Weird magic shortcut to go to last spot. What should this be?\\n\\n if line == \\\"j\\\" {\\n\\n if let Some((pt, zoom)) = primary.last_warped_from {\\n\\n return Some((None, pt, zoom));\\n\\n }\\n\\n return None;\\n\\n }\\n\\n\\n\\n let id = match usize::from_str_radix(&line[1..line.len()], 10) {\\n\\n Ok(idx) => match line.chars().next().unwrap() {\\n\\n 'r' => {\\n\\n let r = primary.map.maybe_get_r(RoadID(idx))?;\\n\\n ID::Lane(r.children_forwards[0].0)\\n\\n }\\n\\n 'l' => ID::Lane(LaneID(idx)),\\n\\n 'i' => ID::Intersection(IntersectionID(idx)),\\n\",\n \"file_path\": \"game/src/common/warp.rs\",\n \"rank\": 85,\n \"score\": 187349.68538826093\n },\n {\n \"content\": \"#[derive(Serialize, Deserialize, PartialEq)]\\n\\nstruct Bus {\\n\\n car: CarID,\\n\\n route: BusRouteID,\\n\\n // Where does each passenger want to deboard?\\n\\n passengers: Vec<(PedestrianID, BusStopID)>,\\n\\n state: BusState,\\n\\n}\\n\\n\\n\",\n \"file_path\": \"sim/src/transit.rs\",\n \"rank\": 86,\n \"score\": 186641.26374252306\n },\n {\n \"content\": \"#[derive(Serialize, Deserialize, PartialEq)]\\n\\nstruct Route {\\n\\n stops: Vec<StopForRoute>,\\n\\n buses: Vec<CarID>,\\n\\n}\\n\\n\\n\",\n \"file_path\": \"sim/src/transit.rs\",\n \"rank\": 87,\n \"score\": 186641.26374252306\n },\n {\n \"content\": \"pub fn fix_bus_route(map: &Map, r: &mut BusRoute) -> bool {\\n\\n // Trim out stops if needed; map borders sometimes mean some paths don't work.\\n\\n let mut stops = Vec::new();\\n\\n for stop in r.stops.drain(..) {\\n\\n if stops.is_empty() {\\n\\n stops.push(stop);\\n\\n } else {\\n\\n if check_stops(*stops.last().unwrap(), stop, map) {\\n\\n stops.push(stop);\\n\\n }\\n\\n }\\n\\n }\\n\\n // Don't forget the last and first\\n\\n while stops.len() >= 2 {\\n\\n if check_stops(*stops.last().unwrap(), stops[0], map) {\\n\\n break;\\n\\n }\\n\\n // TODO Or the front one\\n\\n stops.pop();\\n\\n }\\n\\n r.stops = stops;\\n\\n r.stops.len() >= 2\\n\\n}\\n\\n\\n\",\n \"file_path\": \"map_model/src/make/bus_stops.rs\",\n \"rank\": 88,\n \"score\": 186508.4197135209\n },\n {\n \"content\": \"fn calculate_turn_markings(map: &Map, lane: &Lane, timer: &mut Timer) -> Vec<Polygon> {\\n\\n let mut results = Vec::new();\\n\\n\\n\\n // Are there multiple driving lanes on this side of the road?\\n\\n if map\\n\\n .find_closest_lane(lane.id, vec![LaneType::Driving])\\n\\n .is_err()\\n\\n {\\n\\n return results;\\n\\n }\\n\\n if lane.length() < Distance::meters(7.0) {\\n\\n return results;\\n\\n }\\n\\n\\n\\n let thickness = Distance::meters(0.2);\\n\\n\\n\\n let common_base = lane.lane_center_pts.exact_slice(\\n\\n lane.length() - Distance::meters(7.0),\\n\\n lane.length() - Distance::meters(5.0),\\n\\n );\\n\",\n \"file_path\": \"game/src/render/lane.rs\",\n \"rank\": 89,\n \"score\": 182485.36629298347\n },\n {\n \"content\": \"#[derive(Serialize, Deserialize, PartialEq)]\\n\\nstruct StopForRoute {\\n\\n id: BusStopID,\\n\\n driving_pos: Position,\\n\\n path_to_next_stop: Path,\\n\\n next_stop_idx: StopIdx,\\n\\n}\\n\\n\\n\",\n \"file_path\": \"sim/src/transit.rs\",\n \"rank\": 90,\n \"score\": 182446.9970714596\n },\n {\n \"content\": \"fn use_offstreet_parking(map: &mut RawMap, path: &str, timer: &mut Timer) {\\n\\n timer.start(\\\"match offstreet parking points\\\");\\n\\n let shapes = kml::load(path, &map.gps_bounds, timer).expect(\\\"loading offstreet_parking failed\\\");\\n\\n\\n\\n let mut closest: FindClosest<OriginalBuilding> = FindClosest::new(&map.gps_bounds.to_bounds());\\n\\n for (id, b) in &map.buildings {\\n\\n closest.add(*id, b.polygon.points());\\n\\n }\\n\\n\\n\\n // TODO Another function just to use ?. Try blocks would rock.\\n\\n let mut handle_shape: Box<dyn FnMut(kml::ExtraShape) -> Option<()>> = Box::new(|s| {\\n\\n assert_eq!(s.points.len(), 1);\\n\\n let pt = Pt2D::from_gps(s.points[0], &map.gps_bounds)?;\\n\\n let (id, _) = closest.closest_pt(pt, Distance::meters(50.0))?;\\n\\n // TODO Handle parking lots.\\n\\n if !map.buildings[&id].polygon.contains_pt(pt) {\\n\\n return None;\\n\\n }\\n\\n let name = s.attributes.get(\\\"DEA_FACILITY_NAME\\\")?.to_string();\\n\\n let num_stalls = s.attributes.get(\\\"DEA_STALLS\\\")?.parse::<usize>().ok()?;\\n\",\n \"file_path\": \"convert_osm/src/lib.rs\",\n \"rank\": 91,\n \"score\": 180005.93866193263\n },\n {\n \"content\": \"fn use_parking_hints(map: &mut RawMap, path: &str, timer: &mut Timer) {\\n\\n timer.start(\\\"apply parking hints\\\");\\n\\n let shapes: ExtraShapes = abstutil::read_binary(path, timer).expect(\\\"loading blockface failed\\\");\\n\\n\\n\\n // Match shapes with the nearest road + direction (true for forwards)\\n\\n let mut closest: FindClosest<(OriginalRoad, bool)> =\\n\\n FindClosest::new(&map.gps_bounds.to_bounds());\\n\\n for (id, r) in &map.roads {\\n\\n let center = PolyLine::new(r.center_points.clone());\\n\\n closest.add(\\n\\n (*id, true),\\n\\n center.shift_right(LANE_THICKNESS).get(timer).points(),\\n\\n );\\n\\n closest.add(\\n\\n (*id, false),\\n\\n center.shift_left(LANE_THICKNESS).get(timer).points(),\\n\\n );\\n\\n }\\n\\n\\n\\n for s in shapes.shapes.into_iter() {\\n\",\n \"file_path\": \"convert_osm/src/lib.rs\",\n \"rank\": 92,\n \"score\": 180005.93866193263\n },\n {\n \"content\": \"fn use_sidewalk_hints(map: &mut RawMap, path: &str, timer: &mut Timer) {\\n\\n timer.start(\\\"apply sidewalk hints\\\");\\n\\n let shapes: ExtraShapes = abstutil::read_binary(path, timer).unwrap();\\n\\n\\n\\n // Match shapes with the nearest road + direction (true for forwards)\\n\\n let mut closest: FindClosest<(OriginalRoad, bool)> =\\n\\n FindClosest::new(&map.gps_bounds.to_bounds());\\n\\n for (id, r) in &map.roads {\\n\\n let center = PolyLine::new(r.center_points.clone());\\n\\n closest.add(\\n\\n (*id, true),\\n\\n center.shift_right(LANE_THICKNESS).get(timer).points(),\\n\\n );\\n\\n closest.add(\\n\\n (*id, false),\\n\\n center.shift_left(LANE_THICKNESS).get(timer).points(),\\n\\n );\\n\\n }\\n\\n\\n\\n for s in shapes.shapes.into_iter() {\\n\",\n \"file_path\": \"convert_osm/src/lib.rs\",\n \"rank\": 93,\n \"score\": 180005.93866193263\n },\n {\n \"content\": \"fn calculate_sidewalk_lines(lane: &Lane) -> Vec<Polygon> {\\n\\n let tile_every = LANE_THICKNESS;\\n\\n\\n\\n let length = lane.length();\\n\\n\\n\\n let mut result = Vec::new();\\n\\n // Start away from the intersections\\n\\n let mut dist_along = tile_every;\\n\\n while dist_along < length - tile_every {\\n\\n let (pt, angle) = lane.dist_along(dist_along);\\n\\n // Reuse perp_line. Project away an arbitrary amount\\n\\n let pt2 = pt.project_away(Distance::meters(1.0), angle);\\n\\n result.push(\\n\\n perp_line(Line::new(pt, pt2), LANE_THICKNESS).make_polygons(Distance::meters(0.25)),\\n\\n );\\n\\n dist_along += tile_every;\\n\\n }\\n\\n\\n\\n result\\n\\n}\\n\\n\\n\",\n \"file_path\": \"game/src/render/lane.rs\",\n \"rank\": 94,\n \"score\": 179374.14576208714\n },\n {\n \"content\": \"fn calculate_parking_lines(lane: &Lane) -> Vec<Polygon> {\\n\\n // meters, but the dims get annoying below to remove\\n\\n let leg_length = Distance::meters(1.0);\\n\\n\\n\\n let mut result = Vec::new();\\n\\n let num_spots = lane.number_parking_spots();\\n\\n if num_spots > 0 {\\n\\n for idx in 0..=num_spots {\\n\\n let (pt, lane_angle) = lane.dist_along(PARKING_SPOT_LENGTH * (1.0 + idx as f64));\\n\\n let perp_angle = lane_angle.rotate_degs(270.0);\\n\\n // Find the outside of the lane. Actually, shift inside a little bit, since the line will\\n\\n // have thickness, but shouldn't really intersect the adjacent line when drawn.\\n\\n let t_pt = pt.project_away(LANE_THICKNESS * 0.4, perp_angle);\\n\\n // The perp leg\\n\\n let p1 = t_pt.project_away(leg_length, perp_angle.opposite());\\n\\n result.push(Line::new(t_pt, p1).make_polygons(Distance::meters(0.25)));\\n\\n // Upper leg\\n\\n let p2 = t_pt.project_away(leg_length, lane_angle);\\n\\n result.push(Line::new(t_pt, p2).make_polygons(Distance::meters(0.25)));\\n\\n // Lower leg\\n\\n let p3 = t_pt.project_away(leg_length, lane_angle.opposite());\\n\\n result.push(Line::new(t_pt, p3).make_polygons(Distance::meters(0.25)));\\n\\n }\\n\\n }\\n\\n\\n\\n result\\n\\n}\\n\\n\\n\",\n \"file_path\": \"game/src/render/lane.rs\",\n \"rank\": 95,\n \"score\": 179374.14576208714\n },\n {\n \"content\": \"pub fn path_camera_state(map_name: &str) -> String {\\n\\n format!(\\\"../data/camera_state/{}.json\\\", map_name)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"abstutil/src/lib.rs\",\n \"rank\": 96,\n \"score\": 177749.5960812691\n },\n {\n \"content\": \"// Load all serialized things from a directory, return sorted by name, with file extension removed.\\n\\n// Detects JSON or binary.\\n\\npub fn load_all_objects<T: DeserializeOwned>(dir: &str, map_name: &str) -> Vec<(String, T)> {\\n\\n let mut timer = Timer::new(&format!(\\n\\n \\\"load_all_objects from ../data/{}/{}/\\\",\\n\\n dir, map_name\\n\\n ));\\n\\n let mut tree: BTreeMap<String, T> = BTreeMap::new();\\n\\n match std::fs::read_dir(format!(\\\"../data/{}/{}/\\\", dir, map_name)) {\\n\\n Ok(iter) => {\\n\\n for entry in iter {\\n\\n let filename = entry.unwrap().file_name();\\n\\n let path = Path::new(&filename);\\n\\n let path_str = path.to_string_lossy();\\n\\n if path_str.ends_with(\\\".swp\\\") {\\n\\n continue;\\n\\n }\\n\\n let name = path\\n\\n .file_stem()\\n\\n .unwrap()\\n\\n .to_os_string()\\n\\n .into_string()\\n\",\n \"file_path\": \"abstutil/src/io.rs\",\n \"rank\": 97,\n \"score\": 176819.88723320133\n },\n {\n \"content\": \"fn pts_to_line_string(raw_pts: &Vec<Pt2D>) -> geo::LineString<f64> {\\n\\n let pts: Vec<geo::Point<f64>> = raw_pts\\n\\n .iter()\\n\\n .map(|pt| geo::Point::new(pt.x(), pt.y()))\\n\\n .collect();\\n\\n pts.into()\\n\\n}\\n\",\n \"file_path\": \"geom/src/find_closest.rs\",\n \"rank\": 98,\n \"score\": 174903.68035820633\n },\n {\n \"content\": \"struct UI {\\n\\n model: Model,\\n\\n state: State,\\n\\n menu: ModalMenu,\\n\\n sidebar: Text,\\n\\n\\n\\n last_id: Option<ID>,\\n\\n}\\n\\n\\n\",\n \"file_path\": \"map_editor/src/main.rs\",\n \"rank\": 99,\n \"score\": 174602.27125593636\n }\n]","isConversational":false}}},{"rowIdx":2367,"cells":{"lang":{"kind":"string","value":"Rust"},"file_path":{"kind":"string","value":"src/types/float.rs"},"repo_name":{"kind":"string","value":"dholroyd/hls_m3u8"},"commit":{"kind":"string","value":"7e6da6224dad326d915d113357e22f6fc0455c92"},"file_code":{"kind":"string","value":"use core::cmp::Ordering;\nuse core::convert::TryFrom;\nuse core::str::FromStr;\n\nuse derive_more::{AsRef, Deref, Display};\n\nuse crate::Error;\n\n#[derive(AsRef, Deref, Default, Debug, Copy, Clone, Display, PartialOrd)]\npub struct Float(f32);\n\nimpl Float {\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n #[must_use]\n pub fn new(float: f32) -> Self {\n if float.is_infinite() {\n panic!(\"float must be finite: `{}`\", float);\n }\n\n if float.is_nan() {\n panic!(\"float must not be `NaN`\");\n }\n\n Self(float)\n }\n\n \n \n \n \n \n \n \n \n #[must_use]\n pub const fn as_f32(self) -> f32 { self.0 }\n}\n\nimpl FromStr for Float {\n type Err = Error;\n\n fn from_str(input: &str) -> Result<Self, Self::Err> {\n let float = f32::from_str(input).map_err(|e| Error::parse_float(input, e))?;\n Self::try_from(float)\n }\n}\n\nimpl TryFrom<f32> for Float {\n type Error = Error;\n\n fn try_from(float: f32) -> Result<Self, Self::Error> {\n if float.is_infinite() {\n return Err(Error::custom(format!(\"float must be finite: `{}`\", float)));\n }\n\n if float.is_nan() {\n return Err(Error::custom(\"float must not be `NaN`\"));\n }\n\n Ok(Self(float))\n }\n}\n\nmacro_rules! implement_from {\n ( $( $type:tt ),+ ) => {\n $(\n impl ::core::convert::From<$type> for Float {\n fn from(value: $type) -> Self {\n Self(value as f32)\n }\n }\n )+\n }\n}\n\nimplement_from!(i16, u16, i8, u8);\n\nimpl PartialEq for Float {\n #[inline]\n fn eq(&self, other: &Self) -> bool { self.0 == other.0 }\n}\n\nimpl PartialEq<f32> for Float {\n #[inline]\n fn eq(&self, other: &f32) -> bool { &self.0 == other }\n}\n\nimpl Eq for Float {}\n\nimpl Ord for Float {\n #[inline]\n fn cmp(&self, other: &Self) -> Ordering {\n if self.0 < other.0 {\n Ordering::Less\n } else if self == other {\n Ordering::Equal\n } else {\n Ordering::Greater\n }\n }\n}\n\n#[doc(hidden)]\nimpl ::core::hash::Hash for Float {\n fn hash<H>(&self, state: &mut H)\n where\n H: ::core::hash::Hasher,\n {\n \n \n \n\n \n \n debug_assert!(self.0.is_finite());\n debug_assert!(!self.0.is_nan());\n\n \n \n \n \n \n \n\n if self.0 == 0.0 || self.0 == -0.0 {\n state.write(&0.0_f32.to_be_bytes());\n } else {\n \n \n state.write(&self.to_be_bytes())\n }\n }\n}\n\n#[cfg(test)]\nmod tests {\n use super::*;\n use core::hash::{Hash, Hasher};\n use pretty_assertions::assert_eq;\n\n #[test]\n fn test_ord() {\n assert_eq!(Float::new(1.1).cmp(&Float::new(1.1)), Ordering::Equal);\n assert_eq!(Float::new(1.1).cmp(&Float::new(2.1)), Ordering::Less);\n assert_eq!(Float::new(1.1).cmp(&Float::new(0.1)), Ordering::Greater);\n }\n\n #[test]\n fn test_partial_ord() {\n assert_eq!(\n Float::new(1.1).partial_cmp(&Float::new(1.1)),\n Some(Ordering::Equal)\n );\n assert_eq!(\n Float::new(1.1).partial_cmp(&Float::new(2.1)),\n Some(Ordering::Less)\n );\n assert_eq!(\n Float::new(1.1).partial_cmp(&Float::new(0.1)),\n Some(Ordering::Greater)\n );\n }\n\n #[test]\n fn test_hash() {\n let mut hasher_left = std::collections::hash_map::DefaultHasher::new();\n let mut hasher_right = std::collections::hash_map::DefaultHasher::new();\n\n assert_eq!(\n Float::new(0.0).hash(&mut hasher_left),\n Float::new(-0.0).hash(&mut hasher_right)\n );\n\n assert_eq!(hasher_left.finish(), hasher_right.finish());\n\n let mut hasher_left = std::collections::hash_map::DefaultHasher::new();\n let mut hasher_right = std::collections::hash_map::DefaultHasher::new();\n\n assert_eq!(\n Float::new(1.0).hash(&mut hasher_left),\n Float::new(1.0).hash(&mut hasher_right)\n );\n\n assert_eq!(hasher_left.finish(), hasher_right.finish());\n }\n\n #[test]\n fn test_eq() {\n struct _AssertEq\n where\n Float: Eq;\n }\n\n #[test]\n fn test_partial_eq() {\n assert_eq!(Float::new(1.0).eq(&Float::new(1.0)), true);\n assert_eq!(Float::new(1.0).eq(&Float::new(33.3)), false);\n assert_eq!(Float::new(1.1), 1.1);\n }\n\n #[test]\n fn test_display() {\n assert_eq!(Float::new(22.0).to_string(), \"22\".to_string());\n assert_eq!(\n Float::new(3.14159265359).to_string(),\n \"3.1415927\".to_string()\n );\n assert_eq!(\n Float::new(-3.14159265359).to_string(),\n \"-3.1415927\".to_string()\n );\n }\n\n #[test]\n fn test_parser() {\n assert_eq!(Float::new(22.0), Float::from_str(\"22\").unwrap());\n assert_eq!(Float::new(-22.0), Float::from_str(\"-22\").unwrap());\n assert_eq!(\n Float::new(3.14159265359),\n Float::from_str(\"3.14159265359\").unwrap()\n );\n assert!(Float::from_str(\"1#\").is_err());\n assert!(Float::from_str(\"NaN\").is_err());\n assert!(Float::from_str(\"inf\").is_err());\n assert!(Float::from_str(\"-inf\").is_err());\n }\n\n #[test]\n #[should_panic = \"float must be finite: `inf`\"]\n fn test_new_infinite() { let _ = Float::new(::core::f32::INFINITY); }\n\n #[test]\n #[should_panic = \"float must be finite: `-inf`\"]\n fn test_new_neg_infinite() { let _ = Float::new(::core::f32::NEG_INFINITY); }\n\n #[test]\n #[should_panic = \"float must not be `NaN`\"]\n fn test_new_nan() { let _ = Float::new(::core::f32::NAN); }\n\n #[test]\n fn test_as_f32() {\n assert_eq!(Float::new(1.1).as_f32(), 1.1_f32);\n }\n\n #[test]\n fn test_from() {\n assert_eq!(Float::from(-1_i8), Float::new(-1.0));\n assert_eq!(Float::from(1_u8), Float::new(1.0));\n assert_eq!(Float::from(-1_i16), Float::new(-1.0));\n assert_eq!(Float::from(1_u16), Float::new(1.0));\n }\n\n #[test]\n fn test_try_from() {\n assert_eq!(Float::try_from(1.1_f32).unwrap(), Float::new(1.1));\n assert_eq!(Float::try_from(-1.1_f32).unwrap(), Float::new(-1.1));\n\n assert!(Float::try_from(::core::f32::INFINITY).is_err());\n assert!(Float::try_from(::core::f32::NAN).is_err());\n assert!(Float::try_from(::core::f32::NEG_INFINITY).is_err());\n }\n}\n"},"prefix":{"kind":"string","value":"use core::cmp::Ordering;\nuse core::convert::TryFrom;\nuse core::str::FromStr;\n\nuse derive_more::{AsRef, Deref, Display};\n\nuse crate::Error;\n\n#[derive(AsRef, Deref, Default, Debug, Copy, Clone, Display, PartialOrd)]\npub struct Float(f32);\n\nimpl Float {\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n #[must_use]\n pub fn new(float: f32) -> Self {\n if float.is_infinite() {\n panic!(\"float must "},"suffix":{"kind":"string","value":"\n\n \n \n \n \n \n \n \n \n #[must_use]\n pub const fn as_f32(self) -> f32 { self.0 }\n}\n\nimpl FromStr for Float {\n type Err = Error;\n\n fn from_str(input: &str) -> Result<Self, Self::Err> {\n let float = f32::from_str(input).map_err(|e| Error::parse_float(input, e))?;\n Self::try_from(float)\n }\n}\n\nimpl TryFrom<f32> for Float {\n type Error = Error;\n\n fn try_from(float: f32) -> Result<Self, Self::Error> {\n if float.is_infinite() {\n return Err(Error::custom(format!(\"float must be finite: `{}`\", float)));\n }\n\n if float.is_nan() {\n return Err(Error::custom(\"float must not be `NaN`\"));\n }\n\n Ok(Self(float))\n }\n}\n\nmacro_rules! implement_from {\n ( $( $type:tt ),+ ) => {\n $(\n impl ::core::convert::From<$type> for Float {\n fn from(value: $type) -> Self {\n Self(value as f32)\n }\n }\n )+\n }\n}\n\nimplement_from!(i16, u16, i8, u8);\n\nimpl PartialEq for Float {\n #[inline]\n fn eq(&self, other: &Self) -> bool { self.0 == other.0 }\n}\n\nimpl PartialEq<f32> for Float {\n #[inline]\n fn eq(&self, other: &f32) -> bool { &self.0 == other }\n}\n\nimpl Eq for Float {}\n\nimpl Ord for Float {\n #[inline]\n fn cmp(&self, other: &Self) -> Ordering {\n if self.0 < other.0 {\n Ordering::Less\n } else if self == other {\n Ordering::Equal\n } else {\n Ordering::Greater\n }\n }\n}\n\n#[doc(hidden)]\nimpl ::core::hash::Hash for Float {\n fn hash<H>(&self, state: &mut H)\n where\n H: ::core::hash::Hasher,\n {\n \n \n \n\n \n \n debug_assert!(self.0.is_finite());\n debug_assert!(!self.0.is_nan());\n\n \n \n \n \n \n \n\n if self.0 == 0.0 || self.0 == -0.0 {\n state.write(&0.0_f32.to_be_bytes());\n } else {\n \n \n state.write(&self.to_be_bytes())\n }\n }\n}\n\n#[cfg(test)]\nmod tests {\n use super::*;\n use core::hash::{Hash, Hasher};\n use pretty_assertions::assert_eq;\n\n #[test]\n fn test_ord() {\n assert_eq!(Float::new(1.1).cmp(&Float::new(1.1)), Ordering::Equal);\n assert_eq!(Float::new(1.1).cmp(&Float::new(2.1)), Ordering::Less);\n assert_eq!(Float::new(1.1).cmp(&Float::new(0.1)), Ordering::Greater);\n }\n\n #[test]\n fn test_partial_ord() {\n assert_eq!(\n Float::new(1.1).partial_cmp(&Float::new(1.1)),\n Some(Ordering::Equal)\n );\n assert_eq!(\n Float::new(1.1).partial_cmp(&Float::new(2.1)),\n Some(Ordering::Less)\n );\n assert_eq!(\n Float::new(1.1).partial_cmp(&Float::new(0.1)),\n Some(Ordering::Greater)\n );\n }\n\n #[test]\n fn test_hash() {\n let mut hasher_left = std::collections::hash_map::DefaultHasher::new();\n let mut hasher_right = std::collections::hash_map::DefaultHasher::new();\n\n assert_eq!(\n Float::new(0.0).hash(&mut hasher_left),\n Float::new(-0.0).hash(&mut hasher_right)\n );\n\n assert_eq!(hasher_left.finish(), hasher_right.finish());\n\n let mut hasher_left = std::collections::hash_map::DefaultHasher::new();\n let mut hasher_right = std::collections::hash_map::DefaultHasher::new();\n\n assert_eq!(\n Float::new(1.0).hash(&mut hasher_left),\n Float::new(1.0).hash(&mut hasher_right)\n );\n\n assert_eq!(hasher_left.finish(), hasher_right.finish());\n }\n\n #[test]\n fn test_eq() {\n struct _AssertEq\n where\n Float: Eq;\n }\n\n #[test]\n fn test_partial_eq() {\n assert_eq!(Float::new(1.0).eq(&Float::new(1.0)), true);\n assert_eq!(Float::new(1.0).eq(&Float::new(33.3)), false);\n assert_eq!(Float::new(1.1), 1.1);\n }\n\n #[test]\n fn test_display() {\n assert_eq!(Float::new(22.0).to_string(), \"22\".to_string());\n assert_eq!(\n Float::new(3.14159265359).to_string(),\n \"3.1415927\".to_string()\n );\n assert_eq!(\n Float::new(-3.14159265359).to_string(),\n \"-3.1415927\".to_string()\n );\n }\n\n #[test]\n fn test_parser() {\n assert_eq!(Float::new(22.0), Float::from_str(\"22\").unwrap());\n assert_eq!(Float::new(-22.0), Float::from_str(\"-22\").unwrap());\n assert_eq!(\n Float::new(3.14159265359),\n Float::from_str(\"3.14159265359\").unwrap()\n );\n assert!(Float::from_str(\"1#\").is_err());\n assert!(Float::from_str(\"NaN\").is_err());\n assert!(Float::from_str(\"inf\").is_err());\n assert!(Float::from_str(\"-inf\").is_err());\n }\n\n #[test]\n #[should_panic = \"float must be finite: `inf`\"]\n fn test_new_infinite() { let _ = Float::new(::core::f32::INFINITY); }\n\n #[test]\n #[should_panic = \"float must be finite: `-inf`\"]\n fn test_new_neg_infinite() { let _ = Float::new(::core::f32::NEG_INFINITY); }\n\n #[test]\n #[should_panic = \"float must not be `NaN`\"]\n fn test_new_nan() { let _ = Float::new(::core::f32::NAN); }\n\n #[test]\n fn test_as_f32() {\n assert_eq!(Float::new(1.1).as_f32(), 1.1_f32);\n }\n\n #[test]\n fn test_from() {\n assert_eq!(Float::from(-1_i8), Float::new(-1.0));\n assert_eq!(Float::from(1_u8), Float::new(1.0));\n assert_eq!(Float::from(-1_i16), Float::new(-1.0));\n assert_eq!(Float::from(1_u16), Float::new(1.0));\n }\n\n #[test]\n fn test_try_from() {\n assert_eq!(Float::try_from(1.1_f32).unwrap(), Float::new(1.1));\n assert_eq!(Float::try_from(-1.1_f32).unwrap(), Float::new(-1.1));\n\n assert!(Float::try_from(::core::f32::INFINITY).is_err());\n assert!(Float::try_from(::core::f32::NAN).is_err());\n assert!(Float::try_from(::core::f32::NEG_INFINITY).is_err());\n }\n}\n"},"middle":{"kind":"string","value":"be finite: `{}`\", float);\n }\n\n if float.is_nan() {\n panic!(\"float must not be `NaN`\");\n }\n\n Self(float)\n }"},"strategy":{"kind":"string","value":"function_block-function_prefixed"},"context_items":{"kind":"list like","value":[{"content":" pub trait Sealed {}\n\n impl Sealed for crate::MediaSegment {}\n\n impl Sealed for crate::tags::ExtXMap {}\n\n}\n\n\n","file_path":"src/traits.rs","rank":0,"score":50488.99251107057},{"content":"#[doc(hidden)]\n\npub trait RequiredVersion {\n\n /// Returns the protocol compatibility version that this tag requires.\n\n ///\n\n /// # Note\n\n ///\n\n /// This is for the latest working [`ProtocolVersion`] and a client, that\n\n /// only supports an older version would break.\n\n #[must_use]\n\n fn required_version(&self) -> ProtocolVersion;\n\n\n\n /// The protocol version, in which the tag has been introduced.\n\n #[must_use]\n\n fn introduced_version(&self) -> ProtocolVersion { self.required_version() }\n\n}\n\n\n\nimpl<T: RequiredVersion> RequiredVersion for Vec<T> {\n\n fn required_version(&self) -> ProtocolVersion {\n\n self.iter()\n\n .map(RequiredVersion::required_version)\n\n .max()\n","file_path":"src/traits.rs","rank":1,"score":49307.42488630861},{"content":"fn parse_media_playlist(\n\n input: &str,\n\n builder: &mut MediaPlaylistBuilder,\n\n) -> crate::Result<MediaPlaylist> {\n\n let input = tag(input, \"#EXTM3U\")?;\n\n\n\n let mut segment = MediaSegment::builder();\n\n let mut segments = vec![];\n\n\n\n let mut has_partial_segment = false;\n\n let mut has_discontinuity_tag = false;\n\n let mut unknown = vec![];\n\n let mut available_keys = HashSet::new();\n\n\n\n for line in Lines::from(input) {\n\n match line? {\n\n Line::Tag(tag) => {\n\n match tag {\n\n Tag::ExtInf(t) => {\n\n has_partial_segment = true;\n","file_path":"src/media_playlist.rs","rank":2,"score":48180.54056224784},{"content":"#[test]\n\nfn test_readme_deps() {\n\n version_sync::assert_markdown_deps_updated!(\"README.md\");\n\n}\n\n\n","file_path":"tests/version-number.rs","rank":3,"score":48180.54056224784},{"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":"tests/version-number.rs","rank":4,"score":47126.19900364676},{"content":"/// Signals that a type or some of the asssociated data might need to be\n\n/// decrypted.\n\n///\n\n/// # Note\n\n///\n\n/// You are not supposed to implement this trait, therefore it is \"sealed\".\n\npub trait Decryptable: private::Sealed {\n\n /// Returns all keys, associated with the type.\n\n ///\n\n /// # Example\n\n ///\n\n /// ```\n\n /// use hls_m3u8::tags::ExtXMap;\n\n /// use hls_m3u8::types::{ByteRange, EncryptionMethod};\n\n /// use hls_m3u8::Decryptable;\n\n ///\n\n /// let map = ExtXMap::with_range(\"https://www.example.url/\", ByteRange::from(2..11));\n\n ///\n\n /// for key in map.keys() {\n\n /// if key.method == EncryptionMethod::Aes128 {\n\n /// // fetch content with the uri and decrypt the result\n\n /// break;\n\n /// }\n\n /// }\n\n /// ```\n\n #[must_use]\n","file_path":"src/traits.rs","rank":5,"score":46145.993885423406},{"content":"fn criterion_benchmark(c: &mut Criterion) {\n\n let buf = create_manifest_data();\n\n let mut group = c.benchmark_group(\"parser\");\n\n group.throughput(Throughput::Bytes(buf.len() as u64));\n\n group.bench_function(\"throughput\", |b| {\n\n b.iter(|| {\n\n let buf = String::from_utf8_lossy(&buf);\n\n hls_m3u8::MediaPlaylist::from_str(&buf).unwrap()\n\n });\n\n });\n\n}\n\n\n\ncriterion_group!(benches, criterion_benchmark);\n\ncriterion_main!(benches);\n","file_path":"benches/parse.rs","rank":6,"score":45109.32357371235},{"content":"fn create_manifest_data() -> Vec<u8> {\n\n let mut builder = MediaPlaylist::builder();\n\n builder.media_sequence(826176645);\n\n builder.has_independent_segments(true);\n\n builder.target_duration(std::time::Duration::from_secs(2));\n\n for i in 0..4000 {\n\n let mut seg = MediaSegment::builder();\n\n seg.duration(std::time::Duration::from_secs_f64(1.92))\n\n .uri(format!(\n\n \"avc_unencrypted_global-video=3000000-{}.ts?variant=italy\",\n\n 826176659 + i\n\n ));\n\n if i == 0 {\n\n seg.program_date_time(ExtXProgramDateTime::new(\"2020-04-07T11:32:38Z\"));\n\n }\n\n if i % 100 == 0 {\n\n let mut date_range =\n\n ExtXDateRange::new(format!(\"{}\", i / 100), \"2020-04-07T11:40:02.040000Z\");\n\n date_range.duration = Some(std::time::Duration::from_secs_f64(65.2));\n\n date_range.client_attributes.insert(\"SCTE35-OUT\".to_string(), Value::Hex(hex::decode(\"FC302500000000000000FFF0140500001C207FEFFE0030E3A0FE005989E000010000000070BA5ABF\").unwrap()));\n\n seg.date_range(date_range);\n\n }\n\n builder.push_segment(seg.build().unwrap());\n\n }\n\n builder.build().unwrap().to_string().into_bytes()\n\n}\n\n\n","file_path":"benches/parse.rs","rank":7,"score":44828.689777487685},{"content":"use core::cmp::Ordering;\n\nuse core::convert::TryFrom;\n\nuse core::str::FromStr;\n\n\n\nuse derive_more::{AsRef, Deref, Display};\n\n\n\nuse crate::Error;\n\n\n\n/// A wrapper type around an [`f32`], that can not be constructed\n\n/// with a negative float (e.g. `-1.1`), [`NaN`], [`INFINITY`] or\n\n/// [`NEG_INFINITY`].\n\n///\n\n/// [`NaN`]: core::f32::NAN\n\n/// [`INFINITY`]: core::f32::INFINITY\n\n/// [`NEG_INFINITY`]: core::f32::NEG_INFINITY\n\n#[derive(AsRef, Deref, Default, Debug, Copy, Clone, PartialOrd, Display)]\n\npub struct UFloat(f32);\n\n\n\nimpl UFloat {\n\n /// Makes a new [`UFloat`] from an [`f32`].\n","file_path":"src/types/ufloat.rs","rank":24,"score":42.69257949525109},{"content":" ///\n\n /// ```\n\n /// # use hls_m3u8::types::UFloat;\n\n /// assert_eq!(UFloat::new(1.1_f32).as_f32(), 1.1_f32);\n\n /// ```\n\n #[must_use]\n\n pub const fn as_f32(self) -> f32 { self.0 }\n\n}\n\n\n\nimpl FromStr for UFloat {\n\n type Err = Error;\n\n\n\n fn from_str(input: &str) -> Result<Self, Self::Err> {\n\n let float = f32::from_str(input).map_err(|e| Error::parse_float(input, e))?;\n\n Self::try_from(float)\n\n }\n\n}\n\n\n\nimpl TryFrom<f32> for UFloat {\n\n type Error = Error;\n","file_path":"src/types/ufloat.rs","rank":25,"score":31.81417513726809},{"content":" #[must_use]\n\n pub fn new(float: f32) -> Self {\n\n if float.is_infinite() {\n\n panic!(\"float must be finite: `{}`\", float);\n\n }\n\n\n\n if float.is_nan() {\n\n panic!(\"float must not be `NaN`\");\n\n }\n\n\n\n if float.is_sign_negative() {\n\n panic!(\"float must be positive: `{}`\", float);\n\n }\n\n\n\n Self(float)\n\n }\n\n\n\n /// Returns the underlying [`f32`].\n\n ///\n\n /// # Example\n","file_path":"src/types/ufloat.rs","rank":26,"score":28.179624763631633},{"content":"use std::str::FromStr;\n\n\n\nuse derive_more::Display;\n\nuse shorthand::ShortHand;\n\n\n\nuse crate::Error;\n\n\n\n/// The number of distinct pixels in each dimension that can be displayed (e.g.\n\n/// 1920x1080).\n\n///\n\n/// For example Full HD has a resolution of 1920x1080.\n\n#[derive(ShortHand, Ord, PartialOrd, Debug, Clone, Copy, PartialEq, Eq, Hash, Display)]\n\n#[display(fmt = \"{}x{}\", width, height)]\n\n#[shorthand(enable(must_use))]\n\npub struct Resolution {\n\n /// Horizontal pixel dimension.\n\n ///\n\n /// # Example\n\n ///\n\n /// ```\n","file_path":"src/types/resolution.rs","rank":27,"score":27.24695523367891},{"content":"use std::fmt;\n\nuse std::str::FromStr;\n\n\n\nuse crate::types::Float;\n\nuse crate::utils::{quote, unquote};\n\nuse crate::Error;\n\n\n\n/// A `Value`.\n\n#[non_exhaustive]\n\n#[derive(Debug, Clone, PartialEq, PartialOrd, Eq, Ord, Hash)]\n\npub enum Value {\n\n /// A `String`.\n\n String(String),\n\n /// A sequence of bytes.\n\n Hex(Vec<u8>),\n\n /// A floating point number, that's neither NaN nor infinite.\n\n Float(Float),\n\n}\n\n\n\nimpl fmt::Display for Value {\n","file_path":"src/types/value.rs","rank":28,"score":27.188899977666896},{"content":"use std::fmt;\n\nuse std::str::FromStr;\n\n\n\nuse crate::types::ProtocolVersion;\n\nuse crate::utils::tag;\n\nuse crate::{Error, RequiredVersion};\n\n\n\n#[derive(Debug, Clone, Copy, PartialEq, Eq, Hash, PartialOrd, Ord)]\n\npub(crate) struct ExtXIFramesOnly;\n\n\n\nimpl ExtXIFramesOnly {\n\n pub(crate) const PREFIX: &'static str = \"#EXT-X-I-FRAMES-ONLY\";\n\n}\n\n\n\n/// This tag requires [`ProtocolVersion::V4`].\n\nimpl RequiredVersion for ExtXIFramesOnly {\n\n fn required_version(&self) -> ProtocolVersion { ProtocolVersion::V4 }\n\n}\n\n\n\nimpl fmt::Display for ExtXIFramesOnly {\n","file_path":"src/tags/media_playlist/i_frames_only.rs","rank":29,"score":25.949537159773286},{"content":"use std::fmt;\n\nuse std::str::FromStr;\n\n\n\nuse crate::types::ProtocolVersion;\n\nuse crate::utils::tag;\n\nuse crate::{Error, RequiredVersion};\n\n\n\n/// Allows synchronization between different renditions of the same\n\n/// [`VariantStream`].\n\n///\n\n/// [`VariantStream`]: crate::tags::VariantStream\n\n#[derive(Default, Debug, Clone, Copy, PartialEq, Eq, Ord, PartialOrd, Hash)]\n\npub(crate) struct ExtXDiscontinuitySequence(pub usize);\n\n\n\nimpl ExtXDiscontinuitySequence {\n\n pub(crate) const PREFIX: &'static str = \"#EXT-X-DISCONTINUITY-SEQUENCE:\";\n\n}\n\n\n\n/// This tag requires [`ProtocolVersion::V1`].\n\nimpl RequiredVersion for ExtXDiscontinuitySequence {\n","file_path":"src/tags/media_playlist/discontinuity_sequence.rs","rank":30,"score":25.389503006257097},{"content":"/// ```\n\n///\n\n/// [RFC6381]: https://tools.ietf.org/html/rfc6381\n\n/// [`VariantStream`]: crate::tags::VariantStream\n\n#[derive(\n\n AsMut, AsRef, Deref, DerefMut, Debug, Clone, PartialEq, Eq, PartialOrd, Ord, Hash, Default,\n\n)]\n\npub struct Codecs {\n\n list: Vec<String>,\n\n}\n\n\n\nimpl Codecs {\n\n /// Makes a new (empty) [`Codecs`] struct.\n\n ///\n\n /// # Example\n\n ///\n\n /// ```\n\n /// # use hls_m3u8::types::Codecs;\n\n /// let codecs = Codecs::new();\n\n /// ```\n","file_path":"src/types/codecs.rs","rank":31,"score":25.36437241838329},{"content":"impl<'a> From<&'a str> for Lines<'a> {\n\n fn from(buffer: &'a str) -> Self {\n\n Self {\n\n lines: buffer\n\n .lines()\n\n .filter_map(|line| Some(line.trim()).filter(|v| !v.is_empty())),\n\n }\n\n }\n\n}\n\n\n\n#[derive(Debug, Clone, PartialEq)]\n\npub(crate) enum Line<'a> {\n\n Tag(Tag<'a>),\n\n Comment(&'a str),\n\n Uri(&'a str),\n\n}\n\n\n\n#[allow(clippy::large_enum_variant)]\n\n#[derive(Debug, Clone, PartialEq, Display)]\n\n#[display(fmt = \"{}\")]\n","file_path":"src/line.rs","rank":32,"score":25.348895471999455},{"content":"use std::fmt;\n\nuse std::str::FromStr;\n\nuse std::time::Duration;\n\n\n\nuse crate::types::ProtocolVersion;\n\nuse crate::utils::tag;\n\nuse crate::{Error, RequiredVersion};\n\n\n\n/// Specifies the maximum `MediaSegment` duration.\n\n#[derive(Debug, Clone, Copy, PartialEq, Eq, Hash, Default, PartialOrd, Ord)]\n\npub(crate) struct ExtXTargetDuration(pub Duration);\n\n\n\nimpl ExtXTargetDuration {\n\n pub(crate) const PREFIX: &'static str = \"#EXT-X-TARGETDURATION:\";\n\n}\n\n\n\n/// This tag requires [`ProtocolVersion::V1`].\n\nimpl RequiredVersion for ExtXTargetDuration {\n\n fn required_version(&self) -> ProtocolVersion { ProtocolVersion::V1 }\n\n}\n","file_path":"src/tags/media_playlist/target_duration.rs","rank":33,"score":25.27023317522603},{"content":"use core::convert::TryFrom;\n\nuse core::iter::FusedIterator;\n\nuse core::str::FromStr;\n\n\n\nuse derive_more::Display;\n\n\n\nuse crate::tags;\n\nuse crate::types::PlaylistType;\n\nuse crate::Error;\n\n\n\n#[derive(Debug, Clone)]\n\npub(crate) struct Lines<'a> {\n\n lines: ::core::iter::FilterMap<::core::str::Lines<'a>, fn(&'a str) -> Option<&'a str>>,\n\n}\n\n\n\nimpl<'a> Iterator for Lines<'a> {\n\n type Item = crate::Result<Line<'a>>;\n\n\n\n fn next(&mut self) -> Option<Self::Item> {\n\n let line = self.lines.next()?;\n","file_path":"src/line.rs","rank":34,"score":25.019156919276146},{"content":"use std::fmt;\n\nuse std::str::FromStr;\n\n\n\nuse crate::types::ProtocolVersion;\n\nuse crate::utils::tag;\n\nuse crate::{Error, RequiredVersion};\n\n\n\n/// Indicates the Media Sequence Number of the first `MediaSegment` that\n\n/// appears in a `MediaPlaylist`.\n\n#[derive(Default, Debug, Clone, Copy, PartialEq, Eq, PartialOrd, Ord, Hash)]\n\npub(crate) struct ExtXMediaSequence(pub usize);\n\n\n\nimpl ExtXMediaSequence {\n\n pub(crate) const PREFIX: &'static str = \"#EXT-X-MEDIA-SEQUENCE:\";\n\n}\n\n\n\n/// This tag requires [`ProtocolVersion::V1`].\n\nimpl RequiredVersion for ExtXMediaSequence {\n\n fn required_version(&self) -> ProtocolVersion { ProtocolVersion::V1 }\n\n}\n","file_path":"src/tags/media_playlist/media_sequence.rs","rank":35,"score":24.930072859628137},{"content":"use core::fmt;\n\nuse core::str::FromStr;\n\n\n\nuse shorthand::ShortHand;\n\n\n\nuse crate::Error;\n\n\n\n/// The maximum number of independent, simultaneous audio channels present in\n\n/// any [`MediaSegment`] in the rendition.\n\n///\n\n/// For example, an `AC-3 5.1` rendition would have a maximum channel number of\n\n/// 6.\n\n///\n\n/// [`MediaSegment`]: crate::MediaSegment\n\n#[derive(ShortHand, Debug, Clone, Copy, Default, Eq, PartialEq, Ord, PartialOrd, Hash)]\n\n#[shorthand(enable(must_use))]\n\npub struct Channels {\n\n /// The maximum number of independent simultaneous audio channels.\n\n ///\n\n /// # Example\n","file_path":"src/types/channels.rs","rank":36,"score":24.487101008396763},{"content":"use core::iter::FusedIterator;\n\n\n\n#[derive(Clone, Debug)]\n\npub(crate) struct AttributePairs<'a> {\n\n string: &'a str,\n\n index: usize,\n\n}\n\n\n\nimpl<'a> AttributePairs<'a> {\n\n pub const fn new(string: &'a str) -> Self { Self { string, index: 0 } }\n\n}\n\n\n\nimpl<'a> Iterator for AttributePairs<'a> {\n\n type Item = (&'a str, &'a str);\n\n\n\n fn next(&mut self) -> Option<Self::Item> {\n\n // return `None`, if there are no more bytes\n\n self.string.as_bytes().get(self.index + 1)?;\n\n\n\n let key = {\n","file_path":"src/attribute.rs","rank":37,"score":24.337876103253027},{"content":"impl ProtocolVersion {\n\n /// Returns the latest [`ProtocolVersion`] that is supported by\n\n /// this library.\n\n ///\n\n /// # Example\n\n ///\n\n /// ```\n\n /// # use hls_m3u8::types::ProtocolVersion;\n\n /// assert_eq!(ProtocolVersion::latest(), ProtocolVersion::V7);\n\n /// ```\n\n #[must_use]\n\n #[inline]\n\n pub const fn latest() -> Self { Self::V7 }\n\n}\n\n\n\nimpl fmt::Display for ProtocolVersion {\n\n fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {\n\n match &self {\n\n Self::V1 => write!(f, \"1\"),\n\n Self::V2 => write!(f, \"2\"),\n","file_path":"src/types/protocol_version.rs","rank":38,"score":24.18152142323749},{"content":" #[inline]\n\n #[must_use]\n\n pub const fn new() -> Self { Self { list: Vec::new() } }\n\n}\n\n\n\nimpl fmt::Display for Codecs {\n\n fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {\n\n if let Some(codec) = self.list.iter().next() {\n\n write!(f, \"{}\", codec)?;\n\n\n\n for codec in self.list.iter().skip(1) {\n\n write!(f, \",{}\", codec)?;\n\n }\n\n }\n\n\n\n Ok(())\n\n }\n\n}\n\nimpl FromStr for Codecs {\n\n type Err = Error;\n","file_path":"src/types/codecs.rs","rank":39,"score":23.78673821872449},{"content":" /// # use hls_m3u8::tags::ExtXStart;\n\n /// use hls_m3u8::types::Float;\n\n ///\n\n /// let start = ExtXStart::with_precise(Float::new(20.123456), true);\n\n /// assert_eq!(start.is_precise(), true);\n\n /// ```\n\n #[must_use]\n\n pub const fn with_precise(time_offset: Float, is_precise: bool) -> Self {\n\n Self {\n\n time_offset,\n\n is_precise,\n\n }\n\n }\n\n}\n\n\n\n/// This tag requires [`ProtocolVersion::V1`].\n\nimpl RequiredVersion for ExtXStart {\n\n fn required_version(&self) -> ProtocolVersion { ProtocolVersion::V1 }\n\n}\n\n\n","file_path":"src/tags/shared/start.rs","rank":40,"score":23.72217037065027},{"content":"use std::fmt;\n\nuse std::str::FromStr;\n\n\n\nuse shorthand::ShortHand;\n\n\n\nuse crate::attribute::AttributePairs;\n\nuse crate::types::{Float, ProtocolVersion};\n\nuse crate::utils::{parse_yes_or_no, tag};\n\nuse crate::{Error, RequiredVersion};\n\n\n\n/// This tag indicates a preferred point at which to start\n\n/// playing a Playlist.\n\n///\n\n/// By default, clients should start playback at this point when beginning a\n\n/// playback session.\n\n#[derive(ShortHand, PartialOrd, Debug, Clone, Copy, PartialEq, Eq, Ord, Hash)]\n\n#[shorthand(enable(must_use))]\n\npub struct ExtXStart {\n\n /// The time offset of the [`MediaSegment`]s in the playlist.\n\n ///\n","file_path":"src/tags/shared/start.rs","rank":41,"score":23.646842095785253},{"content":" ///\n\n /// assert_eq!(InitializationVector::Number(4).is_none(), false);\n\n ///\n\n /// assert_eq!(InitializationVector::Missing.is_none(), true);\n\n /// ```\n\n #[must_use]\n\n #[inline]\n\n pub fn is_none(&self) -> bool { *self == Self::Missing }\n\n}\n\n\n\nimpl Default for InitializationVector {\n\n fn default() -> Self { Self::Missing }\n\n}\n\n\n\nimpl From<[u8; 0x10]> for InitializationVector {\n\n fn from(value: [u8; 0x10]) -> Self { Self::Aes128(value) }\n\n}\n\n\n\nimpl From<Option<[u8; 0x10]>> for InitializationVector {\n\n fn from(value: Option<[u8; 0x10]>) -> Self {\n","file_path":"src/types/initialization_vector.rs","rank":42,"score":23.626986753814126},{"content":" ///\n\n /// println!(\"CHANNELS=\\\"{}\\\"\", channels);\n\n /// # assert_eq!(format!(\"CHANNELS=\\\"{}\\\"\", channels), \"CHANNELS=\\\"6\\\"\".to_string());\n\n /// ```\n\n //#[inline]\n\n #[must_use]\n\n pub const fn new(number: u64) -> Self { Self { number } }\n\n}\n\n\n\nimpl FromStr for Channels {\n\n type Err = Error;\n\n\n\n fn from_str(input: &str) -> Result<Self, Self::Err> {\n\n Ok(Self::new(\n\n input.parse().map_err(|e| Error::parse_int(input, e))?,\n\n ))\n\n }\n\n}\n\n\n\nimpl fmt::Display for Channels {\n","file_path":"src/types/channels.rs","rank":43,"score":23.61664248743736},{"content":"use std::fmt;\n\nuse std::str::FromStr;\n\n\n\nuse crate::types::ProtocolVersion;\n\nuse crate::utils::tag;\n\nuse crate::{Error, RequiredVersion};\n\n\n\n/// The [`ExtM3u`] tag indicates that the file is an **Ext**ended **[`M3U`]**\n\n/// Playlist file.\n\n/// It is the at the start of every [`MediaPlaylist`] and [`MasterPlaylist`].\n\n///\n\n/// [`MediaPlaylist`]: crate::MediaPlaylist\n\n/// [`MasterPlaylist`]: crate::MasterPlaylist\n\n/// [`M3U`]: https://en.wikipedia.org/wiki/M3U\n\n#[derive(Copy, Clone, Eq, PartialEq, Ord, PartialOrd, Hash, Debug, Default)]\n\npub(crate) struct ExtM3u;\n\n\n\nimpl ExtM3u {\n\n pub(crate) const PREFIX: &'static str = \"#EXTM3U\";\n\n}\n","file_path":"src/tags/basic/m3u.rs","rank":44,"score":23.508147000004918},{"content":" /// assert_eq!(versions.is_default(), true);\n\n ///\n\n /// versions.push(1);\n\n /// assert_eq!(versions.is_default(), true);\n\n ///\n\n /// assert_eq!(KeyFormatVersions::default().is_default(), true);\n\n /// ```\n\n #[must_use]\n\n pub fn is_default(&self) -> bool {\n\n self.is_empty() || (self.buffer[self.len().saturating_sub(1)] == 1 && self.len() == 1)\n\n }\n\n}\n\n\n\nimpl PartialEq for KeyFormatVersions {\n\n fn eq(&self, other: &Self) -> bool {\n\n if self.len() == other.len() {\n\n // only compare the parts in the buffer, that are used:\n\n self.as_ref() == self.as_ref()\n\n } else {\n\n false\n","file_path":"src/types/key_format_versions.rs","rank":45,"score":23.25320021365313},{"content":"use strum::{Display, EnumString};\n\n\n\n/// Specifies the media type.\n\n#[non_exhaustive]\n\n#[allow(missing_docs)]\n\n#[derive(Ord, PartialOrd, Display, EnumString, Debug, Clone, Copy, PartialEq, Eq, Hash)]\n\n#[strum(serialize_all = \"SCREAMING-KEBAB-CASE\")]\n\npub enum MediaType {\n\n Audio,\n\n Video,\n\n Subtitles,\n\n ClosedCaptions,\n\n}\n\n\n\n#[cfg(test)]\n\nmod tests {\n\n use super::*;\n\n use pretty_assertions::assert_eq;\n\n\n\n #[test]\n","file_path":"src/types/media_type.rs","rank":46,"score":22.9500370181858},{"content":"use std::fmt;\n\nuse std::str::FromStr;\n\n\n\nuse derive_builder::Builder;\n\nuse shorthand::ShortHand;\n\n\n\nuse crate::attribute::AttributePairs;\n\nuse crate::types::{\n\n EncryptionMethod, InitializationVector, KeyFormat, KeyFormatVersions, ProtocolVersion,\n\n};\n\nuse crate::utils::{quote, unquote};\n\nuse crate::{Error, RequiredVersion};\n\n\n\n/// Specifies how to decrypt encrypted data from the server.\n\n#[derive(ShortHand, Builder, Debug, Clone, PartialEq, Eq, Hash, PartialOrd, Ord)]\n\n#[builder(setter(into), build_fn(validate = \"Self::validate\"))]\n\n#[shorthand(enable(skip, must_use, into))]\n\n#[non_exhaustive]\n\npub struct DecryptionKey {\n\n /// The encryption method, which has been used to encrypt the data.\n","file_path":"src/types/decryption_key.rs","rank":47,"score":22.781206921235697},{"content":"/// - `DerefMut<Target=DateTime<FixedOffset>>`\n\n/// - and `Copy`\n\n///\n\n/// will be derived.\n\n///\n\n/// [`MediaSegment`]: crate::MediaSegment\n\n#[derive(Debug, Clone, PartialEq, Eq, Hash, PartialOrd, Ord)]\n\n#[cfg_attr(feature = \"chrono\", derive(Deref, DerefMut, Copy))]\n\n#[non_exhaustive]\n\npub struct ExtXProgramDateTime {\n\n /// The date-time of the first sample of the associated media segment.\n\n #[cfg(feature = \"chrono\")]\n\n #[cfg_attr(feature = \"chrono\", deref_mut, deref)]\n\n pub date_time: DateTime<FixedOffset>,\n\n /// The date-time of the first sample of the associated media segment.\n\n #[cfg(not(feature = \"chrono\"))]\n\n pub date_time: String,\n\n}\n\n\n\nimpl ExtXProgramDateTime {\n","file_path":"src/tags/media_segment/program_date_time.rs","rank":48,"score":22.183082656655014},{"content":"use std::fmt;\n\nuse std::str::FromStr;\n\n\n\nuse crate::types::ProtocolVersion;\n\nuse crate::utils::tag;\n\nuse crate::{Error, RequiredVersion};\n\n\n\n/// The `ExtXDiscontinuity` tag indicates a discontinuity between the\n\n/// `MediaSegment` that follows it and the one that preceded it.\n\n#[derive(Debug, Clone, Copy, PartialEq, Eq, Hash, PartialOrd, Ord)]\n\npub(crate) struct ExtXDiscontinuity;\n\n\n\nimpl ExtXDiscontinuity {\n\n pub(crate) const PREFIX: &'static str = \"#EXT-X-DISCONTINUITY\";\n\n}\n\n\n\n/// This tag requires [`ProtocolVersion::V1`].\n\nimpl RequiredVersion for ExtXDiscontinuity {\n\n fn required_version(&self) -> ProtocolVersion { ProtocolVersion::V1 }\n\n}\n","file_path":"src/tags/media_segment/discontinuity.rs","rank":49,"score":21.93222035636412},{"content":"use std::fmt;\n\nuse std::str::FromStr;\n\n\n\nuse crate::types::ProtocolVersion;\n\nuse crate::utils::tag;\n\nuse crate::{Error, RequiredVersion};\n\n\n\n/// Signals that all media samples in a [`MediaSegment`] can be decoded without\n\n/// information from other segments.\n\n///\n\n/// [`MediaSegment`]: crate::MediaSegment\n\n#[derive(Debug, Clone, Copy, PartialEq, Eq, Hash, Ord, PartialOrd)]\n\npub(crate) struct ExtXIndependentSegments;\n\n\n\nimpl ExtXIndependentSegments {\n\n pub(crate) const PREFIX: &'static str = \"#EXT-X-INDEPENDENT-SEGMENTS\";\n\n}\n\n\n\n/// This tag requires [`ProtocolVersion::V1`].\n\nimpl RequiredVersion for ExtXIndependentSegments {\n","file_path":"src/tags/shared/independent_segments.rs","rank":50,"score":21.85122168677229},{"content":"/// let range = ByteRange::from(..20);\n\n/// ```\n\n#[derive(ShortHand, Copy, Hash, Eq, Ord, Debug, PartialEq, Clone, PartialOrd)]\n\n#[shorthand(enable(must_use, copy), disable(option_as_ref, set))]\n\npub struct ByteRange {\n\n /// Returns the `start` of the [`ByteRange`], if there is one.\n\n ///\n\n /// # Example\n\n ///\n\n /// ```\n\n /// # use hls_m3u8::types::ByteRange;\n\n /// assert_eq!(ByteRange::from(0..5).start(), Some(0));\n\n /// assert_eq!(ByteRange::from(..5).start(), None);\n\n /// ```\n\n start: Option<usize>,\n\n /// Returns the `end` of the [`ByteRange`].\n\n ///\n\n /// # Example\n\n ///\n\n /// ```\n","file_path":"src/types/byte_range.rs","rank":51,"score":21.82524826489018},{"content":" ///\n\n /// ```\n\n /// # use hls_m3u8::tags::ExtXStart;\n\n /// use hls_m3u8::types::Float;\n\n ///\n\n /// let start = ExtXStart::new(Float::new(20.123456));\n\n /// ```\n\n #[must_use]\n\n pub const fn new(time_offset: Float) -> Self {\n\n Self {\n\n time_offset,\n\n is_precise: false,\n\n }\n\n }\n\n\n\n /// Makes a new [`ExtXStart`] tag with the given `precise` flag.\n\n ///\n\n /// # Example\n\n ///\n\n /// ```\n","file_path":"src/tags/shared/start.rs","rank":52,"score":21.713209827113776},{"content":"\n\nimpl Resolution {\n\n /// Constructs a new [`Resolution`].\n\n ///\n\n /// # Example\n\n ///\n\n /// ```\n\n /// # use hls_m3u8::types::Resolution;\n\n /// let resolution = Resolution::new(1920, 1080);\n\n /// ```\n\n #[must_use]\n\n pub const fn new(width: usize, height: usize) -> Self { Self { width, height } }\n\n}\n\n\n\nimpl From<(usize, usize)> for Resolution {\n\n fn from(value: (usize, usize)) -> Self { Self::new(value.0, value.1) }\n\n}\n\n\n\nimpl Into<(usize, usize)> for Resolution {\n\n fn into(self) -> (usize, usize) { (self.width, self.height) }\n","file_path":"src/types/resolution.rs","rank":53,"score":21.503284471001106},{"content":"/// assert_eq!(ExtXByteRange::from(22..55), ExtXByteRange::from(22..=54));\n\n/// ```\n\n///\n\n/// It is also possible to omit the start, in which case it assumes that the\n\n/// [`ExtXByteRange`] starts at the byte after the end of the previous\n\n/// [`ExtXByteRange`] or 0 if there is no previous one.\n\n///\n\n/// ```\n\n/// # use hls_m3u8::tags::ExtXByteRange;\n\n/// assert_eq!(ExtXByteRange::from(..55), ExtXByteRange::from(..=54));\n\n/// ```\n\n///\n\n/// [`MediaSegment`]: crate::MediaSegment\n\n#[derive(\n\n AsRef, AsMut, From, Deref, DerefMut, Debug, Clone, Copy, PartialEq, Eq, Hash, PartialOrd, Ord,\n\n)]\n\n#[from(forward)]\n\npub struct ExtXByteRange(ByteRange);\n\n\n\nimpl ExtXByteRange {\n","file_path":"src/tags/media_segment/byte_range.rs","rank":54,"score":21.493882975605832},{"content":" /// ```\n\n /// # use hls_m3u8::types::ByteRange;\n\n /// let range = ByteRange::from(12..12);\n\n ///\n\n /// assert_eq!(range.is_empty(), true);\n\n /// ```\n\n #[inline]\n\n #[must_use]\n\n pub fn is_empty(&self) -> bool { self.len() == 0 }\n\n}\n\n\n\nimpl Sub<usize> for ByteRange {\n\n type Output = Self;\n\n\n\n #[must_use]\n\n #[inline]\n\n fn sub(self, rhs: usize) -> Self::Output {\n\n Self {\n\n start: self.start.map(|lhs| lhs - rhs),\n\n end: self.end - rhs,\n","file_path":"src/types/byte_range.rs","rank":55,"score":21.409203334955965},{"content":"use std::fmt;\n\nuse std::str::FromStr;\n\n\n\nuse crate::types::ProtocolVersion;\n\nuse crate::utils::tag;\n\nuse crate::{Error, RequiredVersion};\n\n\n\n/// Indicates that no more [`MediaSegment`]s will be added to the\n\n/// [`MediaPlaylist`] file.\n\n///\n\n/// [`MediaSegment`]: crate::MediaSegment\n\n/// [`MediaPlaylist`]: crate::MediaPlaylist\n\n#[derive(Debug, Clone, Copy, PartialEq, Eq, Hash, PartialOrd, Ord)]\n\npub(crate) struct ExtXEndList;\n\n\n\nimpl ExtXEndList {\n\n pub(crate) const PREFIX: &'static str = \"#EXT-X-ENDLIST\";\n\n}\n\n\n\n/// This tag requires [`ProtocolVersion::V1`].\n","file_path":"src/tags/media_playlist/end_list.rs","rank":56,"score":21.215198829336213},{"content":"\n\n#[doc(hidden)]\n\nimpl From<::strum::ParseError> for Error {\n\n fn from(value: ::strum::ParseError) -> Self { Self::strum(value) }\n\n}\n\n\n\n#[cfg(test)]\n\nmod tests {\n\n use super::*;\n\n use pretty_assertions::assert_eq;\n\n\n\n #[test]\n\n fn test_parse_float_error() {\n\n assert_eq!(\n\n Error::parse_float(\n\n \"1.x234\",\n\n \"1.x234\"\n\n .parse::<f32>()\n\n .expect_err(\"this should not parse as a float!\")\n\n )\n","file_path":"src/error.rs","rank":57,"score":21.191734878492905},{"content":"use std::fmt;\n\nuse std::str::FromStr;\n\n\n\nuse crate::types::ProtocolVersion;\n\nuse crate::utils::tag;\n\nuse crate::{Error, RequiredVersion};\n\n\n\n/// The compatibility version of a playlist.\n\n///\n\n/// It applies to the entire [`MasterPlaylist`] or [`MediaPlaylist`].\n\n///\n\n/// [`MediaPlaylist`]: crate::MediaPlaylist\n\n/// [`MasterPlaylist`]: crate::MasterPlaylist\n\n#[derive(Copy, Clone, Eq, PartialEq, Ord, PartialOrd, Hash, Debug)]\n\npub struct ExtXVersion(ProtocolVersion);\n\n\n\nimpl ExtXVersion {\n\n pub(crate) const PREFIX: &'static str = \"#EXT-X-VERSION:\";\n\n\n\n /// Makes a new [`ExtXVersion`] tag.\n","file_path":"src/tags/basic/version.rs","rank":58,"score":21.130124313242895},{"content":" /// assert_eq!(\n\n /// ExtXVersion::new(ProtocolVersion::V6).version(),\n\n /// ProtocolVersion::V6\n\n /// );\n\n /// ```\n\n #[must_use]\n\n pub const fn version(self) -> ProtocolVersion { self.0 }\n\n}\n\n\n\n/// This tag requires [`ProtocolVersion::V1`].\n\nimpl RequiredVersion for ExtXVersion {\n\n fn required_version(&self) -> ProtocolVersion { ProtocolVersion::V1 }\n\n}\n\n\n\nimpl fmt::Display for ExtXVersion {\n\n fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {\n\n //\n\n write!(f, \"{}{}\", Self::PREFIX, self.0)\n\n }\n\n}\n","file_path":"src/tags/basic/version.rs","rank":59,"score":21.12424739330324},{"content":" \"6\" => Self::V6,\n\n \"7\" => Self::V7,\n\n _ => return Err(Error::unknown_protocol_version(input)),\n\n }\n\n })\n\n }\n\n}\n\n\n\n/// The default is [`ProtocolVersion::V1`].\n\nimpl Default for ProtocolVersion {\n\n fn default() -> Self { Self::V1 }\n\n}\n\n\n\n#[cfg(test)]\n\nmod tests {\n\n use super::*;\n\n use pretty_assertions::assert_eq;\n\n\n\n #[test]\n\n fn test_display() {\n","file_path":"src/types/protocol_version.rs","rank":60,"score":21.066531217195735},{"content":"impl ExtInf {\n\n pub(crate) const PREFIX: &'static str = \"#EXTINF:\";\n\n\n\n /// Makes a new [`ExtInf`] tag.\n\n ///\n\n /// # Example\n\n ///\n\n /// ```\n\n /// # use hls_m3u8::tags::ExtInf;\n\n /// use std::time::Duration;\n\n ///\n\n /// let ext_inf = ExtInf::new(Duration::from_secs(5));\n\n /// ```\n\n #[must_use]\n\n pub const fn new(duration: Duration) -> Self {\n\n Self {\n\n duration,\n\n title: None,\n\n }\n\n }\n","file_path":"src/tags/media_segment/inf.rs","rank":61,"score":20.933254079161244},{"content":"use strum::{Display, EnumString};\n\n\n\n/// The encryption method.\n\n#[non_exhaustive]\n\n#[allow(missing_docs)]\n\n#[derive(Ord, PartialOrd, Debug, Clone, Copy, PartialEq, Eq, Hash, Display, EnumString)]\n\n#[strum(serialize_all = \"SCREAMING-KEBAB-CASE\")]\n\npub enum EncryptionMethod {\n\n /// The [`MediaSegment`]s are completely encrypted using the Advanced\n\n /// Encryption Standard ([AES-128]) with a 128-bit key, Cipher Block\n\n /// Chaining (CBC), and [Public-Key Cryptography Standards #7 (PKCS7)]\n\n /// padding.\n\n ///\n\n /// CBC is restarted on each segment boundary, using either the\n\n /// Initialization Vector (IV) or the Media Sequence Number as the IV\n\n ///\n\n /// ```\n\n /// # let media_sequence_number = 5;\n\n /// # assert_eq!(\n\n /// format!(\"0x{:032x}\", media_sequence_number)\n","file_path":"src/types/encryption_method.rs","rank":62,"score":20.43443568472104},{"content":" /// ```\n\n #[must_use]\n\n pub fn builder() -> ExtXMediaBuilder { ExtXMediaBuilder::default() }\n\n}\n\n\n\n/// This tag requires either `ProtocolVersion::V1` or if there is an\n\n/// `instream_id` it requires it's version.\n\nimpl RequiredVersion for ExtXMedia {\n\n fn required_version(&self) -> ProtocolVersion {\n\n self.instream_id\n\n .map_or(ProtocolVersion::V1, |i| i.required_version())\n\n }\n\n}\n\n\n\nimpl fmt::Display for ExtXMedia {\n\n fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {\n\n write!(f, \"{}\", Self::PREFIX)?;\n\n write!(f, \"TYPE={}\", self.media_type)?;\n\n\n\n if let Some(value) = &self.uri {\n","file_path":"src/tags/master_playlist/media.rs","rank":63,"score":20.05529690070083},{"content":"\n\n fn try_from(float: f32) -> Result<Self, Self::Error> {\n\n if float.is_infinite() {\n\n return Err(Error::custom(format!(\"float must be finite: `{}`\", float)));\n\n }\n\n\n\n if float.is_nan() {\n\n return Err(Error::custom(\"float must not be `NaN`\"));\n\n }\n\n\n\n if float.is_sign_negative() {\n\n return Err(Error::custom(format!(\n\n \"float must be positive: `{}`\",\n\n float\n\n )));\n\n }\n\n\n\n Ok(Self(float))\n\n }\n\n}\n","file_path":"src/types/ufloat.rs","rank":64,"score":19.85731706055082},{"content":"/// closed_captions: None,\n\n/// stream_data: StreamData::builder()\n\n/// .bandwidth(240000)\n\n/// .codecs(&[\"avc1.42e00a\", \"mp4a.40.2\"])\n\n/// .resolution((416, 234))\n\n/// .build()\n\n/// .unwrap(),\n\n/// },\n\n/// ])\n\n/// .has_independent_segments(true)\n\n/// .start(ExtXStart::new(Float::new(1.23)))\n\n/// .build()?;\n\n/// # Ok::<(), Box<dyn ::std::error::Error>>(())\n\n/// ```\n\n///\n\n/// [`MediaPlaylist`]: crate::MediaPlaylist\n\n#[derive(Builder, Default, Debug, Clone, PartialEq, Eq, PartialOrd, Ord, Hash)]\n\n#[builder(build_fn(validate = \"Self::validate\"))]\n\n#[builder(setter(into, strip_option))]\n\n#[non_exhaustive]\n","file_path":"src/master_playlist.rs","rank":65,"score":19.533681881239428},{"content":"}\n\n\n\nimpl DecryptionKey {\n\n /// Creates a new `DecryptionKey` from an uri pointing to the key data and\n\n /// an `EncryptionMethod`.\n\n ///\n\n /// # Example\n\n ///\n\n /// ```\n\n /// # use hls_m3u8::types::DecryptionKey;\n\n /// use hls_m3u8::types::EncryptionMethod;\n\n ///\n\n /// let key = DecryptionKey::new(EncryptionMethod::Aes128, \"https://www.example.uri/key\");\n\n /// ```\n\n #[must_use]\n\n #[inline]\n\n pub fn new<I: Into<String>>(method: EncryptionMethod, uri: I) -> Self {\n\n Self {\n\n method,\n\n uri: uri.into(),\n","file_path":"src/types/decryption_key.rs","rank":66,"score":19.23106731976864},{"content":"use std::fmt;\n\nuse std::str::FromStr;\n\n\n\nuse crate::Error;\n\n\n\n/// The [`ProtocolVersion`] specifies which `m3u8` revision is required, to\n\n/// parse a certain tag correctly.\n\n#[non_exhaustive]\n\n#[allow(missing_docs)]\n\n#[derive(Debug, Clone, Copy, PartialEq, Eq, PartialOrd, Ord, Hash)]\n\npub enum ProtocolVersion {\n\n V1,\n\n V2,\n\n V3,\n\n V4,\n\n V5,\n\n V6,\n\n V7,\n\n}\n\n\n","file_path":"src/types/protocol_version.rs","rank":67,"score":18.962010396631754},{"content":" /// ));\n\n /// ```\n\n #[must_use]\n\n #[inline]\n\n pub const fn new(inner: DecryptionKey) -> Self { Self(inner) }\n\n}\n\n\n\nimpl TryFrom<ExtXKey> for ExtXSessionKey {\n\n type Error = Error;\n\n\n\n fn try_from(value: ExtXKey) -> Result<Self, Self::Error> {\n\n if let ExtXKey(Some(inner)) = value {\n\n Ok(Self(inner))\n\n } else {\n\n Err(Error::custom(\"missing decryption key\"))\n\n }\n\n }\n\n}\n\n\n\n/// This tag requires the same [`ProtocolVersion`] that is returned by\n","file_path":"src/tags/master_playlist/session_key.rs","rank":68,"score":18.92443906070974},{"content":"use std::fmt;\n\nuse std::str::FromStr;\n\n\n\nuse crate::types::{DecryptionKey, ProtocolVersion};\n\nuse crate::utils::tag;\n\nuse crate::{Error, RequiredVersion};\n\n\n\n/// Specifies how to decrypt encrypted data from the server.\n\n///\n\n/// An unencrypted segment should be marked with [`ExtXKey::empty`].\n\n#[derive(Debug, PartialEq, Eq, PartialOrd, Ord, Hash, Clone)]\n\npub struct ExtXKey(pub Option<DecryptionKey>);\n\n\n\nimpl ExtXKey {\n\n pub(crate) const PREFIX: &'static str = \"#EXT-X-KEY:\";\n\n\n\n /// Constructs an [`ExtXKey`] tag.\n\n ///\n\n /// # Example\n\n ///\n","file_path":"src/tags/media_segment/key.rs","rank":69,"score":18.85810374623977},{"content":" clippy::unneeded_field_pattern,\n\n clippy::wrong_pub_self_convention\n\n)]\n\n// those should not be present in production code:\n\n#![deny(\n\n clippy::print_stdout,\n\n clippy::todo,\n\n clippy::unimplemented,\n\n clippy::dbg_macro,\n\n clippy::use_debug\n\n)]\n\n#![warn(\n\n missing_docs,\n\n missing_copy_implementations,\n\n missing_debug_implementations,\n\n trivial_casts,\n\n trivial_numeric_casts\n\n)]\n\n//! [HLS] m3u8 parser/generator.\n\n//!\n","file_path":"src/lib.rs","rank":70,"score":18.685190515771108},{"content":"#[shorthand(enable(must_use, into))]\n\n#[builder(setter(into))]\n\n#[builder(build_fn(validate = \"Self::validate\"))]\n\npub struct ExtXMedia {\n\n /// The [`MediaType`] associated with this tag.\n\n ///\n\n /// ### Note\n\n ///\n\n /// This field is required.\n\n #[shorthand(enable(skip))]\n\n pub media_type: MediaType,\n\n /// An `URI` to a [`MediaPlaylist`].\n\n ///\n\n /// # Example\n\n ///\n\n /// ```\n\n /// # use hls_m3u8::tags::ExtXMedia;\n\n /// use hls_m3u8::types::MediaType;\n\n ///\n\n /// let mut media = ExtXMedia::new(MediaType::Audio, \"ag1\", \"english audio channel\");\n","file_path":"src/tags/master_playlist/media.rs","rank":71,"score":18.601097114663233},{"content":"#[allow(missing_docs)]\n\n#[strum(serialize_all = \"UPPERCASE\")]\n\n#[derive(Ord, PartialOrd, Debug, Clone, Copy, PartialEq, Eq, Hash, Display, EnumString)]\n\npub enum InStreamId {\n\n Cc1,\n\n Cc2,\n\n Cc3,\n\n Cc4,\n\n Service1,\n\n Service2,\n\n Service3,\n\n Service4,\n\n Service5,\n\n Service6,\n\n Service7,\n\n Service8,\n\n Service9,\n\n Service10,\n\n Service11,\n\n Service12,\n","file_path":"src/types/in_stream_id.rs","rank":72,"score":18.516603698888535},{"content":"use std::fmt;\n\nuse std::str::FromStr;\n\nuse std::time::Duration;\n\n\n\nuse derive_more::AsRef;\n\n\n\nuse crate::types::ProtocolVersion;\n\nuse crate::utils::tag;\n\nuse crate::{Error, RequiredVersion};\n\n\n\n/// Specifies the duration of a [`Media Segment`].\n\n///\n\n/// [`Media Segment`]: crate::media_segment::MediaSegment\n\n#[derive(AsRef, Default, Debug, Clone, PartialEq, Eq, Hash, PartialOrd, Ord)]\n\npub struct ExtInf {\n\n #[as_ref]\n\n duration: Duration,\n\n title: Option<String>,\n\n}\n\n\n","file_path":"src/tags/media_segment/inf.rs","rank":73,"score":18.470113184314943},{"content":"\n\nmacro_rules! implement_from {\n\n ( $( $type:tt ),+ ) => {\n\n $(\n\n impl ::core::convert::From<$type> for UFloat {\n\n fn from(value: $type) -> Self {\n\n Self(value as f32)\n\n }\n\n }\n\n )+\n\n }\n\n}\n\n\n\nimplement_from!(u16, u8);\n\n\n\n// This has to be implemented explicitly, because `Hash` is also implemented\n\n// manually and both implementations have to agree according to clippy.\n\nimpl PartialEq for UFloat {\n\n #[inline]\n\n fn eq(&self, other: &Self) -> bool { self.0 == other.0 }\n","file_path":"src/types/ufloat.rs","rank":74,"score":18.307032978674563},{"content":" #[shorthand(enable(copy))]\n\n range: Option<ByteRange>,\n\n #[shorthand(enable(skip))]\n\n pub(crate) keys: Vec<ExtXKey>,\n\n}\n\n\n\nimpl ExtXMap {\n\n pub(crate) const PREFIX: &'static str = \"#EXT-X-MAP:\";\n\n\n\n /// Makes a new [`ExtXMap`] tag.\n\n ///\n\n /// # Example\n\n ///\n\n /// ```\n\n /// # use hls_m3u8::tags::ExtXMap;\n\n /// let map = ExtXMap::new(\"https://prod.mediaspace.com/init.bin\");\n\n /// ```\n\n pub fn new<T: Into<String>>(uri: T) -> Self {\n\n Self {\n\n uri: uri.into(),\n","file_path":"src/tags/media_segment/map.rs","rank":75,"score":18.255801953895592},{"content":" source,\n\n })\n\n }\n\n\n\n pub(crate) fn parse_float<T: fmt::Display>(\n\n input: T,\n\n source: ::std::num::ParseFloatError,\n\n ) -> Self {\n\n Self::new(ErrorKind::ParseFloatError {\n\n input: input.to_string(),\n\n source,\n\n })\n\n }\n\n\n\n pub(crate) fn missing_tag<T, U>(tag: T, input: U) -> Self\n\n where\n\n T: ToString,\n\n U: ToString,\n\n {\n\n Self::new(ErrorKind::MissingTag {\n","file_path":"src/error.rs","rank":76,"score":18.056475111968375},{"content":" }\n\n\n\n result\n\n }\n\n}\n\n\n\nimpl<'a> FromIterator<&'a u8> for KeyFormatVersions {\n\n fn from_iter<I: IntoIterator<Item = &'a u8>>(iter: I) -> Self {\n\n <Self as FromIterator<u8>>::from_iter(iter.into_iter().copied())\n\n }\n\n}\n\n\n\nimpl Default for KeyFormatVersions {\n\n #[inline]\n\n fn default() -> Self {\n\n Self {\n\n buffer: [0; 9],\n\n len: 0,\n\n }\n\n }\n","file_path":"src/types/key_format_versions.rs","rank":77,"score":17.975738580083437},{"content":"use strum::{Display, EnumString};\n\n\n\n/// HDCP ([`High-bandwidth Digital Content Protection`]) level.\n\n///\n\n/// [`High-bandwidth Digital Content Protection`]:\n\n/// https://www.digital-cp.com/sites/default/files/specifications/HDCP%20on%20HDMI%20Specification%20Rev2_2_Final1.pdf\n\n#[non_exhaustive]\n\n#[derive(Ord, PartialOrd, Debug, Clone, Copy, PartialEq, Eq, Hash, Display, EnumString)]\n\n#[strum(serialize_all = \"SCREAMING-KEBAB-CASE\")]\n\npub enum HdcpLevel {\n\n /// The associated [`VariantStream`] could fail to play unless the output is\n\n /// protected by High-bandwidth Digital Content Protection ([`HDCP`]) Type 0\n\n /// or equivalent.\n\n ///\n\n /// [`VariantStream`]: crate::tags::VariantStream\n\n /// [`HDCP`]: https://www.digital-cp.com/sites/default/files/specifications/HDCP%20on%20HDMI%20Specification%20Rev2_2_Final1.pdf\n\n #[strum(serialize = \"TYPE-0\")]\n\n Type0,\n\n /// The content does not require output copy protection.\n\n None,\n","file_path":"src/types/hdcp_level.rs","rank":78,"score":17.878358212434485},{"content":"use core::fmt;\n\nuse core::str::FromStr;\n\n\n\nuse derive_builder::Builder;\n\nuse shorthand::ShortHand;\n\n\n\nuse crate::attribute::AttributePairs;\n\nuse crate::types::{Codecs, HdcpLevel, ProtocolVersion, Resolution};\n\nuse crate::utils::{quote, unquote};\n\nuse crate::{Error, RequiredVersion};\n\n\n\n/// The [`StreamData`] struct contains the data that is shared between both\n\n/// variants of the [`VariantStream`].\n\n///\n\n/// [`VariantStream`]: crate::tags::VariantStream\n\n#[derive(ShortHand, Builder, PartialOrd, Debug, Clone, PartialEq, Eq, Hash, Ord)]\n\n#[builder(setter(strip_option))]\n\n#[builder(derive(Debug, PartialEq, PartialOrd, Ord, Eq, Hash))]\n\n#[shorthand(enable(must_use, into))]\n\npub struct StreamData {\n","file_path":"src/types/stream_data.rs","rank":79,"score":17.807541305558615},{"content":" fn keys(&self) -> Vec<&DecryptionKey>;\n\n\n\n /// Most of the time only a single key is provided, so instead of iterating\n\n /// through all keys, one might as well just get the first key.\n\n #[must_use]\n\n #[inline]\n\n fn first_key(&self) -> Option<&DecryptionKey> {\n\n <Self as Decryptable>::keys(self).first().copied()\n\n }\n\n\n\n /// Returns the number of keys.\n\n #[must_use]\n\n #[inline]\n\n fn len(&self) -> usize { <Self as Decryptable>::keys(self).len() }\n\n\n\n /// Returns `true`, if the number of keys is zero.\n\n #[must_use]\n\n #[inline]\n\n fn is_empty(&self) -> bool { <Self as Decryptable>::len(self) == 0 }\n\n}\n\n\n","file_path":"src/traits.rs","rank":80,"score":17.681102572056357},{"content":"\n\nimpl fmt::Display for ExtXDiscontinuity {\n\n fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result { Self::PREFIX.fmt(f) }\n\n}\n\n\n\nimpl FromStr for ExtXDiscontinuity {\n\n type Err = Error;\n\n\n\n fn from_str(input: &str) -> Result<Self, Self::Err> {\n\n tag(input, Self::PREFIX)?;\n\n Ok(Self)\n\n }\n\n}\n\n\n\n#[cfg(test)]\n\nmod test {\n\n use super::*;\n\n use pretty_assertions::assert_eq;\n\n\n\n #[test]\n","file_path":"src/tags/media_segment/discontinuity.rs","rank":81,"score":17.634515722656513},{"content":"use std::fmt;\n\nuse std::str::FromStr;\n\n\n\nuse crate::types::ProtocolVersion;\n\nuse crate::utils::tag;\n\nuse crate::{Error, RequiredVersion};\n\n\n\n/// Provides mutability information about the [`MediaPlaylist`].\n\n///\n\n/// It applies to the entire [`MediaPlaylist`].\n\n///\n\n/// [`MediaPlaylist`]: crate::MediaPlaylist\n\n#[derive(Debug, Clone, Copy, PartialEq, Eq, Hash, PartialOrd, Ord)]\n\npub enum PlaylistType {\n\n /// If the [`PlaylistType`] is Event, [`MediaSegment`]s\n\n /// can only be added to the end of the [`MediaPlaylist`].\n\n ///\n\n /// [`MediaSegment`]: crate::MediaSegment\n\n /// [`MediaPlaylist`]: crate::MediaPlaylist\n\n Event,\n","file_path":"src/types/playlist_type.rs","rank":82,"score":17.5478951991939},{"content":" ///\n\n /// ```\n\n /// use hls_m3u8::types::{HdcpLevel, StreamData};\n\n ///\n\n /// StreamData::builder()\n\n /// .bandwidth(200)\n\n /// .average_bandwidth(15)\n\n /// .codecs(&[\"mp4a.40.2\", \"avc1.4d401e\"])\n\n /// .resolution((1920, 1080))\n\n /// .hdcp_level(HdcpLevel::Type0)\n\n /// .video(\"video_01\")\n\n /// .build()?;\n\n /// # Ok::<(), Box<dyn ::std::error::Error>>(())\n\n /// ```\n\n #[must_use]\n\n pub fn builder() -> StreamDataBuilder { StreamDataBuilder::default() }\n\n}\n\n\n\nimpl fmt::Display for StreamData {\n\n fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {\n","file_path":"src/types/stream_data.rs","rank":83,"score":17.544920760704713},{"content":"use std::fmt;\n\nuse std::str::FromStr;\n\n\n\nuse crate::types::ProtocolVersion;\n\nuse crate::utils::{quote, tag, unquote};\n\nuse crate::{Error, RequiredVersion};\n\n\n\n/// Specifies how the key is represented in the resource identified by the\n\n/// `URI`.\n\n#[non_exhaustive]\n\n#[derive(Copy, Clone, Eq, PartialEq, Ord, PartialOrd, Hash, Debug)]\n\npub enum KeyFormat {\n\n /// An [`EncryptionMethod::Aes128`] uses 16-octet (16 byte/128 bit) keys. If\n\n /// the format is [`KeyFormat::Identity`], the key file is a single packed\n\n /// array of 16 octets (16 byte/128 bit) in binary format.\n\n ///\n\n /// [`EncryptionMethod::Aes128`]: crate::types::EncryptionMethod::Aes128\n\n Identity,\n\n}\n\n\n","file_path":"src/types/key_format.rs","rank":84,"score":17.26271048683108},{"content":" fn required_version(&self) -> ProtocolVersion { ProtocolVersion::V1 }\n\n}\n\n\n\nimpl fmt::Display for ExtXIndependentSegments {\n\n fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result { Self::PREFIX.fmt(f) }\n\n}\n\n\n\nimpl FromStr for ExtXIndependentSegments {\n\n type Err = Error;\n\n\n\n fn from_str(input: &str) -> Result<Self, Self::Err> {\n\n tag(input, Self::PREFIX)?;\n\n Ok(Self)\n\n }\n\n}\n\n\n\n#[cfg(test)]\n\nmod test {\n\n use super::*;\n\n use pretty_assertions::assert_eq;\n","file_path":"src/tags/shared/independent_segments.rs","rank":85,"score":17.138915347764392},{"content":" }\n\n }\n\n}\n\n\n\nimpl SubAssign<usize> for ByteRange {\n\n #[inline]\n\n fn sub_assign(&mut self, other: usize) { *self = <Self as Sub<usize>>::sub(*self, other); }\n\n}\n\n\n\nimpl Add<usize> for ByteRange {\n\n type Output = Self;\n\n\n\n #[must_use]\n\n #[inline]\n\n fn add(self, rhs: usize) -> Self::Output {\n\n Self {\n\n start: self.start.map(|lhs| lhs + rhs),\n\n end: self.end + rhs,\n\n }\n\n }\n","file_path":"src/types/byte_range.rs","rank":86,"score":17.127430325744825},{"content":"impl Default for KeyFormat {\n\n fn default() -> Self { Self::Identity }\n\n}\n\n\n\nimpl FromStr for KeyFormat {\n\n type Err = Error;\n\n\n\n fn from_str(input: &str) -> Result<Self, Self::Err> {\n\n tag(&unquote(input), \"identity\")?; // currently only KeyFormat::Identity exists!\n\n\n\n Ok(Self::Identity)\n\n }\n\n}\n\n\n\nimpl fmt::Display for KeyFormat {\n\n fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result { write!(f, \"{}\", quote(&\"identity\")) }\n\n}\n\n\n\n/// This tag requires [`ProtocolVersion::V5`].\n\nimpl RequiredVersion for KeyFormat {\n","file_path":"src/types/key_format.rs","rank":87,"score":17.02081298151554},{"content":"// be soundly implemented.\n\nimpl Eq for UFloat {}\n\n\n\nimpl Ord for UFloat {\n\n #[inline]\n\n fn cmp(&self, other: &Self) -> Ordering {\n\n if self.0 < other.0 {\n\n Ordering::Less\n\n } else if self == other {\n\n Ordering::Equal\n\n } else {\n\n Ordering::Greater\n\n }\n\n }\n\n}\n\n\n\n/// The output of Hash cannot be relied upon to be stable. The same version of\n\n/// rust can return different values in different architectures. This is not a\n\n/// property of the Hasher that you’re using but instead of the way Hash happens\n\n/// to be implemented for the type you’re using (e.g., the current\n","file_path":"src/types/ufloat.rs","rank":88,"score":16.97791623468268},{"content":"pub struct Error {\n\n inner: ErrorKind,\n\n #[cfg(feature = \"backtrace\")]\n\n backtrace: Backtrace,\n\n}\n\n\n\nimpl PartialEq for Error {\n\n fn eq(&self, other: &Self) -> bool { self.inner == other.inner }\n\n}\n\n\n\nimpl std::error::Error for Error {}\n\n\n\nimpl fmt::Display for Error {\n\n fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result { self.inner.fmt(f) }\n\n}\n\n\n\n#[allow(clippy::needless_pass_by_value)]\n\nimpl Error {\n\n fn new(inner: ErrorKind) -> Self {\n\n Self {\n","file_path":"src/error.rs","rank":89,"score":16.927476971517592},{"content":" fn from(value: &str) -> Self { Self::String(unquote(value)) }\n\n}\n\n\n\n#[cfg(test)]\n\nmod tests {\n\n use super::*;\n\n use pretty_assertions::assert_eq;\n\n\n\n #[test]\n\n fn test_display() {\n\n assert_eq!(Value::Float(Float::new(1.1)).to_string(), \"1.1\".to_string());\n\n assert_eq!(\n\n Value::String(\"&str\".to_string()).to_string(),\n\n \"\\\"&str\\\"\".to_string()\n\n );\n\n assert_eq!(\n\n Value::Hex(vec![1, 2, 3]).to_string(),\n\n \"0x010203\".to_string()\n\n );\n\n }\n","file_path":"src/types/value.rs","rank":90,"score":16.91020533612944},{"content":" fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result { Self::PREFIX.fmt(f) }\n\n}\n\n\n\nimpl FromStr for ExtXIFramesOnly {\n\n type Err = Error;\n\n\n\n fn from_str(input: &str) -> Result<Self, Self::Err> {\n\n tag(input, Self::PREFIX)?;\n\n Ok(Self)\n\n }\n\n}\n\n\n\n#[cfg(test)]\n\nmod test {\n\n use super::*;\n\n use pretty_assertions::assert_eq;\n\n\n\n #[test]\n\n fn test_display() {\n\n assert_eq!(\n","file_path":"src/tags/media_playlist/i_frames_only.rs","rank":91,"score":16.783714555741458},{"content":"impl From<crate::tags::ExtXSessionKey> for ExtXKey {\n\n fn from(value: crate::tags::ExtXSessionKey) -> Self { Self(Some(value.0)) }\n\n}\n\n\n\nimpl fmt::Display for ExtXKey {\n\n fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {\n\n write!(f, \"{}\", Self::PREFIX)?;\n\n\n\n if let Some(value) = &self.0 {\n\n write!(f, \"{}\", value)\n\n } else {\n\n write!(f, \"METHOD=NONE\")\n\n }\n\n }\n\n}\n\n\n\n#[cfg(test)]\n\nmod test {\n\n use super::*;\n\n use crate::types::{EncryptionMethod, KeyFormat};\n","file_path":"src/tags/media_segment/key.rs","rank":92,"score":16.783701859677656},{"content":"/// fixed size array is used internally (`[u8; 9]`), which can store a maximum\n\n/// number of 9 `u8` numbers.\n\n///\n\n/// If you encounter any m3u8 file, which fails to parse, because the buffer is\n\n/// too small, feel free to [make an issue](https://github.com/sile/hls_m3u8/issues).\n\n///\n\n/// ## Example\n\n///\n\n/// ```\n\n/// use hls_m3u8::types::KeyFormatVersions;\n\n///\n\n/// assert_eq!(\n\n/// KeyFormatVersions::from([0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF]).to_string(),\n\n/// \"\\\"255/255/255/255/255/255/255/255/255\\\"\".to_string()\n\n/// );\n\n/// ```\n\n///\n\n/// [`KeyFormat`]: crate::types::KeyFormat\n\n#[derive(Debug, Clone, Copy)]\n\npub struct KeyFormatVersions {\n","file_path":"src/types/key_format_versions.rs","rank":93,"score":16.776321366916875},{"content":"use core::convert::Infallible;\n\nuse std::fmt;\n\nuse std::str::FromStr;\n\n\n\nuse crate::utils::{quote, unquote};\n\n\n\n/// The identifier of a closed captions group or its absence.\n\n#[non_exhaustive]\n\n#[derive(Clone, Eq, PartialEq, Ord, PartialOrd, Hash, Debug)]\n\npub enum ClosedCaptions {\n\n /// It indicates the set of closed-caption renditions that can be used when\n\n /// playing the presentation.\n\n ///\n\n /// The [`String`] must match [`ExtXMedia::group_id`] elsewhere in the\n\n /// Playlist and it's [`ExtXMedia::media_type`] must be\n\n /// [`MediaType::ClosedCaptions`].\n\n ///\n\n /// [`ExtXMedia::group_id`]: crate::tags::ExtXMedia::group_id\n\n /// [`ExtXMedia::media_type`]: crate::tags::ExtXMedia::media_type\n\n /// [`MediaType::ClosedCaptions`]: crate::types::MediaType::ClosedCaptions\n","file_path":"src/types/closed_captions.rs","rank":94,"score":16.671385778965508},{"content":" /// ```\n\n /// # use hls_m3u8::types::StreamData;\n\n /// #\n\n /// let stream = StreamData::new(20);\n\n /// ```\n\n #[must_use]\n\n pub const fn new(bandwidth: u64) -> Self {\n\n Self {\n\n bandwidth,\n\n average_bandwidth: None,\n\n codecs: None,\n\n resolution: None,\n\n hdcp_level: None,\n\n video: None,\n\n }\n\n }\n\n\n\n /// Returns a builder for [`StreamData`].\n\n ///\n\n /// # Example\n","file_path":"src/types/stream_data.rs","rank":95,"score":16.63681184657285},{"content":"\n\nimpl MediaPlaylist {\n\n /// Returns a builder for [`MediaPlaylist`].\n\n #[must_use]\n\n #[inline]\n\n pub fn builder() -> MediaPlaylistBuilder { MediaPlaylistBuilder::default() }\n\n\n\n /// Computes the `Duration` of the [`MediaPlaylist`], by adding each segment\n\n /// duration together.\n\n #[must_use]\n\n pub fn duration(&self) -> Duration {\n\n self.segments.values().map(|s| s.duration.duration()).sum()\n\n }\n\n}\n\n\n\nimpl RequiredVersion for MediaPlaylist {\n\n fn required_version(&self) -> ProtocolVersion {\n\n required_version![\n\n ExtXTargetDuration(self.target_duration),\n\n (self.media_sequence != 0).athen(|| ExtXMediaSequence(self.media_sequence)),\n","file_path":"src/media_playlist.rs","rank":96,"score":16.584089457212617},{"content":"impl RequiredVersion for ExtXEndList {\n\n fn required_version(&self) -> ProtocolVersion { ProtocolVersion::V1 }\n\n}\n\n\n\nimpl fmt::Display for ExtXEndList {\n\n fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result { Self::PREFIX.fmt(f) }\n\n}\n\n\n\nimpl FromStr for ExtXEndList {\n\n type Err = Error;\n\n\n\n fn from_str(input: &str) -> Result<Self, Self::Err> {\n\n tag(input, Self::PREFIX)?;\n\n Ok(Self)\n\n }\n\n}\n\n\n\n#[cfg(test)]\n\nmod test {\n\n use super::*;\n","file_path":"src/tags/media_playlist/end_list.rs","rank":97,"score":16.531724528219442},{"content":" ///\n\n /// # Example\n\n ///\n\n /// ```\n\n /// # use hls_m3u8::tags::ExtXVersion;\n\n /// use hls_m3u8::types::ProtocolVersion;\n\n ///\n\n /// let version = ExtXVersion::new(ProtocolVersion::V2);\n\n /// ```\n\n #[must_use]\n\n pub const fn new(version: ProtocolVersion) -> Self { Self(version) }\n\n\n\n /// Returns the underlying [`ProtocolVersion`].\n\n ///\n\n /// # Example\n\n ///\n\n /// ```\n\n /// # use hls_m3u8::tags::ExtXVersion;\n\n /// use hls_m3u8::types::ProtocolVersion;\n\n ///\n","file_path":"src/tags/basic/version.rs","rank":98,"score":16.510173750604302},{"content":"use std::fmt;\n\n\n\n#[cfg(feature = \"backtrace\")]\n\nuse backtrace::Backtrace;\n\nuse thiserror::Error;\n\n\n\n//use crate::types::ProtocolVersion;\n\n\n\n/// This crate specific `Result` type.\n\npub type Result<T> = std::result::Result<T, Error>;\n\n\n\n#[derive(Debug, Error, Clone, PartialEq)]\n\n#[non_exhaustive]\n","file_path":"src/error.rs","rank":99,"score":16.502654017174073}],"string":"[\n {\n \"content\": \" pub trait Sealed {}\\n\\n impl Sealed for crate::MediaSegment {}\\n\\n impl Sealed for crate::tags::ExtXMap {}\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/traits.rs\",\n \"rank\": 0,\n \"score\": 50488.99251107057\n },\n {\n \"content\": \"#[doc(hidden)]\\n\\npub trait RequiredVersion {\\n\\n /// Returns the protocol compatibility version that this tag requires.\\n\\n ///\\n\\n /// # Note\\n\\n ///\\n\\n /// This is for the latest working [`ProtocolVersion`] and a client, that\\n\\n /// only supports an older version would break.\\n\\n #[must_use]\\n\\n fn required_version(&self) -> ProtocolVersion;\\n\\n\\n\\n /// The protocol version, in which the tag has been introduced.\\n\\n #[must_use]\\n\\n fn introduced_version(&self) -> ProtocolVersion { self.required_version() }\\n\\n}\\n\\n\\n\\nimpl<T: RequiredVersion> RequiredVersion for Vec<T> {\\n\\n fn required_version(&self) -> ProtocolVersion {\\n\\n self.iter()\\n\\n .map(RequiredVersion::required_version)\\n\\n .max()\\n\",\n \"file_path\": \"src/traits.rs\",\n \"rank\": 1,\n \"score\": 49307.42488630861\n },\n {\n \"content\": \"fn parse_media_playlist(\\n\\n input: &str,\\n\\n builder: &mut MediaPlaylistBuilder,\\n\\n) -> crate::Result<MediaPlaylist> {\\n\\n let input = tag(input, \\\"#EXTM3U\\\")?;\\n\\n\\n\\n let mut segment = MediaSegment::builder();\\n\\n let mut segments = vec![];\\n\\n\\n\\n let mut has_partial_segment = false;\\n\\n let mut has_discontinuity_tag = false;\\n\\n let mut unknown = vec![];\\n\\n let mut available_keys = HashSet::new();\\n\\n\\n\\n for line in Lines::from(input) {\\n\\n match line? {\\n\\n Line::Tag(tag) => {\\n\\n match tag {\\n\\n Tag::ExtInf(t) => {\\n\\n has_partial_segment = true;\\n\",\n \"file_path\": \"src/media_playlist.rs\",\n \"rank\": 2,\n \"score\": 48180.54056224784\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\": \"tests/version-number.rs\",\n \"rank\": 3,\n \"score\": 48180.54056224784\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\",\n \"file_path\": \"tests/version-number.rs\",\n \"rank\": 4,\n \"score\": 47126.19900364676\n },\n {\n \"content\": \"/// Signals that a type or some of the asssociated data might need to be\\n\\n/// decrypted.\\n\\n///\\n\\n/// # Note\\n\\n///\\n\\n/// You are not supposed to implement this trait, therefore it is \\\"sealed\\\".\\n\\npub trait Decryptable: private::Sealed {\\n\\n /// Returns all keys, associated with the type.\\n\\n ///\\n\\n /// # Example\\n\\n ///\\n\\n /// ```\\n\\n /// use hls_m3u8::tags::ExtXMap;\\n\\n /// use hls_m3u8::types::{ByteRange, EncryptionMethod};\\n\\n /// use hls_m3u8::Decryptable;\\n\\n ///\\n\\n /// let map = ExtXMap::with_range(\\\"https://www.example.url/\\\", ByteRange::from(2..11));\\n\\n ///\\n\\n /// for key in map.keys() {\\n\\n /// if key.method == EncryptionMethod::Aes128 {\\n\\n /// // fetch content with the uri and decrypt the result\\n\\n /// break;\\n\\n /// }\\n\\n /// }\\n\\n /// ```\\n\\n #[must_use]\\n\",\n \"file_path\": \"src/traits.rs\",\n \"rank\": 5,\n \"score\": 46145.993885423406\n },\n {\n \"content\": \"fn criterion_benchmark(c: &mut Criterion) {\\n\\n let buf = create_manifest_data();\\n\\n let mut group = c.benchmark_group(\\\"parser\\\");\\n\\n group.throughput(Throughput::Bytes(buf.len() as u64));\\n\\n group.bench_function(\\\"throughput\\\", |b| {\\n\\n b.iter(|| {\\n\\n let buf = String::from_utf8_lossy(&buf);\\n\\n hls_m3u8::MediaPlaylist::from_str(&buf).unwrap()\\n\\n });\\n\\n });\\n\\n}\\n\\n\\n\\ncriterion_group!(benches, criterion_benchmark);\\n\\ncriterion_main!(benches);\\n\",\n \"file_path\": \"benches/parse.rs\",\n \"rank\": 6,\n \"score\": 45109.32357371235\n },\n {\n \"content\": \"fn create_manifest_data() -> Vec<u8> {\\n\\n let mut builder = MediaPlaylist::builder();\\n\\n builder.media_sequence(826176645);\\n\\n builder.has_independent_segments(true);\\n\\n builder.target_duration(std::time::Duration::from_secs(2));\\n\\n for i in 0..4000 {\\n\\n let mut seg = MediaSegment::builder();\\n\\n seg.duration(std::time::Duration::from_secs_f64(1.92))\\n\\n .uri(format!(\\n\\n \\\"avc_unencrypted_global-video=3000000-{}.ts?variant=italy\\\",\\n\\n 826176659 + i\\n\\n ));\\n\\n if i == 0 {\\n\\n seg.program_date_time(ExtXProgramDateTime::new(\\\"2020-04-07T11:32:38Z\\\"));\\n\\n }\\n\\n if i % 100 == 0 {\\n\\n let mut date_range =\\n\\n ExtXDateRange::new(format!(\\\"{}\\\", i / 100), \\\"2020-04-07T11:40:02.040000Z\\\");\\n\\n date_range.duration = Some(std::time::Duration::from_secs_f64(65.2));\\n\\n date_range.client_attributes.insert(\\\"SCTE35-OUT\\\".to_string(), Value::Hex(hex::decode(\\\"FC302500000000000000FFF0140500001C207FEFFE0030E3A0FE005989E000010000000070BA5ABF\\\").unwrap()));\\n\\n seg.date_range(date_range);\\n\\n }\\n\\n builder.push_segment(seg.build().unwrap());\\n\\n }\\n\\n builder.build().unwrap().to_string().into_bytes()\\n\\n}\\n\\n\\n\",\n \"file_path\": \"benches/parse.rs\",\n \"rank\": 7,\n \"score\": 44828.689777487685\n },\n {\n \"content\": \"use core::cmp::Ordering;\\n\\nuse core::convert::TryFrom;\\n\\nuse core::str::FromStr;\\n\\n\\n\\nuse derive_more::{AsRef, Deref, Display};\\n\\n\\n\\nuse crate::Error;\\n\\n\\n\\n/// A wrapper type around an [`f32`], that can not be constructed\\n\\n/// with a negative float (e.g. `-1.1`), [`NaN`], [`INFINITY`] or\\n\\n/// [`NEG_INFINITY`].\\n\\n///\\n\\n/// [`NaN`]: core::f32::NAN\\n\\n/// [`INFINITY`]: core::f32::INFINITY\\n\\n/// [`NEG_INFINITY`]: core::f32::NEG_INFINITY\\n\\n#[derive(AsRef, Deref, Default, Debug, Copy, Clone, PartialOrd, Display)]\\n\\npub struct UFloat(f32);\\n\\n\\n\\nimpl UFloat {\\n\\n /// Makes a new [`UFloat`] from an [`f32`].\\n\",\n \"file_path\": \"src/types/ufloat.rs\",\n \"rank\": 24,\n \"score\": 42.69257949525109\n },\n {\n \"content\": \" ///\\n\\n /// ```\\n\\n /// # use hls_m3u8::types::UFloat;\\n\\n /// assert_eq!(UFloat::new(1.1_f32).as_f32(), 1.1_f32);\\n\\n /// ```\\n\\n #[must_use]\\n\\n pub const fn as_f32(self) -> f32 { self.0 }\\n\\n}\\n\\n\\n\\nimpl FromStr for UFloat {\\n\\n type Err = Error;\\n\\n\\n\\n fn from_str(input: &str) -> Result<Self, Self::Err> {\\n\\n let float = f32::from_str(input).map_err(|e| Error::parse_float(input, e))?;\\n\\n Self::try_from(float)\\n\\n }\\n\\n}\\n\\n\\n\\nimpl TryFrom<f32> for UFloat {\\n\\n type Error = Error;\\n\",\n \"file_path\": \"src/types/ufloat.rs\",\n \"rank\": 25,\n \"score\": 31.81417513726809\n },\n {\n \"content\": \" #[must_use]\\n\\n pub fn new(float: f32) -> Self {\\n\\n if float.is_infinite() {\\n\\n panic!(\\\"float must be finite: `{}`\\\", float);\\n\\n }\\n\\n\\n\\n if float.is_nan() {\\n\\n panic!(\\\"float must not be `NaN`\\\");\\n\\n }\\n\\n\\n\\n if float.is_sign_negative() {\\n\\n panic!(\\\"float must be positive: `{}`\\\", float);\\n\\n }\\n\\n\\n\\n Self(float)\\n\\n }\\n\\n\\n\\n /// Returns the underlying [`f32`].\\n\\n ///\\n\\n /// # Example\\n\",\n \"file_path\": \"src/types/ufloat.rs\",\n \"rank\": 26,\n \"score\": 28.179624763631633\n },\n {\n \"content\": \"use std::str::FromStr;\\n\\n\\n\\nuse derive_more::Display;\\n\\nuse shorthand::ShortHand;\\n\\n\\n\\nuse crate::Error;\\n\\n\\n\\n/// The number of distinct pixels in each dimension that can be displayed (e.g.\\n\\n/// 1920x1080).\\n\\n///\\n\\n/// For example Full HD has a resolution of 1920x1080.\\n\\n#[derive(ShortHand, Ord, PartialOrd, Debug, Clone, Copy, PartialEq, Eq, Hash, Display)]\\n\\n#[display(fmt = \\\"{}x{}\\\", width, height)]\\n\\n#[shorthand(enable(must_use))]\\n\\npub struct Resolution {\\n\\n /// Horizontal pixel dimension.\\n\\n ///\\n\\n /// # Example\\n\\n ///\\n\\n /// ```\\n\",\n \"file_path\": \"src/types/resolution.rs\",\n \"rank\": 27,\n \"score\": 27.24695523367891\n },\n {\n \"content\": \"use std::fmt;\\n\\nuse std::str::FromStr;\\n\\n\\n\\nuse crate::types::Float;\\n\\nuse crate::utils::{quote, unquote};\\n\\nuse crate::Error;\\n\\n\\n\\n/// A `Value`.\\n\\n#[non_exhaustive]\\n\\n#[derive(Debug, Clone, PartialEq, PartialOrd, Eq, Ord, Hash)]\\n\\npub enum Value {\\n\\n /// A `String`.\\n\\n String(String),\\n\\n /// A sequence of bytes.\\n\\n Hex(Vec<u8>),\\n\\n /// A floating point number, that's neither NaN nor infinite.\\n\\n Float(Float),\\n\\n}\\n\\n\\n\\nimpl fmt::Display for Value {\\n\",\n \"file_path\": \"src/types/value.rs\",\n \"rank\": 28,\n \"score\": 27.188899977666896\n },\n {\n \"content\": \"use std::fmt;\\n\\nuse std::str::FromStr;\\n\\n\\n\\nuse crate::types::ProtocolVersion;\\n\\nuse crate::utils::tag;\\n\\nuse crate::{Error, RequiredVersion};\\n\\n\\n\\n#[derive(Debug, Clone, Copy, PartialEq, Eq, Hash, PartialOrd, Ord)]\\n\\npub(crate) struct ExtXIFramesOnly;\\n\\n\\n\\nimpl ExtXIFramesOnly {\\n\\n pub(crate) const PREFIX: &'static str = \\\"#EXT-X-I-FRAMES-ONLY\\\";\\n\\n}\\n\\n\\n\\n/// This tag requires [`ProtocolVersion::V4`].\\n\\nimpl RequiredVersion for ExtXIFramesOnly {\\n\\n fn required_version(&self) -> ProtocolVersion { ProtocolVersion::V4 }\\n\\n}\\n\\n\\n\\nimpl fmt::Display for ExtXIFramesOnly {\\n\",\n \"file_path\": \"src/tags/media_playlist/i_frames_only.rs\",\n \"rank\": 29,\n \"score\": 25.949537159773286\n },\n {\n \"content\": \"use std::fmt;\\n\\nuse std::str::FromStr;\\n\\n\\n\\nuse crate::types::ProtocolVersion;\\n\\nuse crate::utils::tag;\\n\\nuse crate::{Error, RequiredVersion};\\n\\n\\n\\n/// Allows synchronization between different renditions of the same\\n\\n/// [`VariantStream`].\\n\\n///\\n\\n/// [`VariantStream`]: crate::tags::VariantStream\\n\\n#[derive(Default, Debug, Clone, Copy, PartialEq, Eq, Ord, PartialOrd, Hash)]\\n\\npub(crate) struct ExtXDiscontinuitySequence(pub usize);\\n\\n\\n\\nimpl ExtXDiscontinuitySequence {\\n\\n pub(crate) const PREFIX: &'static str = \\\"#EXT-X-DISCONTINUITY-SEQUENCE:\\\";\\n\\n}\\n\\n\\n\\n/// This tag requires [`ProtocolVersion::V1`].\\n\\nimpl RequiredVersion for ExtXDiscontinuitySequence {\\n\",\n \"file_path\": \"src/tags/media_playlist/discontinuity_sequence.rs\",\n \"rank\": 30,\n \"score\": 25.389503006257097\n },\n {\n \"content\": \"/// ```\\n\\n///\\n\\n/// [RFC6381]: https://tools.ietf.org/html/rfc6381\\n\\n/// [`VariantStream`]: crate::tags::VariantStream\\n\\n#[derive(\\n\\n AsMut, AsRef, Deref, DerefMut, Debug, Clone, PartialEq, Eq, PartialOrd, Ord, Hash, Default,\\n\\n)]\\n\\npub struct Codecs {\\n\\n list: Vec<String>,\\n\\n}\\n\\n\\n\\nimpl Codecs {\\n\\n /// Makes a new (empty) [`Codecs`] struct.\\n\\n ///\\n\\n /// # Example\\n\\n ///\\n\\n /// ```\\n\\n /// # use hls_m3u8::types::Codecs;\\n\\n /// let codecs = Codecs::new();\\n\\n /// ```\\n\",\n \"file_path\": \"src/types/codecs.rs\",\n \"rank\": 31,\n \"score\": 25.36437241838329\n },\n {\n \"content\": \"impl<'a> From<&'a str> for Lines<'a> {\\n\\n fn from(buffer: &'a str) -> Self {\\n\\n Self {\\n\\n lines: buffer\\n\\n .lines()\\n\\n .filter_map(|line| Some(line.trim()).filter(|v| !v.is_empty())),\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\n#[derive(Debug, Clone, PartialEq)]\\n\\npub(crate) enum Line<'a> {\\n\\n Tag(Tag<'a>),\\n\\n Comment(&'a str),\\n\\n Uri(&'a str),\\n\\n}\\n\\n\\n\\n#[allow(clippy::large_enum_variant)]\\n\\n#[derive(Debug, Clone, PartialEq, Display)]\\n\\n#[display(fmt = \\\"{}\\\")]\\n\",\n \"file_path\": \"src/line.rs\",\n \"rank\": 32,\n \"score\": 25.348895471999455\n },\n {\n \"content\": \"use std::fmt;\\n\\nuse std::str::FromStr;\\n\\nuse std::time::Duration;\\n\\n\\n\\nuse crate::types::ProtocolVersion;\\n\\nuse crate::utils::tag;\\n\\nuse crate::{Error, RequiredVersion};\\n\\n\\n\\n/// Specifies the maximum `MediaSegment` duration.\\n\\n#[derive(Debug, Clone, Copy, PartialEq, Eq, Hash, Default, PartialOrd, Ord)]\\n\\npub(crate) struct ExtXTargetDuration(pub Duration);\\n\\n\\n\\nimpl ExtXTargetDuration {\\n\\n pub(crate) const PREFIX: &'static str = \\\"#EXT-X-TARGETDURATION:\\\";\\n\\n}\\n\\n\\n\\n/// This tag requires [`ProtocolVersion::V1`].\\n\\nimpl RequiredVersion for ExtXTargetDuration {\\n\\n fn required_version(&self) -> ProtocolVersion { ProtocolVersion::V1 }\\n\\n}\\n\",\n \"file_path\": \"src/tags/media_playlist/target_duration.rs\",\n \"rank\": 33,\n \"score\": 25.27023317522603\n },\n {\n \"content\": \"use core::convert::TryFrom;\\n\\nuse core::iter::FusedIterator;\\n\\nuse core::str::FromStr;\\n\\n\\n\\nuse derive_more::Display;\\n\\n\\n\\nuse crate::tags;\\n\\nuse crate::types::PlaylistType;\\n\\nuse crate::Error;\\n\\n\\n\\n#[derive(Debug, Clone)]\\n\\npub(crate) struct Lines<'a> {\\n\\n lines: ::core::iter::FilterMap<::core::str::Lines<'a>, fn(&'a str) -> Option<&'a str>>,\\n\\n}\\n\\n\\n\\nimpl<'a> Iterator for Lines<'a> {\\n\\n type Item = crate::Result<Line<'a>>;\\n\\n\\n\\n fn next(&mut self) -> Option<Self::Item> {\\n\\n let line = self.lines.next()?;\\n\",\n \"file_path\": \"src/line.rs\",\n \"rank\": 34,\n \"score\": 25.019156919276146\n },\n {\n \"content\": \"use std::fmt;\\n\\nuse std::str::FromStr;\\n\\n\\n\\nuse crate::types::ProtocolVersion;\\n\\nuse crate::utils::tag;\\n\\nuse crate::{Error, RequiredVersion};\\n\\n\\n\\n/// Indicates the Media Sequence Number of the first `MediaSegment` that\\n\\n/// appears in a `MediaPlaylist`.\\n\\n#[derive(Default, Debug, Clone, Copy, PartialEq, Eq, PartialOrd, Ord, Hash)]\\n\\npub(crate) struct ExtXMediaSequence(pub usize);\\n\\n\\n\\nimpl ExtXMediaSequence {\\n\\n pub(crate) const PREFIX: &'static str = \\\"#EXT-X-MEDIA-SEQUENCE:\\\";\\n\\n}\\n\\n\\n\\n/// This tag requires [`ProtocolVersion::V1`].\\n\\nimpl RequiredVersion for ExtXMediaSequence {\\n\\n fn required_version(&self) -> ProtocolVersion { ProtocolVersion::V1 }\\n\\n}\\n\",\n \"file_path\": \"src/tags/media_playlist/media_sequence.rs\",\n \"rank\": 35,\n \"score\": 24.930072859628137\n },\n {\n \"content\": \"use core::fmt;\\n\\nuse core::str::FromStr;\\n\\n\\n\\nuse shorthand::ShortHand;\\n\\n\\n\\nuse crate::Error;\\n\\n\\n\\n/// The maximum number of independent, simultaneous audio channels present in\\n\\n/// any [`MediaSegment`] in the rendition.\\n\\n///\\n\\n/// For example, an `AC-3 5.1` rendition would have a maximum channel number of\\n\\n/// 6.\\n\\n///\\n\\n/// [`MediaSegment`]: crate::MediaSegment\\n\\n#[derive(ShortHand, Debug, Clone, Copy, Default, Eq, PartialEq, Ord, PartialOrd, Hash)]\\n\\n#[shorthand(enable(must_use))]\\n\\npub struct Channels {\\n\\n /// The maximum number of independent simultaneous audio channels.\\n\\n ///\\n\\n /// # Example\\n\",\n \"file_path\": \"src/types/channels.rs\",\n \"rank\": 36,\n \"score\": 24.487101008396763\n },\n {\n \"content\": \"use core::iter::FusedIterator;\\n\\n\\n\\n#[derive(Clone, Debug)]\\n\\npub(crate) struct AttributePairs<'a> {\\n\\n string: &'a str,\\n\\n index: usize,\\n\\n}\\n\\n\\n\\nimpl<'a> AttributePairs<'a> {\\n\\n pub const fn new(string: &'a str) -> Self { Self { string, index: 0 } }\\n\\n}\\n\\n\\n\\nimpl<'a> Iterator for AttributePairs<'a> {\\n\\n type Item = (&'a str, &'a str);\\n\\n\\n\\n fn next(&mut self) -> Option<Self::Item> {\\n\\n // return `None`, if there are no more bytes\\n\\n self.string.as_bytes().get(self.index + 1)?;\\n\\n\\n\\n let key = {\\n\",\n \"file_path\": \"src/attribute.rs\",\n \"rank\": 37,\n \"score\": 24.337876103253027\n },\n {\n \"content\": \"impl ProtocolVersion {\\n\\n /// Returns the latest [`ProtocolVersion`] that is supported by\\n\\n /// this library.\\n\\n ///\\n\\n /// # Example\\n\\n ///\\n\\n /// ```\\n\\n /// # use hls_m3u8::types::ProtocolVersion;\\n\\n /// assert_eq!(ProtocolVersion::latest(), ProtocolVersion::V7);\\n\\n /// ```\\n\\n #[must_use]\\n\\n #[inline]\\n\\n pub const fn latest() -> Self { Self::V7 }\\n\\n}\\n\\n\\n\\nimpl fmt::Display for ProtocolVersion {\\n\\n fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {\\n\\n match &self {\\n\\n Self::V1 => write!(f, \\\"1\\\"),\\n\\n Self::V2 => write!(f, \\\"2\\\"),\\n\",\n \"file_path\": \"src/types/protocol_version.rs\",\n \"rank\": 38,\n \"score\": 24.18152142323749\n },\n {\n \"content\": \" #[inline]\\n\\n #[must_use]\\n\\n pub const fn new() -> Self { Self { list: Vec::new() } }\\n\\n}\\n\\n\\n\\nimpl fmt::Display for Codecs {\\n\\n fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {\\n\\n if let Some(codec) = self.list.iter().next() {\\n\\n write!(f, \\\"{}\\\", codec)?;\\n\\n\\n\\n for codec in self.list.iter().skip(1) {\\n\\n write!(f, \\\",{}\\\", codec)?;\\n\\n }\\n\\n }\\n\\n\\n\\n Ok(())\\n\\n }\\n\\n}\\n\\nimpl FromStr for Codecs {\\n\\n type Err = Error;\\n\",\n \"file_path\": \"src/types/codecs.rs\",\n \"rank\": 39,\n \"score\": 23.78673821872449\n },\n {\n \"content\": \" /// # use hls_m3u8::tags::ExtXStart;\\n\\n /// use hls_m3u8::types::Float;\\n\\n ///\\n\\n /// let start = ExtXStart::with_precise(Float::new(20.123456), true);\\n\\n /// assert_eq!(start.is_precise(), true);\\n\\n /// ```\\n\\n #[must_use]\\n\\n pub const fn with_precise(time_offset: Float, is_precise: bool) -> Self {\\n\\n Self {\\n\\n time_offset,\\n\\n is_precise,\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\n/// This tag requires [`ProtocolVersion::V1`].\\n\\nimpl RequiredVersion for ExtXStart {\\n\\n fn required_version(&self) -> ProtocolVersion { ProtocolVersion::V1 }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/tags/shared/start.rs\",\n \"rank\": 40,\n \"score\": 23.72217037065027\n },\n {\n \"content\": \"use std::fmt;\\n\\nuse std::str::FromStr;\\n\\n\\n\\nuse shorthand::ShortHand;\\n\\n\\n\\nuse crate::attribute::AttributePairs;\\n\\nuse crate::types::{Float, ProtocolVersion};\\n\\nuse crate::utils::{parse_yes_or_no, tag};\\n\\nuse crate::{Error, RequiredVersion};\\n\\n\\n\\n/// This tag indicates a preferred point at which to start\\n\\n/// playing a Playlist.\\n\\n///\\n\\n/// By default, clients should start playback at this point when beginning a\\n\\n/// playback session.\\n\\n#[derive(ShortHand, PartialOrd, Debug, Clone, Copy, PartialEq, Eq, Ord, Hash)]\\n\\n#[shorthand(enable(must_use))]\\n\\npub struct ExtXStart {\\n\\n /// The time offset of the [`MediaSegment`]s in the playlist.\\n\\n ///\\n\",\n \"file_path\": \"src/tags/shared/start.rs\",\n \"rank\": 41,\n \"score\": 23.646842095785253\n },\n {\n \"content\": \" ///\\n\\n /// assert_eq!(InitializationVector::Number(4).is_none(), false);\\n\\n ///\\n\\n /// assert_eq!(InitializationVector::Missing.is_none(), true);\\n\\n /// ```\\n\\n #[must_use]\\n\\n #[inline]\\n\\n pub fn is_none(&self) -> bool { *self == Self::Missing }\\n\\n}\\n\\n\\n\\nimpl Default for InitializationVector {\\n\\n fn default() -> Self { Self::Missing }\\n\\n}\\n\\n\\n\\nimpl From<[u8; 0x10]> for InitializationVector {\\n\\n fn from(value: [u8; 0x10]) -> Self { Self::Aes128(value) }\\n\\n}\\n\\n\\n\\nimpl From<Option<[u8; 0x10]>> for InitializationVector {\\n\\n fn from(value: Option<[u8; 0x10]>) -> Self {\\n\",\n \"file_path\": \"src/types/initialization_vector.rs\",\n \"rank\": 42,\n \"score\": 23.626986753814126\n },\n {\n \"content\": \" ///\\n\\n /// println!(\\\"CHANNELS=\\\\\\\"{}\\\\\\\"\\\", channels);\\n\\n /// # assert_eq!(format!(\\\"CHANNELS=\\\\\\\"{}\\\\\\\"\\\", channels), \\\"CHANNELS=\\\\\\\"6\\\\\\\"\\\".to_string());\\n\\n /// ```\\n\\n //#[inline]\\n\\n #[must_use]\\n\\n pub const fn new(number: u64) -> Self { Self { number } }\\n\\n}\\n\\n\\n\\nimpl FromStr for Channels {\\n\\n type Err = Error;\\n\\n\\n\\n fn from_str(input: &str) -> Result<Self, Self::Err> {\\n\\n Ok(Self::new(\\n\\n input.parse().map_err(|e| Error::parse_int(input, e))?,\\n\\n ))\\n\\n }\\n\\n}\\n\\n\\n\\nimpl fmt::Display for Channels {\\n\",\n \"file_path\": \"src/types/channels.rs\",\n \"rank\": 43,\n \"score\": 23.61664248743736\n },\n {\n \"content\": \"use std::fmt;\\n\\nuse std::str::FromStr;\\n\\n\\n\\nuse crate::types::ProtocolVersion;\\n\\nuse crate::utils::tag;\\n\\nuse crate::{Error, RequiredVersion};\\n\\n\\n\\n/// The [`ExtM3u`] tag indicates that the file is an **Ext**ended **[`M3U`]**\\n\\n/// Playlist file.\\n\\n/// It is the at the start of every [`MediaPlaylist`] and [`MasterPlaylist`].\\n\\n///\\n\\n/// [`MediaPlaylist`]: crate::MediaPlaylist\\n\\n/// [`MasterPlaylist`]: crate::MasterPlaylist\\n\\n/// [`M3U`]: https://en.wikipedia.org/wiki/M3U\\n\\n#[derive(Copy, Clone, Eq, PartialEq, Ord, PartialOrd, Hash, Debug, Default)]\\n\\npub(crate) struct ExtM3u;\\n\\n\\n\\nimpl ExtM3u {\\n\\n pub(crate) const PREFIX: &'static str = \\\"#EXTM3U\\\";\\n\\n}\\n\",\n \"file_path\": \"src/tags/basic/m3u.rs\",\n \"rank\": 44,\n \"score\": 23.508147000004918\n },\n {\n \"content\": \" /// assert_eq!(versions.is_default(), true);\\n\\n ///\\n\\n /// versions.push(1);\\n\\n /// assert_eq!(versions.is_default(), true);\\n\\n ///\\n\\n /// assert_eq!(KeyFormatVersions::default().is_default(), true);\\n\\n /// ```\\n\\n #[must_use]\\n\\n pub fn is_default(&self) -> bool {\\n\\n self.is_empty() || (self.buffer[self.len().saturating_sub(1)] == 1 && self.len() == 1)\\n\\n }\\n\\n}\\n\\n\\n\\nimpl PartialEq for KeyFormatVersions {\\n\\n fn eq(&self, other: &Self) -> bool {\\n\\n if self.len() == other.len() {\\n\\n // only compare the parts in the buffer, that are used:\\n\\n self.as_ref() == self.as_ref()\\n\\n } else {\\n\\n false\\n\",\n \"file_path\": \"src/types/key_format_versions.rs\",\n \"rank\": 45,\n \"score\": 23.25320021365313\n },\n {\n \"content\": \"use strum::{Display, EnumString};\\n\\n\\n\\n/// Specifies the media type.\\n\\n#[non_exhaustive]\\n\\n#[allow(missing_docs)]\\n\\n#[derive(Ord, PartialOrd, Display, EnumString, Debug, Clone, Copy, PartialEq, Eq, Hash)]\\n\\n#[strum(serialize_all = \\\"SCREAMING-KEBAB-CASE\\\")]\\n\\npub enum MediaType {\\n\\n Audio,\\n\\n Video,\\n\\n Subtitles,\\n\\n ClosedCaptions,\\n\\n}\\n\\n\\n\\n#[cfg(test)]\\n\\nmod tests {\\n\\n use super::*;\\n\\n use pretty_assertions::assert_eq;\\n\\n\\n\\n #[test]\\n\",\n \"file_path\": \"src/types/media_type.rs\",\n \"rank\": 46,\n \"score\": 22.9500370181858\n },\n {\n \"content\": \"use std::fmt;\\n\\nuse std::str::FromStr;\\n\\n\\n\\nuse derive_builder::Builder;\\n\\nuse shorthand::ShortHand;\\n\\n\\n\\nuse crate::attribute::AttributePairs;\\n\\nuse crate::types::{\\n\\n EncryptionMethod, InitializationVector, KeyFormat, KeyFormatVersions, ProtocolVersion,\\n\\n};\\n\\nuse crate::utils::{quote, unquote};\\n\\nuse crate::{Error, RequiredVersion};\\n\\n\\n\\n/// Specifies how to decrypt encrypted data from the server.\\n\\n#[derive(ShortHand, Builder, Debug, Clone, PartialEq, Eq, Hash, PartialOrd, Ord)]\\n\\n#[builder(setter(into), build_fn(validate = \\\"Self::validate\\\"))]\\n\\n#[shorthand(enable(skip, must_use, into))]\\n\\n#[non_exhaustive]\\n\\npub struct DecryptionKey {\\n\\n /// The encryption method, which has been used to encrypt the data.\\n\",\n \"file_path\": \"src/types/decryption_key.rs\",\n \"rank\": 47,\n \"score\": 22.781206921235697\n },\n {\n \"content\": \"/// - `DerefMut<Target=DateTime<FixedOffset>>`\\n\\n/// - and `Copy`\\n\\n///\\n\\n/// will be derived.\\n\\n///\\n\\n/// [`MediaSegment`]: crate::MediaSegment\\n\\n#[derive(Debug, Clone, PartialEq, Eq, Hash, PartialOrd, Ord)]\\n\\n#[cfg_attr(feature = \\\"chrono\\\", derive(Deref, DerefMut, Copy))]\\n\\n#[non_exhaustive]\\n\\npub struct ExtXProgramDateTime {\\n\\n /// The date-time of the first sample of the associated media segment.\\n\\n #[cfg(feature = \\\"chrono\\\")]\\n\\n #[cfg_attr(feature = \\\"chrono\\\", deref_mut, deref)]\\n\\n pub date_time: DateTime<FixedOffset>,\\n\\n /// The date-time of the first sample of the associated media segment.\\n\\n #[cfg(not(feature = \\\"chrono\\\"))]\\n\\n pub date_time: String,\\n\\n}\\n\\n\\n\\nimpl ExtXProgramDateTime {\\n\",\n \"file_path\": \"src/tags/media_segment/program_date_time.rs\",\n \"rank\": 48,\n \"score\": 22.183082656655014\n },\n {\n \"content\": \"use std::fmt;\\n\\nuse std::str::FromStr;\\n\\n\\n\\nuse crate::types::ProtocolVersion;\\n\\nuse crate::utils::tag;\\n\\nuse crate::{Error, RequiredVersion};\\n\\n\\n\\n/// The `ExtXDiscontinuity` tag indicates a discontinuity between the\\n\\n/// `MediaSegment` that follows it and the one that preceded it.\\n\\n#[derive(Debug, Clone, Copy, PartialEq, Eq, Hash, PartialOrd, Ord)]\\n\\npub(crate) struct ExtXDiscontinuity;\\n\\n\\n\\nimpl ExtXDiscontinuity {\\n\\n pub(crate) const PREFIX: &'static str = \\\"#EXT-X-DISCONTINUITY\\\";\\n\\n}\\n\\n\\n\\n/// This tag requires [`ProtocolVersion::V1`].\\n\\nimpl RequiredVersion for ExtXDiscontinuity {\\n\\n fn required_version(&self) -> ProtocolVersion { ProtocolVersion::V1 }\\n\\n}\\n\",\n \"file_path\": \"src/tags/media_segment/discontinuity.rs\",\n \"rank\": 49,\n \"score\": 21.93222035636412\n },\n {\n \"content\": \"use std::fmt;\\n\\nuse std::str::FromStr;\\n\\n\\n\\nuse crate::types::ProtocolVersion;\\n\\nuse crate::utils::tag;\\n\\nuse crate::{Error, RequiredVersion};\\n\\n\\n\\n/// Signals that all media samples in a [`MediaSegment`] can be decoded without\\n\\n/// information from other segments.\\n\\n///\\n\\n/// [`MediaSegment`]: crate::MediaSegment\\n\\n#[derive(Debug, Clone, Copy, PartialEq, Eq, Hash, Ord, PartialOrd)]\\n\\npub(crate) struct ExtXIndependentSegments;\\n\\n\\n\\nimpl ExtXIndependentSegments {\\n\\n pub(crate) const PREFIX: &'static str = \\\"#EXT-X-INDEPENDENT-SEGMENTS\\\";\\n\\n}\\n\\n\\n\\n/// This tag requires [`ProtocolVersion::V1`].\\n\\nimpl RequiredVersion for ExtXIndependentSegments {\\n\",\n \"file_path\": \"src/tags/shared/independent_segments.rs\",\n \"rank\": 50,\n \"score\": 21.85122168677229\n },\n {\n \"content\": \"/// let range = ByteRange::from(..20);\\n\\n/// ```\\n\\n#[derive(ShortHand, Copy, Hash, Eq, Ord, Debug, PartialEq, Clone, PartialOrd)]\\n\\n#[shorthand(enable(must_use, copy), disable(option_as_ref, set))]\\n\\npub struct ByteRange {\\n\\n /// Returns the `start` of the [`ByteRange`], if there is one.\\n\\n ///\\n\\n /// # Example\\n\\n ///\\n\\n /// ```\\n\\n /// # use hls_m3u8::types::ByteRange;\\n\\n /// assert_eq!(ByteRange::from(0..5).start(), Some(0));\\n\\n /// assert_eq!(ByteRange::from(..5).start(), None);\\n\\n /// ```\\n\\n start: Option<usize>,\\n\\n /// Returns the `end` of the [`ByteRange`].\\n\\n ///\\n\\n /// # Example\\n\\n ///\\n\\n /// ```\\n\",\n \"file_path\": \"src/types/byte_range.rs\",\n \"rank\": 51,\n \"score\": 21.82524826489018\n },\n {\n \"content\": \" ///\\n\\n /// ```\\n\\n /// # use hls_m3u8::tags::ExtXStart;\\n\\n /// use hls_m3u8::types::Float;\\n\\n ///\\n\\n /// let start = ExtXStart::new(Float::new(20.123456));\\n\\n /// ```\\n\\n #[must_use]\\n\\n pub const fn new(time_offset: Float) -> Self {\\n\\n Self {\\n\\n time_offset,\\n\\n is_precise: false,\\n\\n }\\n\\n }\\n\\n\\n\\n /// Makes a new [`ExtXStart`] tag with the given `precise` flag.\\n\\n ///\\n\\n /// # Example\\n\\n ///\\n\\n /// ```\\n\",\n \"file_path\": \"src/tags/shared/start.rs\",\n \"rank\": 52,\n \"score\": 21.713209827113776\n },\n {\n \"content\": \"\\n\\nimpl Resolution {\\n\\n /// Constructs a new [`Resolution`].\\n\\n ///\\n\\n /// # Example\\n\\n ///\\n\\n /// ```\\n\\n /// # use hls_m3u8::types::Resolution;\\n\\n /// let resolution = Resolution::new(1920, 1080);\\n\\n /// ```\\n\\n #[must_use]\\n\\n pub const fn new(width: usize, height: usize) -> Self { Self { width, height } }\\n\\n}\\n\\n\\n\\nimpl From<(usize, usize)> for Resolution {\\n\\n fn from(value: (usize, usize)) -> Self { Self::new(value.0, value.1) }\\n\\n}\\n\\n\\n\\nimpl Into<(usize, usize)> for Resolution {\\n\\n fn into(self) -> (usize, usize) { (self.width, self.height) }\\n\",\n \"file_path\": \"src/types/resolution.rs\",\n \"rank\": 53,\n \"score\": 21.503284471001106\n },\n {\n \"content\": \"/// assert_eq!(ExtXByteRange::from(22..55), ExtXByteRange::from(22..=54));\\n\\n/// ```\\n\\n///\\n\\n/// It is also possible to omit the start, in which case it assumes that the\\n\\n/// [`ExtXByteRange`] starts at the byte after the end of the previous\\n\\n/// [`ExtXByteRange`] or 0 if there is no previous one.\\n\\n///\\n\\n/// ```\\n\\n/// # use hls_m3u8::tags::ExtXByteRange;\\n\\n/// assert_eq!(ExtXByteRange::from(..55), ExtXByteRange::from(..=54));\\n\\n/// ```\\n\\n///\\n\\n/// [`MediaSegment`]: crate::MediaSegment\\n\\n#[derive(\\n\\n AsRef, AsMut, From, Deref, DerefMut, Debug, Clone, Copy, PartialEq, Eq, Hash, PartialOrd, Ord,\\n\\n)]\\n\\n#[from(forward)]\\n\\npub struct ExtXByteRange(ByteRange);\\n\\n\\n\\nimpl ExtXByteRange {\\n\",\n \"file_path\": \"src/tags/media_segment/byte_range.rs\",\n \"rank\": 54,\n \"score\": 21.493882975605832\n },\n {\n \"content\": \" /// ```\\n\\n /// # use hls_m3u8::types::ByteRange;\\n\\n /// let range = ByteRange::from(12..12);\\n\\n ///\\n\\n /// assert_eq!(range.is_empty(), true);\\n\\n /// ```\\n\\n #[inline]\\n\\n #[must_use]\\n\\n pub fn is_empty(&self) -> bool { self.len() == 0 }\\n\\n}\\n\\n\\n\\nimpl Sub<usize> for ByteRange {\\n\\n type Output = Self;\\n\\n\\n\\n #[must_use]\\n\\n #[inline]\\n\\n fn sub(self, rhs: usize) -> Self::Output {\\n\\n Self {\\n\\n start: self.start.map(|lhs| lhs - rhs),\\n\\n end: self.end - rhs,\\n\",\n \"file_path\": \"src/types/byte_range.rs\",\n \"rank\": 55,\n \"score\": 21.409203334955965\n },\n {\n \"content\": \"use std::fmt;\\n\\nuse std::str::FromStr;\\n\\n\\n\\nuse crate::types::ProtocolVersion;\\n\\nuse crate::utils::tag;\\n\\nuse crate::{Error, RequiredVersion};\\n\\n\\n\\n/// Indicates that no more [`MediaSegment`]s will be added to the\\n\\n/// [`MediaPlaylist`] file.\\n\\n///\\n\\n/// [`MediaSegment`]: crate::MediaSegment\\n\\n/// [`MediaPlaylist`]: crate::MediaPlaylist\\n\\n#[derive(Debug, Clone, Copy, PartialEq, Eq, Hash, PartialOrd, Ord)]\\n\\npub(crate) struct ExtXEndList;\\n\\n\\n\\nimpl ExtXEndList {\\n\\n pub(crate) const PREFIX: &'static str = \\\"#EXT-X-ENDLIST\\\";\\n\\n}\\n\\n\\n\\n/// This tag requires [`ProtocolVersion::V1`].\\n\",\n \"file_path\": \"src/tags/media_playlist/end_list.rs\",\n \"rank\": 56,\n \"score\": 21.215198829336213\n },\n {\n \"content\": \"\\n\\n#[doc(hidden)]\\n\\nimpl From<::strum::ParseError> for Error {\\n\\n fn from(value: ::strum::ParseError) -> Self { Self::strum(value) }\\n\\n}\\n\\n\\n\\n#[cfg(test)]\\n\\nmod tests {\\n\\n use super::*;\\n\\n use pretty_assertions::assert_eq;\\n\\n\\n\\n #[test]\\n\\n fn test_parse_float_error() {\\n\\n assert_eq!(\\n\\n Error::parse_float(\\n\\n \\\"1.x234\\\",\\n\\n \\\"1.x234\\\"\\n\\n .parse::<f32>()\\n\\n .expect_err(\\\"this should not parse as a float!\\\")\\n\\n )\\n\",\n \"file_path\": \"src/error.rs\",\n \"rank\": 57,\n \"score\": 21.191734878492905\n },\n {\n \"content\": \"use std::fmt;\\n\\nuse std::str::FromStr;\\n\\n\\n\\nuse crate::types::ProtocolVersion;\\n\\nuse crate::utils::tag;\\n\\nuse crate::{Error, RequiredVersion};\\n\\n\\n\\n/// The compatibility version of a playlist.\\n\\n///\\n\\n/// It applies to the entire [`MasterPlaylist`] or [`MediaPlaylist`].\\n\\n///\\n\\n/// [`MediaPlaylist`]: crate::MediaPlaylist\\n\\n/// [`MasterPlaylist`]: crate::MasterPlaylist\\n\\n#[derive(Copy, Clone, Eq, PartialEq, Ord, PartialOrd, Hash, Debug)]\\n\\npub struct ExtXVersion(ProtocolVersion);\\n\\n\\n\\nimpl ExtXVersion {\\n\\n pub(crate) const PREFIX: &'static str = \\\"#EXT-X-VERSION:\\\";\\n\\n\\n\\n /// Makes a new [`ExtXVersion`] tag.\\n\",\n \"file_path\": \"src/tags/basic/version.rs\",\n \"rank\": 58,\n \"score\": 21.130124313242895\n },\n {\n \"content\": \" /// assert_eq!(\\n\\n /// ExtXVersion::new(ProtocolVersion::V6).version(),\\n\\n /// ProtocolVersion::V6\\n\\n /// );\\n\\n /// ```\\n\\n #[must_use]\\n\\n pub const fn version(self) -> ProtocolVersion { self.0 }\\n\\n}\\n\\n\\n\\n/// This tag requires [`ProtocolVersion::V1`].\\n\\nimpl RequiredVersion for ExtXVersion {\\n\\n fn required_version(&self) -> ProtocolVersion { ProtocolVersion::V1 }\\n\\n}\\n\\n\\n\\nimpl fmt::Display for ExtXVersion {\\n\\n fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {\\n\\n //\\n\\n write!(f, \\\"{}{}\\\", Self::PREFIX, self.0)\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/tags/basic/version.rs\",\n \"rank\": 59,\n \"score\": 21.12424739330324\n },\n {\n \"content\": \" \\\"6\\\" => Self::V6,\\n\\n \\\"7\\\" => Self::V7,\\n\\n _ => return Err(Error::unknown_protocol_version(input)),\\n\\n }\\n\\n })\\n\\n }\\n\\n}\\n\\n\\n\\n/// The default is [`ProtocolVersion::V1`].\\n\\nimpl Default for ProtocolVersion {\\n\\n fn default() -> Self { Self::V1 }\\n\\n}\\n\\n\\n\\n#[cfg(test)]\\n\\nmod tests {\\n\\n use super::*;\\n\\n use pretty_assertions::assert_eq;\\n\\n\\n\\n #[test]\\n\\n fn test_display() {\\n\",\n \"file_path\": \"src/types/protocol_version.rs\",\n \"rank\": 60,\n \"score\": 21.066531217195735\n },\n {\n \"content\": \"impl ExtInf {\\n\\n pub(crate) const PREFIX: &'static str = \\\"#EXTINF:\\\";\\n\\n\\n\\n /// Makes a new [`ExtInf`] tag.\\n\\n ///\\n\\n /// # Example\\n\\n ///\\n\\n /// ```\\n\\n /// # use hls_m3u8::tags::ExtInf;\\n\\n /// use std::time::Duration;\\n\\n ///\\n\\n /// let ext_inf = ExtInf::new(Duration::from_secs(5));\\n\\n /// ```\\n\\n #[must_use]\\n\\n pub const fn new(duration: Duration) -> Self {\\n\\n Self {\\n\\n duration,\\n\\n title: None,\\n\\n }\\n\\n }\\n\",\n \"file_path\": \"src/tags/media_segment/inf.rs\",\n \"rank\": 61,\n \"score\": 20.933254079161244\n },\n {\n \"content\": \"use strum::{Display, EnumString};\\n\\n\\n\\n/// The encryption method.\\n\\n#[non_exhaustive]\\n\\n#[allow(missing_docs)]\\n\\n#[derive(Ord, PartialOrd, Debug, Clone, Copy, PartialEq, Eq, Hash, Display, EnumString)]\\n\\n#[strum(serialize_all = \\\"SCREAMING-KEBAB-CASE\\\")]\\n\\npub enum EncryptionMethod {\\n\\n /// The [`MediaSegment`]s are completely encrypted using the Advanced\\n\\n /// Encryption Standard ([AES-128]) with a 128-bit key, Cipher Block\\n\\n /// Chaining (CBC), and [Public-Key Cryptography Standards #7 (PKCS7)]\\n\\n /// padding.\\n\\n ///\\n\\n /// CBC is restarted on each segment boundary, using either the\\n\\n /// Initialization Vector (IV) or the Media Sequence Number as the IV\\n\\n ///\\n\\n /// ```\\n\\n /// # let media_sequence_number = 5;\\n\\n /// # assert_eq!(\\n\\n /// format!(\\\"0x{:032x}\\\", media_sequence_number)\\n\",\n \"file_path\": \"src/types/encryption_method.rs\",\n \"rank\": 62,\n \"score\": 20.43443568472104\n },\n {\n \"content\": \" /// ```\\n\\n #[must_use]\\n\\n pub fn builder() -> ExtXMediaBuilder { ExtXMediaBuilder::default() }\\n\\n}\\n\\n\\n\\n/// This tag requires either `ProtocolVersion::V1` or if there is an\\n\\n/// `instream_id` it requires it's version.\\n\\nimpl RequiredVersion for ExtXMedia {\\n\\n fn required_version(&self) -> ProtocolVersion {\\n\\n self.instream_id\\n\\n .map_or(ProtocolVersion::V1, |i| i.required_version())\\n\\n }\\n\\n}\\n\\n\\n\\nimpl fmt::Display for ExtXMedia {\\n\\n fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {\\n\\n write!(f, \\\"{}\\\", Self::PREFIX)?;\\n\\n write!(f, \\\"TYPE={}\\\", self.media_type)?;\\n\\n\\n\\n if let Some(value) = &self.uri {\\n\",\n \"file_path\": \"src/tags/master_playlist/media.rs\",\n \"rank\": 63,\n \"score\": 20.05529690070083\n },\n {\n \"content\": \"\\n\\n fn try_from(float: f32) -> Result<Self, Self::Error> {\\n\\n if float.is_infinite() {\\n\\n return Err(Error::custom(format!(\\\"float must be finite: `{}`\\\", float)));\\n\\n }\\n\\n\\n\\n if float.is_nan() {\\n\\n return Err(Error::custom(\\\"float must not be `NaN`\\\"));\\n\\n }\\n\\n\\n\\n if float.is_sign_negative() {\\n\\n return Err(Error::custom(format!(\\n\\n \\\"float must be positive: `{}`\\\",\\n\\n float\\n\\n )));\\n\\n }\\n\\n\\n\\n Ok(Self(float))\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/types/ufloat.rs\",\n \"rank\": 64,\n \"score\": 19.85731706055082\n },\n {\n \"content\": \"/// closed_captions: None,\\n\\n/// stream_data: StreamData::builder()\\n\\n/// .bandwidth(240000)\\n\\n/// .codecs(&[\\\"avc1.42e00a\\\", \\\"mp4a.40.2\\\"])\\n\\n/// .resolution((416, 234))\\n\\n/// .build()\\n\\n/// .unwrap(),\\n\\n/// },\\n\\n/// ])\\n\\n/// .has_independent_segments(true)\\n\\n/// .start(ExtXStart::new(Float::new(1.23)))\\n\\n/// .build()?;\\n\\n/// # Ok::<(), Box<dyn ::std::error::Error>>(())\\n\\n/// ```\\n\\n///\\n\\n/// [`MediaPlaylist`]: crate::MediaPlaylist\\n\\n#[derive(Builder, Default, Debug, Clone, PartialEq, Eq, PartialOrd, Ord, Hash)]\\n\\n#[builder(build_fn(validate = \\\"Self::validate\\\"))]\\n\\n#[builder(setter(into, strip_option))]\\n\\n#[non_exhaustive]\\n\",\n \"file_path\": \"src/master_playlist.rs\",\n \"rank\": 65,\n \"score\": 19.533681881239428\n },\n {\n \"content\": \"}\\n\\n\\n\\nimpl DecryptionKey {\\n\\n /// Creates a new `DecryptionKey` from an uri pointing to the key data and\\n\\n /// an `EncryptionMethod`.\\n\\n ///\\n\\n /// # Example\\n\\n ///\\n\\n /// ```\\n\\n /// # use hls_m3u8::types::DecryptionKey;\\n\\n /// use hls_m3u8::types::EncryptionMethod;\\n\\n ///\\n\\n /// let key = DecryptionKey::new(EncryptionMethod::Aes128, \\\"https://www.example.uri/key\\\");\\n\\n /// ```\\n\\n #[must_use]\\n\\n #[inline]\\n\\n pub fn new<I: Into<String>>(method: EncryptionMethod, uri: I) -> Self {\\n\\n Self {\\n\\n method,\\n\\n uri: uri.into(),\\n\",\n \"file_path\": \"src/types/decryption_key.rs\",\n \"rank\": 66,\n \"score\": 19.23106731976864\n },\n {\n \"content\": \"use std::fmt;\\n\\nuse std::str::FromStr;\\n\\n\\n\\nuse crate::Error;\\n\\n\\n\\n/// The [`ProtocolVersion`] specifies which `m3u8` revision is required, to\\n\\n/// parse a certain tag correctly.\\n\\n#[non_exhaustive]\\n\\n#[allow(missing_docs)]\\n\\n#[derive(Debug, Clone, Copy, PartialEq, Eq, PartialOrd, Ord, Hash)]\\n\\npub enum ProtocolVersion {\\n\\n V1,\\n\\n V2,\\n\\n V3,\\n\\n V4,\\n\\n V5,\\n\\n V6,\\n\\n V7,\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/types/protocol_version.rs\",\n \"rank\": 67,\n \"score\": 18.962010396631754\n },\n {\n \"content\": \" /// ));\\n\\n /// ```\\n\\n #[must_use]\\n\\n #[inline]\\n\\n pub const fn new(inner: DecryptionKey) -> Self { Self(inner) }\\n\\n}\\n\\n\\n\\nimpl TryFrom<ExtXKey> for ExtXSessionKey {\\n\\n type Error = Error;\\n\\n\\n\\n fn try_from(value: ExtXKey) -> Result<Self, Self::Error> {\\n\\n if let ExtXKey(Some(inner)) = value {\\n\\n Ok(Self(inner))\\n\\n } else {\\n\\n Err(Error::custom(\\\"missing decryption key\\\"))\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\n/// This tag requires the same [`ProtocolVersion`] that is returned by\\n\",\n \"file_path\": \"src/tags/master_playlist/session_key.rs\",\n \"rank\": 68,\n \"score\": 18.92443906070974\n },\n {\n \"content\": \"use std::fmt;\\n\\nuse std::str::FromStr;\\n\\n\\n\\nuse crate::types::{DecryptionKey, ProtocolVersion};\\n\\nuse crate::utils::tag;\\n\\nuse crate::{Error, RequiredVersion};\\n\\n\\n\\n/// Specifies how to decrypt encrypted data from the server.\\n\\n///\\n\\n/// An unencrypted segment should be marked with [`ExtXKey::empty`].\\n\\n#[derive(Debug, PartialEq, Eq, PartialOrd, Ord, Hash, Clone)]\\n\\npub struct ExtXKey(pub Option<DecryptionKey>);\\n\\n\\n\\nimpl ExtXKey {\\n\\n pub(crate) const PREFIX: &'static str = \\\"#EXT-X-KEY:\\\";\\n\\n\\n\\n /// Constructs an [`ExtXKey`] tag.\\n\\n ///\\n\\n /// # Example\\n\\n ///\\n\",\n \"file_path\": \"src/tags/media_segment/key.rs\",\n \"rank\": 69,\n \"score\": 18.85810374623977\n },\n {\n \"content\": \" clippy::unneeded_field_pattern,\\n\\n clippy::wrong_pub_self_convention\\n\\n)]\\n\\n// those should not be present in production code:\\n\\n#![deny(\\n\\n clippy::print_stdout,\\n\\n clippy::todo,\\n\\n clippy::unimplemented,\\n\\n clippy::dbg_macro,\\n\\n clippy::use_debug\\n\\n)]\\n\\n#![warn(\\n\\n missing_docs,\\n\\n missing_copy_implementations,\\n\\n missing_debug_implementations,\\n\\n trivial_casts,\\n\\n trivial_numeric_casts\\n\\n)]\\n\\n//! [HLS] m3u8 parser/generator.\\n\\n//!\\n\",\n \"file_path\": \"src/lib.rs\",\n \"rank\": 70,\n \"score\": 18.685190515771108\n },\n {\n \"content\": \"#[shorthand(enable(must_use, into))]\\n\\n#[builder(setter(into))]\\n\\n#[builder(build_fn(validate = \\\"Self::validate\\\"))]\\n\\npub struct ExtXMedia {\\n\\n /// The [`MediaType`] associated with this tag.\\n\\n ///\\n\\n /// ### Note\\n\\n ///\\n\\n /// This field is required.\\n\\n #[shorthand(enable(skip))]\\n\\n pub media_type: MediaType,\\n\\n /// An `URI` to a [`MediaPlaylist`].\\n\\n ///\\n\\n /// # Example\\n\\n ///\\n\\n /// ```\\n\\n /// # use hls_m3u8::tags::ExtXMedia;\\n\\n /// use hls_m3u8::types::MediaType;\\n\\n ///\\n\\n /// let mut media = ExtXMedia::new(MediaType::Audio, \\\"ag1\\\", \\\"english audio channel\\\");\\n\",\n \"file_path\": \"src/tags/master_playlist/media.rs\",\n \"rank\": 71,\n \"score\": 18.601097114663233\n },\n {\n \"content\": \"#[allow(missing_docs)]\\n\\n#[strum(serialize_all = \\\"UPPERCASE\\\")]\\n\\n#[derive(Ord, PartialOrd, Debug, Clone, Copy, PartialEq, Eq, Hash, Display, EnumString)]\\n\\npub enum InStreamId {\\n\\n Cc1,\\n\\n Cc2,\\n\\n Cc3,\\n\\n Cc4,\\n\\n Service1,\\n\\n Service2,\\n\\n Service3,\\n\\n Service4,\\n\\n Service5,\\n\\n Service6,\\n\\n Service7,\\n\\n Service8,\\n\\n Service9,\\n\\n Service10,\\n\\n Service11,\\n\\n Service12,\\n\",\n \"file_path\": \"src/types/in_stream_id.rs\",\n \"rank\": 72,\n \"score\": 18.516603698888535\n },\n {\n \"content\": \"use std::fmt;\\n\\nuse std::str::FromStr;\\n\\nuse std::time::Duration;\\n\\n\\n\\nuse derive_more::AsRef;\\n\\n\\n\\nuse crate::types::ProtocolVersion;\\n\\nuse crate::utils::tag;\\n\\nuse crate::{Error, RequiredVersion};\\n\\n\\n\\n/// Specifies the duration of a [`Media Segment`].\\n\\n///\\n\\n/// [`Media Segment`]: crate::media_segment::MediaSegment\\n\\n#[derive(AsRef, Default, Debug, Clone, PartialEq, Eq, Hash, PartialOrd, Ord)]\\n\\npub struct ExtInf {\\n\\n #[as_ref]\\n\\n duration: Duration,\\n\\n title: Option<String>,\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/tags/media_segment/inf.rs\",\n \"rank\": 73,\n \"score\": 18.470113184314943\n },\n {\n \"content\": \"\\n\\nmacro_rules! implement_from {\\n\\n ( $( $type:tt ),+ ) => {\\n\\n $(\\n\\n impl ::core::convert::From<$type> for UFloat {\\n\\n fn from(value: $type) -> Self {\\n\\n Self(value as f32)\\n\\n }\\n\\n }\\n\\n )+\\n\\n }\\n\\n}\\n\\n\\n\\nimplement_from!(u16, u8);\\n\\n\\n\\n// This has to be implemented explicitly, because `Hash` is also implemented\\n\\n// manually and both implementations have to agree according to clippy.\\n\\nimpl PartialEq for UFloat {\\n\\n #[inline]\\n\\n fn eq(&self, other: &Self) -> bool { self.0 == other.0 }\\n\",\n \"file_path\": \"src/types/ufloat.rs\",\n \"rank\": 74,\n \"score\": 18.307032978674563\n },\n {\n \"content\": \" #[shorthand(enable(copy))]\\n\\n range: Option<ByteRange>,\\n\\n #[shorthand(enable(skip))]\\n\\n pub(crate) keys: Vec<ExtXKey>,\\n\\n}\\n\\n\\n\\nimpl ExtXMap {\\n\\n pub(crate) const PREFIX: &'static str = \\\"#EXT-X-MAP:\\\";\\n\\n\\n\\n /// Makes a new [`ExtXMap`] tag.\\n\\n ///\\n\\n /// # Example\\n\\n ///\\n\\n /// ```\\n\\n /// # use hls_m3u8::tags::ExtXMap;\\n\\n /// let map = ExtXMap::new(\\\"https://prod.mediaspace.com/init.bin\\\");\\n\\n /// ```\\n\\n pub fn new<T: Into<String>>(uri: T) -> Self {\\n\\n Self {\\n\\n uri: uri.into(),\\n\",\n \"file_path\": \"src/tags/media_segment/map.rs\",\n \"rank\": 75,\n \"score\": 18.255801953895592\n },\n {\n \"content\": \" source,\\n\\n })\\n\\n }\\n\\n\\n\\n pub(crate) fn parse_float<T: fmt::Display>(\\n\\n input: T,\\n\\n source: ::std::num::ParseFloatError,\\n\\n ) -> Self {\\n\\n Self::new(ErrorKind::ParseFloatError {\\n\\n input: input.to_string(),\\n\\n source,\\n\\n })\\n\\n }\\n\\n\\n\\n pub(crate) fn missing_tag<T, U>(tag: T, input: U) -> Self\\n\\n where\\n\\n T: ToString,\\n\\n U: ToString,\\n\\n {\\n\\n Self::new(ErrorKind::MissingTag {\\n\",\n \"file_path\": \"src/error.rs\",\n \"rank\": 76,\n \"score\": 18.056475111968375\n },\n {\n \"content\": \" }\\n\\n\\n\\n result\\n\\n }\\n\\n}\\n\\n\\n\\nimpl<'a> FromIterator<&'a u8> for KeyFormatVersions {\\n\\n fn from_iter<I: IntoIterator<Item = &'a u8>>(iter: I) -> Self {\\n\\n <Self as FromIterator<u8>>::from_iter(iter.into_iter().copied())\\n\\n }\\n\\n}\\n\\n\\n\\nimpl Default for KeyFormatVersions {\\n\\n #[inline]\\n\\n fn default() -> Self {\\n\\n Self {\\n\\n buffer: [0; 9],\\n\\n len: 0,\\n\\n }\\n\\n }\\n\",\n \"file_path\": \"src/types/key_format_versions.rs\",\n \"rank\": 77,\n \"score\": 17.975738580083437\n },\n {\n \"content\": \"use strum::{Display, EnumString};\\n\\n\\n\\n/// HDCP ([`High-bandwidth Digital Content Protection`]) level.\\n\\n///\\n\\n/// [`High-bandwidth Digital Content Protection`]:\\n\\n/// https://www.digital-cp.com/sites/default/files/specifications/HDCP%20on%20HDMI%20Specification%20Rev2_2_Final1.pdf\\n\\n#[non_exhaustive]\\n\\n#[derive(Ord, PartialOrd, Debug, Clone, Copy, PartialEq, Eq, Hash, Display, EnumString)]\\n\\n#[strum(serialize_all = \\\"SCREAMING-KEBAB-CASE\\\")]\\n\\npub enum HdcpLevel {\\n\\n /// The associated [`VariantStream`] could fail to play unless the output is\\n\\n /// protected by High-bandwidth Digital Content Protection ([`HDCP`]) Type 0\\n\\n /// or equivalent.\\n\\n ///\\n\\n /// [`VariantStream`]: crate::tags::VariantStream\\n\\n /// [`HDCP`]: https://www.digital-cp.com/sites/default/files/specifications/HDCP%20on%20HDMI%20Specification%20Rev2_2_Final1.pdf\\n\\n #[strum(serialize = \\\"TYPE-0\\\")]\\n\\n Type0,\\n\\n /// The content does not require output copy protection.\\n\\n None,\\n\",\n \"file_path\": \"src/types/hdcp_level.rs\",\n \"rank\": 78,\n \"score\": 17.878358212434485\n },\n {\n \"content\": \"use core::fmt;\\n\\nuse core::str::FromStr;\\n\\n\\n\\nuse derive_builder::Builder;\\n\\nuse shorthand::ShortHand;\\n\\n\\n\\nuse crate::attribute::AttributePairs;\\n\\nuse crate::types::{Codecs, HdcpLevel, ProtocolVersion, Resolution};\\n\\nuse crate::utils::{quote, unquote};\\n\\nuse crate::{Error, RequiredVersion};\\n\\n\\n\\n/// The [`StreamData`] struct contains the data that is shared between both\\n\\n/// variants of the [`VariantStream`].\\n\\n///\\n\\n/// [`VariantStream`]: crate::tags::VariantStream\\n\\n#[derive(ShortHand, Builder, PartialOrd, Debug, Clone, PartialEq, Eq, Hash, Ord)]\\n\\n#[builder(setter(strip_option))]\\n\\n#[builder(derive(Debug, PartialEq, PartialOrd, Ord, Eq, Hash))]\\n\\n#[shorthand(enable(must_use, into))]\\n\\npub struct StreamData {\\n\",\n \"file_path\": \"src/types/stream_data.rs\",\n \"rank\": 79,\n \"score\": 17.807541305558615\n },\n {\n \"content\": \" fn keys(&self) -> Vec<&DecryptionKey>;\\n\\n\\n\\n /// Most of the time only a single key is provided, so instead of iterating\\n\\n /// through all keys, one might as well just get the first key.\\n\\n #[must_use]\\n\\n #[inline]\\n\\n fn first_key(&self) -> Option<&DecryptionKey> {\\n\\n <Self as Decryptable>::keys(self).first().copied()\\n\\n }\\n\\n\\n\\n /// Returns the number of keys.\\n\\n #[must_use]\\n\\n #[inline]\\n\\n fn len(&self) -> usize { <Self as Decryptable>::keys(self).len() }\\n\\n\\n\\n /// Returns `true`, if the number of keys is zero.\\n\\n #[must_use]\\n\\n #[inline]\\n\\n fn is_empty(&self) -> bool { <Self as Decryptable>::len(self) == 0 }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/traits.rs\",\n \"rank\": 80,\n \"score\": 17.681102572056357\n },\n {\n \"content\": \"\\n\\nimpl fmt::Display for ExtXDiscontinuity {\\n\\n fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result { Self::PREFIX.fmt(f) }\\n\\n}\\n\\n\\n\\nimpl FromStr for ExtXDiscontinuity {\\n\\n type Err = Error;\\n\\n\\n\\n fn from_str(input: &str) -> Result<Self, Self::Err> {\\n\\n tag(input, Self::PREFIX)?;\\n\\n Ok(Self)\\n\\n }\\n\\n}\\n\\n\\n\\n#[cfg(test)]\\n\\nmod test {\\n\\n use super::*;\\n\\n use pretty_assertions::assert_eq;\\n\\n\\n\\n #[test]\\n\",\n \"file_path\": \"src/tags/media_segment/discontinuity.rs\",\n \"rank\": 81,\n \"score\": 17.634515722656513\n },\n {\n \"content\": \"use std::fmt;\\n\\nuse std::str::FromStr;\\n\\n\\n\\nuse crate::types::ProtocolVersion;\\n\\nuse crate::utils::tag;\\n\\nuse crate::{Error, RequiredVersion};\\n\\n\\n\\n/// Provides mutability information about the [`MediaPlaylist`].\\n\\n///\\n\\n/// It applies to the entire [`MediaPlaylist`].\\n\\n///\\n\\n/// [`MediaPlaylist`]: crate::MediaPlaylist\\n\\n#[derive(Debug, Clone, Copy, PartialEq, Eq, Hash, PartialOrd, Ord)]\\n\\npub enum PlaylistType {\\n\\n /// If the [`PlaylistType`] is Event, [`MediaSegment`]s\\n\\n /// can only be added to the end of the [`MediaPlaylist`].\\n\\n ///\\n\\n /// [`MediaSegment`]: crate::MediaSegment\\n\\n /// [`MediaPlaylist`]: crate::MediaPlaylist\\n\\n Event,\\n\",\n \"file_path\": \"src/types/playlist_type.rs\",\n \"rank\": 82,\n \"score\": 17.5478951991939\n },\n {\n \"content\": \" ///\\n\\n /// ```\\n\\n /// use hls_m3u8::types::{HdcpLevel, StreamData};\\n\\n ///\\n\\n /// StreamData::builder()\\n\\n /// .bandwidth(200)\\n\\n /// .average_bandwidth(15)\\n\\n /// .codecs(&[\\\"mp4a.40.2\\\", \\\"avc1.4d401e\\\"])\\n\\n /// .resolution((1920, 1080))\\n\\n /// .hdcp_level(HdcpLevel::Type0)\\n\\n /// .video(\\\"video_01\\\")\\n\\n /// .build()?;\\n\\n /// # Ok::<(), Box<dyn ::std::error::Error>>(())\\n\\n /// ```\\n\\n #[must_use]\\n\\n pub fn builder() -> StreamDataBuilder { StreamDataBuilder::default() }\\n\\n}\\n\\n\\n\\nimpl fmt::Display for StreamData {\\n\\n fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {\\n\",\n \"file_path\": \"src/types/stream_data.rs\",\n \"rank\": 83,\n \"score\": 17.544920760704713\n },\n {\n \"content\": \"use std::fmt;\\n\\nuse std::str::FromStr;\\n\\n\\n\\nuse crate::types::ProtocolVersion;\\n\\nuse crate::utils::{quote, tag, unquote};\\n\\nuse crate::{Error, RequiredVersion};\\n\\n\\n\\n/// Specifies how the key is represented in the resource identified by the\\n\\n/// `URI`.\\n\\n#[non_exhaustive]\\n\\n#[derive(Copy, Clone, Eq, PartialEq, Ord, PartialOrd, Hash, Debug)]\\n\\npub enum KeyFormat {\\n\\n /// An [`EncryptionMethod::Aes128`] uses 16-octet (16 byte/128 bit) keys. If\\n\\n /// the format is [`KeyFormat::Identity`], the key file is a single packed\\n\\n /// array of 16 octets (16 byte/128 bit) in binary format.\\n\\n ///\\n\\n /// [`EncryptionMethod::Aes128`]: crate::types::EncryptionMethod::Aes128\\n\\n Identity,\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/types/key_format.rs\",\n \"rank\": 84,\n \"score\": 17.26271048683108\n },\n {\n \"content\": \" fn required_version(&self) -> ProtocolVersion { ProtocolVersion::V1 }\\n\\n}\\n\\n\\n\\nimpl fmt::Display for ExtXIndependentSegments {\\n\\n fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result { Self::PREFIX.fmt(f) }\\n\\n}\\n\\n\\n\\nimpl FromStr for ExtXIndependentSegments {\\n\\n type Err = Error;\\n\\n\\n\\n fn from_str(input: &str) -> Result<Self, Self::Err> {\\n\\n tag(input, Self::PREFIX)?;\\n\\n Ok(Self)\\n\\n }\\n\\n}\\n\\n\\n\\n#[cfg(test)]\\n\\nmod test {\\n\\n use super::*;\\n\\n use pretty_assertions::assert_eq;\\n\",\n \"file_path\": \"src/tags/shared/independent_segments.rs\",\n \"rank\": 85,\n \"score\": 17.138915347764392\n },\n {\n \"content\": \" }\\n\\n }\\n\\n}\\n\\n\\n\\nimpl SubAssign<usize> for ByteRange {\\n\\n #[inline]\\n\\n fn sub_assign(&mut self, other: usize) { *self = <Self as Sub<usize>>::sub(*self, other); }\\n\\n}\\n\\n\\n\\nimpl Add<usize> for ByteRange {\\n\\n type Output = Self;\\n\\n\\n\\n #[must_use]\\n\\n #[inline]\\n\\n fn add(self, rhs: usize) -> Self::Output {\\n\\n Self {\\n\\n start: self.start.map(|lhs| lhs + rhs),\\n\\n end: self.end + rhs,\\n\\n }\\n\\n }\\n\",\n \"file_path\": \"src/types/byte_range.rs\",\n \"rank\": 86,\n \"score\": 17.127430325744825\n },\n {\n \"content\": \"impl Default for KeyFormat {\\n\\n fn default() -> Self { Self::Identity }\\n\\n}\\n\\n\\n\\nimpl FromStr for KeyFormat {\\n\\n type Err = Error;\\n\\n\\n\\n fn from_str(input: &str) -> Result<Self, Self::Err> {\\n\\n tag(&unquote(input), \\\"identity\\\")?; // currently only KeyFormat::Identity exists!\\n\\n\\n\\n Ok(Self::Identity)\\n\\n }\\n\\n}\\n\\n\\n\\nimpl fmt::Display for KeyFormat {\\n\\n fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result { write!(f, \\\"{}\\\", quote(&\\\"identity\\\")) }\\n\\n}\\n\\n\\n\\n/// This tag requires [`ProtocolVersion::V5`].\\n\\nimpl RequiredVersion for KeyFormat {\\n\",\n \"file_path\": \"src/types/key_format.rs\",\n \"rank\": 87,\n \"score\": 17.02081298151554\n },\n {\n \"content\": \"// be soundly implemented.\\n\\nimpl Eq for UFloat {}\\n\\n\\n\\nimpl Ord for UFloat {\\n\\n #[inline]\\n\\n fn cmp(&self, other: &Self) -> Ordering {\\n\\n if self.0 < other.0 {\\n\\n Ordering::Less\\n\\n } else if self == other {\\n\\n Ordering::Equal\\n\\n } else {\\n\\n Ordering::Greater\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\n/// The output of Hash cannot be relied upon to be stable. The same version of\\n\\n/// rust can return different values in different architectures. This is not a\\n\\n/// property of the Hasher that you’re using but instead of the way Hash happens\\n\\n/// to be implemented for the type you’re using (e.g., the current\\n\",\n \"file_path\": \"src/types/ufloat.rs\",\n \"rank\": 88,\n \"score\": 16.97791623468268\n },\n {\n \"content\": \"pub struct Error {\\n\\n inner: ErrorKind,\\n\\n #[cfg(feature = \\\"backtrace\\\")]\\n\\n backtrace: Backtrace,\\n\\n}\\n\\n\\n\\nimpl PartialEq for Error {\\n\\n fn eq(&self, other: &Self) -> bool { self.inner == other.inner }\\n\\n}\\n\\n\\n\\nimpl std::error::Error for Error {}\\n\\n\\n\\nimpl fmt::Display for Error {\\n\\n fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result { self.inner.fmt(f) }\\n\\n}\\n\\n\\n\\n#[allow(clippy::needless_pass_by_value)]\\n\\nimpl Error {\\n\\n fn new(inner: ErrorKind) -> Self {\\n\\n Self {\\n\",\n \"file_path\": \"src/error.rs\",\n \"rank\": 89,\n \"score\": 16.927476971517592\n },\n {\n \"content\": \" fn from(value: &str) -> Self { Self::String(unquote(value)) }\\n\\n}\\n\\n\\n\\n#[cfg(test)]\\n\\nmod tests {\\n\\n use super::*;\\n\\n use pretty_assertions::assert_eq;\\n\\n\\n\\n #[test]\\n\\n fn test_display() {\\n\\n assert_eq!(Value::Float(Float::new(1.1)).to_string(), \\\"1.1\\\".to_string());\\n\\n assert_eq!(\\n\\n Value::String(\\\"&str\\\".to_string()).to_string(),\\n\\n \\\"\\\\\\\"&str\\\\\\\"\\\".to_string()\\n\\n );\\n\\n assert_eq!(\\n\\n Value::Hex(vec![1, 2, 3]).to_string(),\\n\\n \\\"0x010203\\\".to_string()\\n\\n );\\n\\n }\\n\",\n \"file_path\": \"src/types/value.rs\",\n \"rank\": 90,\n \"score\": 16.91020533612944\n },\n {\n \"content\": \" fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result { Self::PREFIX.fmt(f) }\\n\\n}\\n\\n\\n\\nimpl FromStr for ExtXIFramesOnly {\\n\\n type Err = Error;\\n\\n\\n\\n fn from_str(input: &str) -> Result<Self, Self::Err> {\\n\\n tag(input, Self::PREFIX)?;\\n\\n Ok(Self)\\n\\n }\\n\\n}\\n\\n\\n\\n#[cfg(test)]\\n\\nmod test {\\n\\n use super::*;\\n\\n use pretty_assertions::assert_eq;\\n\\n\\n\\n #[test]\\n\\n fn test_display() {\\n\\n assert_eq!(\\n\",\n \"file_path\": \"src/tags/media_playlist/i_frames_only.rs\",\n \"rank\": 91,\n \"score\": 16.783714555741458\n },\n {\n \"content\": \"impl From<crate::tags::ExtXSessionKey> for ExtXKey {\\n\\n fn from(value: crate::tags::ExtXSessionKey) -> Self { Self(Some(value.0)) }\\n\\n}\\n\\n\\n\\nimpl fmt::Display for ExtXKey {\\n\\n fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {\\n\\n write!(f, \\\"{}\\\", Self::PREFIX)?;\\n\\n\\n\\n if let Some(value) = &self.0 {\\n\\n write!(f, \\\"{}\\\", value)\\n\\n } else {\\n\\n write!(f, \\\"METHOD=NONE\\\")\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\n#[cfg(test)]\\n\\nmod test {\\n\\n use super::*;\\n\\n use crate::types::{EncryptionMethod, KeyFormat};\\n\",\n \"file_path\": \"src/tags/media_segment/key.rs\",\n \"rank\": 92,\n \"score\": 16.783701859677656\n },\n {\n \"content\": \"/// fixed size array is used internally (`[u8; 9]`), which can store a maximum\\n\\n/// number of 9 `u8` numbers.\\n\\n///\\n\\n/// If you encounter any m3u8 file, which fails to parse, because the buffer is\\n\\n/// too small, feel free to [make an issue](https://github.com/sile/hls_m3u8/issues).\\n\\n///\\n\\n/// ## Example\\n\\n///\\n\\n/// ```\\n\\n/// use hls_m3u8::types::KeyFormatVersions;\\n\\n///\\n\\n/// assert_eq!(\\n\\n/// KeyFormatVersions::from([0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF]).to_string(),\\n\\n/// \\\"\\\\\\\"255/255/255/255/255/255/255/255/255\\\\\\\"\\\".to_string()\\n\\n/// );\\n\\n/// ```\\n\\n///\\n\\n/// [`KeyFormat`]: crate::types::KeyFormat\\n\\n#[derive(Debug, Clone, Copy)]\\n\\npub struct KeyFormatVersions {\\n\",\n \"file_path\": \"src/types/key_format_versions.rs\",\n \"rank\": 93,\n \"score\": 16.776321366916875\n },\n {\n \"content\": \"use core::convert::Infallible;\\n\\nuse std::fmt;\\n\\nuse std::str::FromStr;\\n\\n\\n\\nuse crate::utils::{quote, unquote};\\n\\n\\n\\n/// The identifier of a closed captions group or its absence.\\n\\n#[non_exhaustive]\\n\\n#[derive(Clone, Eq, PartialEq, Ord, PartialOrd, Hash, Debug)]\\n\\npub enum ClosedCaptions {\\n\\n /// It indicates the set of closed-caption renditions that can be used when\\n\\n /// playing the presentation.\\n\\n ///\\n\\n /// The [`String`] must match [`ExtXMedia::group_id`] elsewhere in the\\n\\n /// Playlist and it's [`ExtXMedia::media_type`] must be\\n\\n /// [`MediaType::ClosedCaptions`].\\n\\n ///\\n\\n /// [`ExtXMedia::group_id`]: crate::tags::ExtXMedia::group_id\\n\\n /// [`ExtXMedia::media_type`]: crate::tags::ExtXMedia::media_type\\n\\n /// [`MediaType::ClosedCaptions`]: crate::types::MediaType::ClosedCaptions\\n\",\n \"file_path\": \"src/types/closed_captions.rs\",\n \"rank\": 94,\n \"score\": 16.671385778965508\n },\n {\n \"content\": \" /// ```\\n\\n /// # use hls_m3u8::types::StreamData;\\n\\n /// #\\n\\n /// let stream = StreamData::new(20);\\n\\n /// ```\\n\\n #[must_use]\\n\\n pub const fn new(bandwidth: u64) -> Self {\\n\\n Self {\\n\\n bandwidth,\\n\\n average_bandwidth: None,\\n\\n codecs: None,\\n\\n resolution: None,\\n\\n hdcp_level: None,\\n\\n video: None,\\n\\n }\\n\\n }\\n\\n\\n\\n /// Returns a builder for [`StreamData`].\\n\\n ///\\n\\n /// # Example\\n\",\n \"file_path\": \"src/types/stream_data.rs\",\n \"rank\": 95,\n \"score\": 16.63681184657285\n },\n {\n \"content\": \"\\n\\nimpl MediaPlaylist {\\n\\n /// Returns a builder for [`MediaPlaylist`].\\n\\n #[must_use]\\n\\n #[inline]\\n\\n pub fn builder() -> MediaPlaylistBuilder { MediaPlaylistBuilder::default() }\\n\\n\\n\\n /// Computes the `Duration` of the [`MediaPlaylist`], by adding each segment\\n\\n /// duration together.\\n\\n #[must_use]\\n\\n pub fn duration(&self) -> Duration {\\n\\n self.segments.values().map(|s| s.duration.duration()).sum()\\n\\n }\\n\\n}\\n\\n\\n\\nimpl RequiredVersion for MediaPlaylist {\\n\\n fn required_version(&self) -> ProtocolVersion {\\n\\n required_version![\\n\\n ExtXTargetDuration(self.target_duration),\\n\\n (self.media_sequence != 0).athen(|| ExtXMediaSequence(self.media_sequence)),\\n\",\n \"file_path\": \"src/media_playlist.rs\",\n \"rank\": 96,\n \"score\": 16.584089457212617\n },\n {\n \"content\": \"impl RequiredVersion for ExtXEndList {\\n\\n fn required_version(&self) -> ProtocolVersion { ProtocolVersion::V1 }\\n\\n}\\n\\n\\n\\nimpl fmt::Display for ExtXEndList {\\n\\n fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result { Self::PREFIX.fmt(f) }\\n\\n}\\n\\n\\n\\nimpl FromStr for ExtXEndList {\\n\\n type Err = Error;\\n\\n\\n\\n fn from_str(input: &str) -> Result<Self, Self::Err> {\\n\\n tag(input, Self::PREFIX)?;\\n\\n Ok(Self)\\n\\n }\\n\\n}\\n\\n\\n\\n#[cfg(test)]\\n\\nmod test {\\n\\n use super::*;\\n\",\n \"file_path\": \"src/tags/media_playlist/end_list.rs\",\n \"rank\": 97,\n \"score\": 16.531724528219442\n },\n {\n \"content\": \" ///\\n\\n /// # Example\\n\\n ///\\n\\n /// ```\\n\\n /// # use hls_m3u8::tags::ExtXVersion;\\n\\n /// use hls_m3u8::types::ProtocolVersion;\\n\\n ///\\n\\n /// let version = ExtXVersion::new(ProtocolVersion::V2);\\n\\n /// ```\\n\\n #[must_use]\\n\\n pub const fn new(version: ProtocolVersion) -> Self { Self(version) }\\n\\n\\n\\n /// Returns the underlying [`ProtocolVersion`].\\n\\n ///\\n\\n /// # Example\\n\\n ///\\n\\n /// ```\\n\\n /// # use hls_m3u8::tags::ExtXVersion;\\n\\n /// use hls_m3u8::types::ProtocolVersion;\\n\\n ///\\n\",\n \"file_path\": \"src/tags/basic/version.rs\",\n \"rank\": 98,\n \"score\": 16.510173750604302\n },\n {\n \"content\": \"use std::fmt;\\n\\n\\n\\n#[cfg(feature = \\\"backtrace\\\")]\\n\\nuse backtrace::Backtrace;\\n\\nuse thiserror::Error;\\n\\n\\n\\n//use crate::types::ProtocolVersion;\\n\\n\\n\\n/// This crate specific `Result` type.\\n\\npub type Result<T> = std::result::Result<T, Error>;\\n\\n\\n\\n#[derive(Debug, Error, Clone, PartialEq)]\\n\\n#[non_exhaustive]\\n\",\n \"file_path\": \"src/error.rs\",\n \"rank\": 99,\n \"score\": 16.502654017174073\n }\n]","isConversational":false}}},{"rowIdx":2368,"cells":{"lang":{"kind":"string","value":"Rust"},"file_path":{"kind":"string","value":"src/app.rs"},"repo_name":{"kind":"string","value":"rsookram/srs-cli"},"commit":{"kind":"string","value":"8825fcf6a7f9055d5f13ac8a23cf55f6d959895d"},"file_code":{"kind":"string","value":"use crate::Srs;\nuse anyhow::anyhow;\nuse anyhow::Result;\nuse dialoguer::theme::Theme;\nuse dialoguer::Confirm;\nuse srs_cli::Card;\nuse srs_cli::DeckStats;\nuse srs_cli::GlobalStats;\nuse std::io;\n\npub struct App<W: io::Write> {\n srs: Srs,\n output: W,\n}\n\nimpl<W: io::Write> App<W> {\n pub fn new(srs: Srs, output: W) -> Self {\n Self { srs, output }\n }\n\n pub fn add(&mut self, deck_id: u64) -> Result<()> {\n let (front, back) = open_editor(\"\", \"\")?;\n\n self.srs.create_card(deck_id, front, back)\n }\n\n pub fn cards(&mut self) -> Result<()> {\n for card in self.srs.card_previews()? {\n let front = card.front.replace('\\n', \" \");\n\n if card.is_leech {\n writeln!(self.output, \"[leech] {} {front}\", card.id)?;\n } else {\n writeln!(self.output, \"{} {front}\", card.id)?;\n }\n }\n\n Ok(())\n }\n\n pub fn create_deck(&mut self, name: &str) -> Result<()> {\n self.srs.create_deck(name)?;\n\n writeln!(self.output, \"Created {name}\")?;\n Ok(())\n }\n\n pub fn decks(&mut self) -> Result<()> {\n for deck in self.srs.decks()? {\n writeln!(\n self.output,\n \"{} {} - {}%\",\n deck.id, deck.name, deck.interval_modifier\n )?;\n }\n\n Ok(())\n }\n\n pub fn delete(&mut self, card_id: u64) -> Result<()> {\n let front: String = self.srs.get_card(card_id)?.front;\n\n if Confirm::new()\n .with_prompt(format!(\n \"Are you sure you want to delete '{}'\",\n front.replace('\\n', \" \")\n ))\n .interact()?\n {\n self.srs.delete_card(card_id)?;\n writeln!(self.output, \"... deleted.\")?;\n }\n\n Ok(())\n }\n\n pub fn delete_deck(&mut self, deck_id: u64) -> Result<()> {\n let name = self.srs.get_deck(deck_id)?.name;\n\n if Confirm::new()\n .with_prompt(format!(\"Are you sure you want to delete '{name}'\"))\n .interact()?\n {\n self.srs.delete_deck(deck_id)?;\n writeln!(self.output, \"... deleted.\")?;\n }\n\n Ok(())\n }\n\n pub fn edit(&mut self, card_id: u64) -> Result<()> {\n let card = self.srs.get_card(card_id)?;\n\n let (front, back) = open_editor(&card.front, &card.back)?;\n\n self.srs.update_card(card_id, front, back)\n }\n\n pub fn init(&mut self) -> Result<()> {\n self.srs.init()\n }\n\n pub fn int_mod(&mut self, deck_id: u64, modifier: u16) -> Result<()> {\n let name: String = self.srs.get_deck(deck_id)?.name;\n\n self.srs.update_interval_modifier(deck_id, modifier)?;\n\n writeln!(\n self.output,\n \"Set interval modifier for {name} to {modifier}\"\n )?;\n\n Ok(())\n }\n\n pub fn review(&mut self) -> Result<()> {\n let cards = self.srs.cards_to_review()?;\n\n writeln!(\n self.output,\n \"{} cards to review\",\n cards.iter().flat_map(|(_, cc)| cc).count()\n )?;\n\n for (deck_name, cards) in cards {\n let num_cards = cards.len();\n\n writeln!(\n self.output,\n \"\\n{num_cards} cards to review in {deck_name}\\n\"\n )?;\n\n let mut num_correct = 0;\n\n for card in cards {\n let is_correct = self.review_card(&card)?;\n if is_correct {\n num_correct += 1;\n self.srs.answer_correct(card.id)?;\n } else {\n self.srs.answer_wrong(card.id)?;\n }\n\n writeln!(self.output)?;\n }\n\n writeln!(self.output, \"Answered {num_correct}/{num_cards} correctly\")?;\n }\n\n writeln!(self.output, \"Finished review\")?;\n\n Ok(())\n }\n\n fn review_card(&mut self, card: &Card) -> Result<bool> {\n writeln!(self.output, \"{}\\n\", &card.front)?;\n\n Confirm::with_theme(&PlainPrompt)\n .with_prompt(\"Press enter to show answer\")\n .default(true)\n .show_default(false)\n .report(false)\n .interact()?;\n\n writeln!(self.output, \"{}\", \"-\".repeat(79))?;\n\n writeln!(self.output, \"{}\\n\", &card.back)?;\n\n Ok(Confirm::new().with_prompt(\"Correct?\").interact()?)\n }\n\n pub fn stats(&mut self) -> Result<()> {\n let (global_stats, deck_stats) = self.srs.stats()?;\n\n self.output_global(&global_stats)?;\n\n for stat in deck_stats.iter() {\n writeln!(self.output)?;\n self.output_deck(stat)?;\n }\n\n Ok(())\n }\n\n fn output_global(&mut self, stats: &GlobalStats) -> Result<()> {\n let total = stats.active + stats.suspended + (stats.leech as u32);\n writeln!(self.output, \"{} / {total} active\", stats.active)?;\n\n if stats.leech > 0 {\n writeln!(self.output, \"{} leeches\", stats.leech)?;\n }\n\n writeln!(self.output, \"Review tomorrow: {}\", stats.for_review)?;\n\n Ok(())\n }\n\n fn output_deck(&mut self, stats: &DeckStats) -> Result<()> {\n let total = stats.active + stats.suspended + (stats.leech as u32);\n writeln!(\n self.output,\n \"{}\\n {} / {total} active\",\n stats.name, stats.active\n )?;\n\n if stats.leech > 0 {\n writeln!(self.output, \" {} leeches\", stats.leech)?;\n }\n\n let num_answered = stats.correct + stats.wrong;\n\n writeln!(\n self.output,\n \" Past month accuracy: {:.0}% ({} / {num_answered})\",\n if num_answered > 0 {\n stats.correct as f32 / num_answered as f32 * 100.0\n } else {\n 100.0\n },\n stats.correct,\n )?;\n\n Ok(())\n }\n\n pub fn switch(&mut self, card_id: u64, deck_id: u64) -> Result<()> {\n let front = self.srs.get_card(card_id)?.front;\n let deck_name = self.srs.get_deck(deck_id)?.name;\n\n if Confirm::new()\n .with_prompt(format!(\n \"Are you sure you want to switch '{front}' to {deck_name}?\"\n ))\n .interact()?\n {\n self.srs.switch_deck(card_id, deck_id)?;\n writeln!(self.output, \"... switched.\")?;\n }\n\n Ok(())\n }\n}\n\nstruct PlainPrompt;\n\nimpl Theme for PlainPrompt {\n \n fn format_confirm_prompt(\n &self,\n f: &mut dyn std::fmt::Write,\n prompt: &str,\n _default: Option<bool>,\n ) -> std::fmt::Result {\n write!(f, \"{}\", &prompt)\n }\n}\n\nfn open_editor(front: &str, back: &str) -> Result<(String, String)> {\n let divider = \"----------\";\n let template = format!(\"{front}\\n{divider}\\n{back}\\n\");\n\n let output = scrawl::with(&template)?;\n\n output\n .split_once(divider)\n .map(|(front, back)| (front.trim().to_string(), back.trim().to_string()))\n .ok_or_else(|| anyhow!(\"Missing divider between front and back of card\"))\n .and_then(|(front, back)| {\n if front.is_empty() {\n Err(anyhow!(\"Front of card can't be empty\"))\n } else {\n Ok((front, back))\n }\n })\n}\n"},"prefix":{"kind":"string","value":"use crate::Srs;\nuse anyhow::anyhow;\nuse anyhow::Result;\nuse dialoguer::theme::Theme;\nuse dialoguer::Confirm;\nuse srs_cli::Card;\nuse srs_cli::DeckStats;\nuse srs_cli::GlobalStats;\nuse std::io;\n\npub struct App<W: io::Write> {\n srs: Srs,\n output: W,\n}\n\nimpl<W: io::Write> App<W> {\n pub fn new(srs: Srs, output: W) -> Self {\n Self { srs, output }\n }\n\n pub fn add(&mut self, deck_id: u64) -> Result<()> {\n let (front, back) = open_editor(\"\", \"\")?;\n\n self.srs.create_card(deck_id, front, back)\n }\n\n pub fn cards(&mut self) -> Result<()> {\n for card in self.srs.card_previews()? {\n let front = card.front.replace('\\n', \" \");\n\n if card.is_leech {\n writeln!(self.output, \"[leech] {} {front}\", card.id)?;\n } else {\n writeln!(self.output, \"{} {front}\", card.id)?;\n }\n }\n\n Ok(())\n }\n\n pub fn create_deck(&mut self, name: &str) -> Result<()> {\n self.srs.create_deck(name)?;\n\n writeln!(self.output, \"Created {name}\")?;\n Ok(())\n }\n\n pub fn decks(&mut self) -> Result<()> {\n for deck in self.srs.decks()? {\n writeln!(\n self.output,\n \"{} {} - {}%\",\n deck.id, deck.name, deck.interval_modifier\n )?;\n }\n\n Ok(())\n }\n\n pub fn delete(&mut self, card_id: u64) -> Result<()> {\n let front: String = self.srs.get_card(card_id)?.front;\n\n if Confirm::new()\n .with_prompt(format!(\n \"Are you sure you want to delete '{}'\",\n front.replace('\\n', \" \")\n ))\n .interact()?\n {\n self.srs.delete_card(card_id)?;\n writeln!(self.output, \"... deleted.\")?;\n }\n\n Ok(())\n }\n\n pub fn delete_deck(&mut self, deck_id: u64) -> Result<()> {\n let name = self.srs.get_deck(deck_id)?.name;\n\n if Confirm::new()\n .with_prompt(format!(\"Are you sure you want to delete '{name}'\"))\n .interact()?\n {\n self.srs.delete_deck(deck_id)?;\n writeln!(self.output, \"... deleted.\")?;\n }\n\n Ok(())\n }\n\n pub fn edit(&mut self, card_id: u64) -> Result<()> {\n let card = self.srs.get_card(card_id)?;\n\n let (front, back) = open_editor(&card.front, &card.back)?;\n\n self.srs.update_card(card_id, front, back)\n }\n\n pub fn init(&mut self) -> Result<()> {\n self.srs.init()\n }\n\n pub fn int_mod(&mut self, deck_id: u64, modifier: u16) -> Result<()> {\n let name: String = self.srs.get_deck(deck_id)?.name;\n\n self.srs.update_interval_modifier(deck_id, modifier)?;\n\n writeln!(\n self.output,\n \"Set interval modifier for {name} to {modifier}\"\n )?;\n\n Ok(())\n }\n\n pub fn review(&mut self) -> Result<()> {\n let cards = self.srs.cards_to_review()?;\n\n writeln!(\n self.output,\n \"{} cards to review\",\n cards.iter().flat_map(|(_, cc)| cc).count()\n )?;\n\n for (deck_name, cards) in cards {\n let num_cards = cards.len();\n\n writeln!(\n self.output,\n \"\\n{num_cards} cards to review in {deck_name}\\n\"\n )?;\n\n let mut num_correct = 0;\n\n for card in cards {\n let is_correct = self.review_card(&card)?;\n if is_correct {\n num_correct += 1;\n self.srs.answer_correct(card.id)?;\n } else {\n self.srs.answer_wrong(card.id)?;\n }\n\n writeln!(self.output)?;\n }\n\n writeln!(self.output, \"Answered {num_correct}/{num_cards} correctly\")?;\n }\n\n writeln!(self.output, \"Finished review\")?;\n\n Ok(())\n }\n\n fn review_card(&mut self, card: &Card) -> Result<bool> {\n writeln!(self.output, \"{}\\n\", &card.front)?;\n\n Confirm::with_theme(&PlainPrompt)\n .with_prompt(\"Press enter to show answer\")\n .default(true)\n .show_default(false)\n .report(false)\n .interact()?;\n\n writeln!(self.output, \"{}\", \"-\".repeat(79))?;\n\n writeln!(self.output, \"{}\\n\", &card.back)?;\n\n Ok(Confirm::new().with_prompt(\"Correct?\").interact()?)\n }\n\n pub fn stats(&mut self) -> Result<()> {\n let (global_stats, deck_stats) = self.srs.stats()?;\n\n self.output_global(&global_stats)?;\n\n for stat in deck_stats.iter() {\n writeln!(self.output)?;\n self.output_deck(stat)?;\n }\n\n Ok(())\n }\n\n fn output_global(&mut self, stats: &GlobalStats) -> Result<()> {\n let total = stats.active + stats.suspended + (stats.leech as u32);\n writeln!(self.output, \"{} / {total} active\", stats.active)?;\n\n if stats.leech > 0 {\n writeln!(self.output, \"{} leeches\", stats.leech)?;\n }\n\n writeln!(self.output, \"Review tomorrow: {}\", stats.for_review)?;\n\n Ok(())\n }\n\n "},"suffix":{"kind":"string","value":"\n\n pub fn switch(&mut self, card_id: u64, deck_id: u64) -> Result<()> {\n let front = self.srs.get_card(card_id)?.front;\n let deck_name = self.srs.get_deck(deck_id)?.name;\n\n if Confirm::new()\n .with_prompt(format!(\n \"Are you sure you want to switch '{front}' to {deck_name}?\"\n ))\n .interact()?\n {\n self.srs.switch_deck(card_id, deck_id)?;\n writeln!(self.output, \"... switched.\")?;\n }\n\n Ok(())\n }\n}\n\nstruct PlainPrompt;\n\nimpl Theme for PlainPrompt {\n \n fn format_confirm_prompt(\n &self,\n f: &mut dyn std::fmt::Write,\n prompt: &str,\n _default: Option<bool>,\n ) -> std::fmt::Result {\n write!(f, \"{}\", &prompt)\n }\n}\n\nfn open_editor(front: &str, back: &str) -> Result<(String, String)> {\n let divider = \"----------\";\n let template = format!(\"{front}\\n{divider}\\n{back}\\n\");\n\n let output = scrawl::with(&template)?;\n\n output\n .split_once(divider)\n .map(|(front, back)| (front.trim().to_string(), back.trim().to_string()))\n .ok_or_else(|| anyhow!(\"Missing divider between front and back of card\"))\n .and_then(|(front, back)| {\n if front.is_empty() {\n Err(anyhow!(\"Front of card can't be empty\"))\n } else {\n Ok((front, back))\n }\n })\n}\n"},"middle":{"kind":"string","value":"fn output_deck(&mut self, stats: &DeckStats) -> Result<()> {\n let total = stats.active + stats.suspended + (stats.leech as u32);\n writeln!(\n self.output,\n \"{}\\n {} / {total} active\",\n stats.name, stats.active\n )?;\n\n if stats.leech > 0 {\n writeln!(self.output, \" {} leeches\", stats.leech)?;\n }\n\n let num_answered = stats.correct + stats.wrong;\n\n writeln!(\n self.output,\n \" Past month accuracy: {:.0}% ({} / {num_answered})\",\n if num_answered > 0 {\n stats.correct as f32 / num_answered as f32 * 100.0\n } else {\n 100.0\n },\n stats.correct,\n )?;\n\n Ok(())\n }"},"strategy":{"kind":"string","value":"function_block-full_function"},"context_items":{"kind":"list like","value":[{"content":"CREATE INDEX cardDeckId ON Card(deckId);\n\n\n","file_path":"src/schema.sql","rank":1,"score":80076.39999327567},{"content":"CREATE INDEX answerCardId ON Answer(cardId);\n","file_path":"src/schema.sql","rank":2,"score":80021.74427068235},{"content":"fn main() -> Result<()> {\n\n let opt = opt::Opt::from_args();\n\n\n\n let srs = Srs::open(&opt.path)?;\n\n\n\n let stdout = std::io::stdout();\n\n let stdout = stdout.lock();\n\n\n\n let mut app = App::new(srs, stdout);\n\n\n\n use opt::Subcommand::*;\n\n\n\n let result = match &opt.subcommand {\n\n Add { deck_id } => app.add(*deck_id),\n\n\n\n Cards => app.cards(),\n\n\n\n CreateDeck { name } => app.create_deck(name),\n\n\n\n Decks => app.decks(),\n","file_path":"src/main.rs","rank":3,"score":68164.774677154},{"content":"CREATE TABLE Deck(\n\n id INTEGER PRIMARY KEY,\n\n name TEXT NOT NULL,\n\n creationTimestamp INTEGER NOT NULL, -- In milliseconds since Unix epoch\n\n intervalModifier INTEGER NOT NULL DEFAULT 100\n\n);\n\n\n","file_path":"src/schema.sql","rank":4,"score":54020.32369988704},{"content":"CREATE TABLE Answer(\n\n cardId INTEGER NOT NULL REFERENCES Card(id) ON DELETE CASCADE,\n\n isCorrect INTEGER NOT NULL,\n\n timestamp INTEGER NOT NULL -- In milliseconds since Unix epoch\n\n);\n\n\n","file_path":"src/schema.sql","rank":5,"score":53267.65386082508},{"content":"CREATE TABLE Card(\n\n id INTEGER PRIMARY KEY,\n\n deckId INTEGER NOT NULL REFERENCES Deck(id) ON DELETE CASCADE,\n\n front TEXT NOT NULL,\n\n back TEXT NOT NULL,\n\n creationTimestamp INTEGER NOT NULL -- In milliseconds since Unix epoch\n\n);\n\n\n","file_path":"src/schema.sql","rank":6,"score":53219.18314268129},{"content":"CREATE INDEX answerTimestamp ON Answer(timestamp);\n\n\n","file_path":"src/schema.sql","rank":7,"score":50505.82264106586},{"content":"CREATE INDEX cardCreationTimestamp ON Card(creationTimestamp);\n","file_path":"src/schema.sql","rank":8,"score":46834.992761573},{"content":"CREATE INDEX scheduleIsLeech ON Schedule(isLeech);\n","file_path":"src/schema.sql","rank":9,"score":39931.60286340858},{"content":"fn print_help() {\n\n println!(\n\n r#\"{name} {version}\n\nSpaced repetition at the command line\n\n\n\nUSAGE:\n\n {name} [OPTIONS]\n\n\n\nFLAGS:\n\n -h, --help Prints help information\n\n -V, --version Prints version information\n\n\n\nOPTIONS:\n\n -p, --path <PATH> The path of the database file [default: srs.db]\n\n\n\nSUBCOMMANDS:\n\n add\n\n cards\n\n create-deck\n\n decks\n","file_path":"src/opt.rs","rank":11,"score":35589.71342558448},{"content":"pub trait Clock {\n\n fn now(&self) -> OffsetDateTime;\n\n}\n\n\n\npub struct UtcClock;\n\n\n\nimpl Clock for UtcClock {\n\n fn now(&self) -> OffsetDateTime {\n\n OffsetDateTime::now_utc()\n\n }\n\n}\n","file_path":"src/clock.rs","rank":12,"score":34282.6528039226},{"content":"pub trait Schedule {\n\n fn next_interval(\n\n &mut self,\n\n previous_interval: u16,\n\n was_correct: Option<bool>,\n\n interval_modifier: u16,\n\n ) -> u16;\n\n}\n\n\n\nconst WRONG_ANSWER_PENALTY: f64 = 0.7;\n\n\n\npub struct LowKeyAnki {\n\n rng: Box<dyn rand::RngCore>,\n\n}\n\n\n\nimpl Schedule for LowKeyAnki {\n\n fn next_interval(\n\n &mut self,\n\n previous_interval: u16,\n\n was_correct: Option<bool>,\n","file_path":"src/schedule.rs","rank":13,"score":34282.6528039226},{"content":"CREATE TABLE Schedule(\n\n cardId INTEGER PRIMARY KEY REFERENCES Card(id) ON DELETE CASCADE,\n\n scheduledForTimestamp INTEGER, -- In milliseconds since Unix epoch, NULL when suspended\n\n intervalDays INTEGER, -- 0 for new cards, NULL when suspended\n\n isLeech INTEGER NOT NULL DEFAULT 0\n\n);\n\n\n","file_path":"src/schema.sql","rank":14,"score":19385.53198759368},{"content":"CREATE INDEX scheduleScheduledForTimestamp ON Schedule(scheduledForTimestamp);\n","file_path":"src/schema.sql","rank":15,"score":14233.971768350631},{"content":" pub id: u64,\n\n pub front: String,\n\n pub back: String,\n\n}\n\n\n\n#[derive(Debug)]\n\npub struct CardPreview {\n\n pub id: u64,\n\n pub front: String,\n\n pub is_leech: bool,\n\n}\n\n\n\n#[derive(Debug, PartialEq)]\n\npub struct GlobalStats {\n\n pub active: u32,\n\n pub suspended: u32,\n\n pub leech: u16,\n\n pub for_review: u16,\n\n}\n\n\n","file_path":"src/lib.rs","rank":25,"score":24.028181250930984},{"content":" .into_iter()\n\n .next()\n\n .ok_or(anyhow!(\"nothing to review\"))?;\n\n assert_eq!(for_review, (\"testName\".to_string(), vec![card]));\n\n\n\n Ok(())\n\n }\n\n\n\n #[test]\n\n fn answering_correct_increases_interval() -> Result<()> {\n\n let (mut srs, now) = new_srs()?;\n\n\n\n let deck = create_and_return_deck(&mut srs, \"testName\")?;\n\n let card = create_and_return_card(&mut srs, &deck, \"front\", \"back\")?;\n\n\n\n let intervals = [0, 1, 2, 4, 8, 16, 32, 64, 128, 256];\n\n\n\n for next_interval in intervals {\n\n now.set(now.get() + Duration::days(next_interval));\n\n assert_scheduled(&srs, &card);\n","file_path":"src/lib.rs","rank":26,"score":23.857140279203072},{"content":" self.conn.execute(\"DELETE FROM Card WHERE id = ?\", [id])?;\n\n\n\n Ok(())\n\n }\n\n\n\n pub fn update_card(&mut self, id: u64, front: String, back: String) -> Result<()> {\n\n self.conn.execute(\n\n \"UPDATE Card SET front=?, back=? WHERE id=?\",\n\n params![front, back, id],\n\n )?;\n\n\n\n Ok(())\n\n }\n\n\n\n pub fn switch_deck(&mut self, card_id: u64, deck_id: u64) -> Result<()> {\n\n self.conn.execute(\n\n \"UPDATE Card SET deckId = ? WHERE id = ?\",\n\n [deck_id, card_id],\n\n )?;\n\n\n","file_path":"src/lib.rs","rank":27,"score":23.674838300485817},{"content":"\n\n srs.answer_correct(card.id)?;\n\n }\n\n\n\n now.set(now.get() + Duration::days(1024));\n\n assert_not_scheduled(&srs, &card); // auto-suspend\n\n\n\n Ok(())\n\n }\n\n\n\n #[test]\n\n fn answering_correct_increases_interval_with_interval_modifier() -> Result<()> {\n\n let (mut srs, now) = new_srs()?;\n\n\n\n let deck = create_and_return_deck(&mut srs, \"testName\")?;\n\n srs.update_interval_modifier(deck.id, 200)?;\n\n\n\n let card = create_and_return_card(&mut srs, &deck, \"front\", \"back\")?;\n\n\n\n let intervals = [0, 1, 4, 16, 64, 256];\n","file_path":"src/lib.rs","rank":28,"score":23.609862635341145},{"content":" correct: 0,\n\n wrong: 0,\n\n },\n\n DeckStats {\n\n name: \"testName\".to_string(),\n\n active: 0,\n\n suspended: 0,\n\n leech: 0,\n\n correct: 0,\n\n wrong: 0,\n\n }\n\n ],\n\n );\n\n\n\n Ok(())\n\n }\n\n\n\n #[test]\n\n fn delete_card() -> Result<()> {\n\n let (mut srs, _) = new_srs()?;\n","file_path":"src/lib.rs","rank":29,"score":23.204658749300666},{"content":" let card = create_and_return_card(&mut srs, &deck, \"front\", \"back\")?;\n\n\n\n srs.switch_deck(card.id, deck2.id)?;\n\n\n\n let for_review = srs\n\n .cards_to_review()?\n\n .into_iter()\n\n .next()\n\n .ok_or(anyhow!(\"nothing to review\"))?;\n\n assert_eq!(for_review, (\"another deck\".to_string(), vec![card]));\n\n\n\n let (_, deck_stats) = srs.stats()?;\n\n assert_eq!(\n\n deck_stats,\n\n vec![\n\n DeckStats {\n\n name: \"another deck\".to_string(),\n\n active: 1,\n\n suspended: 0,\n\n leech: 0,\n","file_path":"src/lib.rs","rank":30,"score":22.14328838630124},{"content":" assert_eq!(\n\n deck_stats,\n\n vec![DeckStats {\n\n name: \"testName\".to_string(),\n\n active: 1,\n\n suspended: 0,\n\n leech: 0,\n\n correct: 0,\n\n wrong: 0,\n\n }],\n\n );\n\n\n\n Ok(())\n\n }\n\n\n\n #[test]\n\n fn edit_card() -> Result<()> {\n\n let (mut srs, _) = new_srs()?;\n\n\n\n let deck = create_and_return_deck(&mut srs, \"testName\")?;\n","file_path":"src/lib.rs","rank":32,"score":21.79795197820025},{"content":"\n\n srs.answer_correct(card.id)?;\n\n\n\n let for_review = srs.cards_to_review()?;\n\n assert_eq!(for_review.len(), 0);\n\n\n\n Ok(())\n\n }\n\n\n\n #[test]\n\n fn answering_wrong_leaves_card_in_queue() -> Result<()> {\n\n let (mut srs, _) = new_srs()?;\n\n\n\n let deck = create_and_return_deck(&mut srs, \"testName\")?;\n\n let card = create_and_return_card(&mut srs, &deck, \"front\", \"back\")?;\n\n\n\n srs.answer_wrong(card.id)?;\n\n\n\n let for_review = srs\n\n .cards_to_review()?\n","file_path":"src/lib.rs","rank":33,"score":21.15250234623192},{"content":" Add { deck_id: u64 },\n\n Cards,\n\n CreateDeck { name: String },\n\n Decks,\n\n Delete { card_id: u64 },\n\n DeleteDeck { deck_id: u64 },\n\n Edit { card_id: u64 },\n\n Init,\n\n IntMod { deck_id: u64, modifier: u16 },\n\n Review,\n\n Stats,\n\n Switch { card_id: u64, deck_id: u64 },\n\n}\n\n\n\nimpl Opt {\n\n /// Gets [Opt] from the command line arguments. Prints the error message\n\n /// and quits the program in case of failure.\n\n pub fn from_args() -> Self {\n\n let mut args = Arguments::from_env();\n\n\n","file_path":"src/opt.rs","rank":34,"score":21.056297481043877},{"content":"\n\n let now: u64 = (self.clock.now().unix_timestamp() * 1000)\n\n .try_into()\n\n .expect(\"valid timestamp\");\n\n\n\n self.conn.execute(\n\n \"INSERT INTO Deck(name, creationTimestamp) VALUES (?, ?)\",\n\n params![name, now],\n\n )?;\n\n\n\n Ok(())\n\n }\n\n\n\n pub fn delete_deck(&mut self, id: u64) -> Result<()> {\n\n self.conn.execute(\"DELETE FROM Deck WHERE id = ?\", [id])?;\n\n\n\n Ok(())\n\n }\n\n\n\n pub fn update_interval_modifier(&mut self, id: u64, modifier: u16) -> Result<()> {\n","file_path":"src/lib.rs","rank":35,"score":20.899263208701548},{"content":"\n\n let deck = create_and_return_deck(&mut srs, \"testName\")?;\n\n\n\n let card = create_and_return_card(&mut srs, &deck, \"front\", \"back\")?;\n\n\n\n srs.delete_card(card.id)?;\n\n\n\n let card = srs.get_card(card.id);\n\n\n\n assert!(card.is_err(), \"got a card {card:?}\");\n\n\n\n Ok(())\n\n }\n\n\n\n #[test]\n\n fn answering_correct_removes_from_queue() -> Result<()> {\n\n let (mut srs, _) = new_srs()?;\n\n\n\n let deck = create_and_return_deck(&mut srs, \"testName\")?;\n\n let card = create_and_return_card(&mut srs, &deck, \"front\", \"back\")?;\n","file_path":"src/lib.rs","rank":36,"score":20.770379033837557},{"content":"\n\n for next_interval in intervals {\n\n now.set(now.get() + Duration::days(next_interval));\n\n assert_scheduled(&srs, &card);\n\n\n\n srs.answer_correct(card.id)?;\n\n }\n\n\n\n now.set(now.get() + Duration::days(1024));\n\n assert_not_scheduled(&srs, &card); // auto-suspend\n\n\n\n Ok(())\n\n }\n\n\n\n #[test]\n\n fn answering_wrong_decreases_interval() -> Result<()> {\n\n let (mut srs, now) = new_srs()?;\n\n\n\n let deck = create_and_return_deck(&mut srs, \"testName\")?;\n\n let card = create_and_return_card(&mut srs, &deck, \"front\", \"back\")?;\n","file_path":"src/lib.rs","rank":37,"score":20.622382134505955},{"content":" assert_eq!(card.front, \"front\");\n\n assert_eq!(card.back, \"back\");\n\n\n\n let for_review = srs\n\n .cards_to_review()?\n\n .into_iter()\n\n .next()\n\n .ok_or(anyhow!(\"nothing to review\"))?;\n\n assert_eq!(for_review, (\"testName\".to_string(), vec![card]));\n\n\n\n let (global_stats, deck_stats) = srs.stats()?;\n\n assert_eq!(\n\n global_stats,\n\n GlobalStats {\n\n active: 1,\n\n suspended: 0,\n\n leech: 0,\n\n for_review: 1,\n\n }\n\n );\n","file_path":"src/lib.rs","rank":38,"score":20.456825340242023},{"content":" }\n\n\n\n pub fn get_deck(&self, id: u64) -> Result<Deck> {\n\n Ok(self.conn.query_row(\n\n \"SELECT id, name, intervalModifier FROM Deck WHERE id = ?\",\n\n [id],\n\n |row| {\n\n Ok(Deck {\n\n id: row.get(0)?,\n\n name: row.get(1)?,\n\n interval_modifier: row.get(2)?,\n\n })\n\n },\n\n )?)\n\n }\n\n\n\n pub fn create_deck(&mut self, name: &str) -> Result<()> {\n\n if name.is_empty() {\n\n bail!(\"deck name can't be empty\");\n\n }\n","file_path":"src/lib.rs","rank":39,"score":20.33278806965535},{"content":" fn create_and_return_card(srs: &mut Srs, deck: &Deck, front: &str, back: &str) -> Result<Card> {\n\n srs.create_card(deck.id, front.to_string(), back.to_string())?;\n\n\n\n let preview = srs\n\n .card_previews()?\n\n .into_iter()\n\n .next()\n\n .ok_or(anyhow!(\"no cards\"))?;\n\n\n\n srs.get_card(preview.id)\n\n }\n\n}\n","file_path":"src/lib.rs","rank":41,"score":20.231896705571025},{"content":" let deck = create_and_return_deck(&mut srs, \"testName\")?;\n\n\n\n srs.delete_deck(deck.id)?;\n\n\n\n assert_eq!(srs.decks()?.len(), 0);\n\n\n\n let (_, deck_stats) = srs.stats()?;\n\n assert_eq!(deck_stats.len(), 0);\n\n\n\n Ok(())\n\n }\n\n\n\n #[test]\n\n fn create_card() -> Result<()> {\n\n let (mut srs, _) = new_srs()?;\n\n\n\n let deck = create_and_return_deck(&mut srs, \"testName\")?;\n\n\n\n let card = create_and_return_card(&mut srs, &deck, \"front\", \"back\")?;\n\n\n","file_path":"src/lib.rs","rank":42,"score":19.809296519559535},{"content":" \"\n\n SELECT id, front, back\n\n FROM Card\n\n WHERE id = ?\n\n \",\n\n [id],\n\n |row| {\n\n Ok(Card {\n\n id: row.get(0)?,\n\n front: row.get(1)?,\n\n back: row.get(2)?,\n\n })\n\n },\n\n )?)\n\n }\n\n\n\n pub fn create_card(&mut self, deck_id: u64, front: String, back: String) -> Result<()> {\n\n let tx = self.conn.transaction()?;\n\n\n\n let now: u64 = (self.clock.now().unix_timestamp() * 1000)\n","file_path":"src/lib.rs","rank":43,"score":19.701006503843356},{"content":" let found = srs\n\n .cards_to_review()\n\n .unwrap()\n\n .iter()\n\n .flat_map(|(_, c)| c)\n\n .any(|c| c.id == card.id);\n\n\n\n assert!(!found, \"card is scheduled for review\")\n\n }\n\n\n\n #[test]\n\n fn mark_leech_after_too_many_wrong_answers() -> Result<()> {\n\n let (mut srs, _) = new_srs()?;\n\n\n\n let deck = create_and_return_deck(&mut srs, \"testName\")?;\n\n let card = create_and_return_card(&mut srs, &deck, \"front\", \"back\")?;\n\n\n\n for _ in 1..=WRONG_ANSWERS_FOR_LEECH {\n\n srs.answer_wrong(card.id)?;\n\n }\n","file_path":"src/lib.rs","rank":44,"score":19.618234464878594},{"content":"#[derive(Debug, PartialEq)]\n\npub struct DeckStats {\n\n pub name: String,\n\n pub active: u32,\n\n pub suspended: u32,\n\n pub leech: u16,\n\n pub correct: u16,\n\n pub wrong: u16,\n\n}\n\n\n\nimpl Srs {\n\n pub fn open(db_path: &Path) -> Result<Self> {\n\n let conn = Connection::open(db_path)?;\n\n\n\n conn.set_db_config(DbConfig::SQLITE_DBCONFIG_ENABLE_FKEY, true)?;\n\n\n\n Ok(Self {\n\n conn,\n\n clock: Box::new(clock::UtcClock),\n\n schedule: Box::new(LowKeyAnki::new()),\n","file_path":"src/lib.rs","rank":45,"score":19.517754187170876},{"content":"\n\n let for_review = srs.cards_to_review()?;\n\n assert_eq!(for_review.len(), 0);\n\n\n\n let preview = srs\n\n .card_previews()?\n\n .into_iter()\n\n .next()\n\n .ok_or(anyhow!(\"no cards\"))?;\n\n assert!(preview.is_leech);\n\n\n\n Ok(())\n\n }\n\n\n\n fn create_and_return_deck(srs: &mut Srs, name: &str) -> Result<Deck> {\n\n srs.create_deck(name)?;\n\n\n\n srs.decks()?.pop().ok_or(anyhow!(\"no decks\"))\n\n }\n\n\n","file_path":"src/lib.rs","rank":46,"score":19.06858558227412},{"content":"const MIN_INTERVAL_MODIFIER: u16 = 50;\n\nconst AUTO_SUSPEND_INTERVAL: u16 = 365;\n\nconst WRONG_ANSWERS_FOR_LEECH: u16 = 4;\n\n\n\npub struct Srs {\n\n conn: Connection,\n\n schedule: Box<dyn Schedule>,\n\n clock: Box<dyn Clock>,\n\n offset: UtcOffset,\n\n}\n\n\n\n#[derive(Debug, PartialEq)]\n\npub struct Deck {\n\n pub id: u64,\n\n pub name: String,\n\n pub interval_modifier: u16,\n\n}\n\n\n\n#[derive(Debug, PartialEq)]\n\npub struct Card {\n","file_path":"src/lib.rs","rank":47,"score":19.01702283276035},{"content":"\n\n let num_wrong: u16 = tx.query_row(\n\n \"SELECT COUNT(*) FROM Answer WHERE cardId = ? AND isCorrect = 0\",\n\n [card_id],\n\n |row| row.get(0),\n\n )?;\n\n\n\n if num_wrong >= WRONG_ANSWERS_FOR_LEECH {\n\n tx.execute(\n\n \"UPDATE Schedule SET isLeech = 1 WHERE cardId = ?\",\n\n [card_id],\n\n )?;\n\n }\n\n\n\n tx.commit()?;\n\n\n\n Ok(())\n\n }\n\n\n\n pub fn stats(&self) -> Result<(GlobalStats, Vec<DeckStats>)> {\n","file_path":"src/lib.rs","rank":48,"score":18.506173752312428},{"content":"\n\n let r: Result<_, rusqlite::Error> = iter.collect();\n\n\n\n Ok(r?)\n\n }\n\n\n\n pub fn cards_to_review(&self) -> Result<Vec<(String, Vec<Card>)>> {\n\n let mut stmt = self.conn.prepare(\n\n \"\n\n SELECT Deck.name, Card.id, Card.front, Card.back\n\n FROM Card JOIN Schedule ON Card.id = Schedule.cardId JOIN Deck ON Card.deckId = Deck.id\n\n WHERE isLeech = 0 AND scheduledForTimestamp < ?\n\n ORDER BY Card.deckId, scheduledForTimestamp\n\n \",\n\n )?;\n\n\n\n let iter = stmt.query_map([self.start_of_tomorrow()?], |row| {\n\n Ok((\n\n row.get(0)?,\n\n Card {\n","file_path":"src/lib.rs","rank":49,"score":18.297399076670153},{"content":"\n\n let card = create_and_return_card(&mut srs, &deck, \"front\", \"back\")?;\n\n\n\n srs.update_card(card.id, \"new front\".to_string(), \"new back\".to_string())?;\n\n\n\n let edited_card = srs.get_card(card.id)?;\n\n assert_eq!(edited_card.id, card.id);\n\n assert_eq!(edited_card.front, \"new front\");\n\n assert_eq!(edited_card.back, \"new back\");\n\n\n\n Ok(())\n\n }\n\n\n\n #[test]\n\n fn switch_card() -> Result<()> {\n\n let (mut srs, _) = new_srs()?;\n\n\n\n let deck = create_and_return_deck(&mut srs, \"testName\")?;\n\n let deck2 = create_and_return_deck(&mut srs, \"another deck\")?;\n\n\n","file_path":"src/lib.rs","rank":50,"score":18.108851480765942},{"content":" leech: 0,\n\n for_review: 0,\n\n }\n\n );\n\n assert_eq!(deck_stats.len(), 0);\n\n\n\n Ok(())\n\n }\n\n\n\n #[test]\n\n fn create_deck() -> Result<()> {\n\n let (mut srs, _) = new_srs()?;\n\n\n\n let deck = create_and_return_deck(&mut srs, \"testName\")?;\n\n assert_eq!(deck.name, \"testName\");\n\n assert_eq!(deck.interval_modifier, 100);\n\n\n\n assert_eq!(srs.get_deck(deck.id)?, deck);\n\n assert_eq!(srs.decks()?, vec![deck]);\n\n\n","file_path":"src/lib.rs","rank":51,"score":17.786764298227318},{"content":" if modifier < MIN_INTERVAL_MODIFIER {\n\n bail!(format!(\n\n \"must be > {MIN_INTERVAL_MODIFIER}, given {modifier}\"\n\n ));\n\n }\n\n\n\n self.conn.execute(\n\n \"\n\n UPDATE Deck\n\n SET intervalModifier = ?\n\n WHERE id = ?\n\n \",\n\n params![modifier, id],\n\n )?;\n\n\n\n Ok(())\n\n }\n\n\n\n pub fn get_card(&self, id: u64) -> Result<Card> {\n\n Ok(self.conn.query_row(\n","file_path":"src/lib.rs","rank":53,"score":17.26477535402501},{"content":" Ok(())\n\n }\n\n\n\n #[test]\n\n fn edit_deck() -> Result<()> {\n\n let (mut srs, _) = new_srs()?;\n\n\n\n let deck = create_and_return_deck(&mut srs, \"testName\")?;\n\n\n\n srs.update_interval_modifier(deck.id, 120)?;\n\n\n\n assert_eq!(srs.get_deck(deck.id)?.interval_modifier, 120);\n\n\n\n Ok(())\n\n }\n\n\n\n #[test]\n\n fn delete_deck() -> Result<()> {\n\n let (mut srs, _) = new_srs()?;\n\n\n","file_path":"src/lib.rs","rank":54,"score":17.248207380401627},{"content":" interval_modifier: u16,\n\n ) -> u16 {\n\n match previous_interval {\n\n // Newly added card answered correctly\n\n 0 => 1,\n\n // First review. The wrong answer penalty isn't applied since it's rare to answer\n\n // incorrectly on the first review.\n\n 1 => 4,\n\n _ => {\n\n let was_correct = was_correct.expect(\"previously answered the card\");\n\n\n\n if was_correct {\n\n // Previous answer was correct\n\n let mut next =\n\n (previous_interval as f64 * 2.5 * (interval_modifier as f64 / 100.0))\n\n as u16;\n\n\n\n let max_fuzz =\n\n (previous_interval as f64 * self.fuzz_factor(previous_interval)) as u16;\n\n let fuzz = self.rng.gen_range(0..=max_fuzz);\n","file_path":"src/schedule.rs","rank":55,"score":17.13612141617343},{"content":" .try_into()\n\n .expect(\"valid timestamp\");\n\n\n\n let card_id: u64 = tx.query_row(\n\n \"INSERT INTO Card(deckId, front, back, creationTimestamp) VALUES (?, ?, ?, ?) RETURNING *\",\n\n params![deck_id, front, back, now],\n\n |row| row.get(0),\n\n )?;\n\n\n\n tx.execute(\n\n \"INSERT INTO Schedule(cardId, scheduledForTimestamp, intervalDays) VALUES (?, ?, ?)\",\n\n params![card_id, now, 0],\n\n )?;\n\n\n\n tx.commit()?;\n\n\n\n Ok(())\n\n }\n\n\n\n pub fn delete_card(&mut self, id: u64) -> Result<()> {\n","file_path":"src/lib.rs","rank":56,"score":16.861087930182133},{"content":" name: row.get(0)?,\n\n active: row.get(1)?,\n\n suspended: row.get(2)?,\n\n leech: row.get(3)?,\n\n correct: row.get(4)?,\n\n wrong: row.get(5)?,\n\n })\n\n })?;\n\n\n\n let deck_stats: Result<_, rusqlite::Error> = iter.collect();\n\n\n\n Ok((global_stats, deck_stats?))\n\n }\n\n\n\n fn start_of_tomorrow(&self) -> Result<u64> {\n\n let now = self.clock.now().to_offset(self.offset);\n\n let start_of_tomorrow = now\n\n .date()\n\n .saturating_add(Duration::days(1))\n\n .with_hms(0, 0, 0)\n","file_path":"src/lib.rs","rank":57,"score":15.812055806598732},{"content":"\n\n Ok(())\n\n }\n\n\n\n pub fn decks(&self) -> Result<Vec<Deck>> {\n\n let mut stmt = self\n\n .conn\n\n .prepare(\"SELECT id, name, intervalModifier FROM Deck ORDER BY id\")?;\n\n\n\n let iter = stmt.query_map([], |row| {\n\n Ok(Deck {\n\n id: row.get(0)?,\n\n name: row.get(1)?,\n\n interval_modifier: row.get(2)?,\n\n })\n\n })?;\n\n\n\n let r: Result<_, rusqlite::Error> = iter.collect();\n\n\n\n Ok(r?)\n","file_path":"src/lib.rs","rank":58,"score":15.375252219839682},{"content":" |row| {\n\n Ok(GlobalStats {\n\n active: row.get(0)?,\n\n suspended: row.get(1)?,\n\n leech: row.get(2)?,\n\n for_review: row.get(3)?,\n\n })\n\n },\n\n )?;\n\n\n\n let mut stmt = self.conn.prepare(\n\n \"\n\n SELECT\n\n name,\n\n\n\n (SELECT COUNT(*)\n\n FROM Card JOIN Schedule ON Card.id = Schedule.cardId\n\n WHERE Card.deckId = d.id AND scheduledForTimestamp IS NOT NULL AND isLeech = 0) AS active,\n\n\n\n (SELECT COUNT(*)\n","file_path":"src/lib.rs","rank":59,"score":14.493092144522427},{"content":"\n\n Delete { card_id } => app.delete(*card_id),\n\n\n\n DeleteDeck { deck_id } => app.delete_deck(*deck_id),\n\n\n\n Edit { card_id } => app.edit(*card_id),\n\n\n\n Init => app.init(),\n\n\n\n IntMod { deck_id, modifier } => app.int_mod(*deck_id, *modifier),\n\n\n\n Review => app.review(),\n\n\n\n Stats => app.stats(),\n\n\n\n Switch { card_id, deck_id } => app.switch(*card_id, *deck_id),\n\n };\n\n\n\n if let Err(err) = result {\n\n match err.downcast_ref::<io::Error>() {\n\n Some(e) if e.kind() == io::ErrorKind::BrokenPipe => Ok(()),\n\n _ => Err(err),\n\n }\n\n } else {\n\n result\n\n }\n\n}\n","file_path":"src/main.rs","rank":60,"score":14.479728323883226},{"content":"\n\n pub fn answer_correct(&mut self, card_id: u64) -> Result<()> {\n\n let now_date_time = self.clock.now();\n\n\n\n let now: u64 = (now_date_time.unix_timestamp() * 1000)\n\n .try_into()\n\n .expect(\"valid timestamp\");\n\n\n\n let tx = self.conn.transaction()?;\n\n\n\n let interval_days: u16 = tx\n\n .query_row(\n\n \"SELECT intervalDays FROM Schedule WHERE cardId = ?\",\n\n [card_id],\n\n |row| row.get(0),\n\n )\n\n .optional()?\n\n .expect(\"card is not suspended\");\n\n\n\n let was_correct: Option<bool> = tx\n","file_path":"src/lib.rs","rank":61,"score":14.233814609963789},{"content":" id: row.get(1)?,\n\n front: row.get(2)?,\n\n back: row.get(3)?,\n\n },\n\n ))\n\n })?;\n\n\n\n let r: Result<_, rusqlite::Error> = iter.collect();\n\n\n\n let cards: Vec<(String, Card)> = r?;\n\n\n\n if cards.is_empty() {\n\n return Ok(vec![]);\n\n }\n\n\n\n let mut rng = SmallRng::from_entropy();\n\n\n\n let mut cards_by_deck = vec![];\n\n\n\n let mut current_deck = cards[0].0.clone();\n","file_path":"src/lib.rs","rank":62,"score":14.146993307926662},{"content":"\n\n Ok(())\n\n }\n\n\n\n pub fn answer_wrong(&mut self, card_id: u64) -> Result<()> {\n\n let now: u64 = (self.clock.now().unix_timestamp() * 1000)\n\n .try_into()\n\n .expect(\"valid timestamp\");\n\n\n\n let tx = self.conn.transaction()?;\n\n\n\n tx.execute(\n\n \"INSERT INTO Answer(cardId, isCorrect, timestamp) VALUES (?, ?, ?)\",\n\n params![card_id, false, now],\n\n )?;\n\n\n\n tx.execute(\n\n \"UPDATE Schedule SET scheduledForTimestamp = ? WHERE cardId = ?\",\n\n params![now, card_id],\n\n )?;\n","file_path":"src/lib.rs","rank":63,"score":13.937287493738133},{"content":" FROM Card JOIN Schedule ON Card.id = Schedule.cardId\n\n WHERE Card.deckId = d.id AND scheduledForTimestamp IS NULL AND isLeech = 0) AS suspended,\n\n\n\n (SELECT COUNT(*)\n\n FROM Card JOIN Schedule ON Card.id = Schedule.cardId\n\n WHERE Card.deckId = d.id AND isLeech = 1) AS leech,\n\n\n\n (SELECT COUNT(*)\n\n FROM Card JOIN Answer ON Card.id = Answer.cardId\n\n WHERE Card.deckId = d.id AND isCorrect = 1 AND Answer.timestamp > :accuracySinceTimestamp) AS correct,\n\n\n\n (SELECT COUNT(*)\n\n FROM Card JOIN Answer ON Card.id = Answer.cardId\n\n WHERE Card.deckId = d.id AND isCorrect = 0 AND Answer.timestamp > :accuracySinceTimestamp) AS wrong\n\n FROM Deck AS d\n\n ORDER BY name\n\n \"\n\n )?;\n\n let iter = stmt.query_map([self.thirty_days_ago()?], |row| {\n\n Ok(DeckStats {\n","file_path":"src/lib.rs","rank":64,"score":13.818875460281637},{"content":" use anyhow::anyhow;\n\n use std::cell::Cell;\n\n use std::rc::Rc;\n\n use time::OffsetDateTime;\n\n\n\n struct DoublingSchedule;\n\n\n\n impl Schedule for DoublingSchedule {\n\n fn next_interval(\n\n &mut self,\n\n previous_interval: u16,\n\n was_correct: Option<bool>,\n\n interval_modifier: u16,\n\n ) -> u16 {\n\n match was_correct {\n\n Some(true) => {\n\n (previous_interval as f64 * 2.0 * (interval_modifier as f64 / 100.0)) as u16\n\n }\n\n Some(false) => previous_interval / 2,\n\n None => 1,\n","file_path":"src/lib.rs","rank":65,"score":13.774828641926991},{"content":" },\n\n \"edit\" => Subcommand::Edit {\n\n card_id: args.value_from_str(\"--card-id\")?,\n\n },\n\n \"init\" => Subcommand::Init,\n\n \"int-mod\" => Subcommand::IntMod {\n\n deck_id: args.value_from_str(\"--deck-id\")?,\n\n modifier: args.value_from_str(\"--modifier\")?,\n\n },\n\n \"review\" => Subcommand::Review,\n\n \"stats\" => Subcommand::Stats,\n\n \"switch\" => Subcommand::Switch {\n\n card_id: args.value_from_str(\"--card-id\")?,\n\n deck_id: args.value_from_str(\"--deck-id\")?,\n\n },\n\n _ => bail!(\"unknown subcommand\"),\n\n };\n\n\n\n let remaining = args.finish();\n\n if remaining.is_empty() {\n\n Ok(Self { subcommand, path })\n\n } else {\n\n Err(anyhow!(\n\n \"found arguments which weren't expected: {remaining:?}\"\n\n ))\n\n }\n\n }\n\n}\n\n\n","file_path":"src/opt.rs","rank":66,"score":13.705973071949474},{"content":"\n\n let subcommand = match args.subcommand()? {\n\n Some(s) => s,\n\n None => bail!(\"missing subcommand\"),\n\n };\n\n\n\n let subcommand = match subcommand.as_ref() {\n\n \"add\" => Subcommand::Add {\n\n deck_id: args.value_from_str(\"--deck-id\")?,\n\n },\n\n \"cards\" => Subcommand::Cards,\n\n \"create-deck\" => Subcommand::CreateDeck {\n\n name: args.value_from_str(\"--name\")?,\n\n },\n\n \"decks\" => Subcommand::Decks,\n\n \"delete\" => Subcommand::Delete {\n\n card_id: args.value_from_str(\"--card-id\")?,\n\n },\n\n \"delete-deck\" => Subcommand::DeleteDeck {\n\n deck_id: args.value_from_str(\"--deck-id\")?,\n","file_path":"src/opt.rs","rank":67,"score":13.676360483305178},{"content":" .query_row(\n\n \"SELECT isCorrect FROM Answer WHERE cardId = ? ORDER BY timestamp DESC LIMIT 1\",\n\n [card_id],\n\n |row| row.get(0),\n\n )\n\n .optional()?;\n\n\n\n tx.execute(\n\n \"INSERT INTO Answer(cardId, isCorrect, timestamp) VALUES (?, ?, ?)\",\n\n params![card_id, true, now],\n\n )?;\n\n\n\n let interval_modifier: u16 = tx.query_row(\n\n \"SELECT intervalModifier FROM Deck JOIN Card ON Deck.id = Card.deckId WHERE Card.id = ?\",\n\n [card_id],\n\n |row| row.get(0),\n\n )?;\n\n\n\n let num_days = self\n\n .schedule\n","file_path":"src/lib.rs","rank":68,"score":13.231465874948888},{"content":" Ok(())\n\n }\n\n\n\n pub fn card_previews(&self) -> Result<Vec<CardPreview>> {\n\n let mut stmt = self.conn.prepare(\n\n \"\n\n SELECT id, front, isLeech\n\n FROM Card\n\n JOIN Schedule ON Card.id = Schedule.cardId\n\n ORDER BY isLeech DESC, creationTimestamp DESC;\n\n \",\n\n )?;\n\n\n\n let iter = stmt.query_map([], |row| {\n\n Ok(CardPreview {\n\n id: row.get(0)?,\n\n front: row.get(1)?,\n\n is_leech: row.get(2)?,\n\n })\n\n })?;\n","file_path":"src/lib.rs","rank":69,"score":12.407181006075456},{"content":" )?;\n\n srs.init()?;\n\n\n\n Ok((srs, now))\n\n }\n\n\n\n #[test]\n\n fn empty_db() -> Result<()> {\n\n let (srs, _) = new_srs()?;\n\n\n\n assert_eq!(srs.decks()?.len(), 0);\n\n assert_eq!(srs.card_previews()?.len(), 0);\n\n assert_eq!(srs.cards_to_review()?.len(), 0);\n\n\n\n let (global_stats, deck_stats) = srs.stats()?;\n\n assert_eq!(\n\n global_stats,\n\n GlobalStats {\n\n active: 0,\n\n suspended: 0,\n","file_path":"src/lib.rs","rank":70,"score":11.848262055644541},{"content":" let mut current_cards = vec![];\n\n for (deck_name, card) in cards {\n\n if deck_name != current_deck {\n\n let old_deck_name = std::mem::take(&mut current_deck);\n\n let mut cards = std::mem::take(&mut current_cards);\n\n\n\n current_deck = deck_name.clone();\n\n\n\n cards.shuffle(&mut rng);\n\n cards_by_deck.push((old_deck_name, cards));\n\n }\n\n\n\n current_cards.push(card);\n\n }\n\n\n\n current_cards.shuffle(&mut rng);\n\n cards_by_deck.push((current_deck, current_cards));\n\n\n\n Ok(cards_by_deck)\n\n }\n","file_path":"src/lib.rs","rank":71,"score":11.562330745250605},{"content":" delete\n\n delete-deck\n\n edit\n\n init\n\n int-mod\n\n review\n\n stats\n\n switch\"#,\n\n name = env!(\"CARGO_PKG_NAME\"),\n\n version = env!(\"CARGO_PKG_VERSION\"),\n\n );\n\n}\n","file_path":"src/opt.rs","rank":72,"score":11.019950430708057},{"content":" let global_stats = self.conn.query_row(\n\n \"\n\n SELECT\n\n (SELECT COUNT(*)\n\n FROM Card JOIN Schedule ON Card.id = Schedule.cardId\n\n WHERE scheduledForTimestamp IS NOT NULL AND isLeech = 0) AS active,\n\n\n\n (SELECT COUNT(*)\n\n FROM Card JOIN Schedule ON Card.id = Schedule.cardId\n\n WHERE scheduledForTimestamp IS NULL AND isLeech = 0) AS suspended,\n\n\n\n (SELECT COUNT(*)\n\n FROM Card JOIN Schedule ON Card.id = Schedule.cardId\n\n WHERE isLeech = 1) AS leech,\n\n\n\n (SELECT COUNT(*)\n\n FROM Schedule\n\n WHERE scheduledForTimestamp < :reviewSpanEnd) AS forReview\n\n \",\n\n [self.end_of_tomorrow()?],\n","file_path":"src/lib.rs","rank":73,"score":10.84638703836571},{"content":" struct NotRandom;\n\n\n\n impl RngCore for NotRandom {\n\n fn next_u32(&mut self) -> u32 {\n\n self.next_u64() as u32\n\n }\n\n\n\n fn next_u64(&mut self) -> u64 {\n\n 0\n\n }\n\n\n\n fn fill_bytes(&mut self, dest: &mut [u8]) {\n\n dest.fill(0);\n\n }\n\n\n\n fn try_fill_bytes(&mut self, dest: &mut [u8]) -> Result<(), rand::Error> {\n\n Ok(self.fill_bytes(dest))\n\n }\n\n }\n\n\n","file_path":"src/schedule.rs","rank":74,"score":10.772502659801669},{"content":"\n\n if self.rng.gen() {\n\n next += fuzz;\n\n } else {\n\n next -= fuzz;\n\n }\n\n\n\n next\n\n } else {\n\n // Previous answer was wrong\n\n std::cmp::max(1, (previous_interval as f64 * WRONG_ANSWER_PENALTY) as u16)\n\n }\n\n }\n\n }\n\n }\n\n}\n\n\n\nimpl LowKeyAnki {\n\n pub fn new() -> Self {\n\n Self {\n","file_path":"src/schedule.rs","rank":75,"score":10.368513999587542},{"content":" .next_interval(interval_days, was_correct, interval_modifier);\n\n\n\n if num_days >= AUTO_SUSPEND_INTERVAL {\n\n tx.execute(\n\n \"UPDATE Schedule SET scheduledForTimestamp = ?, intervalDays = ? WHERE cardId = ?\",\n\n params![Null, Null, card_id],\n\n )?;\n\n } else {\n\n let num_days_ms: u64 = Duration::days(num_days.into())\n\n .whole_milliseconds()\n\n .try_into()\n\n .expect(\"valid duration\");\n\n\n\n tx.execute(\n\n \"UPDATE Schedule SET scheduledForTimestamp = ?, intervalDays = ? WHERE cardId = ?\",\n\n params![now + num_days_ms, num_days, card_id],\n\n )?;\n\n }\n\n\n\n tx.commit()?;\n","file_path":"src/lib.rs","rank":76,"score":10.215788162175485},{"content":" offset: UtcOffset::current_local_offset()?,\n\n })\n\n }\n\n\n\n #[cfg(test)]\n\n fn open_in_memory(schedule: Box<dyn Schedule>, clock: Box<dyn Clock>) -> Result<Self> {\n\n let conn = Connection::open_in_memory()?;\n\n\n\n conn.set_db_config(DbConfig::SQLITE_DBCONFIG_ENABLE_FKEY, true)?;\n\n\n\n Ok(Self {\n\n conn,\n\n clock,\n\n schedule,\n\n offset: UtcOffset::UTC,\n\n })\n\n }\n\n\n\n pub fn init(&mut self) -> Result<()> {\n\n self.conn.execute_batch(include_str!(\"schema.sql\"))?;\n","file_path":"src/lib.rs","rank":77,"score":9.532024628657458},{"content":"\n\n assert_eq!(next, 4);\n\n }\n\n\n\n #[test]\n\n fn apply_wrong_penalty() {\n\n let mut schedule = new_schedule();\n\n\n\n let next = schedule.next_interval(50, Some(false), 100);\n\n\n\n assert_eq!(next, (50 as f64 * WRONG_ANSWER_PENALTY) as u16);\n\n }\n\n\n\n #[test]\n\n fn correct_answer() {\n\n let mut schedule = new_schedule();\n\n\n\n let next = schedule.next_interval(50, Some(true), 100);\n\n\n\n assert_eq!(next, 125);\n","file_path":"src/schedule.rs","rank":78,"score":9.32428515193502},{"content":"\n\n let forward_by_days = move |days| {\n\n now.set(now.get() + Duration::days(days));\n\n };\n\n\n\n srs.answer_correct(card.id)?;\n\n\n\n forward_by_days(1);\n\n assert_scheduled(&srs, &card);\n\n\n\n srs.answer_correct(card.id)?;\n\n\n\n forward_by_days(2);\n\n assert_scheduled(&srs, &card);\n\n\n\n srs.answer_correct(card.id)?;\n\n\n\n forward_by_days(4);\n\n assert_scheduled(&srs, &card);\n\n\n","file_path":"src/lib.rs","rank":79,"score":9.053682827904979},{"content":" }\n\n\n\n #[test]\n\n fn increase_by_interval_modifier() {\n\n let mut schedule = new_schedule();\n\n\n\n let next = schedule.next_interval(50, Some(true), 200);\n\n\n\n assert_eq!(next, 250);\n\n }\n\n\n\n #[test]\n\n #[should_panic]\n\n fn expect_previous_answer_for_large_interval() {\n\n let mut schedule = new_schedule();\n\n\n\n schedule.next_interval(50, None, 200);\n\n }\n\n}\n","file_path":"src/schedule.rs","rank":80,"score":8.42774875075945},{"content":" }\n\n\n\n fn thirty_days_ago(&self) -> Result<u64> {\n\n let now = self.clock.now().to_offset(self.offset);\n\n let end_of_tomorrow = now\n\n .date()\n\n .saturating_sub(Duration::days(30))\n\n .with_hms(0, 0, 0)\n\n .expect(\"valid time\")\n\n .assume_offset(now.offset());\n\n\n\n Ok((end_of_tomorrow.unix_timestamp() * 1000)\n\n .try_into()\n\n .expect(\"valid timestamp\"))\n\n }\n\n}\n\n\n\n#[cfg(test)]\n\nmod tests {\n\n use super::*;\n","file_path":"src/lib.rs","rank":81,"score":8.047804180124718},{"content":" if args.contains([\"-h\", \"--help\"]) {\n\n print_help();\n\n process::exit(0);\n\n }\n\n\n\n if args.contains([\"-V\", \"--version\"]) {\n\n println!(\"{} {}\", env!(\"CARGO_PKG_NAME\"), env!(\"CARGO_PKG_VERSION\"));\n\n process::exit(0);\n\n }\n\n\n\n Self::parse(args).unwrap_or_else(|e| {\n\n eprintln!(\"error: {e}\");\n\n process::exit(1);\n\n })\n\n }\n\n\n\n fn parse(mut args: Arguments) -> Result<Self> {\n\n let path = args\n\n .opt_value_from_os_str([\"-p\", \"--path\"], |p| Ok::<_, Infallible>(PathBuf::from(p)))?\n\n .unwrap_or_else(|| PathBuf::from(\"srs.db\"));\n","file_path":"src/opt.rs","rank":82,"score":7.707910036704245},{"content":" srs.answer_wrong(card.id)?;\n\n\n\n forward_by_days(2);\n\n assert_scheduled(&srs, &card);\n\n\n\n Ok(())\n\n }\n\n\n\n fn assert_scheduled(srs: &Srs, card: &Card) {\n\n let found = srs\n\n .cards_to_review()\n\n .unwrap()\n\n .iter()\n\n .flat_map(|(_, c)| c)\n\n .any(|c| c.id == card.id);\n\n\n\n assert!(found, \"card isn't scheduled for review\")\n\n }\n\n\n\n fn assert_not_scheduled(srs: &Srs, card: &Card) {\n","file_path":"src/lib.rs","rank":83,"score":7.692145798532103},{"content":" rng: Box::new(SmallRng::from_entropy()),\n\n }\n\n }\n\n\n\n fn fuzz_factor(&self, previous_interval: u16) -> f64 {\n\n if previous_interval < 7 {\n\n 0.25\n\n } else if previous_interval < 30 {\n\n 0.15\n\n } else {\n\n 0.05\n\n }\n\n }\n\n}\n\n\n\n#[cfg(test)]\n\nmod tests {\n\n use super::*;\n\n use rand::RngCore;\n\n\n","file_path":"src/schedule.rs","rank":84,"score":7.390128875019457},{"content":" .expect(\"valid time\")\n\n .assume_offset(now.offset());\n\n\n\n Ok((start_of_tomorrow.unix_timestamp() * 1000)\n\n .try_into()\n\n .expect(\"valid timestamp\"))\n\n }\n\n\n\n fn end_of_tomorrow(&self) -> Result<u64> {\n\n let now = self.clock.now().to_offset(self.offset);\n\n let end_of_tomorrow = now\n\n .date()\n\n .saturating_add(Duration::days(1))\n\n .with_hms(23, 59, 59)\n\n .expect(\"valid time\")\n\n .assume_offset(now.offset());\n\n\n\n Ok((end_of_tomorrow.unix_timestamp() * 1000)\n\n .try_into()\n\n .expect(\"valid timestamp\"))\n","file_path":"src/lib.rs","rank":85,"score":7.223566434901854},{"content":" fn new_schedule() -> LowKeyAnki {\n\n LowKeyAnki {\n\n rng: Box::new(NotRandom),\n\n }\n\n }\n\n\n\n #[test]\n\n fn first_answer() {\n\n let mut schedule = new_schedule();\n\n\n\n let next = schedule.next_interval(0, None, 100);\n\n\n\n assert_eq!(next, 1);\n\n }\n\n\n\n #[test]\n\n fn first_review() {\n\n let mut schedule = new_schedule();\n\n\n\n let next = schedule.next_interval(1, Some(true), 100);\n","file_path":"src/schedule.rs","rank":86,"score":7.076877623402342},{"content":"use anyhow::anyhow;\n\nuse anyhow::bail;\n\nuse anyhow::Result;\n\nuse pico_args::Arguments;\n\nuse std::convert::Infallible;\n\nuse std::path::PathBuf;\n\nuse std::process;\n\n\n\n/// Contains parsed command line arguments.\n\n#[derive(Debug)]\n\npub struct Opt {\n\n /// The subcommand to run.\n\n pub subcommand: Subcommand,\n\n\n\n /// The path of the database file. Defaults to srs.db.\n\n pub path: PathBuf,\n\n}\n\n\n\n#[derive(Debug)]\n\npub enum Subcommand {\n","file_path":"src/opt.rs","rank":87,"score":6.876646999167267},{"content":"mod app;\n\nmod opt;\n\n\n\nuse crate::app::App;\n\nuse anyhow::Result;\n\nuse srs_cli::Srs;\n\nuse std::io;\n\n\n","file_path":"src/main.rs","rank":88,"score":5.2010566071076045},{"content":"mod clock;\n\nmod schedule;\n\n\n\nuse anyhow::bail;\n\nuse anyhow::Result;\n\nuse clock::Clock;\n\nuse rand::rngs::SmallRng;\n\nuse rand::seq::SliceRandom;\n\nuse rand::SeedableRng;\n\nuse rusqlite::config::DbConfig;\n\nuse rusqlite::params;\n\nuse rusqlite::types::Null;\n\nuse rusqlite::Connection;\n\nuse rusqlite::OptionalExtension;\n\nuse schedule::LowKeyAnki;\n\nuse schedule::Schedule;\n\nuse std::path::Path;\n\nuse time::Duration;\n\nuse time::UtcOffset;\n\n\n","file_path":"src/lib.rs","rank":89,"score":4.61901700455926},{"content":"use rand::rngs::SmallRng;\n\nuse rand::Rng;\n\nuse rand::SeedableRng;\n\n\n","file_path":"src/schedule.rs","rank":90,"score":3.4303782568202363},{"content":"use time::OffsetDateTime;\n\n\n","file_path":"src/clock.rs","rank":91,"score":2.883508049630299},{"content":" }\n\n }\n\n }\n\n\n\n struct TimeMachine {\n\n now: Rc<Cell<OffsetDateTime>>,\n\n }\n\n\n\n impl Clock for TimeMachine {\n\n fn now(&self) -> OffsetDateTime {\n\n self.now.get()\n\n }\n\n }\n\n\n\n fn new_srs() -> Result<(Srs, Rc<Cell<OffsetDateTime>>)> {\n\n let now = Rc::new(Cell::new(OffsetDateTime::UNIX_EPOCH + Duration::weeks(10)));\n\n\n\n let mut srs = Srs::open_in_memory(\n\n Box::new(DoublingSchedule),\n\n Box::new(TimeMachine { now: now.clone() }),\n","file_path":"src/lib.rs","rank":92,"score":2.1039826558405785}],"string":"[\n {\n \"content\": \"CREATE INDEX cardDeckId ON Card(deckId);\\n\\n\\n\",\n \"file_path\": \"src/schema.sql\",\n \"rank\": 1,\n \"score\": 80076.39999327567\n },\n {\n \"content\": \"CREATE INDEX answerCardId ON Answer(cardId);\\n\",\n \"file_path\": \"src/schema.sql\",\n \"rank\": 2,\n \"score\": 80021.74427068235\n },\n {\n \"content\": \"fn main() -> Result<()> {\\n\\n let opt = opt::Opt::from_args();\\n\\n\\n\\n let srs = Srs::open(&opt.path)?;\\n\\n\\n\\n let stdout = std::io::stdout();\\n\\n let stdout = stdout.lock();\\n\\n\\n\\n let mut app = App::new(srs, stdout);\\n\\n\\n\\n use opt::Subcommand::*;\\n\\n\\n\\n let result = match &opt.subcommand {\\n\\n Add { deck_id } => app.add(*deck_id),\\n\\n\\n\\n Cards => app.cards(),\\n\\n\\n\\n CreateDeck { name } => app.create_deck(name),\\n\\n\\n\\n Decks => app.decks(),\\n\",\n \"file_path\": \"src/main.rs\",\n \"rank\": 3,\n \"score\": 68164.774677154\n },\n {\n \"content\": \"CREATE TABLE Deck(\\n\\n id INTEGER PRIMARY KEY,\\n\\n name TEXT NOT NULL,\\n\\n creationTimestamp INTEGER NOT NULL, -- In milliseconds since Unix epoch\\n\\n intervalModifier INTEGER NOT NULL DEFAULT 100\\n\\n);\\n\\n\\n\",\n \"file_path\": \"src/schema.sql\",\n \"rank\": 4,\n \"score\": 54020.32369988704\n },\n {\n \"content\": \"CREATE TABLE Answer(\\n\\n cardId INTEGER NOT NULL REFERENCES Card(id) ON DELETE CASCADE,\\n\\n isCorrect INTEGER NOT NULL,\\n\\n timestamp INTEGER NOT NULL -- In milliseconds since Unix epoch\\n\\n);\\n\\n\\n\",\n \"file_path\": \"src/schema.sql\",\n \"rank\": 5,\n \"score\": 53267.65386082508\n },\n {\n \"content\": \"CREATE TABLE Card(\\n\\n id INTEGER PRIMARY KEY,\\n\\n deckId INTEGER NOT NULL REFERENCES Deck(id) ON DELETE CASCADE,\\n\\n front TEXT NOT NULL,\\n\\n back TEXT NOT NULL,\\n\\n creationTimestamp INTEGER NOT NULL -- In milliseconds since Unix epoch\\n\\n);\\n\\n\\n\",\n \"file_path\": \"src/schema.sql\",\n \"rank\": 6,\n \"score\": 53219.18314268129\n },\n {\n \"content\": \"CREATE INDEX answerTimestamp ON Answer(timestamp);\\n\\n\\n\",\n \"file_path\": \"src/schema.sql\",\n \"rank\": 7,\n \"score\": 50505.82264106586\n },\n {\n \"content\": \"CREATE INDEX cardCreationTimestamp ON Card(creationTimestamp);\\n\",\n \"file_path\": \"src/schema.sql\",\n \"rank\": 8,\n \"score\": 46834.992761573\n },\n {\n \"content\": \"CREATE INDEX scheduleIsLeech ON Schedule(isLeech);\\n\",\n \"file_path\": \"src/schema.sql\",\n \"rank\": 9,\n \"score\": 39931.60286340858\n },\n {\n \"content\": \"fn print_help() {\\n\\n println!(\\n\\n r#\\\"{name} {version}\\n\\nSpaced repetition at the command line\\n\\n\\n\\nUSAGE:\\n\\n {name} [OPTIONS]\\n\\n\\n\\nFLAGS:\\n\\n -h, --help Prints help information\\n\\n -V, --version Prints version information\\n\\n\\n\\nOPTIONS:\\n\\n -p, --path <PATH> The path of the database file [default: srs.db]\\n\\n\\n\\nSUBCOMMANDS:\\n\\n add\\n\\n cards\\n\\n create-deck\\n\\n decks\\n\",\n \"file_path\": \"src/opt.rs\",\n \"rank\": 11,\n \"score\": 35589.71342558448\n },\n {\n \"content\": \"pub trait Clock {\\n\\n fn now(&self) -> OffsetDateTime;\\n\\n}\\n\\n\\n\\npub struct UtcClock;\\n\\n\\n\\nimpl Clock for UtcClock {\\n\\n fn now(&self) -> OffsetDateTime {\\n\\n OffsetDateTime::now_utc()\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/clock.rs\",\n \"rank\": 12,\n \"score\": 34282.6528039226\n },\n {\n \"content\": \"pub trait Schedule {\\n\\n fn next_interval(\\n\\n &mut self,\\n\\n previous_interval: u16,\\n\\n was_correct: Option<bool>,\\n\\n interval_modifier: u16,\\n\\n ) -> u16;\\n\\n}\\n\\n\\n\\nconst WRONG_ANSWER_PENALTY: f64 = 0.7;\\n\\n\\n\\npub struct LowKeyAnki {\\n\\n rng: Box<dyn rand::RngCore>,\\n\\n}\\n\\n\\n\\nimpl Schedule for LowKeyAnki {\\n\\n fn next_interval(\\n\\n &mut self,\\n\\n previous_interval: u16,\\n\\n was_correct: Option<bool>,\\n\",\n \"file_path\": \"src/schedule.rs\",\n \"rank\": 13,\n \"score\": 34282.6528039226\n },\n {\n \"content\": \"CREATE TABLE Schedule(\\n\\n cardId INTEGER PRIMARY KEY REFERENCES Card(id) ON DELETE CASCADE,\\n\\n scheduledForTimestamp INTEGER, -- In milliseconds since Unix epoch, NULL when suspended\\n\\n intervalDays INTEGER, -- 0 for new cards, NULL when suspended\\n\\n isLeech INTEGER NOT NULL DEFAULT 0\\n\\n);\\n\\n\\n\",\n \"file_path\": \"src/schema.sql\",\n \"rank\": 14,\n \"score\": 19385.53198759368\n },\n {\n \"content\": \"CREATE INDEX scheduleScheduledForTimestamp ON Schedule(scheduledForTimestamp);\\n\",\n \"file_path\": \"src/schema.sql\",\n \"rank\": 15,\n \"score\": 14233.971768350631\n },\n {\n \"content\": \" pub id: u64,\\n\\n pub front: String,\\n\\n pub back: String,\\n\\n}\\n\\n\\n\\n#[derive(Debug)]\\n\\npub struct CardPreview {\\n\\n pub id: u64,\\n\\n pub front: String,\\n\\n pub is_leech: bool,\\n\\n}\\n\\n\\n\\n#[derive(Debug, PartialEq)]\\n\\npub struct GlobalStats {\\n\\n pub active: u32,\\n\\n pub suspended: u32,\\n\\n pub leech: u16,\\n\\n pub for_review: u16,\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/lib.rs\",\n \"rank\": 25,\n \"score\": 24.028181250930984\n },\n {\n \"content\": \" .into_iter()\\n\\n .next()\\n\\n .ok_or(anyhow!(\\\"nothing to review\\\"))?;\\n\\n assert_eq!(for_review, (\\\"testName\\\".to_string(), vec![card]));\\n\\n\\n\\n Ok(())\\n\\n }\\n\\n\\n\\n #[test]\\n\\n fn answering_correct_increases_interval() -> Result<()> {\\n\\n let (mut srs, now) = new_srs()?;\\n\\n\\n\\n let deck = create_and_return_deck(&mut srs, \\\"testName\\\")?;\\n\\n let card = create_and_return_card(&mut srs, &deck, \\\"front\\\", \\\"back\\\")?;\\n\\n\\n\\n let intervals = [0, 1, 2, 4, 8, 16, 32, 64, 128, 256];\\n\\n\\n\\n for next_interval in intervals {\\n\\n now.set(now.get() + Duration::days(next_interval));\\n\\n assert_scheduled(&srs, &card);\\n\",\n \"file_path\": \"src/lib.rs\",\n \"rank\": 26,\n \"score\": 23.857140279203072\n },\n {\n \"content\": \" self.conn.execute(\\\"DELETE FROM Card WHERE id = ?\\\", [id])?;\\n\\n\\n\\n Ok(())\\n\\n }\\n\\n\\n\\n pub fn update_card(&mut self, id: u64, front: String, back: String) -> Result<()> {\\n\\n self.conn.execute(\\n\\n \\\"UPDATE Card SET front=?, back=? WHERE id=?\\\",\\n\\n params![front, back, id],\\n\\n )?;\\n\\n\\n\\n Ok(())\\n\\n }\\n\\n\\n\\n pub fn switch_deck(&mut self, card_id: u64, deck_id: u64) -> Result<()> {\\n\\n self.conn.execute(\\n\\n \\\"UPDATE Card SET deckId = ? WHERE id = ?\\\",\\n\\n [deck_id, card_id],\\n\\n )?;\\n\\n\\n\",\n \"file_path\": \"src/lib.rs\",\n \"rank\": 27,\n \"score\": 23.674838300485817\n },\n {\n \"content\": \"\\n\\n srs.answer_correct(card.id)?;\\n\\n }\\n\\n\\n\\n now.set(now.get() + Duration::days(1024));\\n\\n assert_not_scheduled(&srs, &card); // auto-suspend\\n\\n\\n\\n Ok(())\\n\\n }\\n\\n\\n\\n #[test]\\n\\n fn answering_correct_increases_interval_with_interval_modifier() -> Result<()> {\\n\\n let (mut srs, now) = new_srs()?;\\n\\n\\n\\n let deck = create_and_return_deck(&mut srs, \\\"testName\\\")?;\\n\\n srs.update_interval_modifier(deck.id, 200)?;\\n\\n\\n\\n let card = create_and_return_card(&mut srs, &deck, \\\"front\\\", \\\"back\\\")?;\\n\\n\\n\\n let intervals = [0, 1, 4, 16, 64, 256];\\n\",\n \"file_path\": \"src/lib.rs\",\n \"rank\": 28,\n \"score\": 23.609862635341145\n },\n {\n \"content\": \" correct: 0,\\n\\n wrong: 0,\\n\\n },\\n\\n DeckStats {\\n\\n name: \\\"testName\\\".to_string(),\\n\\n active: 0,\\n\\n suspended: 0,\\n\\n leech: 0,\\n\\n correct: 0,\\n\\n wrong: 0,\\n\\n }\\n\\n ],\\n\\n );\\n\\n\\n\\n Ok(())\\n\\n }\\n\\n\\n\\n #[test]\\n\\n fn delete_card() -> Result<()> {\\n\\n let (mut srs, _) = new_srs()?;\\n\",\n \"file_path\": \"src/lib.rs\",\n \"rank\": 29,\n \"score\": 23.204658749300666\n },\n {\n \"content\": \" let card = create_and_return_card(&mut srs, &deck, \\\"front\\\", \\\"back\\\")?;\\n\\n\\n\\n srs.switch_deck(card.id, deck2.id)?;\\n\\n\\n\\n let for_review = srs\\n\\n .cards_to_review()?\\n\\n .into_iter()\\n\\n .next()\\n\\n .ok_or(anyhow!(\\\"nothing to review\\\"))?;\\n\\n assert_eq!(for_review, (\\\"another deck\\\".to_string(), vec![card]));\\n\\n\\n\\n let (_, deck_stats) = srs.stats()?;\\n\\n assert_eq!(\\n\\n deck_stats,\\n\\n vec![\\n\\n DeckStats {\\n\\n name: \\\"another deck\\\".to_string(),\\n\\n active: 1,\\n\\n suspended: 0,\\n\\n leech: 0,\\n\",\n \"file_path\": \"src/lib.rs\",\n \"rank\": 30,\n \"score\": 22.14328838630124\n },\n {\n \"content\": \" assert_eq!(\\n\\n deck_stats,\\n\\n vec![DeckStats {\\n\\n name: \\\"testName\\\".to_string(),\\n\\n active: 1,\\n\\n suspended: 0,\\n\\n leech: 0,\\n\\n correct: 0,\\n\\n wrong: 0,\\n\\n }],\\n\\n );\\n\\n\\n\\n Ok(())\\n\\n }\\n\\n\\n\\n #[test]\\n\\n fn edit_card() -> Result<()> {\\n\\n let (mut srs, _) = new_srs()?;\\n\\n\\n\\n let deck = create_and_return_deck(&mut srs, \\\"testName\\\")?;\\n\",\n \"file_path\": \"src/lib.rs\",\n \"rank\": 32,\n \"score\": 21.79795197820025\n },\n {\n \"content\": \"\\n\\n srs.answer_correct(card.id)?;\\n\\n\\n\\n let for_review = srs.cards_to_review()?;\\n\\n assert_eq!(for_review.len(), 0);\\n\\n\\n\\n Ok(())\\n\\n }\\n\\n\\n\\n #[test]\\n\\n fn answering_wrong_leaves_card_in_queue() -> Result<()> {\\n\\n let (mut srs, _) = new_srs()?;\\n\\n\\n\\n let deck = create_and_return_deck(&mut srs, \\\"testName\\\")?;\\n\\n let card = create_and_return_card(&mut srs, &deck, \\\"front\\\", \\\"back\\\")?;\\n\\n\\n\\n srs.answer_wrong(card.id)?;\\n\\n\\n\\n let for_review = srs\\n\\n .cards_to_review()?\\n\",\n \"file_path\": \"src/lib.rs\",\n \"rank\": 33,\n \"score\": 21.15250234623192\n },\n {\n \"content\": \" Add { deck_id: u64 },\\n\\n Cards,\\n\\n CreateDeck { name: String },\\n\\n Decks,\\n\\n Delete { card_id: u64 },\\n\\n DeleteDeck { deck_id: u64 },\\n\\n Edit { card_id: u64 },\\n\\n Init,\\n\\n IntMod { deck_id: u64, modifier: u16 },\\n\\n Review,\\n\\n Stats,\\n\\n Switch { card_id: u64, deck_id: u64 },\\n\\n}\\n\\n\\n\\nimpl Opt {\\n\\n /// Gets [Opt] from the command line arguments. Prints the error message\\n\\n /// and quits the program in case of failure.\\n\\n pub fn from_args() -> Self {\\n\\n let mut args = Arguments::from_env();\\n\\n\\n\",\n \"file_path\": \"src/opt.rs\",\n \"rank\": 34,\n \"score\": 21.056297481043877\n },\n {\n \"content\": \"\\n\\n let now: u64 = (self.clock.now().unix_timestamp() * 1000)\\n\\n .try_into()\\n\\n .expect(\\\"valid timestamp\\\");\\n\\n\\n\\n self.conn.execute(\\n\\n \\\"INSERT INTO Deck(name, creationTimestamp) VALUES (?, ?)\\\",\\n\\n params![name, now],\\n\\n )?;\\n\\n\\n\\n Ok(())\\n\\n }\\n\\n\\n\\n pub fn delete_deck(&mut self, id: u64) -> Result<()> {\\n\\n self.conn.execute(\\\"DELETE FROM Deck WHERE id = ?\\\", [id])?;\\n\\n\\n\\n Ok(())\\n\\n }\\n\\n\\n\\n pub fn update_interval_modifier(&mut self, id: u64, modifier: u16) -> Result<()> {\\n\",\n \"file_path\": \"src/lib.rs\",\n \"rank\": 35,\n \"score\": 20.899263208701548\n },\n {\n \"content\": \"\\n\\n let deck = create_and_return_deck(&mut srs, \\\"testName\\\")?;\\n\\n\\n\\n let card = create_and_return_card(&mut srs, &deck, \\\"front\\\", \\\"back\\\")?;\\n\\n\\n\\n srs.delete_card(card.id)?;\\n\\n\\n\\n let card = srs.get_card(card.id);\\n\\n\\n\\n assert!(card.is_err(), \\\"got a card {card:?}\\\");\\n\\n\\n\\n Ok(())\\n\\n }\\n\\n\\n\\n #[test]\\n\\n fn answering_correct_removes_from_queue() -> Result<()> {\\n\\n let (mut srs, _) = new_srs()?;\\n\\n\\n\\n let deck = create_and_return_deck(&mut srs, \\\"testName\\\")?;\\n\\n let card = create_and_return_card(&mut srs, &deck, \\\"front\\\", \\\"back\\\")?;\\n\",\n \"file_path\": \"src/lib.rs\",\n \"rank\": 36,\n \"score\": 20.770379033837557\n },\n {\n \"content\": \"\\n\\n for next_interval in intervals {\\n\\n now.set(now.get() + Duration::days(next_interval));\\n\\n assert_scheduled(&srs, &card);\\n\\n\\n\\n srs.answer_correct(card.id)?;\\n\\n }\\n\\n\\n\\n now.set(now.get() + Duration::days(1024));\\n\\n assert_not_scheduled(&srs, &card); // auto-suspend\\n\\n\\n\\n Ok(())\\n\\n }\\n\\n\\n\\n #[test]\\n\\n fn answering_wrong_decreases_interval() -> Result<()> {\\n\\n let (mut srs, now) = new_srs()?;\\n\\n\\n\\n let deck = create_and_return_deck(&mut srs, \\\"testName\\\")?;\\n\\n let card = create_and_return_card(&mut srs, &deck, \\\"front\\\", \\\"back\\\")?;\\n\",\n \"file_path\": \"src/lib.rs\",\n \"rank\": 37,\n \"score\": 20.622382134505955\n },\n {\n \"content\": \" assert_eq!(card.front, \\\"front\\\");\\n\\n assert_eq!(card.back, \\\"back\\\");\\n\\n\\n\\n let for_review = srs\\n\\n .cards_to_review()?\\n\\n .into_iter()\\n\\n .next()\\n\\n .ok_or(anyhow!(\\\"nothing to review\\\"))?;\\n\\n assert_eq!(for_review, (\\\"testName\\\".to_string(), vec![card]));\\n\\n\\n\\n let (global_stats, deck_stats) = srs.stats()?;\\n\\n assert_eq!(\\n\\n global_stats,\\n\\n GlobalStats {\\n\\n active: 1,\\n\\n suspended: 0,\\n\\n leech: 0,\\n\\n for_review: 1,\\n\\n }\\n\\n );\\n\",\n \"file_path\": \"src/lib.rs\",\n \"rank\": 38,\n \"score\": 20.456825340242023\n },\n {\n \"content\": \" }\\n\\n\\n\\n pub fn get_deck(&self, id: u64) -> Result<Deck> {\\n\\n Ok(self.conn.query_row(\\n\\n \\\"SELECT id, name, intervalModifier FROM Deck WHERE id = ?\\\",\\n\\n [id],\\n\\n |row| {\\n\\n Ok(Deck {\\n\\n id: row.get(0)?,\\n\\n name: row.get(1)?,\\n\\n interval_modifier: row.get(2)?,\\n\\n })\\n\\n },\\n\\n )?)\\n\\n }\\n\\n\\n\\n pub fn create_deck(&mut self, name: &str) -> Result<()> {\\n\\n if name.is_empty() {\\n\\n bail!(\\\"deck name can't be empty\\\");\\n\\n }\\n\",\n \"file_path\": \"src/lib.rs\",\n \"rank\": 39,\n \"score\": 20.33278806965535\n },\n {\n \"content\": \" fn create_and_return_card(srs: &mut Srs, deck: &Deck, front: &str, back: &str) -> Result<Card> {\\n\\n srs.create_card(deck.id, front.to_string(), back.to_string())?;\\n\\n\\n\\n let preview = srs\\n\\n .card_previews()?\\n\\n .into_iter()\\n\\n .next()\\n\\n .ok_or(anyhow!(\\\"no cards\\\"))?;\\n\\n\\n\\n srs.get_card(preview.id)\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/lib.rs\",\n \"rank\": 41,\n \"score\": 20.231896705571025\n },\n {\n \"content\": \" let deck = create_and_return_deck(&mut srs, \\\"testName\\\")?;\\n\\n\\n\\n srs.delete_deck(deck.id)?;\\n\\n\\n\\n assert_eq!(srs.decks()?.len(), 0);\\n\\n\\n\\n let (_, deck_stats) = srs.stats()?;\\n\\n assert_eq!(deck_stats.len(), 0);\\n\\n\\n\\n Ok(())\\n\\n }\\n\\n\\n\\n #[test]\\n\\n fn create_card() -> Result<()> {\\n\\n let (mut srs, _) = new_srs()?;\\n\\n\\n\\n let deck = create_and_return_deck(&mut srs, \\\"testName\\\")?;\\n\\n\\n\\n let card = create_and_return_card(&mut srs, &deck, \\\"front\\\", \\\"back\\\")?;\\n\\n\\n\",\n \"file_path\": \"src/lib.rs\",\n \"rank\": 42,\n \"score\": 19.809296519559535\n },\n {\n \"content\": \" \\\"\\n\\n SELECT id, front, back\\n\\n FROM Card\\n\\n WHERE id = ?\\n\\n \\\",\\n\\n [id],\\n\\n |row| {\\n\\n Ok(Card {\\n\\n id: row.get(0)?,\\n\\n front: row.get(1)?,\\n\\n back: row.get(2)?,\\n\\n })\\n\\n },\\n\\n )?)\\n\\n }\\n\\n\\n\\n pub fn create_card(&mut self, deck_id: u64, front: String, back: String) -> Result<()> {\\n\\n let tx = self.conn.transaction()?;\\n\\n\\n\\n let now: u64 = (self.clock.now().unix_timestamp() * 1000)\\n\",\n \"file_path\": \"src/lib.rs\",\n \"rank\": 43,\n \"score\": 19.701006503843356\n },\n {\n \"content\": \" let found = srs\\n\\n .cards_to_review()\\n\\n .unwrap()\\n\\n .iter()\\n\\n .flat_map(|(_, c)| c)\\n\\n .any(|c| c.id == card.id);\\n\\n\\n\\n assert!(!found, \\\"card is scheduled for review\\\")\\n\\n }\\n\\n\\n\\n #[test]\\n\\n fn mark_leech_after_too_many_wrong_answers() -> Result<()> {\\n\\n let (mut srs, _) = new_srs()?;\\n\\n\\n\\n let deck = create_and_return_deck(&mut srs, \\\"testName\\\")?;\\n\\n let card = create_and_return_card(&mut srs, &deck, \\\"front\\\", \\\"back\\\")?;\\n\\n\\n\\n for _ in 1..=WRONG_ANSWERS_FOR_LEECH {\\n\\n srs.answer_wrong(card.id)?;\\n\\n }\\n\",\n \"file_path\": \"src/lib.rs\",\n \"rank\": 44,\n \"score\": 19.618234464878594\n },\n {\n \"content\": \"#[derive(Debug, PartialEq)]\\n\\npub struct DeckStats {\\n\\n pub name: String,\\n\\n pub active: u32,\\n\\n pub suspended: u32,\\n\\n pub leech: u16,\\n\\n pub correct: u16,\\n\\n pub wrong: u16,\\n\\n}\\n\\n\\n\\nimpl Srs {\\n\\n pub fn open(db_path: &Path) -> Result<Self> {\\n\\n let conn = Connection::open(db_path)?;\\n\\n\\n\\n conn.set_db_config(DbConfig::SQLITE_DBCONFIG_ENABLE_FKEY, true)?;\\n\\n\\n\\n Ok(Self {\\n\\n conn,\\n\\n clock: Box::new(clock::UtcClock),\\n\\n schedule: Box::new(LowKeyAnki::new()),\\n\",\n \"file_path\": \"src/lib.rs\",\n \"rank\": 45,\n \"score\": 19.517754187170876\n },\n {\n \"content\": \"\\n\\n let for_review = srs.cards_to_review()?;\\n\\n assert_eq!(for_review.len(), 0);\\n\\n\\n\\n let preview = srs\\n\\n .card_previews()?\\n\\n .into_iter()\\n\\n .next()\\n\\n .ok_or(anyhow!(\\\"no cards\\\"))?;\\n\\n assert!(preview.is_leech);\\n\\n\\n\\n Ok(())\\n\\n }\\n\\n\\n\\n fn create_and_return_deck(srs: &mut Srs, name: &str) -> Result<Deck> {\\n\\n srs.create_deck(name)?;\\n\\n\\n\\n srs.decks()?.pop().ok_or(anyhow!(\\\"no decks\\\"))\\n\\n }\\n\\n\\n\",\n \"file_path\": \"src/lib.rs\",\n \"rank\": 46,\n \"score\": 19.06858558227412\n },\n {\n \"content\": \"const MIN_INTERVAL_MODIFIER: u16 = 50;\\n\\nconst AUTO_SUSPEND_INTERVAL: u16 = 365;\\n\\nconst WRONG_ANSWERS_FOR_LEECH: u16 = 4;\\n\\n\\n\\npub struct Srs {\\n\\n conn: Connection,\\n\\n schedule: Box<dyn Schedule>,\\n\\n clock: Box<dyn Clock>,\\n\\n offset: UtcOffset,\\n\\n}\\n\\n\\n\\n#[derive(Debug, PartialEq)]\\n\\npub struct Deck {\\n\\n pub id: u64,\\n\\n pub name: String,\\n\\n pub interval_modifier: u16,\\n\\n}\\n\\n\\n\\n#[derive(Debug, PartialEq)]\\n\\npub struct Card {\\n\",\n \"file_path\": \"src/lib.rs\",\n \"rank\": 47,\n \"score\": 19.01702283276035\n },\n {\n \"content\": \"\\n\\n let num_wrong: u16 = tx.query_row(\\n\\n \\\"SELECT COUNT(*) FROM Answer WHERE cardId = ? AND isCorrect = 0\\\",\\n\\n [card_id],\\n\\n |row| row.get(0),\\n\\n )?;\\n\\n\\n\\n if num_wrong >= WRONG_ANSWERS_FOR_LEECH {\\n\\n tx.execute(\\n\\n \\\"UPDATE Schedule SET isLeech = 1 WHERE cardId = ?\\\",\\n\\n [card_id],\\n\\n )?;\\n\\n }\\n\\n\\n\\n tx.commit()?;\\n\\n\\n\\n Ok(())\\n\\n }\\n\\n\\n\\n pub fn stats(&self) -> Result<(GlobalStats, Vec<DeckStats>)> {\\n\",\n \"file_path\": \"src/lib.rs\",\n \"rank\": 48,\n \"score\": 18.506173752312428\n },\n {\n \"content\": \"\\n\\n let r: Result<_, rusqlite::Error> = iter.collect();\\n\\n\\n\\n Ok(r?)\\n\\n }\\n\\n\\n\\n pub fn cards_to_review(&self) -> Result<Vec<(String, Vec<Card>)>> {\\n\\n let mut stmt = self.conn.prepare(\\n\\n \\\"\\n\\n SELECT Deck.name, Card.id, Card.front, Card.back\\n\\n FROM Card JOIN Schedule ON Card.id = Schedule.cardId JOIN Deck ON Card.deckId = Deck.id\\n\\n WHERE isLeech = 0 AND scheduledForTimestamp < ?\\n\\n ORDER BY Card.deckId, scheduledForTimestamp\\n\\n \\\",\\n\\n )?;\\n\\n\\n\\n let iter = stmt.query_map([self.start_of_tomorrow()?], |row| {\\n\\n Ok((\\n\\n row.get(0)?,\\n\\n Card {\\n\",\n \"file_path\": \"src/lib.rs\",\n \"rank\": 49,\n \"score\": 18.297399076670153\n },\n {\n \"content\": \"\\n\\n let card = create_and_return_card(&mut srs, &deck, \\\"front\\\", \\\"back\\\")?;\\n\\n\\n\\n srs.update_card(card.id, \\\"new front\\\".to_string(), \\\"new back\\\".to_string())?;\\n\\n\\n\\n let edited_card = srs.get_card(card.id)?;\\n\\n assert_eq!(edited_card.id, card.id);\\n\\n assert_eq!(edited_card.front, \\\"new front\\\");\\n\\n assert_eq!(edited_card.back, \\\"new back\\\");\\n\\n\\n\\n Ok(())\\n\\n }\\n\\n\\n\\n #[test]\\n\\n fn switch_card() -> Result<()> {\\n\\n let (mut srs, _) = new_srs()?;\\n\\n\\n\\n let deck = create_and_return_deck(&mut srs, \\\"testName\\\")?;\\n\\n let deck2 = create_and_return_deck(&mut srs, \\\"another deck\\\")?;\\n\\n\\n\",\n \"file_path\": \"src/lib.rs\",\n \"rank\": 50,\n \"score\": 18.108851480765942\n },\n {\n \"content\": \" leech: 0,\\n\\n for_review: 0,\\n\\n }\\n\\n );\\n\\n assert_eq!(deck_stats.len(), 0);\\n\\n\\n\\n Ok(())\\n\\n }\\n\\n\\n\\n #[test]\\n\\n fn create_deck() -> Result<()> {\\n\\n let (mut srs, _) = new_srs()?;\\n\\n\\n\\n let deck = create_and_return_deck(&mut srs, \\\"testName\\\")?;\\n\\n assert_eq!(deck.name, \\\"testName\\\");\\n\\n assert_eq!(deck.interval_modifier, 100);\\n\\n\\n\\n assert_eq!(srs.get_deck(deck.id)?, deck);\\n\\n assert_eq!(srs.decks()?, vec![deck]);\\n\\n\\n\",\n \"file_path\": \"src/lib.rs\",\n \"rank\": 51,\n \"score\": 17.786764298227318\n },\n {\n \"content\": \" if modifier < MIN_INTERVAL_MODIFIER {\\n\\n bail!(format!(\\n\\n \\\"must be > {MIN_INTERVAL_MODIFIER}, given {modifier}\\\"\\n\\n ));\\n\\n }\\n\\n\\n\\n self.conn.execute(\\n\\n \\\"\\n\\n UPDATE Deck\\n\\n SET intervalModifier = ?\\n\\n WHERE id = ?\\n\\n \\\",\\n\\n params![modifier, id],\\n\\n )?;\\n\\n\\n\\n Ok(())\\n\\n }\\n\\n\\n\\n pub fn get_card(&self, id: u64) -> Result<Card> {\\n\\n Ok(self.conn.query_row(\\n\",\n \"file_path\": \"src/lib.rs\",\n \"rank\": 53,\n \"score\": 17.26477535402501\n },\n {\n \"content\": \" Ok(())\\n\\n }\\n\\n\\n\\n #[test]\\n\\n fn edit_deck() -> Result<()> {\\n\\n let (mut srs, _) = new_srs()?;\\n\\n\\n\\n let deck = create_and_return_deck(&mut srs, \\\"testName\\\")?;\\n\\n\\n\\n srs.update_interval_modifier(deck.id, 120)?;\\n\\n\\n\\n assert_eq!(srs.get_deck(deck.id)?.interval_modifier, 120);\\n\\n\\n\\n Ok(())\\n\\n }\\n\\n\\n\\n #[test]\\n\\n fn delete_deck() -> Result<()> {\\n\\n let (mut srs, _) = new_srs()?;\\n\\n\\n\",\n \"file_path\": \"src/lib.rs\",\n \"rank\": 54,\n \"score\": 17.248207380401627\n },\n {\n \"content\": \" interval_modifier: u16,\\n\\n ) -> u16 {\\n\\n match previous_interval {\\n\\n // Newly added card answered correctly\\n\\n 0 => 1,\\n\\n // First review. The wrong answer penalty isn't applied since it's rare to answer\\n\\n // incorrectly on the first review.\\n\\n 1 => 4,\\n\\n _ => {\\n\\n let was_correct = was_correct.expect(\\\"previously answered the card\\\");\\n\\n\\n\\n if was_correct {\\n\\n // Previous answer was correct\\n\\n let mut next =\\n\\n (previous_interval as f64 * 2.5 * (interval_modifier as f64 / 100.0))\\n\\n as u16;\\n\\n\\n\\n let max_fuzz =\\n\\n (previous_interval as f64 * self.fuzz_factor(previous_interval)) as u16;\\n\\n let fuzz = self.rng.gen_range(0..=max_fuzz);\\n\",\n \"file_path\": \"src/schedule.rs\",\n \"rank\": 55,\n \"score\": 17.13612141617343\n },\n {\n \"content\": \" .try_into()\\n\\n .expect(\\\"valid timestamp\\\");\\n\\n\\n\\n let card_id: u64 = tx.query_row(\\n\\n \\\"INSERT INTO Card(deckId, front, back, creationTimestamp) VALUES (?, ?, ?, ?) RETURNING *\\\",\\n\\n params![deck_id, front, back, now],\\n\\n |row| row.get(0),\\n\\n )?;\\n\\n\\n\\n tx.execute(\\n\\n \\\"INSERT INTO Schedule(cardId, scheduledForTimestamp, intervalDays) VALUES (?, ?, ?)\\\",\\n\\n params![card_id, now, 0],\\n\\n )?;\\n\\n\\n\\n tx.commit()?;\\n\\n\\n\\n Ok(())\\n\\n }\\n\\n\\n\\n pub fn delete_card(&mut self, id: u64) -> Result<()> {\\n\",\n \"file_path\": \"src/lib.rs\",\n \"rank\": 56,\n \"score\": 16.861087930182133\n },\n {\n \"content\": \" name: row.get(0)?,\\n\\n active: row.get(1)?,\\n\\n suspended: row.get(2)?,\\n\\n leech: row.get(3)?,\\n\\n correct: row.get(4)?,\\n\\n wrong: row.get(5)?,\\n\\n })\\n\\n })?;\\n\\n\\n\\n let deck_stats: Result<_, rusqlite::Error> = iter.collect();\\n\\n\\n\\n Ok((global_stats, deck_stats?))\\n\\n }\\n\\n\\n\\n fn start_of_tomorrow(&self) -> Result<u64> {\\n\\n let now = self.clock.now().to_offset(self.offset);\\n\\n let start_of_tomorrow = now\\n\\n .date()\\n\\n .saturating_add(Duration::days(1))\\n\\n .with_hms(0, 0, 0)\\n\",\n \"file_path\": \"src/lib.rs\",\n \"rank\": 57,\n \"score\": 15.812055806598732\n },\n {\n \"content\": \"\\n\\n Ok(())\\n\\n }\\n\\n\\n\\n pub fn decks(&self) -> Result<Vec<Deck>> {\\n\\n let mut stmt = self\\n\\n .conn\\n\\n .prepare(\\\"SELECT id, name, intervalModifier FROM Deck ORDER BY id\\\")?;\\n\\n\\n\\n let iter = stmt.query_map([], |row| {\\n\\n Ok(Deck {\\n\\n id: row.get(0)?,\\n\\n name: row.get(1)?,\\n\\n interval_modifier: row.get(2)?,\\n\\n })\\n\\n })?;\\n\\n\\n\\n let r: Result<_, rusqlite::Error> = iter.collect();\\n\\n\\n\\n Ok(r?)\\n\",\n \"file_path\": \"src/lib.rs\",\n \"rank\": 58,\n \"score\": 15.375252219839682\n },\n {\n \"content\": \" |row| {\\n\\n Ok(GlobalStats {\\n\\n active: row.get(0)?,\\n\\n suspended: row.get(1)?,\\n\\n leech: row.get(2)?,\\n\\n for_review: row.get(3)?,\\n\\n })\\n\\n },\\n\\n )?;\\n\\n\\n\\n let mut stmt = self.conn.prepare(\\n\\n \\\"\\n\\n SELECT\\n\\n name,\\n\\n\\n\\n (SELECT COUNT(*)\\n\\n FROM Card JOIN Schedule ON Card.id = Schedule.cardId\\n\\n WHERE Card.deckId = d.id AND scheduledForTimestamp IS NOT NULL AND isLeech = 0) AS active,\\n\\n\\n\\n (SELECT COUNT(*)\\n\",\n \"file_path\": \"src/lib.rs\",\n \"rank\": 59,\n \"score\": 14.493092144522427\n },\n {\n \"content\": \"\\n\\n Delete { card_id } => app.delete(*card_id),\\n\\n\\n\\n DeleteDeck { deck_id } => app.delete_deck(*deck_id),\\n\\n\\n\\n Edit { card_id } => app.edit(*card_id),\\n\\n\\n\\n Init => app.init(),\\n\\n\\n\\n IntMod { deck_id, modifier } => app.int_mod(*deck_id, *modifier),\\n\\n\\n\\n Review => app.review(),\\n\\n\\n\\n Stats => app.stats(),\\n\\n\\n\\n Switch { card_id, deck_id } => app.switch(*card_id, *deck_id),\\n\\n };\\n\\n\\n\\n if let Err(err) = result {\\n\\n match err.downcast_ref::<io::Error>() {\\n\\n Some(e) if e.kind() == io::ErrorKind::BrokenPipe => Ok(()),\\n\\n _ => Err(err),\\n\\n }\\n\\n } else {\\n\\n result\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/main.rs\",\n \"rank\": 60,\n \"score\": 14.479728323883226\n },\n {\n \"content\": \"\\n\\n pub fn answer_correct(&mut self, card_id: u64) -> Result<()> {\\n\\n let now_date_time = self.clock.now();\\n\\n\\n\\n let now: u64 = (now_date_time.unix_timestamp() * 1000)\\n\\n .try_into()\\n\\n .expect(\\\"valid timestamp\\\");\\n\\n\\n\\n let tx = self.conn.transaction()?;\\n\\n\\n\\n let interval_days: u16 = tx\\n\\n .query_row(\\n\\n \\\"SELECT intervalDays FROM Schedule WHERE cardId = ?\\\",\\n\\n [card_id],\\n\\n |row| row.get(0),\\n\\n )\\n\\n .optional()?\\n\\n .expect(\\\"card is not suspended\\\");\\n\\n\\n\\n let was_correct: Option<bool> = tx\\n\",\n \"file_path\": \"src/lib.rs\",\n \"rank\": 61,\n \"score\": 14.233814609963789\n },\n {\n \"content\": \" id: row.get(1)?,\\n\\n front: row.get(2)?,\\n\\n back: row.get(3)?,\\n\\n },\\n\\n ))\\n\\n })?;\\n\\n\\n\\n let r: Result<_, rusqlite::Error> = iter.collect();\\n\\n\\n\\n let cards: Vec<(String, Card)> = r?;\\n\\n\\n\\n if cards.is_empty() {\\n\\n return Ok(vec![]);\\n\\n }\\n\\n\\n\\n let mut rng = SmallRng::from_entropy();\\n\\n\\n\\n let mut cards_by_deck = vec![];\\n\\n\\n\\n let mut current_deck = cards[0].0.clone();\\n\",\n \"file_path\": \"src/lib.rs\",\n \"rank\": 62,\n \"score\": 14.146993307926662\n },\n {\n \"content\": \"\\n\\n Ok(())\\n\\n }\\n\\n\\n\\n pub fn answer_wrong(&mut self, card_id: u64) -> Result<()> {\\n\\n let now: u64 = (self.clock.now().unix_timestamp() * 1000)\\n\\n .try_into()\\n\\n .expect(\\\"valid timestamp\\\");\\n\\n\\n\\n let tx = self.conn.transaction()?;\\n\\n\\n\\n tx.execute(\\n\\n \\\"INSERT INTO Answer(cardId, isCorrect, timestamp) VALUES (?, ?, ?)\\\",\\n\\n params![card_id, false, now],\\n\\n )?;\\n\\n\\n\\n tx.execute(\\n\\n \\\"UPDATE Schedule SET scheduledForTimestamp = ? WHERE cardId = ?\\\",\\n\\n params![now, card_id],\\n\\n )?;\\n\",\n \"file_path\": \"src/lib.rs\",\n \"rank\": 63,\n \"score\": 13.937287493738133\n },\n {\n \"content\": \" FROM Card JOIN Schedule ON Card.id = Schedule.cardId\\n\\n WHERE Card.deckId = d.id AND scheduledForTimestamp IS NULL AND isLeech = 0) AS suspended,\\n\\n\\n\\n (SELECT COUNT(*)\\n\\n FROM Card JOIN Schedule ON Card.id = Schedule.cardId\\n\\n WHERE Card.deckId = d.id AND isLeech = 1) AS leech,\\n\\n\\n\\n (SELECT COUNT(*)\\n\\n FROM Card JOIN Answer ON Card.id = Answer.cardId\\n\\n WHERE Card.deckId = d.id AND isCorrect = 1 AND Answer.timestamp > :accuracySinceTimestamp) AS correct,\\n\\n\\n\\n (SELECT COUNT(*)\\n\\n FROM Card JOIN Answer ON Card.id = Answer.cardId\\n\\n WHERE Card.deckId = d.id AND isCorrect = 0 AND Answer.timestamp > :accuracySinceTimestamp) AS wrong\\n\\n FROM Deck AS d\\n\\n ORDER BY name\\n\\n \\\"\\n\\n )?;\\n\\n let iter = stmt.query_map([self.thirty_days_ago()?], |row| {\\n\\n Ok(DeckStats {\\n\",\n \"file_path\": \"src/lib.rs\",\n \"rank\": 64,\n \"score\": 13.818875460281637\n },\n {\n \"content\": \" use anyhow::anyhow;\\n\\n use std::cell::Cell;\\n\\n use std::rc::Rc;\\n\\n use time::OffsetDateTime;\\n\\n\\n\\n struct DoublingSchedule;\\n\\n\\n\\n impl Schedule for DoublingSchedule {\\n\\n fn next_interval(\\n\\n &mut self,\\n\\n previous_interval: u16,\\n\\n was_correct: Option<bool>,\\n\\n interval_modifier: u16,\\n\\n ) -> u16 {\\n\\n match was_correct {\\n\\n Some(true) => {\\n\\n (previous_interval as f64 * 2.0 * (interval_modifier as f64 / 100.0)) as u16\\n\\n }\\n\\n Some(false) => previous_interval / 2,\\n\\n None => 1,\\n\",\n \"file_path\": \"src/lib.rs\",\n \"rank\": 65,\n \"score\": 13.774828641926991\n },\n {\n \"content\": \" },\\n\\n \\\"edit\\\" => Subcommand::Edit {\\n\\n card_id: args.value_from_str(\\\"--card-id\\\")?,\\n\\n },\\n\\n \\\"init\\\" => Subcommand::Init,\\n\\n \\\"int-mod\\\" => Subcommand::IntMod {\\n\\n deck_id: args.value_from_str(\\\"--deck-id\\\")?,\\n\\n modifier: args.value_from_str(\\\"--modifier\\\")?,\\n\\n },\\n\\n \\\"review\\\" => Subcommand::Review,\\n\\n \\\"stats\\\" => Subcommand::Stats,\\n\\n \\\"switch\\\" => Subcommand::Switch {\\n\\n card_id: args.value_from_str(\\\"--card-id\\\")?,\\n\\n deck_id: args.value_from_str(\\\"--deck-id\\\")?,\\n\\n },\\n\\n _ => bail!(\\\"unknown subcommand\\\"),\\n\\n };\\n\\n\\n\\n let remaining = args.finish();\\n\\n if remaining.is_empty() {\\n\\n Ok(Self { subcommand, path })\\n\\n } else {\\n\\n Err(anyhow!(\\n\\n \\\"found arguments which weren't expected: {remaining:?}\\\"\\n\\n ))\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/opt.rs\",\n \"rank\": 66,\n \"score\": 13.705973071949474\n },\n {\n \"content\": \"\\n\\n let subcommand = match args.subcommand()? {\\n\\n Some(s) => s,\\n\\n None => bail!(\\\"missing subcommand\\\"),\\n\\n };\\n\\n\\n\\n let subcommand = match subcommand.as_ref() {\\n\\n \\\"add\\\" => Subcommand::Add {\\n\\n deck_id: args.value_from_str(\\\"--deck-id\\\")?,\\n\\n },\\n\\n \\\"cards\\\" => Subcommand::Cards,\\n\\n \\\"create-deck\\\" => Subcommand::CreateDeck {\\n\\n name: args.value_from_str(\\\"--name\\\")?,\\n\\n },\\n\\n \\\"decks\\\" => Subcommand::Decks,\\n\\n \\\"delete\\\" => Subcommand::Delete {\\n\\n card_id: args.value_from_str(\\\"--card-id\\\")?,\\n\\n },\\n\\n \\\"delete-deck\\\" => Subcommand::DeleteDeck {\\n\\n deck_id: args.value_from_str(\\\"--deck-id\\\")?,\\n\",\n \"file_path\": \"src/opt.rs\",\n \"rank\": 67,\n \"score\": 13.676360483305178\n },\n {\n \"content\": \" .query_row(\\n\\n \\\"SELECT isCorrect FROM Answer WHERE cardId = ? ORDER BY timestamp DESC LIMIT 1\\\",\\n\\n [card_id],\\n\\n |row| row.get(0),\\n\\n )\\n\\n .optional()?;\\n\\n\\n\\n tx.execute(\\n\\n \\\"INSERT INTO Answer(cardId, isCorrect, timestamp) VALUES (?, ?, ?)\\\",\\n\\n params![card_id, true, now],\\n\\n )?;\\n\\n\\n\\n let interval_modifier: u16 = tx.query_row(\\n\\n \\\"SELECT intervalModifier FROM Deck JOIN Card ON Deck.id = Card.deckId WHERE Card.id = ?\\\",\\n\\n [card_id],\\n\\n |row| row.get(0),\\n\\n )?;\\n\\n\\n\\n let num_days = self\\n\\n .schedule\\n\",\n \"file_path\": \"src/lib.rs\",\n \"rank\": 68,\n \"score\": 13.231465874948888\n },\n {\n \"content\": \" Ok(())\\n\\n }\\n\\n\\n\\n pub fn card_previews(&self) -> Result<Vec<CardPreview>> {\\n\\n let mut stmt = self.conn.prepare(\\n\\n \\\"\\n\\n SELECT id, front, isLeech\\n\\n FROM Card\\n\\n JOIN Schedule ON Card.id = Schedule.cardId\\n\\n ORDER BY isLeech DESC, creationTimestamp DESC;\\n\\n \\\",\\n\\n )?;\\n\\n\\n\\n let iter = stmt.query_map([], |row| {\\n\\n Ok(CardPreview {\\n\\n id: row.get(0)?,\\n\\n front: row.get(1)?,\\n\\n is_leech: row.get(2)?,\\n\\n })\\n\\n })?;\\n\",\n \"file_path\": \"src/lib.rs\",\n \"rank\": 69,\n \"score\": 12.407181006075456\n },\n {\n \"content\": \" )?;\\n\\n srs.init()?;\\n\\n\\n\\n Ok((srs, now))\\n\\n }\\n\\n\\n\\n #[test]\\n\\n fn empty_db() -> Result<()> {\\n\\n let (srs, _) = new_srs()?;\\n\\n\\n\\n assert_eq!(srs.decks()?.len(), 0);\\n\\n assert_eq!(srs.card_previews()?.len(), 0);\\n\\n assert_eq!(srs.cards_to_review()?.len(), 0);\\n\\n\\n\\n let (global_stats, deck_stats) = srs.stats()?;\\n\\n assert_eq!(\\n\\n global_stats,\\n\\n GlobalStats {\\n\\n active: 0,\\n\\n suspended: 0,\\n\",\n \"file_path\": \"src/lib.rs\",\n \"rank\": 70,\n \"score\": 11.848262055644541\n },\n {\n \"content\": \" let mut current_cards = vec![];\\n\\n for (deck_name, card) in cards {\\n\\n if deck_name != current_deck {\\n\\n let old_deck_name = std::mem::take(&mut current_deck);\\n\\n let mut cards = std::mem::take(&mut current_cards);\\n\\n\\n\\n current_deck = deck_name.clone();\\n\\n\\n\\n cards.shuffle(&mut rng);\\n\\n cards_by_deck.push((old_deck_name, cards));\\n\\n }\\n\\n\\n\\n current_cards.push(card);\\n\\n }\\n\\n\\n\\n current_cards.shuffle(&mut rng);\\n\\n cards_by_deck.push((current_deck, current_cards));\\n\\n\\n\\n Ok(cards_by_deck)\\n\\n }\\n\",\n \"file_path\": \"src/lib.rs\",\n \"rank\": 71,\n \"score\": 11.562330745250605\n },\n {\n \"content\": \" delete\\n\\n delete-deck\\n\\n edit\\n\\n init\\n\\n int-mod\\n\\n review\\n\\n stats\\n\\n switch\\\"#,\\n\\n name = env!(\\\"CARGO_PKG_NAME\\\"),\\n\\n version = env!(\\\"CARGO_PKG_VERSION\\\"),\\n\\n );\\n\\n}\\n\",\n \"file_path\": \"src/opt.rs\",\n \"rank\": 72,\n \"score\": 11.019950430708057\n },\n {\n \"content\": \" let global_stats = self.conn.query_row(\\n\\n \\\"\\n\\n SELECT\\n\\n (SELECT COUNT(*)\\n\\n FROM Card JOIN Schedule ON Card.id = Schedule.cardId\\n\\n WHERE scheduledForTimestamp IS NOT NULL AND isLeech = 0) AS active,\\n\\n\\n\\n (SELECT COUNT(*)\\n\\n FROM Card JOIN Schedule ON Card.id = Schedule.cardId\\n\\n WHERE scheduledForTimestamp IS NULL AND isLeech = 0) AS suspended,\\n\\n\\n\\n (SELECT COUNT(*)\\n\\n FROM Card JOIN Schedule ON Card.id = Schedule.cardId\\n\\n WHERE isLeech = 1) AS leech,\\n\\n\\n\\n (SELECT COUNT(*)\\n\\n FROM Schedule\\n\\n WHERE scheduledForTimestamp < :reviewSpanEnd) AS forReview\\n\\n \\\",\\n\\n [self.end_of_tomorrow()?],\\n\",\n \"file_path\": \"src/lib.rs\",\n \"rank\": 73,\n \"score\": 10.84638703836571\n },\n {\n \"content\": \" struct NotRandom;\\n\\n\\n\\n impl RngCore for NotRandom {\\n\\n fn next_u32(&mut self) -> u32 {\\n\\n self.next_u64() as u32\\n\\n }\\n\\n\\n\\n fn next_u64(&mut self) -> u64 {\\n\\n 0\\n\\n }\\n\\n\\n\\n fn fill_bytes(&mut self, dest: &mut [u8]) {\\n\\n dest.fill(0);\\n\\n }\\n\\n\\n\\n fn try_fill_bytes(&mut self, dest: &mut [u8]) -> Result<(), rand::Error> {\\n\\n Ok(self.fill_bytes(dest))\\n\\n }\\n\\n }\\n\\n\\n\",\n \"file_path\": \"src/schedule.rs\",\n \"rank\": 74,\n \"score\": 10.772502659801669\n },\n {\n \"content\": \"\\n\\n if self.rng.gen() {\\n\\n next += fuzz;\\n\\n } else {\\n\\n next -= fuzz;\\n\\n }\\n\\n\\n\\n next\\n\\n } else {\\n\\n // Previous answer was wrong\\n\\n std::cmp::max(1, (previous_interval as f64 * WRONG_ANSWER_PENALTY) as u16)\\n\\n }\\n\\n }\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\nimpl LowKeyAnki {\\n\\n pub fn new() -> Self {\\n\\n Self {\\n\",\n \"file_path\": \"src/schedule.rs\",\n \"rank\": 75,\n \"score\": 10.368513999587542\n },\n {\n \"content\": \" .next_interval(interval_days, was_correct, interval_modifier);\\n\\n\\n\\n if num_days >= AUTO_SUSPEND_INTERVAL {\\n\\n tx.execute(\\n\\n \\\"UPDATE Schedule SET scheduledForTimestamp = ?, intervalDays = ? WHERE cardId = ?\\\",\\n\\n params![Null, Null, card_id],\\n\\n )?;\\n\\n } else {\\n\\n let num_days_ms: u64 = Duration::days(num_days.into())\\n\\n .whole_milliseconds()\\n\\n .try_into()\\n\\n .expect(\\\"valid duration\\\");\\n\\n\\n\\n tx.execute(\\n\\n \\\"UPDATE Schedule SET scheduledForTimestamp = ?, intervalDays = ? WHERE cardId = ?\\\",\\n\\n params![now + num_days_ms, num_days, card_id],\\n\\n )?;\\n\\n }\\n\\n\\n\\n tx.commit()?;\\n\",\n \"file_path\": \"src/lib.rs\",\n \"rank\": 76,\n \"score\": 10.215788162175485\n },\n {\n \"content\": \" offset: UtcOffset::current_local_offset()?,\\n\\n })\\n\\n }\\n\\n\\n\\n #[cfg(test)]\\n\\n fn open_in_memory(schedule: Box<dyn Schedule>, clock: Box<dyn Clock>) -> Result<Self> {\\n\\n let conn = Connection::open_in_memory()?;\\n\\n\\n\\n conn.set_db_config(DbConfig::SQLITE_DBCONFIG_ENABLE_FKEY, true)?;\\n\\n\\n\\n Ok(Self {\\n\\n conn,\\n\\n clock,\\n\\n schedule,\\n\\n offset: UtcOffset::UTC,\\n\\n })\\n\\n }\\n\\n\\n\\n pub fn init(&mut self) -> Result<()> {\\n\\n self.conn.execute_batch(include_str!(\\\"schema.sql\\\"))?;\\n\",\n \"file_path\": \"src/lib.rs\",\n \"rank\": 77,\n \"score\": 9.532024628657458\n },\n {\n \"content\": \"\\n\\n assert_eq!(next, 4);\\n\\n }\\n\\n\\n\\n #[test]\\n\\n fn apply_wrong_penalty() {\\n\\n let mut schedule = new_schedule();\\n\\n\\n\\n let next = schedule.next_interval(50, Some(false), 100);\\n\\n\\n\\n assert_eq!(next, (50 as f64 * WRONG_ANSWER_PENALTY) as u16);\\n\\n }\\n\\n\\n\\n #[test]\\n\\n fn correct_answer() {\\n\\n let mut schedule = new_schedule();\\n\\n\\n\\n let next = schedule.next_interval(50, Some(true), 100);\\n\\n\\n\\n assert_eq!(next, 125);\\n\",\n \"file_path\": \"src/schedule.rs\",\n \"rank\": 78,\n \"score\": 9.32428515193502\n },\n {\n \"content\": \"\\n\\n let forward_by_days = move |days| {\\n\\n now.set(now.get() + Duration::days(days));\\n\\n };\\n\\n\\n\\n srs.answer_correct(card.id)?;\\n\\n\\n\\n forward_by_days(1);\\n\\n assert_scheduled(&srs, &card);\\n\\n\\n\\n srs.answer_correct(card.id)?;\\n\\n\\n\\n forward_by_days(2);\\n\\n assert_scheduled(&srs, &card);\\n\\n\\n\\n srs.answer_correct(card.id)?;\\n\\n\\n\\n forward_by_days(4);\\n\\n assert_scheduled(&srs, &card);\\n\\n\\n\",\n \"file_path\": \"src/lib.rs\",\n \"rank\": 79,\n \"score\": 9.053682827904979\n },\n {\n \"content\": \" }\\n\\n\\n\\n #[test]\\n\\n fn increase_by_interval_modifier() {\\n\\n let mut schedule = new_schedule();\\n\\n\\n\\n let next = schedule.next_interval(50, Some(true), 200);\\n\\n\\n\\n assert_eq!(next, 250);\\n\\n }\\n\\n\\n\\n #[test]\\n\\n #[should_panic]\\n\\n fn expect_previous_answer_for_large_interval() {\\n\\n let mut schedule = new_schedule();\\n\\n\\n\\n schedule.next_interval(50, None, 200);\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/schedule.rs\",\n \"rank\": 80,\n \"score\": 8.42774875075945\n },\n {\n \"content\": \" }\\n\\n\\n\\n fn thirty_days_ago(&self) -> Result<u64> {\\n\\n let now = self.clock.now().to_offset(self.offset);\\n\\n let end_of_tomorrow = now\\n\\n .date()\\n\\n .saturating_sub(Duration::days(30))\\n\\n .with_hms(0, 0, 0)\\n\\n .expect(\\\"valid time\\\")\\n\\n .assume_offset(now.offset());\\n\\n\\n\\n Ok((end_of_tomorrow.unix_timestamp() * 1000)\\n\\n .try_into()\\n\\n .expect(\\\"valid timestamp\\\"))\\n\\n }\\n\\n}\\n\\n\\n\\n#[cfg(test)]\\n\\nmod tests {\\n\\n use super::*;\\n\",\n \"file_path\": \"src/lib.rs\",\n \"rank\": 81,\n \"score\": 8.047804180124718\n },\n {\n \"content\": \" if args.contains([\\\"-h\\\", \\\"--help\\\"]) {\\n\\n print_help();\\n\\n process::exit(0);\\n\\n }\\n\\n\\n\\n if args.contains([\\\"-V\\\", \\\"--version\\\"]) {\\n\\n println!(\\\"{} {}\\\", env!(\\\"CARGO_PKG_NAME\\\"), env!(\\\"CARGO_PKG_VERSION\\\"));\\n\\n process::exit(0);\\n\\n }\\n\\n\\n\\n Self::parse(args).unwrap_or_else(|e| {\\n\\n eprintln!(\\\"error: {e}\\\");\\n\\n process::exit(1);\\n\\n })\\n\\n }\\n\\n\\n\\n fn parse(mut args: Arguments) -> Result<Self> {\\n\\n let path = args\\n\\n .opt_value_from_os_str([\\\"-p\\\", \\\"--path\\\"], |p| Ok::<_, Infallible>(PathBuf::from(p)))?\\n\\n .unwrap_or_else(|| PathBuf::from(\\\"srs.db\\\"));\\n\",\n \"file_path\": \"src/opt.rs\",\n \"rank\": 82,\n \"score\": 7.707910036704245\n },\n {\n \"content\": \" srs.answer_wrong(card.id)?;\\n\\n\\n\\n forward_by_days(2);\\n\\n assert_scheduled(&srs, &card);\\n\\n\\n\\n Ok(())\\n\\n }\\n\\n\\n\\n fn assert_scheduled(srs: &Srs, card: &Card) {\\n\\n let found = srs\\n\\n .cards_to_review()\\n\\n .unwrap()\\n\\n .iter()\\n\\n .flat_map(|(_, c)| c)\\n\\n .any(|c| c.id == card.id);\\n\\n\\n\\n assert!(found, \\\"card isn't scheduled for review\\\")\\n\\n }\\n\\n\\n\\n fn assert_not_scheduled(srs: &Srs, card: &Card) {\\n\",\n \"file_path\": \"src/lib.rs\",\n \"rank\": 83,\n \"score\": 7.692145798532103\n },\n {\n \"content\": \" rng: Box::new(SmallRng::from_entropy()),\\n\\n }\\n\\n }\\n\\n\\n\\n fn fuzz_factor(&self, previous_interval: u16) -> f64 {\\n\\n if previous_interval < 7 {\\n\\n 0.25\\n\\n } else if previous_interval < 30 {\\n\\n 0.15\\n\\n } else {\\n\\n 0.05\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\n#[cfg(test)]\\n\\nmod tests {\\n\\n use super::*;\\n\\n use rand::RngCore;\\n\\n\\n\",\n \"file_path\": \"src/schedule.rs\",\n \"rank\": 84,\n \"score\": 7.390128875019457\n },\n {\n \"content\": \" .expect(\\\"valid time\\\")\\n\\n .assume_offset(now.offset());\\n\\n\\n\\n Ok((start_of_tomorrow.unix_timestamp() * 1000)\\n\\n .try_into()\\n\\n .expect(\\\"valid timestamp\\\"))\\n\\n }\\n\\n\\n\\n fn end_of_tomorrow(&self) -> Result<u64> {\\n\\n let now = self.clock.now().to_offset(self.offset);\\n\\n let end_of_tomorrow = now\\n\\n .date()\\n\\n .saturating_add(Duration::days(1))\\n\\n .with_hms(23, 59, 59)\\n\\n .expect(\\\"valid time\\\")\\n\\n .assume_offset(now.offset());\\n\\n\\n\\n Ok((end_of_tomorrow.unix_timestamp() * 1000)\\n\\n .try_into()\\n\\n .expect(\\\"valid timestamp\\\"))\\n\",\n \"file_path\": \"src/lib.rs\",\n \"rank\": 85,\n \"score\": 7.223566434901854\n },\n {\n \"content\": \" fn new_schedule() -> LowKeyAnki {\\n\\n LowKeyAnki {\\n\\n rng: Box::new(NotRandom),\\n\\n }\\n\\n }\\n\\n\\n\\n #[test]\\n\\n fn first_answer() {\\n\\n let mut schedule = new_schedule();\\n\\n\\n\\n let next = schedule.next_interval(0, None, 100);\\n\\n\\n\\n assert_eq!(next, 1);\\n\\n }\\n\\n\\n\\n #[test]\\n\\n fn first_review() {\\n\\n let mut schedule = new_schedule();\\n\\n\\n\\n let next = schedule.next_interval(1, Some(true), 100);\\n\",\n \"file_path\": \"src/schedule.rs\",\n \"rank\": 86,\n \"score\": 7.076877623402342\n },\n {\n \"content\": \"use anyhow::anyhow;\\n\\nuse anyhow::bail;\\n\\nuse anyhow::Result;\\n\\nuse pico_args::Arguments;\\n\\nuse std::convert::Infallible;\\n\\nuse std::path::PathBuf;\\n\\nuse std::process;\\n\\n\\n\\n/// Contains parsed command line arguments.\\n\\n#[derive(Debug)]\\n\\npub struct Opt {\\n\\n /// The subcommand to run.\\n\\n pub subcommand: Subcommand,\\n\\n\\n\\n /// The path of the database file. Defaults to srs.db.\\n\\n pub path: PathBuf,\\n\\n}\\n\\n\\n\\n#[derive(Debug)]\\n\\npub enum Subcommand {\\n\",\n \"file_path\": \"src/opt.rs\",\n \"rank\": 87,\n \"score\": 6.876646999167267\n },\n {\n \"content\": \"mod app;\\n\\nmod opt;\\n\\n\\n\\nuse crate::app::App;\\n\\nuse anyhow::Result;\\n\\nuse srs_cli::Srs;\\n\\nuse std::io;\\n\\n\\n\",\n \"file_path\": \"src/main.rs\",\n \"rank\": 88,\n \"score\": 5.2010566071076045\n },\n {\n \"content\": \"mod clock;\\n\\nmod schedule;\\n\\n\\n\\nuse anyhow::bail;\\n\\nuse anyhow::Result;\\n\\nuse clock::Clock;\\n\\nuse rand::rngs::SmallRng;\\n\\nuse rand::seq::SliceRandom;\\n\\nuse rand::SeedableRng;\\n\\nuse rusqlite::config::DbConfig;\\n\\nuse rusqlite::params;\\n\\nuse rusqlite::types::Null;\\n\\nuse rusqlite::Connection;\\n\\nuse rusqlite::OptionalExtension;\\n\\nuse schedule::LowKeyAnki;\\n\\nuse schedule::Schedule;\\n\\nuse std::path::Path;\\n\\nuse time::Duration;\\n\\nuse time::UtcOffset;\\n\\n\\n\",\n \"file_path\": \"src/lib.rs\",\n \"rank\": 89,\n \"score\": 4.61901700455926\n },\n {\n \"content\": \"use rand::rngs::SmallRng;\\n\\nuse rand::Rng;\\n\\nuse rand::SeedableRng;\\n\\n\\n\",\n \"file_path\": \"src/schedule.rs\",\n \"rank\": 90,\n \"score\": 3.4303782568202363\n },\n {\n \"content\": \"use time::OffsetDateTime;\\n\\n\\n\",\n \"file_path\": \"src/clock.rs\",\n \"rank\": 91,\n \"score\": 2.883508049630299\n },\n {\n \"content\": \" }\\n\\n }\\n\\n }\\n\\n\\n\\n struct TimeMachine {\\n\\n now: Rc<Cell<OffsetDateTime>>,\\n\\n }\\n\\n\\n\\n impl Clock for TimeMachine {\\n\\n fn now(&self) -> OffsetDateTime {\\n\\n self.now.get()\\n\\n }\\n\\n }\\n\\n\\n\\n fn new_srs() -> Result<(Srs, Rc<Cell<OffsetDateTime>>)> {\\n\\n let now = Rc::new(Cell::new(OffsetDateTime::UNIX_EPOCH + Duration::weeks(10)));\\n\\n\\n\\n let mut srs = Srs::open_in_memory(\\n\\n Box::new(DoublingSchedule),\\n\\n Box::new(TimeMachine { now: now.clone() }),\\n\",\n \"file_path\": \"src/lib.rs\",\n \"rank\": 92,\n \"score\": 2.1039826558405785\n }\n]","isConversational":false}}},{"rowIdx":2369,"cells":{"lang":{"kind":"string","value":"Rust"},"file_path":{"kind":"string","value":"src/cluster/src/local.rs"},"repo_name":{"kind":"string","value":"simlay/fluvio"},"commit":{"kind":"string","value":"a42283200e667223d3a52b217d266db8927db4eb"},"file_code":{"kind":"string","value":"use std::path::Path;\nuse std::borrow::Cow;\nuse std::fs::{File, create_dir_all};\nuse std::process::{Command, Stdio};\nuse std::time::Duration;\nuse fluvio::{FluvioConfig};\n\nuse tracing::{info, warn, debug};\nuse fluvio::config::{TlsPolicy, TlsConfig, TlsPaths, ConfigFile, Profile, LOCAL_PROFILE};\nuse fluvio::metadata::spg::SpuGroupSpec;\nuse flv_util::cmd::CommandExt;\nuse fluvio_future::timer::sleep;\nuse fluvio::metadata::spu::{SpuSpec, SpuType};\nuse fluvio::metadata::spu::IngressPort;\nuse fluvio::metadata::spu::Endpoint;\nuse fluvio::metadata::spu::IngressAddr;\nuse k8_obj_metadata::InputK8Obj;\nuse k8_obj_metadata::InputObjectMeta;\nuse k8_client::SharedK8Client;\n\nuse crate::ClusterError;\n\n#[derive(Debug)]\npub struct LocalClusterInstallerBuilder {\n \n log_dir: String,\n \n rust_log: Option<String>,\n \n spu_spec: SpuGroupSpec,\n \n server_tls_policy: TlsPolicy,\n \n client_tls_policy: TlsPolicy,\n}\n\nimpl LocalClusterInstallerBuilder {\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n pub fn build(self) -> Result<LocalClusterInstaller, ClusterError> {\n Ok(LocalClusterInstaller { config: self })\n }\n \n \n \n \n \n \n \n \n \n \n \n pub fn with_spu_replicas(mut self, spu_replicas: u16) -> Self {\n self.spu_spec.replicas = spu_replicas;\n self\n }\n\n \n \n \n \n \n \n \n \n \n \n \n pub fn with_log_dir(mut self, log_dir: String) -> Self {\n self.log_dir = log_dir;\n self\n }\n\n \n \n \n \n \n \n \n \n \n \n \n \n \n pub fn with_rust_log<S: Into<String>>(mut self, rust_log: S) -> Self {\n self.rust_log = Some(rust_log.into());\n self\n }\n\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n pub fn with_tls<C: Into<TlsPolicy>, S: Into<TlsPolicy>>(\n mut self,\n client: C,\n server: S,\n ) -> Self {\n let client_policy = client.into();\n let server_policy = server.into();\n\n use std::mem::discriminant;\n match (&client_policy, &server_policy) {\n \n _ if discriminant(&client_policy) != discriminant(&server_policy) => {\n warn!(\"Client TLS policy type is different than the Server TLS policy type!\");\n }\n \n (TlsPolicy::Verified(client), TlsPolicy::Verified(server))\n if client.domain() != server.domain() =>\n {\n warn!(\n client_domain = client.domain(),\n server_domain = server.domain(),\n \"Client TLS config has a different domain than the Server TLS config!\"\n );\n }\n _ => (),\n }\n self.client_tls_policy = client_policy;\n self.server_tls_policy = server_policy;\n self\n }\n}\n\n#[derive(Debug)]\npub struct LocalClusterInstaller {\n \n config: LocalClusterInstallerBuilder,\n}\n\nimpl LocalClusterInstaller {\n \n \n \n \n \n \n \n \n \n \n #[allow(clippy::new_ret_no_self)]\n pub fn new() -> LocalClusterInstallerBuilder {\n let spu_spec = SpuGroupSpec {\n replicas: 1,\n min_id: 0,\n ..SpuGroupSpec::default()\n };\n LocalClusterInstallerBuilder {\n spu_spec,\n rust_log: Some(\"info\".to_string()),\n log_dir: \"/tmp\".to_string(),\n server_tls_policy: TlsPolicy::Disabled,\n client_tls_policy: TlsPolicy::Disabled,\n }\n }\n\n \n pub async fn install(&self) -> Result<(), ClusterError> {\n debug!(\"using log dir: {}\", &self.config.log_dir);\n if !Path::new(&self.config.log_dir.to_string()).exists() {\n create_dir_all(&self.config.log_dir.to_string())?;\n }\n \n Command::new(\"sync\").inherit();\n info!(\"launching sc\");\n self.launch_sc()?;\n info!(\"setting local profile\");\n self.set_profile()?;\n\n info!(\n \"launching spu group with size: {}\",\n &self.config.spu_spec.replicas\n );\n self.launch_spu_group().await?;\n sleep(Duration::from_secs(1)).await;\n Ok(())\n }\n fn launch_sc(&self) -> Result<(), ClusterError> {\n let outputs = File::create(format!(\"{}/flv_sc.log\", &self.config.log_dir))?;\n let errors = outputs.try_clone()?;\n debug!(\"starting sc server\");\n let mut binary = {\n let mut cmd = Command::new(std::env::current_exe()?);\n cmd.arg(\"run\");\n cmd.arg(\"sc\");\n cmd\n };\n if let TlsPolicy::Verified(tls) = &self.config.server_tls_policy {\n self.set_server_tls(&mut binary, tls, 9005)?;\n }\n if let Some(log) = &self.config.rust_log {\n binary.env(\"RUST_LOG\", log);\n }\n let cmd = binary.print();\n cmd.stdout(Stdio::from(outputs))\n .stderr(Stdio::from(errors))\n .spawn()?;\n\n Ok(())\n }\n\n fn set_server_tls(\n &self,\n cmd: &mut Command,\n tls: &TlsConfig,\n port: u16,\n ) -> Result<(), ClusterError> {\n let paths: Cow<TlsPaths> = match tls {\n TlsConfig::Files(paths) => Cow::Borrowed(paths),\n TlsConfig::Inline(certs) => Cow::Owned(certs.try_into_temp_files()?),\n };\n\n info!(\"starting SC with TLS options\");\n let ca_cert = paths\n .ca_cert\n .to_str()\n .ok_or_else(|| ClusterError::Other(\"ca_cert must be a valid path\".to_string()))?;\n let server_cert = paths\n .cert\n .to_str()\n .ok_or_else(|| ClusterError::Other(\"server_cert must be a valid path\".to_string()))?;\n let server_key = paths\n .key\n .to_str()\n .ok_or_else(|| ClusterError::Other(\"server_key must be a valid path\".to_string()))?;\n cmd.arg(\"--tls\")\n .arg(\"--enable-client-cert\")\n .arg(\"--server-cert\")\n .arg(server_cert)\n .arg(\"--server-key\")\n .arg(server_key)\n .arg(\"--ca-cert\")\n .arg(ca_cert)\n .arg(\"--bind-non-tls-public\")\n .arg(format!(\"0.0.0.0:{}\", port));\n Ok(())\n }\n\n \n fn set_profile(&self) -> Result<String, ClusterError> {\n let local_addr = \"localhost:9003\".to_owned();\n let mut config_file = ConfigFile::load_default_or_new()?;\n\n let config = config_file.mut_config();\n \n match config.cluster_mut(LOCAL_PROFILE) {\n Some(cluster) => {\n cluster.addr = local_addr.clone();\n cluster.tls = self.config.client_tls_policy.clone();\n }\n None => {\n let mut local_cluster = FluvioConfig::new(local_addr.clone());\n local_cluster.tls = self.config.client_tls_policy.clone();\n config.add_cluster(local_cluster, LOCAL_PROFILE.to_owned());\n }\n };\n\n \n match config.profile_mut(LOCAL_PROFILE) {\n Some(profile) => {\n profile.set_cluster(LOCAL_PROFILE.to_owned());\n }\n None => {\n let profile = Profile::new(LOCAL_PROFILE.to_owned());\n config.add_profile(profile, LOCAL_PROFILE.to_owned());\n }\n }\n\n \n assert!(config.set_current_profile(LOCAL_PROFILE));\n\n config_file.save()?;\n\n Ok(format!(\"local context is set to: {}\", local_addr))\n }\n\n async fn launch_spu_group(&self) -> Result<(), ClusterError> {\n use k8_client::load_and_share;\n let client = load_and_share()?;\n let count = self.config.spu_spec.replicas;\n for i in 0..count {\n debug!(\"launching SPU ({} of {})\", i + 1, count);\n self.launch_spu(i, client.clone(), &self.config.log_dir.to_string())\n .await?;\n }\n info!(\"SC log generated at {}/flv_sc.log\", &self.config.log_dir);\n sleep(Duration::from_millis(500)).await;\n Ok(())\n }\n\n async fn launch_spu(\n &self,\n spu_index: u16,\n client: SharedK8Client,\n log_dir: &str,\n ) -> Result<(), ClusterError> {\n use k8_client::metadata::MetadataClient;\n const BASE_PORT: u16 = 9010;\n const BASE_SPU: u16 = 5001;\n let spu_id = (BASE_SPU + spu_index) as i32;\n let public_port = BASE_PORT + spu_index * 10;\n let private_port = public_port + 1;\n let spu_spec = SpuSpec {\n id: spu_id,\n spu_type: SpuType::Custom,\n public_endpoint: IngressPort {\n port: public_port,\n ingress: vec![IngressAddr {\n hostname: Some(\"localhost\".to_owned()),\n ..Default::default()\n }],\n ..Default::default()\n },\n private_endpoint: Endpoint {\n port: private_port,\n host: \"localhost\".to_owned(),\n ..Default::default()\n },\n ..Default::default()\n };\n let input = InputK8Obj::new(\n spu_spec,\n InputObjectMeta {\n name: format!(\"custom-spu-{}\", spu_id),\n namespace: \"default\".to_owned(),\n ..Default::default()\n },\n );\n client.create_item(input).await?;\n \n sleep(Duration::from_millis(300)).await;\n let log_spu = format!(\"{}/spu_log_{}.log\", log_dir, spu_id);\n let outputs = File::create(&log_spu)?;\n let errors = outputs.try_clone()?;\n\n let mut binary = {\n let mut cmd = Command::new(std::env::current_exe()?);\n cmd.arg(\"run\");\n cmd.arg(\"spu\");\n cmd\n };\n\n if let TlsPolicy::Verified(tls) = &self.config.server_tls_policy {\n self.set_server_tls(&mut binary, tls, private_port + 1)?;\n }\n if let Some(log) = &self.config.rust_log {\n binary.env(\"RUST_LOG\", log);\n }\n let cmd = binary\n .arg(\"-i\")\n .arg(format!(\"{}\", spu_id))\n .arg(\"-p\")\n .arg(format!(\"0.0.0.0:{}\", public_port))\n .arg(\"-v\")\n .arg(format!(\"0.0.0.0:{}\", private_port))\n .print();\n info!(\"SPU<{}> cmd: {:#?}\", spu_index, cmd);\n info!(\"SPU log generated at {}\", log_spu);\n cmd.stdout(Stdio::from(outputs))\n .stderr(Stdio::from(errors))\n .spawn()\n .map_err(|_| ClusterError::Other(\"SPU server failed to start\".to_string()))?;\n Ok(())\n }\n}\n"},"prefix":{"kind":"string","value":"use std::path::Path;\nuse std::borrow::Cow;\nuse std::fs::{File, create_dir_all};\nuse std::process::{Command, Stdio};\nuse std::time::Duration;\nuse fluvio::{FluvioConfig};\n\nuse tracing::{info, warn, debug};\nuse fluvio::config::{TlsPolicy, TlsConfig, TlsPaths, ConfigFile, Profile, LOCAL_PROFILE};\nuse fluvio::metadata::spg::SpuGroupSpec;\nuse flv_util::cmd::CommandExt;\nuse fluvio_future::timer::sleep;\nuse fluvio::metadata::spu::{SpuSpec, SpuType};\nuse fluvio::metadata::spu::IngressPort;\nuse fluvio::metadata::spu::Endpoint;\nuse fluvio::metadata::spu::IngressAddr;\nuse k8_obj_metadata::InputK8Obj;\nuse k8_obj_metadata::InputObjectMeta;\nuse k8_client::SharedK8Client;\n\nuse crate::ClusterError;\n\n#[derive(Debug)]\npub struct LocalClusterInstallerBuilder {\n \n log_dir: String,\n \n rust_log: Option<String>,\n \n spu_spec: SpuGroupSpec,\n \n server_tls_policy: TlsPolicy,\n \n client_tls_policy: TlsPolicy,\n}\n\nimpl LocalClusterInstallerBuilder {\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n pub fn build(self) -> Result<LocalClusterInstaller, ClusterError> {\n Ok(LocalClusterInstaller { config: self })\n }\n \n \n \n \n \n \n \n \n \n \n \n pub fn with_spu_replicas(mut self, spu_replicas: u16) -> Self {\n self.spu_spec.replicas = spu_replicas;\n self\n }\n\n \n \n \n \n \n \n \n \n \n \n \n pub fn with_log_dir(mut self, log_dir: String) -> Self {\n self.log_dir = log_dir;\n self\n }\n\n \n \n \n \n \n \n \n \n \n \n \n \n \n pub fn with_rust_log<S: Into<String>>(mut self, rust_log: S) -> Self {\n self.rust_log = Some(rust_log.into());\n self\n }\n\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n pub fn with_tls<C: Into<TlsPolicy>, S: Into<TlsPolicy>>(\n mut self,\n client: C,\n server: S,\n ) -> Self {\n let client_policy = client.into();\n let server_policy = server.into();\n\n use std::mem::discriminant;\n match (&client_policy, &server_policy) {\n \n _ if discriminant(&client_policy) != discriminant(&server_policy) => {\n warn!(\"Client TLS policy type is different than the Server TLS policy type!\");\n }\n \n (TlsPolicy::Verified(client), TlsPolicy::Verified(server))\n if client.domain() != server.domain() =>\n {\n warn!(\n client_domain = client.domain(),\n server_domain = server.domain(),\n \"Client TLS config has a different domain than the Server TLS config!\"\n );\n }\n _ => (),\n }\n self.client_tls_policy = client_policy;\n self.server_tls_policy = server_policy;\n self\n }\n}\n\n#[derive(Debug)]\npub struct LocalClusterInstaller {\n \n config: LocalClusterInstallerBuilder,\n}\n\nimpl LocalClusterInstaller {\n \n \n \n \n \n \n \n \n \n \n #[allow(clippy::new_ret_no_self)]\n pub fn new() -> LocalClusterInstallerBuilder {\n let spu_spec = SpuGroupSpec {\n replicas: 1,\n min_id: 0,\n ..SpuGroupSpec::default()\n };\n LocalClusterInstallerBuilder {\n spu_spec,\n rust_log: Some(\"info\".to_string()),\n log_dir: \"/tmp\".to_string(),\n server_tls_policy: TlsPolicy::Disabled,\n client_tls_policy: TlsPolicy::Disabled,\n }\n }\n\n \n pub async fn install(&self) -> Result<(), ClusterError> {\n debug!(\"using log dir: {}\", &self.config.log_dir);\n if !Path::new(&self.config.log_dir.to_string()).exists() {\n create_dir_all(&self.config.log_dir.to_string())?;\n }\n \n Command::new(\"sync\").inherit();\n info!(\"launching sc\");\n self.launch_sc()?;\n info!(\"setting local profile\");\n self.set_profile()?;\n\n info!(\n \"launching spu group with size: {}\",\n &self.config.spu_spec.replicas\n );\n self.launch_spu_group().await?;\n sleep(Duration::from_secs(1)).await;\n Ok(())\n }\n fn launch_sc(&self) -> Result<(), ClusterError> {\n let outputs = File::create(format!(\"{}/flv_sc.log\", &self.config.lo"},"suffix":{"kind":"string","value":"\n\n fn set_server_tls(\n &self,\n cmd: &mut Command,\n tls: &TlsConfig,\n port: u16,\n ) -> Result<(), ClusterError> {\n let paths: Cow<TlsPaths> = match tls {\n TlsConfig::Files(paths) => Cow::Borrowed(paths),\n TlsConfig::Inline(certs) => Cow::Owned(certs.try_into_temp_files()?),\n };\n\n info!(\"starting SC with TLS options\");\n let ca_cert = paths\n .ca_cert\n .to_str()\n .ok_or_else(|| ClusterError::Other(\"ca_cert must be a valid path\".to_string()))?;\n let server_cert = paths\n .cert\n .to_str()\n .ok_or_else(|| ClusterError::Other(\"server_cert must be a valid path\".to_string()))?;\n let server_key = paths\n .key\n .to_str()\n .ok_or_else(|| ClusterError::Other(\"server_key must be a valid path\".to_string()))?;\n cmd.arg(\"--tls\")\n .arg(\"--enable-client-cert\")\n .arg(\"--server-cert\")\n .arg(server_cert)\n .arg(\"--server-key\")\n .arg(server_key)\n .arg(\"--ca-cert\")\n .arg(ca_cert)\n .arg(\"--bind-non-tls-public\")\n .arg(format!(\"0.0.0.0:{}\", port));\n Ok(())\n }\n\n \n fn set_profile(&self) -> Result<String, ClusterError> {\n let local_addr = \"localhost:9003\".to_owned();\n let mut config_file = ConfigFile::load_default_or_new()?;\n\n let config = config_file.mut_config();\n \n match config.cluster_mut(LOCAL_PROFILE) {\n Some(cluster) => {\n cluster.addr = local_addr.clone();\n cluster.tls = self.config.client_tls_policy.clone();\n }\n None => {\n let mut local_cluster = FluvioConfig::new(local_addr.clone());\n local_cluster.tls = self.config.client_tls_policy.clone();\n config.add_cluster(local_cluster, LOCAL_PROFILE.to_owned());\n }\n };\n\n \n match config.profile_mut(LOCAL_PROFILE) {\n Some(profile) => {\n profile.set_cluster(LOCAL_PROFILE.to_owned());\n }\n None => {\n let profile = Profile::new(LOCAL_PROFILE.to_owned());\n config.add_profile(profile, LOCAL_PROFILE.to_owned());\n }\n }\n\n \n assert!(config.set_current_profile(LOCAL_PROFILE));\n\n config_file.save()?;\n\n Ok(format!(\"local context is set to: {}\", local_addr))\n }\n\n async fn launch_spu_group(&self) -> Result<(), ClusterError> {\n use k8_client::load_and_share;\n let client = load_and_share()?;\n let count = self.config.spu_spec.replicas;\n for i in 0..count {\n debug!(\"launching SPU ({} of {})\", i + 1, count);\n self.launch_spu(i, client.clone(), &self.config.log_dir.to_string())\n .await?;\n }\n info!(\"SC log generated at {}/flv_sc.log\", &self.config.log_dir);\n sleep(Duration::from_millis(500)).await;\n Ok(())\n }\n\n async fn launch_spu(\n &self,\n spu_index: u16,\n client: SharedK8Client,\n log_dir: &str,\n ) -> Result<(), ClusterError> {\n use k8_client::metadata::MetadataClient;\n const BASE_PORT: u16 = 9010;\n const BASE_SPU: u16 = 5001;\n let spu_id = (BASE_SPU + spu_index) as i32;\n let public_port = BASE_PORT + spu_index * 10;\n let private_port = public_port + 1;\n let spu_spec = SpuSpec {\n id: spu_id,\n spu_type: SpuType::Custom,\n public_endpoint: IngressPort {\n port: public_port,\n ingress: vec![IngressAddr {\n hostname: Some(\"localhost\".to_owned()),\n ..Default::default()\n }],\n ..Default::default()\n },\n private_endpoint: Endpoint {\n port: private_port,\n host: \"localhost\".to_owned(),\n ..Default::default()\n },\n ..Default::default()\n };\n let input = InputK8Obj::new(\n spu_spec,\n InputObjectMeta {\n name: format!(\"custom-spu-{}\", spu_id),\n namespace: \"default\".to_owned(),\n ..Default::default()\n },\n );\n client.create_item(input).await?;\n \n sleep(Duration::from_millis(300)).await;\n let log_spu = format!(\"{}/spu_log_{}.log\", log_dir, spu_id);\n let outputs = File::create(&log_spu)?;\n let errors = outputs.try_clone()?;\n\n let mut binary = {\n let mut cmd = Command::new(std::env::current_exe()?);\n cmd.arg(\"run\");\n cmd.arg(\"spu\");\n cmd\n };\n\n if let TlsPolicy::Verified(tls) = &self.config.server_tls_policy {\n self.set_server_tls(&mut binary, tls, private_port + 1)?;\n }\n if let Some(log) = &self.config.rust_log {\n binary.env(\"RUST_LOG\", log);\n }\n let cmd = binary\n .arg(\"-i\")\n .arg(format!(\"{}\", spu_id))\n .arg(\"-p\")\n .arg(format!(\"0.0.0.0:{}\", public_port))\n .arg(\"-v\")\n .arg(format!(\"0.0.0.0:{}\", private_port))\n .print();\n info!(\"SPU<{}> cmd: {:#?}\", spu_index, cmd);\n info!(\"SPU log generated at {}\", log_spu);\n cmd.stdout(Stdio::from(outputs))\n .stderr(Stdio::from(errors))\n .spawn()\n .map_err(|_| ClusterError::Other(\"SPU server failed to start\".to_string()))?;\n Ok(())\n }\n}\n"},"middle":{"kind":"string","value":"g_dir))?;\n let errors = outputs.try_clone()?;\n debug!(\"starting sc server\");\n let mut binary = {\n let mut cmd = Command::new(std::env::current_exe()?);\n cmd.arg(\"run\");\n cmd.arg(\"sc\");\n cmd\n };\n if let TlsPolicy::Verified(tls) = &self.config.server_tls_policy {\n self.set_server_tls(&mut binary, tls, 9005)?;\n }\n if let Some(log) = &self.config.rust_log {\n binary.env(\"RUST_LOG\", log);\n }\n let cmd = binary.print();\n cmd.stdout(Stdio::from(outputs))\n .stderr(Stdio::from(errors))\n .spawn()?;\n\n Ok(())\n }"},"strategy":{"kind":"string","value":"function_block-function_prefixed"},"context_items":{"kind":"list like","value":[{"content":"/// create new local cluster and profile\n\npub fn set_local_context(local_config: LocalOpt) -> Result<String, CliError> {\n\n let local_addr = local_config.local;\n\n let mut config_file = ConfigFile::load_default_or_new()?;\n\n\n\n let config = config_file.mut_config();\n\n\n\n // check if local cluster exists otherwise, create new one\n\n match config.cluster_mut(LOCAL_PROFILE) {\n\n Some(cluster) => {\n\n cluster.addr = local_addr.clone();\n\n cluster.tls = local_config.tls.try_into()?;\n\n }\n\n None => {\n\n let mut local_cluster = FluvioConfig::new(local_addr.clone());\n\n local_cluster.tls = local_config.tls.try_into()?;\n\n config.add_cluster(local_cluster, LOCAL_PROFILE.to_owned());\n\n }\n\n };\n\n\n\n // check if we local profile exits otherwise, create new one, then set it's cluster\n","file_path":"src/cli/src/profile/context.rs","rank":0,"score":343995.7005511477},{"content":"#[async_trait]\n\npub trait SpuLocalStorePolicy<C>\n\nwhere\n\n C: MetadataItem,\n\n{\n\n async fn online_status(&self) -> HashSet<SpuId>;\n\n\n\n async fn online_spu_count(&self) -> i32;\n\n\n\n async fn spu_used_for_replica(&self) -> i32;\n\n\n\n async fn online_spu_ids(&self) -> Vec<i32>;\n\n\n\n async fn spu_ids(&self) -> Vec<i32>;\n\n\n\n async fn online_spus(&self) -> Vec<SpuMetadata<C>>;\n\n\n\n async fn custom_spus(&self) -> Vec<SpuMetadata<C>>;\n\n\n\n async fn get_by_id(&self, id: i32) -> Option<SpuMetadata<C>>;\n\n\n","file_path":"src/controlplane-metadata/src/spu/store.rs","rank":1,"score":259352.44899254735},{"content":"pub fn run_cli(args: &[String]) -> eyre::Result<String> {\n\n run_block_on(async move {\n\n let terminal = Arc::new(PrintTerminal::new());\n\n\n\n let root_args: Root = Root::from_iter(args);\n\n let output = match root_args {\n\n Root::Consume(consume) => process_consume_log(terminal.clone(), consume).await?,\n\n Root::Produce(produce) => process_produce_record(terminal.clone(), produce).await?,\n\n Root::SPU(spu) => process_spu(terminal.clone(), spu).await?,\n\n Root::SPUGroup(spu_group) => process_spu_group(terminal.clone(), spu_group).await?,\n\n Root::CustomSPU(custom_spu) => process_custom_spu(terminal.clone(), custom_spu).await?,\n\n Root::Topic(topic) => process_topic(terminal.clone(), topic).await?,\n\n Root::Partition(partition) => partition.process_partition(terminal.clone()).await?,\n\n Root::Profile(profile) => process_profile(terminal.clone(), profile).await?,\n\n Root::Cluster(cluster) => process_cluster(terminal.clone(), cluster).await?,\n\n #[cfg(any(feature = \"cluster_components\", feature = \"cluster_components_rustls\"))]\n\n Root::Run(opt) => process_run(opt)?,\n\n Root::Install(opt) => opt.process().await?,\n\n Root::Update(opt) => opt.process().await?,\n\n Root::Version(_) => process_version_cmd()?,\n\n Root::Completions(shell) => process_completions_cmd(shell)?,\n\n Root::External(args) => process_external_subcommand(args)?,\n\n };\n\n Ok(output)\n\n })\n\n}\n\n\n\nuse crate::Terminal;\n\n\n","file_path":"src/cli/src/root_cli.rs","rank":2,"score":255897.48199925813},{"content":"// returns a tuple (topic_name, idx)\n\npub fn decompose_partition_name(partition_name: &str) -> Result<(String, i32), PartitionError> {\n\n let dash_pos = partition_name.rfind('-');\n\n if dash_pos.is_none() {\n\n return Err(PartitionError::InvalidSyntax(partition_name.to_owned()));\n\n }\n\n\n\n let pos = dash_pos.unwrap();\n\n if (pos + 1) >= partition_name.len() {\n\n return Err(PartitionError::InvalidSyntax(partition_name.to_owned()));\n\n }\n\n\n\n let topic_name = &partition_name[..pos];\n\n let idx_string = &partition_name[(pos + 1)..];\n\n let idx = match idx_string.parse::<i32>() {\n\n Ok(n) => n,\n\n Err(_) => {\n\n return Err(PartitionError::InvalidSyntax(partition_name.to_owned()));\n\n }\n\n };\n\n\n\n Ok((topic_name.to_string(), idx))\n\n}\n\n\n","file_path":"src/types/src/partition.rs","rank":3,"score":254370.58556398243},{"content":"/// find status matching it,\n\nfn find_status(status: &mut Vec<ReplicaStatus>, spu: SpuId) -> Option<&'_ mut ReplicaStatus> {\n\n status.iter_mut().find(|status| status.spu == spu)\n\n}\n\n\n\n#[derive(Decode, Encode, Debug, Clone, PartialEq)]\n\n#[cfg_attr(feature = \"use_serde\", derive(serde::Serialize, serde::Deserialize))]\n\npub enum PartitionResolution {\n\n Offline, // No leader available for serving partition\n\n Online, // Partition is running normally, status contains replica info\n\n LeaderOffline, // Election has failed, no suitable leader has been founded\n\n ElectionLeaderFound, // New leader has been selected\n\n}\n\n\n\nimpl Default for PartitionResolution {\n\n fn default() -> Self {\n\n PartitionResolution::Offline\n\n }\n\n}\n\n\n\n#[derive(Decode, Encode, Debug, Clone, PartialEq)]\n","file_path":"src/controlplane-metadata/src/partition/status.rs","rank":4,"score":247492.86660216842},{"content":"struct ScServerCtx {\n\n ctx: SharedScContext,\n\n sender: Sender<bool>,\n\n}\n","file_path":"src/spu/src/tests/fixture/spu_client.rs","rank":5,"score":247200.08897528314},{"content":"/// Generate a random client group key (50001 to 65535)\n\npub fn generate_group_id() -> String {\n\n format!(\"fluvio-consumer-{}\", thread_rng().gen_range(50001, 65535))\n\n}\n\n\n\n#[allow(dead_code)]\n","file_path":"src/utils/src/generators.rs","rank":6,"score":245921.92256248108},{"content":"fn process_external_subcommand(mut args: Vec<String>) -> Result<String, CliError> {\n\n use std::process::Command;\n\n use which::{CanonicalPath, Error as WhichError};\n\n\n\n // The external subcommand's name is given as the first argument, take it.\n\n let cmd = args.remove(0);\n\n\n\n // Check for a matching external command in the environment\n\n let external_subcommand = format!(\"fluvio-{}\", cmd);\n\n let subcommand_path = match CanonicalPath::new(&external_subcommand) {\n\n Ok(path) => path,\n\n Err(WhichError::CannotFindBinaryPath) => {\n\n println!(\n\n \"Unable to find plugin '{}'. Make sure it is executable and in your PATH.\",\n\n &external_subcommand\n\n );\n\n std::process::exit(1);\n\n }\n\n other => other?,\n\n };\n","file_path":"src/cli/src/root_cli.rs","rank":7,"score":244460.4270549144},{"content":"/// compute profile name, if name exists in the cli option, we use that\n\n/// otherwise, we look up k8 config context name\n\nfn compute_profile_name() -> Result<String, CliError> {\n\n let k8_config = K8Config::load()?;\n\n\n\n let kc_config = match k8_config {\n\n K8Config::Pod(_) => return Err(CliError::Other(\"Pod config is not valid here\".to_owned())),\n\n K8Config::KubeConfig(config) => config,\n\n };\n\n\n\n if let Some(ctx) = kc_config.config.current_context() {\n\n Ok(ctx.name.to_owned())\n\n } else {\n\n Err(CliError::Other(\"no context found\".to_owned()))\n\n }\n\n}\n\n\n\n/// create new k8 cluster and profile\n\npub async fn set_k8_context(opt: K8Opt, external_addr: String) -> Result<Profile, CliError> {\n\n let mut config_file = ConfigFile::load_default_or_new()?;\n\n let config = config_file.mut_config();\n\n\n","file_path":"src/cli/src/profile/k8.rs","rank":8,"score":244292.47638390688},{"content":"// generate replication folder name\n\nfn replica_dir_name<S: AsRef<str>>(topic_name: S, partition_index: Size) -> String {\n\n format!(\"{}-{}\", topic_name.as_ref(), partition_index)\n\n}\n\n\n\n#[cfg(test)]\n\nmod tests {\n\n\n\n use tracing::debug;\n\n use std::env::temp_dir;\n\n use std::fs;\n\n use std::fs::metadata;\n\n use std::io::Cursor;\n\n\n\n use fluvio_future::test_async;\n\n use dataplane::batch::DefaultBatch;\n\n use dataplane::{Offset, ErrorCode};\n\n use dataplane::core::{Decoder, Encoder};\n\n use dataplane::fetch::FilePartitionResponse;\n\n use dataplane::record::RecordSet;\n\n use flv_util::fixture::ensure_clean_dir;\n","file_path":"src/storage/src/replica.rs","rank":9,"score":242537.49587474784},{"content":"type Config = (ScConfig, Option<BasicRbacPolicy>);\n\n\n\n/// cli options\n\n#[derive(Debug, StructOpt, Default)]\n\n#[structopt(name = \"sc-server\", about = \"Streaming Controller\")]\n\npub struct ScOpt {\n\n #[structopt(long)]\n\n /// Address for external service\n\n bind_public: Option<String>,\n\n\n\n #[structopt(long)]\n\n /// Address for internal service\n\n bind_private: Option<String>,\n\n\n\n // k8 namespace\n\n #[structopt(short = \"n\", long = \"namespace\", value_name = \"namespace\")]\n\n namespace: Option<String>,\n\n\n\n #[structopt(flatten)]\n\n tls: TlsConfig,\n","file_path":"src/sc/src/cli.rs","rank":10,"score":237499.15741889182},{"content":"// start server\n\npub fn create_public_server(addr: String, ctx: DefaultSharedGlobalContext) -> PublicApiServer {\n\n info!(\n\n \"starting SPU: {} at public service at: {}\",\n\n ctx.local_spu_id(),\n\n addr\n\n );\n\n\n\n FlvApiServer::new(addr, ctx, PublicService::new())\n\n}\n","file_path":"src/spu/src/services/public/mod.rs","rank":11,"score":234291.874242707},{"content":"// start server\n\npub fn create_internal_server(addr: String, ctx: DefaultSharedGlobalContext) -> InternalApiServer {\n\n info!(\n\n \"starting SPU: {} at internal service at: {}\",\n\n ctx.local_spu_id(),\n\n addr\n\n );\n\n\n\n FlvApiServer::new(addr, ctx, InternalService::new())\n\n}\n","file_path":"src/spu/src/services/internal/mod.rs","rank":12,"score":234291.874242707},{"content":"#[allow(unused)]\n\npub fn command_exec(binary: &str, prefix: &str, process: impl Fn(&mut Command)) {\n\n let mut cmd = get_binary(binary).unwrap_or_else(|_| panic!(\"unable to get binary: {}\", binary));\n\n\n\n let (output, error) = open_log(prefix);\n\n\n\n cmd.stdout(Stdio::from(output)).stderr(Stdio::from(error));\n\n\n\n process(&mut cmd);\n\n\n\n let status = cmd.status().expect(\"topic creation failed\");\n\n\n\n if !status.success() {\n\n println!(\"topic creation failed: {}\", status);\n\n }\n\n}\n\n\n\nuse std::process::Child;\n\n\n","file_path":"src/utils/src/bin.rs","rank":13,"score":230123.2702388984},{"content":"/// Streaming Controller dispatcher entry point, spawns new thread\n\npub fn run<K,C>(receiver: Receiver<ScRequest>, sc_controller: ScController<K,C>) \n\n where K: WSUpdateService + Send + Sync + 'static,\n\n C: SpuConnections + Send + Sync + 'static\n\n{\n\n info!(\"start SC[{}] dispatcher\", sc_controller.id());\n\n\n\n spawn(sc_request_loop(receiver, sc_controller);\n\n}\n\n\n\n/// SC dispatcher request loop, waits for a request request and dispatchers\n\n/// it for processing.\n\nasync fn sc_request_loop<K,C>(mut receiver: Receiver<ScRequest>, mut sc_controller: ScController<K,C>) \n\n where K: WSUpdateService , C: SpuConnections \n\n{\n\n loop {\n\n select! {\n\n receiver_req = receiver.next() => {\n\n match receiver_req {\n\n None => {\n\n info!(\"SC dispatcher receiver is removed. end\");\n","file_path":"src/sc/src/core/dispatcher.rs","rank":14,"score":227311.88124565335},{"content":"pub fn process_releases(opt: ReleasesCommand) -> Result<String, CliError> {\n\n match opt {\n\n ReleasesCommand::List => list_releases()?,\n\n }\n\n Ok(\"\".to_string())\n\n}\n\n\n","file_path":"src/cli/src/cluster/releases.rs","rank":15,"score":226841.48958721507},{"content":"#[allow(unused)]\n\npub fn command_spawn(binary: &str, prefix: &str, process: impl Fn(&mut Command)) -> Child {\n\n let mut cmd = get_binary(binary).unwrap_or_else(|_| panic!(\"unable to get binary: {}\", binary));\n\n\n\n let (output, error) = open_log(prefix);\n\n\n\n cmd.stdout(Stdio::from(output)).stderr(Stdio::from(error));\n\n\n\n process(&mut cmd);\n\n\n\n cmd.spawn().expect(\"child\")\n\n}\n","file_path":"src/utils/src/bin.rs","rank":16,"score":223922.08755974067},{"content":"pub fn process_run(run_opt: RunOpt) -> Result<String, CliError> {\n\n match run_opt {\n\n RunOpt::SPU(opt) => fluvio_spu::main_loop(opt),\n\n RunOpt::SC(opt) => fluvio_sc::k8::main_k8_loop(opt),\n\n }\n\n\n\n Ok(\"\".to_owned())\n\n}\n","file_path":"src/cli/src/run/mod.rs","rank":17,"score":223561.58052493125},{"content":"pub fn process_switch<O>(out: std::sync::Arc<O>, opt: SwitchOpt) -> Result<String, CliError>\n\nwhere\n\n O: Terminal,\n\n{\n\n let profile_name = opt.profile_name;\n\n match ConfigFile::load(None) {\n\n Ok(mut config_file) => {\n\n if !config_file.mut_config().set_current_profile(&profile_name) {\n\n t_println!(out, \"profile {} not found\", &profile_name);\n\n } else if let Err(err) = config_file.save() {\n\n t_println!(out, \"unable to save profile: {}\", err);\n\n }\n\n }\n\n Err(_) => t_print_cli_err!(out, \"no profile can be found\"),\n\n }\n\n\n\n Ok(\"\".to_string())\n\n}\n\n\n","file_path":"src/cli/src/profile/mod.rs","rank":18,"score":223114.99851825967},{"content":"pub fn process_delete<O>(out: std::sync::Arc<O>, opt: DeleteOpt) -> Result<String, CliError>\n\nwhere\n\n O: Terminal,\n\n{\n\n let profile_name = opt.profile_name;\n\n match ConfigFile::load(None) {\n\n Ok(mut config_file) => {\n\n if !config_file.mut_config().delete_profile(&profile_name) {\n\n t_println!(out, \"profile {} not found\", &profile_name);\n\n } else if let Err(err) = config_file.save() {\n\n t_println!(out, \"unable to save profile: {}\", err);\n\n } else {\n\n t_println!(out, \"profile {} deleted\", &profile_name);\n\n if config_file.config().current_profile_name().is_none() {\n\n t_println!(out,\"warning: this removed your current profile, use 'config switch-profile to select a different one\");\n\n } else {\n\n t_println!(out, \"profile deleted\");\n\n }\n\n }\n\n }\n\n Err(_) => t_print_cli_err!(out, \"no profile can be found\"),\n\n }\n\n\n\n Ok(\"\".to_string())\n\n}\n\n\n","file_path":"src/cli/src/profile/mod.rs","rank":19,"score":223114.99851825967},{"content":"/// If header has error, format and return\n\npub fn error_in_header(\n\n topic_name: &str,\n\n r_partition: &FetchablePartitionResponse<RecordSet>,\n\n) -> Option<String> {\n\n if r_partition.error_code.is_error() {\n\n Some(format!(\n\n \"topic '{}/{}': {}\",\n\n topic_name,\n\n r_partition.partition_index,\n\n r_partition.error_code.to_sentence()\n\n ))\n\n } else {\n\n None\n\n }\n\n}\n","file_path":"src/cli/src/consume/logs_output.rs","rank":20,"score":221342.97670329746},{"content":"/// Process server based on output type\n\npub fn format_spu_response_output<O>(\n\n out: std::sync::Arc<O>,\n\n spus: ListSpus,\n\n output_type: OutputType,\n\n) -> Result<(), CliError>\n\nwhere\n\n O: Terminal,\n\n{\n\n if !spus.is_empty() {\n\n out.render_list(&spus, output_type)?;\n\n } else {\n\n t_println!(out, \"no spu\");\n\n }\n\n\n\n Ok(())\n\n}\n\n\n\nimpl TableOutputHandler for ListSpus {\n\n /// table header implementation\n\n fn header(&self) -> Row {\n","file_path":"src/cli/src/spu/display.rs","rank":21,"score":220049.4644864777},{"content":"fn find_spu_image() -> String {\n\n std::env::var(\"SPU_IMAGE\").expect(\"SPU IMAGE must be passed as env\")\n\n}\n\n\n","file_path":"src/sc/src/k8/operator/conversion.rs","rank":22,"score":218242.24756624005},{"content":"/// Traverse all partition batches and parse records to json format\n\npub fn partition_to_json_records(\n\n partition: &FetchablePartitionResponse<RecordSet>,\n\n suppress: bool,\n\n) -> Vec<Value> {\n\n let mut json_records: Vec<Value> = vec![];\n\n\n\n // convert all batches to json records\n\n for batch in &partition.records.batches {\n\n for record in &batch.records {\n\n if let Some(batch_record) = record.get_value().inner_value_ref() {\n\n match serde_json::from_slice(&batch_record) {\n\n Ok(value) => json_records.push(value),\n\n Err(_) => {\n\n if !suppress {\n\n json_records.push(serde_json::json!({\n\n \"error\": record.get_value().describe()\n\n }));\n\n }\n\n }\n\n }\n\n }\n\n }\n\n }\n\n\n\n json_records\n\n}\n\n\n","file_path":"src/cli/src/consume/logs_output.rs","rank":23,"score":216924.50418309803},{"content":"/// Generates a random authorization token\n\npub fn generate_auth_token() -> (String, String) {\n\n const CHARSET: &[u8] = b\"abcdefghijklmnopqrstuvwxyz\\\n\n 0123456789\";\n\n\n\n const ID_SIZE: usize = 6;\n\n let token_name: String = (0..ID_SIZE)\n\n .map(|_| {\n\n let idx = thread_rng().gen_range(0, CHARSET.len());\n\n // This is safe because `idx` is in range of `CHARSET`\n\n char::from(unsafe { *CHARSET.get_unchecked(idx) })\n\n })\n\n .collect();\n\n\n\n const SECRET_SIZE: usize = 16;\n\n let token_secret: String = (0..SECRET_SIZE)\n\n .map(|_| {\n\n let idx = thread_rng().gen_range(0, CHARSET.len());\n\n // This is safe because `idx` is in range of `CHARSET`\n\n char::from(unsafe { *CHARSET.get_unchecked(idx) })\n\n })\n\n .collect();\n\n\n\n (token_name, token_secret)\n\n}\n\n\n\n#[allow(dead_code)]\n","file_path":"src/utils/src/generators.rs","rank":24,"score":216683.83232184197},{"content":"pub fn default_option(index_max_interval_bytes: Size) -> ConfigOption {\n\n ConfigOption {\n\n segment_max_bytes: 100,\n\n index_max_interval_bytes,\n\n base_dir: temp_dir(),\n\n index_max_bytes: 1000,\n\n }\n\n}\n\n\n\nmod pin_tests {\n\n\n\n use std::pin::Pin;\n\n use pin_utils::pin_mut;\n\n use pin_utils::unsafe_unpinned;\n\n\n\n // impl Unpin for Counter{}\n\n\n\n struct Counter {\n\n total: u16,\n\n }\n","file_path":"src/storage/src/fixture.rs","rank":25,"score":216492.45818404213},{"content":"// returns a tuple (topic_name, idx)\n\npub fn decompose_partition_name(partition_name: &str) -> Result<(String, i32), PartitionError> {\n\n let dash_pos = partition_name.rfind('-');\n\n if dash_pos.is_none() {\n\n return Err(PartitionError::InvalidSyntax(partition_name.to_owned()));\n\n }\n\n\n\n let pos = dash_pos.unwrap();\n\n if (pos + 1) >= partition_name.len() {\n\n return Err(PartitionError::InvalidSyntax(partition_name.to_owned()));\n\n }\n\n\n\n let topic_name = &partition_name[..pos];\n\n let idx_string = &partition_name[(pos + 1)..];\n\n let idx = match idx_string.parse::<i32>() {\n\n Ok(n) => n,\n\n Err(_) => {\n\n return Err(PartitionError::InvalidSyntax(partition_name.to_owned()));\n\n }\n\n };\n\n\n\n Ok((topic_name.to_string(), idx))\n\n}\n\n\n","file_path":"src/dataplane-protocol/src/common.rs","rank":26,"score":215996.35997868638},{"content":"/// find spu id from env, if not found, return error\n\nfn find_spu_id_from_env() -> Result<SpuId, IoError> {\n\n use std::env;\n\n use fluvio_types::defaults::FLV_SPU_ID;\n\n\n\n if let Ok(id_str) = env::var(FLV_SPU_ID) {\n\n debug!(\"found spu id from env: {}\", id_str);\n\n let id = id_str\n\n .parse()\n\n .map_err(|err| IoError::new(ErrorKind::InvalidInput, format!(\"spu-id: {}\", err)))?;\n\n Ok(id)\n\n } else {\n\n // try get special env SPU which has form of {}-{id} when in as in-cluster config\n\n if let Ok(spu_name) = env::var(\"SPU_INDEX\") {\n\n info!(\"extracting SPU from: {}\", spu_name);\n\n let spu_tokens: Vec<&str> = spu_name.split('-').collect();\n\n if spu_tokens.len() < 2 {\n\n Err(IoError::new(\n\n ErrorKind::InvalidInput,\n\n format!(\"SPU is invalid format: {} bailing out\", spu_name),\n\n ))\n","file_path":"src/spu/src/config/cli.rs","rank":27,"score":215408.0282878956},{"content":"#[derive(Debug, StructOpt, Default)]\n\nstruct TlsConfig {\n\n /// enable tls\n\n #[structopt(long)]\n\n pub tls: bool,\n\n\n\n /// TLS: path to server certificate\n\n #[structopt(long)]\n\n pub server_cert: Option<String>,\n\n #[structopt(long)]\n\n /// TLS: path to server private key\n\n pub server_key: Option<String>,\n\n /// TLS: enable client cert\n\n #[structopt(long)]\n\n pub enable_client_cert: bool,\n\n /// TLS: path to ca cert, required when client cert is enabled\n\n #[structopt(long)]\n\n pub ca_cert: Option<String>,\n\n\n\n #[structopt(long)]\n\n /// TLS: address of non tls public service, required\n\n pub bind_non_tls_public: Option<String>,\n\n}\n","file_path":"src/spu/src/config/cli.rs","rank":28,"score":211701.2569100922},{"content":"///\n\n/// Validate computed topic spec parameters and update topic status\n\n/// * error is passed to the topic reason.\n\n///\n\npub fn validate_computed_topic_parameters(param: &TopicReplicaParam) -> TopicNextState {\n\n if let Err(err) = TopicSpec::valid_partition(¶m.partitions) {\n\n TopicStatus::next_resolution_invalid_config(&err.to_string()).into()\n\n } else if let Err(err) = TopicSpec::valid_replication_factor(¶m.replication_factor) {\n\n TopicStatus::next_resolution_invalid_config(&err.to_string()).into()\n\n } else {\n\n TopicStatus::next_resolution_pending().into()\n\n }\n\n}\n\n\n\n///\n\n/// Generate Replica Map if there are enough online spus\n\n/// * returns a replica map or a reason for the failure\n\n/// * fatal error configuration errors and are not recoverable\n\n///\n\npub async fn generate_replica_map(\n\n spus: &SpuAdminStore,\n\n param: &TopicReplicaParam,\n\n) -> TopicNextState {\n\n let spu_count = spus.count().await;\n","file_path":"src/sc/src/controllers/topics/policy.rs","rank":29,"score":210563.0110112667},{"content":"#[async_trait]\n\npub trait PartitionLocalStorePolicy<C>\n\nwhere\n\n C: MetadataItem,\n\n{\n\n async fn names(&self) -> Vec<ReplicaKey>;\n\n\n\n async fn topic_partitions(&self, topic: &str) -> Vec<PartitionMetadata<C>>;\n\n\n\n /// find all partitions that has spu in the replicas\n\n async fn partition_spec_for_spu(&self, target_spu: i32) -> Vec<(ReplicaKey, PartitionSpec)>;\n\n\n\n async fn count_topic_partitions(&self, topic: &str) -> i32;\n\n\n\n // return partitions that belong to this topic\n\n async fn topic_partitions_list(&self, topic: &str) -> Vec<ReplicaKey>;\n\n\n\n async fn table_fmt(&self) -> String;\n\n\n\n /// replica msg for target spu\n\n async fn replica_for_spu(&self, target_spu: SpuId) -> Vec<Replica>;\n","file_path":"src/controlplane-metadata/src/partition/store.rs","rank":30,"score":209198.35896586106},{"content":"#[async_trait]\n\npub trait TopicLocalStorePolicy<C>\n\nwhere\n\n C: MetadataItem,\n\n{\n\n async fn table_fmt(&self) -> String;\n\n}\n\n\n\n#[async_trait]\n\nimpl<C> TopicLocalStorePolicy<C> for TopicLocalStore<C>\n\nwhere\n\n C: MetadataItem + Send + Sync,\n\n{\n\n async fn table_fmt(&self) -> String {\n\n let mut table = String::new();\n\n\n\n let topic_hdr = format!(\n\n \"{n:<18} {t:<8} {p:<5} {s:<5} {g:<8} {l:<14} {m:<10} {r}\\n\",\n\n n = \"TOPIC\",\n\n t = \"TYPE\",\n\n p = \"PART\",\n","file_path":"src/controlplane-metadata/src/topic/store.rs","rank":31,"score":209198.35896586106},{"content":"pub fn view_profile<O>(out: std::sync::Arc<O>) -> eyre::Result<()>\n\nwhere\n\n O: Terminal,\n\n{\n\n let config_file = ConfigFile::load(None).context(\"Failed to read Fluvio config file\")?;\n\n t_println!(out, \"{:#?}\", config_file.config());\n\n Ok(())\n\n}\n\n\n","file_path":"src/cli/src/profile/context.rs","rank":32,"score":209172.35245652407},{"content":"/// Print records based on their type\n\npub fn print_dynamic_records<O>(\n\n out: std::sync::Arc<O>,\n\n topic_name: &str,\n\n response_partitions: &[FetchablePartitionResponse<RecordSet>],\n\n) where\n\n O: Terminal,\n\n{\n\n for r_partition in response_partitions {\n\n if let Some(err) = error_in_header(topic_name, r_partition) {\n\n t_print_cli_err!(out, err);\n\n continue;\n\n }\n\n\n\n for batch in &r_partition.records.batches {\n\n for record in &batch.records {\n\n if let Some(batch_record) = record.get_value().inner_value_ref() {\n\n // TODO: this should be refactored\n\n if let Some(bytes) = record.get_value().inner_value_ref() {\n\n debug!(\"len: {}\", bytes.len());\n\n }\n","file_path":"src/cli/src/consume/logs_output.rs","rank":33,"score":208799.7144529275},{"content":"/// parse message and generate log records\n\npub fn generate_json_records<O>(\n\n out: std::sync::Arc<O>,\n\n topic_name: &str,\n\n response_partitions: &[FetchablePartitionResponse<RecordSet>],\n\n suppress: bool,\n\n) -> Vec<Value>\n\nwhere\n\n O: Terminal,\n\n{\n\n let mut json_records: Vec<Value> = vec![];\n\n\n\n for r_partition in response_partitions {\n\n if let Some(err) = error_in_header(topic_name, r_partition) {\n\n t_print_cli_err!(out, err);\n\n continue;\n\n }\n\n\n\n let mut new_records = partition_to_json_records(&r_partition, suppress);\n\n json_records.append(&mut new_records);\n\n }\n\n\n\n json_records\n\n}\n\n\n","file_path":"src/cli/src/consume/logs_output.rs","rank":34,"score":208799.64318581208},{"content":"/// parse message and generate partition records\n\npub fn print_binary_records<O>(\n\n out: std::sync::Arc<O>,\n\n topic_name: &str,\n\n response_partitions: &[FetchablePartitionResponse<RecordSet>],\n\n) where\n\n O: Terminal,\n\n{\n\n debug!(\n\n \"printing out binary records: {} records: {}\",\n\n topic_name,\n\n response_partitions.len()\n\n );\n\n let mut printed = false;\n\n for r_partition in response_partitions {\n\n if let Some(err) = error_in_header(topic_name, r_partition) {\n\n t_println!(out, \"{}\", hex_dump_separator());\n\n t_print_cli_err!(out, err);\n\n printed = true;\n\n continue;\n\n }\n","file_path":"src/cli/src/consume/logs_output.rs","rank":35,"score":208794.07690288225},{"content":"/// Print records in text format\n\npub fn print_text_records<O>(\n\n out: std::sync::Arc<O>,\n\n topic_name: &str,\n\n response_partitions: &[FetchablePartitionResponse<RecordSet>],\n\n suppress: bool,\n\n) where\n\n O: Terminal,\n\n{\n\n debug!(\"processing text record: {:#?}\", response_partitions);\n\n\n\n for r_partition in response_partitions {\n\n if let Some(err) = error_in_header(topic_name, r_partition) {\n\n t_print_cli_err!(out, err);\n\n continue;\n\n }\n\n\n\n for batch in &r_partition.records.batches {\n\n for record in &batch.records {\n\n if record.get_value().inner_value_ref().is_some() {\n\n if record.get_value().is_binary() {\n","file_path":"src/cli/src/consume/logs_output.rs","rank":36,"score":208794.07690288225},{"content":"/// Print records in raw format\n\npub fn print_raw_records<O>(\n\n out: std::sync::Arc<O>,\n\n topic_name: &str,\n\n response_partitions: &[FetchablePartitionResponse<RecordSet>],\n\n) where\n\n O: Terminal,\n\n{\n\n for r_partition in response_partitions {\n\n if let Some(err) = error_in_header(topic_name, r_partition) {\n\n t_print_cli_err!(out, err);\n\n continue;\n\n }\n\n\n\n for batch in &r_partition.records.batches {\n\n for record in &batch.records {\n\n if let Some(value) = record.get_value().inner_value_ref() {\n\n let str_value = std::str::from_utf8(value).unwrap();\n\n t_println!(out, \"{}\", str_value);\n\n }\n\n }\n\n }\n\n }\n\n}\n\n\n\n// -----------------------------------\n\n// Utilities\n\n// -----------------------------------\n\n\n","file_path":"src/cli/src/consume/logs_output.rs","rank":37,"score":208794.07690288225},{"content":"pub fn create_partition_name(topic_name: &str, idx: &i32) -> String {\n\n format!(\"{}-{}\", topic_name, idx)\n\n}\n","file_path":"src/types/src/partition.rs","rank":38,"score":208186.77023268695},{"content":"/// Generates a random authorization secret\n\npub fn generate_secret() -> String {\n\n const CHARSET: &[u8] = b\"abcdefghijklmnopqrstuvwxyz\\\n\n 0123456789\";\n\n\n\n const SECRET_SIZE: usize = 16;\n\n let secret: String = (0..SECRET_SIZE)\n\n .map(|_| {\n\n let idx = thread_rng().gen_range(0, CHARSET.len());\n\n // This is safe because `idx` is in range of `CHARSET`\n\n char::from(unsafe { *CHARSET.get_unchecked(idx) })\n\n })\n\n .collect();\n\n\n\n secret\n\n}\n\n\n\n#[allow(dead_code)]\n","file_path":"src/utils/src/generators.rs","rank":39,"score":207472.1288930106},{"content":"pub fn generate_service(spg: &K8SpuGroupSpec, name: &str) -> ServiceSpec {\n\n let spg_template = &spg.template.spec;\n\n let mut public_port = ServicePort {\n\n port: spg_template\n\n .public_endpoint\n\n .as_ref()\n\n .map(|t| t.port)\n\n .unwrap_or(SPU_PUBLIC_PORT),\n\n ..Default::default()\n\n };\n\n\n\n public_port.name = Some(\"public\".to_owned());\n\n let mut private_port = ServicePort {\n\n port: spg_template\n\n .private_endpoint\n\n .as_ref()\n\n .map(|t| t.port)\n\n .unwrap_or(SPU_PRIVATE_PORT),\n\n ..Default::default()\n\n };\n","file_path":"src/sc/src/k8/operator/conversion.rs","rank":40,"score":204929.34111360952},{"content":"/// Generates a random key\n\npub fn generate_random_key() -> String {\n\n const CHARSET: &[u8] = b\"ABCDEFGHIJKLMNOPQRSTUVWXYZ\\\n\n abcdefghijklmnopqrstuvwxyz\\\n\n 0123456789)(*&^%$#@!~\";\n\n const SIZE: usize = 32;\n\n let key: String = (0..SIZE)\n\n .map(|_| {\n\n let idx = thread_rng().gen_range(0, CHARSET.len());\n\n // This is safe because `idx` is in range of `CHARSET`\n\n char::from(unsafe { *CHARSET.get_unchecked(idx) })\n\n })\n\n .collect();\n\n\n\n key\n\n}\n","file_path":"src/utils/src/generators.rs","rank":41,"score":203976.31607148933},{"content":"#[allow(dead_code)]\n\nstruct Dispatcher<C>(C);\n\n\n\n#[allow(dead_code)]\n\nimpl<S> Dispatcher<C>\n\nwhere\n\n C: Controller + Send + Sync + 'static,\n\n C::Action: Send + Sync + 'static,\n\n{\n\n /// start the controller with ctx and receiver\n\n pub fn run<K>(controller: C, receiver: Receiver<Actions<C::Action>>, kv_service: K)\n\n where\n\n K: WSUpdateService + Send + Sync + 'static,\n\n {\n\n spawn(Self::request_loop(receiver, kv_service, controller).await);\n\n }\n\n\n\n async fn request_loop<K>(\n\n mut receiver: Receiver<Actions<C::Action>>,\n\n _kv_service: K,\n\n mut _controller: C,\n","file_path":"src/sc/src/core/common/dispatcher.rs","rank":42,"score":203661.84681914892},{"content":"pub fn log_path_get_offset<P>(path: P) -> Result<Offset, OffsetError>\n\nwhere\n\n P: AsRef<Path>,\n\n{\n\n let log_path = path.as_ref();\n\n\n\n match log_path.file_stem() {\n\n None => Err(OffsetError::InvalidPath),\n\n Some(file_name) => {\n\n if file_name.len() != 20 {\n\n Err(OffsetError::InvalidLogFileName)\n\n } else {\n\n file_name\n\n .to_str()\n\n .unwrap()\n\n .parse()\n\n .map_err(|err: ParseIntError| err.into())\n\n }\n\n }\n\n }\n","file_path":"src/storage/src/util.rs","rank":43,"score":198258.986142402},{"content":"/// Return separator for hex dump\n\npub fn hex_dump_separator() -> String {\n\n \"------------------------------------------------------------------------------\\n\".to_owned()\n\n}\n\n\n\n#[cfg(test)]\n\nmod test {\n\n use super::bytes_to_hex_dump;\n\n\n\n #[test]\n\n fn test_bytes_to_hex_dump() {\n\n let records: Vec<u8> = vec![\n\n 123, 10, 32, 32, 32, 32, 34, 112, 97, 114, 116, 105, 116, 105, 111, 110, 115, 34, 58,\n\n 32, 91, 10, 32, 32, 32, 32, 32, 32, 32, 32, 123, 10, 32, 32, 32, 32, 32, 32, 32, 32,\n\n 32, 32, 32, 32, 34, 105, 100, 34, 58, 32, 48, 44, 10, 32, 32, 32, 32, 32, 32, 32, 32,\n\n 32, 32, 32, 32, 34, 114, 101, 112, 108, 105, 99, 97, 115, 34, 58, 32, 91, 10, 32, 32,\n\n 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 53, 48, 48, 49, 44, 10, 32, 32,\n\n 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 53, 48, 48, 50, 44, 10, 32, 32,\n\n 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 53, 48, 48, 51, 10, 32, 32, 32,\n\n 32, 32, 32, 32, 32, 32, 32, 32, 32, 93, 10, 32, 32, 32, 32, 32, 32, 32, 32, 125, 10,\n\n 32, 32, 32, 32, 93, 10, 125,\n","file_path":"src/cli/src/common/hex_dump.rs","rank":44,"score":197524.55576975818},{"content":"struct ScServerCtx {\n\n ctx: SharedScContext,\n\n sender: Sender<bool>,\n\n}\n\n\n\npub struct SpuTestRunner<T> {\n\n client_id: String,\n\n spu_server_specs: Vec<SpuServer>,\n\n spu_server_ctx: Vec<DefaultSharedGlobalContext>,\n\n spu_senders: Vec<Sender<bool>>,\n\n sc_ctx: RwLock<Option<ScServerCtx>>,\n\n test: T,\n\n}\n\n\n\nimpl<T> SpuTestRunner<T>\n\nwhere\n\n T: SpuTest + Send + Sync + 'static,\n\n{\n\n pub async fn run(client_id: String, test: T) -> Result<(), FlvSocketError> {\n\n debug!(\"starting test harnerss\");\n","file_path":"src/spu/src/tests/fixture/test_runner.rs","rank":45,"score":194485.6133947686},{"content":"pub fn start_internal_server(ctx: SharedContext) {\n\n info!(\"starting internal services\");\n\n\n\n let addr = ctx.config().private_endpoint.clone();\n\n let server = FlvApiServer::new(addr, ctx, ScInternalService::new());\n\n server.run();\n\n}\n","file_path":"src/sc/src/services/private_api/mod.rs","rank":46,"score":192860.22814807057},{"content":"fn process_version_cmd() -> Result<String, CliError> {\n\n println!(\"Fluvio version : {}\", crate::VERSION);\n\n println!(\"Git Commit : {}\", env!(\"GIT_HASH\"));\n\n if let Some(os_info) = option_env!(\"UNAME\") {\n\n println!(\"OS Details : {}\", os_info);\n\n }\n\n println!(\"Rustc Version : {}\", env!(\"RUSTC_VERSION\"));\n\n Ok(\"\".to_owned())\n\n}\n\n\n","file_path":"src/cli/src/root_cli.rs","rank":47,"score":192547.76638174237},{"content":"/// generate server configuration file\n\npub fn build_server_config_file_path(file_name: &'static str) -> PathBuf {\n\n let mut config_file_path = PathBuf::new();\n\n\n\n // stitch-up default configuration file path\n\n config_file_path.push(SERVER_CONFIG_BASE_PATH);\n\n config_file_path.push(SERVER_CONFIG_DIR);\n\n config_file_path.push(file_name);\n\n config_file_path.set_extension(CONFIG_FILE_EXTENTION);\n\n\n\n config_file_path\n\n}\n\n\n\n//\n\n// Unit Tests\n\n//\n\n\n\n#[cfg(test)]\n\npub mod test {\n\n use super::*;\n\n use fluvio_types::defaults::{SC_CONFIG_FILE, SPU_CONFIG_FILE};\n","file_path":"src/utils/src/config_helper.rs","rank":48,"score":191694.17789731245},{"content":"fn default_config(spu_id: SpuId, config: &ConfigOption) -> ConfigOption {\n\n let base_dir = config.base_dir.join(format!(\"spu-logs-{}\", spu_id));\n\n let new_config = config.clone();\n\n new_config.base_dir(base_dir)\n\n}\n\n\n\n/// Create new replica storage. Each replica is stored with 'spu' prefix\n\npub(crate) async fn create_replica_storage(\n\n local_spu: SpuId,\n\n replica: &ReplicaKey,\n\n base_config: &ConfigOption,\n\n) -> Result<FileReplica, StorageError> {\n\n let config = default_config(local_spu, base_config);\n\n FileReplica::create(replica.topic.clone(), replica.partition as u32, 0, &config).await\n\n}\n","file_path":"src/spu/src/core/storage/mod.rs","rank":49,"score":190894.213991921},{"content":"#[async_trait]\n\npub trait SpuValidation {\n\n fn is_already_valid(&self) -> bool;\n\n async fn is_conflict_with(&self, spu_store: &SpuAdminStore) -> Option<SpuId>;\n\n}\n\n\n\n#[async_trait]\n\nimpl SpuValidation for SpuGroupObj {\n\n /// check if I am already been validated\n\n fn is_already_valid(&self) -> bool {\n\n self.status.is_already_valid()\n\n }\n\n\n\n /// check if my group's id is conflict with my spu local store\n\n async fn is_conflict_with(&self, spu_store: &SpuAdminStore) -> Option<SpuId> {\n\n if self.is_already_valid() {\n\n return None;\n\n }\n\n\n\n let min_id = self.spec.min_id as SpuId;\n\n\n\n is_conflict(\n\n spu_store,\n\n self.metadata.uid.clone(),\n\n min_id,\n\n min_id + self.spec.replicas as SpuId,\n\n )\n\n .await\n\n }\n\n}\n","file_path":"src/sc/src/k8/operator/spg_group.rs","rank":50,"score":187727.72699271183},{"content":"/// Detects the target triple of the current build and returns\n\n/// the name of a compatible build target on packages.fluvio.io.\n\n///\n\n/// Returns `Some(Target)` if there is a compatible target, or\n\n/// `None` if this target is unsupported or has no compatible target.\n\npub fn package_target() -> Result<Target, Error> {\n\n let target = PACKAGE_TARGET.parse()?;\n\n Ok(target)\n\n}\n\n\n\n#[derive(Debug, Copy, Clone, PartialEq, Serialize, Deserialize)]\n\n#[allow(non_camel_case_types)]\n\npub enum Target {\n\n #[serde(rename = \"x86_64-apple-darwin\")]\n\n X86_64AppleDarwin,\n\n #[serde(rename = \"x86_64-unknown-linux-musl\")]\n\n X86_64UnknownLinuxMusl,\n\n}\n\n\n\nimpl Target {\n\n pub fn as_str(&self) -> &str {\n\n match self {\n\n Self::X86_64AppleDarwin => \"x86_64-apple-darwin\",\n\n Self::X86_64UnknownLinuxMusl => \"x86_64-unknown-linux-musl\",\n\n }\n","file_path":"src/package-index/src/target.rs","rank":51,"score":187581.6152071529},{"content":"pub fn get_fluvio() -> Result<Command, IoError> {\n\n get_binary(\"fluvio\")\n\n}\n\n\n","file_path":"src/utils/src/bin.rs","rank":52,"score":187581.6152071529},{"content":"/// create server and spin up services, but don't run server\n\npub fn create_services(\n\n local_spu: SpuConfig,\n\n internal: bool,\n\n public: bool,\n\n) -> (\n\n DefaultSharedGlobalContext,\n\n Option<InternalApiServer>,\n\n Option<PublicApiServer>,\n\n) {\n\n let ctx = FileReplicaContext::new_shared_context(local_spu);\n\n\n\n let public_ep_addr = ctx.config().public_socket_addr().to_owned();\n\n let private_ep_addr = ctx.config().private_socket_addr().to_owned();\n\n\n\n let public_server = if public {\n\n Some(create_public_server(public_ep_addr, ctx.clone()))\n\n } else {\n\n None\n\n };\n\n\n","file_path":"src/spu/src/start.rs","rank":53,"score":185291.9797061971},{"content":"pub trait ScConfigBuilder {\n\n fn to_sc_config(self) -> Result<ScConfig, IoError>;\n\n}\n\n\n\n/// streaming controller configuration file\n\n#[derive(Debug, Clone, PartialEq)]\n\npub struct ScConfig {\n\n pub public_endpoint: String,\n\n pub private_endpoint: String,\n\n pub run_k8_dispatchers: bool,\n\n pub namespace: String,\n\n pub x509_auth_scopes: Option<PathBuf>,\n\n}\n\n\n\nimpl ::std::default::Default for ScConfig {\n\n fn default() -> Self {\n\n Self {\n\n public_endpoint: format!(\"0.0.0.0:{}\", SC_PUBLIC_PORT),\n\n private_endpoint: format!(\"0.0.0.0:{}\", SC_PRIVATE_PORT),\n\n run_k8_dispatchers: true,\n\n namespace: \"default\".to_owned(),\n\n x509_auth_scopes: None,\n\n }\n\n }\n\n}\n","file_path":"src/sc/src/config/sc_config.rs","rank":54,"score":185163.8123800348},{"content":"/// Create a channel\n\npub fn new_channel<T>() -> (Sender<T>, Receiver<T>) {\n\n channel(100)\n\n}\n","file_path":"src/sc/src/core/common/channels.rs","rank":55,"score":185051.5562264072},{"content":"fn default_index_max_bytes() -> Size {\n\n SPU_LOG_INDEX_MAX_BYTES\n\n}\n\n\n","file_path":"src/storage/src/config.rs","rank":56,"score":183942.00723078605},{"content":"fn default_segment_max_bytes() -> Size {\n\n SPU_LOG_SEGMENT_MAX_BYTES\n\n}\n\n\n\nimpl ConfigOption {\n\n pub fn new(\n\n base_dir: PathBuf,\n\n index_max_bytes: u32,\n\n index_max_interval_bytes: u32,\n\n segment_max_bytes: u32,\n\n ) -> Self {\n\n ConfigOption {\n\n base_dir,\n\n index_max_bytes,\n\n index_max_interval_bytes,\n\n segment_max_bytes,\n\n }\n\n }\n\n\n\n pub fn base_dir(mut self, dir: PathBuf) -> Self {\n","file_path":"src/storage/src/config.rs","rank":57,"score":183942.00723078605},{"content":"#[allow(clippy::needless_range_loop)]\n\npub fn bytes_to_hex_dump(record: &[u8]) -> String {\n\n let cols = 16;\n\n let record_cnt = record.len();\n\n let mut result = String::new();\n\n let mut collector = String::new();\n\n\n\n for row_idx in 0..record_cnt {\n\n // colunn index\n\n if row_idx % cols == 0 {\n\n result.push_str(&format!(\"{:08x}\", row_idx));\n\n }\n\n\n\n // spacing half way\n\n if row_idx % (cols / 2) == 0 {\n\n result.push_str(\" \");\n\n }\n\n\n\n // convert and add character to collector\n\n collector.push_str(&byte_to_string(&record[row_idx]));\n\n\n","file_path":"src/cli/src/common/hex_dump.rs","rank":58,"score":181706.32349801995},{"content":"#[cfg(unix)]\n\nfn make_executable(file: &mut File) -> Result<(), IoError> {\n\n use std::os::unix::fs::PermissionsExt;\n\n\n\n // Add u+rwx mode to the existing file permissions, leaving others unchanged\n\n let mut permissions = file.metadata()?.permissions();\n\n let mut mode = permissions.mode();\n\n mode |= 0o700;\n\n permissions.set_mode(mode);\n\n\n\n file.set_permissions(permissions)?;\n\n Ok(())\n\n}\n\n\n","file_path":"src/cli/src/install/mod.rs","rank":59,"score":181150.82924778678},{"content":"fn default_index_max_interval_bytes() -> Size {\n\n SPU_LOG_INDEX_MAX_INTERVAL_BYTES\n\n}\n\n\n","file_path":"src/storage/src/config.rs","rank":60,"score":180627.58404179462},{"content":"pub fn main_loop(opt: SpuOpt) {\n\n use std::time::Duration;\n\n\n\n use fluvio_future::task::run_block_on;\n\n use fluvio_future::timer::sleep;\n\n // parse configuration (program exits on error)\n\n let (spu_config, tls_acceptor_option) = opt.process_spu_cli_or_exit();\n\n\n\n println!(\"starting spu server (id:{})\", spu_config.id);\n\n\n\n run_block_on(async move {\n\n let (_ctx, internal_server, public_server) =\n\n create_services(spu_config.clone(), true, true);\n\n\n\n let _public_shutdown = internal_server.unwrap().run();\n\n let _private_shutdown = public_server.unwrap().run();\n\n\n\n if let Some(tls_config) = tls_acceptor_option {\n\n proxy::start_proxy(spu_config, tls_config).await;\n\n }\n\n\n\n println!(\"SPU Version: {} started successfully\", VERSION);\n\n\n\n // infinite loop\n\n loop {\n\n sleep(Duration::from_secs(60)).await;\n\n }\n\n });\n\n}\n\n\n","file_path":"src/spu/src/start.rs","rank":61,"score":179858.67361700776},{"content":"struct SpuSocket {\n\n config: ClientConfig,\n\n socket: SharedAllMultiplexerSocket,\n\n versions: Versions,\n\n}\n\n\n\nimpl SpuSocket {\n\n async fn create_serial_socket(&mut self) -> VersionedSerialSocket {\n\n VersionedSerialSocket::new(\n\n self.socket.clone(),\n\n self.config.clone(),\n\n self.versions.clone(),\n\n )\n\n }\n\n\n\n async fn create_stream<R: Request>(\n\n &mut self,\n\n request: R,\n\n ) -> Result<AsyncResponse<R>, FluvioError> {\n\n let req_msg = RequestMessage::new_request(request);\n","file_path":"src/client/src/spu/spu_pool.rs","rank":62,"score":178934.71807611093},{"content":"pub trait SpuMd<C: MetadataItem> {\n\n fn quick<J>(spu: (J, i32, bool, Option<String>)) -> SpuMetadata<C>\n\n where\n\n J: Into<String>;\n\n}\n\n\n\nimpl<C: MetadataItem> SpuMd<C> for SpuMetadata<C> {\n\n fn quick<J>(spu: (J, i32, bool, Option<String>)) -> SpuMetadata<C>\n\n where\n\n J: Into<String>,\n\n {\n\n let mut spec = SpuSpec::default();\n\n spec.id = spu.1;\n\n spec.rack = spu.3;\n\n\n\n let mut status = SpuStatus::default();\n\n if spu.2 {\n\n status.set_online();\n\n }\n\n\n\n SpuMetadata::new(spu.0.into(), spec, status)\n\n }\n\n}\n\n\n","file_path":"src/controlplane-metadata/src/spu/store.rs","rank":63,"score":178159.63147238822},{"content":"//\n\n/// Validate assigned topic spec parameters and update topic status\n\n/// * error is passed to the topic reason.\n\n///\n\npub fn validate_assigned_topic_parameters(partition_map: &PartitionMaps) -> TopicNextState {\n\n if let Err(err) = partition_map.valid_partition_map() {\n\n TopicStatus::next_resolution_invalid_config(&err.to_string()).into()\n\n } else {\n\n TopicStatus::next_resolution_pending().into()\n\n }\n\n}\n\n\n","file_path":"src/sc/src/controllers/topics/policy.rs","rank":64,"score":177162.63293610784},{"content":"pub fn cert_dir() -> PathBuf {\n\n std::env::current_dir().unwrap().join(\"tls\").join(\"certs\")\n\n}\n\n\n\npub struct Cert {\n\n pub ca: PathBuf,\n\n pub cert: PathBuf,\n\n pub key: PathBuf,\n\n}\n\n\n\nimpl Cert {\n\n pub fn load_client(client_user: &str) -> Self {\n\n let cert_dir = cert_dir();\n\n Cert {\n\n ca: cert_dir.join(\"ca.crt\"),\n\n cert: cert_dir.join(format!(\"client-{}.crt\", client_user)),\n\n key: cert_dir.join(format!(\"client-{}.key\", client_user)),\n\n }\n\n }\n\n\n\n pub fn load_server() -> Self {\n\n let cert_dir = cert_dir();\n\n Cert {\n\n ca: cert_dir.join(\"ca.crt\"),\n\n cert: cert_dir.join(\"server.crt\"),\n\n key: cert_dir.join(\"server.key\"),\n\n }\n\n }\n\n}\n","file_path":"tests/runner/src/tls.rs","rank":65,"score":175548.91157602335},{"content":"fn process_completions_cmd(shell: CompletionShell) -> Result<String, CliError> {\n\n let mut app: structopt::clap::App = Root::clap();\n\n match shell {\n\n CompletionShell::Bash(opt) => {\n\n app.gen_completions_to(opt.name, Shell::Bash, &mut std::io::stdout());\n\n }\n\n // CompletionShell::Zsh(opt) => {\n\n // app.gen_completions_to(opt.name, Shell::Zsh, &mut std::io::stdout());\n\n // }\n\n CompletionShell::Fish(opt) => {\n\n app.gen_completions_to(opt.name, Shell::Fish, &mut std::io::stdout());\n\n }\n\n }\n\n Ok(\"\".to_string())\n\n}\n\n\n","file_path":"src/cli/src/root_cli.rs","rank":66,"score":175280.9543787089},{"content":"/// convert SpuGroup to Statefulset\n\npub fn convert_cluster_to_statefulset(\n\n group_spec: &K8SpuGroupSpec,\n\n metadata: &ObjectMeta,\n\n group_name: &str,\n\n group_svc_name: String,\n\n namespace: &str,\n\n tls: Option<&TlsConfig>,\n\n) -> InputK8Obj<StatefulSetSpec> {\n\n let statefulset_name = format!(\"flv-spg-{}\", group_name);\n\n let spec = generate_stateful(group_spec, group_name, group_svc_name, namespace, tls);\n\n let owner_ref = metadata.make_owner_reference::<K8SpuGroupSpec>();\n\n\n\n InputK8Obj {\n\n api_version: StatefulSetSpec::api_version(),\n\n kind: StatefulSetSpec::kind(),\n\n metadata: InputObjectMeta {\n\n name: statefulset_name,\n\n namespace: metadata.namespace().to_string(),\n\n owner_references: vec![owner_ref],\n\n ..Default::default()\n\n },\n\n spec,\n\n ..Default::default()\n\n }\n\n}\n\n\n","file_path":"src/sc/src/k8/operator/conversion.rs","rank":67,"score":174893.4018050201},{"content":"pub fn run_k8_operators(\n\n namespace: String,\n\n k8_client: SharedK8Client,\n\n ctx: SharedContext,\n\n tls: Option<TlsConfig>,\n\n) {\n\n SpgOperator::new(k8_client.clone(), namespace.clone(), ctx.clone(), tls).run();\n\n\n\n let svc_ctx: StoreContext<SpuServicespec> = StoreContext::new();\n\n\n\n K8ClusterStateDispatcher::<SpuServicespec, _>::start(namespace, k8_client, svc_ctx.clone());\n\n SpuServiceController::start(ctx, svc_ctx);\n\n}\n","file_path":"src/sc/src/k8/operator/mod.rs","rank":68,"score":174882.34195276757},{"content":"pub fn main_k8_loop(opt: ScOpt) {\n\n use std::time::Duration;\n\n\n\n use fluvio_future::task::run_block_on;\n\n use fluvio_future::timer::sleep;\n\n\n\n use crate::init::start_main_loop;\n\n // parse configuration (program exits on error)\n\n let ((sc_config, auth_policy), k8_config, tls_option) = opt.parse_cli_or_exit();\n\n\n\n println!(\"starting sc server with k8: {}\", VERSION);\n\n\n\n run_block_on(async move {\n\n // init k8 service\n\n let k8_client = new_shared(k8_config).expect(\"problem creating k8 client\");\n\n let namespace = sc_config.namespace.clone();\n\n let ctx = start_main_loop((sc_config.clone(), auth_policy), k8_client.clone()).await;\n\n\n\n run_k8_operators(\n\n namespace.clone(),\n","file_path":"src/sc/src/k8/mod.rs","rank":69,"score":174038.35005651397},{"content":"pub fn install_println<S: AsRef<str>>(string: S) {\n\n if std::env::var(\"FLUVIO_BOOTSTRAP\").is_ok() {\n\n println!(\"\\x1B[1;34mfluvio:\\x1B[0m {}\", string.as_ref());\n\n } else {\n\n println!(\"{}\", string.as_ref());\n\n }\n\n}\n","file_path":"src/cli/src/install/mod.rs","rank":70,"score":173963.57153253473},{"content":"pub fn install_sys(opt: InstallCommand) -> Result<(), CliError> {\n\n let mut builder = ClusterInstaller::new().with_namespace(opt.k8_config.namespace);\n\n\n\n match opt.k8_config.chart_location {\n\n // If a chart location is given, use it\n\n Some(chart_location) => {\n\n builder = builder.with_local_chart(chart_location);\n\n }\n\n // If we're in develop mode (but no explicit chart location), use local path\n\n None if opt.develop => {\n\n builder = builder.with_local_chart(\"./k8-util/helm\");\n\n }\n\n _ => (),\n\n }\n\n let installer = builder.build()?;\n\n installer._install_sys()?;\n\n println!(\"fluvio sys chart has been installed\");\n\n Ok(())\n\n}\n","file_path":"src/cli/src/cluster/install/k8.rs","rank":71,"score":172378.59851162424},{"content":"pub fn process_delete_cluster<O>(\n\n _out: std::sync::Arc<O>,\n\n opt: DeleteClusterOpt,\n\n) -> Result<String, CliError>\n\nwhere\n\n O: Terminal,\n\n{\n\n let cluster_name = opt.cluster_name;\n\n\n\n let mut config_file = match ConfigFile::load(None) {\n\n Ok(config_file) => config_file,\n\n Err(e) => {\n\n println!(\"No config can be found: {}\", e);\n\n return Ok(\"\".to_string());\n\n }\n\n };\n\n\n\n let config = config_file.mut_config();\n\n\n\n // Check if the named cluster exists\n","file_path":"src/cli/src/profile/mod.rs","rank":72,"score":172191.84016905611},{"content":"/// create batches with produce and records count\n\npub fn create_batch_with_producer(producer: i64, records: u16) -> DefaultBatch {\n\n let mut batches = DefaultBatch::default();\n\n let header = batches.get_mut_header();\n\n header.magic = 2;\n\n header.producer_id = producer;\n\n header.producer_epoch = -1;\n\n\n\n for _ in 0..records {\n\n let mut record = DefaultRecord::default();\n\n let bytes: Vec<u8> = vec![10, 20];\n\n record.value = bytes.into();\n\n batches.add_record(record);\n\n }\n\n\n\n batches\n\n}\n\n\n","file_path":"src/storage/src/fixture.rs","rank":73,"score":171912.21213032387},{"content":"/// get path to the binary\n\npub fn get_binary(bin_name: &str) -> Result<Command, IoError> {\n\n let current_exe =\n\n std::env::current_exe().expect(\"Failed to get the path of the integration test binary\");\n\n let mut bin_dir = current_exe\n\n .parent()\n\n .expect(\"failed to get parent\")\n\n .to_owned();\n\n bin_dir.push(bin_name);\n\n bin_dir.set_extension(std::env::consts::EXE_EXTENSION);\n\n\n\n debug!(\"try to get binary: {:#?}\", bin_dir);\n\n if !bin_dir.exists() {\n\n Err(IoError::new(\n\n ErrorKind::NotFound,\n\n format!(\"{} not founded in: {:#?}\", bin_name, bin_dir),\n\n ))\n\n } else {\n\n Ok(Command::new(bin_dir.into_os_string()))\n\n }\n\n}\n\n\n\nuse std::fs::File;\n\nuse std::process::Stdio;\n\n\n","file_path":"src/utils/src/bin.rs","rank":74,"score":171311.34188880972},{"content":"/// create sample batches with variable number of records\n\nfn create_batch(records: u16) -> DefaultBatch {\n\n let mut batches = DefaultBatch::default();\n\n let header = batches.get_mut_header();\n\n header.magic = 2;\n\n header.producer_id = 20;\n\n header.producer_epoch = -1;\n\n\n\n for i in 0..records {\n\n let msg = format!(\"record {}\", i);\n\n let record: DefaultRecord = msg.into();\n\n batches.add_record(record);\n\n }\n\n\n\n batches\n\n}\n\n\n\n// create new replica and add two batches\n\nasync fn setup_replica() -> Result<FileReplica, StorageError> {\n\n let option = default_option();\n\n\n","file_path":"src/storage/tests/replica_test.rs","rank":75,"score":169361.1765316037},{"content":"#[allow(unused)]\n\npub fn get_binary(bin_name: &str) -> Result<Command, IoError> {\n\n let current_exe =\n\n std::env::current_exe().expect(\"Failed to get the path of the integration test binary\");\n\n let mut bin_dir = current_exe\n\n .parent()\n\n .expect(\"failed to get parent\")\n\n .to_owned();\n\n bin_dir.push(bin_name);\n\n bin_dir.set_extension(std::env::consts::EXE_EXTENSION);\n\n\n\n debug!(\"try to get binary: {:#?}\", bin_dir);\n\n if !bin_dir.exists() {\n\n Err(IoError::new(\n\n ErrorKind::NotFound,\n\n format!(\"{} not founded in: {:#?}\", bin_name, bin_dir),\n\n ))\n\n } else {\n\n Ok(Command::new(bin_dir.into_os_string()))\n\n }\n\n}\n\n\n\nmod cmd_util {\n\n\n","file_path":"src/cli/src/cluster/util.rs","rank":76,"score":168735.90252817783},{"content":"pub fn create_partition_name(topic_name: &str, idx: &i32) -> String {\n\n format!(\"{}-{}\", topic_name, idx)\n\n}\n","file_path":"src/dataplane-protocol/src/common.rs","rank":77,"score":168686.799115767},{"content":"/// Encode all partitions for a topic in Kf format.\n\npub fn topic_partitions_to_kf_partitions(\n\n partitions: &PartitionLocalStore,\n\n topic: &String,\n\n) -> Vec<MetadataResponsePartition> {\n\n let mut kf_partitions = vec![];\n\n\n\n for (idx, partition) in partitions.topic_partitions(topic).iter().enumerate() {\n\n kf_partitions.push(MetadataResponsePartition {\n\n error_code: KfErrorCode::None,\n\n partition_index: idx as i32,\n\n leader_id: partition.spec.leader,\n\n leader_epoch: 0,\n\n replica_nodes: partition.spec.replicas.clone(),\n\n isr_nodes: partition.status.live_replicas().clone(),\n\n offline_replicas: partition.status.offline_replicas(),\n\n })\n\n }\n\n\n\n kf_partitions\n\n}\n","file_path":"src/sc/src/services/public_api/metadata/fetch.rs","rank":78,"score":166012.21578300878},{"content":"fn fluvio_bin_dir() -> Result<PathBuf, CliError> {\n\n let home =\n\n dirs::home_dir().ok_or_else(|| IoError::new(ErrorKind::NotFound, \"Homedir not found\"))?;\n\n Ok(home.join(\".fluvio/bin/\"))\n\n}\n\n\n\n/// Fetches the latest version of the package with the given ID\n\n#[instrument(\n\n skip(agent, target, id),\n\n fields(%target, id = %id.display())\n\n)]\n\nasync fn fetch_latest_version<T>(\n\n agent: &HttpAgent,\n\n id: &PackageId<T>,\n\n target: Target,\n\n) -> Result<Version, CliError> {\n\n let request = agent.request_package(id)?;\n\n debug!(\n\n url = %request.url(),\n\n \"Requesting package manifest:\",\n","file_path":"src/cli/src/install/mod.rs","rank":79,"score":163206.60787920497},{"content":"/// Getting server hostname from K8 context\n\nfn check_cluster_server_host() -> Result<StatusCheck, CheckError> {\n\n let config = K8Config::load()?;\n\n let context = match config {\n\n K8Config::Pod(_) => {\n\n return Ok(StatusCheck::Working(\n\n \"Pod config found, ignoring the check\".to_string(),\n\n ))\n\n }\n\n K8Config::KubeConfig(context) => context,\n\n };\n\n\n\n let cluster_context = context\n\n .config\n\n .current_cluster()\n\n .ok_or(CheckError::NoActiveKubernetesContext)?;\n\n let server_url = cluster_context.cluster.server.to_owned();\n\n let url =\n\n Url::parse(&server_url).map_err(|source| CheckError::BadKubernetesServerUrl { source })?;\n\n let host = url\n\n .host()\n","file_path":"src/cluster/src/check.rs","rank":80,"score":163117.31866026943},{"content":"struct SimplePolicy {}\n\n\n\nimpl SimplePolicy {\n\n fn new() -> Self {\n\n SimplePolicy {}\n\n }\n\n}\n\n\n\nimpl ElectionPolicy for SimplePolicy {\n\n fn potential_leader_score(\n\n &self,\n\n replica_status: &ReplicaStatus,\n\n leader: &ReplicaStatus,\n\n ) -> ElectionScoring {\n\n let lag = leader.leo - replica_status.leo;\n\n if lag < 4 {\n\n ElectionScoring::Score(lag as u16)\n\n } else {\n\n ElectionScoring::NotSuitable\n\n }\n","file_path":"src/sc/src/controllers/partitions/reducer.rs","rank":81,"score":161694.040749852},{"content":"pub fn display_current_profile<O>(out: std::sync::Arc<O>)\n\nwhere\n\n O: Terminal,\n\n{\n\n match ConfigFile::load(None) {\n\n Ok(config_file) => {\n\n if let Some(profile) = config_file.config().current_profile_name() {\n\n t_println!(out, \"{}\", profile);\n\n } else {\n\n t_println!(out, \"no current profile set\");\n\n }\n\n }\n\n Err(_) => t_println!(out, \"no profile can be founded\"),\n\n }\n\n}\n","file_path":"src/cli/src/profile/context.rs","rank":82,"score":160275.68229680642},{"content":"#[allow(unused)]\n\npub fn open_log(prefix: &str) -> (File, File) {\n\n let output = File::create(format!(\"/tmp/flv_{}.out\", prefix)).expect(\"log file\");\n\n let error = File::create(format!(\"/tmp/flv_{}.log\", prefix)).expect(\"err file\");\n\n\n\n (output, error)\n\n}\n\n\n","file_path":"src/utils/src/bin.rs","rank":83,"score":160057.91368619585},{"content":"type FileReplicaContext = GlobalContext<FileReplica>;\n\n\n\nconst VERSION: &str = env!(\"CARGO_PKG_VERSION\");\n\n\n","file_path":"src/spu/src/start.rs","rank":84,"score":159683.35318296106},{"content":"/// handle watch request by spawning watch controller for each store\n\npub fn handle_watch_request<T, AC>(\n\n request: RequestMessage<WatchRequest>,\n\n auth_ctx: &AuthServiceContext<AC>,\n\n sink: InnerExclusiveFlvSink<T>,\n\n end_event: Arc<Event>,\n\n) where\n\n T: AsyncWrite + AsyncRead + Unpin + Send + ZeroCopyWrite + 'static,\n\n{\n\n debug!(\"handling watch request\");\n\n let (header, req) = request.get_header_request();\n\n\n\n match req {\n\n WatchRequest::Topic(_) => unimplemented!(),\n\n WatchRequest::Spu(epoch) => WatchController::<T, SpuSpec>::update(\n\n epoch,\n\n sink,\n\n end_event,\n\n auth_ctx.global_ctx.spus().clone(),\n\n header,\n\n ),\n","file_path":"src/sc/src/services/public_api/watch.rs","rank":85,"score":158668.22438208546},{"content":"/// Customize System Test\n\npub trait SpuTest: Sized {\n\n type ResponseFuture: Send + Future<Output = Result<(), FlvSocketError>>;\n\n\n\n /// environment configuration\n\n fn env_configuration(&self) -> TestGenerator;\n\n\n\n /// number of followers\n\n fn followers(&self) -> usize;\n\n\n\n /// replicas. by default, it's empty\n\n fn replicas(&self) -> Vec<ReplicaKey> {\n\n vec![]\n\n }\n\n\n\n /// main entry point\n\n fn main_test(&self, runner: Arc<SpuTestRunner<Self>>) -> Self::ResponseFuture;\n\n}\n","file_path":"src/spu/src/tests/fixture/mod.rs","rank":86,"score":158509.53241412842},{"content":"/// Customize System Test\n\npub trait ScTest: Sized {\n\n type ResponseFuture: Send + Future<Output = Result<(), FlvSocketError>>;\n\n\n\n /// environment configuration\n\n fn env_configuration(&self) -> TestGenerator;\n\n\n\n fn topics(&self) -> Vec<(String, Vec<Vec<SpuId>>)>;\n\n\n\n /// main entry point\n\n fn main_test(&self, runner: Arc<ScTestRunner<Self>>) -> Self::ResponseFuture;\n\n}\n","file_path":"src/sc/src/tests/fixture/mod.rs","rank":87,"score":158502.15724790248},{"content":"#[async_trait]\n\npub trait ReplicaLeader: Send + Sync {\n\n type OffsetPartitionResponse: PartitionOffset;\n\n type Client: Client;\n\n\n\n fn config(&self) -> &ReplicaLeaderConfig;\n\n\n\n \n\n fn topic(&self) -> &str {\n\n &self.config().topic()\n\n }\n\n\n\n fn partition(&self) -> i32 {\n\n self.config().partition()\n\n }\n\n\n\n fn addr(&self) -> &str;\n\n\n\n fn mut_client(&mut self) -> &mut Self::Client;\n\n\n\n // fetch offsets for\n","file_path":"src/client/src/replica/leader.rs","rank":88,"score":157518.03382083654},{"content":"pub fn read_bytes_from_file<P>(path: P) -> Result<Vec<u8>, io::Error>\n\nwhere\n\n P: AsRef<Path>,\n\n{\n\n let file_path = path.as_ref();\n\n info!(\"test file: {}\", file_path.display());\n\n let mut f = File::open(file_path)?;\n\n let mut buffer = Vec::new();\n\n f.read_to_end(&mut buffer)?;\n\n Ok(buffer)\n\n}\n\n\n","file_path":"src/storage/src/fixture.rs","rank":89,"score":157458.31501066964},{"content":"fn print_sc_logs() {\n\n use std::process::Command;\n\n\n\n let _ = Command::new(\"kubectl\")\n\n .arg(\"logs\")\n\n .arg(\"flv-sc\")\n\n .print()\n\n .inherit();\n\n\n\n let _ = Command::new(\"kubectl\")\n\n .arg(\"get\")\n\n .arg(\"spu\")\n\n .print()\n\n .inherit();\n\n}\n\n*/\n","file_path":"tests/runner/src/environment/k8.rs","rank":90,"score":157002.22130866878},{"content":"struct SpuOnlineStatus {\n\n online: bool,\n\n // last time status was known\n\n time: Instant,\n\n}\n\n\n\nimpl SpuOnlineStatus {\n\n fn new() -> Self {\n\n Self {\n\n online: false,\n\n time: Instant::now(),\n\n }\n\n }\n\n}\n\n\n\n/// Keep track of SPU status\n\n/// if SPU has not send heart beat within a period, it is considered down\n\npub struct SpuController {\n\n spus: StoreContext<SpuSpec>,\n\n health_receiver: Receiver<SpuAction>,\n","file_path":"src/sc/src/controllers/spus/controller.rs","rank":91,"score":156979.36336869633},{"content":" pub trait Terminal: Sized {\n\n fn print(&self, msg: &str);\n\n fn println(&self, msg: &str);\n\n\n\n fn render_list<T>(self: Arc<Self>, list: &T, mode: OutputType) -> Result<(), CliError>\n\n where\n\n T: TableOutputHandler + Serialize,\n\n {\n\n if mode.is_table() {\n\n let render = TableRenderer::new(self);\n\n render.render(list, false);\n\n } else {\n\n let render = SerdeRenderer::new(self);\n\n render.render(&list, mode.into())?;\n\n }\n\n\n\n Ok(())\n\n }\n\n\n\n fn render_table<T: TableOutputHandler>(self: Arc<Self>, val: &T, indent: bool) {\n","file_path":"src/cli/src/output/mod.rs","rank":92,"score":154231.18898023086},{"content":"fn default_base_dir() -> PathBuf {\n\n Path::new(\"/tmp\").to_path_buf()\n\n}\n\n\n","file_path":"src/storage/src/config.rs","rank":93,"score":152434.6667583563},{"content":"fn default_option() -> ConfigOption {\n\n ConfigOption {\n\n segment_max_bytes: 10000,\n\n base_dir: temp_dir().join(TEST_REP_DIR),\n\n index_max_interval_bytes: 1000,\n\n index_max_bytes: 1000,\n\n }\n\n}\n\n\n","file_path":"src/storage/tests/replica_test.rs","rank":94,"score":152018.8977997524},{"content":"#[derive(Debug)]\n\nstruct ScopeBindings(HashMap<String, Vec<String>>);\n\n\n\nimpl ScopeBindings {\n\n pub fn load(scope_binding_file_path: &Path) -> Result<Self, IoError> {\n\n let file = std::fs::read_to_string(scope_binding_file_path)?;\n\n let scope_bindings = Self(serde_json::from_str(&file)?);\n\n debug!(\"scope bindings loaded {:?}\", scope_bindings);\n\n Ok(scope_bindings)\n\n }\n\n pub fn get_scopes(&self, principal: &str) -> Vec<String> {\n\n trace!(\"getting scopes for principal {:?}\", principal);\n\n if let Some(scopes) = self.0.get(principal) {\n\n trace!(\"scopes found for principal {:?}: {:?}\", principal, scopes);\n\n scopes.clone()\n\n } else {\n\n trace!(\"scopes not found for principal {:?}\", principal);\n\n Vec::new()\n\n }\n\n }\n\n}\n","file_path":"src/auth/src/x509/authenticator.rs","rank":95,"score":149360.81397812214},{"content":"#[allow(clippy::needless_range_loop)]\n\npub fn validate_message(iter: u16, offset: i64, topic: &str, option: &TestOption, data: &[u8]) {\n\n let prefix_string = generate_pre_fix(topic, offset);\n\n let prefix = prefix_string.as_bytes().to_vec();\n\n let prefix_len = prefix.len();\n\n\n\n let message_len = option.produce.record_size + prefix_len;\n\n assert_eq!(\n\n data.len(),\n\n message_len,\n\n \"message should be: {}\",\n\n message_len\n\n );\n\n\n\n // check prefix\n\n for i in 0..prefix_len {\n\n assert!(\n\n data[i] == prefix[i],\n\n \"prefix failed, iter: {}, index: {}, data: {}, prefix: {}, data len: {}, offset: {}, topic: {}\",\n\n iter,\n\n i,\n","file_path":"tests/runner/src/tests/smoke/message.rs","rank":96,"score":144540.9149003571},{"content":"/// Converts a byte to string character\n\nfn byte_to_string(byte: &u8) -> String {\n\n if 0x20 <= *byte && *byte < 0x7f {\n\n format!(\"{}\", *byte as char)\n\n } else if *byte == 0xa {\n\n \".\".to_owned()\n\n } else {\n\n \" \".to_owned()\n\n }\n\n}\n\n\n","file_path":"src/cli/src/common/hex_dump.rs","rank":97,"score":142009.3609950075},{"content":"fn test_repl_id() -> ReplicaKey {\n\n ReplicaKey::new(\"topic1\", 0)\n\n}\n\n\n","file_path":"src/spu/src/tests/suites/test_offsets.rs","rank":98,"score":141545.29065710047},{"content":"fn test_repl_id() -> ReplicaKey {\n\n ReplicaKey::new(\"topic1\", 0)\n\n}\n\n\n","file_path":"src/spu/src/tests/suites/test_fetch.rs","rank":99,"score":141545.29065710047}],"string":"[\n {\n \"content\": \"/// create new local cluster and profile\\n\\npub fn set_local_context(local_config: LocalOpt) -> Result<String, CliError> {\\n\\n let local_addr = local_config.local;\\n\\n let mut config_file = ConfigFile::load_default_or_new()?;\\n\\n\\n\\n let config = config_file.mut_config();\\n\\n\\n\\n // check if local cluster exists otherwise, create new one\\n\\n match config.cluster_mut(LOCAL_PROFILE) {\\n\\n Some(cluster) => {\\n\\n cluster.addr = local_addr.clone();\\n\\n cluster.tls = local_config.tls.try_into()?;\\n\\n }\\n\\n None => {\\n\\n let mut local_cluster = FluvioConfig::new(local_addr.clone());\\n\\n local_cluster.tls = local_config.tls.try_into()?;\\n\\n config.add_cluster(local_cluster, LOCAL_PROFILE.to_owned());\\n\\n }\\n\\n };\\n\\n\\n\\n // check if we local profile exits otherwise, create new one, then set it's cluster\\n\",\n \"file_path\": \"src/cli/src/profile/context.rs\",\n \"rank\": 0,\n \"score\": 343995.7005511477\n },\n {\n \"content\": \"#[async_trait]\\n\\npub trait SpuLocalStorePolicy<C>\\n\\nwhere\\n\\n C: MetadataItem,\\n\\n{\\n\\n async fn online_status(&self) -> HashSet<SpuId>;\\n\\n\\n\\n async fn online_spu_count(&self) -> i32;\\n\\n\\n\\n async fn spu_used_for_replica(&self) -> i32;\\n\\n\\n\\n async fn online_spu_ids(&self) -> Vec<i32>;\\n\\n\\n\\n async fn spu_ids(&self) -> Vec<i32>;\\n\\n\\n\\n async fn online_spus(&self) -> Vec<SpuMetadata<C>>;\\n\\n\\n\\n async fn custom_spus(&self) -> Vec<SpuMetadata<C>>;\\n\\n\\n\\n async fn get_by_id(&self, id: i32) -> Option<SpuMetadata<C>>;\\n\\n\\n\",\n \"file_path\": \"src/controlplane-metadata/src/spu/store.rs\",\n \"rank\": 1,\n \"score\": 259352.44899254735\n },\n {\n \"content\": \"pub fn run_cli(args: &[String]) -> eyre::Result<String> {\\n\\n run_block_on(async move {\\n\\n let terminal = Arc::new(PrintTerminal::new());\\n\\n\\n\\n let root_args: Root = Root::from_iter(args);\\n\\n let output = match root_args {\\n\\n Root::Consume(consume) => process_consume_log(terminal.clone(), consume).await?,\\n\\n Root::Produce(produce) => process_produce_record(terminal.clone(), produce).await?,\\n\\n Root::SPU(spu) => process_spu(terminal.clone(), spu).await?,\\n\\n Root::SPUGroup(spu_group) => process_spu_group(terminal.clone(), spu_group).await?,\\n\\n Root::CustomSPU(custom_spu) => process_custom_spu(terminal.clone(), custom_spu).await?,\\n\\n Root::Topic(topic) => process_topic(terminal.clone(), topic).await?,\\n\\n Root::Partition(partition) => partition.process_partition(terminal.clone()).await?,\\n\\n Root::Profile(profile) => process_profile(terminal.clone(), profile).await?,\\n\\n Root::Cluster(cluster) => process_cluster(terminal.clone(), cluster).await?,\\n\\n #[cfg(any(feature = \\\"cluster_components\\\", feature = \\\"cluster_components_rustls\\\"))]\\n\\n Root::Run(opt) => process_run(opt)?,\\n\\n Root::Install(opt) => opt.process().await?,\\n\\n Root::Update(opt) => opt.process().await?,\\n\\n Root::Version(_) => process_version_cmd()?,\\n\\n Root::Completions(shell) => process_completions_cmd(shell)?,\\n\\n Root::External(args) => process_external_subcommand(args)?,\\n\\n };\\n\\n Ok(output)\\n\\n })\\n\\n}\\n\\n\\n\\nuse crate::Terminal;\\n\\n\\n\",\n \"file_path\": \"src/cli/src/root_cli.rs\",\n \"rank\": 2,\n \"score\": 255897.48199925813\n },\n {\n \"content\": \"// returns a tuple (topic_name, idx)\\n\\npub fn decompose_partition_name(partition_name: &str) -> Result<(String, i32), PartitionError> {\\n\\n let dash_pos = partition_name.rfind('-');\\n\\n if dash_pos.is_none() {\\n\\n return Err(PartitionError::InvalidSyntax(partition_name.to_owned()));\\n\\n }\\n\\n\\n\\n let pos = dash_pos.unwrap();\\n\\n if (pos + 1) >= partition_name.len() {\\n\\n return Err(PartitionError::InvalidSyntax(partition_name.to_owned()));\\n\\n }\\n\\n\\n\\n let topic_name = &partition_name[..pos];\\n\\n let idx_string = &partition_name[(pos + 1)..];\\n\\n let idx = match idx_string.parse::<i32>() {\\n\\n Ok(n) => n,\\n\\n Err(_) => {\\n\\n return Err(PartitionError::InvalidSyntax(partition_name.to_owned()));\\n\\n }\\n\\n };\\n\\n\\n\\n Ok((topic_name.to_string(), idx))\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/types/src/partition.rs\",\n \"rank\": 3,\n \"score\": 254370.58556398243\n },\n {\n \"content\": \"/// find status matching it,\\n\\nfn find_status(status: &mut Vec<ReplicaStatus>, spu: SpuId) -> Option<&'_ mut ReplicaStatus> {\\n\\n status.iter_mut().find(|status| status.spu == spu)\\n\\n}\\n\\n\\n\\n#[derive(Decode, Encode, Debug, Clone, PartialEq)]\\n\\n#[cfg_attr(feature = \\\"use_serde\\\", derive(serde::Serialize, serde::Deserialize))]\\n\\npub enum PartitionResolution {\\n\\n Offline, // No leader available for serving partition\\n\\n Online, // Partition is running normally, status contains replica info\\n\\n LeaderOffline, // Election has failed, no suitable leader has been founded\\n\\n ElectionLeaderFound, // New leader has been selected\\n\\n}\\n\\n\\n\\nimpl Default for PartitionResolution {\\n\\n fn default() -> Self {\\n\\n PartitionResolution::Offline\\n\\n }\\n\\n}\\n\\n\\n\\n#[derive(Decode, Encode, Debug, Clone, PartialEq)]\\n\",\n \"file_path\": \"src/controlplane-metadata/src/partition/status.rs\",\n \"rank\": 4,\n \"score\": 247492.86660216842\n },\n {\n \"content\": \"struct ScServerCtx {\\n\\n ctx: SharedScContext,\\n\\n sender: Sender<bool>,\\n\\n}\\n\",\n \"file_path\": \"src/spu/src/tests/fixture/spu_client.rs\",\n \"rank\": 5,\n \"score\": 247200.08897528314\n },\n {\n \"content\": \"/// Generate a random client group key (50001 to 65535)\\n\\npub fn generate_group_id() -> String {\\n\\n format!(\\\"fluvio-consumer-{}\\\", thread_rng().gen_range(50001, 65535))\\n\\n}\\n\\n\\n\\n#[allow(dead_code)]\\n\",\n \"file_path\": \"src/utils/src/generators.rs\",\n \"rank\": 6,\n \"score\": 245921.92256248108\n },\n {\n \"content\": \"fn process_external_subcommand(mut args: Vec<String>) -> Result<String, CliError> {\\n\\n use std::process::Command;\\n\\n use which::{CanonicalPath, Error as WhichError};\\n\\n\\n\\n // The external subcommand's name is given as the first argument, take it.\\n\\n let cmd = args.remove(0);\\n\\n\\n\\n // Check for a matching external command in the environment\\n\\n let external_subcommand = format!(\\\"fluvio-{}\\\", cmd);\\n\\n let subcommand_path = match CanonicalPath::new(&external_subcommand) {\\n\\n Ok(path) => path,\\n\\n Err(WhichError::CannotFindBinaryPath) => {\\n\\n println!(\\n\\n \\\"Unable to find plugin '{}'. Make sure it is executable and in your PATH.\\\",\\n\\n &external_subcommand\\n\\n );\\n\\n std::process::exit(1);\\n\\n }\\n\\n other => other?,\\n\\n };\\n\",\n \"file_path\": \"src/cli/src/root_cli.rs\",\n \"rank\": 7,\n \"score\": 244460.4270549144\n },\n {\n \"content\": \"/// compute profile name, if name exists in the cli option, we use that\\n\\n/// otherwise, we look up k8 config context name\\n\\nfn compute_profile_name() -> Result<String, CliError> {\\n\\n let k8_config = K8Config::load()?;\\n\\n\\n\\n let kc_config = match k8_config {\\n\\n K8Config::Pod(_) => return Err(CliError::Other(\\\"Pod config is not valid here\\\".to_owned())),\\n\\n K8Config::KubeConfig(config) => config,\\n\\n };\\n\\n\\n\\n if let Some(ctx) = kc_config.config.current_context() {\\n\\n Ok(ctx.name.to_owned())\\n\\n } else {\\n\\n Err(CliError::Other(\\\"no context found\\\".to_owned()))\\n\\n }\\n\\n}\\n\\n\\n\\n/// create new k8 cluster and profile\\n\\npub async fn set_k8_context(opt: K8Opt, external_addr: String) -> Result<Profile, CliError> {\\n\\n let mut config_file = ConfigFile::load_default_or_new()?;\\n\\n let config = config_file.mut_config();\\n\\n\\n\",\n \"file_path\": \"src/cli/src/profile/k8.rs\",\n \"rank\": 8,\n \"score\": 244292.47638390688\n },\n {\n \"content\": \"// generate replication folder name\\n\\nfn replica_dir_name<S: AsRef<str>>(topic_name: S, partition_index: Size) -> String {\\n\\n format!(\\\"{}-{}\\\", topic_name.as_ref(), partition_index)\\n\\n}\\n\\n\\n\\n#[cfg(test)]\\n\\nmod tests {\\n\\n\\n\\n use tracing::debug;\\n\\n use std::env::temp_dir;\\n\\n use std::fs;\\n\\n use std::fs::metadata;\\n\\n use std::io::Cursor;\\n\\n\\n\\n use fluvio_future::test_async;\\n\\n use dataplane::batch::DefaultBatch;\\n\\n use dataplane::{Offset, ErrorCode};\\n\\n use dataplane::core::{Decoder, Encoder};\\n\\n use dataplane::fetch::FilePartitionResponse;\\n\\n use dataplane::record::RecordSet;\\n\\n use flv_util::fixture::ensure_clean_dir;\\n\",\n \"file_path\": \"src/storage/src/replica.rs\",\n \"rank\": 9,\n \"score\": 242537.49587474784\n },\n {\n \"content\": \"type Config = (ScConfig, Option<BasicRbacPolicy>);\\n\\n\\n\\n/// cli options\\n\\n#[derive(Debug, StructOpt, Default)]\\n\\n#[structopt(name = \\\"sc-server\\\", about = \\\"Streaming Controller\\\")]\\n\\npub struct ScOpt {\\n\\n #[structopt(long)]\\n\\n /// Address for external service\\n\\n bind_public: Option<String>,\\n\\n\\n\\n #[structopt(long)]\\n\\n /// Address for internal service\\n\\n bind_private: Option<String>,\\n\\n\\n\\n // k8 namespace\\n\\n #[structopt(short = \\\"n\\\", long = \\\"namespace\\\", value_name = \\\"namespace\\\")]\\n\\n namespace: Option<String>,\\n\\n\\n\\n #[structopt(flatten)]\\n\\n tls: TlsConfig,\\n\",\n \"file_path\": \"src/sc/src/cli.rs\",\n \"rank\": 10,\n \"score\": 237499.15741889182\n },\n {\n \"content\": \"// start server\\n\\npub fn create_public_server(addr: String, ctx: DefaultSharedGlobalContext) -> PublicApiServer {\\n\\n info!(\\n\\n \\\"starting SPU: {} at public service at: {}\\\",\\n\\n ctx.local_spu_id(),\\n\\n addr\\n\\n );\\n\\n\\n\\n FlvApiServer::new(addr, ctx, PublicService::new())\\n\\n}\\n\",\n \"file_path\": \"src/spu/src/services/public/mod.rs\",\n \"rank\": 11,\n \"score\": 234291.874242707\n },\n {\n \"content\": \"// start server\\n\\npub fn create_internal_server(addr: String, ctx: DefaultSharedGlobalContext) -> InternalApiServer {\\n\\n info!(\\n\\n \\\"starting SPU: {} at internal service at: {}\\\",\\n\\n ctx.local_spu_id(),\\n\\n addr\\n\\n );\\n\\n\\n\\n FlvApiServer::new(addr, ctx, InternalService::new())\\n\\n}\\n\",\n \"file_path\": \"src/spu/src/services/internal/mod.rs\",\n \"rank\": 12,\n \"score\": 234291.874242707\n },\n {\n \"content\": \"#[allow(unused)]\\n\\npub fn command_exec(binary: &str, prefix: &str, process: impl Fn(&mut Command)) {\\n\\n let mut cmd = get_binary(binary).unwrap_or_else(|_| panic!(\\\"unable to get binary: {}\\\", binary));\\n\\n\\n\\n let (output, error) = open_log(prefix);\\n\\n\\n\\n cmd.stdout(Stdio::from(output)).stderr(Stdio::from(error));\\n\\n\\n\\n process(&mut cmd);\\n\\n\\n\\n let status = cmd.status().expect(\\\"topic creation failed\\\");\\n\\n\\n\\n if !status.success() {\\n\\n println!(\\\"topic creation failed: {}\\\", status);\\n\\n }\\n\\n}\\n\\n\\n\\nuse std::process::Child;\\n\\n\\n\",\n \"file_path\": \"src/utils/src/bin.rs\",\n \"rank\": 13,\n \"score\": 230123.2702388984\n },\n {\n \"content\": \"/// Streaming Controller dispatcher entry point, spawns new thread\\n\\npub fn run<K,C>(receiver: Receiver<ScRequest>, sc_controller: ScController<K,C>) \\n\\n where K: WSUpdateService + Send + Sync + 'static,\\n\\n C: SpuConnections + Send + Sync + 'static\\n\\n{\\n\\n info!(\\\"start SC[{}] dispatcher\\\", sc_controller.id());\\n\\n\\n\\n spawn(sc_request_loop(receiver, sc_controller);\\n\\n}\\n\\n\\n\\n/// SC dispatcher request loop, waits for a request request and dispatchers\\n\\n/// it for processing.\\n\\nasync fn sc_request_loop<K,C>(mut receiver: Receiver<ScRequest>, mut sc_controller: ScController<K,C>) \\n\\n where K: WSUpdateService , C: SpuConnections \\n\\n{\\n\\n loop {\\n\\n select! {\\n\\n receiver_req = receiver.next() => {\\n\\n match receiver_req {\\n\\n None => {\\n\\n info!(\\\"SC dispatcher receiver is removed. end\\\");\\n\",\n \"file_path\": \"src/sc/src/core/dispatcher.rs\",\n \"rank\": 14,\n \"score\": 227311.88124565335\n },\n {\n \"content\": \"pub fn process_releases(opt: ReleasesCommand) -> Result<String, CliError> {\\n\\n match opt {\\n\\n ReleasesCommand::List => list_releases()?,\\n\\n }\\n\\n Ok(\\\"\\\".to_string())\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/cli/src/cluster/releases.rs\",\n \"rank\": 15,\n \"score\": 226841.48958721507\n },\n {\n \"content\": \"#[allow(unused)]\\n\\npub fn command_spawn(binary: &str, prefix: &str, process: impl Fn(&mut Command)) -> Child {\\n\\n let mut cmd = get_binary(binary).unwrap_or_else(|_| panic!(\\\"unable to get binary: {}\\\", binary));\\n\\n\\n\\n let (output, error) = open_log(prefix);\\n\\n\\n\\n cmd.stdout(Stdio::from(output)).stderr(Stdio::from(error));\\n\\n\\n\\n process(&mut cmd);\\n\\n\\n\\n cmd.spawn().expect(\\\"child\\\")\\n\\n}\\n\",\n \"file_path\": \"src/utils/src/bin.rs\",\n \"rank\": 16,\n \"score\": 223922.08755974067\n },\n {\n \"content\": \"pub fn process_run(run_opt: RunOpt) -> Result<String, CliError> {\\n\\n match run_opt {\\n\\n RunOpt::SPU(opt) => fluvio_spu::main_loop(opt),\\n\\n RunOpt::SC(opt) => fluvio_sc::k8::main_k8_loop(opt),\\n\\n }\\n\\n\\n\\n Ok(\\\"\\\".to_owned())\\n\\n}\\n\",\n \"file_path\": \"src/cli/src/run/mod.rs\",\n \"rank\": 17,\n \"score\": 223561.58052493125\n },\n {\n \"content\": \"pub fn process_switch<O>(out: std::sync::Arc<O>, opt: SwitchOpt) -> Result<String, CliError>\\n\\nwhere\\n\\n O: Terminal,\\n\\n{\\n\\n let profile_name = opt.profile_name;\\n\\n match ConfigFile::load(None) {\\n\\n Ok(mut config_file) => {\\n\\n if !config_file.mut_config().set_current_profile(&profile_name) {\\n\\n t_println!(out, \\\"profile {} not found\\\", &profile_name);\\n\\n } else if let Err(err) = config_file.save() {\\n\\n t_println!(out, \\\"unable to save profile: {}\\\", err);\\n\\n }\\n\\n }\\n\\n Err(_) => t_print_cli_err!(out, \\\"no profile can be found\\\"),\\n\\n }\\n\\n\\n\\n Ok(\\\"\\\".to_string())\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/cli/src/profile/mod.rs\",\n \"rank\": 18,\n \"score\": 223114.99851825967\n },\n {\n \"content\": \"pub fn process_delete<O>(out: std::sync::Arc<O>, opt: DeleteOpt) -> Result<String, CliError>\\n\\nwhere\\n\\n O: Terminal,\\n\\n{\\n\\n let profile_name = opt.profile_name;\\n\\n match ConfigFile::load(None) {\\n\\n Ok(mut config_file) => {\\n\\n if !config_file.mut_config().delete_profile(&profile_name) {\\n\\n t_println!(out, \\\"profile {} not found\\\", &profile_name);\\n\\n } else if let Err(err) = config_file.save() {\\n\\n t_println!(out, \\\"unable to save profile: {}\\\", err);\\n\\n } else {\\n\\n t_println!(out, \\\"profile {} deleted\\\", &profile_name);\\n\\n if config_file.config().current_profile_name().is_none() {\\n\\n t_println!(out,\\\"warning: this removed your current profile, use 'config switch-profile to select a different one\\\");\\n\\n } else {\\n\\n t_println!(out, \\\"profile deleted\\\");\\n\\n }\\n\\n }\\n\\n }\\n\\n Err(_) => t_print_cli_err!(out, \\\"no profile can be found\\\"),\\n\\n }\\n\\n\\n\\n Ok(\\\"\\\".to_string())\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/cli/src/profile/mod.rs\",\n \"rank\": 19,\n \"score\": 223114.99851825967\n },\n {\n \"content\": \"/// If header has error, format and return\\n\\npub fn error_in_header(\\n\\n topic_name: &str,\\n\\n r_partition: &FetchablePartitionResponse<RecordSet>,\\n\\n) -> Option<String> {\\n\\n if r_partition.error_code.is_error() {\\n\\n Some(format!(\\n\\n \\\"topic '{}/{}': {}\\\",\\n\\n topic_name,\\n\\n r_partition.partition_index,\\n\\n r_partition.error_code.to_sentence()\\n\\n ))\\n\\n } else {\\n\\n None\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/cli/src/consume/logs_output.rs\",\n \"rank\": 20,\n \"score\": 221342.97670329746\n },\n {\n \"content\": \"/// Process server based on output type\\n\\npub fn format_spu_response_output<O>(\\n\\n out: std::sync::Arc<O>,\\n\\n spus: ListSpus,\\n\\n output_type: OutputType,\\n\\n) -> Result<(), CliError>\\n\\nwhere\\n\\n O: Terminal,\\n\\n{\\n\\n if !spus.is_empty() {\\n\\n out.render_list(&spus, output_type)?;\\n\\n } else {\\n\\n t_println!(out, \\\"no spu\\\");\\n\\n }\\n\\n\\n\\n Ok(())\\n\\n}\\n\\n\\n\\nimpl TableOutputHandler for ListSpus {\\n\\n /// table header implementation\\n\\n fn header(&self) -> Row {\\n\",\n \"file_path\": \"src/cli/src/spu/display.rs\",\n \"rank\": 21,\n \"score\": 220049.4644864777\n },\n {\n \"content\": \"fn find_spu_image() -> String {\\n\\n std::env::var(\\\"SPU_IMAGE\\\").expect(\\\"SPU IMAGE must be passed as env\\\")\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/sc/src/k8/operator/conversion.rs\",\n \"rank\": 22,\n \"score\": 218242.24756624005\n },\n {\n \"content\": \"/// Traverse all partition batches and parse records to json format\\n\\npub fn partition_to_json_records(\\n\\n partition: &FetchablePartitionResponse<RecordSet>,\\n\\n suppress: bool,\\n\\n) -> Vec<Value> {\\n\\n let mut json_records: Vec<Value> = vec![];\\n\\n\\n\\n // convert all batches to json records\\n\\n for batch in &partition.records.batches {\\n\\n for record in &batch.records {\\n\\n if let Some(batch_record) = record.get_value().inner_value_ref() {\\n\\n match serde_json::from_slice(&batch_record) {\\n\\n Ok(value) => json_records.push(value),\\n\\n Err(_) => {\\n\\n if !suppress {\\n\\n json_records.push(serde_json::json!({\\n\\n \\\"error\\\": record.get_value().describe()\\n\\n }));\\n\\n }\\n\\n }\\n\\n }\\n\\n }\\n\\n }\\n\\n }\\n\\n\\n\\n json_records\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/cli/src/consume/logs_output.rs\",\n \"rank\": 23,\n \"score\": 216924.50418309803\n },\n {\n \"content\": \"/// Generates a random authorization token\\n\\npub fn generate_auth_token() -> (String, String) {\\n\\n const CHARSET: &[u8] = b\\\"abcdefghijklmnopqrstuvwxyz\\\\\\n\\n 0123456789\\\";\\n\\n\\n\\n const ID_SIZE: usize = 6;\\n\\n let token_name: String = (0..ID_SIZE)\\n\\n .map(|_| {\\n\\n let idx = thread_rng().gen_range(0, CHARSET.len());\\n\\n // This is safe because `idx` is in range of `CHARSET`\\n\\n char::from(unsafe { *CHARSET.get_unchecked(idx) })\\n\\n })\\n\\n .collect();\\n\\n\\n\\n const SECRET_SIZE: usize = 16;\\n\\n let token_secret: String = (0..SECRET_SIZE)\\n\\n .map(|_| {\\n\\n let idx = thread_rng().gen_range(0, CHARSET.len());\\n\\n // This is safe because `idx` is in range of `CHARSET`\\n\\n char::from(unsafe { *CHARSET.get_unchecked(idx) })\\n\\n })\\n\\n .collect();\\n\\n\\n\\n (token_name, token_secret)\\n\\n}\\n\\n\\n\\n#[allow(dead_code)]\\n\",\n \"file_path\": \"src/utils/src/generators.rs\",\n \"rank\": 24,\n \"score\": 216683.83232184197\n },\n {\n \"content\": \"pub fn default_option(index_max_interval_bytes: Size) -> ConfigOption {\\n\\n ConfigOption {\\n\\n segment_max_bytes: 100,\\n\\n index_max_interval_bytes,\\n\\n base_dir: temp_dir(),\\n\\n index_max_bytes: 1000,\\n\\n }\\n\\n}\\n\\n\\n\\nmod pin_tests {\\n\\n\\n\\n use std::pin::Pin;\\n\\n use pin_utils::pin_mut;\\n\\n use pin_utils::unsafe_unpinned;\\n\\n\\n\\n // impl Unpin for Counter{}\\n\\n\\n\\n struct Counter {\\n\\n total: u16,\\n\\n }\\n\",\n \"file_path\": \"src/storage/src/fixture.rs\",\n \"rank\": 25,\n \"score\": 216492.45818404213\n },\n {\n \"content\": \"// returns a tuple (topic_name, idx)\\n\\npub fn decompose_partition_name(partition_name: &str) -> Result<(String, i32), PartitionError> {\\n\\n let dash_pos = partition_name.rfind('-');\\n\\n if dash_pos.is_none() {\\n\\n return Err(PartitionError::InvalidSyntax(partition_name.to_owned()));\\n\\n }\\n\\n\\n\\n let pos = dash_pos.unwrap();\\n\\n if (pos + 1) >= partition_name.len() {\\n\\n return Err(PartitionError::InvalidSyntax(partition_name.to_owned()));\\n\\n }\\n\\n\\n\\n let topic_name = &partition_name[..pos];\\n\\n let idx_string = &partition_name[(pos + 1)..];\\n\\n let idx = match idx_string.parse::<i32>() {\\n\\n Ok(n) => n,\\n\\n Err(_) => {\\n\\n return Err(PartitionError::InvalidSyntax(partition_name.to_owned()));\\n\\n }\\n\\n };\\n\\n\\n\\n Ok((topic_name.to_string(), idx))\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/dataplane-protocol/src/common.rs\",\n \"rank\": 26,\n \"score\": 215996.35997868638\n },\n {\n \"content\": \"/// find spu id from env, if not found, return error\\n\\nfn find_spu_id_from_env() -> Result<SpuId, IoError> {\\n\\n use std::env;\\n\\n use fluvio_types::defaults::FLV_SPU_ID;\\n\\n\\n\\n if let Ok(id_str) = env::var(FLV_SPU_ID) {\\n\\n debug!(\\\"found spu id from env: {}\\\", id_str);\\n\\n let id = id_str\\n\\n .parse()\\n\\n .map_err(|err| IoError::new(ErrorKind::InvalidInput, format!(\\\"spu-id: {}\\\", err)))?;\\n\\n Ok(id)\\n\\n } else {\\n\\n // try get special env SPU which has form of {}-{id} when in as in-cluster config\\n\\n if let Ok(spu_name) = env::var(\\\"SPU_INDEX\\\") {\\n\\n info!(\\\"extracting SPU from: {}\\\", spu_name);\\n\\n let spu_tokens: Vec<&str> = spu_name.split('-').collect();\\n\\n if spu_tokens.len() < 2 {\\n\\n Err(IoError::new(\\n\\n ErrorKind::InvalidInput,\\n\\n format!(\\\"SPU is invalid format: {} bailing out\\\", spu_name),\\n\\n ))\\n\",\n \"file_path\": \"src/spu/src/config/cli.rs\",\n \"rank\": 27,\n \"score\": 215408.0282878956\n },\n {\n \"content\": \"#[derive(Debug, StructOpt, Default)]\\n\\nstruct TlsConfig {\\n\\n /// enable tls\\n\\n #[structopt(long)]\\n\\n pub tls: bool,\\n\\n\\n\\n /// TLS: path to server certificate\\n\\n #[structopt(long)]\\n\\n pub server_cert: Option<String>,\\n\\n #[structopt(long)]\\n\\n /// TLS: path to server private key\\n\\n pub server_key: Option<String>,\\n\\n /// TLS: enable client cert\\n\\n #[structopt(long)]\\n\\n pub enable_client_cert: bool,\\n\\n /// TLS: path to ca cert, required when client cert is enabled\\n\\n #[structopt(long)]\\n\\n pub ca_cert: Option<String>,\\n\\n\\n\\n #[structopt(long)]\\n\\n /// TLS: address of non tls public service, required\\n\\n pub bind_non_tls_public: Option<String>,\\n\\n}\\n\",\n \"file_path\": \"src/spu/src/config/cli.rs\",\n \"rank\": 28,\n \"score\": 211701.2569100922\n },\n {\n \"content\": \"///\\n\\n/// Validate computed topic spec parameters and update topic status\\n\\n/// * error is passed to the topic reason.\\n\\n///\\n\\npub fn validate_computed_topic_parameters(param: &TopicReplicaParam) -> TopicNextState {\\n\\n if let Err(err) = TopicSpec::valid_partition(¶m.partitions) {\\n\\n TopicStatus::next_resolution_invalid_config(&err.to_string()).into()\\n\\n } else if let Err(err) = TopicSpec::valid_replication_factor(¶m.replication_factor) {\\n\\n TopicStatus::next_resolution_invalid_config(&err.to_string()).into()\\n\\n } else {\\n\\n TopicStatus::next_resolution_pending().into()\\n\\n }\\n\\n}\\n\\n\\n\\n///\\n\\n/// Generate Replica Map if there are enough online spus\\n\\n/// * returns a replica map or a reason for the failure\\n\\n/// * fatal error configuration errors and are not recoverable\\n\\n///\\n\\npub async fn generate_replica_map(\\n\\n spus: &SpuAdminStore,\\n\\n param: &TopicReplicaParam,\\n\\n) -> TopicNextState {\\n\\n let spu_count = spus.count().await;\\n\",\n \"file_path\": \"src/sc/src/controllers/topics/policy.rs\",\n \"rank\": 29,\n \"score\": 210563.0110112667\n },\n {\n \"content\": \"#[async_trait]\\n\\npub trait PartitionLocalStorePolicy<C>\\n\\nwhere\\n\\n C: MetadataItem,\\n\\n{\\n\\n async fn names(&self) -> Vec<ReplicaKey>;\\n\\n\\n\\n async fn topic_partitions(&self, topic: &str) -> Vec<PartitionMetadata<C>>;\\n\\n\\n\\n /// find all partitions that has spu in the replicas\\n\\n async fn partition_spec_for_spu(&self, target_spu: i32) -> Vec<(ReplicaKey, PartitionSpec)>;\\n\\n\\n\\n async fn count_topic_partitions(&self, topic: &str) -> i32;\\n\\n\\n\\n // return partitions that belong to this topic\\n\\n async fn topic_partitions_list(&self, topic: &str) -> Vec<ReplicaKey>;\\n\\n\\n\\n async fn table_fmt(&self) -> String;\\n\\n\\n\\n /// replica msg for target spu\\n\\n async fn replica_for_spu(&self, target_spu: SpuId) -> Vec<Replica>;\\n\",\n \"file_path\": \"src/controlplane-metadata/src/partition/store.rs\",\n \"rank\": 30,\n \"score\": 209198.35896586106\n },\n {\n \"content\": \"#[async_trait]\\n\\npub trait TopicLocalStorePolicy<C>\\n\\nwhere\\n\\n C: MetadataItem,\\n\\n{\\n\\n async fn table_fmt(&self) -> String;\\n\\n}\\n\\n\\n\\n#[async_trait]\\n\\nimpl<C> TopicLocalStorePolicy<C> for TopicLocalStore<C>\\n\\nwhere\\n\\n C: MetadataItem + Send + Sync,\\n\\n{\\n\\n async fn table_fmt(&self) -> String {\\n\\n let mut table = String::new();\\n\\n\\n\\n let topic_hdr = format!(\\n\\n \\\"{n:<18} {t:<8} {p:<5} {s:<5} {g:<8} {l:<14} {m:<10} {r}\\\\n\\\",\\n\\n n = \\\"TOPIC\\\",\\n\\n t = \\\"TYPE\\\",\\n\\n p = \\\"PART\\\",\\n\",\n \"file_path\": \"src/controlplane-metadata/src/topic/store.rs\",\n \"rank\": 31,\n \"score\": 209198.35896586106\n },\n {\n \"content\": \"pub fn view_profile<O>(out: std::sync::Arc<O>) -> eyre::Result<()>\\n\\nwhere\\n\\n O: Terminal,\\n\\n{\\n\\n let config_file = ConfigFile::load(None).context(\\\"Failed to read Fluvio config file\\\")?;\\n\\n t_println!(out, \\\"{:#?}\\\", config_file.config());\\n\\n Ok(())\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/cli/src/profile/context.rs\",\n \"rank\": 32,\n \"score\": 209172.35245652407\n },\n {\n \"content\": \"/// Print records based on their type\\n\\npub fn print_dynamic_records<O>(\\n\\n out: std::sync::Arc<O>,\\n\\n topic_name: &str,\\n\\n response_partitions: &[FetchablePartitionResponse<RecordSet>],\\n\\n) where\\n\\n O: Terminal,\\n\\n{\\n\\n for r_partition in response_partitions {\\n\\n if let Some(err) = error_in_header(topic_name, r_partition) {\\n\\n t_print_cli_err!(out, err);\\n\\n continue;\\n\\n }\\n\\n\\n\\n for batch in &r_partition.records.batches {\\n\\n for record in &batch.records {\\n\\n if let Some(batch_record) = record.get_value().inner_value_ref() {\\n\\n // TODO: this should be refactored\\n\\n if let Some(bytes) = record.get_value().inner_value_ref() {\\n\\n debug!(\\\"len: {}\\\", bytes.len());\\n\\n }\\n\",\n \"file_path\": \"src/cli/src/consume/logs_output.rs\",\n \"rank\": 33,\n \"score\": 208799.7144529275\n },\n {\n \"content\": \"/// parse message and generate log records\\n\\npub fn generate_json_records<O>(\\n\\n out: std::sync::Arc<O>,\\n\\n topic_name: &str,\\n\\n response_partitions: &[FetchablePartitionResponse<RecordSet>],\\n\\n suppress: bool,\\n\\n) -> Vec<Value>\\n\\nwhere\\n\\n O: Terminal,\\n\\n{\\n\\n let mut json_records: Vec<Value> = vec![];\\n\\n\\n\\n for r_partition in response_partitions {\\n\\n if let Some(err) = error_in_header(topic_name, r_partition) {\\n\\n t_print_cli_err!(out, err);\\n\\n continue;\\n\\n }\\n\\n\\n\\n let mut new_records = partition_to_json_records(&r_partition, suppress);\\n\\n json_records.append(&mut new_records);\\n\\n }\\n\\n\\n\\n json_records\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/cli/src/consume/logs_output.rs\",\n \"rank\": 34,\n \"score\": 208799.64318581208\n },\n {\n \"content\": \"/// parse message and generate partition records\\n\\npub fn print_binary_records<O>(\\n\\n out: std::sync::Arc<O>,\\n\\n topic_name: &str,\\n\\n response_partitions: &[FetchablePartitionResponse<RecordSet>],\\n\\n) where\\n\\n O: Terminal,\\n\\n{\\n\\n debug!(\\n\\n \\\"printing out binary records: {} records: {}\\\",\\n\\n topic_name,\\n\\n response_partitions.len()\\n\\n );\\n\\n let mut printed = false;\\n\\n for r_partition in response_partitions {\\n\\n if let Some(err) = error_in_header(topic_name, r_partition) {\\n\\n t_println!(out, \\\"{}\\\", hex_dump_separator());\\n\\n t_print_cli_err!(out, err);\\n\\n printed = true;\\n\\n continue;\\n\\n }\\n\",\n \"file_path\": \"src/cli/src/consume/logs_output.rs\",\n \"rank\": 35,\n \"score\": 208794.07690288225\n },\n {\n \"content\": \"/// Print records in text format\\n\\npub fn print_text_records<O>(\\n\\n out: std::sync::Arc<O>,\\n\\n topic_name: &str,\\n\\n response_partitions: &[FetchablePartitionResponse<RecordSet>],\\n\\n suppress: bool,\\n\\n) where\\n\\n O: Terminal,\\n\\n{\\n\\n debug!(\\\"processing text record: {:#?}\\\", response_partitions);\\n\\n\\n\\n for r_partition in response_partitions {\\n\\n if let Some(err) = error_in_header(topic_name, r_partition) {\\n\\n t_print_cli_err!(out, err);\\n\\n continue;\\n\\n }\\n\\n\\n\\n for batch in &r_partition.records.batches {\\n\\n for record in &batch.records {\\n\\n if record.get_value().inner_value_ref().is_some() {\\n\\n if record.get_value().is_binary() {\\n\",\n \"file_path\": \"src/cli/src/consume/logs_output.rs\",\n \"rank\": 36,\n \"score\": 208794.07690288225\n },\n {\n \"content\": \"/// Print records in raw format\\n\\npub fn print_raw_records<O>(\\n\\n out: std::sync::Arc<O>,\\n\\n topic_name: &str,\\n\\n response_partitions: &[FetchablePartitionResponse<RecordSet>],\\n\\n) where\\n\\n O: Terminal,\\n\\n{\\n\\n for r_partition in response_partitions {\\n\\n if let Some(err) = error_in_header(topic_name, r_partition) {\\n\\n t_print_cli_err!(out, err);\\n\\n continue;\\n\\n }\\n\\n\\n\\n for batch in &r_partition.records.batches {\\n\\n for record in &batch.records {\\n\\n if let Some(value) = record.get_value().inner_value_ref() {\\n\\n let str_value = std::str::from_utf8(value).unwrap();\\n\\n t_println!(out, \\\"{}\\\", str_value);\\n\\n }\\n\\n }\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\n// -----------------------------------\\n\\n// Utilities\\n\\n// -----------------------------------\\n\\n\\n\",\n \"file_path\": \"src/cli/src/consume/logs_output.rs\",\n \"rank\": 37,\n \"score\": 208794.07690288225\n },\n {\n \"content\": \"pub fn create_partition_name(topic_name: &str, idx: &i32) -> String {\\n\\n format!(\\\"{}-{}\\\", topic_name, idx)\\n\\n}\\n\",\n \"file_path\": \"src/types/src/partition.rs\",\n \"rank\": 38,\n \"score\": 208186.77023268695\n },\n {\n \"content\": \"/// Generates a random authorization secret\\n\\npub fn generate_secret() -> String {\\n\\n const CHARSET: &[u8] = b\\\"abcdefghijklmnopqrstuvwxyz\\\\\\n\\n 0123456789\\\";\\n\\n\\n\\n const SECRET_SIZE: usize = 16;\\n\\n let secret: String = (0..SECRET_SIZE)\\n\\n .map(|_| {\\n\\n let idx = thread_rng().gen_range(0, CHARSET.len());\\n\\n // This is safe because `idx` is in range of `CHARSET`\\n\\n char::from(unsafe { *CHARSET.get_unchecked(idx) })\\n\\n })\\n\\n .collect();\\n\\n\\n\\n secret\\n\\n}\\n\\n\\n\\n#[allow(dead_code)]\\n\",\n \"file_path\": \"src/utils/src/generators.rs\",\n \"rank\": 39,\n \"score\": 207472.1288930106\n },\n {\n \"content\": \"pub fn generate_service(spg: &K8SpuGroupSpec, name: &str) -> ServiceSpec {\\n\\n let spg_template = &spg.template.spec;\\n\\n let mut public_port = ServicePort {\\n\\n port: spg_template\\n\\n .public_endpoint\\n\\n .as_ref()\\n\\n .map(|t| t.port)\\n\\n .unwrap_or(SPU_PUBLIC_PORT),\\n\\n ..Default::default()\\n\\n };\\n\\n\\n\\n public_port.name = Some(\\\"public\\\".to_owned());\\n\\n let mut private_port = ServicePort {\\n\\n port: spg_template\\n\\n .private_endpoint\\n\\n .as_ref()\\n\\n .map(|t| t.port)\\n\\n .unwrap_or(SPU_PRIVATE_PORT),\\n\\n ..Default::default()\\n\\n };\\n\",\n \"file_path\": \"src/sc/src/k8/operator/conversion.rs\",\n \"rank\": 40,\n \"score\": 204929.34111360952\n },\n {\n \"content\": \"/// Generates a random key\\n\\npub fn generate_random_key() -> String {\\n\\n const CHARSET: &[u8] = b\\\"ABCDEFGHIJKLMNOPQRSTUVWXYZ\\\\\\n\\n abcdefghijklmnopqrstuvwxyz\\\\\\n\\n 0123456789)(*&^%$#@!~\\\";\\n\\n const SIZE: usize = 32;\\n\\n let key: String = (0..SIZE)\\n\\n .map(|_| {\\n\\n let idx = thread_rng().gen_range(0, CHARSET.len());\\n\\n // This is safe because `idx` is in range of `CHARSET`\\n\\n char::from(unsafe { *CHARSET.get_unchecked(idx) })\\n\\n })\\n\\n .collect();\\n\\n\\n\\n key\\n\\n}\\n\",\n \"file_path\": \"src/utils/src/generators.rs\",\n \"rank\": 41,\n \"score\": 203976.31607148933\n },\n {\n \"content\": \"#[allow(dead_code)]\\n\\nstruct Dispatcher<C>(C);\\n\\n\\n\\n#[allow(dead_code)]\\n\\nimpl<S> Dispatcher<C>\\n\\nwhere\\n\\n C: Controller + Send + Sync + 'static,\\n\\n C::Action: Send + Sync + 'static,\\n\\n{\\n\\n /// start the controller with ctx and receiver\\n\\n pub fn run<K>(controller: C, receiver: Receiver<Actions<C::Action>>, kv_service: K)\\n\\n where\\n\\n K: WSUpdateService + Send + Sync + 'static,\\n\\n {\\n\\n spawn(Self::request_loop(receiver, kv_service, controller).await);\\n\\n }\\n\\n\\n\\n async fn request_loop<K>(\\n\\n mut receiver: Receiver<Actions<C::Action>>,\\n\\n _kv_service: K,\\n\\n mut _controller: C,\\n\",\n \"file_path\": \"src/sc/src/core/common/dispatcher.rs\",\n \"rank\": 42,\n \"score\": 203661.84681914892\n },\n {\n \"content\": \"pub fn log_path_get_offset<P>(path: P) -> Result<Offset, OffsetError>\\n\\nwhere\\n\\n P: AsRef<Path>,\\n\\n{\\n\\n let log_path = path.as_ref();\\n\\n\\n\\n match log_path.file_stem() {\\n\\n None => Err(OffsetError::InvalidPath),\\n\\n Some(file_name) => {\\n\\n if file_name.len() != 20 {\\n\\n Err(OffsetError::InvalidLogFileName)\\n\\n } else {\\n\\n file_name\\n\\n .to_str()\\n\\n .unwrap()\\n\\n .parse()\\n\\n .map_err(|err: ParseIntError| err.into())\\n\\n }\\n\\n }\\n\\n }\\n\",\n \"file_path\": \"src/storage/src/util.rs\",\n \"rank\": 43,\n \"score\": 198258.986142402\n },\n {\n \"content\": \"/// Return separator for hex dump\\n\\npub fn hex_dump_separator() -> String {\\n\\n \\\"------------------------------------------------------------------------------\\\\n\\\".to_owned()\\n\\n}\\n\\n\\n\\n#[cfg(test)]\\n\\nmod test {\\n\\n use super::bytes_to_hex_dump;\\n\\n\\n\\n #[test]\\n\\n fn test_bytes_to_hex_dump() {\\n\\n let records: Vec<u8> = vec![\\n\\n 123, 10, 32, 32, 32, 32, 34, 112, 97, 114, 116, 105, 116, 105, 111, 110, 115, 34, 58,\\n\\n 32, 91, 10, 32, 32, 32, 32, 32, 32, 32, 32, 123, 10, 32, 32, 32, 32, 32, 32, 32, 32,\\n\\n 32, 32, 32, 32, 34, 105, 100, 34, 58, 32, 48, 44, 10, 32, 32, 32, 32, 32, 32, 32, 32,\\n\\n 32, 32, 32, 32, 34, 114, 101, 112, 108, 105, 99, 97, 115, 34, 58, 32, 91, 10, 32, 32,\\n\\n 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 53, 48, 48, 49, 44, 10, 32, 32,\\n\\n 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 53, 48, 48, 50, 44, 10, 32, 32,\\n\\n 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 53, 48, 48, 51, 10, 32, 32, 32,\\n\\n 32, 32, 32, 32, 32, 32, 32, 32, 32, 93, 10, 32, 32, 32, 32, 32, 32, 32, 32, 125, 10,\\n\\n 32, 32, 32, 32, 93, 10, 125,\\n\",\n \"file_path\": \"src/cli/src/common/hex_dump.rs\",\n \"rank\": 44,\n \"score\": 197524.55576975818\n },\n {\n \"content\": \"struct ScServerCtx {\\n\\n ctx: SharedScContext,\\n\\n sender: Sender<bool>,\\n\\n}\\n\\n\\n\\npub struct SpuTestRunner<T> {\\n\\n client_id: String,\\n\\n spu_server_specs: Vec<SpuServer>,\\n\\n spu_server_ctx: Vec<DefaultSharedGlobalContext>,\\n\\n spu_senders: Vec<Sender<bool>>,\\n\\n sc_ctx: RwLock<Option<ScServerCtx>>,\\n\\n test: T,\\n\\n}\\n\\n\\n\\nimpl<T> SpuTestRunner<T>\\n\\nwhere\\n\\n T: SpuTest + Send + Sync + 'static,\\n\\n{\\n\\n pub async fn run(client_id: String, test: T) -> Result<(), FlvSocketError> {\\n\\n debug!(\\\"starting test harnerss\\\");\\n\",\n \"file_path\": \"src/spu/src/tests/fixture/test_runner.rs\",\n \"rank\": 45,\n \"score\": 194485.6133947686\n },\n {\n \"content\": \"pub fn start_internal_server(ctx: SharedContext) {\\n\\n info!(\\\"starting internal services\\\");\\n\\n\\n\\n let addr = ctx.config().private_endpoint.clone();\\n\\n let server = FlvApiServer::new(addr, ctx, ScInternalService::new());\\n\\n server.run();\\n\\n}\\n\",\n \"file_path\": \"src/sc/src/services/private_api/mod.rs\",\n \"rank\": 46,\n \"score\": 192860.22814807057\n },\n {\n \"content\": \"fn process_version_cmd() -> Result<String, CliError> {\\n\\n println!(\\\"Fluvio version : {}\\\", crate::VERSION);\\n\\n println!(\\\"Git Commit : {}\\\", env!(\\\"GIT_HASH\\\"));\\n\\n if let Some(os_info) = option_env!(\\\"UNAME\\\") {\\n\\n println!(\\\"OS Details : {}\\\", os_info);\\n\\n }\\n\\n println!(\\\"Rustc Version : {}\\\", env!(\\\"RUSTC_VERSION\\\"));\\n\\n Ok(\\\"\\\".to_owned())\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/cli/src/root_cli.rs\",\n \"rank\": 47,\n \"score\": 192547.76638174237\n },\n {\n \"content\": \"/// generate server configuration file\\n\\npub fn build_server_config_file_path(file_name: &'static str) -> PathBuf {\\n\\n let mut config_file_path = PathBuf::new();\\n\\n\\n\\n // stitch-up default configuration file path\\n\\n config_file_path.push(SERVER_CONFIG_BASE_PATH);\\n\\n config_file_path.push(SERVER_CONFIG_DIR);\\n\\n config_file_path.push(file_name);\\n\\n config_file_path.set_extension(CONFIG_FILE_EXTENTION);\\n\\n\\n\\n config_file_path\\n\\n}\\n\\n\\n\\n//\\n\\n// Unit Tests\\n\\n//\\n\\n\\n\\n#[cfg(test)]\\n\\npub mod test {\\n\\n use super::*;\\n\\n use fluvio_types::defaults::{SC_CONFIG_FILE, SPU_CONFIG_FILE};\\n\",\n \"file_path\": \"src/utils/src/config_helper.rs\",\n \"rank\": 48,\n \"score\": 191694.17789731245\n },\n {\n \"content\": \"fn default_config(spu_id: SpuId, config: &ConfigOption) -> ConfigOption {\\n\\n let base_dir = config.base_dir.join(format!(\\\"spu-logs-{}\\\", spu_id));\\n\\n let new_config = config.clone();\\n\\n new_config.base_dir(base_dir)\\n\\n}\\n\\n\\n\\n/// Create new replica storage. Each replica is stored with 'spu' prefix\\n\\npub(crate) async fn create_replica_storage(\\n\\n local_spu: SpuId,\\n\\n replica: &ReplicaKey,\\n\\n base_config: &ConfigOption,\\n\\n) -> Result<FileReplica, StorageError> {\\n\\n let config = default_config(local_spu, base_config);\\n\\n FileReplica::create(replica.topic.clone(), replica.partition as u32, 0, &config).await\\n\\n}\\n\",\n \"file_path\": \"src/spu/src/core/storage/mod.rs\",\n \"rank\": 49,\n \"score\": 190894.213991921\n },\n {\n \"content\": \"#[async_trait]\\n\\npub trait SpuValidation {\\n\\n fn is_already_valid(&self) -> bool;\\n\\n async fn is_conflict_with(&self, spu_store: &SpuAdminStore) -> Option<SpuId>;\\n\\n}\\n\\n\\n\\n#[async_trait]\\n\\nimpl SpuValidation for SpuGroupObj {\\n\\n /// check if I am already been validated\\n\\n fn is_already_valid(&self) -> bool {\\n\\n self.status.is_already_valid()\\n\\n }\\n\\n\\n\\n /// check if my group's id is conflict with my spu local store\\n\\n async fn is_conflict_with(&self, spu_store: &SpuAdminStore) -> Option<SpuId> {\\n\\n if self.is_already_valid() {\\n\\n return None;\\n\\n }\\n\\n\\n\\n let min_id = self.spec.min_id as SpuId;\\n\\n\\n\\n is_conflict(\\n\\n spu_store,\\n\\n self.metadata.uid.clone(),\\n\\n min_id,\\n\\n min_id + self.spec.replicas as SpuId,\\n\\n )\\n\\n .await\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/sc/src/k8/operator/spg_group.rs\",\n \"rank\": 50,\n \"score\": 187727.72699271183\n },\n {\n \"content\": \"/// Detects the target triple of the current build and returns\\n\\n/// the name of a compatible build target on packages.fluvio.io.\\n\\n///\\n\\n/// Returns `Some(Target)` if there is a compatible target, or\\n\\n/// `None` if this target is unsupported or has no compatible target.\\n\\npub fn package_target() -> Result<Target, Error> {\\n\\n let target = PACKAGE_TARGET.parse()?;\\n\\n Ok(target)\\n\\n}\\n\\n\\n\\n#[derive(Debug, Copy, Clone, PartialEq, Serialize, Deserialize)]\\n\\n#[allow(non_camel_case_types)]\\n\\npub enum Target {\\n\\n #[serde(rename = \\\"x86_64-apple-darwin\\\")]\\n\\n X86_64AppleDarwin,\\n\\n #[serde(rename = \\\"x86_64-unknown-linux-musl\\\")]\\n\\n X86_64UnknownLinuxMusl,\\n\\n}\\n\\n\\n\\nimpl Target {\\n\\n pub fn as_str(&self) -> &str {\\n\\n match self {\\n\\n Self::X86_64AppleDarwin => \\\"x86_64-apple-darwin\\\",\\n\\n Self::X86_64UnknownLinuxMusl => \\\"x86_64-unknown-linux-musl\\\",\\n\\n }\\n\",\n \"file_path\": \"src/package-index/src/target.rs\",\n \"rank\": 51,\n \"score\": 187581.6152071529\n },\n {\n \"content\": \"pub fn get_fluvio() -> Result<Command, IoError> {\\n\\n get_binary(\\\"fluvio\\\")\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/utils/src/bin.rs\",\n \"rank\": 52,\n \"score\": 187581.6152071529\n },\n {\n \"content\": \"/// create server and spin up services, but don't run server\\n\\npub fn create_services(\\n\\n local_spu: SpuConfig,\\n\\n internal: bool,\\n\\n public: bool,\\n\\n) -> (\\n\\n DefaultSharedGlobalContext,\\n\\n Option<InternalApiServer>,\\n\\n Option<PublicApiServer>,\\n\\n) {\\n\\n let ctx = FileReplicaContext::new_shared_context(local_spu);\\n\\n\\n\\n let public_ep_addr = ctx.config().public_socket_addr().to_owned();\\n\\n let private_ep_addr = ctx.config().private_socket_addr().to_owned();\\n\\n\\n\\n let public_server = if public {\\n\\n Some(create_public_server(public_ep_addr, ctx.clone()))\\n\\n } else {\\n\\n None\\n\\n };\\n\\n\\n\",\n \"file_path\": \"src/spu/src/start.rs\",\n \"rank\": 53,\n \"score\": 185291.9797061971\n },\n {\n \"content\": \"pub trait ScConfigBuilder {\\n\\n fn to_sc_config(self) -> Result<ScConfig, IoError>;\\n\\n}\\n\\n\\n\\n/// streaming controller configuration file\\n\\n#[derive(Debug, Clone, PartialEq)]\\n\\npub struct ScConfig {\\n\\n pub public_endpoint: String,\\n\\n pub private_endpoint: String,\\n\\n pub run_k8_dispatchers: bool,\\n\\n pub namespace: String,\\n\\n pub x509_auth_scopes: Option<PathBuf>,\\n\\n}\\n\\n\\n\\nimpl ::std::default::Default for ScConfig {\\n\\n fn default() -> Self {\\n\\n Self {\\n\\n public_endpoint: format!(\\\"0.0.0.0:{}\\\", SC_PUBLIC_PORT),\\n\\n private_endpoint: format!(\\\"0.0.0.0:{}\\\", SC_PRIVATE_PORT),\\n\\n run_k8_dispatchers: true,\\n\\n namespace: \\\"default\\\".to_owned(),\\n\\n x509_auth_scopes: None,\\n\\n }\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/sc/src/config/sc_config.rs\",\n \"rank\": 54,\n \"score\": 185163.8123800348\n },\n {\n \"content\": \"/// Create a channel\\n\\npub fn new_channel<T>() -> (Sender<T>, Receiver<T>) {\\n\\n channel(100)\\n\\n}\\n\",\n \"file_path\": \"src/sc/src/core/common/channels.rs\",\n \"rank\": 55,\n \"score\": 185051.5562264072\n },\n {\n \"content\": \"fn default_index_max_bytes() -> Size {\\n\\n SPU_LOG_INDEX_MAX_BYTES\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/storage/src/config.rs\",\n \"rank\": 56,\n \"score\": 183942.00723078605\n },\n {\n \"content\": \"fn default_segment_max_bytes() -> Size {\\n\\n SPU_LOG_SEGMENT_MAX_BYTES\\n\\n}\\n\\n\\n\\nimpl ConfigOption {\\n\\n pub fn new(\\n\\n base_dir: PathBuf,\\n\\n index_max_bytes: u32,\\n\\n index_max_interval_bytes: u32,\\n\\n segment_max_bytes: u32,\\n\\n ) -> Self {\\n\\n ConfigOption {\\n\\n base_dir,\\n\\n index_max_bytes,\\n\\n index_max_interval_bytes,\\n\\n segment_max_bytes,\\n\\n }\\n\\n }\\n\\n\\n\\n pub fn base_dir(mut self, dir: PathBuf) -> Self {\\n\",\n \"file_path\": \"src/storage/src/config.rs\",\n \"rank\": 57,\n \"score\": 183942.00723078605\n },\n {\n \"content\": \"#[allow(clippy::needless_range_loop)]\\n\\npub fn bytes_to_hex_dump(record: &[u8]) -> String {\\n\\n let cols = 16;\\n\\n let record_cnt = record.len();\\n\\n let mut result = String::new();\\n\\n let mut collector = String::new();\\n\\n\\n\\n for row_idx in 0..record_cnt {\\n\\n // colunn index\\n\\n if row_idx % cols == 0 {\\n\\n result.push_str(&format!(\\\"{:08x}\\\", row_idx));\\n\\n }\\n\\n\\n\\n // spacing half way\\n\\n if row_idx % (cols / 2) == 0 {\\n\\n result.push_str(\\\" \\\");\\n\\n }\\n\\n\\n\\n // convert and add character to collector\\n\\n collector.push_str(&byte_to_string(&record[row_idx]));\\n\\n\\n\",\n \"file_path\": \"src/cli/src/common/hex_dump.rs\",\n \"rank\": 58,\n \"score\": 181706.32349801995\n },\n {\n \"content\": \"#[cfg(unix)]\\n\\nfn make_executable(file: &mut File) -> Result<(), IoError> {\\n\\n use std::os::unix::fs::PermissionsExt;\\n\\n\\n\\n // Add u+rwx mode to the existing file permissions, leaving others unchanged\\n\\n let mut permissions = file.metadata()?.permissions();\\n\\n let mut mode = permissions.mode();\\n\\n mode |= 0o700;\\n\\n permissions.set_mode(mode);\\n\\n\\n\\n file.set_permissions(permissions)?;\\n\\n Ok(())\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/cli/src/install/mod.rs\",\n \"rank\": 59,\n \"score\": 181150.82924778678\n },\n {\n \"content\": \"fn default_index_max_interval_bytes() -> Size {\\n\\n SPU_LOG_INDEX_MAX_INTERVAL_BYTES\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/storage/src/config.rs\",\n \"rank\": 60,\n \"score\": 180627.58404179462\n },\n {\n \"content\": \"pub fn main_loop(opt: SpuOpt) {\\n\\n use std::time::Duration;\\n\\n\\n\\n use fluvio_future::task::run_block_on;\\n\\n use fluvio_future::timer::sleep;\\n\\n // parse configuration (program exits on error)\\n\\n let (spu_config, tls_acceptor_option) = opt.process_spu_cli_or_exit();\\n\\n\\n\\n println!(\\\"starting spu server (id:{})\\\", spu_config.id);\\n\\n\\n\\n run_block_on(async move {\\n\\n let (_ctx, internal_server, public_server) =\\n\\n create_services(spu_config.clone(), true, true);\\n\\n\\n\\n let _public_shutdown = internal_server.unwrap().run();\\n\\n let _private_shutdown = public_server.unwrap().run();\\n\\n\\n\\n if let Some(tls_config) = tls_acceptor_option {\\n\\n proxy::start_proxy(spu_config, tls_config).await;\\n\\n }\\n\\n\\n\\n println!(\\\"SPU Version: {} started successfully\\\", VERSION);\\n\\n\\n\\n // infinite loop\\n\\n loop {\\n\\n sleep(Duration::from_secs(60)).await;\\n\\n }\\n\\n });\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/spu/src/start.rs\",\n \"rank\": 61,\n \"score\": 179858.67361700776\n },\n {\n \"content\": \"struct SpuSocket {\\n\\n config: ClientConfig,\\n\\n socket: SharedAllMultiplexerSocket,\\n\\n versions: Versions,\\n\\n}\\n\\n\\n\\nimpl SpuSocket {\\n\\n async fn create_serial_socket(&mut self) -> VersionedSerialSocket {\\n\\n VersionedSerialSocket::new(\\n\\n self.socket.clone(),\\n\\n self.config.clone(),\\n\\n self.versions.clone(),\\n\\n )\\n\\n }\\n\\n\\n\\n async fn create_stream<R: Request>(\\n\\n &mut self,\\n\\n request: R,\\n\\n ) -> Result<AsyncResponse<R>, FluvioError> {\\n\\n let req_msg = RequestMessage::new_request(request);\\n\",\n \"file_path\": \"src/client/src/spu/spu_pool.rs\",\n \"rank\": 62,\n \"score\": 178934.71807611093\n },\n {\n \"content\": \"pub trait SpuMd<C: MetadataItem> {\\n\\n fn quick<J>(spu: (J, i32, bool, Option<String>)) -> SpuMetadata<C>\\n\\n where\\n\\n J: Into<String>;\\n\\n}\\n\\n\\n\\nimpl<C: MetadataItem> SpuMd<C> for SpuMetadata<C> {\\n\\n fn quick<J>(spu: (J, i32, bool, Option<String>)) -> SpuMetadata<C>\\n\\n where\\n\\n J: Into<String>,\\n\\n {\\n\\n let mut spec = SpuSpec::default();\\n\\n spec.id = spu.1;\\n\\n spec.rack = spu.3;\\n\\n\\n\\n let mut status = SpuStatus::default();\\n\\n if spu.2 {\\n\\n status.set_online();\\n\\n }\\n\\n\\n\\n SpuMetadata::new(spu.0.into(), spec, status)\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/controlplane-metadata/src/spu/store.rs\",\n \"rank\": 63,\n \"score\": 178159.63147238822\n },\n {\n \"content\": \"//\\n\\n/// Validate assigned topic spec parameters and update topic status\\n\\n/// * error is passed to the topic reason.\\n\\n///\\n\\npub fn validate_assigned_topic_parameters(partition_map: &PartitionMaps) -> TopicNextState {\\n\\n if let Err(err) = partition_map.valid_partition_map() {\\n\\n TopicStatus::next_resolution_invalid_config(&err.to_string()).into()\\n\\n } else {\\n\\n TopicStatus::next_resolution_pending().into()\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/sc/src/controllers/topics/policy.rs\",\n \"rank\": 64,\n \"score\": 177162.63293610784\n },\n {\n \"content\": \"pub fn cert_dir() -> PathBuf {\\n\\n std::env::current_dir().unwrap().join(\\\"tls\\\").join(\\\"certs\\\")\\n\\n}\\n\\n\\n\\npub struct Cert {\\n\\n pub ca: PathBuf,\\n\\n pub cert: PathBuf,\\n\\n pub key: PathBuf,\\n\\n}\\n\\n\\n\\nimpl Cert {\\n\\n pub fn load_client(client_user: &str) -> Self {\\n\\n let cert_dir = cert_dir();\\n\\n Cert {\\n\\n ca: cert_dir.join(\\\"ca.crt\\\"),\\n\\n cert: cert_dir.join(format!(\\\"client-{}.crt\\\", client_user)),\\n\\n key: cert_dir.join(format!(\\\"client-{}.key\\\", client_user)),\\n\\n }\\n\\n }\\n\\n\\n\\n pub fn load_server() -> Self {\\n\\n let cert_dir = cert_dir();\\n\\n Cert {\\n\\n ca: cert_dir.join(\\\"ca.crt\\\"),\\n\\n cert: cert_dir.join(\\\"server.crt\\\"),\\n\\n key: cert_dir.join(\\\"server.key\\\"),\\n\\n }\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"tests/runner/src/tls.rs\",\n \"rank\": 65,\n \"score\": 175548.91157602335\n },\n {\n \"content\": \"fn process_completions_cmd(shell: CompletionShell) -> Result<String, CliError> {\\n\\n let mut app: structopt::clap::App = Root::clap();\\n\\n match shell {\\n\\n CompletionShell::Bash(opt) => {\\n\\n app.gen_completions_to(opt.name, Shell::Bash, &mut std::io::stdout());\\n\\n }\\n\\n // CompletionShell::Zsh(opt) => {\\n\\n // app.gen_completions_to(opt.name, Shell::Zsh, &mut std::io::stdout());\\n\\n // }\\n\\n CompletionShell::Fish(opt) => {\\n\\n app.gen_completions_to(opt.name, Shell::Fish, &mut std::io::stdout());\\n\\n }\\n\\n }\\n\\n Ok(\\\"\\\".to_string())\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/cli/src/root_cli.rs\",\n \"rank\": 66,\n \"score\": 175280.9543787089\n },\n {\n \"content\": \"/// convert SpuGroup to Statefulset\\n\\npub fn convert_cluster_to_statefulset(\\n\\n group_spec: &K8SpuGroupSpec,\\n\\n metadata: &ObjectMeta,\\n\\n group_name: &str,\\n\\n group_svc_name: String,\\n\\n namespace: &str,\\n\\n tls: Option<&TlsConfig>,\\n\\n) -> InputK8Obj<StatefulSetSpec> {\\n\\n let statefulset_name = format!(\\\"flv-spg-{}\\\", group_name);\\n\\n let spec = generate_stateful(group_spec, group_name, group_svc_name, namespace, tls);\\n\\n let owner_ref = metadata.make_owner_reference::<K8SpuGroupSpec>();\\n\\n\\n\\n InputK8Obj {\\n\\n api_version: StatefulSetSpec::api_version(),\\n\\n kind: StatefulSetSpec::kind(),\\n\\n metadata: InputObjectMeta {\\n\\n name: statefulset_name,\\n\\n namespace: metadata.namespace().to_string(),\\n\\n owner_references: vec![owner_ref],\\n\\n ..Default::default()\\n\\n },\\n\\n spec,\\n\\n ..Default::default()\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/sc/src/k8/operator/conversion.rs\",\n \"rank\": 67,\n \"score\": 174893.4018050201\n },\n {\n \"content\": \"pub fn run_k8_operators(\\n\\n namespace: String,\\n\\n k8_client: SharedK8Client,\\n\\n ctx: SharedContext,\\n\\n tls: Option<TlsConfig>,\\n\\n) {\\n\\n SpgOperator::new(k8_client.clone(), namespace.clone(), ctx.clone(), tls).run();\\n\\n\\n\\n let svc_ctx: StoreContext<SpuServicespec> = StoreContext::new();\\n\\n\\n\\n K8ClusterStateDispatcher::<SpuServicespec, _>::start(namespace, k8_client, svc_ctx.clone());\\n\\n SpuServiceController::start(ctx, svc_ctx);\\n\\n}\\n\",\n \"file_path\": \"src/sc/src/k8/operator/mod.rs\",\n \"rank\": 68,\n \"score\": 174882.34195276757\n },\n {\n \"content\": \"pub fn main_k8_loop(opt: ScOpt) {\\n\\n use std::time::Duration;\\n\\n\\n\\n use fluvio_future::task::run_block_on;\\n\\n use fluvio_future::timer::sleep;\\n\\n\\n\\n use crate::init::start_main_loop;\\n\\n // parse configuration (program exits on error)\\n\\n let ((sc_config, auth_policy), k8_config, tls_option) = opt.parse_cli_or_exit();\\n\\n\\n\\n println!(\\\"starting sc server with k8: {}\\\", VERSION);\\n\\n\\n\\n run_block_on(async move {\\n\\n // init k8 service\\n\\n let k8_client = new_shared(k8_config).expect(\\\"problem creating k8 client\\\");\\n\\n let namespace = sc_config.namespace.clone();\\n\\n let ctx = start_main_loop((sc_config.clone(), auth_policy), k8_client.clone()).await;\\n\\n\\n\\n run_k8_operators(\\n\\n namespace.clone(),\\n\",\n \"file_path\": \"src/sc/src/k8/mod.rs\",\n \"rank\": 69,\n \"score\": 174038.35005651397\n },\n {\n \"content\": \"pub fn install_println<S: AsRef<str>>(string: S) {\\n\\n if std::env::var(\\\"FLUVIO_BOOTSTRAP\\\").is_ok() {\\n\\n println!(\\\"\\\\x1B[1;34mfluvio:\\\\x1B[0m {}\\\", string.as_ref());\\n\\n } else {\\n\\n println!(\\\"{}\\\", string.as_ref());\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/cli/src/install/mod.rs\",\n \"rank\": 70,\n \"score\": 173963.57153253473\n },\n {\n \"content\": \"pub fn install_sys(opt: InstallCommand) -> Result<(), CliError> {\\n\\n let mut builder = ClusterInstaller::new().with_namespace(opt.k8_config.namespace);\\n\\n\\n\\n match opt.k8_config.chart_location {\\n\\n // If a chart location is given, use it\\n\\n Some(chart_location) => {\\n\\n builder = builder.with_local_chart(chart_location);\\n\\n }\\n\\n // If we're in develop mode (but no explicit chart location), use local path\\n\\n None if opt.develop => {\\n\\n builder = builder.with_local_chart(\\\"./k8-util/helm\\\");\\n\\n }\\n\\n _ => (),\\n\\n }\\n\\n let installer = builder.build()?;\\n\\n installer._install_sys()?;\\n\\n println!(\\\"fluvio sys chart has been installed\\\");\\n\\n Ok(())\\n\\n}\\n\",\n \"file_path\": \"src/cli/src/cluster/install/k8.rs\",\n \"rank\": 71,\n \"score\": 172378.59851162424\n },\n {\n \"content\": \"pub fn process_delete_cluster<O>(\\n\\n _out: std::sync::Arc<O>,\\n\\n opt: DeleteClusterOpt,\\n\\n) -> Result<String, CliError>\\n\\nwhere\\n\\n O: Terminal,\\n\\n{\\n\\n let cluster_name = opt.cluster_name;\\n\\n\\n\\n let mut config_file = match ConfigFile::load(None) {\\n\\n Ok(config_file) => config_file,\\n\\n Err(e) => {\\n\\n println!(\\\"No config can be found: {}\\\", e);\\n\\n return Ok(\\\"\\\".to_string());\\n\\n }\\n\\n };\\n\\n\\n\\n let config = config_file.mut_config();\\n\\n\\n\\n // Check if the named cluster exists\\n\",\n \"file_path\": \"src/cli/src/profile/mod.rs\",\n \"rank\": 72,\n \"score\": 172191.84016905611\n },\n {\n \"content\": \"/// create batches with produce and records count\\n\\npub fn create_batch_with_producer(producer: i64, records: u16) -> DefaultBatch {\\n\\n let mut batches = DefaultBatch::default();\\n\\n let header = batches.get_mut_header();\\n\\n header.magic = 2;\\n\\n header.producer_id = producer;\\n\\n header.producer_epoch = -1;\\n\\n\\n\\n for _ in 0..records {\\n\\n let mut record = DefaultRecord::default();\\n\\n let bytes: Vec<u8> = vec![10, 20];\\n\\n record.value = bytes.into();\\n\\n batches.add_record(record);\\n\\n }\\n\\n\\n\\n batches\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/storage/src/fixture.rs\",\n \"rank\": 73,\n \"score\": 171912.21213032387\n },\n {\n \"content\": \"/// get path to the binary\\n\\npub fn get_binary(bin_name: &str) -> Result<Command, IoError> {\\n\\n let current_exe =\\n\\n std::env::current_exe().expect(\\\"Failed to get the path of the integration test binary\\\");\\n\\n let mut bin_dir = current_exe\\n\\n .parent()\\n\\n .expect(\\\"failed to get parent\\\")\\n\\n .to_owned();\\n\\n bin_dir.push(bin_name);\\n\\n bin_dir.set_extension(std::env::consts::EXE_EXTENSION);\\n\\n\\n\\n debug!(\\\"try to get binary: {:#?}\\\", bin_dir);\\n\\n if !bin_dir.exists() {\\n\\n Err(IoError::new(\\n\\n ErrorKind::NotFound,\\n\\n format!(\\\"{} not founded in: {:#?}\\\", bin_name, bin_dir),\\n\\n ))\\n\\n } else {\\n\\n Ok(Command::new(bin_dir.into_os_string()))\\n\\n }\\n\\n}\\n\\n\\n\\nuse std::fs::File;\\n\\nuse std::process::Stdio;\\n\\n\\n\",\n \"file_path\": \"src/utils/src/bin.rs\",\n \"rank\": 74,\n \"score\": 171311.34188880972\n },\n {\n \"content\": \"/// create sample batches with variable number of records\\n\\nfn create_batch(records: u16) -> DefaultBatch {\\n\\n let mut batches = DefaultBatch::default();\\n\\n let header = batches.get_mut_header();\\n\\n header.magic = 2;\\n\\n header.producer_id = 20;\\n\\n header.producer_epoch = -1;\\n\\n\\n\\n for i in 0..records {\\n\\n let msg = format!(\\\"record {}\\\", i);\\n\\n let record: DefaultRecord = msg.into();\\n\\n batches.add_record(record);\\n\\n }\\n\\n\\n\\n batches\\n\\n}\\n\\n\\n\\n// create new replica and add two batches\\n\\nasync fn setup_replica() -> Result<FileReplica, StorageError> {\\n\\n let option = default_option();\\n\\n\\n\",\n \"file_path\": \"src/storage/tests/replica_test.rs\",\n \"rank\": 75,\n \"score\": 169361.1765316037\n },\n {\n \"content\": \"#[allow(unused)]\\n\\npub fn get_binary(bin_name: &str) -> Result<Command, IoError> {\\n\\n let current_exe =\\n\\n std::env::current_exe().expect(\\\"Failed to get the path of the integration test binary\\\");\\n\\n let mut bin_dir = current_exe\\n\\n .parent()\\n\\n .expect(\\\"failed to get parent\\\")\\n\\n .to_owned();\\n\\n bin_dir.push(bin_name);\\n\\n bin_dir.set_extension(std::env::consts::EXE_EXTENSION);\\n\\n\\n\\n debug!(\\\"try to get binary: {:#?}\\\", bin_dir);\\n\\n if !bin_dir.exists() {\\n\\n Err(IoError::new(\\n\\n ErrorKind::NotFound,\\n\\n format!(\\\"{} not founded in: {:#?}\\\", bin_name, bin_dir),\\n\\n ))\\n\\n } else {\\n\\n Ok(Command::new(bin_dir.into_os_string()))\\n\\n }\\n\\n}\\n\\n\\n\\nmod cmd_util {\\n\\n\\n\",\n \"file_path\": \"src/cli/src/cluster/util.rs\",\n \"rank\": 76,\n \"score\": 168735.90252817783\n },\n {\n \"content\": \"pub fn create_partition_name(topic_name: &str, idx: &i32) -> String {\\n\\n format!(\\\"{}-{}\\\", topic_name, idx)\\n\\n}\\n\",\n \"file_path\": \"src/dataplane-protocol/src/common.rs\",\n \"rank\": 77,\n \"score\": 168686.799115767\n },\n {\n \"content\": \"/// Encode all partitions for a topic in Kf format.\\n\\npub fn topic_partitions_to_kf_partitions(\\n\\n partitions: &PartitionLocalStore,\\n\\n topic: &String,\\n\\n) -> Vec<MetadataResponsePartition> {\\n\\n let mut kf_partitions = vec![];\\n\\n\\n\\n for (idx, partition) in partitions.topic_partitions(topic).iter().enumerate() {\\n\\n kf_partitions.push(MetadataResponsePartition {\\n\\n error_code: KfErrorCode::None,\\n\\n partition_index: idx as i32,\\n\\n leader_id: partition.spec.leader,\\n\\n leader_epoch: 0,\\n\\n replica_nodes: partition.spec.replicas.clone(),\\n\\n isr_nodes: partition.status.live_replicas().clone(),\\n\\n offline_replicas: partition.status.offline_replicas(),\\n\\n })\\n\\n }\\n\\n\\n\\n kf_partitions\\n\\n}\\n\",\n \"file_path\": \"src/sc/src/services/public_api/metadata/fetch.rs\",\n \"rank\": 78,\n \"score\": 166012.21578300878\n },\n {\n \"content\": \"fn fluvio_bin_dir() -> Result<PathBuf, CliError> {\\n\\n let home =\\n\\n dirs::home_dir().ok_or_else(|| IoError::new(ErrorKind::NotFound, \\\"Homedir not found\\\"))?;\\n\\n Ok(home.join(\\\".fluvio/bin/\\\"))\\n\\n}\\n\\n\\n\\n/// Fetches the latest version of the package with the given ID\\n\\n#[instrument(\\n\\n skip(agent, target, id),\\n\\n fields(%target, id = %id.display())\\n\\n)]\\n\\nasync fn fetch_latest_version<T>(\\n\\n agent: &HttpAgent,\\n\\n id: &PackageId<T>,\\n\\n target: Target,\\n\\n) -> Result<Version, CliError> {\\n\\n let request = agent.request_package(id)?;\\n\\n debug!(\\n\\n url = %request.url(),\\n\\n \\\"Requesting package manifest:\\\",\\n\",\n \"file_path\": \"src/cli/src/install/mod.rs\",\n \"rank\": 79,\n \"score\": 163206.60787920497\n },\n {\n \"content\": \"/// Getting server hostname from K8 context\\n\\nfn check_cluster_server_host() -> Result<StatusCheck, CheckError> {\\n\\n let config = K8Config::load()?;\\n\\n let context = match config {\\n\\n K8Config::Pod(_) => {\\n\\n return Ok(StatusCheck::Working(\\n\\n \\\"Pod config found, ignoring the check\\\".to_string(),\\n\\n ))\\n\\n }\\n\\n K8Config::KubeConfig(context) => context,\\n\\n };\\n\\n\\n\\n let cluster_context = context\\n\\n .config\\n\\n .current_cluster()\\n\\n .ok_or(CheckError::NoActiveKubernetesContext)?;\\n\\n let server_url = cluster_context.cluster.server.to_owned();\\n\\n let url =\\n\\n Url::parse(&server_url).map_err(|source| CheckError::BadKubernetesServerUrl { source })?;\\n\\n let host = url\\n\\n .host()\\n\",\n \"file_path\": \"src/cluster/src/check.rs\",\n \"rank\": 80,\n \"score\": 163117.31866026943\n },\n {\n \"content\": \"struct SimplePolicy {}\\n\\n\\n\\nimpl SimplePolicy {\\n\\n fn new() -> Self {\\n\\n SimplePolicy {}\\n\\n }\\n\\n}\\n\\n\\n\\nimpl ElectionPolicy for SimplePolicy {\\n\\n fn potential_leader_score(\\n\\n &self,\\n\\n replica_status: &ReplicaStatus,\\n\\n leader: &ReplicaStatus,\\n\\n ) -> ElectionScoring {\\n\\n let lag = leader.leo - replica_status.leo;\\n\\n if lag < 4 {\\n\\n ElectionScoring::Score(lag as u16)\\n\\n } else {\\n\\n ElectionScoring::NotSuitable\\n\\n }\\n\",\n \"file_path\": \"src/sc/src/controllers/partitions/reducer.rs\",\n \"rank\": 81,\n \"score\": 161694.040749852\n },\n {\n \"content\": \"pub fn display_current_profile<O>(out: std::sync::Arc<O>)\\n\\nwhere\\n\\n O: Terminal,\\n\\n{\\n\\n match ConfigFile::load(None) {\\n\\n Ok(config_file) => {\\n\\n if let Some(profile) = config_file.config().current_profile_name() {\\n\\n t_println!(out, \\\"{}\\\", profile);\\n\\n } else {\\n\\n t_println!(out, \\\"no current profile set\\\");\\n\\n }\\n\\n }\\n\\n Err(_) => t_println!(out, \\\"no profile can be founded\\\"),\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/cli/src/profile/context.rs\",\n \"rank\": 82,\n \"score\": 160275.68229680642\n },\n {\n \"content\": \"#[allow(unused)]\\n\\npub fn open_log(prefix: &str) -> (File, File) {\\n\\n let output = File::create(format!(\\\"/tmp/flv_{}.out\\\", prefix)).expect(\\\"log file\\\");\\n\\n let error = File::create(format!(\\\"/tmp/flv_{}.log\\\", prefix)).expect(\\\"err file\\\");\\n\\n\\n\\n (output, error)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/utils/src/bin.rs\",\n \"rank\": 83,\n \"score\": 160057.91368619585\n },\n {\n \"content\": \"type FileReplicaContext = GlobalContext<FileReplica>;\\n\\n\\n\\nconst VERSION: &str = env!(\\\"CARGO_PKG_VERSION\\\");\\n\\n\\n\",\n \"file_path\": \"src/spu/src/start.rs\",\n \"rank\": 84,\n \"score\": 159683.35318296106\n },\n {\n \"content\": \"/// handle watch request by spawning watch controller for each store\\n\\npub fn handle_watch_request<T, AC>(\\n\\n request: RequestMessage<WatchRequest>,\\n\\n auth_ctx: &AuthServiceContext<AC>,\\n\\n sink: InnerExclusiveFlvSink<T>,\\n\\n end_event: Arc<Event>,\\n\\n) where\\n\\n T: AsyncWrite + AsyncRead + Unpin + Send + ZeroCopyWrite + 'static,\\n\\n{\\n\\n debug!(\\\"handling watch request\\\");\\n\\n let (header, req) = request.get_header_request();\\n\\n\\n\\n match req {\\n\\n WatchRequest::Topic(_) => unimplemented!(),\\n\\n WatchRequest::Spu(epoch) => WatchController::<T, SpuSpec>::update(\\n\\n epoch,\\n\\n sink,\\n\\n end_event,\\n\\n auth_ctx.global_ctx.spus().clone(),\\n\\n header,\\n\\n ),\\n\",\n \"file_path\": \"src/sc/src/services/public_api/watch.rs\",\n \"rank\": 85,\n \"score\": 158668.22438208546\n },\n {\n \"content\": \"/// Customize System Test\\n\\npub trait SpuTest: Sized {\\n\\n type ResponseFuture: Send + Future<Output = Result<(), FlvSocketError>>;\\n\\n\\n\\n /// environment configuration\\n\\n fn env_configuration(&self) -> TestGenerator;\\n\\n\\n\\n /// number of followers\\n\\n fn followers(&self) -> usize;\\n\\n\\n\\n /// replicas. by default, it's empty\\n\\n fn replicas(&self) -> Vec<ReplicaKey> {\\n\\n vec![]\\n\\n }\\n\\n\\n\\n /// main entry point\\n\\n fn main_test(&self, runner: Arc<SpuTestRunner<Self>>) -> Self::ResponseFuture;\\n\\n}\\n\",\n \"file_path\": \"src/spu/src/tests/fixture/mod.rs\",\n \"rank\": 86,\n \"score\": 158509.53241412842\n },\n {\n \"content\": \"/// Customize System Test\\n\\npub trait ScTest: Sized {\\n\\n type ResponseFuture: Send + Future<Output = Result<(), FlvSocketError>>;\\n\\n\\n\\n /// environment configuration\\n\\n fn env_configuration(&self) -> TestGenerator;\\n\\n\\n\\n fn topics(&self) -> Vec<(String, Vec<Vec<SpuId>>)>;\\n\\n\\n\\n /// main entry point\\n\\n fn main_test(&self, runner: Arc<ScTestRunner<Self>>) -> Self::ResponseFuture;\\n\\n}\\n\",\n \"file_path\": \"src/sc/src/tests/fixture/mod.rs\",\n \"rank\": 87,\n \"score\": 158502.15724790248\n },\n {\n \"content\": \"#[async_trait]\\n\\npub trait ReplicaLeader: Send + Sync {\\n\\n type OffsetPartitionResponse: PartitionOffset;\\n\\n type Client: Client;\\n\\n\\n\\n fn config(&self) -> &ReplicaLeaderConfig;\\n\\n\\n\\n \\n\\n fn topic(&self) -> &str {\\n\\n &self.config().topic()\\n\\n }\\n\\n\\n\\n fn partition(&self) -> i32 {\\n\\n self.config().partition()\\n\\n }\\n\\n\\n\\n fn addr(&self) -> &str;\\n\\n\\n\\n fn mut_client(&mut self) -> &mut Self::Client;\\n\\n\\n\\n // fetch offsets for\\n\",\n \"file_path\": \"src/client/src/replica/leader.rs\",\n \"rank\": 88,\n \"score\": 157518.03382083654\n },\n {\n \"content\": \"pub fn read_bytes_from_file<P>(path: P) -> Result<Vec<u8>, io::Error>\\n\\nwhere\\n\\n P: AsRef<Path>,\\n\\n{\\n\\n let file_path = path.as_ref();\\n\\n info!(\\\"test file: {}\\\", file_path.display());\\n\\n let mut f = File::open(file_path)?;\\n\\n let mut buffer = Vec::new();\\n\\n f.read_to_end(&mut buffer)?;\\n\\n Ok(buffer)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/storage/src/fixture.rs\",\n \"rank\": 89,\n \"score\": 157458.31501066964\n },\n {\n \"content\": \"fn print_sc_logs() {\\n\\n use std::process::Command;\\n\\n\\n\\n let _ = Command::new(\\\"kubectl\\\")\\n\\n .arg(\\\"logs\\\")\\n\\n .arg(\\\"flv-sc\\\")\\n\\n .print()\\n\\n .inherit();\\n\\n\\n\\n let _ = Command::new(\\\"kubectl\\\")\\n\\n .arg(\\\"get\\\")\\n\\n .arg(\\\"spu\\\")\\n\\n .print()\\n\\n .inherit();\\n\\n}\\n\\n*/\\n\",\n \"file_path\": \"tests/runner/src/environment/k8.rs\",\n \"rank\": 90,\n \"score\": 157002.22130866878\n },\n {\n \"content\": \"struct SpuOnlineStatus {\\n\\n online: bool,\\n\\n // last time status was known\\n\\n time: Instant,\\n\\n}\\n\\n\\n\\nimpl SpuOnlineStatus {\\n\\n fn new() -> Self {\\n\\n Self {\\n\\n online: false,\\n\\n time: Instant::now(),\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\n/// Keep track of SPU status\\n\\n/// if SPU has not send heart beat within a period, it is considered down\\n\\npub struct SpuController {\\n\\n spus: StoreContext<SpuSpec>,\\n\\n health_receiver: Receiver<SpuAction>,\\n\",\n \"file_path\": \"src/sc/src/controllers/spus/controller.rs\",\n \"rank\": 91,\n \"score\": 156979.36336869633\n },\n {\n \"content\": \" pub trait Terminal: Sized {\\n\\n fn print(&self, msg: &str);\\n\\n fn println(&self, msg: &str);\\n\\n\\n\\n fn render_list<T>(self: Arc<Self>, list: &T, mode: OutputType) -> Result<(), CliError>\\n\\n where\\n\\n T: TableOutputHandler + Serialize,\\n\\n {\\n\\n if mode.is_table() {\\n\\n let render = TableRenderer::new(self);\\n\\n render.render(list, false);\\n\\n } else {\\n\\n let render = SerdeRenderer::new(self);\\n\\n render.render(&list, mode.into())?;\\n\\n }\\n\\n\\n\\n Ok(())\\n\\n }\\n\\n\\n\\n fn render_table<T: TableOutputHandler>(self: Arc<Self>, val: &T, indent: bool) {\\n\",\n \"file_path\": \"src/cli/src/output/mod.rs\",\n \"rank\": 92,\n \"score\": 154231.18898023086\n },\n {\n \"content\": \"fn default_base_dir() -> PathBuf {\\n\\n Path::new(\\\"/tmp\\\").to_path_buf()\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/storage/src/config.rs\",\n \"rank\": 93,\n \"score\": 152434.6667583563\n },\n {\n \"content\": \"fn default_option() -> ConfigOption {\\n\\n ConfigOption {\\n\\n segment_max_bytes: 10000,\\n\\n base_dir: temp_dir().join(TEST_REP_DIR),\\n\\n index_max_interval_bytes: 1000,\\n\\n index_max_bytes: 1000,\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/storage/tests/replica_test.rs\",\n \"rank\": 94,\n \"score\": 152018.8977997524\n },\n {\n \"content\": \"#[derive(Debug)]\\n\\nstruct ScopeBindings(HashMap<String, Vec<String>>);\\n\\n\\n\\nimpl ScopeBindings {\\n\\n pub fn load(scope_binding_file_path: &Path) -> Result<Self, IoError> {\\n\\n let file = std::fs::read_to_string(scope_binding_file_path)?;\\n\\n let scope_bindings = Self(serde_json::from_str(&file)?);\\n\\n debug!(\\\"scope bindings loaded {:?}\\\", scope_bindings);\\n\\n Ok(scope_bindings)\\n\\n }\\n\\n pub fn get_scopes(&self, principal: &str) -> Vec<String> {\\n\\n trace!(\\\"getting scopes for principal {:?}\\\", principal);\\n\\n if let Some(scopes) = self.0.get(principal) {\\n\\n trace!(\\\"scopes found for principal {:?}: {:?}\\\", principal, scopes);\\n\\n scopes.clone()\\n\\n } else {\\n\\n trace!(\\\"scopes not found for principal {:?}\\\", principal);\\n\\n Vec::new()\\n\\n }\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/auth/src/x509/authenticator.rs\",\n \"rank\": 95,\n \"score\": 149360.81397812214\n },\n {\n \"content\": \"#[allow(clippy::needless_range_loop)]\\n\\npub fn validate_message(iter: u16, offset: i64, topic: &str, option: &TestOption, data: &[u8]) {\\n\\n let prefix_string = generate_pre_fix(topic, offset);\\n\\n let prefix = prefix_string.as_bytes().to_vec();\\n\\n let prefix_len = prefix.len();\\n\\n\\n\\n let message_len = option.produce.record_size + prefix_len;\\n\\n assert_eq!(\\n\\n data.len(),\\n\\n message_len,\\n\\n \\\"message should be: {}\\\",\\n\\n message_len\\n\\n );\\n\\n\\n\\n // check prefix\\n\\n for i in 0..prefix_len {\\n\\n assert!(\\n\\n data[i] == prefix[i],\\n\\n \\\"prefix failed, iter: {}, index: {}, data: {}, prefix: {}, data len: {}, offset: {}, topic: {}\\\",\\n\\n iter,\\n\\n i,\\n\",\n \"file_path\": \"tests/runner/src/tests/smoke/message.rs\",\n \"rank\": 96,\n \"score\": 144540.9149003571\n },\n {\n \"content\": \"/// Converts a byte to string character\\n\\nfn byte_to_string(byte: &u8) -> String {\\n\\n if 0x20 <= *byte && *byte < 0x7f {\\n\\n format!(\\\"{}\\\", *byte as char)\\n\\n } else if *byte == 0xa {\\n\\n \\\".\\\".to_owned()\\n\\n } else {\\n\\n \\\" \\\".to_owned()\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/cli/src/common/hex_dump.rs\",\n \"rank\": 97,\n \"score\": 142009.3609950075\n },\n {\n \"content\": \"fn test_repl_id() -> ReplicaKey {\\n\\n ReplicaKey::new(\\\"topic1\\\", 0)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/spu/src/tests/suites/test_offsets.rs\",\n \"rank\": 98,\n \"score\": 141545.29065710047\n },\n {\n \"content\": \"fn test_repl_id() -> ReplicaKey {\\n\\n ReplicaKey::new(\\\"topic1\\\", 0)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/spu/src/tests/suites/test_fetch.rs\",\n \"rank\": 99,\n \"score\": 141545.29065710047\n }\n]","isConversational":false}}},{"rowIdx":2370,"cells":{"lang":{"kind":"string","value":"Rust"},"file_path":{"kind":"string","value":"exe-common/src/network/hermes.rs"},"repo_name":{"kind":"string","value":"nahern/rust-cardano"},"commit":{"kind":"string","value":"03fc923641808361273f1645eef221fdf908f5cf"},"file_code":{"kind":"string","value":"use cardano::{block::{block, Block, BlockHeader, BlockDate, RawBlock, HeaderHash}, tx::{TxAux}};\nuse cardano::hash::{HASH_SIZE_256};\nuse storage;\nuse std::io::Write;\nuse std::time::{SystemTime, Duration};\nuse std::thread;\n\nuse futures::{Future, Stream};\nuse hyper::Client;\nuse tokio_core::reactor::Core;\n\nuse network::{Result, Error};\nuse network::api::{Api, BlockRef};\n\nstatic NETWORK_REFRESH_FREQUENCY: Duration = Duration::from_secs(60 * 10);\n\npub struct HermesEndPoint {\n pub url: String,\n pub blockchain: String,\n core: Core\n}\n\nimpl HermesEndPoint {\n pub fn new(url: String, blockchain: String) -> Self {\n HermesEndPoint { url, blockchain, core: Core::new().unwrap() }\n }\n\n pub fn uri(& mut self, path: &str) -> String {\n format!(\"{}/{}\", self.url, path)\n }\n}\n\nimpl Api for HermesEndPoint {\n fn get_tip(&mut self) -> Result<BlockHeader> {\n let uri = self.uri(\"tip\");\n info!(\"querying uri: {}\", uri);\n\n let mut err = None;\n\n let mut bh_bytes = Vec::with_capacity(4096);\n {\n let client = Client::new(&self.core.handle());\n let work = client.get(uri.parse().unwrap()).from_err::<Error>()\n .and_then(|res| {\n if !res.status().is_success() {\n err = Some(Error::HttpError(uri, res.status().clone()));\n };\n res.body().from_err::<Error>().for_each(|chunk| {\n bh_bytes.write_all(&chunk).map_err(From::from)\n })\n });\n let now = SystemTime::now();\n self.core.run(work)?;\n let time_elapsed = now.elapsed().unwrap();\n info!(\"Downloaded TIP in {}sec\", time_elapsed.as_secs());\n }\n\n if let Some(err) = err { return Err(err) };\n\n let bh_raw = block::RawBlockHeader::from_dat(bh_bytes);\n Ok(bh_raw.decode()?)\n }\n\n fn wait_for_new_tip(&mut self, prev_tip: &HeaderHash) -> Result<BlockHeader> {\n loop {\n let new_tip = self.get_tip()?;\n if new_tip.compute_hash() != *prev_tip { return Ok(new_tip) }\n\n info!(\"Sleeping for {:?}\", NETWORK_REFRESH_FREQUENCY);\n thread::sleep(NETWORK_REFRESH_FREQUENCY);\n }\n }\n\n fn get_block(&mut self, hash: &HeaderHash) -> Result<RawBlock> {\n let uri = self.uri(&format!(\"block/{}\", hash));\n info!(\"querying uri: {}\", uri);\n let client = Client::new(&self.core.handle());\n let mut block_raw = vec!();\n let mut err = None;\n {\n let work = client.get(uri.parse().unwrap()).and_then(|res| {\n if !res.status().is_success() {\n err = Some(Error::HttpError(uri, res.status().clone()));\n };\n res.body().for_each(|chunk| {\n block_raw.append(&mut chunk.to_vec());\n Ok(())\n })\n });\n let now = SystemTime::now();\n self.core.run(work)?;\n let time_elapsed = now.elapsed().unwrap();\n info!(\"Downloaded block in {}sec\", time_elapsed.as_secs());\n }\n if let Some(err) = err { return Err(err) };\n Ok(RawBlock::from_dat(block_raw))\n }\n\n fn get_blocks<F>( &mut self\n , from: &BlockRef\n , inclusive: bool\n , to: &BlockRef\n , got_block: &mut F\n ) -> Result<()>\n where F: FnMut(&HeaderHash, &Block, &RawBlock) -> ()\n {\n let mut inclusive = inclusive;\n let mut from = from.clone();\n\n loop {\n\n \n if let BlockDate::Normal(d) = from.date {\n if d.slotid == 21599 && !inclusive {\n from = BlockRef {\n hash: HeaderHash::from([0;HASH_SIZE_256]), \n parent: from.hash.clone(),\n date: BlockDate::Genesis(d.epoch + 1)\n };\n inclusive = true;\n };\n };\n\n let epoch = from.date.get_epochid();\n\n if !inclusive && to.hash == from.hash { break }\n\n if inclusive && from.date.is_genesis() && epoch < to.date.get_epochid() {\n\n \n\n let mut tmppack = vec!();\n let mut err = None;\n\n {\n let uri = self.uri(&format!(\"epoch/{}\", epoch));\n info!(\"querying uri: {}\", uri);\n let client = Client::new(&self.core.handle());\n let work = client.get(uri.parse().unwrap()).and_then(|res| {\n if !res.status().is_success() {\n err = Some(Error::HttpError(uri, res.status().clone()));\n };\n res.body().for_each(|chunk| {\n tmppack.append(&mut chunk.to_vec());\n Ok(())\n })\n });\n let now = SystemTime::now();\n self.core.run(work)?;\n let time_elapsed = now.elapsed().unwrap();\n info!(\"Downloaded EPOCH in {}sec\", time_elapsed.as_secs());\n }\n\n if let Some(err) = err { return Err(err) };\n\n let mut packfile = storage::containers::packfile::Reader::from(&tmppack[..]);\n\n while let Some(data) = packfile.get_next() {\n let block_raw = block::RawBlock(data);\n let block = block_raw.decode()?;\n let hdr = block.get_header();\n\n assert!(hdr.get_blockdate().get_epochid() == epoch);\n \n\n if from.date <= hdr.get_blockdate() {\n got_block(&hdr.compute_hash(), &block, &block_raw);\n }\n\n from = BlockRef {\n hash: hdr.compute_hash(),\n parent: hdr.get_previous_header(),\n date: hdr.get_blockdate()\n };\n inclusive = false;\n }\n }\n\n else {\n\n \n\n let mut blocks = vec![];\n let mut to = to.hash.clone();\n\n loop {\n let block_raw = self.get_block(&to)?;\n let block = block_raw.decode()?;\n let hdr = block.get_header();\n assert!(hdr.get_blockdate() >= from.date);\n let prev = hdr.get_previous_header();\n blocks.push((hdr.compute_hash(), block, block_raw));\n if (inclusive && prev == from.parent)\n || (!inclusive && prev == from.hash)\n {\n break\n }\n to = prev;\n }\n\n while let Some((hash, block, block_raw)) = blocks.pop() {\n got_block(&hash, &block, &block_raw);\n }\n\n break;\n }\n }\n\n Ok(())\n }\n\n fn send_transaction( &mut self, txaux: TxAux) -> Result<bool> {\n Ok(false)\n }\n}\n"},"prefix":{"kind":"string","value":"use cardano::{block::{block, Block, BlockHeader, BlockDate, RawBlock, HeaderHash}, tx::{TxAux}};\nuse cardano::hash::{HASH_SIZE_256};\nuse storage;\nuse std::io::Write;\nuse std::time::{SystemTime, Duration};\nuse std::thread;\n\nuse futures::{Future, Stream};\nuse hyper::Client;\nuse tokio_core::reactor::Core;\n\nuse network::{Result, Error};\nuse network::api::{Api, BlockRef};\n\nstatic NETWORK_REFRESH_FREQUENCY: Duration = Duration::from_secs(60 * 10);\n\npub struct HermesEndPoint {\n pub url: String,\n pub blockchain: String,\n core: Core\n}\n\nimpl HermesEndPoint {\n pub fn new(url: String, blockchain: String) -> Self {\n HermesEndPoint { url, blockchain, core: Core::new().unwrap() }\n }\n\n pub fn uri(& mut self, path: &str) -> String {\n format!(\"{}/{}\", self.url, path)\n }\n}\n\nimpl Api for HermesEndPoint {\n fn get_tip(&mut self) -> Result<BlockHeader> {\n let uri = self.uri(\"tip\");\n info!(\"querying uri: {}\", uri);\n\n let mut err = None;\n\n let mut bh_bytes = Vec::with_capacity(4096);\n {\n let client = Client::new(&self.core.handle());\n let work = client.get(uri.parse().unwrap()).from_err::<Error>()\n .and_then(|res| {\n if !res.status().is_success() {\n err = Some(Error::HttpError(uri, res.status().clone()));\n };\n res.body().from_err::<Error>().for_each(|chunk| {\n bh_bytes.write_all(&chunk).map_err(From::from)\n })\n });\n let now = SystemTime::now();\n self.core.run(work)?;\n let time_elapsed = now.elapsed().unwrap();\n info!(\"Downloaded TIP in {}sec\", time_elapsed.as_secs());\n }\n\n if let Some(err) = err { return Err(err) };\n\n let bh_raw = block::RawBlockHeader::from_dat(bh_bytes);\n Ok(bh_raw.decode()?)\n }\n\n fn wait_for_new_tip(&mut self, prev_tip: &HeaderHash) -> Result<BlockHeader> {\n loop {\n let new_tip = self.get_tip()?;\n if new_tip.compute_hash() != *prev_tip { return Ok(new_tip) }\n\n info!(\"Sleeping for {:?}\", NETWORK_REFRESH_FREQUENCY);\n thread::sleep(NETWORK_REFRESH_FREQUENCY);\n }\n }\n\n fn get_block(&mut self, hash: &HeaderHash) -> Result<RawBlock> {\n let uri = self.uri(&format!(\"block/{}\", hash));\n info!(\"querying uri: {}\", uri);\n let client = Client::new(&self.core.handle());\n let mut block_raw = vec!();\n let mut err = None;\n {\n let work = client.get(uri.parse().unwrap()).and_then(|res| {\n if !res.status().is_success() {\n err = Some(Error::HttpError(uri, res.status().clone()));\n };\n res.body().for_each(|chunk| {\n block_raw.append(&mut chunk.to_vec());\n Ok(())\n })\n });\n let now = SystemTime::now();\n self.core.run(work)?;\n let time_elapsed = now.elapsed().unwrap();\n info!(\"Downloaded block in {}sec\", time_elapsed.as_secs());\n }\n if let Some(err) = err { return Err(err) };\n Ok(RawBlock::from_dat(block_raw))\n }\n\n fn get_blocks<F>( &mut self\n , from: &BlockRef\n , inclusive: bool\n , to: &BlockRef\n , got_block: &mut F\n ) -> Result<()>\n where F: FnMut(&HeaderHash, &Block, &RawBlock) -> ()\n {\n let mut inclusive = inclusive;\n let mut from = from.clone();\n\n loop {\n\n \n if let BlockDate::Normal(d) = from.date {\n if d.slotid == 21599 && !inclusive {\n from = BlockRef {\n hash: HeaderHash::from([0;HASH_SIZE_256]), \n parent: from.hash.clone(),\n date: BlockDate::Genesis(d.epoch + 1)\n };\n inclusive = true;\n };\n };\n\n let epoch = from.date.get_epochid();\n\n if !inclusive && to.hash == from.hash { break }\n\n if inclusive && from.date.is_genesis() && epoch < to.date.get_epochid() {\n\n \n\n let mut tmppack = vec!();\n let mut err = None;\n\n {\n let uri = self.uri(&format!(\"epoch/{}\", epoch));\n info!(\"querying uri: {}\", uri);\n let client = Client::new(&self.core.handle());\n let work = client.get(uri.parse().unwrap()).and_then(|res| {\n if !res.status().is_success() {\n err = Some(Error::HttpError(uri, res.status().clone()));\n };\n res.body().for_each(|chunk| {\n tmppack.append(&mut chunk.to_vec());\n Ok(())\n })\n });\n let now = SystemTime::now();\n self.core.run(work)?;\n let time_elapsed = now.elapsed().unwrap();\n info!(\"Downloaded EPOCH in {}sec\", time_elapsed.as_secs());\n }\n\n if let Some(err) = err { return Err(err) };\n\n let mut packfile = storage::containers::packfile::Reader::from(&tmppack[..]);\n\n while let Some(data) = packfile.get_next() {\n let block_raw = block::RawBlock(data);\n let block = block_raw.decode()?;\n let hdr = block.get_header();\n\n assert!(hdr.get_blockdate().get_epochid() == epoch);\n \n\n "},"suffix":{"kind":"string","value":"\n\n from = BlockRef {\n hash: hdr.compute_hash(),\n parent: hdr.get_previous_header(),\n date: hdr.get_blockdate()\n };\n inclusive = false;\n }\n }\n\n else {\n\n \n\n let mut blocks = vec![];\n let mut to = to.hash.clone();\n\n loop {\n let block_raw = self.get_block(&to)?;\n let block = block_raw.decode()?;\n let hdr = block.get_header();\n assert!(hdr.get_blockdate() >= from.date);\n let prev = hdr.get_previous_header();\n blocks.push((hdr.compute_hash(), block, block_raw));\n if (inclusive && prev == from.parent)\n || (!inclusive && prev == from.hash)\n {\n break\n }\n to = prev;\n }\n\n while let Some((hash, block, block_raw)) = blocks.pop() {\n got_block(&hash, &block, &block_raw);\n }\n\n break;\n }\n }\n\n Ok(())\n }\n\n fn send_transaction( &mut self, txaux: TxAux) -> Result<bool> {\n Ok(false)\n }\n}\n"},"middle":{"kind":"string","value":"if from.date <= hdr.get_blockdate() {\n got_block(&hdr.compute_hash(), &block, &block_raw);\n }"},"strategy":{"kind":"string","value":"if_condition"},"context_items":{"kind":"list like","value":[{"content":"pub fn resolve_date_to_blockhash(storage: &Storage, tip: &BlockHash, date: &BlockDate) -> Result<Option<BlockHash>> {\n\n let epoch = date.get_epochid();\n\n match epoch_open_packref(&storage.config, epoch) {\n\n Ok(mut handle) => {\n\n let slotid = match date {\n\n BlockDate::Genesis(_) => 0,\n\n BlockDate::Normal(sid) => sid.slotid,\n\n };\n\n let r = handle.getref_at_index(slotid as u32)?;\n\n Ok(r)\n\n },\n\n Err(_) => {\n\n let tip_rblk = block_read(&storage, tip);\n\n match tip_rblk {\n\n None => return Ok(None),\n\n Some(rblk) => {\n\n let blk = rblk.decode()?;\n\n let found = block_reverse_search_from_tip(storage, &blk, |x|\n\n match x.get_header().get_blockdate().cmp(date) {\n\n Ordering::Equal => Ok(ReverseSearch::Found),\n","file_path":"storage/src/block/iter.rs","rank":0,"score":454748.1691610039},{"content":"pub fn dump_file(file: &mut fs::File) -> Result<(Lookup, Vec<BlockHash>)> {\n\n let lookup = Lookup::read_from_file(file)?;\n\n\n\n let mut v = Vec::new();\n\n let FanoutTotal(total) = lookup.fanout.get_total();\n\n\n\n file.seek(SeekFrom::Start(HEADER_SIZE as u64)).unwrap();\n\n for _ in 0..total {\n\n let h = file_read_hash(file);\n\n v.push(h);\n\n }\n\n Ok((lookup, v))\n\n}\n\n\n\npub struct ReaderNoLookup<R> {\n\n handle: R,\n\n}\n\n\n\nimpl ReaderNoLookup<fs::File> {\n\n pub fn init<P: AsRef<Path>>(path: P) -> Result<Self> {\n","file_path":"storage/src/containers/indexfile.rs","rank":1,"score":405472.52025529183},{"content":"/// Check whether an epoch pack exists on disk.\n\npub fn epoch_exists(config: &StorageConfig, epochid: cardano::block::EpochId) -> Result<bool> {\n\n match epoch_read_pack(config, epochid) {\n\n Ok(_) => Ok(true),\n\n Err(Error::StorageError(StorageError::IoError(ref err))) if err.kind() == ::std::io::ErrorKind::NotFound => Ok(false),\n\n Err(err) => Err(err)\n\n }\n\n}\n","file_path":"storage/src/epoch.rs","rank":2,"score":399954.2923208799},{"content":"// a block in a pack file is:\n\n// * a 32 bit size in big endian\n\n// * data of the size above\n\n// * 0 to 3 bytes of 0-alignment to make sure the next block is aligned\n\npub fn read_next_block<R: Read>(mut file: R) -> io::Result<Vec<u8>> {\n\n let mut sz_buf = [0u8;SIZE_SIZE];\n\n file.read_exact(&mut sz_buf)?;\n\n let sz = read_size(&sz_buf);\n\n // don't potentially consume all memory when reading a corrupt file\n\n assert!(sz < 20000000);\n\n let mut v : Vec<u8> = repeat(0).take(sz as usize).collect();\n\n file.read_exact(v.as_mut_slice())?;\n\n if (v.len() % 4) != 0 {\n\n let to_align = 4 - (v.len() % 4);\n\n let mut align = [0u8;4];\n\n file.read_exact(&mut align[0..to_align])?;\n\n }\n\n Ok(v)\n\n}\n\n\n","file_path":"storage/src/containers/packfile.rs","rank":3,"score":395921.0990292125},{"content":"pub fn get_epoch_tag(epoch: block::EpochId) -> String {\n\n format!(\"EPOCH_{}\", epoch)\n\n}\n\n\n","file_path":"storage/src/tag.rs","rank":4,"score":389409.55049487134},{"content":"fn block_reverse_search_from_tip<F>(storage: &Storage, first_block: &Block, find: F) -> Result<Option<Block>>\n\n where F: Fn(&Block) -> Result<ReverseSearch>\n\n{\n\n let mut current_blk = first_block.clone();\n\n loop {\n\n match find(¤t_blk)? {\n\n ReverseSearch::Continue => {\n\n let blk = previous_block(&storage, ¤t_blk);\n\n current_blk = blk;\n\n },\n\n ReverseSearch::Found => { return Ok(Some(current_blk)) },\n\n ReverseSearch::Abort => { return Ok(None) },\n\n };\n\n }\n\n}\n\n\n","file_path":"storage/src/block/iter.rs","rank":5,"score":372183.4932974319},{"content":"pub fn epoch_read_pack(config: &StorageConfig, epochid: cardano::block::EpochId) -> Result<PackHash> {\n\n let mut content = Vec::new();\n\n\n\n let pack_filepath = config.get_epoch_pack_filepath(epochid);\n\n let mut file = fs::File::open(&pack_filepath)?;\n\n let _read = file.read_to_end(&mut content).unwrap();\n\n\n\n let p = String::from_utf8(content.clone()).ok().and_then(|r| hex::decode(&r).ok()).unwrap();\n\n let mut ph = [0u8; super::HASH_SIZE];\n\n ph.clone_from_slice(&p[..]);\n\n\n\n Ok(ph)\n\n}\n\n\n","file_path":"storage/src/epoch.rs","rank":6,"score":365894.7577454153},{"content":"pub fn epoch_read(config: &StorageConfig, epochid: cardano::block::EpochId) -> Result<(PackHash, reffile::Reader)> {\n\n let ph = epoch_read_pack(config, epochid)?;\n\n let rp = epoch_read_packref(config, epochid)?;\n\n Ok((ph, rp))\n\n}\n\n\n","file_path":"storage/src/epoch.rs","rank":7,"score":355445.3876328509},{"content":"fn next_until_range(packreader: &mut packfile::Reader<fs::File>, start_date: &BlockDate, end_date: &BlockDate) -> Result<Option<Block>> {\n\n loop {\n\n match packreader.get_next() {\n\n None => { return Ok(None) },\n\n Some(b) => {\n\n let mut blk = RawBlock(b).decode().unwrap();\n\n let blk_date = blk.get_header().get_blockdate();\n\n if &blk_date > end_date {\n\n return Ok(None)\n\n };\n\n if &blk_date >= start_date {\n\n return Ok(Some(blk))\n\n }\n\n },\n\n }\n\n }\n\n}\n\n\n\npub enum ReverseSearch {\n\n Continue,\n\n Found,\n\n Abort,\n\n}\n\n\n","file_path":"storage/src/block/iter.rs","rank":8,"score":352560.7437630693},{"content":"pub fn write_hash<S: AsRef<str>>(storage: &super::Storage, name: &S, content: &block::HeaderHash) {\n\n write(storage, name, content.as_ref())\n\n}\n\n\n","file_path":"storage/src/tag.rs","rank":9,"score":344263.67092542583},{"content":"pub fn read_hash<S: AsRef<str>>(storage: &super::Storage, name: &S) -> Option<block::HeaderHash> {\n\n read(storage, name).and_then(|v| block::HeaderHash::try_from_slice(&v[..]).ok())\n\n}\n\n\n","file_path":"storage/src/tag.rs","rank":10,"score":344263.67092542583},{"content":"/// Try to open a packfile Reader on a specific epoch\n\n///\n\n/// if there's no pack at this address, then nothing is return\n\npub fn epoch_open_pack_reader(config: &StorageConfig, epochid: cardano::block::EpochId) -> Result<Option<packfile::Reader<fs::File>>> {\n\n match epoch_read_pack(config, epochid) {\n\n Err(Error::StorageError(StorageError::IoError(ref err))) if err.kind() == ::std::io::ErrorKind::NotFound => Ok(None),\n\n Err(err) => Err(err),\n\n Ok(epoch_ref) => {\n\n let reader = packreader_init(config, &epoch_ref);\n\n Ok(Some(reader))\n\n }\n\n }\n\n}\n\n\n\n/*\n","file_path":"storage/src/epoch.rs","rank":11,"score":338013.3666489187},{"content":"pub fn dump_index(storage_config: &super::StorageConfig, pack: &super::PackHash) -> Result<(indexfile::Lookup, Vec<super::BlockHash>)> {\n\n let mut file = open_index(storage_config, pack);\n\n let result = indexfile::dump_file(&mut file)?;\n\n Ok(result)\n\n}\n\n\n","file_path":"storage/src/pack.rs","rank":12,"score":337828.7508883742},{"content":"pub fn packreader_block_next(reader: &mut packfile::Reader<fs::File>) -> Option<cardano::block::RawBlock> {\n\n reader.get_next().and_then(|x| Some(cardano::block::RawBlock(x)))\n\n}\n","file_path":"storage/src/pack.rs","rank":13,"score":334831.8451410536},{"content":"pub fn block_read(storage: &Storage, hash: &BlockHash) -> Option<RawBlock> {\n\n match block_location(storage, hash) {\n\n None => None,\n\n Some(loc) => block_read_location(storage, &loc, hash),\n\n }\n\n}\n\n\n\n/// packing parameters\n\n///\n\n/// optionally set the maximum number of blobs in this pack\n\n/// optionally set the maximum size in bytes of the pack file.\n\n/// note that the limits is best effort, not strict.\n\npub struct PackParameters {\n\n pub limit_nb_blobs: Option<u32>,\n\n pub limit_size: Option<u64>,\n\n pub delete_blobs_after_pack: bool,\n\n pub range: Option<(BlockHash, BlockHash)>,\n\n}\n\nimpl Default for PackParameters {\n\n fn default() -> Self {\n\n PackParameters {\n\n limit_nb_blobs: None,\n\n limit_size: None,\n\n delete_blobs_after_pack: true,\n\n range: None,\n\n }\n\n }\n\n}\n\n\n","file_path":"storage/src/lib.rs","rank":14,"score":333815.73228358355},{"content":"// same as read_next_block, but when receiving EOF it will wrapped into returning None\n\npub fn read_next_block_or_eof<R: Read>(file: R) -> io::Result<Option<Vec<u8>>> {\n\n match read_next_block(file) {\n\n Err(err) => if err.kind() == io::ErrorKind::UnexpectedEof { Ok(None) } else { Err(err) },\n\n Ok(data) => Ok(Some(data)),\n\n }\n\n}\n\n\n\nimpl<R: Read> Reader<R> {\n\n /// Return the next data block.\n\n ///\n\n /// note: any IO error raise runtime exception for now. will be changed soon.\n\n pub fn get_next(&mut self) -> Option<Vec<u8>> {\n\n // TODO: remove unwrap()\n\n let mdata = read_next_block_or_eof(&mut self.reader).unwrap();\n\n match mdata {\n\n None => {},\n\n Some(ref data) => {\n\n self.hash_context.input(data);\n\n self.pos += 4 + offset_align4(data.len() as u64);\n\n }\n","file_path":"storage/src/containers/packfile.rs","rank":15,"score":331732.00404479355},{"content":"// Create a pack of references (packref) of all the hash in an epoch pack\n\n//\n\n// If the pack is not valid, then an error is returned\n\npub fn refpack_epoch_pack<S: AsRef<str>>(storage: &Storage, tag: &S) -> Result<()> {\n\n let mut rp = reffile::Lookup::new();\n\n let packhash_vec = tag::read(storage, tag).expect(\"EPOCH not found\");\n\n let mut packhash = [0;HASH_SIZE];\n\n packhash[..].clone_from_slice(packhash_vec.as_slice());\n\n let mut pack = packreader_init(&storage.config, &packhash);\n\n\n\n let mut current_state = None;\n\n\n\n while let Some(raw_block) = packreader_block_next(&mut pack) {\n\n let block = raw_block.decode()?;\n\n let hdr = block.get_header();\n\n let hash = hdr.compute_hash();\n\n let date = hdr.get_blockdate();\n\n\n\n // either we have seen genesis yet or not\n\n match current_state {\n\n None => {\n\n if !hdr.is_genesis_block() {\n\n return Err(Error::EpochExpectingGenesis)\n","file_path":"storage/src/lib.rs","rank":16,"score":330603.748288183},{"content":"/// decode the given hexadecimal string\n\n///\n\n/// # Example\n\n///\n\n/// ```\n\n/// use cardano::util::hex::{Error, decode};\n\n///\n\n/// let example = r\"736f6d65206279746573\";\n\n///\n\n/// assert!(decode(example).is_ok());\n\n/// ```\n\npub fn decode(input: &str) -> Result<Vec<u8>> {\n\n let mut b = Vec::with_capacity(input.len() / 2);\n\n let mut modulus = 0;\n\n let mut buf = 0;\n\n\n\n for (idx, byte) in input.bytes().enumerate() {\n\n buf <<= 4;\n\n\n\n match byte {\n\n b'A'...b'F' => buf |= byte - b'A' + 10,\n\n b'a'...b'f' => buf |= byte - b'a' + 10,\n\n b'0'...b'9' => buf |= byte - b'0',\n\n b' '|b'\\r'|b'\\n'|b'\\t' => {\n\n buf >>= 4;\n\n continue\n\n }\n\n _ => {\n\n return Err(Error::UnknownSymbol(idx));\n\n }\n\n }\n","file_path":"cardano/src/util/hex.rs","rank":17,"score":330399.78614281456},{"content":"/// decode from base58 the given input\n\n///\n\n/// # Example\n\n///\n\n/// ```\n\n/// use cardano::util::base58;\n\n///\n\n/// let encoded = r\"TcgsE5dzphUWfjcb9i5\";\n\n/// let decoded = b\"Hello World...\";\n\n///\n\n/// assert_eq!(decoded, base58::decode(encoded).unwrap().as_slice());\n\n/// ```\n\npub fn decode(input: &str) -> Result<Vec<u8>> {\n\n base_decode(ALPHABET, input.as_bytes())\n\n}\n\n\n","file_path":"cardano/src/util/base58.rs","rank":18,"score":330385.8603715847},{"content":"pub fn epoch_open_packref(config: &StorageConfig, epochid: cardano::block::EpochId) -> Result<reffile::Reader> {\n\n let path = config.get_epoch_refpack_filepath(epochid);\n\n let reader = reffile::Reader::open(path)?;\n\n Ok(reader)\n\n}\n\n\n","file_path":"storage/src/epoch.rs","rank":19,"score":327198.839510093},{"content":"pub fn epoch_read_packref(config: &StorageConfig, epochid: cardano::block::EpochId) -> Result<reffile::Reader> {\n\n let reader = reffile::Reader::open(config.get_epoch_refpack_filepath(epochid))?;\n\n Ok(reader)\n\n}\n\n\n","file_path":"storage/src/epoch.rs","rank":20,"score":327198.8395100929},{"content":"pub fn block_read_location(storage: &Storage, loc: &BlockLocation, hash: &BlockHash) -> Option<RawBlock> {\n\n match loc {\n\n &BlockLocation::Loose => blob::read(storage, hash).ok(),\n\n &BlockLocation::Packed(ref packref, ref iofs) => {\n\n match storage.lookups.get(packref) {\n\n None => { unreachable!(); },\n\n Some(lookup) => {\n\n let idx_filepath = storage.config.get_index_filepath(packref);\n\n let mut idx_file = indexfile::ReaderNoLookup::init(idx_filepath).unwrap();\n\n let pack_offset = idx_file.resolve_index_offset(lookup, *iofs);\n\n let pack_filepath = storage.config.get_pack_filepath(packref);\n\n let mut pack_file = packfile::Seeker::init(pack_filepath).unwrap();\n\n pack_file.get_at_offset(pack_offset).ok().and_then(|x| Some(RawBlock(x)))\n\n }\n\n }\n\n }\n\n }\n\n}\n\n\n","file_path":"storage/src/lib.rs","rank":21,"score":317951.77636615204},{"content":"pub fn epoch_open_pack_seeker() -> io::Result<Option<packfile::Seeker>> {\n\n}\n\n*/\n\n\n","file_path":"storage/src/epoch.rs","rank":22,"score":317041.9579260984},{"content":"pub fn epoch_create(config: &StorageConfig, packref: &PackHash, epochid: cardano::block::EpochId) {\n\n // read the pack and append the block hash as we find them in the refpack.\n\n let mut rp = reffile::Lookup::new();\n\n let mut reader = packreader_init(config, packref);\n\n\n\n let mut current_slotid = cardano::block::BlockDate::Genesis(epochid);\n\n while let Some(rblk) = packreader_block_next(&mut reader) {\n\n let blk = rblk.decode().unwrap();\n\n let hdr = blk.get_header();\n\n let hash = hdr.compute_hash();\n\n let blockdate = hdr.get_blockdate();\n\n\n\n while current_slotid != blockdate {\n\n rp.append_missing_hash();\n\n current_slotid = current_slotid.next();\n\n }\n\n rp.append_hash(header_to_blockhash(&hash));\n\n current_slotid = current_slotid.next();\n\n }\n\n\n","file_path":"storage/src/epoch.rs","rank":23,"score":309870.1380128054},{"content":"pub fn block_location(storage: &Storage, hash: &BlockHash) -> Option<BlockLocation> {\n\n for (packref, lookup) in storage.lookups.iter() {\n\n let (start, nb) = lookup.fanout.get_indexer_by_hash(hash);\n\n match nb {\n\n indexfile::FanoutNb(0) => {},\n\n _ => {\n\n if lookup.bloom.search(hash) {\n\n let idx_filepath = storage.config.get_index_filepath(packref);\n\n let mut idx_file = indexfile::Reader::init(idx_filepath).unwrap();\n\n match idx_file.search(&lookup.params, hash, start, nb) {\n\n None => {},\n\n Some(iloc) => return Some(BlockLocation::Packed(packref.clone(), iloc)),\n\n }\n\n }\n\n }\n\n }\n\n }\n\n if blob::exist(storage, hash) {\n\n return Some(BlockLocation::Loose);\n\n }\n\n None\n\n}\n\n\n","file_path":"storage/src/lib.rs","rank":24,"score":306756.9826888383},{"content":"fn epoch_integrity_check(storage: &Storage, epochid: EpochId, last_known_hash: HeaderHash) -> Result<HeaderHash> {\n\n let packhash_vec = tag::read(storage, &format!(\"EPOCH_{}\", epochid)).expect(\"EPOCH not found\");\n\n let mut packhash = [0;HASH_SIZE];\n\n packhash[..].clone_from_slice(packhash_vec.as_slice());\n\n let mut pack = packreader_init(&storage.config, &packhash);\n\n\n\n let mut current_state = None;\n\n\n\n while let Some(raw_block) = packreader_block_next(&mut pack) {\n\n let block = raw_block.decode()?;\n\n let hdr = block.get_header();\n\n let hash = hdr.compute_hash();\n\n let prevhash = hdr.get_previous_header();\n\n let date = hdr.get_blockdate();\n\n\n\n // either we have seen genesis yet or not\n\n match current_state {\n\n None => {\n\n if !hdr.is_genesis_block() {\n\n return Err(Error::EpochExpectingGenesis)\n","file_path":"storage/src/lib.rs","rank":25,"score":303135.9646073672},{"content":"pub fn get_peer(blockchain: &str, cfg: &net::Config, native: bool) -> Peer {\n\n for peer in cfg.peers.iter() {\n\n if (native && peer.is_native()) || (!native && peer.is_http()) {\n\n return Peer::new(\n\n String::from(blockchain),\n\n peer.name().to_owned(),\n\n peer.peer().clone(),\n\n cfg.protocol_magic,\n\n ).unwrap();\n\n }\n\n }\n\n\n\n panic!(\"no peer to connect to\")\n\n}\n","file_path":"exe-common/src/sync.rs","rank":26,"score":301111.38260281255},{"content":"// write the content buf atomically to the path.\n\n//\n\n// if an issue arise until the data is written, then\n\n// the expected file destination is not going to be\n\n// created\n\npub fn atomic_write_simple(path: &PathBuf, buf: &[u8]) -> io::Result<()> {\n\n let mut tmpfile = TmpFile::create(path.parent().unwrap().to_path_buf())?;\n\n tmpfile.write(buf)?;\n\n tmpfile.render_permanent(path)?;\n\n Ok(())\n\n}\n","file_path":"storage/src/utils/tmpfile.rs","rank":27,"score":294608.13913382776},{"content":"pub fn header_to_blockhash(header_hash: &HeaderHash) -> BlockHash {\n\n let mut bh = [0u8;HASH_SIZE];\n\n bh[0..HASH_SIZE].clone_from_slice(header_hash.as_ref());\n\n bh\n\n}\n\n\n\n#[derive(Debug, PartialEq, Eq, PartialOrd, Ord, Clone, Copy)]\n\npub enum StorageFileType {\n\n Pack,\n\n Index,\n\n Blob,\n\n Tag,\n\n RefPack,\n\n Epoch,\n\n}\n","file_path":"storage/src/types.rs","rank":28,"score":294076.24243681354},{"content":"pub fn exist<S: AsRef<str>>(storage: &super::Storage, name: &S) -> bool {\n\n let p = storage.config.get_tag_filepath(name);\n\n p.as_path().exists()\n\n}\n\n\n","file_path":"storage/src/tag.rs","rank":29,"score":293911.2736682197},{"content":"pub fn epoch_create_with_refpack(config: &StorageConfig, packref: &PackHash, refpack: &reffile::Lookup, epochid: cardano::block::EpochId) {\n\n let dir = config.get_epoch_dir(epochid);\n\n fs::create_dir_all(dir).unwrap();\n\n\n\n let pack_filepath = config.get_epoch_pack_filepath(epochid);\n\n tmpfile::atomic_write_simple(&pack_filepath, hex::encode(packref).as_bytes()).unwrap();\n\n\n\n let mut tmpfile = TmpFile::create(config.get_epoch_dir(epochid)).unwrap();\n\n refpack.write(&mut tmpfile).unwrap();\n\n tmpfile.render_permanent(&config.get_epoch_refpack_filepath(epochid)).unwrap();\n\n}\n\n\n","file_path":"storage/src/epoch.rs","rank":30,"score":288945.2925200321},{"content":"pub fn integrity_check(storage: &Storage, genesis_hash: HeaderHash, count: EpochId) {\n\n let mut previous_header = genesis_hash;\n\n for epochid in 0..count {\n\n println!(\"check epoch {}'s integrity\", epochid);\n\n previous_header = epoch_integrity_check(storage, epochid, previous_header).unwrap();\n\n }\n\n}\n\n\n","file_path":"storage/src/lib.rs","rank":31,"score":286123.3784285719},{"content":"pub fn set_bit_to(data: &mut [u8], bit: usize, value: bool) {\n\n let (byte_addr, bit_addr) = addr(bit);\n\n if value {\n\n data[byte_addr] |= bit_addr.set_mask();\n\n } else {\n\n data[byte_addr] &= bit_addr.clear_mask();\n\n }\n\n}\n\n\n","file_path":"storage/src/utils/bitmap.rs","rank":32,"score":282017.39916331944},{"content":"pub fn index_get_header(file: &mut fs::File) -> Result<indexfile::Lookup> {\n\n let lookup = indexfile::Lookup::read_from_file(file)?;\n\n Ok(lookup)\n\n}\n\n\n","file_path":"storage/src/pack.rs","rank":33,"score":281363.7015233121},{"content":"pub fn read<S: AsRef<str>>(storage: &super::Storage, name: &S) -> Option<Vec<u8>> {\n\n if ! exist(storage, name) { return None; }\n\n let mut content = Vec::new();\n\n let path = storage.config.get_tag_filepath(name);\n\n let mut file = fs::File::open(path).unwrap();\n\n file.read_to_end(&mut content).unwrap();\n\n String::from_utf8(content.clone()).ok()\n\n .and_then(|r| hex::decode(&r).ok())\n\n .or(Some(content))\n\n}\n\n\n","file_path":"storage/src/tag.rs","rank":34,"score":281000.3343156521},{"content":"pub fn send_msg_getheaders(froms: &[block::HeaderHash], to: &Option<block::HeaderHash>) -> Message {\n\n let serializer = se::Serializer::new_vec().write_array(cbor_event::Len::Len(2)).unwrap();\n\n let serializer = se::serialize_indefinite_array(froms.iter(), serializer).unwrap();\n\n let serializer = match to {\n\n &None => serializer.write_array(cbor_event::Len::Len(0)).unwrap(),\n\n &Some(ref h) => {\n\n serializer.write_array(cbor_event::Len::Len(1)).unwrap()\n\n .serialize(h).unwrap()\n\n }\n\n };\n\n let dat = serializer.finalize();\n\n (MsgType::MsgGetHeaders as u8, dat)\n\n}\n\n\n","file_path":"protocol/src/packet.rs","rank":35,"score":277775.6037739154},{"content":"pub fn read_refpack<P: AsRef<str>>(storage_config: &StorageConfig, name: P) -> Result<reffile::Lookup> {\n\n let r = reffile::Lookup::from_path(storage_config.get_refpack_filepath(name))?;\n\n Ok(r)\n\n}\n\n\n","file_path":"storage/src/refpack.rs","rank":36,"score":276811.0826240595},{"content":"pub fn pack_blobs(storage: &mut Storage, params: &PackParameters) -> PackHash {\n\n let mut writer = pack::packwriter_init(&storage.config).unwrap();\n\n let mut blob_packed = Vec::new();\n\n\n\n let block_hashes : Vec<BlockHash> = if let Some((from, to)) = params.range {\n\n storage.range(from, to).unwrap().iter().cloned().collect()\n\n } else {\n\n storage.config.list_blob(params.limit_nb_blobs)\n\n };\n\n for bh in block_hashes {\n\n let blob = blob::read_raw(storage, &bh).unwrap();\n\n writer.append(&bh, &blob[..]).unwrap();\n\n blob_packed.push(bh);\n\n match params.limit_size {\n\n None => {},\n\n Some(sz) => {\n\n if writer.pos >= sz {\n\n break\n\n }\n\n }\n","file_path":"storage/src/lib.rs","rank":37,"score":276596.03060773306},{"content":"pub fn validate_network_name(v: &&str) -> bool {\n\n v.chars().all(|c| c.is_ascii_alphanumeric())\n\n}\n\n\n","file_path":"hermes/src/handlers/common.rs","rank":38,"score":275063.55228854483},{"content":"pub fn packwriter_init(cfg: &super::StorageConfig) -> Result<packfile::Writer> {\n\n let tmpfile = TmpFile::create(cfg.get_filetype_dir(super::StorageFileType::Pack))?;\n\n let writer = packfile::Writer::init(tmpfile)?;\n\n Ok(writer)\n\n}\n\n\n","file_path":"storage/src/pack.rs","rank":39,"score":274776.49863682344},{"content":"pub fn write_refpack<P: AsRef<str>>(storage_config: &StorageConfig, name: P, rf: &reffile::Lookup) -> Result<()> {\n\n let path = storage_config.get_refpack_filepath(name);\n\n rf.to_path(path)?;\n\n Ok(())\n\n}\n","file_path":"storage/src/refpack.rs","rank":40,"score":270963.08788277797},{"content":"#[allow(dead_code)]\n\npub fn get_bits(data: &[u8], start_bit: usize, nb_bits: usize) -> Vec<bool> {\n\n let mut v = Vec::with_capacity(nb_bits);\n\n let (start_byte_addr, start_bit_addr) = addr(start_bit);\n\n\n\n let mut current_val = data[start_byte_addr] >> start_bit_addr.get_shifter();\n\n let mut current_byte_addr = start_byte_addr;\n\n let mut current_bit_addr = start_bit_addr;\n\n for i in 0..nb_bits {\n\n v[nb_bits - i - 1] = (current_val & 0x1) == 0x1;\n\n match current_bit_addr.get_next() {\n\n None => {\n\n current_byte_addr += 1;\n\n current_bit_addr = ByteAddr(0);\n\n current_val = data[current_byte_addr];\n\n },\n\n Some(new_addr) => {\n\n current_bit_addr = new_addr;\n\n current_val = current_val >> 1;\n\n },\n\n }\n\n }\n\n v\n\n}","file_path":"storage/src/utils/bitmap.rs","rank":41,"score":268302.30951547174},{"content":"/// get the root directory of all the hermes path\n\n///\n\n/// it is either environment variable `HERMES_PATH` or the `${HOME}/.hermes`\n\npub fn hermes_path() -> Result<PathBuf> {\n\n match env::var(HERMES_PATH_ENV) {\n\n Ok(path) => Ok(PathBuf::from(path)),\n\n Err(VarError::NotPresent) => match home_dir() {\n\n None => Err(Error::BlockchainConfigError(\"no home directory to base hermes root dir. Set `HERMES_PATH' variable environment to fix the problem.\")),\n\n Some(path) => Ok(path.join(HERMES_HOME_PATH))\n\n },\n\n Err(err) => Err(Error::VarError(err))\n\n }\n\n}\n","file_path":"hermes/src/config.rs","rank":42,"score":262814.74799273844},{"content":"/// Process a block with the SHA-512 algorithm. (See more...)\n\n///\n\n/// Internally, this uses functions that resemble the new Intel SHA\n\n/// instruction set extensions, but since no architecture seems to\n\n/// have any designs, these may not be the final designs if and/or when\n\n/// there are instruction set extensions with SHA-512. So to summarize:\n\n/// SHA-1 and SHA-256 are being implemented in hardware soon (at the time\n\n/// of this writing), but it doesn't look like SHA-512 will be hardware\n\n/// accelerated any time soon.\n\n///\n\n/// # Implementation\n\n///\n\n/// These functions fall into two categories:\n\n/// message schedule calculation, and the message block 64-round digest calculation.\n\n/// The schedule-related functions allow 4 rounds to be calculated as:\n\n///\n\n/// ```ignore\n\n/// use std::simd::u64x2;\n\n/// use self::crypto::sha2::{\n\n/// sha512msg,\n\n/// sha512load\n\n/// };\n\n///\n\n/// fn schedule4_data(work: &mut [u64x2], w: &[u64]) {\n\n///\n\n/// // this is to illustrate the data order\n\n/// work[0] = u64x2(w[1], w[0]);\n\n/// work[1] = u64x2(w[3], w[2]);\n\n/// work[2] = u64x2(w[5], w[4]);\n\n/// work[3] = u64x2(w[7], w[6]);\n\n/// work[4] = u64x2(w[9], w[8]);\n\n/// work[5] = u64x2(w[11], w[10]);\n\n/// work[6] = u64x2(w[13], w[12]);\n\n/// work[7] = u64x2(w[15], w[14]);\n\n/// }\n\n///\n\n/// fn schedule4_work(work: &mut [u64x2], t: usize) {\n\n///\n\n/// // this is the core expression\n\n/// work[t] = sha512msg(work[t - 8],\n\n/// work[t - 7],\n\n/// sha512load(work[t - 4], work[t - 3]),\n\n/// work[t - 1]);\n\n/// }\n\n/// ```\n\n///\n\n/// instead of 4 rounds of:\n\n///\n\n/// ```ignore\n\n/// fn schedule_work(w: &mut [u64], t: usize) {\n\n/// w[t] = sigma1!(w[t - 2]) + w[t - 7] + sigma0!(w[t - 15]) + w[t - 16];\n\n/// }\n\n/// ```\n\n///\n\n/// and the digest-related functions allow 4 rounds to be calculated as:\n\n///\n\n/// ```ignore\n\n/// use std::simd::u64x2;\n\n/// use self::crypto::sha2::{K64X2, sha512rnd};\n\n///\n\n/// fn rounds4(state: &mut [u64; 8], work: &mut [u64x2], t: usize) {\n\n/// let [a, b, c, d, e, f, g, h]: [u64; 8] = *state;\n\n///\n\n/// // this is to illustrate the data order\n\n/// let mut ae = u64x2(a, e);\n\n/// let mut bf = u64x2(b, f);\n\n/// let mut cg = u64x2(c, g);\n\n/// let mut dh = u64x2(d, h);\n\n/// let u64x2(w1, w0) = K64X2[2*t] + work[2*t];\n\n/// let u64x2(w3, w2) = K64X2[2*t + 1] + work[2*t + 1];\n\n///\n\n/// // this is the core expression\n\n/// dh = sha512rnd(ae, bf, cg, dh, w0);\n\n/// cg = sha512rnd(dh, ae, bf, cg, w1);\n\n/// bf = sha512rnd(cg, dh, ae, bf, w2);\n\n/// ae = sha512rnd(bf, cg, dh, ae, w3);\n\n///\n\n/// *state = [ae.0, bf.0, cg.0, dh.0,\n\n/// ae.1, bf.1, cg.1, dh.1];\n\n/// }\n\n/// ```\n\n///\n\n/// instead of 4 rounds of:\n\n///\n\n/// ```ignore\n\n/// fn round(state: &mut [u64; 8], w: &mut [u64], t: usize) {\n\n/// let [a, b, c, mut d, e, f, g, mut h]: [u64; 8] = *state;\n\n///\n\n/// h += big_sigma1!(e) + choose!(e, f, g) + K64[t] + w[t]; d += h;\n\n/// h += big_sigma0!(a) + majority!(a, b, c);\n\n///\n\n/// *state = [h, a, b, c, d, e, f, g];\n\n/// }\n\n/// ```\n\n///\n\npub fn sha512_digest_block(state: &mut [u64; 8], block: &[u8/*; 128*/]) {\n\n assert_eq!(block.len(), BLOCK_LEN*8);\n\n let mut block2 = [0u64; BLOCK_LEN];\n\n read_u64v_be(&mut block2[..], block);\n\n sha512_digest_block_u64(state, &block2);\n\n}\n\n\n\n// A structure that represents that state of a digest computation for the SHA-2 512 family\n\n// of digest functions\n","file_path":"cryptoxide/src/sha2.rs","rank":43,"score":261340.70948434496},{"content":"/// Process a block with the SHA-256 algorithm. (See more...)\n\n///\n\n/// Internally, this uses functions which resemble the new Intel SHA instruction sets,\n\n/// and so it's data locality properties may improve performance. However, to benefit\n\n/// the most from this implementation, replace these functions with x86 intrinsics to\n\n/// get a possible speed boost.\n\n///\n\n/// # Implementation\n\n///\n\n/// The `Sha256` algorithm is implemented with functions that resemble the new\n\n/// Intel SHA instruction set extensions. These intructions fall into two categories:\n\n/// message schedule calculation, and the message block 64-round digest calculation.\n\n/// The schedule-related instructions allow 4 rounds to be calculated as:\n\n///\n\n/// ```ignore\n\n/// use std::simd::u32x4;\n\n/// use self::crypto::sha2::{\n\n/// sha256msg1,\n\n/// sha256msg2,\n\n/// sha256load\n\n/// };\n\n///\n\n/// fn schedule4_data(work: &mut [u32x4], w: &[u32]) {\n\n///\n\n/// // this is to illustrate the data order\n\n/// work[0] = u32x4(w[3], w[2], w[1], w[0]);\n\n/// work[1] = u32x4(w[7], w[6], w[5], w[4]);\n\n/// work[2] = u32x4(w[11], w[10], w[9], w[8]);\n\n/// work[3] = u32x4(w[15], w[14], w[13], w[12]);\n\n/// }\n\n///\n\n/// fn schedule4_work(work: &mut [u32x4], t: usize) {\n\n///\n\n/// // this is the core expression\n\n/// work[t] = sha256msg2(sha256msg1(work[t - 4], work[t - 3]) +\n\n/// sha256load(work[t - 2], work[t - 1]),\n\n/// work[t - 1])\n\n/// }\n\n/// ```\n\n///\n\n/// instead of 4 rounds of:\n\n///\n\n/// ```ignore\n\n/// fn schedule_work(w: &mut [u32], t: usize) {\n\n/// w[t] = sigma1!(w[t - 2]) + w[t - 7] + sigma0!(w[t - 15]) + w[t - 16];\n\n/// }\n\n/// ```\n\n///\n\n/// and the digest-related instructions allow 4 rounds to be calculated as:\n\n///\n\n/// ```ignore\n\n/// use std::simd::u32x4;\n\n/// use self::crypto::sha2::{K32X4,\n\n/// sha256rnds2,\n\n/// sha256swap\n\n/// };\n\n///\n\n/// fn rounds4(state: &mut [u32; 8], work: &mut [u32x4], t: usize) {\n\n/// let [a, b, c, d, e, f, g, h]: [u32; 8] = *state;\n\n///\n\n/// // this is to illustrate the data order\n\n/// let mut abef = u32x4(a, b, e, f);\n\n/// let mut cdgh = u32x4(c, d, g, h);\n\n/// let temp = K32X4[t] + work[t];\n\n///\n\n/// // this is the core expression\n\n/// cdgh = sha256rnds2(cdgh, abef, temp);\n\n/// abef = sha256rnds2(abef, cdgh, sha256swap(temp));\n\n///\n\n/// *state = [abef.0, abef.1, cdgh.0, cdgh.1,\n\n/// abef.2, abef.3, cdgh.2, cdgh.3];\n\n/// }\n\n/// ```\n\n///\n\n/// instead of 4 rounds of:\n\n///\n\n/// ```ignore\n\n/// fn round(state: &mut [u32; 8], w: &mut [u32], t: usize) {\n\n/// let [a, b, c, mut d, e, f, g, mut h]: [u32; 8] = *state;\n\n///\n\n/// h += big_sigma1!(e) + choose!(e, f, g) + K32[t] + w[t]; d += h;\n\n/// h += big_sigma0!(a) + majority!(a, b, c);\n\n///\n\n/// *state = [h, a, b, c, d, e, f, g];\n\n/// }\n\n/// ```\n\n///\n\n/// **NOTE**: It is important to note, however, that these instructions are not implemented\n\n/// by any CPU (at the time of this writing), and so they are emulated in this library\n\n/// until the instructions become more common, and gain support in LLVM (and GCC, etc.).\n\n///\n\npub fn sha256_digest_block(state: &mut [u32; 8], block: &[u8/*; 64*/]) {\n\n assert_eq!(block.len(), BLOCK_LEN*4);\n\n let mut block2 = [0u32; BLOCK_LEN];\n\n read_u32v_be(&mut block2[..], block);\n\n sha256_digest_block_u32(state, &block2);\n\n}\n\n\n\n/// Not an intrinsic, but works like an unaligned load.\n","file_path":"cryptoxide/src/sha2.rs","rank":44,"score":261340.50736123143},{"content":"// Create an epoch from a complete set of previously fetched blocks on\n\n// disk.\n\nfn maybe_create_epoch(storage: &storage::Storage, epoch_id: EpochId, last_block: &HeaderHash)\n\n{\n\n if epoch_exists(&storage.config, epoch_id).unwrap() { return }\n\n\n\n info!(\"Packing epoch {}\", epoch_id);\n\n\n\n let mut epoch_writer_state = EpochWriterState {\n\n epoch_id,\n\n writer: storage::pack::packwriter_init(&storage.config).unwrap(),\n\n write_start_time: SystemTime::now(),\n\n blobs_to_delete: vec![]\n\n };\n\n\n\n append_blocks_to_epoch_reverse(&storage, &mut epoch_writer_state, last_block);\n\n\n\n finish_epoch(storage, epoch_writer_state);\n\n}\n\n\n","file_path":"exe-common/src/sync.rs","rank":45,"score":260322.87966057422},{"content":"fn template_create_temp(prefix: &str, suffix: &str) -> String {\n\n let v1 : u64 = rand::random();\n\n let v2 : u64 = rand::random();\n\n format!(\"{}{}{}{}\", prefix, v1, v2, suffix)\n\n}\n\n\n\nimpl TmpFile {\n\n pub fn create(mut path: PathBuf) -> io::Result<Self> {\n\n let filename = template_create_temp(\".tmp.\", \"\");\n\n path.push(filename);\n\n\n\n OpenOptions::new()\n\n .write(true)\n\n .read(true)\n\n .create_new(true)\n\n .open(&path)\n\n .map(|file| TmpFile { file: file, path: path })\n\n }\n\n\n\n pub fn render_permanent(&self, path: &PathBuf) -> io::Result<()> {\n","file_path":"storage/src/utils/tmpfile.rs","rank":46,"score":260000.1401298967},{"content":"/// Process a block with the SHA-512 algorithm.\n\npub fn sha512_digest_block_u64(state: &mut [u64; 8], block: &[u64; 16]) {\n\n let k = &K64X2;\n\n\n\n macro_rules! schedule {\n\n ($v0:expr, $v1:expr, $v4:expr, $v5:expr, $v7:expr) => (\n\n sha512_schedule_x2($v0, $v1, sha512load($v4, $v5), $v7)\n\n )\n\n }\n\n\n\n macro_rules! rounds4 {\n\n ($ae:ident, $bf:ident, $cg:ident, $dh:ident, $wk0:expr, $wk1:expr) => {\n\n {\n\n let u64x2(u, t) = $wk0;\n\n let u64x2(w, v) = $wk1;\n\n\n\n $dh = sha512_digest_round($ae, $bf, $cg, $dh, t);\n\n $cg = sha512_digest_round($dh, $ae, $bf, $cg, u);\n\n $bf = sha512_digest_round($cg, $dh, $ae, $bf, v);\n\n $ae = sha512_digest_round($bf, $cg, $dh, $ae, w);\n\n }\n","file_path":"cryptoxide/src/sha2.rs","rank":47,"score":258169.8302006979},{"content":"/// Process a block with the SHA-256 algorithm.\n\npub fn sha256_digest_block_u32(state: &mut [u32; 8], block: &[u32; 16]) {\n\n let k = &K32X4;\n\n\n\n macro_rules! schedule {\n\n ($v0:expr, $v1:expr, $v2:expr, $v3:expr) => (\n\n sha256msg2(sha256msg1($v0, $v1) + sha256load($v2, $v3), $v3)\n\n )\n\n }\n\n\n\n macro_rules! rounds4 {\n\n ($abef:ident, $cdgh:ident, $rest:expr) => {\n\n {\n\n $cdgh = sha256_digest_round_x2($cdgh, $abef, $rest);\n\n $abef = sha256_digest_round_x2($abef, $cdgh, sha256swap($rest));\n\n }\n\n }\n\n }\n\n\n\n let mut abef = u32x4(state[0],\n\n state[1],\n","file_path":"cryptoxide/src/sha2.rs","rank":48,"score":258169.83020069788},{"content":"/// decode from base58 the given input\n\n///\n\n/// # Example\n\n///\n\n/// ```\n\n/// use cardano::util::base58;\n\n///\n\n/// let encoded = b\"TcgsE5dzphUWfjcb9i5\";\n\n/// let decoded = b\"Hello World...\";\n\n///\n\n/// assert_eq!(decoded, base58::decode_bytes(encoded).unwrap().as_slice());\n\n/// ```\n\npub fn decode_bytes(input: &[u8]) -> Result<Vec<u8>> {\n\n base_decode(ALPHABET, input)\n\n}\n\n\n\n#[cfg(test)]\n\nmod tests {\n\n fn encode(input: &[u8], expected: &str) {\n\n let encoded = super::encode(input);\n\n assert_eq!(encoded, expected);\n\n }\n\n fn decode(expected: &[u8], input: &str) {\n\n let decoded = super::decode(input).unwrap();\n\n assert_eq!(decoded.as_slice(), expected);\n\n }\n\n\n\n #[test]\n\n fn test_vector_1() {\n\n encode(b\"\\0\\0\\0\\0\", \"11111\");\n\n decode(b\"\\0\\0\\0\\0\", \"11111\");\n\n }\n","file_path":"cardano/src/util/base58.rs","rank":49,"score":258135.75734271656},{"content":"fn file_read_hash(mut file: &fs::File) -> BlockHash {\n\n let mut buf = [0u8;HASH_SIZE];\n\n file.read_exact(&mut buf).unwrap();\n\n buf\n\n}\n\n\n","file_path":"storage/src/containers/indexfile.rs","rank":50,"score":256283.9200340224},{"content":"fn base_decode(alphabet_s: &str, input: &[u8]) -> Result<Vec<u8>> {\n\n let alphabet = alphabet_s.as_bytes();\n\n let base = alphabet.len() as u32;\n\n\n\n let mut bytes : Vec<u8> = vec![0];\n\n let zcount = input.iter().take_while(|x| **x == alphabet[0]).count();\n\n\n\n for i in zcount..input.len() {\n\n let value = match alphabet.iter().position(|&x| x == input[i]) {\n\n Some(idx) => idx,\n\n None => return Err(Error::UnknownSymbol(i))\n\n };\n\n let mut carry = value as u32;\n\n for j in 0..bytes.len() {\n\n carry = carry + (bytes[j] as u32 * base);\n\n bytes[j] = carry as u8;\n\n carry = carry >> 8;\n\n }\n\n\n\n while carry > 0 {\n","file_path":"cardano/src/util/base58.rs","rank":51,"score":255847.43235053337},{"content":"pub fn read_index_fanout(storage_config: &super::StorageConfig, pack: &super::PackHash) -> Result<indexfile::Lookup> {\n\n let mut file = open_index(storage_config, pack);\n\n let lookup = indexfile::Lookup::read_from_file(&mut file)?;\n\n Ok(lookup)\n\n}\n\n\n","file_path":"storage/src/pack.rs","rank":52,"score":252735.83287136996},{"content":"// calculate FNV1, FNV1a\n\npub fn hash(content: &[u8]) -> (u64, u64) {\n\n let mut hash = FNV_OFFSET_BASIS;\n\n let mut hash2 = FNV_OFFSET_BASIS;\n\n for c in content {\n\n // FNV1\n\n hash = hash.wrapping_mul(FNV_PRIME);\n\n hash ^= *c as u64;\n\n\n\n // FNV1a\n\n hash2 = *c as u64;\n\n hash2 = hash2.wrapping_mul(FNV_PRIME);\n\n }\n\n (hash, hash2)\n\n}\n\n\n","file_path":"storage/src/utils/bloom.rs","rank":53,"score":240716.24635348818},{"content":"#[allow(dead_code)]\n\npub fn new(size: usize) -> Vec<u8> {\n\n let v : Vec<u8> = repeat(0).take(size as usize).collect();\n\n v\n\n}\n\n\n","file_path":"storage/src/utils/bitmap.rs","rank":54,"score":240424.61506395627},{"content":"pub fn validate_epochid(v: &&str) -> Option<EpochId> {\n\n if ! v.chars().all(|c| c.is_digit(10)) {\n\n None\n\n } else {\n\n Some(v.parse::<EpochId>().unwrap())\n\n }\n\n}\n","file_path":"hermes/src/handlers/common.rs","rank":55,"score":237453.131114812},{"content":"pub fn is_set(bitmap: &[u8], content: &[u8]) -> bool {\n\n let (v1,v2,v3) = addr3(bitmap.len() * 8, content);\n\n bitmap::get_bit(bitmap, v1) && bitmap::get_bit(bitmap, v2) && bitmap::get_bit(bitmap, v3)\n\n}","file_path":"storage/src/utils/bloom.rs","rank":56,"score":233916.43120664754},{"content":"pub fn remove_tag<S: AsRef<str>>(storage: &super::Storage, name: &S) {\n\n let p = storage.config.get_tag_filepath(name);\n\n fs::remove_file(p).unwrap()\n\n}\n","file_path":"storage/src/tag.rs","rank":57,"score":233765.33506705542},{"content":"pub fn set(bitmap: &mut [u8], content: &[u8]) {\n\n let (v1,v2,v3) = addr3(bitmap.len() * 8, content);\n\n\n\n bitmap::set_bit_to(bitmap, v1, true);\n\n bitmap::set_bit_to(bitmap, v2, true);\n\n bitmap::set_bit_to(bitmap, v3, true);\n\n}\n\n\n","file_path":"storage/src/utils/bloom.rs","rank":58,"score":233050.48730195692},{"content":"pub fn get_bit(data: &[u8], bit: usize) -> bool {\n\n let (byte_addr, bit_addr) = addr(bit);\n\n let val = (data[byte_addr] >> bit_addr.get_shifter()) & 0x1;\n\n val == 0x1\n\n}\n\n\n","file_path":"storage/src/utils/bitmap.rs","rank":59,"score":230504.29577939294},{"content":"pub fn write_offset(buf: &mut [u8], sz: Offset) {\n\n buf[0] = (sz >> 56) as u8;\n\n buf[1] = (sz >> 48) as u8;\n\n buf[2] = (sz >> 40) as u8;\n\n buf[3] = (sz >> 32) as u8;\n\n buf[4] = (sz >> 24) as u8;\n\n buf[5] = (sz >> 16) as u8;\n\n buf[6] = (sz >> 8) as u8;\n\n buf[7] = sz as u8;\n\n}\n\n\n","file_path":"storage/src/utils/serialize.rs","rank":60,"score":229640.75154101662},{"content":"// write size to the mutable buffer in big endian\n\npub fn write_size(buf: &mut [u8], sz: Size) {\n\n buf[0] = (sz >> 24) as u8;\n\n buf[1] = (sz >> 16) as u8;\n\n buf[2] = (sz >> 8) as u8;\n\n buf[3] = sz as u8;\n\n}\n\n\n","file_path":"storage/src/utils/serialize.rs","rank":61,"score":229640.7515410166},{"content":"/// exported as a convenient function to test the implementation of\n\n/// [`Serialize`](./se/trait.Serialize.html) and\n\n/// [`Deserialize`](./de/trait.Deserialize.html).\n\n///\n\npub fn test_encode_decode<V: Sized+PartialEq+Serialize+Deserialize>(v: &V) -> Result<bool> {\n\n let bytes = Serialize::serialize(v, se::Serializer::new_vec())?.finalize();\n\n\n\n let mut raw = de::RawCbor::from(&bytes);\n\n let v_ = Deserialize::deserialize(&mut raw)?;\n\n\n\n Ok(v == &v_)\n\n}\n","file_path":"cbor_event/src/lib.rs","rank":62,"score":228882.15099875373},{"content":"pub fn write<S: AsRef<str>>(storage: &super::Storage, name: &S, content: &[u8]) {\n\n let mut tmp_file = super::tmpfile_create_type(storage, super::StorageFileType::Tag);\n\n tmp_file.write_all(hex::encode(content).as_bytes()).unwrap();\n\n\n\n let path = storage.config.get_tag_filepath(name);\n\n let dir = PathBuf::from(path);\n\n\n\n match dir.parent() {\n\n None => {},\n\n Some(parent) => {\n\n if parent != storage.config.get_filetype_dir(super::StorageFileType::Tag) {\n\n fs::create_dir_all(parent).unwrap()\n\n }\n\n }\n\n };\n\n\n\n tmp_file.render_permanent(&storage.config.get_tag_filepath(name)).unwrap();\n\n}\n\n\n","file_path":"storage/src/tag.rs","rank":63,"score":226529.29173833178},{"content":"pub fn packreader_init(cfg: &super::StorageConfig, packhash: &super::PackHash) -> packfile::Reader<fs::File> {\n\n packfile::Reader::init(cfg.get_pack_filepath(packhash)).unwrap()\n\n}\n\n\n","file_path":"storage/src/pack.rs","rank":64,"score":224909.67676577502},{"content":"pub fn packwriter_finalize(cfg: &super::StorageConfig, writer: packfile::Writer) -> (super::PackHash, indexfile::Index) {\n\n let (tmpfile, packhash, index) = writer.finalize().unwrap();\n\n let path = cfg.get_pack_filepath(&packhash);\n\n tmpfile.render_permanent(&path).unwrap();\n\n (packhash, index)\n\n}\n\n\n","file_path":"storage/src/pack.rs","rank":65,"score":224909.67676577502},{"content":"// TODO proper error handling\n\nfn previous_block(storage: &Storage, block: &Block) -> Block {\n\n let prev_hash = block.get_header().get_previous_header();\n\n let blk = blob::read(&storage, &header_to_blockhash(&prev_hash)).unwrap().decode().unwrap();\n\n blk\n\n}\n\n\n","file_path":"storage/src/block/iter.rs","rank":66,"score":224094.92356731734},{"content":"type Result<T> = result::Result<T, Error>;\n\n\n\n/// Object which lifetime is bound to a file in the filesystem\n\n///\n\n/// i.e.: we are creating a `<filename>.LOCK` file along the given `filename`\n\n/// in order to mark the file as locked. This is in order to prevent concurrent\n\n/// access to a file that may be modified and which data may be corrupted if\n\n/// concurrent writes happen.\n\n///\n\n/// The lock will be free when it drops out of scope.\n\n///\n\n#[derive(Debug)]\n\npub struct Lock {\n\n // the process ID associated to the current loc\n\n id: u32,\n\n // the path to the locked file\n\n path: PathBuf\n\n}\n\n\n\nimpl Lock {\n","file_path":"storage/src/utils/lock.rs","rank":67,"score":212876.05729886383},{"content":"/// Synchronize the local blockchain stored in `storage` with the\n\n/// network `net`. That is, fetch all blocks between the most recent\n\n/// block we received (as denoted by the `HEAD` tag) and the network's\n\n/// current tip. Blocks will be packed into epochs on disk as soon\n\n/// they're stable.\n\n///\n\n/// If `sync_once` is set to `true`, then this function will\n\n/// synchronize once and then return. If it's set to `false`, then\n\n/// this function will run forever, continuously synchronizing to the\n\n/// network's latest tip. (In the case of the Hermes backend, it will\n\n/// sleep for some time between polling for new tips; with the native\n\n/// protocol backend, it will block waiting for the server to send us\n\n/// new tip announcements.)\n\npub fn net_sync<A: Api>(\n\n net: &mut A,\n\n net_cfg: &net::Config,\n\n storage: &storage::Storage,\n\n sync_once: bool)\n\n -> Result<()>\n\n{\n\n // recover and print the TIP of the network\n\n let mut tip_header = net.get_tip()?;\n\n\n\n loop {\n\n\n\n net_sync_to(net, net_cfg, storage, &tip_header)?;\n\n\n\n if sync_once { break }\n\n\n\n tip_header = net.wait_for_new_tip(&tip_header.compute_hash())?;\n\n }\n\n\n\n Ok(())\n\n}\n\n\n","file_path":"exe-common/src/sync.rs","rank":68,"score":212564.6102458308},{"content":"pub fn send_msg_getblocks(from: &HeaderHash, to: &HeaderHash) -> Message {\n\n let dat = se::Serializer::new_vec().write_array(cbor_event::Len::Len(2)).unwrap()\n\n .serialize(from).unwrap()\n\n .serialize(to).unwrap()\n\n .finalize();\n\n (MsgType::MsgGetBlocks as u8, dat)\n\n}\n\n\n","file_path":"protocol/src/packet.rs","rank":69,"score":211932.19361551},{"content":"/// Write a u32 into a vector, which must be 4 bytes long. The value is written in big-endian\n\n/// format.\n\npub fn write_u32_be(dst: &mut [u8], mut input: u32) {\n\n assert!(dst.len() == 4);\n\n input = input.to_be();\n\n unsafe {\n\n let tmp = &input as *const _ as *const u8;\n\n ptr::copy_nonoverlapping(tmp, dst.get_unchecked_mut(0), 4);\n\n }\n\n}\n\n\n","file_path":"cryptoxide/src/cryptoutil.rs","rank":70,"score":208024.29224947462},{"content":"/// Write a u64 into a vector, which must be 8 bytes long. The value is written in big-endian\n\n/// format.\n\npub fn write_u64_be(dst: &mut[u8], mut input: u64) {\n\n assert!(dst.len() == 8);\n\n input = input.to_be();\n\n unsafe {\n\n let tmp = &input as *const _ as *const u8;\n\n ptr::copy_nonoverlapping(tmp, dst.get_unchecked_mut(0), 8);\n\n }\n\n}\n\n\n","file_path":"cryptoxide/src/cryptoutil.rs","rank":71,"score":208024.29224947462},{"content":"pub fn sc_reduce(s: &mut [u8]) {\n\n let mut s0: i64 = 2097151 & load_3i(s);\n\n let mut s1: i64 = 2097151 & (load_4i(&s[2..6]) >> 5);\n\n let mut s2: i64 = 2097151 & (load_3i(&s[5..8]) >> 2);\n\n let mut s3: i64 = 2097151 & (load_4i(&s[7..11]) >> 7);\n\n let mut s4: i64 = 2097151 & (load_4i(&s[10..14]) >> 4);\n\n let mut s5: i64 = 2097151 & (load_3i(&s[13..16]) >> 1);\n\n let mut s6: i64 = 2097151 & (load_4i(&s[15..19]) >> 6);\n\n let mut s7: i64 = 2097151 & (load_3i(&s[18..21]) >> 3);\n\n let mut s8: i64 = 2097151 & load_3i(&s[21..24]);\n\n let mut s9: i64 = 2097151 & (load_4i(&s[23..27]) >> 5);\n\n let mut s10: i64 = 2097151 & (load_3i(&s[26..29]) >> 2);\n\n let mut s11: i64 = 2097151 & (load_4i(&s[28..32]) >> 7);\n\n let mut s12: i64 = 2097151 & (load_4i(&s[31..35]) >> 4);\n\n let mut s13: i64 = 2097151 & (load_3i(&s[34..37]) >> 1);\n\n let mut s14: i64 = 2097151 & (load_4i(&s[36..40]) >> 6);\n\n let mut s15: i64 = 2097151 & (load_3i(&s[39..42]) >> 3);\n\n let mut s16: i64 = 2097151 & load_3i(&s[42..45]);\n\n let mut s17: i64 = 2097151 & (load_4i(&s[44..48]) >> 5);\n\n let s18: i64 = 2097151 & (load_3i(&s[47..50]) >> 2);\n","file_path":"cryptoxide/src/curve25519.rs","rank":72,"score":207546.49190657554},{"content":"#[inline]\n\npub fn zero(dst: &mut [u8]) {\n\n unsafe {\n\n ptr::write_bytes(dst.as_mut_ptr(), 0, dst.len());\n\n }\n\n}\n\n\n","file_path":"cryptoxide/src/cryptoutil.rs","rank":73,"score":207546.49190657554},{"content":"/// encode bytes into an hexadecimal string\n\n///\n\n/// # Example\n\n///\n\n/// ```\n\n/// use cardano::util::hex::{Error, encode};\n\n///\n\n/// let example = b\"some bytes\";\n\n///\n\n/// assert_eq!(\"736f6d65206279746573\", encode(example));\n\n/// ```\n\npub fn encode(input: &[u8]) -> String {\n\n let mut v = Vec::with_capacity(input.len() * 2);\n\n for &byte in input.iter() {\n\n v.push(ALPHABET[(byte >> 4) as usize]);\n\n v.push(ALPHABET[(byte & 0xf) as usize]);\n\n }\n\n\n\n unsafe {\n\n String::from_utf8_unchecked(v)\n\n }\n\n}\n\n\n","file_path":"cardano/src/util/hex.rs","rank":74,"score":205767.85729574302},{"content":"/// encode in base58 the given input\n\n///\n\n/// # Example\n\n///\n\n/// ```\n\n/// use cardano::util::base58;\n\n///\n\n/// let encoded = r\"TcgsE5dzphUWfjcb9i5\";\n\n/// let decoded = b\"Hello World...\";\n\n///\n\n/// assert_eq!(encoded, base58::encode(decoded));\n\n/// ```\n\npub fn encode(input: &[u8]) -> String {\n\n // unsafe to unwrap the result of `String::from_utf8` as the given\n\n // returned bytes are valid within the base58 alphabet (they are all ASCII7)\n\n String::from_utf8(\n\n base_encode(ALPHABET, input)\n\n ).unwrap()\n\n}\n\n\n","file_path":"cardano/src/util/base58.rs","rank":75,"score":205758.9162657597},{"content":"/// Write a u32 into a vector, which must be 4 bytes long. The value is written in little-endian\n\n/// format.\n\npub fn write_u32_le(dst: &mut[u8], mut input: u32) {\n\n assert!(dst.len() == 4);\n\n input = input.to_le();\n\n unsafe {\n\n let tmp = &input as *const _ as *const u8;\n\n ptr::copy_nonoverlapping(tmp, dst.get_unchecked_mut(0), 4);\n\n }\n\n}\n\n\n","file_path":"cryptoxide/src/cryptoutil.rs","rank":76,"score":205697.14575881025},{"content":"/// Write a u64 into a vector, which must be 8 bytes long. The value is written in little-endian\n\n/// format.\n\npub fn write_u64_le(dst: &mut[u8], mut input: u64) {\n\n assert!(dst.len() == 8);\n\n input = input.to_le();\n\n unsafe {\n\n let tmp = &input as *const _ as *const u8;\n\n ptr::copy_nonoverlapping(tmp, dst.get_unchecked_mut(0), 8);\n\n }\n\n}\n\n\n","file_path":"cryptoxide/src/cryptoutil.rs","rank":77,"score":205697.14575881025},{"content":"/// zero the given slice.\n\n///\n\n/// We assume the compiler won't optimise out the call to this function\n\npub fn zero(to_zero: &mut [u8]) {\n\n\n\n // the unsafety of this call is bounded to the existence of the pointer\n\n // and the accuracy of the length of the array.\n\n //\n\n // since to_zero existence is bound to live at least as long as the call\n\n // of this function and that we use the length (in bytes) of the given\n\n // slice, this call is safe.\n\n unsafe {\n\n ::std::ptr::write_bytes(to_zero.as_mut_ptr(), 0, to_zero.len())\n\n }\n\n}\n","file_path":"cardano/src/util/securemem.rs","rank":78,"score":204626.6114821655},{"content":"pub fn open_index(storage_config: &super::StorageConfig, pack: &super::PackHash) -> fs::File {\n\n fs::File::open(storage_config.get_index_filepath(pack)).unwrap()\n\n}\n\n\n","file_path":"storage/src/pack.rs","rank":79,"score":200806.63477164047},{"content":"pub fn send_msg_subscribe(keep_alive: bool) -> Message {\n\n let value = if keep_alive { 43 } else { 42 };\n\n let dat = se::Serializer::new_vec().write_unsigned_integer(value).unwrap().finalize();\n\n (MsgType::MsgSubscribe as u8, dat)\n\n}\n\n\n","file_path":"protocol/src/packet.rs","rank":80,"score":200098.56289269705},{"content":"fn duration_print(d: Duration) -> String {\n\n format!(\"{}.{:03} seconds\", d.as_secs(), d.subsec_millis())\n\n}\n\n\n","file_path":"exe-common/src/sync.rs","rank":81,"score":197753.14975768418},{"content":"fn base_encode(alphabet_s: &str, input: &[u8]) -> Vec<u8> {\n\n let alphabet = alphabet_s.as_bytes();\n\n let base = alphabet.len() as u32;\n\n\n\n let mut digits = vec![0 as u8];\n\n for input in input.iter() {\n\n let mut carry = input.clone() as u32;\n\n for j in 0..digits.len() {\n\n carry = carry + ((digits[j] as u32) << 8);\n\n digits[j] = (carry % base) as u8;\n\n carry = carry / base;\n\n }\n\n\n\n while carry > 0 {\n\n digits.push((carry % base) as u8);\n\n carry = carry / base;\n\n }\n\n }\n\n\n\n let mut string = vec![];\n","file_path":"cardano/src/util/base58.rs","rank":82,"score":195939.3441886178},{"content":"pub fn sum_coins<I>(coin_iter: I) -> Result<Coin>\n\n where I: Iterator<Item = Coin>\n\n{\n\n coin_iter.fold(Coin::new(0), |acc, ref c| acc.and_then(|v| v + *c))\n\n}\n","file_path":"cardano/src/coin.rs","rank":83,"score":195465.12538875284},{"content":"// Hmac uses two keys derived from the provided key - one by xoring every byte with 0x36 and another\n\n// with 0x5c.\n\nfn create_keys<D: Digest>(digest: &mut D, key: &[u8]) -> (Vec<u8>, Vec<u8>) {\n\n let mut i_key = expand_key(digest, key);\n\n let mut o_key = i_key.clone();\n\n derive_key(&mut i_key, 0x36);\n\n derive_key(&mut o_key, 0x5c);\n\n (i_key, o_key)\n\n}\n\n\n\nimpl <D: Digest> Hmac<D> {\n\n /**\n\n * Create a new Hmac instance.\n\n *\n\n * # Arguments\n\n * * digest - The Digest to use.\n\n * * key - The key to use.\n\n *\n\n */\n\n pub fn new(mut digest: D, key: &[u8]) -> Hmac<D> {\n\n let (i_key, o_key) = create_keys(&mut digest, key);\n\n digest.input(&i_key[..]);\n","file_path":"cryptoxide/src/hmac.rs","rank":84,"score":194425.6263877159},{"content":"/// Read a vector of bytes into a vector of u64s. The values are read in big-endian format.\n\npub fn read_u64v_be(dst: &mut[u64], input: &[u8]) {\n\n assert!(dst.len() * 8 == input.len());\n\n unsafe {\n\n let mut x: *mut u64 = dst.get_unchecked_mut(0);\n\n let mut y: *const u8 = input.get_unchecked(0);\n\n for _ in 0..dst.len() {\n\n let mut tmp: u64 = mem::uninitialized();\n\n ptr::copy_nonoverlapping(y, &mut tmp as *mut _ as *mut u8, 8);\n\n *x = u64::from_be(tmp);\n\n x = x.offset(1);\n\n y = y.offset(8);\n\n }\n\n }\n\n}\n\n\n","file_path":"cryptoxide/src/cryptoutil.rs","rank":85,"score":192639.41420826723},{"content":"/// Read a vector of bytes into a vector of u32s. The values are read in big-endian format.\n\npub fn read_u32v_be(dst: &mut[u32], input: &[u8]) {\n\n assert!(dst.len() * 4 == input.len());\n\n unsafe {\n\n let mut x: *mut u32 = dst.get_unchecked_mut(0);\n\n let mut y: *const u8 = input.get_unchecked(0);\n\n for _ in 0..dst.len() {\n\n let mut tmp: u32 = mem::uninitialized();\n\n ptr::copy_nonoverlapping(y, &mut tmp as *mut _ as *mut u8, 4);\n\n *x = u32::from_be(tmp);\n\n x = x.offset(1);\n\n y = y.offset(4);\n\n }\n\n }\n\n}\n\n\n","file_path":"cryptoxide/src/cryptoutil.rs","rank":86,"score":192639.41420826723},{"content":"pub fn secure_memset(dst: &mut [u8], val: u8) {\n\n for i in 0..dst.len() {\n\n dst[i] = val;\n\n }\n\n}\n\n\n","file_path":"cryptoxide/src/util.rs","rank":87,"score":192634.2141556674},{"content":"#[inline]\n\npub fn copy_memory(src: &[u8], dst: &mut [u8]) {\n\n assert!(dst.len() >= src.len());\n\n unsafe {\n\n let srcp = src.as_ptr();\n\n let dstp = dst.as_mut_ptr();\n\n ptr::copy_nonoverlapping(srcp, dstp, src.len());\n\n }\n\n}\n\n\n\n/// Zero all bytes in dst\n","file_path":"cryptoxide/src/cryptoutil.rs","rank":88,"score":192634.2141556674},{"content":"/// Compare two vectors using a fixed number of operations. If the two vectors are not of equal\n\n/// length, the function returns false immediately.\n\npub fn fixed_time_eq(lhs: &[u8], rhs: &[u8]) -> bool {\n\n if lhs.len() != rhs.len() {\n\n false\n\n } else {\n\n let mut v = 0;\n\n for i in 0..lhs.len() {\n\n let a = lhs[i];\n\n let b = rhs[i];\n\n v = v | (a ^ b);\n\n };\n\n v == 0\n\n }\n\n}\n\n\n\n#[cfg(test)]\n\nmod test {\n\n use util::fixed_time_eq;\n\n\n\n #[test]\n\n pub fn test_fixed_time_eq() {\n","file_path":"cryptoxide/src/util.rs","rank":89,"score":190948.56914168334},{"content":"/// Try to reverse the scramble operation, using\n\n/// the first `IV_SIZE` bytes as IV, and the rest as the shielded input.\n\npub fn unscramble(password: &[u8], input: &[u8]) -> Vec<u8>{\n\n assert!(input.len() > IV_SIZE);\n\n\n\n let out_sz = input.len() - IV_SIZE;\n\n\n\n let mut out = Vec::with_capacity(out_sz);\n\n for _ in 0..out_sz {\n\n out.push(0);\n\n }\n\n\n\n gen(&input[0..IV_SIZE], password, &mut out[0..out_sz]);\n\n for i in 0..out_sz {\n\n out[i] = out[i] ^ input[IV_SIZE+i];\n\n }\n\n out\n\n}\n\n\n\n\n\n#[cfg(test)]\n\nmod tests {\n\n //use paperwallet::{scramble,unscramble};\n\n use paperwallet;\n\n\n","file_path":"cardano/src/paperwallet.rs","rank":90,"score":190412.560957146},{"content":"/// Read a vector of bytes into a vector of u64s. The values are read in little-endian format.\n\npub fn read_u64v_le(dst: &mut[u64], input: &[u8]) {\n\n assert!(dst.len() * 8 == input.len());\n\n unsafe {\n\n let mut x: *mut u64 = dst.get_unchecked_mut(0);\n\n let mut y: *const u8 = input.get_unchecked(0);\n\n for _ in 0..dst.len() {\n\n let mut tmp: u64 = mem::uninitialized();\n\n ptr::copy_nonoverlapping(y, &mut tmp as *mut _ as *mut u8, 8);\n\n *x = u64::from_le(tmp);\n\n x = x.offset(1);\n\n y = y.offset(8);\n\n }\n\n }\n\n}\n\n\n","file_path":"cryptoxide/src/cryptoutil.rs","rank":91,"score":190080.34520304832},{"content":"/// Write a vector of u64s into a vector of bytes. The values are written in little-endian format.\n\npub fn write_u64v_le(dst: &mut[u8], input: &[u64]) {\n\n assert!(dst.len() == 8 * input.len());\n\n unsafe {\n\n let mut x: *mut u8 = dst.get_unchecked_mut(0);\n\n let mut y: *const u64 = input.get_unchecked(0);\n\n for _ in 0..input.len() {\n\n let tmp = (*y).to_le();\n\n ptr::copy_nonoverlapping(&tmp as *const _ as *const u8, x, 8);\n\n x = x.offset(8);\n\n y = y.offset(1);\n\n }\n\n }\n\n}\n\n\n","file_path":"cryptoxide/src/cryptoutil.rs","rank":92,"score":190080.34520304832},{"content":"/// Write a vector of u32s into a vector of bytes. The values are written in little-endian format.\n\npub fn write_u32v_le (dst: &mut[u8], input: &[u32]) {\n\n assert!(dst.len() == 4 * input.len());\n\n unsafe {\n\n let mut x: *mut u8 = dst.get_unchecked_mut(0);\n\n let mut y: *const u32 = input.get_unchecked(0);\n\n for _ in 0..input.len() {\n\n let tmp = (*y).to_le();\n\n ptr::copy_nonoverlapping(&tmp as *const _ as *const u8, x, 4);\n\n x = x.offset(4);\n\n y = y.offset(1);\n\n }\n\n }\n\n}\n\n\n","file_path":"cryptoxide/src/cryptoutil.rs","rank":93,"score":190080.34520304832},{"content":"/// Read a vector of bytes into a vector of u32s. The values are read in little-endian format.\n\npub fn read_u32v_le(dst: &mut[u32], input: &[u8]) {\n\n assert!(dst.len() * 4 == input.len());\n\n unsafe {\n\n let mut x: *mut u32 = dst.get_unchecked_mut(0);\n\n let mut y: *const u8 = input.get_unchecked(0);\n\n for _ in 0..dst.len() {\n\n let mut tmp: u32 = mem::uninitialized();\n\n ptr::copy_nonoverlapping(y, &mut tmp as *mut _ as *mut u8, 4);\n\n *x = u32::from_le(tmp);\n\n x = x.offset(1);\n\n y = y.offset(4);\n\n }\n\n }\n\n}\n\n\n","file_path":"cryptoxide/src/cryptoutil.rs","rank":94,"score":190080.34520304832},{"content":"/// Check that a file has a header denoting the expected file type and\n\n/// has a version in the specified range. Return the version.\n\npub fn check_header(\n\n file: &mut Read,\n\n expected_file_type: FileType,\n\n min_version: Version,\n\n max_version: Version)\n\n -> Result<Version>\n\n{\n\n let mut hdr_buf = [0u8;HEADER_SIZE];\n\n file.read_exact(&mut hdr_buf)?;\n\n\n\n if &hdr_buf[0..MAGIC_SIZE] != MAGIC {\n\n return Err(StorageError::MissingMagic);\n\n }\n\n\n\n let file_type = read_size(&hdr_buf[8..12]);\n\n let version = read_size(&hdr_buf[12..16]);\n\n\n\n if file_type != expected_file_type {\n\n return Err(StorageError::WrongFileType(expected_file_type, file_type));\n\n }\n","file_path":"storage/src/utils/magic.rs","rank":95,"score":188042.82717775033},{"content":"pub fn pbkdf2<M: Mac>(mac: &mut M, salt: &[u8], c: u32, output: &mut [u8]) {\n\n assert!(c > 0);\n\n\n\n let os = mac.output_bytes();\n\n\n\n // A temporary storage array needed by calculate_block. This is really only necessary if c > 1.\n\n // Most users of pbkdf2 should use a value much larger than 1, so, this allocation should almost\n\n // always be necessary. A big exception is Scrypt. However, this allocation is unlikely to be\n\n // the bottleneck in Scrypt performance.\n\n let mut scratch: Vec<u8> = repeat(0).take(os).collect();\n\n\n\n let mut idx: u32 = 0;\n\n\n\n for chunk in output.chunks_mut(os) {\n\n // The block index starts at 1. So, this is supposed to run on the first execution.\n\n idx = idx.checked_add(1).expect(\"PBKDF2 size limit exceeded.\");\n\n\n\n if chunk.len() == os {\n\n calculate_block(mac, salt, c, idx, &mut scratch, chunk);\n\n } else {\n\n let mut tmp: Vec<u8> = repeat(0).take(os).collect();\n\n calculate_block(mac, salt, c, idx, &mut scratch[..], &mut tmp[..]);\n\n let chunk_len = chunk.len();\n\n copy_memory(&tmp[..chunk_len], chunk);\n\n }\n\n }\n\n}\n","file_path":"cryptoxide/src/pbkdf2.rs","rank":96,"score":186089.2546017369},{"content":"// Return the chain of block headers starting at from's next block\n\n// and terminating at to, unless this range represent a number\n\n// of blocks greater than the limit imposed by the node we're talking to.\n\npub fn find_earliest_epoch(\n\n storage: &storage::Storage,\n\n minimum_epochid: block::EpochId,\n\n start_epochid: block::EpochId,\n\n) -> Option<(block::EpochId, PackHash)> {\n\n let mut epoch_id = start_epochid;\n\n loop {\n\n match storage::tag::read_hash(storage, &storage::tag::get_epoch_tag(epoch_id)) {\n\n None => match storage::epoch::epoch_read_pack(&storage.config, epoch_id).ok() {\n\n None => {}\n\n Some(h) => {\n\n return Some((epoch_id, h));\n\n }\n\n },\n\n Some(h) => {\n\n info!(\"latest known epoch found is {}\", epoch_id);\n\n return Some((epoch_id, h.into()));\n\n }\n\n }\n\n\n\n if epoch_id > minimum_epochid {\n\n epoch_id -= 1\n\n } else {\n\n return None;\n\n }\n\n }\n\n}\n\n\n","file_path":"exe-common/src/utils.rs","rank":97,"score":185549.12237378623},{"content":"pub fn txaux_serialize_size(tx: &Tx, in_witnesses: &Vec<TxInWitness>) -> usize {\n\n // TODO don't actually produce any bytes, but instead just count.\n\n // we don't expect error here, a real counter would not error..\n\n let ser = cbor_event::se::Serializer::new_vec();\n\n let bytes = txaux_serialize(tx, in_witnesses, ser).unwrap().finalize();\n\n bytes.len()\n\n}\n\n\n\n#[derive(Debug, Clone)]\n\npub struct TxProof {\n\n pub number: u32,\n\n pub root: Blake2b256,\n\n pub witnesses_hash: Blake2b256,\n\n}\n\nimpl TxProof {\n\n pub fn new(number: u32, root: Blake2b256, witnesses_hash: Blake2b256) -> Self {\n\n TxProof {\n\n number: number,\n\n root: root,\n\n witnesses_hash: witnesses_hash\n","file_path":"cardano/src/tx.rs","rank":98,"score":183035.296297493},{"content":"/// Verify that a signature is valid for a given message for an associated public key\n\npub fn verify(message: &[u8], public_key: &[u8], signature: &[u8]) -> bool {\n\n assert!(public_key.len() == PUBLIC_KEY_LENGTH, \"Public key should be {} bytes long!\", PUBLIC_KEY_LENGTH);\n\n assert!(signature.len() == SIGNATURE_LENGTH, \"signature should be {} bytes long!\", SIGNATURE_LENGTH);\n\n\n\n if check_s_lt_l(&signature[32..64]) {\n\n return false;\n\n }\n\n\n\n let a = match GeP3::from_bytes_negate_vartime(public_key) {\n\n Some(g) => g,\n\n None => { return false; }\n\n };\n\n let mut d = 0;\n\n for pk_byte in public_key.iter() {\n\n d |= *pk_byte;\n\n }\n\n if d == 0 {\n\n return false;\n\n }\n\n\n","file_path":"cryptoxide/src/ed25519.rs","rank":99,"score":182908.8852603216}],"string":"[\n {\n \"content\": \"pub fn resolve_date_to_blockhash(storage: &Storage, tip: &BlockHash, date: &BlockDate) -> Result<Option<BlockHash>> {\\n\\n let epoch = date.get_epochid();\\n\\n match epoch_open_packref(&storage.config, epoch) {\\n\\n Ok(mut handle) => {\\n\\n let slotid = match date {\\n\\n BlockDate::Genesis(_) => 0,\\n\\n BlockDate::Normal(sid) => sid.slotid,\\n\\n };\\n\\n let r = handle.getref_at_index(slotid as u32)?;\\n\\n Ok(r)\\n\\n },\\n\\n Err(_) => {\\n\\n let tip_rblk = block_read(&storage, tip);\\n\\n match tip_rblk {\\n\\n None => return Ok(None),\\n\\n Some(rblk) => {\\n\\n let blk = rblk.decode()?;\\n\\n let found = block_reverse_search_from_tip(storage, &blk, |x|\\n\\n match x.get_header().get_blockdate().cmp(date) {\\n\\n Ordering::Equal => Ok(ReverseSearch::Found),\\n\",\n \"file_path\": \"storage/src/block/iter.rs\",\n \"rank\": 0,\n \"score\": 454748.1691610039\n },\n {\n \"content\": \"pub fn dump_file(file: &mut fs::File) -> Result<(Lookup, Vec<BlockHash>)> {\\n\\n let lookup = Lookup::read_from_file(file)?;\\n\\n\\n\\n let mut v = Vec::new();\\n\\n let FanoutTotal(total) = lookup.fanout.get_total();\\n\\n\\n\\n file.seek(SeekFrom::Start(HEADER_SIZE as u64)).unwrap();\\n\\n for _ in 0..total {\\n\\n let h = file_read_hash(file);\\n\\n v.push(h);\\n\\n }\\n\\n Ok((lookup, v))\\n\\n}\\n\\n\\n\\npub struct ReaderNoLookup<R> {\\n\\n handle: R,\\n\\n}\\n\\n\\n\\nimpl ReaderNoLookup<fs::File> {\\n\\n pub fn init<P: AsRef<Path>>(path: P) -> Result<Self> {\\n\",\n \"file_path\": \"storage/src/containers/indexfile.rs\",\n \"rank\": 1,\n \"score\": 405472.52025529183\n },\n {\n \"content\": \"/// Check whether an epoch pack exists on disk.\\n\\npub fn epoch_exists(config: &StorageConfig, epochid: cardano::block::EpochId) -> Result<bool> {\\n\\n match epoch_read_pack(config, epochid) {\\n\\n Ok(_) => Ok(true),\\n\\n Err(Error::StorageError(StorageError::IoError(ref err))) if err.kind() == ::std::io::ErrorKind::NotFound => Ok(false),\\n\\n Err(err) => Err(err)\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"storage/src/epoch.rs\",\n \"rank\": 2,\n \"score\": 399954.2923208799\n },\n {\n \"content\": \"// a block in a pack file is:\\n\\n// * a 32 bit size in big endian\\n\\n// * data of the size above\\n\\n// * 0 to 3 bytes of 0-alignment to make sure the next block is aligned\\n\\npub fn read_next_block<R: Read>(mut file: R) -> io::Result<Vec<u8>> {\\n\\n let mut sz_buf = [0u8;SIZE_SIZE];\\n\\n file.read_exact(&mut sz_buf)?;\\n\\n let sz = read_size(&sz_buf);\\n\\n // don't potentially consume all memory when reading a corrupt file\\n\\n assert!(sz < 20000000);\\n\\n let mut v : Vec<u8> = repeat(0).take(sz as usize).collect();\\n\\n file.read_exact(v.as_mut_slice())?;\\n\\n if (v.len() % 4) != 0 {\\n\\n let to_align = 4 - (v.len() % 4);\\n\\n let mut align = [0u8;4];\\n\\n file.read_exact(&mut align[0..to_align])?;\\n\\n }\\n\\n Ok(v)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"storage/src/containers/packfile.rs\",\n \"rank\": 3,\n \"score\": 395921.0990292125\n },\n {\n \"content\": \"pub fn get_epoch_tag(epoch: block::EpochId) -> String {\\n\\n format!(\\\"EPOCH_{}\\\", epoch)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"storage/src/tag.rs\",\n \"rank\": 4,\n \"score\": 389409.55049487134\n },\n {\n \"content\": \"fn block_reverse_search_from_tip<F>(storage: &Storage, first_block: &Block, find: F) -> Result<Option<Block>>\\n\\n where F: Fn(&Block) -> Result<ReverseSearch>\\n\\n{\\n\\n let mut current_blk = first_block.clone();\\n\\n loop {\\n\\n match find(¤t_blk)? {\\n\\n ReverseSearch::Continue => {\\n\\n let blk = previous_block(&storage, ¤t_blk);\\n\\n current_blk = blk;\\n\\n },\\n\\n ReverseSearch::Found => { return Ok(Some(current_blk)) },\\n\\n ReverseSearch::Abort => { return Ok(None) },\\n\\n };\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"storage/src/block/iter.rs\",\n \"rank\": 5,\n \"score\": 372183.4932974319\n },\n {\n \"content\": \"pub fn epoch_read_pack(config: &StorageConfig, epochid: cardano::block::EpochId) -> Result<PackHash> {\\n\\n let mut content = Vec::new();\\n\\n\\n\\n let pack_filepath = config.get_epoch_pack_filepath(epochid);\\n\\n let mut file = fs::File::open(&pack_filepath)?;\\n\\n let _read = file.read_to_end(&mut content).unwrap();\\n\\n\\n\\n let p = String::from_utf8(content.clone()).ok().and_then(|r| hex::decode(&r).ok()).unwrap();\\n\\n let mut ph = [0u8; super::HASH_SIZE];\\n\\n ph.clone_from_slice(&p[..]);\\n\\n\\n\\n Ok(ph)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"storage/src/epoch.rs\",\n \"rank\": 6,\n \"score\": 365894.7577454153\n },\n {\n \"content\": \"pub fn epoch_read(config: &StorageConfig, epochid: cardano::block::EpochId) -> Result<(PackHash, reffile::Reader)> {\\n\\n let ph = epoch_read_pack(config, epochid)?;\\n\\n let rp = epoch_read_packref(config, epochid)?;\\n\\n Ok((ph, rp))\\n\\n}\\n\\n\\n\",\n \"file_path\": \"storage/src/epoch.rs\",\n \"rank\": 7,\n \"score\": 355445.3876328509\n },\n {\n \"content\": \"fn next_until_range(packreader: &mut packfile::Reader<fs::File>, start_date: &BlockDate, end_date: &BlockDate) -> Result<Option<Block>> {\\n\\n loop {\\n\\n match packreader.get_next() {\\n\\n None => { return Ok(None) },\\n\\n Some(b) => {\\n\\n let mut blk = RawBlock(b).decode().unwrap();\\n\\n let blk_date = blk.get_header().get_blockdate();\\n\\n if &blk_date > end_date {\\n\\n return Ok(None)\\n\\n };\\n\\n if &blk_date >= start_date {\\n\\n return Ok(Some(blk))\\n\\n }\\n\\n },\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\npub enum ReverseSearch {\\n\\n Continue,\\n\\n Found,\\n\\n Abort,\\n\\n}\\n\\n\\n\",\n \"file_path\": \"storage/src/block/iter.rs\",\n \"rank\": 8,\n \"score\": 352560.7437630693\n },\n {\n \"content\": \"pub fn write_hash<S: AsRef<str>>(storage: &super::Storage, name: &S, content: &block::HeaderHash) {\\n\\n write(storage, name, content.as_ref())\\n\\n}\\n\\n\\n\",\n \"file_path\": \"storage/src/tag.rs\",\n \"rank\": 9,\n \"score\": 344263.67092542583\n },\n {\n \"content\": \"pub fn read_hash<S: AsRef<str>>(storage: &super::Storage, name: &S) -> Option<block::HeaderHash> {\\n\\n read(storage, name).and_then(|v| block::HeaderHash::try_from_slice(&v[..]).ok())\\n\\n}\\n\\n\\n\",\n \"file_path\": \"storage/src/tag.rs\",\n \"rank\": 10,\n \"score\": 344263.67092542583\n },\n {\n \"content\": \"/// Try to open a packfile Reader on a specific epoch\\n\\n///\\n\\n/// if there's no pack at this address, then nothing is return\\n\\npub fn epoch_open_pack_reader(config: &StorageConfig, epochid: cardano::block::EpochId) -> Result<Option<packfile::Reader<fs::File>>> {\\n\\n match epoch_read_pack(config, epochid) {\\n\\n Err(Error::StorageError(StorageError::IoError(ref err))) if err.kind() == ::std::io::ErrorKind::NotFound => Ok(None),\\n\\n Err(err) => Err(err),\\n\\n Ok(epoch_ref) => {\\n\\n let reader = packreader_init(config, &epoch_ref);\\n\\n Ok(Some(reader))\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\n/*\\n\",\n \"file_path\": \"storage/src/epoch.rs\",\n \"rank\": 11,\n \"score\": 338013.3666489187\n },\n {\n \"content\": \"pub fn dump_index(storage_config: &super::StorageConfig, pack: &super::PackHash) -> Result<(indexfile::Lookup, Vec<super::BlockHash>)> {\\n\\n let mut file = open_index(storage_config, pack);\\n\\n let result = indexfile::dump_file(&mut file)?;\\n\\n Ok(result)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"storage/src/pack.rs\",\n \"rank\": 12,\n \"score\": 337828.7508883742\n },\n {\n \"content\": \"pub fn packreader_block_next(reader: &mut packfile::Reader<fs::File>) -> Option<cardano::block::RawBlock> {\\n\\n reader.get_next().and_then(|x| Some(cardano::block::RawBlock(x)))\\n\\n}\\n\",\n \"file_path\": \"storage/src/pack.rs\",\n \"rank\": 13,\n \"score\": 334831.8451410536\n },\n {\n \"content\": \"pub fn block_read(storage: &Storage, hash: &BlockHash) -> Option<RawBlock> {\\n\\n match block_location(storage, hash) {\\n\\n None => None,\\n\\n Some(loc) => block_read_location(storage, &loc, hash),\\n\\n }\\n\\n}\\n\\n\\n\\n/// packing parameters\\n\\n///\\n\\n/// optionally set the maximum number of blobs in this pack\\n\\n/// optionally set the maximum size in bytes of the pack file.\\n\\n/// note that the limits is best effort, not strict.\\n\\npub struct PackParameters {\\n\\n pub limit_nb_blobs: Option<u32>,\\n\\n pub limit_size: Option<u64>,\\n\\n pub delete_blobs_after_pack: bool,\\n\\n pub range: Option<(BlockHash, BlockHash)>,\\n\\n}\\n\\nimpl Default for PackParameters {\\n\\n fn default() -> Self {\\n\\n PackParameters {\\n\\n limit_nb_blobs: None,\\n\\n limit_size: None,\\n\\n delete_blobs_after_pack: true,\\n\\n range: None,\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"storage/src/lib.rs\",\n \"rank\": 14,\n \"score\": 333815.73228358355\n },\n {\n \"content\": \"// same as read_next_block, but when receiving EOF it will wrapped into returning None\\n\\npub fn read_next_block_or_eof<R: Read>(file: R) -> io::Result<Option<Vec<u8>>> {\\n\\n match read_next_block(file) {\\n\\n Err(err) => if err.kind() == io::ErrorKind::UnexpectedEof { Ok(None) } else { Err(err) },\\n\\n Ok(data) => Ok(Some(data)),\\n\\n }\\n\\n}\\n\\n\\n\\nimpl<R: Read> Reader<R> {\\n\\n /// Return the next data block.\\n\\n ///\\n\\n /// note: any IO error raise runtime exception for now. will be changed soon.\\n\\n pub fn get_next(&mut self) -> Option<Vec<u8>> {\\n\\n // TODO: remove unwrap()\\n\\n let mdata = read_next_block_or_eof(&mut self.reader).unwrap();\\n\\n match mdata {\\n\\n None => {},\\n\\n Some(ref data) => {\\n\\n self.hash_context.input(data);\\n\\n self.pos += 4 + offset_align4(data.len() as u64);\\n\\n }\\n\",\n \"file_path\": \"storage/src/containers/packfile.rs\",\n \"rank\": 15,\n \"score\": 331732.00404479355\n },\n {\n \"content\": \"// Create a pack of references (packref) of all the hash in an epoch pack\\n\\n//\\n\\n// If the pack is not valid, then an error is returned\\n\\npub fn refpack_epoch_pack<S: AsRef<str>>(storage: &Storage, tag: &S) -> Result<()> {\\n\\n let mut rp = reffile::Lookup::new();\\n\\n let packhash_vec = tag::read(storage, tag).expect(\\\"EPOCH not found\\\");\\n\\n let mut packhash = [0;HASH_SIZE];\\n\\n packhash[..].clone_from_slice(packhash_vec.as_slice());\\n\\n let mut pack = packreader_init(&storage.config, &packhash);\\n\\n\\n\\n let mut current_state = None;\\n\\n\\n\\n while let Some(raw_block) = packreader_block_next(&mut pack) {\\n\\n let block = raw_block.decode()?;\\n\\n let hdr = block.get_header();\\n\\n let hash = hdr.compute_hash();\\n\\n let date = hdr.get_blockdate();\\n\\n\\n\\n // either we have seen genesis yet or not\\n\\n match current_state {\\n\\n None => {\\n\\n if !hdr.is_genesis_block() {\\n\\n return Err(Error::EpochExpectingGenesis)\\n\",\n \"file_path\": \"storage/src/lib.rs\",\n \"rank\": 16,\n \"score\": 330603.748288183\n },\n {\n \"content\": \"/// decode the given hexadecimal string\\n\\n///\\n\\n/// # Example\\n\\n///\\n\\n/// ```\\n\\n/// use cardano::util::hex::{Error, decode};\\n\\n///\\n\\n/// let example = r\\\"736f6d65206279746573\\\";\\n\\n///\\n\\n/// assert!(decode(example).is_ok());\\n\\n/// ```\\n\\npub fn decode(input: &str) -> Result<Vec<u8>> {\\n\\n let mut b = Vec::with_capacity(input.len() / 2);\\n\\n let mut modulus = 0;\\n\\n let mut buf = 0;\\n\\n\\n\\n for (idx, byte) in input.bytes().enumerate() {\\n\\n buf <<= 4;\\n\\n\\n\\n match byte {\\n\\n b'A'...b'F' => buf |= byte - b'A' + 10,\\n\\n b'a'...b'f' => buf |= byte - b'a' + 10,\\n\\n b'0'...b'9' => buf |= byte - b'0',\\n\\n b' '|b'\\\\r'|b'\\\\n'|b'\\\\t' => {\\n\\n buf >>= 4;\\n\\n continue\\n\\n }\\n\\n _ => {\\n\\n return Err(Error::UnknownSymbol(idx));\\n\\n }\\n\\n }\\n\",\n \"file_path\": \"cardano/src/util/hex.rs\",\n \"rank\": 17,\n \"score\": 330399.78614281456\n },\n {\n \"content\": \"/// decode from base58 the given input\\n\\n///\\n\\n/// # Example\\n\\n///\\n\\n/// ```\\n\\n/// use cardano::util::base58;\\n\\n///\\n\\n/// let encoded = r\\\"TcgsE5dzphUWfjcb9i5\\\";\\n\\n/// let decoded = b\\\"Hello World...\\\";\\n\\n///\\n\\n/// assert_eq!(decoded, base58::decode(encoded).unwrap().as_slice());\\n\\n/// ```\\n\\npub fn decode(input: &str) -> Result<Vec<u8>> {\\n\\n base_decode(ALPHABET, input.as_bytes())\\n\\n}\\n\\n\\n\",\n \"file_path\": \"cardano/src/util/base58.rs\",\n \"rank\": 18,\n \"score\": 330385.8603715847\n },\n {\n \"content\": \"pub fn epoch_open_packref(config: &StorageConfig, epochid: cardano::block::EpochId) -> Result<reffile::Reader> {\\n\\n let path = config.get_epoch_refpack_filepath(epochid);\\n\\n let reader = reffile::Reader::open(path)?;\\n\\n Ok(reader)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"storage/src/epoch.rs\",\n \"rank\": 19,\n \"score\": 327198.839510093\n },\n {\n \"content\": \"pub fn epoch_read_packref(config: &StorageConfig, epochid: cardano::block::EpochId) -> Result<reffile::Reader> {\\n\\n let reader = reffile::Reader::open(config.get_epoch_refpack_filepath(epochid))?;\\n\\n Ok(reader)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"storage/src/epoch.rs\",\n \"rank\": 20,\n \"score\": 327198.8395100929\n },\n {\n \"content\": \"pub fn block_read_location(storage: &Storage, loc: &BlockLocation, hash: &BlockHash) -> Option<RawBlock> {\\n\\n match loc {\\n\\n &BlockLocation::Loose => blob::read(storage, hash).ok(),\\n\\n &BlockLocation::Packed(ref packref, ref iofs) => {\\n\\n match storage.lookups.get(packref) {\\n\\n None => { unreachable!(); },\\n\\n Some(lookup) => {\\n\\n let idx_filepath = storage.config.get_index_filepath(packref);\\n\\n let mut idx_file = indexfile::ReaderNoLookup::init(idx_filepath).unwrap();\\n\\n let pack_offset = idx_file.resolve_index_offset(lookup, *iofs);\\n\\n let pack_filepath = storage.config.get_pack_filepath(packref);\\n\\n let mut pack_file = packfile::Seeker::init(pack_filepath).unwrap();\\n\\n pack_file.get_at_offset(pack_offset).ok().and_then(|x| Some(RawBlock(x)))\\n\\n }\\n\\n }\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"storage/src/lib.rs\",\n \"rank\": 21,\n \"score\": 317951.77636615204\n },\n {\n \"content\": \"pub fn epoch_open_pack_seeker() -> io::Result<Option<packfile::Seeker>> {\\n\\n}\\n\\n*/\\n\\n\\n\",\n \"file_path\": \"storage/src/epoch.rs\",\n \"rank\": 22,\n \"score\": 317041.9579260984\n },\n {\n \"content\": \"pub fn epoch_create(config: &StorageConfig, packref: &PackHash, epochid: cardano::block::EpochId) {\\n\\n // read the pack and append the block hash as we find them in the refpack.\\n\\n let mut rp = reffile::Lookup::new();\\n\\n let mut reader = packreader_init(config, packref);\\n\\n\\n\\n let mut current_slotid = cardano::block::BlockDate::Genesis(epochid);\\n\\n while let Some(rblk) = packreader_block_next(&mut reader) {\\n\\n let blk = rblk.decode().unwrap();\\n\\n let hdr = blk.get_header();\\n\\n let hash = hdr.compute_hash();\\n\\n let blockdate = hdr.get_blockdate();\\n\\n\\n\\n while current_slotid != blockdate {\\n\\n rp.append_missing_hash();\\n\\n current_slotid = current_slotid.next();\\n\\n }\\n\\n rp.append_hash(header_to_blockhash(&hash));\\n\\n current_slotid = current_slotid.next();\\n\\n }\\n\\n\\n\",\n \"file_path\": \"storage/src/epoch.rs\",\n \"rank\": 23,\n \"score\": 309870.1380128054\n },\n {\n \"content\": \"pub fn block_location(storage: &Storage, hash: &BlockHash) -> Option<BlockLocation> {\\n\\n for (packref, lookup) in storage.lookups.iter() {\\n\\n let (start, nb) = lookup.fanout.get_indexer_by_hash(hash);\\n\\n match nb {\\n\\n indexfile::FanoutNb(0) => {},\\n\\n _ => {\\n\\n if lookup.bloom.search(hash) {\\n\\n let idx_filepath = storage.config.get_index_filepath(packref);\\n\\n let mut idx_file = indexfile::Reader::init(idx_filepath).unwrap();\\n\\n match idx_file.search(&lookup.params, hash, start, nb) {\\n\\n None => {},\\n\\n Some(iloc) => return Some(BlockLocation::Packed(packref.clone(), iloc)),\\n\\n }\\n\\n }\\n\\n }\\n\\n }\\n\\n }\\n\\n if blob::exist(storage, hash) {\\n\\n return Some(BlockLocation::Loose);\\n\\n }\\n\\n None\\n\\n}\\n\\n\\n\",\n \"file_path\": \"storage/src/lib.rs\",\n \"rank\": 24,\n \"score\": 306756.9826888383\n },\n {\n \"content\": \"fn epoch_integrity_check(storage: &Storage, epochid: EpochId, last_known_hash: HeaderHash) -> Result<HeaderHash> {\\n\\n let packhash_vec = tag::read(storage, &format!(\\\"EPOCH_{}\\\", epochid)).expect(\\\"EPOCH not found\\\");\\n\\n let mut packhash = [0;HASH_SIZE];\\n\\n packhash[..].clone_from_slice(packhash_vec.as_slice());\\n\\n let mut pack = packreader_init(&storage.config, &packhash);\\n\\n\\n\\n let mut current_state = None;\\n\\n\\n\\n while let Some(raw_block) = packreader_block_next(&mut pack) {\\n\\n let block = raw_block.decode()?;\\n\\n let hdr = block.get_header();\\n\\n let hash = hdr.compute_hash();\\n\\n let prevhash = hdr.get_previous_header();\\n\\n let date = hdr.get_blockdate();\\n\\n\\n\\n // either we have seen genesis yet or not\\n\\n match current_state {\\n\\n None => {\\n\\n if !hdr.is_genesis_block() {\\n\\n return Err(Error::EpochExpectingGenesis)\\n\",\n \"file_path\": \"storage/src/lib.rs\",\n \"rank\": 25,\n \"score\": 303135.9646073672\n },\n {\n \"content\": \"pub fn get_peer(blockchain: &str, cfg: &net::Config, native: bool) -> Peer {\\n\\n for peer in cfg.peers.iter() {\\n\\n if (native && peer.is_native()) || (!native && peer.is_http()) {\\n\\n return Peer::new(\\n\\n String::from(blockchain),\\n\\n peer.name().to_owned(),\\n\\n peer.peer().clone(),\\n\\n cfg.protocol_magic,\\n\\n ).unwrap();\\n\\n }\\n\\n }\\n\\n\\n\\n panic!(\\\"no peer to connect to\\\")\\n\\n}\\n\",\n \"file_path\": \"exe-common/src/sync.rs\",\n \"rank\": 26,\n \"score\": 301111.38260281255\n },\n {\n \"content\": \"// write the content buf atomically to the path.\\n\\n//\\n\\n// if an issue arise until the data is written, then\\n\\n// the expected file destination is not going to be\\n\\n// created\\n\\npub fn atomic_write_simple(path: &PathBuf, buf: &[u8]) -> io::Result<()> {\\n\\n let mut tmpfile = TmpFile::create(path.parent().unwrap().to_path_buf())?;\\n\\n tmpfile.write(buf)?;\\n\\n tmpfile.render_permanent(path)?;\\n\\n Ok(())\\n\\n}\\n\",\n \"file_path\": \"storage/src/utils/tmpfile.rs\",\n \"rank\": 27,\n \"score\": 294608.13913382776\n },\n {\n \"content\": \"pub fn header_to_blockhash(header_hash: &HeaderHash) -> BlockHash {\\n\\n let mut bh = [0u8;HASH_SIZE];\\n\\n bh[0..HASH_SIZE].clone_from_slice(header_hash.as_ref());\\n\\n bh\\n\\n}\\n\\n\\n\\n#[derive(Debug, PartialEq, Eq, PartialOrd, Ord, Clone, Copy)]\\n\\npub enum StorageFileType {\\n\\n Pack,\\n\\n Index,\\n\\n Blob,\\n\\n Tag,\\n\\n RefPack,\\n\\n Epoch,\\n\\n}\\n\",\n \"file_path\": \"storage/src/types.rs\",\n \"rank\": 28,\n \"score\": 294076.24243681354\n },\n {\n \"content\": \"pub fn exist<S: AsRef<str>>(storage: &super::Storage, name: &S) -> bool {\\n\\n let p = storage.config.get_tag_filepath(name);\\n\\n p.as_path().exists()\\n\\n}\\n\\n\\n\",\n \"file_path\": \"storage/src/tag.rs\",\n \"rank\": 29,\n \"score\": 293911.2736682197\n },\n {\n \"content\": \"pub fn epoch_create_with_refpack(config: &StorageConfig, packref: &PackHash, refpack: &reffile::Lookup, epochid: cardano::block::EpochId) {\\n\\n let dir = config.get_epoch_dir(epochid);\\n\\n fs::create_dir_all(dir).unwrap();\\n\\n\\n\\n let pack_filepath = config.get_epoch_pack_filepath(epochid);\\n\\n tmpfile::atomic_write_simple(&pack_filepath, hex::encode(packref).as_bytes()).unwrap();\\n\\n\\n\\n let mut tmpfile = TmpFile::create(config.get_epoch_dir(epochid)).unwrap();\\n\\n refpack.write(&mut tmpfile).unwrap();\\n\\n tmpfile.render_permanent(&config.get_epoch_refpack_filepath(epochid)).unwrap();\\n\\n}\\n\\n\\n\",\n \"file_path\": \"storage/src/epoch.rs\",\n \"rank\": 30,\n \"score\": 288945.2925200321\n },\n {\n \"content\": \"pub fn integrity_check(storage: &Storage, genesis_hash: HeaderHash, count: EpochId) {\\n\\n let mut previous_header = genesis_hash;\\n\\n for epochid in 0..count {\\n\\n println!(\\\"check epoch {}'s integrity\\\", epochid);\\n\\n previous_header = epoch_integrity_check(storage, epochid, previous_header).unwrap();\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"storage/src/lib.rs\",\n \"rank\": 31,\n \"score\": 286123.3784285719\n },\n {\n \"content\": \"pub fn set_bit_to(data: &mut [u8], bit: usize, value: bool) {\\n\\n let (byte_addr, bit_addr) = addr(bit);\\n\\n if value {\\n\\n data[byte_addr] |= bit_addr.set_mask();\\n\\n } else {\\n\\n data[byte_addr] &= bit_addr.clear_mask();\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"storage/src/utils/bitmap.rs\",\n \"rank\": 32,\n \"score\": 282017.39916331944\n },\n {\n \"content\": \"pub fn index_get_header(file: &mut fs::File) -> Result<indexfile::Lookup> {\\n\\n let lookup = indexfile::Lookup::read_from_file(file)?;\\n\\n Ok(lookup)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"storage/src/pack.rs\",\n \"rank\": 33,\n \"score\": 281363.7015233121\n },\n {\n \"content\": \"pub fn read<S: AsRef<str>>(storage: &super::Storage, name: &S) -> Option<Vec<u8>> {\\n\\n if ! exist(storage, name) { return None; }\\n\\n let mut content = Vec::new();\\n\\n let path = storage.config.get_tag_filepath(name);\\n\\n let mut file = fs::File::open(path).unwrap();\\n\\n file.read_to_end(&mut content).unwrap();\\n\\n String::from_utf8(content.clone()).ok()\\n\\n .and_then(|r| hex::decode(&r).ok())\\n\\n .or(Some(content))\\n\\n}\\n\\n\\n\",\n \"file_path\": \"storage/src/tag.rs\",\n \"rank\": 34,\n \"score\": 281000.3343156521\n },\n {\n \"content\": \"pub fn send_msg_getheaders(froms: &[block::HeaderHash], to: &Option<block::HeaderHash>) -> Message {\\n\\n let serializer = se::Serializer::new_vec().write_array(cbor_event::Len::Len(2)).unwrap();\\n\\n let serializer = se::serialize_indefinite_array(froms.iter(), serializer).unwrap();\\n\\n let serializer = match to {\\n\\n &None => serializer.write_array(cbor_event::Len::Len(0)).unwrap(),\\n\\n &Some(ref h) => {\\n\\n serializer.write_array(cbor_event::Len::Len(1)).unwrap()\\n\\n .serialize(h).unwrap()\\n\\n }\\n\\n };\\n\\n let dat = serializer.finalize();\\n\\n (MsgType::MsgGetHeaders as u8, dat)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"protocol/src/packet.rs\",\n \"rank\": 35,\n \"score\": 277775.6037739154\n },\n {\n \"content\": \"pub fn read_refpack<P: AsRef<str>>(storage_config: &StorageConfig, name: P) -> Result<reffile::Lookup> {\\n\\n let r = reffile::Lookup::from_path(storage_config.get_refpack_filepath(name))?;\\n\\n Ok(r)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"storage/src/refpack.rs\",\n \"rank\": 36,\n \"score\": 276811.0826240595\n },\n {\n \"content\": \"pub fn pack_blobs(storage: &mut Storage, params: &PackParameters) -> PackHash {\\n\\n let mut writer = pack::packwriter_init(&storage.config).unwrap();\\n\\n let mut blob_packed = Vec::new();\\n\\n\\n\\n let block_hashes : Vec<BlockHash> = if let Some((from, to)) = params.range {\\n\\n storage.range(from, to).unwrap().iter().cloned().collect()\\n\\n } else {\\n\\n storage.config.list_blob(params.limit_nb_blobs)\\n\\n };\\n\\n for bh in block_hashes {\\n\\n let blob = blob::read_raw(storage, &bh).unwrap();\\n\\n writer.append(&bh, &blob[..]).unwrap();\\n\\n blob_packed.push(bh);\\n\\n match params.limit_size {\\n\\n None => {},\\n\\n Some(sz) => {\\n\\n if writer.pos >= sz {\\n\\n break\\n\\n }\\n\\n }\\n\",\n \"file_path\": \"storage/src/lib.rs\",\n \"rank\": 37,\n \"score\": 276596.03060773306\n },\n {\n \"content\": \"pub fn validate_network_name(v: &&str) -> bool {\\n\\n v.chars().all(|c| c.is_ascii_alphanumeric())\\n\\n}\\n\\n\\n\",\n \"file_path\": \"hermes/src/handlers/common.rs\",\n \"rank\": 38,\n \"score\": 275063.55228854483\n },\n {\n \"content\": \"pub fn packwriter_init(cfg: &super::StorageConfig) -> Result<packfile::Writer> {\\n\\n let tmpfile = TmpFile::create(cfg.get_filetype_dir(super::StorageFileType::Pack))?;\\n\\n let writer = packfile::Writer::init(tmpfile)?;\\n\\n Ok(writer)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"storage/src/pack.rs\",\n \"rank\": 39,\n \"score\": 274776.49863682344\n },\n {\n \"content\": \"pub fn write_refpack<P: AsRef<str>>(storage_config: &StorageConfig, name: P, rf: &reffile::Lookup) -> Result<()> {\\n\\n let path = storage_config.get_refpack_filepath(name);\\n\\n rf.to_path(path)?;\\n\\n Ok(())\\n\\n}\\n\",\n \"file_path\": \"storage/src/refpack.rs\",\n \"rank\": 40,\n \"score\": 270963.08788277797\n },\n {\n \"content\": \"#[allow(dead_code)]\\n\\npub fn get_bits(data: &[u8], start_bit: usize, nb_bits: usize) -> Vec<bool> {\\n\\n let mut v = Vec::with_capacity(nb_bits);\\n\\n let (start_byte_addr, start_bit_addr) = addr(start_bit);\\n\\n\\n\\n let mut current_val = data[start_byte_addr] >> start_bit_addr.get_shifter();\\n\\n let mut current_byte_addr = start_byte_addr;\\n\\n let mut current_bit_addr = start_bit_addr;\\n\\n for i in 0..nb_bits {\\n\\n v[nb_bits - i - 1] = (current_val & 0x1) == 0x1;\\n\\n match current_bit_addr.get_next() {\\n\\n None => {\\n\\n current_byte_addr += 1;\\n\\n current_bit_addr = ByteAddr(0);\\n\\n current_val = data[current_byte_addr];\\n\\n },\\n\\n Some(new_addr) => {\\n\\n current_bit_addr = new_addr;\\n\\n current_val = current_val >> 1;\\n\\n },\\n\\n }\\n\\n }\\n\\n v\\n\\n}\",\n \"file_path\": \"storage/src/utils/bitmap.rs\",\n \"rank\": 41,\n \"score\": 268302.30951547174\n },\n {\n \"content\": \"/// get the root directory of all the hermes path\\n\\n///\\n\\n/// it is either environment variable `HERMES_PATH` or the `${HOME}/.hermes`\\n\\npub fn hermes_path() -> Result<PathBuf> {\\n\\n match env::var(HERMES_PATH_ENV) {\\n\\n Ok(path) => Ok(PathBuf::from(path)),\\n\\n Err(VarError::NotPresent) => match home_dir() {\\n\\n None => Err(Error::BlockchainConfigError(\\\"no home directory to base hermes root dir. Set `HERMES_PATH' variable environment to fix the problem.\\\")),\\n\\n Some(path) => Ok(path.join(HERMES_HOME_PATH))\\n\\n },\\n\\n Err(err) => Err(Error::VarError(err))\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"hermes/src/config.rs\",\n \"rank\": 42,\n \"score\": 262814.74799273844\n },\n {\n \"content\": \"/// Process a block with the SHA-512 algorithm. (See more...)\\n\\n///\\n\\n/// Internally, this uses functions that resemble the new Intel SHA\\n\\n/// instruction set extensions, but since no architecture seems to\\n\\n/// have any designs, these may not be the final designs if and/or when\\n\\n/// there are instruction set extensions with SHA-512. So to summarize:\\n\\n/// SHA-1 and SHA-256 are being implemented in hardware soon (at the time\\n\\n/// of this writing), but it doesn't look like SHA-512 will be hardware\\n\\n/// accelerated any time soon.\\n\\n///\\n\\n/// # Implementation\\n\\n///\\n\\n/// These functions fall into two categories:\\n\\n/// message schedule calculation, and the message block 64-round digest calculation.\\n\\n/// The schedule-related functions allow 4 rounds to be calculated as:\\n\\n///\\n\\n/// ```ignore\\n\\n/// use std::simd::u64x2;\\n\\n/// use self::crypto::sha2::{\\n\\n/// sha512msg,\\n\\n/// sha512load\\n\\n/// };\\n\\n///\\n\\n/// fn schedule4_data(work: &mut [u64x2], w: &[u64]) {\\n\\n///\\n\\n/// // this is to illustrate the data order\\n\\n/// work[0] = u64x2(w[1], w[0]);\\n\\n/// work[1] = u64x2(w[3], w[2]);\\n\\n/// work[2] = u64x2(w[5], w[4]);\\n\\n/// work[3] = u64x2(w[7], w[6]);\\n\\n/// work[4] = u64x2(w[9], w[8]);\\n\\n/// work[5] = u64x2(w[11], w[10]);\\n\\n/// work[6] = u64x2(w[13], w[12]);\\n\\n/// work[7] = u64x2(w[15], w[14]);\\n\\n/// }\\n\\n///\\n\\n/// fn schedule4_work(work: &mut [u64x2], t: usize) {\\n\\n///\\n\\n/// // this is the core expression\\n\\n/// work[t] = sha512msg(work[t - 8],\\n\\n/// work[t - 7],\\n\\n/// sha512load(work[t - 4], work[t - 3]),\\n\\n/// work[t - 1]);\\n\\n/// }\\n\\n/// ```\\n\\n///\\n\\n/// instead of 4 rounds of:\\n\\n///\\n\\n/// ```ignore\\n\\n/// fn schedule_work(w: &mut [u64], t: usize) {\\n\\n/// w[t] = sigma1!(w[t - 2]) + w[t - 7] + sigma0!(w[t - 15]) + w[t - 16];\\n\\n/// }\\n\\n/// ```\\n\\n///\\n\\n/// and the digest-related functions allow 4 rounds to be calculated as:\\n\\n///\\n\\n/// ```ignore\\n\\n/// use std::simd::u64x2;\\n\\n/// use self::crypto::sha2::{K64X2, sha512rnd};\\n\\n///\\n\\n/// fn rounds4(state: &mut [u64; 8], work: &mut [u64x2], t: usize) {\\n\\n/// let [a, b, c, d, e, f, g, h]: [u64; 8] = *state;\\n\\n///\\n\\n/// // this is to illustrate the data order\\n\\n/// let mut ae = u64x2(a, e);\\n\\n/// let mut bf = u64x2(b, f);\\n\\n/// let mut cg = u64x2(c, g);\\n\\n/// let mut dh = u64x2(d, h);\\n\\n/// let u64x2(w1, w0) = K64X2[2*t] + work[2*t];\\n\\n/// let u64x2(w3, w2) = K64X2[2*t + 1] + work[2*t + 1];\\n\\n///\\n\\n/// // this is the core expression\\n\\n/// dh = sha512rnd(ae, bf, cg, dh, w0);\\n\\n/// cg = sha512rnd(dh, ae, bf, cg, w1);\\n\\n/// bf = sha512rnd(cg, dh, ae, bf, w2);\\n\\n/// ae = sha512rnd(bf, cg, dh, ae, w3);\\n\\n///\\n\\n/// *state = [ae.0, bf.0, cg.0, dh.0,\\n\\n/// ae.1, bf.1, cg.1, dh.1];\\n\\n/// }\\n\\n/// ```\\n\\n///\\n\\n/// instead of 4 rounds of:\\n\\n///\\n\\n/// ```ignore\\n\\n/// fn round(state: &mut [u64; 8], w: &mut [u64], t: usize) {\\n\\n/// let [a, b, c, mut d, e, f, g, mut h]: [u64; 8] = *state;\\n\\n///\\n\\n/// h += big_sigma1!(e) + choose!(e, f, g) + K64[t] + w[t]; d += h;\\n\\n/// h += big_sigma0!(a) + majority!(a, b, c);\\n\\n///\\n\\n/// *state = [h, a, b, c, d, e, f, g];\\n\\n/// }\\n\\n/// ```\\n\\n///\\n\\npub fn sha512_digest_block(state: &mut [u64; 8], block: &[u8/*; 128*/]) {\\n\\n assert_eq!(block.len(), BLOCK_LEN*8);\\n\\n let mut block2 = [0u64; BLOCK_LEN];\\n\\n read_u64v_be(&mut block2[..], block);\\n\\n sha512_digest_block_u64(state, &block2);\\n\\n}\\n\\n\\n\\n// A structure that represents that state of a digest computation for the SHA-2 512 family\\n\\n// of digest functions\\n\",\n \"file_path\": \"cryptoxide/src/sha2.rs\",\n \"rank\": 43,\n \"score\": 261340.70948434496\n },\n {\n \"content\": \"/// Process a block with the SHA-256 algorithm. (See more...)\\n\\n///\\n\\n/// Internally, this uses functions which resemble the new Intel SHA instruction sets,\\n\\n/// and so it's data locality properties may improve performance. However, to benefit\\n\\n/// the most from this implementation, replace these functions with x86 intrinsics to\\n\\n/// get a possible speed boost.\\n\\n///\\n\\n/// # Implementation\\n\\n///\\n\\n/// The `Sha256` algorithm is implemented with functions that resemble the new\\n\\n/// Intel SHA instruction set extensions. These intructions fall into two categories:\\n\\n/// message schedule calculation, and the message block 64-round digest calculation.\\n\\n/// The schedule-related instructions allow 4 rounds to be calculated as:\\n\\n///\\n\\n/// ```ignore\\n\\n/// use std::simd::u32x4;\\n\\n/// use self::crypto::sha2::{\\n\\n/// sha256msg1,\\n\\n/// sha256msg2,\\n\\n/// sha256load\\n\\n/// };\\n\\n///\\n\\n/// fn schedule4_data(work: &mut [u32x4], w: &[u32]) {\\n\\n///\\n\\n/// // this is to illustrate the data order\\n\\n/// work[0] = u32x4(w[3], w[2], w[1], w[0]);\\n\\n/// work[1] = u32x4(w[7], w[6], w[5], w[4]);\\n\\n/// work[2] = u32x4(w[11], w[10], w[9], w[8]);\\n\\n/// work[3] = u32x4(w[15], w[14], w[13], w[12]);\\n\\n/// }\\n\\n///\\n\\n/// fn schedule4_work(work: &mut [u32x4], t: usize) {\\n\\n///\\n\\n/// // this is the core expression\\n\\n/// work[t] = sha256msg2(sha256msg1(work[t - 4], work[t - 3]) +\\n\\n/// sha256load(work[t - 2], work[t - 1]),\\n\\n/// work[t - 1])\\n\\n/// }\\n\\n/// ```\\n\\n///\\n\\n/// instead of 4 rounds of:\\n\\n///\\n\\n/// ```ignore\\n\\n/// fn schedule_work(w: &mut [u32], t: usize) {\\n\\n/// w[t] = sigma1!(w[t - 2]) + w[t - 7] + sigma0!(w[t - 15]) + w[t - 16];\\n\\n/// }\\n\\n/// ```\\n\\n///\\n\\n/// and the digest-related instructions allow 4 rounds to be calculated as:\\n\\n///\\n\\n/// ```ignore\\n\\n/// use std::simd::u32x4;\\n\\n/// use self::crypto::sha2::{K32X4,\\n\\n/// sha256rnds2,\\n\\n/// sha256swap\\n\\n/// };\\n\\n///\\n\\n/// fn rounds4(state: &mut [u32; 8], work: &mut [u32x4], t: usize) {\\n\\n/// let [a, b, c, d, e, f, g, h]: [u32; 8] = *state;\\n\\n///\\n\\n/// // this is to illustrate the data order\\n\\n/// let mut abef = u32x4(a, b, e, f);\\n\\n/// let mut cdgh = u32x4(c, d, g, h);\\n\\n/// let temp = K32X4[t] + work[t];\\n\\n///\\n\\n/// // this is the core expression\\n\\n/// cdgh = sha256rnds2(cdgh, abef, temp);\\n\\n/// abef = sha256rnds2(abef, cdgh, sha256swap(temp));\\n\\n///\\n\\n/// *state = [abef.0, abef.1, cdgh.0, cdgh.1,\\n\\n/// abef.2, abef.3, cdgh.2, cdgh.3];\\n\\n/// }\\n\\n/// ```\\n\\n///\\n\\n/// instead of 4 rounds of:\\n\\n///\\n\\n/// ```ignore\\n\\n/// fn round(state: &mut [u32; 8], w: &mut [u32], t: usize) {\\n\\n/// let [a, b, c, mut d, e, f, g, mut h]: [u32; 8] = *state;\\n\\n///\\n\\n/// h += big_sigma1!(e) + choose!(e, f, g) + K32[t] + w[t]; d += h;\\n\\n/// h += big_sigma0!(a) + majority!(a, b, c);\\n\\n///\\n\\n/// *state = [h, a, b, c, d, e, f, g];\\n\\n/// }\\n\\n/// ```\\n\\n///\\n\\n/// **NOTE**: It is important to note, however, that these instructions are not implemented\\n\\n/// by any CPU (at the time of this writing), and so they are emulated in this library\\n\\n/// until the instructions become more common, and gain support in LLVM (and GCC, etc.).\\n\\n///\\n\\npub fn sha256_digest_block(state: &mut [u32; 8], block: &[u8/*; 64*/]) {\\n\\n assert_eq!(block.len(), BLOCK_LEN*4);\\n\\n let mut block2 = [0u32; BLOCK_LEN];\\n\\n read_u32v_be(&mut block2[..], block);\\n\\n sha256_digest_block_u32(state, &block2);\\n\\n}\\n\\n\\n\\n/// Not an intrinsic, but works like an unaligned load.\\n\",\n \"file_path\": \"cryptoxide/src/sha2.rs\",\n \"rank\": 44,\n \"score\": 261340.50736123143\n },\n {\n \"content\": \"// Create an epoch from a complete set of previously fetched blocks on\\n\\n// disk.\\n\\nfn maybe_create_epoch(storage: &storage::Storage, epoch_id: EpochId, last_block: &HeaderHash)\\n\\n{\\n\\n if epoch_exists(&storage.config, epoch_id).unwrap() { return }\\n\\n\\n\\n info!(\\\"Packing epoch {}\\\", epoch_id);\\n\\n\\n\\n let mut epoch_writer_state = EpochWriterState {\\n\\n epoch_id,\\n\\n writer: storage::pack::packwriter_init(&storage.config).unwrap(),\\n\\n write_start_time: SystemTime::now(),\\n\\n blobs_to_delete: vec![]\\n\\n };\\n\\n\\n\\n append_blocks_to_epoch_reverse(&storage, &mut epoch_writer_state, last_block);\\n\\n\\n\\n finish_epoch(storage, epoch_writer_state);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"exe-common/src/sync.rs\",\n \"rank\": 45,\n \"score\": 260322.87966057422\n },\n {\n \"content\": \"fn template_create_temp(prefix: &str, suffix: &str) -> String {\\n\\n let v1 : u64 = rand::random();\\n\\n let v2 : u64 = rand::random();\\n\\n format!(\\\"{}{}{}{}\\\", prefix, v1, v2, suffix)\\n\\n}\\n\\n\\n\\nimpl TmpFile {\\n\\n pub fn create(mut path: PathBuf) -> io::Result<Self> {\\n\\n let filename = template_create_temp(\\\".tmp.\\\", \\\"\\\");\\n\\n path.push(filename);\\n\\n\\n\\n OpenOptions::new()\\n\\n .write(true)\\n\\n .read(true)\\n\\n .create_new(true)\\n\\n .open(&path)\\n\\n .map(|file| TmpFile { file: file, path: path })\\n\\n }\\n\\n\\n\\n pub fn render_permanent(&self, path: &PathBuf) -> io::Result<()> {\\n\",\n \"file_path\": \"storage/src/utils/tmpfile.rs\",\n \"rank\": 46,\n \"score\": 260000.1401298967\n },\n {\n \"content\": \"/// Process a block with the SHA-512 algorithm.\\n\\npub fn sha512_digest_block_u64(state: &mut [u64; 8], block: &[u64; 16]) {\\n\\n let k = &K64X2;\\n\\n\\n\\n macro_rules! schedule {\\n\\n ($v0:expr, $v1:expr, $v4:expr, $v5:expr, $v7:expr) => (\\n\\n sha512_schedule_x2($v0, $v1, sha512load($v4, $v5), $v7)\\n\\n )\\n\\n }\\n\\n\\n\\n macro_rules! rounds4 {\\n\\n ($ae:ident, $bf:ident, $cg:ident, $dh:ident, $wk0:expr, $wk1:expr) => {\\n\\n {\\n\\n let u64x2(u, t) = $wk0;\\n\\n let u64x2(w, v) = $wk1;\\n\\n\\n\\n $dh = sha512_digest_round($ae, $bf, $cg, $dh, t);\\n\\n $cg = sha512_digest_round($dh, $ae, $bf, $cg, u);\\n\\n $bf = sha512_digest_round($cg, $dh, $ae, $bf, v);\\n\\n $ae = sha512_digest_round($bf, $cg, $dh, $ae, w);\\n\\n }\\n\",\n \"file_path\": \"cryptoxide/src/sha2.rs\",\n \"rank\": 47,\n \"score\": 258169.8302006979\n },\n {\n \"content\": \"/// Process a block with the SHA-256 algorithm.\\n\\npub fn sha256_digest_block_u32(state: &mut [u32; 8], block: &[u32; 16]) {\\n\\n let k = &K32X4;\\n\\n\\n\\n macro_rules! schedule {\\n\\n ($v0:expr, $v1:expr, $v2:expr, $v3:expr) => (\\n\\n sha256msg2(sha256msg1($v0, $v1) + sha256load($v2, $v3), $v3)\\n\\n )\\n\\n }\\n\\n\\n\\n macro_rules! rounds4 {\\n\\n ($abef:ident, $cdgh:ident, $rest:expr) => {\\n\\n {\\n\\n $cdgh = sha256_digest_round_x2($cdgh, $abef, $rest);\\n\\n $abef = sha256_digest_round_x2($abef, $cdgh, sha256swap($rest));\\n\\n }\\n\\n }\\n\\n }\\n\\n\\n\\n let mut abef = u32x4(state[0],\\n\\n state[1],\\n\",\n \"file_path\": \"cryptoxide/src/sha2.rs\",\n \"rank\": 48,\n \"score\": 258169.83020069788\n },\n {\n \"content\": \"/// decode from base58 the given input\\n\\n///\\n\\n/// # Example\\n\\n///\\n\\n/// ```\\n\\n/// use cardano::util::base58;\\n\\n///\\n\\n/// let encoded = b\\\"TcgsE5dzphUWfjcb9i5\\\";\\n\\n/// let decoded = b\\\"Hello World...\\\";\\n\\n///\\n\\n/// assert_eq!(decoded, base58::decode_bytes(encoded).unwrap().as_slice());\\n\\n/// ```\\n\\npub fn decode_bytes(input: &[u8]) -> Result<Vec<u8>> {\\n\\n base_decode(ALPHABET, input)\\n\\n}\\n\\n\\n\\n#[cfg(test)]\\n\\nmod tests {\\n\\n fn encode(input: &[u8], expected: &str) {\\n\\n let encoded = super::encode(input);\\n\\n assert_eq!(encoded, expected);\\n\\n }\\n\\n fn decode(expected: &[u8], input: &str) {\\n\\n let decoded = super::decode(input).unwrap();\\n\\n assert_eq!(decoded.as_slice(), expected);\\n\\n }\\n\\n\\n\\n #[test]\\n\\n fn test_vector_1() {\\n\\n encode(b\\\"\\\\0\\\\0\\\\0\\\\0\\\", \\\"11111\\\");\\n\\n decode(b\\\"\\\\0\\\\0\\\\0\\\\0\\\", \\\"11111\\\");\\n\\n }\\n\",\n \"file_path\": \"cardano/src/util/base58.rs\",\n \"rank\": 49,\n \"score\": 258135.75734271656\n },\n {\n \"content\": \"fn file_read_hash(mut file: &fs::File) -> BlockHash {\\n\\n let mut buf = [0u8;HASH_SIZE];\\n\\n file.read_exact(&mut buf).unwrap();\\n\\n buf\\n\\n}\\n\\n\\n\",\n \"file_path\": \"storage/src/containers/indexfile.rs\",\n \"rank\": 50,\n \"score\": 256283.9200340224\n },\n {\n \"content\": \"fn base_decode(alphabet_s: &str, input: &[u8]) -> Result<Vec<u8>> {\\n\\n let alphabet = alphabet_s.as_bytes();\\n\\n let base = alphabet.len() as u32;\\n\\n\\n\\n let mut bytes : Vec<u8> = vec![0];\\n\\n let zcount = input.iter().take_while(|x| **x == alphabet[0]).count();\\n\\n\\n\\n for i in zcount..input.len() {\\n\\n let value = match alphabet.iter().position(|&x| x == input[i]) {\\n\\n Some(idx) => idx,\\n\\n None => return Err(Error::UnknownSymbol(i))\\n\\n };\\n\\n let mut carry = value as u32;\\n\\n for j in 0..bytes.len() {\\n\\n carry = carry + (bytes[j] as u32 * base);\\n\\n bytes[j] = carry as u8;\\n\\n carry = carry >> 8;\\n\\n }\\n\\n\\n\\n while carry > 0 {\\n\",\n \"file_path\": \"cardano/src/util/base58.rs\",\n \"rank\": 51,\n \"score\": 255847.43235053337\n },\n {\n \"content\": \"pub fn read_index_fanout(storage_config: &super::StorageConfig, pack: &super::PackHash) -> Result<indexfile::Lookup> {\\n\\n let mut file = open_index(storage_config, pack);\\n\\n let lookup = indexfile::Lookup::read_from_file(&mut file)?;\\n\\n Ok(lookup)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"storage/src/pack.rs\",\n \"rank\": 52,\n \"score\": 252735.83287136996\n },\n {\n \"content\": \"// calculate FNV1, FNV1a\\n\\npub fn hash(content: &[u8]) -> (u64, u64) {\\n\\n let mut hash = FNV_OFFSET_BASIS;\\n\\n let mut hash2 = FNV_OFFSET_BASIS;\\n\\n for c in content {\\n\\n // FNV1\\n\\n hash = hash.wrapping_mul(FNV_PRIME);\\n\\n hash ^= *c as u64;\\n\\n\\n\\n // FNV1a\\n\\n hash2 = *c as u64;\\n\\n hash2 = hash2.wrapping_mul(FNV_PRIME);\\n\\n }\\n\\n (hash, hash2)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"storage/src/utils/bloom.rs\",\n \"rank\": 53,\n \"score\": 240716.24635348818\n },\n {\n \"content\": \"#[allow(dead_code)]\\n\\npub fn new(size: usize) -> Vec<u8> {\\n\\n let v : Vec<u8> = repeat(0).take(size as usize).collect();\\n\\n v\\n\\n}\\n\\n\\n\",\n \"file_path\": \"storage/src/utils/bitmap.rs\",\n \"rank\": 54,\n \"score\": 240424.61506395627\n },\n {\n \"content\": \"pub fn validate_epochid(v: &&str) -> Option<EpochId> {\\n\\n if ! v.chars().all(|c| c.is_digit(10)) {\\n\\n None\\n\\n } else {\\n\\n Some(v.parse::<EpochId>().unwrap())\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"hermes/src/handlers/common.rs\",\n \"rank\": 55,\n \"score\": 237453.131114812\n },\n {\n \"content\": \"pub fn is_set(bitmap: &[u8], content: &[u8]) -> bool {\\n\\n let (v1,v2,v3) = addr3(bitmap.len() * 8, content);\\n\\n bitmap::get_bit(bitmap, v1) && bitmap::get_bit(bitmap, v2) && bitmap::get_bit(bitmap, v3)\\n\\n}\",\n \"file_path\": \"storage/src/utils/bloom.rs\",\n \"rank\": 56,\n \"score\": 233916.43120664754\n },\n {\n \"content\": \"pub fn remove_tag<S: AsRef<str>>(storage: &super::Storage, name: &S) {\\n\\n let p = storage.config.get_tag_filepath(name);\\n\\n fs::remove_file(p).unwrap()\\n\\n}\\n\",\n \"file_path\": \"storage/src/tag.rs\",\n \"rank\": 57,\n \"score\": 233765.33506705542\n },\n {\n \"content\": \"pub fn set(bitmap: &mut [u8], content: &[u8]) {\\n\\n let (v1,v2,v3) = addr3(bitmap.len() * 8, content);\\n\\n\\n\\n bitmap::set_bit_to(bitmap, v1, true);\\n\\n bitmap::set_bit_to(bitmap, v2, true);\\n\\n bitmap::set_bit_to(bitmap, v3, true);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"storage/src/utils/bloom.rs\",\n \"rank\": 58,\n \"score\": 233050.48730195692\n },\n {\n \"content\": \"pub fn get_bit(data: &[u8], bit: usize) -> bool {\\n\\n let (byte_addr, bit_addr) = addr(bit);\\n\\n let val = (data[byte_addr] >> bit_addr.get_shifter()) & 0x1;\\n\\n val == 0x1\\n\\n}\\n\\n\\n\",\n \"file_path\": \"storage/src/utils/bitmap.rs\",\n \"rank\": 59,\n \"score\": 230504.29577939294\n },\n {\n \"content\": \"pub fn write_offset(buf: &mut [u8], sz: Offset) {\\n\\n buf[0] = (sz >> 56) as u8;\\n\\n buf[1] = (sz >> 48) as u8;\\n\\n buf[2] = (sz >> 40) as u8;\\n\\n buf[3] = (sz >> 32) as u8;\\n\\n buf[4] = (sz >> 24) as u8;\\n\\n buf[5] = (sz >> 16) as u8;\\n\\n buf[6] = (sz >> 8) as u8;\\n\\n buf[7] = sz as u8;\\n\\n}\\n\\n\\n\",\n \"file_path\": \"storage/src/utils/serialize.rs\",\n \"rank\": 60,\n \"score\": 229640.75154101662\n },\n {\n \"content\": \"// write size to the mutable buffer in big endian\\n\\npub fn write_size(buf: &mut [u8], sz: Size) {\\n\\n buf[0] = (sz >> 24) as u8;\\n\\n buf[1] = (sz >> 16) as u8;\\n\\n buf[2] = (sz >> 8) as u8;\\n\\n buf[3] = sz as u8;\\n\\n}\\n\\n\\n\",\n \"file_path\": \"storage/src/utils/serialize.rs\",\n \"rank\": 61,\n \"score\": 229640.7515410166\n },\n {\n \"content\": \"/// exported as a convenient function to test the implementation of\\n\\n/// [`Serialize`](./se/trait.Serialize.html) and\\n\\n/// [`Deserialize`](./de/trait.Deserialize.html).\\n\\n///\\n\\npub fn test_encode_decode<V: Sized+PartialEq+Serialize+Deserialize>(v: &V) -> Result<bool> {\\n\\n let bytes = Serialize::serialize(v, se::Serializer::new_vec())?.finalize();\\n\\n\\n\\n let mut raw = de::RawCbor::from(&bytes);\\n\\n let v_ = Deserialize::deserialize(&mut raw)?;\\n\\n\\n\\n Ok(v == &v_)\\n\\n}\\n\",\n \"file_path\": \"cbor_event/src/lib.rs\",\n \"rank\": 62,\n \"score\": 228882.15099875373\n },\n {\n \"content\": \"pub fn write<S: AsRef<str>>(storage: &super::Storage, name: &S, content: &[u8]) {\\n\\n let mut tmp_file = super::tmpfile_create_type(storage, super::StorageFileType::Tag);\\n\\n tmp_file.write_all(hex::encode(content).as_bytes()).unwrap();\\n\\n\\n\\n let path = storage.config.get_tag_filepath(name);\\n\\n let dir = PathBuf::from(path);\\n\\n\\n\\n match dir.parent() {\\n\\n None => {},\\n\\n Some(parent) => {\\n\\n if parent != storage.config.get_filetype_dir(super::StorageFileType::Tag) {\\n\\n fs::create_dir_all(parent).unwrap()\\n\\n }\\n\\n }\\n\\n };\\n\\n\\n\\n tmp_file.render_permanent(&storage.config.get_tag_filepath(name)).unwrap();\\n\\n}\\n\\n\\n\",\n \"file_path\": \"storage/src/tag.rs\",\n \"rank\": 63,\n \"score\": 226529.29173833178\n },\n {\n \"content\": \"pub fn packreader_init(cfg: &super::StorageConfig, packhash: &super::PackHash) -> packfile::Reader<fs::File> {\\n\\n packfile::Reader::init(cfg.get_pack_filepath(packhash)).unwrap()\\n\\n}\\n\\n\\n\",\n \"file_path\": \"storage/src/pack.rs\",\n \"rank\": 64,\n \"score\": 224909.67676577502\n },\n {\n \"content\": \"pub fn packwriter_finalize(cfg: &super::StorageConfig, writer: packfile::Writer) -> (super::PackHash, indexfile::Index) {\\n\\n let (tmpfile, packhash, index) = writer.finalize().unwrap();\\n\\n let path = cfg.get_pack_filepath(&packhash);\\n\\n tmpfile.render_permanent(&path).unwrap();\\n\\n (packhash, index)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"storage/src/pack.rs\",\n \"rank\": 65,\n \"score\": 224909.67676577502\n },\n {\n \"content\": \"// TODO proper error handling\\n\\nfn previous_block(storage: &Storage, block: &Block) -> Block {\\n\\n let prev_hash = block.get_header().get_previous_header();\\n\\n let blk = blob::read(&storage, &header_to_blockhash(&prev_hash)).unwrap().decode().unwrap();\\n\\n blk\\n\\n}\\n\\n\\n\",\n \"file_path\": \"storage/src/block/iter.rs\",\n \"rank\": 66,\n \"score\": 224094.92356731734\n },\n {\n \"content\": \"type Result<T> = result::Result<T, Error>;\\n\\n\\n\\n/// Object which lifetime is bound to a file in the filesystem\\n\\n///\\n\\n/// i.e.: we are creating a `<filename>.LOCK` file along the given `filename`\\n\\n/// in order to mark the file as locked. This is in order to prevent concurrent\\n\\n/// access to a file that may be modified and which data may be corrupted if\\n\\n/// concurrent writes happen.\\n\\n///\\n\\n/// The lock will be free when it drops out of scope.\\n\\n///\\n\\n#[derive(Debug)]\\n\\npub struct Lock {\\n\\n // the process ID associated to the current loc\\n\\n id: u32,\\n\\n // the path to the locked file\\n\\n path: PathBuf\\n\\n}\\n\\n\\n\\nimpl Lock {\\n\",\n \"file_path\": \"storage/src/utils/lock.rs\",\n \"rank\": 67,\n \"score\": 212876.05729886383\n },\n {\n \"content\": \"/// Synchronize the local blockchain stored in `storage` with the\\n\\n/// network `net`. That is, fetch all blocks between the most recent\\n\\n/// block we received (as denoted by the `HEAD` tag) and the network's\\n\\n/// current tip. Blocks will be packed into epochs on disk as soon\\n\\n/// they're stable.\\n\\n///\\n\\n/// If `sync_once` is set to `true`, then this function will\\n\\n/// synchronize once and then return. If it's set to `false`, then\\n\\n/// this function will run forever, continuously synchronizing to the\\n\\n/// network's latest tip. (In the case of the Hermes backend, it will\\n\\n/// sleep for some time between polling for new tips; with the native\\n\\n/// protocol backend, it will block waiting for the server to send us\\n\\n/// new tip announcements.)\\n\\npub fn net_sync<A: Api>(\\n\\n net: &mut A,\\n\\n net_cfg: &net::Config,\\n\\n storage: &storage::Storage,\\n\\n sync_once: bool)\\n\\n -> Result<()>\\n\\n{\\n\\n // recover and print the TIP of the network\\n\\n let mut tip_header = net.get_tip()?;\\n\\n\\n\\n loop {\\n\\n\\n\\n net_sync_to(net, net_cfg, storage, &tip_header)?;\\n\\n\\n\\n if sync_once { break }\\n\\n\\n\\n tip_header = net.wait_for_new_tip(&tip_header.compute_hash())?;\\n\\n }\\n\\n\\n\\n Ok(())\\n\\n}\\n\\n\\n\",\n \"file_path\": \"exe-common/src/sync.rs\",\n \"rank\": 68,\n \"score\": 212564.6102458308\n },\n {\n \"content\": \"pub fn send_msg_getblocks(from: &HeaderHash, to: &HeaderHash) -> Message {\\n\\n let dat = se::Serializer::new_vec().write_array(cbor_event::Len::Len(2)).unwrap()\\n\\n .serialize(from).unwrap()\\n\\n .serialize(to).unwrap()\\n\\n .finalize();\\n\\n (MsgType::MsgGetBlocks as u8, dat)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"protocol/src/packet.rs\",\n \"rank\": 69,\n \"score\": 211932.19361551\n },\n {\n \"content\": \"/// Write a u32 into a vector, which must be 4 bytes long. The value is written in big-endian\\n\\n/// format.\\n\\npub fn write_u32_be(dst: &mut [u8], mut input: u32) {\\n\\n assert!(dst.len() == 4);\\n\\n input = input.to_be();\\n\\n unsafe {\\n\\n let tmp = &input as *const _ as *const u8;\\n\\n ptr::copy_nonoverlapping(tmp, dst.get_unchecked_mut(0), 4);\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"cryptoxide/src/cryptoutil.rs\",\n \"rank\": 70,\n \"score\": 208024.29224947462\n },\n {\n \"content\": \"/// Write a u64 into a vector, which must be 8 bytes long. The value is written in big-endian\\n\\n/// format.\\n\\npub fn write_u64_be(dst: &mut[u8], mut input: u64) {\\n\\n assert!(dst.len() == 8);\\n\\n input = input.to_be();\\n\\n unsafe {\\n\\n let tmp = &input as *const _ as *const u8;\\n\\n ptr::copy_nonoverlapping(tmp, dst.get_unchecked_mut(0), 8);\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"cryptoxide/src/cryptoutil.rs\",\n \"rank\": 71,\n \"score\": 208024.29224947462\n },\n {\n \"content\": \"pub fn sc_reduce(s: &mut [u8]) {\\n\\n let mut s0: i64 = 2097151 & load_3i(s);\\n\\n let mut s1: i64 = 2097151 & (load_4i(&s[2..6]) >> 5);\\n\\n let mut s2: i64 = 2097151 & (load_3i(&s[5..8]) >> 2);\\n\\n let mut s3: i64 = 2097151 & (load_4i(&s[7..11]) >> 7);\\n\\n let mut s4: i64 = 2097151 & (load_4i(&s[10..14]) >> 4);\\n\\n let mut s5: i64 = 2097151 & (load_3i(&s[13..16]) >> 1);\\n\\n let mut s6: i64 = 2097151 & (load_4i(&s[15..19]) >> 6);\\n\\n let mut s7: i64 = 2097151 & (load_3i(&s[18..21]) >> 3);\\n\\n let mut s8: i64 = 2097151 & load_3i(&s[21..24]);\\n\\n let mut s9: i64 = 2097151 & (load_4i(&s[23..27]) >> 5);\\n\\n let mut s10: i64 = 2097151 & (load_3i(&s[26..29]) >> 2);\\n\\n let mut s11: i64 = 2097151 & (load_4i(&s[28..32]) >> 7);\\n\\n let mut s12: i64 = 2097151 & (load_4i(&s[31..35]) >> 4);\\n\\n let mut s13: i64 = 2097151 & (load_3i(&s[34..37]) >> 1);\\n\\n let mut s14: i64 = 2097151 & (load_4i(&s[36..40]) >> 6);\\n\\n let mut s15: i64 = 2097151 & (load_3i(&s[39..42]) >> 3);\\n\\n let mut s16: i64 = 2097151 & load_3i(&s[42..45]);\\n\\n let mut s17: i64 = 2097151 & (load_4i(&s[44..48]) >> 5);\\n\\n let s18: i64 = 2097151 & (load_3i(&s[47..50]) >> 2);\\n\",\n \"file_path\": \"cryptoxide/src/curve25519.rs\",\n \"rank\": 72,\n \"score\": 207546.49190657554\n },\n {\n \"content\": \"#[inline]\\n\\npub fn zero(dst: &mut [u8]) {\\n\\n unsafe {\\n\\n ptr::write_bytes(dst.as_mut_ptr(), 0, dst.len());\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"cryptoxide/src/cryptoutil.rs\",\n \"rank\": 73,\n \"score\": 207546.49190657554\n },\n {\n \"content\": \"/// encode bytes into an hexadecimal string\\n\\n///\\n\\n/// # Example\\n\\n///\\n\\n/// ```\\n\\n/// use cardano::util::hex::{Error, encode};\\n\\n///\\n\\n/// let example = b\\\"some bytes\\\";\\n\\n///\\n\\n/// assert_eq!(\\\"736f6d65206279746573\\\", encode(example));\\n\\n/// ```\\n\\npub fn encode(input: &[u8]) -> String {\\n\\n let mut v = Vec::with_capacity(input.len() * 2);\\n\\n for &byte in input.iter() {\\n\\n v.push(ALPHABET[(byte >> 4) as usize]);\\n\\n v.push(ALPHABET[(byte & 0xf) as usize]);\\n\\n }\\n\\n\\n\\n unsafe {\\n\\n String::from_utf8_unchecked(v)\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"cardano/src/util/hex.rs\",\n \"rank\": 74,\n \"score\": 205767.85729574302\n },\n {\n \"content\": \"/// encode in base58 the given input\\n\\n///\\n\\n/// # Example\\n\\n///\\n\\n/// ```\\n\\n/// use cardano::util::base58;\\n\\n///\\n\\n/// let encoded = r\\\"TcgsE5dzphUWfjcb9i5\\\";\\n\\n/// let decoded = b\\\"Hello World...\\\";\\n\\n///\\n\\n/// assert_eq!(encoded, base58::encode(decoded));\\n\\n/// ```\\n\\npub fn encode(input: &[u8]) -> String {\\n\\n // unsafe to unwrap the result of `String::from_utf8` as the given\\n\\n // returned bytes are valid within the base58 alphabet (they are all ASCII7)\\n\\n String::from_utf8(\\n\\n base_encode(ALPHABET, input)\\n\\n ).unwrap()\\n\\n}\\n\\n\\n\",\n \"file_path\": \"cardano/src/util/base58.rs\",\n \"rank\": 75,\n \"score\": 205758.9162657597\n },\n {\n \"content\": \"/// Write a u32 into a vector, which must be 4 bytes long. The value is written in little-endian\\n\\n/// format.\\n\\npub fn write_u32_le(dst: &mut[u8], mut input: u32) {\\n\\n assert!(dst.len() == 4);\\n\\n input = input.to_le();\\n\\n unsafe {\\n\\n let tmp = &input as *const _ as *const u8;\\n\\n ptr::copy_nonoverlapping(tmp, dst.get_unchecked_mut(0), 4);\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"cryptoxide/src/cryptoutil.rs\",\n \"rank\": 76,\n \"score\": 205697.14575881025\n },\n {\n \"content\": \"/// Write a u64 into a vector, which must be 8 bytes long. The value is written in little-endian\\n\\n/// format.\\n\\npub fn write_u64_le(dst: &mut[u8], mut input: u64) {\\n\\n assert!(dst.len() == 8);\\n\\n input = input.to_le();\\n\\n unsafe {\\n\\n let tmp = &input as *const _ as *const u8;\\n\\n ptr::copy_nonoverlapping(tmp, dst.get_unchecked_mut(0), 8);\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"cryptoxide/src/cryptoutil.rs\",\n \"rank\": 77,\n \"score\": 205697.14575881025\n },\n {\n \"content\": \"/// zero the given slice.\\n\\n///\\n\\n/// We assume the compiler won't optimise out the call to this function\\n\\npub fn zero(to_zero: &mut [u8]) {\\n\\n\\n\\n // the unsafety of this call is bounded to the existence of the pointer\\n\\n // and the accuracy of the length of the array.\\n\\n //\\n\\n // since to_zero existence is bound to live at least as long as the call\\n\\n // of this function and that we use the length (in bytes) of the given\\n\\n // slice, this call is safe.\\n\\n unsafe {\\n\\n ::std::ptr::write_bytes(to_zero.as_mut_ptr(), 0, to_zero.len())\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"cardano/src/util/securemem.rs\",\n \"rank\": 78,\n \"score\": 204626.6114821655\n },\n {\n \"content\": \"pub fn open_index(storage_config: &super::StorageConfig, pack: &super::PackHash) -> fs::File {\\n\\n fs::File::open(storage_config.get_index_filepath(pack)).unwrap()\\n\\n}\\n\\n\\n\",\n \"file_path\": \"storage/src/pack.rs\",\n \"rank\": 79,\n \"score\": 200806.63477164047\n },\n {\n \"content\": \"pub fn send_msg_subscribe(keep_alive: bool) -> Message {\\n\\n let value = if keep_alive { 43 } else { 42 };\\n\\n let dat = se::Serializer::new_vec().write_unsigned_integer(value).unwrap().finalize();\\n\\n (MsgType::MsgSubscribe as u8, dat)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"protocol/src/packet.rs\",\n \"rank\": 80,\n \"score\": 200098.56289269705\n },\n {\n \"content\": \"fn duration_print(d: Duration) -> String {\\n\\n format!(\\\"{}.{:03} seconds\\\", d.as_secs(), d.subsec_millis())\\n\\n}\\n\\n\\n\",\n \"file_path\": \"exe-common/src/sync.rs\",\n \"rank\": 81,\n \"score\": 197753.14975768418\n },\n {\n \"content\": \"fn base_encode(alphabet_s: &str, input: &[u8]) -> Vec<u8> {\\n\\n let alphabet = alphabet_s.as_bytes();\\n\\n let base = alphabet.len() as u32;\\n\\n\\n\\n let mut digits = vec![0 as u8];\\n\\n for input in input.iter() {\\n\\n let mut carry = input.clone() as u32;\\n\\n for j in 0..digits.len() {\\n\\n carry = carry + ((digits[j] as u32) << 8);\\n\\n digits[j] = (carry % base) as u8;\\n\\n carry = carry / base;\\n\\n }\\n\\n\\n\\n while carry > 0 {\\n\\n digits.push((carry % base) as u8);\\n\\n carry = carry / base;\\n\\n }\\n\\n }\\n\\n\\n\\n let mut string = vec![];\\n\",\n \"file_path\": \"cardano/src/util/base58.rs\",\n \"rank\": 82,\n \"score\": 195939.3441886178\n },\n {\n \"content\": \"pub fn sum_coins<I>(coin_iter: I) -> Result<Coin>\\n\\n where I: Iterator<Item = Coin>\\n\\n{\\n\\n coin_iter.fold(Coin::new(0), |acc, ref c| acc.and_then(|v| v + *c))\\n\\n}\\n\",\n \"file_path\": \"cardano/src/coin.rs\",\n \"rank\": 83,\n \"score\": 195465.12538875284\n },\n {\n \"content\": \"// Hmac uses two keys derived from the provided key - one by xoring every byte with 0x36 and another\\n\\n// with 0x5c.\\n\\nfn create_keys<D: Digest>(digest: &mut D, key: &[u8]) -> (Vec<u8>, Vec<u8>) {\\n\\n let mut i_key = expand_key(digest, key);\\n\\n let mut o_key = i_key.clone();\\n\\n derive_key(&mut i_key, 0x36);\\n\\n derive_key(&mut o_key, 0x5c);\\n\\n (i_key, o_key)\\n\\n}\\n\\n\\n\\nimpl <D: Digest> Hmac<D> {\\n\\n /**\\n\\n * Create a new Hmac instance.\\n\\n *\\n\\n * # Arguments\\n\\n * * digest - The Digest to use.\\n\\n * * key - The key to use.\\n\\n *\\n\\n */\\n\\n pub fn new(mut digest: D, key: &[u8]) -> Hmac<D> {\\n\\n let (i_key, o_key) = create_keys(&mut digest, key);\\n\\n digest.input(&i_key[..]);\\n\",\n \"file_path\": \"cryptoxide/src/hmac.rs\",\n \"rank\": 84,\n \"score\": 194425.6263877159\n },\n {\n \"content\": \"/// Read a vector of bytes into a vector of u64s. The values are read in big-endian format.\\n\\npub fn read_u64v_be(dst: &mut[u64], input: &[u8]) {\\n\\n assert!(dst.len() * 8 == input.len());\\n\\n unsafe {\\n\\n let mut x: *mut u64 = dst.get_unchecked_mut(0);\\n\\n let mut y: *const u8 = input.get_unchecked(0);\\n\\n for _ in 0..dst.len() {\\n\\n let mut tmp: u64 = mem::uninitialized();\\n\\n ptr::copy_nonoverlapping(y, &mut tmp as *mut _ as *mut u8, 8);\\n\\n *x = u64::from_be(tmp);\\n\\n x = x.offset(1);\\n\\n y = y.offset(8);\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"cryptoxide/src/cryptoutil.rs\",\n \"rank\": 85,\n \"score\": 192639.41420826723\n },\n {\n \"content\": \"/// Read a vector of bytes into a vector of u32s. The values are read in big-endian format.\\n\\npub fn read_u32v_be(dst: &mut[u32], input: &[u8]) {\\n\\n assert!(dst.len() * 4 == input.len());\\n\\n unsafe {\\n\\n let mut x: *mut u32 = dst.get_unchecked_mut(0);\\n\\n let mut y: *const u8 = input.get_unchecked(0);\\n\\n for _ in 0..dst.len() {\\n\\n let mut tmp: u32 = mem::uninitialized();\\n\\n ptr::copy_nonoverlapping(y, &mut tmp as *mut _ as *mut u8, 4);\\n\\n *x = u32::from_be(tmp);\\n\\n x = x.offset(1);\\n\\n y = y.offset(4);\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"cryptoxide/src/cryptoutil.rs\",\n \"rank\": 86,\n \"score\": 192639.41420826723\n },\n {\n \"content\": \"pub fn secure_memset(dst: &mut [u8], val: u8) {\\n\\n for i in 0..dst.len() {\\n\\n dst[i] = val;\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"cryptoxide/src/util.rs\",\n \"rank\": 87,\n \"score\": 192634.2141556674\n },\n {\n \"content\": \"#[inline]\\n\\npub fn copy_memory(src: &[u8], dst: &mut [u8]) {\\n\\n assert!(dst.len() >= src.len());\\n\\n unsafe {\\n\\n let srcp = src.as_ptr();\\n\\n let dstp = dst.as_mut_ptr();\\n\\n ptr::copy_nonoverlapping(srcp, dstp, src.len());\\n\\n }\\n\\n}\\n\\n\\n\\n/// Zero all bytes in dst\\n\",\n \"file_path\": \"cryptoxide/src/cryptoutil.rs\",\n \"rank\": 88,\n \"score\": 192634.2141556674\n },\n {\n \"content\": \"/// Compare two vectors using a fixed number of operations. If the two vectors are not of equal\\n\\n/// length, the function returns false immediately.\\n\\npub fn fixed_time_eq(lhs: &[u8], rhs: &[u8]) -> bool {\\n\\n if lhs.len() != rhs.len() {\\n\\n false\\n\\n } else {\\n\\n let mut v = 0;\\n\\n for i in 0..lhs.len() {\\n\\n let a = lhs[i];\\n\\n let b = rhs[i];\\n\\n v = v | (a ^ b);\\n\\n };\\n\\n v == 0\\n\\n }\\n\\n}\\n\\n\\n\\n#[cfg(test)]\\n\\nmod test {\\n\\n use util::fixed_time_eq;\\n\\n\\n\\n #[test]\\n\\n pub fn test_fixed_time_eq() {\\n\",\n \"file_path\": \"cryptoxide/src/util.rs\",\n \"rank\": 89,\n \"score\": 190948.56914168334\n },\n {\n \"content\": \"/// Try to reverse the scramble operation, using\\n\\n/// the first `IV_SIZE` bytes as IV, and the rest as the shielded input.\\n\\npub fn unscramble(password: &[u8], input: &[u8]) -> Vec<u8>{\\n\\n assert!(input.len() > IV_SIZE);\\n\\n\\n\\n let out_sz = input.len() - IV_SIZE;\\n\\n\\n\\n let mut out = Vec::with_capacity(out_sz);\\n\\n for _ in 0..out_sz {\\n\\n out.push(0);\\n\\n }\\n\\n\\n\\n gen(&input[0..IV_SIZE], password, &mut out[0..out_sz]);\\n\\n for i in 0..out_sz {\\n\\n out[i] = out[i] ^ input[IV_SIZE+i];\\n\\n }\\n\\n out\\n\\n}\\n\\n\\n\\n\\n\\n#[cfg(test)]\\n\\nmod tests {\\n\\n //use paperwallet::{scramble,unscramble};\\n\\n use paperwallet;\\n\\n\\n\",\n \"file_path\": \"cardano/src/paperwallet.rs\",\n \"rank\": 90,\n \"score\": 190412.560957146\n },\n {\n \"content\": \"/// Read a vector of bytes into a vector of u64s. The values are read in little-endian format.\\n\\npub fn read_u64v_le(dst: &mut[u64], input: &[u8]) {\\n\\n assert!(dst.len() * 8 == input.len());\\n\\n unsafe {\\n\\n let mut x: *mut u64 = dst.get_unchecked_mut(0);\\n\\n let mut y: *const u8 = input.get_unchecked(0);\\n\\n for _ in 0..dst.len() {\\n\\n let mut tmp: u64 = mem::uninitialized();\\n\\n ptr::copy_nonoverlapping(y, &mut tmp as *mut _ as *mut u8, 8);\\n\\n *x = u64::from_le(tmp);\\n\\n x = x.offset(1);\\n\\n y = y.offset(8);\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"cryptoxide/src/cryptoutil.rs\",\n \"rank\": 91,\n \"score\": 190080.34520304832\n },\n {\n \"content\": \"/// Write a vector of u64s into a vector of bytes. The values are written in little-endian format.\\n\\npub fn write_u64v_le(dst: &mut[u8], input: &[u64]) {\\n\\n assert!(dst.len() == 8 * input.len());\\n\\n unsafe {\\n\\n let mut x: *mut u8 = dst.get_unchecked_mut(0);\\n\\n let mut y: *const u64 = input.get_unchecked(0);\\n\\n for _ in 0..input.len() {\\n\\n let tmp = (*y).to_le();\\n\\n ptr::copy_nonoverlapping(&tmp as *const _ as *const u8, x, 8);\\n\\n x = x.offset(8);\\n\\n y = y.offset(1);\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"cryptoxide/src/cryptoutil.rs\",\n \"rank\": 92,\n \"score\": 190080.34520304832\n },\n {\n \"content\": \"/// Write a vector of u32s into a vector of bytes. The values are written in little-endian format.\\n\\npub fn write_u32v_le (dst: &mut[u8], input: &[u32]) {\\n\\n assert!(dst.len() == 4 * input.len());\\n\\n unsafe {\\n\\n let mut x: *mut u8 = dst.get_unchecked_mut(0);\\n\\n let mut y: *const u32 = input.get_unchecked(0);\\n\\n for _ in 0..input.len() {\\n\\n let tmp = (*y).to_le();\\n\\n ptr::copy_nonoverlapping(&tmp as *const _ as *const u8, x, 4);\\n\\n x = x.offset(4);\\n\\n y = y.offset(1);\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"cryptoxide/src/cryptoutil.rs\",\n \"rank\": 93,\n \"score\": 190080.34520304832\n },\n {\n \"content\": \"/// Read a vector of bytes into a vector of u32s. The values are read in little-endian format.\\n\\npub fn read_u32v_le(dst: &mut[u32], input: &[u8]) {\\n\\n assert!(dst.len() * 4 == input.len());\\n\\n unsafe {\\n\\n let mut x: *mut u32 = dst.get_unchecked_mut(0);\\n\\n let mut y: *const u8 = input.get_unchecked(0);\\n\\n for _ in 0..dst.len() {\\n\\n let mut tmp: u32 = mem::uninitialized();\\n\\n ptr::copy_nonoverlapping(y, &mut tmp as *mut _ as *mut u8, 4);\\n\\n *x = u32::from_le(tmp);\\n\\n x = x.offset(1);\\n\\n y = y.offset(4);\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"cryptoxide/src/cryptoutil.rs\",\n \"rank\": 94,\n \"score\": 190080.34520304832\n },\n {\n \"content\": \"/// Check that a file has a header denoting the expected file type and\\n\\n/// has a version in the specified range. Return the version.\\n\\npub fn check_header(\\n\\n file: &mut Read,\\n\\n expected_file_type: FileType,\\n\\n min_version: Version,\\n\\n max_version: Version)\\n\\n -> Result<Version>\\n\\n{\\n\\n let mut hdr_buf = [0u8;HEADER_SIZE];\\n\\n file.read_exact(&mut hdr_buf)?;\\n\\n\\n\\n if &hdr_buf[0..MAGIC_SIZE] != MAGIC {\\n\\n return Err(StorageError::MissingMagic);\\n\\n }\\n\\n\\n\\n let file_type = read_size(&hdr_buf[8..12]);\\n\\n let version = read_size(&hdr_buf[12..16]);\\n\\n\\n\\n if file_type != expected_file_type {\\n\\n return Err(StorageError::WrongFileType(expected_file_type, file_type));\\n\\n }\\n\",\n \"file_path\": \"storage/src/utils/magic.rs\",\n \"rank\": 95,\n \"score\": 188042.82717775033\n },\n {\n \"content\": \"pub fn pbkdf2<M: Mac>(mac: &mut M, salt: &[u8], c: u32, output: &mut [u8]) {\\n\\n assert!(c > 0);\\n\\n\\n\\n let os = mac.output_bytes();\\n\\n\\n\\n // A temporary storage array needed by calculate_block. This is really only necessary if c > 1.\\n\\n // Most users of pbkdf2 should use a value much larger than 1, so, this allocation should almost\\n\\n // always be necessary. A big exception is Scrypt. However, this allocation is unlikely to be\\n\\n // the bottleneck in Scrypt performance.\\n\\n let mut scratch: Vec<u8> = repeat(0).take(os).collect();\\n\\n\\n\\n let mut idx: u32 = 0;\\n\\n\\n\\n for chunk in output.chunks_mut(os) {\\n\\n // The block index starts at 1. So, this is supposed to run on the first execution.\\n\\n idx = idx.checked_add(1).expect(\\\"PBKDF2 size limit exceeded.\\\");\\n\\n\\n\\n if chunk.len() == os {\\n\\n calculate_block(mac, salt, c, idx, &mut scratch, chunk);\\n\\n } else {\\n\\n let mut tmp: Vec<u8> = repeat(0).take(os).collect();\\n\\n calculate_block(mac, salt, c, idx, &mut scratch[..], &mut tmp[..]);\\n\\n let chunk_len = chunk.len();\\n\\n copy_memory(&tmp[..chunk_len], chunk);\\n\\n }\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"cryptoxide/src/pbkdf2.rs\",\n \"rank\": 96,\n \"score\": 186089.2546017369\n },\n {\n \"content\": \"// Return the chain of block headers starting at from's next block\\n\\n// and terminating at to, unless this range represent a number\\n\\n// of blocks greater than the limit imposed by the node we're talking to.\\n\\npub fn find_earliest_epoch(\\n\\n storage: &storage::Storage,\\n\\n minimum_epochid: block::EpochId,\\n\\n start_epochid: block::EpochId,\\n\\n) -> Option<(block::EpochId, PackHash)> {\\n\\n let mut epoch_id = start_epochid;\\n\\n loop {\\n\\n match storage::tag::read_hash(storage, &storage::tag::get_epoch_tag(epoch_id)) {\\n\\n None => match storage::epoch::epoch_read_pack(&storage.config, epoch_id).ok() {\\n\\n None => {}\\n\\n Some(h) => {\\n\\n return Some((epoch_id, h));\\n\\n }\\n\\n },\\n\\n Some(h) => {\\n\\n info!(\\\"latest known epoch found is {}\\\", epoch_id);\\n\\n return Some((epoch_id, h.into()));\\n\\n }\\n\\n }\\n\\n\\n\\n if epoch_id > minimum_epochid {\\n\\n epoch_id -= 1\\n\\n } else {\\n\\n return None;\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"exe-common/src/utils.rs\",\n \"rank\": 97,\n \"score\": 185549.12237378623\n },\n {\n \"content\": \"pub fn txaux_serialize_size(tx: &Tx, in_witnesses: &Vec<TxInWitness>) -> usize {\\n\\n // TODO don't actually produce any bytes, but instead just count.\\n\\n // we don't expect error here, a real counter would not error..\\n\\n let ser = cbor_event::se::Serializer::new_vec();\\n\\n let bytes = txaux_serialize(tx, in_witnesses, ser).unwrap().finalize();\\n\\n bytes.len()\\n\\n}\\n\\n\\n\\n#[derive(Debug, Clone)]\\n\\npub struct TxProof {\\n\\n pub number: u32,\\n\\n pub root: Blake2b256,\\n\\n pub witnesses_hash: Blake2b256,\\n\\n}\\n\\nimpl TxProof {\\n\\n pub fn new(number: u32, root: Blake2b256, witnesses_hash: Blake2b256) -> Self {\\n\\n TxProof {\\n\\n number: number,\\n\\n root: root,\\n\\n witnesses_hash: witnesses_hash\\n\",\n \"file_path\": \"cardano/src/tx.rs\",\n \"rank\": 98,\n \"score\": 183035.296297493\n },\n {\n \"content\": \"/// Verify that a signature is valid for a given message for an associated public key\\n\\npub fn verify(message: &[u8], public_key: &[u8], signature: &[u8]) -> bool {\\n\\n assert!(public_key.len() == PUBLIC_KEY_LENGTH, \\\"Public key should be {} bytes long!\\\", PUBLIC_KEY_LENGTH);\\n\\n assert!(signature.len() == SIGNATURE_LENGTH, \\\"signature should be {} bytes long!\\\", SIGNATURE_LENGTH);\\n\\n\\n\\n if check_s_lt_l(&signature[32..64]) {\\n\\n return false;\\n\\n }\\n\\n\\n\\n let a = match GeP3::from_bytes_negate_vartime(public_key) {\\n\\n Some(g) => g,\\n\\n None => { return false; }\\n\\n };\\n\\n let mut d = 0;\\n\\n for pk_byte in public_key.iter() {\\n\\n d |= *pk_byte;\\n\\n }\\n\\n if d == 0 {\\n\\n return false;\\n\\n }\\n\\n\\n\",\n \"file_path\": \"cryptoxide/src/ed25519.rs\",\n \"rank\": 99,\n \"score\": 182908.8852603216\n }\n]","isConversational":false}}},{"rowIdx":2371,"cells":{"lang":{"kind":"string","value":"Rust"},"file_path":{"kind":"string","value":"argonautica-rs/examples/example_serde.rs"},"repo_name":{"kind":"string","value":"philipahlberg/argonautica"},"commit":{"kind":"string","value":"bd9d7cb0f10dcf9a92f8b2e913b7116c1f10099d"},"file_code":{"kind":"string","value":"extern crate argonautica;\nextern crate failure;\nextern crate serde;\nextern crate serde_json;\n\nuse argonautica::{Hasher, Verifier};\n\nfn serialize_hasher() -> Result<String, failure::Error> {\n let additional_data = [1u8, 2, 3, 4];\n let salt = [1u8, 2, 3, 4, 5, 6, 7, 8];\n let mut hasher = Hasher::default();\n hasher\n .with_additional_data(&additional_data[..])\n .with_password(\"P@ssw0rd\") \n .with_salt(&salt[..])\n .with_secret_key(\"secret\"); \n let j = serde_json::to_string_pretty(&hasher)?;\n println!(\"*** Serialized Hasher ***\");\n println!(\"{}\\n\", &j);\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n Ok(j)\n}\n\nfn deserialize_hasher(j: &str) -> Result<argonautica::Hasher, failure::Error> {\n let hasher: Hasher = serde_json::from_str(&j)?;\n println!(\"*** Deserialized Hasher ***\");\n println!(\"{:#?}\\n\", &hasher);\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n Ok(hasher)\n}\n\nfn serialize_verifier() -> Result<String, failure::Error> {\n let additional_data = [1u8, 2, 3, 4];\n let mut verifier = Verifier::default();\n verifier\n .with_additional_data(&additional_data[..])\n .with_hash(\"$argon2id$v=19$m=4096,t=128,p=2$c29tZXNhbHQ$WwD2/wGGTuw7u4BW8sLM0Q\")\n .with_password(\"P@ssw0rd\") \n .with_secret_key(\"secret\"); \n let j = serde_json::to_string_pretty(&verifier)?;\n println!(\"*** Serialized Verifier ***\");\n println!(\"{}\\n\", &j);\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n Ok(j)\n}\n\nfn deserialize_verifier(j: &str) -> Result<argonautica::Verifier, failure::Error> {\n let verifier: Verifier = serde_json::from_str(&j)?;\n println!(\"*** Deserialized Verifier ***\");\n println!(\"{:#?}\\n\", &verifier);\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n Ok(verifier)\n}\n\nfn main() -> Result<(), failure::Error> {\n let j = serialize_hasher()?;\n let _ = deserialize_hasher(&j)?;\n\n let j = serialize_verifier()?;\n let _ = deserialize_verifier(&j)?;\n Ok(())\n}\n"},"prefix":{"kind":"string","value":"extern crate argonautica;\nextern crate failure;\nextern crate serde;\nextern crate serde_json;\n\nuse argonautica::{Hasher, Verifier};\n\nfn serialize_hasher() -> Result<String, failure::Error> {\n let additional_data = [1u8, 2, 3, 4];\n let salt = [1u8, 2, 3, 4, 5, 6, 7, 8];\n let mut hasher = Hasher::default();\n hasher\n .with_additional_data(&additional_data[..])\n .with_password(\"P@ssw0rd\") \n .with_salt(&salt[..])\n .with_secret_key(\"secret\"); \n let j = serde_json::to_string_pretty(&hasher)?;\n println!(\"*** Serialized Hasher ***\");\n println!(\"{}\\n\", &j);\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n Ok(j)\n}\n\nfn deserialize_hasher(j: &str) -> Result<argonautica::Hasher, failure::Error> {\n let hasher: Hasher = serde_json::from_str(&j)?;\n println!(\"*** Deserialized Hasher ***\");\n println!(\"{:#?}\\n\", &hasher);\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n Ok(hasher)\n}\n\n"},"suffix":{"kind":"string","value":"\n\nfn deserialize_verifier(j: &str) -> Result<argonautica::Verifier, failure::Error> {\n let verifier: Verifier = serde_json::from_str(&j)?;\n println!(\"*** Deserialized Verifier ***\");\n println!(\"{:#?}\\n\", &verifier);\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n Ok(verifier)\n}\n\nfn main() -> Result<(), failure::Error> {\n let j = serialize_hasher()?;\n let _ = deserialize_hasher(&j)?;\n\n let j = serialize_verifier()?;\n let _ = deserialize_verifier(&j)?;\n Ok(())\n}\n"},"middle":{"kind":"string","value":"fn serialize_verifier() -> Result<String, failure::Error> {\n let additional_data = [1u8, 2, 3, 4];\n let mut verifier = Verifier::default();\n verifier\n .with_additional_data(&additional_data[..])\n .with_hash(\"$argon2id$v=19$m=4096,t=128,p=2$c29tZXNhbHQ$WwD2/wGGTuw7u4BW8sLM0Q\")\n .with_password(\"P@ssw0rd\") \n .with_secret_key(\"secret\"); \n let j = serde_json::to_string_pretty(&verifier)?;\n println!(\"*** Serialized Verifier ***\");\n println!(\"{}\\n\", &j);\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n Ok(j)\n}"},"strategy":{"kind":"string","value":"function_block-function_prefixed"},"context_items":{"kind":"list like","value":[{"content":"fn bench_crates(c: &mut Criterion) {\n\n // argon2rs\n\n let hasher = argon2rs::Argon2::new(\n\n /* passes */ DEFAULT_ITERATIONS,\n\n /* lanes */ default_lanes(),\n\n /* kib */ DEFAULT_MEMORY_SIZE,\n\n /* variant */ argon2rs::Variant::Argon2i,\n\n )\n\n .unwrap();\n\n let argon2rs = Fun::new(\"argon2rs\", move |b, _| {\n\n b.iter(|| {\n\n let mut out = [0u8; DEFAULT_HASH_LEN as usize];\n\n\n\n let password = PASSWORD.as_bytes();\n\n\n\n let mut rng = OsRng::new().unwrap();\n\n let mut salt = [0u8; DEFAULT_SALT_LEN as usize];\n\n rng.fill_bytes(&mut salt);\n\n\n\n hasher.hash(\n","file_path":"argonautica-rs/benches/bench_crates.rs","rank":4,"score":150432.2087319208},{"content":"fn h0(_hasher: &mut Hasher) -> Result<[u8; 72], Error> {\n\n unimplemented!();\n\n}\n","file_path":"argonautica-rs/src/backend/rust/core/mod.rs","rank":5,"score":137391.12123706387},{"content":"fn bench_crates(c: &mut Criterion) {\n\n // argonautica\n\n let mut hasher = argonautica::Hasher::fast_but_insecure();\n\n hasher.with_password(DOCUMENT);\n\n let argonautica = Fun::new(\"argonautica\", move |b, _| {\n\n b.iter(|| {\n\n let _ = hasher.hash().unwrap();\n\n })\n\n });\n\n\n\n // md5\n\n let md5 = Fun::new(\"md5\", move |b, _| {\n\n b.iter(|| {\n\n let _ = md5::compute(DOCUMENT.as_bytes());\n\n });\n\n });\n\n\n\n // sha256\n\n let sha256 = Fun::new(\"sha256\", move |b, _| {\n\n b.iter(|| {\n","file_path":"argonautica-rs/benches/bench_fast_but_insecure.rs","rank":6,"score":136956.57147666826},{"content":"fn bench_threads(c: &mut Criterion) {\n\n c.bench_function_over_inputs(\n\n \"bench_threads\",\n\n |b, &&threads| {\n\n let bench = Bench {\n\n hasher: None,\n\n iterations: DEFAULT_ITERATIONS,\n\n memory_size: DEFAULT_MEMORY_SIZE,\n\n threads,\n\n }\n\n .setup();\n\n b.iter(|| bench.clone().run());\n\n },\n\n &THREADS,\n\n );\n\n}\n\n\n\ncriterion_group! {\n\n name = benches;\n\n config = Criterion::default().sample_size(SAMPLE_SIZE);\n\n targets = bench_threads,\n\n}\n\ncriterion_main!(benches);\n","file_path":"argonautica-rs/benches/bench_threads.rs","rank":8,"score":105914.03027892095},{"content":"fn bench_inputs(c: &mut Criterion) {\n\n c.bench_function_over_inputs(\n\n \"bench_inputs\",\n\n |b, &input| {\n\n let iterations = input.iterations();\n\n let memory_size = input.memory_size();\n\n let bench = Bench {\n\n hasher: None,\n\n iterations,\n\n memory_size,\n\n threads: num_cpus::get_physical() as u32,\n\n }\n\n .setup();\n\n b.iter(|| bench.clone().run());\n\n },\n\n &INPUTS,\n\n );\n\n}\n\n\n\ncriterion_group! {\n\n name = benches;\n\n config = Criterion::default().sample_size(SAMPLE_SIZE);\n\n targets = bench_inputs,\n\n}\n\ncriterion_main!(benches);\n","file_path":"argonautica-rs/benches/bench_inputs.rs","rank":9,"score":105914.03027892095},{"content":"fn run_c(exe: &str, dir: &Path, args: &[&str]) -> Vec<u8> {\n\n let output = Command::new(exe)\n\n .args(args)\n\n .current_dir(dir)\n\n .output()\n\n .unwrap();\n\n if !output.status.success() {\n\n panic!(\n\n \"\\nC executable failed:\\nstdout: {}stderr: {}\",\n\n String::from_utf8(output.stdout).unwrap(),\n\n String::from_utf8(output.stderr).unwrap(),\n\n )\n\n }\n\n output.stderr\n\n}\n\n\n","file_path":"argonautica-rs/tests/tests.rs","rank":10,"score":103809.74834363932},{"content":"fn main() -> Result<(), failure::Error> {\n\n let temp = tempfile::tempdir()?;\n\n let temp_dir = temp.path();\n\n let temp_dir_str = temp_dir.to_str().unwrap();\n\n\n\n let blamka_header = if IS_SIMD {\n\n \"phc-winner-argon2/src/blake2/blamka-round-opt.h\"\n\n } else {\n\n \"phc-winner-argon2/src/blake2/blamka-round-ref.h\"\n\n };\n\n for header_path_str in &[\n\n \"phc-winner-argon2/include/argon2.h\",\n\n \"phc-winner-argon2/src/core.h\",\n\n \"phc-winner-argon2/src/encoding.h\",\n\n \"phc-winner-argon2/src/thread.h\",\n\n \"phc-winner-argon2/src/blake2/blake2-impl.h\",\n\n \"phc-winner-argon2/src/blake2/blake2.h\",\n\n blamka_header,\n\n ] {\n\n let header_path = Path::new(*header_path_str);\n","file_path":"argonautica-rs/build.rs","rank":11,"score":92683.88889200032},{"content":"fn main() -> Result<(), failure::Error> {\n\n let mut hasher = Hasher::default();\n\n let hash = hasher\n\n .with_password(\"P@ssw0rd\")\n\n .with_secret_key(\n\n \"\\\n\n secret key that you should really store in \\\n\n an environment variable instead of in code, \\\n\n but this is just an example\\\n\n \",\n\n )\n\n .hash()?;\n\n\n\n println!(\"{}\", &hash);\n\n // 👆 prints a hash, which will be random since the default Hasher uses a random salt\n\n\n\n let mut verifier = Verifier::default();\n\n let is_valid = verifier\n\n .with_hash(&hash)\n\n .with_password(\"P@ssw0rd\")\n","file_path":"argonautica-rs/examples/example_very_simple.rs","rank":12,"score":88349.68656462249},{"content":"fn main() -> Result<(), failure::Error> {\n\n let secret_key = load_secret_key()?;\n\n let mut hasher = Hasher::default();\n\n hasher\n\n .configure_hash_len(32)\n\n .configure_iterations(192)\n\n .configure_lanes(1)\n\n .configure_memory_size(2u32.pow(12))\n\n .configure_password_clearing(true)\n\n .configure_secret_key_clearing(false)\n\n .configure_threads(1)\n\n .configure_variant(Variant::Argon2id)\n\n .configure_version(Version::_0x13)\n\n .with_salt(Salt::random(16))\n\n .with_secret_key(&secret_key);\n\n\n\n let mut dictionary = HashMap::new();\n\n for password in &[\"P@ssw0rd\", \"Hello world!\", \"123456\", \"😊\"] {\n\n let hash = hasher.with_password(password.to_string()).hash()?;\n\n println!(\"{}\", &hash);\n","file_path":"argonautica-rs/examples/example_custom.rs","rank":13,"score":88349.68656462249},{"content":"fn main() -> Result<(), failure::Error> {\n\n let secret_key = load_secret_key()?;\n\n let mut hasher = Hasher::default();\n\n let hash = hasher\n\n .with_password(\"P@ssw0rd\")\n\n .with_secret_key(&secret_key)\n\n .hash()?;\n\n println!(\"{}\", &hash);\n\n\n\n let mut verifier = Verifier::default();\n\n let is_valid = verifier\n\n .with_hash(&hash)\n\n .with_password(\"P@ssw0rd\")\n\n .with_secret_key(&secret_key)\n\n .verify()?;\n\n\n\n assert!(is_valid);\n\n Ok(())\n\n}\n","file_path":"argonautica-rs/examples/example_simple.rs","rank":14,"score":88349.68656462249},{"content":"fn main() -> Result<(), failure::Error> {\n\n let salt = Salt::random(SALT_LEN);\n\n let secret_key =\n\n SecretKey::from_base64_encoded(\"t9nGEsDxjWtJYdYeExdB6/HU0vg+rT6czv6HSjVjZng=\")?;\n\n let threads = num_cpus::get();\n\n for memory_size in &MEMORY_SIZES {\n\n for iterations in &ITERATIONS {\n\n let mut hasher = Hasher::default();\n\n hasher\n\n .configure_hash_len(HASH_LEN)\n\n .configure_iterations(*iterations)\n\n .configure_lanes(threads as u32)\n\n .configure_memory_size(*memory_size)\n\n .configure_threads(threads as u32)\n\n .configure_variant(VARIANT)\n\n .configure_version(VERSION)\n\n .with_password(PASSWORD)\n\n .with_salt(&salt)\n\n .with_secret_key(&secret_key);\n\n let now = Instant::now();\n","file_path":"argonautica-rs/examples/calibrate_timing.rs","rank":15,"score":88349.68656462249},{"content":"fn main() -> Result<(), failure::Error> {\n\n let secret_key = load_secret_key()?;\n\n\n\n let mut hasher = Hasher::default();\n\n let mut verifier = Verifier::default();\n\n\n\n let future = hasher\n\n .with_password(\"P@ssw0rd\")\n\n .with_secret_key(&secret_key)\n\n .hash_non_blocking()\n\n .and_then(|hash| {\n\n println!(\"{}\", &hash);\n\n verifier\n\n .with_hash(&hash)\n\n .with_password(\"P@ssw0rd\")\n\n .with_secret_key(&secret_key)\n\n .verify_non_blocking()\n\n })\n\n .and_then(|is_valid| {\n\n assert!(is_valid);\n\n Ok(())\n\n })\n\n .map_err(|e| e.into());\n\n\n\n future.wait()\n\n}\n","file_path":"argonautica-rs/examples/example_non_blocking.rs","rank":16,"score":86363.89151205108},{"content":"fn main() -> Result<(), failure::Error> {\n\n let base64_encoded_secret_key = utils::generate_random_base64_encoded_string(32)?;\n\n println!(\"{}\", &base64_encoded_secret_key);\n\n Ok(())\n\n}\n","file_path":"argonautica-rs/examples/generate_secret_key.rs","rank":17,"score":86363.89151205108},{"content":"class Hasher:\n\n \"\"\"\n\n A class that knows how to hash\n\n \"\"\"\n\n\n\n __slots__ = [\n\n 'additional_data',\n\n 'backend',\n\n 'hash_len',\n\n 'iterations',\n\n 'lanes',\n\n 'memory_size',\n\n 'salt',\n\n 'secret_key',\n\n 'threads',\n\n 'variant',\n\n 'version'\n\n ]\n\n\n\n def __init__(\n\n self,\n\n *,\n\n secret_key: Union[bytes, str, None],\n\n\n\n additional_data: Union[bytes, str, None] = None,\n\n backend: Backend = DEFAULT_BACKEND,\n\n hash_len: int = DEFAULT_HASH_LEN,\n\n iterations: int = DEFAULT_ITERATIONS,\n\n lanes: int = DEFAULT_LANES,\n\n memory_size: int = DEFAULT_MEMORY_SIZE,\n\n salt: Union[bytes, RandomSalt, str] = DEFAULT_SALT,\n\n threads: int = DEFAULT_THREADS,\n\n variant: Variant = DEFAULT_VARIANT,\n\n version: Version = DEFAULT_VERSION\n\n ) -> None:\n\n self.additional_data = additional_data\n\n self.salt = salt\n\n self.secret_key = secret_key\n\n self.backend = backend\n\n self.hash_len = hash_len\n\n self.iterations = iterations\n\n self.lanes = lanes\n\n self.memory_size = memory_size\n\n self.threads = threads\n\n self.variant = variant\n\n self.version = version\n\n\n\n def hash(\n\n self,\n\n *,\n\n password: Union[bytes, str],\n\n\n\n additional_data: Union[bytes, str, None, Void] = VOID,\n\n backend: Union[Backend, Void] = VOID,\n\n hash_len: Union[int, Void] = VOID,\n\n iterations: Union[int, Void] = VOID,\n\n lanes: Union[int, Void] = VOID,\n\n memory_size: Union[int, Void] = VOID,\n\n salt: Union[bytes, RandomSalt, str, Void] = VOID,\n\n secret_key: Union[bytes, str, None, Void] = VOID,\n\n threads: Union[int, Void] = VOID,\n\n variant: Union[Variant, Void] = VOID,\n\n version: Union[Version, Void] = VOID\n\n ) -> str:\n\n if isinstance(additional_data, Void):\n\n additional_data = self.additional_data\n\n if isinstance(backend, Void):\n\n backend = self.backend\n\n if isinstance(hash_len, Void):\n\n hash_len = self.hash_len\n\n if isinstance(iterations, Void):\n\n iterations = self.iterations\n\n if isinstance(lanes, Void):\n\n lanes = self.lanes\n\n if isinstance(memory_size, Void):\n\n memory_size = self.memory_size\n\n if isinstance(salt, Void):\n\n salt = self.salt\n\n if isinstance(secret_key, Void):\n\n secret_key = self.secret_key\n\n if isinstance(threads, Void):\n\n threads = self.threads\n\n if isinstance(variant, Void):\n\n variant = self.variant\n\n if isinstance(version, Void):\n\n version = self.version\n\n return hash(\n\n additional_data=additional_data,\n\n backend=backend,\n\n hash_len=hash_len,\n\n iterations=iterations,\n\n lanes=lanes,\n\n memory_size=memory_size,\n\n password=password,\n\n salt=salt,\n\n secret_key=secret_key,\n\n threads=threads,\n\n variant=variant,\n\n version=version\n","file_path":"argonautica-py/argonautica/core/hasher.py","rank":18,"score":83619.90265680093},{"content":"fn validate_threads(threads: u32) -> Result<(), Error> {\n\n if threads == 0 {\n\n return Err(\n\n Error::new(ErrorKind::ThreadsTooFewError).add_context(format!(\"Threads: {}\", threads))\n\n );\n\n }\n\n if threads > 0x00ff_ffff {\n\n return Err(\n\n Error::new(ErrorKind::ThreadsTooManyError).add_context(format!(\"Threads: {}\", threads))\n\n );\n\n }\n\n Ok(())\n\n}\n\n\n\n#[cfg(test)]\n\nmod tests {\n\n use super::*;\n\n\n\n #[test]\n\n fn test_send() {\n","file_path":"argonautica-rs/src/config/hasher_config.rs","rank":19,"score":80443.88805369401},{"content":"fn validate_iterations(iterations: u32) -> Result<(), Error> {\n\n if iterations == 0 {\n\n return Err(Error::new(ErrorKind::IterationsTooFewError)\n\n .add_context(format!(\"Iterations: {}\", iterations)));\n\n }\n\n Ok(())\n\n}\n\n\n","file_path":"argonautica-rs/src/config/hasher_config.rs","rank":20,"score":80443.88805369401},{"content":"fn validate_lanes(lanes: u32) -> Result<(), Error> {\n\n if lanes == 0 {\n\n return Err(\n\n Error::new(ErrorKind::LanesTooFewError).add_context(format!(\"Lanes: {}\", lanes))\n\n );\n\n }\n\n if lanes > 0x00ff_ffff {\n\n return Err(\n\n Error::new(ErrorKind::LanesTooManyError).add_context(format!(\"Lanes: {}\", lanes))\n\n );\n\n }\n\n Ok(())\n\n}\n\n\n","file_path":"argonautica-rs/src/config/hasher_config.rs","rank":21,"score":80443.88805369401},{"content":"fn validate_backend(backend: Backend) -> Result<(), Error> {\n\n match backend {\n\n Backend::C => (),\n\n Backend::Rust => return Err(Error::new(ErrorKind::BackendUnsupportedError)),\n\n }\n\n Ok(())\n\n}\n\n\n","file_path":"argonautica-rs/src/config/hasher_config.rs","rank":22,"score":80443.88805369401},{"content":"fn validate_hash_len(hash_len: u32) -> Result<(), Error> {\n\n if hash_len < 4 {\n\n return Err(Error::new(ErrorKind::HashLenTooShortError)\n\n .add_context(format!(\"Hash len: {}\", hash_len)));\n\n }\n\n Ok(())\n\n}\n\n\n","file_path":"argonautica-rs/src/config/hasher_config.rs","rank":23,"score":77173.42208376409},{"content":"// Helper method to load the secret key from a .env file. Used in `main` below.\n\nfn load_secret_key() -> Result<SecretKey<'static>, failure::Error> {\n\n let dotenv_path = env::current_dir()?.join(\"examples\").join(\"example.env\");\n\n dotenv::from_path(&dotenv_path).map_err(|e| format_err!(\"{}\", e))?;\n\n let base64_encoded_secret_key = env::var(\"SECRET_KEY\")?;\n\n Ok(SecretKey::from_base64_encoded(&base64_encoded_secret_key)?)\n\n}\n\n\n","file_path":"argonautica-rs/examples/example_custom.rs","rank":24,"score":76038.67936723767},{"content":"// Helper method to load the secret key from a .env file. Used in `main` below.\n\nfn load_secret_key() -> Result<SecretKey<'static>, failure::Error> {\n\n let dotenv_path = env::current_dir()?.join(\"examples\").join(\"example.env\");\n\n dotenv::from_path(&dotenv_path).map_err(|e| format_err!(\"{}\", e))?;\n\n let base64_encoded_secret_key = env::var(\"SECRET_KEY\")?;\n\n Ok(SecretKey::from_base64_encoded(&base64_encoded_secret_key)?)\n\n}\n\n\n","file_path":"argonautica-rs/examples/example_simple.rs","rank":25,"score":76038.67936723767},{"content":"// Helper method to load the secret key from a .env file. Used in `main` below.\n\nfn load_secret_key() -> Result<SecretKey<'static>, failure::Error> {\n\n let dotenv_path = env::current_dir()?.join(\"examples\").join(\"example.env\");\n\n dotenv::from_path(&dotenv_path).map_err(|e| format_err!(\"{}\", e))?;\n\n let base64_encoded_secret_key = env::var(\"SECRET_KEY\")?;\n\n Ok(SecretKey::from_base64_encoded(&base64_encoded_secret_key)?)\n\n}\n\n\n","file_path":"argonautica-rs/examples/example_non_blocking.rs","rank":26,"score":74514.5184111809},{"content":" uint8_t* salt;\n","file_path":"argonautica-rs/tests/c/src/test.h","rank":27,"score":74144.95158230896},{"content":" def salt(self, value: Union[bytes, RandomSalt, str]) -> None:\n","file_path":"argonautica-py/argonautica/core/argon2.py","rank":28,"score":73604.21506430957},{"content":" uint8_t *salt; /* salt array */\n","file_path":"argonautica-rs/tests/c/src/argon2/argon2.h","rank":29,"score":73052.50380640617},{"content":" uint8_t salt[BLAKE2B_SALTBYTES]; /* 48 */\n","file_path":"argonautica-rs/tests/c/src/argon2/blake2/blake2.h","rank":30,"score":72019.25747518596},{"content":"fn validate_memory_size(lanes: u32, memory_size: u32) -> Result<(), Error> {\n\n if memory_size < 8 * lanes {\n\n return Err(Error::new(ErrorKind::MemorySizeTooSmallError)\n\n .add_context(format!(\"Lanes: {}. Memory size: {}\", lanes, memory_size)));\n\n }\n\n if !(memory_size.is_power_of_two()) {\n\n return Err(Error::new(ErrorKind::MemorySizeInvalidError)\n\n .add_context(format!(\"Memory size: {}\", memory_size)));\n\n }\n\n Ok(())\n\n}\n\n\n","file_path":"argonautica-rs/src/config/hasher_config.rs","rank":31,"score":71473.86242436315},{"content":"#[test]\n\n#[ignore]\n\nfn test_c_code() {\n\n let build_dir = PathBuf::from(\"tests/c/build\");\n\n build_c(&build_dir);\n\n let flags = [0b00]; // Note: for high level, cannot set flags\n\n let hash_lens = [8, 32];\n\n let iterations = [8, 32];\n\n let lane_threads = [(1, 1), (4, 4)]; // Note: for high level, lanes and threads have to be the same\n\n let memory_sizes = [32, 128];\n\n let password_lens = [8, 32];\n\n let salt_lens = [8, 32];\n\n let variants = [Variant::Argon2d, Variant::Argon2i, Variant::Argon2id];\n\n let versions = [Version::_0x10, Version::_0x13];\n\n for flags in &flags {\n\n for hash_len in &hash_lens {\n\n for iterations in &iterations {\n\n for lane_thread in &lane_threads {\n\n for memory_size in &memory_sizes {\n\n for password_len in &password_lens {\n\n for salt_len in &salt_lens {\n\n for variant in &variants {\n","file_path":"argonautica-rs/tests/tests.rs","rank":32,"score":67971.4283218132},{"content":"#[test]\n\nfn test_integration() {\n\n let build_dir = PathBuf::from(\"tests/c/build\");\n\n build_c(&build_dir);\n\n let additional_data_lens = [0, 32];\n\n let flags = [0b00, 0b01, 0b10, 0b11];\n\n let hash_lens = [8, 32];\n\n let iterations = [8, 16];\n\n let lane_threads = [(1, 1), (4, 4), (4, 1)];\n\n let memory_sizes = [32, 64];\n\n let password_lens = [8, 32];\n\n let salt_lens = [8, 32];\n\n let secret_key_lens = [0, 32];\n\n let variants = [Variant::Argon2d, Variant::Argon2i, Variant::Argon2id];\n\n let versions = [Version::_0x10, Version::_0x13];\n\n for flags in &flags {\n\n for additional_data_len in &additional_data_lens {\n\n for hash_len in &hash_lens {\n\n for iterations in &iterations {\n\n for lane_thread in &lane_threads {\n\n for memory_size in &memory_sizes {\n","file_path":"argonautica-rs/tests/tests.rs","rank":33,"score":67971.4283218132},{"content":"from typing import Union\n\n\n\nfrom argonautica.config import Backend\n\nfrom argonautica.core.ffi import ffi, lib\n\nfrom argonautica.defaults import *\n\nfrom argonautica.utils import Void, VOID\n\n\n\n\n\nclass Verifier:\n\n \"\"\"\n\n A class that knows how to verify\n\n \"\"\"\n\n __slots__ = [\n\n 'additional_data',\n\n 'backend',\n\n 'secret_key',\n\n 'threads'\n\n ]\n\n\n\n def __init__(\n\n self,\n\n *,\n\n secret_key: Union[bytes, str, None],\n\n\n\n additional_data: Union[bytes, str, None] = None,\n\n backend: Backend = DEFAULT_BACKEND,\n\n threads: int = DEFAULT_THREADS\n\n ) -> None:\n\n self.additional_data = additional_data\n\n self.secret_key = secret_key\n\n self.backend = backend\n\n self.threads = threads\n\n\n\n def verify(\n\n self,\n\n *,\n\n hash: str,\n\n password: Union[bytes, str],\n\n\n\n additional_data: Union[bytes, str, None, Void] = VOID,\n\n backend: Union[Backend, Void] = VOID,\n\n secret_key: Union[bytes, str, None, Void] = VOID,\n\n threads: Union[int, Void] = VOID\n\n ) -> bool:\n\n if isinstance(additional_data, Void):\n\n additional_data = self.additional_data\n\n if isinstance(backend, Void):\n\n backend = self.backend\n\n if isinstance(secret_key, Void):\n\n secret_key = self.secret_key\n\n if isinstance(threads, Void):\n\n threads = self.threads\n\n return verify(\n\n additional_data=additional_data,\n\n backend=backend,\n\n hash=hash,\n\n password=password,\n\n secret_key=secret_key,\n\n threads=threads\n\n )\n\n\n\n\n\ndef verify(\n\n *,\n\n hash: str,\n\n password: Union[bytes, str],\n\n secret_key: Union[bytes, str, None],\n\n\n\n additional_data: Union[bytes, str, None] = None,\n\n backend: Backend = DEFAULT_BACKEND,\n\n threads: int = DEFAULT_THREADS\n\n) -> bool:\n\n \"\"\"\n\n A standalone verify function\n\n \"\"\"\n\n # Additional data\n\n if additional_data is None:\n\n additional_data = ffi.NULL\n\n additional_data_len = 0\n\n elif isinstance(additional_data, bytes):\n\n additional_data_len = len(additional_data)\n\n elif isinstance(additional_data, str):\n\n additional_data = additional_data.encode('utf-8')\n\n additional_data_len = len(additional_data)\n\n else:\n\n raise TypeError(\"Type of additional_data must be bytes, str, or None\")\n\n\n\n # Password\n\n if isinstance(password, bytes):\n\n password_len = len(password)\n\n elif isinstance(password, str):\n\n password = password.encode('utf-8')\n\n password_len = len(password)\n\n else:\n\n raise TypeError(\"Type of password must be bytes or str\")\n\n\n\n # Secret key\n\n if secret_key is None:\n\n secret_key = ffi.NULL\n\n secret_key_len = 0\n\n elif isinstance(secret_key, bytes):\n\n secret_key_len = len(secret_key)\n\n elif isinstance(secret_key, str):\n\n secret_key = secret_key.encode('utf-8')\n\n secret_key_len = len(secret_key)\n\n else:\n\n raise TypeError(\"Type of secret_key must be bytes, str, or None\")\n\n\n\n is_valid = ffi.new(\"int*\", 0)\n\n err = lib.argonautica_verify(\n\n is_valid,\n\n additional_data,\n\n additional_data_len,\n\n hash.encode('utf-8'),\n\n password,\n\n password_len,\n\n secret_key,\n\n secret_key_len,\n\n backend.value,\n\n 0,\n\n 0,\n\n threads,\n\n )\n\n if err != lib.ARGONAUTICA_OK:\n\n error_msg_ptr = lib.argonautica_error_msg(err)\n\n error_msg = ffi.string(error_msg_ptr).decode(\"utf-8\")\n\n raise Exception(error_msg)\n\n\n\n if is_valid[0] == 1:\n\n return True\n\n\n\n return False\n","file_path":"argonautica-py/argonautica/core/verifier.py","rank":34,"score":66402.98814955515},{"content":"import base64\n\nfrom typing import Union\n\n\n\nfrom argonautica.config import Backend, Variant, Version\n\nfrom argonautica.core.ffi import ffi, lib\n\nfrom argonautica.data import RandomSalt\n\nfrom argonautica.defaults import *\n\nfrom argonautica.utils import Void, VOID\n\n\n\n\n\nclass Hasher:\n\n \"\"\"\n\n A class that knows how to hash\n\n \"\"\"\n\n\n\n __slots__ = [\n\n 'additional_data',\n\n 'backend',\n\n 'hash_len',\n\n 'iterations',\n\n 'lanes',\n\n 'memory_size',\n\n 'salt',\n\n 'secret_key',\n\n 'threads',\n\n 'variant',\n\n 'version'\n\n ]\n\n\n\n def __init__(\n\n self,\n\n *,\n\n secret_key: Union[bytes, str, None],\n\n\n\n additional_data: Union[bytes, str, None] = None,\n\n backend: Backend = DEFAULT_BACKEND,\n\n hash_len: int = DEFAULT_HASH_LEN,\n\n iterations: int = DEFAULT_ITERATIONS,\n\n lanes: int = DEFAULT_LANES,\n\n memory_size: int = DEFAULT_MEMORY_SIZE,\n\n salt: Union[bytes, RandomSalt, str] = DEFAULT_SALT,\n\n threads: int = DEFAULT_THREADS,\n\n variant: Variant = DEFAULT_VARIANT,\n\n version: Version = DEFAULT_VERSION\n\n ) -> None:\n\n self.additional_data = additional_data\n\n self.salt = salt\n\n self.secret_key = secret_key\n\n self.backend = backend\n\n self.hash_len = hash_len\n\n self.iterations = iterations\n\n self.lanes = lanes\n\n self.memory_size = memory_size\n\n self.threads = threads\n\n self.variant = variant\n\n self.version = version\n\n\n\n def hash(\n\n self,\n\n *,\n\n password: Union[bytes, str],\n\n\n\n additional_data: Union[bytes, str, None, Void] = VOID,\n\n backend: Union[Backend, Void] = VOID,\n\n hash_len: Union[int, Void] = VOID,\n\n iterations: Union[int, Void] = VOID,\n\n lanes: Union[int, Void] = VOID,\n\n memory_size: Union[int, Void] = VOID,\n\n salt: Union[bytes, RandomSalt, str, Void] = VOID,\n\n secret_key: Union[bytes, str, None, Void] = VOID,\n\n threads: Union[int, Void] = VOID,\n\n variant: Union[Variant, Void] = VOID,\n\n version: Union[Version, Void] = VOID\n\n ) -> str:\n\n if isinstance(additional_data, Void):\n\n additional_data = self.additional_data\n\n if isinstance(backend, Void):\n\n backend = self.backend\n\n if isinstance(hash_len, Void):\n\n hash_len = self.hash_len\n\n if isinstance(iterations, Void):\n\n iterations = self.iterations\n\n if isinstance(lanes, Void):\n\n lanes = self.lanes\n\n if isinstance(memory_size, Void):\n\n memory_size = self.memory_size\n\n if isinstance(salt, Void):\n\n salt = self.salt\n\n if isinstance(secret_key, Void):\n\n secret_key = self.secret_key\n\n if isinstance(threads, Void):\n\n threads = self.threads\n\n if isinstance(variant, Void):\n\n variant = self.variant\n\n if isinstance(version, Void):\n\n version = self.version\n\n return hash(\n\n additional_data=additional_data,\n\n backend=backend,\n\n hash_len=hash_len,\n\n iterations=iterations,\n\n lanes=lanes,\n\n memory_size=memory_size,\n\n password=password,\n\n salt=salt,\n\n secret_key=secret_key,\n\n threads=threads,\n\n variant=variant,\n\n version=version\n\n )\n\n\n\n\n\ndef hash(\n\n *,\n\n password: Union[bytes, str],\n\n secret_key: Union[bytes, str, None],\n\n\n\n additional_data: Union[bytes, str, None] = None,\n\n backend: Backend = DEFAULT_BACKEND,\n\n hash_len: int = DEFAULT_HASH_LEN,\n\n iterations: int = DEFAULT_ITERATIONS,\n\n lanes: int = DEFAULT_LANES,\n\n memory_size: int = DEFAULT_MEMORY_SIZE,\n\n salt: Union[bytes, RandomSalt, str] = DEFAULT_SALT,\n\n threads: int = DEFAULT_THREADS,\n\n variant: Variant = DEFAULT_VARIANT,\n\n version: Version = DEFAULT_VERSION\n\n) -> str:\n\n \"\"\"\n\n A standalone hash function\n\n \"\"\"\n\n data = Validator(\n\n additional_data=additional_data,\n\n password=password,\n\n salt=salt,\n\n secret_key=secret_key,\n\n )\n\n encoded_len = lib.argonautica_encoded_len(\n\n hash_len,\n\n iterations,\n\n lanes,\n\n memory_size,\n\n data.salt_len,\n\n variant.value,\n\n )\n\n if encoded_len < 0:\n\n raise Exception(\"Error calculating length of string-encoded hash\")\n\n encoded = ffi.new(\"char[]\", b'\\0'*encoded_len)\n\n err = lib.argonautica_hash(\n\n encoded,\n\n data.additional_data,\n\n data.additional_data_len,\n\n data.password,\n\n data.password_len,\n\n data.salt,\n\n data.salt_len,\n\n data.secret_key,\n\n data.secret_key_len,\n\n backend.value,\n\n hash_len,\n\n iterations,\n\n lanes,\n\n memory_size,\n\n 0,\n\n 0,\n\n threads,\n\n variant.value,\n\n version.value,\n\n )\n\n if err != lib.ARGONAUTICA_OK:\n\n error_msg_ptr = lib.argonautica_error_msg(err)\n\n error_msg = ffi.string(error_msg_ptr).decode(\"utf-8\")\n\n raise Exception(error_msg)\n\n hash = ffi.string(encoded).decode(\"utf-8\")\n\n return hash\n\n\n\n\n\nclass Validator:\n\n def __init__(\n\n self,\n\n *,\n\n additional_data: Union[bytes, str, None],\n\n password: Union[bytes, str],\n\n salt: Union[bytes, RandomSalt, str],\n\n secret_key: Union[bytes, str, None]\n\n ) -> None:\n\n if additional_data is None:\n\n self.additional_data = ffi.NULL\n\n self.additional_data_len = 0\n\n elif isinstance(additional_data, bytes):\n\n self.additional_data = additional_data\n\n self.additional_data_len = len(self.additional_data)\n\n elif isinstance(additional_data, str):\n\n self.additional_data = additional_data.encode('utf-8')\n\n self.additional_data_len = len(self.additional_data)\n\n else:\n\n raise TypeError(\"Type of additional_data must be bytes, str, or None\")\n\n\n\n if isinstance(password, bytes):\n\n self.password = password\n\n self.password_len = len(self.password)\n\n elif isinstance(password, str):\n\n self.password = password.encode(\"utf-8\")\n\n self.password_len = len(self.password)\n\n else:\n\n raise TypeError(\"Type of password must be bytes or str\")\n\n\n\n if isinstance(salt, RandomSalt):\n\n self.salt = ffi.NULL\n\n self.salt_len = salt.len\n\n elif isinstance(salt, bytes):\n\n self.salt = salt\n\n self.salt_len = len(self.salt)\n\n elif isinstance(salt, str):\n\n self.salt = salt.encode('utf-8')\n\n self.salt_len = len(self.salt)\n\n else:\n\n raise TypeError(\"Type of salt must be bytes, RandomSalt, or str\")\n\n\n\n if secret_key is None:\n\n self.secret_key = ffi.NULL\n\n self.secret_key_len = 0\n\n elif isinstance(secret_key, bytes):\n\n self.secret_key = secret_key\n\n self.secret_key_len = len(self.secret_key)\n\n elif isinstance(secret_key, str):\n\n self.secret_key = secret_key.encode('utf-8')\n\n self.secret_key_len = len(self.secret_key)\n\n else:\n\n raise TypeError(\"Type of secret_key must be bytes, str, or None\")\n\n\n\n def __repr__(self) -> str:\n\n return str(self.__dict__)\n","file_path":"argonautica-py/argonautica/core/hasher.py","rank":35,"score":66356.29501657985},{"content":"from argonautica import Verifier\n\n\n\nverifier = Verifier(secret_key='somesecret')\n\nis_valid = verifier.verify(\n\n hash='$argon2id$v=19$m=4096,t=192,p=4$n7F2qAECNLz7En4d9MsC6HIPWKiFZ5BHopIvoF1CBPs$Uk+pYp97ySGgal1OcrKfcA',\n\n password='P@ssw0rd',\n\n)\n\nassert(is_valid)\n","file_path":"argonautica-py/examples/verifier.py","rank":36,"score":62988.21812898883},{"content":"from argonautica import Hasher\n\n\n\nhasher = Hasher(secret_key='somesecret', hash_len=16)\n\nhash = hasher.hash(password='P@ssw0rd')\n\nprint(hash)\n","file_path":"argonautica-py/examples/hasher.py","rank":37,"score":62940.1039446409},{"content":"from argonautica import Hasher\n\nfrom argonautica.data import RandomSalt\n\n\n\nhasher = Hasher(\n\n salt=RandomSalt(16),\n\n # 👆 Here we're using a RandomSalt of length of 16 bytes\n\n # instead of the default, which is a RandomSalt of length 32 bytes\n\n secret_key=\"somesecret\"\n\n)\n\nhash = hasher.hash(password='P@ssw0rd')\n\nprint(hash)\n","file_path":"argonautica-py/examples/random_salt.py","rank":38,"score":62211.04631112622},{"content":"fn test_c(input: &Input) {\n\n let args = generate_args(input);\n\n let args = args.iter().map(|s| (*s).as_ref()).collect::<Vec<&str>>();\n\n\n\n // Run C without simd\n\n let stderr = run_c(\"./test_high_level\", &input.build_dir, &args);\n\n let (encoded1, encoded2, hash1, hash2) = parse_stderr_c(&stderr);\n\n\n\n // Run C with simd\n\n let stderr = run_c(\"./test_high_level_simd\", &input.build_dir, &args);\n\n let (encoded3, encoded4, hash3, hash4) = parse_stderr_c(&stderr);\n\n\n\n // Print results\n\n println!(\"{}\", &encoded1);\n\n println!(\"{}\", &encoded2);\n\n println!(\"{}\", &encoded3);\n\n println!(\"{}\", &encoded4);\n\n println!(\"{:?}\", &hash1);\n\n println!(\"{:?}\", &hash2);\n\n println!(\"{:?}\", &hash3);\n","file_path":"argonautica-rs/tests/tests.rs","rank":39,"score":59119.582714158496},{"content":"fn test(input: &Input) {\n\n let args = generate_args(input);\n\n let args = args.iter().map(|s| (*s).as_ref()).collect::<Vec<&str>>();\n\n\n\n // Run C without simd\n\n let stderr = run_c(\"./test_low_level\", &input.build_dir, &args);\n\n let (encoded1, hash1) = parse_stderr(&stderr);\n\n\n\n // Run C with simd\n\n let stderr = run_c(\"./test_low_level_simd\", &input.build_dir, &args);\n\n let (encoded2, hash2) = parse_stderr(&stderr);\n\n\n\n // Hash Rust\n\n let password_clearing = (input.flags & 0b01) == 1;\n\n let secret_key_clearing = ((input.flags >> 1) & 0b1) == 1;\n\n let mut hasher = Hasher::default();\n\n hasher\n\n .configure_hash_len(input.hash_len)\n\n .configure_iterations(input.iterations)\n\n .configure_lanes(input.lanes)\n","file_path":"argonautica-rs/tests/tests.rs","rank":40,"score":59119.582714158496},{"content":"/// A utility function for generating a cryptographically-secure, random, base64-encoded string\n\n/// based on a custom base64 encoding (e.g. a\n\n/// [url-safe encoding](https://docs.rs/base64/0.9.1/base64/constant.URL_SAFE.html)).\n\n/// A quick glance at this function's source should give you a good idea of what the\n\n/// function is doing.\n\npub fn generate_random_base64_encoded_string_config(\n\n len: u32,\n\n config: base64::Config,\n\n) -> Result<String, Error> {\n\n let mut bytes = vec![0u8; len as usize];\n\n OsRng\n\n .try_fill_bytes(&mut bytes)\n\n .map_err(|e| Error::new(ErrorKind::OsRngError).add_context(format!(\"{}\", e)))?;\n\n let output = base64::encode_config(&bytes, config);\n\n Ok(output)\n\n}\n","file_path":"argonautica-rs/src/utils.rs","rank":41,"score":58009.5742502561},{"content":"#[inline(always)]\n\npub fn default_lanes() -> u32 {\n\n num_cpus::get() as u32\n\n}\n\n\n\n/// Returns the number of logical cores on your machine\n","file_path":"argonautica-rs/src/config/defaults.rs","rank":42,"score":56848.96093079412},{"content":"#[inline(always)]\n\npub fn default_threads() -> u32 {\n\n num_cpus::get() as u32\n\n}\n\n\n\n/// [`Backend::C`](enum.Backend.html#variant.C)\n\npub const DEFAULT_BACKEND: Backend = Backend::C;\n\n\n\n/// `32_u32`\n\npub const DEFAULT_HASH_LEN: u32 = 32;\n\n\n\n/// `192_u32`\n\npub const DEFAULT_ITERATIONS: u32 = 192;\n\n\n\n/// `4096_u32`\n\npub const DEFAULT_MEMORY_SIZE: u32 = 4_096;\n\n\n\n/// `false`\n\npub const DEFAULT_OPT_OUT_OF_SECRET_KEY: bool = false;\n\n\n\n/// `false`\n","file_path":"argonautica-rs/src/config/defaults.rs","rank":43,"score":56848.96093079412},{"content":"fn base64_len(len: u32) -> usize {\n\n let bits = 8 * len as usize;\n\n let chars = bits / 6 + if bits % 6 != 0 { 1 } else { 0 };\n\n chars\n\n}\n\n\n\n/// Function that returns the length of a string-encoded hash (in bytes and including the NULL byte).\n\n/// If an error occurrs, the function returns -1\n\n#[no_mangle]\n\npub extern \"C\" fn argonautica_encoded_len(\n\n hash_len: u32,\n\n iterations: u32,\n\n lanes: u32,\n\n memory_size: u32,\n\n salt_len: u32,\n\n variant: argonautica_variant_t,\n\n) -> c_int {\n\n let mut buf = [0u8; 1024];\n\n\n\n let fixed_len = 17; // $$$$$v=19m=t=p=,,\n","file_path":"argonautica-c/src/utils.rs","rank":44,"score":55548.73651674787},{"content":"#[inline(always)]\n\npub fn default_cpu_pool() -> CpuPool {\n\n CpuPool::new(num_cpus::get())\n\n}\n\n\n\n#[cfg(feature = \"serde\")]\n\npub(crate) fn default_cpu_pool_serde() -> Option<CpuPool> {\n\n None\n\n}\n\n\n\n/// Returns the number of logical cores on your machine\n","file_path":"argonautica-rs/src/config/defaults.rs","rank":45,"score":54824.75641844671},{"content":"fn generate_args(input: &Input) -> Vec<String> {\n\n let rng = rand::thread_rng();\n\n let additional_data = if input.additional_data_len == 0 {\n\n \"\".to_string()\n\n } else {\n\n rng.sample_iter(&Alphanumeric)\n\n .take(input.additional_data_len)\n\n .collect::<String>()\n\n };\n\n let secret_key = if input.secret_key_len == 0 {\n\n \"\".to_string()\n\n } else {\n\n rng.sample_iter(&Alphanumeric)\n\n .take(input.secret_key_len)\n\n .collect::<String>()\n\n };\n\n let password = rng\n\n .sample_iter(&Alphanumeric)\n\n .take(input.password_len)\n\n .collect::<String>();\n","file_path":"argonautica-rs/tests/tests.rs","rank":46,"score":51530.40975410868},{"content":"def verify(\n\n *,\n\n hash: str,\n\n password: Union[bytes, str],\n\n secret_key: Union[bytes, str, None],\n\n\n\n additional_data: Union[bytes, str, None] = None,\n\n backend: Backend = DEFAULT_BACKEND,\n\n threads: int = DEFAULT_THREADS\n\n) -> bool:\n\n \"\"\"\n\n A standalone verify function\n\n \"\"\"\n\n # Additional data\n\n if additional_data is None:\n\n additional_data = ffi.NULL\n\n additional_data_len = 0\n\n elif isinstance(additional_data, bytes):\n\n additional_data_len = len(additional_data)\n\n elif isinstance(additional_data, str):\n\n additional_data = additional_data.encode('utf-8')\n\n additional_data_len = len(additional_data)\n\n else:\n\n raise TypeError(\"Type of additional_data must be bytes, str, or None\")\n\n\n\n # Password\n\n if isinstance(password, bytes):\n\n password_len = len(password)\n\n elif isinstance(password, str):\n\n password = password.encode('utf-8')\n\n password_len = len(password)\n\n else:\n\n raise TypeError(\"Type of password must be bytes or str\")\n\n\n\n # Secret key\n\n if secret_key is None:\n\n secret_key = ffi.NULL\n\n secret_key_len = 0\n\n elif isinstance(secret_key, bytes):\n\n secret_key_len = len(secret_key)\n\n elif isinstance(secret_key, str):\n\n secret_key = secret_key.encode('utf-8')\n\n secret_key_len = len(secret_key)\n\n else:\n\n raise TypeError(\"Type of secret_key must be bytes, str, or None\")\n\n\n\n is_valid = ffi.new(\"int*\", 0)\n\n err = lib.argonautica_verify(\n\n is_valid,\n\n additional_data,\n\n additional_data_len,\n\n hash.encode('utf-8'),\n\n password,\n\n password_len,\n\n secret_key,\n\n secret_key_len,\n\n backend.value,\n\n 0,\n\n 0,\n\n threads,\n\n )\n\n if err != lib.ARGONAUTICA_OK:\n\n error_msg_ptr = lib.argonautica_error_msg(err)\n\n error_msg = ffi.string(error_msg_ptr).decode(\"utf-8\")\n\n raise Exception(error_msg)\n\n\n\n if is_valid[0] == 1:\n\n return True\n\n\n","file_path":"argonautica-py/argonautica/core/verifier.py","rank":47,"score":49268.13910933847},{"content":"class Verifier:\n\n \"\"\"\n\n A class that knows how to verify\n\n \"\"\"\n\n __slots__ = [\n\n 'additional_data',\n\n 'backend',\n\n 'secret_key',\n\n 'threads'\n\n ]\n\n\n\n def __init__(\n\n self,\n\n *,\n\n secret_key: Union[bytes, str, None],\n\n\n\n additional_data: Union[bytes, str, None] = None,\n\n backend: Backend = DEFAULT_BACKEND,\n\n threads: int = DEFAULT_THREADS\n\n ) -> None:\n\n self.additional_data = additional_data\n\n self.secret_key = secret_key\n\n self.backend = backend\n\n self.threads = threads\n\n\n\n def verify(\n\n self,\n\n *,\n\n hash: str,\n\n password: Union[bytes, str],\n\n\n\n additional_data: Union[bytes, str, None, Void] = VOID,\n\n backend: Union[Backend, Void] = VOID,\n\n secret_key: Union[bytes, str, None, Void] = VOID,\n\n threads: Union[int, Void] = VOID\n\n ) -> bool:\n\n if isinstance(additional_data, Void):\n\n additional_data = self.additional_data\n\n if isinstance(backend, Void):\n\n backend = self.backend\n\n if isinstance(secret_key, Void):\n\n secret_key = self.secret_key\n\n if isinstance(threads, Void):\n\n threads = self.threads\n\n return verify(\n\n additional_data=additional_data,\n\n backend=backend,\n\n hash=hash,\n\n password=password,\n\n secret_key=secret_key,\n\n threads=threads\n","file_path":"argonautica-py/argonautica/core/verifier.py","rank":48,"score":49268.13910933847},{"content":"fn build_c<P: AsRef<Path>>(build_dir: P) {\n\n let mut build_exists = BUILD_EXISTS.lock().unwrap();\n\n if *build_exists {\n\n return;\n\n }\n\n let build_dir = build_dir.as_ref();\n\n if build_dir.exists() {\n\n ::std::fs::remove_dir_all(build_dir).expect(\"unable to remove build dir\");\n\n }\n\n ::std::fs::create_dir_all(build_dir).expect(\"unable to create build dir\");\n\n let success = Command::new(\"cmake\")\n\n .arg(\"..\")\n\n .current_dir(build_dir)\n\n .status()\n\n .unwrap()\n\n .success();\n\n if !success {\n\n panic!(\"cmake failed\");\n\n }\n\n assert!(success);\n","file_path":"argonautica-rs/tests/tests.rs","rank":49,"score":49040.491071325014},{"content":"fn parse_stderr(stderr: &[u8]) -> (String, Vec<u8>) {\n\n let stderr = ::std::str::from_utf8(stderr).expect(\"stderr from C is invalid utf-8\");\n\n let v = stderr.trim().split(\"\\n\").collect::<Vec<&str>>();\n\n if v.len() != 2 {\n\n panic!(\"invalid stderr from C: {}\", stderr);\n\n }\n\n let encoded = v[0].to_string();\n\n let hash = v[1]\n\n .replace(\"[\", \"\")\n\n .replace(\"]\", \"\")\n\n .split(\",\")\n\n .into_iter()\n\n .map(|s| Ok::<_, failure::Error>(s.parse::<u8>()?))\n\n .collect::<Result<Vec<u8>, failure::Error>>()\n\n .expect(\"unable to parse hash from C stderr\");\n\n (encoded, hash)\n\n}\n\n\n","file_path":"argonautica-rs/tests/tests.rs","rank":50,"score":49040.491071325014},{"content":"verify_result_t verify_high_level(verify_input_t* input)\n\n{\n\n int err = argon2_verify(\n\n /* const char* encoded */ input->encoded,\n\n /* const void* pwd */ (void*)(input->password),\n\n /* const size_t pwdlen */ input->password_len,\n\n /* argon2_type type */ input->variant\n\n );\n\n verify_result_t output = {};\n\n output.err = err;\n\n if (err == ARGON2_OK) {\n\n output.is_valid = true;\n\n return output;\n\n } else {\n\n output.is_valid = false;\n\n return output;\n\n }\n","file_path":"argonautica-rs/tests/c/src/verify.c","rank":51,"score":47813.56930715432},{"content":"verify_result_t verify_low_level(verify_input_t* input)\n\n{\n\n verify_result_t output = {};\n\n if (input->password_len > ARGON2_MAX_PWD_LENGTH) {\n\n output.err = ARGON2_PWD_TOO_LONG;\n\n output.is_valid = false;\n\n return output;\n\n }\n\n if (input->encoded == NULL) {\n\n output.err = ARGON2_DECODING_FAIL;\n\n output.is_valid = false;\n\n return output;\n\n }\n\n size_t encoded_len = strlen(input->encoded);\n\n if (encoded_len > UINT32_MAX) {\n\n output.err = ARGON2_DECODING_FAIL;\n\n output.is_valid = false;\n\n return output;\n\n }\n\n\n\n argon2_context ctx = {};\n\n ctx.saltlen = (uint32_t)encoded_len;\n\n ctx.outlen = (uint32_t)encoded_len;\n\n\n\n ctx.salt = (uint8_t*)malloc(ctx.saltlen);\n\n ctx.out = (uint8_t*)malloc(ctx.outlen);\n\n if (ctx.salt == NULL || ctx.out == NULL) {\n\n free(ctx.out);\n\n free(ctx.salt);\n\n output.err = ARGON2_MEMORY_ALLOCATION_ERROR;\n\n output.is_valid = false;\n\n return output;\n\n }\n\n\n\n ctx.pwd = (uint8_t*)(input->password);\n\n ctx.pwdlen = (uint32_t)(input->password_len);\n\n\n\n int err = decode_string( // Note: Located in encoding.c\n\n /* argon2_context* ctx */ &ctx,\n\n /* const char* str */ input->encoded,\n\n /* argon2_type type */ input->variant\n\n );\n\n if (err != ARGON2_OK) {\n\n free(ctx.out);\n\n free(ctx.salt);\n\n output.err = err;\n\n output.is_valid = false;\n\n return output;\n\n }\n\n\n\n uint8_t* desired_result = ctx.out;\n\n ctx.out = (uint8_t*)malloc(ctx.outlen);\n\n if (ctx.out == NULL) {\n\n free(ctx.out);\n\n free(ctx.salt);\n\n free(desired_result);\n\n output.err = ARGON2_MEMORY_ALLOCATION_ERROR;\n\n output.is_valid = false;\n\n return output;\n\n }\n\n\n\n // This is my code\n\n ctx.ad = input->additional_data;\n\n ctx.adlen = (size_t)(input->additional_data_len);\n\n ctx.secret = input->secret_key;\n\n ctx.secretlen = (size_t)(input->secret_key_len);\n\n\n\n err = my_argon2_verify_ctx(\n\n /* argon2_context* context */ &ctx,\n\n /* const char* encoded */ (char *)desired_result,\n\n /* argon2_type variant */ input->variant\n\n );\n\n if (err != ARGON2_OK) {\n\n free(ctx.out);\n\n free(ctx.salt);\n\n free(desired_result);\n\n output.err = err;\n\n output.is_valid = false;\n\n return output;\n\n }\n\n\n\n free(ctx.out);\n\n free(ctx.salt);\n\n free(desired_result);\n\n output.err = ARGON2_OK;\n\n output.is_valid = true;\n\n return output;\n","file_path":"argonautica-rs/tests/c/src/verify.c","rank":52,"score":47813.56930715432},{"content":"static int my_argon2_verify_ctx(argon2_context* context, const char* hash, argon2_type type);\n","file_path":"argonautica-rs/tests/c/src/verify.c","rank":53,"score":47813.56930715432},{"content":"fn check_error(err: ffi::Argon2_ErrorCodes) -> Result<(), Error> {\n\n match err {\n\n ffi::Argon2_ErrorCodes_ARGON2_OK => Ok(()),\n\n ffi::Argon2_ErrorCodes_ARGON2_MEMORY_ALLOCATION_ERROR => {\n\n Err(Error::new(ErrorKind::MemoryAllocationError))\n\n }\n\n ffi::Argon2_ErrorCodes_ARGON2_THREAD_FAIL => Err(Error::new(ErrorKind::ThreadError)),\n\n _ => {\n\n let err_msg_ptr = unsafe { ffi::argon2_error_message(err) };\n\n if err_msg_ptr.is_null() {\n\n return Err(Error::new(ErrorKind::Bug)\n\n .add_context(format!(\"Unhandled error from C. Error code: {}\", err,)));\n\n }\n\n let err_msg_cstr = unsafe { CStr::from_ptr(err_msg_ptr) };\n\n let err_msg = err_msg_cstr.to_str().unwrap(); // Safe; see argon2_error_message\n\n Err(Error::new(ErrorKind::Bug).add_context(format!(\n\n \"Unhandled error from C. Error code: {}. Error {}\",\n\n err, err_msg,\n\n )))\n\n }\n\n }\n\n}\n","file_path":"argonautica-rs/src/backend/c/hash_raw.rs","rank":54,"score":45586.58885538786},{"content":"#![allow(non_camel_case_types)]\n\n\n\nuse std::ffi::CStr;\n\n\n\nuse argonautica::config::Backend;\n\nuse argonautica::Verifier;\n\nuse libc::{c_char, c_int};\n\n\n\nuse {argonautica_backend_t, argonautica_error_t};\n\n\n\n/// Function that verifies a password against a hash. It will modify the provided `is_valid` int\n\n/// and return an `argonautica_error_t` indicating whether or not the verification was successful.\n\n///\n\n/// On success, `is_valid` will be modified to be `1` if the hash / password combination is valid\n\n/// or `0` if the hash / password combination is not valid.\n\n///\n\n/// `encoded` is a `char*` pointing to the string-encoded hash.\n\n///\n\n/// For a description of the other arguments, see the documentation for\n\n/// `argonautica_hash`\n","file_path":"argonautica-c/src/verify.rs","rank":55,"score":44924.83701522577},{"content":" let password_clearing = if password_clearing == 0 { false } else { true };\n\n let secret_key_clearing = if secret_key_clearing == 0 {\n\n false\n\n } else {\n\n true\n\n };\n\n\n\n let mut verifier = Verifier::default();\n\n verifier\n\n .configure_backend(backend)\n\n .configure_password_clearing(password_clearing)\n\n .configure_secret_key_clearing(secret_key_clearing)\n\n .configure_threads(threads);\n\n\n\n // Hash\n\n let encoded_cstr = unsafe { CStr::from_ptr(encoded) };\n\n let encoded = match encoded_cstr.to_str() {\n\n Ok(encoded) => encoded,\n\n Err(_) => return argonautica_error_t::ARGONAUTICA_ERROR_UTF8_ENCODE,\n\n };\n","file_path":"argonautica-c/src/verify.rs","rank":56,"score":44923.73418168585},{"content":"#[no_mangle]\n\npub extern \"C\" fn argonautica_verify(\n\n is_valid: *mut c_int,\n\n additional_data: *const u8,\n\n additional_data_len: u32,\n\n encoded: *const c_char,\n\n password: *mut u8,\n\n password_len: u32,\n\n secret_key: *mut u8,\n\n secret_key_len: u32,\n\n backend: argonautica_backend_t,\n\n password_clearing: c_int,\n\n secret_key_clearing: c_int,\n\n threads: u32,\n\n) -> argonautica_error_t {\n\n if is_valid.is_null() || encoded.is_null() || password.is_null() {\n\n return argonautica_error_t::ARGONAUTICA_ERROR_NULL_PTR;\n\n }\n\n\n\n let backend: Backend = backend.into();\n","file_path":"argonautica-c/src/verify.rs","rank":57,"score":44923.70473513768},{"content":" let valid = match verifier.verify() {\n\n Ok(valid) => valid,\n\n Err(e) => return e.into(),\n\n };\n\n\n\n if valid {\n\n unsafe {\n\n *is_valid = 1;\n\n };\n\n } else {\n\n unsafe {\n\n *is_valid = 0;\n\n };\n\n }\n\n\n\n argonautica_error_t::ARGONAUTICA_OK\n\n}\n","file_path":"argonautica-c/src/verify.rs","rank":58,"score":44918.40197994495},{"content":" verifier.with_hash(encoded);\n\n\n\n // Additional data\n\n if !additional_data.is_null() {\n\n let additional_data =\n\n unsafe { ::std::slice::from_raw_parts(additional_data, additional_data_len as usize) };\n\n verifier.with_additional_data(additional_data);\n\n }\n\n\n\n // Password\n\n let password = unsafe { ::std::slice::from_raw_parts_mut(password, password_len as usize) };\n\n verifier.with_password(password);\n\n\n\n // Secret key\n\n if !secret_key.is_null() {\n\n let secret_key =\n\n unsafe { ::std::slice::from_raw_parts_mut(secret_key, secret_key_len as usize) };\n\n verifier.with_secret_key(secret_key);\n\n }\n\n\n","file_path":"argonautica-c/src/verify.rs","rank":59,"score":44917.407496489795},{"content":"/// A utility function for generating a cryptographically-secure, random, base64-encoded string\n\n/// based on\n\n/// [standard base64 encoding](https://docs.rs/base64/0.9.1/base64/constant.STANDARD.html).\n\n/// A quick glance at this function's source should give you a good idea of what the function\n\n/// is doing.\n\npub fn generate_random_base64_encoded_string(len: u32) -> Result<String, Error> {\n\n let mut bytes = vec![0u8; len as usize];\n\n OsRng\n\n .try_fill_bytes(&mut bytes)\n\n .map_err(|e| Error::new(ErrorKind::OsRngError).add_context(format!(\"{}\", e)))?;\n\n let output = base64::encode_config(&bytes, base64::STANDARD);\n\n Ok(output)\n\n}\n\n\n","file_path":"argonautica-rs/src/utils.rs","rank":60,"score":44351.00834677747},{"content":"/// A utility function for generating cryptographically-secure random bytes. A quick glance at\n\n/// this function's source should give you a good idea of what the function is doing.\n\npub fn generate_random_bytes(len: u32) -> Result<Vec<u8>, Error> {\n\n let mut bytes = vec![0u8; len as usize];\n\n OsRng\n\n .try_fill_bytes(&mut bytes)\n\n .map_err(|e| Error::new(ErrorKind::OsRngError).add_context(format!(\"{}\", e)))?;\n\n Ok(bytes)\n\n}\n\n\n","file_path":"argonautica-rs/src/utils.rs","rank":61,"score":44117.5204496145},{"content":" fn test_serialize() {\n\n use serde;\n\n fn assert_serialize<T: serde::Serialize>() {}\n\n assert_serialize::<Verifier>();\n\n }\n\n\n\n #[cfg(feature = \"serde\")]\n\n #[test]\n\n fn test_deserialize() {\n\n use serde;\n\n fn assert_deserialize<'de, T: serde::Deserialize<'de>>() {}\n\n assert_deserialize::<Verifier>();\n\n }\n\n}\n","file_path":"argonautica-rs/src/verifier.rs","rank":62,"score":43428.62819256038},{"content":" self.hasher.secret_key()\n\n }\n\n}\n\n\n\n#[cfg(test)]\n\nmod tests {\n\n use super::*;\n\n\n\n #[cfg(feature = \"serde\")]\n\n #[test]\n\n fn test_verifier_serialization() {\n\n use serde_json;\n\n\n\n let password = \"P@ssw0rd\";\n\n let secret_key = \"secret\";\n\n\n\n let mut hasher = Hasher::default();\n\n hasher\n\n .configure_password_clearing(false)\n\n .configure_secret_key_clearing(false)\n","file_path":"argonautica-rs/src/verifier.rs","rank":63,"score":43427.46631768084},{"content":" Raw(HashRaw),\n\n None,\n\n}\n\n\n\nimpl<'a> Default for Verifier<'a> {\n\n /// Same as the [`new`](struct.Verifier.html#method.new) method\n\n fn default() -> Verifier<'a> {\n\n Verifier {\n\n hash: Hash::default(),\n\n hasher: Hasher::default(),\n\n }\n\n }\n\n}\n\n\n\n/// <b><u>One of the two main structs.</u></b> Use it to verify passwords against hashes\n\n#[derive(Debug)]\n\n#[cfg_attr(feature = \"serde\", derive(Serialize, Deserialize))]\n\n#[cfg_attr(feature = \"serde\", serde(rename_all = \"camelCase\"))]\n\npub struct Verifier<'a> {\n\n hash: Hash,\n","file_path":"argonautica-rs/src/verifier.rs","rank":64,"score":43427.20002985507},{"content":" hash_raw.to_string(),\n\n password.as_bytes(),\n\n \"secret\".as_bytes()\n\n );\n\n };\n\n\n\n // Serialize Verifier\n\n let j = serde_json::to_string_pretty(&verifier1).expect(\"failed to serialize verifier\");\n\n // Deserialize Verifier\n\n let mut verifier2: Verifier =\n\n serde_json::from_str(&j).expect(\"failed to deserialize verifier\");\n\n // Assert that password and secret key have been erased\n\n assert!(verifier2.password().is_none());\n\n assert!(verifier2.secret_key().is_none());\n\n // Add a password and ensure that verify doesn't return an error\n\n verifier2.with_password(password);\n\n let is_valid = verifier2.verify().unwrap();\n\n assert!(!is_valid);\n\n // Add a secret key and ensure that verify returns is_valid\n\n verifier2.with_secret_key(secret_key);\n","file_path":"argonautica-rs/src/verifier.rs","rank":65,"score":43426.33964842312},{"content":"use futures::Future;\n\nuse futures_cpupool::CpuPool;\n\n\n\nuse backend::decode_rust;\n\nuse config::{default_cpu_pool, Backend, VerifierConfig};\n\nuse input::{AdditionalData, Password, SecretKey};\n\nuse output::HashRaw;\n\nuse {Error, ErrorKind, Hasher};\n\n\n\nimpl Default for Hash {\n\n fn default() -> Hash {\n\n Hash::None\n\n }\n\n}\n\n\n\n#[derive(Clone, Debug)]\n\n#[cfg_attr(feature = \"serde\", derive(Serialize, Deserialize))]\n\n#[cfg_attr(feature = \"serde\", serde(rename_all = \"camelCase\"))]\n\npub enum Hash {\n\n Encoded(String),\n","file_path":"argonautica-rs/src/verifier.rs","rank":66,"score":43424.83722973414},{"content":" let mut verifier = self.to_owned();\n\n match verifier.hasher.config.cpu_pool() {\n\n Some(cpu_pool) => cpu_pool.spawn_fn(move || verifier.verify()),\n\n None => {\n\n let cpu_pool = default_cpu_pool();\n\n verifier.hasher.config.set_cpu_pool(cpu_pool.clone());\n\n cpu_pool.spawn_fn(move || verifier.verify())\n\n }\n\n }\n\n }\n\n /// Allows you to provide [`Verifier`](struct.Verifier.html) with the additional data\n\n /// that was originally used to create the hash. Normally hashes are not created with\n\n /// additional data; so you are not likely to need this method\n\n pub fn with_additional_data<AD>(&mut self, additional_data: AD) -> &mut Verifier<'a>\n\n where\n\n AD: Into<AdditionalData>,\n\n {\n\n self.hasher.additional_data = Some(additional_data.into());\n\n self\n\n }\n","file_path":"argonautica-rs/src/verifier.rs","rank":67,"score":43424.138710143816},{"content":" self\n\n }\n\n /// Allows you to configure [`Verifier`](struct.Verifier.html) to use a custom number of\n\n /// threads. The default is the number of physical cores on your machine. If you choose\n\n /// a number of threads that is greater than the lanes configuration of your hash,\n\n /// [`Verifier`](struct.Verifier.html) will use the minimum of the two.\n\n pub fn configure_threads(&mut self, threads: u32) -> &mut Verifier<'a> {\n\n self.hasher.config.set_threads(threads);\n\n self\n\n }\n\n /// Clones the [`Verifier`](struct.Verifier.html), returning a new\n\n /// [`Verifier`](struct.Verifier.html) with a `static` lifetime. Use this method if you\n\n /// would like to move a [`Verifier`](struct.Verifier.html) to another thread\n\n pub fn to_owned(&self) -> Verifier<'static> {\n\n Verifier {\n\n hash: self.hash.clone(),\n\n hasher: self.hasher.to_owned(),\n\n }\n\n }\n\n /// <b><u>The primary method (blocking version)</u></b>\n","file_path":"argonautica-rs/src/verifier.rs","rank":68,"score":43421.621702843164},{"content":" /// or its non-blocking equivalent. The default is to <b>not</b> clear out the password\n\n /// bytes (i.e. `false`). If you set this option to `true`, you must provide\n\n /// [`Verifier`](struct.Verifier.html) with a mutable password, e.g. a password\n\n /// constructed from a `String`, `Vec<u8>`, `&mut str`, `&mut [u8]`, etc. as opposed to\n\n /// one constructed from a `&str`, `&[u8]`, etc., or else verifying will return an\n\n /// [`Error`](struct.Error.html).\n\n pub fn configure_password_clearing(&mut self, boolean: bool) -> &mut Verifier<'a> {\n\n self.hasher.config.set_password_clearing(boolean);\n\n self\n\n }\n\n /// Allows you to configure [`Verifier`](struct.Verifier.html) to erase the secret key bytes\n\n /// after each call to [`verify`](struct.Verifier.html#method.verify)\n\n /// or its non-blocking equivalent. The default is to <b>not</b> clear out the secret key\n\n /// bytes (i.e. `false`). If you set this option to `true`, you must provide\n\n /// [`Verifier`](struct.Verifier.html) with a mutable secret key, e.g. a secret key\n\n /// constructed from a `String`, `Vec<u8>`, `&mut str`, `&mut [u8]`, etc. as opposed to\n\n /// one constructed from a `&str`, `&[u8]`, etc., or else verifying will return an\n\n /// [`Error`](struct.Error.html).\n\n pub fn configure_secret_key_clearing(&mut self, boolean: bool) -> &mut Verifier<'a> {\n\n self.hasher.config.set_secret_key_clearing(boolean);\n","file_path":"argonautica-rs/src/verifier.rs","rank":69,"score":43421.51318012146},{"content":" }\n\n /// Allows you to provide [`Verifier`](struct.Verifier.html) with the password\n\n /// to verify against\n\n pub fn with_password<P>(&mut self, password: P) -> &mut Verifier<'a>\n\n where\n\n P: Into<Password<'a>>,\n\n {\n\n self.hasher.password = Some(password.into());\n\n self\n\n }\n\n /// Allows you to provide [`Verifier`](struct.Verifier.html) with the secret key\n\n /// that was initially used to create the hash\n\n pub fn with_secret_key<SK>(&mut self, secret_key: SK) -> &mut Verifier<'a>\n\n where\n\n SK: Into<SecretKey<'a>>,\n\n {\n\n self.hasher.secret_key = Some(secret_key.into());\n\n self\n\n }\n\n /// Read-only access to the [`Verifier`](struct.Verifier.html)'s\n","file_path":"argonautica-rs/src/verifier.rs","rank":70,"score":43421.387144958164},{"content":" /// Allows you to provide [`Verifier`](struct.Verifier.html) with the hash to verify\n\n /// against (in the form of a string-encoded hash like those produced by the\n\n /// [`hash`](struct.Hasher.html#method.hash) or\n\n /// [`hash_non_blocking`](struct.Hasher.html#method.hash_non_blocking)\n\n /// methods on [`Hasher`](struct.Hasher.html))\n\n pub fn with_hash<S>(&mut self, hash: S) -> &mut Verifier<'a>\n\n where\n\n S: AsRef<str>,\n\n {\n\n self.hash = Hash::Encoded(hash.as_ref().to_string());\n\n self\n\n }\n\n /// Allows you to provide [`Verifier`](struct.Verifier.html) with the hash to verify\n\n /// against (in the form of a [`HashRaw`](output/struct.HashRaw.html) like those produced\n\n /// by the [`hash_raw`](struct.Hasher.html#method.hash_raw) or\n\n /// [`hash_raw_non_blocking`](struct.Hasher.html#method.hash_raw_non_blocking)\n\n /// methods on [`Hasher`](struct.Hasher.html))\n\n pub fn with_hash_raw(&mut self, hash_raw: &HashRaw) -> &mut Verifier<'a> {\n\n self.hash = Hash::Raw(hash_raw.clone());\n\n self\n","file_path":"argonautica-rs/src/verifier.rs","rank":71,"score":43421.000183434044},{"content":" self.hasher.config.set_variant(hash_raw.variant());\n\n self.hasher.config.set_version(hash_raw.version());\n\n self.hasher.salt = hash_raw.raw_salt_bytes().into();\n\n let hash_raw2 = self.hasher.hash_raw()?;\n\n let is_valid = if hash_raw.raw_hash_bytes() == hash_raw2.raw_hash_bytes() {\n\n true\n\n } else {\n\n false\n\n };\n\n Ok(is_valid)\n\n }\n\n Hash::None => return Err(Error::new(ErrorKind::HashMissingError)),\n\n }\n\n }\n\n /// <b><u>The primary method (non-blocking version)</u></b>\n\n ///\n\n /// Same as [`verify`](struct.Verifier.html#method.verify) except it returns a\n\n /// [`Future`](https://docs.rs/futures/0.1.21/futures/future/trait.Future.html)\n\n /// instead of a [`Result`](https://doc.rust-lang.org/std/result/enum.Result.html)\n\n pub fn verify_non_blocking(&mut self) -> impl Future<Item = bool, Error = Error> {\n","file_path":"argonautica-rs/src/verifier.rs","rank":72,"score":43418.98956639031},{"content":" /// [`Backend::Rust`](config/enum.Backend.html#variant.Rust) it will error</i>\n\n pub fn configure_backend(&mut self, backend: Backend) -> &mut Verifier<'a> {\n\n self.hasher.config.set_backend(backend);\n\n self\n\n }\n\n /// Allows you to configure [`Verifier`](struct.Verifier.html) with a custom\n\n /// [`CpuPool`](https://docs.rs/futures-cpupool/0.1.8/futures_cpupool/struct.CpuPool.html).\n\n /// The default [`Verifier`](struct.Verifier.html) does not have a cpu pool, which is\n\n /// only needed for the [`verify_non_blocking`](struct.Verifier.html#method.verify_non_blocking)\n\n /// method. If you call [`verify_non_blocking`](struct.Verifier.html#method.verify_non_blocking)\n\n /// without a cpu pool, a default cpu pool will be created for you on the fly; so even\n\n /// if you never configure [`Verifier`](struct.Verifier.html) with this method you can still\n\n /// use the [`verify_non_blocking`](struct.Verifier.html#method.verify_non_blocking) method.\n\n /// The default cpu pool has as many threads as the number of logical cores on your machine\n\n pub fn configure_cpu_pool(&mut self, cpu_pool: CpuPool) -> &mut Verifier<'a> {\n\n self.hasher.config.set_cpu_pool(cpu_pool);\n\n self\n\n }\n\n /// Allows you to configure [`Verifier`](struct.Verifier.html) to erase the password bytes\n\n /// after each call to [`verify`](struct.Verifier.html#method.verify)\n","file_path":"argonautica-rs/src/verifier.rs","rank":73,"score":43418.695709864136},{"content":" .with_additional_data(\"additional data\")\n\n .with_password(password)\n\n .with_secret_key(secret_key)\n\n .with_salt(\"somesalt\");\n\n let hash_raw = hasher.hash_raw().expect(\"failed to hash_raw\");\n\n\n\n let mut verifier1 = Verifier::default();\n\n verifier1\n\n .configure_password_clearing(false)\n\n .configure_secret_key_clearing(false)\n\n .with_additional_data(\"additional data\")\n\n .with_password(password)\n\n .with_secret_key(secret_key)\n\n .with_hash_raw(&hash_raw);\n\n let is_valid = verifier1.verify().unwrap();\n\n if !is_valid {\n\n panic!(\n\n \"\\nverifier1:\\n{:#?}\\nAdditional Data: {:?}\\nHash: {}\\nPasswod: {:?}\\nSecret key: {:?}\",\n\n verifier1,\n\n \"additional data\".as_bytes(),\n","file_path":"argonautica-rs/src/verifier.rs","rank":74,"score":43416.74062029756},{"content":" ///\n\n /// After you have configured [`Verifier`](struct.Verifier.html) to your liking and provided\n\n /// it will all the data it needs to verify a password, i.e.\n\n /// * a string-encoded hash or [`HashRaw`](output/struct.HashRaw.html),\n\n /// * a [`Password`](input/struct.Password.html),\n\n /// * a [`SecretKey`](input/struct.SecretKey.html) (if required),\n\n /// * [`AdditionalData`](input/struct.AdditionalData.html) (if required),\n\n ///\n\n /// call this method to verify that the password matches the hash or\n\n /// [`HashRaw`](output/struct.HashRaw.html)\n\n pub fn verify(&mut self) -> Result<bool, Error> {\n\n match self.hash {\n\n Hash::Encoded(ref s) => {\n\n let hash_raw = decode_rust(s)?;\n\n self.hasher\n\n .config\n\n .set_hash_len(hash_raw.raw_hash_bytes().len() as u32);\n\n self.hasher.config.set_iterations(hash_raw.iterations());\n\n self.hasher.config.set_lanes(hash_raw.lanes());\n\n self.hasher.config.set_memory_size(hash_raw.memory_size());\n","file_path":"argonautica-rs/src/verifier.rs","rank":75,"score":43415.793874291754},{"content":" /// [`AdditionalData`](input/struct.AdditionalData.html), if any\n\n pub fn additional_data(&self) -> Option<&AdditionalData> {\n\n self.hasher.additional_data()\n\n }\n\n /// Read-only access to the [`Verifier`](struct.Verifier.html)'s\n\n /// [`VerifierConfig`](config/struct.VerifierConfig.html)\n\n pub fn config(&self) -> VerifierConfig {\n\n VerifierConfig::new(\n\n /* backend */ self.hasher.config.backend(),\n\n /* cpu_pool */ self.hasher.config.cpu_pool(),\n\n /* password_clearing */ self.hasher.config.password_clearing(),\n\n /* secret_key_clearing */ self.hasher.config.secret_key_clearing(),\n\n /* threads */ self.hasher.config.threads(),\n\n )\n\n }\n\n /// Returns the [`Verifier`](struct.Verifier.html)'s string-encoded hash, if any\n\n pub fn hash(&self) -> Option<String> {\n\n match self.hash {\n\n Hash::Encoded(ref s) => Some(s.to_string()),\n\n Hash::Raw(ref hash_raw) => Some(hash_raw.encode_rust()),\n","file_path":"argonautica-rs/src/verifier.rs","rank":76,"score":43414.661007889095},{"content":" hasher: Hasher<'a>,\n\n}\n\n\n\nimpl<'a> Verifier<'a> {\n\n /// Creates a new [`Verifier`](struct.Verifier.html) with the following configuration:\n\n /// * `backend`: [`Backend::C`](config/enum.Backend.html#variant.C)\n\n /// * `cpu_pool`: A [`CpuPool`](https://docs.rs/futures-cpupool/0.1.8/futures_cpupool/struct.CpuPool.html) ...\n\n /// * with threads equal to the number of logical cores on your machine\n\n /// * that is lazily created, i.e. created only if / when you call the method that\n\n /// needs it ([`verify_non_blocking`](struct.Verifier.html#method.verify_non_blocking))\n\n /// * `password_clearing`: `false`\n\n /// * `secret_key_clearing`: `false`\n\n /// * `threads`: The number of logical cores on your machine\n\n pub fn new() -> Verifier<'a> {\n\n Verifier::default()\n\n }\n\n /// Allows you to configure [`Verifier`](struct.Verifier.html) with a custom backend. The\n\n /// default backend is [`Backend::C`](config/enum.Backend.html#variant.C), <i>which is\n\n /// currently the only backend supported. A Rust backend is planned, but is not currently\n\n /// available. If you configure a [`Verifier`](struct.Verifier.html) with\n","file_path":"argonautica-rs/src/verifier.rs","rank":77,"score":43413.45309777219},{"content":" self.hasher.config.set_opt_out_of_secret_key(true);\n\n self.hasher.config.set_variant(hash_raw.variant());\n\n self.hasher.config.set_version(hash_raw.version());\n\n self.hasher.salt = hash_raw.raw_salt_bytes().into();\n\n let hash_raw2 = self.hasher.hash_raw()?;\n\n let is_valid = if hash_raw.raw_hash_bytes() == hash_raw2.raw_hash_bytes() {\n\n true\n\n } else {\n\n false\n\n };\n\n Ok(is_valid)\n\n }\n\n Hash::Raw(ref hash_raw) => {\n\n self.hasher\n\n .config\n\n .set_hash_len(hash_raw.raw_hash_bytes().len() as u32);\n\n self.hasher.config.set_iterations(hash_raw.iterations());\n\n self.hasher.config.set_lanes(hash_raw.lanes());\n\n self.hasher.config.set_memory_size(hash_raw.memory_size());\n\n self.hasher.config.set_opt_out_of_secret_key(true);\n","file_path":"argonautica-rs/src/verifier.rs","rank":78,"score":43413.337365598876},{"content":" let is_valid = verifier2.verify().unwrap();\n\n if !is_valid {\n\n panic!(\"\\nverifier2:\\n{:#?}\\n\", verifier2);\n\n };\n\n }\n\n\n\n #[test]\n\n fn test_send() {\n\n fn assert_send<T: Send>() {}\n\n assert_send::<Verifier>();\n\n }\n\n\n\n #[test]\n\n fn test_sync() {\n\n fn assert_sync<T: Sync>() {}\n\n assert_sync::<Verifier>();\n\n }\n\n\n\n #[cfg(feature = \"serde\")]\n\n #[test]\n","file_path":"argonautica-rs/src/verifier.rs","rank":79,"score":43413.27401543583},{"content":" Hash::None => None,\n\n }\n\n }\n\n /// Returns the [`Verifier`](struct.Verifier.html)'s [`HashRaw`](output/struct.HashRaw.html),\n\n /// if any\n\n pub fn hash_raw(&self) -> Result<Option<HashRaw>, Error> {\n\n match self.hash {\n\n Hash::Encoded(ref s) => Ok(Some(decode_rust(s)?)),\n\n Hash::Raw(ref hash_raw) => Ok(Some(hash_raw.clone())),\n\n Hash::None => Ok(None),\n\n }\n\n }\n\n /// Read-only access to the [`Verifier`](struct.Verifier.html)'s\n\n /// [`Password`](input/struct.Password.html), if any\n\n pub fn password(&self) -> Option<&Password<'a>> {\n\n self.hasher.password()\n\n }\n\n /// Read-only access to the [`Verifier`](struct.Verifier.html)'s\n\n /// [`SecretKey`](input/struct.SecretKey.html), if any\n\n pub fn secret_key(&self) -> Option<&SecretKey<'a>> {\n","file_path":"argonautica-rs/src/verifier.rs","rank":80,"score":43412.47540699244},{"content":" }\n\n}\n\n\n\n/// <b><u>One of the two main structs.</u></b> Use it to turn passwords into hashes\n\n#[derive(Debug)]\n\n#[cfg_attr(feature = \"serde\", derive(Serialize, Deserialize))]\n\n#[cfg_attr(feature = \"serde\", serde(rename_all = \"camelCase\"))]\n\npub struct Hasher<'a> {\n\n pub(crate) additional_data: Option<AdditionalData>,\n\n pub(crate) config: HasherConfig,\n\n #[cfg_attr(feature = \"serde\", serde(skip_serializing, skip_deserializing))]\n\n pub(crate) password: Option<Password<'a>>,\n\n pub(crate) salt: Salt,\n\n #[cfg_attr(feature = \"serde\", serde(skip_serializing, skip_deserializing))]\n\n pub(crate) secret_key: Option<SecretKey<'a>>,\n\n}\n\n\n\nimpl<'a> Hasher<'a> {\n\n /// Creates a new [`Hasher`](struct.Hasher.html) with a sensible default configuration\n\n /// for the average machine (e.g. an early-2014 MacBook Air).\n","file_path":"argonautica-rs/src/hasher.rs","rank":81,"score":43379.34813039792},{"content":" use serde_json;\n\n\n\n let password = \"P@ssw0rd\";\n\n let secret_key = \"secret\";\n\n\n\n let mut hasher1 = Hasher::default();\n\n hasher1\n\n .configure_password_clearing(false)\n\n .with_additional_data(\"additional data\")\n\n .with_password(password)\n\n .with_secret_key(secret_key)\n\n .with_salt(\"somesalt\");\n\n let hash1 = hasher1.hash().expect(\"failed to hash\");\n\n let hash_raw1 = hasher1.hash_raw().expect(\"failed to hash_raw\");\n\n\n\n // Serialize Hasher\n\n let j = serde_json::to_string_pretty(&hasher1).expect(\"failed to serialize hasher\");\n\n // Deserialize Hasher\n\n let mut hasher2: Hasher = serde_json::from_str(&j).expect(\"failed to deserialize hasher\");\n\n // Assert that password and secret key have been erased\n","file_path":"argonautica-rs/src/hasher.rs","rank":82,"score":43379.252657659315},{"content":" #[test]\n\n fn test_sync() {\n\n fn assert_sync<T: Sync>() {}\n\n assert_sync::<Hasher>();\n\n }\n\n\n\n #[cfg(feature = \"serde\")]\n\n #[test]\n\n fn test_serialize() {\n\n use serde;\n\n fn assert_serialize<T: serde::Serialize>() {}\n\n assert_serialize::<Hasher>();\n\n }\n\n\n\n #[cfg(feature = \"serde\")]\n\n #[test]\n\n fn test_deserialize() {\n\n use serde;\n\n fn assert_deserialize<'de, T: serde::Deserialize<'de>>() {}\n\n assert_deserialize::<Hasher>();\n\n }\n\n}\n","file_path":"argonautica-rs/src/hasher.rs","rank":83,"score":43375.1129466167},{"content":" {\n\n self.password = Some(password.into());\n\n self\n\n }\n\n /// Allows you to provide [`Hasher`](struct.Hasher.html) with a custom\n\n /// [`Salt`](input/struct.Salt.html) to include in the hash. The default\n\n /// [`Hasher`](struct.Hasher.html) is configured to use a random\n\n /// [`Salt`](input/struct.Salt.html) of 32 bytes; so there is no need\n\n /// to call this method. If you would like to use a random\n\n /// [`Salt`](input/struct.Salt.html) of different length, you can call this method with\n\n /// `Salt::random(your_custom_length_in_bytes)`. Using a deterministic\n\n /// [`Salt`](input/struct.Salt.html) is possible, but discouraged\n\n pub fn with_salt<S>(&mut self, salt: S) -> &mut Hasher<'a>\n\n where\n\n S: Into<Salt>,\n\n {\n\n self.salt = salt.into();\n\n self\n\n }\n\n /// Allows you to provide [`Hasher`](struct.Hasher.html) with a secret key that will be used\n","file_path":"argonautica-rs/src/hasher.rs","rank":84,"score":43369.80929005167},{"content":" /// The default and latest (as of 5/18) is\n\n /// [`Version::_0x13`](config/enum.Version.html#variant._0x13).\n\n /// Do <b>not</b> use a different version unless you have a specific reason to do so.\n\n ///\n\n /// See [configuration example](index.html#configuration) for a more details on this parameter\n\n pub fn configure_version(&mut self, version: Version) -> &mut Hasher<'a> {\n\n self.config.set_version(version);\n\n self\n\n }\n\n /// <b><u>The primary method (blocking version).</u></b>\n\n ///\n\n /// After you have configured a [`Hasher`](struct.Hasher.html) to your liking and provided\n\n /// it will all the data you would like to hash, e.g.\n\n /// * a [`Password`](input/struct.Password.html),\n\n /// * a [`Salt`](input/struct.Salt.html) (note: it is recommened you use the default random salt),\n\n /// * a [`SecretKey`](input/struct.SecretKey.html),\n\n /// * [`AdditionalData`](input/struct.AdditionalData.html) (optional),\n\n ///\n\n /// call this method in order to produce a string-encoded hash, which is safe to store in a\n\n /// database and against which you can verify passwords later\n","file_path":"argonautica-rs/src/hasher.rs","rank":85,"score":43368.57057361049},{"content":" }\n\n /// Read-only access to the [`Hasher`](struct.Hasher.html)'s\n\n /// [`Password`](input/struct.Password.html), if any\n\n pub fn password(&self) -> Option<&Password<'a>> {\n\n self.password.as_ref()\n\n }\n\n /// Read-only access to the [`Hasher`](struct.Hasher.html)'s [`Salt`](input/struct.Salt.html)\n\n pub fn salt(&self) -> &Salt {\n\n &self.salt\n\n }\n\n /// Read-only access to the [`Hasher`](struct.Hasher.html)'s\n\n /// [`SecretKey`](input/struct.SecretKey.html), if any\n\n pub fn secret_key(&self) -> Option<&SecretKey<'a>> {\n\n self.secret_key.as_ref()\n\n }\n\n}\n\n\n\nimpl<'a> Hasher<'a> {\n\n pub(crate) fn clear(&mut self) {\n\n if self.password.is_some() && self.config.password_clearing() {\n","file_path":"argonautica-rs/src/hasher.rs","rank":86,"score":43367.43651729058},{"content":" ///\n\n /// Including additional data in your hash is not very common; so it is unlikely you will\n\n /// need to use this method. If, however, you do add additional data, note that it is like\n\n /// a secret key in that it will be required later in order to verify passwords, and\n\n /// it is not stored in the string-encoded version of the hash, meaning you will have to\n\n /// provide it manually to a [`Verifier`](struct.Verifier.html)\n\n pub fn with_additional_data<AD>(&mut self, additional_data: AD) -> &mut Hasher<'a>\n\n where\n\n AD: Into<AdditionalData>,\n\n {\n\n self.additional_data = Some(additional_data.into());\n\n self\n\n }\n\n /// Allows you to provide a [`Hasher`](struct.Hasher.html) with the password you would like\n\n /// to hash. Hashing requires a password; so you must call this method before calling\n\n /// [`hash`](struct.Hasher.html#method.hash), [`hash_raw`](struct.Hasher.html#method.hash_raw),\n\n /// or their non-blocking version\n\n pub fn with_password<P>(&mut self, password: P) -> &mut Hasher<'a>\n\n where\n\n P: Into<Password<'a>>,\n","file_path":"argonautica-rs/src/hasher.rs","rank":87,"score":43366.87554598835},{"content":" self\n\n }\n\n /// Allows you to configure [`Hasher`](struct.Hasher.html) to use a custom memory size\n\n /// (in kibibytes). The default is `4096`.\n\n ///\n\n /// See [configuration example](index.html#configuration) for a more details on this parameter\n\n pub fn configure_memory_size(&mut self, memory_size: u32) -> &mut Hasher<'a> {\n\n self.config.set_memory_size(memory_size);\n\n self\n\n }\n\n /// Allows you to configure [`Hasher`](struct.Hasher.html) to erase the password bytes\n\n /// after each call to [`hash`](struct.Hasher.html#method.hash),\n\n /// [`hash_raw`](struct.Hasher#method.hash_raw), or their non-blocking equivalents.\n\n /// The default is to <b>not</b> clear out the password\n\n /// bytes (i.e. `false`). If you set this option to `true`, you must provide\n\n /// [`Hasher`](struct.Hasher.html) with a mutable password, e.g. a password\n\n /// constructed from a `String`, `Vec<u8>`, `&mut str`, `&mut [u8]`, etc. as opposed to\n\n /// one constructed from a `&str`, `&[u8]`, etc., or else hashing will return an\n\n /// [`Error`](struct.Error.html).\n\n ///\n","file_path":"argonautica-rs/src/hasher.rs","rank":88,"score":43366.64621754571},{"content":" /// to create the hash. The secret key will not be included in the hash output, meaning you\n\n /// must save it somewhere (ideally outside your code) to use later, as the only way to\n\n /// verify passwords against the hash later is to know the secret key. This library\n\n /// encourages the use of a secret key\n\n pub fn with_secret_key<SK>(&mut self, secret_key: SK) -> &mut Hasher<'a>\n\n where\n\n SK: Into<SecretKey<'a>>,\n\n {\n\n self.secret_key = Some(secret_key.into());\n\n self\n\n }\n\n /// Read-only access to the [`Hasher`](struct.Hasher.html)'s\n\n /// [`AdditionalData`](input/struct.AdditionalData.html), if any\n\n pub fn additional_data(&self) -> Option<&AdditionalData> {\n\n self.additional_data.as_ref()\n\n }\n\n /// Read-only access to the [`Hasher`](struct.Hasher.html)'s\n\n /// [`HasherConfig`](config/struct.HasherConfig.html)\n\n pub fn config(&self) -> &HasherConfig {\n\n &self.config\n","file_path":"argonautica-rs/src/hasher.rs","rank":89,"score":43366.05153322148},{"content":" .with_password(\"password\")\n\n .with_secret_key(\"secret\")\n\n .hash();\n\n match hash {\n\n Ok(_) => panic!(\"Should return an error\"),\n\n Err(e) => assert_eq!(e, Error::new(ErrorKind::SecretKeyImmutableError)),\n\n }\n\n assert!(hasher.password().is_some());\n\n assert!(hasher.secret_key().is_none());\n\n }\n\n\n\n #[test]\n\n fn test_hasher_fast_but_insecure() {\n\n let mut hasher = Hasher::fast_but_insecure();\n\n let _ = hasher.with_password(\"P@ssw0rd\").hash().unwrap();\n\n }\n\n\n\n #[cfg(feature = \"serde\")]\n\n #[test]\n\n fn test_hasher_serialization() {\n","file_path":"argonautica-rs/src/hasher.rs","rank":90,"score":43365.95190954909},{"content":"use futures::Future;\n\nuse futures_cpupool::CpuPool;\n\nuse scopeguard;\n\n\n\nuse config::defaults::{default_cpu_pool, default_lanes};\n\nuse config::{Backend, HasherConfig, Variant, Version};\n\nuse input::{AdditionalData, Container, Password, Salt, SecretKey};\n\nuse output::HashRaw;\n\nuse {Error, ErrorKind};\n\n\n\nimpl<'a> Default for Hasher<'a> {\n\n /// Same as the [`new`](struct.Hasher.html#method.new) method\n\n fn default() -> Hasher<'static> {\n\n Hasher {\n\n additional_data: None,\n\n config: HasherConfig::default(),\n\n password: None,\n\n salt: Salt::default(),\n\n secret_key: None,\n\n }\n","file_path":"argonautica-rs/src/hasher.rs","rank":91,"score":43365.70257914814},{"content":" /// Allows you to configure [`Hasher`](struct.Hasher.html) to use a custom number of\n\n /// threads. The default is the number of physical cores on your machine. If you choose\n\n /// a number of threads that is greater than the lanes configuration,\n\n /// [`Hasher`](struct.Hasher.html) will use the minimum of the two.\n\n ///\n\n /// See [configuration example](index.html#configuration) for a more details on this parameter\n\n pub fn configure_threads(&mut self, threads: u32) -> &mut Hasher<'a> {\n\n self.config.set_threads(threads);\n\n self\n\n }\n\n /// Allows you to configure [`Hasher`](struct.Hasher.html) to use a custom Argon2\n\n /// variant. The default is [`Variant::Argon2id`](config/enum.Variant.html#variant.Argon2id).\n\n /// Do <b>not</b> use a different variant unless you have a specific reason to do so.\n\n ///\n\n /// See [configuration example](index.html#configuration) for a more details on this parameter\n\n pub fn configure_variant(&mut self, variant: Variant) -> &mut Hasher<'a> {\n\n self.config.set_variant(variant);\n\n self\n\n }\n\n /// Allows you to configure [`Hasher`](struct.Hasher.html) to use a custom Argon2 version.\n","file_path":"argonautica-rs/src/hasher.rs","rank":92,"score":43365.306528097564},{"content":" /// See [configuration example](index.html#configuration) for a more detailed discussion\n\n /// of this parameter\n\n pub fn configure_hash_len(&mut self, hash_len: u32) -> &mut Hasher<'a> {\n\n self.config.set_hash_len(hash_len);\n\n self\n\n }\n\n /// Allows you to configure [`Hasher`](struct.Hasher.html) to use a custom number of\n\n /// iterations. The default is `192`.\n\n ///\n\n /// See [configuration example](index.html#configuration) for a more details on this parameter\n\n pub fn configure_iterations(&mut self, iterations: u32) -> &mut Hasher<'a> {\n\n self.config.set_iterations(iterations);\n\n self\n\n }\n\n /// Allows you to configure [`Hasher`](struct.Hasher.html) to use a custom number of\n\n /// lanes. The default is the number of physical cores on your machine.\n\n ///\n\n /// See [configuration example](index.html#configuration) for a more details on this parameter\n\n pub fn configure_lanes(&mut self, lanes: u32) -> &mut Hasher<'a> {\n\n self.config.set_lanes(lanes);\n","file_path":"argonautica-rs/src/hasher.rs","rank":93,"score":43364.638702272576},{"content":" /// See [configuration example](index.html#configuration) for a more details on this parameter\n\n pub fn configure_password_clearing(&mut self, boolean: bool) -> &mut Hasher<'a> {\n\n self.config.set_password_clearing(boolean);\n\n self\n\n }\n\n /// Allows you to configure [`Hasher`](struct.Hasher.html) to erase the secret key bytes\n\n /// after each call to [`hash`](struct.Hasher.html#method.hash),\n\n /// [`hash_raw`](struct.Hasher#method.hash_raw), or their non-blocking equivalents.\n\n /// The default is to <b>not</b> clear out the secret key\n\n /// bytes (i.e. `false`). If you set this option to `true`, you must provide\n\n /// [`Hasher`](struct.Hasher.html) with a mutable secret key, e.g. a secret key\n\n /// constructed from a `String`, `Vec<u8>`, `&mut str`, `&mut [u8]`, etc. as opposed to\n\n /// one constructed from a `&str`, `&[u8]`, etc., or else hashing will return an\n\n /// [`Error`](struct.Error.html).\n\n ///\n\n /// See [configuration example](index.html#configuration) for a more details on this parameter\n\n pub fn configure_secret_key_clearing(&mut self, boolean: bool) -> &mut Hasher<'a> {\n\n self.config.set_secret_key_clearing(boolean);\n\n self\n\n }\n","file_path":"argonautica-rs/src/hasher.rs","rank":94,"score":43364.463823764934},{"content":" let mut hasher = hasher.to_owned();\n\n match hasher.config.cpu_pool() {\n\n Some(cpu_pool) => cpu_pool.spawn_fn(move || hasher.hash_raw()),\n\n None => {\n\n let cpu_pool = default_cpu_pool();\n\n hasher.config.set_cpu_pool(cpu_pool.clone());\n\n cpu_pool.spawn_fn(move || hasher.hash_raw())\n\n }\n\n }\n\n }\n\n /// As an extra security measure, if you want to hash without a secret key, which\n\n /// is not recommended, you must explicitly declare that this is your intention\n\n /// by calling this method and setting the `opt_out_of_secret_key` configuration to\n\n /// `true` (by default, it is set to `false`); otherwise hashing will return an error\n\n /// when you fail to provide a secret key\n\n pub fn opt_out_of_secret_key(&mut self, boolean: bool) -> &mut Hasher<'a> {\n\n self.config.set_opt_out_of_secret_key(boolean);\n\n self\n\n }\n\n /// Clones the [`Hasher`](struct.Hasher.html), returning a new\n","file_path":"argonautica-rs/src/hasher.rs","rank":95,"score":43364.2475386823},{"content":"}\n\n\n\n#[cfg(test)]\n\nmod tests {\n\n use super::*;\n\n use config::{Variant, Version};\n\n\n\n struct Test {\n\n variant: Variant,\n\n version: Version,\n\n expected: Vec<u8>,\n\n }\n\n\n\n impl Test {\n\n fn run(&self) {\n\n let mut hasher = Hasher::default();\n\n let raw_hash = hasher\n\n .configure_hash_len(32)\n\n .configure_iterations(3)\n\n .configure_lanes(4)\n","file_path":"argonautica-rs/src/hasher.rs","rank":96,"score":43363.93812471932},{"content":"## Hashing\n\n\n\nHashing passwords with <b>argonautica</b> is simple. Just instantiate a default\n\n[`Hasher`](struct.Hasher.html), provide it with a password and a secret key, and then\n\ncall the [`hash`](struct.Hasher.html#method.hash) method.\n\n```rust\n\nextern crate argonautica;\n\n\n\nuse argonautica::Hasher;\n\n\n\nfn main() {\n\n let mut hasher = Hasher::default();\n\n let hash = hasher\n\n .with_password(\"P@ssw0rd\")\n\n .with_secret_key(\"\\\n\n secret key that you should really store in a .env file \\\n\n instead of in code, but this is just an example\\\n\n \")\n\n .hash()\n\n .unwrap();\n\n\n\n println!(\"{}\", &hash);\n\n // 👆 prints a hash, which will be random since the default Hasher uses a random salt\n\n}\n\n```\n\n## Verifying\n\n\n\nVerifying passwords against a hash is equally as simple. Just instantiate a default\n\n[`Verifier`](struct.Verifier.html), provide it with the password and the hash you would\n\nlike to compare, provide it with the secret key that was used to create the hash, and\n\nthen call the [`verify`](struct.Verifier.html#method.verify) method.\n\n```rust\n\nextern crate argonautica;\n\n\n\nuse argonautica::Verifier;\n\n\n\nfn main() {\n\n let mut verifier = Verifier::default();\n\n let is_valid = verifier\n\n .with_hash(\"\n\n $argon2id$v=19$m=4096,t=192,p=4$\\\n\n o2y5PU86Vt+sr93N7YUGgC7AMpTKpTQCk4tNGUPZMY4$\\\n\n yzP/ukZRPIbZg6PvgnUUobUMbApfF9RH6NagL9L4Xr4\\\n\n \")\n\n .with_password(\"P@ssw0rd\")\n\n .with_secret_key(\"\\\n\n secret key that you should really store in a .env file \\\n\n instead of in code, but this is just an example\\\n\n \")\n\n .verify()\n\n .unwrap();\n\n\n\n assert!(is_valid);\n\n}\n\n```\n","file_path":"argonautica-rs/README.md","rank":98,"score":33.19858196080795},{"content":"extern crate argonautica;\n\nextern crate dotenv;\n\n#[macro_use]\n\nextern crate failure;\n\n\n\nuse std::collections::HashMap;\n\nuse std::env;\n\n\n\nuse argonautica::config::{Variant, Version};\n\nuse argonautica::input::{Salt, SecretKey};\n\nuse argonautica::{Hasher, Verifier};\n\n\n\n// Helper method to load the secret key from a .env file. Used in `main` below.\n","file_path":"argonautica-rs/examples/example_custom.rs","rank":99,"score":30.8381202154013}],"string":"[\n {\n \"content\": \"fn bench_crates(c: &mut Criterion) {\\n\\n // argon2rs\\n\\n let hasher = argon2rs::Argon2::new(\\n\\n /* passes */ DEFAULT_ITERATIONS,\\n\\n /* lanes */ default_lanes(),\\n\\n /* kib */ DEFAULT_MEMORY_SIZE,\\n\\n /* variant */ argon2rs::Variant::Argon2i,\\n\\n )\\n\\n .unwrap();\\n\\n let argon2rs = Fun::new(\\\"argon2rs\\\", move |b, _| {\\n\\n b.iter(|| {\\n\\n let mut out = [0u8; DEFAULT_HASH_LEN as usize];\\n\\n\\n\\n let password = PASSWORD.as_bytes();\\n\\n\\n\\n let mut rng = OsRng::new().unwrap();\\n\\n let mut salt = [0u8; DEFAULT_SALT_LEN as usize];\\n\\n rng.fill_bytes(&mut salt);\\n\\n\\n\\n hasher.hash(\\n\",\n \"file_path\": \"argonautica-rs/benches/bench_crates.rs\",\n \"rank\": 4,\n \"score\": 150432.2087319208\n },\n {\n \"content\": \"fn h0(_hasher: &mut Hasher) -> Result<[u8; 72], Error> {\\n\\n unimplemented!();\\n\\n}\\n\",\n \"file_path\": \"argonautica-rs/src/backend/rust/core/mod.rs\",\n \"rank\": 5,\n \"score\": 137391.12123706387\n },\n {\n \"content\": \"fn bench_crates(c: &mut Criterion) {\\n\\n // argonautica\\n\\n let mut hasher = argonautica::Hasher::fast_but_insecure();\\n\\n hasher.with_password(DOCUMENT);\\n\\n let argonautica = Fun::new(\\\"argonautica\\\", move |b, _| {\\n\\n b.iter(|| {\\n\\n let _ = hasher.hash().unwrap();\\n\\n })\\n\\n });\\n\\n\\n\\n // md5\\n\\n let md5 = Fun::new(\\\"md5\\\", move |b, _| {\\n\\n b.iter(|| {\\n\\n let _ = md5::compute(DOCUMENT.as_bytes());\\n\\n });\\n\\n });\\n\\n\\n\\n // sha256\\n\\n let sha256 = Fun::new(\\\"sha256\\\", move |b, _| {\\n\\n b.iter(|| {\\n\",\n \"file_path\": \"argonautica-rs/benches/bench_fast_but_insecure.rs\",\n \"rank\": 6,\n \"score\": 136956.57147666826\n },\n {\n \"content\": \"fn bench_threads(c: &mut Criterion) {\\n\\n c.bench_function_over_inputs(\\n\\n \\\"bench_threads\\\",\\n\\n |b, &&threads| {\\n\\n let bench = Bench {\\n\\n hasher: None,\\n\\n iterations: DEFAULT_ITERATIONS,\\n\\n memory_size: DEFAULT_MEMORY_SIZE,\\n\\n threads,\\n\\n }\\n\\n .setup();\\n\\n b.iter(|| bench.clone().run());\\n\\n },\\n\\n &THREADS,\\n\\n );\\n\\n}\\n\\n\\n\\ncriterion_group! {\\n\\n name = benches;\\n\\n config = Criterion::default().sample_size(SAMPLE_SIZE);\\n\\n targets = bench_threads,\\n\\n}\\n\\ncriterion_main!(benches);\\n\",\n \"file_path\": \"argonautica-rs/benches/bench_threads.rs\",\n \"rank\": 8,\n \"score\": 105914.03027892095\n },\n {\n \"content\": \"fn bench_inputs(c: &mut Criterion) {\\n\\n c.bench_function_over_inputs(\\n\\n \\\"bench_inputs\\\",\\n\\n |b, &input| {\\n\\n let iterations = input.iterations();\\n\\n let memory_size = input.memory_size();\\n\\n let bench = Bench {\\n\\n hasher: None,\\n\\n iterations,\\n\\n memory_size,\\n\\n threads: num_cpus::get_physical() as u32,\\n\\n }\\n\\n .setup();\\n\\n b.iter(|| bench.clone().run());\\n\\n },\\n\\n &INPUTS,\\n\\n );\\n\\n}\\n\\n\\n\\ncriterion_group! {\\n\\n name = benches;\\n\\n config = Criterion::default().sample_size(SAMPLE_SIZE);\\n\\n targets = bench_inputs,\\n\\n}\\n\\ncriterion_main!(benches);\\n\",\n \"file_path\": \"argonautica-rs/benches/bench_inputs.rs\",\n \"rank\": 9,\n \"score\": 105914.03027892095\n },\n {\n \"content\": \"fn run_c(exe: &str, dir: &Path, args: &[&str]) -> Vec<u8> {\\n\\n let output = Command::new(exe)\\n\\n .args(args)\\n\\n .current_dir(dir)\\n\\n .output()\\n\\n .unwrap();\\n\\n if !output.status.success() {\\n\\n panic!(\\n\\n \\\"\\\\nC executable failed:\\\\nstdout: {}stderr: {}\\\",\\n\\n String::from_utf8(output.stdout).unwrap(),\\n\\n String::from_utf8(output.stderr).unwrap(),\\n\\n )\\n\\n }\\n\\n output.stderr\\n\\n}\\n\\n\\n\",\n \"file_path\": \"argonautica-rs/tests/tests.rs\",\n \"rank\": 10,\n \"score\": 103809.74834363932\n },\n {\n \"content\": \"fn main() -> Result<(), failure::Error> {\\n\\n let temp = tempfile::tempdir()?;\\n\\n let temp_dir = temp.path();\\n\\n let temp_dir_str = temp_dir.to_str().unwrap();\\n\\n\\n\\n let blamka_header = if IS_SIMD {\\n\\n \\\"phc-winner-argon2/src/blake2/blamka-round-opt.h\\\"\\n\\n } else {\\n\\n \\\"phc-winner-argon2/src/blake2/blamka-round-ref.h\\\"\\n\\n };\\n\\n for header_path_str in &[\\n\\n \\\"phc-winner-argon2/include/argon2.h\\\",\\n\\n \\\"phc-winner-argon2/src/core.h\\\",\\n\\n \\\"phc-winner-argon2/src/encoding.h\\\",\\n\\n \\\"phc-winner-argon2/src/thread.h\\\",\\n\\n \\\"phc-winner-argon2/src/blake2/blake2-impl.h\\\",\\n\\n \\\"phc-winner-argon2/src/blake2/blake2.h\\\",\\n\\n blamka_header,\\n\\n ] {\\n\\n let header_path = Path::new(*header_path_str);\\n\",\n \"file_path\": \"argonautica-rs/build.rs\",\n \"rank\": 11,\n \"score\": 92683.88889200032\n },\n {\n \"content\": \"fn main() -> Result<(), failure::Error> {\\n\\n let mut hasher = Hasher::default();\\n\\n let hash = hasher\\n\\n .with_password(\\\"P@ssw0rd\\\")\\n\\n .with_secret_key(\\n\\n \\\"\\\\\\n\\n secret key that you should really store in \\\\\\n\\n an environment variable instead of in code, \\\\\\n\\n but this is just an example\\\\\\n\\n \\\",\\n\\n )\\n\\n .hash()?;\\n\\n\\n\\n println!(\\\"{}\\\", &hash);\\n\\n // 👆 prints a hash, which will be random since the default Hasher uses a random salt\\n\\n\\n\\n let mut verifier = Verifier::default();\\n\\n let is_valid = verifier\\n\\n .with_hash(&hash)\\n\\n .with_password(\\\"P@ssw0rd\\\")\\n\",\n \"file_path\": \"argonautica-rs/examples/example_very_simple.rs\",\n \"rank\": 12,\n \"score\": 88349.68656462249\n },\n {\n \"content\": \"fn main() -> Result<(), failure::Error> {\\n\\n let secret_key = load_secret_key()?;\\n\\n let mut hasher = Hasher::default();\\n\\n hasher\\n\\n .configure_hash_len(32)\\n\\n .configure_iterations(192)\\n\\n .configure_lanes(1)\\n\\n .configure_memory_size(2u32.pow(12))\\n\\n .configure_password_clearing(true)\\n\\n .configure_secret_key_clearing(false)\\n\\n .configure_threads(1)\\n\\n .configure_variant(Variant::Argon2id)\\n\\n .configure_version(Version::_0x13)\\n\\n .with_salt(Salt::random(16))\\n\\n .with_secret_key(&secret_key);\\n\\n\\n\\n let mut dictionary = HashMap::new();\\n\\n for password in &[\\\"P@ssw0rd\\\", \\\"Hello world!\\\", \\\"123456\\\", \\\"😊\\\"] {\\n\\n let hash = hasher.with_password(password.to_string()).hash()?;\\n\\n println!(\\\"{}\\\", &hash);\\n\",\n \"file_path\": \"argonautica-rs/examples/example_custom.rs\",\n \"rank\": 13,\n \"score\": 88349.68656462249\n },\n {\n \"content\": \"fn main() -> Result<(), failure::Error> {\\n\\n let secret_key = load_secret_key()?;\\n\\n let mut hasher = Hasher::default();\\n\\n let hash = hasher\\n\\n .with_password(\\\"P@ssw0rd\\\")\\n\\n .with_secret_key(&secret_key)\\n\\n .hash()?;\\n\\n println!(\\\"{}\\\", &hash);\\n\\n\\n\\n let mut verifier = Verifier::default();\\n\\n let is_valid = verifier\\n\\n .with_hash(&hash)\\n\\n .with_password(\\\"P@ssw0rd\\\")\\n\\n .with_secret_key(&secret_key)\\n\\n .verify()?;\\n\\n\\n\\n assert!(is_valid);\\n\\n Ok(())\\n\\n}\\n\",\n \"file_path\": \"argonautica-rs/examples/example_simple.rs\",\n \"rank\": 14,\n \"score\": 88349.68656462249\n },\n {\n \"content\": \"fn main() -> Result<(), failure::Error> {\\n\\n let salt = Salt::random(SALT_LEN);\\n\\n let secret_key =\\n\\n SecretKey::from_base64_encoded(\\\"t9nGEsDxjWtJYdYeExdB6/HU0vg+rT6czv6HSjVjZng=\\\")?;\\n\\n let threads = num_cpus::get();\\n\\n for memory_size in &MEMORY_SIZES {\\n\\n for iterations in &ITERATIONS {\\n\\n let mut hasher = Hasher::default();\\n\\n hasher\\n\\n .configure_hash_len(HASH_LEN)\\n\\n .configure_iterations(*iterations)\\n\\n .configure_lanes(threads as u32)\\n\\n .configure_memory_size(*memory_size)\\n\\n .configure_threads(threads as u32)\\n\\n .configure_variant(VARIANT)\\n\\n .configure_version(VERSION)\\n\\n .with_password(PASSWORD)\\n\\n .with_salt(&salt)\\n\\n .with_secret_key(&secret_key);\\n\\n let now = Instant::now();\\n\",\n \"file_path\": \"argonautica-rs/examples/calibrate_timing.rs\",\n \"rank\": 15,\n \"score\": 88349.68656462249\n },\n {\n \"content\": \"fn main() -> Result<(), failure::Error> {\\n\\n let secret_key = load_secret_key()?;\\n\\n\\n\\n let mut hasher = Hasher::default();\\n\\n let mut verifier = Verifier::default();\\n\\n\\n\\n let future = hasher\\n\\n .with_password(\\\"P@ssw0rd\\\")\\n\\n .with_secret_key(&secret_key)\\n\\n .hash_non_blocking()\\n\\n .and_then(|hash| {\\n\\n println!(\\\"{}\\\", &hash);\\n\\n verifier\\n\\n .with_hash(&hash)\\n\\n .with_password(\\\"P@ssw0rd\\\")\\n\\n .with_secret_key(&secret_key)\\n\\n .verify_non_blocking()\\n\\n })\\n\\n .and_then(|is_valid| {\\n\\n assert!(is_valid);\\n\\n Ok(())\\n\\n })\\n\\n .map_err(|e| e.into());\\n\\n\\n\\n future.wait()\\n\\n}\\n\",\n \"file_path\": \"argonautica-rs/examples/example_non_blocking.rs\",\n \"rank\": 16,\n \"score\": 86363.89151205108\n },\n {\n \"content\": \"fn main() -> Result<(), failure::Error> {\\n\\n let base64_encoded_secret_key = utils::generate_random_base64_encoded_string(32)?;\\n\\n println!(\\\"{}\\\", &base64_encoded_secret_key);\\n\\n Ok(())\\n\\n}\\n\",\n \"file_path\": \"argonautica-rs/examples/generate_secret_key.rs\",\n \"rank\": 17,\n \"score\": 86363.89151205108\n },\n {\n \"content\": \"class Hasher:\\n\\n \\\"\\\"\\\"\\n\\n A class that knows how to hash\\n\\n \\\"\\\"\\\"\\n\\n\\n\\n __slots__ = [\\n\\n 'additional_data',\\n\\n 'backend',\\n\\n 'hash_len',\\n\\n 'iterations',\\n\\n 'lanes',\\n\\n 'memory_size',\\n\\n 'salt',\\n\\n 'secret_key',\\n\\n 'threads',\\n\\n 'variant',\\n\\n 'version'\\n\\n ]\\n\\n\\n\\n def __init__(\\n\\n self,\\n\\n *,\\n\\n secret_key: Union[bytes, str, None],\\n\\n\\n\\n additional_data: Union[bytes, str, None] = None,\\n\\n backend: Backend = DEFAULT_BACKEND,\\n\\n hash_len: int = DEFAULT_HASH_LEN,\\n\\n iterations: int = DEFAULT_ITERATIONS,\\n\\n lanes: int = DEFAULT_LANES,\\n\\n memory_size: int = DEFAULT_MEMORY_SIZE,\\n\\n salt: Union[bytes, RandomSalt, str] = DEFAULT_SALT,\\n\\n threads: int = DEFAULT_THREADS,\\n\\n variant: Variant = DEFAULT_VARIANT,\\n\\n version: Version = DEFAULT_VERSION\\n\\n ) -> None:\\n\\n self.additional_data = additional_data\\n\\n self.salt = salt\\n\\n self.secret_key = secret_key\\n\\n self.backend = backend\\n\\n self.hash_len = hash_len\\n\\n self.iterations = iterations\\n\\n self.lanes = lanes\\n\\n self.memory_size = memory_size\\n\\n self.threads = threads\\n\\n self.variant = variant\\n\\n self.version = version\\n\\n\\n\\n def hash(\\n\\n self,\\n\\n *,\\n\\n password: Union[bytes, str],\\n\\n\\n\\n additional_data: Union[bytes, str, None, Void] = VOID,\\n\\n backend: Union[Backend, Void] = VOID,\\n\\n hash_len: Union[int, Void] = VOID,\\n\\n iterations: Union[int, Void] = VOID,\\n\\n lanes: Union[int, Void] = VOID,\\n\\n memory_size: Union[int, Void] = VOID,\\n\\n salt: Union[bytes, RandomSalt, str, Void] = VOID,\\n\\n secret_key: Union[bytes, str, None, Void] = VOID,\\n\\n threads: Union[int, Void] = VOID,\\n\\n variant: Union[Variant, Void] = VOID,\\n\\n version: Union[Version, Void] = VOID\\n\\n ) -> str:\\n\\n if isinstance(additional_data, Void):\\n\\n additional_data = self.additional_data\\n\\n if isinstance(backend, Void):\\n\\n backend = self.backend\\n\\n if isinstance(hash_len, Void):\\n\\n hash_len = self.hash_len\\n\\n if isinstance(iterations, Void):\\n\\n iterations = self.iterations\\n\\n if isinstance(lanes, Void):\\n\\n lanes = self.lanes\\n\\n if isinstance(memory_size, Void):\\n\\n memory_size = self.memory_size\\n\\n if isinstance(salt, Void):\\n\\n salt = self.salt\\n\\n if isinstance(secret_key, Void):\\n\\n secret_key = self.secret_key\\n\\n if isinstance(threads, Void):\\n\\n threads = self.threads\\n\\n if isinstance(variant, Void):\\n\\n variant = self.variant\\n\\n if isinstance(version, Void):\\n\\n version = self.version\\n\\n return hash(\\n\\n additional_data=additional_data,\\n\\n backend=backend,\\n\\n hash_len=hash_len,\\n\\n iterations=iterations,\\n\\n lanes=lanes,\\n\\n memory_size=memory_size,\\n\\n password=password,\\n\\n salt=salt,\\n\\n secret_key=secret_key,\\n\\n threads=threads,\\n\\n variant=variant,\\n\\n version=version\\n\",\n \"file_path\": \"argonautica-py/argonautica/core/hasher.py\",\n \"rank\": 18,\n \"score\": 83619.90265680093\n },\n {\n \"content\": \"fn validate_threads(threads: u32) -> Result<(), Error> {\\n\\n if threads == 0 {\\n\\n return Err(\\n\\n Error::new(ErrorKind::ThreadsTooFewError).add_context(format!(\\\"Threads: {}\\\", threads))\\n\\n );\\n\\n }\\n\\n if threads > 0x00ff_ffff {\\n\\n return Err(\\n\\n Error::new(ErrorKind::ThreadsTooManyError).add_context(format!(\\\"Threads: {}\\\", threads))\\n\\n );\\n\\n }\\n\\n Ok(())\\n\\n}\\n\\n\\n\\n#[cfg(test)]\\n\\nmod tests {\\n\\n use super::*;\\n\\n\\n\\n #[test]\\n\\n fn test_send() {\\n\",\n \"file_path\": \"argonautica-rs/src/config/hasher_config.rs\",\n \"rank\": 19,\n \"score\": 80443.88805369401\n },\n {\n \"content\": \"fn validate_iterations(iterations: u32) -> Result<(), Error> {\\n\\n if iterations == 0 {\\n\\n return Err(Error::new(ErrorKind::IterationsTooFewError)\\n\\n .add_context(format!(\\\"Iterations: {}\\\", iterations)));\\n\\n }\\n\\n Ok(())\\n\\n}\\n\\n\\n\",\n \"file_path\": \"argonautica-rs/src/config/hasher_config.rs\",\n \"rank\": 20,\n \"score\": 80443.88805369401\n },\n {\n \"content\": \"fn validate_lanes(lanes: u32) -> Result<(), Error> {\\n\\n if lanes == 0 {\\n\\n return Err(\\n\\n Error::new(ErrorKind::LanesTooFewError).add_context(format!(\\\"Lanes: {}\\\", lanes))\\n\\n );\\n\\n }\\n\\n if lanes > 0x00ff_ffff {\\n\\n return Err(\\n\\n Error::new(ErrorKind::LanesTooManyError).add_context(format!(\\\"Lanes: {}\\\", lanes))\\n\\n );\\n\\n }\\n\\n Ok(())\\n\\n}\\n\\n\\n\",\n \"file_path\": \"argonautica-rs/src/config/hasher_config.rs\",\n \"rank\": 21,\n \"score\": 80443.88805369401\n },\n {\n \"content\": \"fn validate_backend(backend: Backend) -> Result<(), Error> {\\n\\n match backend {\\n\\n Backend::C => (),\\n\\n Backend::Rust => return Err(Error::new(ErrorKind::BackendUnsupportedError)),\\n\\n }\\n\\n Ok(())\\n\\n}\\n\\n\\n\",\n \"file_path\": \"argonautica-rs/src/config/hasher_config.rs\",\n \"rank\": 22,\n \"score\": 80443.88805369401\n },\n {\n \"content\": \"fn validate_hash_len(hash_len: u32) -> Result<(), Error> {\\n\\n if hash_len < 4 {\\n\\n return Err(Error::new(ErrorKind::HashLenTooShortError)\\n\\n .add_context(format!(\\\"Hash len: {}\\\", hash_len)));\\n\\n }\\n\\n Ok(())\\n\\n}\\n\\n\\n\",\n \"file_path\": \"argonautica-rs/src/config/hasher_config.rs\",\n \"rank\": 23,\n \"score\": 77173.42208376409\n },\n {\n \"content\": \"// Helper method to load the secret key from a .env file. Used in `main` below.\\n\\nfn load_secret_key() -> Result<SecretKey<'static>, failure::Error> {\\n\\n let dotenv_path = env::current_dir()?.join(\\\"examples\\\").join(\\\"example.env\\\");\\n\\n dotenv::from_path(&dotenv_path).map_err(|e| format_err!(\\\"{}\\\", e))?;\\n\\n let base64_encoded_secret_key = env::var(\\\"SECRET_KEY\\\")?;\\n\\n Ok(SecretKey::from_base64_encoded(&base64_encoded_secret_key)?)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"argonautica-rs/examples/example_custom.rs\",\n \"rank\": 24,\n \"score\": 76038.67936723767\n },\n {\n \"content\": \"// Helper method to load the secret key from a .env file. Used in `main` below.\\n\\nfn load_secret_key() -> Result<SecretKey<'static>, failure::Error> {\\n\\n let dotenv_path = env::current_dir()?.join(\\\"examples\\\").join(\\\"example.env\\\");\\n\\n dotenv::from_path(&dotenv_path).map_err(|e| format_err!(\\\"{}\\\", e))?;\\n\\n let base64_encoded_secret_key = env::var(\\\"SECRET_KEY\\\")?;\\n\\n Ok(SecretKey::from_base64_encoded(&base64_encoded_secret_key)?)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"argonautica-rs/examples/example_simple.rs\",\n \"rank\": 25,\n \"score\": 76038.67936723767\n },\n {\n \"content\": \"// Helper method to load the secret key from a .env file. Used in `main` below.\\n\\nfn load_secret_key() -> Result<SecretKey<'static>, failure::Error> {\\n\\n let dotenv_path = env::current_dir()?.join(\\\"examples\\\").join(\\\"example.env\\\");\\n\\n dotenv::from_path(&dotenv_path).map_err(|e| format_err!(\\\"{}\\\", e))?;\\n\\n let base64_encoded_secret_key = env::var(\\\"SECRET_KEY\\\")?;\\n\\n Ok(SecretKey::from_base64_encoded(&base64_encoded_secret_key)?)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"argonautica-rs/examples/example_non_blocking.rs\",\n \"rank\": 26,\n \"score\": 74514.5184111809\n },\n {\n \"content\": \" uint8_t* salt;\\n\",\n \"file_path\": \"argonautica-rs/tests/c/src/test.h\",\n \"rank\": 27,\n \"score\": 74144.95158230896\n },\n {\n \"content\": \" def salt(self, value: Union[bytes, RandomSalt, str]) -> None:\\n\",\n \"file_path\": \"argonautica-py/argonautica/core/argon2.py\",\n \"rank\": 28,\n \"score\": 73604.21506430957\n },\n {\n \"content\": \" uint8_t *salt; /* salt array */\\n\",\n \"file_path\": \"argonautica-rs/tests/c/src/argon2/argon2.h\",\n \"rank\": 29,\n \"score\": 73052.50380640617\n },\n {\n \"content\": \" uint8_t salt[BLAKE2B_SALTBYTES]; /* 48 */\\n\",\n \"file_path\": \"argonautica-rs/tests/c/src/argon2/blake2/blake2.h\",\n \"rank\": 30,\n \"score\": 72019.25747518596\n },\n {\n \"content\": \"fn validate_memory_size(lanes: u32, memory_size: u32) -> Result<(), Error> {\\n\\n if memory_size < 8 * lanes {\\n\\n return Err(Error::new(ErrorKind::MemorySizeTooSmallError)\\n\\n .add_context(format!(\\\"Lanes: {}. Memory size: {}\\\", lanes, memory_size)));\\n\\n }\\n\\n if !(memory_size.is_power_of_two()) {\\n\\n return Err(Error::new(ErrorKind::MemorySizeInvalidError)\\n\\n .add_context(format!(\\\"Memory size: {}\\\", memory_size)));\\n\\n }\\n\\n Ok(())\\n\\n}\\n\\n\\n\",\n \"file_path\": \"argonautica-rs/src/config/hasher_config.rs\",\n \"rank\": 31,\n \"score\": 71473.86242436315\n },\n {\n \"content\": \"#[test]\\n\\n#[ignore]\\n\\nfn test_c_code() {\\n\\n let build_dir = PathBuf::from(\\\"tests/c/build\\\");\\n\\n build_c(&build_dir);\\n\\n let flags = [0b00]; // Note: for high level, cannot set flags\\n\\n let hash_lens = [8, 32];\\n\\n let iterations = [8, 32];\\n\\n let lane_threads = [(1, 1), (4, 4)]; // Note: for high level, lanes and threads have to be the same\\n\\n let memory_sizes = [32, 128];\\n\\n let password_lens = [8, 32];\\n\\n let salt_lens = [8, 32];\\n\\n let variants = [Variant::Argon2d, Variant::Argon2i, Variant::Argon2id];\\n\\n let versions = [Version::_0x10, Version::_0x13];\\n\\n for flags in &flags {\\n\\n for hash_len in &hash_lens {\\n\\n for iterations in &iterations {\\n\\n for lane_thread in &lane_threads {\\n\\n for memory_size in &memory_sizes {\\n\\n for password_len in &password_lens {\\n\\n for salt_len in &salt_lens {\\n\\n for variant in &variants {\\n\",\n \"file_path\": \"argonautica-rs/tests/tests.rs\",\n \"rank\": 32,\n \"score\": 67971.4283218132\n },\n {\n \"content\": \"#[test]\\n\\nfn test_integration() {\\n\\n let build_dir = PathBuf::from(\\\"tests/c/build\\\");\\n\\n build_c(&build_dir);\\n\\n let additional_data_lens = [0, 32];\\n\\n let flags = [0b00, 0b01, 0b10, 0b11];\\n\\n let hash_lens = [8, 32];\\n\\n let iterations = [8, 16];\\n\\n let lane_threads = [(1, 1), (4, 4), (4, 1)];\\n\\n let memory_sizes = [32, 64];\\n\\n let password_lens = [8, 32];\\n\\n let salt_lens = [8, 32];\\n\\n let secret_key_lens = [0, 32];\\n\\n let variants = [Variant::Argon2d, Variant::Argon2i, Variant::Argon2id];\\n\\n let versions = [Version::_0x10, Version::_0x13];\\n\\n for flags in &flags {\\n\\n for additional_data_len in &additional_data_lens {\\n\\n for hash_len in &hash_lens {\\n\\n for iterations in &iterations {\\n\\n for lane_thread in &lane_threads {\\n\\n for memory_size in &memory_sizes {\\n\",\n \"file_path\": \"argonautica-rs/tests/tests.rs\",\n \"rank\": 33,\n \"score\": 67971.4283218132\n },\n {\n \"content\": \"from typing import Union\\n\\n\\n\\nfrom argonautica.config import Backend\\n\\nfrom argonautica.core.ffi import ffi, lib\\n\\nfrom argonautica.defaults import *\\n\\nfrom argonautica.utils import Void, VOID\\n\\n\\n\\n\\n\\nclass Verifier:\\n\\n \\\"\\\"\\\"\\n\\n A class that knows how to verify\\n\\n \\\"\\\"\\\"\\n\\n __slots__ = [\\n\\n 'additional_data',\\n\\n 'backend',\\n\\n 'secret_key',\\n\\n 'threads'\\n\\n ]\\n\\n\\n\\n def __init__(\\n\\n self,\\n\\n *,\\n\\n secret_key: Union[bytes, str, None],\\n\\n\\n\\n additional_data: Union[bytes, str, None] = None,\\n\\n backend: Backend = DEFAULT_BACKEND,\\n\\n threads: int = DEFAULT_THREADS\\n\\n ) -> None:\\n\\n self.additional_data = additional_data\\n\\n self.secret_key = secret_key\\n\\n self.backend = backend\\n\\n self.threads = threads\\n\\n\\n\\n def verify(\\n\\n self,\\n\\n *,\\n\\n hash: str,\\n\\n password: Union[bytes, str],\\n\\n\\n\\n additional_data: Union[bytes, str, None, Void] = VOID,\\n\\n backend: Union[Backend, Void] = VOID,\\n\\n secret_key: Union[bytes, str, None, Void] = VOID,\\n\\n threads: Union[int, Void] = VOID\\n\\n ) -> bool:\\n\\n if isinstance(additional_data, Void):\\n\\n additional_data = self.additional_data\\n\\n if isinstance(backend, Void):\\n\\n backend = self.backend\\n\\n if isinstance(secret_key, Void):\\n\\n secret_key = self.secret_key\\n\\n if isinstance(threads, Void):\\n\\n threads = self.threads\\n\\n return verify(\\n\\n additional_data=additional_data,\\n\\n backend=backend,\\n\\n hash=hash,\\n\\n password=password,\\n\\n secret_key=secret_key,\\n\\n threads=threads\\n\\n )\\n\\n\\n\\n\\n\\ndef verify(\\n\\n *,\\n\\n hash: str,\\n\\n password: Union[bytes, str],\\n\\n secret_key: Union[bytes, str, None],\\n\\n\\n\\n additional_data: Union[bytes, str, None] = None,\\n\\n backend: Backend = DEFAULT_BACKEND,\\n\\n threads: int = DEFAULT_THREADS\\n\\n) -> bool:\\n\\n \\\"\\\"\\\"\\n\\n A standalone verify function\\n\\n \\\"\\\"\\\"\\n\\n # Additional data\\n\\n if additional_data is None:\\n\\n additional_data = ffi.NULL\\n\\n additional_data_len = 0\\n\\n elif isinstance(additional_data, bytes):\\n\\n additional_data_len = len(additional_data)\\n\\n elif isinstance(additional_data, str):\\n\\n additional_data = additional_data.encode('utf-8')\\n\\n additional_data_len = len(additional_data)\\n\\n else:\\n\\n raise TypeError(\\\"Type of additional_data must be bytes, str, or None\\\")\\n\\n\\n\\n # Password\\n\\n if isinstance(password, bytes):\\n\\n password_len = len(password)\\n\\n elif isinstance(password, str):\\n\\n password = password.encode('utf-8')\\n\\n password_len = len(password)\\n\\n else:\\n\\n raise TypeError(\\\"Type of password must be bytes or str\\\")\\n\\n\\n\\n # Secret key\\n\\n if secret_key is None:\\n\\n secret_key = ffi.NULL\\n\\n secret_key_len = 0\\n\\n elif isinstance(secret_key, bytes):\\n\\n secret_key_len = len(secret_key)\\n\\n elif isinstance(secret_key, str):\\n\\n secret_key = secret_key.encode('utf-8')\\n\\n secret_key_len = len(secret_key)\\n\\n else:\\n\\n raise TypeError(\\\"Type of secret_key must be bytes, str, or None\\\")\\n\\n\\n\\n is_valid = ffi.new(\\\"int*\\\", 0)\\n\\n err = lib.argonautica_verify(\\n\\n is_valid,\\n\\n additional_data,\\n\\n additional_data_len,\\n\\n hash.encode('utf-8'),\\n\\n password,\\n\\n password_len,\\n\\n secret_key,\\n\\n secret_key_len,\\n\\n backend.value,\\n\\n 0,\\n\\n 0,\\n\\n threads,\\n\\n )\\n\\n if err != lib.ARGONAUTICA_OK:\\n\\n error_msg_ptr = lib.argonautica_error_msg(err)\\n\\n error_msg = ffi.string(error_msg_ptr).decode(\\\"utf-8\\\")\\n\\n raise Exception(error_msg)\\n\\n\\n\\n if is_valid[0] == 1:\\n\\n return True\\n\\n\\n\\n return False\\n\",\n \"file_path\": \"argonautica-py/argonautica/core/verifier.py\",\n \"rank\": 34,\n \"score\": 66402.98814955515\n },\n {\n \"content\": \"import base64\\n\\nfrom typing import Union\\n\\n\\n\\nfrom argonautica.config import Backend, Variant, Version\\n\\nfrom argonautica.core.ffi import ffi, lib\\n\\nfrom argonautica.data import RandomSalt\\n\\nfrom argonautica.defaults import *\\n\\nfrom argonautica.utils import Void, VOID\\n\\n\\n\\n\\n\\nclass Hasher:\\n\\n \\\"\\\"\\\"\\n\\n A class that knows how to hash\\n\\n \\\"\\\"\\\"\\n\\n\\n\\n __slots__ = [\\n\\n 'additional_data',\\n\\n 'backend',\\n\\n 'hash_len',\\n\\n 'iterations',\\n\\n 'lanes',\\n\\n 'memory_size',\\n\\n 'salt',\\n\\n 'secret_key',\\n\\n 'threads',\\n\\n 'variant',\\n\\n 'version'\\n\\n ]\\n\\n\\n\\n def __init__(\\n\\n self,\\n\\n *,\\n\\n secret_key: Union[bytes, str, None],\\n\\n\\n\\n additional_data: Union[bytes, str, None] = None,\\n\\n backend: Backend = DEFAULT_BACKEND,\\n\\n hash_len: int = DEFAULT_HASH_LEN,\\n\\n iterations: int = DEFAULT_ITERATIONS,\\n\\n lanes: int = DEFAULT_LANES,\\n\\n memory_size: int = DEFAULT_MEMORY_SIZE,\\n\\n salt: Union[bytes, RandomSalt, str] = DEFAULT_SALT,\\n\\n threads: int = DEFAULT_THREADS,\\n\\n variant: Variant = DEFAULT_VARIANT,\\n\\n version: Version = DEFAULT_VERSION\\n\\n ) -> None:\\n\\n self.additional_data = additional_data\\n\\n self.salt = salt\\n\\n self.secret_key = secret_key\\n\\n self.backend = backend\\n\\n self.hash_len = hash_len\\n\\n self.iterations = iterations\\n\\n self.lanes = lanes\\n\\n self.memory_size = memory_size\\n\\n self.threads = threads\\n\\n self.variant = variant\\n\\n self.version = version\\n\\n\\n\\n def hash(\\n\\n self,\\n\\n *,\\n\\n password: Union[bytes, str],\\n\\n\\n\\n additional_data: Union[bytes, str, None, Void] = VOID,\\n\\n backend: Union[Backend, Void] = VOID,\\n\\n hash_len: Union[int, Void] = VOID,\\n\\n iterations: Union[int, Void] = VOID,\\n\\n lanes: Union[int, Void] = VOID,\\n\\n memory_size: Union[int, Void] = VOID,\\n\\n salt: Union[bytes, RandomSalt, str, Void] = VOID,\\n\\n secret_key: Union[bytes, str, None, Void] = VOID,\\n\\n threads: Union[int, Void] = VOID,\\n\\n variant: Union[Variant, Void] = VOID,\\n\\n version: Union[Version, Void] = VOID\\n\\n ) -> str:\\n\\n if isinstance(additional_data, Void):\\n\\n additional_data = self.additional_data\\n\\n if isinstance(backend, Void):\\n\\n backend = self.backend\\n\\n if isinstance(hash_len, Void):\\n\\n hash_len = self.hash_len\\n\\n if isinstance(iterations, Void):\\n\\n iterations = self.iterations\\n\\n if isinstance(lanes, Void):\\n\\n lanes = self.lanes\\n\\n if isinstance(memory_size, Void):\\n\\n memory_size = self.memory_size\\n\\n if isinstance(salt, Void):\\n\\n salt = self.salt\\n\\n if isinstance(secret_key, Void):\\n\\n secret_key = self.secret_key\\n\\n if isinstance(threads, Void):\\n\\n threads = self.threads\\n\\n if isinstance(variant, Void):\\n\\n variant = self.variant\\n\\n if isinstance(version, Void):\\n\\n version = self.version\\n\\n return hash(\\n\\n additional_data=additional_data,\\n\\n backend=backend,\\n\\n hash_len=hash_len,\\n\\n iterations=iterations,\\n\\n lanes=lanes,\\n\\n memory_size=memory_size,\\n\\n password=password,\\n\\n salt=salt,\\n\\n secret_key=secret_key,\\n\\n threads=threads,\\n\\n variant=variant,\\n\\n version=version\\n\\n )\\n\\n\\n\\n\\n\\ndef hash(\\n\\n *,\\n\\n password: Union[bytes, str],\\n\\n secret_key: Union[bytes, str, None],\\n\\n\\n\\n additional_data: Union[bytes, str, None] = None,\\n\\n backend: Backend = DEFAULT_BACKEND,\\n\\n hash_len: int = DEFAULT_HASH_LEN,\\n\\n iterations: int = DEFAULT_ITERATIONS,\\n\\n lanes: int = DEFAULT_LANES,\\n\\n memory_size: int = DEFAULT_MEMORY_SIZE,\\n\\n salt: Union[bytes, RandomSalt, str] = DEFAULT_SALT,\\n\\n threads: int = DEFAULT_THREADS,\\n\\n variant: Variant = DEFAULT_VARIANT,\\n\\n version: Version = DEFAULT_VERSION\\n\\n) -> str:\\n\\n \\\"\\\"\\\"\\n\\n A standalone hash function\\n\\n \\\"\\\"\\\"\\n\\n data = Validator(\\n\\n additional_data=additional_data,\\n\\n password=password,\\n\\n salt=salt,\\n\\n secret_key=secret_key,\\n\\n )\\n\\n encoded_len = lib.argonautica_encoded_len(\\n\\n hash_len,\\n\\n iterations,\\n\\n lanes,\\n\\n memory_size,\\n\\n data.salt_len,\\n\\n variant.value,\\n\\n )\\n\\n if encoded_len < 0:\\n\\n raise Exception(\\\"Error calculating length of string-encoded hash\\\")\\n\\n encoded = ffi.new(\\\"char[]\\\", b'\\\\0'*encoded_len)\\n\\n err = lib.argonautica_hash(\\n\\n encoded,\\n\\n data.additional_data,\\n\\n data.additional_data_len,\\n\\n data.password,\\n\\n data.password_len,\\n\\n data.salt,\\n\\n data.salt_len,\\n\\n data.secret_key,\\n\\n data.secret_key_len,\\n\\n backend.value,\\n\\n hash_len,\\n\\n iterations,\\n\\n lanes,\\n\\n memory_size,\\n\\n 0,\\n\\n 0,\\n\\n threads,\\n\\n variant.value,\\n\\n version.value,\\n\\n )\\n\\n if err != lib.ARGONAUTICA_OK:\\n\\n error_msg_ptr = lib.argonautica_error_msg(err)\\n\\n error_msg = ffi.string(error_msg_ptr).decode(\\\"utf-8\\\")\\n\\n raise Exception(error_msg)\\n\\n hash = ffi.string(encoded).decode(\\\"utf-8\\\")\\n\\n return hash\\n\\n\\n\\n\\n\\nclass Validator:\\n\\n def __init__(\\n\\n self,\\n\\n *,\\n\\n additional_data: Union[bytes, str, None],\\n\\n password: Union[bytes, str],\\n\\n salt: Union[bytes, RandomSalt, str],\\n\\n secret_key: Union[bytes, str, None]\\n\\n ) -> None:\\n\\n if additional_data is None:\\n\\n self.additional_data = ffi.NULL\\n\\n self.additional_data_len = 0\\n\\n elif isinstance(additional_data, bytes):\\n\\n self.additional_data = additional_data\\n\\n self.additional_data_len = len(self.additional_data)\\n\\n elif isinstance(additional_data, str):\\n\\n self.additional_data = additional_data.encode('utf-8')\\n\\n self.additional_data_len = len(self.additional_data)\\n\\n else:\\n\\n raise TypeError(\\\"Type of additional_data must be bytes, str, or None\\\")\\n\\n\\n\\n if isinstance(password, bytes):\\n\\n self.password = password\\n\\n self.password_len = len(self.password)\\n\\n elif isinstance(password, str):\\n\\n self.password = password.encode(\\\"utf-8\\\")\\n\\n self.password_len = len(self.password)\\n\\n else:\\n\\n raise TypeError(\\\"Type of password must be bytes or str\\\")\\n\\n\\n\\n if isinstance(salt, RandomSalt):\\n\\n self.salt = ffi.NULL\\n\\n self.salt_len = salt.len\\n\\n elif isinstance(salt, bytes):\\n\\n self.salt = salt\\n\\n self.salt_len = len(self.salt)\\n\\n elif isinstance(salt, str):\\n\\n self.salt = salt.encode('utf-8')\\n\\n self.salt_len = len(self.salt)\\n\\n else:\\n\\n raise TypeError(\\\"Type of salt must be bytes, RandomSalt, or str\\\")\\n\\n\\n\\n if secret_key is None:\\n\\n self.secret_key = ffi.NULL\\n\\n self.secret_key_len = 0\\n\\n elif isinstance(secret_key, bytes):\\n\\n self.secret_key = secret_key\\n\\n self.secret_key_len = len(self.secret_key)\\n\\n elif isinstance(secret_key, str):\\n\\n self.secret_key = secret_key.encode('utf-8')\\n\\n self.secret_key_len = len(self.secret_key)\\n\\n else:\\n\\n raise TypeError(\\\"Type of secret_key must be bytes, str, or None\\\")\\n\\n\\n\\n def __repr__(self) -> str:\\n\\n return str(self.__dict__)\\n\",\n \"file_path\": \"argonautica-py/argonautica/core/hasher.py\",\n \"rank\": 35,\n \"score\": 66356.29501657985\n },\n {\n \"content\": \"from argonautica import Verifier\\n\\n\\n\\nverifier = Verifier(secret_key='somesecret')\\n\\nis_valid = verifier.verify(\\n\\n hash='$argon2id$v=19$m=4096,t=192,p=4$n7F2qAECNLz7En4d9MsC6HIPWKiFZ5BHopIvoF1CBPs$Uk+pYp97ySGgal1OcrKfcA',\\n\\n password='P@ssw0rd',\\n\\n)\\n\\nassert(is_valid)\\n\",\n \"file_path\": \"argonautica-py/examples/verifier.py\",\n \"rank\": 36,\n \"score\": 62988.21812898883\n },\n {\n \"content\": \"from argonautica import Hasher\\n\\n\\n\\nhasher = Hasher(secret_key='somesecret', hash_len=16)\\n\\nhash = hasher.hash(password='P@ssw0rd')\\n\\nprint(hash)\\n\",\n \"file_path\": \"argonautica-py/examples/hasher.py\",\n \"rank\": 37,\n \"score\": 62940.1039446409\n },\n {\n \"content\": \"from argonautica import Hasher\\n\\nfrom argonautica.data import RandomSalt\\n\\n\\n\\nhasher = Hasher(\\n\\n salt=RandomSalt(16),\\n\\n # 👆 Here we're using a RandomSalt of length of 16 bytes\\n\\n # instead of the default, which is a RandomSalt of length 32 bytes\\n\\n secret_key=\\\"somesecret\\\"\\n\\n)\\n\\nhash = hasher.hash(password='P@ssw0rd')\\n\\nprint(hash)\\n\",\n \"file_path\": \"argonautica-py/examples/random_salt.py\",\n \"rank\": 38,\n \"score\": 62211.04631112622\n },\n {\n \"content\": \"fn test_c(input: &Input) {\\n\\n let args = generate_args(input);\\n\\n let args = args.iter().map(|s| (*s).as_ref()).collect::<Vec<&str>>();\\n\\n\\n\\n // Run C without simd\\n\\n let stderr = run_c(\\\"./test_high_level\\\", &input.build_dir, &args);\\n\\n let (encoded1, encoded2, hash1, hash2) = parse_stderr_c(&stderr);\\n\\n\\n\\n // Run C with simd\\n\\n let stderr = run_c(\\\"./test_high_level_simd\\\", &input.build_dir, &args);\\n\\n let (encoded3, encoded4, hash3, hash4) = parse_stderr_c(&stderr);\\n\\n\\n\\n // Print results\\n\\n println!(\\\"{}\\\", &encoded1);\\n\\n println!(\\\"{}\\\", &encoded2);\\n\\n println!(\\\"{}\\\", &encoded3);\\n\\n println!(\\\"{}\\\", &encoded4);\\n\\n println!(\\\"{:?}\\\", &hash1);\\n\\n println!(\\\"{:?}\\\", &hash2);\\n\\n println!(\\\"{:?}\\\", &hash3);\\n\",\n \"file_path\": \"argonautica-rs/tests/tests.rs\",\n \"rank\": 39,\n \"score\": 59119.582714158496\n },\n {\n \"content\": \"fn test(input: &Input) {\\n\\n let args = generate_args(input);\\n\\n let args = args.iter().map(|s| (*s).as_ref()).collect::<Vec<&str>>();\\n\\n\\n\\n // Run C without simd\\n\\n let stderr = run_c(\\\"./test_low_level\\\", &input.build_dir, &args);\\n\\n let (encoded1, hash1) = parse_stderr(&stderr);\\n\\n\\n\\n // Run C with simd\\n\\n let stderr = run_c(\\\"./test_low_level_simd\\\", &input.build_dir, &args);\\n\\n let (encoded2, hash2) = parse_stderr(&stderr);\\n\\n\\n\\n // Hash Rust\\n\\n let password_clearing = (input.flags & 0b01) == 1;\\n\\n let secret_key_clearing = ((input.flags >> 1) & 0b1) == 1;\\n\\n let mut hasher = Hasher::default();\\n\\n hasher\\n\\n .configure_hash_len(input.hash_len)\\n\\n .configure_iterations(input.iterations)\\n\\n .configure_lanes(input.lanes)\\n\",\n \"file_path\": \"argonautica-rs/tests/tests.rs\",\n \"rank\": 40,\n \"score\": 59119.582714158496\n },\n {\n \"content\": \"/// A utility function for generating a cryptographically-secure, random, base64-encoded string\\n\\n/// based on a custom base64 encoding (e.g. a\\n\\n/// [url-safe encoding](https://docs.rs/base64/0.9.1/base64/constant.URL_SAFE.html)).\\n\\n/// A quick glance at this function's source should give you a good idea of what the\\n\\n/// function is doing.\\n\\npub fn generate_random_base64_encoded_string_config(\\n\\n len: u32,\\n\\n config: base64::Config,\\n\\n) -> Result<String, Error> {\\n\\n let mut bytes = vec![0u8; len as usize];\\n\\n OsRng\\n\\n .try_fill_bytes(&mut bytes)\\n\\n .map_err(|e| Error::new(ErrorKind::OsRngError).add_context(format!(\\\"{}\\\", e)))?;\\n\\n let output = base64::encode_config(&bytes, config);\\n\\n Ok(output)\\n\\n}\\n\",\n \"file_path\": \"argonautica-rs/src/utils.rs\",\n \"rank\": 41,\n \"score\": 58009.5742502561\n },\n {\n \"content\": \"#[inline(always)]\\n\\npub fn default_lanes() -> u32 {\\n\\n num_cpus::get() as u32\\n\\n}\\n\\n\\n\\n/// Returns the number of logical cores on your machine\\n\",\n \"file_path\": \"argonautica-rs/src/config/defaults.rs\",\n \"rank\": 42,\n \"score\": 56848.96093079412\n },\n {\n \"content\": \"#[inline(always)]\\n\\npub fn default_threads() -> u32 {\\n\\n num_cpus::get() as u32\\n\\n}\\n\\n\\n\\n/// [`Backend::C`](enum.Backend.html#variant.C)\\n\\npub const DEFAULT_BACKEND: Backend = Backend::C;\\n\\n\\n\\n/// `32_u32`\\n\\npub const DEFAULT_HASH_LEN: u32 = 32;\\n\\n\\n\\n/// `192_u32`\\n\\npub const DEFAULT_ITERATIONS: u32 = 192;\\n\\n\\n\\n/// `4096_u32`\\n\\npub const DEFAULT_MEMORY_SIZE: u32 = 4_096;\\n\\n\\n\\n/// `false`\\n\\npub const DEFAULT_OPT_OUT_OF_SECRET_KEY: bool = false;\\n\\n\\n\\n/// `false`\\n\",\n \"file_path\": \"argonautica-rs/src/config/defaults.rs\",\n \"rank\": 43,\n \"score\": 56848.96093079412\n },\n {\n \"content\": \"fn base64_len(len: u32) -> usize {\\n\\n let bits = 8 * len as usize;\\n\\n let chars = bits / 6 + if bits % 6 != 0 { 1 } else { 0 };\\n\\n chars\\n\\n}\\n\\n\\n\\n/// Function that returns the length of a string-encoded hash (in bytes and including the NULL byte).\\n\\n/// If an error occurrs, the function returns -1\\n\\n#[no_mangle]\\n\\npub extern \\\"C\\\" fn argonautica_encoded_len(\\n\\n hash_len: u32,\\n\\n iterations: u32,\\n\\n lanes: u32,\\n\\n memory_size: u32,\\n\\n salt_len: u32,\\n\\n variant: argonautica_variant_t,\\n\\n) -> c_int {\\n\\n let mut buf = [0u8; 1024];\\n\\n\\n\\n let fixed_len = 17; // $$$$$v=19m=t=p=,,\\n\",\n \"file_path\": \"argonautica-c/src/utils.rs\",\n \"rank\": 44,\n \"score\": 55548.73651674787\n },\n {\n \"content\": \"#[inline(always)]\\n\\npub fn default_cpu_pool() -> CpuPool {\\n\\n CpuPool::new(num_cpus::get())\\n\\n}\\n\\n\\n\\n#[cfg(feature = \\\"serde\\\")]\\n\\npub(crate) fn default_cpu_pool_serde() -> Option<CpuPool> {\\n\\n None\\n\\n}\\n\\n\\n\\n/// Returns the number of logical cores on your machine\\n\",\n \"file_path\": \"argonautica-rs/src/config/defaults.rs\",\n \"rank\": 45,\n \"score\": 54824.75641844671\n },\n {\n \"content\": \"fn generate_args(input: &Input) -> Vec<String> {\\n\\n let rng = rand::thread_rng();\\n\\n let additional_data = if input.additional_data_len == 0 {\\n\\n \\\"\\\".to_string()\\n\\n } else {\\n\\n rng.sample_iter(&Alphanumeric)\\n\\n .take(input.additional_data_len)\\n\\n .collect::<String>()\\n\\n };\\n\\n let secret_key = if input.secret_key_len == 0 {\\n\\n \\\"\\\".to_string()\\n\\n } else {\\n\\n rng.sample_iter(&Alphanumeric)\\n\\n .take(input.secret_key_len)\\n\\n .collect::<String>()\\n\\n };\\n\\n let password = rng\\n\\n .sample_iter(&Alphanumeric)\\n\\n .take(input.password_len)\\n\\n .collect::<String>();\\n\",\n \"file_path\": \"argonautica-rs/tests/tests.rs\",\n \"rank\": 46,\n \"score\": 51530.40975410868\n },\n {\n \"content\": \"def verify(\\n\\n *,\\n\\n hash: str,\\n\\n password: Union[bytes, str],\\n\\n secret_key: Union[bytes, str, None],\\n\\n\\n\\n additional_data: Union[bytes, str, None] = None,\\n\\n backend: Backend = DEFAULT_BACKEND,\\n\\n threads: int = DEFAULT_THREADS\\n\\n) -> bool:\\n\\n \\\"\\\"\\\"\\n\\n A standalone verify function\\n\\n \\\"\\\"\\\"\\n\\n # Additional data\\n\\n if additional_data is None:\\n\\n additional_data = ffi.NULL\\n\\n additional_data_len = 0\\n\\n elif isinstance(additional_data, bytes):\\n\\n additional_data_len = len(additional_data)\\n\\n elif isinstance(additional_data, str):\\n\\n additional_data = additional_data.encode('utf-8')\\n\\n additional_data_len = len(additional_data)\\n\\n else:\\n\\n raise TypeError(\\\"Type of additional_data must be bytes, str, or None\\\")\\n\\n\\n\\n # Password\\n\\n if isinstance(password, bytes):\\n\\n password_len = len(password)\\n\\n elif isinstance(password, str):\\n\\n password = password.encode('utf-8')\\n\\n password_len = len(password)\\n\\n else:\\n\\n raise TypeError(\\\"Type of password must be bytes or str\\\")\\n\\n\\n\\n # Secret key\\n\\n if secret_key is None:\\n\\n secret_key = ffi.NULL\\n\\n secret_key_len = 0\\n\\n elif isinstance(secret_key, bytes):\\n\\n secret_key_len = len(secret_key)\\n\\n elif isinstance(secret_key, str):\\n\\n secret_key = secret_key.encode('utf-8')\\n\\n secret_key_len = len(secret_key)\\n\\n else:\\n\\n raise TypeError(\\\"Type of secret_key must be bytes, str, or None\\\")\\n\\n\\n\\n is_valid = ffi.new(\\\"int*\\\", 0)\\n\\n err = lib.argonautica_verify(\\n\\n is_valid,\\n\\n additional_data,\\n\\n additional_data_len,\\n\\n hash.encode('utf-8'),\\n\\n password,\\n\\n password_len,\\n\\n secret_key,\\n\\n secret_key_len,\\n\\n backend.value,\\n\\n 0,\\n\\n 0,\\n\\n threads,\\n\\n )\\n\\n if err != lib.ARGONAUTICA_OK:\\n\\n error_msg_ptr = lib.argonautica_error_msg(err)\\n\\n error_msg = ffi.string(error_msg_ptr).decode(\\\"utf-8\\\")\\n\\n raise Exception(error_msg)\\n\\n\\n\\n if is_valid[0] == 1:\\n\\n return True\\n\\n\\n\",\n \"file_path\": \"argonautica-py/argonautica/core/verifier.py\",\n \"rank\": 47,\n \"score\": 49268.13910933847\n },\n {\n \"content\": \"class Verifier:\\n\\n \\\"\\\"\\\"\\n\\n A class that knows how to verify\\n\\n \\\"\\\"\\\"\\n\\n __slots__ = [\\n\\n 'additional_data',\\n\\n 'backend',\\n\\n 'secret_key',\\n\\n 'threads'\\n\\n ]\\n\\n\\n\\n def __init__(\\n\\n self,\\n\\n *,\\n\\n secret_key: Union[bytes, str, None],\\n\\n\\n\\n additional_data: Union[bytes, str, None] = None,\\n\\n backend: Backend = DEFAULT_BACKEND,\\n\\n threads: int = DEFAULT_THREADS\\n\\n ) -> None:\\n\\n self.additional_data = additional_data\\n\\n self.secret_key = secret_key\\n\\n self.backend = backend\\n\\n self.threads = threads\\n\\n\\n\\n def verify(\\n\\n self,\\n\\n *,\\n\\n hash: str,\\n\\n password: Union[bytes, str],\\n\\n\\n\\n additional_data: Union[bytes, str, None, Void] = VOID,\\n\\n backend: Union[Backend, Void] = VOID,\\n\\n secret_key: Union[bytes, str, None, Void] = VOID,\\n\\n threads: Union[int, Void] = VOID\\n\\n ) -> bool:\\n\\n if isinstance(additional_data, Void):\\n\\n additional_data = self.additional_data\\n\\n if isinstance(backend, Void):\\n\\n backend = self.backend\\n\\n if isinstance(secret_key, Void):\\n\\n secret_key = self.secret_key\\n\\n if isinstance(threads, Void):\\n\\n threads = self.threads\\n\\n return verify(\\n\\n additional_data=additional_data,\\n\\n backend=backend,\\n\\n hash=hash,\\n\\n password=password,\\n\\n secret_key=secret_key,\\n\\n threads=threads\\n\",\n \"file_path\": \"argonautica-py/argonautica/core/verifier.py\",\n \"rank\": 48,\n \"score\": 49268.13910933847\n },\n {\n \"content\": \"fn build_c<P: AsRef<Path>>(build_dir: P) {\\n\\n let mut build_exists = BUILD_EXISTS.lock().unwrap();\\n\\n if *build_exists {\\n\\n return;\\n\\n }\\n\\n let build_dir = build_dir.as_ref();\\n\\n if build_dir.exists() {\\n\\n ::std::fs::remove_dir_all(build_dir).expect(\\\"unable to remove build dir\\\");\\n\\n }\\n\\n ::std::fs::create_dir_all(build_dir).expect(\\\"unable to create build dir\\\");\\n\\n let success = Command::new(\\\"cmake\\\")\\n\\n .arg(\\\"..\\\")\\n\\n .current_dir(build_dir)\\n\\n .status()\\n\\n .unwrap()\\n\\n .success();\\n\\n if !success {\\n\\n panic!(\\\"cmake failed\\\");\\n\\n }\\n\\n assert!(success);\\n\",\n \"file_path\": \"argonautica-rs/tests/tests.rs\",\n \"rank\": 49,\n \"score\": 49040.491071325014\n },\n {\n \"content\": \"fn parse_stderr(stderr: &[u8]) -> (String, Vec<u8>) {\\n\\n let stderr = ::std::str::from_utf8(stderr).expect(\\\"stderr from C is invalid utf-8\\\");\\n\\n let v = stderr.trim().split(\\\"\\\\n\\\").collect::<Vec<&str>>();\\n\\n if v.len() != 2 {\\n\\n panic!(\\\"invalid stderr from C: {}\\\", stderr);\\n\\n }\\n\\n let encoded = v[0].to_string();\\n\\n let hash = v[1]\\n\\n .replace(\\\"[\\\", \\\"\\\")\\n\\n .replace(\\\"]\\\", \\\"\\\")\\n\\n .split(\\\",\\\")\\n\\n .into_iter()\\n\\n .map(|s| Ok::<_, failure::Error>(s.parse::<u8>()?))\\n\\n .collect::<Result<Vec<u8>, failure::Error>>()\\n\\n .expect(\\\"unable to parse hash from C stderr\\\");\\n\\n (encoded, hash)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"argonautica-rs/tests/tests.rs\",\n \"rank\": 50,\n \"score\": 49040.491071325014\n },\n {\n \"content\": \"verify_result_t verify_high_level(verify_input_t* input)\\n\\n{\\n\\n int err = argon2_verify(\\n\\n /* const char* encoded */ input->encoded,\\n\\n /* const void* pwd */ (void*)(input->password),\\n\\n /* const size_t pwdlen */ input->password_len,\\n\\n /* argon2_type type */ input->variant\\n\\n );\\n\\n verify_result_t output = {};\\n\\n output.err = err;\\n\\n if (err == ARGON2_OK) {\\n\\n output.is_valid = true;\\n\\n return output;\\n\\n } else {\\n\\n output.is_valid = false;\\n\\n return output;\\n\\n }\\n\",\n \"file_path\": \"argonautica-rs/tests/c/src/verify.c\",\n \"rank\": 51,\n \"score\": 47813.56930715432\n },\n {\n \"content\": \"verify_result_t verify_low_level(verify_input_t* input)\\n\\n{\\n\\n verify_result_t output = {};\\n\\n if (input->password_len > ARGON2_MAX_PWD_LENGTH) {\\n\\n output.err = ARGON2_PWD_TOO_LONG;\\n\\n output.is_valid = false;\\n\\n return output;\\n\\n }\\n\\n if (input->encoded == NULL) {\\n\\n output.err = ARGON2_DECODING_FAIL;\\n\\n output.is_valid = false;\\n\\n return output;\\n\\n }\\n\\n size_t encoded_len = strlen(input->encoded);\\n\\n if (encoded_len > UINT32_MAX) {\\n\\n output.err = ARGON2_DECODING_FAIL;\\n\\n output.is_valid = false;\\n\\n return output;\\n\\n }\\n\\n\\n\\n argon2_context ctx = {};\\n\\n ctx.saltlen = (uint32_t)encoded_len;\\n\\n ctx.outlen = (uint32_t)encoded_len;\\n\\n\\n\\n ctx.salt = (uint8_t*)malloc(ctx.saltlen);\\n\\n ctx.out = (uint8_t*)malloc(ctx.outlen);\\n\\n if (ctx.salt == NULL || ctx.out == NULL) {\\n\\n free(ctx.out);\\n\\n free(ctx.salt);\\n\\n output.err = ARGON2_MEMORY_ALLOCATION_ERROR;\\n\\n output.is_valid = false;\\n\\n return output;\\n\\n }\\n\\n\\n\\n ctx.pwd = (uint8_t*)(input->password);\\n\\n ctx.pwdlen = (uint32_t)(input->password_len);\\n\\n\\n\\n int err = decode_string( // Note: Located in encoding.c\\n\\n /* argon2_context* ctx */ &ctx,\\n\\n /* const char* str */ input->encoded,\\n\\n /* argon2_type type */ input->variant\\n\\n );\\n\\n if (err != ARGON2_OK) {\\n\\n free(ctx.out);\\n\\n free(ctx.salt);\\n\\n output.err = err;\\n\\n output.is_valid = false;\\n\\n return output;\\n\\n }\\n\\n\\n\\n uint8_t* desired_result = ctx.out;\\n\\n ctx.out = (uint8_t*)malloc(ctx.outlen);\\n\\n if (ctx.out == NULL) {\\n\\n free(ctx.out);\\n\\n free(ctx.salt);\\n\\n free(desired_result);\\n\\n output.err = ARGON2_MEMORY_ALLOCATION_ERROR;\\n\\n output.is_valid = false;\\n\\n return output;\\n\\n }\\n\\n\\n\\n // This is my code\\n\\n ctx.ad = input->additional_data;\\n\\n ctx.adlen = (size_t)(input->additional_data_len);\\n\\n ctx.secret = input->secret_key;\\n\\n ctx.secretlen = (size_t)(input->secret_key_len);\\n\\n\\n\\n err = my_argon2_verify_ctx(\\n\\n /* argon2_context* context */ &ctx,\\n\\n /* const char* encoded */ (char *)desired_result,\\n\\n /* argon2_type variant */ input->variant\\n\\n );\\n\\n if (err != ARGON2_OK) {\\n\\n free(ctx.out);\\n\\n free(ctx.salt);\\n\\n free(desired_result);\\n\\n output.err = err;\\n\\n output.is_valid = false;\\n\\n return output;\\n\\n }\\n\\n\\n\\n free(ctx.out);\\n\\n free(ctx.salt);\\n\\n free(desired_result);\\n\\n output.err = ARGON2_OK;\\n\\n output.is_valid = true;\\n\\n return output;\\n\",\n \"file_path\": \"argonautica-rs/tests/c/src/verify.c\",\n \"rank\": 52,\n \"score\": 47813.56930715432\n },\n {\n \"content\": \"static int my_argon2_verify_ctx(argon2_context* context, const char* hash, argon2_type type);\\n\",\n \"file_path\": \"argonautica-rs/tests/c/src/verify.c\",\n \"rank\": 53,\n \"score\": 47813.56930715432\n },\n {\n \"content\": \"fn check_error(err: ffi::Argon2_ErrorCodes) -> Result<(), Error> {\\n\\n match err {\\n\\n ffi::Argon2_ErrorCodes_ARGON2_OK => Ok(()),\\n\\n ffi::Argon2_ErrorCodes_ARGON2_MEMORY_ALLOCATION_ERROR => {\\n\\n Err(Error::new(ErrorKind::MemoryAllocationError))\\n\\n }\\n\\n ffi::Argon2_ErrorCodes_ARGON2_THREAD_FAIL => Err(Error::new(ErrorKind::ThreadError)),\\n\\n _ => {\\n\\n let err_msg_ptr = unsafe { ffi::argon2_error_message(err) };\\n\\n if err_msg_ptr.is_null() {\\n\\n return Err(Error::new(ErrorKind::Bug)\\n\\n .add_context(format!(\\\"Unhandled error from C. Error code: {}\\\", err,)));\\n\\n }\\n\\n let err_msg_cstr = unsafe { CStr::from_ptr(err_msg_ptr) };\\n\\n let err_msg = err_msg_cstr.to_str().unwrap(); // Safe; see argon2_error_message\\n\\n Err(Error::new(ErrorKind::Bug).add_context(format!(\\n\\n \\\"Unhandled error from C. Error code: {}. Error {}\\\",\\n\\n err, err_msg,\\n\\n )))\\n\\n }\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"argonautica-rs/src/backend/c/hash_raw.rs\",\n \"rank\": 54,\n \"score\": 45586.58885538786\n },\n {\n \"content\": \"#![allow(non_camel_case_types)]\\n\\n\\n\\nuse std::ffi::CStr;\\n\\n\\n\\nuse argonautica::config::Backend;\\n\\nuse argonautica::Verifier;\\n\\nuse libc::{c_char, c_int};\\n\\n\\n\\nuse {argonautica_backend_t, argonautica_error_t};\\n\\n\\n\\n/// Function that verifies a password against a hash. It will modify the provided `is_valid` int\\n\\n/// and return an `argonautica_error_t` indicating whether or not the verification was successful.\\n\\n///\\n\\n/// On success, `is_valid` will be modified to be `1` if the hash / password combination is valid\\n\\n/// or `0` if the hash / password combination is not valid.\\n\\n///\\n\\n/// `encoded` is a `char*` pointing to the string-encoded hash.\\n\\n///\\n\\n/// For a description of the other arguments, see the documentation for\\n\\n/// `argonautica_hash`\\n\",\n \"file_path\": \"argonautica-c/src/verify.rs\",\n \"rank\": 55,\n \"score\": 44924.83701522577\n },\n {\n \"content\": \" let password_clearing = if password_clearing == 0 { false } else { true };\\n\\n let secret_key_clearing = if secret_key_clearing == 0 {\\n\\n false\\n\\n } else {\\n\\n true\\n\\n };\\n\\n\\n\\n let mut verifier = Verifier::default();\\n\\n verifier\\n\\n .configure_backend(backend)\\n\\n .configure_password_clearing(password_clearing)\\n\\n .configure_secret_key_clearing(secret_key_clearing)\\n\\n .configure_threads(threads);\\n\\n\\n\\n // Hash\\n\\n let encoded_cstr = unsafe { CStr::from_ptr(encoded) };\\n\\n let encoded = match encoded_cstr.to_str() {\\n\\n Ok(encoded) => encoded,\\n\\n Err(_) => return argonautica_error_t::ARGONAUTICA_ERROR_UTF8_ENCODE,\\n\\n };\\n\",\n \"file_path\": \"argonautica-c/src/verify.rs\",\n \"rank\": 56,\n \"score\": 44923.73418168585\n },\n {\n \"content\": \"#[no_mangle]\\n\\npub extern \\\"C\\\" fn argonautica_verify(\\n\\n is_valid: *mut c_int,\\n\\n additional_data: *const u8,\\n\\n additional_data_len: u32,\\n\\n encoded: *const c_char,\\n\\n password: *mut u8,\\n\\n password_len: u32,\\n\\n secret_key: *mut u8,\\n\\n secret_key_len: u32,\\n\\n backend: argonautica_backend_t,\\n\\n password_clearing: c_int,\\n\\n secret_key_clearing: c_int,\\n\\n threads: u32,\\n\\n) -> argonautica_error_t {\\n\\n if is_valid.is_null() || encoded.is_null() || password.is_null() {\\n\\n return argonautica_error_t::ARGONAUTICA_ERROR_NULL_PTR;\\n\\n }\\n\\n\\n\\n let backend: Backend = backend.into();\\n\",\n \"file_path\": \"argonautica-c/src/verify.rs\",\n \"rank\": 57,\n \"score\": 44923.70473513768\n },\n {\n \"content\": \" let valid = match verifier.verify() {\\n\\n Ok(valid) => valid,\\n\\n Err(e) => return e.into(),\\n\\n };\\n\\n\\n\\n if valid {\\n\\n unsafe {\\n\\n *is_valid = 1;\\n\\n };\\n\\n } else {\\n\\n unsafe {\\n\\n *is_valid = 0;\\n\\n };\\n\\n }\\n\\n\\n\\n argonautica_error_t::ARGONAUTICA_OK\\n\\n}\\n\",\n \"file_path\": \"argonautica-c/src/verify.rs\",\n \"rank\": 58,\n \"score\": 44918.40197994495\n },\n {\n \"content\": \" verifier.with_hash(encoded);\\n\\n\\n\\n // Additional data\\n\\n if !additional_data.is_null() {\\n\\n let additional_data =\\n\\n unsafe { ::std::slice::from_raw_parts(additional_data, additional_data_len as usize) };\\n\\n verifier.with_additional_data(additional_data);\\n\\n }\\n\\n\\n\\n // Password\\n\\n let password = unsafe { ::std::slice::from_raw_parts_mut(password, password_len as usize) };\\n\\n verifier.with_password(password);\\n\\n\\n\\n // Secret key\\n\\n if !secret_key.is_null() {\\n\\n let secret_key =\\n\\n unsafe { ::std::slice::from_raw_parts_mut(secret_key, secret_key_len as usize) };\\n\\n verifier.with_secret_key(secret_key);\\n\\n }\\n\\n\\n\",\n \"file_path\": \"argonautica-c/src/verify.rs\",\n \"rank\": 59,\n \"score\": 44917.407496489795\n },\n {\n \"content\": \"/// A utility function for generating a cryptographically-secure, random, base64-encoded string\\n\\n/// based on\\n\\n/// [standard base64 encoding](https://docs.rs/base64/0.9.1/base64/constant.STANDARD.html).\\n\\n/// A quick glance at this function's source should give you a good idea of what the function\\n\\n/// is doing.\\n\\npub fn generate_random_base64_encoded_string(len: u32) -> Result<String, Error> {\\n\\n let mut bytes = vec![0u8; len as usize];\\n\\n OsRng\\n\\n .try_fill_bytes(&mut bytes)\\n\\n .map_err(|e| Error::new(ErrorKind::OsRngError).add_context(format!(\\\"{}\\\", e)))?;\\n\\n let output = base64::encode_config(&bytes, base64::STANDARD);\\n\\n Ok(output)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"argonautica-rs/src/utils.rs\",\n \"rank\": 60,\n \"score\": 44351.00834677747\n },\n {\n \"content\": \"/// A utility function for generating cryptographically-secure random bytes. A quick glance at\\n\\n/// this function's source should give you a good idea of what the function is doing.\\n\\npub fn generate_random_bytes(len: u32) -> Result<Vec<u8>, Error> {\\n\\n let mut bytes = vec![0u8; len as usize];\\n\\n OsRng\\n\\n .try_fill_bytes(&mut bytes)\\n\\n .map_err(|e| Error::new(ErrorKind::OsRngError).add_context(format!(\\\"{}\\\", e)))?;\\n\\n Ok(bytes)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"argonautica-rs/src/utils.rs\",\n \"rank\": 61,\n \"score\": 44117.5204496145\n },\n {\n \"content\": \" fn test_serialize() {\\n\\n use serde;\\n\\n fn assert_serialize<T: serde::Serialize>() {}\\n\\n assert_serialize::<Verifier>();\\n\\n }\\n\\n\\n\\n #[cfg(feature = \\\"serde\\\")]\\n\\n #[test]\\n\\n fn test_deserialize() {\\n\\n use serde;\\n\\n fn assert_deserialize<'de, T: serde::Deserialize<'de>>() {}\\n\\n assert_deserialize::<Verifier>();\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"argonautica-rs/src/verifier.rs\",\n \"rank\": 62,\n \"score\": 43428.62819256038\n },\n {\n \"content\": \" self.hasher.secret_key()\\n\\n }\\n\\n}\\n\\n\\n\\n#[cfg(test)]\\n\\nmod tests {\\n\\n use super::*;\\n\\n\\n\\n #[cfg(feature = \\\"serde\\\")]\\n\\n #[test]\\n\\n fn test_verifier_serialization() {\\n\\n use serde_json;\\n\\n\\n\\n let password = \\\"P@ssw0rd\\\";\\n\\n let secret_key = \\\"secret\\\";\\n\\n\\n\\n let mut hasher = Hasher::default();\\n\\n hasher\\n\\n .configure_password_clearing(false)\\n\\n .configure_secret_key_clearing(false)\\n\",\n \"file_path\": \"argonautica-rs/src/verifier.rs\",\n \"rank\": 63,\n \"score\": 43427.46631768084\n },\n {\n \"content\": \" Raw(HashRaw),\\n\\n None,\\n\\n}\\n\\n\\n\\nimpl<'a> Default for Verifier<'a> {\\n\\n /// Same as the [`new`](struct.Verifier.html#method.new) method\\n\\n fn default() -> Verifier<'a> {\\n\\n Verifier {\\n\\n hash: Hash::default(),\\n\\n hasher: Hasher::default(),\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\n/// <b><u>One of the two main structs.</u></b> Use it to verify passwords against hashes\\n\\n#[derive(Debug)]\\n\\n#[cfg_attr(feature = \\\"serde\\\", derive(Serialize, Deserialize))]\\n\\n#[cfg_attr(feature = \\\"serde\\\", serde(rename_all = \\\"camelCase\\\"))]\\n\\npub struct Verifier<'a> {\\n\\n hash: Hash,\\n\",\n \"file_path\": \"argonautica-rs/src/verifier.rs\",\n \"rank\": 64,\n \"score\": 43427.20002985507\n },\n {\n \"content\": \" hash_raw.to_string(),\\n\\n password.as_bytes(),\\n\\n \\\"secret\\\".as_bytes()\\n\\n );\\n\\n };\\n\\n\\n\\n // Serialize Verifier\\n\\n let j = serde_json::to_string_pretty(&verifier1).expect(\\\"failed to serialize verifier\\\");\\n\\n // Deserialize Verifier\\n\\n let mut verifier2: Verifier =\\n\\n serde_json::from_str(&j).expect(\\\"failed to deserialize verifier\\\");\\n\\n // Assert that password and secret key have been erased\\n\\n assert!(verifier2.password().is_none());\\n\\n assert!(verifier2.secret_key().is_none());\\n\\n // Add a password and ensure that verify doesn't return an error\\n\\n verifier2.with_password(password);\\n\\n let is_valid = verifier2.verify().unwrap();\\n\\n assert!(!is_valid);\\n\\n // Add a secret key and ensure that verify returns is_valid\\n\\n verifier2.with_secret_key(secret_key);\\n\",\n \"file_path\": \"argonautica-rs/src/verifier.rs\",\n \"rank\": 65,\n \"score\": 43426.33964842312\n },\n {\n \"content\": \"use futures::Future;\\n\\nuse futures_cpupool::CpuPool;\\n\\n\\n\\nuse backend::decode_rust;\\n\\nuse config::{default_cpu_pool, Backend, VerifierConfig};\\n\\nuse input::{AdditionalData, Password, SecretKey};\\n\\nuse output::HashRaw;\\n\\nuse {Error, ErrorKind, Hasher};\\n\\n\\n\\nimpl Default for Hash {\\n\\n fn default() -> Hash {\\n\\n Hash::None\\n\\n }\\n\\n}\\n\\n\\n\\n#[derive(Clone, Debug)]\\n\\n#[cfg_attr(feature = \\\"serde\\\", derive(Serialize, Deserialize))]\\n\\n#[cfg_attr(feature = \\\"serde\\\", serde(rename_all = \\\"camelCase\\\"))]\\n\\npub enum Hash {\\n\\n Encoded(String),\\n\",\n \"file_path\": \"argonautica-rs/src/verifier.rs\",\n \"rank\": 66,\n \"score\": 43424.83722973414\n },\n {\n \"content\": \" let mut verifier = self.to_owned();\\n\\n match verifier.hasher.config.cpu_pool() {\\n\\n Some(cpu_pool) => cpu_pool.spawn_fn(move || verifier.verify()),\\n\\n None => {\\n\\n let cpu_pool = default_cpu_pool();\\n\\n verifier.hasher.config.set_cpu_pool(cpu_pool.clone());\\n\\n cpu_pool.spawn_fn(move || verifier.verify())\\n\\n }\\n\\n }\\n\\n }\\n\\n /// Allows you to provide [`Verifier`](struct.Verifier.html) with the additional data\\n\\n /// that was originally used to create the hash. Normally hashes are not created with\\n\\n /// additional data; so you are not likely to need this method\\n\\n pub fn with_additional_data<AD>(&mut self, additional_data: AD) -> &mut Verifier<'a>\\n\\n where\\n\\n AD: Into<AdditionalData>,\\n\\n {\\n\\n self.hasher.additional_data = Some(additional_data.into());\\n\\n self\\n\\n }\\n\",\n \"file_path\": \"argonautica-rs/src/verifier.rs\",\n \"rank\": 67,\n \"score\": 43424.138710143816\n },\n {\n \"content\": \" self\\n\\n }\\n\\n /// Allows you to configure [`Verifier`](struct.Verifier.html) to use a custom number of\\n\\n /// threads. The default is the number of physical cores on your machine. If you choose\\n\\n /// a number of threads that is greater than the lanes configuration of your hash,\\n\\n /// [`Verifier`](struct.Verifier.html) will use the minimum of the two.\\n\\n pub fn configure_threads(&mut self, threads: u32) -> &mut Verifier<'a> {\\n\\n self.hasher.config.set_threads(threads);\\n\\n self\\n\\n }\\n\\n /// Clones the [`Verifier`](struct.Verifier.html), returning a new\\n\\n /// [`Verifier`](struct.Verifier.html) with a `static` lifetime. Use this method if you\\n\\n /// would like to move a [`Verifier`](struct.Verifier.html) to another thread\\n\\n pub fn to_owned(&self) -> Verifier<'static> {\\n\\n Verifier {\\n\\n hash: self.hash.clone(),\\n\\n hasher: self.hasher.to_owned(),\\n\\n }\\n\\n }\\n\\n /// <b><u>The primary method (blocking version)</u></b>\\n\",\n \"file_path\": \"argonautica-rs/src/verifier.rs\",\n \"rank\": 68,\n \"score\": 43421.621702843164\n },\n {\n \"content\": \" /// or its non-blocking equivalent. The default is to <b>not</b> clear out the password\\n\\n /// bytes (i.e. `false`). If you set this option to `true`, you must provide\\n\\n /// [`Verifier`](struct.Verifier.html) with a mutable password, e.g. a password\\n\\n /// constructed from a `String`, `Vec<u8>`, `&mut str`, `&mut [u8]`, etc. as opposed to\\n\\n /// one constructed from a `&str`, `&[u8]`, etc., or else verifying will return an\\n\\n /// [`Error`](struct.Error.html).\\n\\n pub fn configure_password_clearing(&mut self, boolean: bool) -> &mut Verifier<'a> {\\n\\n self.hasher.config.set_password_clearing(boolean);\\n\\n self\\n\\n }\\n\\n /// Allows you to configure [`Verifier`](struct.Verifier.html) to erase the secret key bytes\\n\\n /// after each call to [`verify`](struct.Verifier.html#method.verify)\\n\\n /// or its non-blocking equivalent. The default is to <b>not</b> clear out the secret key\\n\\n /// bytes (i.e. `false`). If you set this option to `true`, you must provide\\n\\n /// [`Verifier`](struct.Verifier.html) with a mutable secret key, e.g. a secret key\\n\\n /// constructed from a `String`, `Vec<u8>`, `&mut str`, `&mut [u8]`, etc. as opposed to\\n\\n /// one constructed from a `&str`, `&[u8]`, etc., or else verifying will return an\\n\\n /// [`Error`](struct.Error.html).\\n\\n pub fn configure_secret_key_clearing(&mut self, boolean: bool) -> &mut Verifier<'a> {\\n\\n self.hasher.config.set_secret_key_clearing(boolean);\\n\",\n \"file_path\": \"argonautica-rs/src/verifier.rs\",\n \"rank\": 69,\n \"score\": 43421.51318012146\n },\n {\n \"content\": \" }\\n\\n /// Allows you to provide [`Verifier`](struct.Verifier.html) with the password\\n\\n /// to verify against\\n\\n pub fn with_password<P>(&mut self, password: P) -> &mut Verifier<'a>\\n\\n where\\n\\n P: Into<Password<'a>>,\\n\\n {\\n\\n self.hasher.password = Some(password.into());\\n\\n self\\n\\n }\\n\\n /// Allows you to provide [`Verifier`](struct.Verifier.html) with the secret key\\n\\n /// that was initially used to create the hash\\n\\n pub fn with_secret_key<SK>(&mut self, secret_key: SK) -> &mut Verifier<'a>\\n\\n where\\n\\n SK: Into<SecretKey<'a>>,\\n\\n {\\n\\n self.hasher.secret_key = Some(secret_key.into());\\n\\n self\\n\\n }\\n\\n /// Read-only access to the [`Verifier`](struct.Verifier.html)'s\\n\",\n \"file_path\": \"argonautica-rs/src/verifier.rs\",\n \"rank\": 70,\n \"score\": 43421.387144958164\n },\n {\n \"content\": \" /// Allows you to provide [`Verifier`](struct.Verifier.html) with the hash to verify\\n\\n /// against (in the form of a string-encoded hash like those produced by the\\n\\n /// [`hash`](struct.Hasher.html#method.hash) or\\n\\n /// [`hash_non_blocking`](struct.Hasher.html#method.hash_non_blocking)\\n\\n /// methods on [`Hasher`](struct.Hasher.html))\\n\\n pub fn with_hash<S>(&mut self, hash: S) -> &mut Verifier<'a>\\n\\n where\\n\\n S: AsRef<str>,\\n\\n {\\n\\n self.hash = Hash::Encoded(hash.as_ref().to_string());\\n\\n self\\n\\n }\\n\\n /// Allows you to provide [`Verifier`](struct.Verifier.html) with the hash to verify\\n\\n /// against (in the form of a [`HashRaw`](output/struct.HashRaw.html) like those produced\\n\\n /// by the [`hash_raw`](struct.Hasher.html#method.hash_raw) or\\n\\n /// [`hash_raw_non_blocking`](struct.Hasher.html#method.hash_raw_non_blocking)\\n\\n /// methods on [`Hasher`](struct.Hasher.html))\\n\\n pub fn with_hash_raw(&mut self, hash_raw: &HashRaw) -> &mut Verifier<'a> {\\n\\n self.hash = Hash::Raw(hash_raw.clone());\\n\\n self\\n\",\n \"file_path\": \"argonautica-rs/src/verifier.rs\",\n \"rank\": 71,\n \"score\": 43421.000183434044\n },\n {\n \"content\": \" self.hasher.config.set_variant(hash_raw.variant());\\n\\n self.hasher.config.set_version(hash_raw.version());\\n\\n self.hasher.salt = hash_raw.raw_salt_bytes().into();\\n\\n let hash_raw2 = self.hasher.hash_raw()?;\\n\\n let is_valid = if hash_raw.raw_hash_bytes() == hash_raw2.raw_hash_bytes() {\\n\\n true\\n\\n } else {\\n\\n false\\n\\n };\\n\\n Ok(is_valid)\\n\\n }\\n\\n Hash::None => return Err(Error::new(ErrorKind::HashMissingError)),\\n\\n }\\n\\n }\\n\\n /// <b><u>The primary method (non-blocking version)</u></b>\\n\\n ///\\n\\n /// Same as [`verify`](struct.Verifier.html#method.verify) except it returns a\\n\\n /// [`Future`](https://docs.rs/futures/0.1.21/futures/future/trait.Future.html)\\n\\n /// instead of a [`Result`](https://doc.rust-lang.org/std/result/enum.Result.html)\\n\\n pub fn verify_non_blocking(&mut self) -> impl Future<Item = bool, Error = Error> {\\n\",\n \"file_path\": \"argonautica-rs/src/verifier.rs\",\n \"rank\": 72,\n \"score\": 43418.98956639031\n },\n {\n \"content\": \" /// [`Backend::Rust`](config/enum.Backend.html#variant.Rust) it will error</i>\\n\\n pub fn configure_backend(&mut self, backend: Backend) -> &mut Verifier<'a> {\\n\\n self.hasher.config.set_backend(backend);\\n\\n self\\n\\n }\\n\\n /// Allows you to configure [`Verifier`](struct.Verifier.html) with a custom\\n\\n /// [`CpuPool`](https://docs.rs/futures-cpupool/0.1.8/futures_cpupool/struct.CpuPool.html).\\n\\n /// The default [`Verifier`](struct.Verifier.html) does not have a cpu pool, which is\\n\\n /// only needed for the [`verify_non_blocking`](struct.Verifier.html#method.verify_non_blocking)\\n\\n /// method. If you call [`verify_non_blocking`](struct.Verifier.html#method.verify_non_blocking)\\n\\n /// without a cpu pool, a default cpu pool will be created for you on the fly; so even\\n\\n /// if you never configure [`Verifier`](struct.Verifier.html) with this method you can still\\n\\n /// use the [`verify_non_blocking`](struct.Verifier.html#method.verify_non_blocking) method.\\n\\n /// The default cpu pool has as many threads as the number of logical cores on your machine\\n\\n pub fn configure_cpu_pool(&mut self, cpu_pool: CpuPool) -> &mut Verifier<'a> {\\n\\n self.hasher.config.set_cpu_pool(cpu_pool);\\n\\n self\\n\\n }\\n\\n /// Allows you to configure [`Verifier`](struct.Verifier.html) to erase the password bytes\\n\\n /// after each call to [`verify`](struct.Verifier.html#method.verify)\\n\",\n \"file_path\": \"argonautica-rs/src/verifier.rs\",\n \"rank\": 73,\n \"score\": 43418.695709864136\n },\n {\n \"content\": \" .with_additional_data(\\\"additional data\\\")\\n\\n .with_password(password)\\n\\n .with_secret_key(secret_key)\\n\\n .with_salt(\\\"somesalt\\\");\\n\\n let hash_raw = hasher.hash_raw().expect(\\\"failed to hash_raw\\\");\\n\\n\\n\\n let mut verifier1 = Verifier::default();\\n\\n verifier1\\n\\n .configure_password_clearing(false)\\n\\n .configure_secret_key_clearing(false)\\n\\n .with_additional_data(\\\"additional data\\\")\\n\\n .with_password(password)\\n\\n .with_secret_key(secret_key)\\n\\n .with_hash_raw(&hash_raw);\\n\\n let is_valid = verifier1.verify().unwrap();\\n\\n if !is_valid {\\n\\n panic!(\\n\\n \\\"\\\\nverifier1:\\\\n{:#?}\\\\nAdditional Data: {:?}\\\\nHash: {}\\\\nPasswod: {:?}\\\\nSecret key: {:?}\\\",\\n\\n verifier1,\\n\\n \\\"additional data\\\".as_bytes(),\\n\",\n \"file_path\": \"argonautica-rs/src/verifier.rs\",\n \"rank\": 74,\n \"score\": 43416.74062029756\n },\n {\n \"content\": \" ///\\n\\n /// After you have configured [`Verifier`](struct.Verifier.html) to your liking and provided\\n\\n /// it will all the data it needs to verify a password, i.e.\\n\\n /// * a string-encoded hash or [`HashRaw`](output/struct.HashRaw.html),\\n\\n /// * a [`Password`](input/struct.Password.html),\\n\\n /// * a [`SecretKey`](input/struct.SecretKey.html) (if required),\\n\\n /// * [`AdditionalData`](input/struct.AdditionalData.html) (if required),\\n\\n ///\\n\\n /// call this method to verify that the password matches the hash or\\n\\n /// [`HashRaw`](output/struct.HashRaw.html)\\n\\n pub fn verify(&mut self) -> Result<bool, Error> {\\n\\n match self.hash {\\n\\n Hash::Encoded(ref s) => {\\n\\n let hash_raw = decode_rust(s)?;\\n\\n self.hasher\\n\\n .config\\n\\n .set_hash_len(hash_raw.raw_hash_bytes().len() as u32);\\n\\n self.hasher.config.set_iterations(hash_raw.iterations());\\n\\n self.hasher.config.set_lanes(hash_raw.lanes());\\n\\n self.hasher.config.set_memory_size(hash_raw.memory_size());\\n\",\n \"file_path\": \"argonautica-rs/src/verifier.rs\",\n \"rank\": 75,\n \"score\": 43415.793874291754\n },\n {\n \"content\": \" /// [`AdditionalData`](input/struct.AdditionalData.html), if any\\n\\n pub fn additional_data(&self) -> Option<&AdditionalData> {\\n\\n self.hasher.additional_data()\\n\\n }\\n\\n /// Read-only access to the [`Verifier`](struct.Verifier.html)'s\\n\\n /// [`VerifierConfig`](config/struct.VerifierConfig.html)\\n\\n pub fn config(&self) -> VerifierConfig {\\n\\n VerifierConfig::new(\\n\\n /* backend */ self.hasher.config.backend(),\\n\\n /* cpu_pool */ self.hasher.config.cpu_pool(),\\n\\n /* password_clearing */ self.hasher.config.password_clearing(),\\n\\n /* secret_key_clearing */ self.hasher.config.secret_key_clearing(),\\n\\n /* threads */ self.hasher.config.threads(),\\n\\n )\\n\\n }\\n\\n /// Returns the [`Verifier`](struct.Verifier.html)'s string-encoded hash, if any\\n\\n pub fn hash(&self) -> Option<String> {\\n\\n match self.hash {\\n\\n Hash::Encoded(ref s) => Some(s.to_string()),\\n\\n Hash::Raw(ref hash_raw) => Some(hash_raw.encode_rust()),\\n\",\n \"file_path\": \"argonautica-rs/src/verifier.rs\",\n \"rank\": 76,\n \"score\": 43414.661007889095\n },\n {\n \"content\": \" hasher: Hasher<'a>,\\n\\n}\\n\\n\\n\\nimpl<'a> Verifier<'a> {\\n\\n /// Creates a new [`Verifier`](struct.Verifier.html) with the following configuration:\\n\\n /// * `backend`: [`Backend::C`](config/enum.Backend.html#variant.C)\\n\\n /// * `cpu_pool`: A [`CpuPool`](https://docs.rs/futures-cpupool/0.1.8/futures_cpupool/struct.CpuPool.html) ...\\n\\n /// * with threads equal to the number of logical cores on your machine\\n\\n /// * that is lazily created, i.e. created only if / when you call the method that\\n\\n /// needs it ([`verify_non_blocking`](struct.Verifier.html#method.verify_non_blocking))\\n\\n /// * `password_clearing`: `false`\\n\\n /// * `secret_key_clearing`: `false`\\n\\n /// * `threads`: The number of logical cores on your machine\\n\\n pub fn new() -> Verifier<'a> {\\n\\n Verifier::default()\\n\\n }\\n\\n /// Allows you to configure [`Verifier`](struct.Verifier.html) with a custom backend. The\\n\\n /// default backend is [`Backend::C`](config/enum.Backend.html#variant.C), <i>which is\\n\\n /// currently the only backend supported. A Rust backend is planned, but is not currently\\n\\n /// available. If you configure a [`Verifier`](struct.Verifier.html) with\\n\",\n \"file_path\": \"argonautica-rs/src/verifier.rs\",\n \"rank\": 77,\n \"score\": 43413.45309777219\n },\n {\n \"content\": \" self.hasher.config.set_opt_out_of_secret_key(true);\\n\\n self.hasher.config.set_variant(hash_raw.variant());\\n\\n self.hasher.config.set_version(hash_raw.version());\\n\\n self.hasher.salt = hash_raw.raw_salt_bytes().into();\\n\\n let hash_raw2 = self.hasher.hash_raw()?;\\n\\n let is_valid = if hash_raw.raw_hash_bytes() == hash_raw2.raw_hash_bytes() {\\n\\n true\\n\\n } else {\\n\\n false\\n\\n };\\n\\n Ok(is_valid)\\n\\n }\\n\\n Hash::Raw(ref hash_raw) => {\\n\\n self.hasher\\n\\n .config\\n\\n .set_hash_len(hash_raw.raw_hash_bytes().len() as u32);\\n\\n self.hasher.config.set_iterations(hash_raw.iterations());\\n\\n self.hasher.config.set_lanes(hash_raw.lanes());\\n\\n self.hasher.config.set_memory_size(hash_raw.memory_size());\\n\\n self.hasher.config.set_opt_out_of_secret_key(true);\\n\",\n \"file_path\": \"argonautica-rs/src/verifier.rs\",\n \"rank\": 78,\n \"score\": 43413.337365598876\n },\n {\n \"content\": \" let is_valid = verifier2.verify().unwrap();\\n\\n if !is_valid {\\n\\n panic!(\\\"\\\\nverifier2:\\\\n{:#?}\\\\n\\\", verifier2);\\n\\n };\\n\\n }\\n\\n\\n\\n #[test]\\n\\n fn test_send() {\\n\\n fn assert_send<T: Send>() {}\\n\\n assert_send::<Verifier>();\\n\\n }\\n\\n\\n\\n #[test]\\n\\n fn test_sync() {\\n\\n fn assert_sync<T: Sync>() {}\\n\\n assert_sync::<Verifier>();\\n\\n }\\n\\n\\n\\n #[cfg(feature = \\\"serde\\\")]\\n\\n #[test]\\n\",\n \"file_path\": \"argonautica-rs/src/verifier.rs\",\n \"rank\": 79,\n \"score\": 43413.27401543583\n },\n {\n \"content\": \" Hash::None => None,\\n\\n }\\n\\n }\\n\\n /// Returns the [`Verifier`](struct.Verifier.html)'s [`HashRaw`](output/struct.HashRaw.html),\\n\\n /// if any\\n\\n pub fn hash_raw(&self) -> Result<Option<HashRaw>, Error> {\\n\\n match self.hash {\\n\\n Hash::Encoded(ref s) => Ok(Some(decode_rust(s)?)),\\n\\n Hash::Raw(ref hash_raw) => Ok(Some(hash_raw.clone())),\\n\\n Hash::None => Ok(None),\\n\\n }\\n\\n }\\n\\n /// Read-only access to the [`Verifier`](struct.Verifier.html)'s\\n\\n /// [`Password`](input/struct.Password.html), if any\\n\\n pub fn password(&self) -> Option<&Password<'a>> {\\n\\n self.hasher.password()\\n\\n }\\n\\n /// Read-only access to the [`Verifier`](struct.Verifier.html)'s\\n\\n /// [`SecretKey`](input/struct.SecretKey.html), if any\\n\\n pub fn secret_key(&self) -> Option<&SecretKey<'a>> {\\n\",\n \"file_path\": \"argonautica-rs/src/verifier.rs\",\n \"rank\": 80,\n \"score\": 43412.47540699244\n },\n {\n \"content\": \" }\\n\\n}\\n\\n\\n\\n/// <b><u>One of the two main structs.</u></b> Use it to turn passwords into hashes\\n\\n#[derive(Debug)]\\n\\n#[cfg_attr(feature = \\\"serde\\\", derive(Serialize, Deserialize))]\\n\\n#[cfg_attr(feature = \\\"serde\\\", serde(rename_all = \\\"camelCase\\\"))]\\n\\npub struct Hasher<'a> {\\n\\n pub(crate) additional_data: Option<AdditionalData>,\\n\\n pub(crate) config: HasherConfig,\\n\\n #[cfg_attr(feature = \\\"serde\\\", serde(skip_serializing, skip_deserializing))]\\n\\n pub(crate) password: Option<Password<'a>>,\\n\\n pub(crate) salt: Salt,\\n\\n #[cfg_attr(feature = \\\"serde\\\", serde(skip_serializing, skip_deserializing))]\\n\\n pub(crate) secret_key: Option<SecretKey<'a>>,\\n\\n}\\n\\n\\n\\nimpl<'a> Hasher<'a> {\\n\\n /// Creates a new [`Hasher`](struct.Hasher.html) with a sensible default configuration\\n\\n /// for the average machine (e.g. an early-2014 MacBook Air).\\n\",\n \"file_path\": \"argonautica-rs/src/hasher.rs\",\n \"rank\": 81,\n \"score\": 43379.34813039792\n },\n {\n \"content\": \" use serde_json;\\n\\n\\n\\n let password = \\\"P@ssw0rd\\\";\\n\\n let secret_key = \\\"secret\\\";\\n\\n\\n\\n let mut hasher1 = Hasher::default();\\n\\n hasher1\\n\\n .configure_password_clearing(false)\\n\\n .with_additional_data(\\\"additional data\\\")\\n\\n .with_password(password)\\n\\n .with_secret_key(secret_key)\\n\\n .with_salt(\\\"somesalt\\\");\\n\\n let hash1 = hasher1.hash().expect(\\\"failed to hash\\\");\\n\\n let hash_raw1 = hasher1.hash_raw().expect(\\\"failed to hash_raw\\\");\\n\\n\\n\\n // Serialize Hasher\\n\\n let j = serde_json::to_string_pretty(&hasher1).expect(\\\"failed to serialize hasher\\\");\\n\\n // Deserialize Hasher\\n\\n let mut hasher2: Hasher = serde_json::from_str(&j).expect(\\\"failed to deserialize hasher\\\");\\n\\n // Assert that password and secret key have been erased\\n\",\n \"file_path\": \"argonautica-rs/src/hasher.rs\",\n \"rank\": 82,\n \"score\": 43379.252657659315\n },\n {\n \"content\": \" #[test]\\n\\n fn test_sync() {\\n\\n fn assert_sync<T: Sync>() {}\\n\\n assert_sync::<Hasher>();\\n\\n }\\n\\n\\n\\n #[cfg(feature = \\\"serde\\\")]\\n\\n #[test]\\n\\n fn test_serialize() {\\n\\n use serde;\\n\\n fn assert_serialize<T: serde::Serialize>() {}\\n\\n assert_serialize::<Hasher>();\\n\\n }\\n\\n\\n\\n #[cfg(feature = \\\"serde\\\")]\\n\\n #[test]\\n\\n fn test_deserialize() {\\n\\n use serde;\\n\\n fn assert_deserialize<'de, T: serde::Deserialize<'de>>() {}\\n\\n assert_deserialize::<Hasher>();\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"argonautica-rs/src/hasher.rs\",\n \"rank\": 83,\n \"score\": 43375.1129466167\n },\n {\n \"content\": \" {\\n\\n self.password = Some(password.into());\\n\\n self\\n\\n }\\n\\n /// Allows you to provide [`Hasher`](struct.Hasher.html) with a custom\\n\\n /// [`Salt`](input/struct.Salt.html) to include in the hash. The default\\n\\n /// [`Hasher`](struct.Hasher.html) is configured to use a random\\n\\n /// [`Salt`](input/struct.Salt.html) of 32 bytes; so there is no need\\n\\n /// to call this method. If you would like to use a random\\n\\n /// [`Salt`](input/struct.Salt.html) of different length, you can call this method with\\n\\n /// `Salt::random(your_custom_length_in_bytes)`. Using a deterministic\\n\\n /// [`Salt`](input/struct.Salt.html) is possible, but discouraged\\n\\n pub fn with_salt<S>(&mut self, salt: S) -> &mut Hasher<'a>\\n\\n where\\n\\n S: Into<Salt>,\\n\\n {\\n\\n self.salt = salt.into();\\n\\n self\\n\\n }\\n\\n /// Allows you to provide [`Hasher`](struct.Hasher.html) with a secret key that will be used\\n\",\n \"file_path\": \"argonautica-rs/src/hasher.rs\",\n \"rank\": 84,\n \"score\": 43369.80929005167\n },\n {\n \"content\": \" /// The default and latest (as of 5/18) is\\n\\n /// [`Version::_0x13`](config/enum.Version.html#variant._0x13).\\n\\n /// Do <b>not</b> use a different version unless you have a specific reason to do so.\\n\\n ///\\n\\n /// See [configuration example](index.html#configuration) for a more details on this parameter\\n\\n pub fn configure_version(&mut self, version: Version) -> &mut Hasher<'a> {\\n\\n self.config.set_version(version);\\n\\n self\\n\\n }\\n\\n /// <b><u>The primary method (blocking version).</u></b>\\n\\n ///\\n\\n /// After you have configured a [`Hasher`](struct.Hasher.html) to your liking and provided\\n\\n /// it will all the data you would like to hash, e.g.\\n\\n /// * a [`Password`](input/struct.Password.html),\\n\\n /// * a [`Salt`](input/struct.Salt.html) (note: it is recommened you use the default random salt),\\n\\n /// * a [`SecretKey`](input/struct.SecretKey.html),\\n\\n /// * [`AdditionalData`](input/struct.AdditionalData.html) (optional),\\n\\n ///\\n\\n /// call this method in order to produce a string-encoded hash, which is safe to store in a\\n\\n /// database and against which you can verify passwords later\\n\",\n \"file_path\": \"argonautica-rs/src/hasher.rs\",\n \"rank\": 85,\n \"score\": 43368.57057361049\n },\n {\n \"content\": \" }\\n\\n /// Read-only access to the [`Hasher`](struct.Hasher.html)'s\\n\\n /// [`Password`](input/struct.Password.html), if any\\n\\n pub fn password(&self) -> Option<&Password<'a>> {\\n\\n self.password.as_ref()\\n\\n }\\n\\n /// Read-only access to the [`Hasher`](struct.Hasher.html)'s [`Salt`](input/struct.Salt.html)\\n\\n pub fn salt(&self) -> &Salt {\\n\\n &self.salt\\n\\n }\\n\\n /// Read-only access to the [`Hasher`](struct.Hasher.html)'s\\n\\n /// [`SecretKey`](input/struct.SecretKey.html), if any\\n\\n pub fn secret_key(&self) -> Option<&SecretKey<'a>> {\\n\\n self.secret_key.as_ref()\\n\\n }\\n\\n}\\n\\n\\n\\nimpl<'a> Hasher<'a> {\\n\\n pub(crate) fn clear(&mut self) {\\n\\n if self.password.is_some() && self.config.password_clearing() {\\n\",\n \"file_path\": \"argonautica-rs/src/hasher.rs\",\n \"rank\": 86,\n \"score\": 43367.43651729058\n },\n {\n \"content\": \" ///\\n\\n /// Including additional data in your hash is not very common; so it is unlikely you will\\n\\n /// need to use this method. If, however, you do add additional data, note that it is like\\n\\n /// a secret key in that it will be required later in order to verify passwords, and\\n\\n /// it is not stored in the string-encoded version of the hash, meaning you will have to\\n\\n /// provide it manually to a [`Verifier`](struct.Verifier.html)\\n\\n pub fn with_additional_data<AD>(&mut self, additional_data: AD) -> &mut Hasher<'a>\\n\\n where\\n\\n AD: Into<AdditionalData>,\\n\\n {\\n\\n self.additional_data = Some(additional_data.into());\\n\\n self\\n\\n }\\n\\n /// Allows you to provide a [`Hasher`](struct.Hasher.html) with the password you would like\\n\\n /// to hash. Hashing requires a password; so you must call this method before calling\\n\\n /// [`hash`](struct.Hasher.html#method.hash), [`hash_raw`](struct.Hasher.html#method.hash_raw),\\n\\n /// or their non-blocking version\\n\\n pub fn with_password<P>(&mut self, password: P) -> &mut Hasher<'a>\\n\\n where\\n\\n P: Into<Password<'a>>,\\n\",\n \"file_path\": \"argonautica-rs/src/hasher.rs\",\n \"rank\": 87,\n \"score\": 43366.87554598835\n },\n {\n \"content\": \" self\\n\\n }\\n\\n /// Allows you to configure [`Hasher`](struct.Hasher.html) to use a custom memory size\\n\\n /// (in kibibytes). The default is `4096`.\\n\\n ///\\n\\n /// See [configuration example](index.html#configuration) for a more details on this parameter\\n\\n pub fn configure_memory_size(&mut self, memory_size: u32) -> &mut Hasher<'a> {\\n\\n self.config.set_memory_size(memory_size);\\n\\n self\\n\\n }\\n\\n /// Allows you to configure [`Hasher`](struct.Hasher.html) to erase the password bytes\\n\\n /// after each call to [`hash`](struct.Hasher.html#method.hash),\\n\\n /// [`hash_raw`](struct.Hasher#method.hash_raw), or their non-blocking equivalents.\\n\\n /// The default is to <b>not</b> clear out the password\\n\\n /// bytes (i.e. `false`). If you set this option to `true`, you must provide\\n\\n /// [`Hasher`](struct.Hasher.html) with a mutable password, e.g. a password\\n\\n /// constructed from a `String`, `Vec<u8>`, `&mut str`, `&mut [u8]`, etc. as opposed to\\n\\n /// one constructed from a `&str`, `&[u8]`, etc., or else hashing will return an\\n\\n /// [`Error`](struct.Error.html).\\n\\n ///\\n\",\n \"file_path\": \"argonautica-rs/src/hasher.rs\",\n \"rank\": 88,\n \"score\": 43366.64621754571\n },\n {\n \"content\": \" /// to create the hash. The secret key will not be included in the hash output, meaning you\\n\\n /// must save it somewhere (ideally outside your code) to use later, as the only way to\\n\\n /// verify passwords against the hash later is to know the secret key. This library\\n\\n /// encourages the use of a secret key\\n\\n pub fn with_secret_key<SK>(&mut self, secret_key: SK) -> &mut Hasher<'a>\\n\\n where\\n\\n SK: Into<SecretKey<'a>>,\\n\\n {\\n\\n self.secret_key = Some(secret_key.into());\\n\\n self\\n\\n }\\n\\n /// Read-only access to the [`Hasher`](struct.Hasher.html)'s\\n\\n /// [`AdditionalData`](input/struct.AdditionalData.html), if any\\n\\n pub fn additional_data(&self) -> Option<&AdditionalData> {\\n\\n self.additional_data.as_ref()\\n\\n }\\n\\n /// Read-only access to the [`Hasher`](struct.Hasher.html)'s\\n\\n /// [`HasherConfig`](config/struct.HasherConfig.html)\\n\\n pub fn config(&self) -> &HasherConfig {\\n\\n &self.config\\n\",\n \"file_path\": \"argonautica-rs/src/hasher.rs\",\n \"rank\": 89,\n \"score\": 43366.05153322148\n },\n {\n \"content\": \" .with_password(\\\"password\\\")\\n\\n .with_secret_key(\\\"secret\\\")\\n\\n .hash();\\n\\n match hash {\\n\\n Ok(_) => panic!(\\\"Should return an error\\\"),\\n\\n Err(e) => assert_eq!(e, Error::new(ErrorKind::SecretKeyImmutableError)),\\n\\n }\\n\\n assert!(hasher.password().is_some());\\n\\n assert!(hasher.secret_key().is_none());\\n\\n }\\n\\n\\n\\n #[test]\\n\\n fn test_hasher_fast_but_insecure() {\\n\\n let mut hasher = Hasher::fast_but_insecure();\\n\\n let _ = hasher.with_password(\\\"P@ssw0rd\\\").hash().unwrap();\\n\\n }\\n\\n\\n\\n #[cfg(feature = \\\"serde\\\")]\\n\\n #[test]\\n\\n fn test_hasher_serialization() {\\n\",\n \"file_path\": \"argonautica-rs/src/hasher.rs\",\n \"rank\": 90,\n \"score\": 43365.95190954909\n },\n {\n \"content\": \"use futures::Future;\\n\\nuse futures_cpupool::CpuPool;\\n\\nuse scopeguard;\\n\\n\\n\\nuse config::defaults::{default_cpu_pool, default_lanes};\\n\\nuse config::{Backend, HasherConfig, Variant, Version};\\n\\nuse input::{AdditionalData, Container, Password, Salt, SecretKey};\\n\\nuse output::HashRaw;\\n\\nuse {Error, ErrorKind};\\n\\n\\n\\nimpl<'a> Default for Hasher<'a> {\\n\\n /// Same as the [`new`](struct.Hasher.html#method.new) method\\n\\n fn default() -> Hasher<'static> {\\n\\n Hasher {\\n\\n additional_data: None,\\n\\n config: HasherConfig::default(),\\n\\n password: None,\\n\\n salt: Salt::default(),\\n\\n secret_key: None,\\n\\n }\\n\",\n \"file_path\": \"argonautica-rs/src/hasher.rs\",\n \"rank\": 91,\n \"score\": 43365.70257914814\n },\n {\n \"content\": \" /// Allows you to configure [`Hasher`](struct.Hasher.html) to use a custom number of\\n\\n /// threads. The default is the number of physical cores on your machine. If you choose\\n\\n /// a number of threads that is greater than the lanes configuration,\\n\\n /// [`Hasher`](struct.Hasher.html) will use the minimum of the two.\\n\\n ///\\n\\n /// See [configuration example](index.html#configuration) for a more details on this parameter\\n\\n pub fn configure_threads(&mut self, threads: u32) -> &mut Hasher<'a> {\\n\\n self.config.set_threads(threads);\\n\\n self\\n\\n }\\n\\n /// Allows you to configure [`Hasher`](struct.Hasher.html) to use a custom Argon2\\n\\n /// variant. The default is [`Variant::Argon2id`](config/enum.Variant.html#variant.Argon2id).\\n\\n /// Do <b>not</b> use a different variant unless you have a specific reason to do so.\\n\\n ///\\n\\n /// See [configuration example](index.html#configuration) for a more details on this parameter\\n\\n pub fn configure_variant(&mut self, variant: Variant) -> &mut Hasher<'a> {\\n\\n self.config.set_variant(variant);\\n\\n self\\n\\n }\\n\\n /// Allows you to configure [`Hasher`](struct.Hasher.html) to use a custom Argon2 version.\\n\",\n \"file_path\": \"argonautica-rs/src/hasher.rs\",\n \"rank\": 92,\n \"score\": 43365.306528097564\n },\n {\n \"content\": \" /// See [configuration example](index.html#configuration) for a more detailed discussion\\n\\n /// of this parameter\\n\\n pub fn configure_hash_len(&mut self, hash_len: u32) -> &mut Hasher<'a> {\\n\\n self.config.set_hash_len(hash_len);\\n\\n self\\n\\n }\\n\\n /// Allows you to configure [`Hasher`](struct.Hasher.html) to use a custom number of\\n\\n /// iterations. The default is `192`.\\n\\n ///\\n\\n /// See [configuration example](index.html#configuration) for a more details on this parameter\\n\\n pub fn configure_iterations(&mut self, iterations: u32) -> &mut Hasher<'a> {\\n\\n self.config.set_iterations(iterations);\\n\\n self\\n\\n }\\n\\n /// Allows you to configure [`Hasher`](struct.Hasher.html) to use a custom number of\\n\\n /// lanes. The default is the number of physical cores on your machine.\\n\\n ///\\n\\n /// See [configuration example](index.html#configuration) for a more details on this parameter\\n\\n pub fn configure_lanes(&mut self, lanes: u32) -> &mut Hasher<'a> {\\n\\n self.config.set_lanes(lanes);\\n\",\n \"file_path\": \"argonautica-rs/src/hasher.rs\",\n \"rank\": 93,\n \"score\": 43364.638702272576\n },\n {\n \"content\": \" /// See [configuration example](index.html#configuration) for a more details on this parameter\\n\\n pub fn configure_password_clearing(&mut self, boolean: bool) -> &mut Hasher<'a> {\\n\\n self.config.set_password_clearing(boolean);\\n\\n self\\n\\n }\\n\\n /// Allows you to configure [`Hasher`](struct.Hasher.html) to erase the secret key bytes\\n\\n /// after each call to [`hash`](struct.Hasher.html#method.hash),\\n\\n /// [`hash_raw`](struct.Hasher#method.hash_raw), or their non-blocking equivalents.\\n\\n /// The default is to <b>not</b> clear out the secret key\\n\\n /// bytes (i.e. `false`). If you set this option to `true`, you must provide\\n\\n /// [`Hasher`](struct.Hasher.html) with a mutable secret key, e.g. a secret key\\n\\n /// constructed from a `String`, `Vec<u8>`, `&mut str`, `&mut [u8]`, etc. as opposed to\\n\\n /// one constructed from a `&str`, `&[u8]`, etc., or else hashing will return an\\n\\n /// [`Error`](struct.Error.html).\\n\\n ///\\n\\n /// See [configuration example](index.html#configuration) for a more details on this parameter\\n\\n pub fn configure_secret_key_clearing(&mut self, boolean: bool) -> &mut Hasher<'a> {\\n\\n self.config.set_secret_key_clearing(boolean);\\n\\n self\\n\\n }\\n\",\n \"file_path\": \"argonautica-rs/src/hasher.rs\",\n \"rank\": 94,\n \"score\": 43364.463823764934\n },\n {\n \"content\": \" let mut hasher = hasher.to_owned();\\n\\n match hasher.config.cpu_pool() {\\n\\n Some(cpu_pool) => cpu_pool.spawn_fn(move || hasher.hash_raw()),\\n\\n None => {\\n\\n let cpu_pool = default_cpu_pool();\\n\\n hasher.config.set_cpu_pool(cpu_pool.clone());\\n\\n cpu_pool.spawn_fn(move || hasher.hash_raw())\\n\\n }\\n\\n }\\n\\n }\\n\\n /// As an extra security measure, if you want to hash without a secret key, which\\n\\n /// is not recommended, you must explicitly declare that this is your intention\\n\\n /// by calling this method and setting the `opt_out_of_secret_key` configuration to\\n\\n /// `true` (by default, it is set to `false`); otherwise hashing will return an error\\n\\n /// when you fail to provide a secret key\\n\\n pub fn opt_out_of_secret_key(&mut self, boolean: bool) -> &mut Hasher<'a> {\\n\\n self.config.set_opt_out_of_secret_key(boolean);\\n\\n self\\n\\n }\\n\\n /// Clones the [`Hasher`](struct.Hasher.html), returning a new\\n\",\n \"file_path\": \"argonautica-rs/src/hasher.rs\",\n \"rank\": 95,\n \"score\": 43364.2475386823\n },\n {\n \"content\": \"}\\n\\n\\n\\n#[cfg(test)]\\n\\nmod tests {\\n\\n use super::*;\\n\\n use config::{Variant, Version};\\n\\n\\n\\n struct Test {\\n\\n variant: Variant,\\n\\n version: Version,\\n\\n expected: Vec<u8>,\\n\\n }\\n\\n\\n\\n impl Test {\\n\\n fn run(&self) {\\n\\n let mut hasher = Hasher::default();\\n\\n let raw_hash = hasher\\n\\n .configure_hash_len(32)\\n\\n .configure_iterations(3)\\n\\n .configure_lanes(4)\\n\",\n \"file_path\": \"argonautica-rs/src/hasher.rs\",\n \"rank\": 96,\n \"score\": 43363.93812471932\n },\n {\n \"content\": \"## Hashing\\n\\n\\n\\nHashing passwords with <b>argonautica</b> is simple. Just instantiate a default\\n\\n[`Hasher`](struct.Hasher.html), provide it with a password and a secret key, and then\\n\\ncall the [`hash`](struct.Hasher.html#method.hash) method.\\n\\n```rust\\n\\nextern crate argonautica;\\n\\n\\n\\nuse argonautica::Hasher;\\n\\n\\n\\nfn main() {\\n\\n let mut hasher = Hasher::default();\\n\\n let hash = hasher\\n\\n .with_password(\\\"P@ssw0rd\\\")\\n\\n .with_secret_key(\\\"\\\\\\n\\n secret key that you should really store in a .env file \\\\\\n\\n instead of in code, but this is just an example\\\\\\n\\n \\\")\\n\\n .hash()\\n\\n .unwrap();\\n\\n\\n\\n println!(\\\"{}\\\", &hash);\\n\\n // 👆 prints a hash, which will be random since the default Hasher uses a random salt\\n\\n}\\n\\n```\\n\\n## Verifying\\n\\n\\n\\nVerifying passwords against a hash is equally as simple. Just instantiate a default\\n\\n[`Verifier`](struct.Verifier.html), provide it with the password and the hash you would\\n\\nlike to compare, provide it with the secret key that was used to create the hash, and\\n\\nthen call the [`verify`](struct.Verifier.html#method.verify) method.\\n\\n```rust\\n\\nextern crate argonautica;\\n\\n\\n\\nuse argonautica::Verifier;\\n\\n\\n\\nfn main() {\\n\\n let mut verifier = Verifier::default();\\n\\n let is_valid = verifier\\n\\n .with_hash(\\\"\\n\\n $argon2id$v=19$m=4096,t=192,p=4$\\\\\\n\\n o2y5PU86Vt+sr93N7YUGgC7AMpTKpTQCk4tNGUPZMY4$\\\\\\n\\n yzP/ukZRPIbZg6PvgnUUobUMbApfF9RH6NagL9L4Xr4\\\\\\n\\n \\\")\\n\\n .with_password(\\\"P@ssw0rd\\\")\\n\\n .with_secret_key(\\\"\\\\\\n\\n secret key that you should really store in a .env file \\\\\\n\\n instead of in code, but this is just an example\\\\\\n\\n \\\")\\n\\n .verify()\\n\\n .unwrap();\\n\\n\\n\\n assert!(is_valid);\\n\\n}\\n\\n```\\n\",\n \"file_path\": \"argonautica-rs/README.md\",\n \"rank\": 98,\n \"score\": 33.19858196080795\n },\n {\n \"content\": \"extern crate argonautica;\\n\\nextern crate dotenv;\\n\\n#[macro_use]\\n\\nextern crate failure;\\n\\n\\n\\nuse std::collections::HashMap;\\n\\nuse std::env;\\n\\n\\n\\nuse argonautica::config::{Variant, Version};\\n\\nuse argonautica::input::{Salt, SecretKey};\\n\\nuse argonautica::{Hasher, Verifier};\\n\\n\\n\\n// Helper method to load the secret key from a .env file. Used in `main` below.\\n\",\n \"file_path\": \"argonautica-rs/examples/example_custom.rs\",\n \"rank\": 99,\n \"score\": 30.8381202154013\n }\n]","isConversational":false}}},{"rowIdx":2372,"cells":{"lang":{"kind":"string","value":"Rust"},"file_path":{"kind":"string","value":"src/procfs.rs"},"repo_name":{"kind":"string","value":"wojciechkepka/rustop"},"commit":{"kind":"string","value":"b8ac5b8c36aae9364fb16b64030d3de614e94747"},"file_code":{"kind":"string","value":"use super::*;\n\npub async fn os_release() -> Result<String> {\n Ok(fs::read_to_string(SysProperty::OsRelease.path())?.trim_end().to_string())\n}\n\npub async fn hostname() -> Result<String> {\n Ok(fs::read_to_string(SysProperty::Hostname.path())?.trim_end().to_string())\n}\n\npub async fn uptime() -> Result<f64> {\n let output = fs::read_to_string(SysProperty::Uptime.path())?;\n Ok(_uptime(&output))\n}\n\npub(crate) fn _uptime(out: &str) -> f64 {\n match out.split(' ').collect::<Vec<&str>>()[0].parse::<f64>() {\n Ok(up) => up,\n Err(_) => 0.0,\n }\n}\n\npub async fn cpu_info() -> Result<String> {\n let output = fs::read_to_string(SysProperty::CpuInfo.path())?;\n Ok(_cpu_info(&output))\n}\n\npub(crate) fn _cpu_info(out: &str) -> String {\n let re = Regex::new(r\"model name\\s*: (.*)\").unwrap();\n re.captures(&out).map_or(\"\".to_string(), |x| x[1].to_string())\n}\n\npub async fn mem(target: Memory) -> Result<u64> {\n let output = fs::read_to_string(SysProperty::Mem.path())?;\n Ok(_mem(target, &output))\n}\npub(crate) fn _mem(target: Memory, out: &str) -> u64 {\n let re = match target {\n Memory::SwapFree => Regex::new(r\"SwapFree:\\s*(\\d*)\").unwrap(),\n Memory::SwapTotal => Regex::new(r\"SwapTotal:\\s*(\\d*)\").unwrap(),\n Memory::MemTotal => Regex::new(r\"MemTotal:\\s*(\\d*)\").unwrap(),\n Memory::MemFree => Regex::new(r\"MemFree:\\s*(\\d*)\").unwrap(),\n };\n match re.captures(&out).map(|m| handle(m[1].parse::<u64>())) {\n Some(n) => n * 1024,\n _ => 0,\n }\n}\n\npub async fn total_clock_speed() -> Result<f32> {\n let output = fs::read_to_string(SysProperty::CpuInfo.path())?;\n Ok(_total_clock_speed(&output))\n}\n\npub(crate) fn _total_clock_speed(out: &str) -> f32 {\n let re = Regex::new(r\"cpu MHz\\s*: (.*)\").unwrap();\n re.captures_iter(&out).map(|x| handle(x[1].parse::<f32>())).sum::<f32>()\n}\n\npub async fn total_cpu_cores() -> Result<usize> {\n let output = fs::read_to_string(SysProperty::CpuInfo.path())?;\n Ok(_total_cpu_cores(&output))\n}\n\npub(crate) fn _total_cpu_cores(out: &str) -> usize {\n out.rmatches(\"cpu MHz\").count()\n}\n\npub async fn cpu_clock() -> Result<f32> {\n Ok(total_clock_speed().await? / total_cpu_cores().await? as f32)\n}\n\npub async fn network_devs() -> Result<NetworkDevices> {\n let route = fs::read_to_string(SysProperty::Route.path())?;\n let fib_trie = fs::read_to_string(SysProperty::FibTrie.path())?;\n let net_dev = fs::read_to_string(SysProperty::NetDev.path())?;\n let if_inet = fs::read_to_string(SysProperty::IfInet6.path())?;\n _network_devs(&net_dev, &route, &fib_trie, &if_inet)\n}\npub(crate) fn _network_devs(net_dev: &str, route: &str, fib_trie: &str, if_inet: &str) -> Result<NetworkDevices> {\n let mut devices = vec![];\n let re = Regex::new(r\"([\\d\\w]*):\\s*(\\d*)\\s*\\d*\\s*\\d*\\s*\\d*\\s*\\d*\\s*\\d*\\s*\\d*\\s*\\d*\\s*(\\d*)\")?;\n for network_dev in re.captures_iter(&net_dev) {\n devices.push(NetworkDevice {\n name: network_dev[1].to_string(),\n received_bytes: handle(network_dev[2].parse::<u64>()),\n transfered_bytes: handle(network_dev[3].parse::<u64>()),\n ipv4_addr: _ipv4_addr(&network_dev[1], &route, &fib_trie)?,\n ipv6_addr: _ipv6_addr(&network_dev[1], &if_inet)?,\n });\n }\n Ok(NetworkDevices { net_devices: devices })\n}\n\npub async fn storage_devices() -> Result<Storages> {\n let stor_dev = fs::read_to_string(SysProperty::StorDev.path())?;\n let stor_mounts = fs::read_to_string(SysProperty::StorMounts.path())?;\n Ok(_storage_devices(&stor_dev, &stor_mounts))\n}\n\npub(crate) fn _storage_devices(stor_dev: &str, stor_mounts: &str) -> Storages {\n let mut devices = Vec::new();\n let re = Regex::new(r\"(?m)^\\s*(\\d*)\\s*(\\d*)\\s*(\\d*)\\s([\\w\\d]*)$\").unwrap();\n for storage_dev in re\n .captures_iter(&stor_dev)\n .filter(|storage_dev| !(storage_dev[4].starts_with(\"loop\") || storage_dev[4].starts_with(\"ram\")))\n .filter(|storage_dev| {\n let stor_dev_re = Regex::new(r\"^[a-z]+$\").unwrap();\n stor_dev_re.is_match(&storage_dev[4].to_string())\n })\n {\n devices.push(Storage {\n major: handle(storage_dev[1].parse::<u16>()),\n minor: handle(storage_dev[2].parse::<u16>()),\n size: handle(storage_dev[3].parse::<u64>()) * 1024,\n name: storage_dev[4].to_string(),\n partitions: _storage_partitions(&storage_dev[4], &stor_dev, &stor_mounts),\n });\n }\n\n Storages { storage_devices: devices }\n}\n\n#[allow(dead_code)]\nasync fn storage_partitions(stor_name: &str) -> Result<Partitions> {\n let stor_dev = fs::read_to_string(SysProperty::StorDev.path())?;\n let stor_mounts = fs::read_to_string(SysProperty::StorMounts.path())?;\n Ok(_storage_partitions(&stor_name, &stor_dev, &stor_mounts))\n}\n\npub(crate) fn _storage_partitions(stor_name: &str, stor_dev: &str, stor_mounts: &str) -> Partitions {\n let mut partitions = vec![];\n let re = Regex::new(r\"(?m)^\\s*(\\d*)\\s*(\\d*)\\s*(\\d*)\\s(\\w*\\d+)$\").unwrap();\n let re2 = Regex::new(r\"/dev/(\\w*)\\s(\\S*)\\s(\\S*)\").unwrap();\n for storage_dev in re.captures_iter(&stor_dev).filter(|x| x[4].starts_with(stor_name)) {\n let mut partition = Partition::default();\n let partition_name = &storage_dev[4];\n\n for found_partition in re2.captures_iter(&stor_mounts) {\n if &found_partition[1] == partition_name {\n partition.mountpoint = found_partition[2].to_string();\n partition.filesystem = found_partition[3].to_string();\n break;\n } else {\n partition.mountpoint = \"\".to_string();\n partition.filesystem = \"\".to_string();\n }\n }\n partition.major = handle(storage_dev[1].parse::<u16>());\n partition.minor = handle(storage_dev[2].parse::<u16>());\n partition.size = handle(storage_dev[3].parse::<u64>()) * 1024;\n partition.name = partition_name.to_string();\n partitions.push(partition);\n }\n partitions\n}\n\npub async fn vgs() -> Result<VolGroups> {\n let mut vgs: Vec<VolGroup> = vec![];\n let output = fs::read_to_string(SysProperty::StorDev.path())?;\n let re = Regex::new(r\"(?m)\\d*\\s*dm-\")?;\n if re.captures(&output).is_some() {\n let cmd = Command::new(\"vgdisplay\").arg(\"--units\").arg(\"b\").output()?;\n let out = str::from_utf8(&cmd.stdout)?;\n let re = Regex::new(\n r\"(?m)VG Name\\s*(.*)\\n.*\\n\\s*Format\\s*(.*)$(?:\\n.*){3}\\s*VG Status\\s*(.*)$(?:\\n.*){6}$\\s*VG Size\\s*(\\d*)\",\n )?;\n for vg in re.captures_iter(&out) {\n vgs.push(VolGroup {\n name: vg[1].to_string(),\n format: vg[2].to_string(),\n status: vg[3].to_string(),\n size: handle(vg[4].parse::<u64>()),\n lvms: handle(lvms(vg[1].to_string()).await),\n })\n }\n }\n\n Ok(VolGroups { vgs })\n}\n\nasync fn lvms(vg_name: String) -> Result<Vec<LogVolume>> {\n let mut lvms_vec: Vec<LogVolume> = vec![];\n let cmd = Command::new(\"lvdisplay\").arg(\"--units\").arg(\"b\").output()?;\n let out = str::from_utf8(&cmd.stdout)?;\n let re = Regex::new(\n r\"(?m)LV Path\\s*(.*)\\n\\s*LV Name\\s*(.*)$\\s*VG Name\\s*(.*)$(?:\\n.*){3}$\\s*LV Status\\s*(.*)\\n.*$\\n\\s*LV Size\\s*(\\d*).*$(?:\\n.*){5}\\s*Block device\\s*(\\d*):(\\d*)$\",\n )?;\n for lvm in re.captures_iter(&out).filter(|lvm| lvm[3] == vg_name) {\n lvms_vec.push(LogVolume {\n name: lvm[2].to_string(),\n path: lvm[1].to_string(),\n vg: lvm[3].to_string(),\n status: lvm[4].to_string(),\n size: handle(lvm[5].parse::<u64>()),\n major: handle(lvm[6].parse::<u16>()),\n minor: handle(lvm[7].parse::<u16>()),\n mountpoint: \"\".to_string(), \n })\n }\n Ok(lvms_vec)\n}\n\npub async fn graphics_card() -> Result<String> {\n let cmd = Command::new(\"lspci\").output()?;\n let out = str::from_utf8(&cmd.stdout)?;\n Ok(_graphics_card(&out))\n}\npub(crate) fn _graphics_card(out: &str) -> String {\n let re = Regex::new(r\"(?m)VGA compatible controller:\\s*(.*)$\").unwrap();\n re.captures(&out).map_or(\"\".to_string(), |vga| vga[1].to_string())\n}\n\n#[allow(dead_code)]\nasync fn ipv4_addr(interface_name: &str) -> Result<Ipv4Addr> {\n let route = fs::read_to_string(SysProperty::Route.path())?;\n let fib_trie = fs::read_to_string(SysProperty::FibTrie.path())?;\n _ipv4_addr(&interface_name, &route, &fib_trie)\n}\n\npub(crate) fn _ipv4_addr(interface_name: &str, route: &str, fib_trie: &str) -> Result<Ipv4Addr> {\n let mut iface_dest = \"\".to_string();\n let mut ip_addr = Ipv4Addr::UNSPECIFIED;\n if interface_name == \"lo\" {\n Ok(Ipv4Addr::LOCALHOST)\n } else {\n let re = Regex::new(r\"(?m)^([\\d\\w]*)\\s*([\\d\\w]*)\")?;\n for dest in re.captures_iter(&route) {\n if &dest[1] == interface_name && &dest[2] != \"00000000\" {\n iface_dest = utils::conv_hex_to_ip(&dest[2])?;\n }\n }\n\n let file = fib_trie.split('\\n').collect::<Vec<&str>>();\n let re = Regex::new(r\"\\|--\\s+(.*)\")?;\n let mut found = false;\n for (i, line) in (&file).iter().enumerate() {\n if (*line).to_string().contains(&iface_dest) {\n found = true;\n } else if found && (*line).to_string().contains(\"/32 host LOCAL\") {\n ip_addr = match re.captures(&file[i - 1]) {\n Some(n) => Ipv4Addr::from_str(&n[1])?,\n None => Ipv4Addr::UNSPECIFIED,\n };\n break;\n }\n }\n Ok(ip_addr)\n }\n}\n\n#[allow(dead_code)]\nasync fn ipv6_addr(interface_name: &str) -> Result<Ipv6Addr> {\n let output = fs::read_to_string(SysProperty::IfInet6.path())?;\n _ipv6_addr(&interface_name, &output)\n}\n\npub(crate) fn _ipv6_addr(interface_name: &str, out: &str) -> Result<Ipv6Addr> {\n if interface_name == \"lo\" {\n Ok(Ipv6Addr::LOCALHOST)\n } else {\n let mut ip_addr = Ipv6Addr::UNSPECIFIED;\n let re = Regex::new(r\"(?m)^([\\d\\w]*)\\s\\d*\\s\\d*\\s\\d*\\s\\d*\\s*(.*)$\").unwrap();\n for capture in re.captures_iter(&out) {\n if &capture[2] == interface_name {\n ip_addr = Ipv6Addr::from_str(&format!(\n \"{}:{}:{}:{}:{}:{}:{}:{}\",\n &capture[1][..4],\n &capture[1][4..8],\n &capture[1][8..12],\n &capture[1][12..16],\n &capture[1][16..20],\n &capture[1][20..24],\n &capture[1][24..28],\n &capture[1][28..32]\n ))?;\n break;\n }\n }\n Ok(ip_addr)\n }\n}\n\npub async fn temperatures() -> Result<Temperatures> {\n \n let paths = fs::read_dir(SysProperty::Temperature.path())?;\n let mut devices: Vec<DeviceSensors> = vec![];\n let re = Regex::new(r\"temp[\\d]+_input\")?;\n for dir_entry in paths {\n let mut sensor_count = 0;\n let path = dir_entry?.path();\n let mut dev = DeviceSensors::default();\n let mut dev_temps: Vec<Sensor> = vec![];\n dev.name = fs::read_to_string(path.join(\"name\"))?.trim().to_string();\n for temp_file in fs::read_dir(&path)? {\n if re.is_match(&temp_file?.path().to_str().unwrap()) {\n sensor_count += 1;\n }\n }\n for i in 1..=sensor_count {\n dev_temps.push(sensor(&path, i).await?);\n }\n dev.sensors = dev_temps;\n devices.push(dev);\n }\n Ok(Temperatures { temp_devices: devices })\n}\n\npub async fn sensor<P: AsRef<Path>>(path: P, i: i32) -> Result<Sensor> {\n let mut sensor = Sensor::default();\n sensor.name = fs::read_to_string(path.as_ref().join(format!(\"temp{}_label\", i)))\n .unwrap_or_else(|_| \"\".to_string())\n .trim()\n .to_string();\n sensor.temp =\n handle(fs::read_to_string(path.as_ref().join(format!(\"temp{}_input\", i)))?.trim().parse::<f32>()) / 1000.;\n\n Ok(sensor)\n}\n"},"prefix":{"kind":"string","value":"use super::*;\n\npub async fn os_release() -> Result<String> {\n Ok(fs::read_to_string(SysProperty::OsRelease.path())?.trim_end().to_string())\n}\n\npub async fn hostname() -> Result<String> {\n Ok(fs::read_to_string(SysProperty::Hostname.path())?.trim_end().to_string())\n}\n\npub async fn uptime() -> Result<f64> {\n let output = fs::read_to_string(SysProperty::Uptime.path())?;\n Ok(_uptime(&output))\n}\n\npub(crate) fn _uptime(out: &str) -> f64 {\n match out.split(' ').collect::<Vec<&str>>()[0].parse::<f64>() {\n Ok(up) => up,\n Err(_) => 0.0,\n }\n}\n\npub async fn cpu_info() -> Result<String> {\n let output = fs::read_to_string(SysProperty::CpuInfo.path())?;\n Ok(_cpu_info(&output))\n}\n\npub(crate) fn _cpu_info(out: &str) -> String {\n let re = Regex::new(r\"model name\\s*: (.*)\").unwrap();\n re.captures(&out).map_or(\"\".to_string(), |x| x[1].to_string())\n}\n\npub async fn mem(target: Memory) -> Result<u64> {\n let output = fs::read_to_string(SysProperty::Mem.path())?;\n Ok(_mem(target, &output))\n}\npub(crate) fn _mem(target: Memory, out: &str) -> u64 {\n let re = match target {\n Memory::SwapFree => Regex::new(r\"SwapFree:\\s*(\\d*)\").unwrap(),\n Memory::SwapTotal => Regex::new(r\"SwapTotal:\\s*(\\d*)\").unwrap(),\n Memory::MemTotal => Regex::new(r\"MemTotal:\\s*(\\d*)\").unwrap(),\n Memory::MemFree => Regex::new(r\"MemFree:\\s*(\\d*)\").unwrap(),\n };\n match re.captures(&out).map(|m| handle(m[1].parse::<u64>())) {\n Some(n) => n * 1024,\n _ => 0,\n }\n}\n\npub async fn total_clock_speed() -> Result<f32> {\n let output = fs::read_to_string(SysProperty::CpuInfo.path())?;\n Ok(_total_clock_speed(&output))\n}\n\npub(crate) fn _total_clock_speed(out: &str) -> f32 {\n let re = Regex::new(r\"cpu MHz\\s*: (.*)\").unwrap();\n re.captures_iter(&out).map(|x| handle(x[1].parse::<f32>())).sum::<f32>()\n}\n\npub async fn total_cpu_cores() -> Result<usize> {\n let output = fs::read_to_string(SysProperty::CpuInfo.path())?;\n Ok(_total_cpu_cores(&output))\n}\n\npub(crate) fn _total_cpu_cores(out: &str) -> usize {\n out.rmatches(\"cpu MHz\").count()\n}\n\npub async fn cpu_clock() -> Result<f32> {\n Ok(total_clock_speed().await? / total_cpu_cores().await? as f32)\n}\n\npub async fn network_devs() -> Result<NetworkDevices> {\n let route = fs::read_to_string(SysProperty::Route.path())?;\n let fib_trie = fs::read_to_string(SysProperty::FibTrie.path())?;\n let net_dev = fs::read_to_string(SysProperty::NetDev.path())?;\n let if_inet = fs::read_to_string(SysProperty::IfInet6.path())?;\n _network_devs(&net_dev, &route, &fib_trie, &if_inet)\n}\npub(crate) fn _network_devs(net_dev: &str, route: &str, fib_trie: &str, if_inet: &str) -> Result<NetworkDevices> {\n let mut devices = vec![];\n let re = Regex::new(r\"([\\d\\w]*):\\s*(\\d*)\\s*\\d*\\s*\\d*\\s*\\d*\\s*\\d*\\s*\\d*\\s*\\d*\\s*\\d*\\s*(\\d*)\")?;\n for network_dev in re.captures_iter(&net_dev) {\n devices.push(NetworkDevice {\n name: network_dev[1].to_string(),\n received_bytes: handle(network_dev[2].parse::<u64>()),\n transfered_bytes: handle(network_dev[3].parse::<u64>()),\n ipv4_addr: _ipv4_addr(&network_dev[1], &route, &fib_trie)?,\n ipv6_addr: _ipv6_addr(&network_dev[1], &if_inet)?,\n });\n }\n Ok(NetworkDevices { net_devices: devices })\n}\n\npub async fn storage_devices() -> Result<Storages> {\n let stor_dev = fs::read_to_string(SysProperty::StorDev.path())?;\n let stor_mounts = fs::read_to_string(SysProperty::StorMounts.path())?;\n Ok(_storage_devices(&stor_dev, &stor_mounts))\n}\n\npub(crate) fn _storage_devices(stor_dev: &str, stor_mounts: &str) -> Storages {\n let mut devices = Vec::new();\n let re = Regex::new(r\"(?m)^\\s*(\\d*)\\s*(\\d*)\\s*(\\d*)\\s([\\w\\d]*)$\").unwrap();\n for storage_dev in re\n .captures_iter(&stor_dev)\n .filter(|storage_dev| !(storage_dev[4].starts_with(\"loop\") || storage_dev[4].starts_with(\"ram\")))\n .filter(|storage_dev| {\n let stor_dev_re = Regex::new(r\"^[a-z]+$\").unwrap();\n stor_dev_re.is_match(&storage_dev[4].to_string())\n })\n {\n devices.push(Storage {\n major: handle(storage_dev[1].parse::<u16>()),\n minor: handle(storage_dev[2].parse::<u16>()),\n size: handle(storage_dev[3].parse::<u64>()) * 1024,\n name: storage_dev[4].to_string(),\n partitions: _storage_partitions(&storage_dev[4], &stor_dev, &stor_mounts),\n });\n }\n\n Storages { storage_devices: devices }\n}\n\n#[allow(dead_code)]\nasync fn storage_partitions(stor_name: &str) -> Result<Partitions> {\n let stor_dev = fs::read_to_string(SysProperty::StorDev.path())?;\n let stor_mounts = fs::read_to_string(SysProperty::StorMounts.path())?;\n Ok(_storage_partitions(&stor_name, &stor_dev, &stor_mounts))\n}\n\npub(crate) fn _storage_partitions(stor_name: &str, stor_dev: &str, stor_mounts: &str) -> Partitions {\n let mut partitions = vec![];\n let re = Regex::new(r\"(?m)^\\s*(\\d*)\\s*(\\d*)\\s*(\\d*)\\s(\\w*\\d+)$\").unwrap();\n let re2 = Regex::new(r\"/dev/(\\w*)\\s(\\S*)\\s(\\S*)\").unwrap();\n for storage_dev in re.captures_iter(&stor_dev).filter(|x| x[4].starts_with(stor_name)) {\n let mut partition = Partition::default();\n let partition_name = &storage_dev[4];\n\n for found_partition in re2.captures_iter(&stor_mounts) {\n "},"suffix":{"kind":"string","value":"\n }\n partition.major = handle(storage_dev[1].parse::<u16>());\n partition.minor = handle(storage_dev[2].parse::<u16>());\n partition.size = handle(storage_dev[3].parse::<u64>()) * 1024;\n partition.name = partition_name.to_string();\n partitions.push(partition);\n }\n partitions\n}\n\npub async fn vgs() -> Result<VolGroups> {\n let mut vgs: Vec<VolGroup> = vec![];\n let output = fs::read_to_string(SysProperty::StorDev.path())?;\n let re = Regex::new(r\"(?m)\\d*\\s*dm-\")?;\n if re.captures(&output).is_some() {\n let cmd = Command::new(\"vgdisplay\").arg(\"--units\").arg(\"b\").output()?;\n let out = str::from_utf8(&cmd.stdout)?;\n let re = Regex::new(\n r\"(?m)VG Name\\s*(.*)\\n.*\\n\\s*Format\\s*(.*)$(?:\\n.*){3}\\s*VG Status\\s*(.*)$(?:\\n.*){6}$\\s*VG Size\\s*(\\d*)\",\n )?;\n for vg in re.captures_iter(&out) {\n vgs.push(VolGroup {\n name: vg[1].to_string(),\n format: vg[2].to_string(),\n status: vg[3].to_string(),\n size: handle(vg[4].parse::<u64>()),\n lvms: handle(lvms(vg[1].to_string()).await),\n })\n }\n }\n\n Ok(VolGroups { vgs })\n}\n\nasync fn lvms(vg_name: String) -> Result<Vec<LogVolume>> {\n let mut lvms_vec: Vec<LogVolume> = vec![];\n let cmd = Command::new(\"lvdisplay\").arg(\"--units\").arg(\"b\").output()?;\n let out = str::from_utf8(&cmd.stdout)?;\n let re = Regex::new(\n r\"(?m)LV Path\\s*(.*)\\n\\s*LV Name\\s*(.*)$\\s*VG Name\\s*(.*)$(?:\\n.*){3}$\\s*LV Status\\s*(.*)\\n.*$\\n\\s*LV Size\\s*(\\d*).*$(?:\\n.*){5}\\s*Block device\\s*(\\d*):(\\d*)$\",\n )?;\n for lvm in re.captures_iter(&out).filter(|lvm| lvm[3] == vg_name) {\n lvms_vec.push(LogVolume {\n name: lvm[2].to_string(),\n path: lvm[1].to_string(),\n vg: lvm[3].to_string(),\n status: lvm[4].to_string(),\n size: handle(lvm[5].parse::<u64>()),\n major: handle(lvm[6].parse::<u16>()),\n minor: handle(lvm[7].parse::<u16>()),\n mountpoint: \"\".to_string(), \n })\n }\n Ok(lvms_vec)\n}\n\npub async fn graphics_card() -> Result<String> {\n let cmd = Command::new(\"lspci\").output()?;\n let out = str::from_utf8(&cmd.stdout)?;\n Ok(_graphics_card(&out))\n}\npub(crate) fn _graphics_card(out: &str) -> String {\n let re = Regex::new(r\"(?m)VGA compatible controller:\\s*(.*)$\").unwrap();\n re.captures(&out).map_or(\"\".to_string(), |vga| vga[1].to_string())\n}\n\n#[allow(dead_code)]\nasync fn ipv4_addr(interface_name: &str) -> Result<Ipv4Addr> {\n let route = fs::read_to_string(SysProperty::Route.path())?;\n let fib_trie = fs::read_to_string(SysProperty::FibTrie.path())?;\n _ipv4_addr(&interface_name, &route, &fib_trie)\n}\n\npub(crate) fn _ipv4_addr(interface_name: &str, route: &str, fib_trie: &str) -> Result<Ipv4Addr> {\n let mut iface_dest = \"\".to_string();\n let mut ip_addr = Ipv4Addr::UNSPECIFIED;\n if interface_name == \"lo\" {\n Ok(Ipv4Addr::LOCALHOST)\n } else {\n let re = Regex::new(r\"(?m)^([\\d\\w]*)\\s*([\\d\\w]*)\")?;\n for dest in re.captures_iter(&route) {\n if &dest[1] == interface_name && &dest[2] != \"00000000\" {\n iface_dest = utils::conv_hex_to_ip(&dest[2])?;\n }\n }\n\n let file = fib_trie.split('\\n').collect::<Vec<&str>>();\n let re = Regex::new(r\"\\|--\\s+(.*)\")?;\n let mut found = false;\n for (i, line) in (&file).iter().enumerate() {\n if (*line).to_string().contains(&iface_dest) {\n found = true;\n } else if found && (*line).to_string().contains(\"/32 host LOCAL\") {\n ip_addr = match re.captures(&file[i - 1]) {\n Some(n) => Ipv4Addr::from_str(&n[1])?,\n None => Ipv4Addr::UNSPECIFIED,\n };\n break;\n }\n }\n Ok(ip_addr)\n }\n}\n\n#[allow(dead_code)]\nasync fn ipv6_addr(interface_name: &str) -> Result<Ipv6Addr> {\n let output = fs::read_to_string(SysProperty::IfInet6.path())?;\n _ipv6_addr(&interface_name, &output)\n}\n\npub(crate) fn _ipv6_addr(interface_name: &str, out: &str) -> Result<Ipv6Addr> {\n if interface_name == \"lo\" {\n Ok(Ipv6Addr::LOCALHOST)\n } else {\n let mut ip_addr = Ipv6Addr::UNSPECIFIED;\n let re = Regex::new(r\"(?m)^([\\d\\w]*)\\s\\d*\\s\\d*\\s\\d*\\s\\d*\\s*(.*)$\").unwrap();\n for capture in re.captures_iter(&out) {\n if &capture[2] == interface_name {\n ip_addr = Ipv6Addr::from_str(&format!(\n \"{}:{}:{}:{}:{}:{}:{}:{}\",\n &capture[1][..4],\n &capture[1][4..8],\n &capture[1][8..12],\n &capture[1][12..16],\n &capture[1][16..20],\n &capture[1][20..24],\n &capture[1][24..28],\n &capture[1][28..32]\n ))?;\n break;\n }\n }\n Ok(ip_addr)\n }\n}\n\npub async fn temperatures() -> Result<Temperatures> {\n \n let paths = fs::read_dir(SysProperty::Temperature.path())?;\n let mut devices: Vec<DeviceSensors> = vec![];\n let re = Regex::new(r\"temp[\\d]+_input\")?;\n for dir_entry in paths {\n let mut sensor_count = 0;\n let path = dir_entry?.path();\n let mut dev = DeviceSensors::default();\n let mut dev_temps: Vec<Sensor> = vec![];\n dev.name = fs::read_to_string(path.join(\"name\"))?.trim().to_string();\n for temp_file in fs::read_dir(&path)? {\n if re.is_match(&temp_file?.path().to_str().unwrap()) {\n sensor_count += 1;\n }\n }\n for i in 1..=sensor_count {\n dev_temps.push(sensor(&path, i).await?);\n }\n dev.sensors = dev_temps;\n devices.push(dev);\n }\n Ok(Temperatures { temp_devices: devices })\n}\n\npub async fn sensor<P: AsRef<Path>>(path: P, i: i32) -> Result<Sensor> {\n let mut sensor = Sensor::default();\n sensor.name = fs::read_to_string(path.as_ref().join(format!(\"temp{}_label\", i)))\n .unwrap_or_else(|_| \"\".to_string())\n .trim()\n .to_string();\n sensor.temp =\n handle(fs::read_to_string(path.as_ref().join(format!(\"temp{}_input\", i)))?.trim().parse::<f32>()) / 1000.;\n\n Ok(sensor)\n}\n"},"middle":{"kind":"string","value":"if &found_partition[1] == partition_name {\n partition.mountpoint = found_partition[2].to_string();\n partition.filesystem = found_partition[3].to_string();\n break;\n } else {\n partition.mountpoint = \"\".to_string();\n partition.filesystem = \"\".to_string();\n }"},"strategy":{"kind":"string","value":"if_condition"},"context_items":{"kind":"list like","value":[],"string":"[]","isConversational":false}}},{"rowIdx":2373,"cells":{"lang":{"kind":"string","value":"Rust"},"file_path":{"kind":"string","value":"src/graph.rs"},"repo_name":{"kind":"string","value":"fexolm/max_clique"},"commit":{"kind":"string","value":"c181294902c53842fd06450c7a1618daf5bc270b"},"file_code":{"kind":"string","value":"use std::collections::*;\nuse std::fs::File;\nuse std::io::*;\nuse std::iter::*;\nuse std::sync::Arc;\nuse std::sync::RwLock;\nuse std::u64;\n\nuse rayon::{Scope};\nuse regex::Regex;\n\npub struct Graph {\n adj_list: HashMap<u16, HashSet<u16>>,\n}\n\npub struct MaxCliqueData {\n max_clique: Vec<u16>,\n current_clique: Vec<u16>,\n}\n\nfn parse_line(reader: &mut BufReader<File>) -> Option<(u16, u16)> {\n lazy_static! {\n static ref RE: Regex = Regex::new(r\"^e (\\d+) (\\d+)\").unwrap();\n }\n loop {\n let mut text = String::new();\n match reader.read_line(&mut text) {\n Ok(size) if size > 0 => {\n if let Some(caps) = RE.captures(&text) {\n return Some((caps.get(1).unwrap().as_str().parse::<u16>().unwrap(),\n caps.get(2).unwrap().as_str().parse::<u16>().unwrap()));\n }\n }\n _ => return None\n }\n }\n}\n\nmacro_rules! get_entry {\n ($map:expr, $key:expr) => (*($map.entry($key).or_insert(HashSet::new())))\n}\n\nimpl Graph {\n pub fn read(filename: &str) -> Result<Arc<Self>> {\n let mut adj_list: HashMap<u16, HashSet<u16>> = HashMap::new();\n let file = File::open(filename)?;\n let mut reader = BufReader::new(file);\n while let Some((from, to)) = parse_line(&mut reader) {\n get_entry!(adj_list, from).insert(to);\n get_entry!(adj_list, to).insert(from);\n }\n Ok(Arc::new(Graph { adj_list, }))\n }\n\n fn degree(&self, node: u16) -> u16 {\n self.neighbours(node).len() as u16\n }\n\n fn neighbours(&self, node: u16) -> &HashSet<u16> {\n &self.adj_list[&node]\n }\n\n fn subgraph_neighbours<'i>(&'i self, subgraph: &'i HashSet<u16>, node: u16) -> impl Iterator<Item=&'i u16> {\n self.neighbours(node).intersection(subgraph)\n }\n\n fn clique_heuristic(&self, data: &mut MaxCliqueData, mut vertexes: HashSet<u16>) {\n if vertexes.is_empty() {\n if data.current_clique.len() > data.max_clique.len() {\n data.max_clique = data.current_clique.clone();\n }\n return\n }\n\n let best_vertex = vertexes.iter().copied().max_by_key(\n |v| self.subgraph_neighbours(&vertexes, *v).count()).unwrap();\n\n let neighbours = HashSet::from_iter(\n self.subgraph_neighbours(&vertexes, best_vertex).copied()\n .filter(|n| self.degree(*n) >= data.max_clique.len() as u16));\n\n vertexes.remove(&best_vertex);\n data.current_clique.push(best_vertex);\n self.clique_heuristic(data, neighbours);\n data.current_clique.pop();\n }\n\n fn max_clique_heuristic(&self, data: &mut MaxCliqueData) {\n let mut queue = BinaryHeap::from_iter(\n self.adj_list.keys().copied().map(|n| (self.degree(n), n)));\n\n while let Some((_, node)) = queue.pop() {\n if self.degree(node) > data.max_clique.len() as u16 {\n data.current_clique.push(node);\n self.clique_heuristic(data, HashSet::from_iter(\n self.neighbours(node).iter().copied()\n .filter(|n| self.degree(*n) > data.max_clique.len() as u16)\n ));\n data.current_clique.pop();\n }\n }\n }\n\n fn greedy_coloring(&self, vertexes: &HashSet<u16>) -> HashMap<u16, i16> {\n let mut res = HashMap::new();\n\n let mut powers = Vec::from_iter(\n vertexes.iter().copied()\n .map(|v| (v, Vec::from_iter(self.subgraph_neighbours(vertexes, v))))\n );\n powers.sort_unstable_by_key(|(_, v)| -(v.len() as i32));\n \n \n let mut used = [0; 16];\n\n let use_col = |arr: &mut [u64], c: i16| {\n arr[(c / 64) as usize] |= 1u64 << (c % 64) as u64;\n };\n\n let min_col = |arr: &[u64]| {\n for i in 0..16 {\n if arr[i] != !0u64 {\n return (64 * i + (!arr[i]).trailing_zeros() as usize) as i16;\n }\n }\n unreachable!()\n };\n for (node, neighbours) in powers {\n for neighbour in neighbours {\n if let Some(&val) = res.get(neighbour) {\n use_col(&mut used, val);\n }\n }\n res.insert(node, min_col(&used));\n used = [0; 16];\n }\n res\n }\n}\n\nfn max_clique_impl(graph: Arc<Graph>, max_clique: Arc<RwLock<Vec<u16>>>,\n current_clique: &mut Vec<u16>,\n mut vertexes: HashSet<u16>,\n s: &Scope) {\n {\n let len = max_clique.read().unwrap().len();\n if current_clique.len() > len {\n println!(\"New max len: {}\", len);\n *max_clique.write().unwrap() = current_clique.clone();\n }\n }\n\n let coloring = graph.greedy_coloring(&vertexes);\n let mut candidates = Vec::from_iter(coloring.iter());\n\n candidates.sort_unstable_by_key(|(_, &c)| -c);\n for (&v, &c) in candidates {\n {\n if current_clique.len() + c as usize + 1 <= max_clique.read().unwrap().len() {\n return;\n }\n }\n\n vertexes.remove(&v);\n let neighbours = HashSet::from_iter(\n graph.subgraph_neighbours(&vertexes, v).copied());\n\n \n let mut cur_clique = current_clique.clone();\n let g = graph.clone();\n let mc = max_clique.clone();\n\n s.spawn(move |sc| {\n cur_clique.push(v);\n max_clique_impl(g, mc, &mut cur_clique, neighbours, sc);\n cur_clique.pop();\n });\n }\n}\n\npub fn get_max_clique(graph: Arc<Graph>) -> Vec<u16> {\n let mut data = MaxCliqueData { max_clique: vec!(), current_clique: vec!() };\n graph.max_clique_heuristic(&mut data);\n println!(\"Heuristic best: {}\", data.max_clique.len());\n let max_clique = Arc::new(RwLock::new(data.max_clique));\n\n rayon::scope(|s| {\n max_clique_impl(graph.clone(), max_clique.clone(), &mut vec!(),\n HashSet::from_iter(graph.adj_list.keys().cloned()), s);\n });\n\n let res = max_clique.read().unwrap();\n res.clone()\n}\n"},"prefix":{"kind":"string","value":"use std::collections::*;\nuse std::fs::File;\nuse std::io::*;\nuse std::iter::*;\nuse std::sync::Arc;\nuse std::sync::RwLock;\nuse std::u64;\n\nuse rayon::{Scope};\nuse regex::Regex;\n\npub struct Graph {\n adj_list: HashMap<u16, HashSet<u16>>,\n}\n\npub struct MaxCliqueData {\n max_clique: Vec<u16>,\n current_clique: Vec<u16>,\n}\n\nfn parse_line(reader: &mut BufReader<File>) -> Option<(u16, u16)> {\n lazy_static! {\n static ref RE: Regex = Regex::new(r\"^e (\\d+) (\\d+)\").unwrap();\n }\n loop {\n let mut text = String::new();\n match reader.read_line(&mut text) {\n Ok(size) if size > 0 => {\n if let Some(caps) = RE.captures(&text) {\n return Some((caps.get(1).unwrap().as_str().parse::<u16>().unwrap(),\n caps.get(2).unwrap().as_str().parse::<u16>().unwrap()));\n }\n }\n _ => return None\n }\n }\n}\n\nmacro_rules! get_entry {\n ($map:expr, $key:expr) => (*($map.entry($key).or_insert(HashSet::new())))\n}\n\nimpl Graph {\n pub fn read(filename: &str) -> Result<Arc<Self>> {\n let mut adj_list: HashMap<u16, HashSet<u16>> = HashMap::new();\n let file = File::open(filename)?;\n let mut reader = BufReader::new(file);\n while let Some((from, to)) = parse_line(&mut reader) {\n get_entry!(adj_list, from).insert(to);\n get_entry!(adj_list, to).insert(from);\n }\n Ok(Arc::new(Graph { adj_list, }))\n }\n\n fn degree(&self, node: u16) -> u16 {\n self.neighbours(node).len() as u16\n }\n\n fn neighbours(&self, node: u16) -> &HashSet<u16> {\n &self.adj_list[&node]\n }\n\n fn subgraph_neighbours<'i>(&'i self, subgraph: &'i HashSet<u16>, node: u16) -> impl Iterator<Item=&'i u16> {\n self.neighbours(node).intersection(subgraph)\n }\n\n fn clique_heuristic(&self, data: &mut MaxCliqueData, mut vertexes: HashSet<u16>) {\n if vertexes.is_empty() {\n if data.current_clique.len() > data.max_clique.len() {\n data.max_clique = data.current_clique.clone();\n }\n return\n }\n\n let best_vertex = vertexes.iter().copied().max_by_key(\n |v| self.subgraph_neighbours(&vertexes, *v).count()).unwrap();\n\n let neighbours = HashSet::from_iter(\n self.subgraph_neighbours(&vertexes, best_vertex).copied()\n .filter(|n| self.degree(*n) >= data.max_clique.len() as u16));\n\n vertexes.remove(&best_vertex);\n data.current_clique.push(best_vertex);\n self.clique_heuristic(data, neighbours);\n data.current_clique.pop();\n }\n\n "},"suffix":{"kind":"string","value":"\n\n fn greedy_coloring(&self, vertexes: &HashSet<u16>) -> HashMap<u16, i16> {\n let mut res = HashMap::new();\n\n let mut powers = Vec::from_iter(\n vertexes.iter().copied()\n .map(|v| (v, Vec::from_iter(self.subgraph_neighbours(vertexes, v))))\n );\n powers.sort_unstable_by_key(|(_, v)| -(v.len() as i32));\n \n \n let mut used = [0; 16];\n\n let use_col = |arr: &mut [u64], c: i16| {\n arr[(c / 64) as usize] |= 1u64 << (c % 64) as u64;\n };\n\n let min_col = |arr: &[u64]| {\n for i in 0..16 {\n if arr[i] != !0u64 {\n return (64 * i + (!arr[i]).trailing_zeros() as usize) as i16;\n }\n }\n unreachable!()\n };\n for (node, neighbours) in powers {\n for neighbour in neighbours {\n if let Some(&val) = res.get(neighbour) {\n use_col(&mut used, val);\n }\n }\n res.insert(node, min_col(&used));\n used = [0; 16];\n }\n res\n }\n}\n\nfn max_clique_impl(graph: Arc<Graph>, max_clique: Arc<RwLock<Vec<u16>>>,\n current_clique: &mut Vec<u16>,\n mut vertexes: HashSet<u16>,\n s: &Scope) {\n {\n let len = max_clique.read().unwrap().len();\n if current_clique.len() > len {\n println!(\"New max len: {}\", len);\n *max_clique.write().unwrap() = current_clique.clone();\n }\n }\n\n let coloring = graph.greedy_coloring(&vertexes);\n let mut candidates = Vec::from_iter(coloring.iter());\n\n candidates.sort_unstable_by_key(|(_, &c)| -c);\n for (&v, &c) in candidates {\n {\n if current_clique.len() + c as usize + 1 <= max_clique.read().unwrap().len() {\n return;\n }\n }\n\n vertexes.remove(&v);\n let neighbours = HashSet::from_iter(\n graph.subgraph_neighbours(&vertexes, v).copied());\n\n \n let mut cur_clique = current_clique.clone();\n let g = graph.clone();\n let mc = max_clique.clone();\n\n s.spawn(move |sc| {\n cur_clique.push(v);\n max_clique_impl(g, mc, &mut cur_clique, neighbours, sc);\n cur_clique.pop();\n });\n }\n}\n\npub fn get_max_clique(graph: Arc<Graph>) -> Vec<u16> {\n let mut data = MaxCliqueData { max_clique: vec!(), current_clique: vec!() };\n graph.max_clique_heuristic(&mut data);\n println!(\"Heuristic best: {}\", data.max_clique.len());\n let max_clique = Arc::new(RwLock::new(data.max_clique));\n\n rayon::scope(|s| {\n max_clique_impl(graph.clone(), max_clique.clone(), &mut vec!(),\n HashSet::from_iter(graph.adj_list.keys().cloned()), s);\n });\n\n let res = max_clique.read().unwrap();\n res.clone()\n}\n"},"middle":{"kind":"string","value":"fn max_clique_heuristic(&self, data: &mut MaxCliqueData) {\n let mut queue = BinaryHeap::from_iter(\n self.adj_list.keys().copied().map(|n| (self.degree(n), n)));\n\n while let Some((_, node)) = queue.pop() {\n if self.degree(node) > data.max_clique.len() as u16 {\n data.current_clique.push(node);\n self.clique_heuristic(data, HashSet::from_iter(\n self.neighbours(node).iter().copied()\n .filter(|n| self.degree(*n) > data.max_clique.len() as u16)\n ));\n data.current_clique.pop();\n }\n }\n }"},"strategy":{"kind":"string","value":"function_block-full_function"},"context_items":{"kind":"list like","value":[{"content":"fn print_clique(v: &Vec<u16>) {\n\n for &n in v {\n\n print!(\"{} \", n);\n\n }\n\n}\n\n\n","file_path":"src/main.rs","rank":3,"score":38032.75972512833},{"content":"fn main() -> Result<()> {\n\n use graph::Graph;\n\n use time::PreciseTime;\n\n\n\n // yes, hardcoded string here\n\n let graph = Graph::read(r\"C:\\Users\\artem\\Downloads\\brock400_2.clq.txt\")?;\n\n\n\n let start = PreciseTime::now();\n\n let max_clique = graph::get_max_clique(graph.clone());\n\n let end = PreciseTime::now();\n\n\n\n let spent = start.to(end);\n\n let sec = spent.num_seconds() - 60 * spent.num_minutes();\n\n let min = spent.num_minutes() - 60 * spent.num_hours();\n\n let hours = spent.num_hours();\n\n println!(\"time spent: {}h {}m {}s\", hours, min, sec);\n\n println!(\"Max clique size: {}\", max_clique.len());\n\n print_clique(&max_clique);\n\n Ok(())\n\n}\n","file_path":"src/main.rs","rank":4,"score":15200.376041941792},{"content":"#[macro_use]\n\nextern crate lazy_static;\n\nextern crate regex;\n\nextern crate time;\n\n\n\nuse std::io::Result;\n\n\n\nmod graph;\n\n\n","file_path":"src/main.rs","rank":12,"score":4.212971738551787}],"string":"[\n {\n \"content\": \"fn print_clique(v: &Vec<u16>) {\\n\\n for &n in v {\\n\\n print!(\\\"{} \\\", n);\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/main.rs\",\n \"rank\": 3,\n \"score\": 38032.75972512833\n },\n {\n \"content\": \"fn main() -> Result<()> {\\n\\n use graph::Graph;\\n\\n use time::PreciseTime;\\n\\n\\n\\n // yes, hardcoded string here\\n\\n let graph = Graph::read(r\\\"C:\\\\Users\\\\artem\\\\Downloads\\\\brock400_2.clq.txt\\\")?;\\n\\n\\n\\n let start = PreciseTime::now();\\n\\n let max_clique = graph::get_max_clique(graph.clone());\\n\\n let end = PreciseTime::now();\\n\\n\\n\\n let spent = start.to(end);\\n\\n let sec = spent.num_seconds() - 60 * spent.num_minutes();\\n\\n let min = spent.num_minutes() - 60 * spent.num_hours();\\n\\n let hours = spent.num_hours();\\n\\n println!(\\\"time spent: {}h {}m {}s\\\", hours, min, sec);\\n\\n println!(\\\"Max clique size: {}\\\", max_clique.len());\\n\\n print_clique(&max_clique);\\n\\n Ok(())\\n\\n}\\n\",\n \"file_path\": \"src/main.rs\",\n \"rank\": 4,\n \"score\": 15200.376041941792\n },\n {\n \"content\": \"#[macro_use]\\n\\nextern crate lazy_static;\\n\\nextern crate regex;\\n\\nextern crate time;\\n\\n\\n\\nuse std::io::Result;\\n\\n\\n\\nmod graph;\\n\\n\\n\",\n \"file_path\": \"src/main.rs\",\n \"rank\": 12,\n \"score\": 4.212971738551787\n }\n]","isConversational":false}}},{"rowIdx":2374,"cells":{"lang":{"kind":"string","value":"Rust"},"file_path":{"kind":"string","value":"necsim/impls/std/src/cogs/active_lineage_sampler/gillespie/sampler.rs"},"repo_name":{"kind":"string","value":"fossabot/necsim-rust"},"commit":{"kind":"string","value":"996b6a6977bc27a997a123e3e4f5a7b11e1a1aef"},"file_code":{"kind":"string","value":"use necsim_core::{\n cogs::{\n ActiveLineageSampler, CoalescenceSampler, DispersalSampler, EmigrationExit,\n EmptyActiveLineageSamplerError, GloballyCoherentLineageStore, Habitat, ImmigrationEntry,\n LineageReference, PeekableActiveLineageSampler, RngCore, SpeciationProbability,\n TurnoverRate,\n },\n landscape::IndexedLocation,\n lineage::GlobalLineageReference,\n simulation::partial::active_lineager_sampler::PartialSimulation,\n};\n\nuse necsim_core_bond::{NonNegativeF64, PositiveF64};\nuse necsim_impls_no_std::cogs::event_sampler::gillespie::{\n GillespieEventSampler, GillespiePartialSimulation,\n};\n\nuse super::{EventTime, GillespieActiveLineageSampler};\n\n#[contract_trait]\nimpl<\n H: Habitat,\n G: RngCore,\n R: LineageReference<H>,\n S: GloballyCoherentLineageStore<H, R>,\n X: EmigrationExit<H, G, R, S>,\n D: DispersalSampler<H, G>,\n C: CoalescenceSampler<H, R, S>,\n T: TurnoverRate<H>,\n N: SpeciationProbability<H>,\n E: GillespieEventSampler<H, G, R, S, X, D, C, T, N>,\n I: ImmigrationEntry,\n > ActiveLineageSampler<H, G, R, S, X, D, C, T, N, E, I>\n for GillespieActiveLineageSampler<H, G, R, S, X, D, C, T, N, E, I>\n{\n #[must_use]\n fn number_active_lineages(&self) -> usize {\n self.number_active_lineages\n }\n\n #[must_use]\n fn get_last_event_time(&self) -> NonNegativeF64 {\n self.last_event_time\n }\n\n #[must_use]\n fn pop_active_lineage_indexed_location_prior_event_time(\n &mut self,\n simulation: &mut PartialSimulation<H, G, R, S, X, D, C, T, N, E>,\n rng: &mut G,\n ) -> Option<(R, IndexedLocation, NonNegativeF64, PositiveF64)> {\n use necsim_core::cogs::RngSampler;\n\n let (chosen_active_location, chosen_event_time) = self.active_locations.pop()?;\n\n let unique_event_time =\n PositiveF64::max_after(self.last_event_time, chosen_event_time.into());\n\n let lineages_at_location = simulation\n .lineage_store\n .get_active_local_lineage_references_at_location_unordered(\n &chosen_active_location,\n &simulation.habitat,\n );\n let number_lineages_left_at_location = lineages_at_location.len() - 1;\n\n let chosen_lineage_index_at_location = rng.sample_index(lineages_at_location.len());\n let chosen_lineage_reference =\n lineages_at_location[chosen_lineage_index_at_location].clone();\n\n let (lineage_indexed_location, prior_event_time) = simulation\n .lineage_store\n .extract_lineage_from_its_location_globally_coherent(\n chosen_lineage_reference.clone(),\n unique_event_time,\n &simulation.habitat,\n );\n self.number_active_lineages -= 1;\n\n if number_lineages_left_at_location > 0 {\n if let Ok(event_rate_at_location) = PositiveF64::new(\n simulation\n .with_split_event_sampler(|event_sampler, simulation| {\n GillespiePartialSimulation::without_emigration_exit(\n simulation,\n |simulation| {\n \n \n event_sampler\n .get_event_rate_at_location(&chosen_active_location, simulation)\n },\n )\n })\n .get(),\n ) {\n self.active_locations.push(\n chosen_active_location,\n EventTime::from(\n unique_event_time + rng.sample_exponential(event_rate_at_location),\n ),\n );\n }\n }\n\n self.last_event_time = unique_event_time.into();\n\n Some((\n chosen_lineage_reference,\n lineage_indexed_location,\n prior_event_time,\n unique_event_time,\n ))\n }\n\n #[debug_requires(\n simulation.lineage_store.get_active_local_lineage_references_at_location_unordered(\n indexed_location.location(), &simulation.habitat\n ).len() < (\n simulation.habitat.get_habitat_at_location(indexed_location.location()) as usize\n ), \"location has habitat capacity for the lineage\"\n )]\n fn push_active_lineage_to_indexed_location(\n &mut self,\n lineage_reference: R,\n indexed_location: IndexedLocation,\n time: PositiveF64,\n simulation: &mut PartialSimulation<H, G, R, S, X, D, C, T, N, E>,\n rng: &mut G,\n ) {\n use necsim_core::cogs::RngSampler;\n\n let location = indexed_location.location().clone();\n\n simulation\n .lineage_store\n .insert_lineage_to_indexed_location_globally_coherent(\n lineage_reference,\n indexed_location,\n &simulation.habitat,\n );\n\n if let Ok(event_rate_at_location) = PositiveF64::new(\n simulation\n .with_split_event_sampler(|event_sampler, simulation| {\n GillespiePartialSimulation::without_emigration_exit(simulation, |simulation| {\n \n \n event_sampler.get_event_rate_at_location(&location, simulation)\n })\n })\n .get(),\n ) {\n self.active_locations.push(\n location,\n EventTime::from(time + rng.sample_exponential(event_rate_at_location)),\n );\n\n self.number_active_lineages += 1;\n }\n\n self.last_event_time = time.into();\n }\n\n fn insert_new_lineage_to_indexed_location(\n &mut self,\n global_reference: GlobalLineageReference,\n indexed_location: IndexedLocation,\n time: PositiveF64,\n simulation: &mut PartialSimulation<H, G, R, S, X, D, C, T, N, E>,\n rng: &mut G,\n ) {\n use necsim_core::cogs::RngSampler;\n\n let location = indexed_location.location().clone();\n\n let _immigrant_lineage_reference = simulation.lineage_store.immigrate_globally_coherent(\n &simulation.habitat,\n global_reference,\n indexed_location,\n time,\n );\n\n if let Ok(event_rate_at_location) = PositiveF64::new(\n simulation\n .with_split_event_sampler(|event_sampler, simulation| {\n GillespiePartialSimulation::without_emigration_exit(simulation, |simulation| {\n \n \n event_sampler.get_event_rate_at_location(&location, simulation)\n })\n })\n .get(),\n ) {\n self.active_locations.push(\n location,\n EventTime::from(time + rng.sample_exponential(event_rate_at_location)),\n );\n\n self.number_active_lineages += 1;\n }\n\n self.last_event_time = time.into();\n }\n}\n\n#[contract_trait]\nimpl<\n H: Habitat,\n G: RngCore,\n R: LineageReference<H>,\n S: GloballyCoherentLineageStore<H, R>,\n X: EmigrationExit<H, G, R, S>,\n D: DispersalSampler<H, G>,\n C: CoalescenceSampler<H, R, S>,\n T: TurnoverRate<H>,\n N: SpeciationProbability<H>,\n E: GillespieEventSampler<H, G, R, S, X, D, C, T, N>,\n I: ImmigrationEntry,\n > PeekableActiveLineageSampler<H, G, R, S, X, D, C, T, N, E, I>\n for GillespieActiveLineageSampler<H, G, R, S, X, D, C, T, N, E, I>\n{\n fn peek_time_of_next_event(\n &mut self,\n _habitat: &H,\n _turnover_rate: &T,\n _rng: &mut G,\n ) -> Result<PositiveF64, EmptyActiveLineageSamplerError> {\n self.active_locations\n .peek()\n .map(|(_, next_event_time)| {\n PositiveF64::max_after(self.last_event_time, (*next_event_time).into())\n })\n .ok_or(EmptyActiveLineageSamplerError)\n }\n}\n"},"prefix":{"kind":"string","value":"use necsim_core::{\n cogs::{\n ActiveLineageSampler, CoalescenceSampler, DispersalSampler, EmigrationExit,\n EmptyActiveLineageSamplerError, GloballyCoherentLineageStore, Habitat, ImmigrationEntry,\n LineageReference, PeekableActiveLineageSampler, RngCore, SpeciationProbability,\n TurnoverRate,\n },\n landscape::IndexedLocation,\n lineage::GlobalLineageReference,\n simulation::partial::active_lineager_sampler::PartialSimulation,\n};\n\nuse necsim_core_bond::{NonNegativeF64, PositiveF64};\nuse necsim_impls_no_std::cogs::event_sampler::gillespie::{\n GillespieEventSampler, GillespiePartialSimulation,\n};\n\nuse super::{EventTime, GillespieActiveLineageSampler};\n\n#[contract_trait]\nimpl<\n H: Habitat,\n G: RngCore,\n R: LineageReference<H>,\n S: GloballyCoherentLineageStore<H, R>,\n X: EmigrationExit<H, G, R, S>,\n D: DispersalSampler<H, G>,\n C: CoalescenceSampler<H, R, S>,\n T: TurnoverRate<H>,\n N: SpeciationProbability<H>,\n E: GillespieEventSampler<H, G, R, S, X, D, C, T, N>,\n I: ImmigrationEntry,\n > ActiveLineageSampler<H, G, R, S, X, D, C, T, N, E, I>\n for GillespieActiveLineageSampler<H, G, R, S, X, D, C, T, N, E, I>\n{\n #[must_use]\n fn number_active_lineages(&self) -> usize {\n self.number_active_lineages\n }\n\n #[must_use]\n fn get_last_event_time(&self) -> NonNegativeF64 {\n self.last_event_time\n }\n\n #[must_use]\n fn pop_active_lineage_indexed_location_prior_event_time(\n &mut self,\n simulation: &mut PartialSimulation<H, G, R, S, X, D, C, T, N, E>,\n rng: &mut G,\n ) -> Option<(R, IndexedLocation, NonNegativeF64, PositiveF64)> {\n use necsim_core::cogs::RngSampler;\n\n let (chosen_active_location, chosen_event_time) = self.active_locations.pop()?;\n\n let unique_event_time =\n PositiveF64::max_after(self.last_event_time, chosen_event_time.into());\n\n let lineages_at_location = simulation\n .lineage_store\n .get_active_local_lineage_references_at_location_unordered(\n &chosen_active_location,\n &simulation.habitat,\n );\n let number_lineages_left_at_location = lineages_at_location.len() - 1;\n\n let chosen_lineage_index_at_location = rng.sample_index(lineages_at_location.len());\n let chosen_lineage_reference =\n lineages_at_location[chosen_lineage_index_at_location].clone();\n\n let (lineage_indexed_location, prior_event_time) = simulation\n .lineage_store\n .extract_lineage_from_its_location_globally_coherent(\n chosen_lineage_reference.clone(),\n unique_event_time,\n &simulation.habitat,\n );\n self.number_active_lineages -= 1;\n\n if number_lineages_left_at_location > 0 {\n if let Ok(event_rate_at_location) = PositiveF64::new(\n simulation\n .with_split_event_sampler(|event_sampler, simulation| {\n GillespiePartialSimulation::without_emigration_exit(\n simulation,\n |simulation| {\n \n \n event_sampler\n .get_event_rate_at_location(&chosen_active_location, simulation)\n },\n )\n })\n .get(),\n ) {\n self.active_locations.push(\n chosen_active_location,\n EventTime::from(\n unique_event_time + rng.sample_exponential(event_rate_at_location),\n ),\n );\n }\n }\n\n self.last_event_time = unique_event_time.into();\n\n Some((\n chosen_lineage_reference,\n lineage_indexed_location,\n prior_event_time,\n unique_event_time,\n ))\n }\n\n #[debug_requires(\n simulation.lineage_store.get_active_local_lineage_references_at_location_unordered(\n indexed_location.location(), &simulation.habitat\n ).len() < (\n simulation.habitat.get_habitat_at_location(indexed_location.location()) as usize\n ), \"location has habitat capacity for the lineage\"\n )]\n fn push_active_lineage_to_indexed_location(\n &mut self,\n lineage_reference: R,\n indexed_location: IndexedLocation,\n time: PositiveF64,\n simulation: &mut PartialSimulation<H, G, R, S, X, D, C, T, N, E>,\n rng: &mut G,\n ) {\n use necsim_core::cogs::RngSampler;\n\n let location = indexed_location.location().clone();\n\n simulation\n .lineage_store\n .insert_lineage_to_indexed_location_globally_coherent(\n lineage_reference,\n indexed_location,\n &simulation.habitat,\n );\n\n if let Ok(event_rate_at_location) = PositiveF64::new(\n simulation\n .with_split_event_sampler(|event_sampler, simulation| {\n GillespiePartialSimulation::without_emigration_exit(simulation, |simulation| {\n \n \n event_sampler.get_event_rate_at_location(&location, simulation)\n })\n })\n .get(),\n ) {\n self.active_locations.push(\n location,\n EventTime::from(time + rng.sample_exponential(event_rate_at_location)),\n );\n\n self.number_active_lineages += 1;\n }\n\n self.last_event_time = time.into();\n }\n\n "},"suffix":{"kind":"string","value":"\n}\n\n#[contract_trait]\nimpl<\n H: Habitat,\n G: RngCore,\n R: LineageReference<H>,\n S: GloballyCoherentLineageStore<H, R>,\n X: EmigrationExit<H, G, R, S>,\n D: DispersalSampler<H, G>,\n C: CoalescenceSampler<H, R, S>,\n T: TurnoverRate<H>,\n N: SpeciationProbability<H>,\n E: GillespieEventSampler<H, G, R, S, X, D, C, T, N>,\n I: ImmigrationEntry,\n > PeekableActiveLineageSampler<H, G, R, S, X, D, C, T, N, E, I>\n for GillespieActiveLineageSampler<H, G, R, S, X, D, C, T, N, E, I>\n{\n fn peek_time_of_next_event(\n &mut self,\n _habitat: &H,\n _turnover_rate: &T,\n _rng: &mut G,\n ) -> Result<PositiveF64, EmptyActiveLineageSamplerError> {\n self.active_locations\n .peek()\n .map(|(_, next_event_time)| {\n PositiveF64::max_after(self.last_event_time, (*next_event_time).into())\n })\n .ok_or(EmptyActiveLineageSamplerError)\n }\n}\n"},"middle":{"kind":"string","value":"fn insert_new_lineage_to_indexed_location(\n &mut self,\n global_reference: GlobalLineageReference,\n indexed_location: IndexedLocation,\n time: PositiveF64,\n simulation: &mut PartialSimulation<H, G, R, S, X, D, C, T, N, E>,\n rng: &mut G,\n ) {\n use necsim_core::cogs::RngSampler;\n\n let location = indexed_location.location().clone();\n\n let _immigrant_lineage_reference = simulation.lineage_store.immigrate_globally_coherent(\n &simulation.habitat,\n global_reference,\n indexed_location,\n time,\n );\n\n if let Ok(event_rate_at_location) = PositiveF64::new(\n simulation\n .with_split_event_sampler(|event_sampler, simulation| {\n GillespiePartialSimulation::without_emigration_exit(simulation, |simulation| {\n \n \n event_sampler.get_event_rate_at_location(&location, simulation)\n })\n })\n .get(),\n ) {\n self.active_locations.push(\n location,\n EventTime::from(time + rng.sample_exponential(event_rate_at_location)),\n );\n\n self.number_active_lineages += 1;\n }\n\n self.last_event_time = time.into();\n }"},"strategy":{"kind":"string","value":"function_block-full_function"},"context_items":{"kind":"list like","value":[{"content":"#[contract_trait]\n\npub trait EmigrationExit<H: Habitat, G: RngCore, R: LineageReference<H>, S: LineageStore<H, R>>:\n\n crate::cogs::Backup + core::fmt::Debug\n\n{\n\n #[must_use]\n\n #[debug_ensures(match &ret {\n\n Some((\n\n ret_lineage_reference,\n\n ret_dispersal_origin,\n\n ret_dispersal_target,\n\n ret_prior_time,\n\n ret_event_time,\n\n )) => {\n\n ret_lineage_reference == &old(lineage_reference.clone()) &&\n\n ret_dispersal_origin == &old(dispersal_origin.clone()) &&\n\n ret_dispersal_target == &old(dispersal_target.clone()) &&\n\n ret_prior_time == &old(prior_time) &&\n\n ret_event_time == &old(event_time)\n\n },\n\n None => true,\n\n }, \"if ret is Some, it returns the input parameters unchanged\")]\n","file_path":"necsim/core/src/cogs/emigration_exit.rs","rank":0,"score":442210.9458263971},{"content":"#[allow(clippy::module_name_repetitions)]\n\n#[allow(clippy::inline_always, clippy::inline_fn_without_body)]\n\n#[contract_trait]\n\npub trait EventTimeSampler<H: Habitat, G: PrimeableRng, T: TurnoverRate<H>>:\n\n Clone + core::fmt::Debug\n\n{\n\n #[debug_requires(\n\n habitat.get_habitat_at_location(indexed_location.location()) > 0,\n\n \"indexed_location must be habitable\"\n\n )]\n\n #[debug_ensures(ret >= time, \"the next event will happen weakly after time\")]\n\n fn next_event_time_at_indexed_location_weakly_after(\n\n &self,\n\n indexed_location: &IndexedLocation,\n\n time: NonNegativeF64,\n\n habitat: &H,\n\n rng: &mut G,\n\n turnover_rate: &T,\n\n ) -> NonNegativeF64;\n\n}\n","file_path":"necsim/impls/no-std/src/cogs/active_lineage_sampler/independent/event_time_sampler/mod.rs","rank":1,"score":384088.87673975795},{"content":"#[allow(clippy::module_name_repetitions)]\n\n#[allow(clippy::inline_always, clippy::inline_fn_without_body)]\n\n#[contract_trait]\n\npub trait InMemoryDispersalSampler<H: Habitat, G: RngCore>: DispersalSampler<H, G> + Sized {\n\n #[debug_requires((\n\n dispersal.num_columns() == (\n\n (habitat.get_extent().width() * habitat.get_extent().height()) as usize\n\n ) && dispersal.num_rows() == (\n\n (habitat.get_extent().width() * habitat.get_extent().height()) as usize\n\n )\n\n ), \"dispersal dimensions are consistent\")]\n\n #[debug_requires(\n\n explicit_in_memory_dispersal_check_contract(dispersal, habitat),\n\n \"dispersal probabilities are consistent\"\n\n )]\n\n fn unchecked_new(dispersal: &Array2D<f64>, habitat: &H) -> Self;\n\n}\n","file_path":"necsim/impls/no-std/src/cogs/dispersal_sampler/in_memory/mod.rs","rank":2,"score":352473.406569776},{"content":"#[allow(clippy::module_name_repetitions)]\n\n#[allow(clippy::inline_always, clippy::inline_fn_without_body)]\n\n#[contract_trait]\n\npub trait InMemoryDispersalSampler<H: Habitat, G: RngCore>:\n\n InMemoryDispersalSamplerNoError<H, G> + Sized\n\n{\n\n #[debug_ensures(\n\n matches!(ret, Err(InMemoryDispersalSamplerError::InconsistentDispersalMapSize)) != (\n\n dispersal.num_columns() == old(\n\n (habitat.get_extent().width() * habitat.get_extent().height()) as usize\n\n ) && dispersal.num_rows() == old(\n\n (habitat.get_extent().width() * habitat.get_extent().height()) as usize\n\n )\n\n ),\n\n \"returns Err(InconsistentDispersalMapSize) iff the dispersal dimensions are inconsistent\"\n\n )]\n\n #[debug_ensures(\n\n matches!(ret, Err(\n\n InMemoryDispersalSamplerError::InconsistentDispersalProbabilities\n\n )) != old(\n\n explicit_in_memory_dispersal_check_contract(dispersal, habitat)\n\n ), \"returns Err(InconsistentDispersalProbabilities) iff the dispersal probabilities are inconsistent\"\n\n )]\n","file_path":"necsim/impls/std/src/cogs/dispersal_sampler/in_memory/mod.rs","rank":3,"score":344958.1022079651},{"content":"#[allow(clippy::inline_always, clippy::inline_fn_without_body)]\n\n#[allow(clippy::module_name_repetitions)]\n\n#[contract_trait]\n\npub trait SeparableDispersalSampler<H: Habitat, G: RngCore>: DispersalSampler<H, G> {\n\n #[must_use]\n\n #[debug_requires(habitat.contains(location), \"location is inside habitat\")]\n\n #[debug_ensures(old(habitat).contains(&ret), \"target is inside habitat\")]\n\n #[debug_ensures(&ret != location, \"disperses to a different location\")]\n\n fn sample_non_self_dispersal_from_location(\n\n &self,\n\n location: &Location,\n\n habitat: &H,\n\n rng: &mut G,\n\n ) -> Location;\n\n\n\n #[must_use]\n\n #[debug_requires(habitat.contains(location), \"location is inside habitat\")]\n\n fn get_self_dispersal_probability_at_location(\n\n &self,\n\n location: &Location,\n\n habitat: &H,\n\n ) -> ClosedUnitF64;\n\n}\n","file_path":"necsim/core/src/cogs/dispersal_sampler.rs","rank":4,"score":333459.7349511563},{"content":"#[allow(clippy::inline_always, clippy::inline_fn_without_body)]\n\n#[contract_trait]\n\npub trait LineageStore<H: Habitat, R: LineageReference<H>>:\n\n crate::cogs::Backup + Sized + core::fmt::Debug\n\n{\n\n type LineageReferenceIterator<'a>: Iterator<Item = R>;\n\n\n\n #[must_use]\n\n fn from_origin_sampler<'h, O: OriginSampler<'h, Habitat = H>>(origin_sampler: O) -> Self\n\n where\n\n H: 'h;\n\n\n\n #[must_use]\n\n fn get_number_total_lineages(&self) -> usize;\n\n\n\n #[must_use]\n\n fn iter_local_lineage_references(&self) -> Self::LineageReferenceIterator<'_>;\n\n\n\n #[must_use]\n\n fn get(&self, reference: R) -> Option<&Lineage>;\n\n}\n\n\n","file_path":"necsim/core/src/cogs/lineage_store.rs","rank":5,"score":327377.1780122654},{"content":"#[allow(clippy::inline_always, clippy::inline_fn_without_body)]\n\n#[contract_trait]\n\npub trait CoalescenceSampler<H: Habitat, R: LineageReference<H>, S: LineageStore<H, R>>:\n\n crate::cogs::Backup + core::fmt::Debug\n\n{\n\n #[must_use]\n\n #[debug_requires(habitat.get_habitat_at_location(&location) > 0, \"location is habitable\")]\n\n fn sample_interaction_at_location(\n\n &self,\n\n location: Location,\n\n habitat: &H,\n\n lineage_store: &S,\n\n coalescence_rng_sample: CoalescenceRngSample,\n\n ) -> (IndexedLocation, LineageInteraction);\n\n}\n\n\n\n#[derive(Debug, PartialEq)]\n\n#[cfg_attr(feature = \"mpi\", derive(mpi::traits::Equivalence))]\n\npub struct CoalescenceRngSample(ClosedUnitF64);\n\n\n\n#[contract_trait]\n\nimpl Backup for CoalescenceRngSample {\n","file_path":"necsim/core/src/cogs/coalescence_sampler.rs","rank":6,"score":326479.6645554225},{"content":"#[allow(clippy::inline_always, clippy::inline_fn_without_body)]\n\n#[allow(clippy::module_name_repetitions)]\n\n#[contract_trait]\n\npub trait LocallyCoherentLineageStore<H: Habitat, R: LineageReference<H>>:\n\n LineageStore<H, R> + Index<R, Output = Lineage>\n\n{\n\n #[must_use]\n\n #[debug_requires(\n\n habitat.contains(indexed_location.location()),\n\n \"indexed location is inside habitat\"\n\n )]\n\n fn get_active_global_lineage_reference_at_indexed_location(\n\n &self,\n\n indexed_location: &IndexedLocation,\n\n habitat: &H,\n\n ) -> Option<&GlobalLineageReference>;\n\n\n\n #[debug_requires(\n\n habitat.contains(indexed_location.location()),\n\n \"indexed location is inside habitat\"\n\n )]\n\n #[debug_requires(self.get(reference.clone()).is_some(), \"lineage reference is valid\")]\n\n #[debug_requires(!self[reference.clone()].is_active(), \"lineage is inactive\")]\n","file_path":"necsim/core/src/cogs/lineage_store.rs","rank":7,"score":320693.4490262261},{"content":"#[allow(clippy::inline_always, clippy::inline_fn_without_body)]\n\n#[allow(clippy::module_name_repetitions)]\n\n#[contract_trait]\n\npub trait GloballyCoherentLineageStore<H: Habitat, R: LineageReference<H>>:\n\n LocallyCoherentLineageStore<H, R>\n\n{\n\n type LocationIterator<'a>: Iterator<Item = Location>;\n\n\n\n #[must_use]\n\n fn iter_active_locations(&self, habitat: &H) -> Self::LocationIterator<'_>;\n\n\n\n #[must_use]\n\n #[debug_requires(habitat.contains(location), \"location is inside habitat\")]\n\n fn get_active_local_lineage_references_at_location_unordered(\n\n &self,\n\n location: &Location,\n\n habitat: &H,\n\n ) -> &[R];\n\n\n\n #[debug_ensures(\n\n self.get_active_local_lineage_references_at_location_unordered(\n\n &old(indexed_location.location().clone()), old(habitat)\n\n ).last() == Some(&old(reference.clone())),\n","file_path":"necsim/core/src/cogs/lineage_store.rs","rank":8,"score":320693.4490262261},{"content":"#[allow(clippy::module_name_repetitions)]\n\npub fn explicit_in_memory_dispersal_check_contract<H: Habitat>(\n\n dispersal: &Array2D<f64>,\n\n habitat: &H,\n\n) -> bool {\n\n let habitat_width = habitat.get_extent().width();\n\n\n\n for row_index in 0..dispersal.num_rows() {\n\n #[allow(clippy::cast_possible_truncation)]\n\n let dispersal_origin = Location::new(\n\n (row_index % habitat_width as usize) as u32,\n\n (row_index / habitat_width as usize) as u32,\n\n );\n\n\n\n if habitat.get_habitat_at_location(&dispersal_origin) > 0 {\n\n let mut any_dispersal = false;\n\n\n\n for col_index in 0..dispersal.num_columns() {\n\n #[allow(clippy::cast_possible_truncation)]\n\n let dispersal_target = Location::new(\n\n (col_index % habitat_width as usize) as u32,\n","file_path":"necsim/impls/no-std/src/cogs/dispersal_sampler/in_memory/contract.rs","rank":9,"score":286813.664825672},{"content":"#[allow(clippy::inline_always, clippy::inline_fn_without_body)]\n\n#[allow(clippy::module_name_repetitions)]\n\n#[contract_trait]\n\npub trait DispersalSampler<H: Habitat, G: RngCore>: crate::cogs::Backup + core::fmt::Debug {\n\n #[must_use]\n\n #[debug_requires(habitat.contains(location), \"location is inside habitat\")]\n\n #[debug_ensures(old(habitat).contains(&ret), \"target is inside habitat\")]\n\n fn sample_dispersal_from_location(\n\n &self,\n\n location: &Location,\n\n habitat: &H,\n\n rng: &mut G,\n\n ) -> Location;\n\n}\n\n\n","file_path":"necsim/core/src/cogs/dispersal_sampler.rs","rank":10,"score":283430.30331224354},{"content":"#[inline]\n\n#[allow(clippy::cast_possible_truncation)]\n\nfn wymum(mut a: u64, mut b: u64) -> u64 {\n\n // WyHash diffusion function\n\n // https://docs.rs/wyhash/0.5.0/src/wyhash/functions.rs.html#8-12\n\n let r = u128::from(a) * u128::from(b);\n\n\n\n // WyHash condom\n\n // https://github.com/wangyi-fudan/wyhash/blob/master/wyhash.h#L57\n\n a ^= r as u64;\n\n b ^= (r >> 64) as u64;\n\n\n\n a ^ b\n\n}\n\n\n\n#[inline]\n\nconst fn seahash_diffuse(mut x: u64) -> u64 {\n\n // SeaHash diffusion function\n\n // https://docs.rs/seahash/4.1.0/src/seahash/helper.rs.html#75-92\n\n\n\n // These are derived from the PCG RNG's round. Thanks to @Veedrac for proposing\n\n // this. The basic idea is that we use dynamic shifts, which are determined\n","file_path":"necsim/impls/no-std/src/cogs/rng/wyhash.rs","rank":11,"score":282094.106960733},{"content":"#[allow(clippy::module_name_repetitions)]\n\npub trait HabitatPrimeableRng<H: Habitat>: PrimeableRng {\n\n #[inline]\n\n fn prime_with_habitat(\n\n &mut self,\n\n habitat: &H,\n\n indexed_location: &IndexedLocation,\n\n time_index: u64,\n\n ) {\n\n self.prime_with(\n\n habitat.map_indexed_location_to_u64_injective(indexed_location),\n\n time_index,\n\n );\n\n }\n\n}\n\n\n\nimpl<R: PrimeableRng, H: Habitat> HabitatPrimeableRng<H> for R {}\n\n\n","file_path":"necsim/core/src/cogs/rng.rs","rank":12,"score":261917.10245127167},{"content":"#[allow(clippy::module_name_repetitions)]\n\npub trait LineageReference<H: Habitat>:\n\n crate::cogs::Backup + PartialEq + Eq + Hash + Clone + core::fmt::Debug\n\n{\n\n}\n","file_path":"necsim/core/src/cogs/lineage_reference.rs","rank":13,"score":253566.9201438749},{"content":"/// A convenience function for reading data from a reader\n\n/// and feeding into a deserializer.\n\npub fn from_reader<R, T>(mut rdr: R) -> Result<T>\n\nwhere\n\n R: io::Read,\n\n T: de::DeserializeOwned,\n\n{\n\n let mut bytes = Vec::new();\n\n rdr.read_to_end(&mut bytes)?;\n\n\n\n from_bytes(&bytes)\n\n}\n\n\n","file_path":"third-party/ron/src/de/mod.rs","rank":14,"score":213042.3534687739},{"content":"#[allow(unreachable_code)]\n\n#[allow(unused_variables)]\n\n#[allow(clippy::needless_pass_by_value)]\n\npub fn simulate<R: ReporterContext, P: LocalPartition<R>>(\n\n common_args: CommonArgs,\n\n non_spatial_args: NonSpatialArgs,\n\n local_partition: &mut P,\n\n) -> Result<(f64, u64)> {\n\n info!(\n\n \"Setting up the non-spatial {} coalescence algorithm ...\",\n\n common_args.algorithm\n\n );\n\n\n\n #[allow(clippy::match_single_binding)]\n\n #[allow(clippy::map_err_ignore)]\n\n let result: Result<(f64, u64)> = match common_args.algorithm {\n\n #[cfg(feature = \"necsim-classical\")]\n\n Algorithm::Classical => ClassicalSimulation::simulate(\n\n non_spatial_args.area,\n\n non_spatial_args.deme,\n\n common_args.speciation_probability_per_generation.get(),\n\n common_args.sample_percentage.get(),\n\n common_args.seed,\n","file_path":"rustcoalescence/src/simulation/non_spatial.rs","rank":15,"score":209904.86862020678},{"content":"#[allow(clippy::too_many_lines, clippy::boxed_local)]\n\npub fn simulate_with_logger<R: Reporter, P: LocalPartition<R>>(\n\n mut local_partition: Box<P>,\n\n common_args: CommonArgs,\n\n scenario: ScenarioArgs,\n\n) -> Result<()> {\n\n if local_partition.get_number_of_partitions().get() <= 1 {\n\n info!(\"The simulation will be run in monolithic mode.\");\n\n } else {\n\n info!(\n\n \"The simulation will be distributed across {} partitions.\",\n\n local_partition.get_number_of_partitions().get()\n\n );\n\n }\n\n\n\n let pre_sampler = OriginPreSampler::all().percentage(common_args.sample_percentage.get());\n\n\n\n let (time, steps): (NonNegativeF64, u64) = crate::match_scenario_algorithm!(\n\n (common_args.algorithm, scenario => scenario)\n\n {\n\n #[cfg(feature = \"rustcoalescence-algorithms-monolithic\")]\n","file_path":"rustcoalescence/src/cli/simulate/dispatch.rs","rank":16,"score":209904.86862020678},{"content":"#[allow(unreachable_code)]\n\n#[allow(unused_variables)]\n\n#[allow(clippy::needless_pass_by_value)]\n\npub fn simulate<R: ReporterContext, P: LocalPartition<R>>(\n\n common_args: CommonArgs,\n\n spatially_implicit_args: SpatiallyImplicitArgs,\n\n local_partition: &mut P,\n\n) -> Result<(f64, u64)> {\n\n info!(\n\n \"Setting up the spatially-implicit {} coalescence algorithm ...\",\n\n common_args.algorithm\n\n );\n\n\n\n #[allow(clippy::match_single_binding)]\n\n #[allow(clippy::map_err_ignore)]\n\n let result: Result<(f64, u64)> = match common_args.algorithm {\n\n #[cfg(feature = \"necsim-classical\")]\n\n Algorithm::Classical => ClassicalSimulation::simulate(\n\n spatially_implicit_args.dynamic_meta,\n\n (\n\n spatially_implicit_args.local_area,\n\n spatially_implicit_args.local_deme,\n\n ),\n","file_path":"rustcoalescence/src/simulation/spatially_implicit.rs","rank":17,"score":209904.86862020678},{"content":"#[allow(clippy::module_name_repetitions)]\n\npub fn simulate_with_logger<R: Reporter, P: LocalPartition<R>>(\n\n local_partition: Box<P>,\n\n common_args: CommonArgs,\n\n scenario: ScenarioArgs,\n\n) -> Result<()> {\n\n #[cfg(any(\n\n feature = \"rustcoalescence-algorithms-monolithic\",\n\n feature = \"rustcoalescence-algorithms-independent\",\n\n feature = \"rustcoalescence-algorithms-cuda\"\n\n ))]\n\n {\n\n dispatch::simulate_with_logger(local_partition, common_args, scenario)\n\n }\n\n\n\n #[cfg(not(any(\n\n feature = \"rustcoalescence-algorithms-monolithic\",\n\n feature = \"rustcoalescence-algorithms-independent\",\n\n feature = \"rustcoalescence-algorithms-cuda\"\n\n )))]\n\n {\n\n std::mem::drop(local_partition);\n\n std::mem::drop(common_args);\n\n std::mem::drop(scenario);\n\n\n\n Err(anyhow::anyhow!(\n\n \"rustcoalescence must be compiled to support at least one algorithm.\"\n\n ))\n\n }\n\n}\n","file_path":"rustcoalescence/src/cli/simulate/mod.rs","rank":18,"score":209904.86862020678},{"content":"#[allow(unreachable_code)]\n\n#[allow(unused_variables)]\n\n#[allow(clippy::needless_pass_by_value)]\n\npub fn simulate<R: ReporterContext, P: LocalPartition<R>>(\n\n common_args: CommonArgs,\n\n almost_infinite_args: AlmostInfiniteArgs,\n\n local_partition: &mut P,\n\n) -> Result<(f64, u64)> {\n\n info!(\n\n \"Setting up the almost-infinite {} coalescence algorithm ...\",\n\n common_args.algorithm\n\n );\n\n\n\n #[allow(clippy::match_single_binding)]\n\n #[allow(clippy::map_err_ignore)]\n\n let result: Result<(f64, u64)> = match common_args.algorithm {\n\n #[cfg(feature = \"necsim-classical\")]\n\n Algorithm::Classical => ClassicalSimulation::simulate(\n\n almost_infinite_args.radius,\n\n almost_infinite_args.sigma.get(),\n\n common_args.speciation_probability_per_generation.get(),\n\n common_args.sample_percentage.get(),\n\n common_args.seed,\n","file_path":"rustcoalescence/src/simulation/almost_infinite.rs","rank":19,"score":209904.86862020678},{"content":"#[allow(unreachable_code)]\n\n#[allow(unused_variables)]\n\n#[allow(clippy::needless_pass_by_value)]\n\npub fn simulate<R: ReporterContext, P: LocalPartition<R>>(\n\n common_args: CommonArgs,\n\n in_memory_args: InMemoryArgs,\n\n local_partition: &mut P,\n\n) -> Result<(f64, u64)> {\n\n info!(\n\n \"Setting up the in-memory {} coalescence algorithm ...\",\n\n common_args.algorithm\n\n );\n\n\n\n #[allow(clippy::match_single_binding)]\n\n let result: Result<(f64, u64)> = match common_args.algorithm {\n\n #[cfg(feature = \"necsim-classical\")]\n\n Algorithm::Classical => ClassicalSimulation::simulate(\n\n &in_memory_args.habitat_map,\n\n &in_memory_args.dispersal_map,\n\n common_args.speciation_probability_per_generation.get(),\n\n common_args.sample_percentage.get(),\n\n common_args.seed,\n\n local_partition,\n","file_path":"rustcoalescence/src/simulation/spatially_explicit.rs","rank":20,"score":209904.86862020678},{"content":"// Fix habitat rounding error by correcting 0/1 values to 0/1 based on dispersal\n\n// (can only disperse from habitat)\n\nfn fix_habitat_map(habitat: &mut Array2D<u32>, dispersal: &Array2D<f64>) {\n\n for y in 0..habitat.num_rows() {\n\n for x in 0..habitat.num_columns() {\n\n let h_before = habitat[(y, x)];\n\n\n\n if h_before <= 1 {\n\n // If there is any dispersal from this location, it must be habitat\n\n let h_fixed = if dispersal\n\n .row_iter(y * habitat.num_columns() + x)\n\n .map_or(false, |mut it| it.any(|p| *p > 0.0_f64))\n\n {\n\n 1\n\n } else {\n\n 0\n\n };\n\n\n\n if h_fixed != h_before {\n\n habitat[(y, x)] = h_fixed;\n\n\n\n // warn!(\n\n // \"Corrected habitat value {} to {} at ({},{}) to fit \\\n\n // dispersal ...\", h_before, h_fixed, x, y\n\n // );\n\n }\n\n }\n\n }\n\n }\n\n}\n\n\n","file_path":"rustcoalescence/src/maps.rs","rank":21,"score":205951.83515204056},{"content":"#[allow(clippy::module_name_repetitions)]\n\n#[allow(clippy::inline_always, clippy::inline_fn_without_body)]\n\n#[contract_trait]\n\npub trait EmigrationChoice<H: Habitat>: Backup + core::fmt::Debug {\n\n fn should_lineage_emigrate(\n\n &self,\n\n indexed_location: &IndexedLocation,\n\n time: PositiveF64,\n\n habitat: &H,\n\n ) -> bool;\n\n}\n","file_path":"necsim/impls/no-std/src/cogs/emigration_exit/independent/choice/mod.rs","rank":22,"score":202637.69185298905},{"content":"#[must_use]\n\npub fn sample_interaction_at_location<\n\n H: Habitat,\n\n R: LineageReference<H>,\n\n S: LocallyCoherentLineageStore<H, R>,\n\n>(\n\n location: Location,\n\n habitat: &H,\n\n lineage_store: &S,\n\n coalescence_rng_sample: CoalescenceRngSample,\n\n) -> (IndexedLocation, LineageInteraction) {\n\n let chosen_coalescence_index =\n\n coalescence_rng_sample.sample_coalescence_index(habitat.get_habitat_at_location(&location));\n\n\n\n let indexed_location = IndexedLocation::new(location, chosen_coalescence_index);\n\n\n\n let optional_coalescence = lineage_store\n\n .get_active_global_lineage_reference_at_indexed_location(&indexed_location, habitat)\n\n .cloned();\n\n\n\n (indexed_location, optional_coalescence.into())\n\n}\n","file_path":"necsim/impls/no-std/src/cogs/coalescence_sampler/optional_coalescence.rs","rank":23,"score":201048.72122542438},{"content":"// Fix dispersal by removing dispersal to/from non-habitat\n\n// Fix dispersal by adding self-dispersal when no dispersal exists from habitat\n\nfn fix_dispersal_map(habitat: &Array2D<u32>, dispersal: &mut Array2D<f64>) {\n\n let size = habitat.num_rows() * habitat.num_columns();\n\n\n\n for y in 0..habitat.num_rows() {\n\n for x in 0..habitat.num_columns() {\n\n let row = y * habitat.num_columns() + x;\n\n\n\n if habitat[(y, x)] == 0 {\n\n let mut warn = false;\n\n\n\n // Fix dispersal from non-habitat\n\n for column in 0..size {\n\n let d = &mut dispersal[(row, column)];\n\n\n\n if *d > 0.0_f64 {\n\n warn = true;\n\n\n\n *d = 0.0_f64;\n\n }\n\n }\n","file_path":"rustcoalescence/src/maps.rs","rank":24,"score":193143.34978554246},{"content":"use std::cmp::Ordering;\n\n\n\nuse necsim_core_bond::{NonNegativeF64, PositiveF64};\n\n\n\n#[derive(PartialEq, Copy, Clone)]\n\npub struct EventTime(NonNegativeF64);\n\n\n\nimpl Eq for EventTime {}\n\n\n\nimpl PartialOrd for EventTime {\n\n fn partial_cmp(&self, other: &Self) -> Option<Ordering> {\n\n other.0.partial_cmp(&self.0)\n\n }\n\n}\n\n\n\nimpl Ord for EventTime {\n\n fn cmp(&self, other: &Self) -> Ordering {\n\n other.0.cmp(&self.0)\n\n }\n\n}\n","file_path":"necsim/impls/std/src/cogs/active_lineage_sampler/gillespie/event_time.rs","rank":25,"score":178671.6909816939},{"content":"\n\nimpl From<NonNegativeF64> for EventTime {\n\n fn from(event_time: NonNegativeF64) -> Self {\n\n Self(event_time)\n\n }\n\n}\n\n\n\nimpl From<PositiveF64> for EventTime {\n\n fn from(event_time: PositiveF64) -> Self {\n\n Self(event_time.into())\n\n }\n\n}\n\n\n\nimpl From<EventTime> for NonNegativeF64 {\n\n fn from(event_time: EventTime) -> Self {\n\n event_time.0\n\n }\n\n}\n","file_path":"necsim/impls/std/src/cogs/active_lineage_sampler/gillespie/event_time.rs","rank":26,"score":178668.75142520008},{"content":"#[allow(clippy::inline_always, clippy::inline_fn_without_body)]\n\n#[contract_trait]\n\npub trait SpeciationProbability<H: Habitat>: crate::cogs::Backup + core::fmt::Debug {\n\n #[must_use]\n\n #[debug_requires(habitat.contains(location), \"location is inside habitat\")]\n\n fn get_speciation_probability_at_location(\n\n &self,\n\n location: &Location,\n\n habitat: &H,\n\n ) -> ClosedUnitF64;\n\n}\n","file_path":"necsim/core/src/cogs/speciation_probability.rs","rank":27,"score":176673.36484188537},{"content":"#[allow(clippy::inline_always, clippy::inline_fn_without_body)]\n\n#[contract_trait]\n\npub trait TurnoverRate<H: Habitat>: crate::cogs::Backup + core::fmt::Debug {\n\n #[must_use]\n\n #[debug_requires(habitat.contains(location), \"location is inside habitat\")]\n\n #[debug_ensures(\n\n ret == 0.0_f64 -> habitat.get_habitat_at_location(location) == 0_u32,\n\n \"only returns zero if the location is inhabitable\"\n\n )]\n\n fn get_turnover_rate_at_location(&self, location: &Location, habitat: &H) -> NonNegativeF64;\n\n}\n","file_path":"necsim/core/src/cogs/turnover_rate.rs","rank":28,"score":176673.36484188537},{"content":" #[must_use]\n\n pub fn new(delta_t: PositiveF64) -> Self {\n\n Self { delta_t }\n\n }\n\n}\n\n\n\n#[contract_trait]\n\nimpl<H: Habitat, G: PrimeableRng, T: TurnoverRate<H>> EventTimeSampler<H, G, T>\n\n for PoissonEventTimeSampler\n\n{\n\n #[inline]\n\n fn next_event_time_at_indexed_location_weakly_after(\n\n &self,\n\n indexed_location: &IndexedLocation,\n\n time: NonNegativeF64,\n\n habitat: &H,\n\n rng: &mut G,\n\n turnover_rate: &T,\n\n ) -> NonNegativeF64 {\n\n let lambda =\n","file_path":"necsim/impls/no-std/src/cogs/active_lineage_sampler/independent/event_time_sampler/poisson.rs","rank":29,"score":171992.6787628965},{"content":" #[must_use]\n\n pub fn new(delta_t: PositiveF64) -> Self {\n\n Self { delta_t }\n\n }\n\n}\n\n\n\n#[contract_trait]\n\nimpl<H: Habitat, G: PrimeableRng, T: TurnoverRate<H>> EventTimeSampler<H, G, T>\n\n for ExpEventTimeSampler\n\n{\n\n #[inline]\n\n fn next_event_time_at_indexed_location_weakly_after(\n\n &self,\n\n indexed_location: &IndexedLocation,\n\n time: NonNegativeF64,\n\n habitat: &H,\n\n rng: &mut G,\n\n turnover_rate: &T,\n\n ) -> NonNegativeF64 {\n\n // Safety: The turnover rate is >= 0.0 and must actually be > 0.0 because\n","file_path":"necsim/impls/no-std/src/cogs/active_lineage_sampler/independent/event_time_sampler/exp.rs","rank":30,"score":171991.92662942852},{"content":"#[contract_trait]\n\nimpl<H: Habitat, G: PrimeableRng, T: TurnoverRate<H>> EventTimeSampler<H, G, T>\n\n for FixedEventTimeSampler\n\n{\n\n #[inline]\n\n fn next_event_time_at_indexed_location_weakly_after(\n\n &self,\n\n indexed_location: &IndexedLocation,\n\n time: NonNegativeF64,\n\n habitat: &H,\n\n rng: &mut G,\n\n turnover_rate: &T,\n\n ) -> NonNegativeF64 {\n\n let lambda =\n\n turnover_rate.get_turnover_rate_at_location(indexed_location.location(), habitat);\n\n\n\n #[allow(clippy::cast_possible_truncation)]\n\n #[allow(clippy::cast_sign_loss)]\n\n let time_step = floor(time.get() * lambda.get()) as u64 + 1;\n\n\n\n rng.prime_with_habitat(habitat, indexed_location, time_step);\n\n\n\n NonNegativeF64::from(time_step) / lambda\n\n }\n\n}\n","file_path":"necsim/impls/no-std/src/cogs/active_lineage_sampler/independent/event_time_sampler/fixed.rs","rank":31,"score":171989.10970439707},{"content":" }\n\n}\n\n\n\n#[contract_trait]\n\nimpl<H: Habitat, G: PrimeableRng, T: TurnoverRate<H>> EventTimeSampler<H, G, T>\n\n for GeometricEventTimeSampler\n\n{\n\n #[inline]\n\n fn next_event_time_at_indexed_location_weakly_after(\n\n &self,\n\n indexed_location: &IndexedLocation,\n\n time: NonNegativeF64,\n\n habitat: &H,\n\n rng: &mut G,\n\n turnover_rate: &T,\n\n ) -> NonNegativeF64 {\n\n let event_probability_per_step = neg_exp(\n\n turnover_rate.get_turnover_rate_at_location(indexed_location.location(), habitat)\n\n * self.delta_t,\n\n )\n","file_path":"necsim/impls/no-std/src/cogs/active_lineage_sampler/independent/event_time_sampler/geometric.rs","rank":32,"score":171988.23643078067},{"content":"use necsim_core::{\n\n cogs::{Habitat, HabitatPrimeableRng, PrimeableRng, TurnoverRate},\n\n intrinsics::floor,\n\n landscape::IndexedLocation,\n\n};\n\nuse necsim_core_bond::NonNegativeF64;\n\n\n\nuse super::EventTimeSampler;\n\n\n\n#[allow(clippy::module_name_repetitions)]\n\n#[derive(Clone, Debug)]\n\n#[cfg_attr(feature = \"cuda\", derive(rust_cuda::common::RustToCuda))]\n\npub struct FixedEventTimeSampler(());\n\n\n\nimpl Default for FixedEventTimeSampler {\n\n fn default() -> Self {\n\n Self(())\n\n }\n\n}\n\n\n","file_path":"necsim/impls/no-std/src/cogs/active_lineage_sampler/independent/event_time_sampler/fixed.rs","rank":33,"score":171980.15769612993},{"content":"use necsim_core::{\n\n cogs::{Habitat, HabitatPrimeableRng, PrimeableRng, RngSampler, TurnoverRate},\n\n intrinsics::{floor, neg_exp},\n\n landscape::IndexedLocation,\n\n};\n\nuse necsim_core_bond::{NonNegativeF64, PositiveF64};\n\n\n\nuse super::EventTimeSampler;\n\n\n\n#[allow(clippy::module_name_repetitions)]\n\n#[derive(Clone, Debug)]\n\n#[cfg_attr(feature = \"cuda\", derive(rust_cuda::common::RustToCuda))]\n\npub struct GeometricEventTimeSampler {\n\n delta_t: PositiveF64,\n\n}\n\n\n\nimpl GeometricEventTimeSampler {\n\n #[must_use]\n\n pub fn new(delta_t: PositiveF64) -> Self {\n\n Self { delta_t }\n","file_path":"necsim/impls/no-std/src/cogs/active_lineage_sampler/independent/event_time_sampler/geometric.rs","rank":34,"score":171978.9829460151},{"content":" turnover_rate.get_turnover_rate_at_location(indexed_location.location(), habitat);\n\n let lambda_per_step = lambda * self.delta_t;\n\n let no_event_probability_per_step = exp(-lambda_per_step.get());\n\n\n\n #[allow(clippy::cast_possible_truncation)]\n\n #[allow(clippy::cast_sign_loss)]\n\n let mut time_step = floor(time.get() / self.delta_t.get()) as u64;\n\n\n\n let (event_time, event_index) = loop {\n\n rng.prime_with_habitat(habitat, indexed_location, time_step);\n\n\n\n let number_events_at_time_steps = if no_event_probability_per_step > 0.0_f64 {\n\n // https://en.wikipedia.org/wiki/Poisson_distribution#cite_ref-Devroye1986_54-0\n\n let mut poisson = 0_u32;\n\n let mut prod = no_event_probability_per_step;\n\n let mut acc = no_event_probability_per_step;\n\n\n\n let u = rng.sample_uniform();\n\n\n\n while u > acc && prod > 0.0_f64 {\n","file_path":"necsim/impls/no-std/src/cogs/active_lineage_sampler/independent/event_time_sampler/poisson.rs","rank":35,"score":171974.5446691191},{"content":" // * `indexed_location` is habitable by this method's precondition\n\n // * Therefore, `turnover_rate` must return a positive value by its\n\n // postcondition\n\n let lambda = unsafe {\n\n PositiveF64::new_unchecked(\n\n turnover_rate\n\n .get_turnover_rate_at_location(indexed_location.location(), habitat)\n\n .get(),\n\n )\n\n };\n\n\n\n #[allow(clippy::cast_possible_truncation, clippy::cast_sign_loss)]\n\n let mut time_step = floor(time.get() / self.delta_t.get()) as u64;\n\n\n\n let mut event_time = NonNegativeF64::from(time_step) * self.delta_t;\n\n let mut time_slice_end = NonNegativeF64::from(time_step + 1) * self.delta_t;\n\n\n\n #[allow(clippy::cast_possible_truncation, clippy::cast_sign_loss)]\n\n rng.prime_with_habitat(habitat, indexed_location, time_step);\n\n\n","file_path":"necsim/impls/no-std/src/cogs/active_lineage_sampler/independent/event_time_sampler/exp.rs","rank":36,"score":171974.5145375488},{"content":"use necsim_core::{\n\n cogs::{Habitat, HabitatPrimeableRng, PrimeableRng, RngSampler, TurnoverRate},\n\n intrinsics::floor,\n\n landscape::IndexedLocation,\n\n};\n\nuse necsim_core_bond::{NonNegativeF64, PositiveF64};\n\n\n\nuse super::EventTimeSampler;\n\n\n\n// 2^64 / PHI\n\nconst INV_PHI: u64 = 0x9e37_79b9_7f4a_7c15_u64;\n\n\n\n#[allow(clippy::module_name_repetitions)]\n\n#[derive(Clone, Debug)]\n\n#[cfg_attr(feature = \"cuda\", derive(rust_cuda::common::RustToCuda))]\n\npub struct ExpEventTimeSampler {\n\n delta_t: PositiveF64,\n\n}\n\n\n\nimpl ExpEventTimeSampler {\n","file_path":"necsim/impls/no-std/src/cogs/active_lineage_sampler/independent/event_time_sampler/exp.rs","rank":37,"score":171974.15511652103},{"content":"use necsim_core::{\n\n cogs::{Habitat, HabitatPrimeableRng, PrimeableRng, RngSampler, TurnoverRate},\n\n intrinsics::{exp, floor, safe_sqrt},\n\n landscape::IndexedLocation,\n\n};\n\nuse necsim_core_bond::{NonNegativeF64, PositiveF64};\n\n\n\nuse super::EventTimeSampler;\n\n\n\n// 2^64 / PHI\n\nconst INV_PHI: u64 = 0x9e37_79b9_7f4a_7c15_u64;\n\n\n\n#[allow(clippy::module_name_repetitions)]\n\n#[derive(Clone, Debug)]\n\n#[cfg_attr(feature = \"cuda\", derive(rust_cuda::common::RustToCuda))]\n\npub struct PoissonEventTimeSampler {\n\n delta_t: PositiveF64,\n\n}\n\n\n\nimpl PoissonEventTimeSampler {\n","file_path":"necsim/impls/no-std/src/cogs/active_lineage_sampler/independent/event_time_sampler/poisson.rs","rank":38,"score":171973.78607937047},{"content":" .one_minus();\n\n\n\n #[allow(clippy::cast_possible_truncation)]\n\n #[allow(clippy::cast_sign_loss)]\n\n let mut time_step = floor(time.get() / self.delta_t.get()) as u64 + 1;\n\n\n\n loop {\n\n rng.prime_with_habitat(habitat, indexed_location, time_step);\n\n\n\n if rng.sample_event(event_probability_per_step) {\n\n break;\n\n }\n\n\n\n time_step += 1;\n\n }\n\n\n\n NonNegativeF64::from(time_step) * self.delta_t\n\n }\n\n}\n","file_path":"necsim/impls/no-std/src/cogs/active_lineage_sampler/independent/event_time_sampler/geometric.rs","rank":39,"score":171973.1069980605},{"content":" let mut sub_index: u64 = 0;\n\n\n\n loop {\n\n event_time += rng.sample_exponential(lambda);\n\n\n\n sub_index = sub_index.wrapping_add(INV_PHI);\n\n\n\n // The time slice is exclusive at time_slice_end\n\n if event_time >= time_slice_end {\n\n time_step += 1;\n\n sub_index = 0;\n\n\n\n event_time = time_slice_end;\n\n time_slice_end = NonNegativeF64::from(time_step + 1) * self.delta_t;\n\n\n\n rng.prime_with_habitat(habitat, indexed_location, time_step);\n\n } else if event_time > time {\n\n break;\n\n }\n\n }\n\n\n\n rng.prime_with_habitat(habitat, indexed_location, time_step.wrapping_add(sub_index));\n\n\n\n event_time\n\n }\n\n}\n","file_path":"necsim/impls/no-std/src/cogs/active_lineage_sampler/independent/event_time_sampler/exp.rs","rank":40,"score":171968.98219797882},{"content":"use necsim_core::{\n\n cogs::{Habitat, PrimeableRng, TurnoverRate},\n\n landscape::IndexedLocation,\n\n};\n\nuse necsim_core_bond::NonNegativeF64;\n\n\n\npub mod exp;\n\npub mod fixed;\n\npub mod geometric;\n\npub mod poisson;\n\n\n\n#[allow(clippy::module_name_repetitions)]\n\n#[allow(clippy::inline_always, clippy::inline_fn_without_body)]\n\n#[contract_trait]\n","file_path":"necsim/impls/no-std/src/cogs/active_lineage_sampler/independent/event_time_sampler/mod.rs","rank":41,"score":171968.24069019523},{"content":"\n\n rng.prime_with_habitat(\n\n habitat,\n\n indexed_location,\n\n time_step + INV_PHI.wrapping_mul(u64::from(event_index + 1)),\n\n );\n\n\n\n event_time\n\n }\n\n}\n","file_path":"necsim/impls/no-std/src/cogs/active_lineage_sampler/independent/event_time_sampler/poisson.rs","rank":42,"score":171964.65191694637},{"content":" poisson += 1;\n\n prod *= lambda_per_step.get() / f64::from(poisson);\n\n acc += prod;\n\n }\n\n\n\n poisson\n\n } else {\n\n // Fallback in case no_event_probability_per_step underflows\n\n #[allow(clippy::cast_possible_truncation, clippy::cast_sign_loss)]\n\n let normal_as_poisson = rng\n\n .sample_2d_normal(lambda_per_step.get(), safe_sqrt(lambda_per_step))\n\n .0\n\n .max(0.0_f64) as u32;\n\n\n\n normal_as_poisson\n\n };\n\n\n\n let mut next_event = None;\n\n\n\n for event_index in 0..number_events_at_time_steps {\n","file_path":"necsim/impls/no-std/src/cogs/active_lineage_sampler/independent/event_time_sampler/poisson.rs","rank":43,"score":171958.86762339668},{"content":" #[allow(clippy::cast_precision_loss)]\n\n let event_time =\n\n (NonNegativeF64::from(time_step) + rng.sample_uniform()) * self.delta_t;\n\n\n\n if event_time > time {\n\n next_event = match next_event {\n\n Some((later_event_time, _)) if later_event_time > event_time => {\n\n Some((event_time, event_index))\n\n },\n\n Some(next_event) => Some(next_event),\n\n None => Some((event_time, event_index)),\n\n };\n\n }\n\n }\n\n\n\n match next_event {\n\n Some(next_event) => break next_event,\n\n None => time_step += 1,\n\n }\n\n };\n","file_path":"necsim/impls/no-std/src/cogs/active_lineage_sampler/independent/event_time_sampler/poisson.rs","rank":44,"score":171953.0116464282},{"content":"#[allow(clippy::inline_always, clippy::inline_fn_without_body)]\n\n#[contract_trait]\n\npub trait Decomposition<H: Habitat>: Backup + Sized + core::fmt::Debug {\n\n #[debug_ensures(\n\n ret < self.get_number_of_subdomains().get(),\n\n \"subdomain rank is in range [0, self.get_number_of_subdomains())\"\n\n )]\n\n fn get_subdomain_rank(&self) -> u32;\n\n\n\n fn get_number_of_subdomains(&self) -> NonZeroU32;\n\n\n\n #[debug_requires(\n\n habitat.contains(location),\n\n \"location is contained inside habitat\"\n\n )]\n\n #[debug_ensures(\n\n ret < self.get_number_of_subdomains().get(),\n\n \"subdomain rank is in range [0, self.get_number_of_subdomains())\"\n\n )]\n\n fn map_location_to_subdomain_rank(&self, location: &Location, habitat: &H) -> u32;\n\n}\n","file_path":"necsim/impls/no-std/src/decomposition/mod.rs","rank":45,"score":170211.02006680713},{"content":"#[allow(clippy::type_complexity)]\n\npub fn simulate<\n\n H: Habitat,\n\n G: RngCore,\n\n R: LineageReference<H>,\n\n S: LocallyCoherentLineageStore<H, R>,\n\n D: DispersalSampler<H, G>,\n\n C: CoalescenceSampler<H, R, S>,\n\n T: TurnoverRate<H>,\n\n N: SpeciationProbability<H>,\n\n O: Decomposition<H>,\n\n E: EventSampler<H, G, R, S, DomainEmigrationExit<H, O>, D, C, T, N>,\n\n A: PeekableActiveLineageSampler<\n\n H,\n\n G,\n\n R,\n\n S,\n\n DomainEmigrationExit<H, O>,\n\n D,\n\n C,\n\n T,\n","file_path":"necsim/impls/no-std/src/parallelisation/monolithic/lockstep.rs","rank":46,"score":168656.1177188762},{"content":"#[allow(clippy::type_complexity)]\n\npub fn simulate<\n\n H: Habitat,\n\n G: RngCore,\n\n R: LineageReference<H>,\n\n S: LocallyCoherentLineageStore<H, R>,\n\n D: DispersalSampler<H, G>,\n\n C: CoalescenceSampler<H, R, S>,\n\n T: TurnoverRate<H>,\n\n N: SpeciationProbability<H>,\n\n O: Decomposition<H>,\n\n E: EventSampler<H, G, R, S, DomainEmigrationExit<H, O>, D, C, T, N>,\n\n A: PeekableActiveLineageSampler<\n\n H,\n\n G,\n\n R,\n\n S,\n\n DomainEmigrationExit<H, O>,\n\n D,\n\n C,\n\n T,\n","file_path":"necsim/impls/no-std/src/parallelisation/monolithic/averaging.rs","rank":47,"score":168656.1177188762},{"content":"#[allow(clippy::type_complexity)]\n\npub fn simulate<\n\n H: Habitat,\n\n G: RngCore,\n\n R: LineageReference<H>,\n\n S: LocallyCoherentLineageStore<H, R>,\n\n D: DispersalSampler<H, G>,\n\n C: CoalescenceSampler<H, R, S>,\n\n T: TurnoverRate<H>,\n\n N: SpeciationProbability<H>,\n\n O: Decomposition<H>,\n\n E: EventSampler<H, G, R, S, DomainEmigrationExit<H, O>, D, C, T, N>,\n\n A: PeekableActiveLineageSampler<\n\n H,\n\n G,\n\n R,\n\n S,\n\n DomainEmigrationExit<H, O>,\n\n D,\n\n C,\n\n T,\n","file_path":"necsim/impls/no-std/src/parallelisation/monolithic/optimistic.rs","rank":48,"score":168656.1177188762},{"content":"#[allow(clippy::type_complexity)]\n\npub fn simulate<\n\n H: Habitat,\n\n C: Decomposition<H>,\n\n E: EmigrationChoice<H>,\n\n G: PrimeableRng,\n\n D: DispersalSampler<H, G>,\n\n T: TurnoverRate<H>,\n\n N: SpeciationProbability<H>,\n\n J: EventTimeSampler<H, G, T>,\n\n R: Reporter,\n\n P: LocalPartition<R>,\n\n>(\n\n mut simulation: Simulation<\n\n H,\n\n G,\n\n GlobalLineageReference,\n\n IndependentLineageStore<H>,\n\n IndependentEmigrationExit<H, C, E>,\n\n D,\n\n IndependentCoalescenceSampler<H>,\n","file_path":"necsim/impls/no-std/src/parallelisation/independent/landscape.rs","rank":49,"score":168656.1177188762},{"content":"#[allow(clippy::type_complexity)]\n\npub fn simulate<\n\n H: Habitat,\n\n G: RngCore,\n\n R: LineageReference<H>,\n\n S: LocallyCoherentLineageStore<H, R>,\n\n D: DispersalSampler<H, G>,\n\n C: CoalescenceSampler<H, R, S>,\n\n T: TurnoverRate<H>,\n\n N: SpeciationProbability<H>,\n\n E: EventSampler<H, G, R, S, NeverEmigrationExit, D, C, T, N>,\n\n A: ActiveLineageSampler<H, G, R, S, NeverEmigrationExit, D, C, T, N, E, NeverImmigrationEntry>,\n\n P: Reporter,\n\n L: LocalPartition<P>,\n\n>(\n\n simulation: Simulation<\n\n H,\n\n G,\n\n R,\n\n S,\n\n NeverEmigrationExit,\n","file_path":"necsim/impls/no-std/src/parallelisation/monolithic/monolithic.rs","rank":50,"score":168656.1177188762},{"content":"#[allow(clippy::type_complexity)]\n\npub fn simulate<\n\n H: Habitat,\n\n G: PrimeableRng,\n\n D: DispersalSampler<H, G>,\n\n T: TurnoverRate<H>,\n\n N: SpeciationProbability<H>,\n\n J: EventTimeSampler<H, G, T>,\n\n R: Reporter,\n\n P: LocalPartition<R>,\n\n>(\n\n mut simulation: Simulation<\n\n H,\n\n G,\n\n GlobalLineageReference,\n\n IndependentLineageStore<H>,\n\n NeverEmigrationExit,\n\n D,\n\n IndependentCoalescenceSampler<H>,\n\n T,\n\n N,\n","file_path":"necsim/impls/no-std/src/parallelisation/independent/individuals.rs","rank":51,"score":168656.1177188762},{"content":"#[allow(clippy::type_complexity)]\n\npub fn simulate<\n\n H: Habitat,\n\n G: RngCore,\n\n R: LineageReference<H>,\n\n S: LocallyCoherentLineageStore<H, R>,\n\n D: DispersalSampler<H, G>,\n\n C: CoalescenceSampler<H, R, S>,\n\n T: TurnoverRate<H>,\n\n N: SpeciationProbability<H>,\n\n O: Decomposition<H>,\n\n E: EventSampler<H, G, R, S, DomainEmigrationExit<H, O>, D, C, T, N>,\n\n A: PeekableActiveLineageSampler<\n\n H,\n\n G,\n\n R,\n\n S,\n\n DomainEmigrationExit<H, O>,\n\n D,\n\n C,\n\n T,\n","file_path":"necsim/impls/no-std/src/parallelisation/monolithic/optimistic_lockstep.rs","rank":52,"score":165887.07077579093},{"content":"#[allow(clippy::type_complexity, clippy::too_many_lines)]\n\npub fn simulate<\n\n H: Habitat,\n\n G: PrimeableRng,\n\n D: DispersalSampler<H, G>,\n\n T: TurnoverRate<H>,\n\n N: SpeciationProbability<H>,\n\n J: EventTimeSampler<H, G, T>,\n\n R: Reporter,\n\n P: LocalPartition<R>,\n\n>(\n\n mut simulation: Simulation<\n\n H,\n\n G,\n\n GlobalLineageReference,\n\n IndependentLineageStore<H>,\n\n NeverEmigrationExit,\n\n D,\n\n IndependentCoalescenceSampler<H>,\n\n T,\n\n N,\n","file_path":"necsim/impls/no-std/src/parallelisation/independent/monolithic/mod.rs","rank":53,"score":165887.07077579093},{"content":"#[test]\n\nfn test_get_mut() -> Result<(), Error> {\n\n let rows = vec![vec![1, 2, 3], vec![4, 5, 6]];\n\n let mut array = Array2D::from_rows(&rows)?;\n\n let (set_row, set_column) = (0, 2);\n\n let element = 53;\n\n let element_ref_option = array.get_mut(set_row, set_column);\n\n assert!(element_ref_option.is_some());\n\n let element_ref = element_ref_option.unwrap();\n\n assert_eq!(element_ref, &rows[set_row][set_column]);\n\n *element_ref = element;\n\n assert_eq!(element_ref, &element);\n\n for row in 0..rows.len() {\n\n for column in 0..rows[0].len() {\n\n let actual = array.get(row, column);\n\n if (row, column) == (set_row, set_column) {\n\n assert_eq!(actual, Some(&element));\n\n } else {\n\n assert_eq!(actual, Some(&rows[row][column]));\n\n }\n\n }\n\n }\n\n Ok(())\n\n}\n\n\n","file_path":"third-party/array2d-no-std/tests/array2d.rs","rank":54,"score":162551.27292061478},{"content":"#[test]\n\nfn test_get_mut_column_major() -> Result<(), Error> {\n\n let rows = vec![vec![1, 2, 3], vec![4, 5, 6]];\n\n let mut array = Array2D::from_rows(&rows)?;\n\n assert_eq!(array.get_mut_column_major(0), Some(&mut 1));\n\n assert_eq!(array.get_mut_column_major(1), Some(&mut 4));\n\n assert_eq!(array.get_mut_column_major(2), Some(&mut 2));\n\n assert_eq!(array.get_mut_column_major(3), Some(&mut 5));\n\n assert_eq!(array.get_mut_column_major(4), Some(&mut 3));\n\n assert_eq!(array.get_mut_column_major(5), Some(&mut 6));\n\n assert_eq!(array.get_mut_column_major(6), None);\n\n Ok(())\n\n}\n\n\n","file_path":"third-party/array2d-no-std/tests/array2d.rs","rank":55,"score":157469.97816723847},{"content":"#[test]\n\nfn test_get_mut_row_major() -> Result<(), Error> {\n\n let rows = vec![vec![1, 2, 3], vec![4, 5, 6]];\n\n let mut array = Array2D::from_rows(&rows)?;\n\n assert_eq!(array.get_mut_row_major(0), Some(&mut 1));\n\n assert_eq!(array.get_mut_row_major(1), Some(&mut 2));\n\n assert_eq!(array.get_mut_row_major(2), Some(&mut 3));\n\n assert_eq!(array.get_mut_row_major(3), Some(&mut 4));\n\n assert_eq!(array.get_mut_row_major(4), Some(&mut 5));\n\n assert_eq!(array.get_mut_row_major(5), Some(&mut 6));\n\n assert_eq!(array.get_mut_row_major(6), None);\n\n Ok(())\n\n}\n\n\n","file_path":"third-party/array2d-no-std/tests/array2d.rs","rank":56,"score":157469.97816723847},{"content":"\n\nimpl<R: RngCore> RngCore for CudaRng<R> {\n\n type Seed = <R as RngCore>::Seed;\n\n\n\n #[must_use]\n\n #[inline]\n\n fn from_seed(seed: Self::Seed) -> Self {\n\n Self(R::from_seed(seed))\n\n }\n\n\n\n #[must_use]\n\n #[inline]\n\n fn sample_u64(&mut self) -> u64 {\n\n self.0.sample_u64()\n\n }\n\n}\n\n\n\nimpl<R: PrimeableRng> PrimeableRng for CudaRng<R> {\n\n #[inline]\n\n fn prime_with(&mut self, location_index: u64, time_index: u64) {\n\n self.0.prime_with(location_index, time_index);\n\n }\n\n}\n","file_path":"necsim/impls/cuda/src/cogs/rng.rs","rank":57,"score":148057.40441539654},{"content":"use necsim_core::cogs::{Backup, PrimeableRng, RngCore};\n\n\n\n#[allow(clippy::module_name_repetitions)]\n\n#[derive(Clone, Debug, rust_cuda::common::RustToCuda, rust_cuda::host::LendToCuda)]\n\npub struct CudaRng<R: RngCore>(R);\n\n\n\nimpl<R: RngCore> From<R> for CudaRng<R> {\n\n #[must_use]\n\n #[inline]\n\n fn from(rng: R) -> Self {\n\n Self(rng)\n\n }\n\n}\n\n\n\n#[contract_trait]\n\nimpl<R: RngCore> Backup for CudaRng<R> {\n\n unsafe fn backup_unchecked(&self) -> Self {\n\n self.clone()\n\n }\n\n}\n","file_path":"necsim/impls/cuda/src/cogs/rng.rs","rank":58,"score":148045.911438923},{"content":"pub fn swap_field_type_and_get_cuda_repr_ty(field: &mut syn::Field) -> Option<CudaReprFieldTy> {\n\n let mut cuda_repr_field_ty: Option<CudaReprFieldTy> = None;\n\n let mut field_ty = field.ty.clone();\n\n\n\n // Helper attribute `r2c` must be filtered out inside cuda representation\n\n field.attrs.retain(|attr| match attr.path.get_ident() {\n\n Some(ident) if cuda_repr_field_ty.is_none() && format!(\"{}\", ident) == \"r2cEmbed\" => {\n\n // Allow the shorthand `#[r2cEmbed]` which uses the field type\n\n // as well as the explicit `#[r2cEmbed(ty)]` which overwrites the type\n\n let attribute_str = if attr.tokens.is_empty() {\n\n format!(\"({})\", quote! { #field_ty })\n\n } else {\n\n format!(\"{}\", attr.tokens)\n\n };\n\n\n\n if let Some(slice_type) = attribute_str\n\n .strip_prefix(\"(Box < [\")\n\n .and_then(|rest| rest.strip_suffix(\"] >)\"))\n\n {\n\n // Check for the special case of a boxed slice: `Box<ty>`\n","file_path":"rust-cuda/rust-cuda-derive/src/rust_to_cuda/field_ty.rs","rank":59,"score":146884.56420488542},{"content":" + u64::from(indexed_location.index())\n\n }\n\n}\n\n\n\nimpl InMemoryHabitat {\n\n #[must_use]\n\n #[debug_ensures(\n\n old(habitat.num_columns()) == ret.get_extent().width() as usize &&\n\n old(habitat.num_rows()) == ret.get_extent().height() as usize,\n\n \"habitat extent has the dimension of the habitat array\"\n\n )]\n\n pub fn new(habitat: Array2D<u32>) -> Self {\n\n #[allow(clippy::cast_possible_truncation)]\n\n let width: u32 = habitat.num_columns() as u32;\n\n #[allow(clippy::cast_possible_truncation)]\n\n let height: u32 = habitat.num_rows() as u32;\n\n\n\n let habitat = habitat.into_row_major().into_boxed_slice();\n\n\n\n let mut index_acc = 0_u64;\n","file_path":"necsim/impls/no-std/src/cogs/habitat/in_memory.rs","rank":60,"score":144932.2197225219},{"content":" self.habitat.iter().map(|x| u64::from(*x)).sum()\n\n }\n\n\n\n #[must_use]\n\n fn get_habitat_at_location(&self, location: &Location) -> u32 {\n\n self.habitat\n\n .get((location.y() as usize) * (self.extent.width() as usize) + (location.x() as usize))\n\n .copied()\n\n .unwrap_or(0)\n\n }\n\n\n\n #[must_use]\n\n fn map_indexed_location_to_u64_injective(&self, indexed_location: &IndexedLocation) -> u64 {\n\n self.u64_injection\n\n .get(\n\n (indexed_location.location().y() as usize) * (self.extent.width() as usize)\n\n + (indexed_location.location().x() as usize),\n\n )\n\n .copied()\n\n .unwrap_or(0)\n","file_path":"necsim/impls/no-std/src/cogs/habitat/in_memory.rs","rank":61,"score":144928.87886186413},{"content":"#[contract_trait]\n\nimpl Backup for InMemoryHabitat {\n\n unsafe fn backup_unchecked(&self) -> Self {\n\n Self {\n\n habitat: self.habitat.clone(),\n\n u64_injection: self.u64_injection.clone(),\n\n extent: self.extent.clone(),\n\n }\n\n }\n\n}\n\n\n\n#[contract_trait]\n\nimpl Habitat for InMemoryHabitat {\n\n #[must_use]\n\n fn get_extent(&self) -> &LandscapeExtent {\n\n &self.extent\n\n }\n\n\n\n #[must_use]\n\n fn get_total_habitat(&self) -> u64 {\n","file_path":"necsim/impls/no-std/src/cogs/habitat/in_memory.rs","rank":62,"score":144926.66516167158},{"content":"use array2d::Array2D;\n\n\n\nuse alloc::{boxed::Box, vec::Vec};\n\n\n\nuse necsim_core::{\n\n cogs::{Backup, Habitat},\n\n landscape::{IndexedLocation, LandscapeExtent, Location},\n\n};\n\n\n\n#[allow(clippy::module_name_repetitions)]\n\n#[cfg_attr(feature = \"cuda\", derive(rust_cuda::common::RustToCuda))]\n\n#[derive(Debug)]\n\npub struct InMemoryHabitat {\n\n #[cfg_attr(feature = \"cuda\", r2cEmbed)]\n\n habitat: Box<[u32]>,\n\n #[cfg_attr(feature = \"cuda\", r2cEmbed)]\n\n u64_injection: Box<[u64]>,\n\n extent: LandscapeExtent,\n\n}\n\n\n","file_path":"necsim/impls/no-std/src/cogs/habitat/in_memory.rs","rank":63,"score":144918.19985295972},{"content":"use std::fmt;\n\n\n\nuse pcg_rand::{seeds::PcgSeeder, Pcg64};\n\nuse rand::{RngCore as _, SeedableRng};\n\n\n\nuse necsim_core::cogs::{Backup, RngCore, SplittableRng};\n\n\n\n#[allow(clippy::module_name_repetitions)]\n\npub struct Pcg(Pcg64);\n\n\n\nimpl Clone for Pcg {\n\n fn clone(&self) -> Self {\n\n Self(Pcg64::restore_state_with_no_verification(\n\n self.0.get_state(),\n\n ))\n\n }\n\n}\n\n\n\nimpl fmt::Debug for Pcg {\n\n fn fmt(&self, fmt: &mut fmt::Formatter) -> fmt::Result {\n","file_path":"necsim/impls/std/src/cogs/rng/pcg.rs","rank":64,"score":144916.0468425837},{"content":" #[inline]\n\n fn from_seed(seed: Self::Seed) -> Self {\n\n let seed = u64::from_le_bytes(seed);\n\n\n\n Self { seed, state: seed }\n\n }\n\n\n\n #[must_use]\n\n #[inline]\n\n fn sample_u64(&mut self) -> u64 {\n\n self.state = xxhash_rust::xxh64::xxh64(&self.state.to_le_bytes(), self.seed);\n\n self.state\n\n }\n\n}\n\n\n\nimpl PrimeableRng for XxHash {\n\n fn prime_with(&mut self, location_index: u64, time_index: u64) {\n\n let location_bytes = location_index.to_le_bytes();\n\n\n\n let time_index_bytes = time_index.to_le_bytes();\n","file_path":"necsim/impls/no-std/src/cogs/rng/xxhash.rs","rank":65,"score":144915.57421472372},{"content":"use rand::{rngs::StdRng as StdRngImpl, RngCore, SeedableRng};\n\n\n\n#[allow(clippy::module_name_repetitions)]\n\n#[derive(Clone, Debug)]\n\npub struct StdRng(StdRngImpl);\n\n\n\n#[contract_trait]\n\nimpl necsim_core::cogs::Backup for StdRng {\n\n unsafe fn backup_unchecked(&self) -> Self {\n\n self.clone()\n\n }\n\n}\n\n\n\nimpl necsim_core::cogs::RngCore for StdRng {\n\n type Seed = <StdRngImpl as SeedableRng>::Seed;\n\n\n\n #[must_use]\n\n #[inline]\n\n fn from_seed(seed: Self::Seed) -> Self {\n\n Self(StdRngImpl::from_seed(seed))\n\n }\n\n\n\n #[must_use]\n\n #[inline]\n\n fn sample_u64(&mut self) -> u64 {\n\n self.0.next_u64()\n\n }\n\n}\n","file_path":"necsim/impls/std/src/cogs/rng/std.rs","rank":66,"score":144914.44770878018},{"content":"use necsim_core::cogs::{Backup, PrimeableRng, RngCore};\n\n\n\n#[allow(clippy::module_name_repetitions)]\n\n#[derive(Clone, Debug)]\n\npub struct SeaHash {\n\n seed: u64,\n\n location: u64,\n\n time: u64,\n\n offset: u64,\n\n}\n\n\n\n#[contract_trait]\n\nimpl Backup for SeaHash {\n\n unsafe fn backup_unchecked(&self) -> Self {\n\n self.clone()\n\n }\n\n}\n\n\n\nimpl RngCore for SeaHash {\n\n type Seed = [u8; 8];\n","file_path":"necsim/impls/no-std/src/cogs/rng/seahash.rs","rank":67,"score":144914.06964981044},{"content":"use necsim_core::cogs::{Backup, PrimeableRng, RngCore};\n\n\n\n#[allow(clippy::module_name_repetitions)]\n\n#[derive(Clone, Debug)]\n\npub struct FixedSeaHash {\n\n seed: u64,\n\n location_index: u64,\n\n time_index: u64,\n\n state: u64,\n\n}\n\n\n\n#[contract_trait]\n\nimpl Backup for FixedSeaHash {\n\n unsafe fn backup_unchecked(&self) -> Self {\n\n self.clone()\n\n }\n\n}\n\n\n\nimpl RngCore for FixedSeaHash {\n\n type Seed = [u8; 8];\n","file_path":"necsim/impls/no-std/src/cogs/rng/fixedseahash.rs","rank":68,"score":144913.21340597654},{"content":" self.state\n\n }\n\n}\n\n\n\nimpl PrimeableRng for FixedSeaHash {\n\n #[inline]\n\n fn prime_with(&mut self, location_index: u64, time_index: u64) {\n\n self.location_index = location_index;\n\n self.time_index = time_index;\n\n\n\n self.state = 0_u64;\n\n }\n\n}\n\n\n\n// https://docs.rs/seahash/4.0.1/src/seahash/helper.rs.html#72-89\n\n#[inline]\n\nconst fn diffuse(mut x: u64) -> u64 {\n\n // These are derived from the PCG RNG's round. Thanks to @Veedrac for proposing\n\n // this. The basic idea is that we use dynamic shifts, which are determined\n\n // by the input itself. The shift is chosen by the higher bits, which means\n","file_path":"necsim/impls/no-std/src/cogs/rng/fixedseahash.rs","rank":69,"score":144910.9935320072},{"content":" )))\n\n }\n\n\n\n #[must_use]\n\n #[inline]\n\n fn sample_u64(&mut self) -> u64 {\n\n self.0.next_u64()\n\n }\n\n}\n\n\n\nimpl SplittableRng for Pcg {\n\n #[allow(clippy::identity_op)]\n\n fn split(self) -> (Self, Self) {\n\n let mut left_state = self.0.get_state();\n\n left_state.increment = (((left_state.increment >> 1) * 2 + 0) << 1) | 1;\n\n\n\n let mut right_state = self.0.get_state();\n\n right_state.increment = (((right_state.increment >> 1) * 2 + 1) << 1) | 1;\n\n\n\n let left = Self(Pcg64::restore_state_with_no_verification(left_state));\n","file_path":"necsim/impls/std/src/cogs/rng/pcg.rs","rank":70,"score":144910.69702167273},{"content":" }\n\n}\n\n\n\nimpl PrimeableRng for SeaHash {\n\n fn prime_with(&mut self, location_index: u64, time_index: u64) {\n\n self.location = location_index;\n\n self.time = time_index;\n\n\n\n self.offset = 0_u64;\n\n }\n\n}\n","file_path":"necsim/impls/no-std/src/cogs/rng/seahash.rs","rank":71,"score":144909.54171316922},{"content":"\n\n #[must_use]\n\n #[inline]\n\n fn from_seed(seed: Self::Seed) -> Self {\n\n let seed = u64::from_le_bytes(seed);\n\n\n\n Self {\n\n seed,\n\n location_index: 0_u64,\n\n time_index: 0_u64,\n\n state: seed,\n\n }\n\n }\n\n\n\n #[must_use]\n\n #[inline]\n\n fn sample_u64(&mut self) -> u64 {\n\n self.state =\n\n diffuse(diffuse(self.state ^ self.location_index) ^ self.time_index) ^ self.seed;\n\n\n","file_path":"necsim/impls/no-std/src/cogs/rng/fixedseahash.rs","rank":72,"score":144908.64717733455},{"content":"\n\n let u64_injection = habitat\n\n .iter()\n\n .map(|h| {\n\n let injection = index_acc;\n\n index_acc += u64::from(*h);\n\n injection\n\n })\n\n .collect::<Vec<u64>>()\n\n .into_boxed_slice();\n\n\n\n #[allow(clippy::cast_possible_truncation)]\n\n let extent = LandscapeExtent::new(0, 0, width, height);\n\n\n\n Self {\n\n habitat,\n\n u64_injection,\n\n extent,\n\n }\n\n }\n\n}\n","file_path":"necsim/impls/no-std/src/cogs/habitat/in_memory.rs","rank":73,"score":144908.3475087032},{"content":"\n\n #[must_use]\n\n #[inline]\n\n fn from_seed(seed: Self::Seed) -> Self {\n\n let seed = u64::from_le_bytes(seed);\n\n\n\n Self {\n\n seed,\n\n location: 0_u64,\n\n time: 0_u64,\n\n offset: 0_u64,\n\n }\n\n }\n\n\n\n #[must_use]\n\n #[inline]\n\n fn sample_u64(&mut self) -> u64 {\n\n let offset_bytes = self.offset.to_le_bytes();\n\n self.offset += 1;\n\n seahash::hash_seeded(&offset_bytes, self.time, self.location, self.seed, 0_u64)\n","file_path":"necsim/impls/no-std/src/cogs/rng/seahash.rs","rank":74,"score":144908.181119127},{"content":"use nanorand::{Rng, WyRand as WyImpl};\n\n\n\nuse necsim_core::cogs::{Backup, RngCore};\n\n\n\n#[allow(clippy::module_name_repetitions)]\n\n#[derive(Clone)]\n\npub struct WyRand(WyImpl);\n\n\n\n#[contract_trait]\n\nimpl Backup for WyRand {\n\n unsafe fn backup_unchecked(&self) -> Self {\n\n self.clone()\n\n }\n\n}\n\n\n\nimpl RngCore for WyRand {\n\n type Seed = [u8; 8];\n\n\n\n #[must_use]\n\n #[inline]\n","file_path":"necsim/impls/no-std/src/cogs/rng/wyrand.rs","rank":75,"score":144908.19223324783},{"content":"}\n\n\n\nimpl RngCore for AesRng {\n\n type Seed = [u8; 16];\n\n\n\n #[must_use]\n\n #[inline]\n\n fn from_seed(seed: Self::Seed) -> Self {\n\n Self {\n\n cipher: Aes128::new(GenericArray::from_slice(&seed)),\n\n state: [0_u8; 16],\n\n cached: false,\n\n }\n\n }\n\n\n\n #[must_use]\n\n #[inline]\n\n fn sample_u64(&mut self) -> u64 {\n\n self.cached ^= true;\n\n\n","file_path":"necsim/impls/no-std/src/cogs/rng/aes.rs","rank":76,"score":144907.71244161902},{"content":" self.state[10],\n\n self.state[11],\n\n self.state[12],\n\n self.state[13],\n\n self.state[14],\n\n self.state[15],\n\n ]);\n\n\n\n self.state[9] = self.state[9].wrapping_add(1);\n\n\n\n rand_u64\n\n }\n\n }\n\n}\n\n\n\nimpl PrimeableRng for AesRng {\n\n fn prime_with(&mut self, location_index: u64, time_index: u64) {\n\n let location_bytes = location_index.to_le_bytes();\n\n\n\n self.state[0] = location_bytes[0];\n","file_path":"necsim/impls/no-std/src/cogs/rng/aes.rs","rank":77,"score":144907.43390587904},{"content":"use necsim_core::cogs::{Backup, PrimeableRng, RngCore};\n\n\n\n#[allow(clippy::module_name_repetitions)]\n\n#[derive(Clone, Debug)]\n\npub struct XxHash {\n\n seed: u64,\n\n state: u64,\n\n}\n\n\n\n#[contract_trait]\n\nimpl Backup for XxHash {\n\n unsafe fn backup_unchecked(&self) -> Self {\n\n self.clone()\n\n }\n\n}\n\n\n\nimpl RngCore for XxHash {\n\n type Seed = [u8; 8];\n\n\n\n #[must_use]\n","file_path":"necsim/impls/no-std/src/cogs/rng/xxhash.rs","rank":78,"score":144907.04563364421},{"content":"use necsim_core::cogs::{Backup, PrimeableRng, RngCore};\n\n\n\nuse aes::{\n\n cipher::{generic_array::GenericArray, BlockEncrypt, NewBlockCipher},\n\n Aes128,\n\n};\n\n\n\n#[allow(clippy::module_name_repetitions)]\n\n#[derive(Clone, Debug)]\n\npub struct AesRng {\n\n cipher: Aes128,\n\n state: [u8; 16],\n\n cached: bool,\n\n}\n\n\n\n#[contract_trait]\n\nimpl Backup for AesRng {\n\n unsafe fn backup_unchecked(&self) -> Self {\n\n self.clone()\n\n }\n","file_path":"necsim/impls/no-std/src/cogs/rng/aes.rs","rank":79,"score":144905.47660866327},{"content":" }\n\n}\n\n\n\nimpl RngCore for WyHash {\n\n type Seed = [u8; 8];\n\n\n\n #[must_use]\n\n #[inline]\n\n fn from_seed(seed: Self::Seed) -> Self {\n\n let seed = u64::from_le_bytes(seed);\n\n\n\n Self { seed, state: seed }\n\n }\n\n\n\n #[must_use]\n\n #[inline]\n\n fn sample_u64(&mut self) -> u64 {\n\n // wyrng state transition function\n\n // https://docs.rs/wyhash/0.5.0/src/wyhash/functions.rs.html#129-132\n\n self.state = self.state.wrapping_add(P0);\n","file_path":"necsim/impls/no-std/src/cogs/rng/wyhash.rs","rank":80,"score":144904.90404775305},{"content":"\n\n // wyrng output function\n\n let wyrng = wymum(self.state ^ P1, self.state);\n\n\n\n // SeaHash diffusion function for better avalanching\n\n seahash_diffuse(wyrng)\n\n }\n\n}\n\n\n\nimpl PrimeableRng for WyHash {\n\n #[inline]\n\n fn prime_with(&mut self, location_index: u64, time_index: u64) {\n\n let location_index = seahash_diffuse(location_index);\n\n let time_index = seahash_diffuse(time_index);\n\n\n\n // wyhash state repriming\n\n // https://docs.rs/wyhash/0.5.0/src/wyhash/functions.rs.html#67-70\n\n let hash = wymum(\n\n ((location_index << 32) | (location_index >> 32)) ^ (self.seed ^ P0),\n\n ((time_index << 32) | (time_index >> 32)) ^ P2,\n\n );\n\n\n\n self.state = wymum(hash, 16 ^ P5);\n\n }\n\n}\n\n\n\n#[inline]\n\n#[allow(clippy::cast_possible_truncation)]\n","file_path":"necsim/impls/no-std/src/cogs/rng/wyhash.rs","rank":81,"score":144904.42844605717},{"content":" fn from_seed(seed: Self::Seed) -> Self {\n\n Self(WyImpl::new_seed(u64::from_le_bytes(seed)))\n\n }\n\n\n\n #[must_use]\n\n #[inline]\n\n fn sample_u64(&mut self) -> u64 {\n\n self.0.generate()\n\n }\n\n}\n\n\n\nimpl core::fmt::Debug for WyRand {\n\n fn fmt(&self, f: &mut core::fmt::Formatter) -> core::fmt::Result {\n\n f.debug_struct(\"WyRand\").finish_non_exhaustive()\n\n }\n\n}\n","file_path":"necsim/impls/no-std/src/cogs/rng/wyrand.rs","rank":82,"score":144902.55701734766},{"content":" fmt.debug_struct(\"Pcg\").finish()\n\n }\n\n}\n\n\n\n#[contract_trait]\n\nimpl Backup for Pcg {\n\n unsafe fn backup_unchecked(&self) -> Self {\n\n self.clone()\n\n }\n\n}\n\n\n\nimpl RngCore for Pcg {\n\n type Seed = [u8; 16];\n\n\n\n #[must_use]\n\n #[inline]\n\n fn from_seed(seed: Self::Seed) -> Self {\n\n Self(Pcg64::from_seed(PcgSeeder::seed_with_stream(\n\n u128::from_le_bytes(seed),\n\n 0_u128,\n","file_path":"necsim/impls/std/src/cogs/rng/pcg.rs","rank":83,"score":144902.0537037954},{"content":"use necsim_core::cogs::{Backup, PrimeableRng, RngCore};\n\n\n\n// WyHash constants\n\n// https://docs.rs/wyhash/0.5.0/src/wyhash/functions.rs.html\n\nconst P0: u64 = 0xa076_1d64_78bd_642f;\n\nconst P1: u64 = 0xe703_7ed1_a0b4_28db;\n\nconst P2: u64 = 0x8ebc_6af0_9c88_c6e3;\n\nconst P5: u64 = 0xeb44_acca_b455_d165;\n\n\n\n#[allow(clippy::module_name_repetitions)]\n\n#[derive(Clone, Debug)]\n\npub struct WyHash {\n\n seed: u64,\n\n state: u64,\n\n}\n\n\n\n#[contract_trait]\n\nimpl Backup for WyHash {\n\n unsafe fn backup_unchecked(&self) -> Self {\n\n self.clone()\n","file_path":"necsim/impls/no-std/src/cogs/rng/wyhash.rs","rank":84,"score":144901.08527354262},{"content":"pub mod almost_infinite;\n\npub mod in_memory;\n\npub mod non_spatial;\n\npub mod spatially_implicit;\n","file_path":"necsim/impls/no-std/src/cogs/habitat/mod.rs","rank":85,"score":144898.11471028894},{"content":" let right = Self(Pcg64::restore_state_with_no_verification(right_state));\n\n\n\n (left, right)\n\n }\n\n\n\n fn split_to_stream(self, stream: u64) -> Self {\n\n let mut state = self.0.get_state();\n\n state.increment = (u128::from(stream) << 1) | 1;\n\n\n\n Self(Pcg64::restore_state_with_no_verification(state))\n\n }\n\n}\n","file_path":"necsim/impls/std/src/cogs/rng/pcg.rs","rank":86,"score":144897.24593075344},{"content":"\n\n self.state = xxhash_rust::xxh64::xxh64(\n\n &[\n\n location_bytes[0],\n\n location_bytes[1],\n\n location_bytes[2],\n\n location_bytes[3],\n\n location_bytes[4],\n\n location_bytes[5],\n\n location_bytes[6],\n\n location_bytes[7],\n\n time_index_bytes[0],\n\n time_index_bytes[1],\n\n time_index_bytes[2],\n\n time_index_bytes[3],\n\n time_index_bytes[4],\n\n time_index_bytes[5],\n\n time_index_bytes[6],\n\n time_index_bytes[7],\n\n ],\n\n self.seed,\n\n );\n\n }\n\n}\n","file_path":"necsim/impls/no-std/src/cogs/rng/xxhash.rs","rank":87,"score":144895.75685773636},{"content":" self.state[1] = location_bytes[1];\n\n self.state[2] = location_bytes[2];\n\n self.state[3] = location_bytes[3];\n\n self.state[4] = location_bytes[4];\n\n self.state[5] = location_bytes[5];\n\n self.state[6] = location_bytes[6];\n\n self.state[7] = location_bytes[7];\n\n\n\n let time_index_bytes = time_index.to_le_bytes();\n\n\n\n self.state[8] = time_index_bytes[0];\n\n self.state[9] = time_index_bytes[1];\n\n self.state[10] = time_index_bytes[2];\n\n self.state[11] = time_index_bytes[3];\n\n self.state[12] = time_index_bytes[4];\n\n self.state[13] = time_index_bytes[5];\n\n self.state[14] = time_index_bytes[6];\n\n self.state[15] = time_index_bytes[7];\n\n\n\n self.cached = false;\n\n }\n\n}\n","file_path":"necsim/impls/no-std/src/cogs/rng/aes.rs","rank":88,"score":144895.51365753467},{"content":" if self.cached {\n\n // one more u64 will be cached\n\n self.cipher\n\n .encrypt_block(GenericArray::from_mut_slice(&mut self.state));\n\n\n\n u64::from_le_bytes([\n\n self.state[0],\n\n self.state[1],\n\n self.state[2],\n\n self.state[3],\n\n self.state[4],\n\n self.state[5],\n\n self.state[6],\n\n self.state[7],\n\n ])\n\n } else {\n\n // one more u64 was cached\n\n let rand_u64 = u64::from_le_bytes([\n\n self.state[8],\n\n self.state[9],\n","file_path":"necsim/impls/no-std/src/cogs/rng/aes.rs","rank":89,"score":144887.24074451256},{"content":"pub mod aes;\n\npub mod fixedseahash;\n\npub mod seahash;\n\npub mod wyhash;\n\npub mod wyrand;\n\npub mod xxhash;\n","file_path":"necsim/impls/no-std/src/cogs/rng/mod.rs","rank":90,"score":144881.74958412},{"content":" // that changing those flips the lower bits, which scatters upwards because\n\n // of the multiplication.\n\n\n\n x = x.wrapping_mul(0x6eed_0e9d_a4d9_4a4f);\n\n\n\n let a = x >> 32;\n\n let b = x >> 60;\n\n\n\n x ^= a >> b;\n\n\n\n x = x.wrapping_mul(0x6eed_0e9d_a4d9_4a4f);\n\n\n\n x\n\n}\n","file_path":"necsim/impls/no-std/src/cogs/rng/fixedseahash.rs","rank":91,"score":144881.74958412},{"content":"pub mod pcg;\n\npub mod std;\n","file_path":"necsim/impls/std/src/cogs/rng/mod.rs","rank":92,"score":144881.74958412},{"content":" // by the input itself. The shift is chosen by the higher bits, which means\n\n // that changing those flips the lower bits, which scatters upwards because\n\n // of the multiplication.\n\n\n\n x = x.wrapping_mul(0x6eed_0e9d_a4d9_4a4f);\n\n\n\n let a = x >> 32;\n\n let b = x >> 60;\n\n\n\n x ^= a >> b;\n\n\n\n x = x.wrapping_mul(0x6eed_0e9d_a4d9_4a4f);\n\n\n\n x\n\n}\n","file_path":"necsim/impls/no-std/src/cogs/rng/wyhash.rs","rank":93,"score":144881.74958412},{"content":"pub trait Scenario<G: RngCore>: Sized + ScenarioArguments {\n\n type Error;\n\n\n\n type Habitat: Habitat;\n\n type OriginSampler<'h, I: Iterator<Item = u64>>: OriginSampler<'h, Habitat = Self::Habitat>;\n\n type Decomposition: Decomposition<Self::Habitat>;\n\n type LineageReference: LineageReference<Self::Habitat>;\n\n type LineageStore<L: LineageStore<Self::Habitat, Self::LineageReference>>: LineageStore<\n\n Self::Habitat,\n\n Self::LineageReference,\n\n >;\n\n type DispersalSampler<D: DispersalSampler<Self::Habitat, G>>: DispersalSampler<Self::Habitat, G>;\n\n type TurnoverRate: TurnoverRate<Self::Habitat>;\n\n type SpeciationProbability: SpeciationProbability<Self::Habitat>;\n\n\n\n /// # Errors\n\n ///\n\n /// Returns a `Self::Error` if initialising the scenario failed\n\n fn initialise(\n\n args: Self::Arguments,\n","file_path":"rustcoalescence/scenarios/src/lib.rs","rank":94,"score":142884.73088064796},{"content":"#[allow(clippy::inline_always, clippy::inline_fn_without_body)]\n\n#[allow(clippy::module_name_repetitions)]\n\n#[contract_trait]\n\npub trait RngSampler: RngCore {\n\n #[must_use]\n\n #[inline]\n\n fn sample_uniform(&mut self) -> ClosedUnitF64 {\n\n // http://prng.di.unimi.it -> Generating uniform doubles in the unit interval\n\n #[allow(clippy::cast_precision_loss)]\n\n let u01 = ((self.sample_u64() >> 11) as f64) * f64::from_bits(0x3CA0_0000_0000_0000_u64); // 0x1.0p-53\n\n\n\n unsafe { ClosedUnitF64::new_unchecked(u01) }\n\n }\n\n\n\n #[must_use]\n\n #[inline]\n\n #[debug_ensures(ret < length, \"samples U(0, length - 1)\")]\n\n fn sample_index(&mut self, length: usize) -> usize {\n\n // attributes on expressions are experimental\n\n // see https://github.com/rust-lang/rust/issues/15701\n\n #[allow(\n\n clippy::cast_precision_loss,\n\n clippy::cast_possible_truncation,\n","file_path":"necsim/core/src/cogs/rng.rs","rank":95,"score":142169.68813439336},{"content":"#[allow(clippy::module_name_repetitions)]\n\npub trait SplittableRng: RngCore {\n\n fn split(self) -> (Self, Self);\n\n\n\n fn split_to_stream(self, stream: u64) -> Self;\n\n}\n","file_path":"necsim/core/src/cogs/rng.rs","rank":96,"score":142164.42733557717},{"content":"#[allow(clippy::module_name_repetitions)]\n\npub trait PrimeableRng: RngCore {\n\n fn prime_with(&mut self, location_index: u64, time_index: u64);\n\n}\n\n\n","file_path":"necsim/core/src/cogs/rng.rs","rank":97,"score":142164.42733557717},{"content":"use necsim_core::{\n\n cogs::{Backup, Habitat},\n\n landscape::{IndexedLocation, LandscapeExtent, Location},\n\n};\n\n\n\n#[allow(clippy::module_name_repetitions)]\n\n#[cfg_attr(feature = \"cuda\", derive(rust_cuda::common::RustToCuda))]\n\n#[derive(Debug)]\n\npub struct NonSpatialHabitat {\n\n extent: LandscapeExtent,\n\n deme: u32,\n\n}\n\n\n\nimpl NonSpatialHabitat {\n\n #[must_use]\n\n #[debug_ensures(\n\n ret.get_total_habitat() == old(u64::from(area.0) * u64::from(area.1) * u64::from(deme)),\n\n \"creates a habitat with community size area.0 * area.1 * deme\"\n\n )]\n\n pub fn new(area: (u32, u32), deme: u32) -> Self {\n","file_path":"necsim/impls/no-std/src/cogs/habitat/non_spatial.rs","rank":98,"score":141926.6980761503},{"content":"use necsim_core::{\n\n cogs::{Backup, Habitat},\n\n landscape::{IndexedLocation, LandscapeExtent, Location},\n\n};\n\n\n\n#[allow(clippy::module_name_repetitions)]\n\n#[cfg_attr(feature = \"cuda\", derive(rust_cuda::common::RustToCuda))]\n\n#[derive(Debug)]\n\npub struct AlmostInfiniteHabitat {\n\n extent: LandscapeExtent,\n\n}\n\n\n\nimpl Default for AlmostInfiniteHabitat {\n\n fn default() -> Self {\n\n Self {\n\n extent: LandscapeExtent::new(0_u32, 0_u32, u32::MAX, u32::MAX),\n\n }\n\n }\n\n}\n\n\n","file_path":"necsim/impls/no-std/src/cogs/habitat/almost_infinite.rs","rank":99,"score":141924.65440186026}],"string":"[\n {\n \"content\": \"#[contract_trait]\\n\\npub trait EmigrationExit<H: Habitat, G: RngCore, R: LineageReference<H>, S: LineageStore<H, R>>:\\n\\n crate::cogs::Backup + core::fmt::Debug\\n\\n{\\n\\n #[must_use]\\n\\n #[debug_ensures(match &ret {\\n\\n Some((\\n\\n ret_lineage_reference,\\n\\n ret_dispersal_origin,\\n\\n ret_dispersal_target,\\n\\n ret_prior_time,\\n\\n ret_event_time,\\n\\n )) => {\\n\\n ret_lineage_reference == &old(lineage_reference.clone()) &&\\n\\n ret_dispersal_origin == &old(dispersal_origin.clone()) &&\\n\\n ret_dispersal_target == &old(dispersal_target.clone()) &&\\n\\n ret_prior_time == &old(prior_time) &&\\n\\n ret_event_time == &old(event_time)\\n\\n },\\n\\n None => true,\\n\\n }, \\\"if ret is Some, it returns the input parameters unchanged\\\")]\\n\",\n \"file_path\": \"necsim/core/src/cogs/emigration_exit.rs\",\n \"rank\": 0,\n \"score\": 442210.9458263971\n },\n {\n \"content\": \"#[allow(clippy::module_name_repetitions)]\\n\\n#[allow(clippy::inline_always, clippy::inline_fn_without_body)]\\n\\n#[contract_trait]\\n\\npub trait EventTimeSampler<H: Habitat, G: PrimeableRng, T: TurnoverRate<H>>:\\n\\n Clone + core::fmt::Debug\\n\\n{\\n\\n #[debug_requires(\\n\\n habitat.get_habitat_at_location(indexed_location.location()) > 0,\\n\\n \\\"indexed_location must be habitable\\\"\\n\\n )]\\n\\n #[debug_ensures(ret >= time, \\\"the next event will happen weakly after time\\\")]\\n\\n fn next_event_time_at_indexed_location_weakly_after(\\n\\n &self,\\n\\n indexed_location: &IndexedLocation,\\n\\n time: NonNegativeF64,\\n\\n habitat: &H,\\n\\n rng: &mut G,\\n\\n turnover_rate: &T,\\n\\n ) -> NonNegativeF64;\\n\\n}\\n\",\n \"file_path\": \"necsim/impls/no-std/src/cogs/active_lineage_sampler/independent/event_time_sampler/mod.rs\",\n \"rank\": 1,\n \"score\": 384088.87673975795\n },\n {\n \"content\": \"#[allow(clippy::module_name_repetitions)]\\n\\n#[allow(clippy::inline_always, clippy::inline_fn_without_body)]\\n\\n#[contract_trait]\\n\\npub trait InMemoryDispersalSampler<H: Habitat, G: RngCore>: DispersalSampler<H, G> + Sized {\\n\\n #[debug_requires((\\n\\n dispersal.num_columns() == (\\n\\n (habitat.get_extent().width() * habitat.get_extent().height()) as usize\\n\\n ) && dispersal.num_rows() == (\\n\\n (habitat.get_extent().width() * habitat.get_extent().height()) as usize\\n\\n )\\n\\n ), \\\"dispersal dimensions are consistent\\\")]\\n\\n #[debug_requires(\\n\\n explicit_in_memory_dispersal_check_contract(dispersal, habitat),\\n\\n \\\"dispersal probabilities are consistent\\\"\\n\\n )]\\n\\n fn unchecked_new(dispersal: &Array2D<f64>, habitat: &H) -> Self;\\n\\n}\\n\",\n \"file_path\": \"necsim/impls/no-std/src/cogs/dispersal_sampler/in_memory/mod.rs\",\n \"rank\": 2,\n \"score\": 352473.406569776\n },\n {\n \"content\": \"#[allow(clippy::module_name_repetitions)]\\n\\n#[allow(clippy::inline_always, clippy::inline_fn_without_body)]\\n\\n#[contract_trait]\\n\\npub trait InMemoryDispersalSampler<H: Habitat, G: RngCore>:\\n\\n InMemoryDispersalSamplerNoError<H, G> + Sized\\n\\n{\\n\\n #[debug_ensures(\\n\\n matches!(ret, Err(InMemoryDispersalSamplerError::InconsistentDispersalMapSize)) != (\\n\\n dispersal.num_columns() == old(\\n\\n (habitat.get_extent().width() * habitat.get_extent().height()) as usize\\n\\n ) && dispersal.num_rows() == old(\\n\\n (habitat.get_extent().width() * habitat.get_extent().height()) as usize\\n\\n )\\n\\n ),\\n\\n \\\"returns Err(InconsistentDispersalMapSize) iff the dispersal dimensions are inconsistent\\\"\\n\\n )]\\n\\n #[debug_ensures(\\n\\n matches!(ret, Err(\\n\\n InMemoryDispersalSamplerError::InconsistentDispersalProbabilities\\n\\n )) != old(\\n\\n explicit_in_memory_dispersal_check_contract(dispersal, habitat)\\n\\n ), \\\"returns Err(InconsistentDispersalProbabilities) iff the dispersal probabilities are inconsistent\\\"\\n\\n )]\\n\",\n \"file_path\": \"necsim/impls/std/src/cogs/dispersal_sampler/in_memory/mod.rs\",\n \"rank\": 3,\n \"score\": 344958.1022079651\n },\n {\n \"content\": \"#[allow(clippy::inline_always, clippy::inline_fn_without_body)]\\n\\n#[allow(clippy::module_name_repetitions)]\\n\\n#[contract_trait]\\n\\npub trait SeparableDispersalSampler<H: Habitat, G: RngCore>: DispersalSampler<H, G> {\\n\\n #[must_use]\\n\\n #[debug_requires(habitat.contains(location), \\\"location is inside habitat\\\")]\\n\\n #[debug_ensures(old(habitat).contains(&ret), \\\"target is inside habitat\\\")]\\n\\n #[debug_ensures(&ret != location, \\\"disperses to a different location\\\")]\\n\\n fn sample_non_self_dispersal_from_location(\\n\\n &self,\\n\\n location: &Location,\\n\\n habitat: &H,\\n\\n rng: &mut G,\\n\\n ) -> Location;\\n\\n\\n\\n #[must_use]\\n\\n #[debug_requires(habitat.contains(location), \\\"location is inside habitat\\\")]\\n\\n fn get_self_dispersal_probability_at_location(\\n\\n &self,\\n\\n location: &Location,\\n\\n habitat: &H,\\n\\n ) -> ClosedUnitF64;\\n\\n}\\n\",\n \"file_path\": \"necsim/core/src/cogs/dispersal_sampler.rs\",\n \"rank\": 4,\n \"score\": 333459.7349511563\n },\n {\n \"content\": \"#[allow(clippy::inline_always, clippy::inline_fn_without_body)]\\n\\n#[contract_trait]\\n\\npub trait LineageStore<H: Habitat, R: LineageReference<H>>:\\n\\n crate::cogs::Backup + Sized + core::fmt::Debug\\n\\n{\\n\\n type LineageReferenceIterator<'a>: Iterator<Item = R>;\\n\\n\\n\\n #[must_use]\\n\\n fn from_origin_sampler<'h, O: OriginSampler<'h, Habitat = H>>(origin_sampler: O) -> Self\\n\\n where\\n\\n H: 'h;\\n\\n\\n\\n #[must_use]\\n\\n fn get_number_total_lineages(&self) -> usize;\\n\\n\\n\\n #[must_use]\\n\\n fn iter_local_lineage_references(&self) -> Self::LineageReferenceIterator<'_>;\\n\\n\\n\\n #[must_use]\\n\\n fn get(&self, reference: R) -> Option<&Lineage>;\\n\\n}\\n\\n\\n\",\n \"file_path\": \"necsim/core/src/cogs/lineage_store.rs\",\n \"rank\": 5,\n \"score\": 327377.1780122654\n },\n {\n \"content\": \"#[allow(clippy::inline_always, clippy::inline_fn_without_body)]\\n\\n#[contract_trait]\\n\\npub trait CoalescenceSampler<H: Habitat, R: LineageReference<H>, S: LineageStore<H, R>>:\\n\\n crate::cogs::Backup + core::fmt::Debug\\n\\n{\\n\\n #[must_use]\\n\\n #[debug_requires(habitat.get_habitat_at_location(&location) > 0, \\\"location is habitable\\\")]\\n\\n fn sample_interaction_at_location(\\n\\n &self,\\n\\n location: Location,\\n\\n habitat: &H,\\n\\n lineage_store: &S,\\n\\n coalescence_rng_sample: CoalescenceRngSample,\\n\\n ) -> (IndexedLocation, LineageInteraction);\\n\\n}\\n\\n\\n\\n#[derive(Debug, PartialEq)]\\n\\n#[cfg_attr(feature = \\\"mpi\\\", derive(mpi::traits::Equivalence))]\\n\\npub struct CoalescenceRngSample(ClosedUnitF64);\\n\\n\\n\\n#[contract_trait]\\n\\nimpl Backup for CoalescenceRngSample {\\n\",\n \"file_path\": \"necsim/core/src/cogs/coalescence_sampler.rs\",\n \"rank\": 6,\n \"score\": 326479.6645554225\n },\n {\n \"content\": \"#[allow(clippy::inline_always, clippy::inline_fn_without_body)]\\n\\n#[allow(clippy::module_name_repetitions)]\\n\\n#[contract_trait]\\n\\npub trait LocallyCoherentLineageStore<H: Habitat, R: LineageReference<H>>:\\n\\n LineageStore<H, R> + Index<R, Output = Lineage>\\n\\n{\\n\\n #[must_use]\\n\\n #[debug_requires(\\n\\n habitat.contains(indexed_location.location()),\\n\\n \\\"indexed location is inside habitat\\\"\\n\\n )]\\n\\n fn get_active_global_lineage_reference_at_indexed_location(\\n\\n &self,\\n\\n indexed_location: &IndexedLocation,\\n\\n habitat: &H,\\n\\n ) -> Option<&GlobalLineageReference>;\\n\\n\\n\\n #[debug_requires(\\n\\n habitat.contains(indexed_location.location()),\\n\\n \\\"indexed location is inside habitat\\\"\\n\\n )]\\n\\n #[debug_requires(self.get(reference.clone()).is_some(), \\\"lineage reference is valid\\\")]\\n\\n #[debug_requires(!self[reference.clone()].is_active(), \\\"lineage is inactive\\\")]\\n\",\n \"file_path\": \"necsim/core/src/cogs/lineage_store.rs\",\n \"rank\": 7,\n \"score\": 320693.4490262261\n },\n {\n \"content\": \"#[allow(clippy::inline_always, clippy::inline_fn_without_body)]\\n\\n#[allow(clippy::module_name_repetitions)]\\n\\n#[contract_trait]\\n\\npub trait GloballyCoherentLineageStore<H: Habitat, R: LineageReference<H>>:\\n\\n LocallyCoherentLineageStore<H, R>\\n\\n{\\n\\n type LocationIterator<'a>: Iterator<Item = Location>;\\n\\n\\n\\n #[must_use]\\n\\n fn iter_active_locations(&self, habitat: &H) -> Self::LocationIterator<'_>;\\n\\n\\n\\n #[must_use]\\n\\n #[debug_requires(habitat.contains(location), \\\"location is inside habitat\\\")]\\n\\n fn get_active_local_lineage_references_at_location_unordered(\\n\\n &self,\\n\\n location: &Location,\\n\\n habitat: &H,\\n\\n ) -> &[R];\\n\\n\\n\\n #[debug_ensures(\\n\\n self.get_active_local_lineage_references_at_location_unordered(\\n\\n &old(indexed_location.location().clone()), old(habitat)\\n\\n ).last() == Some(&old(reference.clone())),\\n\",\n \"file_path\": \"necsim/core/src/cogs/lineage_store.rs\",\n \"rank\": 8,\n \"score\": 320693.4490262261\n },\n {\n \"content\": \"#[allow(clippy::module_name_repetitions)]\\n\\npub fn explicit_in_memory_dispersal_check_contract<H: Habitat>(\\n\\n dispersal: &Array2D<f64>,\\n\\n habitat: &H,\\n\\n) -> bool {\\n\\n let habitat_width = habitat.get_extent().width();\\n\\n\\n\\n for row_index in 0..dispersal.num_rows() {\\n\\n #[allow(clippy::cast_possible_truncation)]\\n\\n let dispersal_origin = Location::new(\\n\\n (row_index % habitat_width as usize) as u32,\\n\\n (row_index / habitat_width as usize) as u32,\\n\\n );\\n\\n\\n\\n if habitat.get_habitat_at_location(&dispersal_origin) > 0 {\\n\\n let mut any_dispersal = false;\\n\\n\\n\\n for col_index in 0..dispersal.num_columns() {\\n\\n #[allow(clippy::cast_possible_truncation)]\\n\\n let dispersal_target = Location::new(\\n\\n (col_index % habitat_width as usize) as u32,\\n\",\n \"file_path\": \"necsim/impls/no-std/src/cogs/dispersal_sampler/in_memory/contract.rs\",\n \"rank\": 9,\n \"score\": 286813.664825672\n },\n {\n \"content\": \"#[allow(clippy::inline_always, clippy::inline_fn_without_body)]\\n\\n#[allow(clippy::module_name_repetitions)]\\n\\n#[contract_trait]\\n\\npub trait DispersalSampler<H: Habitat, G: RngCore>: crate::cogs::Backup + core::fmt::Debug {\\n\\n #[must_use]\\n\\n #[debug_requires(habitat.contains(location), \\\"location is inside habitat\\\")]\\n\\n #[debug_ensures(old(habitat).contains(&ret), \\\"target is inside habitat\\\")]\\n\\n fn sample_dispersal_from_location(\\n\\n &self,\\n\\n location: &Location,\\n\\n habitat: &H,\\n\\n rng: &mut G,\\n\\n ) -> Location;\\n\\n}\\n\\n\\n\",\n \"file_path\": \"necsim/core/src/cogs/dispersal_sampler.rs\",\n \"rank\": 10,\n \"score\": 283430.30331224354\n },\n {\n \"content\": \"#[inline]\\n\\n#[allow(clippy::cast_possible_truncation)]\\n\\nfn wymum(mut a: u64, mut b: u64) -> u64 {\\n\\n // WyHash diffusion function\\n\\n // https://docs.rs/wyhash/0.5.0/src/wyhash/functions.rs.html#8-12\\n\\n let r = u128::from(a) * u128::from(b);\\n\\n\\n\\n // WyHash condom\\n\\n // https://github.com/wangyi-fudan/wyhash/blob/master/wyhash.h#L57\\n\\n a ^= r as u64;\\n\\n b ^= (r >> 64) as u64;\\n\\n\\n\\n a ^ b\\n\\n}\\n\\n\\n\\n#[inline]\\n\\nconst fn seahash_diffuse(mut x: u64) -> u64 {\\n\\n // SeaHash diffusion function\\n\\n // https://docs.rs/seahash/4.1.0/src/seahash/helper.rs.html#75-92\\n\\n\\n\\n // These are derived from the PCG RNG's round. Thanks to @Veedrac for proposing\\n\\n // this. The basic idea is that we use dynamic shifts, which are determined\\n\",\n \"file_path\": \"necsim/impls/no-std/src/cogs/rng/wyhash.rs\",\n \"rank\": 11,\n \"score\": 282094.106960733\n },\n {\n \"content\": \"#[allow(clippy::module_name_repetitions)]\\n\\npub trait HabitatPrimeableRng<H: Habitat>: PrimeableRng {\\n\\n #[inline]\\n\\n fn prime_with_habitat(\\n\\n &mut self,\\n\\n habitat: &H,\\n\\n indexed_location: &IndexedLocation,\\n\\n time_index: u64,\\n\\n ) {\\n\\n self.prime_with(\\n\\n habitat.map_indexed_location_to_u64_injective(indexed_location),\\n\\n time_index,\\n\\n );\\n\\n }\\n\\n}\\n\\n\\n\\nimpl<R: PrimeableRng, H: Habitat> HabitatPrimeableRng<H> for R {}\\n\\n\\n\",\n \"file_path\": \"necsim/core/src/cogs/rng.rs\",\n \"rank\": 12,\n \"score\": 261917.10245127167\n },\n {\n \"content\": \"#[allow(clippy::module_name_repetitions)]\\n\\npub trait LineageReference<H: Habitat>:\\n\\n crate::cogs::Backup + PartialEq + Eq + Hash + Clone + core::fmt::Debug\\n\\n{\\n\\n}\\n\",\n \"file_path\": \"necsim/core/src/cogs/lineage_reference.rs\",\n \"rank\": 13,\n \"score\": 253566.9201438749\n },\n {\n \"content\": \"/// A convenience function for reading data from a reader\\n\\n/// and feeding into a deserializer.\\n\\npub fn from_reader<R, T>(mut rdr: R) -> Result<T>\\n\\nwhere\\n\\n R: io::Read,\\n\\n T: de::DeserializeOwned,\\n\\n{\\n\\n let mut bytes = Vec::new();\\n\\n rdr.read_to_end(&mut bytes)?;\\n\\n\\n\\n from_bytes(&bytes)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"third-party/ron/src/de/mod.rs\",\n \"rank\": 14,\n \"score\": 213042.3534687739\n },\n {\n \"content\": \"#[allow(unreachable_code)]\\n\\n#[allow(unused_variables)]\\n\\n#[allow(clippy::needless_pass_by_value)]\\n\\npub fn simulate<R: ReporterContext, P: LocalPartition<R>>(\\n\\n common_args: CommonArgs,\\n\\n non_spatial_args: NonSpatialArgs,\\n\\n local_partition: &mut P,\\n\\n) -> Result<(f64, u64)> {\\n\\n info!(\\n\\n \\\"Setting up the non-spatial {} coalescence algorithm ...\\\",\\n\\n common_args.algorithm\\n\\n );\\n\\n\\n\\n #[allow(clippy::match_single_binding)]\\n\\n #[allow(clippy::map_err_ignore)]\\n\\n let result: Result<(f64, u64)> = match common_args.algorithm {\\n\\n #[cfg(feature = \\\"necsim-classical\\\")]\\n\\n Algorithm::Classical => ClassicalSimulation::simulate(\\n\\n non_spatial_args.area,\\n\\n non_spatial_args.deme,\\n\\n common_args.speciation_probability_per_generation.get(),\\n\\n common_args.sample_percentage.get(),\\n\\n common_args.seed,\\n\",\n \"file_path\": \"rustcoalescence/src/simulation/non_spatial.rs\",\n \"rank\": 15,\n \"score\": 209904.86862020678\n },\n {\n \"content\": \"#[allow(clippy::too_many_lines, clippy::boxed_local)]\\n\\npub fn simulate_with_logger<R: Reporter, P: LocalPartition<R>>(\\n\\n mut local_partition: Box<P>,\\n\\n common_args: CommonArgs,\\n\\n scenario: ScenarioArgs,\\n\\n) -> Result<()> {\\n\\n if local_partition.get_number_of_partitions().get() <= 1 {\\n\\n info!(\\\"The simulation will be run in monolithic mode.\\\");\\n\\n } else {\\n\\n info!(\\n\\n \\\"The simulation will be distributed across {} partitions.\\\",\\n\\n local_partition.get_number_of_partitions().get()\\n\\n );\\n\\n }\\n\\n\\n\\n let pre_sampler = OriginPreSampler::all().percentage(common_args.sample_percentage.get());\\n\\n\\n\\n let (time, steps): (NonNegativeF64, u64) = crate::match_scenario_algorithm!(\\n\\n (common_args.algorithm, scenario => scenario)\\n\\n {\\n\\n #[cfg(feature = \\\"rustcoalescence-algorithms-monolithic\\\")]\\n\",\n \"file_path\": \"rustcoalescence/src/cli/simulate/dispatch.rs\",\n \"rank\": 16,\n \"score\": 209904.86862020678\n },\n {\n \"content\": \"#[allow(unreachable_code)]\\n\\n#[allow(unused_variables)]\\n\\n#[allow(clippy::needless_pass_by_value)]\\n\\npub fn simulate<R: ReporterContext, P: LocalPartition<R>>(\\n\\n common_args: CommonArgs,\\n\\n spatially_implicit_args: SpatiallyImplicitArgs,\\n\\n local_partition: &mut P,\\n\\n) -> Result<(f64, u64)> {\\n\\n info!(\\n\\n \\\"Setting up the spatially-implicit {} coalescence algorithm ...\\\",\\n\\n common_args.algorithm\\n\\n );\\n\\n\\n\\n #[allow(clippy::match_single_binding)]\\n\\n #[allow(clippy::map_err_ignore)]\\n\\n let result: Result<(f64, u64)> = match common_args.algorithm {\\n\\n #[cfg(feature = \\\"necsim-classical\\\")]\\n\\n Algorithm::Classical => ClassicalSimulation::simulate(\\n\\n spatially_implicit_args.dynamic_meta,\\n\\n (\\n\\n spatially_implicit_args.local_area,\\n\\n spatially_implicit_args.local_deme,\\n\\n ),\\n\",\n \"file_path\": \"rustcoalescence/src/simulation/spatially_implicit.rs\",\n \"rank\": 17,\n \"score\": 209904.86862020678\n },\n {\n \"content\": \"#[allow(clippy::module_name_repetitions)]\\n\\npub fn simulate_with_logger<R: Reporter, P: LocalPartition<R>>(\\n\\n local_partition: Box<P>,\\n\\n common_args: CommonArgs,\\n\\n scenario: ScenarioArgs,\\n\\n) -> Result<()> {\\n\\n #[cfg(any(\\n\\n feature = \\\"rustcoalescence-algorithms-monolithic\\\",\\n\\n feature = \\\"rustcoalescence-algorithms-independent\\\",\\n\\n feature = \\\"rustcoalescence-algorithms-cuda\\\"\\n\\n ))]\\n\\n {\\n\\n dispatch::simulate_with_logger(local_partition, common_args, scenario)\\n\\n }\\n\\n\\n\\n #[cfg(not(any(\\n\\n feature = \\\"rustcoalescence-algorithms-monolithic\\\",\\n\\n feature = \\\"rustcoalescence-algorithms-independent\\\",\\n\\n feature = \\\"rustcoalescence-algorithms-cuda\\\"\\n\\n )))]\\n\\n {\\n\\n std::mem::drop(local_partition);\\n\\n std::mem::drop(common_args);\\n\\n std::mem::drop(scenario);\\n\\n\\n\\n Err(anyhow::anyhow!(\\n\\n \\\"rustcoalescence must be compiled to support at least one algorithm.\\\"\\n\\n ))\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"rustcoalescence/src/cli/simulate/mod.rs\",\n \"rank\": 18,\n \"score\": 209904.86862020678\n },\n {\n \"content\": \"#[allow(unreachable_code)]\\n\\n#[allow(unused_variables)]\\n\\n#[allow(clippy::needless_pass_by_value)]\\n\\npub fn simulate<R: ReporterContext, P: LocalPartition<R>>(\\n\\n common_args: CommonArgs,\\n\\n almost_infinite_args: AlmostInfiniteArgs,\\n\\n local_partition: &mut P,\\n\\n) -> Result<(f64, u64)> {\\n\\n info!(\\n\\n \\\"Setting up the almost-infinite {} coalescence algorithm ...\\\",\\n\\n common_args.algorithm\\n\\n );\\n\\n\\n\\n #[allow(clippy::match_single_binding)]\\n\\n #[allow(clippy::map_err_ignore)]\\n\\n let result: Result<(f64, u64)> = match common_args.algorithm {\\n\\n #[cfg(feature = \\\"necsim-classical\\\")]\\n\\n Algorithm::Classical => ClassicalSimulation::simulate(\\n\\n almost_infinite_args.radius,\\n\\n almost_infinite_args.sigma.get(),\\n\\n common_args.speciation_probability_per_generation.get(),\\n\\n common_args.sample_percentage.get(),\\n\\n common_args.seed,\\n\",\n \"file_path\": \"rustcoalescence/src/simulation/almost_infinite.rs\",\n \"rank\": 19,\n \"score\": 209904.86862020678\n },\n {\n \"content\": \"#[allow(unreachable_code)]\\n\\n#[allow(unused_variables)]\\n\\n#[allow(clippy::needless_pass_by_value)]\\n\\npub fn simulate<R: ReporterContext, P: LocalPartition<R>>(\\n\\n common_args: CommonArgs,\\n\\n in_memory_args: InMemoryArgs,\\n\\n local_partition: &mut P,\\n\\n) -> Result<(f64, u64)> {\\n\\n info!(\\n\\n \\\"Setting up the in-memory {} coalescence algorithm ...\\\",\\n\\n common_args.algorithm\\n\\n );\\n\\n\\n\\n #[allow(clippy::match_single_binding)]\\n\\n let result: Result<(f64, u64)> = match common_args.algorithm {\\n\\n #[cfg(feature = \\\"necsim-classical\\\")]\\n\\n Algorithm::Classical => ClassicalSimulation::simulate(\\n\\n &in_memory_args.habitat_map,\\n\\n &in_memory_args.dispersal_map,\\n\\n common_args.speciation_probability_per_generation.get(),\\n\\n common_args.sample_percentage.get(),\\n\\n common_args.seed,\\n\\n local_partition,\\n\",\n \"file_path\": \"rustcoalescence/src/simulation/spatially_explicit.rs\",\n \"rank\": 20,\n \"score\": 209904.86862020678\n },\n {\n \"content\": \"// Fix habitat rounding error by correcting 0/1 values to 0/1 based on dispersal\\n\\n// (can only disperse from habitat)\\n\\nfn fix_habitat_map(habitat: &mut Array2D<u32>, dispersal: &Array2D<f64>) {\\n\\n for y in 0..habitat.num_rows() {\\n\\n for x in 0..habitat.num_columns() {\\n\\n let h_before = habitat[(y, x)];\\n\\n\\n\\n if h_before <= 1 {\\n\\n // If there is any dispersal from this location, it must be habitat\\n\\n let h_fixed = if dispersal\\n\\n .row_iter(y * habitat.num_columns() + x)\\n\\n .map_or(false, |mut it| it.any(|p| *p > 0.0_f64))\\n\\n {\\n\\n 1\\n\\n } else {\\n\\n 0\\n\\n };\\n\\n\\n\\n if h_fixed != h_before {\\n\\n habitat[(y, x)] = h_fixed;\\n\\n\\n\\n // warn!(\\n\\n // \\\"Corrected habitat value {} to {} at ({},{}) to fit \\\\\\n\\n // dispersal ...\\\", h_before, h_fixed, x, y\\n\\n // );\\n\\n }\\n\\n }\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"rustcoalescence/src/maps.rs\",\n \"rank\": 21,\n \"score\": 205951.83515204056\n },\n {\n \"content\": \"#[allow(clippy::module_name_repetitions)]\\n\\n#[allow(clippy::inline_always, clippy::inline_fn_without_body)]\\n\\n#[contract_trait]\\n\\npub trait EmigrationChoice<H: Habitat>: Backup + core::fmt::Debug {\\n\\n fn should_lineage_emigrate(\\n\\n &self,\\n\\n indexed_location: &IndexedLocation,\\n\\n time: PositiveF64,\\n\\n habitat: &H,\\n\\n ) -> bool;\\n\\n}\\n\",\n \"file_path\": \"necsim/impls/no-std/src/cogs/emigration_exit/independent/choice/mod.rs\",\n \"rank\": 22,\n \"score\": 202637.69185298905\n },\n {\n \"content\": \"#[must_use]\\n\\npub fn sample_interaction_at_location<\\n\\n H: Habitat,\\n\\n R: LineageReference<H>,\\n\\n S: LocallyCoherentLineageStore<H, R>,\\n\\n>(\\n\\n location: Location,\\n\\n habitat: &H,\\n\\n lineage_store: &S,\\n\\n coalescence_rng_sample: CoalescenceRngSample,\\n\\n) -> (IndexedLocation, LineageInteraction) {\\n\\n let chosen_coalescence_index =\\n\\n coalescence_rng_sample.sample_coalescence_index(habitat.get_habitat_at_location(&location));\\n\\n\\n\\n let indexed_location = IndexedLocation::new(location, chosen_coalescence_index);\\n\\n\\n\\n let optional_coalescence = lineage_store\\n\\n .get_active_global_lineage_reference_at_indexed_location(&indexed_location, habitat)\\n\\n .cloned();\\n\\n\\n\\n (indexed_location, optional_coalescence.into())\\n\\n}\\n\",\n \"file_path\": \"necsim/impls/no-std/src/cogs/coalescence_sampler/optional_coalescence.rs\",\n \"rank\": 23,\n \"score\": 201048.72122542438\n },\n {\n \"content\": \"// Fix dispersal by removing dispersal to/from non-habitat\\n\\n// Fix dispersal by adding self-dispersal when no dispersal exists from habitat\\n\\nfn fix_dispersal_map(habitat: &Array2D<u32>, dispersal: &mut Array2D<f64>) {\\n\\n let size = habitat.num_rows() * habitat.num_columns();\\n\\n\\n\\n for y in 0..habitat.num_rows() {\\n\\n for x in 0..habitat.num_columns() {\\n\\n let row = y * habitat.num_columns() + x;\\n\\n\\n\\n if habitat[(y, x)] == 0 {\\n\\n let mut warn = false;\\n\\n\\n\\n // Fix dispersal from non-habitat\\n\\n for column in 0..size {\\n\\n let d = &mut dispersal[(row, column)];\\n\\n\\n\\n if *d > 0.0_f64 {\\n\\n warn = true;\\n\\n\\n\\n *d = 0.0_f64;\\n\\n }\\n\\n }\\n\",\n \"file_path\": \"rustcoalescence/src/maps.rs\",\n \"rank\": 24,\n \"score\": 193143.34978554246\n },\n {\n \"content\": \"use std::cmp::Ordering;\\n\\n\\n\\nuse necsim_core_bond::{NonNegativeF64, PositiveF64};\\n\\n\\n\\n#[derive(PartialEq, Copy, Clone)]\\n\\npub struct EventTime(NonNegativeF64);\\n\\n\\n\\nimpl Eq for EventTime {}\\n\\n\\n\\nimpl PartialOrd for EventTime {\\n\\n fn partial_cmp(&self, other: &Self) -> Option<Ordering> {\\n\\n other.0.partial_cmp(&self.0)\\n\\n }\\n\\n}\\n\\n\\n\\nimpl Ord for EventTime {\\n\\n fn cmp(&self, other: &Self) -> Ordering {\\n\\n other.0.cmp(&self.0)\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"necsim/impls/std/src/cogs/active_lineage_sampler/gillespie/event_time.rs\",\n \"rank\": 25,\n \"score\": 178671.6909816939\n },\n {\n \"content\": \"\\n\\nimpl From<NonNegativeF64> for EventTime {\\n\\n fn from(event_time: NonNegativeF64) -> Self {\\n\\n Self(event_time)\\n\\n }\\n\\n}\\n\\n\\n\\nimpl From<PositiveF64> for EventTime {\\n\\n fn from(event_time: PositiveF64) -> Self {\\n\\n Self(event_time.into())\\n\\n }\\n\\n}\\n\\n\\n\\nimpl From<EventTime> for NonNegativeF64 {\\n\\n fn from(event_time: EventTime) -> Self {\\n\\n event_time.0\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"necsim/impls/std/src/cogs/active_lineage_sampler/gillespie/event_time.rs\",\n \"rank\": 26,\n \"score\": 178668.75142520008\n },\n {\n \"content\": \"#[allow(clippy::inline_always, clippy::inline_fn_without_body)]\\n\\n#[contract_trait]\\n\\npub trait SpeciationProbability<H: Habitat>: crate::cogs::Backup + core::fmt::Debug {\\n\\n #[must_use]\\n\\n #[debug_requires(habitat.contains(location), \\\"location is inside habitat\\\")]\\n\\n fn get_speciation_probability_at_location(\\n\\n &self,\\n\\n location: &Location,\\n\\n habitat: &H,\\n\\n ) -> ClosedUnitF64;\\n\\n}\\n\",\n \"file_path\": \"necsim/core/src/cogs/speciation_probability.rs\",\n \"rank\": 27,\n \"score\": 176673.36484188537\n },\n {\n \"content\": \"#[allow(clippy::inline_always, clippy::inline_fn_without_body)]\\n\\n#[contract_trait]\\n\\npub trait TurnoverRate<H: Habitat>: crate::cogs::Backup + core::fmt::Debug {\\n\\n #[must_use]\\n\\n #[debug_requires(habitat.contains(location), \\\"location is inside habitat\\\")]\\n\\n #[debug_ensures(\\n\\n ret == 0.0_f64 -> habitat.get_habitat_at_location(location) == 0_u32,\\n\\n \\\"only returns zero if the location is inhabitable\\\"\\n\\n )]\\n\\n fn get_turnover_rate_at_location(&self, location: &Location, habitat: &H) -> NonNegativeF64;\\n\\n}\\n\",\n \"file_path\": \"necsim/core/src/cogs/turnover_rate.rs\",\n \"rank\": 28,\n \"score\": 176673.36484188537\n },\n {\n \"content\": \" #[must_use]\\n\\n pub fn new(delta_t: PositiveF64) -> Self {\\n\\n Self { delta_t }\\n\\n }\\n\\n}\\n\\n\\n\\n#[contract_trait]\\n\\nimpl<H: Habitat, G: PrimeableRng, T: TurnoverRate<H>> EventTimeSampler<H, G, T>\\n\\n for PoissonEventTimeSampler\\n\\n{\\n\\n #[inline]\\n\\n fn next_event_time_at_indexed_location_weakly_after(\\n\\n &self,\\n\\n indexed_location: &IndexedLocation,\\n\\n time: NonNegativeF64,\\n\\n habitat: &H,\\n\\n rng: &mut G,\\n\\n turnover_rate: &T,\\n\\n ) -> NonNegativeF64 {\\n\\n let lambda =\\n\",\n \"file_path\": \"necsim/impls/no-std/src/cogs/active_lineage_sampler/independent/event_time_sampler/poisson.rs\",\n \"rank\": 29,\n \"score\": 171992.6787628965\n },\n {\n \"content\": \" #[must_use]\\n\\n pub fn new(delta_t: PositiveF64) -> Self {\\n\\n Self { delta_t }\\n\\n }\\n\\n}\\n\\n\\n\\n#[contract_trait]\\n\\nimpl<H: Habitat, G: PrimeableRng, T: TurnoverRate<H>> EventTimeSampler<H, G, T>\\n\\n for ExpEventTimeSampler\\n\\n{\\n\\n #[inline]\\n\\n fn next_event_time_at_indexed_location_weakly_after(\\n\\n &self,\\n\\n indexed_location: &IndexedLocation,\\n\\n time: NonNegativeF64,\\n\\n habitat: &H,\\n\\n rng: &mut G,\\n\\n turnover_rate: &T,\\n\\n ) -> NonNegativeF64 {\\n\\n // Safety: The turnover rate is >= 0.0 and must actually be > 0.0 because\\n\",\n \"file_path\": \"necsim/impls/no-std/src/cogs/active_lineage_sampler/independent/event_time_sampler/exp.rs\",\n \"rank\": 30,\n \"score\": 171991.92662942852\n },\n {\n \"content\": \"#[contract_trait]\\n\\nimpl<H: Habitat, G: PrimeableRng, T: TurnoverRate<H>> EventTimeSampler<H, G, T>\\n\\n for FixedEventTimeSampler\\n\\n{\\n\\n #[inline]\\n\\n fn next_event_time_at_indexed_location_weakly_after(\\n\\n &self,\\n\\n indexed_location: &IndexedLocation,\\n\\n time: NonNegativeF64,\\n\\n habitat: &H,\\n\\n rng: &mut G,\\n\\n turnover_rate: &T,\\n\\n ) -> NonNegativeF64 {\\n\\n let lambda =\\n\\n turnover_rate.get_turnover_rate_at_location(indexed_location.location(), habitat);\\n\\n\\n\\n #[allow(clippy::cast_possible_truncation)]\\n\\n #[allow(clippy::cast_sign_loss)]\\n\\n let time_step = floor(time.get() * lambda.get()) as u64 + 1;\\n\\n\\n\\n rng.prime_with_habitat(habitat, indexed_location, time_step);\\n\\n\\n\\n NonNegativeF64::from(time_step) / lambda\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"necsim/impls/no-std/src/cogs/active_lineage_sampler/independent/event_time_sampler/fixed.rs\",\n \"rank\": 31,\n \"score\": 171989.10970439707\n },\n {\n \"content\": \" }\\n\\n}\\n\\n\\n\\n#[contract_trait]\\n\\nimpl<H: Habitat, G: PrimeableRng, T: TurnoverRate<H>> EventTimeSampler<H, G, T>\\n\\n for GeometricEventTimeSampler\\n\\n{\\n\\n #[inline]\\n\\n fn next_event_time_at_indexed_location_weakly_after(\\n\\n &self,\\n\\n indexed_location: &IndexedLocation,\\n\\n time: NonNegativeF64,\\n\\n habitat: &H,\\n\\n rng: &mut G,\\n\\n turnover_rate: &T,\\n\\n ) -> NonNegativeF64 {\\n\\n let event_probability_per_step = neg_exp(\\n\\n turnover_rate.get_turnover_rate_at_location(indexed_location.location(), habitat)\\n\\n * self.delta_t,\\n\\n )\\n\",\n \"file_path\": \"necsim/impls/no-std/src/cogs/active_lineage_sampler/independent/event_time_sampler/geometric.rs\",\n \"rank\": 32,\n \"score\": 171988.23643078067\n },\n {\n \"content\": \"use necsim_core::{\\n\\n cogs::{Habitat, HabitatPrimeableRng, PrimeableRng, TurnoverRate},\\n\\n intrinsics::floor,\\n\\n landscape::IndexedLocation,\\n\\n};\\n\\nuse necsim_core_bond::NonNegativeF64;\\n\\n\\n\\nuse super::EventTimeSampler;\\n\\n\\n\\n#[allow(clippy::module_name_repetitions)]\\n\\n#[derive(Clone, Debug)]\\n\\n#[cfg_attr(feature = \\\"cuda\\\", derive(rust_cuda::common::RustToCuda))]\\n\\npub struct FixedEventTimeSampler(());\\n\\n\\n\\nimpl Default for FixedEventTimeSampler {\\n\\n fn default() -> Self {\\n\\n Self(())\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"necsim/impls/no-std/src/cogs/active_lineage_sampler/independent/event_time_sampler/fixed.rs\",\n \"rank\": 33,\n \"score\": 171980.15769612993\n },\n {\n \"content\": \"use necsim_core::{\\n\\n cogs::{Habitat, HabitatPrimeableRng, PrimeableRng, RngSampler, TurnoverRate},\\n\\n intrinsics::{floor, neg_exp},\\n\\n landscape::IndexedLocation,\\n\\n};\\n\\nuse necsim_core_bond::{NonNegativeF64, PositiveF64};\\n\\n\\n\\nuse super::EventTimeSampler;\\n\\n\\n\\n#[allow(clippy::module_name_repetitions)]\\n\\n#[derive(Clone, Debug)]\\n\\n#[cfg_attr(feature = \\\"cuda\\\", derive(rust_cuda::common::RustToCuda))]\\n\\npub struct GeometricEventTimeSampler {\\n\\n delta_t: PositiveF64,\\n\\n}\\n\\n\\n\\nimpl GeometricEventTimeSampler {\\n\\n #[must_use]\\n\\n pub fn new(delta_t: PositiveF64) -> Self {\\n\\n Self { delta_t }\\n\",\n \"file_path\": \"necsim/impls/no-std/src/cogs/active_lineage_sampler/independent/event_time_sampler/geometric.rs\",\n \"rank\": 34,\n \"score\": 171978.9829460151\n },\n {\n \"content\": \" turnover_rate.get_turnover_rate_at_location(indexed_location.location(), habitat);\\n\\n let lambda_per_step = lambda * self.delta_t;\\n\\n let no_event_probability_per_step = exp(-lambda_per_step.get());\\n\\n\\n\\n #[allow(clippy::cast_possible_truncation)]\\n\\n #[allow(clippy::cast_sign_loss)]\\n\\n let mut time_step = floor(time.get() / self.delta_t.get()) as u64;\\n\\n\\n\\n let (event_time, event_index) = loop {\\n\\n rng.prime_with_habitat(habitat, indexed_location, time_step);\\n\\n\\n\\n let number_events_at_time_steps = if no_event_probability_per_step > 0.0_f64 {\\n\\n // https://en.wikipedia.org/wiki/Poisson_distribution#cite_ref-Devroye1986_54-0\\n\\n let mut poisson = 0_u32;\\n\\n let mut prod = no_event_probability_per_step;\\n\\n let mut acc = no_event_probability_per_step;\\n\\n\\n\\n let u = rng.sample_uniform();\\n\\n\\n\\n while u > acc && prod > 0.0_f64 {\\n\",\n \"file_path\": \"necsim/impls/no-std/src/cogs/active_lineage_sampler/independent/event_time_sampler/poisson.rs\",\n \"rank\": 35,\n \"score\": 171974.5446691191\n },\n {\n \"content\": \" // * `indexed_location` is habitable by this method's precondition\\n\\n // * Therefore, `turnover_rate` must return a positive value by its\\n\\n // postcondition\\n\\n let lambda = unsafe {\\n\\n PositiveF64::new_unchecked(\\n\\n turnover_rate\\n\\n .get_turnover_rate_at_location(indexed_location.location(), habitat)\\n\\n .get(),\\n\\n )\\n\\n };\\n\\n\\n\\n #[allow(clippy::cast_possible_truncation, clippy::cast_sign_loss)]\\n\\n let mut time_step = floor(time.get() / self.delta_t.get()) as u64;\\n\\n\\n\\n let mut event_time = NonNegativeF64::from(time_step) * self.delta_t;\\n\\n let mut time_slice_end = NonNegativeF64::from(time_step + 1) * self.delta_t;\\n\\n\\n\\n #[allow(clippy::cast_possible_truncation, clippy::cast_sign_loss)]\\n\\n rng.prime_with_habitat(habitat, indexed_location, time_step);\\n\\n\\n\",\n \"file_path\": \"necsim/impls/no-std/src/cogs/active_lineage_sampler/independent/event_time_sampler/exp.rs\",\n \"rank\": 36,\n \"score\": 171974.5145375488\n },\n {\n \"content\": \"use necsim_core::{\\n\\n cogs::{Habitat, HabitatPrimeableRng, PrimeableRng, RngSampler, TurnoverRate},\\n\\n intrinsics::floor,\\n\\n landscape::IndexedLocation,\\n\\n};\\n\\nuse necsim_core_bond::{NonNegativeF64, PositiveF64};\\n\\n\\n\\nuse super::EventTimeSampler;\\n\\n\\n\\n// 2^64 / PHI\\n\\nconst INV_PHI: u64 = 0x9e37_79b9_7f4a_7c15_u64;\\n\\n\\n\\n#[allow(clippy::module_name_repetitions)]\\n\\n#[derive(Clone, Debug)]\\n\\n#[cfg_attr(feature = \\\"cuda\\\", derive(rust_cuda::common::RustToCuda))]\\n\\npub struct ExpEventTimeSampler {\\n\\n delta_t: PositiveF64,\\n\\n}\\n\\n\\n\\nimpl ExpEventTimeSampler {\\n\",\n \"file_path\": \"necsim/impls/no-std/src/cogs/active_lineage_sampler/independent/event_time_sampler/exp.rs\",\n \"rank\": 37,\n \"score\": 171974.15511652103\n },\n {\n \"content\": \"use necsim_core::{\\n\\n cogs::{Habitat, HabitatPrimeableRng, PrimeableRng, RngSampler, TurnoverRate},\\n\\n intrinsics::{exp, floor, safe_sqrt},\\n\\n landscape::IndexedLocation,\\n\\n};\\n\\nuse necsim_core_bond::{NonNegativeF64, PositiveF64};\\n\\n\\n\\nuse super::EventTimeSampler;\\n\\n\\n\\n// 2^64 / PHI\\n\\nconst INV_PHI: u64 = 0x9e37_79b9_7f4a_7c15_u64;\\n\\n\\n\\n#[allow(clippy::module_name_repetitions)]\\n\\n#[derive(Clone, Debug)]\\n\\n#[cfg_attr(feature = \\\"cuda\\\", derive(rust_cuda::common::RustToCuda))]\\n\\npub struct PoissonEventTimeSampler {\\n\\n delta_t: PositiveF64,\\n\\n}\\n\\n\\n\\nimpl PoissonEventTimeSampler {\\n\",\n \"file_path\": \"necsim/impls/no-std/src/cogs/active_lineage_sampler/independent/event_time_sampler/poisson.rs\",\n \"rank\": 38,\n \"score\": 171973.78607937047\n },\n {\n \"content\": \" .one_minus();\\n\\n\\n\\n #[allow(clippy::cast_possible_truncation)]\\n\\n #[allow(clippy::cast_sign_loss)]\\n\\n let mut time_step = floor(time.get() / self.delta_t.get()) as u64 + 1;\\n\\n\\n\\n loop {\\n\\n rng.prime_with_habitat(habitat, indexed_location, time_step);\\n\\n\\n\\n if rng.sample_event(event_probability_per_step) {\\n\\n break;\\n\\n }\\n\\n\\n\\n time_step += 1;\\n\\n }\\n\\n\\n\\n NonNegativeF64::from(time_step) * self.delta_t\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"necsim/impls/no-std/src/cogs/active_lineage_sampler/independent/event_time_sampler/geometric.rs\",\n \"rank\": 39,\n \"score\": 171973.1069980605\n },\n {\n \"content\": \" let mut sub_index: u64 = 0;\\n\\n\\n\\n loop {\\n\\n event_time += rng.sample_exponential(lambda);\\n\\n\\n\\n sub_index = sub_index.wrapping_add(INV_PHI);\\n\\n\\n\\n // The time slice is exclusive at time_slice_end\\n\\n if event_time >= time_slice_end {\\n\\n time_step += 1;\\n\\n sub_index = 0;\\n\\n\\n\\n event_time = time_slice_end;\\n\\n time_slice_end = NonNegativeF64::from(time_step + 1) * self.delta_t;\\n\\n\\n\\n rng.prime_with_habitat(habitat, indexed_location, time_step);\\n\\n } else if event_time > time {\\n\\n break;\\n\\n }\\n\\n }\\n\\n\\n\\n rng.prime_with_habitat(habitat, indexed_location, time_step.wrapping_add(sub_index));\\n\\n\\n\\n event_time\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"necsim/impls/no-std/src/cogs/active_lineage_sampler/independent/event_time_sampler/exp.rs\",\n \"rank\": 40,\n \"score\": 171968.98219797882\n },\n {\n \"content\": \"use necsim_core::{\\n\\n cogs::{Habitat, PrimeableRng, TurnoverRate},\\n\\n landscape::IndexedLocation,\\n\\n};\\n\\nuse necsim_core_bond::NonNegativeF64;\\n\\n\\n\\npub mod exp;\\n\\npub mod fixed;\\n\\npub mod geometric;\\n\\npub mod poisson;\\n\\n\\n\\n#[allow(clippy::module_name_repetitions)]\\n\\n#[allow(clippy::inline_always, clippy::inline_fn_without_body)]\\n\\n#[contract_trait]\\n\",\n \"file_path\": \"necsim/impls/no-std/src/cogs/active_lineage_sampler/independent/event_time_sampler/mod.rs\",\n \"rank\": 41,\n \"score\": 171968.24069019523\n },\n {\n \"content\": \"\\n\\n rng.prime_with_habitat(\\n\\n habitat,\\n\\n indexed_location,\\n\\n time_step + INV_PHI.wrapping_mul(u64::from(event_index + 1)),\\n\\n );\\n\\n\\n\\n event_time\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"necsim/impls/no-std/src/cogs/active_lineage_sampler/independent/event_time_sampler/poisson.rs\",\n \"rank\": 42,\n \"score\": 171964.65191694637\n },\n {\n \"content\": \" poisson += 1;\\n\\n prod *= lambda_per_step.get() / f64::from(poisson);\\n\\n acc += prod;\\n\\n }\\n\\n\\n\\n poisson\\n\\n } else {\\n\\n // Fallback in case no_event_probability_per_step underflows\\n\\n #[allow(clippy::cast_possible_truncation, clippy::cast_sign_loss)]\\n\\n let normal_as_poisson = rng\\n\\n .sample_2d_normal(lambda_per_step.get(), safe_sqrt(lambda_per_step))\\n\\n .0\\n\\n .max(0.0_f64) as u32;\\n\\n\\n\\n normal_as_poisson\\n\\n };\\n\\n\\n\\n let mut next_event = None;\\n\\n\\n\\n for event_index in 0..number_events_at_time_steps {\\n\",\n \"file_path\": \"necsim/impls/no-std/src/cogs/active_lineage_sampler/independent/event_time_sampler/poisson.rs\",\n \"rank\": 43,\n \"score\": 171958.86762339668\n },\n {\n \"content\": \" #[allow(clippy::cast_precision_loss)]\\n\\n let event_time =\\n\\n (NonNegativeF64::from(time_step) + rng.sample_uniform()) * self.delta_t;\\n\\n\\n\\n if event_time > time {\\n\\n next_event = match next_event {\\n\\n Some((later_event_time, _)) if later_event_time > event_time => {\\n\\n Some((event_time, event_index))\\n\\n },\\n\\n Some(next_event) => Some(next_event),\\n\\n None => Some((event_time, event_index)),\\n\\n };\\n\\n }\\n\\n }\\n\\n\\n\\n match next_event {\\n\\n Some(next_event) => break next_event,\\n\\n None => time_step += 1,\\n\\n }\\n\\n };\\n\",\n \"file_path\": \"necsim/impls/no-std/src/cogs/active_lineage_sampler/independent/event_time_sampler/poisson.rs\",\n \"rank\": 44,\n \"score\": 171953.0116464282\n },\n {\n \"content\": \"#[allow(clippy::inline_always, clippy::inline_fn_without_body)]\\n\\n#[contract_trait]\\n\\npub trait Decomposition<H: Habitat>: Backup + Sized + core::fmt::Debug {\\n\\n #[debug_ensures(\\n\\n ret < self.get_number_of_subdomains().get(),\\n\\n \\\"subdomain rank is in range [0, self.get_number_of_subdomains())\\\"\\n\\n )]\\n\\n fn get_subdomain_rank(&self) -> u32;\\n\\n\\n\\n fn get_number_of_subdomains(&self) -> NonZeroU32;\\n\\n\\n\\n #[debug_requires(\\n\\n habitat.contains(location),\\n\\n \\\"location is contained inside habitat\\\"\\n\\n )]\\n\\n #[debug_ensures(\\n\\n ret < self.get_number_of_subdomains().get(),\\n\\n \\\"subdomain rank is in range [0, self.get_number_of_subdomains())\\\"\\n\\n )]\\n\\n fn map_location_to_subdomain_rank(&self, location: &Location, habitat: &H) -> u32;\\n\\n}\\n\",\n \"file_path\": \"necsim/impls/no-std/src/decomposition/mod.rs\",\n \"rank\": 45,\n \"score\": 170211.02006680713\n },\n {\n \"content\": \"#[allow(clippy::type_complexity)]\\n\\npub fn simulate<\\n\\n H: Habitat,\\n\\n G: RngCore,\\n\\n R: LineageReference<H>,\\n\\n S: LocallyCoherentLineageStore<H, R>,\\n\\n D: DispersalSampler<H, G>,\\n\\n C: CoalescenceSampler<H, R, S>,\\n\\n T: TurnoverRate<H>,\\n\\n N: SpeciationProbability<H>,\\n\\n O: Decomposition<H>,\\n\\n E: EventSampler<H, G, R, S, DomainEmigrationExit<H, O>, D, C, T, N>,\\n\\n A: PeekableActiveLineageSampler<\\n\\n H,\\n\\n G,\\n\\n R,\\n\\n S,\\n\\n DomainEmigrationExit<H, O>,\\n\\n D,\\n\\n C,\\n\\n T,\\n\",\n \"file_path\": \"necsim/impls/no-std/src/parallelisation/monolithic/lockstep.rs\",\n \"rank\": 46,\n \"score\": 168656.1177188762\n },\n {\n \"content\": \"#[allow(clippy::type_complexity)]\\n\\npub fn simulate<\\n\\n H: Habitat,\\n\\n G: RngCore,\\n\\n R: LineageReference<H>,\\n\\n S: LocallyCoherentLineageStore<H, R>,\\n\\n D: DispersalSampler<H, G>,\\n\\n C: CoalescenceSampler<H, R, S>,\\n\\n T: TurnoverRate<H>,\\n\\n N: SpeciationProbability<H>,\\n\\n O: Decomposition<H>,\\n\\n E: EventSampler<H, G, R, S, DomainEmigrationExit<H, O>, D, C, T, N>,\\n\\n A: PeekableActiveLineageSampler<\\n\\n H,\\n\\n G,\\n\\n R,\\n\\n S,\\n\\n DomainEmigrationExit<H, O>,\\n\\n D,\\n\\n C,\\n\\n T,\\n\",\n \"file_path\": \"necsim/impls/no-std/src/parallelisation/monolithic/averaging.rs\",\n \"rank\": 47,\n \"score\": 168656.1177188762\n },\n {\n \"content\": \"#[allow(clippy::type_complexity)]\\n\\npub fn simulate<\\n\\n H: Habitat,\\n\\n G: RngCore,\\n\\n R: LineageReference<H>,\\n\\n S: LocallyCoherentLineageStore<H, R>,\\n\\n D: DispersalSampler<H, G>,\\n\\n C: CoalescenceSampler<H, R, S>,\\n\\n T: TurnoverRate<H>,\\n\\n N: SpeciationProbability<H>,\\n\\n O: Decomposition<H>,\\n\\n E: EventSampler<H, G, R, S, DomainEmigrationExit<H, O>, D, C, T, N>,\\n\\n A: PeekableActiveLineageSampler<\\n\\n H,\\n\\n G,\\n\\n R,\\n\\n S,\\n\\n DomainEmigrationExit<H, O>,\\n\\n D,\\n\\n C,\\n\\n T,\\n\",\n \"file_path\": \"necsim/impls/no-std/src/parallelisation/monolithic/optimistic.rs\",\n \"rank\": 48,\n \"score\": 168656.1177188762\n },\n {\n \"content\": \"#[allow(clippy::type_complexity)]\\n\\npub fn simulate<\\n\\n H: Habitat,\\n\\n C: Decomposition<H>,\\n\\n E: EmigrationChoice<H>,\\n\\n G: PrimeableRng,\\n\\n D: DispersalSampler<H, G>,\\n\\n T: TurnoverRate<H>,\\n\\n N: SpeciationProbability<H>,\\n\\n J: EventTimeSampler<H, G, T>,\\n\\n R: Reporter,\\n\\n P: LocalPartition<R>,\\n\\n>(\\n\\n mut simulation: Simulation<\\n\\n H,\\n\\n G,\\n\\n GlobalLineageReference,\\n\\n IndependentLineageStore<H>,\\n\\n IndependentEmigrationExit<H, C, E>,\\n\\n D,\\n\\n IndependentCoalescenceSampler<H>,\\n\",\n \"file_path\": \"necsim/impls/no-std/src/parallelisation/independent/landscape.rs\",\n \"rank\": 49,\n \"score\": 168656.1177188762\n },\n {\n \"content\": \"#[allow(clippy::type_complexity)]\\n\\npub fn simulate<\\n\\n H: Habitat,\\n\\n G: RngCore,\\n\\n R: LineageReference<H>,\\n\\n S: LocallyCoherentLineageStore<H, R>,\\n\\n D: DispersalSampler<H, G>,\\n\\n C: CoalescenceSampler<H, R, S>,\\n\\n T: TurnoverRate<H>,\\n\\n N: SpeciationProbability<H>,\\n\\n E: EventSampler<H, G, R, S, NeverEmigrationExit, D, C, T, N>,\\n\\n A: ActiveLineageSampler<H, G, R, S, NeverEmigrationExit, D, C, T, N, E, NeverImmigrationEntry>,\\n\\n P: Reporter,\\n\\n L: LocalPartition<P>,\\n\\n>(\\n\\n simulation: Simulation<\\n\\n H,\\n\\n G,\\n\\n R,\\n\\n S,\\n\\n NeverEmigrationExit,\\n\",\n \"file_path\": \"necsim/impls/no-std/src/parallelisation/monolithic/monolithic.rs\",\n \"rank\": 50,\n \"score\": 168656.1177188762\n },\n {\n \"content\": \"#[allow(clippy::type_complexity)]\\n\\npub fn simulate<\\n\\n H: Habitat,\\n\\n G: PrimeableRng,\\n\\n D: DispersalSampler<H, G>,\\n\\n T: TurnoverRate<H>,\\n\\n N: SpeciationProbability<H>,\\n\\n J: EventTimeSampler<H, G, T>,\\n\\n R: Reporter,\\n\\n P: LocalPartition<R>,\\n\\n>(\\n\\n mut simulation: Simulation<\\n\\n H,\\n\\n G,\\n\\n GlobalLineageReference,\\n\\n IndependentLineageStore<H>,\\n\\n NeverEmigrationExit,\\n\\n D,\\n\\n IndependentCoalescenceSampler<H>,\\n\\n T,\\n\\n N,\\n\",\n \"file_path\": \"necsim/impls/no-std/src/parallelisation/independent/individuals.rs\",\n \"rank\": 51,\n \"score\": 168656.1177188762\n },\n {\n \"content\": \"#[allow(clippy::type_complexity)]\\n\\npub fn simulate<\\n\\n H: Habitat,\\n\\n G: RngCore,\\n\\n R: LineageReference<H>,\\n\\n S: LocallyCoherentLineageStore<H, R>,\\n\\n D: DispersalSampler<H, G>,\\n\\n C: CoalescenceSampler<H, R, S>,\\n\\n T: TurnoverRate<H>,\\n\\n N: SpeciationProbability<H>,\\n\\n O: Decomposition<H>,\\n\\n E: EventSampler<H, G, R, S, DomainEmigrationExit<H, O>, D, C, T, N>,\\n\\n A: PeekableActiveLineageSampler<\\n\\n H,\\n\\n G,\\n\\n R,\\n\\n S,\\n\\n DomainEmigrationExit<H, O>,\\n\\n D,\\n\\n C,\\n\\n T,\\n\",\n \"file_path\": \"necsim/impls/no-std/src/parallelisation/monolithic/optimistic_lockstep.rs\",\n \"rank\": 52,\n \"score\": 165887.07077579093\n },\n {\n \"content\": \"#[allow(clippy::type_complexity, clippy::too_many_lines)]\\n\\npub fn simulate<\\n\\n H: Habitat,\\n\\n G: PrimeableRng,\\n\\n D: DispersalSampler<H, G>,\\n\\n T: TurnoverRate<H>,\\n\\n N: SpeciationProbability<H>,\\n\\n J: EventTimeSampler<H, G, T>,\\n\\n R: Reporter,\\n\\n P: LocalPartition<R>,\\n\\n>(\\n\\n mut simulation: Simulation<\\n\\n H,\\n\\n G,\\n\\n GlobalLineageReference,\\n\\n IndependentLineageStore<H>,\\n\\n NeverEmigrationExit,\\n\\n D,\\n\\n IndependentCoalescenceSampler<H>,\\n\\n T,\\n\\n N,\\n\",\n \"file_path\": \"necsim/impls/no-std/src/parallelisation/independent/monolithic/mod.rs\",\n \"rank\": 53,\n \"score\": 165887.07077579093\n },\n {\n \"content\": \"#[test]\\n\\nfn test_get_mut() -> Result<(), Error> {\\n\\n let rows = vec![vec![1, 2, 3], vec![4, 5, 6]];\\n\\n let mut array = Array2D::from_rows(&rows)?;\\n\\n let (set_row, set_column) = (0, 2);\\n\\n let element = 53;\\n\\n let element_ref_option = array.get_mut(set_row, set_column);\\n\\n assert!(element_ref_option.is_some());\\n\\n let element_ref = element_ref_option.unwrap();\\n\\n assert_eq!(element_ref, &rows[set_row][set_column]);\\n\\n *element_ref = element;\\n\\n assert_eq!(element_ref, &element);\\n\\n for row in 0..rows.len() {\\n\\n for column in 0..rows[0].len() {\\n\\n let actual = array.get(row, column);\\n\\n if (row, column) == (set_row, set_column) {\\n\\n assert_eq!(actual, Some(&element));\\n\\n } else {\\n\\n assert_eq!(actual, Some(&rows[row][column]));\\n\\n }\\n\\n }\\n\\n }\\n\\n Ok(())\\n\\n}\\n\\n\\n\",\n \"file_path\": \"third-party/array2d-no-std/tests/array2d.rs\",\n \"rank\": 54,\n \"score\": 162551.27292061478\n },\n {\n \"content\": \"#[test]\\n\\nfn test_get_mut_column_major() -> Result<(), Error> {\\n\\n let rows = vec![vec![1, 2, 3], vec![4, 5, 6]];\\n\\n let mut array = Array2D::from_rows(&rows)?;\\n\\n assert_eq!(array.get_mut_column_major(0), Some(&mut 1));\\n\\n assert_eq!(array.get_mut_column_major(1), Some(&mut 4));\\n\\n assert_eq!(array.get_mut_column_major(2), Some(&mut 2));\\n\\n assert_eq!(array.get_mut_column_major(3), Some(&mut 5));\\n\\n assert_eq!(array.get_mut_column_major(4), Some(&mut 3));\\n\\n assert_eq!(array.get_mut_column_major(5), Some(&mut 6));\\n\\n assert_eq!(array.get_mut_column_major(6), None);\\n\\n Ok(())\\n\\n}\\n\\n\\n\",\n \"file_path\": \"third-party/array2d-no-std/tests/array2d.rs\",\n \"rank\": 55,\n \"score\": 157469.97816723847\n },\n {\n \"content\": \"#[test]\\n\\nfn test_get_mut_row_major() -> Result<(), Error> {\\n\\n let rows = vec![vec![1, 2, 3], vec![4, 5, 6]];\\n\\n let mut array = Array2D::from_rows(&rows)?;\\n\\n assert_eq!(array.get_mut_row_major(0), Some(&mut 1));\\n\\n assert_eq!(array.get_mut_row_major(1), Some(&mut 2));\\n\\n assert_eq!(array.get_mut_row_major(2), Some(&mut 3));\\n\\n assert_eq!(array.get_mut_row_major(3), Some(&mut 4));\\n\\n assert_eq!(array.get_mut_row_major(4), Some(&mut 5));\\n\\n assert_eq!(array.get_mut_row_major(5), Some(&mut 6));\\n\\n assert_eq!(array.get_mut_row_major(6), None);\\n\\n Ok(())\\n\\n}\\n\\n\\n\",\n \"file_path\": \"third-party/array2d-no-std/tests/array2d.rs\",\n \"rank\": 56,\n \"score\": 157469.97816723847\n },\n {\n \"content\": \"\\n\\nimpl<R: RngCore> RngCore for CudaRng<R> {\\n\\n type Seed = <R as RngCore>::Seed;\\n\\n\\n\\n #[must_use]\\n\\n #[inline]\\n\\n fn from_seed(seed: Self::Seed) -> Self {\\n\\n Self(R::from_seed(seed))\\n\\n }\\n\\n\\n\\n #[must_use]\\n\\n #[inline]\\n\\n fn sample_u64(&mut self) -> u64 {\\n\\n self.0.sample_u64()\\n\\n }\\n\\n}\\n\\n\\n\\nimpl<R: PrimeableRng> PrimeableRng for CudaRng<R> {\\n\\n #[inline]\\n\\n fn prime_with(&mut self, location_index: u64, time_index: u64) {\\n\\n self.0.prime_with(location_index, time_index);\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"necsim/impls/cuda/src/cogs/rng.rs\",\n \"rank\": 57,\n \"score\": 148057.40441539654\n },\n {\n \"content\": \"use necsim_core::cogs::{Backup, PrimeableRng, RngCore};\\n\\n\\n\\n#[allow(clippy::module_name_repetitions)]\\n\\n#[derive(Clone, Debug, rust_cuda::common::RustToCuda, rust_cuda::host::LendToCuda)]\\n\\npub struct CudaRng<R: RngCore>(R);\\n\\n\\n\\nimpl<R: RngCore> From<R> for CudaRng<R> {\\n\\n #[must_use]\\n\\n #[inline]\\n\\n fn from(rng: R) -> Self {\\n\\n Self(rng)\\n\\n }\\n\\n}\\n\\n\\n\\n#[contract_trait]\\n\\nimpl<R: RngCore> Backup for CudaRng<R> {\\n\\n unsafe fn backup_unchecked(&self) -> Self {\\n\\n self.clone()\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"necsim/impls/cuda/src/cogs/rng.rs\",\n \"rank\": 58,\n \"score\": 148045.911438923\n },\n {\n \"content\": \"pub fn swap_field_type_and_get_cuda_repr_ty(field: &mut syn::Field) -> Option<CudaReprFieldTy> {\\n\\n let mut cuda_repr_field_ty: Option<CudaReprFieldTy> = None;\\n\\n let mut field_ty = field.ty.clone();\\n\\n\\n\\n // Helper attribute `r2c` must be filtered out inside cuda representation\\n\\n field.attrs.retain(|attr| match attr.path.get_ident() {\\n\\n Some(ident) if cuda_repr_field_ty.is_none() && format!(\\\"{}\\\", ident) == \\\"r2cEmbed\\\" => {\\n\\n // Allow the shorthand `#[r2cEmbed]` which uses the field type\\n\\n // as well as the explicit `#[r2cEmbed(ty)]` which overwrites the type\\n\\n let attribute_str = if attr.tokens.is_empty() {\\n\\n format!(\\\"({})\\\", quote! { #field_ty })\\n\\n } else {\\n\\n format!(\\\"{}\\\", attr.tokens)\\n\\n };\\n\\n\\n\\n if let Some(slice_type) = attribute_str\\n\\n .strip_prefix(\\\"(Box < [\\\")\\n\\n .and_then(|rest| rest.strip_suffix(\\\"] >)\\\"))\\n\\n {\\n\\n // Check for the special case of a boxed slice: `Box<ty>`\\n\",\n \"file_path\": \"rust-cuda/rust-cuda-derive/src/rust_to_cuda/field_ty.rs\",\n \"rank\": 59,\n \"score\": 146884.56420488542\n },\n {\n \"content\": \" + u64::from(indexed_location.index())\\n\\n }\\n\\n}\\n\\n\\n\\nimpl InMemoryHabitat {\\n\\n #[must_use]\\n\\n #[debug_ensures(\\n\\n old(habitat.num_columns()) == ret.get_extent().width() as usize &&\\n\\n old(habitat.num_rows()) == ret.get_extent().height() as usize,\\n\\n \\\"habitat extent has the dimension of the habitat array\\\"\\n\\n )]\\n\\n pub fn new(habitat: Array2D<u32>) -> Self {\\n\\n #[allow(clippy::cast_possible_truncation)]\\n\\n let width: u32 = habitat.num_columns() as u32;\\n\\n #[allow(clippy::cast_possible_truncation)]\\n\\n let height: u32 = habitat.num_rows() as u32;\\n\\n\\n\\n let habitat = habitat.into_row_major().into_boxed_slice();\\n\\n\\n\\n let mut index_acc = 0_u64;\\n\",\n \"file_path\": \"necsim/impls/no-std/src/cogs/habitat/in_memory.rs\",\n \"rank\": 60,\n \"score\": 144932.2197225219\n },\n {\n \"content\": \" self.habitat.iter().map(|x| u64::from(*x)).sum()\\n\\n }\\n\\n\\n\\n #[must_use]\\n\\n fn get_habitat_at_location(&self, location: &Location) -> u32 {\\n\\n self.habitat\\n\\n .get((location.y() as usize) * (self.extent.width() as usize) + (location.x() as usize))\\n\\n .copied()\\n\\n .unwrap_or(0)\\n\\n }\\n\\n\\n\\n #[must_use]\\n\\n fn map_indexed_location_to_u64_injective(&self, indexed_location: &IndexedLocation) -> u64 {\\n\\n self.u64_injection\\n\\n .get(\\n\\n (indexed_location.location().y() as usize) * (self.extent.width() as usize)\\n\\n + (indexed_location.location().x() as usize),\\n\\n )\\n\\n .copied()\\n\\n .unwrap_or(0)\\n\",\n \"file_path\": \"necsim/impls/no-std/src/cogs/habitat/in_memory.rs\",\n \"rank\": 61,\n \"score\": 144928.87886186413\n },\n {\n \"content\": \"#[contract_trait]\\n\\nimpl Backup for InMemoryHabitat {\\n\\n unsafe fn backup_unchecked(&self) -> Self {\\n\\n Self {\\n\\n habitat: self.habitat.clone(),\\n\\n u64_injection: self.u64_injection.clone(),\\n\\n extent: self.extent.clone(),\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\n#[contract_trait]\\n\\nimpl Habitat for InMemoryHabitat {\\n\\n #[must_use]\\n\\n fn get_extent(&self) -> &LandscapeExtent {\\n\\n &self.extent\\n\\n }\\n\\n\\n\\n #[must_use]\\n\\n fn get_total_habitat(&self) -> u64 {\\n\",\n \"file_path\": \"necsim/impls/no-std/src/cogs/habitat/in_memory.rs\",\n \"rank\": 62,\n \"score\": 144926.66516167158\n },\n {\n \"content\": \"use array2d::Array2D;\\n\\n\\n\\nuse alloc::{boxed::Box, vec::Vec};\\n\\n\\n\\nuse necsim_core::{\\n\\n cogs::{Backup, Habitat},\\n\\n landscape::{IndexedLocation, LandscapeExtent, Location},\\n\\n};\\n\\n\\n\\n#[allow(clippy::module_name_repetitions)]\\n\\n#[cfg_attr(feature = \\\"cuda\\\", derive(rust_cuda::common::RustToCuda))]\\n\\n#[derive(Debug)]\\n\\npub struct InMemoryHabitat {\\n\\n #[cfg_attr(feature = \\\"cuda\\\", r2cEmbed)]\\n\\n habitat: Box<[u32]>,\\n\\n #[cfg_attr(feature = \\\"cuda\\\", r2cEmbed)]\\n\\n u64_injection: Box<[u64]>,\\n\\n extent: LandscapeExtent,\\n\\n}\\n\\n\\n\",\n \"file_path\": \"necsim/impls/no-std/src/cogs/habitat/in_memory.rs\",\n \"rank\": 63,\n \"score\": 144918.19985295972\n },\n {\n \"content\": \"use std::fmt;\\n\\n\\n\\nuse pcg_rand::{seeds::PcgSeeder, Pcg64};\\n\\nuse rand::{RngCore as _, SeedableRng};\\n\\n\\n\\nuse necsim_core::cogs::{Backup, RngCore, SplittableRng};\\n\\n\\n\\n#[allow(clippy::module_name_repetitions)]\\n\\npub struct Pcg(Pcg64);\\n\\n\\n\\nimpl Clone for Pcg {\\n\\n fn clone(&self) -> Self {\\n\\n Self(Pcg64::restore_state_with_no_verification(\\n\\n self.0.get_state(),\\n\\n ))\\n\\n }\\n\\n}\\n\\n\\n\\nimpl fmt::Debug for Pcg {\\n\\n fn fmt(&self, fmt: &mut fmt::Formatter) -> fmt::Result {\\n\",\n \"file_path\": \"necsim/impls/std/src/cogs/rng/pcg.rs\",\n \"rank\": 64,\n \"score\": 144916.0468425837\n },\n {\n \"content\": \" #[inline]\\n\\n fn from_seed(seed: Self::Seed) -> Self {\\n\\n let seed = u64::from_le_bytes(seed);\\n\\n\\n\\n Self { seed, state: seed }\\n\\n }\\n\\n\\n\\n #[must_use]\\n\\n #[inline]\\n\\n fn sample_u64(&mut self) -> u64 {\\n\\n self.state = xxhash_rust::xxh64::xxh64(&self.state.to_le_bytes(), self.seed);\\n\\n self.state\\n\\n }\\n\\n}\\n\\n\\n\\nimpl PrimeableRng for XxHash {\\n\\n fn prime_with(&mut self, location_index: u64, time_index: u64) {\\n\\n let location_bytes = location_index.to_le_bytes();\\n\\n\\n\\n let time_index_bytes = time_index.to_le_bytes();\\n\",\n \"file_path\": \"necsim/impls/no-std/src/cogs/rng/xxhash.rs\",\n \"rank\": 65,\n \"score\": 144915.57421472372\n },\n {\n \"content\": \"use rand::{rngs::StdRng as StdRngImpl, RngCore, SeedableRng};\\n\\n\\n\\n#[allow(clippy::module_name_repetitions)]\\n\\n#[derive(Clone, Debug)]\\n\\npub struct StdRng(StdRngImpl);\\n\\n\\n\\n#[contract_trait]\\n\\nimpl necsim_core::cogs::Backup for StdRng {\\n\\n unsafe fn backup_unchecked(&self) -> Self {\\n\\n self.clone()\\n\\n }\\n\\n}\\n\\n\\n\\nimpl necsim_core::cogs::RngCore for StdRng {\\n\\n type Seed = <StdRngImpl as SeedableRng>::Seed;\\n\\n\\n\\n #[must_use]\\n\\n #[inline]\\n\\n fn from_seed(seed: Self::Seed) -> Self {\\n\\n Self(StdRngImpl::from_seed(seed))\\n\\n }\\n\\n\\n\\n #[must_use]\\n\\n #[inline]\\n\\n fn sample_u64(&mut self) -> u64 {\\n\\n self.0.next_u64()\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"necsim/impls/std/src/cogs/rng/std.rs\",\n \"rank\": 66,\n \"score\": 144914.44770878018\n },\n {\n \"content\": \"use necsim_core::cogs::{Backup, PrimeableRng, RngCore};\\n\\n\\n\\n#[allow(clippy::module_name_repetitions)]\\n\\n#[derive(Clone, Debug)]\\n\\npub struct SeaHash {\\n\\n seed: u64,\\n\\n location: u64,\\n\\n time: u64,\\n\\n offset: u64,\\n\\n}\\n\\n\\n\\n#[contract_trait]\\n\\nimpl Backup for SeaHash {\\n\\n unsafe fn backup_unchecked(&self) -> Self {\\n\\n self.clone()\\n\\n }\\n\\n}\\n\\n\\n\\nimpl RngCore for SeaHash {\\n\\n type Seed = [u8; 8];\\n\",\n \"file_path\": \"necsim/impls/no-std/src/cogs/rng/seahash.rs\",\n \"rank\": 67,\n \"score\": 144914.06964981044\n },\n {\n \"content\": \"use necsim_core::cogs::{Backup, PrimeableRng, RngCore};\\n\\n\\n\\n#[allow(clippy::module_name_repetitions)]\\n\\n#[derive(Clone, Debug)]\\n\\npub struct FixedSeaHash {\\n\\n seed: u64,\\n\\n location_index: u64,\\n\\n time_index: u64,\\n\\n state: u64,\\n\\n}\\n\\n\\n\\n#[contract_trait]\\n\\nimpl Backup for FixedSeaHash {\\n\\n unsafe fn backup_unchecked(&self) -> Self {\\n\\n self.clone()\\n\\n }\\n\\n}\\n\\n\\n\\nimpl RngCore for FixedSeaHash {\\n\\n type Seed = [u8; 8];\\n\",\n \"file_path\": \"necsim/impls/no-std/src/cogs/rng/fixedseahash.rs\",\n \"rank\": 68,\n \"score\": 144913.21340597654\n },\n {\n \"content\": \" self.state\\n\\n }\\n\\n}\\n\\n\\n\\nimpl PrimeableRng for FixedSeaHash {\\n\\n #[inline]\\n\\n fn prime_with(&mut self, location_index: u64, time_index: u64) {\\n\\n self.location_index = location_index;\\n\\n self.time_index = time_index;\\n\\n\\n\\n self.state = 0_u64;\\n\\n }\\n\\n}\\n\\n\\n\\n// https://docs.rs/seahash/4.0.1/src/seahash/helper.rs.html#72-89\\n\\n#[inline]\\n\\nconst fn diffuse(mut x: u64) -> u64 {\\n\\n // These are derived from the PCG RNG's round. Thanks to @Veedrac for proposing\\n\\n // this. The basic idea is that we use dynamic shifts, which are determined\\n\\n // by the input itself. The shift is chosen by the higher bits, which means\\n\",\n \"file_path\": \"necsim/impls/no-std/src/cogs/rng/fixedseahash.rs\",\n \"rank\": 69,\n \"score\": 144910.9935320072\n },\n {\n \"content\": \" )))\\n\\n }\\n\\n\\n\\n #[must_use]\\n\\n #[inline]\\n\\n fn sample_u64(&mut self) -> u64 {\\n\\n self.0.next_u64()\\n\\n }\\n\\n}\\n\\n\\n\\nimpl SplittableRng for Pcg {\\n\\n #[allow(clippy::identity_op)]\\n\\n fn split(self) -> (Self, Self) {\\n\\n let mut left_state = self.0.get_state();\\n\\n left_state.increment = (((left_state.increment >> 1) * 2 + 0) << 1) | 1;\\n\\n\\n\\n let mut right_state = self.0.get_state();\\n\\n right_state.increment = (((right_state.increment >> 1) * 2 + 1) << 1) | 1;\\n\\n\\n\\n let left = Self(Pcg64::restore_state_with_no_verification(left_state));\\n\",\n \"file_path\": \"necsim/impls/std/src/cogs/rng/pcg.rs\",\n \"rank\": 70,\n \"score\": 144910.69702167273\n },\n {\n \"content\": \" }\\n\\n}\\n\\n\\n\\nimpl PrimeableRng for SeaHash {\\n\\n fn prime_with(&mut self, location_index: u64, time_index: u64) {\\n\\n self.location = location_index;\\n\\n self.time = time_index;\\n\\n\\n\\n self.offset = 0_u64;\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"necsim/impls/no-std/src/cogs/rng/seahash.rs\",\n \"rank\": 71,\n \"score\": 144909.54171316922\n },\n {\n \"content\": \"\\n\\n #[must_use]\\n\\n #[inline]\\n\\n fn from_seed(seed: Self::Seed) -> Self {\\n\\n let seed = u64::from_le_bytes(seed);\\n\\n\\n\\n Self {\\n\\n seed,\\n\\n location_index: 0_u64,\\n\\n time_index: 0_u64,\\n\\n state: seed,\\n\\n }\\n\\n }\\n\\n\\n\\n #[must_use]\\n\\n #[inline]\\n\\n fn sample_u64(&mut self) -> u64 {\\n\\n self.state =\\n\\n diffuse(diffuse(self.state ^ self.location_index) ^ self.time_index) ^ self.seed;\\n\\n\\n\",\n \"file_path\": \"necsim/impls/no-std/src/cogs/rng/fixedseahash.rs\",\n \"rank\": 72,\n \"score\": 144908.64717733455\n },\n {\n \"content\": \"\\n\\n let u64_injection = habitat\\n\\n .iter()\\n\\n .map(|h| {\\n\\n let injection = index_acc;\\n\\n index_acc += u64::from(*h);\\n\\n injection\\n\\n })\\n\\n .collect::<Vec<u64>>()\\n\\n .into_boxed_slice();\\n\\n\\n\\n #[allow(clippy::cast_possible_truncation)]\\n\\n let extent = LandscapeExtent::new(0, 0, width, height);\\n\\n\\n\\n Self {\\n\\n habitat,\\n\\n u64_injection,\\n\\n extent,\\n\\n }\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"necsim/impls/no-std/src/cogs/habitat/in_memory.rs\",\n \"rank\": 73,\n \"score\": 144908.3475087032\n },\n {\n \"content\": \"\\n\\n #[must_use]\\n\\n #[inline]\\n\\n fn from_seed(seed: Self::Seed) -> Self {\\n\\n let seed = u64::from_le_bytes(seed);\\n\\n\\n\\n Self {\\n\\n seed,\\n\\n location: 0_u64,\\n\\n time: 0_u64,\\n\\n offset: 0_u64,\\n\\n }\\n\\n }\\n\\n\\n\\n #[must_use]\\n\\n #[inline]\\n\\n fn sample_u64(&mut self) -> u64 {\\n\\n let offset_bytes = self.offset.to_le_bytes();\\n\\n self.offset += 1;\\n\\n seahash::hash_seeded(&offset_bytes, self.time, self.location, self.seed, 0_u64)\\n\",\n \"file_path\": \"necsim/impls/no-std/src/cogs/rng/seahash.rs\",\n \"rank\": 74,\n \"score\": 144908.181119127\n },\n {\n \"content\": \"use nanorand::{Rng, WyRand as WyImpl};\\n\\n\\n\\nuse necsim_core::cogs::{Backup, RngCore};\\n\\n\\n\\n#[allow(clippy::module_name_repetitions)]\\n\\n#[derive(Clone)]\\n\\npub struct WyRand(WyImpl);\\n\\n\\n\\n#[contract_trait]\\n\\nimpl Backup for WyRand {\\n\\n unsafe fn backup_unchecked(&self) -> Self {\\n\\n self.clone()\\n\\n }\\n\\n}\\n\\n\\n\\nimpl RngCore for WyRand {\\n\\n type Seed = [u8; 8];\\n\\n\\n\\n #[must_use]\\n\\n #[inline]\\n\",\n \"file_path\": \"necsim/impls/no-std/src/cogs/rng/wyrand.rs\",\n \"rank\": 75,\n \"score\": 144908.19223324783\n },\n {\n \"content\": \"}\\n\\n\\n\\nimpl RngCore for AesRng {\\n\\n type Seed = [u8; 16];\\n\\n\\n\\n #[must_use]\\n\\n #[inline]\\n\\n fn from_seed(seed: Self::Seed) -> Self {\\n\\n Self {\\n\\n cipher: Aes128::new(GenericArray::from_slice(&seed)),\\n\\n state: [0_u8; 16],\\n\\n cached: false,\\n\\n }\\n\\n }\\n\\n\\n\\n #[must_use]\\n\\n #[inline]\\n\\n fn sample_u64(&mut self) -> u64 {\\n\\n self.cached ^= true;\\n\\n\\n\",\n \"file_path\": \"necsim/impls/no-std/src/cogs/rng/aes.rs\",\n \"rank\": 76,\n \"score\": 144907.71244161902\n },\n {\n \"content\": \" self.state[10],\\n\\n self.state[11],\\n\\n self.state[12],\\n\\n self.state[13],\\n\\n self.state[14],\\n\\n self.state[15],\\n\\n ]);\\n\\n\\n\\n self.state[9] = self.state[9].wrapping_add(1);\\n\\n\\n\\n rand_u64\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\nimpl PrimeableRng for AesRng {\\n\\n fn prime_with(&mut self, location_index: u64, time_index: u64) {\\n\\n let location_bytes = location_index.to_le_bytes();\\n\\n\\n\\n self.state[0] = location_bytes[0];\\n\",\n \"file_path\": \"necsim/impls/no-std/src/cogs/rng/aes.rs\",\n \"rank\": 77,\n \"score\": 144907.43390587904\n },\n {\n \"content\": \"use necsim_core::cogs::{Backup, PrimeableRng, RngCore};\\n\\n\\n\\n#[allow(clippy::module_name_repetitions)]\\n\\n#[derive(Clone, Debug)]\\n\\npub struct XxHash {\\n\\n seed: u64,\\n\\n state: u64,\\n\\n}\\n\\n\\n\\n#[contract_trait]\\n\\nimpl Backup for XxHash {\\n\\n unsafe fn backup_unchecked(&self) -> Self {\\n\\n self.clone()\\n\\n }\\n\\n}\\n\\n\\n\\nimpl RngCore for XxHash {\\n\\n type Seed = [u8; 8];\\n\\n\\n\\n #[must_use]\\n\",\n \"file_path\": \"necsim/impls/no-std/src/cogs/rng/xxhash.rs\",\n \"rank\": 78,\n \"score\": 144907.04563364421\n },\n {\n \"content\": \"use necsim_core::cogs::{Backup, PrimeableRng, RngCore};\\n\\n\\n\\nuse aes::{\\n\\n cipher::{generic_array::GenericArray, BlockEncrypt, NewBlockCipher},\\n\\n Aes128,\\n\\n};\\n\\n\\n\\n#[allow(clippy::module_name_repetitions)]\\n\\n#[derive(Clone, Debug)]\\n\\npub struct AesRng {\\n\\n cipher: Aes128,\\n\\n state: [u8; 16],\\n\\n cached: bool,\\n\\n}\\n\\n\\n\\n#[contract_trait]\\n\\nimpl Backup for AesRng {\\n\\n unsafe fn backup_unchecked(&self) -> Self {\\n\\n self.clone()\\n\\n }\\n\",\n \"file_path\": \"necsim/impls/no-std/src/cogs/rng/aes.rs\",\n \"rank\": 79,\n \"score\": 144905.47660866327\n },\n {\n \"content\": \" }\\n\\n}\\n\\n\\n\\nimpl RngCore for WyHash {\\n\\n type Seed = [u8; 8];\\n\\n\\n\\n #[must_use]\\n\\n #[inline]\\n\\n fn from_seed(seed: Self::Seed) -> Self {\\n\\n let seed = u64::from_le_bytes(seed);\\n\\n\\n\\n Self { seed, state: seed }\\n\\n }\\n\\n\\n\\n #[must_use]\\n\\n #[inline]\\n\\n fn sample_u64(&mut self) -> u64 {\\n\\n // wyrng state transition function\\n\\n // https://docs.rs/wyhash/0.5.0/src/wyhash/functions.rs.html#129-132\\n\\n self.state = self.state.wrapping_add(P0);\\n\",\n \"file_path\": \"necsim/impls/no-std/src/cogs/rng/wyhash.rs\",\n \"rank\": 80,\n \"score\": 144904.90404775305\n },\n {\n \"content\": \"\\n\\n // wyrng output function\\n\\n let wyrng = wymum(self.state ^ P1, self.state);\\n\\n\\n\\n // SeaHash diffusion function for better avalanching\\n\\n seahash_diffuse(wyrng)\\n\\n }\\n\\n}\\n\\n\\n\\nimpl PrimeableRng for WyHash {\\n\\n #[inline]\\n\\n fn prime_with(&mut self, location_index: u64, time_index: u64) {\\n\\n let location_index = seahash_diffuse(location_index);\\n\\n let time_index = seahash_diffuse(time_index);\\n\\n\\n\\n // wyhash state repriming\\n\\n // https://docs.rs/wyhash/0.5.0/src/wyhash/functions.rs.html#67-70\\n\\n let hash = wymum(\\n\\n ((location_index << 32) | (location_index >> 32)) ^ (self.seed ^ P0),\\n\\n ((time_index << 32) | (time_index >> 32)) ^ P2,\\n\\n );\\n\\n\\n\\n self.state = wymum(hash, 16 ^ P5);\\n\\n }\\n\\n}\\n\\n\\n\\n#[inline]\\n\\n#[allow(clippy::cast_possible_truncation)]\\n\",\n \"file_path\": \"necsim/impls/no-std/src/cogs/rng/wyhash.rs\",\n \"rank\": 81,\n \"score\": 144904.42844605717\n },\n {\n \"content\": \" fn from_seed(seed: Self::Seed) -> Self {\\n\\n Self(WyImpl::new_seed(u64::from_le_bytes(seed)))\\n\\n }\\n\\n\\n\\n #[must_use]\\n\\n #[inline]\\n\\n fn sample_u64(&mut self) -> u64 {\\n\\n self.0.generate()\\n\\n }\\n\\n}\\n\\n\\n\\nimpl core::fmt::Debug for WyRand {\\n\\n fn fmt(&self, f: &mut core::fmt::Formatter) -> core::fmt::Result {\\n\\n f.debug_struct(\\\"WyRand\\\").finish_non_exhaustive()\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"necsim/impls/no-std/src/cogs/rng/wyrand.rs\",\n \"rank\": 82,\n \"score\": 144902.55701734766\n },\n {\n \"content\": \" fmt.debug_struct(\\\"Pcg\\\").finish()\\n\\n }\\n\\n}\\n\\n\\n\\n#[contract_trait]\\n\\nimpl Backup for Pcg {\\n\\n unsafe fn backup_unchecked(&self) -> Self {\\n\\n self.clone()\\n\\n }\\n\\n}\\n\\n\\n\\nimpl RngCore for Pcg {\\n\\n type Seed = [u8; 16];\\n\\n\\n\\n #[must_use]\\n\\n #[inline]\\n\\n fn from_seed(seed: Self::Seed) -> Self {\\n\\n Self(Pcg64::from_seed(PcgSeeder::seed_with_stream(\\n\\n u128::from_le_bytes(seed),\\n\\n 0_u128,\\n\",\n \"file_path\": \"necsim/impls/std/src/cogs/rng/pcg.rs\",\n \"rank\": 83,\n \"score\": 144902.0537037954\n },\n {\n \"content\": \"use necsim_core::cogs::{Backup, PrimeableRng, RngCore};\\n\\n\\n\\n// WyHash constants\\n\\n// https://docs.rs/wyhash/0.5.0/src/wyhash/functions.rs.html\\n\\nconst P0: u64 = 0xa076_1d64_78bd_642f;\\n\\nconst P1: u64 = 0xe703_7ed1_a0b4_28db;\\n\\nconst P2: u64 = 0x8ebc_6af0_9c88_c6e3;\\n\\nconst P5: u64 = 0xeb44_acca_b455_d165;\\n\\n\\n\\n#[allow(clippy::module_name_repetitions)]\\n\\n#[derive(Clone, Debug)]\\n\\npub struct WyHash {\\n\\n seed: u64,\\n\\n state: u64,\\n\\n}\\n\\n\\n\\n#[contract_trait]\\n\\nimpl Backup for WyHash {\\n\\n unsafe fn backup_unchecked(&self) -> Self {\\n\\n self.clone()\\n\",\n \"file_path\": \"necsim/impls/no-std/src/cogs/rng/wyhash.rs\",\n \"rank\": 84,\n \"score\": 144901.08527354262\n },\n {\n \"content\": \"pub mod almost_infinite;\\n\\npub mod in_memory;\\n\\npub mod non_spatial;\\n\\npub mod spatially_implicit;\\n\",\n \"file_path\": \"necsim/impls/no-std/src/cogs/habitat/mod.rs\",\n \"rank\": 85,\n \"score\": 144898.11471028894\n },\n {\n \"content\": \" let right = Self(Pcg64::restore_state_with_no_verification(right_state));\\n\\n\\n\\n (left, right)\\n\\n }\\n\\n\\n\\n fn split_to_stream(self, stream: u64) -> Self {\\n\\n let mut state = self.0.get_state();\\n\\n state.increment = (u128::from(stream) << 1) | 1;\\n\\n\\n\\n Self(Pcg64::restore_state_with_no_verification(state))\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"necsim/impls/std/src/cogs/rng/pcg.rs\",\n \"rank\": 86,\n \"score\": 144897.24593075344\n },\n {\n \"content\": \"\\n\\n self.state = xxhash_rust::xxh64::xxh64(\\n\\n &[\\n\\n location_bytes[0],\\n\\n location_bytes[1],\\n\\n location_bytes[2],\\n\\n location_bytes[3],\\n\\n location_bytes[4],\\n\\n location_bytes[5],\\n\\n location_bytes[6],\\n\\n location_bytes[7],\\n\\n time_index_bytes[0],\\n\\n time_index_bytes[1],\\n\\n time_index_bytes[2],\\n\\n time_index_bytes[3],\\n\\n time_index_bytes[4],\\n\\n time_index_bytes[5],\\n\\n time_index_bytes[6],\\n\\n time_index_bytes[7],\\n\\n ],\\n\\n self.seed,\\n\\n );\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"necsim/impls/no-std/src/cogs/rng/xxhash.rs\",\n \"rank\": 87,\n \"score\": 144895.75685773636\n },\n {\n \"content\": \" self.state[1] = location_bytes[1];\\n\\n self.state[2] = location_bytes[2];\\n\\n self.state[3] = location_bytes[3];\\n\\n self.state[4] = location_bytes[4];\\n\\n self.state[5] = location_bytes[5];\\n\\n self.state[6] = location_bytes[6];\\n\\n self.state[7] = location_bytes[7];\\n\\n\\n\\n let time_index_bytes = time_index.to_le_bytes();\\n\\n\\n\\n self.state[8] = time_index_bytes[0];\\n\\n self.state[9] = time_index_bytes[1];\\n\\n self.state[10] = time_index_bytes[2];\\n\\n self.state[11] = time_index_bytes[3];\\n\\n self.state[12] = time_index_bytes[4];\\n\\n self.state[13] = time_index_bytes[5];\\n\\n self.state[14] = time_index_bytes[6];\\n\\n self.state[15] = time_index_bytes[7];\\n\\n\\n\\n self.cached = false;\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"necsim/impls/no-std/src/cogs/rng/aes.rs\",\n \"rank\": 88,\n \"score\": 144895.51365753467\n },\n {\n \"content\": \" if self.cached {\\n\\n // one more u64 will be cached\\n\\n self.cipher\\n\\n .encrypt_block(GenericArray::from_mut_slice(&mut self.state));\\n\\n\\n\\n u64::from_le_bytes([\\n\\n self.state[0],\\n\\n self.state[1],\\n\\n self.state[2],\\n\\n self.state[3],\\n\\n self.state[4],\\n\\n self.state[5],\\n\\n self.state[6],\\n\\n self.state[7],\\n\\n ])\\n\\n } else {\\n\\n // one more u64 was cached\\n\\n let rand_u64 = u64::from_le_bytes([\\n\\n self.state[8],\\n\\n self.state[9],\\n\",\n \"file_path\": \"necsim/impls/no-std/src/cogs/rng/aes.rs\",\n \"rank\": 89,\n \"score\": 144887.24074451256\n },\n {\n \"content\": \"pub mod aes;\\n\\npub mod fixedseahash;\\n\\npub mod seahash;\\n\\npub mod wyhash;\\n\\npub mod wyrand;\\n\\npub mod xxhash;\\n\",\n \"file_path\": \"necsim/impls/no-std/src/cogs/rng/mod.rs\",\n \"rank\": 90,\n \"score\": 144881.74958412\n },\n {\n \"content\": \" // that changing those flips the lower bits, which scatters upwards because\\n\\n // of the multiplication.\\n\\n\\n\\n x = x.wrapping_mul(0x6eed_0e9d_a4d9_4a4f);\\n\\n\\n\\n let a = x >> 32;\\n\\n let b = x >> 60;\\n\\n\\n\\n x ^= a >> b;\\n\\n\\n\\n x = x.wrapping_mul(0x6eed_0e9d_a4d9_4a4f);\\n\\n\\n\\n x\\n\\n}\\n\",\n \"file_path\": \"necsim/impls/no-std/src/cogs/rng/fixedseahash.rs\",\n \"rank\": 91,\n \"score\": 144881.74958412\n },\n {\n \"content\": \"pub mod pcg;\\n\\npub mod std;\\n\",\n \"file_path\": \"necsim/impls/std/src/cogs/rng/mod.rs\",\n \"rank\": 92,\n \"score\": 144881.74958412\n },\n {\n \"content\": \" // by the input itself. The shift is chosen by the higher bits, which means\\n\\n // that changing those flips the lower bits, which scatters upwards because\\n\\n // of the multiplication.\\n\\n\\n\\n x = x.wrapping_mul(0x6eed_0e9d_a4d9_4a4f);\\n\\n\\n\\n let a = x >> 32;\\n\\n let b = x >> 60;\\n\\n\\n\\n x ^= a >> b;\\n\\n\\n\\n x = x.wrapping_mul(0x6eed_0e9d_a4d9_4a4f);\\n\\n\\n\\n x\\n\\n}\\n\",\n \"file_path\": \"necsim/impls/no-std/src/cogs/rng/wyhash.rs\",\n \"rank\": 93,\n \"score\": 144881.74958412\n },\n {\n \"content\": \"pub trait Scenario<G: RngCore>: Sized + ScenarioArguments {\\n\\n type Error;\\n\\n\\n\\n type Habitat: Habitat;\\n\\n type OriginSampler<'h, I: Iterator<Item = u64>>: OriginSampler<'h, Habitat = Self::Habitat>;\\n\\n type Decomposition: Decomposition<Self::Habitat>;\\n\\n type LineageReference: LineageReference<Self::Habitat>;\\n\\n type LineageStore<L: LineageStore<Self::Habitat, Self::LineageReference>>: LineageStore<\\n\\n Self::Habitat,\\n\\n Self::LineageReference,\\n\\n >;\\n\\n type DispersalSampler<D: DispersalSampler<Self::Habitat, G>>: DispersalSampler<Self::Habitat, G>;\\n\\n type TurnoverRate: TurnoverRate<Self::Habitat>;\\n\\n type SpeciationProbability: SpeciationProbability<Self::Habitat>;\\n\\n\\n\\n /// # Errors\\n\\n ///\\n\\n /// Returns a `Self::Error` if initialising the scenario failed\\n\\n fn initialise(\\n\\n args: Self::Arguments,\\n\",\n \"file_path\": \"rustcoalescence/scenarios/src/lib.rs\",\n \"rank\": 94,\n \"score\": 142884.73088064796\n },\n {\n \"content\": \"#[allow(clippy::inline_always, clippy::inline_fn_without_body)]\\n\\n#[allow(clippy::module_name_repetitions)]\\n\\n#[contract_trait]\\n\\npub trait RngSampler: RngCore {\\n\\n #[must_use]\\n\\n #[inline]\\n\\n fn sample_uniform(&mut self) -> ClosedUnitF64 {\\n\\n // http://prng.di.unimi.it -> Generating uniform doubles in the unit interval\\n\\n #[allow(clippy::cast_precision_loss)]\\n\\n let u01 = ((self.sample_u64() >> 11) as f64) * f64::from_bits(0x3CA0_0000_0000_0000_u64); // 0x1.0p-53\\n\\n\\n\\n unsafe { ClosedUnitF64::new_unchecked(u01) }\\n\\n }\\n\\n\\n\\n #[must_use]\\n\\n #[inline]\\n\\n #[debug_ensures(ret < length, \\\"samples U(0, length - 1)\\\")]\\n\\n fn sample_index(&mut self, length: usize) -> usize {\\n\\n // attributes on expressions are experimental\\n\\n // see https://github.com/rust-lang/rust/issues/15701\\n\\n #[allow(\\n\\n clippy::cast_precision_loss,\\n\\n clippy::cast_possible_truncation,\\n\",\n \"file_path\": \"necsim/core/src/cogs/rng.rs\",\n \"rank\": 95,\n \"score\": 142169.68813439336\n },\n {\n \"content\": \"#[allow(clippy::module_name_repetitions)]\\n\\npub trait SplittableRng: RngCore {\\n\\n fn split(self) -> (Self, Self);\\n\\n\\n\\n fn split_to_stream(self, stream: u64) -> Self;\\n\\n}\\n\",\n \"file_path\": \"necsim/core/src/cogs/rng.rs\",\n \"rank\": 96,\n \"score\": 142164.42733557717\n },\n {\n \"content\": \"#[allow(clippy::module_name_repetitions)]\\n\\npub trait PrimeableRng: RngCore {\\n\\n fn prime_with(&mut self, location_index: u64, time_index: u64);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"necsim/core/src/cogs/rng.rs\",\n \"rank\": 97,\n \"score\": 142164.42733557717\n },\n {\n \"content\": \"use necsim_core::{\\n\\n cogs::{Backup, Habitat},\\n\\n landscape::{IndexedLocation, LandscapeExtent, Location},\\n\\n};\\n\\n\\n\\n#[allow(clippy::module_name_repetitions)]\\n\\n#[cfg_attr(feature = \\\"cuda\\\", derive(rust_cuda::common::RustToCuda))]\\n\\n#[derive(Debug)]\\n\\npub struct NonSpatialHabitat {\\n\\n extent: LandscapeExtent,\\n\\n deme: u32,\\n\\n}\\n\\n\\n\\nimpl NonSpatialHabitat {\\n\\n #[must_use]\\n\\n #[debug_ensures(\\n\\n ret.get_total_habitat() == old(u64::from(area.0) * u64::from(area.1) * u64::from(deme)),\\n\\n \\\"creates a habitat with community size area.0 * area.1 * deme\\\"\\n\\n )]\\n\\n pub fn new(area: (u32, u32), deme: u32) -> Self {\\n\",\n \"file_path\": \"necsim/impls/no-std/src/cogs/habitat/non_spatial.rs\",\n \"rank\": 98,\n \"score\": 141926.6980761503\n },\n {\n \"content\": \"use necsim_core::{\\n\\n cogs::{Backup, Habitat},\\n\\n landscape::{IndexedLocation, LandscapeExtent, Location},\\n\\n};\\n\\n\\n\\n#[allow(clippy::module_name_repetitions)]\\n\\n#[cfg_attr(feature = \\\"cuda\\\", derive(rust_cuda::common::RustToCuda))]\\n\\n#[derive(Debug)]\\n\\npub struct AlmostInfiniteHabitat {\\n\\n extent: LandscapeExtent,\\n\\n}\\n\\n\\n\\nimpl Default for AlmostInfiniteHabitat {\\n\\n fn default() -> Self {\\n\\n Self {\\n\\n extent: LandscapeExtent::new(0_u32, 0_u32, u32::MAX, u32::MAX),\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"necsim/impls/no-std/src/cogs/habitat/almost_infinite.rs\",\n \"rank\": 99,\n \"score\": 141924.65440186026\n }\n]","isConversational":false}}},{"rowIdx":2375,"cells":{"lang":{"kind":"string","value":"Rust"},"file_path":{"kind":"string","value":"sos21-gateway/database/src/pending_project_repository.rs"},"repo_name":{"kind":"string","value":"sohosai/sos21-backend"},"commit":{"kind":"string","value":"f1883844b0e5c68d6b3f9d159c9268142abc81b4"},"file_code":{"kind":"string","value":"use crate::project_repository::{\n from_project_attributes, from_project_category, to_project_attributes, to_project_category,\n};\nuse crate::user_repository::to_user;\n\nuse anyhow::Result;\nuse futures::lock::Mutex;\nuse ref_cast::RefCast;\nuse sos21_database::{command, model as data, query};\nuse sos21_domain::context::pending_project_repository::{\n PendingProjectRepository, PendingProjectWithOwner,\n};\nuse sos21_domain::model::{\n date_time::DateTime,\n pending_project::{PendingProject, PendingProjectContent, PendingProjectId},\n project::{\n ProjectDescription, ProjectGroupName, ProjectKanaGroupName, ProjectKanaName, ProjectName,\n },\n user::UserId,\n};\nuse sqlx::{Postgres, Transaction};\n\n#[derive(Debug, RefCast)]\n#[repr(transparent)]\npub struct PendingProjectDatabase(Mutex<Transaction<'static, Postgres>>);\n\n#[async_trait::async_trait]\nimpl PendingProjectRepository for PendingProjectDatabase {\n async fn store_pending_project(&self, pending_project: PendingProject) -> Result<()> {\n let mut lock = self.0.lock().await;\n\n let pending_project = from_pending_project(pending_project);\n if query::find_pending_project(&mut *lock, pending_project.id)\n .await?\n .is_some()\n {\n let input = command::update_pending_project::Input {\n id: pending_project.id,\n created_at: pending_project.created_at,\n updated_at: pending_project.updated_at,\n name: pending_project.name,\n kana_name: pending_project.kana_name,\n group_name: pending_project.group_name,\n kana_group_name: pending_project.kana_group_name,\n description: pending_project.description,\n category: pending_project.category,\n attributes: pending_project.attributes,\n };\n command::update_pending_project(&mut *lock, input).await\n } else {\n command::insert_pending_project(&mut *lock, pending_project).await\n }\n }\n\n async fn delete_pending_project(&self, id: PendingProjectId) -> Result<()> {\n let mut lock = self.0.lock().await;\n command::delete_pending_project(&mut *lock, id.to_uuid()).await\n }\n\n async fn get_pending_project(\n &self,\n id: PendingProjectId,\n ) -> Result<Option<PendingProjectWithOwner>> {\n let mut lock = self.0.lock().await;\n query::find_pending_project(&mut *lock, id.to_uuid())\n .await\n .and_then(|opt| opt.map(to_pending_project_with_owner).transpose())\n }\n}\n\nfn from_pending_project(pending_project: PendingProject) -> data::pending_project::PendingProject {\n let PendingProjectContent {\n id,\n created_at,\n updated_at,\n name,\n kana_name,\n group_name,\n kana_group_name,\n description,\n category,\n attributes,\n } = pending_project.into_content();\n\n data::pending_project::PendingProject {\n id: id.to_uuid(),\n created_at: created_at.utc(),\n updated_at: updated_at.utc(),\n name: name.into_string(),\n kana_name: kana_name.into_string(),\n group_name: group_name.into_string(),\n kana_group_name: kana_group_name.into_string(),\n description: description.into_string(),\n category: from_project_category(category),\n attributes: from_project_attributes(&attributes),\n }\n}\n\nfn to_pending_project_with_owner(\n pending_project_with_owner: data::pending_project::PendingProjectWithOwner,\n) -> Result<PendingProjectWithOwner> {\n let data::pending_project::PendingProjectWithOwner {\n pending_project,\n owner,\n } = pending_project_with_owner;\n\n let data::pending_project::PendingProject {\n id,\n created_at,\n updated_at,\n name,\n kana_name,\n group_name,\n kana_group_name,\n description,\n category,\n attributes,\n } = pending_project;\n\n let pending_project = PendingProject::from_content(\n PendingProjectContent {\n id: PendingProjectId::from_uuid(id),\n created_at: DateTime::from_utc(created_at),\n updated_at: DateTime::from_utc(updated_at),\n name: ProjectName::from_string(name)?,\n kana_name: ProjectKanaName::from_string(kana_name)?,\n group_name: ProjectGroupName::from_string(group_name)?,\n kana_group_name: ProjectKanaGroupName::from_string(kana_group_name)?,\n description: ProjectDescription::from_string(description)?,\n category: to_project_category(category),\n attributes: to_project_attributes(attributes)?,\n },\n UserId(owner.id.clone()),\n );\n\n Ok(PendingProjectWithOwner {\n pending_project,\n owner: to_user(owner)?,\n })\n}\n"},"prefix":{"kind":"string","value":"use crate::project_repository::{\n from_project_attributes, from_project_category, to_project_attributes, to_project_category,\n};\nuse crate::user_repository::to_user;\n\nuse anyhow::Result;\nuse futures::lock::Mutex;\nuse ref_cast::RefCast;\nuse sos21_database::{command, model as data, query};\nuse sos21_domain::context::pending_project_repository::{\n PendingProjectRepository, PendingProjectWithOwner,\n};\nuse sos21_domain::model::{\n date_time::DateTime,\n pending_project::{PendingProject, PendingProjectContent, PendingProjectId},\n project::{\n ProjectDescription, ProjectGroupName, Proj"},"suffix":{"kind":"string","value":"me: group_name.into_string(),\n kana_group_name: kana_group_name.into_string(),\n description: description.into_string(),\n category: from_project_category(category),\n attributes: from_project_attributes(&attributes),\n }\n}\n\nfn to_pending_project_with_owner(\n pending_project_with_owner: data::pending_project::PendingProjectWithOwner,\n) -> Result<PendingProjectWithOwner> {\n let data::pending_project::PendingProjectWithOwner {\n pending_project,\n owner,\n } = pending_project_with_owner;\n\n let data::pending_project::PendingProject {\n id,\n created_at,\n updated_at,\n name,\n kana_name,\n group_name,\n kana_group_name,\n description,\n category,\n attributes,\n } = pending_project;\n\n let pending_project = PendingProject::from_content(\n PendingProjectContent {\n id: PendingProjectId::from_uuid(id),\n created_at: DateTime::from_utc(created_at),\n updated_at: DateTime::from_utc(updated_at),\n name: ProjectName::from_string(name)?,\n kana_name: ProjectKanaName::from_string(kana_name)?,\n group_name: ProjectGroupName::from_string(group_name)?,\n kana_group_name: ProjectKanaGroupName::from_string(kana_group_name)?,\n description: ProjectDescription::from_string(description)?,\n category: to_project_category(category),\n attributes: to_project_attributes(attributes)?,\n },\n UserId(owner.id.clone()),\n );\n\n Ok(PendingProjectWithOwner {\n pending_project,\n owner: to_user(owner)?,\n })\n}\n"},"middle":{"kind":"string","value":"ectKanaGroupName, ProjectKanaName, ProjectName,\n },\n user::UserId,\n};\nuse sqlx::{Postgres, Transaction};\n\n#[derive(Debug, RefCast)]\n#[repr(transparent)]\npub struct PendingProjectDatabase(Mutex<Transaction<'static, Postgres>>);\n\n#[async_trait::async_trait]\nimpl PendingProjectRepository for PendingProjectDatabase {\n async fn store_pending_project(&self, pending_project: PendingProject) -> Result<()> {\n let mut lock = self.0.lock().await;\n\n let pending_project = from_pending_project(pending_project);\n if query::find_pending_project(&mut *lock, pending_project.id)\n .await?\n .is_some()\n {\n let input = command::update_pending_project::Input {\n id: pending_project.id,\n created_at: pending_project.created_at,\n updated_at: pending_project.updated_at,\n name: pending_project.name,\n kana_name: pending_project.kana_name,\n group_name: pending_project.group_name,\n kana_group_name: pending_project.kana_group_name,\n description: pending_project.description,\n category: pending_project.category,\n attributes: pending_project.attributes,\n };\n command::update_pending_project(&mut *lock, input).await\n } else {\n command::insert_pending_project(&mut *lock, pending_project).await\n }\n }\n\n async fn delete_pending_project(&self, id: PendingProjectId) -> Result<()> {\n let mut lock = self.0.lock().await;\n command::delete_pending_project(&mut *lock, id.to_uuid()).await\n }\n\n async fn get_pending_project(\n &self,\n id: PendingProjectId,\n ) -> Result<Option<PendingProjectWithOwner>> {\n let mut lock = self.0.lock().await;\n query::find_pending_project(&mut *lock, id.to_uuid())\n .await\n .and_then(|opt| opt.map(to_pending_project_with_owner).transpose())\n }\n}\n\nfn from_pending_project(pending_project: PendingProject) -> data::pending_project::PendingProject {\n let PendingProjectContent {\n id,\n created_at,\n updated_at,\n name,\n kana_name,\n group_name,\n kana_group_name,\n description,\n category,\n attributes,\n } = pending_project.into_content();\n\n data::pending_project::PendingProject {\n id: id.to_uuid(),\n created_at: created_at.utc(),\n updated_at: updated_at.utc(),\n name: name.into_string(),\n kana_name: kana_name.into_string(),\n group_na"},"strategy":{"kind":"string","value":"random"},"context_items":{"kind":"list like","value":[{"content":"use crate::model::project::{ProjectAttribute, ProjectCategory};\n\n\n\nuse sos21_domain::model::project_query as entity;\n\n\n\n#[derive(Debug, Clone, PartialEq, Eq)]\n\npub struct ProjectQueryConjunction {\n\n pub category: Option<ProjectCategory>,\n\n pub attributes: Vec<ProjectAttribute>,\n\n}\n\n\n\nimpl ProjectQueryConjunction {\n\n pub fn from_entity(conj: entity::ProjectQueryConjunction) -> Self {\n\n ProjectQueryConjunction {\n\n category: conj.category().map(ProjectCategory::from_entity),\n\n attributes: conj\n\n .attributes()\n\n .map(ProjectAttribute::from_entity)\n\n .collect(),\n\n }\n\n }\n","file_path":"sos21-use-case/src/model/project_query.rs","rank":0,"score":198425.30508398678},{"content":"}\n\n\n\n#[derive(Debug, Clone, PartialEq, Eq)]\n\npub struct ProjectQuery(pub Vec<ProjectQueryConjunction>);\n\n\n\nimpl ProjectQuery {\n\n pub fn from_entity(query: entity::ProjectQuery) -> Self {\n\n ProjectQuery(\n\n query\n\n .into_conjunctions()\n\n .map(ProjectQueryConjunction::from_entity)\n\n .collect(),\n\n )\n\n }\n\n}\n","file_path":"sos21-use-case/src/model/project_query.rs","rank":1,"score":198416.20889991458},{"content":"fn from_project(project: Project) -> data::project::Project {\n\n let ProjectContent {\n\n id,\n\n index,\n\n created_at,\n\n updated_at,\n\n name,\n\n kana_name,\n\n group_name,\n\n kana_group_name,\n\n description,\n\n category,\n\n attributes,\n\n } = project.into_content();\n\n\n\n data::project::Project {\n\n id: id.to_uuid(),\n\n index: index.to_i16(),\n\n created_at: created_at.utc(),\n\n updated_at: updated_at.utc(),\n\n name: name.into_string(),\n\n kana_name: kana_name.into_string(),\n\n group_name: group_name.into_string(),\n\n kana_group_name: kana_group_name.into_string(),\n\n description: description.into_string(),\n\n category: from_project_category(category),\n\n attributes: from_project_attributes(&attributes),\n\n }\n\n}\n\n\n","file_path":"sos21-gateway/database/src/project_repository.rs","rank":2,"score":187765.3097458245},{"content":"pub fn mock_project_query() -> ProjectQuery {\n\n ProjectQuery::from_conjunctions(vec![ProjectQueryConjunction {\n\n category: None,\n\n attributes: ProjectAttributes::from_attributes(Vec::new()).unwrap(),\n\n }])\n\n .unwrap()\n\n}\n","file_path":"sos21-domain/src/test/model/project_query.rs","rank":3,"score":170010.15173757763},{"content":"pub fn to_project_query(\n\n query: ProjectQuery,\n\n) -> Result<project_query::ProjectQuery, ProjectQueryError> {\n\n let dnf = query\n\n .0\n\n .into_iter()\n\n .map(to_project_query_conjunction)\n\n .collect::<Result<Vec<_>, _>>()?;\n\n project_query::ProjectQuery::from_conjunctions(dnf).map_err(ProjectQueryError::from_query_error)\n\n}\n\n\n","file_path":"sos21-use-case/src/interface/project_query.rs","rank":4,"score":164702.7926567635},{"content":"pub fn to_project_query_conjunction(\n\n conj: ProjectQueryConjunction,\n\n) -> Result<project_query::ProjectQueryConjunction, ProjectQueryError> {\n\n let category = conj.category.map(ProjectCategory::into_entity);\n\n let attributes = project::ProjectAttributes::from_attributes(\n\n conj.attributes\n\n .into_iter()\n\n .map(ProjectAttribute::into_entity),\n\n )\n\n .map_err(ProjectQueryError::from_attributes_error)?;\n\n\n\n Ok(project_query::ProjectQueryConjunction {\n\n category,\n\n attributes,\n\n })\n\n}\n","file_path":"sos21-use-case/src/interface/project_query.rs","rank":5,"score":162705.37138906482},{"content":"pub fn to_project_category(category: data::project::ProjectCategory) -> ProjectCategory {\n\n match category {\n\n data::project::ProjectCategory::General => ProjectCategory::General,\n\n data::project::ProjectCategory::Stage => ProjectCategory::Stage,\n\n data::project::ProjectCategory::Cooking => ProjectCategory::Cooking,\n\n data::project::ProjectCategory::Food => ProjectCategory::Food,\n\n }\n\n}\n\n\n","file_path":"sos21-gateway/database/src/project_repository.rs","rank":6,"score":160553.34528123},{"content":"pub fn from_project_category(category: ProjectCategory) -> data::project::ProjectCategory {\n\n match category {\n\n ProjectCategory::General => data::project::ProjectCategory::General,\n\n ProjectCategory::Stage => data::project::ProjectCategory::Stage,\n\n ProjectCategory::Cooking => data::project::ProjectCategory::Cooking,\n\n ProjectCategory::Food => data::project::ProjectCategory::Food,\n\n }\n\n}\n\n\n","file_path":"sos21-gateway/database/src/project_repository.rs","rank":7,"score":160553.34528123},{"content":"pub fn from_project_attributes(attributes: &ProjectAttributes) -> data::project::ProjectAttributes {\n\n attributes\n\n .attributes()\n\n .map(|attr| match attr {\n\n ProjectAttribute::Academic => data::project::ProjectAttributes::ACADEMIC,\n\n ProjectAttribute::Artistic => data::project::ProjectAttributes::ARTISTIC,\n\n ProjectAttribute::Committee => data::project::ProjectAttributes::COMMITTEE,\n\n ProjectAttribute::Outdoor => data::project::ProjectAttributes::OUTDOOR,\n\n })\n\n .collect()\n\n}\n\n\n","file_path":"sos21-gateway/database/src/project_repository.rs","rank":8,"score":160553.34528123},{"content":"use std::collections::HashSet;\n\n\n\nuse crate::model::bound::{Bounded, Unbounded};\n\nuse crate::model::collection::LengthLimitedVec;\n\nuse crate::model::pending_project::PendingProject;\n\nuse crate::model::project::{Project, ProjectAttribute, ProjectAttributes, ProjectCategory};\n\n\n\nuse serde::{Deserialize, Serialize};\n\nuse thiserror::Error;\n\n\n\n#[derive(Debug, Clone, PartialEq, Eq, Serialize, Deserialize)]\n\npub struct ProjectQueryConjunction {\n\n pub category: Option<ProjectCategory>,\n\n pub attributes: ProjectAttributes,\n\n}\n\n\n\nimpl ProjectQueryConjunction {\n\n pub fn category(&self) -> Option<ProjectCategory> {\n\n self.category\n\n }\n","file_path":"sos21-domain/src/model/project_query.rs","rank":9,"score":152275.8516704615},{"content":"#[cfg(test)]\n\nmod tests {\n\n use super::{ProjectQuery, ProjectQueryConjunction};\n\n use crate::{\n\n model::project::{ProjectAttribute, ProjectAttributes, ProjectCategory},\n\n test::model as test_model,\n\n };\n\n\n\n #[test]\n\n fn test_conj_tautology() {\n\n let conj = ProjectQueryConjunction {\n\n category: None,\n\n attributes: ProjectAttributes::from_attributes(vec![]).unwrap(),\n\n };\n\n let project1 = test_model::new_general_project(test_model::new_user_id());\n\n assert!(conj.check_project(&project1));\n\n let project2 = test_model::new_project_with_attributes(\n\n test_model::new_user_id(),\n\n ProjectCategory::General,\n\n &[\n","file_path":"sos21-domain/src/model/project_query.rs","rank":10,"score":152275.65394851848},{"content":" ],\n\n );\n\n assert!(!query.check_project(&project2));\n\n }\n\n\n\n #[test]\n\n fn test_pending_project_contradiction() {\n\n let query = ProjectQuery::from_conjunctions(vec![]).unwrap();\n\n let pending_project = test_model::new_general_pending_project(test_model::new_user_id());\n\n assert!(!query.check_pending_project(&pending_project));\n\n let pending_project = test_model::new_pending_project_with_attributes(\n\n test_model::new_user_id(),\n\n ProjectCategory::General,\n\n &[\n\n ProjectAttribute::Artistic,\n\n ProjectAttribute::Academic,\n\n ProjectAttribute::Committee,\n\n ],\n\n );\n\n assert!(!query.check_pending_project(&pending_project));\n","file_path":"sos21-domain/src/model/project_query.rs","rank":11,"score":152271.26454618823},{"content":" );\n\n assert!(query.check_pending_project(&pending_project));\n\n }\n\n\n\n #[test]\n\n fn test_contradiction() {\n\n let query = ProjectQuery::from_conjunctions(vec![]).unwrap();\n\n let project1 = test_model::new_project_with_attributes(\n\n test_model::new_user_id(),\n\n ProjectCategory::General,\n\n &[],\n\n );\n\n assert!(!query.check_project(&project1));\n\n let project2 = test_model::new_project_with_attributes(\n\n test_model::new_user_id(),\n\n ProjectCategory::General,\n\n &[\n\n ProjectAttribute::Artistic,\n\n ProjectAttribute::Academic,\n\n ProjectAttribute::Committee,\n","file_path":"sos21-domain/src/model/project_query.rs","rank":12,"score":152271.1714327333},{"content":" assert!(query.check_project(&project2));\n\n }\n\n\n\n #[test]\n\n fn test_pending_project_tautology() {\n\n let conj = ProjectQueryConjunction {\n\n category: None,\n\n attributes: ProjectAttributes::from_attributes(vec![]).unwrap(),\n\n };\n\n let query = ProjectQuery::from_conjunctions(vec![conj]).unwrap();\n\n let pending_project = test_model::new_general_pending_project(test_model::new_user_id());\n\n assert!(query.check_pending_project(&pending_project));\n\n let pending_project = test_model::new_pending_project_with_attributes(\n\n test_model::new_user_id(),\n\n ProjectCategory::General,\n\n &[\n\n ProjectAttribute::Artistic,\n\n ProjectAttribute::Academic,\n\n ProjectAttribute::Committee,\n\n ],\n","file_path":"sos21-domain/src/model/project_query.rs","rank":13,"score":152271.08739944882},{"content":" let conj = ProjectQueryConjunction {\n\n category: None,\n\n attributes: ProjectAttributes::from_attributes(vec![]).unwrap(),\n\n };\n\n let query = ProjectQuery::from_conjunctions(vec![conj]).unwrap();\n\n let project1 = test_model::new_project_with_attributes(\n\n test_model::new_user_id(),\n\n ProjectCategory::General,\n\n &[],\n\n );\n\n assert!(query.check_project(&project1));\n\n let project2 = test_model::new_project_with_attributes(\n\n test_model::new_user_id(),\n\n ProjectCategory::General,\n\n &[\n\n ProjectAttribute::Artistic,\n\n ProjectAttribute::Academic,\n\n ProjectAttribute::Committee,\n\n ],\n\n );\n","file_path":"sos21-domain/src/model/project_query.rs","rank":14,"score":152271.06886088796},{"content":" ProjectCategory::General,\n\n &[ProjectAttribute::Academic],\n\n );\n\n assert!(!query.check_project(&project1));\n\n let project2 = test_model::new_project_with_attributes(\n\n test_model::new_user_id(),\n\n ProjectCategory::Stage,\n\n &[ProjectAttribute::Academic],\n\n );\n\n assert!(query.check_project(&project2));\n\n let project3 = test_model::new_project_with_attributes(\n\n test_model::new_user_id(),\n\n ProjectCategory::Stage,\n\n &[ProjectAttribute::Academic, ProjectAttribute::Committee],\n\n );\n\n assert!(query.check_project(&project3));\n\n let project4 = test_model::new_project_with_attributes(\n\n test_model::new_user_id(),\n\n ProjectCategory::General,\n\n &[ProjectAttribute::Academic, ProjectAttribute::Committee],\n","file_path":"sos21-domain/src/model/project_query.rs","rank":15,"score":152270.76206389038},{"content":" let pending_project = test_model::new_pending_project_with_attributes(\n\n test_model::new_user_id(),\n\n ProjectCategory::General,\n\n &[ProjectAttribute::Academic],\n\n );\n\n assert!(!query.check_pending_project(&pending_project));\n\n let pending_project = test_model::new_pending_project_with_attributes(\n\n test_model::new_user_id(),\n\n ProjectCategory::Stage,\n\n &[ProjectAttribute::Academic],\n\n );\n\n assert!(query.check_pending_project(&pending_project));\n\n let pending_project = test_model::new_pending_project_with_attributes(\n\n test_model::new_user_id(),\n\n ProjectCategory::Stage,\n\n &[ProjectAttribute::Academic, ProjectAttribute::Committee],\n\n );\n\n assert!(query.check_pending_project(&pending_project));\n\n let pending_project = test_model::new_pending_project_with_attributes(\n\n test_model::new_user_id(),\n","file_path":"sos21-domain/src/model/project_query.rs","rank":16,"score":152270.7278846383},{"content":" }\n\n\n\n #[test]\n\n fn test_complex() {\n\n let conj1 = ProjectQueryConjunction {\n\n category: Some(ProjectCategory::Stage),\n\n attributes: ProjectAttributes::from_attributes(vec![ProjectAttribute::Academic])\n\n .unwrap(),\n\n };\n\n let conj2 = ProjectQueryConjunction {\n\n category: None,\n\n attributes: ProjectAttributes::from_attributes(vec![\n\n ProjectAttribute::Academic,\n\n ProjectAttribute::Committee,\n\n ])\n\n .unwrap(),\n\n };\n\n let query = ProjectQuery::from_conjunctions(vec![conj1, conj2]).unwrap();\n\n let project1 = test_model::new_project_with_attributes(\n\n test_model::new_user_id(),\n","file_path":"sos21-domain/src/model/project_query.rs","rank":17,"score":152270.1910802704},{"content":" }\n\n\n\n #[test]\n\n fn test_conj_category() {\n\n let conj = ProjectQueryConjunction {\n\n category: Some(ProjectCategory::General),\n\n attributes: ProjectAttributes::from_attributes(vec![]).unwrap(),\n\n };\n\n assert!(conj.check_project(&test_model::new_general_project(test_model::new_user_id())));\n\n assert!(!conj.check_project(&test_model::new_stage_project(test_model::new_user_id())));\n\n }\n\n\n\n #[test]\n\n fn test_pending_project_conj_category() {\n\n let conj = ProjectQueryConjunction {\n\n category: Some(ProjectCategory::General),\n\n attributes: ProjectAttributes::from_attributes(vec![]).unwrap(),\n\n };\n\n assert!(\n\n conj.check_pending_project(&test_model::new_general_pending_project(\n","file_path":"sos21-domain/src/model/project_query.rs","rank":18,"score":152269.80204510805},{"content":" }\n\n\n\n #[test]\n\n fn test_conj_attribute_multiple() {\n\n let conj = ProjectQueryConjunction {\n\n category: None,\n\n attributes: ProjectAttributes::from_attributes(vec![\n\n ProjectAttribute::Artistic,\n\n ProjectAttribute::Committee,\n\n ])\n\n .unwrap(),\n\n };\n\n let project1 = test_model::new_project_with_attributes(\n\n test_model::new_user_id(),\n\n ProjectCategory::General,\n\n &[],\n\n );\n\n assert!(!conj.check_project(&project1));\n\n let project2 = test_model::new_project_with_attributes(\n\n test_model::new_user_id(),\n","file_path":"sos21-domain/src/model/project_query.rs","rank":19,"score":152268.90688524136},{"content":" test_model::new_user_id()\n\n ))\n\n );\n\n assert!(\n\n !conj.check_pending_project(&test_model::new_stage_pending_project(\n\n test_model::new_user_id()\n\n ))\n\n );\n\n }\n\n\n\n #[test]\n\n fn test_conj_complex() {\n\n let conj = ProjectQueryConjunction {\n\n category: Some(ProjectCategory::Stage),\n\n attributes: ProjectAttributes::from_attributes(vec![\n\n ProjectAttribute::Academic,\n\n ProjectAttribute::Committee,\n\n ])\n\n .unwrap(),\n\n };\n","file_path":"sos21-domain/src/model/project_query.rs","rank":20,"score":152268.88041851646},{"content":" }\n\n\n\n #[test]\n\n fn test_pending_project_conj_attribute_multiple() {\n\n let conj = ProjectQueryConjunction {\n\n category: None,\n\n attributes: ProjectAttributes::from_attributes(vec![\n\n ProjectAttribute::Artistic,\n\n ProjectAttribute::Committee,\n\n ])\n\n .unwrap(),\n\n };\n\n let pending_project = test_model::new_pending_project_with_attributes(\n\n test_model::new_user_id(),\n\n ProjectCategory::General,\n\n &[],\n\n );\n\n assert!(!conj.check_pending_project(&pending_project));\n\n let pending_project = test_model::new_pending_project_with_attributes(\n\n test_model::new_user_id(),\n","file_path":"sos21-domain/src/model/project_query.rs","rank":21,"score":152268.79016914836},{"content":" ProjectAttribute::Artistic,\n\n ProjectAttribute::Academic,\n\n ProjectAttribute::Committee,\n\n ],\n\n );\n\n assert!(conj.check_project(&project2));\n\n }\n\n\n\n #[test]\n\n fn test_pending_project_conj_tautology() {\n\n let conj = ProjectQueryConjunction {\n\n category: None,\n\n attributes: ProjectAttributes::from_attributes(vec![]).unwrap(),\n\n };\n\n let pending_project = test_model::new_general_pending_project(test_model::new_user_id());\n\n assert!(conj.check_pending_project(&pending_project));\n\n let pending_project = test_model::new_pending_project_with_attributes(\n\n test_model::new_user_id(),\n\n ProjectCategory::General,\n\n &[\n","file_path":"sos21-domain/src/model/project_query.rs","rank":22,"score":152268.58545169188},{"content":" ProjectCategory::Stage,\n\n &[ProjectAttribute::Academic],\n\n );\n\n assert!(!conj.check_project(&project4));\n\n }\n\n\n\n #[test]\n\n fn test_pending_project_conj_complex() {\n\n let conj = ProjectQueryConjunction {\n\n category: Some(ProjectCategory::Stage),\n\n attributes: ProjectAttributes::from_attributes(vec![\n\n ProjectAttribute::Academic,\n\n ProjectAttribute::Committee,\n\n ])\n\n .unwrap(),\n\n };\n\n let pending_project = test_model::new_general_pending_project(test_model::new_user_id());\n\n assert!(!conj.check_pending_project(&pending_project));\n\n let pending_project = test_model::new_pending_project_with_attributes(\n\n test_model::new_user_id(),\n","file_path":"sos21-domain/src/model/project_query.rs","rank":23,"score":152268.54117270064},{"content":" &[ProjectAttribute::Academic, ProjectAttribute::Committee],\n\n );\n\n assert!(!conj.check_project(&project4));\n\n }\n\n\n\n #[test]\n\n fn test_pending_project_conj_attribute_single() {\n\n let conj = ProjectQueryConjunction {\n\n category: None,\n\n attributes: ProjectAttributes::from_attributes(vec![ProjectAttribute::Artistic])\n\n .unwrap(),\n\n };\n\n let pending_project = test_model::new_pending_project_with_attributes(\n\n test_model::new_user_id(),\n\n ProjectCategory::General,\n\n &[],\n\n );\n\n assert!(!conj.check_pending_project(&pending_project));\n\n let pending_project = test_model::new_pending_project_with_attributes(\n\n test_model::new_user_id(),\n","file_path":"sos21-domain/src/model/project_query.rs","rank":24,"score":152268.54689700063},{"content":" ProjectCategory::General,\n\n &[ProjectAttribute::Academic, ProjectAttribute::Committee],\n\n );\n\n assert!(query.check_pending_project(&pending_project));\n\n }\n\n\n\n #[test]\n\n fn test_conj_possible_categories() {\n\n use std::collections::HashSet;\n\n\n\n let conj1 = ProjectQueryConjunction {\n\n category: Some(ProjectCategory::Stage),\n\n attributes: ProjectAttributes::from_attributes(vec![ProjectAttribute::Academic])\n\n .unwrap(),\n\n };\n\n assert_eq!(\n\n conj1.possible_categories().collect::<Vec<_>>(),\n\n vec![ProjectCategory::Stage]\n\n );\n\n let conj2 = ProjectQueryConjunction {\n","file_path":"sos21-domain/src/model/project_query.rs","rank":25,"score":152268.54047007006},{"content":" ProjectAttribute::Artistic,\n\n ProjectAttribute::Academic,\n\n ProjectAttribute::Committee,\n\n ],\n\n );\n\n assert!(conj.check_pending_project(&pending_project));\n\n }\n\n\n\n #[test]\n\n fn test_conj_attribute_single() {\n\n let conj = ProjectQueryConjunction {\n\n category: None,\n\n attributes: ProjectAttributes::from_attributes(vec![ProjectAttribute::Artistic])\n\n .unwrap(),\n\n };\n\n let project1 = test_model::new_project_with_attributes(\n\n test_model::new_user_id(),\n\n ProjectCategory::General,\n\n &[],\n\n );\n","file_path":"sos21-domain/src/model/project_query.rs","rank":26,"score":152268.25771560182},{"content":" category: None,\n\n attributes: ProjectAttributes::from_attributes(vec![ProjectAttribute::Academic])\n\n .unwrap(),\n\n };\n\n assert_eq!(\n\n conj2.possible_categories().collect::<HashSet<_>>(),\n\n ProjectCategory::enumerate().collect::<HashSet<_>>()\n\n );\n\n }\n\n\n\n #[test]\n\n fn test_possible_categories() {\n\n use std::collections::HashSet;\n\n\n\n let conj1 = ProjectQueryConjunction {\n\n category: Some(ProjectCategory::Stage),\n\n attributes: ProjectAttributes::from_attributes(vec![ProjectAttribute::Academic])\n\n .unwrap(),\n\n };\n\n let conj2 = ProjectQueryConjunction {\n","file_path":"sos21-domain/src/model/project_query.rs","rank":27,"score":152267.86258933257},{"content":" );\n\n assert!(query.check_project(&project4));\n\n }\n\n\n\n #[test]\n\n fn test_pending_project_complex() {\n\n let conj1 = ProjectQueryConjunction {\n\n category: Some(ProjectCategory::Stage),\n\n attributes: ProjectAttributes::from_attributes(vec![ProjectAttribute::Academic])\n\n .unwrap(),\n\n };\n\n let conj2 = ProjectQueryConjunction {\n\n category: None,\n\n attributes: ProjectAttributes::from_attributes(vec![\n\n ProjectAttribute::Academic,\n\n ProjectAttribute::Committee,\n\n ])\n\n .unwrap(),\n\n };\n\n let query = ProjectQuery::from_conjunctions(vec![conj1, conj2]).unwrap();\n","file_path":"sos21-domain/src/model/project_query.rs","rank":28,"score":152265.55414267784},{"content":" let project1 = test_model::new_project_with_attributes(\n\n test_model::new_user_id(),\n\n ProjectCategory::General,\n\n &[],\n\n );\n\n assert!(!conj.check_project(&project1));\n\n let project2 = test_model::new_project_with_attributes(\n\n test_model::new_user_id(),\n\n ProjectCategory::General,\n\n &[ProjectAttribute::Academic, ProjectAttribute::Committee],\n\n );\n\n assert!(!conj.check_project(&project2));\n\n let project3 = test_model::new_project_with_attributes(\n\n test_model::new_user_id(),\n\n ProjectCategory::Stage,\n\n &[ProjectAttribute::Academic, ProjectAttribute::Committee],\n\n );\n\n assert!(conj.check_project(&project3));\n\n let project4 = test_model::new_project_with_attributes(\n\n test_model::new_user_id(),\n","file_path":"sos21-domain/src/model/project_query.rs","rank":29,"score":152265.38073899617},{"content":" assert!(!conj.check_project(&project1));\n\n let project2 = test_model::new_project_with_attributes(\n\n test_model::new_user_id(),\n\n ProjectCategory::General,\n\n &[ProjectAttribute::Artistic, ProjectAttribute::Committee],\n\n );\n\n assert!(conj.check_project(&project2));\n\n let project3 = test_model::new_project_with_attributes(\n\n test_model::new_user_id(),\n\n ProjectCategory::General,\n\n &[\n\n ProjectAttribute::Artistic,\n\n ProjectAttribute::Academic,\n\n ProjectAttribute::Committee,\n\n ],\n\n );\n\n assert!(conj.check_project(&project3));\n\n let project4 = test_model::new_project_with_attributes(\n\n test_model::new_user_id(),\n\n ProjectCategory::General,\n","file_path":"sos21-domain/src/model/project_query.rs","rank":30,"score":152265.2296177635},{"content":"impl ProjectQuery {\n\n pub fn from_conjunctions<I>(conj: I) -> Result<Self, FromConjunctionsError>\n\n where\n\n I: IntoIterator<Item = ProjectQueryConjunction>,\n\n {\n\n let dnf = LengthLimitedVec::new(conj.into_iter().collect()).map_err(|_| {\n\n FromConjunctionsError {\n\n kind: FromConjunctionsErrorKind::TooBigDisjunction,\n\n }\n\n })?;\n\n Ok(ProjectQuery(dnf))\n\n }\n\n\n\n pub fn conjunctions(&self) -> impl Iterator<Item = &'_ ProjectQueryConjunction> + '_ {\n\n self.0.iter()\n\n }\n\n\n\n pub fn into_conjunctions(self) -> impl Iterator<Item = ProjectQueryConjunction> {\n\n self.0.into_inner().into_iter()\n\n }\n","file_path":"sos21-domain/src/model/project_query.rs","rank":31,"score":152264.92515582946},{"content":" ProjectCategory::General,\n\n &[ProjectAttribute::Artistic, ProjectAttribute::Committee],\n\n );\n\n assert!(conj.check_project(&project2));\n\n let project3 = test_model::new_project_with_attributes(\n\n test_model::new_user_id(),\n\n ProjectCategory::General,\n\n &[\n\n ProjectAttribute::Artistic,\n\n ProjectAttribute::Academic,\n\n ProjectAttribute::Committee,\n\n ],\n\n );\n\n assert!(conj.check_project(&project3));\n\n let project4 = test_model::new_project_with_attributes(\n\n test_model::new_user_id(),\n\n ProjectCategory::General,\n\n &[ProjectAttribute::Artistic, ProjectAttribute::Academic],\n\n );\n\n assert!(!conj.check_project(&project4));\n","file_path":"sos21-domain/src/model/project_query.rs","rank":32,"score":152264.89675750217},{"content":" ProjectCategory::General,\n\n &[ProjectAttribute::Academic, ProjectAttribute::Committee],\n\n );\n\n assert!(!conj.check_pending_project(&pending_project));\n\n let pending_project = test_model::new_pending_project_with_attributes(\n\n test_model::new_user_id(),\n\n ProjectCategory::Stage,\n\n &[ProjectAttribute::Academic, ProjectAttribute::Committee],\n\n );\n\n assert!(conj.check_pending_project(&pending_project));\n\n let pending_project = test_model::new_pending_project_with_attributes(\n\n test_model::new_user_id(),\n\n ProjectCategory::Stage,\n\n &[ProjectAttribute::Academic],\n\n );\n\n assert!(!conj.check_pending_project(&pending_project));\n\n }\n\n\n\n #[test]\n\n fn test_tautology() {\n","file_path":"sos21-domain/src/model/project_query.rs","rank":33,"score":152264.85279360975},{"content":" ProjectCategory::General,\n\n &[ProjectAttribute::Artistic, ProjectAttribute::Committee],\n\n );\n\n assert!(conj.check_pending_project(&pending_project));\n\n let pending_project = test_model::new_pending_project_with_attributes(\n\n test_model::new_user_id(),\n\n ProjectCategory::General,\n\n &[\n\n ProjectAttribute::Artistic,\n\n ProjectAttribute::Academic,\n\n ProjectAttribute::Committee,\n\n ],\n\n );\n\n assert!(conj.check_pending_project(&pending_project));\n\n let pending_project = test_model::new_pending_project_with_attributes(\n\n test_model::new_user_id(),\n\n ProjectCategory::General,\n\n &[ProjectAttribute::Academic, ProjectAttribute::Committee],\n\n );\n\n assert!(!conj.check_pending_project(&pending_project));\n","file_path":"sos21-domain/src/model/project_query.rs","rank":34,"score":152264.84448710762},{"content":" ProjectCategory::General,\n\n &[ProjectAttribute::Artistic, ProjectAttribute::Committee],\n\n );\n\n assert!(conj.check_pending_project(&pending_project));\n\n let pending_project = test_model::new_pending_project_with_attributes(\n\n test_model::new_user_id(),\n\n ProjectCategory::General,\n\n &[\n\n ProjectAttribute::Artistic,\n\n ProjectAttribute::Academic,\n\n ProjectAttribute::Committee,\n\n ],\n\n );\n\n assert!(conj.check_pending_project(&pending_project));\n\n let pending_project = test_model::new_pending_project_with_attributes(\n\n test_model::new_user_id(),\n\n ProjectCategory::General,\n\n &[ProjectAttribute::Artistic, ProjectAttribute::Academic],\n\n );\n\n assert!(!conj.check_pending_project(&pending_project));\n","file_path":"sos21-domain/src/model/project_query.rs","rank":35,"score":152264.84448710762},{"content":" };\n\n let conj2 = ProjectQueryConjunction {\n\n category: None,\n\n attributes: ProjectAttributes::from_attributes(vec![\n\n ProjectAttribute::Academic,\n\n ProjectAttribute::Committee,\n\n ])\n\n .unwrap(),\n\n };\n\n let query2 = ProjectQuery::from_conjunctions(vec![conj1, conj2]).unwrap();\n\n assert_eq!(\n\n query2.possible_categories().collect::<HashSet<_>>(),\n\n ProjectCategory::enumerate().collect::<HashSet<_>>()\n\n );\n\n }\n\n}\n","file_path":"sos21-domain/src/model/project_query.rs","rank":36,"score":152264.3550161643},{"content":" category: Some(ProjectCategory::Food),\n\n attributes: ProjectAttributes::from_attributes(vec![\n\n ProjectAttribute::Academic,\n\n ProjectAttribute::Committee,\n\n ])\n\n .unwrap(),\n\n };\n\n let query1 = ProjectQuery::from_conjunctions(vec![conj1, conj2]).unwrap();\n\n assert_eq!(\n\n query1.possible_categories().collect::<HashSet<_>>(),\n\n [ProjectCategory::Stage, ProjectCategory::Food]\n\n .iter()\n\n .copied()\n\n .collect::<HashSet<_>>()\n\n );\n\n\n\n let conj1 = ProjectQueryConjunction {\n\n category: Some(ProjectCategory::Stage),\n\n attributes: ProjectAttributes::from_attributes(vec![ProjectAttribute::Academic])\n\n .unwrap(),\n","file_path":"sos21-domain/src/model/project_query.rs","rank":37,"score":152264.13926949448},{"content":" pub fn possible_categories(&self) -> impl Iterator<Item = ProjectCategory> {\n\n if let Some(expected) = self.category {\n\n std::iter::once(expected)\n\n } else {\n\n ProjectCategory::enumerate()\n\n }\n\n }\n\n\n\n pub fn check_project(&self, project: &Project) -> bool {\n\n self.check_category_attributes(project.category(), project.attributes())\n\n }\n\n\n\n pub fn check_pending_project(&self, pending_project: &PendingProject) -> bool {\n\n self.check_category_attributes(pending_project.category(), pending_project.attributes())\n\n }\n\n}\n\n\n\n#[derive(Debug, Clone, PartialEq, Eq, Serialize, Deserialize)]\n\n#[serde(transparent)]\n\npub struct ProjectQuery(\n","file_path":"sos21-domain/src/model/project_query.rs","rank":38,"score":152262.93416239735},{"content":" LengthLimitedVec<Unbounded, Bounded<typenum::U32>, ProjectQueryConjunction>,\n\n);\n\n\n\n#[derive(Debug, Clone, Copy, PartialEq, Eq)]\n\npub enum FromConjunctionsErrorKind {\n\n TooBigDisjunction,\n\n}\n\n\n\n#[derive(Debug, Error, Clone)]\n\n#[error(\"invalid project query\")]\n\npub struct FromConjunctionsError {\n\n kind: FromConjunctionsErrorKind,\n\n}\n\n\n\nimpl FromConjunctionsError {\n\n pub fn kind(&self) -> FromConjunctionsErrorKind {\n\n self.kind\n\n }\n\n}\n\n\n","file_path":"sos21-domain/src/model/project_query.rs","rank":39,"score":152262.87962607262},{"content":"\n\n pub fn possible_categories(&self) -> impl Iterator<Item = ProjectCategory> {\n\n let categories: HashSet<_> = self\n\n .conjunctions()\n\n .map(|conj| conj.possible_categories())\n\n .flatten()\n\n .collect();\n\n categories.into_iter()\n\n }\n\n\n\n pub fn check_project(&self, project: &Project) -> bool {\n\n self.conjunctions().any(|conj| conj.check_project(project))\n\n }\n\n\n\n pub fn check_pending_project(&self, pending_project: &PendingProject) -> bool {\n\n self.conjunctions()\n\n .any(|conj| conj.check_pending_project(pending_project))\n\n }\n\n}\n\n\n","file_path":"sos21-domain/src/model/project_query.rs","rank":40,"score":152259.0026354699},{"content":"\n\n pub fn attributes(&self) -> impl Iterator<Item = ProjectAttribute> + '_ {\n\n self.attributes.attributes()\n\n }\n\n\n\n fn check_category_attributes(\n\n &self,\n\n category: ProjectCategory,\n\n attributes: &ProjectAttributes,\n\n ) -> bool {\n\n if let Some(expected) = self.category {\n\n if expected != category {\n\n return false;\n\n }\n\n }\n\n\n\n self.attributes.is_subset(attributes)\n\n }\n\n\n\n #[auto_enums::auto_enum(Iterator)]\n","file_path":"sos21-domain/src/model/project_query.rs","rank":41,"score":152258.2239682385},{"content":"use crate::model::user::{UserId, UserKanaName, UserName};\n\n\n\nuse chrono::{DateTime, Utc};\n\nuse sos21_domain::model::project as entity;\n\nuse uuid::Uuid;\n\n\n\n#[derive(Debug, Clone, Copy, PartialEq, Eq, PartialOrd, Ord, Hash)]\n\npub struct ProjectId(pub Uuid);\n\n\n\nimpl ProjectId {\n\n pub fn from_entity(id: entity::ProjectId) -> ProjectId {\n\n ProjectId(id.to_uuid())\n\n }\n\n\n\n pub fn into_entity(self) -> entity::ProjectId {\n\n entity::ProjectId::from_uuid(self.0)\n\n }\n\n}\n\n\n\n#[derive(Debug, Clone, Copy, PartialEq, Eq, PartialOrd, Ord, Hash)]\n","file_path":"sos21-use-case/src/model/project.rs","rank":42,"score":149849.09841760315},{"content":" pub owner_kana_name: sos21_domain::model::user::UserKanaName,\n\n pub subowner_name: sos21_domain::model::user::UserName,\n\n pub subowner_kana_name: sos21_domain::model::user::UserKanaName,\n\n}\n\n\n\nimpl Project {\n\n pub fn from_entity(input: ProjectFromEntityInput) -> Self {\n\n let ProjectFromEntityInput {\n\n project,\n\n owner_name,\n\n owner_kana_name,\n\n subowner_name,\n\n subowner_kana_name,\n\n } = input;\n\n\n\n Project {\n\n id: ProjectId::from_entity(project.id()),\n\n code: project.code().to_string(),\n\n created_at: project.created_at().utc(),\n\n updated_at: project.updated_at().utc(),\n","file_path":"sos21-use-case/src/model/project.rs","rank":43,"score":149844.3214872564},{"content":" pub updated_at: DateTime<Utc>,\n\n pub owner_id: UserId,\n\n pub owner_name: UserName,\n\n pub owner_kana_name: UserKanaName,\n\n pub subowner_id: UserId,\n\n pub subowner_name: UserName,\n\n pub subowner_kana_name: UserKanaName,\n\n pub name: String,\n\n pub kana_name: String,\n\n pub group_name: String,\n\n pub kana_group_name: String,\n\n pub description: String,\n\n pub category: ProjectCategory,\n\n pub attributes: Vec<ProjectAttribute>,\n\n}\n\n\n\n#[derive(Debug, Clone)]\n\npub struct ProjectFromEntityInput {\n\n pub project: entity::Project,\n\n pub owner_name: sos21_domain::model::user::UserName,\n","file_path":"sos21-use-case/src/model/project.rs","rank":44,"score":149841.45362635623},{"content":"pub enum ProjectCategory {\n\n General,\n\n Stage,\n\n Cooking,\n\n Food,\n\n}\n\n\n\nimpl ProjectCategory {\n\n pub fn from_entity(category: entity::ProjectCategory) -> ProjectCategory {\n\n match category {\n\n entity::ProjectCategory::General => ProjectCategory::General,\n\n entity::ProjectCategory::Stage => ProjectCategory::Stage,\n\n entity::ProjectCategory::Cooking => ProjectCategory::Cooking,\n\n entity::ProjectCategory::Food => ProjectCategory::Food,\n\n }\n\n }\n\n\n\n pub fn into_entity(self) -> entity::ProjectCategory {\n\n match self {\n\n ProjectCategory::General => entity::ProjectCategory::General,\n","file_path":"sos21-use-case/src/model/project.rs","rank":45,"score":149839.25692147156},{"content":" entity::ProjectAttribute::Committee => ProjectAttribute::Committee,\n\n entity::ProjectAttribute::Outdoor => ProjectAttribute::Outdoor,\n\n }\n\n }\n\n\n\n pub fn into_entity(self) -> entity::ProjectAttribute {\n\n match self {\n\n ProjectAttribute::Academic => entity::ProjectAttribute::Academic,\n\n ProjectAttribute::Artistic => entity::ProjectAttribute::Artistic,\n\n ProjectAttribute::Committee => entity::ProjectAttribute::Committee,\n\n ProjectAttribute::Outdoor => entity::ProjectAttribute::Outdoor,\n\n }\n\n }\n\n}\n\n\n\n#[derive(Debug, Clone, PartialEq, Eq)]\n\npub struct Project {\n\n pub id: ProjectId,\n\n pub code: String,\n\n pub created_at: DateTime<Utc>,\n","file_path":"sos21-use-case/src/model/project.rs","rank":46,"score":149839.22338487586},{"content":" ProjectCategory::Stage => entity::ProjectCategory::Stage,\n\n ProjectCategory::Cooking => entity::ProjectCategory::Cooking,\n\n ProjectCategory::Food => entity::ProjectCategory::Food,\n\n }\n\n }\n\n}\n\n\n\n#[derive(Debug, Clone, Copy, PartialEq, Eq, PartialOrd, Ord, Hash)]\n\npub enum ProjectAttribute {\n\n Academic,\n\n Artistic,\n\n Committee,\n\n Outdoor,\n\n}\n\n\n\nimpl ProjectAttribute {\n\n pub fn from_entity(attribute: entity::ProjectAttribute) -> ProjectAttribute {\n\n match attribute {\n\n entity::ProjectAttribute::Academic => ProjectAttribute::Academic,\n\n entity::ProjectAttribute::Artistic => ProjectAttribute::Artistic,\n","file_path":"sos21-use-case/src/model/project.rs","rank":47,"score":149839.20155868452},{"content":" owner_id: UserId::from_entity(project.owner_id().clone()),\n\n owner_name: UserName::from_entity(owner_name),\n\n owner_kana_name: UserKanaName::from_entity(owner_kana_name),\n\n subowner_id: UserId::from_entity(project.subowner_id().clone()),\n\n subowner_name: UserName::from_entity(subowner_name),\n\n subowner_kana_name: UserKanaName::from_entity(subowner_kana_name),\n\n name: project.name().clone().into_string(),\n\n kana_name: project.kana_name().clone().into_string(),\n\n group_name: project.group_name().clone().into_string(),\n\n kana_group_name: project.kana_group_name().clone().into_string(),\n\n description: project.description().clone().into_string(),\n\n category: ProjectCategory::from_entity(project.category()),\n\n attributes: project\n\n .attributes()\n\n .attributes()\n\n .map(ProjectAttribute::from_entity)\n\n .collect(),\n\n }\n\n }\n\n}\n","file_path":"sos21-use-case/src/model/project.rs","rank":48,"score":149838.87134291802},{"content":"use crate::model::{\n\n project::ProjectAttributes,\n\n project_query::{ProjectQuery, ProjectQueryConjunction},\n\n};\n\n\n","file_path":"sos21-domain/src/test/model/project_query.rs","rank":49,"score":149565.44828472455},{"content":"use crate::model::project::{ProjectAttribute, ProjectCategory};\n\nuse crate::model::project_query::{ProjectQuery, ProjectQueryConjunction};\n\n\n\nuse sos21_domain::model::{project, project_query};\n\n\n\n#[derive(Debug, Clone)]\n\npub enum ProjectQueryError {\n\n TooBigQuery,\n\n DuplicatedAttributes,\n\n}\n\n\n\nimpl ProjectQueryError {\n\n fn from_query_error(err: project_query::FromConjunctionsError) -> Self {\n\n match err.kind() {\n\n project_query::FromConjunctionsErrorKind::TooBigDisjunction => {\n\n ProjectQueryError::TooBigQuery\n\n }\n\n }\n\n }\n\n\n\n fn from_attributes_error(_err: project::attribute::DuplicatedAttributesError) -> Self {\n\n ProjectQueryError::DuplicatedAttributes\n\n }\n\n}\n\n\n","file_path":"sos21-use-case/src/interface/project_query.rs","rank":50,"score":149420.4424117174},{"content":"use crate::model::project::{ProjectAttribute, ProjectCategory};\n\nuse crate::model::user::UserId;\n\n\n\nuse chrono::{DateTime, Utc};\n\nuse sos21_domain::model::pending_project as entity;\n\nuse uuid::Uuid;\n\n\n\n#[derive(Debug, Clone, Copy, PartialEq, Eq, PartialOrd, Ord, Hash)]\n\npub struct PendingProjectId(pub Uuid);\n\n\n\nimpl PendingProjectId {\n\n pub fn from_entity(id: entity::PendingProjectId) -> Self {\n\n PendingProjectId(id.to_uuid())\n\n }\n\n\n\n pub fn into_entity(self) -> entity::PendingProjectId {\n\n entity::PendingProjectId::from_uuid(self.0)\n\n }\n\n}\n\n\n","file_path":"sos21-use-case/src/model/pending_project.rs","rank":51,"score":147182.94873374188},{"content":" updated_at: pending_project.updated_at().utc(),\n\n owner_id: UserId::from_entity(pending_project.owner_id().clone()),\n\n name: pending_project.name().clone().into_string(),\n\n kana_name: pending_project.kana_name().clone().into_string(),\n\n group_name: pending_project.group_name().clone().into_string(),\n\n kana_group_name: pending_project.kana_group_name().clone().into_string(),\n\n description: pending_project.description().clone().into_string(),\n\n category: ProjectCategory::from_entity(pending_project.category()),\n\n attributes: pending_project\n\n .attributes()\n\n .attributes()\n\n .map(ProjectAttribute::from_entity)\n\n .collect(),\n\n }\n\n }\n\n}\n","file_path":"sos21-use-case/src/model/pending_project.rs","rank":52,"score":147171.75237552324},{"content":"#[derive(Debug, Clone, PartialEq, Eq)]\n\npub struct PendingProject {\n\n pub id: PendingProjectId,\n\n pub created_at: DateTime<Utc>,\n\n pub updated_at: DateTime<Utc>,\n\n pub owner_id: UserId,\n\n pub name: String,\n\n pub kana_name: String,\n\n pub group_name: String,\n\n pub kana_group_name: String,\n\n pub description: String,\n\n pub category: ProjectCategory,\n\n pub attributes: Vec<ProjectAttribute>,\n\n}\n\n\n\nimpl PendingProject {\n\n pub fn from_entity(pending_project: entity::PendingProject) -> Self {\n\n PendingProject {\n\n id: PendingProjectId::from_entity(pending_project.id()),\n\n created_at: pending_project.created_at().utc(),\n","file_path":"sos21-use-case/src/model/pending_project.rs","rank":53,"score":147171.67310805267},{"content":"use crate::handler::model::project::{ProjectAttribute, ProjectCategory};\n\n\n\nuse serde::{Deserialize, Serialize};\n\nuse sos21_use_case::model::project_query as use_case;\n\n\n\n#[derive(Debug, Clone, Serialize, Deserialize)]\n\npub struct ProjectQueryConjunction {\n\n pub category: Option<ProjectCategory>,\n\n pub attributes: Vec<ProjectAttribute>,\n\n}\n\n\n\nimpl ProjectQueryConjunction {\n\n pub fn from_use_case(conj: use_case::ProjectQueryConjunction) -> Self {\n\n let category = conj.category.map(ProjectCategory::from_use_case);\n\n let attributes = conj\n\n .attributes\n\n .into_iter()\n\n .map(ProjectAttribute::from_use_case)\n\n .collect();\n\n ProjectQueryConjunction {\n","file_path":"sos21-api-server/src/handler/model/project_query.rs","rank":54,"score":146950.36099811818},{"content":"#[serde(transparent)]\n\npub struct ProjectQuery(pub Vec<ProjectQueryConjunction>);\n\n\n\nimpl ProjectQuery {\n\n pub fn from_use_case(query: use_case::ProjectQuery) -> Self {\n\n let query = query\n\n .0\n\n .into_iter()\n\n .map(ProjectQueryConjunction::from_use_case)\n\n .collect();\n\n ProjectQuery(query)\n\n }\n\n\n\n pub fn into_use_case(self) -> use_case::ProjectQuery {\n\n let query = self\n\n .0\n\n .into_iter()\n\n .map(ProjectQueryConjunction::into_use_case)\n\n .collect();\n\n use_case::ProjectQuery(query)\n\n }\n\n}\n","file_path":"sos21-api-server/src/handler/model/project_query.rs","rank":55,"score":146946.6325884428},{"content":" category,\n\n attributes,\n\n }\n\n }\n\n\n\n pub fn into_use_case(self) -> use_case::ProjectQueryConjunction {\n\n let category = self.category.map(ProjectCategory::into_use_case);\n\n let attributes = self\n\n .attributes\n\n .into_iter()\n\n .map(ProjectAttribute::into_use_case)\n\n .collect();\n\n use_case::ProjectQueryConjunction {\n\n category,\n\n attributes,\n\n }\n\n }\n\n}\n\n\n\n#[derive(Debug, Clone, Serialize, Deserialize)]\n","file_path":"sos21-api-server/src/handler/model/project_query.rs","rank":56,"score":146944.50167020422},{"content":"pub fn new_form_with_query(author_id: UserId, query: ProjectQuery) -> Form {\n\n new_form_with_condition(\n\n author_id,\n\n FormCondition {\n\n query,\n\n includes: FormConditionProjectSet::from_projects(Vec::new()).unwrap(),\n\n excludes: FormConditionProjectSet::from_projects(Vec::new()).unwrap(),\n\n },\n\n )\n\n}\n\n\n","file_path":"sos21-domain/src/test/model/form.rs","rank":57,"score":143993.30258058585},{"content":"pub fn new_pending_project_id() -> PendingProjectId {\n\n PendingProjectId::from_uuid(Uuid::new_v4())\n\n}\n\n\n","file_path":"sos21-domain/src/test/model/pending_project.rs","rank":59,"score":136237.3987147163},{"content":"pub fn new_stage_project(owner_id: UserId) -> Project {\n\n new_project(owner_id, ProjectCategory::Stage)\n\n}\n\n\n","file_path":"sos21-domain/src/test/model/project.rs","rank":60,"score":131997.367562924},{"content":"pub fn new_general_project(owner_id: UserId) -> Project {\n\n new_project(owner_id, ProjectCategory::General)\n\n}\n\n\n","file_path":"sos21-domain/src/test/model/project.rs","rank":61,"score":131997.367562924},{"content":"pub fn new_project(owner_id: UserId, category: ProjectCategory) -> Project {\n\n new_project_with_attributes(owner_id, category, &[])\n\n}\n\n\n","file_path":"sos21-domain/src/test/model/project.rs","rank":62,"score":130067.49357434284},{"content":"pub fn new_form_answer(author_id: UserId, project: &Project, form: &Form) -> FormAnswer {\n\n new_form_answer_with_items(\n\n author_id,\n\n project,\n\n form,\n\n mock_form_answer_items(form.items()),\n\n )\n\n}\n","file_path":"sos21-domain/src/test/model/form_answer.rs","rank":63,"score":124015.03346618217},{"content":"pub fn new_general_project_with_subowner(owner_id: UserId, subowner_id: UserId) -> Project {\n\n new_project_with_subowner(owner_id, subowner_id, ProjectCategory::General)\n\n}\n\n\n","file_path":"sos21-domain/src/test/model/project.rs","rank":64,"score":123588.25449040602},{"content":"pub fn new_stage_project_with_subowner(owner_id: UserId, subowner_id: UserId) -> Project {\n\n new_project_with_subowner(owner_id, subowner_id, ProjectCategory::Stage)\n\n}\n","file_path":"sos21-domain/src/test/model/project.rs","rank":65,"score":123588.25449040602},{"content":"CREATE TABLE form_project_query_conjunctions (\n\n form_id uuid NOT NULL REFERENCES forms ON DELETE RESTRICT,\n\n category project_category,\n\n attributes integer NOT NULL\n\n);\n\n\n","file_path":"sos21-database/migrations/20210309032212_structured_project_query.sql","rank":66,"score":117092.68574765943},{"content":"DELETE FROM form_project_query_conjunctions\n\nWHERE form_id = $1\n\n\"#,\n\n form_id,\n\n )\n\n .execute(conn)\n\n .await\n\n .context(\"Failed to delete from form project query conjunctions\")?;\n\n\n\n Ok(())\n\n}\n","file_path":"sos21-database/src/command/delete_form_project_query_conjunctions.rs","rank":67,"score":114714.23862719187},{"content":"CREATE INDEX form_project_query_conjunctions_form_id_idx\n\n ON form_project_query_conjunctions ( form_id );\n","file_path":"sos21-database/migrations/20210309032212_structured_project_query.sql","rank":68,"score":113560.88494810452},{"content":"DELETE FROM registration_form_project_query_conjunctions\n\nWHERE registration_form_id = $1\n\n\"#,\n\n registration_form_id,\n\n )\n\n .execute(conn)\n\n .await\n\n .context(\"Failed to delete from registration form project query conjunctions\")?;\n\n\n\n Ok(())\n\n}\n","file_path":"sos21-database/src/command/delete_registration_form_project_query_conjunctions.rs","rank":69,"score":112430.49238666163},{"content":"ALTER TYPE file_sharing_scope ADD VALUE 'project_query';\n\nCOMMIT; -- we need to commit current transaction before we use 'project_query' enum value\n\n\n","file_path":"sos21-database/migrations/20210615083430_add_project_query_file_sharing.sql","rank":70,"score":111322.38203134136},{"content":"struct ObjectDataStream {\n\n summary_sender: Option<oneshot::Sender<ObjectDataSummary>>,\n\n acc_size: u64,\n\n acc_hasher: blake3::Hasher,\n\n stream: Pin<Box<dyn Stream<Item = Result<Bytes>> + Send + 'static>>,\n\n}\n\n\n\nimpl ObjectDataStream {\n\n fn new<S>(stream: S, summary_sender: Option<oneshot::Sender<ObjectDataSummary>>) -> Self\n\n where\n\n S: Stream<Item = Result<Bytes>> + Send + 'static,\n\n {\n\n ObjectDataStream {\n\n summary_sender,\n\n acc_size: 0,\n\n acc_hasher: blake3::Hasher::new(),\n\n stream: Box::pin(stream),\n\n }\n\n }\n\n}\n","file_path":"sos21-domain/src/model/object/data.rs","rank":71,"score":108671.93000760958},{"content":"pub fn new_project_index() -> ProjectIndex {\n\n let index = NEXT_PROJECT_INDEX.get_or_init(|| AtomicU16::new(0));\n\n let index = index.fetch_add(1, Ordering::SeqCst);\n\n ProjectIndex::from_u16(index).unwrap()\n\n}\n\n\n","file_path":"sos21-domain/src/test/model/project.rs","rank":72,"score":107115.73071066369},{"content":"pub fn mock_project_description() -> ProjectDescription {\n\n ProjectDescription::from_string(\"これはテスト用のモックデータです。\").unwrap()\n\n}\n\n\n","file_path":"sos21-domain/src/test/model/project.rs","rank":73,"score":107115.73071066369},{"content":"pub fn mock_project_name() -> ProjectName {\n\n ProjectName::from_string(\"mock プロジェクト\").unwrap()\n\n}\n\n\n","file_path":"sos21-domain/src/test/model/project.rs","rank":74,"score":107115.73071066369},{"content":"pub fn new_project_id() -> ProjectId {\n\n ProjectId::from_uuid(Uuid::new_v4())\n\n}\n\n\n\nstatic NEXT_PROJECT_INDEX: OnceCell<AtomicU16> = OnceCell::new();\n\n\n","file_path":"sos21-domain/src/test/model/project.rs","rank":75,"score":107115.73071066369},{"content":"pub fn mock_project_kana_name() -> ProjectKanaName {\n\n ProjectKanaName::from_string(\"モック プロジェクト\").unwrap()\n\n}\n\n\n","file_path":"sos21-domain/src/test/model/project.rs","rank":76,"score":104775.91905478286},{"content":"pub fn mock_project_group_name() -> ProjectGroupName {\n\n ProjectGroupName::from_string(\"jsys20\").unwrap()\n\n}\n\n\n","file_path":"sos21-domain/src/test/model/project.rs","rank":77,"score":104775.91905478286},{"content":"/// # Panics\n\n///\n\n/// This function panics when `attributes` contains duplicated elements.\n\npub fn new_project_with_attributes(\n\n owner_id: UserId,\n\n category: ProjectCategory,\n\n attributes: &[ProjectAttribute],\n\n) -> Project {\n\n Project::from_content(\n\n ProjectContent {\n\n id: new_project_id(),\n\n index: new_project_index(),\n\n created_at: DateTime::now(),\n\n updated_at: DateTime::now(),\n\n name: mock_project_name(),\n\n kana_name: mock_project_kana_name(),\n\n group_name: mock_project_group_name(),\n\n kana_group_name: mock_project_kana_group_name(),\n\n description: mock_project_description(),\n\n category,\n\n attributes: ProjectAttributes::from_attributes(attributes.iter().copied()).unwrap(),\n\n },\n\n owner_id,\n\n test_model::KNOWN_MOCK_GENERAL_USER_ID.clone(),\n\n )\n\n .unwrap()\n\n}\n\n\n","file_path":"sos21-domain/src/test/model/project.rs","rank":78,"score":104540.40557394199},{"content":"#[derive(Clone, PartialEq, Eq, PartialOrd, Ord, Hash)]\n\nstruct ProjectNameString<Max> {\n\n _max: PhantomData<Max>,\n\n inner: String,\n\n}\n\n\n\nimpl<Max> Debug for ProjectNameString<Max> {\n\n fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {\n\n <String as Debug>::fmt(&self.inner, f)\n\n }\n\n}\n\n\n\nimpl<Max> AsRef<str> for ProjectNameString<Max> {\n\n fn as_ref(&self) -> &str {\n\n self.as_str()\n\n }\n\n}\n\n\n\nimpl<Max> ProjectNameString<Max> {\n\n pub fn from_string(s: String) -> Result<Self, NameLengthError>\n\n where\n","file_path":"sos21-domain/src/model/project/name.rs","rank":79,"score":104540.40557394199},{"content":"pub fn new_project_with_subowner(\n\n owner_id: UserId,\n\n subowner_id: UserId,\n\n category: ProjectCategory,\n\n) -> Project {\n\n Project::from_content(\n\n ProjectContent {\n\n id: new_project_id(),\n\n index: new_project_index(),\n\n created_at: DateTime::now(),\n\n updated_at: DateTime::now(),\n\n name: mock_project_name(),\n\n kana_name: mock_project_kana_name(),\n\n group_name: mock_project_group_name(),\n\n kana_group_name: mock_project_kana_group_name(),\n\n description: mock_project_description(),\n\n category,\n\n attributes: ProjectAttributes::from_attributes(vec![]).unwrap(),\n\n },\n\n owner_id,\n\n subowner_id,\n\n )\n\n .unwrap()\n\n}\n\n\n","file_path":"sos21-domain/src/test/model/project.rs","rank":80,"score":104540.40557394199},{"content":"ALTER TABLE forms DROP COLUMN cooking_query;\n","file_path":"sos21-database/migrations/20210309032212_structured_project_query.sql","rank":81,"score":104332.12731859912},{"content":"ALTER TABLE forms DROP COLUMN general_query;\n","file_path":"sos21-database/migrations/20210309032212_structured_project_query.sql","rank":82,"score":104332.12731859912},{"content":"ALTER TABLE forms DROP COLUMN unspecified_query;\n","file_path":"sos21-database/migrations/20210309032212_structured_project_query.sql","rank":83,"score":104332.12731859912},{"content":"DROP FUNCTION form_query_match(bit(16), integer);\n\n\n","file_path":"sos21-database/migrations/20210309032212_structured_project_query.sql","rank":84,"score":104332.12731859912},{"content":"ALTER TABLE forms DROP COLUMN stage_query;\n","file_path":"sos21-database/migrations/20210309032212_structured_project_query.sql","rank":85,"score":104332.12731859912},{"content":"ALTER TABLE forms DROP COLUMN food_query;\n","file_path":"sos21-database/migrations/20210309032212_structured_project_query.sql","rank":86,"score":104332.12731859912},{"content":"pub fn list_forms_by_project<'a, E>(\n\n conn: E,\n\n project_id: Uuid,\n\n) -> BoxStream<'a, Result<ProjectFormData>>\n\nwhere\n\n E: sqlx::Executor<'a, Database = sqlx::Postgres> + 'a,\n\n{\n\n sqlx::query!(\n\n r#\"\n\nWITH project_forms AS (\n\n SELECT forms.id\n\n FROM forms\n\n LEFT OUTER JOIN form_condition_includes\n\n ON form_condition_includes.form_id = forms.id\n\n LEFT OUTER JOIN form_condition_excludes\n\n ON form_condition_excludes.form_id = forms.id\n\n WHERE (\n\n (\n\n form_condition_excludes.project_id IS NULL\n\n OR form_condition_excludes.project_id <> $1\n","file_path":"sos21-database/src/query/list_forms_by_project.rs","rank":87,"score":103877.40242268599},{"content":"pub fn list_projects<'a, E>(conn: E) -> BoxStream<'a, Result<ProjectWithOwners>>\n\nwhere\n\n E: sqlx::Executor<'a, Database = sqlx::Postgres> + 'a,\n\n{\n\n // TODO: Remove tedeous null forcings\n\n sqlx::query!(\n\n r#\"\n\nSELECT\n\n projects.id AS \"id!\",\n\n projects.index AS \"index!\",\n\n projects.created_at AS \"created_at!\",\n\n projects.updated_at AS \"updated_at!\",\n\n projects.name AS \"name!\",\n\n projects.kana_name AS \"kana_name!\",\n\n projects.group_name AS \"group_name!\",\n\n projects.kana_group_name AS \"kana_group_name!\",\n\n projects.description AS \"description!\",\n\n projects.category AS \"category!: ProjectCategory\",\n\n projects.attributes AS \"attributes!: ProjectAttributes\",\n\n owners.id AS \"owner_id!\",\n","file_path":"sos21-database/src/query/list_projects.rs","rank":88,"score":103370.91590275247},{"content":"#[derive(Debug, Clone, Copy)]\n\nenum ProjectCreationPeriodInner {\n\n Always,\n\n Never,\n\n Range {\n\n starts_at: DateTime,\n\n ends_at: DateTime,\n\n },\n\n}\n\n\n\n#[derive(Debug, Clone, Copy)]\n\npub struct ProjectCreationPeriod {\n\n inner: ProjectCreationPeriodInner,\n\n}\n\n\n\n#[derive(Debug, Error, Clone)]\n\n#[error(\"invalid project creation period\")]\n\npub struct PeriodError {\n\n _priv: (),\n\n}\n\n\n","file_path":"sos21-domain/src/model/project_creation_period.rs","rank":89,"score":103165.81230025922},{"content":"pub fn mock_project_kana_group_name() -> ProjectKanaGroupName {\n\n ProjectKanaGroupName::from_string(\"じょーしすにじゅう\").unwrap()\n\n}\n\n\n","file_path":"sos21-domain/src/test/model/project.rs","rank":90,"score":102550.11970927144},{"content":" let (tx, rx) = oneshot::channel();\n\n let receiver = ObjectDataSummaryReceiver(rx);\n\n (\n\n ObjectData(ObjectDataStream::new(stream, Some(tx))),\n\n receiver,\n\n )\n\n }\n\n\n\n pub fn into_stream(self) -> impl Stream<Item = Result<Bytes>> + Send + 'static {\n\n self.0\n\n }\n\n}\n\n\n\n#[cfg(test)]\n\nmod tests {\n\n use crate::test::model as test_model;\n\n use futures::stream::TryStreamExt;\n\n\n\n #[tokio::test]\n\n async fn test_summary_size_sum() {\n","file_path":"sos21-domain/src/model/object/data.rs","rank":91,"score":102428.89329298255},{"content":"use std::convert::TryInto;\n\nuse std::fmt::{self, Debug};\n\nuse std::future::Future;\n\nuse std::pin::Pin;\n\nuse std::task::{Context, Poll};\n\n\n\nuse anyhow::{Context as _, Result};\n\nuse bytes::Bytes;\n\nuse futures::{\n\n channel::oneshot,\n\n future::FutureExt,\n\n stream::{Stream, StreamExt},\n\n};\n\n\n\n/// Summary of [`ObjectData`].\n\n#[derive(Debug, Clone)]\n\npub struct ObjectDataSummary {\n\n pub number_of_bytes: u64,\n\n pub blake3_digest: [u8; 32],\n\n}\n\n\n","file_path":"sos21-domain/src/model/object/data.rs","rank":92,"score":102424.47029826876},{"content":" let (data, _digest, _size, receiver) = test_model::new_object_data_with_summary();\n\n let mut total_size = 0;\n\n let mut stream = data.into_stream();\n\n while let Some(chunk) = stream.try_next().await.unwrap() {\n\n total_size += chunk.len();\n\n }\n\n let summary = receiver.await.unwrap();\n\n assert_eq!(summary.number_of_bytes, total_size as u64);\n\n }\n\n\n\n #[tokio::test]\n\n async fn test_summary_size_expected() {\n\n let (data, _digest, expected_size, receiver) = test_model::new_object_data_with_summary();\n\n // consume the stream\n\n data.into_stream().try_collect::<Vec<_>>().await.unwrap();\n\n let summary = receiver.await.unwrap();\n\n assert_eq!(summary.number_of_bytes, expected_size);\n\n }\n\n\n\n #[tokio::test]\n","file_path":"sos21-domain/src/model/object/data.rs","rank":93,"score":102423.85358281154},{"content":" async fn test_summary_digest_sum() {\n\n let (data, _digest, _size, receiver) = test_model::new_object_data_with_summary();\n\n let mut hasher = blake3::Hasher::new();\n\n let mut stream = data.into_stream();\n\n while let Some(chunk) = stream.try_next().await.unwrap() {\n\n hasher.update(&chunk);\n\n }\n\n let digest: [u8; 32] = hasher.finalize().into();\n\n let summary = receiver.await.unwrap();\n\n assert_eq!(summary.blake3_digest, digest);\n\n }\n\n\n\n #[tokio::test]\n\n async fn test_summary_digest_expected() {\n\n let (data, expected_digest, _size, receiver) = test_model::new_object_data_with_summary();\n\n // consume the stream\n\n data.into_stream().try_collect::<Vec<_>>().await.unwrap();\n\n let summary = receiver.await.unwrap();\n\n assert_eq!(summary.blake3_digest, expected_digest);\n\n }\n\n}\n","file_path":"sos21-domain/src/model/object/data.rs","rank":94,"score":102423.69364194214},{"content":" self.stream.size_hint()\n\n }\n\n}\n\n\n\n#[derive(Debug)]\n\npub struct ObjectData(ObjectDataStream);\n\n\n\n/// Future that recieves [`ObjectDataSummary`] after reading all the data in [`ObjectData`].\n\n#[derive(Debug)]\n\npub struct ObjectDataSummaryReceiver(oneshot::Receiver<ObjectDataSummary>);\n\n\n\nimpl Future for ObjectDataSummaryReceiver {\n\n type Output = Result<ObjectDataSummary>;\n\n\n\n fn poll(mut self: Pin<&mut Self>, cx: &mut Context) -> Poll<Self::Output> {\n\n self.0.poll_unpin(cx).map(|result| {\n\n result.context(\"ObjectDataSummaryReceiver polled after the stream is failed\")\n\n })\n\n }\n\n}\n","file_path":"sos21-domain/src/model/object/data.rs","rank":95,"score":102419.72323482524},{"content":"\n\nimpl ObjectData {\n\n /// Creates `ObjectData` by wrapping a stream.\n\n pub fn from_stream<S>(stream: S) -> Self\n\n where\n\n S: Stream<Item = Result<Bytes>> + Send + 'static,\n\n {\n\n ObjectData(ObjectDataStream::new(stream, None))\n\n }\n\n\n\n /// Creates `ObjectData` by wrapping a stream and returns a `Future` that recieves\n\n /// [`ObjectDataSummary`] after reading all the object data.\n\n ///\n\n /// We don't want to have all of the `ObjectData` in memory at once, so we compute the summary\n\n /// of the content (currently size and digest) as we read the data, and return it when the\n\n /// reading is complete.\n\n pub fn from_stream_with_summary<S>(stream: S) -> (Self, ObjectDataSummaryReceiver)\n\n where\n\n S: Stream<Item = Result<Bytes>> + Send + 'static,\n\n {\n","file_path":"sos21-domain/src/model/object/data.rs","rank":96,"score":102419.68700848111},{"content":"\n\nimpl Debug for ObjectDataStream {\n\n fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {\n\n f.debug_struct(\"ObjectDataStream\")\n\n .field(\"acc_size\", &self.acc_size)\n\n .field(\"acc_hasher\", &self.acc_hasher)\n\n .field(\"summary_sender\", &self.summary_sender)\n\n .finish()\n\n }\n\n}\n\n\n\nimpl Stream for ObjectDataStream {\n\n type Item = Result<Bytes>;\n\n\n\n fn poll_next(mut self: Pin<&mut Self>, cx: &mut Context) -> Poll<Option<Self::Item>> {\n\n match futures::ready!(self.stream.poll_next_unpin(cx)) {\n\n Some(Ok(bytes)) => {\n\n if self.summary_sender.is_some() {\n\n let len: u64 = bytes.len().try_into()?;\n\n self.acc_size += len;\n","file_path":"sos21-domain/src/model/object/data.rs","rank":97,"score":102418.3528962003},{"content":" // TODO: Consider running on a thread where blocking is acceptable\n\n self.acc_hasher.update(&bytes);\n\n }\n\n Poll::Ready(Some(Ok(bytes)))\n\n }\n\n Some(Err(err)) => Poll::Ready(Some(Err(err))),\n\n None => {\n\n if let Some(sender) = self.summary_sender.take() {\n\n let summary = ObjectDataSummary {\n\n number_of_bytes: self.acc_size,\n\n blake3_digest: self.acc_hasher.finalize().into(),\n\n };\n\n let _ = sender.send(summary);\n\n }\n\n Poll::Ready(None)\n\n }\n\n }\n\n }\n\n\n\n fn size_hint(&self) -> (usize, Option<usize>) {\n","file_path":"sos21-domain/src/model/object/data.rs","rank":98,"score":102416.86466836264},{"content":"use crate::model::{\n\n project::{Project, ProjectAttributes, ProjectCategory, ProjectWithOwners},\n\n user::{User, UserAssignment, UserCategory, UserRole},\n\n};\n\n\n\nuse anyhow::{Context, Result};\n\nuse uuid::Uuid;\n\n\n\npub async fn find_project<'a, E>(conn: E, id: Uuid) -> Result<Option<ProjectWithOwners>>\n\nwhere\n\n E: sqlx::Executor<'a, Database = sqlx::Postgres>,\n\n{\n\n let row = sqlx::query!(\n\n r#\"\n\nSELECT\n\n projects.id,\n\n projects.index,\n\n projects.created_at,\n\n projects.updated_at,\n\n projects.name,\n","file_path":"sos21-database/src/query/find_project.rs","rank":99,"score":102377.460375202}],"string":"[\n {\n \"content\": \"use crate::model::project::{ProjectAttribute, ProjectCategory};\\n\\n\\n\\nuse sos21_domain::model::project_query as entity;\\n\\n\\n\\n#[derive(Debug, Clone, PartialEq, Eq)]\\n\\npub struct ProjectQueryConjunction {\\n\\n pub category: Option<ProjectCategory>,\\n\\n pub attributes: Vec<ProjectAttribute>,\\n\\n}\\n\\n\\n\\nimpl ProjectQueryConjunction {\\n\\n pub fn from_entity(conj: entity::ProjectQueryConjunction) -> Self {\\n\\n ProjectQueryConjunction {\\n\\n category: conj.category().map(ProjectCategory::from_entity),\\n\\n attributes: conj\\n\\n .attributes()\\n\\n .map(ProjectAttribute::from_entity)\\n\\n .collect(),\\n\\n }\\n\\n }\\n\",\n \"file_path\": \"sos21-use-case/src/model/project_query.rs\",\n \"rank\": 0,\n \"score\": 198425.30508398678\n },\n {\n \"content\": \"}\\n\\n\\n\\n#[derive(Debug, Clone, PartialEq, Eq)]\\n\\npub struct ProjectQuery(pub Vec<ProjectQueryConjunction>);\\n\\n\\n\\nimpl ProjectQuery {\\n\\n pub fn from_entity(query: entity::ProjectQuery) -> Self {\\n\\n ProjectQuery(\\n\\n query\\n\\n .into_conjunctions()\\n\\n .map(ProjectQueryConjunction::from_entity)\\n\\n .collect(),\\n\\n )\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"sos21-use-case/src/model/project_query.rs\",\n \"rank\": 1,\n \"score\": 198416.20889991458\n },\n {\n \"content\": \"fn from_project(project: Project) -> data::project::Project {\\n\\n let ProjectContent {\\n\\n id,\\n\\n index,\\n\\n created_at,\\n\\n updated_at,\\n\\n name,\\n\\n kana_name,\\n\\n group_name,\\n\\n kana_group_name,\\n\\n description,\\n\\n category,\\n\\n attributes,\\n\\n } = project.into_content();\\n\\n\\n\\n data::project::Project {\\n\\n id: id.to_uuid(),\\n\\n index: index.to_i16(),\\n\\n created_at: created_at.utc(),\\n\\n updated_at: updated_at.utc(),\\n\\n name: name.into_string(),\\n\\n kana_name: kana_name.into_string(),\\n\\n group_name: group_name.into_string(),\\n\\n kana_group_name: kana_group_name.into_string(),\\n\\n description: description.into_string(),\\n\\n category: from_project_category(category),\\n\\n attributes: from_project_attributes(&attributes),\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"sos21-gateway/database/src/project_repository.rs\",\n \"rank\": 2,\n \"score\": 187765.3097458245\n },\n {\n \"content\": \"pub fn mock_project_query() -> ProjectQuery {\\n\\n ProjectQuery::from_conjunctions(vec![ProjectQueryConjunction {\\n\\n category: None,\\n\\n attributes: ProjectAttributes::from_attributes(Vec::new()).unwrap(),\\n\\n }])\\n\\n .unwrap()\\n\\n}\\n\",\n \"file_path\": \"sos21-domain/src/test/model/project_query.rs\",\n \"rank\": 3,\n \"score\": 170010.15173757763\n },\n {\n \"content\": \"pub fn to_project_query(\\n\\n query: ProjectQuery,\\n\\n) -> Result<project_query::ProjectQuery, ProjectQueryError> {\\n\\n let dnf = query\\n\\n .0\\n\\n .into_iter()\\n\\n .map(to_project_query_conjunction)\\n\\n .collect::<Result<Vec<_>, _>>()?;\\n\\n project_query::ProjectQuery::from_conjunctions(dnf).map_err(ProjectQueryError::from_query_error)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"sos21-use-case/src/interface/project_query.rs\",\n \"rank\": 4,\n \"score\": 164702.7926567635\n },\n {\n \"content\": \"pub fn to_project_query_conjunction(\\n\\n conj: ProjectQueryConjunction,\\n\\n) -> Result<project_query::ProjectQueryConjunction, ProjectQueryError> {\\n\\n let category = conj.category.map(ProjectCategory::into_entity);\\n\\n let attributes = project::ProjectAttributes::from_attributes(\\n\\n conj.attributes\\n\\n .into_iter()\\n\\n .map(ProjectAttribute::into_entity),\\n\\n )\\n\\n .map_err(ProjectQueryError::from_attributes_error)?;\\n\\n\\n\\n Ok(project_query::ProjectQueryConjunction {\\n\\n category,\\n\\n attributes,\\n\\n })\\n\\n}\\n\",\n \"file_path\": \"sos21-use-case/src/interface/project_query.rs\",\n \"rank\": 5,\n \"score\": 162705.37138906482\n },\n {\n \"content\": \"pub fn to_project_category(category: data::project::ProjectCategory) -> ProjectCategory {\\n\\n match category {\\n\\n data::project::ProjectCategory::General => ProjectCategory::General,\\n\\n data::project::ProjectCategory::Stage => ProjectCategory::Stage,\\n\\n data::project::ProjectCategory::Cooking => ProjectCategory::Cooking,\\n\\n data::project::ProjectCategory::Food => ProjectCategory::Food,\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"sos21-gateway/database/src/project_repository.rs\",\n \"rank\": 6,\n \"score\": 160553.34528123\n },\n {\n \"content\": \"pub fn from_project_category(category: ProjectCategory) -> data::project::ProjectCategory {\\n\\n match category {\\n\\n ProjectCategory::General => data::project::ProjectCategory::General,\\n\\n ProjectCategory::Stage => data::project::ProjectCategory::Stage,\\n\\n ProjectCategory::Cooking => data::project::ProjectCategory::Cooking,\\n\\n ProjectCategory::Food => data::project::ProjectCategory::Food,\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"sos21-gateway/database/src/project_repository.rs\",\n \"rank\": 7,\n \"score\": 160553.34528123\n },\n {\n \"content\": \"pub fn from_project_attributes(attributes: &ProjectAttributes) -> data::project::ProjectAttributes {\\n\\n attributes\\n\\n .attributes()\\n\\n .map(|attr| match attr {\\n\\n ProjectAttribute::Academic => data::project::ProjectAttributes::ACADEMIC,\\n\\n ProjectAttribute::Artistic => data::project::ProjectAttributes::ARTISTIC,\\n\\n ProjectAttribute::Committee => data::project::ProjectAttributes::COMMITTEE,\\n\\n ProjectAttribute::Outdoor => data::project::ProjectAttributes::OUTDOOR,\\n\\n })\\n\\n .collect()\\n\\n}\\n\\n\\n\",\n \"file_path\": \"sos21-gateway/database/src/project_repository.rs\",\n \"rank\": 8,\n \"score\": 160553.34528123\n },\n {\n \"content\": \"use std::collections::HashSet;\\n\\n\\n\\nuse crate::model::bound::{Bounded, Unbounded};\\n\\nuse crate::model::collection::LengthLimitedVec;\\n\\nuse crate::model::pending_project::PendingProject;\\n\\nuse crate::model::project::{Project, ProjectAttribute, ProjectAttributes, ProjectCategory};\\n\\n\\n\\nuse serde::{Deserialize, Serialize};\\n\\nuse thiserror::Error;\\n\\n\\n\\n#[derive(Debug, Clone, PartialEq, Eq, Serialize, Deserialize)]\\n\\npub struct ProjectQueryConjunction {\\n\\n pub category: Option<ProjectCategory>,\\n\\n pub attributes: ProjectAttributes,\\n\\n}\\n\\n\\n\\nimpl ProjectQueryConjunction {\\n\\n pub fn category(&self) -> Option<ProjectCategory> {\\n\\n self.category\\n\\n }\\n\",\n \"file_path\": \"sos21-domain/src/model/project_query.rs\",\n \"rank\": 9,\n \"score\": 152275.8516704615\n },\n {\n \"content\": \"#[cfg(test)]\\n\\nmod tests {\\n\\n use super::{ProjectQuery, ProjectQueryConjunction};\\n\\n use crate::{\\n\\n model::project::{ProjectAttribute, ProjectAttributes, ProjectCategory},\\n\\n test::model as test_model,\\n\\n };\\n\\n\\n\\n #[test]\\n\\n fn test_conj_tautology() {\\n\\n let conj = ProjectQueryConjunction {\\n\\n category: None,\\n\\n attributes: ProjectAttributes::from_attributes(vec![]).unwrap(),\\n\\n };\\n\\n let project1 = test_model::new_general_project(test_model::new_user_id());\\n\\n assert!(conj.check_project(&project1));\\n\\n let project2 = test_model::new_project_with_attributes(\\n\\n test_model::new_user_id(),\\n\\n ProjectCategory::General,\\n\\n &[\\n\",\n \"file_path\": \"sos21-domain/src/model/project_query.rs\",\n \"rank\": 10,\n \"score\": 152275.65394851848\n },\n {\n \"content\": \" ],\\n\\n );\\n\\n assert!(!query.check_project(&project2));\\n\\n }\\n\\n\\n\\n #[test]\\n\\n fn test_pending_project_contradiction() {\\n\\n let query = ProjectQuery::from_conjunctions(vec![]).unwrap();\\n\\n let pending_project = test_model::new_general_pending_project(test_model::new_user_id());\\n\\n assert!(!query.check_pending_project(&pending_project));\\n\\n let pending_project = test_model::new_pending_project_with_attributes(\\n\\n test_model::new_user_id(),\\n\\n ProjectCategory::General,\\n\\n &[\\n\\n ProjectAttribute::Artistic,\\n\\n ProjectAttribute::Academic,\\n\\n ProjectAttribute::Committee,\\n\\n ],\\n\\n );\\n\\n assert!(!query.check_pending_project(&pending_project));\\n\",\n \"file_path\": \"sos21-domain/src/model/project_query.rs\",\n \"rank\": 11,\n \"score\": 152271.26454618823\n },\n {\n \"content\": \" );\\n\\n assert!(query.check_pending_project(&pending_project));\\n\\n }\\n\\n\\n\\n #[test]\\n\\n fn test_contradiction() {\\n\\n let query = ProjectQuery::from_conjunctions(vec![]).unwrap();\\n\\n let project1 = test_model::new_project_with_attributes(\\n\\n test_model::new_user_id(),\\n\\n ProjectCategory::General,\\n\\n &[],\\n\\n );\\n\\n assert!(!query.check_project(&project1));\\n\\n let project2 = test_model::new_project_with_attributes(\\n\\n test_model::new_user_id(),\\n\\n ProjectCategory::General,\\n\\n &[\\n\\n ProjectAttribute::Artistic,\\n\\n ProjectAttribute::Academic,\\n\\n ProjectAttribute::Committee,\\n\",\n \"file_path\": \"sos21-domain/src/model/project_query.rs\",\n \"rank\": 12,\n \"score\": 152271.1714327333\n },\n {\n \"content\": \" assert!(query.check_project(&project2));\\n\\n }\\n\\n\\n\\n #[test]\\n\\n fn test_pending_project_tautology() {\\n\\n let conj = ProjectQueryConjunction {\\n\\n category: None,\\n\\n attributes: ProjectAttributes::from_attributes(vec![]).unwrap(),\\n\\n };\\n\\n let query = ProjectQuery::from_conjunctions(vec![conj]).unwrap();\\n\\n let pending_project = test_model::new_general_pending_project(test_model::new_user_id());\\n\\n assert!(query.check_pending_project(&pending_project));\\n\\n let pending_project = test_model::new_pending_project_with_attributes(\\n\\n test_model::new_user_id(),\\n\\n ProjectCategory::General,\\n\\n &[\\n\\n ProjectAttribute::Artistic,\\n\\n ProjectAttribute::Academic,\\n\\n ProjectAttribute::Committee,\\n\\n ],\\n\",\n \"file_path\": \"sos21-domain/src/model/project_query.rs\",\n \"rank\": 13,\n \"score\": 152271.08739944882\n },\n {\n \"content\": \" let conj = ProjectQueryConjunction {\\n\\n category: None,\\n\\n attributes: ProjectAttributes::from_attributes(vec![]).unwrap(),\\n\\n };\\n\\n let query = ProjectQuery::from_conjunctions(vec![conj]).unwrap();\\n\\n let project1 = test_model::new_project_with_attributes(\\n\\n test_model::new_user_id(),\\n\\n ProjectCategory::General,\\n\\n &[],\\n\\n );\\n\\n assert!(query.check_project(&project1));\\n\\n let project2 = test_model::new_project_with_attributes(\\n\\n test_model::new_user_id(),\\n\\n ProjectCategory::General,\\n\\n &[\\n\\n ProjectAttribute::Artistic,\\n\\n ProjectAttribute::Academic,\\n\\n ProjectAttribute::Committee,\\n\\n ],\\n\\n );\\n\",\n \"file_path\": \"sos21-domain/src/model/project_query.rs\",\n \"rank\": 14,\n \"score\": 152271.06886088796\n },\n {\n \"content\": \" ProjectCategory::General,\\n\\n &[ProjectAttribute::Academic],\\n\\n );\\n\\n assert!(!query.check_project(&project1));\\n\\n let project2 = test_model::new_project_with_attributes(\\n\\n test_model::new_user_id(),\\n\\n ProjectCategory::Stage,\\n\\n &[ProjectAttribute::Academic],\\n\\n );\\n\\n assert!(query.check_project(&project2));\\n\\n let project3 = test_model::new_project_with_attributes(\\n\\n test_model::new_user_id(),\\n\\n ProjectCategory::Stage,\\n\\n &[ProjectAttribute::Academic, ProjectAttribute::Committee],\\n\\n );\\n\\n assert!(query.check_project(&project3));\\n\\n let project4 = test_model::new_project_with_attributes(\\n\\n test_model::new_user_id(),\\n\\n ProjectCategory::General,\\n\\n &[ProjectAttribute::Academic, ProjectAttribute::Committee],\\n\",\n \"file_path\": \"sos21-domain/src/model/project_query.rs\",\n \"rank\": 15,\n \"score\": 152270.76206389038\n },\n {\n \"content\": \" let pending_project = test_model::new_pending_project_with_attributes(\\n\\n test_model::new_user_id(),\\n\\n ProjectCategory::General,\\n\\n &[ProjectAttribute::Academic],\\n\\n );\\n\\n assert!(!query.check_pending_project(&pending_project));\\n\\n let pending_project = test_model::new_pending_project_with_attributes(\\n\\n test_model::new_user_id(),\\n\\n ProjectCategory::Stage,\\n\\n &[ProjectAttribute::Academic],\\n\\n );\\n\\n assert!(query.check_pending_project(&pending_project));\\n\\n let pending_project = test_model::new_pending_project_with_attributes(\\n\\n test_model::new_user_id(),\\n\\n ProjectCategory::Stage,\\n\\n &[ProjectAttribute::Academic, ProjectAttribute::Committee],\\n\\n );\\n\\n assert!(query.check_pending_project(&pending_project));\\n\\n let pending_project = test_model::new_pending_project_with_attributes(\\n\\n test_model::new_user_id(),\\n\",\n \"file_path\": \"sos21-domain/src/model/project_query.rs\",\n \"rank\": 16,\n \"score\": 152270.7278846383\n },\n {\n \"content\": \" }\\n\\n\\n\\n #[test]\\n\\n fn test_complex() {\\n\\n let conj1 = ProjectQueryConjunction {\\n\\n category: Some(ProjectCategory::Stage),\\n\\n attributes: ProjectAttributes::from_attributes(vec![ProjectAttribute::Academic])\\n\\n .unwrap(),\\n\\n };\\n\\n let conj2 = ProjectQueryConjunction {\\n\\n category: None,\\n\\n attributes: ProjectAttributes::from_attributes(vec![\\n\\n ProjectAttribute::Academic,\\n\\n ProjectAttribute::Committee,\\n\\n ])\\n\\n .unwrap(),\\n\\n };\\n\\n let query = ProjectQuery::from_conjunctions(vec![conj1, conj2]).unwrap();\\n\\n let project1 = test_model::new_project_with_attributes(\\n\\n test_model::new_user_id(),\\n\",\n \"file_path\": \"sos21-domain/src/model/project_query.rs\",\n \"rank\": 17,\n \"score\": 152270.1910802704\n },\n {\n \"content\": \" }\\n\\n\\n\\n #[test]\\n\\n fn test_conj_category() {\\n\\n let conj = ProjectQueryConjunction {\\n\\n category: Some(ProjectCategory::General),\\n\\n attributes: ProjectAttributes::from_attributes(vec![]).unwrap(),\\n\\n };\\n\\n assert!(conj.check_project(&test_model::new_general_project(test_model::new_user_id())));\\n\\n assert!(!conj.check_project(&test_model::new_stage_project(test_model::new_user_id())));\\n\\n }\\n\\n\\n\\n #[test]\\n\\n fn test_pending_project_conj_category() {\\n\\n let conj = ProjectQueryConjunction {\\n\\n category: Some(ProjectCategory::General),\\n\\n attributes: ProjectAttributes::from_attributes(vec![]).unwrap(),\\n\\n };\\n\\n assert!(\\n\\n conj.check_pending_project(&test_model::new_general_pending_project(\\n\",\n \"file_path\": \"sos21-domain/src/model/project_query.rs\",\n \"rank\": 18,\n \"score\": 152269.80204510805\n },\n {\n \"content\": \" }\\n\\n\\n\\n #[test]\\n\\n fn test_conj_attribute_multiple() {\\n\\n let conj = ProjectQueryConjunction {\\n\\n category: None,\\n\\n attributes: ProjectAttributes::from_attributes(vec![\\n\\n ProjectAttribute::Artistic,\\n\\n ProjectAttribute::Committee,\\n\\n ])\\n\\n .unwrap(),\\n\\n };\\n\\n let project1 = test_model::new_project_with_attributes(\\n\\n test_model::new_user_id(),\\n\\n ProjectCategory::General,\\n\\n &[],\\n\\n );\\n\\n assert!(!conj.check_project(&project1));\\n\\n let project2 = test_model::new_project_with_attributes(\\n\\n test_model::new_user_id(),\\n\",\n \"file_path\": \"sos21-domain/src/model/project_query.rs\",\n \"rank\": 19,\n \"score\": 152268.90688524136\n },\n {\n \"content\": \" test_model::new_user_id()\\n\\n ))\\n\\n );\\n\\n assert!(\\n\\n !conj.check_pending_project(&test_model::new_stage_pending_project(\\n\\n test_model::new_user_id()\\n\\n ))\\n\\n );\\n\\n }\\n\\n\\n\\n #[test]\\n\\n fn test_conj_complex() {\\n\\n let conj = ProjectQueryConjunction {\\n\\n category: Some(ProjectCategory::Stage),\\n\\n attributes: ProjectAttributes::from_attributes(vec![\\n\\n ProjectAttribute::Academic,\\n\\n ProjectAttribute::Committee,\\n\\n ])\\n\\n .unwrap(),\\n\\n };\\n\",\n \"file_path\": \"sos21-domain/src/model/project_query.rs\",\n \"rank\": 20,\n \"score\": 152268.88041851646\n },\n {\n \"content\": \" }\\n\\n\\n\\n #[test]\\n\\n fn test_pending_project_conj_attribute_multiple() {\\n\\n let conj = ProjectQueryConjunction {\\n\\n category: None,\\n\\n attributes: ProjectAttributes::from_attributes(vec![\\n\\n ProjectAttribute::Artistic,\\n\\n ProjectAttribute::Committee,\\n\\n ])\\n\\n .unwrap(),\\n\\n };\\n\\n let pending_project = test_model::new_pending_project_with_attributes(\\n\\n test_model::new_user_id(),\\n\\n ProjectCategory::General,\\n\\n &[],\\n\\n );\\n\\n assert!(!conj.check_pending_project(&pending_project));\\n\\n let pending_project = test_model::new_pending_project_with_attributes(\\n\\n test_model::new_user_id(),\\n\",\n \"file_path\": \"sos21-domain/src/model/project_query.rs\",\n \"rank\": 21,\n \"score\": 152268.79016914836\n },\n {\n \"content\": \" ProjectAttribute::Artistic,\\n\\n ProjectAttribute::Academic,\\n\\n ProjectAttribute::Committee,\\n\\n ],\\n\\n );\\n\\n assert!(conj.check_project(&project2));\\n\\n }\\n\\n\\n\\n #[test]\\n\\n fn test_pending_project_conj_tautology() {\\n\\n let conj = ProjectQueryConjunction {\\n\\n category: None,\\n\\n attributes: ProjectAttributes::from_attributes(vec![]).unwrap(),\\n\\n };\\n\\n let pending_project = test_model::new_general_pending_project(test_model::new_user_id());\\n\\n assert!(conj.check_pending_project(&pending_project));\\n\\n let pending_project = test_model::new_pending_project_with_attributes(\\n\\n test_model::new_user_id(),\\n\\n ProjectCategory::General,\\n\\n &[\\n\",\n \"file_path\": \"sos21-domain/src/model/project_query.rs\",\n \"rank\": 22,\n \"score\": 152268.58545169188\n },\n {\n \"content\": \" ProjectCategory::Stage,\\n\\n &[ProjectAttribute::Academic],\\n\\n );\\n\\n assert!(!conj.check_project(&project4));\\n\\n }\\n\\n\\n\\n #[test]\\n\\n fn test_pending_project_conj_complex() {\\n\\n let conj = ProjectQueryConjunction {\\n\\n category: Some(ProjectCategory::Stage),\\n\\n attributes: ProjectAttributes::from_attributes(vec![\\n\\n ProjectAttribute::Academic,\\n\\n ProjectAttribute::Committee,\\n\\n ])\\n\\n .unwrap(),\\n\\n };\\n\\n let pending_project = test_model::new_general_pending_project(test_model::new_user_id());\\n\\n assert!(!conj.check_pending_project(&pending_project));\\n\\n let pending_project = test_model::new_pending_project_with_attributes(\\n\\n test_model::new_user_id(),\\n\",\n \"file_path\": \"sos21-domain/src/model/project_query.rs\",\n \"rank\": 23,\n \"score\": 152268.54117270064\n },\n {\n \"content\": \" &[ProjectAttribute::Academic, ProjectAttribute::Committee],\\n\\n );\\n\\n assert!(!conj.check_project(&project4));\\n\\n }\\n\\n\\n\\n #[test]\\n\\n fn test_pending_project_conj_attribute_single() {\\n\\n let conj = ProjectQueryConjunction {\\n\\n category: None,\\n\\n attributes: ProjectAttributes::from_attributes(vec![ProjectAttribute::Artistic])\\n\\n .unwrap(),\\n\\n };\\n\\n let pending_project = test_model::new_pending_project_with_attributes(\\n\\n test_model::new_user_id(),\\n\\n ProjectCategory::General,\\n\\n &[],\\n\\n );\\n\\n assert!(!conj.check_pending_project(&pending_project));\\n\\n let pending_project = test_model::new_pending_project_with_attributes(\\n\\n test_model::new_user_id(),\\n\",\n \"file_path\": \"sos21-domain/src/model/project_query.rs\",\n \"rank\": 24,\n \"score\": 152268.54689700063\n },\n {\n \"content\": \" ProjectCategory::General,\\n\\n &[ProjectAttribute::Academic, ProjectAttribute::Committee],\\n\\n );\\n\\n assert!(query.check_pending_project(&pending_project));\\n\\n }\\n\\n\\n\\n #[test]\\n\\n fn test_conj_possible_categories() {\\n\\n use std::collections::HashSet;\\n\\n\\n\\n let conj1 = ProjectQueryConjunction {\\n\\n category: Some(ProjectCategory::Stage),\\n\\n attributes: ProjectAttributes::from_attributes(vec![ProjectAttribute::Academic])\\n\\n .unwrap(),\\n\\n };\\n\\n assert_eq!(\\n\\n conj1.possible_categories().collect::<Vec<_>>(),\\n\\n vec![ProjectCategory::Stage]\\n\\n );\\n\\n let conj2 = ProjectQueryConjunction {\\n\",\n \"file_path\": \"sos21-domain/src/model/project_query.rs\",\n \"rank\": 25,\n \"score\": 152268.54047007006\n },\n {\n \"content\": \" ProjectAttribute::Artistic,\\n\\n ProjectAttribute::Academic,\\n\\n ProjectAttribute::Committee,\\n\\n ],\\n\\n );\\n\\n assert!(conj.check_pending_project(&pending_project));\\n\\n }\\n\\n\\n\\n #[test]\\n\\n fn test_conj_attribute_single() {\\n\\n let conj = ProjectQueryConjunction {\\n\\n category: None,\\n\\n attributes: ProjectAttributes::from_attributes(vec![ProjectAttribute::Artistic])\\n\\n .unwrap(),\\n\\n };\\n\\n let project1 = test_model::new_project_with_attributes(\\n\\n test_model::new_user_id(),\\n\\n ProjectCategory::General,\\n\\n &[],\\n\\n );\\n\",\n \"file_path\": \"sos21-domain/src/model/project_query.rs\",\n \"rank\": 26,\n \"score\": 152268.25771560182\n },\n {\n \"content\": \" category: None,\\n\\n attributes: ProjectAttributes::from_attributes(vec![ProjectAttribute::Academic])\\n\\n .unwrap(),\\n\\n };\\n\\n assert_eq!(\\n\\n conj2.possible_categories().collect::<HashSet<_>>(),\\n\\n ProjectCategory::enumerate().collect::<HashSet<_>>()\\n\\n );\\n\\n }\\n\\n\\n\\n #[test]\\n\\n fn test_possible_categories() {\\n\\n use std::collections::HashSet;\\n\\n\\n\\n let conj1 = ProjectQueryConjunction {\\n\\n category: Some(ProjectCategory::Stage),\\n\\n attributes: ProjectAttributes::from_attributes(vec![ProjectAttribute::Academic])\\n\\n .unwrap(),\\n\\n };\\n\\n let conj2 = ProjectQueryConjunction {\\n\",\n \"file_path\": \"sos21-domain/src/model/project_query.rs\",\n \"rank\": 27,\n \"score\": 152267.86258933257\n },\n {\n \"content\": \" );\\n\\n assert!(query.check_project(&project4));\\n\\n }\\n\\n\\n\\n #[test]\\n\\n fn test_pending_project_complex() {\\n\\n let conj1 = ProjectQueryConjunction {\\n\\n category: Some(ProjectCategory::Stage),\\n\\n attributes: ProjectAttributes::from_attributes(vec![ProjectAttribute::Academic])\\n\\n .unwrap(),\\n\\n };\\n\\n let conj2 = ProjectQueryConjunction {\\n\\n category: None,\\n\\n attributes: ProjectAttributes::from_attributes(vec![\\n\\n ProjectAttribute::Academic,\\n\\n ProjectAttribute::Committee,\\n\\n ])\\n\\n .unwrap(),\\n\\n };\\n\\n let query = ProjectQuery::from_conjunctions(vec![conj1, conj2]).unwrap();\\n\",\n \"file_path\": \"sos21-domain/src/model/project_query.rs\",\n \"rank\": 28,\n \"score\": 152265.55414267784\n },\n {\n \"content\": \" let project1 = test_model::new_project_with_attributes(\\n\\n test_model::new_user_id(),\\n\\n ProjectCategory::General,\\n\\n &[],\\n\\n );\\n\\n assert!(!conj.check_project(&project1));\\n\\n let project2 = test_model::new_project_with_attributes(\\n\\n test_model::new_user_id(),\\n\\n ProjectCategory::General,\\n\\n &[ProjectAttribute::Academic, ProjectAttribute::Committee],\\n\\n );\\n\\n assert!(!conj.check_project(&project2));\\n\\n let project3 = test_model::new_project_with_attributes(\\n\\n test_model::new_user_id(),\\n\\n ProjectCategory::Stage,\\n\\n &[ProjectAttribute::Academic, ProjectAttribute::Committee],\\n\\n );\\n\\n assert!(conj.check_project(&project3));\\n\\n let project4 = test_model::new_project_with_attributes(\\n\\n test_model::new_user_id(),\\n\",\n \"file_path\": \"sos21-domain/src/model/project_query.rs\",\n \"rank\": 29,\n \"score\": 152265.38073899617\n },\n {\n \"content\": \" assert!(!conj.check_project(&project1));\\n\\n let project2 = test_model::new_project_with_attributes(\\n\\n test_model::new_user_id(),\\n\\n ProjectCategory::General,\\n\\n &[ProjectAttribute::Artistic, ProjectAttribute::Committee],\\n\\n );\\n\\n assert!(conj.check_project(&project2));\\n\\n let project3 = test_model::new_project_with_attributes(\\n\\n test_model::new_user_id(),\\n\\n ProjectCategory::General,\\n\\n &[\\n\\n ProjectAttribute::Artistic,\\n\\n ProjectAttribute::Academic,\\n\\n ProjectAttribute::Committee,\\n\\n ],\\n\\n );\\n\\n assert!(conj.check_project(&project3));\\n\\n let project4 = test_model::new_project_with_attributes(\\n\\n test_model::new_user_id(),\\n\\n ProjectCategory::General,\\n\",\n \"file_path\": \"sos21-domain/src/model/project_query.rs\",\n \"rank\": 30,\n \"score\": 152265.2296177635\n },\n {\n \"content\": \"impl ProjectQuery {\\n\\n pub fn from_conjunctions<I>(conj: I) -> Result<Self, FromConjunctionsError>\\n\\n where\\n\\n I: IntoIterator<Item = ProjectQueryConjunction>,\\n\\n {\\n\\n let dnf = LengthLimitedVec::new(conj.into_iter().collect()).map_err(|_| {\\n\\n FromConjunctionsError {\\n\\n kind: FromConjunctionsErrorKind::TooBigDisjunction,\\n\\n }\\n\\n })?;\\n\\n Ok(ProjectQuery(dnf))\\n\\n }\\n\\n\\n\\n pub fn conjunctions(&self) -> impl Iterator<Item = &'_ ProjectQueryConjunction> + '_ {\\n\\n self.0.iter()\\n\\n }\\n\\n\\n\\n pub fn into_conjunctions(self) -> impl Iterator<Item = ProjectQueryConjunction> {\\n\\n self.0.into_inner().into_iter()\\n\\n }\\n\",\n \"file_path\": \"sos21-domain/src/model/project_query.rs\",\n \"rank\": 31,\n \"score\": 152264.92515582946\n },\n {\n \"content\": \" ProjectCategory::General,\\n\\n &[ProjectAttribute::Artistic, ProjectAttribute::Committee],\\n\\n );\\n\\n assert!(conj.check_project(&project2));\\n\\n let project3 = test_model::new_project_with_attributes(\\n\\n test_model::new_user_id(),\\n\\n ProjectCategory::General,\\n\\n &[\\n\\n ProjectAttribute::Artistic,\\n\\n ProjectAttribute::Academic,\\n\\n ProjectAttribute::Committee,\\n\\n ],\\n\\n );\\n\\n assert!(conj.check_project(&project3));\\n\\n let project4 = test_model::new_project_with_attributes(\\n\\n test_model::new_user_id(),\\n\\n ProjectCategory::General,\\n\\n &[ProjectAttribute::Artistic, ProjectAttribute::Academic],\\n\\n );\\n\\n assert!(!conj.check_project(&project4));\\n\",\n \"file_path\": \"sos21-domain/src/model/project_query.rs\",\n \"rank\": 32,\n \"score\": 152264.89675750217\n },\n {\n \"content\": \" ProjectCategory::General,\\n\\n &[ProjectAttribute::Academic, ProjectAttribute::Committee],\\n\\n );\\n\\n assert!(!conj.check_pending_project(&pending_project));\\n\\n let pending_project = test_model::new_pending_project_with_attributes(\\n\\n test_model::new_user_id(),\\n\\n ProjectCategory::Stage,\\n\\n &[ProjectAttribute::Academic, ProjectAttribute::Committee],\\n\\n );\\n\\n assert!(conj.check_pending_project(&pending_project));\\n\\n let pending_project = test_model::new_pending_project_with_attributes(\\n\\n test_model::new_user_id(),\\n\\n ProjectCategory::Stage,\\n\\n &[ProjectAttribute::Academic],\\n\\n );\\n\\n assert!(!conj.check_pending_project(&pending_project));\\n\\n }\\n\\n\\n\\n #[test]\\n\\n fn test_tautology() {\\n\",\n \"file_path\": \"sos21-domain/src/model/project_query.rs\",\n \"rank\": 33,\n \"score\": 152264.85279360975\n },\n {\n \"content\": \" ProjectCategory::General,\\n\\n &[ProjectAttribute::Artistic, ProjectAttribute::Committee],\\n\\n );\\n\\n assert!(conj.check_pending_project(&pending_project));\\n\\n let pending_project = test_model::new_pending_project_with_attributes(\\n\\n test_model::new_user_id(),\\n\\n ProjectCategory::General,\\n\\n &[\\n\\n ProjectAttribute::Artistic,\\n\\n ProjectAttribute::Academic,\\n\\n ProjectAttribute::Committee,\\n\\n ],\\n\\n );\\n\\n assert!(conj.check_pending_project(&pending_project));\\n\\n let pending_project = test_model::new_pending_project_with_attributes(\\n\\n test_model::new_user_id(),\\n\\n ProjectCategory::General,\\n\\n &[ProjectAttribute::Academic, ProjectAttribute::Committee],\\n\\n );\\n\\n assert!(!conj.check_pending_project(&pending_project));\\n\",\n \"file_path\": \"sos21-domain/src/model/project_query.rs\",\n \"rank\": 34,\n \"score\": 152264.84448710762\n },\n {\n \"content\": \" ProjectCategory::General,\\n\\n &[ProjectAttribute::Artistic, ProjectAttribute::Committee],\\n\\n );\\n\\n assert!(conj.check_pending_project(&pending_project));\\n\\n let pending_project = test_model::new_pending_project_with_attributes(\\n\\n test_model::new_user_id(),\\n\\n ProjectCategory::General,\\n\\n &[\\n\\n ProjectAttribute::Artistic,\\n\\n ProjectAttribute::Academic,\\n\\n ProjectAttribute::Committee,\\n\\n ],\\n\\n );\\n\\n assert!(conj.check_pending_project(&pending_project));\\n\\n let pending_project = test_model::new_pending_project_with_attributes(\\n\\n test_model::new_user_id(),\\n\\n ProjectCategory::General,\\n\\n &[ProjectAttribute::Artistic, ProjectAttribute::Academic],\\n\\n );\\n\\n assert!(!conj.check_pending_project(&pending_project));\\n\",\n \"file_path\": \"sos21-domain/src/model/project_query.rs\",\n \"rank\": 35,\n \"score\": 152264.84448710762\n },\n {\n \"content\": \" };\\n\\n let conj2 = ProjectQueryConjunction {\\n\\n category: None,\\n\\n attributes: ProjectAttributes::from_attributes(vec![\\n\\n ProjectAttribute::Academic,\\n\\n ProjectAttribute::Committee,\\n\\n ])\\n\\n .unwrap(),\\n\\n };\\n\\n let query2 = ProjectQuery::from_conjunctions(vec![conj1, conj2]).unwrap();\\n\\n assert_eq!(\\n\\n query2.possible_categories().collect::<HashSet<_>>(),\\n\\n ProjectCategory::enumerate().collect::<HashSet<_>>()\\n\\n );\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"sos21-domain/src/model/project_query.rs\",\n \"rank\": 36,\n \"score\": 152264.3550161643\n },\n {\n \"content\": \" category: Some(ProjectCategory::Food),\\n\\n attributes: ProjectAttributes::from_attributes(vec![\\n\\n ProjectAttribute::Academic,\\n\\n ProjectAttribute::Committee,\\n\\n ])\\n\\n .unwrap(),\\n\\n };\\n\\n let query1 = ProjectQuery::from_conjunctions(vec![conj1, conj2]).unwrap();\\n\\n assert_eq!(\\n\\n query1.possible_categories().collect::<HashSet<_>>(),\\n\\n [ProjectCategory::Stage, ProjectCategory::Food]\\n\\n .iter()\\n\\n .copied()\\n\\n .collect::<HashSet<_>>()\\n\\n );\\n\\n\\n\\n let conj1 = ProjectQueryConjunction {\\n\\n category: Some(ProjectCategory::Stage),\\n\\n attributes: ProjectAttributes::from_attributes(vec![ProjectAttribute::Academic])\\n\\n .unwrap(),\\n\",\n \"file_path\": \"sos21-domain/src/model/project_query.rs\",\n \"rank\": 37,\n \"score\": 152264.13926949448\n },\n {\n \"content\": \" pub fn possible_categories(&self) -> impl Iterator<Item = ProjectCategory> {\\n\\n if let Some(expected) = self.category {\\n\\n std::iter::once(expected)\\n\\n } else {\\n\\n ProjectCategory::enumerate()\\n\\n }\\n\\n }\\n\\n\\n\\n pub fn check_project(&self, project: &Project) -> bool {\\n\\n self.check_category_attributes(project.category(), project.attributes())\\n\\n }\\n\\n\\n\\n pub fn check_pending_project(&self, pending_project: &PendingProject) -> bool {\\n\\n self.check_category_attributes(pending_project.category(), pending_project.attributes())\\n\\n }\\n\\n}\\n\\n\\n\\n#[derive(Debug, Clone, PartialEq, Eq, Serialize, Deserialize)]\\n\\n#[serde(transparent)]\\n\\npub struct ProjectQuery(\\n\",\n \"file_path\": \"sos21-domain/src/model/project_query.rs\",\n \"rank\": 38,\n \"score\": 152262.93416239735\n },\n {\n \"content\": \" LengthLimitedVec<Unbounded, Bounded<typenum::U32>, ProjectQueryConjunction>,\\n\\n);\\n\\n\\n\\n#[derive(Debug, Clone, Copy, PartialEq, Eq)]\\n\\npub enum FromConjunctionsErrorKind {\\n\\n TooBigDisjunction,\\n\\n}\\n\\n\\n\\n#[derive(Debug, Error, Clone)]\\n\\n#[error(\\\"invalid project query\\\")]\\n\\npub struct FromConjunctionsError {\\n\\n kind: FromConjunctionsErrorKind,\\n\\n}\\n\\n\\n\\nimpl FromConjunctionsError {\\n\\n pub fn kind(&self) -> FromConjunctionsErrorKind {\\n\\n self.kind\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"sos21-domain/src/model/project_query.rs\",\n \"rank\": 39,\n \"score\": 152262.87962607262\n },\n {\n \"content\": \"\\n\\n pub fn possible_categories(&self) -> impl Iterator<Item = ProjectCategory> {\\n\\n let categories: HashSet<_> = self\\n\\n .conjunctions()\\n\\n .map(|conj| conj.possible_categories())\\n\\n .flatten()\\n\\n .collect();\\n\\n categories.into_iter()\\n\\n }\\n\\n\\n\\n pub fn check_project(&self, project: &Project) -> bool {\\n\\n self.conjunctions().any(|conj| conj.check_project(project))\\n\\n }\\n\\n\\n\\n pub fn check_pending_project(&self, pending_project: &PendingProject) -> bool {\\n\\n self.conjunctions()\\n\\n .any(|conj| conj.check_pending_project(pending_project))\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"sos21-domain/src/model/project_query.rs\",\n \"rank\": 40,\n \"score\": 152259.0026354699\n },\n {\n \"content\": \"\\n\\n pub fn attributes(&self) -> impl Iterator<Item = ProjectAttribute> + '_ {\\n\\n self.attributes.attributes()\\n\\n }\\n\\n\\n\\n fn check_category_attributes(\\n\\n &self,\\n\\n category: ProjectCategory,\\n\\n attributes: &ProjectAttributes,\\n\\n ) -> bool {\\n\\n if let Some(expected) = self.category {\\n\\n if expected != category {\\n\\n return false;\\n\\n }\\n\\n }\\n\\n\\n\\n self.attributes.is_subset(attributes)\\n\\n }\\n\\n\\n\\n #[auto_enums::auto_enum(Iterator)]\\n\",\n \"file_path\": \"sos21-domain/src/model/project_query.rs\",\n \"rank\": 41,\n \"score\": 152258.2239682385\n },\n {\n \"content\": \"use crate::model::user::{UserId, UserKanaName, UserName};\\n\\n\\n\\nuse chrono::{DateTime, Utc};\\n\\nuse sos21_domain::model::project as entity;\\n\\nuse uuid::Uuid;\\n\\n\\n\\n#[derive(Debug, Clone, Copy, PartialEq, Eq, PartialOrd, Ord, Hash)]\\n\\npub struct ProjectId(pub Uuid);\\n\\n\\n\\nimpl ProjectId {\\n\\n pub fn from_entity(id: entity::ProjectId) -> ProjectId {\\n\\n ProjectId(id.to_uuid())\\n\\n }\\n\\n\\n\\n pub fn into_entity(self) -> entity::ProjectId {\\n\\n entity::ProjectId::from_uuid(self.0)\\n\\n }\\n\\n}\\n\\n\\n\\n#[derive(Debug, Clone, Copy, PartialEq, Eq, PartialOrd, Ord, Hash)]\\n\",\n \"file_path\": \"sos21-use-case/src/model/project.rs\",\n \"rank\": 42,\n \"score\": 149849.09841760315\n },\n {\n \"content\": \" pub owner_kana_name: sos21_domain::model::user::UserKanaName,\\n\\n pub subowner_name: sos21_domain::model::user::UserName,\\n\\n pub subowner_kana_name: sos21_domain::model::user::UserKanaName,\\n\\n}\\n\\n\\n\\nimpl Project {\\n\\n pub fn from_entity(input: ProjectFromEntityInput) -> Self {\\n\\n let ProjectFromEntityInput {\\n\\n project,\\n\\n owner_name,\\n\\n owner_kana_name,\\n\\n subowner_name,\\n\\n subowner_kana_name,\\n\\n } = input;\\n\\n\\n\\n Project {\\n\\n id: ProjectId::from_entity(project.id()),\\n\\n code: project.code().to_string(),\\n\\n created_at: project.created_at().utc(),\\n\\n updated_at: project.updated_at().utc(),\\n\",\n \"file_path\": \"sos21-use-case/src/model/project.rs\",\n \"rank\": 43,\n \"score\": 149844.3214872564\n },\n {\n \"content\": \" pub updated_at: DateTime<Utc>,\\n\\n pub owner_id: UserId,\\n\\n pub owner_name: UserName,\\n\\n pub owner_kana_name: UserKanaName,\\n\\n pub subowner_id: UserId,\\n\\n pub subowner_name: UserName,\\n\\n pub subowner_kana_name: UserKanaName,\\n\\n pub name: String,\\n\\n pub kana_name: String,\\n\\n pub group_name: String,\\n\\n pub kana_group_name: String,\\n\\n pub description: String,\\n\\n pub category: ProjectCategory,\\n\\n pub attributes: Vec<ProjectAttribute>,\\n\\n}\\n\\n\\n\\n#[derive(Debug, Clone)]\\n\\npub struct ProjectFromEntityInput {\\n\\n pub project: entity::Project,\\n\\n pub owner_name: sos21_domain::model::user::UserName,\\n\",\n \"file_path\": \"sos21-use-case/src/model/project.rs\",\n \"rank\": 44,\n \"score\": 149841.45362635623\n },\n {\n \"content\": \"pub enum ProjectCategory {\\n\\n General,\\n\\n Stage,\\n\\n Cooking,\\n\\n Food,\\n\\n}\\n\\n\\n\\nimpl ProjectCategory {\\n\\n pub fn from_entity(category: entity::ProjectCategory) -> ProjectCategory {\\n\\n match category {\\n\\n entity::ProjectCategory::General => ProjectCategory::General,\\n\\n entity::ProjectCategory::Stage => ProjectCategory::Stage,\\n\\n entity::ProjectCategory::Cooking => ProjectCategory::Cooking,\\n\\n entity::ProjectCategory::Food => ProjectCategory::Food,\\n\\n }\\n\\n }\\n\\n\\n\\n pub fn into_entity(self) -> entity::ProjectCategory {\\n\\n match self {\\n\\n ProjectCategory::General => entity::ProjectCategory::General,\\n\",\n \"file_path\": \"sos21-use-case/src/model/project.rs\",\n \"rank\": 45,\n \"score\": 149839.25692147156\n },\n {\n \"content\": \" entity::ProjectAttribute::Committee => ProjectAttribute::Committee,\\n\\n entity::ProjectAttribute::Outdoor => ProjectAttribute::Outdoor,\\n\\n }\\n\\n }\\n\\n\\n\\n pub fn into_entity(self) -> entity::ProjectAttribute {\\n\\n match self {\\n\\n ProjectAttribute::Academic => entity::ProjectAttribute::Academic,\\n\\n ProjectAttribute::Artistic => entity::ProjectAttribute::Artistic,\\n\\n ProjectAttribute::Committee => entity::ProjectAttribute::Committee,\\n\\n ProjectAttribute::Outdoor => entity::ProjectAttribute::Outdoor,\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\n#[derive(Debug, Clone, PartialEq, Eq)]\\n\\npub struct Project {\\n\\n pub id: ProjectId,\\n\\n pub code: String,\\n\\n pub created_at: DateTime<Utc>,\\n\",\n \"file_path\": \"sos21-use-case/src/model/project.rs\",\n \"rank\": 46,\n \"score\": 149839.22338487586\n },\n {\n \"content\": \" ProjectCategory::Stage => entity::ProjectCategory::Stage,\\n\\n ProjectCategory::Cooking => entity::ProjectCategory::Cooking,\\n\\n ProjectCategory::Food => entity::ProjectCategory::Food,\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\n#[derive(Debug, Clone, Copy, PartialEq, Eq, PartialOrd, Ord, Hash)]\\n\\npub enum ProjectAttribute {\\n\\n Academic,\\n\\n Artistic,\\n\\n Committee,\\n\\n Outdoor,\\n\\n}\\n\\n\\n\\nimpl ProjectAttribute {\\n\\n pub fn from_entity(attribute: entity::ProjectAttribute) -> ProjectAttribute {\\n\\n match attribute {\\n\\n entity::ProjectAttribute::Academic => ProjectAttribute::Academic,\\n\\n entity::ProjectAttribute::Artistic => ProjectAttribute::Artistic,\\n\",\n \"file_path\": \"sos21-use-case/src/model/project.rs\",\n \"rank\": 47,\n \"score\": 149839.20155868452\n },\n {\n \"content\": \" owner_id: UserId::from_entity(project.owner_id().clone()),\\n\\n owner_name: UserName::from_entity(owner_name),\\n\\n owner_kana_name: UserKanaName::from_entity(owner_kana_name),\\n\\n subowner_id: UserId::from_entity(project.subowner_id().clone()),\\n\\n subowner_name: UserName::from_entity(subowner_name),\\n\\n subowner_kana_name: UserKanaName::from_entity(subowner_kana_name),\\n\\n name: project.name().clone().into_string(),\\n\\n kana_name: project.kana_name().clone().into_string(),\\n\\n group_name: project.group_name().clone().into_string(),\\n\\n kana_group_name: project.kana_group_name().clone().into_string(),\\n\\n description: project.description().clone().into_string(),\\n\\n category: ProjectCategory::from_entity(project.category()),\\n\\n attributes: project\\n\\n .attributes()\\n\\n .attributes()\\n\\n .map(ProjectAttribute::from_entity)\\n\\n .collect(),\\n\\n }\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"sos21-use-case/src/model/project.rs\",\n \"rank\": 48,\n \"score\": 149838.87134291802\n },\n {\n \"content\": \"use crate::model::{\\n\\n project::ProjectAttributes,\\n\\n project_query::{ProjectQuery, ProjectQueryConjunction},\\n\\n};\\n\\n\\n\",\n \"file_path\": \"sos21-domain/src/test/model/project_query.rs\",\n \"rank\": 49,\n \"score\": 149565.44828472455\n },\n {\n \"content\": \"use crate::model::project::{ProjectAttribute, ProjectCategory};\\n\\nuse crate::model::project_query::{ProjectQuery, ProjectQueryConjunction};\\n\\n\\n\\nuse sos21_domain::model::{project, project_query};\\n\\n\\n\\n#[derive(Debug, Clone)]\\n\\npub enum ProjectQueryError {\\n\\n TooBigQuery,\\n\\n DuplicatedAttributes,\\n\\n}\\n\\n\\n\\nimpl ProjectQueryError {\\n\\n fn from_query_error(err: project_query::FromConjunctionsError) -> Self {\\n\\n match err.kind() {\\n\\n project_query::FromConjunctionsErrorKind::TooBigDisjunction => {\\n\\n ProjectQueryError::TooBigQuery\\n\\n }\\n\\n }\\n\\n }\\n\\n\\n\\n fn from_attributes_error(_err: project::attribute::DuplicatedAttributesError) -> Self {\\n\\n ProjectQueryError::DuplicatedAttributes\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"sos21-use-case/src/interface/project_query.rs\",\n \"rank\": 50,\n \"score\": 149420.4424117174\n },\n {\n \"content\": \"use crate::model::project::{ProjectAttribute, ProjectCategory};\\n\\nuse crate::model::user::UserId;\\n\\n\\n\\nuse chrono::{DateTime, Utc};\\n\\nuse sos21_domain::model::pending_project as entity;\\n\\nuse uuid::Uuid;\\n\\n\\n\\n#[derive(Debug, Clone, Copy, PartialEq, Eq, PartialOrd, Ord, Hash)]\\n\\npub struct PendingProjectId(pub Uuid);\\n\\n\\n\\nimpl PendingProjectId {\\n\\n pub fn from_entity(id: entity::PendingProjectId) -> Self {\\n\\n PendingProjectId(id.to_uuid())\\n\\n }\\n\\n\\n\\n pub fn into_entity(self) -> entity::PendingProjectId {\\n\\n entity::PendingProjectId::from_uuid(self.0)\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"sos21-use-case/src/model/pending_project.rs\",\n \"rank\": 51,\n \"score\": 147182.94873374188\n },\n {\n \"content\": \" updated_at: pending_project.updated_at().utc(),\\n\\n owner_id: UserId::from_entity(pending_project.owner_id().clone()),\\n\\n name: pending_project.name().clone().into_string(),\\n\\n kana_name: pending_project.kana_name().clone().into_string(),\\n\\n group_name: pending_project.group_name().clone().into_string(),\\n\\n kana_group_name: pending_project.kana_group_name().clone().into_string(),\\n\\n description: pending_project.description().clone().into_string(),\\n\\n category: ProjectCategory::from_entity(pending_project.category()),\\n\\n attributes: pending_project\\n\\n .attributes()\\n\\n .attributes()\\n\\n .map(ProjectAttribute::from_entity)\\n\\n .collect(),\\n\\n }\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"sos21-use-case/src/model/pending_project.rs\",\n \"rank\": 52,\n \"score\": 147171.75237552324\n },\n {\n \"content\": \"#[derive(Debug, Clone, PartialEq, Eq)]\\n\\npub struct PendingProject {\\n\\n pub id: PendingProjectId,\\n\\n pub created_at: DateTime<Utc>,\\n\\n pub updated_at: DateTime<Utc>,\\n\\n pub owner_id: UserId,\\n\\n pub name: String,\\n\\n pub kana_name: String,\\n\\n pub group_name: String,\\n\\n pub kana_group_name: String,\\n\\n pub description: String,\\n\\n pub category: ProjectCategory,\\n\\n pub attributes: Vec<ProjectAttribute>,\\n\\n}\\n\\n\\n\\nimpl PendingProject {\\n\\n pub fn from_entity(pending_project: entity::PendingProject) -> Self {\\n\\n PendingProject {\\n\\n id: PendingProjectId::from_entity(pending_project.id()),\\n\\n created_at: pending_project.created_at().utc(),\\n\",\n \"file_path\": \"sos21-use-case/src/model/pending_project.rs\",\n \"rank\": 53,\n \"score\": 147171.67310805267\n },\n {\n \"content\": \"use crate::handler::model::project::{ProjectAttribute, ProjectCategory};\\n\\n\\n\\nuse serde::{Deserialize, Serialize};\\n\\nuse sos21_use_case::model::project_query as use_case;\\n\\n\\n\\n#[derive(Debug, Clone, Serialize, Deserialize)]\\n\\npub struct ProjectQueryConjunction {\\n\\n pub category: Option<ProjectCategory>,\\n\\n pub attributes: Vec<ProjectAttribute>,\\n\\n}\\n\\n\\n\\nimpl ProjectQueryConjunction {\\n\\n pub fn from_use_case(conj: use_case::ProjectQueryConjunction) -> Self {\\n\\n let category = conj.category.map(ProjectCategory::from_use_case);\\n\\n let attributes = conj\\n\\n .attributes\\n\\n .into_iter()\\n\\n .map(ProjectAttribute::from_use_case)\\n\\n .collect();\\n\\n ProjectQueryConjunction {\\n\",\n \"file_path\": \"sos21-api-server/src/handler/model/project_query.rs\",\n \"rank\": 54,\n \"score\": 146950.36099811818\n },\n {\n \"content\": \"#[serde(transparent)]\\n\\npub struct ProjectQuery(pub Vec<ProjectQueryConjunction>);\\n\\n\\n\\nimpl ProjectQuery {\\n\\n pub fn from_use_case(query: use_case::ProjectQuery) -> Self {\\n\\n let query = query\\n\\n .0\\n\\n .into_iter()\\n\\n .map(ProjectQueryConjunction::from_use_case)\\n\\n .collect();\\n\\n ProjectQuery(query)\\n\\n }\\n\\n\\n\\n pub fn into_use_case(self) -> use_case::ProjectQuery {\\n\\n let query = self\\n\\n .0\\n\\n .into_iter()\\n\\n .map(ProjectQueryConjunction::into_use_case)\\n\\n .collect();\\n\\n use_case::ProjectQuery(query)\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"sos21-api-server/src/handler/model/project_query.rs\",\n \"rank\": 55,\n \"score\": 146946.6325884428\n },\n {\n \"content\": \" category,\\n\\n attributes,\\n\\n }\\n\\n }\\n\\n\\n\\n pub fn into_use_case(self) -> use_case::ProjectQueryConjunction {\\n\\n let category = self.category.map(ProjectCategory::into_use_case);\\n\\n let attributes = self\\n\\n .attributes\\n\\n .into_iter()\\n\\n .map(ProjectAttribute::into_use_case)\\n\\n .collect();\\n\\n use_case::ProjectQueryConjunction {\\n\\n category,\\n\\n attributes,\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\n#[derive(Debug, Clone, Serialize, Deserialize)]\\n\",\n \"file_path\": \"sos21-api-server/src/handler/model/project_query.rs\",\n \"rank\": 56,\n \"score\": 146944.50167020422\n },\n {\n \"content\": \"pub fn new_form_with_query(author_id: UserId, query: ProjectQuery) -> Form {\\n\\n new_form_with_condition(\\n\\n author_id,\\n\\n FormCondition {\\n\\n query,\\n\\n includes: FormConditionProjectSet::from_projects(Vec::new()).unwrap(),\\n\\n excludes: FormConditionProjectSet::from_projects(Vec::new()).unwrap(),\\n\\n },\\n\\n )\\n\\n}\\n\\n\\n\",\n \"file_path\": \"sos21-domain/src/test/model/form.rs\",\n \"rank\": 57,\n \"score\": 143993.30258058585\n },\n {\n \"content\": \"pub fn new_pending_project_id() -> PendingProjectId {\\n\\n PendingProjectId::from_uuid(Uuid::new_v4())\\n\\n}\\n\\n\\n\",\n \"file_path\": \"sos21-domain/src/test/model/pending_project.rs\",\n \"rank\": 59,\n \"score\": 136237.3987147163\n },\n {\n \"content\": \"pub fn new_stage_project(owner_id: UserId) -> Project {\\n\\n new_project(owner_id, ProjectCategory::Stage)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"sos21-domain/src/test/model/project.rs\",\n \"rank\": 60,\n \"score\": 131997.367562924\n },\n {\n \"content\": \"pub fn new_general_project(owner_id: UserId) -> Project {\\n\\n new_project(owner_id, ProjectCategory::General)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"sos21-domain/src/test/model/project.rs\",\n \"rank\": 61,\n \"score\": 131997.367562924\n },\n {\n \"content\": \"pub fn new_project(owner_id: UserId, category: ProjectCategory) -> Project {\\n\\n new_project_with_attributes(owner_id, category, &[])\\n\\n}\\n\\n\\n\",\n \"file_path\": \"sos21-domain/src/test/model/project.rs\",\n \"rank\": 62,\n \"score\": 130067.49357434284\n },\n {\n \"content\": \"pub fn new_form_answer(author_id: UserId, project: &Project, form: &Form) -> FormAnswer {\\n\\n new_form_answer_with_items(\\n\\n author_id,\\n\\n project,\\n\\n form,\\n\\n mock_form_answer_items(form.items()),\\n\\n )\\n\\n}\\n\",\n \"file_path\": \"sos21-domain/src/test/model/form_answer.rs\",\n \"rank\": 63,\n \"score\": 124015.03346618217\n },\n {\n \"content\": \"pub fn new_general_project_with_subowner(owner_id: UserId, subowner_id: UserId) -> Project {\\n\\n new_project_with_subowner(owner_id, subowner_id, ProjectCategory::General)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"sos21-domain/src/test/model/project.rs\",\n \"rank\": 64,\n \"score\": 123588.25449040602\n },\n {\n \"content\": \"pub fn new_stage_project_with_subowner(owner_id: UserId, subowner_id: UserId) -> Project {\\n\\n new_project_with_subowner(owner_id, subowner_id, ProjectCategory::Stage)\\n\\n}\\n\",\n \"file_path\": \"sos21-domain/src/test/model/project.rs\",\n \"rank\": 65,\n \"score\": 123588.25449040602\n },\n {\n \"content\": \"CREATE TABLE form_project_query_conjunctions (\\n\\n form_id uuid NOT NULL REFERENCES forms ON DELETE RESTRICT,\\n\\n category project_category,\\n\\n attributes integer NOT NULL\\n\\n);\\n\\n\\n\",\n \"file_path\": \"sos21-database/migrations/20210309032212_structured_project_query.sql\",\n \"rank\": 66,\n \"score\": 117092.68574765943\n },\n {\n \"content\": \"DELETE FROM form_project_query_conjunctions\\n\\nWHERE form_id = $1\\n\\n\\\"#,\\n\\n form_id,\\n\\n )\\n\\n .execute(conn)\\n\\n .await\\n\\n .context(\\\"Failed to delete from form project query conjunctions\\\")?;\\n\\n\\n\\n Ok(())\\n\\n}\\n\",\n \"file_path\": \"sos21-database/src/command/delete_form_project_query_conjunctions.rs\",\n \"rank\": 67,\n \"score\": 114714.23862719187\n },\n {\n \"content\": \"CREATE INDEX form_project_query_conjunctions_form_id_idx\\n\\n ON form_project_query_conjunctions ( form_id );\\n\",\n \"file_path\": \"sos21-database/migrations/20210309032212_structured_project_query.sql\",\n \"rank\": 68,\n \"score\": 113560.88494810452\n },\n {\n \"content\": \"DELETE FROM registration_form_project_query_conjunctions\\n\\nWHERE registration_form_id = $1\\n\\n\\\"#,\\n\\n registration_form_id,\\n\\n )\\n\\n .execute(conn)\\n\\n .await\\n\\n .context(\\\"Failed to delete from registration form project query conjunctions\\\")?;\\n\\n\\n\\n Ok(())\\n\\n}\\n\",\n \"file_path\": \"sos21-database/src/command/delete_registration_form_project_query_conjunctions.rs\",\n \"rank\": 69,\n \"score\": 112430.49238666163\n },\n {\n \"content\": \"ALTER TYPE file_sharing_scope ADD VALUE 'project_query';\\n\\nCOMMIT; -- we need to commit current transaction before we use 'project_query' enum value\\n\\n\\n\",\n \"file_path\": \"sos21-database/migrations/20210615083430_add_project_query_file_sharing.sql\",\n \"rank\": 70,\n \"score\": 111322.38203134136\n },\n {\n \"content\": \"struct ObjectDataStream {\\n\\n summary_sender: Option<oneshot::Sender<ObjectDataSummary>>,\\n\\n acc_size: u64,\\n\\n acc_hasher: blake3::Hasher,\\n\\n stream: Pin<Box<dyn Stream<Item = Result<Bytes>> + Send + 'static>>,\\n\\n}\\n\\n\\n\\nimpl ObjectDataStream {\\n\\n fn new<S>(stream: S, summary_sender: Option<oneshot::Sender<ObjectDataSummary>>) -> Self\\n\\n where\\n\\n S: Stream<Item = Result<Bytes>> + Send + 'static,\\n\\n {\\n\\n ObjectDataStream {\\n\\n summary_sender,\\n\\n acc_size: 0,\\n\\n acc_hasher: blake3::Hasher::new(),\\n\\n stream: Box::pin(stream),\\n\\n }\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"sos21-domain/src/model/object/data.rs\",\n \"rank\": 71,\n \"score\": 108671.93000760958\n },\n {\n \"content\": \"pub fn new_project_index() -> ProjectIndex {\\n\\n let index = NEXT_PROJECT_INDEX.get_or_init(|| AtomicU16::new(0));\\n\\n let index = index.fetch_add(1, Ordering::SeqCst);\\n\\n ProjectIndex::from_u16(index).unwrap()\\n\\n}\\n\\n\\n\",\n \"file_path\": \"sos21-domain/src/test/model/project.rs\",\n \"rank\": 72,\n \"score\": 107115.73071066369\n },\n {\n \"content\": \"pub fn mock_project_description() -> ProjectDescription {\\n\\n ProjectDescription::from_string(\\\"これはテスト用のモックデータです。\\\").unwrap()\\n\\n}\\n\\n\\n\",\n \"file_path\": \"sos21-domain/src/test/model/project.rs\",\n \"rank\": 73,\n \"score\": 107115.73071066369\n },\n {\n \"content\": \"pub fn mock_project_name() -> ProjectName {\\n\\n ProjectName::from_string(\\\"mock プロジェクト\\\").unwrap()\\n\\n}\\n\\n\\n\",\n \"file_path\": \"sos21-domain/src/test/model/project.rs\",\n \"rank\": 74,\n \"score\": 107115.73071066369\n },\n {\n \"content\": \"pub fn new_project_id() -> ProjectId {\\n\\n ProjectId::from_uuid(Uuid::new_v4())\\n\\n}\\n\\n\\n\\nstatic NEXT_PROJECT_INDEX: OnceCell<AtomicU16> = OnceCell::new();\\n\\n\\n\",\n \"file_path\": \"sos21-domain/src/test/model/project.rs\",\n \"rank\": 75,\n \"score\": 107115.73071066369\n },\n {\n \"content\": \"pub fn mock_project_kana_name() -> ProjectKanaName {\\n\\n ProjectKanaName::from_string(\\\"モック プロジェクト\\\").unwrap()\\n\\n}\\n\\n\\n\",\n \"file_path\": \"sos21-domain/src/test/model/project.rs\",\n \"rank\": 76,\n \"score\": 104775.91905478286\n },\n {\n \"content\": \"pub fn mock_project_group_name() -> ProjectGroupName {\\n\\n ProjectGroupName::from_string(\\\"jsys20\\\").unwrap()\\n\\n}\\n\\n\\n\",\n \"file_path\": \"sos21-domain/src/test/model/project.rs\",\n \"rank\": 77,\n \"score\": 104775.91905478286\n },\n {\n \"content\": \"/// # Panics\\n\\n///\\n\\n/// This function panics when `attributes` contains duplicated elements.\\n\\npub fn new_project_with_attributes(\\n\\n owner_id: UserId,\\n\\n category: ProjectCategory,\\n\\n attributes: &[ProjectAttribute],\\n\\n) -> Project {\\n\\n Project::from_content(\\n\\n ProjectContent {\\n\\n id: new_project_id(),\\n\\n index: new_project_index(),\\n\\n created_at: DateTime::now(),\\n\\n updated_at: DateTime::now(),\\n\\n name: mock_project_name(),\\n\\n kana_name: mock_project_kana_name(),\\n\\n group_name: mock_project_group_name(),\\n\\n kana_group_name: mock_project_kana_group_name(),\\n\\n description: mock_project_description(),\\n\\n category,\\n\\n attributes: ProjectAttributes::from_attributes(attributes.iter().copied()).unwrap(),\\n\\n },\\n\\n owner_id,\\n\\n test_model::KNOWN_MOCK_GENERAL_USER_ID.clone(),\\n\\n )\\n\\n .unwrap()\\n\\n}\\n\\n\\n\",\n \"file_path\": \"sos21-domain/src/test/model/project.rs\",\n \"rank\": 78,\n \"score\": 104540.40557394199\n },\n {\n \"content\": \"#[derive(Clone, PartialEq, Eq, PartialOrd, Ord, Hash)]\\n\\nstruct ProjectNameString<Max> {\\n\\n _max: PhantomData<Max>,\\n\\n inner: String,\\n\\n}\\n\\n\\n\\nimpl<Max> Debug for ProjectNameString<Max> {\\n\\n fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {\\n\\n <String as Debug>::fmt(&self.inner, f)\\n\\n }\\n\\n}\\n\\n\\n\\nimpl<Max> AsRef<str> for ProjectNameString<Max> {\\n\\n fn as_ref(&self) -> &str {\\n\\n self.as_str()\\n\\n }\\n\\n}\\n\\n\\n\\nimpl<Max> ProjectNameString<Max> {\\n\\n pub fn from_string(s: String) -> Result<Self, NameLengthError>\\n\\n where\\n\",\n \"file_path\": \"sos21-domain/src/model/project/name.rs\",\n \"rank\": 79,\n \"score\": 104540.40557394199\n },\n {\n \"content\": \"pub fn new_project_with_subowner(\\n\\n owner_id: UserId,\\n\\n subowner_id: UserId,\\n\\n category: ProjectCategory,\\n\\n) -> Project {\\n\\n Project::from_content(\\n\\n ProjectContent {\\n\\n id: new_project_id(),\\n\\n index: new_project_index(),\\n\\n created_at: DateTime::now(),\\n\\n updated_at: DateTime::now(),\\n\\n name: mock_project_name(),\\n\\n kana_name: mock_project_kana_name(),\\n\\n group_name: mock_project_group_name(),\\n\\n kana_group_name: mock_project_kana_group_name(),\\n\\n description: mock_project_description(),\\n\\n category,\\n\\n attributes: ProjectAttributes::from_attributes(vec![]).unwrap(),\\n\\n },\\n\\n owner_id,\\n\\n subowner_id,\\n\\n )\\n\\n .unwrap()\\n\\n}\\n\\n\\n\",\n \"file_path\": \"sos21-domain/src/test/model/project.rs\",\n \"rank\": 80,\n \"score\": 104540.40557394199\n },\n {\n \"content\": \"ALTER TABLE forms DROP COLUMN cooking_query;\\n\",\n \"file_path\": \"sos21-database/migrations/20210309032212_structured_project_query.sql\",\n \"rank\": 81,\n \"score\": 104332.12731859912\n },\n {\n \"content\": \"ALTER TABLE forms DROP COLUMN general_query;\\n\",\n \"file_path\": \"sos21-database/migrations/20210309032212_structured_project_query.sql\",\n \"rank\": 82,\n \"score\": 104332.12731859912\n },\n {\n \"content\": \"ALTER TABLE forms DROP COLUMN unspecified_query;\\n\",\n \"file_path\": \"sos21-database/migrations/20210309032212_structured_project_query.sql\",\n \"rank\": 83,\n \"score\": 104332.12731859912\n },\n {\n \"content\": \"DROP FUNCTION form_query_match(bit(16), integer);\\n\\n\\n\",\n \"file_path\": \"sos21-database/migrations/20210309032212_structured_project_query.sql\",\n \"rank\": 84,\n \"score\": 104332.12731859912\n },\n {\n \"content\": \"ALTER TABLE forms DROP COLUMN stage_query;\\n\",\n \"file_path\": \"sos21-database/migrations/20210309032212_structured_project_query.sql\",\n \"rank\": 85,\n \"score\": 104332.12731859912\n },\n {\n \"content\": \"ALTER TABLE forms DROP COLUMN food_query;\\n\",\n \"file_path\": \"sos21-database/migrations/20210309032212_structured_project_query.sql\",\n \"rank\": 86,\n \"score\": 104332.12731859912\n },\n {\n \"content\": \"pub fn list_forms_by_project<'a, E>(\\n\\n conn: E,\\n\\n project_id: Uuid,\\n\\n) -> BoxStream<'a, Result<ProjectFormData>>\\n\\nwhere\\n\\n E: sqlx::Executor<'a, Database = sqlx::Postgres> + 'a,\\n\\n{\\n\\n sqlx::query!(\\n\\n r#\\\"\\n\\nWITH project_forms AS (\\n\\n SELECT forms.id\\n\\n FROM forms\\n\\n LEFT OUTER JOIN form_condition_includes\\n\\n ON form_condition_includes.form_id = forms.id\\n\\n LEFT OUTER JOIN form_condition_excludes\\n\\n ON form_condition_excludes.form_id = forms.id\\n\\n WHERE (\\n\\n (\\n\\n form_condition_excludes.project_id IS NULL\\n\\n OR form_condition_excludes.project_id <> $1\\n\",\n \"file_path\": \"sos21-database/src/query/list_forms_by_project.rs\",\n \"rank\": 87,\n \"score\": 103877.40242268599\n },\n {\n \"content\": \"pub fn list_projects<'a, E>(conn: E) -> BoxStream<'a, Result<ProjectWithOwners>>\\n\\nwhere\\n\\n E: sqlx::Executor<'a, Database = sqlx::Postgres> + 'a,\\n\\n{\\n\\n // TODO: Remove tedeous null forcings\\n\\n sqlx::query!(\\n\\n r#\\\"\\n\\nSELECT\\n\\n projects.id AS \\\"id!\\\",\\n\\n projects.index AS \\\"index!\\\",\\n\\n projects.created_at AS \\\"created_at!\\\",\\n\\n projects.updated_at AS \\\"updated_at!\\\",\\n\\n projects.name AS \\\"name!\\\",\\n\\n projects.kana_name AS \\\"kana_name!\\\",\\n\\n projects.group_name AS \\\"group_name!\\\",\\n\\n projects.kana_group_name AS \\\"kana_group_name!\\\",\\n\\n projects.description AS \\\"description!\\\",\\n\\n projects.category AS \\\"category!: ProjectCategory\\\",\\n\\n projects.attributes AS \\\"attributes!: ProjectAttributes\\\",\\n\\n owners.id AS \\\"owner_id!\\\",\\n\",\n \"file_path\": \"sos21-database/src/query/list_projects.rs\",\n \"rank\": 88,\n \"score\": 103370.91590275247\n },\n {\n \"content\": \"#[derive(Debug, Clone, Copy)]\\n\\nenum ProjectCreationPeriodInner {\\n\\n Always,\\n\\n Never,\\n\\n Range {\\n\\n starts_at: DateTime,\\n\\n ends_at: DateTime,\\n\\n },\\n\\n}\\n\\n\\n\\n#[derive(Debug, Clone, Copy)]\\n\\npub struct ProjectCreationPeriod {\\n\\n inner: ProjectCreationPeriodInner,\\n\\n}\\n\\n\\n\\n#[derive(Debug, Error, Clone)]\\n\\n#[error(\\\"invalid project creation period\\\")]\\n\\npub struct PeriodError {\\n\\n _priv: (),\\n\\n}\\n\\n\\n\",\n \"file_path\": \"sos21-domain/src/model/project_creation_period.rs\",\n \"rank\": 89,\n \"score\": 103165.81230025922\n },\n {\n \"content\": \"pub fn mock_project_kana_group_name() -> ProjectKanaGroupName {\\n\\n ProjectKanaGroupName::from_string(\\\"じょーしすにじゅう\\\").unwrap()\\n\\n}\\n\\n\\n\",\n \"file_path\": \"sos21-domain/src/test/model/project.rs\",\n \"rank\": 90,\n \"score\": 102550.11970927144\n },\n {\n \"content\": \" let (tx, rx) = oneshot::channel();\\n\\n let receiver = ObjectDataSummaryReceiver(rx);\\n\\n (\\n\\n ObjectData(ObjectDataStream::new(stream, Some(tx))),\\n\\n receiver,\\n\\n )\\n\\n }\\n\\n\\n\\n pub fn into_stream(self) -> impl Stream<Item = Result<Bytes>> + Send + 'static {\\n\\n self.0\\n\\n }\\n\\n}\\n\\n\\n\\n#[cfg(test)]\\n\\nmod tests {\\n\\n use crate::test::model as test_model;\\n\\n use futures::stream::TryStreamExt;\\n\\n\\n\\n #[tokio::test]\\n\\n async fn test_summary_size_sum() {\\n\",\n \"file_path\": \"sos21-domain/src/model/object/data.rs\",\n \"rank\": 91,\n \"score\": 102428.89329298255\n },\n {\n \"content\": \"use std::convert::TryInto;\\n\\nuse std::fmt::{self, Debug};\\n\\nuse std::future::Future;\\n\\nuse std::pin::Pin;\\n\\nuse std::task::{Context, Poll};\\n\\n\\n\\nuse anyhow::{Context as _, Result};\\n\\nuse bytes::Bytes;\\n\\nuse futures::{\\n\\n channel::oneshot,\\n\\n future::FutureExt,\\n\\n stream::{Stream, StreamExt},\\n\\n};\\n\\n\\n\\n/// Summary of [`ObjectData`].\\n\\n#[derive(Debug, Clone)]\\n\\npub struct ObjectDataSummary {\\n\\n pub number_of_bytes: u64,\\n\\n pub blake3_digest: [u8; 32],\\n\\n}\\n\\n\\n\",\n \"file_path\": \"sos21-domain/src/model/object/data.rs\",\n \"rank\": 92,\n \"score\": 102424.47029826876\n },\n {\n \"content\": \" let (data, _digest, _size, receiver) = test_model::new_object_data_with_summary();\\n\\n let mut total_size = 0;\\n\\n let mut stream = data.into_stream();\\n\\n while let Some(chunk) = stream.try_next().await.unwrap() {\\n\\n total_size += chunk.len();\\n\\n }\\n\\n let summary = receiver.await.unwrap();\\n\\n assert_eq!(summary.number_of_bytes, total_size as u64);\\n\\n }\\n\\n\\n\\n #[tokio::test]\\n\\n async fn test_summary_size_expected() {\\n\\n let (data, _digest, expected_size, receiver) = test_model::new_object_data_with_summary();\\n\\n // consume the stream\\n\\n data.into_stream().try_collect::<Vec<_>>().await.unwrap();\\n\\n let summary = receiver.await.unwrap();\\n\\n assert_eq!(summary.number_of_bytes, expected_size);\\n\\n }\\n\\n\\n\\n #[tokio::test]\\n\",\n \"file_path\": \"sos21-domain/src/model/object/data.rs\",\n \"rank\": 93,\n \"score\": 102423.85358281154\n },\n {\n \"content\": \" async fn test_summary_digest_sum() {\\n\\n let (data, _digest, _size, receiver) = test_model::new_object_data_with_summary();\\n\\n let mut hasher = blake3::Hasher::new();\\n\\n let mut stream = data.into_stream();\\n\\n while let Some(chunk) = stream.try_next().await.unwrap() {\\n\\n hasher.update(&chunk);\\n\\n }\\n\\n let digest: [u8; 32] = hasher.finalize().into();\\n\\n let summary = receiver.await.unwrap();\\n\\n assert_eq!(summary.blake3_digest, digest);\\n\\n }\\n\\n\\n\\n #[tokio::test]\\n\\n async fn test_summary_digest_expected() {\\n\\n let (data, expected_digest, _size, receiver) = test_model::new_object_data_with_summary();\\n\\n // consume the stream\\n\\n data.into_stream().try_collect::<Vec<_>>().await.unwrap();\\n\\n let summary = receiver.await.unwrap();\\n\\n assert_eq!(summary.blake3_digest, expected_digest);\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"sos21-domain/src/model/object/data.rs\",\n \"rank\": 94,\n \"score\": 102423.69364194214\n },\n {\n \"content\": \" self.stream.size_hint()\\n\\n }\\n\\n}\\n\\n\\n\\n#[derive(Debug)]\\n\\npub struct ObjectData(ObjectDataStream);\\n\\n\\n\\n/// Future that recieves [`ObjectDataSummary`] after reading all the data in [`ObjectData`].\\n\\n#[derive(Debug)]\\n\\npub struct ObjectDataSummaryReceiver(oneshot::Receiver<ObjectDataSummary>);\\n\\n\\n\\nimpl Future for ObjectDataSummaryReceiver {\\n\\n type Output = Result<ObjectDataSummary>;\\n\\n\\n\\n fn poll(mut self: Pin<&mut Self>, cx: &mut Context) -> Poll<Self::Output> {\\n\\n self.0.poll_unpin(cx).map(|result| {\\n\\n result.context(\\\"ObjectDataSummaryReceiver polled after the stream is failed\\\")\\n\\n })\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"sos21-domain/src/model/object/data.rs\",\n \"rank\": 95,\n \"score\": 102419.72323482524\n },\n {\n \"content\": \"\\n\\nimpl ObjectData {\\n\\n /// Creates `ObjectData` by wrapping a stream.\\n\\n pub fn from_stream<S>(stream: S) -> Self\\n\\n where\\n\\n S: Stream<Item = Result<Bytes>> + Send + 'static,\\n\\n {\\n\\n ObjectData(ObjectDataStream::new(stream, None))\\n\\n }\\n\\n\\n\\n /// Creates `ObjectData` by wrapping a stream and returns a `Future` that recieves\\n\\n /// [`ObjectDataSummary`] after reading all the object data.\\n\\n ///\\n\\n /// We don't want to have all of the `ObjectData` in memory at once, so we compute the summary\\n\\n /// of the content (currently size and digest) as we read the data, and return it when the\\n\\n /// reading is complete.\\n\\n pub fn from_stream_with_summary<S>(stream: S) -> (Self, ObjectDataSummaryReceiver)\\n\\n where\\n\\n S: Stream<Item = Result<Bytes>> + Send + 'static,\\n\\n {\\n\",\n \"file_path\": \"sos21-domain/src/model/object/data.rs\",\n \"rank\": 96,\n \"score\": 102419.68700848111\n },\n {\n \"content\": \"\\n\\nimpl Debug for ObjectDataStream {\\n\\n fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {\\n\\n f.debug_struct(\\\"ObjectDataStream\\\")\\n\\n .field(\\\"acc_size\\\", &self.acc_size)\\n\\n .field(\\\"acc_hasher\\\", &self.acc_hasher)\\n\\n .field(\\\"summary_sender\\\", &self.summary_sender)\\n\\n .finish()\\n\\n }\\n\\n}\\n\\n\\n\\nimpl Stream for ObjectDataStream {\\n\\n type Item = Result<Bytes>;\\n\\n\\n\\n fn poll_next(mut self: Pin<&mut Self>, cx: &mut Context) -> Poll<Option<Self::Item>> {\\n\\n match futures::ready!(self.stream.poll_next_unpin(cx)) {\\n\\n Some(Ok(bytes)) => {\\n\\n if self.summary_sender.is_some() {\\n\\n let len: u64 = bytes.len().try_into()?;\\n\\n self.acc_size += len;\\n\",\n \"file_path\": \"sos21-domain/src/model/object/data.rs\",\n \"rank\": 97,\n \"score\": 102418.3528962003\n },\n {\n \"content\": \" // TODO: Consider running on a thread where blocking is acceptable\\n\\n self.acc_hasher.update(&bytes);\\n\\n }\\n\\n Poll::Ready(Some(Ok(bytes)))\\n\\n }\\n\\n Some(Err(err)) => Poll::Ready(Some(Err(err))),\\n\\n None => {\\n\\n if let Some(sender) = self.summary_sender.take() {\\n\\n let summary = ObjectDataSummary {\\n\\n number_of_bytes: self.acc_size,\\n\\n blake3_digest: self.acc_hasher.finalize().into(),\\n\\n };\\n\\n let _ = sender.send(summary);\\n\\n }\\n\\n Poll::Ready(None)\\n\\n }\\n\\n }\\n\\n }\\n\\n\\n\\n fn size_hint(&self) -> (usize, Option<usize>) {\\n\",\n \"file_path\": \"sos21-domain/src/model/object/data.rs\",\n \"rank\": 98,\n \"score\": 102416.86466836264\n },\n {\n \"content\": \"use crate::model::{\\n\\n project::{Project, ProjectAttributes, ProjectCategory, ProjectWithOwners},\\n\\n user::{User, UserAssignment, UserCategory, UserRole},\\n\\n};\\n\\n\\n\\nuse anyhow::{Context, Result};\\n\\nuse uuid::Uuid;\\n\\n\\n\\npub async fn find_project<'a, E>(conn: E, id: Uuid) -> Result<Option<ProjectWithOwners>>\\n\\nwhere\\n\\n E: sqlx::Executor<'a, Database = sqlx::Postgres>,\\n\\n{\\n\\n let row = sqlx::query!(\\n\\n r#\\\"\\n\\nSELECT\\n\\n projects.id,\\n\\n projects.index,\\n\\n projects.created_at,\\n\\n projects.updated_at,\\n\\n projects.name,\\n\",\n \"file_path\": \"sos21-database/src/query/find_project.rs\",\n \"rank\": 99,\n \"score\": 102377.460375202\n }\n]","isConversational":false}}},{"rowIdx":2376,"cells":{"lang":{"kind":"string","value":"Rust"},"file_path":{"kind":"string","value":"examples/bvh_viewer/main.rs"},"repo_name":{"kind":"string","value":"tpltnt/bvh_anim"},"commit":{"kind":"string","value":"1f5e37061c6b67c9a0746591dec752adc114a540"},"file_code":{"kind":"string","value":"#![allow(unused)]\n\nmod arcball_camera;\n\nuse arcball_camera::ArcBall;\nuse bvh_anim::{Bvh, JointData};\nuse gl::{self, types::*};\nuse glutin::{\n dpi::LogicalSize, ContextBuilder, DeviceEvent, ElementState, Event, EventsLoop, KeyboardInput,\n MouseButton, Touch, TouchPhase, VirtualKeyCode, WindowBuilder, WindowEvent,\n};\nuse nalgebra::{Matrix4, Point2, Point3, Vector3};\nuse std::time::{Duration, Instant};\n\n#[derive(Clone, Debug, Eq, Hash, PartialEq)]\nstruct Timer {\n last_update: Instant,\n interval: Duration,\n}\n\nimpl Timer {\n fn new(interval: Duration) -> Self {\n Timer {\n last_update: Instant::now(),\n interval,\n }\n }\n\n \n \n fn tick(&mut self, delta: &Duration) -> bool {\n self.interval += *delta;\n\n let curr_time = self.last_update + *delta;\n let next_update = self.last_update + self.interval;\n\n if next_update <= curr_time {\n self.last_update = Instant::now();\n true\n } else {\n false\n }\n }\n}\n\nstruct AnimationPlayer {\n bvh: Bvh,\n timer: Timer,\n bones: Vec<Bone>,\n current_frame: usize,\n does_loop: bool,\n}\n\nimpl AnimationPlayer {\n fn new(bvh: Bvh) -> Self {\n let frame_time = *bvh.frame_time();\n AnimationPlayer {\n bvh,\n timer: Timer::new(frame_time),\n bones: vec![],\n current_frame: 0,\n does_loop: false,\n }\n }\n\n fn tick(&mut self, delta: &Duration) {\n if self.timer.tick(delta) {\n self.anim_callback();\n }\n }\n\n fn calculate_joints_fk(&mut self) {\n let base_mat = Matrix4::<f32>::identity();\n }\n\n fn anim_callback(&mut self) {}\n}\n\n#[derive(Debug, PartialEq)]\nstruct Bone {\n position: Point3<f32>,\n direction: Vector3<f32>,\n length: f32,\n shader_program: GLuint,\n vbo: GLint,\n vao: GLint,\n ebo: GLint,\n model_matrix_uniform_loc: GLint,\n view_matrix_uniform_loc: GLint,\n projection_matrix_uniform_loc: GLint,\n}\n\nimpl Bone {\n fn new(position: Point3<f32>, direction: Vector3<f32>, length: f32) -> Self {\n macro_rules! c {\n ($s:literal) => {\n unsafe {\n ::std::ffi::CStr::from_bytes_with_nul_unchecked(concat!($s, \"\\0\").as_bytes())\n }\n };\n }\n\n let vert_src = c!(r#\"#version 330\n\n layout(location = 0) in vec3 position;\n\n layout(location = 0) out vec4 f_position;\n layout(location = 1) out vec4 f_color;\n\n uniform mat4 model_matrix;\n uniform mat4 view_matrix;\n uniform mat4 projection_matrix;\n\n void main() {\n mat4 mvp = projection_matrix * view_matrix * model_matrix;\n\n f_position = mvp * vec4(position, 1.0);\n f_color = vec4(0.7, 0.7, 0.7, 1.0);\n\n gl_Position = f_position;\n }\n\n \"#);\n\n let frag_src = c!(r#\"#version 330\n\n layout(location = 0) in vec4 f_position;\n layout(location = 1) in vec4 f_color;\n\n layout(location = 0) out vec4 target_color;\n\n void main() {\n target_color = f_color;\n }\n\n \"#);\n\n let shader_program = 0;\n\n let model_matrix_uniform_loc =\n unsafe { gl::GetUniformLocation(shader_program, c!(\"model_matrix\").as_ptr()) };\n\n let view_matrix_uniform_loc =\n unsafe { gl::GetUniformLocation(shader_program, c!(\"view_matrix\").as_ptr()) };\n\n let projection_matrix_uniform_loc =\n unsafe { gl::GetUniformLocation(shader_program, c!(\"projection_matrix\").as_ptr()) };\n\n let cuboid_verts = &[\n Vector3::new(0.0, 0.0, 0.0),\n Vector3::new(1.0, 0.0, 0.0),\n Vector3::new(1.0, 1.0, 0.0),\n ];\n\n let cuboid_inds = &[0u16];\n\n let mut buffers = [0, 0];\n unsafe {\n gl::GenBuffers(buffers.len() as _, buffers.as_mut_ptr() as *mut _);\n }\n\n let [vbo, ebo] = buffers;\n\n Bone {\n position,\n direction,\n length,\n shader_program,\n vbo,\n vao: 0,\n ebo,\n model_matrix_uniform_loc,\n view_matrix_uniform_loc,\n projection_matrix_uniform_loc,\n }\n }\n\n fn render(&self) {\n unsafe {\n gl::UseProgram(self.shader_program);\n\n gl::UseProgram(0);\n }\n }\n}\n\nimpl Drop for Bone {\n fn drop(&mut self) {\n unsafe {\n let mut buffers = [self.vbo, self.ebo];\n gl::DeleteBuffers(buffers.len() as _, buffers.as_mut_ptr() as *mut _);\n gl::DeleteVertexArrays(1, (&mut self.vao) as *mut _ as *mut _);\n\n gl::UseProgram(0);\n gl::DeleteProgram(self.shader_program);\n }\n }\n}\n\nfn main() {\n let mut events_loop = EventsLoop::new();\n let win_builder = WindowBuilder::new()\n .with_title(\"Bvh Viewer\")\n .with_dimensions(LogicalSize::new(1024.0, 768.0));\n\n let context = ContextBuilder::new()\n .build_windowed(win_builder, &events_loop)\n .expect(\"Could not create OpenGL Context\");\n\n let context = unsafe {\n context\n .make_current()\n .expect(\"Could not make the OpenGL context current\")\n };\n\n unsafe {\n gl::load_with(|s| context.get_proc_address(s) as _);\n\n gl::ClearColor(0.1, 0.0, 0.4, 1.0);\n }\n\n let mut is_running = true;\n let mut prev_time = Instant::now();\n let mut arcball = ArcBall::new();\n let mut is_mouse_down = false;\n let mut prev_touch_pos = Point2::<f32>::origin();\n let mut loaded_skeletons: Vec<Bvh> = vec![];\n\n while is_running {\n let curr_time = Instant::now();\n let dt = curr_time - prev_time;\n prev_time = curr_time;\n\n events_loop.poll_events(|ev| match ev {\n Event::DeviceEvent { ref event, .. } => match event {\n DeviceEvent::Key(KeyboardInput {\n virtual_keycode: Some(VirtualKeyCode::Escape),\n ..\n }) => {\n is_running = false;\n }\n DeviceEvent::MouseMotion {\n delta: (ref mx, ref my),\n }\n if is_mouse_down =>\n {\n arcball.on_mouse_move(*mx as f32, *my as f32);\n }\n _ => {}\n },\n Event::WindowEvent { ref event, .. } => match event {\n WindowEvent::CloseRequested | WindowEvent::Destroyed => {\n is_running = false;\n }\n WindowEvent::MouseInput {\n ref state,\n button: MouseButton::Left,\n ..\n } => match state {\n ElementState::Pressed => is_mouse_down = true,\n ElementState::Released => is_mouse_down = false,\n },\n WindowEvent::Touch(ref t) => {\n match t.phase {\n TouchPhase::Started => {\n is_mouse_down = true;\n \n }\n TouchPhase::Ended | TouchPhase::Cancelled => is_mouse_down = true,\n TouchPhase::Moved => {\n \n \n \n \n }\n }\n }\n _ => {}\n },\n _ => {}\n });\n\n unsafe {\n gl::Clear(gl::COLOR_BUFFER_BIT | gl::DEPTH_BUFFER_BIT);\n }\n\n \n \n\n context.swap_buffers().expect(\"Could not swap buffers\");\n }\n}\n"},"prefix":{"kind":"string","value":"#![allow(unused)]\n\nmod arcball_camera;\n\nuse arcball_camera::ArcBall;\nuse bvh_anim::{Bvh, JointData};\nuse gl::{self, types::*};\nuse glutin::{\n dpi::LogicalSize, ContextBuilder, DeviceEvent, ElementState, Event, EventsLoop, KeyboardInput,\n MouseButton, Touch, TouchPhase, VirtualKeyCode, WindowBuilder, WindowEvent,\n};\nuse nalgebra::{Matrix4, Point2, Point3, Vector3};\nuse std::time::{Duration, Instant};\n\n#[derive(Clone, Debug, Eq, Hash, PartialEq)]\nstruct Timer {\n last_update: Instant,\n interval: Duration,\n}\n\nimpl Timer {\n fn new(interval: Duration) -> Self {\n Timer {\n last_update: Instant::now(),\n interval,\n }\n }\n\n \n \n fn tick(&mut self, delta: &Duration) -> bool {\n self.interval += *delta;\n\n let curr_time = self.last_update + *delta;\n let next_update = self.last_update + self.interval;\n\n if next_update <= curr_time {\n self.last_update = Instant::now();\n true\n } else {\n false\n }\n }\n}\n\nstruct AnimationPlayer {\n bvh: Bvh,\n timer: Timer,\n bones: Vec<Bone>,\n current_frame: usize,\n does_loop: bool,\n}\n\nimpl AnimationPlayer {\n fn new(bvh: Bvh) -> Self {\n let frame_time = *bvh.frame_time();\n AnimationPlayer {\n bvh,\n timer: Timer::new(frame_time),\n bones: vec![],\n current_frame: 0,\n does_loop: false,\n }\n }\n\n fn tick(&mut self, delta: &Duration) {\n if self.timer.tick(delta) {\n self.anim_callback();\n }\n }\n\n fn calculate_joints_fk(&mut self) {\n let base_mat = Matrix4::<f32>::identity();\n }\n\n fn anim_callback(&mut self) {}\n}\n\n#[derive(Debug, PartialEq)]\nstruct Bone {\n position: Point3<f32>,\n direction: Vector3<f32>,\n length: f32,\n shader_program: GLuint,\n vbo: GLint,\n vao: GLint,\n ebo: GLint,\n model_matrix_uniform_loc: GLint,\n view_matrix_uniform_loc: GLint,\n projection_matrix_uniform_loc: GLint,\n}\n\nimpl Bone {\n fn new(position: Point3<f32>, direction: Vector3<f32>, length: f32) -> Self {\n macro_rules! c {\n ($s:literal) => {\n unsafe {\n ::std::ffi::CStr::from_bytes_with_nul_unchecked(concat!($s, \"\\0\").as_bytes())\n }\n };\n }\n\n let vert_src = c!(r#\"#version 330\n\n layout(location = 0) in vec3 position;\n\n layout(location = 0) out vec4 f_position;\n layout(location = 1) out vec4 f_color;\n\n uniform mat4 model_matrix;\n uniform mat4 view_matrix;\n uniform mat4 projection_matrix;\n\n void main() {\n mat4 mvp = projection_matrix * view_matrix * model_matrix;\n\n f_position = mvp * vec4(position, 1.0);\n f_color = vec4(0.7, 0.7, 0.7, 1.0);\n\n gl_Position = f_position;\n }\n\n \"#);\n\n let frag_src = c!(r#\"#version 330\n\n layout(location = 0) in vec4 f_position;\n layout(location = 1) in vec4 f_color;\n\n layout(location = 0) out vec4 target_color;\n\n void main() {\n target_color = f_color;\n }\n\n \"#);\n\n let shader_program = 0;\n\n let model_matrix_uniform_loc =\n unsafe { gl::GetUniformLocation(shader_program, c!(\"model_matrix\").as_ptr()) };\n\n let view_matrix_uniform_loc =\n unsafe { gl::GetUniformLocation(shader_program, c!(\"view_matrix\").as_ptr()) };\n\n let projection_matrix_uniform_loc =\n unsafe { gl::GetUniformLocation(shader_program, c!(\"projection_matrix\").as_ptr()) };\n\n let cuboid_verts = &[\n Vector3::new(0.0, 0.0, 0.0),\n Vector3::new(1.0, 0.0, 0.0),\n Vector3::new(1.0, 1.0, 0.0),\n ];\n\n let cuboid_inds = &[0u16];\n\n let mut buffers = [0, 0];\n unsafe {\n gl::GenBuffers(buffers.len() as _, buffers.as_mut_ptr() as *mut _);\n }\n\n let [vbo, ebo] = buffers;\n\n Bone {\n position,\n direction,\n length,\n shader_program,\n vbo,\n vao: 0,\n ebo,\n model_matrix_uniform_loc,\n view_matrix_uniform_loc,\n projection_matrix_uniform_loc,\n }\n }\n\n fn render(&self) {\n unsafe {\n gl::UseProgram(self.shader_program);\n\n gl::UseProgram(0);\n }\n }\n}\n\nimpl Drop for Bone {\n fn drop(&mut self) {\n unsafe {\n let mut buffers = [self.vbo, self.ebo];\n gl::DeleteBuffers(buffers.len() as _, buffers.as_mut_ptr() as *mut _);\n gl::DeleteVertexArrays(1, (&mut self.vao) as *mut _ as *mut _);\n\n gl::UseProgram(0);\n gl::DeleteProgram(self.shader_program);\n }\n }\n}\n\nfn main() {\n let mut events_loop = EventsLoop::new();\n let win_builder = WindowBuilder::new()\n .with_title(\"Bvh Viewer\")\n .with_dimensions(LogicalSize::new(1024.0, 768.0));\n\n let context = ContextBuilder::new()\n .build_windowed(win_builder, &events_loop)\n .expect(\"Could not create OpenGL Context\");\n\n let context = unsafe {\n context\n .make_current()\n .expect(\"Could not make the OpenGL context current\")\n };\n\n unsafe {\n gl::load_with(|s| context.get_proc_address(s) as _);\n\n gl::ClearColor(0.1, 0.0, 0.4, 1.0);\n }\n\n let mut is_running = true;\n let mut prev_time = Instant::now();\n let mut arcball = ArcBall::new();\n let mut is_mouse_down = false;\n let mut prev_touch_pos = Point2::<f32>::origin();\n let mut loaded_skeletons: Vec<Bvh> = vec![];\n\n while is_running {\n let curr_time = Instant::now();\n let dt = curr_time - prev_time;\n prev_time = curr_time;\n\n events_loop.poll_events(|ev| match ev {\n Event::DeviceEvent { ref event, .. } => match event {\n DeviceEvent::Key(KeyboardInput {\n virtual_keycode: Some(VirtualKeyCode::Escape),\n ..\n }) => {\n is_running = false;\n }\n DeviceEvent::MouseMotion {\n "},"suffix":{"kind":"string","value":"ref state,\n button: MouseButton::Left,\n ..\n } => match state {\n ElementState::Pressed => is_mouse_down = true,\n ElementState::Released => is_mouse_down = false,\n },\n WindowEvent::Touch(ref t) => {\n match t.phase {\n TouchPhase::Started => {\n is_mouse_down = true;\n \n }\n TouchPhase::Ended | TouchPhase::Cancelled => is_mouse_down = true,\n TouchPhase::Moved => {\n \n \n \n \n }\n }\n }\n _ => {}\n },\n _ => {}\n });\n\n unsafe {\n gl::Clear(gl::COLOR_BUFFER_BIT | gl::DEPTH_BUFFER_BIT);\n }\n\n \n \n\n context.swap_buffers().expect(\"Could not swap buffers\");\n }\n}\n"},"middle":{"kind":"string","value":" delta: (ref mx, ref my),\n }\n if is_mouse_down =>\n {\n arcball.on_mouse_move(*mx as f32, *my as f32);\n }\n _ => {}\n },\n Event::WindowEvent { ref event, .. } => match event {\n WindowEvent::CloseRequested | WindowEvent::Destroyed => {\n is_running = false;\n }\n WindowEvent::MouseInput {\n "},"strategy":{"kind":"string","value":"random"},"context_items":{"kind":"list like","value":[{"content":"fn collect_channels(channels: &[ChannelType], num_channels: &mut usize) -> SmallVec<[Channel; 6]> {\n\n let out_channels = channels\n\n .iter()\n\n .enumerate()\n\n .map(|(motion_index, &channel_type)| Channel {\n\n channel_type,\n\n motion_index: motion_index + *num_channels,\n\n })\n\n .collect::<SmallVec<[Channel; 6]>>();\n\n\n\n *num_channels += out_channels.len();\n\n out_channels\n\n}\n\n\n\nimpl Builder {\n\n /// Start to create a new `Bvh` with a root joint.\n\n pub fn with_root_joint(\n\n name: &BStr,\n\n offset: Vector3<f32>,\n\n channels: &[ChannelType],\n","file_path":"src/builder.rs","rank":4,"score":105391.73394084805},{"content":"#[cfg(not(feature = \"bindings\"))]\n\nfn main() {}\n","file_path":"build.rs","rank":5,"score":103026.5960480849},{"content":"use nalgebra::{Matrix4, Point, Point2, Point3, Vector3};\n\n\n\n/// An ArcBall controller, as defined by Ken Shoemake.\n\n/// See http://www.talisman.org/~erlkonig/misc/shoemake92-arcball.pdf\n\n#[derive(Clone, Debug)]\n\npub struct ArcBall {\n\n mouse_pos: Point2<f32>,\n\n prev_mouse_pos: Point2<f32>,\n\n center: Point3<f32>,\n\n radius: f32,\n\n}\n\n\n\nimpl ArcBall {\n\n #[inline]\n\n pub fn new() -> Self {\n\n Default::default()\n\n }\n\n\n\n #[inline]\n\n pub fn with_radius(radius: f32) -> Self {\n","file_path":"examples/bvh_viewer/arcball_camera.rs","rank":17,"score":81329.94603336157},{"content":" ArcBall {\n\n mouse_pos: Point::origin(),\n\n prev_mouse_pos: Point::origin(),\n\n center: Point::origin(),\n\n radius,\n\n }\n\n }\n\n\n\n #[inline]\n\n pub fn on_mouse_move(&mut self, delta_mouse_x: f32, delta_mouse_y: f32) {\n\n self.prev_mouse_pos = self.mouse_pos;\n\n self.mouse_pos.coords.x += delta_mouse_x;\n\n self.mouse_pos.coords.y += delta_mouse_y;\n\n }\n\n\n\n pub fn on_scroll(&mut self, amount: f32) {}\n\n\n\n pub fn calculate_view_matrix(&self) -> Matrix4<f32> {\n\n unimplemented!()\n\n }\n\n}\n\n\n\nimpl Default for ArcBall {\n\n #[inline]\n\n fn default() -> Self {\n\n ArcBall::with_radius(1.0)\n\n }\n\n}\n","file_path":"examples/bvh_viewer/arcball_camera.rs","rank":18,"score":81319.83114842587},{"content":"#[cfg(feature = \"bindings\")]\n\nfn main() -> Result<(), error::Error> {\n\n use cbindgen::{self, Config, Language};\n\n use std::{\n\n env::{self, VarError},\n\n path::PathBuf,\n\n };\n\n\n\n let crate_dir = env::var(\"CARGO_MANIFEST_DIR\")?;\n\n let mut bindings = cbindgen::generate(crate_dir)?;\n\n\n\n push_stdio(&mut bindings.config);\n\n\n\n let mut header_path = target_dir()?;\n\n header_path.push(\"include/bvh_anim/bvh_anim.h\");\n\n\n\n bindings.write_to_file(header_path);\n\n\n\n build_and_run_ctests()?;\n\n\n\n #[inline]\n","file_path":"build.rs","rank":19,"score":78441.26360055899},{"content":"int main(int argc, const char* argv[]) {\n\n (void)argc;\n\n (void)argv;\n\n\n\n FILE* bvh_file = fopen(\"./data/test_mocapbank.bvh\", \"r\");\n\n if (bvh_file == NULL) {\n\n return EXIT_FAILURE;\n\n }\n\n\n\n struct bvh_BvhFile bvh;\n\n int result = bvh_read(bvh_file, &bvh);\n\n fclose(bvh_file);\n\n\n\n if (result == 0) {\n\n return EXIT_FAILURE;\n\n }\n\n\n\n printf(\"Num joints = %zu\\n\", bvh.bvh_num_joints);\n\n for (size_t i = 0; i < bvh.bvh_num_joints; i++) {\n\n const struct bvh_Joint* joint = &bvh.bvh_joints[i];\n\n\n\n char* indent = (char*)malloc(sizeof(char) * joint->joint_depth);\n\n\n\n printf(\"%sJoint name = %s\\n\", indent, joint->joint_name);\n\n printf(\"%sJoint depth = %zu\\n\", indent, joint->joint_depth);\n\n printf(\"%sJoint parent = %zu\\n\", indent, joint->joint_parent_index);\n\n\n\n printf(\n\n \"%sJoint offset %f %f %f\\n\",\n\n indent,\n\n joint->joint_offset.offset_x,\n\n joint->joint_offset.offset_y,\n\n joint->joint_offset.offset_z);\n\n\n\n for (size_t curr_channel = 0; curr_channel < joint->joint_num_channels; curr_channel++) {\n\n const struct bvh_Channel* channel = &joint->joint_channels[curr_channel];\n\n printf(\"%sChannel %zu: \", indent, channel->channel_index);\n\n switch (channel->channel_type) {\n\n case X_POSITION: printf(\"Xposition\\n\"); break;\n\n case Y_POSITION: printf(\"Yposition\\n\"); break;\n\n case Z_POSITION: printf(\"Zposition\\n\"); break;\n\n case X_ROTATION: printf(\"Xrotation\\n\"); break;\n\n case Y_ROTATION: printf(\"Yrotation\\n\"); break;\n\n case Z_ROTATION: printf(\"Zrotation\\n\"); break;\n\n }\n\n }\n\n\n\n if (joint->joint_has_end_site) {\n\n printf(\n\n \"%sEnd site %f %f %f\\n\",\n\n indent,\n\n joint->joint_end_site.offset_x,\n\n joint->joint_end_site.offset_y,\n\n joint->joint_end_site.offset_z);\n\n }\n\n\n\n free(indent);\n\n }\n\n\n\n printf(\"Frame time: %f\\n\", bvh.bvh_frame_time);\n\n printf(\"Num frames: %zu\\n\", bvh.bvh_num_frames);\n\n printf(\"Num channels: %zu\\n\", bvh.bvh_num_channels);\n\n\n\n for (size_t frame = 0; frame < bvh.bvh_num_frames; frame++) {\n\n const float* channels = bvh_get_frame(&bvh, frame);\n\n for (size_t ch = 0; ch < bvh.bvh_num_channels; ch++) {\n\n printf(\"%f\", channels[ch]);\n\n if (ch < bvh.bvh_num_channels - 1) {\n\n printf(\" \");\n\n }\n\n }\n\n printf(\"\\n\");\n\n }\n\n\n\n return (bvh_destroy(&bvh) == 0) ? EXIT_FAILURE : EXIT_SUCCESS;\n","file_path":"ctests/parse_string.c","rank":20,"score":72793.2857401927},{"content":"#[inline]\n\nfn fraction_seconds_to_duration(x: f64) -> Duration {\n\n Duration::from_nanos((x * NSEC_FACTOR) as u64)\n\n}\n\n\n","file_path":"src/lib.rs","rank":21,"score":70459.32766143564},{"content":"#[inline]\n\npub fn from_bytes<B: AsRef<[u8]>>(bytes: B) -> Result<Bvh, LoadError> {\n\n Bvh::from_bytes(bytes)\n\n}\n\n\n\n/// Parse a `str` as if it were an in-memory `Bvh` file.\n\n///\n\n/// # Examples\n\n///\n\n/// ```\n\n/// # use bvh_anim::{self, from_str};\n\n/// let bvh_string = \"\n\n/// HIERARCHY\n\n/// ROOT Hips\n\n/// {\n\n/// OFFSET 0.0 0.0 0.0\n\n/// CHANNELS 3 Xposition Yposition Zposition\n\n/// End Site\n\n/// {\n\n/// OFFSET 0.0 0.0 0.0\n\n/// }\n","file_path":"src/lib.rs","rank":22,"score":70128.8903592413},{"content":"#[inline]\n\nfn duation_to_fractional_seconds(duration: &Duration) -> f64 {\n\n duration.subsec_nanos() as f64 / NSEC_FACTOR\n\n}\n","file_path":"src/lib.rs","rank":23,"score":68079.37759137109},{"content":"fn heirarchy<'a>(data: &'a [u8]) -> IResult<&'a [u8], Vec<JointData>> {\n\n let mut joints = Vec::new();\n\n let mut num_channels = 0usize;\n\n let mut joint_index = 0usize;\n\n\n\n let mut channels = |data: &'a [u8]| -> IResult<&'a [u8], SmallVec<[Channel; 6]>> {\n\n let (mut data, expected_num_channels) = do_parse!(\n\n data,\n\n tag!(b\"CHANNELS\") >> num_channels: unsigned_int >> (num_channels)\n\n )?;\n\n\n\n let mut out_channels = smallvec![];\n\n for i in 0..expected_num_channels {\n\n let (new_data, channel_ty) = single_channel(data)?;\n\n let channel = Channel::new(channel_ty, num_channels);\n\n num_channels += 1;\n\n data = new_data;\n\n }\n\n\n\n Ok((&*data, out_channels))\n","file_path":"src/parse.rs","rank":24,"score":64153.441460332964},{"content":"#[inline]\n\npub fn from_str(string: &str) -> Result<Bvh, LoadError> {\n\n Bvh::from_str(string)\n\n}\n\n\n\n/// A complete `bvh` file.\n\n///\n\n/// See the [module documentation](index.html#using-this-library)\n\n/// for more information.\n\n#[derive(Clone, Default, Debug, PartialEq)]\n\npub struct Bvh {\n\n /// The list of joints. If the root joint exists, it is always at\n\n /// index `0`.\n\n joints: Vec<JointData>,\n\n /// The motion values of the `Frame`.\n\n motion_values: Vec<f32>,\n\n /// The number of frames in the bvh.\n\n num_frames: usize,\n\n /// The number of `Channel`s in the bvh.\n\n num_channels: usize,\n\n /// The total time it takes to play one frame.\n","file_path":"src/lib.rs","rank":25,"score":60035.94241968177},{"content":"type EnumeratedLines<'a> = CachedEnumerate<ByteLines<&'a mut dyn BufReadExt>>;\n\n\n\nimpl EnumeratedLines<'_> {\n\n pub fn next_non_empty_line(&mut self) -> Option<<Self as Iterator>::Item> {\n\n let mut next = self.next();\n\n loop {\n\n match next {\n\n None => return None,\n\n Some((idx, result)) => {\n\n let string = match result {\n\n Ok(s) => s,\n\n Err(e) => return Some((idx, Err(e))),\n\n };\n\n if string.trim().is_empty() {\n\n next = self.next()\n\n } else {\n\n return Some((idx, Ok(string)));\n\n }\n\n }\n\n }\n\n }\n\n }\n\n}\n\n\n\n/// Loads the `Bvh` from the `reader`.\n","file_path":"src/lib.rs","rank":26,"score":54944.916933812616},{"content":"#[inline]\n\nfn ptr_to_array<'a, T>(data: *mut T, size: libc::size_t) -> &'a [T] {\n\n if data.is_null() {\n\n &[]\n\n } else {\n\n unsafe { slice::from_raw_parts(data as *const _, size) }\n\n }\n\n}\n\n\n\n#[cfg(test)]\n\nmod tests {\n\n use crate::ffi::{\n\n bvh_AllocCallbacks, bvh_BvhFile, bvh_ChannelType, bvh_Offset, bvh_destroy, bvh_get_frame,\n\n bvh_parse,\n\n };\n\n use libc::strcmp;\n\n use std::ffi::CStr;\n\n\n\n fn check_ffi_bvh(mut bvh_ffi: bvh_BvhFile) {\n\n assert_eq!(bvh_ffi.bvh_num_joints, 2);\n\n\n","file_path":"src/ffi.rs","rank":27,"score":52169.70859957016},{"content":"#[inline]\n\npub fn from_reader<R: BufReadExt>(data: R) -> Result<Bvh, LoadError> {\n\n Bvh::from_reader(data)\n\n}\n\n\n\n/// Parse a sequence of bytes as if it were an in-memory `Bvh` file.\n\n///\n\n/// # Examples\n\n///\n\n/// ```\n\n/// # use bvh_anim::{self, from_bytes};\n\n/// let bvh_string = br#\"\n\n/// HIERARCHY\n\n/// ROOT Hips\n\n/// {\n\n/// OFFSET 0.0 0.0 0.0\n\n/// CHANNELS 3 Xposition Yposition Zposition\n\n/// End Site\n\n/// {\n\n/// OFFSET 0.0 0.0 0.0\n\n/// }\n","file_path":"src/lib.rs","rank":28,"score":51033.92032830739},{"content":"#[derive(Debug)]\n\nstruct InvalidAllocator {\n\n _priv: (),\n\n}\n\n\n\nimpl fmt::Display for InvalidAllocator {\n\n #[inline]\n\n fn fmt(&self, fmtr: &mut fmt::Formatter<'_>) -> fmt::Result {\n\n fmtr.write_str(self.description())\n\n }\n\n}\n\n\n\nimpl Error for InvalidAllocator {\n\n #[inline]\n\n fn description(&self) -> &'static str {\n\n \"The allocator is invalid\"\n\n }\n\n}\n\n\n\nimpl From<Bvh> for bvh_BvhFile {\n\n #[inline]\n","file_path":"src/ffi.rs","rank":29,"score":48506.72301192234},{"content":"struct BuilderJoint {\n\n is_root: bool,\n\n name: JointName,\n\n offset: Vector3<f32>,\n\n channels: SmallVec<[Channel; 6]>,\n\n end_site_offset: Option<Vector3<f32>>,\n\n depth: usize,\n\n parent_index: Option<usize>,\n\n}\n\n\n\nimpl BuilderJoint {\n\n fn new(\n\n is_root: bool,\n\n name: &BStr,\n\n offset: Vector3<f32>,\n\n channels: SmallVec<[Channel; 6]>,\n\n depth: usize,\n\n ) -> Self {\n\n BuilderJoint {\n\n is_root,\n","file_path":"src/builder.rs","rank":30,"score":48502.4617746584},{"content":"#[test]\n\n#[ignore] // @TODO(burtonageo): Turn this on when the nom parser lands\n\nfn nonstandard_formatting() {\n\n const BVH_STRING: &[u8] = br#\"\n\n HIERARCHY ROOT Base {\n\n OFFSET 0.0 0.0\n\n 0.0\n\n CHANNELS 6\n\n Xposition\n\n Yposition\n\n Zposition\n\n Zrotation\n\n Xrotation\n\n Yrotation\n\n Joint End {\n\n Offset\n\n 0.0\n\n 15.0\n\n 0.0\n\n CHANNELS 3 Zrotation\n\n Xrotation Yrotation\n\n End Site { Offset 0.0 0.0 30.0 }\n","file_path":"tests/parse.rs","rank":31,"score":46671.85401291783},{"content":"fn motion_section(\n\ndata: &[u8],\n\nnum_channels: usize,\n\n) -> IResult<&[u8], (std::time::Duration, usize, Vec<f32>)> {\n\nlet (frame_time, num_frames) = frame_metadata(data)?;\n\nlet motion_data = Vec::with_capacity(num_channels * num_frames);\n\n\n\nfor f in 0..num_frames {\n\nlet chomped = do_parse!(data, take_while!(|ch| char::from(ch).is_ascii_whitespace()));\n\nlet (output, motion_val) = float(chomped);\n\nmotion_data.push(motion_val);\n\ndata = output;\n\n}\n\n\n\nOk((data, (frame_time, num_frames, motion_data)))\n\n}\n\n*/\n\n\n\nimpl Bvh {\n\n // @TODO: Remove panics\n","file_path":"src/parse.rs","rank":32,"score":46671.85401291783},{"content":"#[test]\n\nfn ffi_convert() {\n\n let bvh = bvh! {\n\n HIERARCHY\n\n ROOT Base\n\n {\n\n OFFSET 0.0 0.0 0.0\n\n CHANNELS 6 Xposition Yposition Zposition Zrotation Xrotation Yrotation\n\n JOINT Middle1\n\n {\n\n OFFSET 0.0 0.0 15.0\n\n CHANNELS 3 Zrotation Xrotation Yrotation\n\n JOINT Tip1\n\n {\n\n OFFSET 0.0 0.0 30.0\n\n CHANNELS 3 Zrotation Xrotation Yrotation\n\n End Site\n\n {\n\n OFFSET 0.0 0.0 45.0\n\n }\n\n }\n","file_path":"tests/ffi.rs","rank":33,"score":46671.85401291783},{"content":"#[test]\n\nfn custom_allocators() {}\n","file_path":"tests/ffi.rs","rank":34,"score":46671.85401291783},{"content":"#[test]\n\nfn load_success() {\n\n let reader = File::open(\"./data/test_mocapbank.bvh\")\n\n .map(BufReader::new)\n\n .unwrap();\n\n\n\n let _bvh = bvh_anim::from_reader(reader).unwrap();\n\n}\n\n\n","file_path":"tests/parse.rs","rank":35,"score":46671.85401291783},{"content":"#[test]\n\nfn test_write() {\n\n const BVH_STRING: &[u8] = include_bytes!(\"../data/test_simple.bvh\");\n\n\n\n let bvh = bvh! {\n\n HIERARCHY\n\n ROOT Base\n\n {\n\n OFFSET 0.0 0.0 0.0\n\n CHANNELS 6 Xposition Yposition Zposition Zrotation Xrotation Yrotation\n\n JOINT End\n\n {\n\n OFFSET 0.0 0.0 15.0\n\n CHANNELS 3 Zrotation Xrotation Yrotation\n\n End Site\n\n {\n\n OFFSET 0.0 0.0 30.0\n\n }\n\n }\n\n }\n\n MOTION\n","file_path":"tests/write.rs","rank":36,"score":46671.85401291783},{"content":"struct CachedEnumerate<I> {\n\n iter: Enumerate<I>,\n\n last_enumerator: Option<usize>,\n\n}\n\n\n\nimpl<I> CachedEnumerate<I> {\n\n #[inline]\n\n fn new(iter: Enumerate<I>) -> Self {\n\n CachedEnumerate {\n\n iter,\n\n last_enumerator: None,\n\n }\n\n }\n\n\n\n #[inline]\n\n fn last_enumerator(&self) -> Option<usize> {\n\n self.last_enumerator\n\n }\n\n}\n\n\n","file_path":"src/lib.rs","rank":37,"score":45445.4012144017},{"content":"#[test]\n\nfn string_parse_small() {\n\n const BVH_BYTES: &[u8] = include_bytes!(\"../data/test_simple.bvh\");\n\n let bvh = bvh_anim::from_bytes(BVH_BYTES).unwrap();\n\n\n\n let bvh_from_macro = bvh_anim::bvh! {\n\n HIERARCHY\n\n ROOT Base\n\n {\n\n OFFSET 0.0 0.0 0.0\n\n CHANNELS 6 Xposition Yposition Zposition Zrotation Xrotation Yrotation\n\n JOINT End\n\n {\n\n OFFSET 0.0 0.0 15.0\n\n CHANNELS 3 Zrotation Xrotation Yrotation\n\n End Site\n\n {\n\n OFFSET 0.0 0.0 30.0\n\n }\n\n }\n\n }\n","file_path":"tests/parse.rs","rank":38,"score":45045.165372032236},{"content":"#[inline(always)]\n\nfn frames_iter_logic(\n\n num_channels: usize,\n\n num_frames: usize,\n\n curr_frame: usize,\n\n) -> Option<Range<usize>> {\n\n if num_frames == 0 || curr_frame >= num_frames {\n\n return None;\n\n }\n\n\n\n let start = curr_frame * num_channels;\n\n let end = start + num_channels;\n\n\n\n Some(Range { start, end })\n\n}\n\n\n\n/// A wrapper for a slice of motion values, so that they can be indexed by `Channel`.\n\n#[derive(PartialEq)]\n\npub struct Frame([f32]);\n\n\n\nimpl fmt::Debug for Frame {\n","file_path":"src/lib.rs","rank":39,"score":45045.165372032236},{"content":"#[test]\n\nfn ffi_load_from_cfile() {\n\n use bvh_anim::ffi::{bvh_BvhFile, bvh_read};\n\n use libc;\n\n use std::{ffi::CStr, ptr};\n\n\n\n let expected_bvh = bvh! {\n\n HIERARCHY\n\n ROOT Base\n\n {\n\n OFFSET 0.0 0.0 0.0\n\n CHANNELS 6 Xposition Yposition Zposition Zrotation Xrotation Yrotation\n\n JOINT End\n\n {\n\n OFFSET 0.0 0.0 15.0\n\n CHANNELS 3 Zrotation Xrotation Yrotation\n\n End Site\n\n {\n\n OFFSET 0.0 0.0 30.0\n\n }\n\n }\n","file_path":"tests/ffi.rs","rank":40,"score":45045.165372032236},{"content":"#[test]\n\nfn string_parse_big() {\n\n const BVH_BYTES: &[u8] = include_bytes!(\"../data/test_mocapbank.bvh\");\n\n let bvh = bvh_anim::from_bytes(BVH_BYTES).unwrap();\n\n\n\n let bvh_from_macro = bvh_anim::bvh! {\n\n HIERARCHY\n\n ROOT Hips\n\n {\n\n OFFSET 0.0000 0.0000 0.0000\n\n CHANNELS 6 Xposition Yposition Zposition Zrotation Xrotation Yrotation\n\n JOINT Chest\n\n {\n\n OFFSET -0.1728 10.2870 0.1254\n\n CHANNELS 3 Zrotation Xrotation Yrotation\n\n JOINT Chest2\n\n {\n\n OFFSET 0.3229 15.8173 -2.6440\n\n CHANNELS 3 Zrotation Xrotation Yrotation\n\n JOINT LeftCollar\n\n {\n","file_path":"tests/parse_big.rs","rank":41,"score":43593.35881295193},{"content":"#[test]\n\nfn test_load_write_is_identical() {\n\n const BVH_STRING: &str = include_str!(\"../data/test_simple.bvh\");\n\n let bvh = bvh_anim::from_str(BVH_STRING).unwrap();\n\n let bvh_string = WriteOptions::new()\n\n .with_indent(IndentStyle::with_spaces(4))\n\n .with_frame_time_significant_figures(9)\n\n .with_offset_significant_figures(1)\n\n .with_motion_values_significant_figures(1)\n\n .with_line_terminator(LineTerminator::native())\n\n .write_to_string(&bvh);\n\n\n\n assert_eq!(bvh_string, BVH_STRING);\n\n}\n","file_path":"tests/write.rs","rank":42,"score":43593.35881295193},{"content":"# bvh_anim\n\n\n\n[![Latest Version]][crates.io] [![Documentation]][docs.rs] ![License]\n\n\n\nA rust library for loading `.bvh` files containing skeletal animation data.\n\n\n\n⚠⚠**NOTE**: This library is currently alpha quality software.⚠⚠\n\n\n\n## Basic usage\n\n\n\nTo get started, add the following to your `Cargo.toml`:\n\n\n\n```toml\n\n[dependencies]\n\nbvh_anim = \"0.4\"\n\n```\n\n\n\nAnd then, you can import the library using the `use bvh_anim::*;` statement\n\nin your rust files. A small example is shown below:\n\n\n\n```rust\n\nuse bvh_anim;\n\nuse std::fs::File;\n\n\n\nlet bvh_file = File::open(\"./path/to/anim.bvh\")?;\n\nlet bvh = bvh_anim::load(BufReader::new(bvh_file))?;\n\n\n\nfor joint in bvh.joints() {\n\n println!(\"{:#?}\", joint);\n\n}\n\n\n\nprintln!(\"Frame time: {:?}\", bvh.frame_time());\n\n\n\nfor frame in bvh.frames() {\n\n println!(\"{:?}\", frame);\n\n}\n\n\n\nlet mut out_file = File::create(\"./out.bvh\");\n\nbvh.write_to(&mut out_file)?;\n\n```\n\n\n\nFor more information about the bvh file format and using this library,\n\nsee the documentation on [docs.rs](https://docs.rs/bvh_anim).\n\n\n\n## Features\n\n\n\nThis crate has a small ffi module which allows you to parse `bvh` files\n\nfrom `C` code. The `ffi` module can be enabled with the `ffi` feature,\n\nand you can read the docs for it on [`docs.rs`][docs.rs/ffi].\n\n\n\nIn addition, the `bindings` feature can be enabled to generate the `C`\n\nbindings using `cbindgen`. The bindings header is written to either\n\n`$CARGO_TARGET_DIR` if it is specified, or\n\n`$CARGO_MANIFEST_DIR/target/include/bvh_anim/bvh_anim.h` if it is\n\nnot.\n\n\n\n## Contributing\n\n\n\nThis library welcomes open source contributions, including pull requests and bug\n\nreports (including feature requests).\n\n\n\nThis library aims to be the primary `bvh` parser in the Rust ecosystem, and aims\n\nto correctly parse a wide variety of `bvh` files. If you have a file which does\n\nnot parse correctly, please report a bug. Parsing should always return an error on\n\nfailure and never panic.\n\n\n","file_path":"Readme.md","rank":43,"score":37280.24595248993},{"content":"## License\n\n\n\nCopyright © 2019 George Burton\n\n\n\nPermission is hereby granted, free of charge, to any person obtaining a copy of this software\n\nand associated documentation files (the \"Software\"), to deal in the Software without restriction,\n\nincluding without limitation the rights to use, copy, modify, merge, publish, distribute, sublicense,\n\nand/or sell copies of the Software, and to permit persons to whom the Software is furnished to do so,\n\nsubject to the following conditions:\n\n\n\nThe above copyright notice and this permission notice shall be included in all copies or substantial\n\nportions of the Software.\n\n\n\nTHE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT\n\nLIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN\n\nNO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY,\n\nWHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE\n\nSOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.\n\n\n\n[Documentation]: https://docs.rs/bvh_anim/badge.svg\n\n[Latest Version]: https://img.shields.io/crates/v/bvh_anim.svg\n\n[docs.rs]: https://docs.rs/bvh_anim\n\n[crates.io]: https://crates.io/crates/bvh_anim\n\n[License]: https://img.shields.io/crates/l/bvh_anim.svg\n\n<!--\n\nRemember to update this when a new version is published!!!\n\n-->\n","file_path":"Readme.md","rank":44,"score":37272.57917761266},{"content":"Copyright 2019 George Burton\n\n\n\nPermission is hereby granted, free of charge, to any person obtaining a copy of this software and associated documentation files (the \"Software\"),\n\nto deal in the Software without restriction, including without limitation the rights to use, copy, modify, merge, publish, distribute, sublicense,\n\nand/or sell copies of the Software, and to permit persons to whom the Software is furnished to do so, subject to the following conditions:\n\n\n\nThe above copyright notice and this permission notice shall be included in all copies or substantial portions of the Software.\n\n\n\nTHE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n\nFITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n\nLIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS\n\nIN THE SOFTWARE.\n","file_path":"license.md","rank":45,"score":37270.328371309406},{"content":"This is free and unencumbered software released into the public domain.\n\n\n\nAnyone is free to copy, modify, publish, use, compile, sell, or\n\ndistribute this software, either in source code form or as a compiled\n\nbinary, for any purpose, commercial or non-commercial, and by any\n\nmeans.\n\n\n\nIn jurisdictions that recognize copyright laws, the author or authors\n\nof this software dedicate any and all copyright interest in the\n\nsoftware to the public domain. We make this dedication for the benefit\n\nof the public at large and to the detriment of our heirs and\n\nsuccessors. We intend this dedication to be an overt act of\n\nrelinquishment in perpetuity of all present and future rights to this\n\nsoftware under copyright law.\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 BE LIABLE FOR ANY CLAIM, DAMAGES OR\n\nOTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE,\n\nARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR\n\nOTHER DEALINGS IN THE SOFTWARE.\n\n\n\nFor more information, please refer to <http://unlicense.org>\n","file_path":"examples/license.md","rank":46,"score":35870.80345179701},{"content":"#![no_main]\n\n#[macro_use] extern crate libfuzzer_sys;\n\nextern crate bvh_anim;\n\n\n\nfuzz_target!(|data: &[u8]| {\n\n let _ = bvh_anim::parse(data);\n\n});\n","file_path":"fuzz/fuzz_targets/bvh_parse.rs","rank":47,"score":26963.83976228064},{"content":" Option<unsafe extern \"C\" fn(size: size_t, align: size_t) -> *mut c_void>;\n\n\n\n/// Type alias for a function used to free memory.\n\n///\n\n/// Passing a `NULL` pointer value is undefined.\n\npub type bvh_FreeFunction =\n\n Option<unsafe extern \"C\" fn(ptr: *mut c_void, size: size_t, align: size_t)>;\n\n\n\n/// A struct which wraps all allocation functions together for convenience.\n\n///\n\n/// This library may make additional transient allocations outside of\n\n/// any specific allocator parameters.\n\n///\n\n/// If you don't need a custom allocator, use the `BVH_ALLOCATOR_DEFAULT`\n\n/// allocator, which will fall back to the system allocator.\n\n///\n\n/// If either of the member functions are `NULL`, then functions which use\n\n/// the allocator will unconditionally fail.\n\n#[repr(C)]\n\n#[derive(Clone, Copy, Debug, Eq, Hash, PartialEq)]\n","file_path":"src/ffi.rs","rank":48,"score":24.81556259670665},{"content":" unsafe fn free_n<T>(&self, ptr: *mut T, n: usize) {\n\n if let Some(free_cbk) = self.free_cbk {\n\n (free_cbk)(ptr as *mut _, mem::size_of::<T>() * n, mem::align_of::<T>());\n\n }\n\n }\n\n}\n\n\n\n/// Create an allocator which uses the `std::alloc` functions.\n\nimpl Default for bvh_AllocCallbacks {\n\n #[inline]\n\n fn default() -> Self {\n\n BVH_ALLOCATOR_DEFAULT\n\n }\n\n}\n\n\n\n/// Allocation function which uses the rust allocator.\n\nunsafe extern \"C\" fn rust_alloc(size: size_t, align: size_t) -> *mut c_void {\n\n Layout::from_size_align(size, align)\n\n .map(|layout| alloc::alloc_zeroed(layout))\n\n .unwrap_or(ptr::null_mut()) as *mut _\n","file_path":"src/ffi.rs","rank":49,"score":23.829548874692442},{"content":"#![allow(unused)]\n\n\n\n//! Defines a `Builder` struct used to build a `Bvh` dynamically.\n\n\n\nuse bstr::BStr;\n\nuse crate::{Bvh, Channel, ChannelType, JointName};\n\nuse mint::Vector3;\n\nuse smallvec::SmallVec;\n\nuse std::{fmt, time::Duration};\n\n\n\n/// The `Builder`.\n\n#[derive(Default)]\n\npub struct Builder {\n\n _priv: (),\n\n}\n\n\n\nimpl fmt::Debug for Builder {\n\n fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {\n\n f.write_str(\"Builder { .. }\")\n\n }\n\n}\n\n\n","file_path":"src/builder.rs","rank":50,"score":23.3175097141953},{"content":"/// Specify indentation style to use when writing the `Bvh` joints.\n\n///\n\n/// By default, this value is set to 1 tab.\n\n#[derive(Clone, Debug, Eq, Hash, PartialEq)]\n\npub enum IndentStyle {\n\n /// Do not indent nested joints.\n\n NoIndentation,\n\n /// Use a single tab (`'\\t'`) for indentation.\n\n Tabs,\n\n /// Use `n` spaces for indentation.\n\n Spaces(NonZeroUsize),\n\n}\n\n\n\nimpl IndentStyle {\n\n /// Create a new `IndentStyle` with `n` preceeding spaces.\n\n ///\n\n /// If `n` is `0`, then `IndentStyle::NoIndentation` is returned.\n\n #[inline]\n\n pub fn with_spaces(n: usize) -> Self {\n\n NonZeroUsize::new(n)\n","file_path":"src/write.rs","rank":51,"score":22.83678362014163},{"content":"#![allow(unused)]\n\n\n\n//! Contains options for `bvh` file formatting.\n\n\n\nuse bstr::{BStr, BString, B};\n\nuse crate::{duation_to_fractional_seconds, Bvh, Frame, Frames, Joint, Joints};\n\nuse mint::Vector3;\n\nuse smallvec::SmallVec;\n\nuse std::{\n\n fmt,\n\n io::{self, Write},\n\n iter, mem,\n\n num::NonZeroUsize,\n\n};\n\n\n\n/// Specify formatting options for writing a `Bvh`.\n\n#[derive(Clone, Debug, Eq, Hash, PartialEq)]\n\npub struct WriteOptions {\n\n /// Which indentation style to use for nested bones.\n\n pub indent: IndentStyle,\n","file_path":"src/write.rs","rank":52,"score":22.544675073168378},{"content":"/// A mutable iterator over the frames of a `Bvh`.\n\n#[derive(Debug)]\n\npub struct FramesMut<'a> {\n\n motion_values: &'a mut [f32],\n\n num_channels: usize,\n\n num_frames: usize,\n\n curr_frame: usize,\n\n}\n\n\n\nimpl FramesMut<'_> {\n\n /// Returns the number of `Frame`s left to iterate over.\n\n #[inline]\n\n pub const fn len(&self) -> usize {\n\n self.num_frames - self.curr_frame\n\n }\n\n\n\n /// Returns `true` if the number of `Frame`s left to iterate over is `0`.\n\n #[inline]\n\n pub const fn is_empty(&self) -> bool {\n\n self.len() == 0\n","file_path":"src/lib.rs","rank":53,"score":21.558310918661064},{"content":"/// A channel composed of a `bvh_ChannelType` and an index into the\n\n/// `bvh_BvhFile::bvh_motion_data` array to which it corresponds.\n\n#[repr(C)]\n\n#[derive(Clone, Copy, Debug, Eq, Hash, Ord, PartialEq, PartialOrd)]\n\npub struct bvh_Channel {\n\n /// The type of the channel.\n\n pub channel_type: bvh_ChannelType,\n\n /// The index into the motion data array.\n\n pub channel_index: size_t,\n\n}\n\n\n\n/// A single joint in the `HIERARCHY` section of a `bvh_BvhFile`.\n\n#[repr(C)]\n\n#[derive(Clone, Copy, PartialEq)]\n\npub struct bvh_Joint {\n\n /// The name of the joint.\n\n pub joint_name: *mut c_char,\n\n /// The ordered array of channels of the `bvh_Joint`.\n\n pub joint_channels: *mut bvh_Channel,\n\n /// The length of the `joint_channels` array.\n","file_path":"src/ffi.rs","rank":54,"score":21.31256384529093},{"content":" fn try_from(string: &'_ BStr) -> Result<Self, Self::Error> {\n\n Bvh::from_bytes(string.as_bytes())\n\n }\n\n}\n\n\n\nimpl TryFrom<&'_ [u8]> for Bvh {\n\n type Error = LoadError;\n\n #[inline]\n\n fn try_from(bytes: &'_ [u8]) -> Result<Self, Self::Error> {\n\n Bvh::from_bytes(bytes)\n\n }\n\n}\n\n\n\n/// A `Channel` composed of a `ChannelType` and an index into the\n\n/// corresponding motion data.\n\n#[derive(Clone, Copy, Debug, Eq, Hash, PartialEq)]\n\npub struct Channel {\n\n /// The type of the `Channel`.\n\n channel_type: ChannelType,\n\n /// The index into the `Frame` which corresponds to this `Channel`.\n","file_path":"src/lib.rs","rank":55,"score":20.972446589051955},{"content":"#[must_use]\n\npub unsafe extern \"C\" fn bvh_to_string(\n\n bvh_file: *const bvh_BvhFile,\n\n out_buffer_allocator: bvh_AllocFunction,\n\n out_buffer: *mut *mut c_char,\n\n) -> c_int {\n\n /*\n\n if bvh_file.is_null() {\n\n return 1;\n\n }\n\n \n\n let bvh = match Bvh::from_ffi(*bvh_file) {\n\n Ok(bvh) => bvh,\n\n Err(_) => return 1,\n\n };\n\n \n\n let string = bvh.to_bstring();\n\n *bvh_file = bvh.into_ffi();\n\n let out_buf_len = string.len() + 1;\n\n \n","file_path":"src/ffi.rs","rank":56,"score":20.775044763303192},{"content":" {\n\n assert_eq!(chan, *expected_chan);\n\n }\n\n let end_site = end_site.into().map(Into::into);\n\n assert_eq!(joint.end_site(), end_site.as_ref());\n\n }\n\n\n\n let mut joints = bvh.joints();\n\n\n\n check_joint::<[_; 3], [f32; 3], _>(\n\n joints.next().unwrap().data(),\n\n \"Base\",\n\n [0.0, 0.0, 0.0],\n\n &[\n\n ChannelType::PositionX,\n\n ChannelType::PositionY,\n\n ChannelType::PositionZ,\n\n ChannelType::RotationZ,\n\n ChannelType::RotationX,\n\n ChannelType::RotationY,\n","file_path":"src/macros.rs","rank":57,"score":20.62891857029142},{"content":"}\n\n\n\nimpl fmt::Debug for Joints<'_> {\n\n #[inline]\n\n fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {\n\n f.write_str(\"Joints { .. }\")\n\n }\n\n}\n\n\n\nimpl<'a> Joints<'a> {\n\n /// Create a `Joints` iterator over all the `joints` in a `Bvh` file.\n\n pub(crate) fn iter_root(joints: &'a [JointData] //clips: &'a AtomicRefCell<Clips>\n\n ) -> Self {\n\n Joints {\n\n joints,\n\n // clips,\n\n current_joint: 0,\n\n from_child: None,\n\n }\n\n }\n","file_path":"src/joint.rs","rank":58,"score":20.505390089569477},{"content":"\n\n #[inline]\n\n pub fn check_valid_motion(&self) -> bool {\n\n self.bvh.motion_values.len() == self.bvh.num_channels * self.bvh.num_frames\n\n }\n\n\n\n #[inline]\n\n fn last_joint(&mut self) -> Option<&mut JointData> {\n\n self.bvh.joints.last_mut()\n\n }\n\n}\n\n\n\n#[cfg(test)]\n\nmod tests {\n\n // Needed for macros\n\n use std::time::Duration;\n\n\n\n #[test]\n\n fn macro_create() {\n\n let bvh = bvh! {\n","file_path":"src/macros.rs","rank":59,"score":20.49126695071829},{"content":" ///\n\n /// ```\n\n /// # use bvh_anim::ChannelType;\n\n /// let channel_type = ChannelType::RotationX;\n\n /// assert!(channel_type.is_rotation());\n\n /// ```\n\n #[inline]\n\n pub fn is_rotation(&self) -> bool {\n\n match *self {\n\n ChannelType::RotationX | ChannelType::RotationY | ChannelType::RotationZ => true,\n\n _ => false,\n\n }\n\n }\n\n\n\n /// Returns `true` if this channel corresponds to a positional\n\n /// transform, otherwise `false`.\n\n ///\n\n /// # Example\n\n ///\n\n /// ```\n","file_path":"src/lib.rs","rank":60,"score":20.43454473011532},{"content":"}\n\n\n\nimpl From<Vector3<f32>> for bvh_Offset {\n\n #[inline]\n\n fn from(v: Vector3<f32>) -> Self {\n\n bvh_Offset {\n\n offset_x: v.x,\n\n offset_y: v.y,\n\n offset_z: v.z,\n\n }\n\n }\n\n}\n\n\n\nimpl From<bvh_Offset> for Vector3<f32> {\n\n #[inline]\n\n fn from(offset: bvh_Offset) -> Self {\n\n let crate::ffi::bvh_Offset {\n\n offset_x,\n\n offset_y,\n\n offset_z,\n","file_path":"src/ffi.rs","rank":61,"score":20.376595800355048},{"content":"use bstr::{BStr, BString, ByteSlice};\n\nuse crate::Channel;\n\nuse mint::Vector3;\n\nuse smallvec::SmallVec;\n\nuse std::{\n\n cmp::{Ordering, PartialEq, PartialOrd},\n\n ffi::{CStr, CString},\n\n fmt, mem,\n\n ops::{Deref, DerefMut},\n\n str,\n\n};\n\n\n\n/// Internal representation of a joint.\n\n#[derive(Clone, Debug, PartialEq)]\n\npub enum JointData {\n\n /// Root of the skeletal heirarchy.\n\n Root {\n\n /// Name of the root `Joint`.\n\n name: JointName,\n\n /// Positional offset of this `Joint` relative to the parent.\n","file_path":"src/joint.rs","rank":62,"score":20.185548724850374},{"content":" /// # use bvh_anim::ChannelType;\n\n /// let channel_type = ChannelType::PositionZ;\n\n /// assert!(channel_type.is_position());\n\n /// ```\n\n #[inline]\n\n pub fn is_position(&self) -> bool {\n\n !self.is_rotation()\n\n }\n\n\n\n /// Get the `Axis` about which this `Channel` transforms.\n\n ///\n\n /// # Example\n\n ///\n\n /// ```\n\n /// # use bvh_anim::{Axis, ChannelType};\n\n /// let channel_type = ChannelType::PositionX;\n\n /// assert_eq!(channel_type.axis(), Axis::X);\n\n /// ```\n\n #[inline]\n\n pub fn axis(&self) -> Axis {\n","file_path":"src/lib.rs","rank":63,"score":20.177633630094594},{"content":"pub struct bvh_AllocCallbacks {\n\n /// The `alloc` function.\n\n pub alloc_cbk: bvh_AllocFunction,\n\n /// The `free` function.\n\n pub free_cbk: bvh_FreeFunction,\n\n}\n\n\n\n/// The default allocator, which uses the rust allocator (which is the\n\n/// system allocator by default).\n\n#[no_mangle]\n\npub static BVH_ALLOCATOR_DEFAULT: bvh_AllocCallbacks = bvh_AllocCallbacks {\n\n alloc_cbk: Some(rust_alloc as unsafe extern \"C\" fn(size: size_t, align: size_t) -> *mut c_void),\n\n free_cbk: Some(\n\n rust_free as unsafe extern \"C\" fn(ptr: *mut c_void, size: size_t, align: size_t),\n\n ),\n\n};\n\n\n\n#[allow(unused)]\n\nimpl bvh_AllocCallbacks {\n\n /// Create a new `bvh_AllocCallbacks` instance with the given allocation\n","file_path":"src/ffi.rs","rank":64,"score":20.142714157227502},{"content":" }\n\n\n\n #[inline]\n\n pub(crate) const fn empty() -> Self {\n\n Self::new(0, 0, 0)\n\n }\n\n}\n\n\n\nimpl fmt::Debug for JointPrivateData {\n\n fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {\n\n f.write_str(\"JointPrivateData { .. }\")\n\n }\n\n}\n\n\n\n/// An iterator over the `Joint`s of a `Bvh` skeleton.\n\npub struct Joints<'a> {\n\n pub(crate) joints: &'a [JointData],\n\n // pub(crate) motion_values: &'a [f32],\n\n pub(crate) current_joint: usize,\n\n pub(crate) from_child: Option<usize>,\n","file_path":"src/joint.rs","rank":65,"score":19.97805607519115},{"content":" ///\n\n /// # Returns\n\n ///\n\n /// Returns `true` when there are still more lines available,\n\n /// `false` when all lines have been extracted.\n\n fn next_chunk<'a, 'b: 'a>(\n\n &self,\n\n bvh: &'b Bvh,\n\n chunk: &mut Vec<u8>,\n\n iter_state: &'a mut WriteOptionsIterState<'b>,\n\n ) -> bool {\n\n chunk.clear();\n\n\n\n let terminator = self.line_terminator.as_bstr().as_ref();\n\n\n\n match *iter_state {\n\n WriteOptionsIterState::WriteHierarchy { ref mut written } => {\n\n if !*written {\n\n *chunk = b\"HIERARCHY\".to_vec();\n\n chunk.extend_from_slice(self.line_terminator.as_bstr().as_ref());\n","file_path":"src/write.rs","rank":66,"score":19.941679094451167},{"content":"}\n\n\n\n/// Deallocation function which uses the rust allocator.\n\nunsafe extern \"C\" fn rust_free(ptr: *mut c_void, size: size_t, align: size_t) {\n\n Layout::from_size_align(size, align)\n\n .map(|layout| alloc::dealloc(ptr as *mut _, layout))\n\n .expect(&format!(\"Could not deallocate pointer {:p}\", ptr))\n\n}\n\n\n\n/// A type representing an `OFFSET` position.\n\n#[repr(C)]\n\n#[derive(Clone, Copy, Debug, Default, PartialEq)]\n\npub struct bvh_Offset {\n\n /// The x-component of the `OFFSET`.\n\n pub offset_x: c_float,\n\n /// The y-component of the `OFFSET`.\n\n pub offset_y: c_float,\n\n /// The z-component of the `OFFSET`.\n\n pub offset_z: c_float,\n\n}\n","file_path":"src/ffi.rs","rank":67,"score":19.885568605871285},{"content":" } = offset;\n\n [offset_x, offset_y, offset_z].into()\n\n }\n\n}\n\n\n\nimpl From<ChannelType> for bvh_ChannelType {\n\n #[inline]\n\n fn from(channel_ty: ChannelType) -> Self {\n\n match channel_ty {\n\n ChannelType::RotationX => bvh_ChannelType::X_ROTATION,\n\n ChannelType::RotationY => bvh_ChannelType::Y_ROTATION,\n\n ChannelType::RotationZ => bvh_ChannelType::Z_ROTATION,\n\n ChannelType::PositionX => bvh_ChannelType::X_POSITION,\n\n ChannelType::PositionY => bvh_ChannelType::Y_POSITION,\n\n ChannelType::PositionZ => bvh_ChannelType::Z_POSITION,\n\n }\n\n }\n\n}\n\n\n\nimpl From<bvh_ChannelType> for ChannelType {\n","file_path":"src/ffi.rs","rank":68,"score":19.740529936918627},{"content":" #[inline]\n\n fn deref_mut(&mut self) -> &mut Self::Target {\n\n &mut self.0\n\n }\n\n}\n\n\n\nimpl<B: AsRef<[u8]>> PartialEq<B> for JointName {\n\n #[inline]\n\n fn eq(&self, rhs: &B) -> bool {\n\n AsRef::<BStr>::as_ref(self) == rhs.as_ref()\n\n }\n\n}\n\n\n\nimpl<B: AsRef<[u8]>> PartialOrd<B> for JointName {\n\n #[inline]\n\n fn partial_cmp(&self, rhs: &B) -> Option<Ordering> {\n\n AsRef::<BStr>::as_ref(self).partial_cmp(rhs.as_ref())\n\n }\n\n}\n\n\n","file_path":"src/joint.rs","rank":69,"score":19.59491694336925},{"content":" #[inline]\n\n fn from(channel_ty: bvh_ChannelType) -> Self {\n\n match channel_ty {\n\n bvh_ChannelType::X_POSITION => ChannelType::PositionX,\n\n bvh_ChannelType::Y_POSITION => ChannelType::PositionY,\n\n bvh_ChannelType::Z_POSITION => ChannelType::PositionZ,\n\n bvh_ChannelType::X_ROTATION => ChannelType::RotationX,\n\n bvh_ChannelType::Y_ROTATION => ChannelType::RotationY,\n\n bvh_ChannelType::Z_ROTATION => ChannelType::RotationZ,\n\n }\n\n }\n\n}\n\n\n\nimpl From<Channel> for bvh_Channel {\n\n #[inline]\n\n fn from(ch: Channel) -> Self {\n\n bvh_Channel {\n\n channel_type: ch.channel_type().into(),\n\n channel_index: ch.motion_index().into(),\n\n }\n","file_path":"src/ffi.rs","rank":70,"score":19.433669332440413},{"content":" /// # OFFSET 0.0 0.0 30.0\n\n /// # }\n\n /// }\n\n /// MOTION\n\n /// // ...\n\n /// # Frames: 0\n\n /// # Frame Time: 0.0333333\n\n /// };\n\n ///\n\n /// let root = bvh.root_joint().unwrap();\n\n /// assert_eq!(root.data().offset(), &[1.2, 3.4, 5.6].into());\n\n /// ```\n\n #[inline]\n\n pub fn offset(&self) -> &Vector3<f32> {\n\n match *self {\n\n JointData::Child { ref offset, .. } | JointData::Root { ref offset, .. } => offset,\n\n }\n\n }\n\n\n\n /// Returns the `end_site` position if this `Joint` has an end site, or `None` if\n","file_path":"src/joint.rs","rank":71,"score":18.968527979823264},{"content":" }\n\n\n\n joint\n\n }\n\n}\n\n\n\n/// A mutable iterator over the `Joint`s of a `Bvh` skeleton.\n\n#[allow(unused)]\n\npub struct JointsMut<'a> {\n\n pub(crate) joints: &'a mut [JointData],\n\n pub(crate) current_joint: usize,\n\n pub(crate) from_child: Option<usize>,\n\n}\n\n\n\nimpl<'a> JointsMut<'a> {\n\n pub(crate) fn iter_root(joints: &'a mut [JointData] //clips: &'a AtomicRefCell<Clips>\n\n ) -> Self {\n\n JointsMut {\n\n joints,\n\n // clips,\n","file_path":"src/joint.rs","rank":72,"score":18.96142602346638},{"content":" motion_values_significant_figures: 2,\n\n _nonexhaustive: (),\n\n }\n\n }\n\n}\n\n\n\nimpl WriteOptions {\n\n /// Create a new `WriteOptions` with default values.\n\n #[inline]\n\n pub fn new() -> Self {\n\n Default::default()\n\n }\n\n\n\n /// Output the `Bvh` file to the `writer` with the given options.\n\n pub fn write<W: Write>(&self, bvh: &Bvh, writer: &mut W) -> io::Result<()> {\n\n let mut curr_chunk = vec![];\n\n let mut curr_bytes_written = 0usize;\n\n let mut curr_string_len = 0usize;\n\n let mut iter_state = WriteOptionsIterState::new();\n\n\n","file_path":"src/write.rs","rank":73,"score":18.90229374199194},{"content":"\n\nimpl fmt::Debug for bvh_Joint {\n\n #[inline]\n\n fn fmt(&self, fmtr: &mut fmt::Formatter<'_>) -> fmt::Result {\n\n let joint_name = unsafe { CStr::from_ptr(self.joint_name as *const _) };\n\n let channels = ptr_to_array(self.joint_channels, self.joint_num_channels);\n\n\n\n let has_end_site = if self.joint_has_end_site == 0 {\n\n false\n\n } else {\n\n true\n\n };\n\n\n\n let parent_index = if self.joint_parent_index == usize::max_value() {\n\n #[derive(Debug)]\n\n struct None;\n\n &None as &dyn fmt::Debug\n\n } else {\n\n &self.joint_parent_index as &dyn fmt::Debug\n\n };\n","file_path":"src/ffi.rs","rank":74,"score":18.826224697964513},{"content":" unsafe {\n\n let root = *bvh_ffi.bvh_joints.offset(0);\n\n\n\n let expected_name = CStr::from_bytes_with_nul(b\"Base\\0\").unwrap();\n\n assert_eq!(strcmp(root.joint_name, expected_name.as_ptr()), 0);\n\n\n\n assert_eq!(root.joint_num_channels, 6);\n\n\n\n let expected_channels = [\n\n bvh_ChannelType::X_POSITION,\n\n bvh_ChannelType::Y_POSITION,\n\n bvh_ChannelType::Z_POSITION,\n\n bvh_ChannelType::Z_ROTATION,\n\n bvh_ChannelType::X_ROTATION,\n\n bvh_ChannelType::Y_ROTATION,\n\n ];\n\n\n\n for i in 0..root.joint_num_channels {\n\n let channel = *root.joint_channels.offset(i as isize);\n\n assert_eq!(channel.channel_index, i);\n","file_path":"src/ffi.rs","rank":75,"score":18.809232905136717},{"content":"#[derive(Clone, Copy, Debug, Eq, Hash, Ord, PartialEq, PartialOrd)]\n\npub enum Axis {\n\n /// `x` axis.\n\n X,\n\n /// `y` axis.\n\n Y,\n\n /// `z` axis.\n\n Z,\n\n}\n\n\n\nimpl Axis {\n\n /// Returns the `Vector3` which represents the axis.\n\n ///\n\n /// # Examples\n\n ///\n\n /// ```\n\n /// # use bvh_anim::Axis;\n\n /// assert_eq!(Axis::X.vector(), [1.0, 0.0, 0.0].into());\n\n /// assert_eq!(Axis::Y.vector(), [0.0, 1.0, 0.0].into());\n\n /// assert_eq!(Axis::Z.vector(), [0.0, 0.0, 1.0].into());\n","file_path":"src/lib.rs","rank":76,"score":18.758325985371172},{"content":"\n\n/// A channel type representing a degree of freedom along which a\n\n/// joint may move.\n\n#[repr(C)]\n\n#[derive(Clone, Copy, Debug, Eq, Hash, Ord, PartialEq, PartialOrd)]\n\npub enum bvh_ChannelType {\n\n /// An `Xposition` channel type.\n\n X_POSITION,\n\n /// A `Yposition` channel type.\n\n Y_POSITION,\n\n /// A `Zposition` channel type.\n\n Z_POSITION,\n\n /// An `Xrotation` channel type.\n\n X_ROTATION,\n\n /// A `Yrotation` channel type.\n\n Y_ROTATION,\n\n /// A `Zrotation` channel type.\n\n Z_ROTATION,\n\n}\n\n\n","file_path":"src/ffi.rs","rank":77,"score":18.68174783954572},{"content":" #[inline]\n\n fn fmt(&self, fmtr: &mut fmt::Formatter<'_>) -> fmt::Result {\n\n fmt::Debug::fmt(&self.0, fmtr)\n\n }\n\n}\n\n\n\nimpl Frame {\n\n #[inline]\n\n fn from_slice<'a>(frame_motions: &'a [f32]) -> &'a Frame {\n\n unsafe { &*(frame_motions as *const [f32] as *const Frame) }\n\n }\n\n\n\n #[inline]\n\n fn from_mut_slice<'a>(frame_motions: &'a mut [f32]) -> &'a mut Frame {\n\n unsafe { &mut *(frame_motions as *mut [f32] as *mut Frame) }\n\n }\n\n\n\n /// Returns the number of motion values in the `Frame`.\n\n #[inline]\n\n pub fn len(&self) -> usize {\n","file_path":"src/lib.rs","rank":78,"score":18.64327681445261},{"content":" frame_time: Duration,\n\n}\n\n\n\nimpl Bvh {\n\n /// Create an empty `Bvh`.\n\n #[inline]\n\n pub fn new() -> Self {\n\n Default::default()\n\n }\n\n\n\n /// Parse a sequence of bytes as if it were an in-memory `Bvh` file.\n\n ///\n\n /// # Examples\n\n ///\n\n /// ```\n\n /// # use bvh_anim::{self, Bvh};\n\n /// let bvh_string = br#\"\n\n /// HIERARCHY\n\n /// ROOT Hips\n\n /// {\n","file_path":"src/lib.rs","rank":79,"score":18.49019286537508},{"content":" }\n\n }\n\n}\n\n\n\n/// The `MotionBuilder`.\n\npub struct MotionBuilder {\n\n joints_builder: JointsBuilder,\n\n frame_time: Duration,\n\n num_frames: usize,\n\n motion_values: Vec<f32>,\n\n}\n\n\n\nimpl fmt::Debug for MotionBuilder {\n\n fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {\n\n f.write_str(\"MotionBuilder { .. }\")\n\n }\n\n}\n\n\n\nimpl MotionBuilder {\n\n /// Push a frame of motion values.\n","file_path":"src/builder.rs","rank":80,"score":18.413658613883804},{"content":" /// }\n\n /// }\n\n /// MOTION\n\n /// // ...\n\n /// # Frames: 0\n\n /// # Frame Time: 0.0333333\n\n /// };\n\n /// let mut joints = bvh.joints();\n\n /// let base = joints.next().unwrap();\n\n /// assert!(base.data().end_site().is_none());\n\n ///\n\n /// let tip = joints.next().unwrap();\n\n /// assert_eq!(tip.data().end_site(), Some([5.4, 3.2, 1.0].into()).as_ref());\n\n /// ```\n\n #[inline]\n\n pub fn end_site(&self) -> Option<&Vector3<f32>> {\n\n match *self {\n\n JointData::Child {\n\n ref end_site_offset,\n\n ..\n","file_path":"src/joint.rs","rank":81,"score":18.40815824179288},{"content":" name: JointName::from(name),\n\n offset,\n\n channels,\n\n end_site_offset: None,\n\n depth,\n\n parent_index: if is_root { None } else { Some(0) },\n\n }\n\n }\n\n}\n\n\n\nimpl JointsBuilder {\n\n /// Push a `Joint`.\n\n pub fn push_child(\n\n mut self,\n\n depth: usize,\n\n name: &BStr,\n\n offset: Vector3<f32>,\n\n channels: &[ChannelType],\n\n ) -> Self {\n\n let channels = collect_channels(channels, &mut self.num_channels);\n","file_path":"src/builder.rs","rank":82,"score":18.15242321499892},{"content":" #[inline]\n\n pub fn set_frame_time(&mut self, frame_time_secs: f64) {\n\n self.bvh\n\n .set_frame_time(fraction_seconds_to_duration(frame_time_secs));\n\n }\n\n\n\n #[inline]\n\n pub fn set_num_frames(&mut self, num_frames: usize) {\n\n self.num_frames = num_frames;\n\n self.bvh.num_channels = self.current_channel_index;\n\n self.bvh.num_frames = self.num_frames;\n\n self.bvh\n\n .motion_values\n\n .reserve(self.current_channel_index * self.num_frames);\n\n }\n\n\n\n #[inline]\n\n pub fn set_motion_values(&mut self, motion_values: Vec<f32>) {\n\n self.bvh.motion_values = motion_values;\n\n }\n","file_path":"src/macros.rs","rank":83,"score":17.92998377485219},{"content":" return ptr::null_mut();\n\n }\n\n\n\n if self.is_rust_allocator() {\n\n Box::into_raw(vec.into_boxed_slice()) as *mut _\n\n } else {\n\n let allocation = self.alloc_n::<T>(vec.len()) as *mut T;\n\n ptr::copy_nonoverlapping(vec.as_ptr(), allocation, vec.len());\n\n allocation\n\n }\n\n }\n\n\n\n /// Wrapper function to create a `Vec` from a raw pointer and a size.\n\n ///\n\n /// Takes ownership of the data behind `ptr` - it is a use after free\n\n /// error to use `ptr` after this.\n\n #[inline]\n\n unsafe fn alloc_to_vec<T: Copy>(&self, ptr: *mut T, n: usize) -> Vec<T> {\n\n if self.validate().is_err() || ptr.is_null() || n == 0 {\n\n return Vec::new();\n","file_path":"src/ffi.rs","rank":84,"score":17.620821459713312},{"content":" }\n\n}\n\n\n\n/// A string type for the `Joint` name. A `SmallVec` is used for\n\n/// better data locality.\n\npub type JointNameInner = SmallVec<[u8; mem::size_of::<String>()]>;\n\n\n\n/// Wrapper struct for the `Joint` name type.\n\n#[derive(Clone, Default, Eq, Hash, Ord)]\n\npub struct JointName(pub JointNameInner);\n\n\n\nimpl Deref for JointName {\n\n type Target = JointNameInner;\n\n #[inline]\n\n fn deref(&self) -> &Self::Target {\n\n &self.0\n\n }\n\n}\n\n\n\nimpl DerefMut for JointName {\n","file_path":"src/joint.rs","rank":85,"score":17.53432196082351},{"content":" ref mut current_joint,\n\n ref mut wrote_name,\n\n ref mut wrote_offset,\n\n ref mut wrote_channels,\n\n } => {\n\n if let Some(ref joint) = current_joint {\n\n let joint_data = joint.data();\n\n let mut depth = joint_data.depth();\n\n if *wrote_name {\n\n depth += 1\n\n }\n\n\n\n match (&mut *wrote_name, &mut *wrote_offset, &mut *wrote_channels) {\n\n (&mut false, _, _) => {\n\n // @TODO: Contribute `Extend` impl for `BString` to avoid the `Vec`\n\n // allocation\n\n chunk.extend(self.indent.prefix_chars(depth));\n\n if joint_data.is_root() {\n\n chunk.extend_from_slice(b\"ROOT \");\n\n } else {\n","file_path":"src/write.rs","rank":86,"score":17.513105211765186},{"content":" assert_eq!(channel.channel_type, expected_channels[i]);\n\n }\n\n\n\n assert_eq!(root.joint_offset, Default::default());\n\n assert_eq!(root.joint_parent_index, usize::max_value());\n\n assert_eq!(root.joint_has_end_site, 0);\n\n }\n\n\n\n unsafe {\n\n let end = *bvh_ffi.bvh_joints.offset(1);\n\n\n\n let expected_name = CStr::from_bytes_with_nul(b\"End\\0\").unwrap();\n\n assert_eq!(strcmp(end.joint_name, expected_name.as_ptr()), 0);\n\n\n\n assert_eq!(end.joint_num_channels, 3);\n\n\n\n let expected_channels = [\n\n bvh_ChannelType::Z_ROTATION,\n\n bvh_ChannelType::X_ROTATION,\n\n bvh_ChannelType::Y_ROTATION,\n","file_path":"src/ffi.rs","rank":87,"score":17.48903300315817},{"content":" WriteOptionsIterState::WriteFrames {\n\n ref mut current_frame,\n\n ref mut frames,\n\n } => match current_frame {\n\n None => return false,\n\n Some(frame) => {\n\n let motion_values = frame\n\n .as_slice()\n\n .iter()\n\n .map(|motion| {\n\n format!(\"{:.*}\", self.motion_values_significant_figures, motion)\n\n })\n\n .collect::<Vec<_>>()\n\n .join(\" \");\n\n *chunk = motion_values.into_bytes();\n\n chunk.extend_from_slice(terminator);\n\n *current_frame = frames.next();\n\n }\n\n },\n\n }\n\n\n\n true\n\n }\n\n}\n\n\n","file_path":"src/write.rs","rank":88,"score":17.38023969111278},{"content":" } => end_site_offset.as_ref(),\n\n _ => None,\n\n }\n\n }\n\n\n\n /// Returns `true` if the `Joint` has an `end_site_offset`, or `false` if it doesn't.\n\n #[inline]\n\n pub fn has_end_site(&self) -> bool {\n\n self.end_site().is_some()\n\n }\n\n\n\n /// Returns the ordered array of `Channel`s of this `JointData`.\n\n ///\n\n /// # Examples\n\n ///\n\n /// ```no_run\n\n /// # use bvh_anim::{bvh, ChannelType};\n\n /// let bvh = bvh! {\n\n /// HIERARCHY\n\n /// ROOT Hips\n","file_path":"src/joint.rs","rank":89,"score":17.3800130949508},{"content":" IndentStyle::Tabs\n\n }\n\n}\n\n\n\n/// Represents which line terminator style to use when writing a `Bvh` file.\n\n#[derive(Clone, Copy, Debug, Eq, Hash, PartialEq)]\n\npub enum LineTerminator {\n\n /// Use Unix-style line endings (`'\\n'`).\n\n Unix,\n\n /// Use Windows-style line endings (`'\\r\\n'`).\n\n Windows,\n\n}\n\n\n\nimpl LineTerminator {\n\n /// Get the line terminator style native to the current OS:\n\n ///\n\n /// * On Windows, this returns `LineTerminator::Windows`.\n\n /// * Otherwise, this returns `LineTerminator::Unix`.\n\n #[cfg(target_os = \"windows\")]\n\n #[inline]\n","file_path":"src/write.rs","rank":90,"score":17.361353315009367},{"content":"}\n\n\n\nimpl ChannelType {\n\n /// Attempt to parse a bvh channel byte string into a `ChannelType`.\n\n /// Returns `Err` if the string cannot be parsed.\n\n ///\n\n /// # Examples\n\n ///\n\n /// ```\n\n /// # use bvh_anim::ChannelType;\n\n /// assert_eq!(\n\n /// ChannelType::from_bytes(\"Xrotation\").unwrap(),\n\n /// ChannelType::RotationX);\n\n ///\n\n /// let err = ChannelType::from_bytes(\"Hello\").unwrap_err();\n\n /// assert_eq!(err.into_inner(), \"Hello\");\n\n /// ```\n\n #[inline]\n\n pub fn from_bytes<B>(s: &B) -> Result<Self, ParseChannelError>\n\n where\n","file_path":"src/lib.rs","rank":91,"score":17.212625520097184},{"content":" JointData::Root {\n\n ref mut channels, ..\n\n } => {\n\n channels.push(channel);\n\n }\n\n JointData::Child {\n\n ref mut channels, ..\n\n } => {\n\n channels.push(channel);\n\n }\n\n });\n\n self.current_channel_index += 1;\n\n }\n\n\n\n pub fn push_joint_offset(&mut self, offset: mint::Vector3<f32>, is_end_site: bool) {\n\n self.last_joint().map(|joint| {\n\n joint.set_offset(offset, is_end_site);\n\n });\n\n }\n\n\n","file_path":"src/macros.rs","rank":92,"score":17.111757735617395},{"content":" end_site_offset: Default::default(),\n\n private: JointPrivateData::empty(),\n\n }\n\n }\n\n\n\n #[inline]\n\n pub(crate) fn set_name<S: Into<JointName>>(&mut self, new_name: S) {\n\n match *self {\n\n JointData::Root { ref mut name, .. } => *name = new_name.into(),\n\n JointData::Child { ref mut name, .. } => *name = new_name.into(),\n\n }\n\n }\n\n\n\n pub(crate) fn set_offset(&mut self, new_offset: Vector3<f32>, is_site: bool) {\n\n match *self {\n\n JointData::Root { ref mut offset, .. } => *offset = new_offset,\n\n JointData::Child {\n\n ref mut offset,\n\n ref mut end_site_offset,\n\n ..\n","file_path":"src/joint.rs","rank":93,"score":16.989704234930844},{"content":" let idx = self.current_index;\n\n let dpth = self.current_depth;\n\n let parent = get_parent_index(&self.bvh.joints[..], dpth);\n\n\n\n let mut joint = JointData::empty_child();\n\n joint.set_name(name);\n\n if let Some(ref mut private) = joint.private_data_mut() {\n\n private.self_index = idx;\n\n private.depth = dpth;\n\n private.parent_index = parent;\n\n };\n\n\n\n self.bvh.joints.push(joint);\n\n\n\n self.current_index += 1;\n\n }\n\n\n\n pub fn push_channel(&mut self, channel: ChannelType) {\n\n let channel = Channel::new(channel, self.current_channel_index);\n\n self.last_joint().map(|joint| match *joint {\n","file_path":"src/macros.rs","rank":94,"score":16.78928388114753},{"content":" };\n\n\n\n {\n\n use super::{ChannelType, JointData};\n\n use mint::Vector3;\n\n\n\n fn check_joint<V0: Into<Vector3<f32>>, V1: Into<Vector3<f32>>, O: Into<Option<V1>>>(\n\n joint: &JointData,\n\n expected_name: &str,\n\n expected_offset: V0,\n\n channels: &[ChannelType],\n\n end_site: O,\n\n ) {\n\n assert_eq!(joint.name(), expected_name);\n\n assert_eq!(*joint.offset(), expected_offset.into());\n\n for (chan, expected_chan) in joint\n\n .channels()\n\n .iter()\n\n .map(|c| c.channel_type())\n\n .zip(channels.iter())\n","file_path":"src/macros.rs","rank":95,"score":16.66796128273741},{"content":"\n\nimpl From<&'_ CStr> for JointName {\n\n #[inline]\n\n fn from(s: &'_ CStr) -> Self {\n\n From::from(s.to_bytes())\n\n }\n\n}\n\n\n\nimpl From<Vec<u8>> for JointName {\n\n #[inline]\n\n fn from(s: Vec<u8>) -> Self {\n\n JointName(s.into_iter().collect())\n\n }\n\n}\n\n\n\nimpl From<&'_ [u8]> for JointName {\n\n #[inline]\n\n fn from(s: &'_ [u8]) -> Self {\n\n From::from(s.to_vec())\n\n }\n","file_path":"src/joint.rs","rank":96,"score":16.453161918796486},{"content":"use foreign_types::ForeignType;\n\nuse libc::{c_char, c_double, c_float, c_int, c_void, size_t, strlen, uint32_t, uint8_t, FILE};\n\nuse mint::Vector3;\n\nuse pkg_version::{pkg_version_major, pkg_version_minor, pkg_version_patch};\n\nuse std::{\n\n alloc::{self, Layout},\n\n convert::TryFrom,\n\n error::Error,\n\n ffi::{CStr, CString},\n\n fmt,\n\n io::BufReader,\n\n mem,\n\n ptr::{self, NonNull},\n\n slice,\n\n};\n\n\n\n/// Type alias for a function used to allocate memory.\n\n///\n\n/// May return `NULL` to signify allocation failures.\n\npub type bvh_AllocFunction =\n","file_path":"src/ffi.rs","rank":97,"score":16.38318362557323},{"content":" fn from(j: JointName) -> Self {\n\n j.0\n\n }\n\n}\n\n\n\nimpl fmt::Debug for JointName {\n\n #[inline]\n\n fn fmt(&self, fmtr: &mut fmt::Formatter<'_>) -> fmt::Result {\n\n fmt::Debug::fmt(AsRef::<BStr>::as_ref(self), fmtr)\n\n }\n\n}\n\n\n\nimpl fmt::Display for JointName {\n\n #[inline]\n\n fn fmt(&self, fmtr: &mut fmt::Formatter<'_>) -> fmt::Result {\n\n fmt::Display::fmt(AsRef::<BStr>::as_ref(self), fmtr)\n\n }\n\n}\n\n\n\n/// Data private to joints.\n","file_path":"src/joint.rs","rank":98,"score":16.33335806764695},{"content":" current_joint: 0,\n\n from_child: None,\n\n }\n\n }\n\n}\n\n\n\nimpl<'a> Iterator for JointsMut<'a> {\n\n type Item = JointMut<'a>;\n\n #[inline]\n\n fn next(&mut self) -> Option<Self::Item> {\n\n None\n\n }\n\n}\n\n\n\nimpl fmt::Debug for JointsMut<'_> {\n\n #[inline]\n\n fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {\n\n f.write_str(\"JointsMut { .. }\")\n\n }\n\n}\n","file_path":"src/joint.rs","rank":99,"score":16.301173651655184}],"string":"[\n {\n \"content\": \"fn collect_channels(channels: &[ChannelType], num_channels: &mut usize) -> SmallVec<[Channel; 6]> {\\n\\n let out_channels = channels\\n\\n .iter()\\n\\n .enumerate()\\n\\n .map(|(motion_index, &channel_type)| Channel {\\n\\n channel_type,\\n\\n motion_index: motion_index + *num_channels,\\n\\n })\\n\\n .collect::<SmallVec<[Channel; 6]>>();\\n\\n\\n\\n *num_channels += out_channels.len();\\n\\n out_channels\\n\\n}\\n\\n\\n\\nimpl Builder {\\n\\n /// Start to create a new `Bvh` with a root joint.\\n\\n pub fn with_root_joint(\\n\\n name: &BStr,\\n\\n offset: Vector3<f32>,\\n\\n channels: &[ChannelType],\\n\",\n \"file_path\": \"src/builder.rs\",\n \"rank\": 4,\n \"score\": 105391.73394084805\n },\n {\n \"content\": \"#[cfg(not(feature = \\\"bindings\\\"))]\\n\\nfn main() {}\\n\",\n \"file_path\": \"build.rs\",\n \"rank\": 5,\n \"score\": 103026.5960480849\n },\n {\n \"content\": \"use nalgebra::{Matrix4, Point, Point2, Point3, Vector3};\\n\\n\\n\\n/// An ArcBall controller, as defined by Ken Shoemake.\\n\\n/// See http://www.talisman.org/~erlkonig/misc/shoemake92-arcball.pdf\\n\\n#[derive(Clone, Debug)]\\n\\npub struct ArcBall {\\n\\n mouse_pos: Point2<f32>,\\n\\n prev_mouse_pos: Point2<f32>,\\n\\n center: Point3<f32>,\\n\\n radius: f32,\\n\\n}\\n\\n\\n\\nimpl ArcBall {\\n\\n #[inline]\\n\\n pub fn new() -> Self {\\n\\n Default::default()\\n\\n }\\n\\n\\n\\n #[inline]\\n\\n pub fn with_radius(radius: f32) -> Self {\\n\",\n \"file_path\": \"examples/bvh_viewer/arcball_camera.rs\",\n \"rank\": 17,\n \"score\": 81329.94603336157\n },\n {\n \"content\": \" ArcBall {\\n\\n mouse_pos: Point::origin(),\\n\\n prev_mouse_pos: Point::origin(),\\n\\n center: Point::origin(),\\n\\n radius,\\n\\n }\\n\\n }\\n\\n\\n\\n #[inline]\\n\\n pub fn on_mouse_move(&mut self, delta_mouse_x: f32, delta_mouse_y: f32) {\\n\\n self.prev_mouse_pos = self.mouse_pos;\\n\\n self.mouse_pos.coords.x += delta_mouse_x;\\n\\n self.mouse_pos.coords.y += delta_mouse_y;\\n\\n }\\n\\n\\n\\n pub fn on_scroll(&mut self, amount: f32) {}\\n\\n\\n\\n pub fn calculate_view_matrix(&self) -> Matrix4<f32> {\\n\\n unimplemented!()\\n\\n }\\n\\n}\\n\\n\\n\\nimpl Default for ArcBall {\\n\\n #[inline]\\n\\n fn default() -> Self {\\n\\n ArcBall::with_radius(1.0)\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"examples/bvh_viewer/arcball_camera.rs\",\n \"rank\": 18,\n \"score\": 81319.83114842587\n },\n {\n \"content\": \"#[cfg(feature = \\\"bindings\\\")]\\n\\nfn main() -> Result<(), error::Error> {\\n\\n use cbindgen::{self, Config, Language};\\n\\n use std::{\\n\\n env::{self, VarError},\\n\\n path::PathBuf,\\n\\n };\\n\\n\\n\\n let crate_dir = env::var(\\\"CARGO_MANIFEST_DIR\\\")?;\\n\\n let mut bindings = cbindgen::generate(crate_dir)?;\\n\\n\\n\\n push_stdio(&mut bindings.config);\\n\\n\\n\\n let mut header_path = target_dir()?;\\n\\n header_path.push(\\\"include/bvh_anim/bvh_anim.h\\\");\\n\\n\\n\\n bindings.write_to_file(header_path);\\n\\n\\n\\n build_and_run_ctests()?;\\n\\n\\n\\n #[inline]\\n\",\n \"file_path\": \"build.rs\",\n \"rank\": 19,\n \"score\": 78441.26360055899\n },\n {\n \"content\": \"int main(int argc, const char* argv[]) {\\n\\n (void)argc;\\n\\n (void)argv;\\n\\n\\n\\n FILE* bvh_file = fopen(\\\"./data/test_mocapbank.bvh\\\", \\\"r\\\");\\n\\n if (bvh_file == NULL) {\\n\\n return EXIT_FAILURE;\\n\\n }\\n\\n\\n\\n struct bvh_BvhFile bvh;\\n\\n int result = bvh_read(bvh_file, &bvh);\\n\\n fclose(bvh_file);\\n\\n\\n\\n if (result == 0) {\\n\\n return EXIT_FAILURE;\\n\\n }\\n\\n\\n\\n printf(\\\"Num joints = %zu\\\\n\\\", bvh.bvh_num_joints);\\n\\n for (size_t i = 0; i < bvh.bvh_num_joints; i++) {\\n\\n const struct bvh_Joint* joint = &bvh.bvh_joints[i];\\n\\n\\n\\n char* indent = (char*)malloc(sizeof(char) * joint->joint_depth);\\n\\n\\n\\n printf(\\\"%sJoint name = %s\\\\n\\\", indent, joint->joint_name);\\n\\n printf(\\\"%sJoint depth = %zu\\\\n\\\", indent, joint->joint_depth);\\n\\n printf(\\\"%sJoint parent = %zu\\\\n\\\", indent, joint->joint_parent_index);\\n\\n\\n\\n printf(\\n\\n \\\"%sJoint offset %f %f %f\\\\n\\\",\\n\\n indent,\\n\\n joint->joint_offset.offset_x,\\n\\n joint->joint_offset.offset_y,\\n\\n joint->joint_offset.offset_z);\\n\\n\\n\\n for (size_t curr_channel = 0; curr_channel < joint->joint_num_channels; curr_channel++) {\\n\\n const struct bvh_Channel* channel = &joint->joint_channels[curr_channel];\\n\\n printf(\\\"%sChannel %zu: \\\", indent, channel->channel_index);\\n\\n switch (channel->channel_type) {\\n\\n case X_POSITION: printf(\\\"Xposition\\\\n\\\"); break;\\n\\n case Y_POSITION: printf(\\\"Yposition\\\\n\\\"); break;\\n\\n case Z_POSITION: printf(\\\"Zposition\\\\n\\\"); break;\\n\\n case X_ROTATION: printf(\\\"Xrotation\\\\n\\\"); break;\\n\\n case Y_ROTATION: printf(\\\"Yrotation\\\\n\\\"); break;\\n\\n case Z_ROTATION: printf(\\\"Zrotation\\\\n\\\"); break;\\n\\n }\\n\\n }\\n\\n\\n\\n if (joint->joint_has_end_site) {\\n\\n printf(\\n\\n \\\"%sEnd site %f %f %f\\\\n\\\",\\n\\n indent,\\n\\n joint->joint_end_site.offset_x,\\n\\n joint->joint_end_site.offset_y,\\n\\n joint->joint_end_site.offset_z);\\n\\n }\\n\\n\\n\\n free(indent);\\n\\n }\\n\\n\\n\\n printf(\\\"Frame time: %f\\\\n\\\", bvh.bvh_frame_time);\\n\\n printf(\\\"Num frames: %zu\\\\n\\\", bvh.bvh_num_frames);\\n\\n printf(\\\"Num channels: %zu\\\\n\\\", bvh.bvh_num_channels);\\n\\n\\n\\n for (size_t frame = 0; frame < bvh.bvh_num_frames; frame++) {\\n\\n const float* channels = bvh_get_frame(&bvh, frame);\\n\\n for (size_t ch = 0; ch < bvh.bvh_num_channels; ch++) {\\n\\n printf(\\\"%f\\\", channels[ch]);\\n\\n if (ch < bvh.bvh_num_channels - 1) {\\n\\n printf(\\\" \\\");\\n\\n }\\n\\n }\\n\\n printf(\\\"\\\\n\\\");\\n\\n }\\n\\n\\n\\n return (bvh_destroy(&bvh) == 0) ? EXIT_FAILURE : EXIT_SUCCESS;\\n\",\n \"file_path\": \"ctests/parse_string.c\",\n \"rank\": 20,\n \"score\": 72793.2857401927\n },\n {\n \"content\": \"#[inline]\\n\\nfn fraction_seconds_to_duration(x: f64) -> Duration {\\n\\n Duration::from_nanos((x * NSEC_FACTOR) as u64)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/lib.rs\",\n \"rank\": 21,\n \"score\": 70459.32766143564\n },\n {\n \"content\": \"#[inline]\\n\\npub fn from_bytes<B: AsRef<[u8]>>(bytes: B) -> Result<Bvh, LoadError> {\\n\\n Bvh::from_bytes(bytes)\\n\\n}\\n\\n\\n\\n/// Parse a `str` as if it were an in-memory `Bvh` file.\\n\\n///\\n\\n/// # Examples\\n\\n///\\n\\n/// ```\\n\\n/// # use bvh_anim::{self, from_str};\\n\\n/// let bvh_string = \\\"\\n\\n/// HIERARCHY\\n\\n/// ROOT Hips\\n\\n/// {\\n\\n/// OFFSET 0.0 0.0 0.0\\n\\n/// CHANNELS 3 Xposition Yposition Zposition\\n\\n/// End Site\\n\\n/// {\\n\\n/// OFFSET 0.0 0.0 0.0\\n\\n/// }\\n\",\n \"file_path\": \"src/lib.rs\",\n \"rank\": 22,\n \"score\": 70128.8903592413\n },\n {\n \"content\": \"#[inline]\\n\\nfn duation_to_fractional_seconds(duration: &Duration) -> f64 {\\n\\n duration.subsec_nanos() as f64 / NSEC_FACTOR\\n\\n}\\n\",\n \"file_path\": \"src/lib.rs\",\n \"rank\": 23,\n \"score\": 68079.37759137109\n },\n {\n \"content\": \"fn heirarchy<'a>(data: &'a [u8]) -> IResult<&'a [u8], Vec<JointData>> {\\n\\n let mut joints = Vec::new();\\n\\n let mut num_channels = 0usize;\\n\\n let mut joint_index = 0usize;\\n\\n\\n\\n let mut channels = |data: &'a [u8]| -> IResult<&'a [u8], SmallVec<[Channel; 6]>> {\\n\\n let (mut data, expected_num_channels) = do_parse!(\\n\\n data,\\n\\n tag!(b\\\"CHANNELS\\\") >> num_channels: unsigned_int >> (num_channels)\\n\\n )?;\\n\\n\\n\\n let mut out_channels = smallvec![];\\n\\n for i in 0..expected_num_channels {\\n\\n let (new_data, channel_ty) = single_channel(data)?;\\n\\n let channel = Channel::new(channel_ty, num_channels);\\n\\n num_channels += 1;\\n\\n data = new_data;\\n\\n }\\n\\n\\n\\n Ok((&*data, out_channels))\\n\",\n \"file_path\": \"src/parse.rs\",\n \"rank\": 24,\n \"score\": 64153.441460332964\n },\n {\n \"content\": \"#[inline]\\n\\npub fn from_str(string: &str) -> Result<Bvh, LoadError> {\\n\\n Bvh::from_str(string)\\n\\n}\\n\\n\\n\\n/// A complete `bvh` file.\\n\\n///\\n\\n/// See the [module documentation](index.html#using-this-library)\\n\\n/// for more information.\\n\\n#[derive(Clone, Default, Debug, PartialEq)]\\n\\npub struct Bvh {\\n\\n /// The list of joints. If the root joint exists, it is always at\\n\\n /// index `0`.\\n\\n joints: Vec<JointData>,\\n\\n /// The motion values of the `Frame`.\\n\\n motion_values: Vec<f32>,\\n\\n /// The number of frames in the bvh.\\n\\n num_frames: usize,\\n\\n /// The number of `Channel`s in the bvh.\\n\\n num_channels: usize,\\n\\n /// The total time it takes to play one frame.\\n\",\n \"file_path\": \"src/lib.rs\",\n \"rank\": 25,\n \"score\": 60035.94241968177\n },\n {\n \"content\": \"type EnumeratedLines<'a> = CachedEnumerate<ByteLines<&'a mut dyn BufReadExt>>;\\n\\n\\n\\nimpl EnumeratedLines<'_> {\\n\\n pub fn next_non_empty_line(&mut self) -> Option<<Self as Iterator>::Item> {\\n\\n let mut next = self.next();\\n\\n loop {\\n\\n match next {\\n\\n None => return None,\\n\\n Some((idx, result)) => {\\n\\n let string = match result {\\n\\n Ok(s) => s,\\n\\n Err(e) => return Some((idx, Err(e))),\\n\\n };\\n\\n if string.trim().is_empty() {\\n\\n next = self.next()\\n\\n } else {\\n\\n return Some((idx, Ok(string)));\\n\\n }\\n\\n }\\n\\n }\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\n/// Loads the `Bvh` from the `reader`.\\n\",\n \"file_path\": \"src/lib.rs\",\n \"rank\": 26,\n \"score\": 54944.916933812616\n },\n {\n \"content\": \"#[inline]\\n\\nfn ptr_to_array<'a, T>(data: *mut T, size: libc::size_t) -> &'a [T] {\\n\\n if data.is_null() {\\n\\n &[]\\n\\n } else {\\n\\n unsafe { slice::from_raw_parts(data as *const _, size) }\\n\\n }\\n\\n}\\n\\n\\n\\n#[cfg(test)]\\n\\nmod tests {\\n\\n use crate::ffi::{\\n\\n bvh_AllocCallbacks, bvh_BvhFile, bvh_ChannelType, bvh_Offset, bvh_destroy, bvh_get_frame,\\n\\n bvh_parse,\\n\\n };\\n\\n use libc::strcmp;\\n\\n use std::ffi::CStr;\\n\\n\\n\\n fn check_ffi_bvh(mut bvh_ffi: bvh_BvhFile) {\\n\\n assert_eq!(bvh_ffi.bvh_num_joints, 2);\\n\\n\\n\",\n \"file_path\": \"src/ffi.rs\",\n \"rank\": 27,\n \"score\": 52169.70859957016\n },\n {\n \"content\": \"#[inline]\\n\\npub fn from_reader<R: BufReadExt>(data: R) -> Result<Bvh, LoadError> {\\n\\n Bvh::from_reader(data)\\n\\n}\\n\\n\\n\\n/// Parse a sequence of bytes as if it were an in-memory `Bvh` file.\\n\\n///\\n\\n/// # Examples\\n\\n///\\n\\n/// ```\\n\\n/// # use bvh_anim::{self, from_bytes};\\n\\n/// let bvh_string = br#\\\"\\n\\n/// HIERARCHY\\n\\n/// ROOT Hips\\n\\n/// {\\n\\n/// OFFSET 0.0 0.0 0.0\\n\\n/// CHANNELS 3 Xposition Yposition Zposition\\n\\n/// End Site\\n\\n/// {\\n\\n/// OFFSET 0.0 0.0 0.0\\n\\n/// }\\n\",\n \"file_path\": \"src/lib.rs\",\n \"rank\": 28,\n \"score\": 51033.92032830739\n },\n {\n \"content\": \"#[derive(Debug)]\\n\\nstruct InvalidAllocator {\\n\\n _priv: (),\\n\\n}\\n\\n\\n\\nimpl fmt::Display for InvalidAllocator {\\n\\n #[inline]\\n\\n fn fmt(&self, fmtr: &mut fmt::Formatter<'_>) -> fmt::Result {\\n\\n fmtr.write_str(self.description())\\n\\n }\\n\\n}\\n\\n\\n\\nimpl Error for InvalidAllocator {\\n\\n #[inline]\\n\\n fn description(&self) -> &'static str {\\n\\n \\\"The allocator is invalid\\\"\\n\\n }\\n\\n}\\n\\n\\n\\nimpl From<Bvh> for bvh_BvhFile {\\n\\n #[inline]\\n\",\n \"file_path\": \"src/ffi.rs\",\n \"rank\": 29,\n \"score\": 48506.72301192234\n },\n {\n \"content\": \"struct BuilderJoint {\\n\\n is_root: bool,\\n\\n name: JointName,\\n\\n offset: Vector3<f32>,\\n\\n channels: SmallVec<[Channel; 6]>,\\n\\n end_site_offset: Option<Vector3<f32>>,\\n\\n depth: usize,\\n\\n parent_index: Option<usize>,\\n\\n}\\n\\n\\n\\nimpl BuilderJoint {\\n\\n fn new(\\n\\n is_root: bool,\\n\\n name: &BStr,\\n\\n offset: Vector3<f32>,\\n\\n channels: SmallVec<[Channel; 6]>,\\n\\n depth: usize,\\n\\n ) -> Self {\\n\\n BuilderJoint {\\n\\n is_root,\\n\",\n \"file_path\": \"src/builder.rs\",\n \"rank\": 30,\n \"score\": 48502.4617746584\n },\n {\n \"content\": \"#[test]\\n\\n#[ignore] // @TODO(burtonageo): Turn this on when the nom parser lands\\n\\nfn nonstandard_formatting() {\\n\\n const BVH_STRING: &[u8] = br#\\\"\\n\\n HIERARCHY ROOT Base {\\n\\n OFFSET 0.0 0.0\\n\\n 0.0\\n\\n CHANNELS 6\\n\\n Xposition\\n\\n Yposition\\n\\n Zposition\\n\\n Zrotation\\n\\n Xrotation\\n\\n Yrotation\\n\\n Joint End {\\n\\n Offset\\n\\n 0.0\\n\\n 15.0\\n\\n 0.0\\n\\n CHANNELS 3 Zrotation\\n\\n Xrotation Yrotation\\n\\n End Site { Offset 0.0 0.0 30.0 }\\n\",\n \"file_path\": \"tests/parse.rs\",\n \"rank\": 31,\n \"score\": 46671.85401291783\n },\n {\n \"content\": \"fn motion_section(\\n\\ndata: &[u8],\\n\\nnum_channels: usize,\\n\\n) -> IResult<&[u8], (std::time::Duration, usize, Vec<f32>)> {\\n\\nlet (frame_time, num_frames) = frame_metadata(data)?;\\n\\nlet motion_data = Vec::with_capacity(num_channels * num_frames);\\n\\n\\n\\nfor f in 0..num_frames {\\n\\nlet chomped = do_parse!(data, take_while!(|ch| char::from(ch).is_ascii_whitespace()));\\n\\nlet (output, motion_val) = float(chomped);\\n\\nmotion_data.push(motion_val);\\n\\ndata = output;\\n\\n}\\n\\n\\n\\nOk((data, (frame_time, num_frames, motion_data)))\\n\\n}\\n\\n*/\\n\\n\\n\\nimpl Bvh {\\n\\n // @TODO: Remove panics\\n\",\n \"file_path\": \"src/parse.rs\",\n \"rank\": 32,\n \"score\": 46671.85401291783\n },\n {\n \"content\": \"#[test]\\n\\nfn ffi_convert() {\\n\\n let bvh = bvh! {\\n\\n HIERARCHY\\n\\n ROOT Base\\n\\n {\\n\\n OFFSET 0.0 0.0 0.0\\n\\n CHANNELS 6 Xposition Yposition Zposition Zrotation Xrotation Yrotation\\n\\n JOINT Middle1\\n\\n {\\n\\n OFFSET 0.0 0.0 15.0\\n\\n CHANNELS 3 Zrotation Xrotation Yrotation\\n\\n JOINT Tip1\\n\\n {\\n\\n OFFSET 0.0 0.0 30.0\\n\\n CHANNELS 3 Zrotation Xrotation Yrotation\\n\\n End Site\\n\\n {\\n\\n OFFSET 0.0 0.0 45.0\\n\\n }\\n\\n }\\n\",\n \"file_path\": \"tests/ffi.rs\",\n \"rank\": 33,\n \"score\": 46671.85401291783\n },\n {\n \"content\": \"#[test]\\n\\nfn custom_allocators() {}\\n\",\n \"file_path\": \"tests/ffi.rs\",\n \"rank\": 34,\n \"score\": 46671.85401291783\n },\n {\n \"content\": \"#[test]\\n\\nfn load_success() {\\n\\n let reader = File::open(\\\"./data/test_mocapbank.bvh\\\")\\n\\n .map(BufReader::new)\\n\\n .unwrap();\\n\\n\\n\\n let _bvh = bvh_anim::from_reader(reader).unwrap();\\n\\n}\\n\\n\\n\",\n \"file_path\": \"tests/parse.rs\",\n \"rank\": 35,\n \"score\": 46671.85401291783\n },\n {\n \"content\": \"#[test]\\n\\nfn test_write() {\\n\\n const BVH_STRING: &[u8] = include_bytes!(\\\"../data/test_simple.bvh\\\");\\n\\n\\n\\n let bvh = bvh! {\\n\\n HIERARCHY\\n\\n ROOT Base\\n\\n {\\n\\n OFFSET 0.0 0.0 0.0\\n\\n CHANNELS 6 Xposition Yposition Zposition Zrotation Xrotation Yrotation\\n\\n JOINT End\\n\\n {\\n\\n OFFSET 0.0 0.0 15.0\\n\\n CHANNELS 3 Zrotation Xrotation Yrotation\\n\\n End Site\\n\\n {\\n\\n OFFSET 0.0 0.0 30.0\\n\\n }\\n\\n }\\n\\n }\\n\\n MOTION\\n\",\n \"file_path\": \"tests/write.rs\",\n \"rank\": 36,\n \"score\": 46671.85401291783\n },\n {\n \"content\": \"struct CachedEnumerate<I> {\\n\\n iter: Enumerate<I>,\\n\\n last_enumerator: Option<usize>,\\n\\n}\\n\\n\\n\\nimpl<I> CachedEnumerate<I> {\\n\\n #[inline]\\n\\n fn new(iter: Enumerate<I>) -> Self {\\n\\n CachedEnumerate {\\n\\n iter,\\n\\n last_enumerator: None,\\n\\n }\\n\\n }\\n\\n\\n\\n #[inline]\\n\\n fn last_enumerator(&self) -> Option<usize> {\\n\\n self.last_enumerator\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/lib.rs\",\n \"rank\": 37,\n \"score\": 45445.4012144017\n },\n {\n \"content\": \"#[test]\\n\\nfn string_parse_small() {\\n\\n const BVH_BYTES: &[u8] = include_bytes!(\\\"../data/test_simple.bvh\\\");\\n\\n let bvh = bvh_anim::from_bytes(BVH_BYTES).unwrap();\\n\\n\\n\\n let bvh_from_macro = bvh_anim::bvh! {\\n\\n HIERARCHY\\n\\n ROOT Base\\n\\n {\\n\\n OFFSET 0.0 0.0 0.0\\n\\n CHANNELS 6 Xposition Yposition Zposition Zrotation Xrotation Yrotation\\n\\n JOINT End\\n\\n {\\n\\n OFFSET 0.0 0.0 15.0\\n\\n CHANNELS 3 Zrotation Xrotation Yrotation\\n\\n End Site\\n\\n {\\n\\n OFFSET 0.0 0.0 30.0\\n\\n }\\n\\n }\\n\\n }\\n\",\n \"file_path\": \"tests/parse.rs\",\n \"rank\": 38,\n \"score\": 45045.165372032236\n },\n {\n \"content\": \"#[inline(always)]\\n\\nfn frames_iter_logic(\\n\\n num_channels: usize,\\n\\n num_frames: usize,\\n\\n curr_frame: usize,\\n\\n) -> Option<Range<usize>> {\\n\\n if num_frames == 0 || curr_frame >= num_frames {\\n\\n return None;\\n\\n }\\n\\n\\n\\n let start = curr_frame * num_channels;\\n\\n let end = start + num_channels;\\n\\n\\n\\n Some(Range { start, end })\\n\\n}\\n\\n\\n\\n/// A wrapper for a slice of motion values, so that they can be indexed by `Channel`.\\n\\n#[derive(PartialEq)]\\n\\npub struct Frame([f32]);\\n\\n\\n\\nimpl fmt::Debug for Frame {\\n\",\n \"file_path\": \"src/lib.rs\",\n \"rank\": 39,\n \"score\": 45045.165372032236\n },\n {\n \"content\": \"#[test]\\n\\nfn ffi_load_from_cfile() {\\n\\n use bvh_anim::ffi::{bvh_BvhFile, bvh_read};\\n\\n use libc;\\n\\n use std::{ffi::CStr, ptr};\\n\\n\\n\\n let expected_bvh = bvh! {\\n\\n HIERARCHY\\n\\n ROOT Base\\n\\n {\\n\\n OFFSET 0.0 0.0 0.0\\n\\n CHANNELS 6 Xposition Yposition Zposition Zrotation Xrotation Yrotation\\n\\n JOINT End\\n\\n {\\n\\n OFFSET 0.0 0.0 15.0\\n\\n CHANNELS 3 Zrotation Xrotation Yrotation\\n\\n End Site\\n\\n {\\n\\n OFFSET 0.0 0.0 30.0\\n\\n }\\n\\n }\\n\",\n \"file_path\": \"tests/ffi.rs\",\n \"rank\": 40,\n \"score\": 45045.165372032236\n },\n {\n \"content\": \"#[test]\\n\\nfn string_parse_big() {\\n\\n const BVH_BYTES: &[u8] = include_bytes!(\\\"../data/test_mocapbank.bvh\\\");\\n\\n let bvh = bvh_anim::from_bytes(BVH_BYTES).unwrap();\\n\\n\\n\\n let bvh_from_macro = bvh_anim::bvh! {\\n\\n HIERARCHY\\n\\n ROOT Hips\\n\\n {\\n\\n OFFSET 0.0000 0.0000 0.0000\\n\\n CHANNELS 6 Xposition Yposition Zposition Zrotation Xrotation Yrotation\\n\\n JOINT Chest\\n\\n {\\n\\n OFFSET -0.1728 10.2870 0.1254\\n\\n CHANNELS 3 Zrotation Xrotation Yrotation\\n\\n JOINT Chest2\\n\\n {\\n\\n OFFSET 0.3229 15.8173 -2.6440\\n\\n CHANNELS 3 Zrotation Xrotation Yrotation\\n\\n JOINT LeftCollar\\n\\n {\\n\",\n \"file_path\": \"tests/parse_big.rs\",\n \"rank\": 41,\n \"score\": 43593.35881295193\n },\n {\n \"content\": \"#[test]\\n\\nfn test_load_write_is_identical() {\\n\\n const BVH_STRING: &str = include_str!(\\\"../data/test_simple.bvh\\\");\\n\\n let bvh = bvh_anim::from_str(BVH_STRING).unwrap();\\n\\n let bvh_string = WriteOptions::new()\\n\\n .with_indent(IndentStyle::with_spaces(4))\\n\\n .with_frame_time_significant_figures(9)\\n\\n .with_offset_significant_figures(1)\\n\\n .with_motion_values_significant_figures(1)\\n\\n .with_line_terminator(LineTerminator::native())\\n\\n .write_to_string(&bvh);\\n\\n\\n\\n assert_eq!(bvh_string, BVH_STRING);\\n\\n}\\n\",\n \"file_path\": \"tests/write.rs\",\n \"rank\": 42,\n \"score\": 43593.35881295193\n },\n {\n \"content\": \"# bvh_anim\\n\\n\\n\\n[![Latest Version]][crates.io] [![Documentation]][docs.rs] ![License]\\n\\n\\n\\nA rust library for loading `.bvh` files containing skeletal animation data.\\n\\n\\n\\n⚠⚠**NOTE**: This library is currently alpha quality software.⚠⚠\\n\\n\\n\\n## Basic usage\\n\\n\\n\\nTo get started, add the following to your `Cargo.toml`:\\n\\n\\n\\n```toml\\n\\n[dependencies]\\n\\nbvh_anim = \\\"0.4\\\"\\n\\n```\\n\\n\\n\\nAnd then, you can import the library using the `use bvh_anim::*;` statement\\n\\nin your rust files. A small example is shown below:\\n\\n\\n\\n```rust\\n\\nuse bvh_anim;\\n\\nuse std::fs::File;\\n\\n\\n\\nlet bvh_file = File::open(\\\"./path/to/anim.bvh\\\")?;\\n\\nlet bvh = bvh_anim::load(BufReader::new(bvh_file))?;\\n\\n\\n\\nfor joint in bvh.joints() {\\n\\n println!(\\\"{:#?}\\\", joint);\\n\\n}\\n\\n\\n\\nprintln!(\\\"Frame time: {:?}\\\", bvh.frame_time());\\n\\n\\n\\nfor frame in bvh.frames() {\\n\\n println!(\\\"{:?}\\\", frame);\\n\\n}\\n\\n\\n\\nlet mut out_file = File::create(\\\"./out.bvh\\\");\\n\\nbvh.write_to(&mut out_file)?;\\n\\n```\\n\\n\\n\\nFor more information about the bvh file format and using this library,\\n\\nsee the documentation on [docs.rs](https://docs.rs/bvh_anim).\\n\\n\\n\\n## Features\\n\\n\\n\\nThis crate has a small ffi module which allows you to parse `bvh` files\\n\\nfrom `C` code. The `ffi` module can be enabled with the `ffi` feature,\\n\\nand you can read the docs for it on [`docs.rs`][docs.rs/ffi].\\n\\n\\n\\nIn addition, the `bindings` feature can be enabled to generate the `C`\\n\\nbindings using `cbindgen`. The bindings header is written to either\\n\\n`$CARGO_TARGET_DIR` if it is specified, or\\n\\n`$CARGO_MANIFEST_DIR/target/include/bvh_anim/bvh_anim.h` if it is\\n\\nnot.\\n\\n\\n\\n## Contributing\\n\\n\\n\\nThis library welcomes open source contributions, including pull requests and bug\\n\\nreports (including feature requests).\\n\\n\\n\\nThis library aims to be the primary `bvh` parser in the Rust ecosystem, and aims\\n\\nto correctly parse a wide variety of `bvh` files. If you have a file which does\\n\\nnot parse correctly, please report a bug. Parsing should always return an error on\\n\\nfailure and never panic.\\n\\n\\n\",\n \"file_path\": \"Readme.md\",\n \"rank\": 43,\n \"score\": 37280.24595248993\n },\n {\n \"content\": \"## License\\n\\n\\n\\nCopyright © 2019 George Burton\\n\\n\\n\\nPermission is hereby granted, free of charge, to any person obtaining a copy of this software\\n\\nand associated documentation files (the \\\"Software\\\"), to deal in the Software without restriction,\\n\\nincluding without limitation the rights to use, copy, modify, merge, publish, distribute, sublicense,\\n\\nand/or sell copies of the Software, and to permit persons to whom the Software is furnished to do so,\\n\\nsubject to the following conditions:\\n\\n\\n\\nThe above copyright notice and this permission notice shall be included in all copies or substantial\\n\\nportions of the Software.\\n\\n\\n\\nTHE SOFTWARE IS PROVIDED \\\"AS IS\\\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT\\n\\nLIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN\\n\\nNO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY,\\n\\nWHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE\\n\\nSOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.\\n\\n\\n\\n[Documentation]: https://docs.rs/bvh_anim/badge.svg\\n\\n[Latest Version]: https://img.shields.io/crates/v/bvh_anim.svg\\n\\n[docs.rs]: https://docs.rs/bvh_anim\\n\\n[crates.io]: https://crates.io/crates/bvh_anim\\n\\n[License]: https://img.shields.io/crates/l/bvh_anim.svg\\n\\n<!--\\n\\nRemember to update this when a new version is published!!!\\n\\n-->\\n\",\n \"file_path\": \"Readme.md\",\n \"rank\": 44,\n \"score\": 37272.57917761266\n },\n {\n \"content\": \"Copyright 2019 George Burton\\n\\n\\n\\nPermission is hereby granted, free of charge, to any person obtaining a copy of this software and associated documentation files (the \\\"Software\\\"),\\n\\nto deal in the Software without restriction, including without limitation the rights to use, copy, modify, merge, publish, distribute, sublicense,\\n\\nand/or sell copies of the Software, and to permit persons to whom the Software is furnished to do so, subject to the following conditions:\\n\\n\\n\\nThe above copyright notice and this permission notice shall be included in all copies or substantial portions of the Software.\\n\\n\\n\\nTHE SOFTWARE IS PROVIDED \\\"AS IS\\\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\\n\\nFITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\\n\\nLIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS\\n\\nIN THE SOFTWARE.\\n\",\n \"file_path\": \"license.md\",\n \"rank\": 45,\n \"score\": 37270.328371309406\n },\n {\n \"content\": \"This is free and unencumbered software released into the public domain.\\n\\n\\n\\nAnyone is free to copy, modify, publish, use, compile, sell, or\\n\\ndistribute this software, either in source code form or as a compiled\\n\\nbinary, for any purpose, commercial or non-commercial, and by any\\n\\nmeans.\\n\\n\\n\\nIn jurisdictions that recognize copyright laws, the author or authors\\n\\nof this software dedicate any and all copyright interest in the\\n\\nsoftware to the public domain. We make this dedication for the benefit\\n\\nof the public at large and to the detriment of our heirs and\\n\\nsuccessors. We intend this dedication to be an overt act of\\n\\nrelinquishment in perpetuity of all present and future rights to this\\n\\nsoftware under copyright law.\\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 BE LIABLE FOR ANY CLAIM, DAMAGES OR\\n\\nOTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE,\\n\\nARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR\\n\\nOTHER DEALINGS IN THE SOFTWARE.\\n\\n\\n\\nFor more information, please refer to <http://unlicense.org>\\n\",\n \"file_path\": \"examples/license.md\",\n \"rank\": 46,\n \"score\": 35870.80345179701\n },\n {\n \"content\": \"#![no_main]\\n\\n#[macro_use] extern crate libfuzzer_sys;\\n\\nextern crate bvh_anim;\\n\\n\\n\\nfuzz_target!(|data: &[u8]| {\\n\\n let _ = bvh_anim::parse(data);\\n\\n});\\n\",\n \"file_path\": \"fuzz/fuzz_targets/bvh_parse.rs\",\n \"rank\": 47,\n \"score\": 26963.83976228064\n },\n {\n \"content\": \" Option<unsafe extern \\\"C\\\" fn(size: size_t, align: size_t) -> *mut c_void>;\\n\\n\\n\\n/// Type alias for a function used to free memory.\\n\\n///\\n\\n/// Passing a `NULL` pointer value is undefined.\\n\\npub type bvh_FreeFunction =\\n\\n Option<unsafe extern \\\"C\\\" fn(ptr: *mut c_void, size: size_t, align: size_t)>;\\n\\n\\n\\n/// A struct which wraps all allocation functions together for convenience.\\n\\n///\\n\\n/// This library may make additional transient allocations outside of\\n\\n/// any specific allocator parameters.\\n\\n///\\n\\n/// If you don't need a custom allocator, use the `BVH_ALLOCATOR_DEFAULT`\\n\\n/// allocator, which will fall back to the system allocator.\\n\\n///\\n\\n/// If either of the member functions are `NULL`, then functions which use\\n\\n/// the allocator will unconditionally fail.\\n\\n#[repr(C)]\\n\\n#[derive(Clone, Copy, Debug, Eq, Hash, PartialEq)]\\n\",\n \"file_path\": \"src/ffi.rs\",\n \"rank\": 48,\n \"score\": 24.81556259670665\n },\n {\n \"content\": \" unsafe fn free_n<T>(&self, ptr: *mut T, n: usize) {\\n\\n if let Some(free_cbk) = self.free_cbk {\\n\\n (free_cbk)(ptr as *mut _, mem::size_of::<T>() * n, mem::align_of::<T>());\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\n/// Create an allocator which uses the `std::alloc` functions.\\n\\nimpl Default for bvh_AllocCallbacks {\\n\\n #[inline]\\n\\n fn default() -> Self {\\n\\n BVH_ALLOCATOR_DEFAULT\\n\\n }\\n\\n}\\n\\n\\n\\n/// Allocation function which uses the rust allocator.\\n\\nunsafe extern \\\"C\\\" fn rust_alloc(size: size_t, align: size_t) -> *mut c_void {\\n\\n Layout::from_size_align(size, align)\\n\\n .map(|layout| alloc::alloc_zeroed(layout))\\n\\n .unwrap_or(ptr::null_mut()) as *mut _\\n\",\n \"file_path\": \"src/ffi.rs\",\n \"rank\": 49,\n \"score\": 23.829548874692442\n },\n {\n \"content\": \"#![allow(unused)]\\n\\n\\n\\n//! Defines a `Builder` struct used to build a `Bvh` dynamically.\\n\\n\\n\\nuse bstr::BStr;\\n\\nuse crate::{Bvh, Channel, ChannelType, JointName};\\n\\nuse mint::Vector3;\\n\\nuse smallvec::SmallVec;\\n\\nuse std::{fmt, time::Duration};\\n\\n\\n\\n/// The `Builder`.\\n\\n#[derive(Default)]\\n\\npub struct Builder {\\n\\n _priv: (),\\n\\n}\\n\\n\\n\\nimpl fmt::Debug for Builder {\\n\\n fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {\\n\\n f.write_str(\\\"Builder { .. }\\\")\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/builder.rs\",\n \"rank\": 50,\n \"score\": 23.3175097141953\n },\n {\n \"content\": \"/// Specify indentation style to use when writing the `Bvh` joints.\\n\\n///\\n\\n/// By default, this value is set to 1 tab.\\n\\n#[derive(Clone, Debug, Eq, Hash, PartialEq)]\\n\\npub enum IndentStyle {\\n\\n /// Do not indent nested joints.\\n\\n NoIndentation,\\n\\n /// Use a single tab (`'\\\\t'`) for indentation.\\n\\n Tabs,\\n\\n /// Use `n` spaces for indentation.\\n\\n Spaces(NonZeroUsize),\\n\\n}\\n\\n\\n\\nimpl IndentStyle {\\n\\n /// Create a new `IndentStyle` with `n` preceeding spaces.\\n\\n ///\\n\\n /// If `n` is `0`, then `IndentStyle::NoIndentation` is returned.\\n\\n #[inline]\\n\\n pub fn with_spaces(n: usize) -> Self {\\n\\n NonZeroUsize::new(n)\\n\",\n \"file_path\": \"src/write.rs\",\n \"rank\": 51,\n \"score\": 22.83678362014163\n },\n {\n \"content\": \"#![allow(unused)]\\n\\n\\n\\n//! Contains options for `bvh` file formatting.\\n\\n\\n\\nuse bstr::{BStr, BString, B};\\n\\nuse crate::{duation_to_fractional_seconds, Bvh, Frame, Frames, Joint, Joints};\\n\\nuse mint::Vector3;\\n\\nuse smallvec::SmallVec;\\n\\nuse std::{\\n\\n fmt,\\n\\n io::{self, Write},\\n\\n iter, mem,\\n\\n num::NonZeroUsize,\\n\\n};\\n\\n\\n\\n/// Specify formatting options for writing a `Bvh`.\\n\\n#[derive(Clone, Debug, Eq, Hash, PartialEq)]\\n\\npub struct WriteOptions {\\n\\n /// Which indentation style to use for nested bones.\\n\\n pub indent: IndentStyle,\\n\",\n \"file_path\": \"src/write.rs\",\n \"rank\": 52,\n \"score\": 22.544675073168378\n },\n {\n \"content\": \"/// A mutable iterator over the frames of a `Bvh`.\\n\\n#[derive(Debug)]\\n\\npub struct FramesMut<'a> {\\n\\n motion_values: &'a mut [f32],\\n\\n num_channels: usize,\\n\\n num_frames: usize,\\n\\n curr_frame: usize,\\n\\n}\\n\\n\\n\\nimpl FramesMut<'_> {\\n\\n /// Returns the number of `Frame`s left to iterate over.\\n\\n #[inline]\\n\\n pub const fn len(&self) -> usize {\\n\\n self.num_frames - self.curr_frame\\n\\n }\\n\\n\\n\\n /// Returns `true` if the number of `Frame`s left to iterate over is `0`.\\n\\n #[inline]\\n\\n pub const fn is_empty(&self) -> bool {\\n\\n self.len() == 0\\n\",\n \"file_path\": \"src/lib.rs\",\n \"rank\": 53,\n \"score\": 21.558310918661064\n },\n {\n \"content\": \"/// A channel composed of a `bvh_ChannelType` and an index into the\\n\\n/// `bvh_BvhFile::bvh_motion_data` array to which it corresponds.\\n\\n#[repr(C)]\\n\\n#[derive(Clone, Copy, Debug, Eq, Hash, Ord, PartialEq, PartialOrd)]\\n\\npub struct bvh_Channel {\\n\\n /// The type of the channel.\\n\\n pub channel_type: bvh_ChannelType,\\n\\n /// The index into the motion data array.\\n\\n pub channel_index: size_t,\\n\\n}\\n\\n\\n\\n/// A single joint in the `HIERARCHY` section of a `bvh_BvhFile`.\\n\\n#[repr(C)]\\n\\n#[derive(Clone, Copy, PartialEq)]\\n\\npub struct bvh_Joint {\\n\\n /// The name of the joint.\\n\\n pub joint_name: *mut c_char,\\n\\n /// The ordered array of channels of the `bvh_Joint`.\\n\\n pub joint_channels: *mut bvh_Channel,\\n\\n /// The length of the `joint_channels` array.\\n\",\n \"file_path\": \"src/ffi.rs\",\n \"rank\": 54,\n \"score\": 21.31256384529093\n },\n {\n \"content\": \" fn try_from(string: &'_ BStr) -> Result<Self, Self::Error> {\\n\\n Bvh::from_bytes(string.as_bytes())\\n\\n }\\n\\n}\\n\\n\\n\\nimpl TryFrom<&'_ [u8]> for Bvh {\\n\\n type Error = LoadError;\\n\\n #[inline]\\n\\n fn try_from(bytes: &'_ [u8]) -> Result<Self, Self::Error> {\\n\\n Bvh::from_bytes(bytes)\\n\\n }\\n\\n}\\n\\n\\n\\n/// A `Channel` composed of a `ChannelType` and an index into the\\n\\n/// corresponding motion data.\\n\\n#[derive(Clone, Copy, Debug, Eq, Hash, PartialEq)]\\n\\npub struct Channel {\\n\\n /// The type of the `Channel`.\\n\\n channel_type: ChannelType,\\n\\n /// The index into the `Frame` which corresponds to this `Channel`.\\n\",\n \"file_path\": \"src/lib.rs\",\n \"rank\": 55,\n \"score\": 20.972446589051955\n },\n {\n \"content\": \"#[must_use]\\n\\npub unsafe extern \\\"C\\\" fn bvh_to_string(\\n\\n bvh_file: *const bvh_BvhFile,\\n\\n out_buffer_allocator: bvh_AllocFunction,\\n\\n out_buffer: *mut *mut c_char,\\n\\n) -> c_int {\\n\\n /*\\n\\n if bvh_file.is_null() {\\n\\n return 1;\\n\\n }\\n\\n \\n\\n let bvh = match Bvh::from_ffi(*bvh_file) {\\n\\n Ok(bvh) => bvh,\\n\\n Err(_) => return 1,\\n\\n };\\n\\n \\n\\n let string = bvh.to_bstring();\\n\\n *bvh_file = bvh.into_ffi();\\n\\n let out_buf_len = string.len() + 1;\\n\\n \\n\",\n \"file_path\": \"src/ffi.rs\",\n \"rank\": 56,\n \"score\": 20.775044763303192\n },\n {\n \"content\": \" {\\n\\n assert_eq!(chan, *expected_chan);\\n\\n }\\n\\n let end_site = end_site.into().map(Into::into);\\n\\n assert_eq!(joint.end_site(), end_site.as_ref());\\n\\n }\\n\\n\\n\\n let mut joints = bvh.joints();\\n\\n\\n\\n check_joint::<[_; 3], [f32; 3], _>(\\n\\n joints.next().unwrap().data(),\\n\\n \\\"Base\\\",\\n\\n [0.0, 0.0, 0.0],\\n\\n &[\\n\\n ChannelType::PositionX,\\n\\n ChannelType::PositionY,\\n\\n ChannelType::PositionZ,\\n\\n ChannelType::RotationZ,\\n\\n ChannelType::RotationX,\\n\\n ChannelType::RotationY,\\n\",\n \"file_path\": \"src/macros.rs\",\n \"rank\": 57,\n \"score\": 20.62891857029142\n },\n {\n \"content\": \"}\\n\\n\\n\\nimpl fmt::Debug for Joints<'_> {\\n\\n #[inline]\\n\\n fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {\\n\\n f.write_str(\\\"Joints { .. }\\\")\\n\\n }\\n\\n}\\n\\n\\n\\nimpl<'a> Joints<'a> {\\n\\n /// Create a `Joints` iterator over all the `joints` in a `Bvh` file.\\n\\n pub(crate) fn iter_root(joints: &'a [JointData] //clips: &'a AtomicRefCell<Clips>\\n\\n ) -> Self {\\n\\n Joints {\\n\\n joints,\\n\\n // clips,\\n\\n current_joint: 0,\\n\\n from_child: None,\\n\\n }\\n\\n }\\n\",\n \"file_path\": \"src/joint.rs\",\n \"rank\": 58,\n \"score\": 20.505390089569477\n },\n {\n \"content\": \"\\n\\n #[inline]\\n\\n pub fn check_valid_motion(&self) -> bool {\\n\\n self.bvh.motion_values.len() == self.bvh.num_channels * self.bvh.num_frames\\n\\n }\\n\\n\\n\\n #[inline]\\n\\n fn last_joint(&mut self) -> Option<&mut JointData> {\\n\\n self.bvh.joints.last_mut()\\n\\n }\\n\\n}\\n\\n\\n\\n#[cfg(test)]\\n\\nmod tests {\\n\\n // Needed for macros\\n\\n use std::time::Duration;\\n\\n\\n\\n #[test]\\n\\n fn macro_create() {\\n\\n let bvh = bvh! {\\n\",\n \"file_path\": \"src/macros.rs\",\n \"rank\": 59,\n \"score\": 20.49126695071829\n },\n {\n \"content\": \" ///\\n\\n /// ```\\n\\n /// # use bvh_anim::ChannelType;\\n\\n /// let channel_type = ChannelType::RotationX;\\n\\n /// assert!(channel_type.is_rotation());\\n\\n /// ```\\n\\n #[inline]\\n\\n pub fn is_rotation(&self) -> bool {\\n\\n match *self {\\n\\n ChannelType::RotationX | ChannelType::RotationY | ChannelType::RotationZ => true,\\n\\n _ => false,\\n\\n }\\n\\n }\\n\\n\\n\\n /// Returns `true` if this channel corresponds to a positional\\n\\n /// transform, otherwise `false`.\\n\\n ///\\n\\n /// # Example\\n\\n ///\\n\\n /// ```\\n\",\n \"file_path\": \"src/lib.rs\",\n \"rank\": 60,\n \"score\": 20.43454473011532\n },\n {\n \"content\": \"}\\n\\n\\n\\nimpl From<Vector3<f32>> for bvh_Offset {\\n\\n #[inline]\\n\\n fn from(v: Vector3<f32>) -> Self {\\n\\n bvh_Offset {\\n\\n offset_x: v.x,\\n\\n offset_y: v.y,\\n\\n offset_z: v.z,\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\nimpl From<bvh_Offset> for Vector3<f32> {\\n\\n #[inline]\\n\\n fn from(offset: bvh_Offset) -> Self {\\n\\n let crate::ffi::bvh_Offset {\\n\\n offset_x,\\n\\n offset_y,\\n\\n offset_z,\\n\",\n \"file_path\": \"src/ffi.rs\",\n \"rank\": 61,\n \"score\": 20.376595800355048\n },\n {\n \"content\": \"use bstr::{BStr, BString, ByteSlice};\\n\\nuse crate::Channel;\\n\\nuse mint::Vector3;\\n\\nuse smallvec::SmallVec;\\n\\nuse std::{\\n\\n cmp::{Ordering, PartialEq, PartialOrd},\\n\\n ffi::{CStr, CString},\\n\\n fmt, mem,\\n\\n ops::{Deref, DerefMut},\\n\\n str,\\n\\n};\\n\\n\\n\\n/// Internal representation of a joint.\\n\\n#[derive(Clone, Debug, PartialEq)]\\n\\npub enum JointData {\\n\\n /// Root of the skeletal heirarchy.\\n\\n Root {\\n\\n /// Name of the root `Joint`.\\n\\n name: JointName,\\n\\n /// Positional offset of this `Joint` relative to the parent.\\n\",\n \"file_path\": \"src/joint.rs\",\n \"rank\": 62,\n \"score\": 20.185548724850374\n },\n {\n \"content\": \" /// # use bvh_anim::ChannelType;\\n\\n /// let channel_type = ChannelType::PositionZ;\\n\\n /// assert!(channel_type.is_position());\\n\\n /// ```\\n\\n #[inline]\\n\\n pub fn is_position(&self) -> bool {\\n\\n !self.is_rotation()\\n\\n }\\n\\n\\n\\n /// Get the `Axis` about which this `Channel` transforms.\\n\\n ///\\n\\n /// # Example\\n\\n ///\\n\\n /// ```\\n\\n /// # use bvh_anim::{Axis, ChannelType};\\n\\n /// let channel_type = ChannelType::PositionX;\\n\\n /// assert_eq!(channel_type.axis(), Axis::X);\\n\\n /// ```\\n\\n #[inline]\\n\\n pub fn axis(&self) -> Axis {\\n\",\n \"file_path\": \"src/lib.rs\",\n \"rank\": 63,\n \"score\": 20.177633630094594\n },\n {\n \"content\": \"pub struct bvh_AllocCallbacks {\\n\\n /// The `alloc` function.\\n\\n pub alloc_cbk: bvh_AllocFunction,\\n\\n /// The `free` function.\\n\\n pub free_cbk: bvh_FreeFunction,\\n\\n}\\n\\n\\n\\n/// The default allocator, which uses the rust allocator (which is the\\n\\n/// system allocator by default).\\n\\n#[no_mangle]\\n\\npub static BVH_ALLOCATOR_DEFAULT: bvh_AllocCallbacks = bvh_AllocCallbacks {\\n\\n alloc_cbk: Some(rust_alloc as unsafe extern \\\"C\\\" fn(size: size_t, align: size_t) -> *mut c_void),\\n\\n free_cbk: Some(\\n\\n rust_free as unsafe extern \\\"C\\\" fn(ptr: *mut c_void, size: size_t, align: size_t),\\n\\n ),\\n\\n};\\n\\n\\n\\n#[allow(unused)]\\n\\nimpl bvh_AllocCallbacks {\\n\\n /// Create a new `bvh_AllocCallbacks` instance with the given allocation\\n\",\n \"file_path\": \"src/ffi.rs\",\n \"rank\": 64,\n \"score\": 20.142714157227502\n },\n {\n \"content\": \" }\\n\\n\\n\\n #[inline]\\n\\n pub(crate) const fn empty() -> Self {\\n\\n Self::new(0, 0, 0)\\n\\n }\\n\\n}\\n\\n\\n\\nimpl fmt::Debug for JointPrivateData {\\n\\n fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {\\n\\n f.write_str(\\\"JointPrivateData { .. }\\\")\\n\\n }\\n\\n}\\n\\n\\n\\n/// An iterator over the `Joint`s of a `Bvh` skeleton.\\n\\npub struct Joints<'a> {\\n\\n pub(crate) joints: &'a [JointData],\\n\\n // pub(crate) motion_values: &'a [f32],\\n\\n pub(crate) current_joint: usize,\\n\\n pub(crate) from_child: Option<usize>,\\n\",\n \"file_path\": \"src/joint.rs\",\n \"rank\": 65,\n \"score\": 19.97805607519115\n },\n {\n \"content\": \" ///\\n\\n /// # Returns\\n\\n ///\\n\\n /// Returns `true` when there are still more lines available,\\n\\n /// `false` when all lines have been extracted.\\n\\n fn next_chunk<'a, 'b: 'a>(\\n\\n &self,\\n\\n bvh: &'b Bvh,\\n\\n chunk: &mut Vec<u8>,\\n\\n iter_state: &'a mut WriteOptionsIterState<'b>,\\n\\n ) -> bool {\\n\\n chunk.clear();\\n\\n\\n\\n let terminator = self.line_terminator.as_bstr().as_ref();\\n\\n\\n\\n match *iter_state {\\n\\n WriteOptionsIterState::WriteHierarchy { ref mut written } => {\\n\\n if !*written {\\n\\n *chunk = b\\\"HIERARCHY\\\".to_vec();\\n\\n chunk.extend_from_slice(self.line_terminator.as_bstr().as_ref());\\n\",\n \"file_path\": \"src/write.rs\",\n \"rank\": 66,\n \"score\": 19.941679094451167\n },\n {\n \"content\": \"}\\n\\n\\n\\n/// Deallocation function which uses the rust allocator.\\n\\nunsafe extern \\\"C\\\" fn rust_free(ptr: *mut c_void, size: size_t, align: size_t) {\\n\\n Layout::from_size_align(size, align)\\n\\n .map(|layout| alloc::dealloc(ptr as *mut _, layout))\\n\\n .expect(&format!(\\\"Could not deallocate pointer {:p}\\\", ptr))\\n\\n}\\n\\n\\n\\n/// A type representing an `OFFSET` position.\\n\\n#[repr(C)]\\n\\n#[derive(Clone, Copy, Debug, Default, PartialEq)]\\n\\npub struct bvh_Offset {\\n\\n /// The x-component of the `OFFSET`.\\n\\n pub offset_x: c_float,\\n\\n /// The y-component of the `OFFSET`.\\n\\n pub offset_y: c_float,\\n\\n /// The z-component of the `OFFSET`.\\n\\n pub offset_z: c_float,\\n\\n}\\n\",\n \"file_path\": \"src/ffi.rs\",\n \"rank\": 67,\n \"score\": 19.885568605871285\n },\n {\n \"content\": \" } = offset;\\n\\n [offset_x, offset_y, offset_z].into()\\n\\n }\\n\\n}\\n\\n\\n\\nimpl From<ChannelType> for bvh_ChannelType {\\n\\n #[inline]\\n\\n fn from(channel_ty: ChannelType) -> Self {\\n\\n match channel_ty {\\n\\n ChannelType::RotationX => bvh_ChannelType::X_ROTATION,\\n\\n ChannelType::RotationY => bvh_ChannelType::Y_ROTATION,\\n\\n ChannelType::RotationZ => bvh_ChannelType::Z_ROTATION,\\n\\n ChannelType::PositionX => bvh_ChannelType::X_POSITION,\\n\\n ChannelType::PositionY => bvh_ChannelType::Y_POSITION,\\n\\n ChannelType::PositionZ => bvh_ChannelType::Z_POSITION,\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\nimpl From<bvh_ChannelType> for ChannelType {\\n\",\n \"file_path\": \"src/ffi.rs\",\n \"rank\": 68,\n \"score\": 19.740529936918627\n },\n {\n \"content\": \" #[inline]\\n\\n fn deref_mut(&mut self) -> &mut Self::Target {\\n\\n &mut self.0\\n\\n }\\n\\n}\\n\\n\\n\\nimpl<B: AsRef<[u8]>> PartialEq<B> for JointName {\\n\\n #[inline]\\n\\n fn eq(&self, rhs: &B) -> bool {\\n\\n AsRef::<BStr>::as_ref(self) == rhs.as_ref()\\n\\n }\\n\\n}\\n\\n\\n\\nimpl<B: AsRef<[u8]>> PartialOrd<B> for JointName {\\n\\n #[inline]\\n\\n fn partial_cmp(&self, rhs: &B) -> Option<Ordering> {\\n\\n AsRef::<BStr>::as_ref(self).partial_cmp(rhs.as_ref())\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/joint.rs\",\n \"rank\": 69,\n \"score\": 19.59491694336925\n },\n {\n \"content\": \" #[inline]\\n\\n fn from(channel_ty: bvh_ChannelType) -> Self {\\n\\n match channel_ty {\\n\\n bvh_ChannelType::X_POSITION => ChannelType::PositionX,\\n\\n bvh_ChannelType::Y_POSITION => ChannelType::PositionY,\\n\\n bvh_ChannelType::Z_POSITION => ChannelType::PositionZ,\\n\\n bvh_ChannelType::X_ROTATION => ChannelType::RotationX,\\n\\n bvh_ChannelType::Y_ROTATION => ChannelType::RotationY,\\n\\n bvh_ChannelType::Z_ROTATION => ChannelType::RotationZ,\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\nimpl From<Channel> for bvh_Channel {\\n\\n #[inline]\\n\\n fn from(ch: Channel) -> Self {\\n\\n bvh_Channel {\\n\\n channel_type: ch.channel_type().into(),\\n\\n channel_index: ch.motion_index().into(),\\n\\n }\\n\",\n \"file_path\": \"src/ffi.rs\",\n \"rank\": 70,\n \"score\": 19.433669332440413\n },\n {\n \"content\": \" /// # OFFSET 0.0 0.0 30.0\\n\\n /// # }\\n\\n /// }\\n\\n /// MOTION\\n\\n /// // ...\\n\\n /// # Frames: 0\\n\\n /// # Frame Time: 0.0333333\\n\\n /// };\\n\\n ///\\n\\n /// let root = bvh.root_joint().unwrap();\\n\\n /// assert_eq!(root.data().offset(), &[1.2, 3.4, 5.6].into());\\n\\n /// ```\\n\\n #[inline]\\n\\n pub fn offset(&self) -> &Vector3<f32> {\\n\\n match *self {\\n\\n JointData::Child { ref offset, .. } | JointData::Root { ref offset, .. } => offset,\\n\\n }\\n\\n }\\n\\n\\n\\n /// Returns the `end_site` position if this `Joint` has an end site, or `None` if\\n\",\n \"file_path\": \"src/joint.rs\",\n \"rank\": 71,\n \"score\": 18.968527979823264\n },\n {\n \"content\": \" }\\n\\n\\n\\n joint\\n\\n }\\n\\n}\\n\\n\\n\\n/// A mutable iterator over the `Joint`s of a `Bvh` skeleton.\\n\\n#[allow(unused)]\\n\\npub struct JointsMut<'a> {\\n\\n pub(crate) joints: &'a mut [JointData],\\n\\n pub(crate) current_joint: usize,\\n\\n pub(crate) from_child: Option<usize>,\\n\\n}\\n\\n\\n\\nimpl<'a> JointsMut<'a> {\\n\\n pub(crate) fn iter_root(joints: &'a mut [JointData] //clips: &'a AtomicRefCell<Clips>\\n\\n ) -> Self {\\n\\n JointsMut {\\n\\n joints,\\n\\n // clips,\\n\",\n \"file_path\": \"src/joint.rs\",\n \"rank\": 72,\n \"score\": 18.96142602346638\n },\n {\n \"content\": \" motion_values_significant_figures: 2,\\n\\n _nonexhaustive: (),\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\nimpl WriteOptions {\\n\\n /// Create a new `WriteOptions` with default values.\\n\\n #[inline]\\n\\n pub fn new() -> Self {\\n\\n Default::default()\\n\\n }\\n\\n\\n\\n /// Output the `Bvh` file to the `writer` with the given options.\\n\\n pub fn write<W: Write>(&self, bvh: &Bvh, writer: &mut W) -> io::Result<()> {\\n\\n let mut curr_chunk = vec![];\\n\\n let mut curr_bytes_written = 0usize;\\n\\n let mut curr_string_len = 0usize;\\n\\n let mut iter_state = WriteOptionsIterState::new();\\n\\n\\n\",\n \"file_path\": \"src/write.rs\",\n \"rank\": 73,\n \"score\": 18.90229374199194\n },\n {\n \"content\": \"\\n\\nimpl fmt::Debug for bvh_Joint {\\n\\n #[inline]\\n\\n fn fmt(&self, fmtr: &mut fmt::Formatter<'_>) -> fmt::Result {\\n\\n let joint_name = unsafe { CStr::from_ptr(self.joint_name as *const _) };\\n\\n let channels = ptr_to_array(self.joint_channels, self.joint_num_channels);\\n\\n\\n\\n let has_end_site = if self.joint_has_end_site == 0 {\\n\\n false\\n\\n } else {\\n\\n true\\n\\n };\\n\\n\\n\\n let parent_index = if self.joint_parent_index == usize::max_value() {\\n\\n #[derive(Debug)]\\n\\n struct None;\\n\\n &None as &dyn fmt::Debug\\n\\n } else {\\n\\n &self.joint_parent_index as &dyn fmt::Debug\\n\\n };\\n\",\n \"file_path\": \"src/ffi.rs\",\n \"rank\": 74,\n \"score\": 18.826224697964513\n },\n {\n \"content\": \" unsafe {\\n\\n let root = *bvh_ffi.bvh_joints.offset(0);\\n\\n\\n\\n let expected_name = CStr::from_bytes_with_nul(b\\\"Base\\\\0\\\").unwrap();\\n\\n assert_eq!(strcmp(root.joint_name, expected_name.as_ptr()), 0);\\n\\n\\n\\n assert_eq!(root.joint_num_channels, 6);\\n\\n\\n\\n let expected_channels = [\\n\\n bvh_ChannelType::X_POSITION,\\n\\n bvh_ChannelType::Y_POSITION,\\n\\n bvh_ChannelType::Z_POSITION,\\n\\n bvh_ChannelType::Z_ROTATION,\\n\\n bvh_ChannelType::X_ROTATION,\\n\\n bvh_ChannelType::Y_ROTATION,\\n\\n ];\\n\\n\\n\\n for i in 0..root.joint_num_channels {\\n\\n let channel = *root.joint_channels.offset(i as isize);\\n\\n assert_eq!(channel.channel_index, i);\\n\",\n \"file_path\": \"src/ffi.rs\",\n \"rank\": 75,\n \"score\": 18.809232905136717\n },\n {\n \"content\": \"#[derive(Clone, Copy, Debug, Eq, Hash, Ord, PartialEq, PartialOrd)]\\n\\npub enum Axis {\\n\\n /// `x` axis.\\n\\n X,\\n\\n /// `y` axis.\\n\\n Y,\\n\\n /// `z` axis.\\n\\n Z,\\n\\n}\\n\\n\\n\\nimpl Axis {\\n\\n /// Returns the `Vector3` which represents the axis.\\n\\n ///\\n\\n /// # Examples\\n\\n ///\\n\\n /// ```\\n\\n /// # use bvh_anim::Axis;\\n\\n /// assert_eq!(Axis::X.vector(), [1.0, 0.0, 0.0].into());\\n\\n /// assert_eq!(Axis::Y.vector(), [0.0, 1.0, 0.0].into());\\n\\n /// assert_eq!(Axis::Z.vector(), [0.0, 0.0, 1.0].into());\\n\",\n \"file_path\": \"src/lib.rs\",\n \"rank\": 76,\n \"score\": 18.758325985371172\n },\n {\n \"content\": \"\\n\\n/// A channel type representing a degree of freedom along which a\\n\\n/// joint may move.\\n\\n#[repr(C)]\\n\\n#[derive(Clone, Copy, Debug, Eq, Hash, Ord, PartialEq, PartialOrd)]\\n\\npub enum bvh_ChannelType {\\n\\n /// An `Xposition` channel type.\\n\\n X_POSITION,\\n\\n /// A `Yposition` channel type.\\n\\n Y_POSITION,\\n\\n /// A `Zposition` channel type.\\n\\n Z_POSITION,\\n\\n /// An `Xrotation` channel type.\\n\\n X_ROTATION,\\n\\n /// A `Yrotation` channel type.\\n\\n Y_ROTATION,\\n\\n /// A `Zrotation` channel type.\\n\\n Z_ROTATION,\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/ffi.rs\",\n \"rank\": 77,\n \"score\": 18.68174783954572\n },\n {\n \"content\": \" #[inline]\\n\\n fn fmt(&self, fmtr: &mut fmt::Formatter<'_>) -> fmt::Result {\\n\\n fmt::Debug::fmt(&self.0, fmtr)\\n\\n }\\n\\n}\\n\\n\\n\\nimpl Frame {\\n\\n #[inline]\\n\\n fn from_slice<'a>(frame_motions: &'a [f32]) -> &'a Frame {\\n\\n unsafe { &*(frame_motions as *const [f32] as *const Frame) }\\n\\n }\\n\\n\\n\\n #[inline]\\n\\n fn from_mut_slice<'a>(frame_motions: &'a mut [f32]) -> &'a mut Frame {\\n\\n unsafe { &mut *(frame_motions as *mut [f32] as *mut Frame) }\\n\\n }\\n\\n\\n\\n /// Returns the number of motion values in the `Frame`.\\n\\n #[inline]\\n\\n pub fn len(&self) -> usize {\\n\",\n \"file_path\": \"src/lib.rs\",\n \"rank\": 78,\n \"score\": 18.64327681445261\n },\n {\n \"content\": \" frame_time: Duration,\\n\\n}\\n\\n\\n\\nimpl Bvh {\\n\\n /// Create an empty `Bvh`.\\n\\n #[inline]\\n\\n pub fn new() -> Self {\\n\\n Default::default()\\n\\n }\\n\\n\\n\\n /// Parse a sequence of bytes as if it were an in-memory `Bvh` file.\\n\\n ///\\n\\n /// # Examples\\n\\n ///\\n\\n /// ```\\n\\n /// # use bvh_anim::{self, Bvh};\\n\\n /// let bvh_string = br#\\\"\\n\\n /// HIERARCHY\\n\\n /// ROOT Hips\\n\\n /// {\\n\",\n \"file_path\": \"src/lib.rs\",\n \"rank\": 79,\n \"score\": 18.49019286537508\n },\n {\n \"content\": \" }\\n\\n }\\n\\n}\\n\\n\\n\\n/// The `MotionBuilder`.\\n\\npub struct MotionBuilder {\\n\\n joints_builder: JointsBuilder,\\n\\n frame_time: Duration,\\n\\n num_frames: usize,\\n\\n motion_values: Vec<f32>,\\n\\n}\\n\\n\\n\\nimpl fmt::Debug for MotionBuilder {\\n\\n fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {\\n\\n f.write_str(\\\"MotionBuilder { .. }\\\")\\n\\n }\\n\\n}\\n\\n\\n\\nimpl MotionBuilder {\\n\\n /// Push a frame of motion values.\\n\",\n \"file_path\": \"src/builder.rs\",\n \"rank\": 80,\n \"score\": 18.413658613883804\n },\n {\n \"content\": \" /// }\\n\\n /// }\\n\\n /// MOTION\\n\\n /// // ...\\n\\n /// # Frames: 0\\n\\n /// # Frame Time: 0.0333333\\n\\n /// };\\n\\n /// let mut joints = bvh.joints();\\n\\n /// let base = joints.next().unwrap();\\n\\n /// assert!(base.data().end_site().is_none());\\n\\n ///\\n\\n /// let tip = joints.next().unwrap();\\n\\n /// assert_eq!(tip.data().end_site(), Some([5.4, 3.2, 1.0].into()).as_ref());\\n\\n /// ```\\n\\n #[inline]\\n\\n pub fn end_site(&self) -> Option<&Vector3<f32>> {\\n\\n match *self {\\n\\n JointData::Child {\\n\\n ref end_site_offset,\\n\\n ..\\n\",\n \"file_path\": \"src/joint.rs\",\n \"rank\": 81,\n \"score\": 18.40815824179288\n },\n {\n \"content\": \" name: JointName::from(name),\\n\\n offset,\\n\\n channels,\\n\\n end_site_offset: None,\\n\\n depth,\\n\\n parent_index: if is_root { None } else { Some(0) },\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\nimpl JointsBuilder {\\n\\n /// Push a `Joint`.\\n\\n pub fn push_child(\\n\\n mut self,\\n\\n depth: usize,\\n\\n name: &BStr,\\n\\n offset: Vector3<f32>,\\n\\n channels: &[ChannelType],\\n\\n ) -> Self {\\n\\n let channels = collect_channels(channels, &mut self.num_channels);\\n\",\n \"file_path\": \"src/builder.rs\",\n \"rank\": 82,\n \"score\": 18.15242321499892\n },\n {\n \"content\": \" #[inline]\\n\\n pub fn set_frame_time(&mut self, frame_time_secs: f64) {\\n\\n self.bvh\\n\\n .set_frame_time(fraction_seconds_to_duration(frame_time_secs));\\n\\n }\\n\\n\\n\\n #[inline]\\n\\n pub fn set_num_frames(&mut self, num_frames: usize) {\\n\\n self.num_frames = num_frames;\\n\\n self.bvh.num_channels = self.current_channel_index;\\n\\n self.bvh.num_frames = self.num_frames;\\n\\n self.bvh\\n\\n .motion_values\\n\\n .reserve(self.current_channel_index * self.num_frames);\\n\\n }\\n\\n\\n\\n #[inline]\\n\\n pub fn set_motion_values(&mut self, motion_values: Vec<f32>) {\\n\\n self.bvh.motion_values = motion_values;\\n\\n }\\n\",\n \"file_path\": \"src/macros.rs\",\n \"rank\": 83,\n \"score\": 17.92998377485219\n },\n {\n \"content\": \" return ptr::null_mut();\\n\\n }\\n\\n\\n\\n if self.is_rust_allocator() {\\n\\n Box::into_raw(vec.into_boxed_slice()) as *mut _\\n\\n } else {\\n\\n let allocation = self.alloc_n::<T>(vec.len()) as *mut T;\\n\\n ptr::copy_nonoverlapping(vec.as_ptr(), allocation, vec.len());\\n\\n allocation\\n\\n }\\n\\n }\\n\\n\\n\\n /// Wrapper function to create a `Vec` from a raw pointer and a size.\\n\\n ///\\n\\n /// Takes ownership of the data behind `ptr` - it is a use after free\\n\\n /// error to use `ptr` after this.\\n\\n #[inline]\\n\\n unsafe fn alloc_to_vec<T: Copy>(&self, ptr: *mut T, n: usize) -> Vec<T> {\\n\\n if self.validate().is_err() || ptr.is_null() || n == 0 {\\n\\n return Vec::new();\\n\",\n \"file_path\": \"src/ffi.rs\",\n \"rank\": 84,\n \"score\": 17.620821459713312\n },\n {\n \"content\": \" }\\n\\n}\\n\\n\\n\\n/// A string type for the `Joint` name. A `SmallVec` is used for\\n\\n/// better data locality.\\n\\npub type JointNameInner = SmallVec<[u8; mem::size_of::<String>()]>;\\n\\n\\n\\n/// Wrapper struct for the `Joint` name type.\\n\\n#[derive(Clone, Default, Eq, Hash, Ord)]\\n\\npub struct JointName(pub JointNameInner);\\n\\n\\n\\nimpl Deref for JointName {\\n\\n type Target = JointNameInner;\\n\\n #[inline]\\n\\n fn deref(&self) -> &Self::Target {\\n\\n &self.0\\n\\n }\\n\\n}\\n\\n\\n\\nimpl DerefMut for JointName {\\n\",\n \"file_path\": \"src/joint.rs\",\n \"rank\": 85,\n \"score\": 17.53432196082351\n },\n {\n \"content\": \" ref mut current_joint,\\n\\n ref mut wrote_name,\\n\\n ref mut wrote_offset,\\n\\n ref mut wrote_channels,\\n\\n } => {\\n\\n if let Some(ref joint) = current_joint {\\n\\n let joint_data = joint.data();\\n\\n let mut depth = joint_data.depth();\\n\\n if *wrote_name {\\n\\n depth += 1\\n\\n }\\n\\n\\n\\n match (&mut *wrote_name, &mut *wrote_offset, &mut *wrote_channels) {\\n\\n (&mut false, _, _) => {\\n\\n // @TODO: Contribute `Extend` impl for `BString` to avoid the `Vec`\\n\\n // allocation\\n\\n chunk.extend(self.indent.prefix_chars(depth));\\n\\n if joint_data.is_root() {\\n\\n chunk.extend_from_slice(b\\\"ROOT \\\");\\n\\n } else {\\n\",\n \"file_path\": \"src/write.rs\",\n \"rank\": 86,\n \"score\": 17.513105211765186\n },\n {\n \"content\": \" assert_eq!(channel.channel_type, expected_channels[i]);\\n\\n }\\n\\n\\n\\n assert_eq!(root.joint_offset, Default::default());\\n\\n assert_eq!(root.joint_parent_index, usize::max_value());\\n\\n assert_eq!(root.joint_has_end_site, 0);\\n\\n }\\n\\n\\n\\n unsafe {\\n\\n let end = *bvh_ffi.bvh_joints.offset(1);\\n\\n\\n\\n let expected_name = CStr::from_bytes_with_nul(b\\\"End\\\\0\\\").unwrap();\\n\\n assert_eq!(strcmp(end.joint_name, expected_name.as_ptr()), 0);\\n\\n\\n\\n assert_eq!(end.joint_num_channels, 3);\\n\\n\\n\\n let expected_channels = [\\n\\n bvh_ChannelType::Z_ROTATION,\\n\\n bvh_ChannelType::X_ROTATION,\\n\\n bvh_ChannelType::Y_ROTATION,\\n\",\n \"file_path\": \"src/ffi.rs\",\n \"rank\": 87,\n \"score\": 17.48903300315817\n },\n {\n \"content\": \" WriteOptionsIterState::WriteFrames {\\n\\n ref mut current_frame,\\n\\n ref mut frames,\\n\\n } => match current_frame {\\n\\n None => return false,\\n\\n Some(frame) => {\\n\\n let motion_values = frame\\n\\n .as_slice()\\n\\n .iter()\\n\\n .map(|motion| {\\n\\n format!(\\\"{:.*}\\\", self.motion_values_significant_figures, motion)\\n\\n })\\n\\n .collect::<Vec<_>>()\\n\\n .join(\\\" \\\");\\n\\n *chunk = motion_values.into_bytes();\\n\\n chunk.extend_from_slice(terminator);\\n\\n *current_frame = frames.next();\\n\\n }\\n\\n },\\n\\n }\\n\\n\\n\\n true\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/write.rs\",\n \"rank\": 88,\n \"score\": 17.38023969111278\n },\n {\n \"content\": \" } => end_site_offset.as_ref(),\\n\\n _ => None,\\n\\n }\\n\\n }\\n\\n\\n\\n /// Returns `true` if the `Joint` has an `end_site_offset`, or `false` if it doesn't.\\n\\n #[inline]\\n\\n pub fn has_end_site(&self) -> bool {\\n\\n self.end_site().is_some()\\n\\n }\\n\\n\\n\\n /// Returns the ordered array of `Channel`s of this `JointData`.\\n\\n ///\\n\\n /// # Examples\\n\\n ///\\n\\n /// ```no_run\\n\\n /// # use bvh_anim::{bvh, ChannelType};\\n\\n /// let bvh = bvh! {\\n\\n /// HIERARCHY\\n\\n /// ROOT Hips\\n\",\n \"file_path\": \"src/joint.rs\",\n \"rank\": 89,\n \"score\": 17.3800130949508\n },\n {\n \"content\": \" IndentStyle::Tabs\\n\\n }\\n\\n}\\n\\n\\n\\n/// Represents which line terminator style to use when writing a `Bvh` file.\\n\\n#[derive(Clone, Copy, Debug, Eq, Hash, PartialEq)]\\n\\npub enum LineTerminator {\\n\\n /// Use Unix-style line endings (`'\\\\n'`).\\n\\n Unix,\\n\\n /// Use Windows-style line endings (`'\\\\r\\\\n'`).\\n\\n Windows,\\n\\n}\\n\\n\\n\\nimpl LineTerminator {\\n\\n /// Get the line terminator style native to the current OS:\\n\\n ///\\n\\n /// * On Windows, this returns `LineTerminator::Windows`.\\n\\n /// * Otherwise, this returns `LineTerminator::Unix`.\\n\\n #[cfg(target_os = \\\"windows\\\")]\\n\\n #[inline]\\n\",\n \"file_path\": \"src/write.rs\",\n \"rank\": 90,\n \"score\": 17.361353315009367\n },\n {\n \"content\": \"}\\n\\n\\n\\nimpl ChannelType {\\n\\n /// Attempt to parse a bvh channel byte string into a `ChannelType`.\\n\\n /// Returns `Err` if the string cannot be parsed.\\n\\n ///\\n\\n /// # Examples\\n\\n ///\\n\\n /// ```\\n\\n /// # use bvh_anim::ChannelType;\\n\\n /// assert_eq!(\\n\\n /// ChannelType::from_bytes(\\\"Xrotation\\\").unwrap(),\\n\\n /// ChannelType::RotationX);\\n\\n ///\\n\\n /// let err = ChannelType::from_bytes(\\\"Hello\\\").unwrap_err();\\n\\n /// assert_eq!(err.into_inner(), \\\"Hello\\\");\\n\\n /// ```\\n\\n #[inline]\\n\\n pub fn from_bytes<B>(s: &B) -> Result<Self, ParseChannelError>\\n\\n where\\n\",\n \"file_path\": \"src/lib.rs\",\n \"rank\": 91,\n \"score\": 17.212625520097184\n },\n {\n \"content\": \" JointData::Root {\\n\\n ref mut channels, ..\\n\\n } => {\\n\\n channels.push(channel);\\n\\n }\\n\\n JointData::Child {\\n\\n ref mut channels, ..\\n\\n } => {\\n\\n channels.push(channel);\\n\\n }\\n\\n });\\n\\n self.current_channel_index += 1;\\n\\n }\\n\\n\\n\\n pub fn push_joint_offset(&mut self, offset: mint::Vector3<f32>, is_end_site: bool) {\\n\\n self.last_joint().map(|joint| {\\n\\n joint.set_offset(offset, is_end_site);\\n\\n });\\n\\n }\\n\\n\\n\",\n \"file_path\": \"src/macros.rs\",\n \"rank\": 92,\n \"score\": 17.111757735617395\n },\n {\n \"content\": \" end_site_offset: Default::default(),\\n\\n private: JointPrivateData::empty(),\\n\\n }\\n\\n }\\n\\n\\n\\n #[inline]\\n\\n pub(crate) fn set_name<S: Into<JointName>>(&mut self, new_name: S) {\\n\\n match *self {\\n\\n JointData::Root { ref mut name, .. } => *name = new_name.into(),\\n\\n JointData::Child { ref mut name, .. } => *name = new_name.into(),\\n\\n }\\n\\n }\\n\\n\\n\\n pub(crate) fn set_offset(&mut self, new_offset: Vector3<f32>, is_site: bool) {\\n\\n match *self {\\n\\n JointData::Root { ref mut offset, .. } => *offset = new_offset,\\n\\n JointData::Child {\\n\\n ref mut offset,\\n\\n ref mut end_site_offset,\\n\\n ..\\n\",\n \"file_path\": \"src/joint.rs\",\n \"rank\": 93,\n \"score\": 16.989704234930844\n },\n {\n \"content\": \" let idx = self.current_index;\\n\\n let dpth = self.current_depth;\\n\\n let parent = get_parent_index(&self.bvh.joints[..], dpth);\\n\\n\\n\\n let mut joint = JointData::empty_child();\\n\\n joint.set_name(name);\\n\\n if let Some(ref mut private) = joint.private_data_mut() {\\n\\n private.self_index = idx;\\n\\n private.depth = dpth;\\n\\n private.parent_index = parent;\\n\\n };\\n\\n\\n\\n self.bvh.joints.push(joint);\\n\\n\\n\\n self.current_index += 1;\\n\\n }\\n\\n\\n\\n pub fn push_channel(&mut self, channel: ChannelType) {\\n\\n let channel = Channel::new(channel, self.current_channel_index);\\n\\n self.last_joint().map(|joint| match *joint {\\n\",\n \"file_path\": \"src/macros.rs\",\n \"rank\": 94,\n \"score\": 16.78928388114753\n },\n {\n \"content\": \" };\\n\\n\\n\\n {\\n\\n use super::{ChannelType, JointData};\\n\\n use mint::Vector3;\\n\\n\\n\\n fn check_joint<V0: Into<Vector3<f32>>, V1: Into<Vector3<f32>>, O: Into<Option<V1>>>(\\n\\n joint: &JointData,\\n\\n expected_name: &str,\\n\\n expected_offset: V0,\\n\\n channels: &[ChannelType],\\n\\n end_site: O,\\n\\n ) {\\n\\n assert_eq!(joint.name(), expected_name);\\n\\n assert_eq!(*joint.offset(), expected_offset.into());\\n\\n for (chan, expected_chan) in joint\\n\\n .channels()\\n\\n .iter()\\n\\n .map(|c| c.channel_type())\\n\\n .zip(channels.iter())\\n\",\n \"file_path\": \"src/macros.rs\",\n \"rank\": 95,\n \"score\": 16.66796128273741\n },\n {\n \"content\": \"\\n\\nimpl From<&'_ CStr> for JointName {\\n\\n #[inline]\\n\\n fn from(s: &'_ CStr) -> Self {\\n\\n From::from(s.to_bytes())\\n\\n }\\n\\n}\\n\\n\\n\\nimpl From<Vec<u8>> for JointName {\\n\\n #[inline]\\n\\n fn from(s: Vec<u8>) -> Self {\\n\\n JointName(s.into_iter().collect())\\n\\n }\\n\\n}\\n\\n\\n\\nimpl From<&'_ [u8]> for JointName {\\n\\n #[inline]\\n\\n fn from(s: &'_ [u8]) -> Self {\\n\\n From::from(s.to_vec())\\n\\n }\\n\",\n \"file_path\": \"src/joint.rs\",\n \"rank\": 96,\n \"score\": 16.453161918796486\n },\n {\n \"content\": \"use foreign_types::ForeignType;\\n\\nuse libc::{c_char, c_double, c_float, c_int, c_void, size_t, strlen, uint32_t, uint8_t, FILE};\\n\\nuse mint::Vector3;\\n\\nuse pkg_version::{pkg_version_major, pkg_version_minor, pkg_version_patch};\\n\\nuse std::{\\n\\n alloc::{self, Layout},\\n\\n convert::TryFrom,\\n\\n error::Error,\\n\\n ffi::{CStr, CString},\\n\\n fmt,\\n\\n io::BufReader,\\n\\n mem,\\n\\n ptr::{self, NonNull},\\n\\n slice,\\n\\n};\\n\\n\\n\\n/// Type alias for a function used to allocate memory.\\n\\n///\\n\\n/// May return `NULL` to signify allocation failures.\\n\\npub type bvh_AllocFunction =\\n\",\n \"file_path\": \"src/ffi.rs\",\n \"rank\": 97,\n \"score\": 16.38318362557323\n },\n {\n \"content\": \" fn from(j: JointName) -> Self {\\n\\n j.0\\n\\n }\\n\\n}\\n\\n\\n\\nimpl fmt::Debug for JointName {\\n\\n #[inline]\\n\\n fn fmt(&self, fmtr: &mut fmt::Formatter<'_>) -> fmt::Result {\\n\\n fmt::Debug::fmt(AsRef::<BStr>::as_ref(self), fmtr)\\n\\n }\\n\\n}\\n\\n\\n\\nimpl fmt::Display for JointName {\\n\\n #[inline]\\n\\n fn fmt(&self, fmtr: &mut fmt::Formatter<'_>) -> fmt::Result {\\n\\n fmt::Display::fmt(AsRef::<BStr>::as_ref(self), fmtr)\\n\\n }\\n\\n}\\n\\n\\n\\n/// Data private to joints.\\n\",\n \"file_path\": \"src/joint.rs\",\n \"rank\": 98,\n \"score\": 16.33335806764695\n },\n {\n \"content\": \" current_joint: 0,\\n\\n from_child: None,\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\nimpl<'a> Iterator for JointsMut<'a> {\\n\\n type Item = JointMut<'a>;\\n\\n #[inline]\\n\\n fn next(&mut self) -> Option<Self::Item> {\\n\\n None\\n\\n }\\n\\n}\\n\\n\\n\\nimpl fmt::Debug for JointsMut<'_> {\\n\\n #[inline]\\n\\n fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {\\n\\n f.write_str(\\\"JointsMut { .. }\\\")\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/joint.rs\",\n \"rank\": 99,\n \"score\": 16.301173651655184\n }\n]","isConversational":false}}},{"rowIdx":2377,"cells":{"lang":{"kind":"string","value":"Rust"},"file_path":{"kind":"string","value":"library/src/canvas.rs"},"repo_name":{"kind":"string","value":"feenkcom/libskia"},"commit":{"kind":"string","value":"2a9e95a65acb944fae8167abb93c91443ce71a95"},"file_code":{"kind":"string","value":"use boxer::array::BoxerArray;\nuse boxer::boxes::{ReferenceBox, ReferenceBoxPointer};\nuse boxer::{assert_reference_box, function};\nuse boxer::{ValueBox, ValueBoxPointer};\nuse float_cmp::ApproxEqUlps;\nuse layer::SaveLayerRecWrapper;\nuse skia_safe::canvas::{PointMode, SaveLayerRec};\nuse skia_safe::utils::shadow_utils::ShadowFlags;\nuse skia_safe::{\n scalar, BlendMode, Canvas, Color, Image, Matrix, Paint, Path, Point, Point3, RRect, Rect,\n TextBlob, Vector, M44,\n};\n\n#[no_mangle]\npub fn skia_canvas_clear(canvas_ptr: *mut ReferenceBox<Canvas>, r: u8, g: u8, b: u8, a: u8) {\n assert_reference_box(canvas_ptr, function!());\n canvas_ptr.with_not_null(|canvas| {\n canvas.clear(Color::from_argb(a, r, g, b));\n });\n}\n\n#[no_mangle]\npub fn skia_canvas_draw_color(\n canvas_ptr: *mut ReferenceBox<Canvas>,\n r: u8,\n g: u8,\n b: u8,\n a: u8,\n blend_mode: BlendMode,\n) {\n assert_reference_box(canvas_ptr, function!());\n canvas_ptr.with_not_null(|canvas| {\n canvas.draw_color(Color::from_argb(a, r, g, b), blend_mode);\n });\n}\n\n#[no_mangle]\npub fn skia_canvas_draw_paint(\n canvas_ptr: *mut ReferenceBox<Canvas>,\n paint_ptr: *mut ValueBox<Paint>,\n) {\n assert_reference_box(canvas_ptr, function!());\n canvas_ptr.with_not_null(|canvas| {\n paint_ptr.with_not_null(|paint| {\n canvas.draw_paint(paint);\n });\n });\n}\n\n#[no_mangle]\npub fn skia_canvas_draw_points(\n canvas_ptr: *mut ReferenceBox<Canvas>,\n point_mode: PointMode,\n points_ptr: *mut ValueBox<BoxerArray<Point>>,\n paint_ptr: *mut ValueBox<Paint>,\n) {\n assert_reference_box(canvas_ptr, function!());\n canvas_ptr.with_not_null(|canvas| {\n paint_ptr.with_not_null(|paint| {\n points_ptr.with_not_null(|points| {\n canvas.draw_points(point_mode, points.to_slice(), paint);\n })\n });\n });\n}\n\n#[no_mangle]\npub fn skia_canvas_draw_point(\n canvas_ptr: *mut ReferenceBox<Canvas>,\n x: scalar,\n y: scalar,\n paint_ptr: *mut ValueBox<Paint>,\n) {\n assert_reference_box(canvas_ptr, function!());\n canvas_ptr.with_not_null(|canvas| {\n paint_ptr.with_not_null(|paint| {\n canvas.draw_point(Point::new(x, y), paint);\n });\n });\n}\n\n#[no_mangle]\npub fn skia_canvas_draw_line(\n canvas_ptr: *mut ReferenceBox<Canvas>,\n from_x: scalar,\n from_y: scalar,\n to_x: scalar,\n to_y: scalar,\n paint_ptr: *mut ValueBox<Paint>,\n) {\n assert_reference_box(canvas_ptr, function!());\n canvas_ptr.with_not_null(|canvas| {\n paint_ptr.with_not_null(|paint| {\n canvas.draw_line(Point::new(from_x, from_y), Point::new(to_x, to_y), paint);\n });\n });\n}\n\n#[no_mangle]\npub fn skia_canvas_draw_rectangle(\n canvas_ptr: *mut ReferenceBox<Canvas>,\n left: scalar,\n top: scalar,\n right: scalar,\n bottom: scalar,\n paint_ptr: *mut ValueBox<Paint>,\n) {\n assert_reference_box(canvas_ptr, function!());\n canvas_ptr.with_not_null(|canvas| {\n paint_ptr.with_not_null(|paint| {\n canvas.draw_rect(Rect::new(left, top, right, bottom), paint);\n });\n });\n}\n\n#[no_mangle]\npub fn skia_canvas_draw_oval(\n canvas_ptr: *mut ReferenceBox<Canvas>,\n left: scalar,\n top: scalar,\n right: scalar,\n bottom: scalar,\n paint_ptr: *mut ValueBox<Paint>,\n) {\n assert_reference_box(canvas_ptr, function!());\n canvas_ptr.with_not_null(|canvas| {\n paint_ptr.with_not_null(|paint| {\n canvas.draw_oval(Rect::new(left, top, right, bottom), paint);\n });\n });\n}\n\n#[no_mangle]\npub fn skia_canvas_draw_circle(\n canvas_ptr: *mut ReferenceBox<Canvas>,\n center_x: scalar,\n center_y: scalar,\n radius: scalar,\n paint_ptr: *mut ValueBox<Paint>,\n) {\n assert_reference_box(canvas_ptr, function!());\n canvas_ptr.with_not_null(|canvas| {\n paint_ptr.with_not_null(|paint| {\n canvas.draw_circle(Point::new(center_x, center_y), radius, paint);\n });\n });\n}\n\n#[no_mangle]\npub fn skia_canvas_draw_rrect(\n canvas_ptr: *mut ReferenceBox<Canvas>,\n rrect_ptr: *mut ValueBox<RRect>,\n paint_ptr: *mut ValueBox<Paint>,\n) {\n assert_reference_box(canvas_ptr, function!());\n canvas_ptr.with_not_null(|canvas| {\n rrect_ptr.with_not_null(|rrect| {\n paint_ptr.with_not_null(|paint| {\n canvas.draw_rrect(rrect, paint);\n });\n });\n });\n}\n\n#[no_mangle]\npub fn skia_canvas_draw_rounded_rectangle(\n canvas_ptr: *mut ReferenceBox<Canvas>,\n left: scalar,\n top: scalar,\n right: scalar,\n bottom: scalar,\n r_top_left: scalar,\n r_top_right: scalar,\n r_bottom_right: scalar,\n r_bottom_left: scalar,\n paint_ptr: *mut ValueBox<Paint>,\n) {\n assert_reference_box(canvas_ptr, function!());\n canvas_ptr.with_not_null(|canvas| {\n paint_ptr.with_not_null(|paint| {\n \n if r_top_left.approx_eq_ulps(&r_top_right, 2)\n && r_top_right.approx_eq_ulps(&r_bottom_right, 2)\n && r_bottom_right.approx_eq_ulps(&r_bottom_left, 2)\n && r_bottom_left.approx_eq_ulps(&r_top_left, 2)\n {\n canvas.draw_round_rect(\n Rect::new(left, top, right, bottom),\n r_top_right,\n r_top_right,\n paint,\n );\n } else {\n canvas.draw_rrect(\n RRect::new_rect_radii(\n Rect::new(left, top, right, bottom),\n &[\n Vector::new(r_top_left, r_top_left),\n Vector::new(r_top_right, r_top_right),\n Vector::new(r_bottom_right, r_bottom_right),\n Vector::new(r_bottom_left, r_bottom_left),\n ],\n ),\n paint,\n );\n };\n });\n });\n}\n\n#[no_mangle]\npub fn skia_canvas_draw_path(\n canvas_ptr: *mut ReferenceBox<Canvas>,\n path_ptr: *mut ValueBox<Path>,\n paint_ptr: *mut ValueBox<Paint>,\n) {\n assert_reference_box(canvas_ptr, function!());\n canvas_ptr.with_not_null(|canvas| {\n paint_ptr.with_not_null(|paint| {\n path_ptr.with_not_null(|path| {\n canvas.draw_path(path, paint);\n })\n });\n });\n}\n\n#[no_mangle]\npub fn skia_canvas_draw_text_blob(\n canvas_ptr: *mut ReferenceBox<Canvas>,\n text_blob_ptr: *mut ValueBox<TextBlob>,\n x: scalar,\n y: scalar,\n paint_ptr: *mut ValueBox<Paint>,\n) {\n assert_reference_box(canvas_ptr, function!());\n canvas_ptr.with_not_null(|canvas| {\n paint_ptr.with_not_null(|paint| {\n \n text_blob_ptr.with_not_null(|text_blob| {\n canvas.draw_text_blob(text_blob, Point::new(x, y), paint);\n })\n });\n });\n}\n\n#[no_mangle]\npub fn skia_canvas_draw_shadow(\n canvas_ptr: *mut ReferenceBox<Canvas>,\n path_ptr: *mut ValueBox<Path>,\n z_plane_ptr: *mut ValueBox<Point3>,\n light_pos_ptr: *mut ValueBox<Point3>,\n light_radius: scalar,\n ambient_color_ptr: *mut ValueBox<Color>,\n spot_color_ptr: *mut ValueBox<Color>,\n _bit_flags: u32,\n) {\n assert_reference_box(canvas_ptr, function!());\n canvas_ptr.with_not_null(|canvas| {\n path_ptr.with_not_null(|path| {\n z_plane_ptr.with_not_null_value(|z_plane| {\n light_pos_ptr.with_not_null_value(|light_pos| {\n ambient_color_ptr.with_not_null_value(|ambient_color| {\n spot_color_ptr.with_not_null_value(|spot_color| {\n canvas.draw_shadow(\n path,\n z_plane,\n light_pos,\n light_radius,\n ambient_color,\n spot_color,\n ShadowFlags::ALL, /*from_bits_truncate(bit_flags)*/\n );\n })\n })\n })\n })\n })\n })\n}\n\n#[no_mangle]\npub fn skia_canvas_draw_image(\n canvas_ptr: *mut ReferenceBox<Canvas>,\n image_ptr: *mut ValueBox<Image>, \n x: scalar,\n y: scalar,\n paint_ptr: *mut ValueBox<Paint>,\n) {\n assert_reference_box(canvas_ptr, function!());\n canvas_ptr.with_not_null(|canvas| {\n image_ptr.with_not_null(|image| {\n if paint_ptr.is_valid() {\n paint_ptr.with_not_null(|paint| {\n canvas.draw_image(image, Point::new(x, y), Some(paint));\n })\n } else {\n canvas.draw_image(image, Point::new(x, y), None);\n }\n });\n });\n}\n\n#[no_mangle]\npub fn skia_canvas_translate(canvas_ptr: *mut ReferenceBox<Canvas>, x: scalar, y: scalar) {\n assert_reference_box(canvas_ptr, function!());\n canvas_ptr.with_not_null(|canvas| {\n canvas.translate(Vector::new(x, y));\n });\n}\n\n#[no_mangle]\npub fn skia_canvas_scale(canvas_ptr: *mut ReferenceBox<Canvas>, sx: scalar, sy: scalar) {\n assert_reference_box(canvas_ptr, function!());\n canvas_ptr.with_not_null(|canvas| {\n canvas.scale((sx, sy));\n });\n}\n\n#[no_mangle]\npub fn skia_canvas_rotate(\n canvas_ptr: *mut ReferenceBox<Canvas>,\n degrees: scalar,\n x: scalar,\n y: scalar,\n) {\n assert_reference_box(canvas_ptr, function!());\n canvas_ptr.with_not_null(|canvas| {\n canvas.rotate(degrees, Some(Point::new(x, y)));\n });\n}\n\n#[no_mangle]\npub fn skia_canvas_skew(canvas_ptr: *mut ReferenceBox<Canvas>, sx: scalar, sy: scalar) {\n assert_reference_box(canvas_ptr, function!());\n canvas_ptr.with_not_null(|canvas| {\n canvas.skew((sx, sy));\n });\n}\n\n#[no_mangle]\npub fn skia_canvas_concat_matrix(\n canvas_ptr: *mut ReferenceBox<Canvas>,\n matrix_ptr: *mut ValueBox<Matrix>,\n) {\n assert_reference_box(canvas_ptr, function!());\n canvas_ptr.with_not_null(|canvas| {\n matrix_ptr.with_not_null(|matrix| {\n canvas.concat(matrix);\n })\n });\n}\n\n#[no_mangle]\npub fn skia_canvas_set_matrix(\n canvas_ptr: *mut ReferenceBox<Canvas>,\n matrix_ptr: *mut ValueBox<Matrix>,\n) {\n assert_reference_box(canvas_ptr, function!());\n canvas_ptr.with_not_null(|canvas| {\n matrix_ptr.with_not_null(|matrix| {\n canvas.set_matrix(&M44::from(matrix as &Matrix));\n })\n });\n}\n\n#[no_mangle]\npub fn skia_canvas_get_matrix(\n canvas_ptr: *mut ReferenceBox<Canvas>,\n matrix_ptr: *mut ValueBox<Matrix>,\n) {\n assert_reference_box(canvas_ptr, function!());\n canvas_ptr.with_not_null(|canvas| {\n matrix_ptr.with_not_null(|matrix| {\n let m = canvas.local_to_device_as_3x3();\n let mut buffer: [scalar; 9] = [0.0; 9];\n m.get_9(&mut buffer);\n matrix.set_9(&buffer);\n })\n });\n}\n\n#[no_mangle]\npub fn skia_canvas_reset_matrix(canvas_ptr: *mut ReferenceBox<Canvas>) {\n assert_reference_box(canvas_ptr, function!());\n canvas_ptr.with_not_null(|canvas| {\n canvas.reset_matrix();\n })\n}\n\n#[no_mangle]\n#[deprecated(since = \"0.38.0\", note = \"Replace usage with DirectContext::flush()\")]\npub fn skia_canvas_flush(_canvas_ptr: *mut ReferenceBox<Canvas>) {}\n\n#[no_mangle]\npub fn skia_canvas_save(canvas_ptr: *mut ReferenceBox<Canvas>) -> usize {\n assert_reference_box(canvas_ptr, function!());\n canvas_ptr.with_not_null_return(0, |canvas| canvas.save())\n}\n\n#[no_mangle]\npub fn skia_canvas_save_count(canvas_ptr: *mut ReferenceBox<Canvas>) -> usize {\n assert_reference_box(canvas_ptr, function!());\n canvas_ptr.with_not_null_return(0, |canvas| canvas.save_count())\n}\n\n#[no_mangle]\npub fn skia_canvas_restore(canvas_ptr: *mut ReferenceBox<Canvas>) {\n assert_reference_box(canvas_ptr, function!());\n canvas_ptr.with_not_null(|canvas| {\n canvas.restore();\n })\n}\n\n#[no_mangle]\npub fn skia_canvas_restore_to_count(canvas_ptr: *mut ReferenceBox<Canvas>, count: usize) {\n assert_reference_box(canvas_ptr, function!());\n canvas_ptr.with_not_null(|canvas| {\n canvas.restore_to_count(count);\n })\n}\n\n#[no_mangle]\npub fn skia_canvas_save_layer(\n canvas_ptr: *mut ReferenceBox<Canvas>,\n _save_layer_ptr: *mut ValueBox<SaveLayerRecWrapper>,\n) -> usize {\n assert_reference_box(canvas_ptr, function!());\n canvas_ptr.with_not_null_return(0, |canvas| {\n _save_layer_ptr.with_not_null_return(0, |save_rec| {\n let mut rec: SaveLayerRec = SaveLayerRec::default();\n if save_rec.bounds.is_some() {\n rec = rec.bounds(save_rec.bounds.as_ref().unwrap())\n };\n if save_rec.paint.is_some() {\n rec = rec.paint(save_rec.paint.as_ref().unwrap())\n };\n canvas.save_layer(&rec)\n })\n })\n}\n\n#[no_mangle]\npub fn skia_canvas_drop(_ptr: &mut *mut ReferenceBox<Canvas>) {\n (*_ptr).drop();\n *_ptr = std::ptr::null_mut();\n}\n"},"prefix":{"kind":"string","value":"use boxer::array::BoxerArray;\nuse boxer::boxes::{ReferenceBox, ReferenceBoxPointer};\nuse boxer::{assert_reference_box, function};\nuse boxer::{ValueBox, ValueBoxPointer};\nuse float_cmp::ApproxEqUlps;\nuse layer::SaveLayerRecWrapper;\nuse skia_safe::canvas::{PointMode, SaveLayerRec};\nuse skia_safe::utils::shadow_utils::ShadowFlags;\nuse skia_safe::{\n scalar, BlendMode, Canvas, Color, Image, Matrix, Paint, Path, Point, Point3, RRect, Rect,\n TextBlob, Vector, M44,\n};\n\n#[no_mangle]\npub fn skia_canvas_clear(canvas_ptr: *mut ReferenceBox<Canvas>, r: u8, g: u8, b: u8, a: u8) {\n assert_reference_box(canvas_ptr, function!());\n canvas_ptr.with_not_null(|canvas| {\n canvas.clear(Color::from_argb(a, r, g, b));\n });\n}\n\n#[no_mangle]\npub fn skia_canvas_draw_color(\n canvas_ptr: *mut ReferenceBox<Canvas>,\n r: u8,\n g: u8,\n b: u8,\n a: u8,\n blend_mode: BlendMode,\n) {\n assert_reference_box(canvas_ptr, function!());\n canvas_ptr.with_not_null(|canvas| {\n canvas.draw_color(Color::from_argb(a, r, g, b), blend_mode);\n });\n}\n\n#[no_mangle]\npub fn skia_canvas_draw_paint(\n canvas_ptr: *mut ReferenceBox<Canvas>,\n paint_ptr: *mut ValueBox<Paint>,\n) {\n assert_reference_box(canvas_ptr, function!());\n canvas_ptr.with_not_null(|canvas| {\n paint_ptr.with_not_null(|paint| {\n canvas.draw_paint(paint);\n });\n });\n}\n\n#[no_mangle]\npub fn skia_canvas_draw_points(\n canvas_ptr: *mut ReferenceBox<Canvas>,\n point_mode: PointMode,\n points_ptr: *mut ValueBox<BoxerArray<Point>>,\n paint_ptr: *mut ValueBox<Paint>,\n) {\n assert_reference_box(canvas_ptr, function!());\n canvas_ptr.with_not_null(|canvas| {\n paint_ptr.with_not_null(|paint| {\n points_ptr.with_not_null(|points| {\n canvas.draw_points(point_mode, points.to_slice(), paint);\n })\n });\n });\n}\n\n#[no_mangle]\npub fn skia_canvas_draw_point(\n canvas_ptr: *mut ReferenceBox<Canvas>,\n x: scalar,\n y: scalar,\n paint_ptr: *mut ValueBox<Paint>,\n) {\n assert_reference_box(canvas_ptr, function!());\n canvas_ptr.with_not_null(|canvas| {\n paint_ptr.with_not_null(|paint| {\n canvas.draw_point(Point::new(x, y), paint);\n });\n });\n}\n\n#[no_mangle]\npub fn skia_canvas_draw_line(\n canvas_ptr: *mut ReferenceBox<Canvas>,\n from_x: scalar,\n from_y: scalar,\n to_x: scalar,\n to_y: scalar,\n paint_ptr: *mut ValueBox<Paint>,\n) {\n assert_reference_box(canvas_ptr, function!());\n canvas_ptr.with_not_null(|canvas| {\n paint_ptr.with_not_null(|paint| {\n canvas.draw_line(Point::new(from_x, from_y), Point::new(to_x, to_y), paint);\n });\n });\n}\n\n#[no_mangle]\npub fn skia_canvas_draw_rectangle(\n canvas_ptr: *mut ReferenceBox<Canvas>,\n left: scalar,\n top: scalar,\n right: scalar,\n bottom: scalar,\n paint_ptr: *mut ValueBox<Paint>,\n) {\n assert_reference_box(canvas_ptr, function!());\n canvas_ptr.with_not_null(|canvas| {\n paint_ptr.with_not_null(|paint| {\n canvas.draw_rect(Rect::new(left, top, right, bottom), paint);\n });\n });\n}\n\n#[no_mangle]\npub fn skia_canvas_draw_oval(\n canvas_ptr: *mut ReferenceBox<Canvas>,\n left: scalar,\n top: scalar,\n right: scalar,\n bottom: scalar,\n paint_ptr: *mut ValueBox<Paint>,\n) {\n assert_reference_box(canvas_ptr, function!());\n canvas_ptr.with_not_null(|canvas| {\n paint_ptr.with_not_null(|paint| {\n canvas.draw_oval(Rect::new(left, top, right, bottom), paint);\n });\n });\n}\n\n#[no_mangle]\npub fn skia_canvas_draw_circle(\n canvas_ptr: *mut ReferenceBox<Canvas>,\n center_x: scalar,\n center_y: scalar,\n radius: scalar,\n paint_ptr: *mut ValueBox<Paint>,\n) {\n assert_reference_box(can"},"suffix":{"kind":"string","value":"\n\n#[no_mangle]\npub fn skia_canvas_draw_rrect(\n canvas_ptr: *mut ReferenceBox<Canvas>,\n rrect_ptr: *mut ValueBox<RRect>,\n paint_ptr: *mut ValueBox<Paint>,\n) {\n assert_reference_box(canvas_ptr, function!());\n canvas_ptr.with_not_null(|canvas| {\n rrect_ptr.with_not_null(|rrect| {\n paint_ptr.with_not_null(|paint| {\n canvas.draw_rrect(rrect, paint);\n });\n });\n });\n}\n\n#[no_mangle]\npub fn skia_canvas_draw_rounded_rectangle(\n canvas_ptr: *mut ReferenceBox<Canvas>,\n left: scalar,\n top: scalar,\n right: scalar,\n bottom: scalar,\n r_top_left: scalar,\n r_top_right: scalar,\n r_bottom_right: scalar,\n r_bottom_left: scalar,\n paint_ptr: *mut ValueBox<Paint>,\n) {\n assert_reference_box(canvas_ptr, function!());\n canvas_ptr.with_not_null(|canvas| {\n paint_ptr.with_not_null(|paint| {\n \n if r_top_left.approx_eq_ulps(&r_top_right, 2)\n && r_top_right.approx_eq_ulps(&r_bottom_right, 2)\n && r_bottom_right.approx_eq_ulps(&r_bottom_left, 2)\n && r_bottom_left.approx_eq_ulps(&r_top_left, 2)\n {\n canvas.draw_round_rect(\n Rect::new(left, top, right, bottom),\n r_top_right,\n r_top_right,\n paint,\n );\n } else {\n canvas.draw_rrect(\n RRect::new_rect_radii(\n Rect::new(left, top, right, bottom),\n &[\n Vector::new(r_top_left, r_top_left),\n Vector::new(r_top_right, r_top_right),\n Vector::new(r_bottom_right, r_bottom_right),\n Vector::new(r_bottom_left, r_bottom_left),\n ],\n ),\n paint,\n );\n };\n });\n });\n}\n\n#[no_mangle]\npub fn skia_canvas_draw_path(\n canvas_ptr: *mut ReferenceBox<Canvas>,\n path_ptr: *mut ValueBox<Path>,\n paint_ptr: *mut ValueBox<Paint>,\n) {\n assert_reference_box(canvas_ptr, function!());\n canvas_ptr.with_not_null(|canvas| {\n paint_ptr.with_not_null(|paint| {\n path_ptr.with_not_null(|path| {\n canvas.draw_path(path, paint);\n })\n });\n });\n}\n\n#[no_mangle]\npub fn skia_canvas_draw_text_blob(\n canvas_ptr: *mut ReferenceBox<Canvas>,\n text_blob_ptr: *mut ValueBox<TextBlob>,\n x: scalar,\n y: scalar,\n paint_ptr: *mut ValueBox<Paint>,\n) {\n assert_reference_box(canvas_ptr, function!());\n canvas_ptr.with_not_null(|canvas| {\n paint_ptr.with_not_null(|paint| {\n \n text_blob_ptr.with_not_null(|text_blob| {\n canvas.draw_text_blob(text_blob, Point::new(x, y), paint);\n })\n });\n });\n}\n\n#[no_mangle]\npub fn skia_canvas_draw_shadow(\n canvas_ptr: *mut ReferenceBox<Canvas>,\n path_ptr: *mut ValueBox<Path>,\n z_plane_ptr: *mut ValueBox<Point3>,\n light_pos_ptr: *mut ValueBox<Point3>,\n light_radius: scalar,\n ambient_color_ptr: *mut ValueBox<Color>,\n spot_color_ptr: *mut ValueBox<Color>,\n _bit_flags: u32,\n) {\n assert_reference_box(canvas_ptr, function!());\n canvas_ptr.with_not_null(|canvas| {\n path_ptr.with_not_null(|path| {\n z_plane_ptr.with_not_null_value(|z_plane| {\n light_pos_ptr.with_not_null_value(|light_pos| {\n ambient_color_ptr.with_not_null_value(|ambient_color| {\n spot_color_ptr.with_not_null_value(|spot_color| {\n canvas.draw_shadow(\n path,\n z_plane,\n light_pos,\n light_radius,\n ambient_color,\n spot_color,\n ShadowFlags::ALL, /*from_bits_truncate(bit_flags)*/\n );\n })\n })\n })\n })\n })\n })\n}\n\n#[no_mangle]\npub fn skia_canvas_draw_image(\n canvas_ptr: *mut ReferenceBox<Canvas>,\n image_ptr: *mut ValueBox<Image>, \n x: scalar,\n y: scalar,\n paint_ptr: *mut ValueBox<Paint>,\n) {\n assert_reference_box(canvas_ptr, function!());\n canvas_ptr.with_not_null(|canvas| {\n image_ptr.with_not_null(|image| {\n if paint_ptr.is_valid() {\n paint_ptr.with_not_null(|paint| {\n canvas.draw_image(image, Point::new(x, y), Some(paint));\n })\n } else {\n canvas.draw_image(image, Point::new(x, y), None);\n }\n });\n });\n}\n\n#[no_mangle]\npub fn skia_canvas_translate(canvas_ptr: *mut ReferenceBox<Canvas>, x: scalar, y: scalar) {\n assert_reference_box(canvas_ptr, function!());\n canvas_ptr.with_not_null(|canvas| {\n canvas.translate(Vector::new(x, y));\n });\n}\n\n#[no_mangle]\npub fn skia_canvas_scale(canvas_ptr: *mut ReferenceBox<Canvas>, sx: scalar, sy: scalar) {\n assert_reference_box(canvas_ptr, function!());\n canvas_ptr.with_not_null(|canvas| {\n canvas.scale((sx, sy));\n });\n}\n\n#[no_mangle]\npub fn skia_canvas_rotate(\n canvas_ptr: *mut ReferenceBox<Canvas>,\n degrees: scalar,\n x: scalar,\n y: scalar,\n) {\n assert_reference_box(canvas_ptr, function!());\n canvas_ptr.with_not_null(|canvas| {\n canvas.rotate(degrees, Some(Point::new(x, y)));\n });\n}\n\n#[no_mangle]\npub fn skia_canvas_skew(canvas_ptr: *mut ReferenceBox<Canvas>, sx: scalar, sy: scalar) {\n assert_reference_box(canvas_ptr, function!());\n canvas_ptr.with_not_null(|canvas| {\n canvas.skew((sx, sy));\n });\n}\n\n#[no_mangle]\npub fn skia_canvas_concat_matrix(\n canvas_ptr: *mut ReferenceBox<Canvas>,\n matrix_ptr: *mut ValueBox<Matrix>,\n) {\n assert_reference_box(canvas_ptr, function!());\n canvas_ptr.with_not_null(|canvas| {\n matrix_ptr.with_not_null(|matrix| {\n canvas.concat(matrix);\n })\n });\n}\n\n#[no_mangle]\npub fn skia_canvas_set_matrix(\n canvas_ptr: *mut ReferenceBox<Canvas>,\n matrix_ptr: *mut ValueBox<Matrix>,\n) {\n assert_reference_box(canvas_ptr, function!());\n canvas_ptr.with_not_null(|canvas| {\n matrix_ptr.with_not_null(|matrix| {\n canvas.set_matrix(&M44::from(matrix as &Matrix));\n })\n });\n}\n\n#[no_mangle]\npub fn skia_canvas_get_matrix(\n canvas_ptr: *mut ReferenceBox<Canvas>,\n matrix_ptr: *mut ValueBox<Matrix>,\n) {\n assert_reference_box(canvas_ptr, function!());\n canvas_ptr.with_not_null(|canvas| {\n matrix_ptr.with_not_null(|matrix| {\n let m = canvas.local_to_device_as_3x3();\n let mut buffer: [scalar; 9] = [0.0; 9];\n m.get_9(&mut buffer);\n matrix.set_9(&buffer);\n })\n });\n}\n\n#[no_mangle]\npub fn skia_canvas_reset_matrix(canvas_ptr: *mut ReferenceBox<Canvas>) {\n assert_reference_box(canvas_ptr, function!());\n canvas_ptr.with_not_null(|canvas| {\n canvas.reset_matrix();\n })\n}\n\n#[no_mangle]\n#[deprecated(since = \"0.38.0\", note = \"Replace usage with DirectContext::flush()\")]\npub fn skia_canvas_flush(_canvas_ptr: *mut ReferenceBox<Canvas>) {}\n\n#[no_mangle]\npub fn skia_canvas_save(canvas_ptr: *mut ReferenceBox<Canvas>) -> usize {\n assert_reference_box(canvas_ptr, function!());\n canvas_ptr.with_not_null_return(0, |canvas| canvas.save())\n}\n\n#[no_mangle]\npub fn skia_canvas_save_count(canvas_ptr: *mut ReferenceBox<Canvas>) -> usize {\n assert_reference_box(canvas_ptr, function!());\n canvas_ptr.with_not_null_return(0, |canvas| canvas.save_count())\n}\n\n#[no_mangle]\npub fn skia_canvas_restore(canvas_ptr: *mut ReferenceBox<Canvas>) {\n assert_reference_box(canvas_ptr, function!());\n canvas_ptr.with_not_null(|canvas| {\n canvas.restore();\n })\n}\n\n#[no_mangle]\npub fn skia_canvas_restore_to_count(canvas_ptr: *mut ReferenceBox<Canvas>, count: usize) {\n assert_reference_box(canvas_ptr, function!());\n canvas_ptr.with_not_null(|canvas| {\n canvas.restore_to_count(count);\n })\n}\n\n#[no_mangle]\npub fn skia_canvas_save_layer(\n canvas_ptr: *mut ReferenceBox<Canvas>,\n _save_layer_ptr: *mut ValueBox<SaveLayerRecWrapper>,\n) -> usize {\n assert_reference_box(canvas_ptr, function!());\n canvas_ptr.with_not_null_return(0, |canvas| {\n _save_layer_ptr.with_not_null_return(0, |save_rec| {\n let mut rec: SaveLayerRec = SaveLayerRec::default();\n if save_rec.bounds.is_some() {\n rec = rec.bounds(save_rec.bounds.as_ref().unwrap())\n };\n if save_rec.paint.is_some() {\n rec = rec.paint(save_rec.paint.as_ref().unwrap())\n };\n canvas.save_layer(&rec)\n })\n })\n}\n\n#[no_mangle]\npub fn skia_canvas_drop(_ptr: &mut *mut ReferenceBox<Canvas>) {\n (*_ptr).drop();\n *_ptr = std::ptr::null_mut();\n}\n"},"middle":{"kind":"string","value":"vas_ptr, function!());\n canvas_ptr.with_not_null(|canvas| {\n paint_ptr.with_not_null(|paint| {\n canvas.draw_circle(Point::new(center_x, center_y), radius, paint);\n });\n });\n}"},"strategy":{"kind":"string","value":"function_block-function_prefixed"},"context_items":{"kind":"list like","value":[{"content":"#[no_mangle]\n\npub fn skia_paint_set_rgba(paint_ptr: *mut ValueBox<Paint>, r: u8, g: u8, b: u8, a: u8) {\n\n paint_ptr.with_not_null(|paint| {\n\n paint.set_argb(a, r, g, b);\n\n });\n\n}\n\n\n","file_path":"library/src/paint.rs","rank":0,"score":443120.23559253},{"content":"#[no_mangle]\n\npub fn skia_color_create(r: u8, g: u8, b: u8, a: u8) -> *mut ValueBox<Color> {\n\n ValueBox::new(Color::from_argb(a, r, g, b)).into_raw()\n\n}\n\n\n","file_path":"library/src/color.rs","rank":1,"score":421184.06677549356},{"content":"#[no_mangle]\n\npub fn skia_paint_get_color(paint_ptr: *mut ValueBox<Paint>) -> *mut ValueBox<Color> {\n\n paint_ptr.with_not_null_return(std::ptr::null_mut(), |paint| {\n\n ValueBox::new(paint.color()).into_raw()\n\n })\n\n}\n\n\n","file_path":"library/src/paint.rs","rank":3,"score":363803.4640020316},{"content":"#[no_mangle]\n\npub fn skia_paint_get_alpha(paint_ptr: *mut ValueBox<Paint>) -> u8 {\n\n paint_ptr.with_not_null_return(0, |paint| paint.alpha())\n\n}\n\n\n","file_path":"library/src/paint.rs","rank":5,"score":351259.479943208},{"content":"#[no_mangle]\n\npub fn skia_paint_get_stroke_miter(paint_ptr: *mut ValueBox<Paint>) -> scalar {\n\n paint_ptr.with_not_null_return(0.0, |paint| paint.stroke_miter())\n\n}\n\n\n","file_path":"library/src/paint.rs","rank":6,"score":348512.4262438755},{"content":"#[no_mangle]\n\npub fn skia_paint_get_stroke_width(paint_ptr: *mut ValueBox<Paint>) -> scalar {\n\n paint_ptr.with_not_null_return(0.0, |paint| paint.stroke_width())\n\n}\n\n\n","file_path":"library/src/paint.rs","rank":7,"score":348512.4262438755},{"content":"#[no_mangle]\n\npub fn skia_path_move_to(path_ptr: *mut ValueBox<Path>, x: scalar, y: scalar, is_absolute: bool) {\n\n path_ptr.with_not_null(|path| {\n\n if is_absolute {\n\n path.move_to(Point::new(x, y));\n\n } else {\n\n path.r_move_to(Vector::new(x, y));\n\n }\n\n });\n\n}\n\n\n","file_path":"library/src/path.rs","rank":8,"score":346329.28609073104},{"content":"#[no_mangle]\n\npub fn skia_path_line_to(path_ptr: *mut ValueBox<Path>, x: scalar, y: scalar, is_absolute: bool) {\n\n path_ptr.with_not_null(|path| {\n\n if is_absolute {\n\n path.line_to(Point::new(x, y));\n\n } else {\n\n path.r_line_to(Vector::new(x, y));\n\n }\n\n });\n\n}\n\n\n","file_path":"library/src/path.rs","rank":9,"score":346329.28609073104},{"content":"#[no_mangle]\n\npub fn skia_paint_set_alpha(paint_ptr: *mut ValueBox<Paint>, alpha: u8) {\n\n paint_ptr.with_not_null(|paint| {\n\n paint.set_alpha(alpha);\n\n });\n\n}\n\n\n","file_path":"library/src/paint.rs","rank":10,"score":344530.45189538435},{"content":"#[no_mangle]\n\npub fn skia_paint_set_stroke_width(paint_ptr: *mut ValueBox<Paint>, width: scalar) {\n\n paint_ptr.with_not_null(|paint| {\n\n paint.set_stroke_width(width);\n\n });\n\n}\n\n\n","file_path":"library/src/paint.rs","rank":11,"score":341848.0354842879},{"content":"#[no_mangle]\n\npub fn skia_paint_set_stroke_miter(paint_ptr: *mut ValueBox<Paint>, stroke_miter: scalar) {\n\n paint_ptr.with_not_null(|paint| {\n\n paint.set_stroke_miter(stroke_miter);\n\n });\n\n}\n\n\n","file_path":"library/src/paint.rs","rank":12,"score":339876.6510437902},{"content":"#[no_mangle]\n\npub fn skia_rectangle_f32_left(rectangle_ptr: *mut ValueBox<Rect>) -> scalar {\n\n rectangle_ptr.with_not_null_return(0.0, |rectangle| rectangle.left())\n\n}\n\n\n","file_path":"library/src/rectangle.rs","rank":13,"score":337232.2133293815},{"content":"#[no_mangle]\n\npub fn skia_rectangle_f32_right(rectangle_ptr: *mut ValueBox<Rect>) -> scalar {\n\n rectangle_ptr.with_not_null_return(0.0, |rectangle| rectangle.right())\n\n}\n\n\n","file_path":"library/src/rectangle.rs","rank":14,"score":337232.21332938154},{"content":"#[no_mangle]\n\npub fn skia_rectangle_f32_top(rectangle_ptr: *mut ValueBox<Rect>) -> scalar {\n\n rectangle_ptr.with_not_null_return(0.0, |rectangle| rectangle.top())\n\n}\n\n\n","file_path":"library/src/rectangle.rs","rank":15,"score":337223.04103370605},{"content":"#[no_mangle]\n\npub fn skia_rectangle_f32_bottom(rectangle_ptr: *mut ValueBox<Rect>) -> scalar {\n\n rectangle_ptr.with_not_null_return(0.0, |rectangle| rectangle.bottom())\n\n}\n\n\n","file_path":"library/src/rectangle.rs","rank":16,"score":337223.041033706},{"content":"#[no_mangle]\n\npub fn skia_rounded_rectangle_height(rounded_rectangle_ptr: *mut ValueBox<RRect>) -> scalar {\n\n rounded_rectangle_ptr.with_not_null_return(0.0, |rounded_rectangle| rounded_rectangle.height())\n\n}\n\n\n","file_path":"library/src/rounded_rectangle.rs","rank":17,"score":328988.616720514},{"content":"#[no_mangle]\n\npub fn skia_rounded_rectangle_width(rounded_rectangle_ptr: *mut ValueBox<RRect>) -> scalar {\n\n rounded_rectangle_ptr.with_not_null_return(0.0, |rounded_rectangle| rounded_rectangle.width())\n\n}\n\n\n","file_path":"library/src/rounded_rectangle.rs","rank":18,"score":328988.616720514},{"content":"#[no_mangle]\n\npub fn skia_paint_get_path_effect(paint_ptr: *mut ValueBox<Paint>) -> *mut ValueBox<PathEffect> {\n\n paint_ptr.with_not_null_return(std::ptr::null_mut(), |paint| match paint.path_effect() {\n\n None => std::ptr::null_mut(),\n\n Some(path_effect) => ValueBox::new(path_effect).into_raw(),\n\n })\n\n}\n\n\n","file_path":"library/src/paint.rs","rank":19,"score":326630.0591779158},{"content":"#[no_mangle]\n\npub fn skia_paint_get_image_filter(paint_ptr: *mut ValueBox<Paint>) -> *mut ValueBox<ImageFilter> {\n\n paint_ptr.with_not_null_return(std::ptr::null_mut(), |paint| match paint.image_filter() {\n\n None => std::ptr::null_mut(),\n\n Some(image_filter) => ValueBox::new(image_filter).into_raw(),\n\n })\n\n}\n\n\n","file_path":"library/src/paint.rs","rank":20,"score":326297.6125465779},{"content":"#[no_mangle]\n\npub fn skia_color_get_blue(color_ptr: *mut ValueBox<Color>) -> u8 {\n\n color_ptr.with_not_null_return(0, |color| color.b())\n\n}\n\n\n","file_path":"library/src/color.rs","rank":23,"score":315689.47604994086},{"content":"#[no_mangle]\n\npub fn skia_color_get_alpha(color_ptr: *mut ValueBox<Color>) -> u8 {\n\n color_ptr.with_not_null_return(0, |color| color.a())\n\n}\n\n\n","file_path":"library/src/color.rs","rank":24,"score":315689.47604994086},{"content":"#[no_mangle]\n\npub fn skia_color_get_green(color_ptr: *mut ValueBox<Color>) -> u8 {\n\n color_ptr.with_not_null_return(0, |color| color.g())\n\n}\n\n\n","file_path":"library/src/color.rs","rank":25,"score":315689.4760499408},{"content":"#[no_mangle]\n\npub fn skia_color_get_red(color_ptr: *mut ValueBox<Color>) -> u8 {\n\n color_ptr.with_not_null_return(0, |color| color.r())\n\n}\n\n\n","file_path":"library/src/color.rs","rank":26,"score":315689.47604994086},{"content":"#[no_mangle]\n\npub fn skia_paint_has_path_effect(paint_ptr: *mut ValueBox<Paint>) -> bool {\n\n paint_ptr.with_not_null_return(false, |paint| match paint.path_effect() {\n\n None => false,\n\n Some(_) => true,\n\n })\n\n}\n\n\n","file_path":"library/src/paint.rs","rank":27,"score":315116.5757422849},{"content":"#[no_mangle]\n\npub fn skia_paint_has_image_filter(paint_ptr: *mut ValueBox<Paint>) -> bool {\n\n paint_ptr.with_not_null_return(false, |paint| match paint.image_filter() {\n\n None => false,\n\n Some(_) => true,\n\n })\n\n}\n\n\n","file_path":"library/src/paint.rs","rank":28,"score":314840.43630748504},{"content":"#[no_mangle]\n\npub fn skia_path_serialize(path_ptr: *mut ValueBox<Path>, data_ptr: *mut ValueBox<BoxerArray<u8>>) {\n\n path_ptr.with_not_null(|path| {\n\n data_ptr.with_not_null(|data| {\n\n data.set_array(path.serialize().as_bytes());\n\n })\n\n });\n\n}\n\n\n","file_path":"library/src/path.rs","rank":29,"score":309344.00073819084},{"content":"#[no_mangle]\n\npub fn skia_path_contains_point(path_ptr: *mut ValueBox<Path>, x: f32, y: f32) -> bool {\n\n path_ptr.with_not_null_return(false, |path| path.contains(Point::new(x, y)))\n\n}\n\n\n","file_path":"library/src/path.rs","rank":30,"score":298565.3235901111},{"content":"#[no_mangle]\n\npub fn skia_offset_layer_new_point(x: scalar, y: scalar) -> *mut ValueBox<Rc<RefCell<dyn Layer>>> {\n\n let layer: Rc<RefCell<dyn Layer>> = Rc::new(RefCell::new(OffsetLayer::new(Point::new(x, y))));\n\n ValueBox::new(layer).into_raw()\n\n}\n\n\n","file_path":"library/src/compositor/layers/offset.rs","rank":31,"score":289928.52377897984},{"content":"#[no_mangle]\n\npub fn skia_paint_reset(paint_ptr: *mut ValueBox<Paint>) {\n\n paint_ptr.with_not_null(|paint| {\n\n paint.reset();\n\n });\n\n}\n\n\n","file_path":"library/src/paint.rs","rank":33,"score":283787.4858786537},{"content":"#[no_mangle]\n\npub fn skia_paint_get_shader(paint_ptr: *mut ValueBox<Paint>) -> *mut ValueBox<Shader> {\n\n paint_ptr.with_not_null_return(std::ptr::null_mut(), |paint| match paint.shader() {\n\n None => std::ptr::null_mut(),\n\n Some(shader) => ValueBox::new(shader).into_raw(),\n\n })\n\n}\n\n\n","file_path":"library/src/paint.rs","rank":34,"score":283127.53949231154},{"content":"#[no_mangle]\n\npub fn skia_path_count_points(path_ptr: *mut ValueBox<Path>) -> usize {\n\n path_ptr.with_not_null_return(0, |path| path.count_points())\n\n}\n\n\n","file_path":"library/src/path.rs","rank":35,"score":279981.39152991946},{"content":"#[no_mangle]\n\npub fn skia_rounded_rectangle_drop(ptr: &mut *mut ValueBox<RRect>) {\n\n drop!(ptr);\n\n}\n\n\n\n#[cfg(test)]\n\nmod test {\n\n use boxer::ValueBoxPointerReference;\n\n use rectangle::{skia_rectangle_f32_default, skia_rectangle_f32_set_ltrb};\n\n use rounded_rectangle::{\n\n skia_rounded_rectangle_default, skia_rounded_rectangle_height,\n\n skia_rounded_rectangle_set_rect, skia_rounded_rectangle_width,\n\n };\n\n\n\n #[test]\n\n fn set_rect() {\n\n let mut rect = skia_rectangle_f32_default();\n\n skia_rectangle_f32_set_ltrb(rect, 0.0, 0.0, 50.0, 50.0);\n\n\n\n let mut r_rect = skia_rounded_rectangle_default();\n\n skia_rounded_rectangle_set_rect(r_rect, rect);\n","file_path":"library/src/rounded_rectangle.rs","rank":36,"score":278541.61564589635},{"content":"#[no_mangle]\n\npub fn skia_paint_is_dither(paint_ptr: *mut ValueBox<Paint>) -> bool {\n\n paint_ptr.with_not_null_return(false, |paint| paint.is_dither())\n\n}\n\n\n","file_path":"library/src/paint.rs","rank":37,"score":278318.74200632353},{"content":"#[no_mangle]\n\npub fn skia_paint_set_shader(paint_ptr: *mut ValueBox<Paint>, shader_ptr: *mut ValueBox<Shader>) {\n\n paint_ptr.with_not_null(|paint| {\n\n let shader = shader_ptr.with_not_null_value_return(None, |shader| Some(shader));\n\n paint.set_shader(shader);\n\n });\n\n}\n\n\n","file_path":"library/src/paint.rs","rank":38,"score":277321.53239711974},{"content":"#[no_mangle]\n\npub fn skia_paint_get_alpha_f(paint_ptr: *mut ValueBox<Paint>) -> f32 {\n\n paint_ptr.with_not_null_return(0.0, |paint| paint.alpha_f())\n\n}\n\n\n","file_path":"library/src/paint.rs","rank":39,"score":276717.8584311171},{"content":"#[no_mangle]\n\npub fn skia_paint_is_anti_alias(paint_ptr: *mut ValueBox<Paint>) -> bool {\n\n paint_ptr.with_not_null_return(false, |paint| paint.is_anti_alias())\n\n}\n\n\n","file_path":"library/src/paint.rs","rank":40,"score":276717.85843111714},{"content":"#[no_mangle]\n\npub fn skia_paint_get_style(paint_ptr: *mut ValueBox<Paint>) -> Style {\n\n paint_ptr.with_not_null_return(Style::Fill, |paint| paint.style())\n\n}\n\n\n","file_path":"library/src/paint.rs","rank":41,"score":276717.8584311171},{"content":"#[no_mangle]\n\npub fn skia_paint_get_stroke_join(paint_ptr: *mut ValueBox<Paint>) -> Join {\n\n paint_ptr.with_not_null_return(Join::Miter, |paint| paint.stroke_join())\n\n}\n\n\n","file_path":"library/src/paint.rs","rank":42,"score":275154.7382000444},{"content":"#[no_mangle]\n\npub fn skia_paint_get_stroke_cap(paint_ptr: *mut ValueBox<Paint>) -> Cap {\n\n paint_ptr.with_not_null_return(Cap::Butt, |paint| paint.stroke_cap())\n\n}\n\n\n","file_path":"library/src/paint.rs","rank":43,"score":275154.7382000444},{"content":"#[no_mangle]\n\npub fn skia_path_effect_corner(radius: scalar) -> *mut ValueBox<PathEffect> {\n\n match PathEffect::corner_path(radius) {\n\n None => std::ptr::null_mut(),\n\n Some(effect) => ValueBox::new(effect).into_raw(),\n\n }\n\n}\n\n\n","file_path":"library/src/path_effect.rs","rank":44,"score":274621.81902564975},{"content":"#[no_mangle]\n\npub fn skia_paint_get_blend_mode(paint_ptr: *mut ValueBox<Paint>) -> BlendMode {\n\n paint_ptr.with_not_null_return(BlendMode::Clear, |paint| paint.blend_mode())\n\n}\n\n\n","file_path":"library/src/paint.rs","rank":45,"score":273627.96927938616},{"content":"#[no_mangle]\n\npub fn skia_paint_set_dither(paint_ptr: *mut ValueBox<Paint>, dither: bool) {\n\n paint_ptr.with_not_null(|paint| {\n\n paint.set_dither(dither);\n\n });\n\n}\n\n\n","file_path":"library/src/paint.rs","rank":46,"score":271550.3516384198},{"content":"#[no_mangle]\n\npub fn skia_paint_set_alpha_f(paint_ptr: *mut ValueBox<Paint>, alpha: f32) {\n\n paint_ptr.with_not_null(|paint| {\n\n paint.set_alpha_f(alpha);\n\n });\n\n}\n\n\n","file_path":"library/src/paint.rs","rank":47,"score":271550.3516384198},{"content":"#[no_mangle]\n\npub fn skia_paint_set_style(paint_ptr: *mut ValueBox<Paint>, style: Style) {\n\n paint_ptr.with_not_null(|paint| {\n\n paint.set_style(style);\n\n });\n\n}\n\n\n","file_path":"library/src/paint.rs","rank":48,"score":271550.3516384198},{"content":"#[no_mangle]\n\npub fn skia_rounded_rectangle_default() -> *mut ValueBox<RRect> {\n\n ValueBox::new(RRect::default()).into_raw()\n\n}\n\n\n","file_path":"library/src/rounded_rectangle.rs","rank":49,"score":271388.0654397147},{"content":"#[no_mangle]\n\npub fn skia_paint_set_anti_alias(paint_ptr: *mut ValueBox<Paint>, anti_alias: bool) {\n\n paint_ptr.with_not_null(|paint| {\n\n paint.set_anti_alias(anti_alias);\n\n });\n\n}\n\n\n","file_path":"library/src/paint.rs","rank":50,"score":268531.82449018396},{"content":"#[no_mangle]\n\npub fn skia_paint_set_stroke_join(paint_ptr: *mut ValueBox<Paint>, stroke_join: Join) {\n\n paint_ptr.with_not_null(|paint| {\n\n paint.set_stroke_join(stroke_join);\n\n });\n\n}\n\n\n","file_path":"library/src/paint.rs","rank":51,"score":268531.82449018396},{"content":"#[no_mangle]\n\npub fn skia_paint_set_stroke_cap(paint_ptr: *mut ValueBox<Paint>, stroke_cap: Cap) {\n\n paint_ptr.with_not_null(|paint| {\n\n paint.set_stroke_cap(stroke_cap);\n\n });\n\n}\n\n\n","file_path":"library/src/paint.rs","rank":52,"score":268531.82449018396},{"content":"#[no_mangle]\n\npub fn skia_paint_set_blend_mode(paint_ptr: *mut ValueBox<Paint>, blend_mode: BlendMode) {\n\n paint_ptr.with_not_null(|paint| {\n\n paint.set_blend_mode(blend_mode);\n\n });\n\n}\n\n\n","file_path":"library/src/paint.rs","rank":53,"score":267073.803250864},{"content":"#[no_mangle]\n\npub fn skia_matrix_drop(ptr: &mut *mut ValueBox<Matrix>) {\n\n drop!(ptr);\n\n}\n","file_path":"library/src/matrix.rs","rank":54,"score":259719.44359709113},{"content":"#[no_mangle]\n\npub fn skia_color_array_get_data(_ptr: *mut ValueBox<BoxerArray<Color>>) -> *mut Color {\n\n BoxerArray::<Color>::boxer_array_get_data(_ptr)\n\n}\n\n\n","file_path":"library/src/color.rs","rank":55,"score":259388.34593731345},{"content":"#[no_mangle]\n\npub fn skia_path_drop(ptr: &mut *mut ValueBox<Path>) {\n\n drop!(ptr);\n\n}\n","file_path":"library/src/path.rs","rank":56,"score":259339.98405077815},{"content":"#[no_mangle]\n\npub fn skia_color_drop(ptr: &mut *mut ValueBox<Color>) {\n\n drop!(ptr);\n\n}\n\n\n","file_path":"library/src/color.rs","rank":57,"score":259121.23860196728},{"content":"#[no_mangle]\n\npub fn skia_paint_drop(ptr: &mut *mut ValueBox<Paint>) {\n\n drop!(ptr);\n\n}\n","file_path":"library/src/paint.rs","rank":58,"score":258996.1595129512},{"content":"#[no_mangle]\n\npub fn skia_image_get_color_space(image_ptr: *mut ValueBox<Image>) -> *mut ValueBox<ColorSpace> {\n\n image_ptr.with(\n\n || ValueBox::new(ColorSpace::new_srgb()).into_raw(),\n\n |image| ValueBox::new(image.color_space()).into_raw(),\n\n )\n\n}\n\n\n","file_path":"library/src/image.rs","rank":59,"score":258887.04107434466},{"content":"#[no_mangle]\n\npub fn skia_rounded_rectangle_get_type(rounded_rectangle_ptr: *mut ValueBox<RRect>) -> Type {\n\n rounded_rectangle_ptr.with_not_null_return(Type::Empty, |rounded_rectangle| {\n\n rounded_rectangle.get_type()\n\n })\n\n}\n\n\n","file_path":"library/src/rounded_rectangle.rs","rank":60,"score":254459.8276370598},{"content":"#[no_mangle]\n\npub fn skia_color_array_drop(ptr: &mut *mut ValueBox<BoxerArray<Color>>) {\n\n drop!(ptr);\n\n}\n\n\n","file_path":"library/src/color.rs","rank":61,"score":252077.36794904165},{"content":"#[no_mangle]\n\npub fn skia_font_metrics_get_top(font_metrics_ptr: *mut ValueBox<FontMetrics>) -> scalar {\n\n font_metrics_ptr.with_not_null_return(0.0, |metrics| metrics.top)\n\n}\n\n\n","file_path":"library/src/text/font_metrics.rs","rank":62,"score":251784.9339909238},{"content":"#[no_mangle]\n\npub fn skia_font_metrics_get_bottom(font_metrics_ptr: *mut ValueBox<FontMetrics>) -> scalar {\n\n font_metrics_ptr.with_not_null_return(0.0, |metrics| metrics.bottom)\n\n}\n\n\n","file_path":"library/src/text/font_metrics.rs","rank":63,"score":251784.9339909238},{"content":"#[no_mangle]\n\npub fn skia_path_new() -> *mut ValueBox<Path> {\n\n ValueBox::new(Path::new()).into_raw()\n\n}\n\n\n","file_path":"library/src/path.rs","rank":64,"score":251328.12541282334},{"content":"#[no_mangle]\n\npub fn skia_color_default() -> *mut ValueBox<Color> {\n\n ValueBox::new(Color::default()).into_raw()\n\n}\n\n\n","file_path":"library/src/color.rs","rank":65,"score":251103.41922756511},{"content":"#[no_mangle]\n\npub fn skia_paint_default() -> *mut ValueBox<Paint> {\n\n ValueBox::new(Paint::default()).into_raw()\n\n}\n\n\n","file_path":"library/src/paint.rs","rank":66,"score":250966.2485325088},{"content":"#[no_mangle]\n\npub fn skia_matrix_new_identity() -> *mut ValueBox<Matrix> {\n\n ValueBox::new(Matrix::new_identity()).into_raw()\n\n}\n\n\n","file_path":"library/src/matrix.rs","rank":67,"score":249930.47899466974},{"content":"#[no_mangle]\n\npub fn skia_image_get_color_type(image_ptr: *mut ValueBox<Image>) -> ColorType {\n\n image_ptr.with_not_null_return(ColorType::Unknown, |image| image.color_type())\n\n}\n\n\n","file_path":"library/src/image.rs","rank":68,"score":249189.13885347525},{"content":"#[no_mangle]\n\npub fn skia_path_close(path_ptr: *mut ValueBox<Path>) {\n\n path_ptr.with_not_null(|path| {\n\n path.close();\n\n });\n\n}\n\n\n","file_path":"library/src/path.rs","rank":69,"score":247340.70248705026},{"content":"#[no_mangle]\n\npub fn skia_rectangle_f32_drop(ptr: &mut *mut ValueBox<Rect>) {\n\n drop!(ptr);\n\n}\n\n\n\n///\n\n/// IRect\n\n///\n\n\n","file_path":"library/src/rectangle.rs","rank":71,"score":243831.76441793705},{"content":"#[no_mangle]\n\npub fn skia_color_array_default() -> *mut ValueBox<BoxerArray<Color>> {\n\n ValueBox::new(BoxerArray::new()).into_raw()\n\n}\n\n\n","file_path":"library/src/color.rs","rank":72,"score":242981.0681549788},{"content":"#[no_mangle]\n\npub fn skia_picture_cull_rect(picture_ptr: *mut ValueBox<Picture>) -> *mut ValueBox<Rect> {\n\n picture_ptr.with_not_null_return(std::ptr::null_mut(), |picture| {\n\n ValueBox::new(picture.cull_rect()).into_raw()\n\n })\n\n}\n\n\n","file_path":"library/src/picture.rs","rank":74,"score":242505.1076380842},{"content":"#[no_mangle]\n\npub fn skia_image_info_get_color_type(image_info_ptr: *mut ValueBox<ImageInfo>) -> ColorType {\n\n image_info_ptr.with_not_null_return(ColorType::Unknown, |image_info| image_info.color_type())\n\n}\n\n\n","file_path":"library/src/image_info.rs","rank":75,"score":241917.3655616021},{"content":"#[no_mangle]\n\npub fn skia_color_create_argb(argb: u32) -> *mut ValueBox<Color> {\n\n ValueBox::new(Color::new(argb)).into_raw()\n\n}\n\n\n","file_path":"library/src/color.rs","rank":77,"score":240256.2995523252},{"content":"#[no_mangle]\n\npub fn skia_paragraph_decoration_get_color(ptr: *mut ValueBox<Decoration>) -> *mut ValueBox<Color> {\n\n ptr.with_not_null_return(std::ptr::null_mut(), |decoration| {\n\n ValueBox::new(decoration.color).into_raw()\n\n })\n\n}\n\n\n","file_path":"library/src/paragraph/paragraph_decoration.rs","rank":78,"score":239212.36523740325},{"content":"#[no_mangle]\n\npub fn skia_path_get_fill_type(path_ptr: *mut ValueBox<Path>) -> PathFillType {\n\n path_ptr.with_not_null_return(PathFillType::Winding, |path| path.fill_type())\n\n}\n\n\n","file_path":"library/src/path.rs","rank":79,"score":238562.9562497308},{"content":"#[no_mangle]\n\npub fn skia_rectangle_f32_default() -> *mut ValueBox<Rect> {\n\n ValueBox::new(Rect::default()).into_raw()\n\n}\n\n\n","file_path":"library/src/rectangle.rs","rank":81,"score":236051.1408301882},{"content":"#[no_mangle]\n\npub fn skia_path_set_fill_type(path_ptr: *mut ValueBox<Path>, fill_type: PathFillType) {\n\n path_ptr.with_not_null(|path| {\n\n path.set_fill_type(fill_type);\n\n });\n\n}\n\n\n","file_path":"library/src/path.rs","rank":82,"score":233185.97893230774},{"content":"#[no_mangle]\n\npub fn skia_color_array_get_capacity(_ptr: *mut ValueBox<BoxerArray<Color>>) -> usize {\n\n BoxerArray::<Color>::boxer_array_get_capacity(_ptr)\n\n}\n\n\n","file_path":"library/src/color.rs","rank":83,"score":232834.90142229828},{"content":"#[no_mangle]\n\npub fn skia_color_array_get_length(_ptr: *mut ValueBox<BoxerArray<Color>>) -> usize {\n\n BoxerArray::<Color>::boxer_array_get_length(_ptr)\n\n}\n\n\n","file_path":"library/src/color.rs","rank":84,"score":232834.90142229828},{"content":"#[no_mangle]\n\npub fn skia_rectangle_i32_right(rectangle_ptr: *mut ValueBox<IRect>) -> i32 {\n\n rectangle_ptr.with_not_null_return(0, |rectangle| rectangle.right())\n\n}\n\n\n","file_path":"library/src/rectangle.rs","rank":88,"score":227399.45273958126},{"content":"#[no_mangle]\n\npub fn skia_rectangle_i32_left(rectangle_ptr: *mut ValueBox<IRect>) -> i32 {\n\n rectangle_ptr.with_not_null_return(0, |rectangle| rectangle.left())\n\n}\n\n\n","file_path":"library/src/rectangle.rs","rank":89,"score":227399.45273958126},{"content":"#[no_mangle]\n\npub fn skia_rectangle_i32_bottom(rectangle_ptr: *mut ValueBox<IRect>) -> i32 {\n\n rectangle_ptr.with_not_null_return(0, |rectangle| rectangle.bottom())\n\n}\n\n\n","file_path":"library/src/rectangle.rs","rank":90,"score":227390.28044390577},{"content":"#[no_mangle]\n\npub fn skia_rectangle_i32_top(rectangle_ptr: *mut ValueBox<IRect>) -> i32 {\n\n rectangle_ptr.with_not_null_return(0, |rectangle| rectangle.top())\n\n}\n\n\n","file_path":"library/src/rectangle.rs","rank":91,"score":227390.28044390577},{"content":"#[no_mangle]\n\npub fn skia_image_drop(ptr: &mut *mut ValueBox<Image>) {\n\n drop!(ptr);\n\n}\n","file_path":"library/src/image.rs","rank":93,"score":223024.40391193674},{"content":"#[no_mangle]\n\npub fn skia_font_get_spacing(font_ptr: *mut ValueBox<Font>) -> scalar {\n\n font_ptr.with_not_null_return(0.0, |font| font.spacing())\n\n}\n\n\n","file_path":"library/src/text/font.rs","rank":94,"score":222312.1558729034},{"content":"#[no_mangle]\n\npub fn skia_font_get_scale_x(font_ptr: *mut ValueBox<Font>) -> scalar {\n\n font_ptr.with_not_null_return(0.0, |font| font.scale_x())\n\n}\n\n\n","file_path":"library/src/text/font.rs","rank":95,"score":222312.1558729034},{"content":"#[no_mangle]\n\npub fn skia_font_get_size(font_ptr: *mut ValueBox<Font>) -> scalar {\n\n font_ptr.with_not_null_return(0.0, |font| font.size())\n\n}\n\n\n","file_path":"library/src/text/font.rs","rank":96,"score":222312.1558729034},{"content":"#[no_mangle]\n\npub fn skia_font_get_skew_x(font_ptr: *mut ValueBox<Font>) -> scalar {\n\n font_ptr.with_not_null_return(0.0, |font| font.skew_x())\n\n}\n\n\n","file_path":"library/src/text/font.rs","rank":97,"score":222312.1558729034},{"content":"#[no_mangle]\n\npub fn skia_paragraph_get_height(paragraph_ptr: *mut ValueBox<ParagraphWithText>) -> scalar {\n\n paragraph_ptr.with_not_null_return(0.0, |paragraph| paragraph.height())\n\n}\n\n\n","file_path":"library/src/paragraph/paragraph.rs","rank":98,"score":220554.01238260325},{"content":"#[no_mangle]\n\npub fn skia_paragraph_decoration_get_thickness(ptr: *mut ValueBox<Decoration>) -> scalar {\n\n ptr.with_not_null_return(0.0, |decoration| decoration.thickness_multiplier)\n\n}\n\n\n","file_path":"library/src/paragraph/paragraph_decoration.rs","rank":99,"score":220554.01238260325}],"string":"[\n {\n \"content\": \"#[no_mangle]\\n\\npub fn skia_paint_set_rgba(paint_ptr: *mut ValueBox<Paint>, r: u8, g: u8, b: u8, a: u8) {\\n\\n paint_ptr.with_not_null(|paint| {\\n\\n paint.set_argb(a, r, g, b);\\n\\n });\\n\\n}\\n\\n\\n\",\n \"file_path\": \"library/src/paint.rs\",\n \"rank\": 0,\n \"score\": 443120.23559253\n },\n {\n \"content\": \"#[no_mangle]\\n\\npub fn skia_color_create(r: u8, g: u8, b: u8, a: u8) -> *mut ValueBox<Color> {\\n\\n ValueBox::new(Color::from_argb(a, r, g, b)).into_raw()\\n\\n}\\n\\n\\n\",\n \"file_path\": \"library/src/color.rs\",\n \"rank\": 1,\n \"score\": 421184.06677549356\n },\n {\n \"content\": \"#[no_mangle]\\n\\npub fn skia_paint_get_color(paint_ptr: *mut ValueBox<Paint>) -> *mut ValueBox<Color> {\\n\\n paint_ptr.with_not_null_return(std::ptr::null_mut(), |paint| {\\n\\n ValueBox::new(paint.color()).into_raw()\\n\\n })\\n\\n}\\n\\n\\n\",\n \"file_path\": \"library/src/paint.rs\",\n \"rank\": 3,\n \"score\": 363803.4640020316\n },\n {\n \"content\": \"#[no_mangle]\\n\\npub fn skia_paint_get_alpha(paint_ptr: *mut ValueBox<Paint>) -> u8 {\\n\\n paint_ptr.with_not_null_return(0, |paint| paint.alpha())\\n\\n}\\n\\n\\n\",\n \"file_path\": \"library/src/paint.rs\",\n \"rank\": 5,\n \"score\": 351259.479943208\n },\n {\n \"content\": \"#[no_mangle]\\n\\npub fn skia_paint_get_stroke_miter(paint_ptr: *mut ValueBox<Paint>) -> scalar {\\n\\n paint_ptr.with_not_null_return(0.0, |paint| paint.stroke_miter())\\n\\n}\\n\\n\\n\",\n \"file_path\": \"library/src/paint.rs\",\n \"rank\": 6,\n \"score\": 348512.4262438755\n },\n {\n \"content\": \"#[no_mangle]\\n\\npub fn skia_paint_get_stroke_width(paint_ptr: *mut ValueBox<Paint>) -> scalar {\\n\\n paint_ptr.with_not_null_return(0.0, |paint| paint.stroke_width())\\n\\n}\\n\\n\\n\",\n \"file_path\": \"library/src/paint.rs\",\n \"rank\": 7,\n \"score\": 348512.4262438755\n },\n {\n \"content\": \"#[no_mangle]\\n\\npub fn skia_path_move_to(path_ptr: *mut ValueBox<Path>, x: scalar, y: scalar, is_absolute: bool) {\\n\\n path_ptr.with_not_null(|path| {\\n\\n if is_absolute {\\n\\n path.move_to(Point::new(x, y));\\n\\n } else {\\n\\n path.r_move_to(Vector::new(x, y));\\n\\n }\\n\\n });\\n\\n}\\n\\n\\n\",\n \"file_path\": \"library/src/path.rs\",\n \"rank\": 8,\n \"score\": 346329.28609073104\n },\n {\n \"content\": \"#[no_mangle]\\n\\npub fn skia_path_line_to(path_ptr: *mut ValueBox<Path>, x: scalar, y: scalar, is_absolute: bool) {\\n\\n path_ptr.with_not_null(|path| {\\n\\n if is_absolute {\\n\\n path.line_to(Point::new(x, y));\\n\\n } else {\\n\\n path.r_line_to(Vector::new(x, y));\\n\\n }\\n\\n });\\n\\n}\\n\\n\\n\",\n \"file_path\": \"library/src/path.rs\",\n \"rank\": 9,\n \"score\": 346329.28609073104\n },\n {\n \"content\": \"#[no_mangle]\\n\\npub fn skia_paint_set_alpha(paint_ptr: *mut ValueBox<Paint>, alpha: u8) {\\n\\n paint_ptr.with_not_null(|paint| {\\n\\n paint.set_alpha(alpha);\\n\\n });\\n\\n}\\n\\n\\n\",\n \"file_path\": \"library/src/paint.rs\",\n \"rank\": 10,\n \"score\": 344530.45189538435\n },\n {\n \"content\": \"#[no_mangle]\\n\\npub fn skia_paint_set_stroke_width(paint_ptr: *mut ValueBox<Paint>, width: scalar) {\\n\\n paint_ptr.with_not_null(|paint| {\\n\\n paint.set_stroke_width(width);\\n\\n });\\n\\n}\\n\\n\\n\",\n \"file_path\": \"library/src/paint.rs\",\n \"rank\": 11,\n \"score\": 341848.0354842879\n },\n {\n \"content\": \"#[no_mangle]\\n\\npub fn skia_paint_set_stroke_miter(paint_ptr: *mut ValueBox<Paint>, stroke_miter: scalar) {\\n\\n paint_ptr.with_not_null(|paint| {\\n\\n paint.set_stroke_miter(stroke_miter);\\n\\n });\\n\\n}\\n\\n\\n\",\n \"file_path\": \"library/src/paint.rs\",\n \"rank\": 12,\n \"score\": 339876.6510437902\n },\n {\n \"content\": \"#[no_mangle]\\n\\npub fn skia_rectangle_f32_left(rectangle_ptr: *mut ValueBox<Rect>) -> scalar {\\n\\n rectangle_ptr.with_not_null_return(0.0, |rectangle| rectangle.left())\\n\\n}\\n\\n\\n\",\n \"file_path\": \"library/src/rectangle.rs\",\n \"rank\": 13,\n \"score\": 337232.2133293815\n },\n {\n \"content\": \"#[no_mangle]\\n\\npub fn skia_rectangle_f32_right(rectangle_ptr: *mut ValueBox<Rect>) -> scalar {\\n\\n rectangle_ptr.with_not_null_return(0.0, |rectangle| rectangle.right())\\n\\n}\\n\\n\\n\",\n \"file_path\": \"library/src/rectangle.rs\",\n \"rank\": 14,\n \"score\": 337232.21332938154\n },\n {\n \"content\": \"#[no_mangle]\\n\\npub fn skia_rectangle_f32_top(rectangle_ptr: *mut ValueBox<Rect>) -> scalar {\\n\\n rectangle_ptr.with_not_null_return(0.0, |rectangle| rectangle.top())\\n\\n}\\n\\n\\n\",\n \"file_path\": \"library/src/rectangle.rs\",\n \"rank\": 15,\n \"score\": 337223.04103370605\n },\n {\n \"content\": \"#[no_mangle]\\n\\npub fn skia_rectangle_f32_bottom(rectangle_ptr: *mut ValueBox<Rect>) -> scalar {\\n\\n rectangle_ptr.with_not_null_return(0.0, |rectangle| rectangle.bottom())\\n\\n}\\n\\n\\n\",\n \"file_path\": \"library/src/rectangle.rs\",\n \"rank\": 16,\n \"score\": 337223.041033706\n },\n {\n \"content\": \"#[no_mangle]\\n\\npub fn skia_rounded_rectangle_height(rounded_rectangle_ptr: *mut ValueBox<RRect>) -> scalar {\\n\\n rounded_rectangle_ptr.with_not_null_return(0.0, |rounded_rectangle| rounded_rectangle.height())\\n\\n}\\n\\n\\n\",\n \"file_path\": \"library/src/rounded_rectangle.rs\",\n \"rank\": 17,\n \"score\": 328988.616720514\n },\n {\n \"content\": \"#[no_mangle]\\n\\npub fn skia_rounded_rectangle_width(rounded_rectangle_ptr: *mut ValueBox<RRect>) -> scalar {\\n\\n rounded_rectangle_ptr.with_not_null_return(0.0, |rounded_rectangle| rounded_rectangle.width())\\n\\n}\\n\\n\\n\",\n \"file_path\": \"library/src/rounded_rectangle.rs\",\n \"rank\": 18,\n \"score\": 328988.616720514\n },\n {\n \"content\": \"#[no_mangle]\\n\\npub fn skia_paint_get_path_effect(paint_ptr: *mut ValueBox<Paint>) -> *mut ValueBox<PathEffect> {\\n\\n paint_ptr.with_not_null_return(std::ptr::null_mut(), |paint| match paint.path_effect() {\\n\\n None => std::ptr::null_mut(),\\n\\n Some(path_effect) => ValueBox::new(path_effect).into_raw(),\\n\\n })\\n\\n}\\n\\n\\n\",\n \"file_path\": \"library/src/paint.rs\",\n \"rank\": 19,\n \"score\": 326630.0591779158\n },\n {\n \"content\": \"#[no_mangle]\\n\\npub fn skia_paint_get_image_filter(paint_ptr: *mut ValueBox<Paint>) -> *mut ValueBox<ImageFilter> {\\n\\n paint_ptr.with_not_null_return(std::ptr::null_mut(), |paint| match paint.image_filter() {\\n\\n None => std::ptr::null_mut(),\\n\\n Some(image_filter) => ValueBox::new(image_filter).into_raw(),\\n\\n })\\n\\n}\\n\\n\\n\",\n \"file_path\": \"library/src/paint.rs\",\n \"rank\": 20,\n \"score\": 326297.6125465779\n },\n {\n \"content\": \"#[no_mangle]\\n\\npub fn skia_color_get_blue(color_ptr: *mut ValueBox<Color>) -> u8 {\\n\\n color_ptr.with_not_null_return(0, |color| color.b())\\n\\n}\\n\\n\\n\",\n \"file_path\": \"library/src/color.rs\",\n \"rank\": 23,\n \"score\": 315689.47604994086\n },\n {\n \"content\": \"#[no_mangle]\\n\\npub fn skia_color_get_alpha(color_ptr: *mut ValueBox<Color>) -> u8 {\\n\\n color_ptr.with_not_null_return(0, |color| color.a())\\n\\n}\\n\\n\\n\",\n \"file_path\": \"library/src/color.rs\",\n \"rank\": 24,\n \"score\": 315689.47604994086\n },\n {\n \"content\": \"#[no_mangle]\\n\\npub fn skia_color_get_green(color_ptr: *mut ValueBox<Color>) -> u8 {\\n\\n color_ptr.with_not_null_return(0, |color| color.g())\\n\\n}\\n\\n\\n\",\n \"file_path\": \"library/src/color.rs\",\n \"rank\": 25,\n \"score\": 315689.4760499408\n },\n {\n \"content\": \"#[no_mangle]\\n\\npub fn skia_color_get_red(color_ptr: *mut ValueBox<Color>) -> u8 {\\n\\n color_ptr.with_not_null_return(0, |color| color.r())\\n\\n}\\n\\n\\n\",\n \"file_path\": \"library/src/color.rs\",\n \"rank\": 26,\n \"score\": 315689.47604994086\n },\n {\n \"content\": \"#[no_mangle]\\n\\npub fn skia_paint_has_path_effect(paint_ptr: *mut ValueBox<Paint>) -> bool {\\n\\n paint_ptr.with_not_null_return(false, |paint| match paint.path_effect() {\\n\\n None => false,\\n\\n Some(_) => true,\\n\\n })\\n\\n}\\n\\n\\n\",\n \"file_path\": \"library/src/paint.rs\",\n \"rank\": 27,\n \"score\": 315116.5757422849\n },\n {\n \"content\": \"#[no_mangle]\\n\\npub fn skia_paint_has_image_filter(paint_ptr: *mut ValueBox<Paint>) -> bool {\\n\\n paint_ptr.with_not_null_return(false, |paint| match paint.image_filter() {\\n\\n None => false,\\n\\n Some(_) => true,\\n\\n })\\n\\n}\\n\\n\\n\",\n \"file_path\": \"library/src/paint.rs\",\n \"rank\": 28,\n \"score\": 314840.43630748504\n },\n {\n \"content\": \"#[no_mangle]\\n\\npub fn skia_path_serialize(path_ptr: *mut ValueBox<Path>, data_ptr: *mut ValueBox<BoxerArray<u8>>) {\\n\\n path_ptr.with_not_null(|path| {\\n\\n data_ptr.with_not_null(|data| {\\n\\n data.set_array(path.serialize().as_bytes());\\n\\n })\\n\\n });\\n\\n}\\n\\n\\n\",\n \"file_path\": \"library/src/path.rs\",\n \"rank\": 29,\n \"score\": 309344.00073819084\n },\n {\n \"content\": \"#[no_mangle]\\n\\npub fn skia_path_contains_point(path_ptr: *mut ValueBox<Path>, x: f32, y: f32) -> bool {\\n\\n path_ptr.with_not_null_return(false, |path| path.contains(Point::new(x, y)))\\n\\n}\\n\\n\\n\",\n \"file_path\": \"library/src/path.rs\",\n \"rank\": 30,\n \"score\": 298565.3235901111\n },\n {\n \"content\": \"#[no_mangle]\\n\\npub fn skia_offset_layer_new_point(x: scalar, y: scalar) -> *mut ValueBox<Rc<RefCell<dyn Layer>>> {\\n\\n let layer: Rc<RefCell<dyn Layer>> = Rc::new(RefCell::new(OffsetLayer::new(Point::new(x, y))));\\n\\n ValueBox::new(layer).into_raw()\\n\\n}\\n\\n\\n\",\n \"file_path\": \"library/src/compositor/layers/offset.rs\",\n \"rank\": 31,\n \"score\": 289928.52377897984\n },\n {\n \"content\": \"#[no_mangle]\\n\\npub fn skia_paint_reset(paint_ptr: *mut ValueBox<Paint>) {\\n\\n paint_ptr.with_not_null(|paint| {\\n\\n paint.reset();\\n\\n });\\n\\n}\\n\\n\\n\",\n \"file_path\": \"library/src/paint.rs\",\n \"rank\": 33,\n \"score\": 283787.4858786537\n },\n {\n \"content\": \"#[no_mangle]\\n\\npub fn skia_paint_get_shader(paint_ptr: *mut ValueBox<Paint>) -> *mut ValueBox<Shader> {\\n\\n paint_ptr.with_not_null_return(std::ptr::null_mut(), |paint| match paint.shader() {\\n\\n None => std::ptr::null_mut(),\\n\\n Some(shader) => ValueBox::new(shader).into_raw(),\\n\\n })\\n\\n}\\n\\n\\n\",\n \"file_path\": \"library/src/paint.rs\",\n \"rank\": 34,\n \"score\": 283127.53949231154\n },\n {\n \"content\": \"#[no_mangle]\\n\\npub fn skia_path_count_points(path_ptr: *mut ValueBox<Path>) -> usize {\\n\\n path_ptr.with_not_null_return(0, |path| path.count_points())\\n\\n}\\n\\n\\n\",\n \"file_path\": \"library/src/path.rs\",\n \"rank\": 35,\n \"score\": 279981.39152991946\n },\n {\n \"content\": \"#[no_mangle]\\n\\npub fn skia_rounded_rectangle_drop(ptr: &mut *mut ValueBox<RRect>) {\\n\\n drop!(ptr);\\n\\n}\\n\\n\\n\\n#[cfg(test)]\\n\\nmod test {\\n\\n use boxer::ValueBoxPointerReference;\\n\\n use rectangle::{skia_rectangle_f32_default, skia_rectangle_f32_set_ltrb};\\n\\n use rounded_rectangle::{\\n\\n skia_rounded_rectangle_default, skia_rounded_rectangle_height,\\n\\n skia_rounded_rectangle_set_rect, skia_rounded_rectangle_width,\\n\\n };\\n\\n\\n\\n #[test]\\n\\n fn set_rect() {\\n\\n let mut rect = skia_rectangle_f32_default();\\n\\n skia_rectangle_f32_set_ltrb(rect, 0.0, 0.0, 50.0, 50.0);\\n\\n\\n\\n let mut r_rect = skia_rounded_rectangle_default();\\n\\n skia_rounded_rectangle_set_rect(r_rect, rect);\\n\",\n \"file_path\": \"library/src/rounded_rectangle.rs\",\n \"rank\": 36,\n \"score\": 278541.61564589635\n },\n {\n \"content\": \"#[no_mangle]\\n\\npub fn skia_paint_is_dither(paint_ptr: *mut ValueBox<Paint>) -> bool {\\n\\n paint_ptr.with_not_null_return(false, |paint| paint.is_dither())\\n\\n}\\n\\n\\n\",\n \"file_path\": \"library/src/paint.rs\",\n \"rank\": 37,\n \"score\": 278318.74200632353\n },\n {\n \"content\": \"#[no_mangle]\\n\\npub fn skia_paint_set_shader(paint_ptr: *mut ValueBox<Paint>, shader_ptr: *mut ValueBox<Shader>) {\\n\\n paint_ptr.with_not_null(|paint| {\\n\\n let shader = shader_ptr.with_not_null_value_return(None, |shader| Some(shader));\\n\\n paint.set_shader(shader);\\n\\n });\\n\\n}\\n\\n\\n\",\n \"file_path\": \"library/src/paint.rs\",\n \"rank\": 38,\n \"score\": 277321.53239711974\n },\n {\n \"content\": \"#[no_mangle]\\n\\npub fn skia_paint_get_alpha_f(paint_ptr: *mut ValueBox<Paint>) -> f32 {\\n\\n paint_ptr.with_not_null_return(0.0, |paint| paint.alpha_f())\\n\\n}\\n\\n\\n\",\n \"file_path\": \"library/src/paint.rs\",\n \"rank\": 39,\n \"score\": 276717.8584311171\n },\n {\n \"content\": \"#[no_mangle]\\n\\npub fn skia_paint_is_anti_alias(paint_ptr: *mut ValueBox<Paint>) -> bool {\\n\\n paint_ptr.with_not_null_return(false, |paint| paint.is_anti_alias())\\n\\n}\\n\\n\\n\",\n \"file_path\": \"library/src/paint.rs\",\n \"rank\": 40,\n \"score\": 276717.85843111714\n },\n {\n \"content\": \"#[no_mangle]\\n\\npub fn skia_paint_get_style(paint_ptr: *mut ValueBox<Paint>) -> Style {\\n\\n paint_ptr.with_not_null_return(Style::Fill, |paint| paint.style())\\n\\n}\\n\\n\\n\",\n \"file_path\": \"library/src/paint.rs\",\n \"rank\": 41,\n \"score\": 276717.8584311171\n },\n {\n \"content\": \"#[no_mangle]\\n\\npub fn skia_paint_get_stroke_join(paint_ptr: *mut ValueBox<Paint>) -> Join {\\n\\n paint_ptr.with_not_null_return(Join::Miter, |paint| paint.stroke_join())\\n\\n}\\n\\n\\n\",\n \"file_path\": \"library/src/paint.rs\",\n \"rank\": 42,\n \"score\": 275154.7382000444\n },\n {\n \"content\": \"#[no_mangle]\\n\\npub fn skia_paint_get_stroke_cap(paint_ptr: *mut ValueBox<Paint>) -> Cap {\\n\\n paint_ptr.with_not_null_return(Cap::Butt, |paint| paint.stroke_cap())\\n\\n}\\n\\n\\n\",\n \"file_path\": \"library/src/paint.rs\",\n \"rank\": 43,\n \"score\": 275154.7382000444\n },\n {\n \"content\": \"#[no_mangle]\\n\\npub fn skia_path_effect_corner(radius: scalar) -> *mut ValueBox<PathEffect> {\\n\\n match PathEffect::corner_path(radius) {\\n\\n None => std::ptr::null_mut(),\\n\\n Some(effect) => ValueBox::new(effect).into_raw(),\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"library/src/path_effect.rs\",\n \"rank\": 44,\n \"score\": 274621.81902564975\n },\n {\n \"content\": \"#[no_mangle]\\n\\npub fn skia_paint_get_blend_mode(paint_ptr: *mut ValueBox<Paint>) -> BlendMode {\\n\\n paint_ptr.with_not_null_return(BlendMode::Clear, |paint| paint.blend_mode())\\n\\n}\\n\\n\\n\",\n \"file_path\": \"library/src/paint.rs\",\n \"rank\": 45,\n \"score\": 273627.96927938616\n },\n {\n \"content\": \"#[no_mangle]\\n\\npub fn skia_paint_set_dither(paint_ptr: *mut ValueBox<Paint>, dither: bool) {\\n\\n paint_ptr.with_not_null(|paint| {\\n\\n paint.set_dither(dither);\\n\\n });\\n\\n}\\n\\n\\n\",\n \"file_path\": \"library/src/paint.rs\",\n \"rank\": 46,\n \"score\": 271550.3516384198\n },\n {\n \"content\": \"#[no_mangle]\\n\\npub fn skia_paint_set_alpha_f(paint_ptr: *mut ValueBox<Paint>, alpha: f32) {\\n\\n paint_ptr.with_not_null(|paint| {\\n\\n paint.set_alpha_f(alpha);\\n\\n });\\n\\n}\\n\\n\\n\",\n \"file_path\": \"library/src/paint.rs\",\n \"rank\": 47,\n \"score\": 271550.3516384198\n },\n {\n \"content\": \"#[no_mangle]\\n\\npub fn skia_paint_set_style(paint_ptr: *mut ValueBox<Paint>, style: Style) {\\n\\n paint_ptr.with_not_null(|paint| {\\n\\n paint.set_style(style);\\n\\n });\\n\\n}\\n\\n\\n\",\n \"file_path\": \"library/src/paint.rs\",\n \"rank\": 48,\n \"score\": 271550.3516384198\n },\n {\n \"content\": \"#[no_mangle]\\n\\npub fn skia_rounded_rectangle_default() -> *mut ValueBox<RRect> {\\n\\n ValueBox::new(RRect::default()).into_raw()\\n\\n}\\n\\n\\n\",\n \"file_path\": \"library/src/rounded_rectangle.rs\",\n \"rank\": 49,\n \"score\": 271388.0654397147\n },\n {\n \"content\": \"#[no_mangle]\\n\\npub fn skia_paint_set_anti_alias(paint_ptr: *mut ValueBox<Paint>, anti_alias: bool) {\\n\\n paint_ptr.with_not_null(|paint| {\\n\\n paint.set_anti_alias(anti_alias);\\n\\n });\\n\\n}\\n\\n\\n\",\n \"file_path\": \"library/src/paint.rs\",\n \"rank\": 50,\n \"score\": 268531.82449018396\n },\n {\n \"content\": \"#[no_mangle]\\n\\npub fn skia_paint_set_stroke_join(paint_ptr: *mut ValueBox<Paint>, stroke_join: Join) {\\n\\n paint_ptr.with_not_null(|paint| {\\n\\n paint.set_stroke_join(stroke_join);\\n\\n });\\n\\n}\\n\\n\\n\",\n \"file_path\": \"library/src/paint.rs\",\n \"rank\": 51,\n \"score\": 268531.82449018396\n },\n {\n \"content\": \"#[no_mangle]\\n\\npub fn skia_paint_set_stroke_cap(paint_ptr: *mut ValueBox<Paint>, stroke_cap: Cap) {\\n\\n paint_ptr.with_not_null(|paint| {\\n\\n paint.set_stroke_cap(stroke_cap);\\n\\n });\\n\\n}\\n\\n\\n\",\n \"file_path\": \"library/src/paint.rs\",\n \"rank\": 52,\n \"score\": 268531.82449018396\n },\n {\n \"content\": \"#[no_mangle]\\n\\npub fn skia_paint_set_blend_mode(paint_ptr: *mut ValueBox<Paint>, blend_mode: BlendMode) {\\n\\n paint_ptr.with_not_null(|paint| {\\n\\n paint.set_blend_mode(blend_mode);\\n\\n });\\n\\n}\\n\\n\\n\",\n \"file_path\": \"library/src/paint.rs\",\n \"rank\": 53,\n \"score\": 267073.803250864\n },\n {\n \"content\": \"#[no_mangle]\\n\\npub fn skia_matrix_drop(ptr: &mut *mut ValueBox<Matrix>) {\\n\\n drop!(ptr);\\n\\n}\\n\",\n \"file_path\": \"library/src/matrix.rs\",\n \"rank\": 54,\n \"score\": 259719.44359709113\n },\n {\n \"content\": \"#[no_mangle]\\n\\npub fn skia_color_array_get_data(_ptr: *mut ValueBox<BoxerArray<Color>>) -> *mut Color {\\n\\n BoxerArray::<Color>::boxer_array_get_data(_ptr)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"library/src/color.rs\",\n \"rank\": 55,\n \"score\": 259388.34593731345\n },\n {\n \"content\": \"#[no_mangle]\\n\\npub fn skia_path_drop(ptr: &mut *mut ValueBox<Path>) {\\n\\n drop!(ptr);\\n\\n}\\n\",\n \"file_path\": \"library/src/path.rs\",\n \"rank\": 56,\n \"score\": 259339.98405077815\n },\n {\n \"content\": \"#[no_mangle]\\n\\npub fn skia_color_drop(ptr: &mut *mut ValueBox<Color>) {\\n\\n drop!(ptr);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"library/src/color.rs\",\n \"rank\": 57,\n \"score\": 259121.23860196728\n },\n {\n \"content\": \"#[no_mangle]\\n\\npub fn skia_paint_drop(ptr: &mut *mut ValueBox<Paint>) {\\n\\n drop!(ptr);\\n\\n}\\n\",\n \"file_path\": \"library/src/paint.rs\",\n \"rank\": 58,\n \"score\": 258996.1595129512\n },\n {\n \"content\": \"#[no_mangle]\\n\\npub fn skia_image_get_color_space(image_ptr: *mut ValueBox<Image>) -> *mut ValueBox<ColorSpace> {\\n\\n image_ptr.with(\\n\\n || ValueBox::new(ColorSpace::new_srgb()).into_raw(),\\n\\n |image| ValueBox::new(image.color_space()).into_raw(),\\n\\n )\\n\\n}\\n\\n\\n\",\n \"file_path\": \"library/src/image.rs\",\n \"rank\": 59,\n \"score\": 258887.04107434466\n },\n {\n \"content\": \"#[no_mangle]\\n\\npub fn skia_rounded_rectangle_get_type(rounded_rectangle_ptr: *mut ValueBox<RRect>) -> Type {\\n\\n rounded_rectangle_ptr.with_not_null_return(Type::Empty, |rounded_rectangle| {\\n\\n rounded_rectangle.get_type()\\n\\n })\\n\\n}\\n\\n\\n\",\n \"file_path\": \"library/src/rounded_rectangle.rs\",\n \"rank\": 60,\n \"score\": 254459.8276370598\n },\n {\n \"content\": \"#[no_mangle]\\n\\npub fn skia_color_array_drop(ptr: &mut *mut ValueBox<BoxerArray<Color>>) {\\n\\n drop!(ptr);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"library/src/color.rs\",\n \"rank\": 61,\n \"score\": 252077.36794904165\n },\n {\n \"content\": \"#[no_mangle]\\n\\npub fn skia_font_metrics_get_top(font_metrics_ptr: *mut ValueBox<FontMetrics>) -> scalar {\\n\\n font_metrics_ptr.with_not_null_return(0.0, |metrics| metrics.top)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"library/src/text/font_metrics.rs\",\n \"rank\": 62,\n \"score\": 251784.9339909238\n },\n {\n \"content\": \"#[no_mangle]\\n\\npub fn skia_font_metrics_get_bottom(font_metrics_ptr: *mut ValueBox<FontMetrics>) -> scalar {\\n\\n font_metrics_ptr.with_not_null_return(0.0, |metrics| metrics.bottom)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"library/src/text/font_metrics.rs\",\n \"rank\": 63,\n \"score\": 251784.9339909238\n },\n {\n \"content\": \"#[no_mangle]\\n\\npub fn skia_path_new() -> *mut ValueBox<Path> {\\n\\n ValueBox::new(Path::new()).into_raw()\\n\\n}\\n\\n\\n\",\n \"file_path\": \"library/src/path.rs\",\n \"rank\": 64,\n \"score\": 251328.12541282334\n },\n {\n \"content\": \"#[no_mangle]\\n\\npub fn skia_color_default() -> *mut ValueBox<Color> {\\n\\n ValueBox::new(Color::default()).into_raw()\\n\\n}\\n\\n\\n\",\n \"file_path\": \"library/src/color.rs\",\n \"rank\": 65,\n \"score\": 251103.41922756511\n },\n {\n \"content\": \"#[no_mangle]\\n\\npub fn skia_paint_default() -> *mut ValueBox<Paint> {\\n\\n ValueBox::new(Paint::default()).into_raw()\\n\\n}\\n\\n\\n\",\n \"file_path\": \"library/src/paint.rs\",\n \"rank\": 66,\n \"score\": 250966.2485325088\n },\n {\n \"content\": \"#[no_mangle]\\n\\npub fn skia_matrix_new_identity() -> *mut ValueBox<Matrix> {\\n\\n ValueBox::new(Matrix::new_identity()).into_raw()\\n\\n}\\n\\n\\n\",\n \"file_path\": \"library/src/matrix.rs\",\n \"rank\": 67,\n \"score\": 249930.47899466974\n },\n {\n \"content\": \"#[no_mangle]\\n\\npub fn skia_image_get_color_type(image_ptr: *mut ValueBox<Image>) -> ColorType {\\n\\n image_ptr.with_not_null_return(ColorType::Unknown, |image| image.color_type())\\n\\n}\\n\\n\\n\",\n \"file_path\": \"library/src/image.rs\",\n \"rank\": 68,\n \"score\": 249189.13885347525\n },\n {\n \"content\": \"#[no_mangle]\\n\\npub fn skia_path_close(path_ptr: *mut ValueBox<Path>) {\\n\\n path_ptr.with_not_null(|path| {\\n\\n path.close();\\n\\n });\\n\\n}\\n\\n\\n\",\n \"file_path\": \"library/src/path.rs\",\n \"rank\": 69,\n \"score\": 247340.70248705026\n },\n {\n \"content\": \"#[no_mangle]\\n\\npub fn skia_rectangle_f32_drop(ptr: &mut *mut ValueBox<Rect>) {\\n\\n drop!(ptr);\\n\\n}\\n\\n\\n\\n///\\n\\n/// IRect\\n\\n///\\n\\n\\n\",\n \"file_path\": \"library/src/rectangle.rs\",\n \"rank\": 71,\n \"score\": 243831.76441793705\n },\n {\n \"content\": \"#[no_mangle]\\n\\npub fn skia_color_array_default() -> *mut ValueBox<BoxerArray<Color>> {\\n\\n ValueBox::new(BoxerArray::new()).into_raw()\\n\\n}\\n\\n\\n\",\n \"file_path\": \"library/src/color.rs\",\n \"rank\": 72,\n \"score\": 242981.0681549788\n },\n {\n \"content\": \"#[no_mangle]\\n\\npub fn skia_picture_cull_rect(picture_ptr: *mut ValueBox<Picture>) -> *mut ValueBox<Rect> {\\n\\n picture_ptr.with_not_null_return(std::ptr::null_mut(), |picture| {\\n\\n ValueBox::new(picture.cull_rect()).into_raw()\\n\\n })\\n\\n}\\n\\n\\n\",\n \"file_path\": \"library/src/picture.rs\",\n \"rank\": 74,\n \"score\": 242505.1076380842\n },\n {\n \"content\": \"#[no_mangle]\\n\\npub fn skia_image_info_get_color_type(image_info_ptr: *mut ValueBox<ImageInfo>) -> ColorType {\\n\\n image_info_ptr.with_not_null_return(ColorType::Unknown, |image_info| image_info.color_type())\\n\\n}\\n\\n\\n\",\n \"file_path\": \"library/src/image_info.rs\",\n \"rank\": 75,\n \"score\": 241917.3655616021\n },\n {\n \"content\": \"#[no_mangle]\\n\\npub fn skia_color_create_argb(argb: u32) -> *mut ValueBox<Color> {\\n\\n ValueBox::new(Color::new(argb)).into_raw()\\n\\n}\\n\\n\\n\",\n \"file_path\": \"library/src/color.rs\",\n \"rank\": 77,\n \"score\": 240256.2995523252\n },\n {\n \"content\": \"#[no_mangle]\\n\\npub fn skia_paragraph_decoration_get_color(ptr: *mut ValueBox<Decoration>) -> *mut ValueBox<Color> {\\n\\n ptr.with_not_null_return(std::ptr::null_mut(), |decoration| {\\n\\n ValueBox::new(decoration.color).into_raw()\\n\\n })\\n\\n}\\n\\n\\n\",\n \"file_path\": \"library/src/paragraph/paragraph_decoration.rs\",\n \"rank\": 78,\n \"score\": 239212.36523740325\n },\n {\n \"content\": \"#[no_mangle]\\n\\npub fn skia_path_get_fill_type(path_ptr: *mut ValueBox<Path>) -> PathFillType {\\n\\n path_ptr.with_not_null_return(PathFillType::Winding, |path| path.fill_type())\\n\\n}\\n\\n\\n\",\n \"file_path\": \"library/src/path.rs\",\n \"rank\": 79,\n \"score\": 238562.9562497308\n },\n {\n \"content\": \"#[no_mangle]\\n\\npub fn skia_rectangle_f32_default() -> *mut ValueBox<Rect> {\\n\\n ValueBox::new(Rect::default()).into_raw()\\n\\n}\\n\\n\\n\",\n \"file_path\": \"library/src/rectangle.rs\",\n \"rank\": 81,\n \"score\": 236051.1408301882\n },\n {\n \"content\": \"#[no_mangle]\\n\\npub fn skia_path_set_fill_type(path_ptr: *mut ValueBox<Path>, fill_type: PathFillType) {\\n\\n path_ptr.with_not_null(|path| {\\n\\n path.set_fill_type(fill_type);\\n\\n });\\n\\n}\\n\\n\\n\",\n \"file_path\": \"library/src/path.rs\",\n \"rank\": 82,\n \"score\": 233185.97893230774\n },\n {\n \"content\": \"#[no_mangle]\\n\\npub fn skia_color_array_get_capacity(_ptr: *mut ValueBox<BoxerArray<Color>>) -> usize {\\n\\n BoxerArray::<Color>::boxer_array_get_capacity(_ptr)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"library/src/color.rs\",\n \"rank\": 83,\n \"score\": 232834.90142229828\n },\n {\n \"content\": \"#[no_mangle]\\n\\npub fn skia_color_array_get_length(_ptr: *mut ValueBox<BoxerArray<Color>>) -> usize {\\n\\n BoxerArray::<Color>::boxer_array_get_length(_ptr)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"library/src/color.rs\",\n \"rank\": 84,\n \"score\": 232834.90142229828\n },\n {\n \"content\": \"#[no_mangle]\\n\\npub fn skia_rectangle_i32_right(rectangle_ptr: *mut ValueBox<IRect>) -> i32 {\\n\\n rectangle_ptr.with_not_null_return(0, |rectangle| rectangle.right())\\n\\n}\\n\\n\\n\",\n \"file_path\": \"library/src/rectangle.rs\",\n \"rank\": 88,\n \"score\": 227399.45273958126\n },\n {\n \"content\": \"#[no_mangle]\\n\\npub fn skia_rectangle_i32_left(rectangle_ptr: *mut ValueBox<IRect>) -> i32 {\\n\\n rectangle_ptr.with_not_null_return(0, |rectangle| rectangle.left())\\n\\n}\\n\\n\\n\",\n \"file_path\": \"library/src/rectangle.rs\",\n \"rank\": 89,\n \"score\": 227399.45273958126\n },\n {\n \"content\": \"#[no_mangle]\\n\\npub fn skia_rectangle_i32_bottom(rectangle_ptr: *mut ValueBox<IRect>) -> i32 {\\n\\n rectangle_ptr.with_not_null_return(0, |rectangle| rectangle.bottom())\\n\\n}\\n\\n\\n\",\n \"file_path\": \"library/src/rectangle.rs\",\n \"rank\": 90,\n \"score\": 227390.28044390577\n },\n {\n \"content\": \"#[no_mangle]\\n\\npub fn skia_rectangle_i32_top(rectangle_ptr: *mut ValueBox<IRect>) -> i32 {\\n\\n rectangle_ptr.with_not_null_return(0, |rectangle| rectangle.top())\\n\\n}\\n\\n\\n\",\n \"file_path\": \"library/src/rectangle.rs\",\n \"rank\": 91,\n \"score\": 227390.28044390577\n },\n {\n \"content\": \"#[no_mangle]\\n\\npub fn skia_image_drop(ptr: &mut *mut ValueBox<Image>) {\\n\\n drop!(ptr);\\n\\n}\\n\",\n \"file_path\": \"library/src/image.rs\",\n \"rank\": 93,\n \"score\": 223024.40391193674\n },\n {\n \"content\": \"#[no_mangle]\\n\\npub fn skia_font_get_spacing(font_ptr: *mut ValueBox<Font>) -> scalar {\\n\\n font_ptr.with_not_null_return(0.0, |font| font.spacing())\\n\\n}\\n\\n\\n\",\n \"file_path\": \"library/src/text/font.rs\",\n \"rank\": 94,\n \"score\": 222312.1558729034\n },\n {\n \"content\": \"#[no_mangle]\\n\\npub fn skia_font_get_scale_x(font_ptr: *mut ValueBox<Font>) -> scalar {\\n\\n font_ptr.with_not_null_return(0.0, |font| font.scale_x())\\n\\n}\\n\\n\\n\",\n \"file_path\": \"library/src/text/font.rs\",\n \"rank\": 95,\n \"score\": 222312.1558729034\n },\n {\n \"content\": \"#[no_mangle]\\n\\npub fn skia_font_get_size(font_ptr: *mut ValueBox<Font>) -> scalar {\\n\\n font_ptr.with_not_null_return(0.0, |font| font.size())\\n\\n}\\n\\n\\n\",\n \"file_path\": \"library/src/text/font.rs\",\n \"rank\": 96,\n \"score\": 222312.1558729034\n },\n {\n \"content\": \"#[no_mangle]\\n\\npub fn skia_font_get_skew_x(font_ptr: *mut ValueBox<Font>) -> scalar {\\n\\n font_ptr.with_not_null_return(0.0, |font| font.skew_x())\\n\\n}\\n\\n\\n\",\n \"file_path\": \"library/src/text/font.rs\",\n \"rank\": 97,\n \"score\": 222312.1558729034\n },\n {\n \"content\": \"#[no_mangle]\\n\\npub fn skia_paragraph_get_height(paragraph_ptr: *mut ValueBox<ParagraphWithText>) -> scalar {\\n\\n paragraph_ptr.with_not_null_return(0.0, |paragraph| paragraph.height())\\n\\n}\\n\\n\\n\",\n \"file_path\": \"library/src/paragraph/paragraph.rs\",\n \"rank\": 98,\n \"score\": 220554.01238260325\n },\n {\n \"content\": \"#[no_mangle]\\n\\npub fn skia_paragraph_decoration_get_thickness(ptr: *mut ValueBox<Decoration>) -> scalar {\\n\\n ptr.with_not_null_return(0.0, |decoration| decoration.thickness_multiplier)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"library/src/paragraph/paragraph_decoration.rs\",\n \"rank\": 99,\n \"score\": 220554.01238260325\n }\n]","isConversational":false}}},{"rowIdx":2378,"cells":{"lang":{"kind":"string","value":"Rust"},"file_path":{"kind":"string","value":"src/strencrypt.rs"},"repo_name":{"kind":"string","value":"JohnAgapeyev/R2D2"},"commit":{"kind":"string","value":"bc2ca7143844fe82b4ecc3e221de667a8bb5b3b4"},"file_code":{"kind":"string","value":"use quote::*;\nuse syn::spanned::Spanned;\nuse syn::visit_mut::*;\nuse syn::*;\n\nuse crate::crypto::*;\nuse crate::parse::*;\n\n#[allow(unused_imports)]\nuse crate as r2d2;\n\nstruct MemEncCtx {\n ctx: MemoryEncryptionCtx<XChaCha20Poly1305>,\n needs_owned_str: bool,\n}\n\nimpl ToTokens for MemEncCtx {\n fn to_tokens(&self, tokens: &mut proc_macro2::TokenStream) {\n let key = &self.ctx.key;\n let nonce = &self.ctx.nonce;\n let ciphertext = &self.ctx.ciphertext;\n let output: proc_macro2::TokenStream;\n\n if self.needs_owned_str {\n /*\n * let x = \"foobar\";\n * println!(\"{}\", x);\n *\n * This snippet requires special handling since the temporary decrypted string goes out\n * of scope after decryption, so we need to return a string object rather than a &str\n * This could theoretically still have issues with explicit typing, but we'll cross\n * that bridge when we get there\n */\n output = quote! {\n let result = r2d2::crypto::decrypt_memory::<r2d2::crypto::chacha20poly1305::XChaCha20Poly1305>(r2d2::crypto::MemoryEncryptionCtx {\n key: (r2d2::generic_array::arr![u8; #(#key),*]) as r2d2::crypto::aead::Key::<r2d2::crypto::chacha20poly1305::XChaCha20Poly1305>,\n nonce: (r2d2::generic_array::arr![u8; #(#nonce),*]) as r2d2::crypto::aead::Nonce::<r2d2::crypto::chacha20poly1305::XChaCha20Poly1305>,\n ciphertext: ::std::vec![#(#ciphertext),*],\n });\n ::std::string::String::from_utf8(result).unwrap()\n };\n } else {\n output = quote! {\n let result = r2d2::crypto::decrypt_memory::<r2d2::crypto::chacha20poly1305::XChaCha20Poly1305>(r2d2::crypto::MemoryEncryptionCtx {\n key: (r2d2::generic_array::arr![u8; #(#key),*]) as r2d2::crypto::aead::Key::<r2d2::crypto::chacha20poly1305::XChaCha20Poly1305>,\n nonce: (r2d2::generic_array::arr![u8; #(#nonce),*]) as r2d2::crypto::aead::Nonce::<r2d2::crypto::chacha20poly1305::XChaCha20Poly1305>,\n ciphertext: ::std::vec![#(#ciphertext),*],\n });\n ::std::string::String::from_utf8(result).unwrap().as_str()\n };\n }\n\n tokens.append_all(output);\n }\n}\n\nstruct StrReplace;\n\n/*\n * The choice of Self::visit_*_mut vs visit_mut::visit_*_mut is important here\n * Some choices will result in breakage by not encrypting\n * Others will create a recursive loop exhausting the stack\n *\n * NOTE: DO NOT MODIFY WITHOUT TESTING AND VERIFICATION\n */\nimpl VisitMut for StrReplace {\n fn visit_macro_mut(&mut self, node: &mut Macro) {\n let macro_path = node\n .path\n .get_ident()\n .map(|ident| ident.to_string())\n .unwrap_or_default();\n let mut can_encrypt = match macro_path.as_str() {\n \"println\" => true,\n \"eprintln\" => true,\n \"format\" => true,\n \"concat\" => true,\n _ => false,\n };\n\n \n if !can_encrypt {\n visit_mut::visit_macro_mut(self, node);\n return;\n }\n\n if let Ok(mut parsed) = node.parse_body::<FormatArgs>() {\n if let Lit::Str(s) = &parsed.format_string.lit {\n if s.value().contains(\"{\") {\n \n can_encrypt = false;\n }\n } else {\n panic!(\"Format string is not a string literal!\");\n }\n\n if parsed.positional_args.is_empty() && parsed.named_args.is_empty() && can_encrypt {\n \n let span = parsed.format_string.span();\n\n \n parsed\n .positional_args\n .push(Expr::Lit(parsed.format_string.to_owned()));\n\n \n parsed.format_string = ExprLit {\n attrs: Vec::new(),\n lit: Lit::Str(LitStr::new(\"{}\", span)),\n };\n\n Self::visit_expr_mut(self, &mut parsed.positional_args[0]);\n } else {\n parsed\n .positional_args\n .iter_mut()\n .for_each(|mut e| Self::visit_expr_mut(self, &mut e));\n }\n node.tokens = parsed.to_token_stream();\n }\n \n visit_mut::visit_macro_mut(self, node);\n }\n\n fn visit_expr_mut(&mut self, node: &mut Expr) {\n /*\n * Skip function call expressions\n * This is a case of lifetime scoping problems\n * Given a function foo(\"hello\"), only a String type would support decryption\n * If the function takes a &str, the temporary will go out of scope and fail to compile\n * I'm not about to become a linker, so this has to be skipped\n * Best case is to limit/audit string literals to prevent this case\n */\n let must_skip = match &node {\n Expr::Call(_) => true,\n Expr::MethodCall(_) => true,\n _ => false,\n };\n\n if must_skip {\n return;\n }\n\n if let Expr::Lit(expr) = &node {\n if let Lit::Str(s) = &expr.lit {\n let mem_ctx = MemEncCtx {\n ctx: encrypt_memory::<XChaCha20Poly1305>(s.value().as_bytes()),\n needs_owned_str: false,\n };\n let output = quote! {\n {\n #mem_ctx\n }\n };\n let output = syn::parse2::<ExprBlock>(output).unwrap();\n *node = Expr::Block(output);\n return;\n } else if let Lit::ByteStr(s) = &expr.lit {\n let mem_ctx = MemEncCtx {\n ctx: encrypt_memory::<XChaCha20Poly1305>(&s.value()),\n needs_owned_str: false,\n };\n let output = quote! {\n {\n #mem_ctx\n }\n };\n let output = syn::parse2::<ExprBlock>(output).unwrap();\n *node = Expr::Block(output);\n return;\n }\n }\n \n visit_mut::visit_expr_mut(self, node);\n }\n\n fn visit_arm_mut(&mut self, node: &mut Arm) {\n \n Self::visit_expr_mut(self, &mut node.body);\n }\n\n fn visit_item_const_mut(&mut self, _node: &mut ItemConst) {\n /*\n * Skip all constant expressions since we can't decrypt those\n * Function intentionally left blank\n */\n }\n\n fn visit_local_mut(&mut self, node: &mut Local) {\n if let Some(init) = &node.init {\n if let Expr::Lit(expr) = &*init.1 {\n if let Lit::Str(s) = &expr.lit {\n /*\n * Skip let assignments with an explicit reference type\n * This is fine for string literals due to static lifetime\n * Decryption doesn't have a static lifetime, so an explicit reference storage\n * will run into object lifetime issues\n */\n if let Pat::Type(ty) = &node.pat {\n if let Type::Reference(_) = *ty.ty {\n return;\n }\n }\n\n let mem_ctx = MemEncCtx {\n ctx: encrypt_memory::<XChaCha20Poly1305>(s.value().as_bytes()),\n needs_owned_str: true,\n };\n let output = quote! {\n {\n #mem_ctx\n }\n };\n let output = syn::parse2::<ExprBlock>(output).unwrap();\n node.init = Some((init.0, Box::new(Expr::Block(output))));\n return;\n }\n }\n }\n }\n}\n\npub fn encrypt_strings(input: &mut File) {\n StrReplace.visit_file_mut(input);\n}\n"},"prefix":{"kind":"string","value":"use quote::*;\nuse syn::spanned::Spanned;\nuse syn::visit_mut::*;\nuse syn::*;\n\nuse crate::crypto::*;\nuse crate::parse::*;\n\n#[allow(unused_imports)]\nuse crate as r2d2;\n\nstruct MemEncCtx {\n ctx: MemoryEncryptionCtx<XChaCha20Poly1305>,\n needs_owned_str: bool,\n}\n\nimpl ToTokens for MemEncCtx {\n fn to_tokens(&self, tokens: &mut proc_macro2::TokenStream) {\n let key = &self.ctx.key;\n let nonce = &self.ctx.nonce;\n let ciphertext = &self.ctx.ciphertext;\n let output: proc_macro2::TokenStream;\n\n if self.needs_owned_str {\n /*\n * let x = \"foobar\";\n * println!(\"{}\", x);\n *\n * This snippet requires special handling since the temporary decrypted string goes out\n * of scope after decryption, so we need to return a string object rather than a &str\n * This could theoretically still have issues with explicit typing, but we'll cross\n * that bridge when we get there\n */\n output = quote! {\n let result = r2d2::crypto::decrypt_memory::<r2d2::crypto::chacha20poly1305::XChaCha20Poly1305>(r2d2::crypto::MemoryEncryptionCtx {\n key: (r2d2::generic_array::arr![u8; #(#key),*]) as r2d2::crypto::aead::Key::<r2d2::crypto::chacha20poly1305::XChaCha20Poly1305>,\n nonce: (r2d2::generic_array::arr![u8; #(#nonce),*]) as r2d2::crypto::aead::Nonce::<r2d2::crypto::chacha20poly1305::XChaCha20Poly1305>,\n ciphertext: ::std::vec![#(#ciphertext),*],\n });\n ::std::string::String::from_utf8(result).unwrap()\n };\n } else {\n output = quote! {\n let result = r2d2::crypto::decrypt_memory::<r2d2::crypto::chacha20poly1305::XChaCha20Poly1305>(r2d2::crypto::MemoryEncryptionCtx {\n key: (r2d2::generic_array::arr![u8; #(#key),*]) as r2d2::crypto::aead::Key::<r2d2::crypto::chacha20poly1305::XChaCha20Poly1305>,\n nonce: (r2d2::generic_array::arr![u8; #(#nonce),*]) as r2d2::crypto::aead::Nonce::<r2d2::crypto::chacha20poly1305::XChaCha20Poly1305>,\n ciphertext: ::std::vec![#(#ciphertext),*],\n });\n ::std::string::String::from_utf8(result).unwrap().as_str()\n };\n }\n\n tokens.append_all(output);\n }\n}\n\nstruct StrReplace;\n\n/*\n * The choice of Self::visit_*_mut vs visit_mut::visit_*_mut is important here\n * Some choices will result in breakage by not encrypting\n * Others will create a recursive loop exhausting the stack\n *\n * NOTE: DO NOT MODIFY WITHOUT TESTING AND VERIFICATION\n */\nimpl VisitMut for StrReplace {\n "},"suffix":{"kind":"string","value":"\n\n fn visit_expr_mut(&mut self, node: &mut Expr) {\n /*\n * Skip function call expressions\n * This is a case of lifetime scoping problems\n * Given a function foo(\"hello\"), only a String type would support decryption\n * If the function takes a &str, the temporary will go out of scope and fail to compile\n * I'm not about to become a linker, so this has to be skipped\n * Best case is to limit/audit string literals to prevent this case\n */\n let must_skip = match &node {\n Expr::Call(_) => true,\n Expr::MethodCall(_) => true,\n _ => false,\n };\n\n if must_skip {\n return;\n }\n\n if let Expr::Lit(expr) = &node {\n if let Lit::Str(s) = &expr.lit {\n let mem_ctx = MemEncCtx {\n ctx: encrypt_memory::<XChaCha20Poly1305>(s.value().as_bytes()),\n needs_owned_str: false,\n };\n let output = quote! {\n {\n #mem_ctx\n }\n };\n let output = syn::parse2::<ExprBlock>(output).unwrap();\n *node = Expr::Block(output);\n return;\n } else if let Lit::ByteStr(s) = &expr.lit {\n let mem_ctx = MemEncCtx {\n ctx: encrypt_memory::<XChaCha20Poly1305>(&s.value()),\n needs_owned_str: false,\n };\n let output = quote! {\n {\n #mem_ctx\n }\n };\n let output = syn::parse2::<ExprBlock>(output).unwrap();\n *node = Expr::Block(output);\n return;\n }\n }\n \n visit_mut::visit_expr_mut(self, node);\n }\n\n fn visit_arm_mut(&mut self, node: &mut Arm) {\n \n Self::visit_expr_mut(self, &mut node.body);\n }\n\n fn visit_item_const_mut(&mut self, _node: &mut ItemConst) {\n /*\n * Skip all constant expressions since we can't decrypt those\n * Function intentionally left blank\n */\n }\n\n fn visit_local_mut(&mut self, node: &mut Local) {\n if let Some(init) = &node.init {\n if let Expr::Lit(expr) = &*init.1 {\n if let Lit::Str(s) = &expr.lit {\n /*\n * Skip let assignments with an explicit reference type\n * This is fine for string literals due to static lifetime\n * Decryption doesn't have a static lifetime, so an explicit reference storage\n * will run into object lifetime issues\n */\n if let Pat::Type(ty) = &node.pat {\n if let Type::Reference(_) = *ty.ty {\n return;\n }\n }\n\n let mem_ctx = MemEncCtx {\n ctx: encrypt_memory::<XChaCha20Poly1305>(s.value().as_bytes()),\n needs_owned_str: true,\n };\n let output = quote! {\n {\n #mem_ctx\n }\n };\n let output = syn::parse2::<ExprBlock>(output).unwrap();\n node.init = Some((init.0, Box::new(Expr::Block(output))));\n return;\n }\n }\n }\n }\n}\n\npub fn encrypt_strings(input: &mut File) {\n StrReplace.visit_file_mut(input);\n}\n"},"middle":{"kind":"string","value":"fn visit_macro_mut(&mut self, node: &mut Macro) {\n let macro_path = node\n .path\n .get_ident()\n .map(|ident| ident.to_string())\n .unwrap_or_default();\n let mut can_encrypt = match macro_path.as_str() {\n \"println\" => true,\n \"eprintln\" => true,\n \"format\" => true,\n \"concat\" => true,\n _ => false,\n };\n\n \n if !can_encrypt {\n visit_mut::visit_macro_mut(self, node);\n return;\n }\n\n if let Ok(mut parsed) = node.parse_body::<FormatArgs>() {\n if let Lit::Str(s) = &parsed.format_string.lit {\n if s.value().contains(\"{\") {\n \n can_encrypt = false;\n }\n } else {\n panic!(\"Format string is not a string literal!\");\n }\n\n if parsed.positional_args.is_empty() && parsed.named_args.is_empty() && can_encrypt {\n \n let span = parsed.format_string.span();\n\n \n parsed\n .positional_args\n .push(Expr::Lit(parsed.format_string.to_owned()));\n\n \n parsed.format_string = ExprLit {\n attrs: Vec::new(),\n lit: Lit::Str(LitStr::new(\"{}\", span)),\n };\n\n Self::visit_expr_mut(self, &mut parsed.positional_args[0]);\n } else {\n parsed\n .positional_args\n .iter_mut()\n .for_each(|mut e| Self::visit_expr_mut(self, &mut e));\n }\n node.tokens = parsed.to_token_stream();\n }\n \n visit_mut::visit_macro_mut(self, node);\n }"},"strategy":{"kind":"string","value":"function_block-full_function"},"context_items":{"kind":"list like","value":[{"content":"fn is_shuffle_attr(attr: &str) -> bool {\n\n match attr {\n\n SHUFFLE_ATTR_NAME => true,\n\n _ => false,\n\n }\n\n}\n\n\n","file_path":"src/shuffle.rs","rank":1,"score":200775.69576019843},{"content":"/// Render a sparkline of `data` into `buffer`.\n\npub fn render_f64(data: &[f64], buffer: &mut String) {\n\n match data.len() {\n\n 0 => {\n\n return;\n\n },\n\n 1 => {\n\n if data[0] == 0. {\n\n buffer.push(TICKS[0]);\n\n } else {\n\n buffer.push(TICKS[N - 1]);\n\n }\n\n return;\n\n },\n\n _ => {},\n\n }\n\n for x in data {\n\n assert!(x.is_finite(), \"can only render finite values\");\n\n }\n\n let max = data.iter().fold(\n\n core::f64::NEG_INFINITY, |a, &b| a.max(b));\n\n let min = data.iter().fold(\n\n core::f64::INFINITY, |a, &b| a.min(b));\n\n let scale = ((N - 1) as f64) / (max - min);\n\n for x in data {\n\n let tick = ((x - min) * scale) as usize;\n\n buffer.push(TICKS[tick]);\n\n }\n\n}\n\n\n","file_path":"tests/complex/rand/rand_distr/tests/sparkline.rs","rank":2,"score":199403.9762400479},{"content":"/// Render a sparkline of `data` into `buffer`.\n\npub fn render_u64(data: &[u64], buffer: &mut String) {\n\n match data.len() {\n\n 0 => {\n\n return;\n\n },\n\n 1 => {\n\n if data[0] == 0 {\n\n buffer.push(TICKS[0]);\n\n } else {\n\n buffer.push(TICKS[N - 1]);\n\n }\n\n return;\n\n },\n\n _ => {},\n\n }\n\n let max = data.iter().max().unwrap();\n\n let min = data.iter().min().unwrap();\n\n let scale = ((N - 1) as f64) / ((max - min) as f64);\n\n for i in data {\n\n let tick = (((i - min) as f64) * scale) as usize;\n\n buffer.push(TICKS[tick]);\n\n }\n\n}\n\n\n","file_path":"tests/complex/rand/rand_distr/tests/sparkline.rs","rank":3,"score":199403.9762400479},{"content":"pub fn decrypt_memory<Cipher>(ctx: MemoryEncryptionCtx<Cipher>) -> Vec<u8>\n\nwhere\n\n Cipher: NewAead,\n\n Cipher: Aead,\n\n Cipher::KeySize: IsEqual<U32, Output = True>,\n\n //TODO: Should probably redo nonce generation to be generic enough for things like AES-GCM that use 96 bit nonces\n\n Cipher::NonceSize: IsEqual<U24, Output = True>,\n\n{\n\n let cipher = Cipher::new(&ctx.key);\n\n let output = cipher\n\n .decrypt(&ctx.nonce, ctx.ciphertext.as_slice())\n\n .unwrap();\n\n //println!(\"We decrypted data: {:#x?}\", output);\n\n output\n\n}\n\n\n","file_path":"src/crypto.rs","rank":4,"score":198655.31671893373},{"content":"/// Randomly sample exactly `amount` indices from `0..length`, using rejection\n\n/// sampling.\n\n///\n\n/// Since `amount <<< length` there is a low chance of a random sample in\n\n/// `0..length` being a duplicate. We test for duplicates and resample where\n\n/// necessary. The algorithm is `O(amount)` time and memory.\n\n///\n\n/// This function is generic over X primarily so that results are value-stable\n\n/// over 32-bit and 64-bit platforms.\n\nfn sample_rejection<X: UInt, R>(rng: &mut R, length: X, amount: X) -> IndexVec\n\nwhere\n\n R: Rng + ?Sized,\n\n IndexVec: From<Vec<X>>,\n\n{\n\n debug_assert!(amount < length);\n\n #[cfg(feature = \"std\")]\n\n let mut cache = HashSet::with_capacity(amount.as_usize());\n\n #[cfg(not(feature = \"std\"))]\n\n let mut cache = BTreeSet::new();\n\n let distr = Uniform::new(X::zero(), length);\n\n let mut indices = Vec::with_capacity(amount.as_usize());\n\n for _ in 0..amount.as_usize() {\n\n let mut pos = distr.sample(rng);\n\n while !cache.insert(pos) {\n\n pos = distr.sample(rng);\n\n }\n\n indices.push(pos);\n\n }\n\n\n","file_path":"tests/complex/rand/src/seq/index.rs","rank":5,"score":196501.0072550791},{"content":"#[bench]\n\nfn misc_gen_bool_const(b: &mut Bencher) {\n\n let mut rng = Pcg32::from_rng(&mut thread_rng()).unwrap();\n\n b.iter(|| {\n\n let mut accum = true;\n\n for _ in 0..crate::RAND_BENCH_N {\n\n accum ^= rng.gen_bool(0.18);\n\n }\n\n accum\n\n })\n\n}\n\n\n","file_path":"tests/complex/rand/benches/misc.rs","rank":6,"score":189890.03344174867},{"content":"#[bench]\n\nfn misc_gen_bool_var(b: &mut Bencher) {\n\n let mut rng = Pcg32::from_rng(&mut thread_rng()).unwrap();\n\n b.iter(|| {\n\n let mut accum = true;\n\n let mut p = 0.18;\n\n for _ in 0..crate::RAND_BENCH_N {\n\n accum ^= rng.gen_bool(p);\n\n p += 0.0001;\n\n }\n\n accum\n\n })\n\n}\n\n\n","file_path":"tests/complex/rand/benches/misc.rs","rank":7,"score":189890.03344174867},{"content":"fn get_rng(seed: u64) -> impl rand::Rng {\n\n // For tests, we want a statistically good, fast, reproducible RNG.\n\n // PCG32 will do fine, and will be easy to embed if we ever need to.\n\n const INC: u64 = 11634580027462260723;\n\n rand_pcg::Pcg32::new(seed, INC)\n\n}\n\n\n","file_path":"tests/complex/rand/rand_distr/tests/value_stability.rs","rank":8,"score":181956.75139399408},{"content":"fn get_attr_name(attr: &Attribute) -> String {\n\n attr.path\n\n .get_ident()\n\n .map_or(String::new(), |ident| ident.to_string())\n\n}\n\n\n","file_path":"src/shuffle.rs","rank":9,"score":172076.52723262477},{"content":"/// Implement `fill_bytes` via `next_u64` and `next_u32`, little-endian order.\n\n///\n\n/// The fastest way to fill a slice is usually to work as long as possible with\n\n/// integers. That is why this method mostly uses `next_u64`, and only when\n\n/// there are 4 or less bytes remaining at the end of the slice it uses\n\n/// `next_u32` once.\n\npub fn fill_bytes_via_next<R: RngCore + ?Sized>(rng: &mut R, dest: &mut [u8]) {\n\n let mut left = dest;\n\n while left.len() >= 8 {\n\n let (l, r) = { left }.split_at_mut(8);\n\n left = r;\n\n let chunk: [u8; 8] = rng.next_u64().to_le_bytes();\n\n l.copy_from_slice(&chunk);\n\n }\n\n let n = left.len();\n\n if n > 4 {\n\n let chunk: [u8; 8] = rng.next_u64().to_le_bytes();\n\n left.copy_from_slice(&chunk[..n]);\n\n } else if n > 0 {\n\n let chunk: [u8; 4] = rng.next_u32().to_le_bytes();\n\n left.copy_from_slice(&chunk[..n]);\n\n }\n\n}\n\n\n","file_path":"tests/complex/rand/rand_core/src/impls.rs","rank":10,"score":167696.06562961618},{"content":"fn compile_test(path: &str) -> ExitStatus {\n\n let _lock = lock_filesystem();\n\n\n\n let config = R2D2Config {\n\n dest_name: Some(TEST_DIRECTORY),\n\n cargo_args: None,\n\n need_run: false,\n\n need_obfuscate: true,\n\n obfuscate_dir: Some(path),\n\n stream_output: false,\n\n };\n\n\n\n build(&config).unwrap()\n\n}\n\n\n","file_path":"tests/test_driver.rs","rank":11,"score":166972.15095646938},{"content":"fn functional_test(path: &str) -> ExitStatus {\n\n let _lock = lock_filesystem();\n\n\n\n let config = R2D2Config {\n\n dest_name: Some(TEST_DIRECTORY),\n\n cargo_args: None,\n\n need_run: true,\n\n need_obfuscate: true,\n\n obfuscate_dir: Some(path),\n\n stream_output: false,\n\n };\n\n\n\n build(&config).unwrap()\n\n}\n\n\n\nmod single {\n\n use crate::*;\n\n\n\n #[test]\n\n fn hello_world_compile() {\n","file_path":"tests/test_driver.rs","rank":12,"score":166972.15095646938},{"content":"/// Render a sparkline of `data` into a newly allocated string.\n\npub fn render_f64_as_string(data: &[f64]) -> String {\n\n let cap = required_capacity(data.len());\n\n let mut s = String::with_capacity(cap);\n\n render_f64(data, &mut s);\n\n debug_assert_eq!(s.capacity(), cap);\n\n s\n\n}\n\n\n\n#[cfg(test)]\n\nmod tests {\n\n #[test]\n\n fn render_u64() {\n\n let data = [2, 250, 670, 890, 2, 430, 11, 908, 123, 57];\n\n let mut s = String::with_capacity(super::required_capacity(data.len()));\n\n super::render_u64(&data, &mut s);\n\n println!(\"{}\", s);\n\n assert_eq!(\"▁▂▆▇▁▄▁█▁▁\", &s);\n\n }\n\n\n\n #[test]\n","file_path":"tests/complex/rand/rand_distr/tests/sparkline.rs","rank":13,"score":161470.10360984172},{"content":"/// Render a sparkline of `data` into a newly allocated string.\n\npub fn render_u64_as_string(data: &[u64]) -> String {\n\n let cap = required_capacity(data.len());\n\n let mut s = String::with_capacity(cap);\n\n render_u64(data, &mut s);\n\n debug_assert_eq!(s.capacity(), cap);\n\n s\n\n}\n\n\n","file_path":"tests/complex/rand/rand_distr/tests/sparkline.rs","rank":14,"score":161470.10360984172},{"content":"// Run a single simulation of the Monty Hall problem.\n\nfn simulate<R: Rng>(random_door: &Uniform<u32>, rng: &mut R) -> SimulationResult {\n\n let car = random_door.sample(rng);\n\n\n\n // This is our initial choice\n\n let mut choice = random_door.sample(rng);\n\n\n\n // The game host opens a door\n\n let open = game_host_open(car, choice, rng);\n\n\n\n // Shall we switch?\n\n let switch = rng.gen();\n\n if switch {\n\n choice = switch_door(choice, open);\n\n }\n\n\n\n SimulationResult {\n\n win: choice == car,\n\n switch,\n\n }\n\n}\n\n\n","file_path":"tests/complex/rand/examples/monty-hall.rs","rank":15,"score":157427.47716006348},{"content":"/// Implement `fill_bytes` by reading chunks from the output buffer of a block\n\n/// based RNG.\n\n///\n\n/// The return values are `(consumed_u32, filled_u8)`.\n\n///\n\n/// `filled_u8` is the number of filled bytes in `dest`, which may be less than\n\n/// the length of `dest`.\n\n/// `consumed_u32` is the number of words consumed from `src`, which is the same\n\n/// as `filled_u8 / 4` rounded up.\n\n///\n\n/// # Example\n\n/// (from `IsaacRng`)\n\n///\n\n/// ```ignore\n\n/// fn fill_bytes(&mut self, dest: &mut [u8]) {\n\n/// let mut read_len = 0;\n\n/// while read_len < dest.len() {\n\n/// if self.index >= self.rsl.len() {\n\n/// self.isaac();\n\n/// }\n\n///\n\n/// let (consumed_u32, filled_u8) =\n\n/// impls::fill_via_u32_chunks(&mut self.rsl[self.index..],\n\n/// &mut dest[read_len..]);\n\n///\n\n/// self.index += consumed_u32;\n\n/// read_len += filled_u8;\n\n/// }\n\n/// }\n\n/// ```\n\npub fn fill_via_u32_chunks(src: &[u32], dest: &mut [u8]) -> (usize, usize) {\n\n fill_via_chunks(src, dest)\n\n}\n\n\n","file_path":"tests/complex/rand/rand_core/src/impls.rs","rank":17,"score":156795.79655065638},{"content":"/// Implement `fill_bytes` by reading chunks from the output buffer of a block\n\n/// based RNG.\n\n///\n\n/// The return values are `(consumed_u64, filled_u8)`.\n\n/// `filled_u8` is the number of filled bytes in `dest`, which may be less than\n\n/// the length of `dest`.\n\n/// `consumed_u64` is the number of words consumed from `src`, which is the same\n\n/// as `filled_u8 / 8` rounded up.\n\n///\n\n/// See `fill_via_u32_chunks` for an example.\n\npub fn fill_via_u64_chunks(src: &[u64], dest: &mut [u8]) -> (usize, usize) {\n\n fill_via_chunks(src, dest)\n\n}\n\n\n","file_path":"tests/complex/rand/rand_core/src/impls.rs","rank":18,"score":156783.69864844374},{"content":"fn fill_via_chunks<T: Observable>(src: &[T], dest: &mut [u8]) -> (usize, usize) {\n\n let size = core::mem::size_of::<T>();\n\n let byte_len = min(src.len() * size, dest.len());\n\n let num_chunks = (byte_len + size - 1) / size;\n\n\n\n if cfg!(target_endian = \"little\") {\n\n // On LE we can do a simple copy, which is 25-50% faster:\n\n dest[..byte_len].copy_from_slice(&T::as_byte_slice(&src[..num_chunks])[..byte_len]);\n\n } else {\n\n // This code is valid on all arches, but slower than the above:\n\n let mut i = 0;\n\n let mut iter = dest[..byte_len].chunks_exact_mut(size);\n\n for chunk in &mut iter {\n\n chunk.copy_from_slice(src[i].to_le_bytes().as_ref());\n\n i += 1;\n\n }\n\n let chunk = iter.into_remainder();\n\n if !chunk.is_empty() {\n\n chunk.copy_from_slice(&src[i].to_le_bytes().as_ref()[..chunk.len()]);\n\n }\n\n }\n\n\n\n (num_chunks, byte_len)\n\n}\n\n\n","file_path":"tests/complex/rand/rand_core/src/impls.rs","rank":19,"score":155112.16375628894},{"content":"#[bench]\n\nfn seq_shuffle_100(b: &mut Bencher) {\n\n let mut rng = SmallRng::from_rng(thread_rng()).unwrap();\n\n let x: &mut [usize] = &mut [1; 100];\n\n b.iter(|| {\n\n x.shuffle(&mut rng);\n\n x[0]\n\n })\n\n}\n\n\n","file_path":"tests/complex/rand/benches/seq.rs","rank":20,"score":154793.50824039622},{"content":"/// Implement `next_u64` via `fill_bytes`, little-endian order.\n\npub fn next_u64_via_fill<R: RngCore + ?Sized>(rng: &mut R) -> u64 {\n\n let mut buf = [0; 8];\n\n rng.fill_bytes(&mut buf);\n\n u64::from_le_bytes(buf)\n\n}\n\n\n\n#[cfg(test)]\n\nmod test {\n\n use super::*;\n\n\n\n #[test]\n\n fn test_fill_via_u32_chunks() {\n\n let src = [1, 2, 3];\n\n let mut dst = [0u8; 11];\n\n assert_eq!(fill_via_u32_chunks(&src, &mut dst), (3, 11));\n\n assert_eq!(dst, [1, 0, 0, 0, 2, 0, 0, 0, 3, 0, 0]);\n\n\n\n let mut dst = [0u8; 13];\n\n assert_eq!(fill_via_u32_chunks(&src, &mut dst), (3, 12));\n\n assert_eq!(dst, [1, 0, 0, 0, 2, 0, 0, 0, 3, 0, 0, 0, 0]);\n","file_path":"tests/complex/rand/rand_core/src/impls.rs","rank":21,"score":154566.00033659214},{"content":"/// Implement `next_u64` via `next_u32`, little-endian order.\n\npub fn next_u64_via_u32<R: RngCore + ?Sized>(rng: &mut R) -> u64 {\n\n // Use LE; we explicitly generate one value before the next.\n\n let x = u64::from(rng.next_u32());\n\n let y = u64::from(rng.next_u32());\n\n (y << 32) | x\n\n}\n\n\n","file_path":"tests/complex/rand/rand_core/src/impls.rs","rank":22,"score":154566.00033659214},{"content":"/// Implement `next_u32` via `fill_bytes`, little-endian order.\n\npub fn next_u32_via_fill<R: RngCore + ?Sized>(rng: &mut R) -> u32 {\n\n let mut buf = [0; 4];\n\n rng.fill_bytes(&mut buf);\n\n u32::from_le_bytes(buf)\n\n}\n\n\n","file_path":"tests/complex/rand/rand_core/src/impls.rs","rank":23,"score":154566.00033659214},{"content":"// Returns the door the game host opens given our choice and knowledge of\n\n// where the car is. The game host will never open the door with the car.\n\nfn game_host_open<R: Rng>(car: u32, choice: u32, rng: &mut R) -> u32 {\n\n use rand::seq::SliceRandom;\n\n *free_doors(&[car, choice]).choose(rng).unwrap()\n\n}\n\n\n","file_path":"tests/complex/rand/examples/monty-hall.rs","rank":24,"score":153658.90607471575},{"content":"#[bench]\n\nfn misc_bernoulli_const(b: &mut Bencher) {\n\n let mut rng = Pcg32::from_rng(&mut thread_rng()).unwrap();\n\n b.iter(|| {\n\n let d = rand::distributions::Bernoulli::new(0.18).unwrap();\n\n let mut accum = true;\n\n for _ in 0..crate::RAND_BENCH_N {\n\n accum ^= rng.sample(d);\n\n }\n\n accum\n\n })\n\n}\n\n\n","file_path":"tests/complex/rand/benches/misc.rs","rank":25,"score":152408.51998363313},{"content":"#[bench]\n\nfn weighted_index_modification(b: &mut Bencher) {\n\n let mut rng = rand::thread_rng();\n\n let weights = [1u32, 2, 3, 0, 5, 6, 7, 1, 2, 3, 4, 5, 6, 7];\n\n let mut distr = WeightedIndex::new(weights.to_vec()).unwrap();\n\n b.iter(|| {\n\n distr.update_weights(&[(2, &4), (5, &1)]).unwrap();\n\n rng.sample(&distr)\n\n })\n\n}\n","file_path":"tests/complex/rand/benches/weighted.rs","rank":26,"score":152408.51998363313},{"content":"#[bench]\n\nfn seq_iter_choose_from_1000(b: &mut Bencher) {\n\n let mut rng = SmallRng::from_rng(thread_rng()).unwrap();\n\n let x: &mut [usize] = &mut [1; 1000];\n\n for (i, r) in x.iter_mut().enumerate() {\n\n *r = i;\n\n }\n\n b.iter(|| {\n\n let mut s = 0;\n\n for _ in 0..RAND_BENCH_N {\n\n s += x.iter().choose(&mut rng).unwrap();\n\n }\n\n s\n\n });\n\n b.bytes = size_of::<usize>() as u64 * crate::RAND_BENCH_N;\n\n}\n\n\n","file_path":"tests/complex/rand/benches/seq.rs","rank":27,"score":152408.51998363313},{"content":"#[bench]\n\nfn weighted_index_creation(b: &mut Bencher) {\n\n let mut rng = rand::thread_rng();\n\n let weights = [1u32, 2, 4, 0, 5, 1, 7, 1, 2, 3, 4, 5, 6, 7];\n\n b.iter(|| {\n\n let distr = WeightedIndex::new(weights.to_vec()).unwrap();\n\n rng.sample(distr)\n\n })\n\n}\n\n\n","file_path":"tests/complex/rand/benches/weighted.rs","rank":28,"score":152408.51998363313},{"content":"#[bench]\n\nfn seq_slice_choose_1_of_1000(b: &mut Bencher) {\n\n let mut rng = SmallRng::from_rng(thread_rng()).unwrap();\n\n let x: &mut [usize] = &mut [1; 1000];\n\n for (i, r) in x.iter_mut().enumerate() {\n\n *r = i;\n\n }\n\n b.iter(|| {\n\n let mut s = 0;\n\n for _ in 0..RAND_BENCH_N {\n\n s += x.choose(&mut rng).unwrap();\n\n }\n\n s\n\n });\n\n b.bytes = size_of::<usize>() as u64 * crate::RAND_BENCH_N;\n\n}\n\n\n\nmacro_rules! seq_slice_choose_multiple {\n\n ($name:ident, $amount:expr, $length:expr) => {\n\n #[bench]\n\n fn $name(b: &mut Bencher) {\n","file_path":"tests/complex/rand/benches/seq.rs","rank":29,"score":152408.51998363313},{"content":"#[bench]\n\nfn misc_bernoulli_var(b: &mut Bencher) {\n\n let mut rng = Pcg32::from_rng(&mut thread_rng()).unwrap();\n\n b.iter(|| {\n\n let mut accum = true;\n\n let mut p = 0.18;\n\n for _ in 0..crate::RAND_BENCH_N {\n\n let d = Bernoulli::new(p).unwrap();\n\n accum ^= rng.sample(d);\n\n p += 0.0001;\n\n }\n\n accum\n\n })\n\n}\n\n\n","file_path":"tests/complex/rand/benches/misc.rs","rank":30,"score":152408.51998363313},{"content":"#[bench]\n\nfn gen_1kb_u16_fill(b: &mut Bencher) {\n\n let mut rng = Pcg64Mcg::from_rng(&mut thread_rng()).unwrap();\n\n let mut buf = [0u16; 512];\n\n b.iter(|| {\n\n rng.fill(&mut buf[..]);\n\n buf\n\n });\n\n b.bytes = 1024;\n\n}\n\n\n","file_path":"tests/complex/rand/benches/misc.rs","rank":31,"score":150124.39703239378},{"content":"#[bench]\n\nfn misc_gen_ratio_const(b: &mut Bencher) {\n\n let mut rng = Pcg32::from_rng(&mut thread_rng()).unwrap();\n\n b.iter(|| {\n\n let mut accum = true;\n\n for _ in 0..crate::RAND_BENCH_N {\n\n accum ^= rng.gen_ratio(2, 3);\n\n }\n\n accum\n\n })\n\n}\n\n\n","file_path":"tests/complex/rand/benches/misc.rs","rank":32,"score":150124.39703239378},{"content":"#[bench]\n\nfn seq_iter_choose_multiple_10_of_100(b: &mut Bencher) {\n\n let mut rng = SmallRng::from_rng(thread_rng()).unwrap();\n\n let x: &[usize] = &[1; 100];\n\n b.iter(|| x.iter().cloned().choose_multiple(&mut rng, 10))\n\n}\n\n\n","file_path":"tests/complex/rand/benches/seq.rs","rank":33,"score":150124.39703239375},{"content":"#[bench]\n\nfn seq_iter_unhinted_choose_from_1000(b: &mut Bencher) {\n\n let mut rng = SmallRng::from_rng(thread_rng()).unwrap();\n\n let x: &[usize] = &[1; 1000];\n\n b.iter(|| {\n\n UnhintedIterator { iter: x.iter() }\n\n .choose(&mut rng)\n\n .unwrap()\n\n })\n\n}\n\n\n","file_path":"tests/complex/rand/benches/seq.rs","rank":34,"score":150124.39703239375},{"content":"#[bench]\n\nfn misc_gen_ratio_var(b: &mut Bencher) {\n\n let mut rng = Pcg32::from_rng(&mut thread_rng()).unwrap();\n\n b.iter(|| {\n\n let mut accum = true;\n\n for i in 2..(crate::RAND_BENCH_N as u32 + 2) {\n\n accum ^= rng.gen_ratio(i, i + 1);\n\n }\n\n accum\n\n })\n\n}\n\n\n","file_path":"tests/complex/rand/benches/misc.rs","rank":35,"score":150124.39703239378},{"content":"#[bench]\n\nfn gen_1kb_u64_fill(b: &mut Bencher) {\n\n let mut rng = Pcg64Mcg::from_rng(&mut thread_rng()).unwrap();\n\n let mut buf = [0u64; 128];\n\n b.iter(|| {\n\n rng.fill(&mut buf[..]);\n\n buf\n\n });\n\n b.bytes = 1024;\n\n}\n","file_path":"tests/complex/rand/benches/misc.rs","rank":36,"score":150124.39703239378},{"content":"#[bench]\n\nfn gen_1kb_u64_iter_repeat(b: &mut Bencher) {\n\n use core::iter;\n\n let mut rng = Pcg64Mcg::from_rng(&mut thread_rng()).unwrap();\n\n b.iter(|| {\n\n let v: Vec<u64> = iter::repeat(()).map(|()| rng.gen()).take(128).collect();\n\n v\n\n });\n\n b.bytes = 1024;\n\n}\n\n\n","file_path":"tests/complex/rand/benches/misc.rs","rank":37,"score":147934.87323583412},{"content":"#[bench]\n\nfn gen_1kb_u16_sample_iter(b: &mut Bencher) {\n\n let mut rng = Pcg64Mcg::from_rng(&mut thread_rng()).unwrap();\n\n b.iter(|| {\n\n let v: Vec<u16> = Standard.sample_iter(&mut rng).take(512).collect();\n\n v\n\n });\n\n b.bytes = 1024;\n\n}\n\n\n","file_path":"tests/complex/rand/benches/misc.rs","rank":38,"score":147934.87323583412},{"content":"#[bench]\n\nfn gen_1kb_u16_gen_array(b: &mut Bencher) {\n\n let mut rng = Pcg64Mcg::from_rng(&mut thread_rng()).unwrap();\n\n b.iter(|| {\n\n // max supported array length is 32!\n\n let v: [[u16; 32]; 16] = rng.gen();\n\n v\n\n });\n\n b.bytes = 1024;\n\n}\n\n\n","file_path":"tests/complex/rand/benches/misc.rs","rank":39,"score":147934.87323583412},{"content":"#[bench]\n\nfn gen_1kb_u64_sample_iter(b: &mut Bencher) {\n\n let mut rng = Pcg64Mcg::from_rng(&mut thread_rng()).unwrap();\n\n b.iter(|| {\n\n let v: Vec<u64> = Standard.sample_iter(&mut rng).take(128).collect();\n\n v\n\n });\n\n b.bytes = 1024;\n\n}\n\n\n","file_path":"tests/complex/rand/benches/misc.rs","rank":40,"score":147934.87323583412},{"content":"#[bench]\n\nfn seq_iter_choose_multiple_fill_10_of_100(b: &mut Bencher) {\n\n let mut rng = SmallRng::from_rng(thread_rng()).unwrap();\n\n let x: &[usize] = &[1; 100];\n\n let mut buf = [0; 10];\n\n b.iter(|| x.iter().cloned().choose_multiple_fill(&mut rng, &mut buf))\n\n}\n\n\n\nmacro_rules! sample_indices {\n\n ($name:ident, $fn:ident, $amount:expr, $length:expr) => {\n\n #[bench]\n\n fn $name(b: &mut Bencher) {\n\n let mut rng = SmallRng::from_rng(thread_rng()).unwrap();\n\n b.iter(|| index::$fn(&mut rng, $length, $amount))\n\n }\n\n };\n\n}\n\n\n\nsample_indices!(misc_sample_indices_1_of_1k, sample, 1, 1000);\n\nsample_indices!(misc_sample_indices_10_of_1k, sample, 10, 1000);\n\nsample_indices!(misc_sample_indices_100_of_1k, sample, 100, 1000);\n","file_path":"tests/complex/rand/benches/seq.rs","rank":41,"score":147934.87323583412},{"content":"#[bench]\n\nfn gen_1kb_u16_iter_repeat(b: &mut Bencher) {\n\n use core::iter;\n\n let mut rng = Pcg64Mcg::from_rng(&mut thread_rng()).unwrap();\n\n b.iter(|| {\n\n let v: Vec<u16> = iter::repeat(()).map(|()| rng.gen()).take(512).collect();\n\n v\n\n });\n\n b.bytes = 1024;\n\n}\n\n\n","file_path":"tests/complex/rand/benches/misc.rs","rank":42,"score":147934.87323583412},{"content":"#[bench]\n\nfn seq_iter_window_hinted_choose_from_1000(b: &mut Bencher) {\n\n let mut rng = SmallRng::from_rng(thread_rng()).unwrap();\n\n let x: &[usize] = &[1; 1000];\n\n b.iter(|| {\n\n WindowHintedIterator {\n\n iter: x.iter(),\n\n window_size: 7,\n\n }\n\n .choose(&mut rng)\n\n })\n\n}\n\n\n","file_path":"tests/complex/rand/benches/seq.rs","rank":43,"score":147934.87323583412},{"content":"#[bench]\n\nfn gen_1kb_u64_gen_array(b: &mut Bencher) {\n\n let mut rng = Pcg64Mcg::from_rng(&mut thread_rng()).unwrap();\n\n b.iter(|| {\n\n // max supported array length is 32!\n\n let v: [[u64; 32]; 4] = rng.gen();\n\n v\n\n });\n\n b.bytes = 1024;\n\n}\n\n\n","file_path":"tests/complex/rand/benches/misc.rs","rank":44,"score":147934.87323583412},{"content":"struct SimulationResult {\n\n win: bool,\n\n switch: bool,\n\n}\n\n\n","file_path":"tests/complex/rand/examples/monty-hall.rs","rank":45,"score":146602.82809200988},{"content":"#[cfg(feature = \"std\")]\n\n#[cfg_attr(doc_cfg, doc(cfg(feature = \"std\")))]\n\npub fn sample_weighted<R, F, X>(\n\n rng: &mut R, length: usize, weight: F, amount: usize,\n\n) -> Result<IndexVec, WeightedError>\n\nwhere\n\n R: Rng + ?Sized,\n\n F: Fn(usize) -> X,\n\n X: Into<f64>,\n\n{\n\n if length > (core::u32::MAX as usize) {\n\n sample_efraimidis_spirakis(rng, length, weight, amount)\n\n } else {\n\n assert!(amount <= core::u32::MAX as usize);\n\n let amount = amount as u32;\n\n let length = length as u32;\n\n sample_efraimidis_spirakis(rng, length, weight, amount)\n\n }\n\n}\n\n\n\n\n\n/// Randomly sample exactly `amount` distinct indices from `0..length`, and\n","file_path":"tests/complex/rand/src/seq/index.rs","rank":46,"score":146059.76829172584},{"content":"#[cfg(feature = \"std\")]\n\nfn sample_efraimidis_spirakis<R, F, X, N>(\n\n rng: &mut R, length: N, weight: F, amount: N,\n\n) -> Result<IndexVec, WeightedError>\n\nwhere\n\n R: Rng + ?Sized,\n\n F: Fn(usize) -> X,\n\n X: Into<f64>,\n\n N: UInt,\n\n IndexVec: From<Vec<N>>,\n\n{\n\n if amount == N::zero() {\n\n return Ok(IndexVec::U32(Vec::new()));\n\n }\n\n\n\n if amount > length {\n\n panic!(\"`amount` of samples must be less than or equal to `length`\");\n\n }\n\n\n\n struct Element<N> {\n\n index: N,\n","file_path":"tests/complex/rand/src/seq/index.rs","rank":47,"score":143955.2869175397},{"content":"pub fn encrypt_memory<Cipher>(data: &[u8]) -> MemoryEncryptionCtx<Cipher>\n\nwhere\n\n Cipher: NewAead,\n\n Cipher: Aead,\n\n Cipher::KeySize: IsEqual<U32, Output = True>,\n\n //TODO: Should probably redo nonce generation to be generic enough for things like AES-GCM that use 96 bit nonces\n\n Cipher::NonceSize: IsEqual<U24, Output = True>,\n\n{\n\n let mut key: Key<Cipher> = Default::default();\n\n OsRng.fill_bytes(&mut key);\n\n let cipher = Cipher::new(&key);\n\n let mut nonce: Nonce<Cipher> = Default::default();\n\n OsRng.fill_bytes(&mut nonce);\n\n\n\n let ciphertext = cipher.encrypt(&nonce, data).unwrap();\n\n\n\n //println!(\"We are encrypting data: {:#x?}\", data);\n\n //println!(\"Resulting ciphertext: {:#x?}\", ciphertext);\n\n\n\n MemoryEncryptionCtx::<Cipher> {\n\n key,\n\n nonce,\n\n ciphertext,\n\n }\n\n}\n\n\n","file_path":"src/crypto.rs","rank":48,"score":143782.85645563394},{"content":"pub fn obfuscate(input: &String) -> (String, Shatter) {\n\n let mut input2 = syn::parse_file(&input).unwrap();\n\n\n\n //eprintln!(\"INPUT: {:#?}\", input2);\n\n //eprintln!(\"INFORMAT: {}\", prettyplease::unparse(&input2));\n\n\n\n shuffle(&mut input2);\n\n encrypt_strings(&mut input2);\n\n let shatter = shatter(&mut input2);\n\n\n\n //eprintln!(\"OUTPUT: {:#?}\", input2);\n\n //eprintln!(\"OUTFORMAT: {}\", prettyplease::unparse(&input2));\n\n\n\n (prettyplease::unparse(&input2), shatter)\n\n}\n\n\n","file_path":"src/lib.rs","rank":49,"score":143590.0505124228},{"content":"fn main() {\n\n #[shuffle]\n\n let w = 1;\n\n #[shuffle]\n\n let x = 2;\n\n #[shuffle]\n\n let y = 3;\n\n #[shuffle]\n\n let z = 4;\n\n\n\n eprintln!(\"My values are {w}, {x}, {y}, {z}\");\n\n}\n","file_path":"tests/single/05-shuffle_let/src/main.rs","rank":50,"score":141186.25959910933},{"content":"fn bench(c: &mut Criterion<CyclesPerByte>) {\n\n {\n\n let mut g = c.benchmark_group(\"exp\");\n\n distr_float!(g, \"exp\", f64, Exp::new(1.23 * 4.56).unwrap());\n\n distr_float!(g, \"exp1_specialized\", f64, Exp1);\n\n distr_float!(g, \"exp1_general\", f64, Exp::new(1.).unwrap());\n\n }\n\n\n\n {\n\n let mut g = c.benchmark_group(\"normal\");\n\n distr_float!(g, \"normal\", f64, Normal::new(-1.23, 4.56).unwrap());\n\n distr_float!(g, \"standardnormal_specialized\", f64, StandardNormal);\n\n distr_float!(g, \"standardnormal_general\", f64, Normal::new(0., 1.).unwrap());\n\n distr_float!(g, \"log_normal\", f64, LogNormal::new(-1.23, 4.56).unwrap());\n\n g.throughput(Throughput::Bytes(size_of::<f64>() as u64 * RAND_BENCH_N));\n\n g.bench_function(\"iter\", |c| {\n\n let mut rng = Pcg64Mcg::from_entropy();\n\n let distr = Normal::new(-2.71828, 3.14159).unwrap();\n\n let mut iter = distr.sample_iter(&mut rng);\n\n\n","file_path":"tests/complex/rand/rand_distr/benches/src/distributions.rs","rank":51,"score":140743.59395395612},{"content":"fn main() -> io::Result<()> {\n\n let matches = app_from_crate!()\n\n .global_setting(AppSettings::PropagateVersion)\n\n .global_setting(AppSettings::UseLongFormatForHelpSubcommand)\n\n .setting(AppSettings::SubcommandRequiredElseHelp)\n\n .subcommand(\n\n App::new(\"build\")\n\n .about(\"Compile a local package and all of its dependencies\")\n\n .arg(\n\n arg!(args: [args])\n\n .help(\"Arguments to pass to cargo\")\n\n .multiple_occurrences(true)\n\n .last(true)\n\n .required(false),\n\n ),\n\n )\n\n .subcommand(\n\n App::new(\"check\")\n\n .about(\n\n \"Analyze the current package and report errors, but don't build object files\",\n","file_path":"src/main.rs","rank":52,"score":139437.15292166607},{"content":"#[inline]\n\npub fn read_u32_into(src: &[u8], dst: &mut [u32]) {\n\n assert!(src.len() >= 4 * dst.len());\n\n for (out, chunk) in dst.iter_mut().zip(src.chunks_exact(4)) {\n\n *out = u32::from_le_bytes(chunk.try_into().unwrap());\n\n }\n\n}\n\n\n\n/// Reads unsigned 64 bit integers from `src` into `dst`.\n","file_path":"tests/complex/rand/rand_core/src/le.rs","rank":53,"score":133779.66537439695},{"content":"#[inline]\n\npub fn read_u64_into(src: &[u8], dst: &mut [u64]) {\n\n assert!(src.len() >= 8 * dst.len());\n\n for (out, chunk) in dst.iter_mut().zip(src.chunks_exact(8)) {\n\n *out = u64::from_le_bytes(chunk.try_into().unwrap());\n\n }\n\n}\n\n\n","file_path":"tests/complex/rand/rand_core/src/le.rs","rank":54,"score":133779.66537439695},{"content":"/// Calculate the required capacity for the sparkline, given the length of the\n\n/// input data.\n\npub fn required_capacity(len: usize) -> usize {\n\n len * TICKS[0].len_utf8()\n\n}\n\n\n","file_path":"tests/complex/rand/rand_distr/tests/sparkline.rs","rank":55,"score":127915.21073131854},{"content":"//TODO: This and the shuffle finding are inefficient, try and remove all the cloning\n\nfn stmt_contains_shuffle_attr(stmt: &Stmt) -> bool {\n\n let mut cloned = stmt.to_owned();\n\n let cloned_attrs = cloned.get_attrs();\n\n if cloned_attrs.is_none() {\n\n return false;\n\n }\n\n let cloned_attrs_ref = cloned_attrs.unwrap();\n\n contains_shuffle_attr(cloned_attrs_ref)\n\n}\n\n\n","file_path":"src/shuffle.rs","rank":56,"score":127835.88251154618},{"content":"pub fn shuffle(input: &mut File) {\n\n Shuffle.visit_file_mut(input);\n\n}\n","file_path":"src/shuffle.rs","rank":57,"score":127256.676756378},{"content":"#[allow(clippy::many_single_char_names)]\n\n#[inline(always)]\n\nfn refill_wide_impl<Mach: Machine>(\n\n m: Mach, state: &mut ChaCha, drounds: u32, out: &mut [u32; BUFSZ],\n\n) {\n\n let k = m.vec([0x6170_7865, 0x3320_646e, 0x7962_2d32, 0x6b20_6574]);\n\n let b = m.unpack(state.b);\n\n let c = m.unpack(state.c);\n\n let mut x = State {\n\n a: Mach::u32x4x4::from_lanes([k, k, k, k]),\n\n b: Mach::u32x4x4::from_lanes([b, b, b, b]),\n\n c: Mach::u32x4x4::from_lanes([c, c, c, c]),\n\n d: d0123(m, state.d),\n\n };\n\n for _ in 0..drounds {\n\n x = round(x);\n\n x = undiagonalize(round(diagonalize(x)));\n\n }\n\n let kk = Mach::u32x4x4::from_lanes([k, k, k, k]);\n\n let sb = m.unpack(state.b);\n\n let sb = Mach::u32x4x4::from_lanes([sb, sb, sb, sb]);\n\n let sc = m.unpack(state.c);\n","file_path":"tests/complex/rand/rand_chacha/src/guts.rs","rank":59,"score":125062.13970760752},{"content":"fn contains_shuffle_attr(attrs: &Vec<Attribute>) -> bool {\n\n for attr in attrs {\n\n if is_shuffle_attr(&get_attr_name(&attr)) {\n\n return true;\n\n }\n\n }\n\n return false;\n\n}\n\n\n","file_path":"src/shuffle.rs","rank":60,"score":124685.52817994912},{"content":"#[inline]\n\nfn gen_index<R: Rng + ?Sized>(rng: &mut R, ubound: usize) -> usize {\n\n if ubound <= (core::u32::MAX as usize) {\n\n rng.gen_range(0..ubound as u32) as usize\n\n } else {\n\n rng.gen_range(0..ubound)\n\n }\n\n}\n\n\n\n\n\n#[cfg(test)]\n\nmod test {\n\n use super::*;\n\n #[cfg(feature = \"alloc\")] use crate::Rng;\n\n #[cfg(all(feature = \"alloc\", not(feature = \"std\")))] use alloc::vec::Vec;\n\n\n\n #[test]\n\n fn test_slice_choose() {\n\n let mut r = crate::test::rng(107);\n\n let chars = [\n\n 'a', 'b', 'c', 'd', 'e', 'f', 'g', 'h', 'i', 'j', 'k', 'l', 'm', 'n',\n","file_path":"tests/complex/rand/src/seq/mod.rs","rank":61,"score":124521.27699663631},{"content":"#[inline(always)]\n\nfn output_dxsm(state: u128) -> u64 {\n\n // See https://github.com/imneme/pcg-cpp/blob/ffd522e7188bef30a00c74dc7eb9de5faff90092/include/pcg_random.hpp#L1016\n\n // for a short discussion of the construction and its original implementation.\n\n let mut hi = (state >> 64) as u64;\n\n let mut lo = state as u64;\n\n\n\n lo |= 1;\n\n hi ^= hi >> 32;\n\n hi = hi.wrapping_mul(MULTIPLIER);\n\n hi ^= hi >> 48;\n\n hi = hi.wrapping_mul(lo);\n\n\n\n hi\n\n}\n","file_path":"tests/complex/rand/rand_pcg/src/pcg128cm.rs","rank":62,"score":123516.96977193466},{"content":"/// Randomly sample exactly `amount` indices from `0..length`, using Floyd's\n\n/// combination algorithm.\n\n///\n\n/// The output values are fully shuffled. (Overhead is under 50%.)\n\n///\n\n/// This implementation uses `O(amount)` memory and `O(amount^2)` time.\n\nfn sample_floyd<R>(rng: &mut R, length: u32, amount: u32) -> IndexVec\n\nwhere R: Rng + ?Sized {\n\n // For small amount we use Floyd's fully-shuffled variant. For larger\n\n // amounts this is slow due to Vec::insert performance, so we shuffle\n\n // afterwards. Benchmarks show little overhead from extra logic.\n\n let floyd_shuffle = amount < 50;\n\n\n\n debug_assert!(amount <= length);\n\n let mut indices = Vec::with_capacity(amount as usize);\n\n for j in length - amount..length {\n\n let t = rng.gen_range(0..=j);\n\n if floyd_shuffle {\n\n if let Some(pos) = indices.iter().position(|&x| x == t) {\n\n indices.insert(pos, j);\n\n continue;\n\n }\n\n } else if indices.contains(&t) {\n\n indices.push(j);\n\n continue;\n\n }\n","file_path":"tests/complex/rand/src/seq/index.rs","rank":63,"score":122802.2836603257},{"content":"/// Randomly sample exactly `amount` indices from `0..length`, using an inplace\n\n/// partial Fisher-Yates method.\n\n/// Sample an amount of indices using an inplace partial fisher yates method.\n\n///\n\n/// This allocates the entire `length` of indices and randomizes only the first `amount`.\n\n/// It then truncates to `amount` and returns.\n\n///\n\n/// This method is not appropriate for large `length` and potentially uses a lot\n\n/// of memory; because of this we only implement for `u32` index (which improves\n\n/// performance in all cases).\n\n///\n\n/// Set-up is `O(length)` time and memory and shuffling is `O(amount)` time.\n\nfn sample_inplace<R>(rng: &mut R, length: u32, amount: u32) -> IndexVec\n\nwhere R: Rng + ?Sized {\n\n debug_assert!(amount <= length);\n\n let mut indices: Vec<u32> = Vec::with_capacity(length as usize);\n\n indices.extend(0..length);\n\n for i in 0..amount {\n\n let j: u32 = rng.gen_range(i..length);\n\n indices.swap(i as usize, j as usize);\n\n }\n\n indices.truncate(amount as usize);\n\n debug_assert_eq!(indices.len(), amount as usize);\n\n IndexVec::from(indices)\n\n}\n\n\n","file_path":"tests/complex/rand/src/seq/index.rs","rank":64,"score":122801.20325872088},{"content":"//TODO: Add configuration for conditional shatter injection\n\npub fn shatter(input: &mut File) -> Shatter {\n\n let mut state = Shatter {\n\n inside_unsafe_block: false,\n\n integrity_checks: Vec::new(),\n\n };\n\n Shatter::visit_file_mut(&mut state, input);\n\n\n\n state\n\n}\n\n\n\n\n","file_path":"src/shatter.rs","rank":65,"score":122640.9022195175},{"content":"#[inline(always)]\n\nfn output_xsl_rr(state: u128) -> u64 {\n\n // Output function XSL RR (\"xorshift low (bits), random rotation\")\n\n // Constants are for 128-bit state, 64-bit output\n\n const XSHIFT: u32 = 64; // (128 - 64 + 64) / 2\n\n const ROTATE: u32 = 122; // 128 - 6\n\n\n\n let rot = (state >> ROTATE) as u32;\n\n let xsl = ((state >> XSHIFT) as u64) ^ (state as u64);\n\n xsl.rotate_right(rot)\n\n}\n","file_path":"tests/complex/rand/rand_pcg/src/pcg128.rs","rank":66,"score":121412.3947287834},{"content":"/// Randomly sample exactly `amount` distinct indices from `0..length`, and\n\n/// return them in random order (fully shuffled).\n\n///\n\n/// This method is used internally by the slice sampling methods, but it can\n\n/// sometimes be useful to have the indices themselves so this is provided as\n\n/// an alternative.\n\n///\n\n/// The implementation used is not specified; we automatically select the\n\n/// fastest available algorithm for the `length` and `amount` parameters\n\n/// (based on detailed profiling on an Intel Haswell CPU). Roughly speaking,\n\n/// complexity is `O(amount)`, except that when `amount` is small, performance\n\n/// is closer to `O(amount^2)`, and when `length` is close to `amount` then\n\n/// `O(length)`.\n\n///\n\n/// Note that performance is significantly better over `u32` indices than over\n\n/// `u64` indices. Because of this we hide the underlying type behind an\n\n/// abstraction, `IndexVec`.\n\n///\n\n/// If an allocation-free `no_std` function is required, it is suggested\n\n/// to adapt the internal `sample_floyd` implementation.\n\n///\n\n/// Panics if `amount > length`.\n\npub fn sample<R>(rng: &mut R, length: usize, amount: usize) -> IndexVec\n\nwhere R: Rng + ?Sized {\n\n if amount > length {\n\n panic!(\"`amount` of samples must be less than or equal to `length`\");\n\n }\n\n if length > (::core::u32::MAX as usize) {\n\n // We never want to use inplace here, but could use floyd's alg\n\n // Lazy version: always use the cache alg.\n\n return sample_rejection(rng, length, amount);\n\n }\n\n let amount = amount as u32;\n\n let length = length as u32;\n\n\n\n // Choice of algorithm here depends on both length and amount. See:\n\n // https://github.com/rust-random/rand/pull/479\n\n // We do some calculations with f32. Accuracy is not very important.\n\n\n\n if amount < 163 {\n\n const C: [[f32; 2]; 2] = [[1.6, 8.0 / 45.0], [10.0, 70.0 / 9.0]];\n\n let j = if length < 500_000 { 0 } else { 1 };\n","file_path":"tests/complex/rand/src/seq/index.rs","rank":67,"score":121306.89298548971},{"content":"// Returns the door we switch to, given our current choice and\n\n// the open door. There will only be one valid door.\n\nfn switch_door(choice: u32, open: u32) -> u32 {\n\n free_doors(&[choice, open])[0]\n\n}\n\n\n","file_path":"tests/complex/rand/examples/monty-hall.rs","rank":68,"score":118860.16431749114},{"content":"pub fn generate_temp_folder_name(name: Option<&str>) -> Utf8PathBuf {\n\n let mut output = Utf8PathBuf::from_path_buf(env::temp_dir()).unwrap();\n\n output.push(name.unwrap_or(\".r2d2_build_dir\"));\n\n output\n\n}\n\n\n","file_path":"src/lib.rs","rank":69,"score":115240.42158269743},{"content":"pub fn build(config: &R2D2Config) -> io::Result<ExitStatus> {\n\n let src = get_src_dir();\n\n let mut dest = generate_temp_folder_name(config.dest_name);\n\n\n\n if let Ok(_) = std::fs::metadata(&dest) {\n\n //Clean up the folder if it already exists\n\n let _ = fs::remove_dir_all(&dest);\n\n }\n\n\n\n DirBuilder::new().recursive(true).create(&dest)?;\n\n\n\n copy_dir(&src.workspace_root, &dest)?;\n\n\n\n if let Some(partial) = config.obfuscate_dir {\n\n let mut true_dest_str = String::from(dest.as_str());\n\n true_dest_str.push(path::MAIN_SEPARATOR);\n\n true_dest_str.push_str(partial);\n\n\n\n dest = Utf8PathBuf::from(true_dest_str);\n\n }\n","file_path":"src/lib.rs","rank":70,"score":114395.07103281128},{"content":"/// Convert a `f64` to an `i64`, panicking on overflow.\n\nfn f64_to_i64(x: f64) -> i64 {\n\n assert!(x < (core::i64::MAX as f64));\n\n x as i64\n\n}\n\n\n\nimpl Distribution<u64> for Binomial {\n\n #[allow(clippy::many_single_char_names)] // Same names as in the reference.\n\n fn sample<R: Rng + ?Sized>(&self, rng: &mut R) -> u64 {\n\n // Handle these values directly.\n\n if self.p == 0.0 {\n\n return 0;\n\n } else if self.p == 1.0 {\n\n return self.n;\n\n }\n\n\n\n // The binomial distribution is symmetrical with respect to p -> 1-p,\n\n // k -> n-k switch p so that it is less than 0.5 - this allows for lower\n\n // expected values we will just invert the result at the end\n\n let p = if self.p <= 0.5 { self.p } else { 1.0 - self.p };\n\n\n","file_path":"tests/complex/rand/rand_distr/src/binomial.rs","rank":71,"score":111627.12056082586},{"content":"//TODO: Only copy differences with hashes/mtime checks\n\n//TODO: This needs to be optimized and cleaned up\n\n//TODO: Fix the error checking\n\npub fn copy_dir(from: &Utf8PathBuf, to: &Utf8PathBuf) -> io::Result<()> {\n\n let files: Vec<_> = WalkDir::new(from)\n\n .into_iter()\n\n .filter_entry(|e| {\n\n !e.file_name()\n\n .to_str()\n\n .map(|s| s.starts_with(\".\"))\n\n .unwrap_or(false)\n\n })\n\n .collect();\n\n\n\n if files.iter().all(|e| !e.is_ok()) {\n\n return Err(io::Error::new(\n\n ErrorKind::PermissionDenied,\n\n \"Some files can't be accessed\",\n\n ));\n\n }\n\n\n\n let (dirs, files): (Vec<Utf8PathBuf>, Vec<Utf8PathBuf>) = files\n\n .into_iter()\n","file_path":"src/lib.rs","rank":72,"score":110701.73855059085},{"content":"pub fn obfuscate_dir(dir: &Utf8PathBuf) -> io::Result<Vec<Shatter>> {\n\n //WalkDir filter_entry will prevent the directory from being touched, so have to filter\n\n //manually\n\n\n\n let mut shatter_states: Vec<Shatter> = Vec::new();\n\n\n\n for file in WalkDir::new(dir) {\n\n let file_path = file?.into_path();\n\n if file_path.to_str().unwrap_or_default().ends_with(\".rs\") {\n\n let contents = fs::read_to_string(&file_path)?;\n\n let (obfuscated, shatter_state) = obfuscate(&contents);\n\n shatter_states.push(shatter_state);\n\n fs::write(&file_path, &obfuscated)?;\n\n }\n\n }\n\n Ok(shatter_states)\n\n}\n\n\n","file_path":"src/lib.rs","rank":73,"score":110697.06301466672},{"content":"pub fn get_src_dir() -> SourceInformation {\n\n let metadata = MetadataCommand::new().exec().unwrap();\n\n SourceInformation {\n\n workspace_root: metadata.workspace_root,\n\n target_dir: metadata.target_directory,\n\n }\n\n}\n\n\n\npub struct R2D2Config<'a> {\n\n pub dest_name: Option<&'a str>,\n\n pub cargo_args: Option<Vec<&'a str>>,\n\n pub need_run: bool,\n\n pub need_obfuscate: bool,\n\n pub obfuscate_dir: Option<&'a str>,\n\n pub stream_output: bool,\n\n}\n\n\n","file_path":"src/lib.rs","rank":74,"score":105573.88279165575},{"content":"#[test]\n\nfn test_lcg128cmdxsm64_construction() {\n\n // Test that various construction techniques produce a working RNG.\n\n #[rustfmt::skip]\n\n let seed = [1,2,3,4, 5,6,7,8, 9,10,11,12, 13,14,15,16,\n\n 17,18,19,20, 21,22,23,24, 25,26,27,28, 29,30,31,32];\n\n let mut rng1 = Lcg128CmDxsm64::from_seed(seed);\n\n assert_eq!(rng1.next_u64(), 12201417210360370199);\n\n\n\n let mut rng2 = Lcg128CmDxsm64::from_rng(&mut rng1).unwrap();\n\n assert_eq!(rng2.next_u64(), 11487972556150888383);\n\n\n\n let mut rng3 = Lcg128CmDxsm64::seed_from_u64(0);\n\n assert_eq!(rng3.next_u64(), 4111470453933123814);\n\n\n\n // This is the same as Lcg128CmDxsm64, so we only have a single test:\n\n let mut rng4 = Pcg64Dxsm::seed_from_u64(0);\n\n assert_eq!(rng4.next_u64(), 4111470453933123814);\n\n}\n\n\n","file_path":"tests/complex/rand/rand_pcg/tests/lcg128cmdxsm64.rs","rank":75,"score":104164.96528912253},{"content":"#[test]\n\nfn test_lcg128cmdxsm64_advancing() {\n\n for seed in 0..20 {\n\n let mut rng1 = Lcg128CmDxsm64::seed_from_u64(seed);\n\n let mut rng2 = rng1.clone();\n\n for _ in 0..20 {\n\n rng1.next_u64();\n\n }\n\n rng2.advance(20);\n\n assert_eq!(rng1, rng2);\n\n }\n\n}\n\n\n","file_path":"tests/complex/rand/rand_pcg/tests/lcg128cmdxsm64.rs","rank":76,"score":104164.96528912253},{"content":"#[test]\n\nfn test_lcg128xsl64_reference() {\n\n // Numbers copied from official test suite (C version).\n\n let mut rng = Lcg128Xsl64::new(42, 54);\n\n\n\n let mut results = [0u64; 6];\n\n for i in results.iter_mut() {\n\n *i = rng.next_u64();\n\n }\n\n let expected: [u64; 6] = [\n\n 0x86b1da1d72062b68,\n\n 0x1304aa46c9853d39,\n\n 0xa3670e9e0dd50358,\n\n 0xf9090e529a7dae00,\n\n 0xc85b9fd837996f2c,\n\n 0x606121f8e3919196,\n\n ];\n\n assert_eq!(results, expected);\n\n}\n\n\n","file_path":"tests/complex/rand/rand_pcg/tests/lcg128xsl64.rs","rank":77,"score":104164.96528912253},{"content":"#[test]\n\nfn test_lcg128xsl64_advancing() {\n\n for seed in 0..20 {\n\n let mut rng1 = Lcg128Xsl64::seed_from_u64(seed);\n\n let mut rng2 = rng1.clone();\n\n for _ in 0..20 {\n\n rng1.next_u64();\n\n }\n\n rng2.advance(20);\n\n assert_eq!(rng1, rng2);\n\n }\n\n}\n\n\n","file_path":"tests/complex/rand/rand_pcg/tests/lcg128xsl64.rs","rank":78,"score":104164.96528912253},{"content":"#[test]\n\nfn test_lcg128xsl64_construction() {\n\n // Test that various construction techniques produce a working RNG.\n\n #[rustfmt::skip]\n\n let seed = [1,2,3,4, 5,6,7,8, 9,10,11,12, 13,14,15,16,\n\n 17,18,19,20, 21,22,23,24, 25,26,27,28, 29,30,31,32];\n\n let mut rng1 = Lcg128Xsl64::from_seed(seed);\n\n assert_eq!(rng1.next_u64(), 8740028313290271629);\n\n\n\n let mut rng2 = Lcg128Xsl64::from_rng(&mut rng1).unwrap();\n\n assert_eq!(rng2.next_u64(), 1922280315005786345);\n\n\n\n let mut rng3 = Lcg128Xsl64::seed_from_u64(0);\n\n assert_eq!(rng3.next_u64(), 2354861276966075475);\n\n\n\n // This is the same as Lcg128Xsl64, so we only have a single test:\n\n let mut rng4 = Pcg64::seed_from_u64(0);\n\n assert_eq!(rng4.next_u64(), 2354861276966075475);\n\n}\n\n\n","file_path":"tests/complex/rand/rand_pcg/tests/lcg128xsl64.rs","rank":79,"score":104164.96528912253},{"content":"#[test]\n\nfn test_mcg128xsl64_advancing() {\n\n for seed in 0..20 {\n\n let mut rng1 = Mcg128Xsl64::seed_from_u64(seed);\n\n let mut rng2 = rng1.clone();\n\n for _ in 0..20 {\n\n rng1.next_u64();\n\n }\n\n rng2.advance(20);\n\n assert_eq!(rng1, rng2);\n\n }\n\n}\n\n\n","file_path":"tests/complex/rand/rand_pcg/tests/mcg128xsl64.rs","rank":80,"score":104164.96528912253},{"content":"#[test]\n\nfn test_mcg128xsl64_reference() {\n\n // Numbers copied from official test suite (C version).\n\n let mut rng = Mcg128Xsl64::new(42);\n\n\n\n let mut results = [0u64; 6];\n\n for i in results.iter_mut() {\n\n *i = rng.next_u64();\n\n }\n\n let expected: [u64; 6] = [\n\n 0x63b4a3a813ce700a,\n\n 0x382954200617ab24,\n\n 0xa7fd85ae3fe950ce,\n\n 0xd715286aa2887737,\n\n 0x60c92fee2e59f32c,\n\n 0x84c4e96beff30017,\n\n ];\n\n assert_eq!(results, expected);\n\n}\n\n\n","file_path":"tests/complex/rand/rand_pcg/tests/mcg128xsl64.rs","rank":81,"score":104164.96528912253},{"content":"#[test]\n\nfn test_lcg64xsh32_construction() {\n\n // Test that various construction techniques produce a working RNG.\n\n let seed = [1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16];\n\n let mut rng1 = Lcg64Xsh32::from_seed(seed);\n\n assert_eq!(rng1.next_u64(), 1204678643940597513);\n\n\n\n let mut rng2 = Lcg64Xsh32::from_rng(&mut rng1).unwrap();\n\n assert_eq!(rng2.next_u64(), 12384929573776311845);\n\n\n\n let mut rng3 = Lcg64Xsh32::seed_from_u64(0);\n\n assert_eq!(rng3.next_u64(), 18195738587432868099);\n\n\n\n // This is the same as Lcg64Xsh32, so we only have a single test:\n\n let mut rng4 = Pcg32::seed_from_u64(0);\n\n assert_eq!(rng4.next_u64(), 18195738587432868099);\n\n}\n\n\n","file_path":"tests/complex/rand/rand_pcg/tests/lcg64xsh32.rs","rank":82,"score":104164.96528912253},{"content":"#[test]\n\nfn test_lcg128cmdxsm64_reference() {\n\n // Numbers determined using `pcg_engines::cm_setseq_dxsm_128_64` from pcg-cpp.\n\n let mut rng = Lcg128CmDxsm64::new(42, 54);\n\n\n\n let mut results = [0u64; 6];\n\n for i in results.iter_mut() {\n\n *i = rng.next_u64();\n\n }\n\n let expected: [u64; 6] = [\n\n 17331114245835578256,\n\n 10267467544499227306,\n\n 9726600296081716989,\n\n 10165951391103677450,\n\n 12131334649314727261,\n\n 10134094537930450875,\n\n ];\n\n assert_eq!(results, expected);\n\n}\n\n\n","file_path":"tests/complex/rand/rand_pcg/tests/lcg128cmdxsm64.rs","rank":83,"score":104164.96528912253},{"content":"#[test]\n\nfn test_mcg128xsl64_construction() {\n\n // Test that various construction techniques produce a working RNG.\n\n let seed = [1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16];\n\n let mut rng1 = Mcg128Xsl64::from_seed(seed);\n\n assert_eq!(rng1.next_u64(), 7071994460355047496);\n\n\n\n let mut rng2 = Mcg128Xsl64::from_rng(&mut rng1).unwrap();\n\n assert_eq!(rng2.next_u64(), 12300796107712034932);\n\n\n\n let mut rng3 = Mcg128Xsl64::seed_from_u64(0);\n\n assert_eq!(rng3.next_u64(), 6198063878555692194);\n\n\n\n // This is the same as Mcg128Xsl64, so we only have a single test:\n\n let mut rng4 = Pcg64Mcg::seed_from_u64(0);\n\n assert_eq!(rng4.next_u64(), 6198063878555692194);\n\n}\n\n\n","file_path":"tests/complex/rand/rand_pcg/tests/mcg128xsl64.rs","rank":84,"score":104164.96528912253},{"content":"#[test]\n\nfn test_lcg64xsh32_reference() {\n\n // Numbers copied from official test suite.\n\n let mut rng = Lcg64Xsh32::new(42, 54);\n\n\n\n let mut results = [0u32; 6];\n\n for i in results.iter_mut() {\n\n *i = rng.next_u32();\n\n }\n\n let expected: [u32; 6] = [\n\n 0xa15c02b7, 0x7b47f409, 0xba1d3330, 0x83d2f293, 0xbfa4784b, 0xcbed606e,\n\n ];\n\n assert_eq!(results, expected);\n\n}\n\n\n","file_path":"tests/complex/rand/rand_pcg/tests/lcg64xsh32.rs","rank":85,"score":104164.96528912253},{"content":"#[test]\n\nfn test_lcg64xsh32_advancing() {\n\n for seed in 0..20 {\n\n let mut rng1 = Lcg64Xsh32::seed_from_u64(seed);\n\n let mut rng2 = rng1.clone();\n\n for _ in 0..20 {\n\n rng1.next_u32();\n\n }\n\n rng2.advance(20);\n\n assert_eq!(rng1, rng2);\n\n }\n\n}\n\n\n","file_path":"tests/complex/rand/rand_pcg/tests/lcg64xsh32.rs","rank":86,"score":104164.96528912253},{"content":"#[cfg(feature = \"serde1\")]\n\n#[test]\n\nfn test_lcg128cmdxsm64_serde() {\n\n use bincode;\n\n use std::io::{BufReader, BufWriter};\n\n\n\n let mut rng = Lcg128CmDxsm64::seed_from_u64(0);\n\n\n\n let buf: Vec<u8> = Vec::new();\n\n let mut buf = BufWriter::new(buf);\n\n bincode::serialize_into(&mut buf, &rng).expect(\"Could not serialize\");\n\n\n\n let buf = buf.into_inner().unwrap();\n\n let mut read = BufReader::new(&buf[..]);\n\n let mut deserialized: Lcg128CmDxsm64 =\n\n bincode::deserialize_from(&mut read).expect(\"Could not deserialize\");\n\n\n\n for _ in 0..16 {\n\n assert_eq!(rng.next_u64(), deserialized.next_u64());\n\n }\n\n}\n","file_path":"tests/complex/rand/rand_pcg/tests/lcg128cmdxsm64.rs","rank":87,"score":104164.79789396032},{"content":"#[cfg(feature = \"serde1\")]\n\n#[test]\n\nfn test_lcg128xsl64_serde() {\n\n use bincode;\n\n use std::io::{BufReader, BufWriter};\n\n\n\n let mut rng = Lcg128Xsl64::seed_from_u64(0);\n\n\n\n let buf: Vec<u8> = Vec::new();\n\n let mut buf = BufWriter::new(buf);\n\n bincode::serialize_into(&mut buf, &rng).expect(\"Could not serialize\");\n\n\n\n let buf = buf.into_inner().unwrap();\n\n let mut read = BufReader::new(&buf[..]);\n\n let mut deserialized: Lcg128Xsl64 =\n\n bincode::deserialize_from(&mut read).expect(\"Could not deserialize\");\n\n\n\n for _ in 0..16 {\n\n assert_eq!(rng.next_u64(), deserialized.next_u64());\n\n }\n\n}\n","file_path":"tests/complex/rand/rand_pcg/tests/lcg128xsl64.rs","rank":88,"score":104164.79789396032},{"content":"#[cfg(feature = \"serde1\")]\n\n#[test]\n\nfn test_lcg64xsh32_serde() {\n\n use bincode;\n\n use std::io::{BufReader, BufWriter};\n\n\n\n let mut rng = Lcg64Xsh32::seed_from_u64(0);\n\n\n\n let buf: Vec<u8> = Vec::new();\n\n let mut buf = BufWriter::new(buf);\n\n bincode::serialize_into(&mut buf, &rng).expect(\"Could not serialize\");\n\n\n\n let buf = buf.into_inner().unwrap();\n\n let mut read = BufReader::new(&buf[..]);\n\n let mut deserialized: Lcg64Xsh32 =\n\n bincode::deserialize_from(&mut read).expect(\"Could not deserialize\");\n\n\n\n for _ in 0..16 {\n\n assert_eq!(rng.next_u64(), deserialized.next_u64());\n\n }\n\n}\n","file_path":"tests/complex/rand/rand_pcg/tests/lcg64xsh32.rs","rank":89,"score":104164.79789396032},{"content":"#[cfg(feature = \"serde1\")]\n\n#[test]\n\nfn test_mcg128xsl64_serde() {\n\n use bincode;\n\n use std::io::{BufReader, BufWriter};\n\n\n\n let mut rng = Mcg128Xsl64::seed_from_u64(0);\n\n\n\n let buf: Vec<u8> = Vec::new();\n\n let mut buf = BufWriter::new(buf);\n\n bincode::serialize_into(&mut buf, &rng).expect(\"Could not serialize\");\n\n\n\n let buf = buf.into_inner().unwrap();\n\n let mut read = BufReader::new(&buf[..]);\n\n let mut deserialized: Mcg128Xsl64 =\n\n bincode::deserialize_from(&mut read).expect(\"Could not deserialize\");\n\n\n\n for _ in 0..16 {\n\n assert_eq!(rng.next_u64(), deserialized.next_u64());\n\n }\n\n}\n","file_path":"tests/complex/rand/rand_pcg/tests/mcg128xsl64.rs","rank":90,"score":104164.79789396032},{"content":"#[test]\n\nfn normal() {\n\n const N_SAMPLES: u64 = 1_000_000;\n\n const MEAN: f64 = 2.;\n\n const STD_DEV: f64 = 0.5;\n\n const MIN_X: f64 = -1.;\n\n const MAX_X: f64 = 5.;\n\n\n\n let dist = Normal::new(MEAN, STD_DEV).unwrap();\n\n let mut hist = Histogram100::with_const_width(MIN_X, MAX_X);\n\n let mut rng = rand::rngs::SmallRng::seed_from_u64(1);\n\n\n\n for _ in 0..N_SAMPLES {\n\n let _ = hist.add(rng.sample(dist)); // Ignore out-of-range values\n\n }\n\n\n\n println!(\n\n \"Sampled normal distribution:\\n{}\",\n\n sparkline::render_u64_as_string(hist.bins())\n\n );\n\n\n","file_path":"tests/complex/rand/rand_distr/tests/pdf.rs","rank":91,"score":103424.04217583881},{"content":"#[test]\n\nfn test_read() {\n\n let bytes = [1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16];\n\n\n\n let mut buf = [0u32; 4];\n\n read_u32_into(&bytes, &mut buf);\n\n assert_eq!(buf[0], 0x04030201);\n\n assert_eq!(buf[3], 0x100F0E0D);\n\n\n\n let mut buf = [0u32; 3];\n\n read_u32_into(&bytes[1..13], &mut buf); // unaligned\n\n assert_eq!(buf[0], 0x05040302);\n\n assert_eq!(buf[2], 0x0D0C0B0A);\n\n\n\n let mut buf = [0u64; 2];\n\n read_u64_into(&bytes, &mut buf);\n\n assert_eq!(buf[0], 0x0807060504030201);\n\n assert_eq!(buf[1], 0x100F0E0D0C0B0A09);\n\n\n\n let mut buf = [0u64; 1];\n\n read_u64_into(&bytes[7..15], &mut buf); // unaligned\n\n assert_eq!(buf[0], 0x0F0E0D0C0B0A0908);\n\n}\n","file_path":"tests/complex/rand/rand_core/src/le.rs","rank":92,"score":101997.16742505129},{"content":"#[test]\n\nfn skew_normal() {\n\n const N_SAMPLES: u64 = 1_000_000;\n\n const LOCATION: f64 = 2.;\n\n const SCALE: f64 = 0.5;\n\n const SHAPE: f64 = -3.0;\n\n const MIN_X: f64 = -1.;\n\n const MAX_X: f64 = 4.;\n\n\n\n let dist = SkewNormal::new(LOCATION, SCALE, SHAPE).unwrap();\n\n let mut hist = Histogram100::with_const_width(MIN_X, MAX_X);\n\n let mut rng = rand::rngs::SmallRng::seed_from_u64(1);\n\n\n\n for _ in 0..N_SAMPLES {\n\n let _ = hist.add(rng.sample(dist)); // Ignore out-of-range values\n\n }\n\n\n\n println!(\n\n \"Sampled skew normal distribution:\\n{}\",\n\n sparkline::render_u64_as_string(hist.bins())\n\n );\n","file_path":"tests/complex/rand/rand_distr/tests/pdf.rs","rank":93,"score":101997.16742505129},{"content":"#[test]\n\nfn test_construction() {\n\n let mut rng = OsRng::default();\n\n assert!(rng.next_u64() != 0);\n\n}\n","file_path":"tests/complex/rand/rand_core/src/os.rs","rank":94,"score":101997.16742505129},{"content":"#[test]\n\nfn unit_sphere() {\n\n const N_DIM: usize = 3;\n\n let h = Histogram100::with_const_width(-1., 1.);\n\n let mut histograms = [h.clone(), h.clone(), h];\n\n let dist = rand_distr::UnitSphere;\n\n let mut rng = rand_pcg::Pcg32::from_entropy();\n\n for _ in 0..N_SAMPLES {\n\n let v: [f64; 3] = dist.sample(&mut rng);\n\n for i in 0..N_DIM {\n\n histograms[i]\n\n .add(v[i])\n\n .map_err(|e| {\n\n println!(\"v: {}\", v[i]);\n\n e\n\n })\n\n .unwrap();\n\n }\n\n }\n\n for h in &histograms {\n\n let sum: u64 = h.bins().iter().sum();\n\n println!(\"{:?}\", h);\n\n for &b in h.bins() {\n\n let p = (b as f64) / (sum as f64);\n\n assert!((p - 1.0 / (N_BINS as f64)).abs() < TOL, \"{}\", p);\n\n }\n\n }\n\n}\n\n\n","file_path":"tests/complex/rand/rand_distr/tests/uniformity.rs","rank":95,"score":101997.16742505129},{"content":"#[test]\n\nfn unit_circle() {\n\n use core::f64::consts::PI;\n\n let mut h = Histogram100::with_const_width(-PI, PI);\n\n let dist = rand_distr::UnitCircle;\n\n let mut rng = rand_pcg::Pcg32::from_entropy();\n\n for _ in 0..N_SAMPLES {\n\n let v: [f64; 2] = dist.sample(&mut rng);\n\n h.add(v[0].atan2(v[1])).unwrap();\n\n }\n\n let sum: u64 = h.bins().iter().sum();\n\n println!(\"{:?}\", h);\n\n for &b in h.bins() {\n\n let p = (b as f64) / (sum as f64);\n\n assert!((p - 1.0 / (N_BINS as f64)).abs() < TOL, \"{}\", p);\n\n }\n\n}\n","file_path":"tests/complex/rand/rand_distr/tests/uniformity.rs","rank":96,"score":101997.16742505129},{"content":"#[test]\n\nfn geometric_stability() {\n\n test_samples(464, StandardGeometric, &[3, 0, 1, 0, 0, 3, 2, 1, 2, 0]);\n\n \n\n test_samples(464, Geometric::new(0.5).unwrap(), &[2, 1, 1, 0, 0, 1, 0, 1]);\n\n test_samples(464, Geometric::new(0.05).unwrap(), &[24, 51, 81, 67, 27, 11, 7, 6]);\n\n test_samples(464, Geometric::new(0.95).unwrap(), &[0, 0, 0, 0, 1, 0, 0, 0]);\n\n\n\n // expect non-random behaviour for series of pre-determined trials\n\n test_samples(464, Geometric::new(0.0).unwrap(), &[u64::max_value(); 100][..]);\n\n test_samples(464, Geometric::new(1.0).unwrap(), &[0; 100][..]);\n\n}\n\n\n","file_path":"tests/complex/rand/rand_distr/tests/value_stability.rs","rank":97,"score":100624.01512182111},{"content":"#[test]\n\nfn hypergeometric_stability() {\n\n // We have multiple code paths based on the distribution's mode and sample_size\n\n test_samples(7221, Hypergeometric::new(99, 33, 8).unwrap(), &[4, 3, 2, 2, 3, 2, 3, 1]); // Algorithm HIN\n\n test_samples(7221, Hypergeometric::new(100, 50, 50).unwrap(), &[23, 27, 26, 27, 22, 24, 31, 22]); // Algorithm H2PE\n\n}\n\n\n","file_path":"tests/complex/rand/rand_distr/tests/value_stability.rs","rank":98,"score":100624.01512182111},{"content":"#[test]\n\nfn binominal_stability() {\n\n // We have multiple code paths: np < 10, p > 0.5\n\n test_samples(353, Binomial::new(2, 0.7).unwrap(), &[1, 1, 2, 1]);\n\n test_samples(353, Binomial::new(20, 0.3).unwrap(), &[7, 7, 5, 7]);\n\n test_samples(353, Binomial::new(2000, 0.6).unwrap(), &[1194, 1208, 1192, 1210]);\n\n}\n\n\n","file_path":"tests/complex/rand/rand_distr/tests/value_stability.rs","rank":99,"score":100624.01512182111}],"string":"[\n {\n \"content\": \"fn is_shuffle_attr(attr: &str) -> bool {\\n\\n match attr {\\n\\n SHUFFLE_ATTR_NAME => true,\\n\\n _ => false,\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/shuffle.rs\",\n \"rank\": 1,\n \"score\": 200775.69576019843\n },\n {\n \"content\": \"/// Render a sparkline of `data` into `buffer`.\\n\\npub fn render_f64(data: &[f64], buffer: &mut String) {\\n\\n match data.len() {\\n\\n 0 => {\\n\\n return;\\n\\n },\\n\\n 1 => {\\n\\n if data[0] == 0. {\\n\\n buffer.push(TICKS[0]);\\n\\n } else {\\n\\n buffer.push(TICKS[N - 1]);\\n\\n }\\n\\n return;\\n\\n },\\n\\n _ => {},\\n\\n }\\n\\n for x in data {\\n\\n assert!(x.is_finite(), \\\"can only render finite values\\\");\\n\\n }\\n\\n let max = data.iter().fold(\\n\\n core::f64::NEG_INFINITY, |a, &b| a.max(b));\\n\\n let min = data.iter().fold(\\n\\n core::f64::INFINITY, |a, &b| a.min(b));\\n\\n let scale = ((N - 1) as f64) / (max - min);\\n\\n for x in data {\\n\\n let tick = ((x - min) * scale) as usize;\\n\\n buffer.push(TICKS[tick]);\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"tests/complex/rand/rand_distr/tests/sparkline.rs\",\n \"rank\": 2,\n \"score\": 199403.9762400479\n },\n {\n \"content\": \"/// Render a sparkline of `data` into `buffer`.\\n\\npub fn render_u64(data: &[u64], buffer: &mut String) {\\n\\n match data.len() {\\n\\n 0 => {\\n\\n return;\\n\\n },\\n\\n 1 => {\\n\\n if data[0] == 0 {\\n\\n buffer.push(TICKS[0]);\\n\\n } else {\\n\\n buffer.push(TICKS[N - 1]);\\n\\n }\\n\\n return;\\n\\n },\\n\\n _ => {},\\n\\n }\\n\\n let max = data.iter().max().unwrap();\\n\\n let min = data.iter().min().unwrap();\\n\\n let scale = ((N - 1) as f64) / ((max - min) as f64);\\n\\n for i in data {\\n\\n let tick = (((i - min) as f64) * scale) as usize;\\n\\n buffer.push(TICKS[tick]);\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"tests/complex/rand/rand_distr/tests/sparkline.rs\",\n \"rank\": 3,\n \"score\": 199403.9762400479\n },\n {\n \"content\": \"pub fn decrypt_memory<Cipher>(ctx: MemoryEncryptionCtx<Cipher>) -> Vec<u8>\\n\\nwhere\\n\\n Cipher: NewAead,\\n\\n Cipher: Aead,\\n\\n Cipher::KeySize: IsEqual<U32, Output = True>,\\n\\n //TODO: Should probably redo nonce generation to be generic enough for things like AES-GCM that use 96 bit nonces\\n\\n Cipher::NonceSize: IsEqual<U24, Output = True>,\\n\\n{\\n\\n let cipher = Cipher::new(&ctx.key);\\n\\n let output = cipher\\n\\n .decrypt(&ctx.nonce, ctx.ciphertext.as_slice())\\n\\n .unwrap();\\n\\n //println!(\\\"We decrypted data: {:#x?}\\\", output);\\n\\n output\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/crypto.rs\",\n \"rank\": 4,\n \"score\": 198655.31671893373\n },\n {\n \"content\": \"/// Randomly sample exactly `amount` indices from `0..length`, using rejection\\n\\n/// sampling.\\n\\n///\\n\\n/// Since `amount <<< length` there is a low chance of a random sample in\\n\\n/// `0..length` being a duplicate. We test for duplicates and resample where\\n\\n/// necessary. The algorithm is `O(amount)` time and memory.\\n\\n///\\n\\n/// This function is generic over X primarily so that results are value-stable\\n\\n/// over 32-bit and 64-bit platforms.\\n\\nfn sample_rejection<X: UInt, R>(rng: &mut R, length: X, amount: X) -> IndexVec\\n\\nwhere\\n\\n R: Rng + ?Sized,\\n\\n IndexVec: From<Vec<X>>,\\n\\n{\\n\\n debug_assert!(amount < length);\\n\\n #[cfg(feature = \\\"std\\\")]\\n\\n let mut cache = HashSet::with_capacity(amount.as_usize());\\n\\n #[cfg(not(feature = \\\"std\\\"))]\\n\\n let mut cache = BTreeSet::new();\\n\\n let distr = Uniform::new(X::zero(), length);\\n\\n let mut indices = Vec::with_capacity(amount.as_usize());\\n\\n for _ in 0..amount.as_usize() {\\n\\n let mut pos = distr.sample(rng);\\n\\n while !cache.insert(pos) {\\n\\n pos = distr.sample(rng);\\n\\n }\\n\\n indices.push(pos);\\n\\n }\\n\\n\\n\",\n \"file_path\": \"tests/complex/rand/src/seq/index.rs\",\n \"rank\": 5,\n \"score\": 196501.0072550791\n },\n {\n \"content\": \"#[bench]\\n\\nfn misc_gen_bool_const(b: &mut Bencher) {\\n\\n let mut rng = Pcg32::from_rng(&mut thread_rng()).unwrap();\\n\\n b.iter(|| {\\n\\n let mut accum = true;\\n\\n for _ in 0..crate::RAND_BENCH_N {\\n\\n accum ^= rng.gen_bool(0.18);\\n\\n }\\n\\n accum\\n\\n })\\n\\n}\\n\\n\\n\",\n \"file_path\": \"tests/complex/rand/benches/misc.rs\",\n \"rank\": 6,\n \"score\": 189890.03344174867\n },\n {\n \"content\": \"#[bench]\\n\\nfn misc_gen_bool_var(b: &mut Bencher) {\\n\\n let mut rng = Pcg32::from_rng(&mut thread_rng()).unwrap();\\n\\n b.iter(|| {\\n\\n let mut accum = true;\\n\\n let mut p = 0.18;\\n\\n for _ in 0..crate::RAND_BENCH_N {\\n\\n accum ^= rng.gen_bool(p);\\n\\n p += 0.0001;\\n\\n }\\n\\n accum\\n\\n })\\n\\n}\\n\\n\\n\",\n \"file_path\": \"tests/complex/rand/benches/misc.rs\",\n \"rank\": 7,\n \"score\": 189890.03344174867\n },\n {\n \"content\": \"fn get_rng(seed: u64) -> impl rand::Rng {\\n\\n // For tests, we want a statistically good, fast, reproducible RNG.\\n\\n // PCG32 will do fine, and will be easy to embed if we ever need to.\\n\\n const INC: u64 = 11634580027462260723;\\n\\n rand_pcg::Pcg32::new(seed, INC)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"tests/complex/rand/rand_distr/tests/value_stability.rs\",\n \"rank\": 8,\n \"score\": 181956.75139399408\n },\n {\n \"content\": \"fn get_attr_name(attr: &Attribute) -> String {\\n\\n attr.path\\n\\n .get_ident()\\n\\n .map_or(String::new(), |ident| ident.to_string())\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/shuffle.rs\",\n \"rank\": 9,\n \"score\": 172076.52723262477\n },\n {\n \"content\": \"/// Implement `fill_bytes` via `next_u64` and `next_u32`, little-endian order.\\n\\n///\\n\\n/// The fastest way to fill a slice is usually to work as long as possible with\\n\\n/// integers. That is why this method mostly uses `next_u64`, and only when\\n\\n/// there are 4 or less bytes remaining at the end of the slice it uses\\n\\n/// `next_u32` once.\\n\\npub fn fill_bytes_via_next<R: RngCore + ?Sized>(rng: &mut R, dest: &mut [u8]) {\\n\\n let mut left = dest;\\n\\n while left.len() >= 8 {\\n\\n let (l, r) = { left }.split_at_mut(8);\\n\\n left = r;\\n\\n let chunk: [u8; 8] = rng.next_u64().to_le_bytes();\\n\\n l.copy_from_slice(&chunk);\\n\\n }\\n\\n let n = left.len();\\n\\n if n > 4 {\\n\\n let chunk: [u8; 8] = rng.next_u64().to_le_bytes();\\n\\n left.copy_from_slice(&chunk[..n]);\\n\\n } else if n > 0 {\\n\\n let chunk: [u8; 4] = rng.next_u32().to_le_bytes();\\n\\n left.copy_from_slice(&chunk[..n]);\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"tests/complex/rand/rand_core/src/impls.rs\",\n \"rank\": 10,\n \"score\": 167696.06562961618\n },\n {\n \"content\": \"fn compile_test(path: &str) -> ExitStatus {\\n\\n let _lock = lock_filesystem();\\n\\n\\n\\n let config = R2D2Config {\\n\\n dest_name: Some(TEST_DIRECTORY),\\n\\n cargo_args: None,\\n\\n need_run: false,\\n\\n need_obfuscate: true,\\n\\n obfuscate_dir: Some(path),\\n\\n stream_output: false,\\n\\n };\\n\\n\\n\\n build(&config).unwrap()\\n\\n}\\n\\n\\n\",\n \"file_path\": \"tests/test_driver.rs\",\n \"rank\": 11,\n \"score\": 166972.15095646938\n },\n {\n \"content\": \"fn functional_test(path: &str) -> ExitStatus {\\n\\n let _lock = lock_filesystem();\\n\\n\\n\\n let config = R2D2Config {\\n\\n dest_name: Some(TEST_DIRECTORY),\\n\\n cargo_args: None,\\n\\n need_run: true,\\n\\n need_obfuscate: true,\\n\\n obfuscate_dir: Some(path),\\n\\n stream_output: false,\\n\\n };\\n\\n\\n\\n build(&config).unwrap()\\n\\n}\\n\\n\\n\\nmod single {\\n\\n use crate::*;\\n\\n\\n\\n #[test]\\n\\n fn hello_world_compile() {\\n\",\n \"file_path\": \"tests/test_driver.rs\",\n \"rank\": 12,\n \"score\": 166972.15095646938\n },\n {\n \"content\": \"/// Render a sparkline of `data` into a newly allocated string.\\n\\npub fn render_f64_as_string(data: &[f64]) -> String {\\n\\n let cap = required_capacity(data.len());\\n\\n let mut s = String::with_capacity(cap);\\n\\n render_f64(data, &mut s);\\n\\n debug_assert_eq!(s.capacity(), cap);\\n\\n s\\n\\n}\\n\\n\\n\\n#[cfg(test)]\\n\\nmod tests {\\n\\n #[test]\\n\\n fn render_u64() {\\n\\n let data = [2, 250, 670, 890, 2, 430, 11, 908, 123, 57];\\n\\n let mut s = String::with_capacity(super::required_capacity(data.len()));\\n\\n super::render_u64(&data, &mut s);\\n\\n println!(\\\"{}\\\", s);\\n\\n assert_eq!(\\\"▁▂▆▇▁▄▁█▁▁\\\", &s);\\n\\n }\\n\\n\\n\\n #[test]\\n\",\n \"file_path\": \"tests/complex/rand/rand_distr/tests/sparkline.rs\",\n \"rank\": 13,\n \"score\": 161470.10360984172\n },\n {\n \"content\": \"/// Render a sparkline of `data` into a newly allocated string.\\n\\npub fn render_u64_as_string(data: &[u64]) -> String {\\n\\n let cap = required_capacity(data.len());\\n\\n let mut s = String::with_capacity(cap);\\n\\n render_u64(data, &mut s);\\n\\n debug_assert_eq!(s.capacity(), cap);\\n\\n s\\n\\n}\\n\\n\\n\",\n \"file_path\": \"tests/complex/rand/rand_distr/tests/sparkline.rs\",\n \"rank\": 14,\n \"score\": 161470.10360984172\n },\n {\n \"content\": \"// Run a single simulation of the Monty Hall problem.\\n\\nfn simulate<R: Rng>(random_door: &Uniform<u32>, rng: &mut R) -> SimulationResult {\\n\\n let car = random_door.sample(rng);\\n\\n\\n\\n // This is our initial choice\\n\\n let mut choice = random_door.sample(rng);\\n\\n\\n\\n // The game host opens a door\\n\\n let open = game_host_open(car, choice, rng);\\n\\n\\n\\n // Shall we switch?\\n\\n let switch = rng.gen();\\n\\n if switch {\\n\\n choice = switch_door(choice, open);\\n\\n }\\n\\n\\n\\n SimulationResult {\\n\\n win: choice == car,\\n\\n switch,\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"tests/complex/rand/examples/monty-hall.rs\",\n \"rank\": 15,\n \"score\": 157427.47716006348\n },\n {\n \"content\": \"/// Implement `fill_bytes` by reading chunks from the output buffer of a block\\n\\n/// based RNG.\\n\\n///\\n\\n/// The return values are `(consumed_u32, filled_u8)`.\\n\\n///\\n\\n/// `filled_u8` is the number of filled bytes in `dest`, which may be less than\\n\\n/// the length of `dest`.\\n\\n/// `consumed_u32` is the number of words consumed from `src`, which is the same\\n\\n/// as `filled_u8 / 4` rounded up.\\n\\n///\\n\\n/// # Example\\n\\n/// (from `IsaacRng`)\\n\\n///\\n\\n/// ```ignore\\n\\n/// fn fill_bytes(&mut self, dest: &mut [u8]) {\\n\\n/// let mut read_len = 0;\\n\\n/// while read_len < dest.len() {\\n\\n/// if self.index >= self.rsl.len() {\\n\\n/// self.isaac();\\n\\n/// }\\n\\n///\\n\\n/// let (consumed_u32, filled_u8) =\\n\\n/// impls::fill_via_u32_chunks(&mut self.rsl[self.index..],\\n\\n/// &mut dest[read_len..]);\\n\\n///\\n\\n/// self.index += consumed_u32;\\n\\n/// read_len += filled_u8;\\n\\n/// }\\n\\n/// }\\n\\n/// ```\\n\\npub fn fill_via_u32_chunks(src: &[u32], dest: &mut [u8]) -> (usize, usize) {\\n\\n fill_via_chunks(src, dest)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"tests/complex/rand/rand_core/src/impls.rs\",\n \"rank\": 17,\n \"score\": 156795.79655065638\n },\n {\n \"content\": \"/// Implement `fill_bytes` by reading chunks from the output buffer of a block\\n\\n/// based RNG.\\n\\n///\\n\\n/// The return values are `(consumed_u64, filled_u8)`.\\n\\n/// `filled_u8` is the number of filled bytes in `dest`, which may be less than\\n\\n/// the length of `dest`.\\n\\n/// `consumed_u64` is the number of words consumed from `src`, which is the same\\n\\n/// as `filled_u8 / 8` rounded up.\\n\\n///\\n\\n/// See `fill_via_u32_chunks` for an example.\\n\\npub fn fill_via_u64_chunks(src: &[u64], dest: &mut [u8]) -> (usize, usize) {\\n\\n fill_via_chunks(src, dest)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"tests/complex/rand/rand_core/src/impls.rs\",\n \"rank\": 18,\n \"score\": 156783.69864844374\n },\n {\n \"content\": \"fn fill_via_chunks<T: Observable>(src: &[T], dest: &mut [u8]) -> (usize, usize) {\\n\\n let size = core::mem::size_of::<T>();\\n\\n let byte_len = min(src.len() * size, dest.len());\\n\\n let num_chunks = (byte_len + size - 1) / size;\\n\\n\\n\\n if cfg!(target_endian = \\\"little\\\") {\\n\\n // On LE we can do a simple copy, which is 25-50% faster:\\n\\n dest[..byte_len].copy_from_slice(&T::as_byte_slice(&src[..num_chunks])[..byte_len]);\\n\\n } else {\\n\\n // This code is valid on all arches, but slower than the above:\\n\\n let mut i = 0;\\n\\n let mut iter = dest[..byte_len].chunks_exact_mut(size);\\n\\n for chunk in &mut iter {\\n\\n chunk.copy_from_slice(src[i].to_le_bytes().as_ref());\\n\\n i += 1;\\n\\n }\\n\\n let chunk = iter.into_remainder();\\n\\n if !chunk.is_empty() {\\n\\n chunk.copy_from_slice(&src[i].to_le_bytes().as_ref()[..chunk.len()]);\\n\\n }\\n\\n }\\n\\n\\n\\n (num_chunks, byte_len)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"tests/complex/rand/rand_core/src/impls.rs\",\n \"rank\": 19,\n \"score\": 155112.16375628894\n },\n {\n \"content\": \"#[bench]\\n\\nfn seq_shuffle_100(b: &mut Bencher) {\\n\\n let mut rng = SmallRng::from_rng(thread_rng()).unwrap();\\n\\n let x: &mut [usize] = &mut [1; 100];\\n\\n b.iter(|| {\\n\\n x.shuffle(&mut rng);\\n\\n x[0]\\n\\n })\\n\\n}\\n\\n\\n\",\n \"file_path\": \"tests/complex/rand/benches/seq.rs\",\n \"rank\": 20,\n \"score\": 154793.50824039622\n },\n {\n \"content\": \"/// Implement `next_u64` via `fill_bytes`, little-endian order.\\n\\npub fn next_u64_via_fill<R: RngCore + ?Sized>(rng: &mut R) -> u64 {\\n\\n let mut buf = [0; 8];\\n\\n rng.fill_bytes(&mut buf);\\n\\n u64::from_le_bytes(buf)\\n\\n}\\n\\n\\n\\n#[cfg(test)]\\n\\nmod test {\\n\\n use super::*;\\n\\n\\n\\n #[test]\\n\\n fn test_fill_via_u32_chunks() {\\n\\n let src = [1, 2, 3];\\n\\n let mut dst = [0u8; 11];\\n\\n assert_eq!(fill_via_u32_chunks(&src, &mut dst), (3, 11));\\n\\n assert_eq!(dst, [1, 0, 0, 0, 2, 0, 0, 0, 3, 0, 0]);\\n\\n\\n\\n let mut dst = [0u8; 13];\\n\\n assert_eq!(fill_via_u32_chunks(&src, &mut dst), (3, 12));\\n\\n assert_eq!(dst, [1, 0, 0, 0, 2, 0, 0, 0, 3, 0, 0, 0, 0]);\\n\",\n \"file_path\": \"tests/complex/rand/rand_core/src/impls.rs\",\n \"rank\": 21,\n \"score\": 154566.00033659214\n },\n {\n \"content\": \"/// Implement `next_u64` via `next_u32`, little-endian order.\\n\\npub fn next_u64_via_u32<R: RngCore + ?Sized>(rng: &mut R) -> u64 {\\n\\n // Use LE; we explicitly generate one value before the next.\\n\\n let x = u64::from(rng.next_u32());\\n\\n let y = u64::from(rng.next_u32());\\n\\n (y << 32) | x\\n\\n}\\n\\n\\n\",\n \"file_path\": \"tests/complex/rand/rand_core/src/impls.rs\",\n \"rank\": 22,\n \"score\": 154566.00033659214\n },\n {\n \"content\": \"/// Implement `next_u32` via `fill_bytes`, little-endian order.\\n\\npub fn next_u32_via_fill<R: RngCore + ?Sized>(rng: &mut R) -> u32 {\\n\\n let mut buf = [0; 4];\\n\\n rng.fill_bytes(&mut buf);\\n\\n u32::from_le_bytes(buf)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"tests/complex/rand/rand_core/src/impls.rs\",\n \"rank\": 23,\n \"score\": 154566.00033659214\n },\n {\n \"content\": \"// Returns the door the game host opens given our choice and knowledge of\\n\\n// where the car is. The game host will never open the door with the car.\\n\\nfn game_host_open<R: Rng>(car: u32, choice: u32, rng: &mut R) -> u32 {\\n\\n use rand::seq::SliceRandom;\\n\\n *free_doors(&[car, choice]).choose(rng).unwrap()\\n\\n}\\n\\n\\n\",\n \"file_path\": \"tests/complex/rand/examples/monty-hall.rs\",\n \"rank\": 24,\n \"score\": 153658.90607471575\n },\n {\n \"content\": \"#[bench]\\n\\nfn misc_bernoulli_const(b: &mut Bencher) {\\n\\n let mut rng = Pcg32::from_rng(&mut thread_rng()).unwrap();\\n\\n b.iter(|| {\\n\\n let d = rand::distributions::Bernoulli::new(0.18).unwrap();\\n\\n let mut accum = true;\\n\\n for _ in 0..crate::RAND_BENCH_N {\\n\\n accum ^= rng.sample(d);\\n\\n }\\n\\n accum\\n\\n })\\n\\n}\\n\\n\\n\",\n \"file_path\": \"tests/complex/rand/benches/misc.rs\",\n \"rank\": 25,\n \"score\": 152408.51998363313\n },\n {\n \"content\": \"#[bench]\\n\\nfn weighted_index_modification(b: &mut Bencher) {\\n\\n let mut rng = rand::thread_rng();\\n\\n let weights = [1u32, 2, 3, 0, 5, 6, 7, 1, 2, 3, 4, 5, 6, 7];\\n\\n let mut distr = WeightedIndex::new(weights.to_vec()).unwrap();\\n\\n b.iter(|| {\\n\\n distr.update_weights(&[(2, &4), (5, &1)]).unwrap();\\n\\n rng.sample(&distr)\\n\\n })\\n\\n}\\n\",\n \"file_path\": \"tests/complex/rand/benches/weighted.rs\",\n \"rank\": 26,\n \"score\": 152408.51998363313\n },\n {\n \"content\": \"#[bench]\\n\\nfn seq_iter_choose_from_1000(b: &mut Bencher) {\\n\\n let mut rng = SmallRng::from_rng(thread_rng()).unwrap();\\n\\n let x: &mut [usize] = &mut [1; 1000];\\n\\n for (i, r) in x.iter_mut().enumerate() {\\n\\n *r = i;\\n\\n }\\n\\n b.iter(|| {\\n\\n let mut s = 0;\\n\\n for _ in 0..RAND_BENCH_N {\\n\\n s += x.iter().choose(&mut rng).unwrap();\\n\\n }\\n\\n s\\n\\n });\\n\\n b.bytes = size_of::<usize>() as u64 * crate::RAND_BENCH_N;\\n\\n}\\n\\n\\n\",\n \"file_path\": \"tests/complex/rand/benches/seq.rs\",\n \"rank\": 27,\n \"score\": 152408.51998363313\n },\n {\n \"content\": \"#[bench]\\n\\nfn weighted_index_creation(b: &mut Bencher) {\\n\\n let mut rng = rand::thread_rng();\\n\\n let weights = [1u32, 2, 4, 0, 5, 1, 7, 1, 2, 3, 4, 5, 6, 7];\\n\\n b.iter(|| {\\n\\n let distr = WeightedIndex::new(weights.to_vec()).unwrap();\\n\\n rng.sample(distr)\\n\\n })\\n\\n}\\n\\n\\n\",\n \"file_path\": \"tests/complex/rand/benches/weighted.rs\",\n \"rank\": 28,\n \"score\": 152408.51998363313\n },\n {\n \"content\": \"#[bench]\\n\\nfn seq_slice_choose_1_of_1000(b: &mut Bencher) {\\n\\n let mut rng = SmallRng::from_rng(thread_rng()).unwrap();\\n\\n let x: &mut [usize] = &mut [1; 1000];\\n\\n for (i, r) in x.iter_mut().enumerate() {\\n\\n *r = i;\\n\\n }\\n\\n b.iter(|| {\\n\\n let mut s = 0;\\n\\n for _ in 0..RAND_BENCH_N {\\n\\n s += x.choose(&mut rng).unwrap();\\n\\n }\\n\\n s\\n\\n });\\n\\n b.bytes = size_of::<usize>() as u64 * crate::RAND_BENCH_N;\\n\\n}\\n\\n\\n\\nmacro_rules! seq_slice_choose_multiple {\\n\\n ($name:ident, $amount:expr, $length:expr) => {\\n\\n #[bench]\\n\\n fn $name(b: &mut Bencher) {\\n\",\n \"file_path\": \"tests/complex/rand/benches/seq.rs\",\n \"rank\": 29,\n \"score\": 152408.51998363313\n },\n {\n \"content\": \"#[bench]\\n\\nfn misc_bernoulli_var(b: &mut Bencher) {\\n\\n let mut rng = Pcg32::from_rng(&mut thread_rng()).unwrap();\\n\\n b.iter(|| {\\n\\n let mut accum = true;\\n\\n let mut p = 0.18;\\n\\n for _ in 0..crate::RAND_BENCH_N {\\n\\n let d = Bernoulli::new(p).unwrap();\\n\\n accum ^= rng.sample(d);\\n\\n p += 0.0001;\\n\\n }\\n\\n accum\\n\\n })\\n\\n}\\n\\n\\n\",\n \"file_path\": \"tests/complex/rand/benches/misc.rs\",\n \"rank\": 30,\n \"score\": 152408.51998363313\n },\n {\n \"content\": \"#[bench]\\n\\nfn gen_1kb_u16_fill(b: &mut Bencher) {\\n\\n let mut rng = Pcg64Mcg::from_rng(&mut thread_rng()).unwrap();\\n\\n let mut buf = [0u16; 512];\\n\\n b.iter(|| {\\n\\n rng.fill(&mut buf[..]);\\n\\n buf\\n\\n });\\n\\n b.bytes = 1024;\\n\\n}\\n\\n\\n\",\n \"file_path\": \"tests/complex/rand/benches/misc.rs\",\n \"rank\": 31,\n \"score\": 150124.39703239378\n },\n {\n \"content\": \"#[bench]\\n\\nfn misc_gen_ratio_const(b: &mut Bencher) {\\n\\n let mut rng = Pcg32::from_rng(&mut thread_rng()).unwrap();\\n\\n b.iter(|| {\\n\\n let mut accum = true;\\n\\n for _ in 0..crate::RAND_BENCH_N {\\n\\n accum ^= rng.gen_ratio(2, 3);\\n\\n }\\n\\n accum\\n\\n })\\n\\n}\\n\\n\\n\",\n \"file_path\": \"tests/complex/rand/benches/misc.rs\",\n \"rank\": 32,\n \"score\": 150124.39703239378\n },\n {\n \"content\": \"#[bench]\\n\\nfn seq_iter_choose_multiple_10_of_100(b: &mut Bencher) {\\n\\n let mut rng = SmallRng::from_rng(thread_rng()).unwrap();\\n\\n let x: &[usize] = &[1; 100];\\n\\n b.iter(|| x.iter().cloned().choose_multiple(&mut rng, 10))\\n\\n}\\n\\n\\n\",\n \"file_path\": \"tests/complex/rand/benches/seq.rs\",\n \"rank\": 33,\n \"score\": 150124.39703239375\n },\n {\n \"content\": \"#[bench]\\n\\nfn seq_iter_unhinted_choose_from_1000(b: &mut Bencher) {\\n\\n let mut rng = SmallRng::from_rng(thread_rng()).unwrap();\\n\\n let x: &[usize] = &[1; 1000];\\n\\n b.iter(|| {\\n\\n UnhintedIterator { iter: x.iter() }\\n\\n .choose(&mut rng)\\n\\n .unwrap()\\n\\n })\\n\\n}\\n\\n\\n\",\n \"file_path\": \"tests/complex/rand/benches/seq.rs\",\n \"rank\": 34,\n \"score\": 150124.39703239375\n },\n {\n \"content\": \"#[bench]\\n\\nfn misc_gen_ratio_var(b: &mut Bencher) {\\n\\n let mut rng = Pcg32::from_rng(&mut thread_rng()).unwrap();\\n\\n b.iter(|| {\\n\\n let mut accum = true;\\n\\n for i in 2..(crate::RAND_BENCH_N as u32 + 2) {\\n\\n accum ^= rng.gen_ratio(i, i + 1);\\n\\n }\\n\\n accum\\n\\n })\\n\\n}\\n\\n\\n\",\n \"file_path\": \"tests/complex/rand/benches/misc.rs\",\n \"rank\": 35,\n \"score\": 150124.39703239378\n },\n {\n \"content\": \"#[bench]\\n\\nfn gen_1kb_u64_fill(b: &mut Bencher) {\\n\\n let mut rng = Pcg64Mcg::from_rng(&mut thread_rng()).unwrap();\\n\\n let mut buf = [0u64; 128];\\n\\n b.iter(|| {\\n\\n rng.fill(&mut buf[..]);\\n\\n buf\\n\\n });\\n\\n b.bytes = 1024;\\n\\n}\\n\",\n \"file_path\": \"tests/complex/rand/benches/misc.rs\",\n \"rank\": 36,\n \"score\": 150124.39703239378\n },\n {\n \"content\": \"#[bench]\\n\\nfn gen_1kb_u64_iter_repeat(b: &mut Bencher) {\\n\\n use core::iter;\\n\\n let mut rng = Pcg64Mcg::from_rng(&mut thread_rng()).unwrap();\\n\\n b.iter(|| {\\n\\n let v: Vec<u64> = iter::repeat(()).map(|()| rng.gen()).take(128).collect();\\n\\n v\\n\\n });\\n\\n b.bytes = 1024;\\n\\n}\\n\\n\\n\",\n \"file_path\": \"tests/complex/rand/benches/misc.rs\",\n \"rank\": 37,\n \"score\": 147934.87323583412\n },\n {\n \"content\": \"#[bench]\\n\\nfn gen_1kb_u16_sample_iter(b: &mut Bencher) {\\n\\n let mut rng = Pcg64Mcg::from_rng(&mut thread_rng()).unwrap();\\n\\n b.iter(|| {\\n\\n let v: Vec<u16> = Standard.sample_iter(&mut rng).take(512).collect();\\n\\n v\\n\\n });\\n\\n b.bytes = 1024;\\n\\n}\\n\\n\\n\",\n \"file_path\": \"tests/complex/rand/benches/misc.rs\",\n \"rank\": 38,\n \"score\": 147934.87323583412\n },\n {\n \"content\": \"#[bench]\\n\\nfn gen_1kb_u16_gen_array(b: &mut Bencher) {\\n\\n let mut rng = Pcg64Mcg::from_rng(&mut thread_rng()).unwrap();\\n\\n b.iter(|| {\\n\\n // max supported array length is 32!\\n\\n let v: [[u16; 32]; 16] = rng.gen();\\n\\n v\\n\\n });\\n\\n b.bytes = 1024;\\n\\n}\\n\\n\\n\",\n \"file_path\": \"tests/complex/rand/benches/misc.rs\",\n \"rank\": 39,\n \"score\": 147934.87323583412\n },\n {\n \"content\": \"#[bench]\\n\\nfn gen_1kb_u64_sample_iter(b: &mut Bencher) {\\n\\n let mut rng = Pcg64Mcg::from_rng(&mut thread_rng()).unwrap();\\n\\n b.iter(|| {\\n\\n let v: Vec<u64> = Standard.sample_iter(&mut rng).take(128).collect();\\n\\n v\\n\\n });\\n\\n b.bytes = 1024;\\n\\n}\\n\\n\\n\",\n \"file_path\": \"tests/complex/rand/benches/misc.rs\",\n \"rank\": 40,\n \"score\": 147934.87323583412\n },\n {\n \"content\": \"#[bench]\\n\\nfn seq_iter_choose_multiple_fill_10_of_100(b: &mut Bencher) {\\n\\n let mut rng = SmallRng::from_rng(thread_rng()).unwrap();\\n\\n let x: &[usize] = &[1; 100];\\n\\n let mut buf = [0; 10];\\n\\n b.iter(|| x.iter().cloned().choose_multiple_fill(&mut rng, &mut buf))\\n\\n}\\n\\n\\n\\nmacro_rules! sample_indices {\\n\\n ($name:ident, $fn:ident, $amount:expr, $length:expr) => {\\n\\n #[bench]\\n\\n fn $name(b: &mut Bencher) {\\n\\n let mut rng = SmallRng::from_rng(thread_rng()).unwrap();\\n\\n b.iter(|| index::$fn(&mut rng, $length, $amount))\\n\\n }\\n\\n };\\n\\n}\\n\\n\\n\\nsample_indices!(misc_sample_indices_1_of_1k, sample, 1, 1000);\\n\\nsample_indices!(misc_sample_indices_10_of_1k, sample, 10, 1000);\\n\\nsample_indices!(misc_sample_indices_100_of_1k, sample, 100, 1000);\\n\",\n \"file_path\": \"tests/complex/rand/benches/seq.rs\",\n \"rank\": 41,\n \"score\": 147934.87323583412\n },\n {\n \"content\": \"#[bench]\\n\\nfn gen_1kb_u16_iter_repeat(b: &mut Bencher) {\\n\\n use core::iter;\\n\\n let mut rng = Pcg64Mcg::from_rng(&mut thread_rng()).unwrap();\\n\\n b.iter(|| {\\n\\n let v: Vec<u16> = iter::repeat(()).map(|()| rng.gen()).take(512).collect();\\n\\n v\\n\\n });\\n\\n b.bytes = 1024;\\n\\n}\\n\\n\\n\",\n \"file_path\": \"tests/complex/rand/benches/misc.rs\",\n \"rank\": 42,\n \"score\": 147934.87323583412\n },\n {\n \"content\": \"#[bench]\\n\\nfn seq_iter_window_hinted_choose_from_1000(b: &mut Bencher) {\\n\\n let mut rng = SmallRng::from_rng(thread_rng()).unwrap();\\n\\n let x: &[usize] = &[1; 1000];\\n\\n b.iter(|| {\\n\\n WindowHintedIterator {\\n\\n iter: x.iter(),\\n\\n window_size: 7,\\n\\n }\\n\\n .choose(&mut rng)\\n\\n })\\n\\n}\\n\\n\\n\",\n \"file_path\": \"tests/complex/rand/benches/seq.rs\",\n \"rank\": 43,\n \"score\": 147934.87323583412\n },\n {\n \"content\": \"#[bench]\\n\\nfn gen_1kb_u64_gen_array(b: &mut Bencher) {\\n\\n let mut rng = Pcg64Mcg::from_rng(&mut thread_rng()).unwrap();\\n\\n b.iter(|| {\\n\\n // max supported array length is 32!\\n\\n let v: [[u64; 32]; 4] = rng.gen();\\n\\n v\\n\\n });\\n\\n b.bytes = 1024;\\n\\n}\\n\\n\\n\",\n \"file_path\": \"tests/complex/rand/benches/misc.rs\",\n \"rank\": 44,\n \"score\": 147934.87323583412\n },\n {\n \"content\": \"struct SimulationResult {\\n\\n win: bool,\\n\\n switch: bool,\\n\\n}\\n\\n\\n\",\n \"file_path\": \"tests/complex/rand/examples/monty-hall.rs\",\n \"rank\": 45,\n \"score\": 146602.82809200988\n },\n {\n \"content\": \"#[cfg(feature = \\\"std\\\")]\\n\\n#[cfg_attr(doc_cfg, doc(cfg(feature = \\\"std\\\")))]\\n\\npub fn sample_weighted<R, F, X>(\\n\\n rng: &mut R, length: usize, weight: F, amount: usize,\\n\\n) -> Result<IndexVec, WeightedError>\\n\\nwhere\\n\\n R: Rng + ?Sized,\\n\\n F: Fn(usize) -> X,\\n\\n X: Into<f64>,\\n\\n{\\n\\n if length > (core::u32::MAX as usize) {\\n\\n sample_efraimidis_spirakis(rng, length, weight, amount)\\n\\n } else {\\n\\n assert!(amount <= core::u32::MAX as usize);\\n\\n let amount = amount as u32;\\n\\n let length = length as u32;\\n\\n sample_efraimidis_spirakis(rng, length, weight, amount)\\n\\n }\\n\\n}\\n\\n\\n\\n\\n\\n/// Randomly sample exactly `amount` distinct indices from `0..length`, and\\n\",\n \"file_path\": \"tests/complex/rand/src/seq/index.rs\",\n \"rank\": 46,\n \"score\": 146059.76829172584\n },\n {\n \"content\": \"#[cfg(feature = \\\"std\\\")]\\n\\nfn sample_efraimidis_spirakis<R, F, X, N>(\\n\\n rng: &mut R, length: N, weight: F, amount: N,\\n\\n) -> Result<IndexVec, WeightedError>\\n\\nwhere\\n\\n R: Rng + ?Sized,\\n\\n F: Fn(usize) -> X,\\n\\n X: Into<f64>,\\n\\n N: UInt,\\n\\n IndexVec: From<Vec<N>>,\\n\\n{\\n\\n if amount == N::zero() {\\n\\n return Ok(IndexVec::U32(Vec::new()));\\n\\n }\\n\\n\\n\\n if amount > length {\\n\\n panic!(\\\"`amount` of samples must be less than or equal to `length`\\\");\\n\\n }\\n\\n\\n\\n struct Element<N> {\\n\\n index: N,\\n\",\n \"file_path\": \"tests/complex/rand/src/seq/index.rs\",\n \"rank\": 47,\n \"score\": 143955.2869175397\n },\n {\n \"content\": \"pub fn encrypt_memory<Cipher>(data: &[u8]) -> MemoryEncryptionCtx<Cipher>\\n\\nwhere\\n\\n Cipher: NewAead,\\n\\n Cipher: Aead,\\n\\n Cipher::KeySize: IsEqual<U32, Output = True>,\\n\\n //TODO: Should probably redo nonce generation to be generic enough for things like AES-GCM that use 96 bit nonces\\n\\n Cipher::NonceSize: IsEqual<U24, Output = True>,\\n\\n{\\n\\n let mut key: Key<Cipher> = Default::default();\\n\\n OsRng.fill_bytes(&mut key);\\n\\n let cipher = Cipher::new(&key);\\n\\n let mut nonce: Nonce<Cipher> = Default::default();\\n\\n OsRng.fill_bytes(&mut nonce);\\n\\n\\n\\n let ciphertext = cipher.encrypt(&nonce, data).unwrap();\\n\\n\\n\\n //println!(\\\"We are encrypting data: {:#x?}\\\", data);\\n\\n //println!(\\\"Resulting ciphertext: {:#x?}\\\", ciphertext);\\n\\n\\n\\n MemoryEncryptionCtx::<Cipher> {\\n\\n key,\\n\\n nonce,\\n\\n ciphertext,\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/crypto.rs\",\n \"rank\": 48,\n \"score\": 143782.85645563394\n },\n {\n \"content\": \"pub fn obfuscate(input: &String) -> (String, Shatter) {\\n\\n let mut input2 = syn::parse_file(&input).unwrap();\\n\\n\\n\\n //eprintln!(\\\"INPUT: {:#?}\\\", input2);\\n\\n //eprintln!(\\\"INFORMAT: {}\\\", prettyplease::unparse(&input2));\\n\\n\\n\\n shuffle(&mut input2);\\n\\n encrypt_strings(&mut input2);\\n\\n let shatter = shatter(&mut input2);\\n\\n\\n\\n //eprintln!(\\\"OUTPUT: {:#?}\\\", input2);\\n\\n //eprintln!(\\\"OUTFORMAT: {}\\\", prettyplease::unparse(&input2));\\n\\n\\n\\n (prettyplease::unparse(&input2), shatter)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/lib.rs\",\n \"rank\": 49,\n \"score\": 143590.0505124228\n },\n {\n \"content\": \"fn main() {\\n\\n #[shuffle]\\n\\n let w = 1;\\n\\n #[shuffle]\\n\\n let x = 2;\\n\\n #[shuffle]\\n\\n let y = 3;\\n\\n #[shuffle]\\n\\n let z = 4;\\n\\n\\n\\n eprintln!(\\\"My values are {w}, {x}, {y}, {z}\\\");\\n\\n}\\n\",\n \"file_path\": \"tests/single/05-shuffle_let/src/main.rs\",\n \"rank\": 50,\n \"score\": 141186.25959910933\n },\n {\n \"content\": \"fn bench(c: &mut Criterion<CyclesPerByte>) {\\n\\n {\\n\\n let mut g = c.benchmark_group(\\\"exp\\\");\\n\\n distr_float!(g, \\\"exp\\\", f64, Exp::new(1.23 * 4.56).unwrap());\\n\\n distr_float!(g, \\\"exp1_specialized\\\", f64, Exp1);\\n\\n distr_float!(g, \\\"exp1_general\\\", f64, Exp::new(1.).unwrap());\\n\\n }\\n\\n\\n\\n {\\n\\n let mut g = c.benchmark_group(\\\"normal\\\");\\n\\n distr_float!(g, \\\"normal\\\", f64, Normal::new(-1.23, 4.56).unwrap());\\n\\n distr_float!(g, \\\"standardnormal_specialized\\\", f64, StandardNormal);\\n\\n distr_float!(g, \\\"standardnormal_general\\\", f64, Normal::new(0., 1.).unwrap());\\n\\n distr_float!(g, \\\"log_normal\\\", f64, LogNormal::new(-1.23, 4.56).unwrap());\\n\\n g.throughput(Throughput::Bytes(size_of::<f64>() as u64 * RAND_BENCH_N));\\n\\n g.bench_function(\\\"iter\\\", |c| {\\n\\n let mut rng = Pcg64Mcg::from_entropy();\\n\\n let distr = Normal::new(-2.71828, 3.14159).unwrap();\\n\\n let mut iter = distr.sample_iter(&mut rng);\\n\\n\\n\",\n \"file_path\": \"tests/complex/rand/rand_distr/benches/src/distributions.rs\",\n \"rank\": 51,\n \"score\": 140743.59395395612\n },\n {\n \"content\": \"fn main() -> io::Result<()> {\\n\\n let matches = app_from_crate!()\\n\\n .global_setting(AppSettings::PropagateVersion)\\n\\n .global_setting(AppSettings::UseLongFormatForHelpSubcommand)\\n\\n .setting(AppSettings::SubcommandRequiredElseHelp)\\n\\n .subcommand(\\n\\n App::new(\\\"build\\\")\\n\\n .about(\\\"Compile a local package and all of its dependencies\\\")\\n\\n .arg(\\n\\n arg!(args: [args])\\n\\n .help(\\\"Arguments to pass to cargo\\\")\\n\\n .multiple_occurrences(true)\\n\\n .last(true)\\n\\n .required(false),\\n\\n ),\\n\\n )\\n\\n .subcommand(\\n\\n App::new(\\\"check\\\")\\n\\n .about(\\n\\n \\\"Analyze the current package and report errors, but don't build object files\\\",\\n\",\n \"file_path\": \"src/main.rs\",\n \"rank\": 52,\n \"score\": 139437.15292166607\n },\n {\n \"content\": \"#[inline]\\n\\npub fn read_u32_into(src: &[u8], dst: &mut [u32]) {\\n\\n assert!(src.len() >= 4 * dst.len());\\n\\n for (out, chunk) in dst.iter_mut().zip(src.chunks_exact(4)) {\\n\\n *out = u32::from_le_bytes(chunk.try_into().unwrap());\\n\\n }\\n\\n}\\n\\n\\n\\n/// Reads unsigned 64 bit integers from `src` into `dst`.\\n\",\n \"file_path\": \"tests/complex/rand/rand_core/src/le.rs\",\n \"rank\": 53,\n \"score\": 133779.66537439695\n },\n {\n \"content\": \"#[inline]\\n\\npub fn read_u64_into(src: &[u8], dst: &mut [u64]) {\\n\\n assert!(src.len() >= 8 * dst.len());\\n\\n for (out, chunk) in dst.iter_mut().zip(src.chunks_exact(8)) {\\n\\n *out = u64::from_le_bytes(chunk.try_into().unwrap());\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"tests/complex/rand/rand_core/src/le.rs\",\n \"rank\": 54,\n \"score\": 133779.66537439695\n },\n {\n \"content\": \"/// Calculate the required capacity for the sparkline, given the length of the\\n\\n/// input data.\\n\\npub fn required_capacity(len: usize) -> usize {\\n\\n len * TICKS[0].len_utf8()\\n\\n}\\n\\n\\n\",\n \"file_path\": \"tests/complex/rand/rand_distr/tests/sparkline.rs\",\n \"rank\": 55,\n \"score\": 127915.21073131854\n },\n {\n \"content\": \"//TODO: This and the shuffle finding are inefficient, try and remove all the cloning\\n\\nfn stmt_contains_shuffle_attr(stmt: &Stmt) -> bool {\\n\\n let mut cloned = stmt.to_owned();\\n\\n let cloned_attrs = cloned.get_attrs();\\n\\n if cloned_attrs.is_none() {\\n\\n return false;\\n\\n }\\n\\n let cloned_attrs_ref = cloned_attrs.unwrap();\\n\\n contains_shuffle_attr(cloned_attrs_ref)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/shuffle.rs\",\n \"rank\": 56,\n \"score\": 127835.88251154618\n },\n {\n \"content\": \"pub fn shuffle(input: &mut File) {\\n\\n Shuffle.visit_file_mut(input);\\n\\n}\\n\",\n \"file_path\": \"src/shuffle.rs\",\n \"rank\": 57,\n \"score\": 127256.676756378\n },\n {\n \"content\": \"#[allow(clippy::many_single_char_names)]\\n\\n#[inline(always)]\\n\\nfn refill_wide_impl<Mach: Machine>(\\n\\n m: Mach, state: &mut ChaCha, drounds: u32, out: &mut [u32; BUFSZ],\\n\\n) {\\n\\n let k = m.vec([0x6170_7865, 0x3320_646e, 0x7962_2d32, 0x6b20_6574]);\\n\\n let b = m.unpack(state.b);\\n\\n let c = m.unpack(state.c);\\n\\n let mut x = State {\\n\\n a: Mach::u32x4x4::from_lanes([k, k, k, k]),\\n\\n b: Mach::u32x4x4::from_lanes([b, b, b, b]),\\n\\n c: Mach::u32x4x4::from_lanes([c, c, c, c]),\\n\\n d: d0123(m, state.d),\\n\\n };\\n\\n for _ in 0..drounds {\\n\\n x = round(x);\\n\\n x = undiagonalize(round(diagonalize(x)));\\n\\n }\\n\\n let kk = Mach::u32x4x4::from_lanes([k, k, k, k]);\\n\\n let sb = m.unpack(state.b);\\n\\n let sb = Mach::u32x4x4::from_lanes([sb, sb, sb, sb]);\\n\\n let sc = m.unpack(state.c);\\n\",\n \"file_path\": \"tests/complex/rand/rand_chacha/src/guts.rs\",\n \"rank\": 59,\n \"score\": 125062.13970760752\n },\n {\n \"content\": \"fn contains_shuffle_attr(attrs: &Vec<Attribute>) -> bool {\\n\\n for attr in attrs {\\n\\n if is_shuffle_attr(&get_attr_name(&attr)) {\\n\\n return true;\\n\\n }\\n\\n }\\n\\n return false;\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/shuffle.rs\",\n \"rank\": 60,\n \"score\": 124685.52817994912\n },\n {\n \"content\": \"#[inline]\\n\\nfn gen_index<R: Rng + ?Sized>(rng: &mut R, ubound: usize) -> usize {\\n\\n if ubound <= (core::u32::MAX as usize) {\\n\\n rng.gen_range(0..ubound as u32) as usize\\n\\n } else {\\n\\n rng.gen_range(0..ubound)\\n\\n }\\n\\n}\\n\\n\\n\\n\\n\\n#[cfg(test)]\\n\\nmod test {\\n\\n use super::*;\\n\\n #[cfg(feature = \\\"alloc\\\")] use crate::Rng;\\n\\n #[cfg(all(feature = \\\"alloc\\\", not(feature = \\\"std\\\")))] use alloc::vec::Vec;\\n\\n\\n\\n #[test]\\n\\n fn test_slice_choose() {\\n\\n let mut r = crate::test::rng(107);\\n\\n let chars = [\\n\\n 'a', 'b', 'c', 'd', 'e', 'f', 'g', 'h', 'i', 'j', 'k', 'l', 'm', 'n',\\n\",\n \"file_path\": \"tests/complex/rand/src/seq/mod.rs\",\n \"rank\": 61,\n \"score\": 124521.27699663631\n },\n {\n \"content\": \"#[inline(always)]\\n\\nfn output_dxsm(state: u128) -> u64 {\\n\\n // See https://github.com/imneme/pcg-cpp/blob/ffd522e7188bef30a00c74dc7eb9de5faff90092/include/pcg_random.hpp#L1016\\n\\n // for a short discussion of the construction and its original implementation.\\n\\n let mut hi = (state >> 64) as u64;\\n\\n let mut lo = state as u64;\\n\\n\\n\\n lo |= 1;\\n\\n hi ^= hi >> 32;\\n\\n hi = hi.wrapping_mul(MULTIPLIER);\\n\\n hi ^= hi >> 48;\\n\\n hi = hi.wrapping_mul(lo);\\n\\n\\n\\n hi\\n\\n}\\n\",\n \"file_path\": \"tests/complex/rand/rand_pcg/src/pcg128cm.rs\",\n \"rank\": 62,\n \"score\": 123516.96977193466\n },\n {\n \"content\": \"/// Randomly sample exactly `amount` indices from `0..length`, using Floyd's\\n\\n/// combination algorithm.\\n\\n///\\n\\n/// The output values are fully shuffled. (Overhead is under 50%.)\\n\\n///\\n\\n/// This implementation uses `O(amount)` memory and `O(amount^2)` time.\\n\\nfn sample_floyd<R>(rng: &mut R, length: u32, amount: u32) -> IndexVec\\n\\nwhere R: Rng + ?Sized {\\n\\n // For small amount we use Floyd's fully-shuffled variant. For larger\\n\\n // amounts this is slow due to Vec::insert performance, so we shuffle\\n\\n // afterwards. Benchmarks show little overhead from extra logic.\\n\\n let floyd_shuffle = amount < 50;\\n\\n\\n\\n debug_assert!(amount <= length);\\n\\n let mut indices = Vec::with_capacity(amount as usize);\\n\\n for j in length - amount..length {\\n\\n let t = rng.gen_range(0..=j);\\n\\n if floyd_shuffle {\\n\\n if let Some(pos) = indices.iter().position(|&x| x == t) {\\n\\n indices.insert(pos, j);\\n\\n continue;\\n\\n }\\n\\n } else if indices.contains(&t) {\\n\\n indices.push(j);\\n\\n continue;\\n\\n }\\n\",\n \"file_path\": \"tests/complex/rand/src/seq/index.rs\",\n \"rank\": 63,\n \"score\": 122802.2836603257\n },\n {\n \"content\": \"/// Randomly sample exactly `amount` indices from `0..length`, using an inplace\\n\\n/// partial Fisher-Yates method.\\n\\n/// Sample an amount of indices using an inplace partial fisher yates method.\\n\\n///\\n\\n/// This allocates the entire `length` of indices and randomizes only the first `amount`.\\n\\n/// It then truncates to `amount` and returns.\\n\\n///\\n\\n/// This method is not appropriate for large `length` and potentially uses a lot\\n\\n/// of memory; because of this we only implement for `u32` index (which improves\\n\\n/// performance in all cases).\\n\\n///\\n\\n/// Set-up is `O(length)` time and memory and shuffling is `O(amount)` time.\\n\\nfn sample_inplace<R>(rng: &mut R, length: u32, amount: u32) -> IndexVec\\n\\nwhere R: Rng + ?Sized {\\n\\n debug_assert!(amount <= length);\\n\\n let mut indices: Vec<u32> = Vec::with_capacity(length as usize);\\n\\n indices.extend(0..length);\\n\\n for i in 0..amount {\\n\\n let j: u32 = rng.gen_range(i..length);\\n\\n indices.swap(i as usize, j as usize);\\n\\n }\\n\\n indices.truncate(amount as usize);\\n\\n debug_assert_eq!(indices.len(), amount as usize);\\n\\n IndexVec::from(indices)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"tests/complex/rand/src/seq/index.rs\",\n \"rank\": 64,\n \"score\": 122801.20325872088\n },\n {\n \"content\": \"//TODO: Add configuration for conditional shatter injection\\n\\npub fn shatter(input: &mut File) -> Shatter {\\n\\n let mut state = Shatter {\\n\\n inside_unsafe_block: false,\\n\\n integrity_checks: Vec::new(),\\n\\n };\\n\\n Shatter::visit_file_mut(&mut state, input);\\n\\n\\n\\n state\\n\\n}\\n\\n\\n\\n\\n\",\n \"file_path\": \"src/shatter.rs\",\n \"rank\": 65,\n \"score\": 122640.9022195175\n },\n {\n \"content\": \"#[inline(always)]\\n\\nfn output_xsl_rr(state: u128) -> u64 {\\n\\n // Output function XSL RR (\\\"xorshift low (bits), random rotation\\\")\\n\\n // Constants are for 128-bit state, 64-bit output\\n\\n const XSHIFT: u32 = 64; // (128 - 64 + 64) / 2\\n\\n const ROTATE: u32 = 122; // 128 - 6\\n\\n\\n\\n let rot = (state >> ROTATE) as u32;\\n\\n let xsl = ((state >> XSHIFT) as u64) ^ (state as u64);\\n\\n xsl.rotate_right(rot)\\n\\n}\\n\",\n \"file_path\": \"tests/complex/rand/rand_pcg/src/pcg128.rs\",\n \"rank\": 66,\n \"score\": 121412.3947287834\n },\n {\n \"content\": \"/// Randomly sample exactly `amount` distinct indices from `0..length`, and\\n\\n/// return them in random order (fully shuffled).\\n\\n///\\n\\n/// This method is used internally by the slice sampling methods, but it can\\n\\n/// sometimes be useful to have the indices themselves so this is provided as\\n\\n/// an alternative.\\n\\n///\\n\\n/// The implementation used is not specified; we automatically select the\\n\\n/// fastest available algorithm for the `length` and `amount` parameters\\n\\n/// (based on detailed profiling on an Intel Haswell CPU). Roughly speaking,\\n\\n/// complexity is `O(amount)`, except that when `amount` is small, performance\\n\\n/// is closer to `O(amount^2)`, and when `length` is close to `amount` then\\n\\n/// `O(length)`.\\n\\n///\\n\\n/// Note that performance is significantly better over `u32` indices than over\\n\\n/// `u64` indices. Because of this we hide the underlying type behind an\\n\\n/// abstraction, `IndexVec`.\\n\\n///\\n\\n/// If an allocation-free `no_std` function is required, it is suggested\\n\\n/// to adapt the internal `sample_floyd` implementation.\\n\\n///\\n\\n/// Panics if `amount > length`.\\n\\npub fn sample<R>(rng: &mut R, length: usize, amount: usize) -> IndexVec\\n\\nwhere R: Rng + ?Sized {\\n\\n if amount > length {\\n\\n panic!(\\\"`amount` of samples must be less than or equal to `length`\\\");\\n\\n }\\n\\n if length > (::core::u32::MAX as usize) {\\n\\n // We never want to use inplace here, but could use floyd's alg\\n\\n // Lazy version: always use the cache alg.\\n\\n return sample_rejection(rng, length, amount);\\n\\n }\\n\\n let amount = amount as u32;\\n\\n let length = length as u32;\\n\\n\\n\\n // Choice of algorithm here depends on both length and amount. See:\\n\\n // https://github.com/rust-random/rand/pull/479\\n\\n // We do some calculations with f32. Accuracy is not very important.\\n\\n\\n\\n if amount < 163 {\\n\\n const C: [[f32; 2]; 2] = [[1.6, 8.0 / 45.0], [10.0, 70.0 / 9.0]];\\n\\n let j = if length < 500_000 { 0 } else { 1 };\\n\",\n \"file_path\": \"tests/complex/rand/src/seq/index.rs\",\n \"rank\": 67,\n \"score\": 121306.89298548971\n },\n {\n \"content\": \"// Returns the door we switch to, given our current choice and\\n\\n// the open door. There will only be one valid door.\\n\\nfn switch_door(choice: u32, open: u32) -> u32 {\\n\\n free_doors(&[choice, open])[0]\\n\\n}\\n\\n\\n\",\n \"file_path\": \"tests/complex/rand/examples/monty-hall.rs\",\n \"rank\": 68,\n \"score\": 118860.16431749114\n },\n {\n \"content\": \"pub fn generate_temp_folder_name(name: Option<&str>) -> Utf8PathBuf {\\n\\n let mut output = Utf8PathBuf::from_path_buf(env::temp_dir()).unwrap();\\n\\n output.push(name.unwrap_or(\\\".r2d2_build_dir\\\"));\\n\\n output\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/lib.rs\",\n \"rank\": 69,\n \"score\": 115240.42158269743\n },\n {\n \"content\": \"pub fn build(config: &R2D2Config) -> io::Result<ExitStatus> {\\n\\n let src = get_src_dir();\\n\\n let mut dest = generate_temp_folder_name(config.dest_name);\\n\\n\\n\\n if let Ok(_) = std::fs::metadata(&dest) {\\n\\n //Clean up the folder if it already exists\\n\\n let _ = fs::remove_dir_all(&dest);\\n\\n }\\n\\n\\n\\n DirBuilder::new().recursive(true).create(&dest)?;\\n\\n\\n\\n copy_dir(&src.workspace_root, &dest)?;\\n\\n\\n\\n if let Some(partial) = config.obfuscate_dir {\\n\\n let mut true_dest_str = String::from(dest.as_str());\\n\\n true_dest_str.push(path::MAIN_SEPARATOR);\\n\\n true_dest_str.push_str(partial);\\n\\n\\n\\n dest = Utf8PathBuf::from(true_dest_str);\\n\\n }\\n\",\n \"file_path\": \"src/lib.rs\",\n \"rank\": 70,\n \"score\": 114395.07103281128\n },\n {\n \"content\": \"/// Convert a `f64` to an `i64`, panicking on overflow.\\n\\nfn f64_to_i64(x: f64) -> i64 {\\n\\n assert!(x < (core::i64::MAX as f64));\\n\\n x as i64\\n\\n}\\n\\n\\n\\nimpl Distribution<u64> for Binomial {\\n\\n #[allow(clippy::many_single_char_names)] // Same names as in the reference.\\n\\n fn sample<R: Rng + ?Sized>(&self, rng: &mut R) -> u64 {\\n\\n // Handle these values directly.\\n\\n if self.p == 0.0 {\\n\\n return 0;\\n\\n } else if self.p == 1.0 {\\n\\n return self.n;\\n\\n }\\n\\n\\n\\n // The binomial distribution is symmetrical with respect to p -> 1-p,\\n\\n // k -> n-k switch p so that it is less than 0.5 - this allows for lower\\n\\n // expected values we will just invert the result at the end\\n\\n let p = if self.p <= 0.5 { self.p } else { 1.0 - self.p };\\n\\n\\n\",\n \"file_path\": \"tests/complex/rand/rand_distr/src/binomial.rs\",\n \"rank\": 71,\n \"score\": 111627.12056082586\n },\n {\n \"content\": \"//TODO: Only copy differences with hashes/mtime checks\\n\\n//TODO: This needs to be optimized and cleaned up\\n\\n//TODO: Fix the error checking\\n\\npub fn copy_dir(from: &Utf8PathBuf, to: &Utf8PathBuf) -> io::Result<()> {\\n\\n let files: Vec<_> = WalkDir::new(from)\\n\\n .into_iter()\\n\\n .filter_entry(|e| {\\n\\n !e.file_name()\\n\\n .to_str()\\n\\n .map(|s| s.starts_with(\\\".\\\"))\\n\\n .unwrap_or(false)\\n\\n })\\n\\n .collect();\\n\\n\\n\\n if files.iter().all(|e| !e.is_ok()) {\\n\\n return Err(io::Error::new(\\n\\n ErrorKind::PermissionDenied,\\n\\n \\\"Some files can't be accessed\\\",\\n\\n ));\\n\\n }\\n\\n\\n\\n let (dirs, files): (Vec<Utf8PathBuf>, Vec<Utf8PathBuf>) = files\\n\\n .into_iter()\\n\",\n \"file_path\": \"src/lib.rs\",\n \"rank\": 72,\n \"score\": 110701.73855059085\n },\n {\n \"content\": \"pub fn obfuscate_dir(dir: &Utf8PathBuf) -> io::Result<Vec<Shatter>> {\\n\\n //WalkDir filter_entry will prevent the directory from being touched, so have to filter\\n\\n //manually\\n\\n\\n\\n let mut shatter_states: Vec<Shatter> = Vec::new();\\n\\n\\n\\n for file in WalkDir::new(dir) {\\n\\n let file_path = file?.into_path();\\n\\n if file_path.to_str().unwrap_or_default().ends_with(\\\".rs\\\") {\\n\\n let contents = fs::read_to_string(&file_path)?;\\n\\n let (obfuscated, shatter_state) = obfuscate(&contents);\\n\\n shatter_states.push(shatter_state);\\n\\n fs::write(&file_path, &obfuscated)?;\\n\\n }\\n\\n }\\n\\n Ok(shatter_states)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/lib.rs\",\n \"rank\": 73,\n \"score\": 110697.06301466672\n },\n {\n \"content\": \"pub fn get_src_dir() -> SourceInformation {\\n\\n let metadata = MetadataCommand::new().exec().unwrap();\\n\\n SourceInformation {\\n\\n workspace_root: metadata.workspace_root,\\n\\n target_dir: metadata.target_directory,\\n\\n }\\n\\n}\\n\\n\\n\\npub struct R2D2Config<'a> {\\n\\n pub dest_name: Option<&'a str>,\\n\\n pub cargo_args: Option<Vec<&'a str>>,\\n\\n pub need_run: bool,\\n\\n pub need_obfuscate: bool,\\n\\n pub obfuscate_dir: Option<&'a str>,\\n\\n pub stream_output: bool,\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/lib.rs\",\n \"rank\": 74,\n \"score\": 105573.88279165575\n },\n {\n \"content\": \"#[test]\\n\\nfn test_lcg128cmdxsm64_construction() {\\n\\n // Test that various construction techniques produce a working RNG.\\n\\n #[rustfmt::skip]\\n\\n let seed = [1,2,3,4, 5,6,7,8, 9,10,11,12, 13,14,15,16,\\n\\n 17,18,19,20, 21,22,23,24, 25,26,27,28, 29,30,31,32];\\n\\n let mut rng1 = Lcg128CmDxsm64::from_seed(seed);\\n\\n assert_eq!(rng1.next_u64(), 12201417210360370199);\\n\\n\\n\\n let mut rng2 = Lcg128CmDxsm64::from_rng(&mut rng1).unwrap();\\n\\n assert_eq!(rng2.next_u64(), 11487972556150888383);\\n\\n\\n\\n let mut rng3 = Lcg128CmDxsm64::seed_from_u64(0);\\n\\n assert_eq!(rng3.next_u64(), 4111470453933123814);\\n\\n\\n\\n // This is the same as Lcg128CmDxsm64, so we only have a single test:\\n\\n let mut rng4 = Pcg64Dxsm::seed_from_u64(0);\\n\\n assert_eq!(rng4.next_u64(), 4111470453933123814);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"tests/complex/rand/rand_pcg/tests/lcg128cmdxsm64.rs\",\n \"rank\": 75,\n \"score\": 104164.96528912253\n },\n {\n \"content\": \"#[test]\\n\\nfn test_lcg128cmdxsm64_advancing() {\\n\\n for seed in 0..20 {\\n\\n let mut rng1 = Lcg128CmDxsm64::seed_from_u64(seed);\\n\\n let mut rng2 = rng1.clone();\\n\\n for _ in 0..20 {\\n\\n rng1.next_u64();\\n\\n }\\n\\n rng2.advance(20);\\n\\n assert_eq!(rng1, rng2);\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"tests/complex/rand/rand_pcg/tests/lcg128cmdxsm64.rs\",\n \"rank\": 76,\n \"score\": 104164.96528912253\n },\n {\n \"content\": \"#[test]\\n\\nfn test_lcg128xsl64_reference() {\\n\\n // Numbers copied from official test suite (C version).\\n\\n let mut rng = Lcg128Xsl64::new(42, 54);\\n\\n\\n\\n let mut results = [0u64; 6];\\n\\n for i in results.iter_mut() {\\n\\n *i = rng.next_u64();\\n\\n }\\n\\n let expected: [u64; 6] = [\\n\\n 0x86b1da1d72062b68,\\n\\n 0x1304aa46c9853d39,\\n\\n 0xa3670e9e0dd50358,\\n\\n 0xf9090e529a7dae00,\\n\\n 0xc85b9fd837996f2c,\\n\\n 0x606121f8e3919196,\\n\\n ];\\n\\n assert_eq!(results, expected);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"tests/complex/rand/rand_pcg/tests/lcg128xsl64.rs\",\n \"rank\": 77,\n \"score\": 104164.96528912253\n },\n {\n \"content\": \"#[test]\\n\\nfn test_lcg128xsl64_advancing() {\\n\\n for seed in 0..20 {\\n\\n let mut rng1 = Lcg128Xsl64::seed_from_u64(seed);\\n\\n let mut rng2 = rng1.clone();\\n\\n for _ in 0..20 {\\n\\n rng1.next_u64();\\n\\n }\\n\\n rng2.advance(20);\\n\\n assert_eq!(rng1, rng2);\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"tests/complex/rand/rand_pcg/tests/lcg128xsl64.rs\",\n \"rank\": 78,\n \"score\": 104164.96528912253\n },\n {\n \"content\": \"#[test]\\n\\nfn test_lcg128xsl64_construction() {\\n\\n // Test that various construction techniques produce a working RNG.\\n\\n #[rustfmt::skip]\\n\\n let seed = [1,2,3,4, 5,6,7,8, 9,10,11,12, 13,14,15,16,\\n\\n 17,18,19,20, 21,22,23,24, 25,26,27,28, 29,30,31,32];\\n\\n let mut rng1 = Lcg128Xsl64::from_seed(seed);\\n\\n assert_eq!(rng1.next_u64(), 8740028313290271629);\\n\\n\\n\\n let mut rng2 = Lcg128Xsl64::from_rng(&mut rng1).unwrap();\\n\\n assert_eq!(rng2.next_u64(), 1922280315005786345);\\n\\n\\n\\n let mut rng3 = Lcg128Xsl64::seed_from_u64(0);\\n\\n assert_eq!(rng3.next_u64(), 2354861276966075475);\\n\\n\\n\\n // This is the same as Lcg128Xsl64, so we only have a single test:\\n\\n let mut rng4 = Pcg64::seed_from_u64(0);\\n\\n assert_eq!(rng4.next_u64(), 2354861276966075475);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"tests/complex/rand/rand_pcg/tests/lcg128xsl64.rs\",\n \"rank\": 79,\n \"score\": 104164.96528912253\n },\n {\n \"content\": \"#[test]\\n\\nfn test_mcg128xsl64_advancing() {\\n\\n for seed in 0..20 {\\n\\n let mut rng1 = Mcg128Xsl64::seed_from_u64(seed);\\n\\n let mut rng2 = rng1.clone();\\n\\n for _ in 0..20 {\\n\\n rng1.next_u64();\\n\\n }\\n\\n rng2.advance(20);\\n\\n assert_eq!(rng1, rng2);\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"tests/complex/rand/rand_pcg/tests/mcg128xsl64.rs\",\n \"rank\": 80,\n \"score\": 104164.96528912253\n },\n {\n \"content\": \"#[test]\\n\\nfn test_mcg128xsl64_reference() {\\n\\n // Numbers copied from official test suite (C version).\\n\\n let mut rng = Mcg128Xsl64::new(42);\\n\\n\\n\\n let mut results = [0u64; 6];\\n\\n for i in results.iter_mut() {\\n\\n *i = rng.next_u64();\\n\\n }\\n\\n let expected: [u64; 6] = [\\n\\n 0x63b4a3a813ce700a,\\n\\n 0x382954200617ab24,\\n\\n 0xa7fd85ae3fe950ce,\\n\\n 0xd715286aa2887737,\\n\\n 0x60c92fee2e59f32c,\\n\\n 0x84c4e96beff30017,\\n\\n ];\\n\\n assert_eq!(results, expected);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"tests/complex/rand/rand_pcg/tests/mcg128xsl64.rs\",\n \"rank\": 81,\n \"score\": 104164.96528912253\n },\n {\n \"content\": \"#[test]\\n\\nfn test_lcg64xsh32_construction() {\\n\\n // Test that various construction techniques produce a working RNG.\\n\\n let seed = [1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16];\\n\\n let mut rng1 = Lcg64Xsh32::from_seed(seed);\\n\\n assert_eq!(rng1.next_u64(), 1204678643940597513);\\n\\n\\n\\n let mut rng2 = Lcg64Xsh32::from_rng(&mut rng1).unwrap();\\n\\n assert_eq!(rng2.next_u64(), 12384929573776311845);\\n\\n\\n\\n let mut rng3 = Lcg64Xsh32::seed_from_u64(0);\\n\\n assert_eq!(rng3.next_u64(), 18195738587432868099);\\n\\n\\n\\n // This is the same as Lcg64Xsh32, so we only have a single test:\\n\\n let mut rng4 = Pcg32::seed_from_u64(0);\\n\\n assert_eq!(rng4.next_u64(), 18195738587432868099);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"tests/complex/rand/rand_pcg/tests/lcg64xsh32.rs\",\n \"rank\": 82,\n \"score\": 104164.96528912253\n },\n {\n \"content\": \"#[test]\\n\\nfn test_lcg128cmdxsm64_reference() {\\n\\n // Numbers determined using `pcg_engines::cm_setseq_dxsm_128_64` from pcg-cpp.\\n\\n let mut rng = Lcg128CmDxsm64::new(42, 54);\\n\\n\\n\\n let mut results = [0u64; 6];\\n\\n for i in results.iter_mut() {\\n\\n *i = rng.next_u64();\\n\\n }\\n\\n let expected: [u64; 6] = [\\n\\n 17331114245835578256,\\n\\n 10267467544499227306,\\n\\n 9726600296081716989,\\n\\n 10165951391103677450,\\n\\n 12131334649314727261,\\n\\n 10134094537930450875,\\n\\n ];\\n\\n assert_eq!(results, expected);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"tests/complex/rand/rand_pcg/tests/lcg128cmdxsm64.rs\",\n \"rank\": 83,\n \"score\": 104164.96528912253\n },\n {\n \"content\": \"#[test]\\n\\nfn test_mcg128xsl64_construction() {\\n\\n // Test that various construction techniques produce a working RNG.\\n\\n let seed = [1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16];\\n\\n let mut rng1 = Mcg128Xsl64::from_seed(seed);\\n\\n assert_eq!(rng1.next_u64(), 7071994460355047496);\\n\\n\\n\\n let mut rng2 = Mcg128Xsl64::from_rng(&mut rng1).unwrap();\\n\\n assert_eq!(rng2.next_u64(), 12300796107712034932);\\n\\n\\n\\n let mut rng3 = Mcg128Xsl64::seed_from_u64(0);\\n\\n assert_eq!(rng3.next_u64(), 6198063878555692194);\\n\\n\\n\\n // This is the same as Mcg128Xsl64, so we only have a single test:\\n\\n let mut rng4 = Pcg64Mcg::seed_from_u64(0);\\n\\n assert_eq!(rng4.next_u64(), 6198063878555692194);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"tests/complex/rand/rand_pcg/tests/mcg128xsl64.rs\",\n \"rank\": 84,\n \"score\": 104164.96528912253\n },\n {\n \"content\": \"#[test]\\n\\nfn test_lcg64xsh32_reference() {\\n\\n // Numbers copied from official test suite.\\n\\n let mut rng = Lcg64Xsh32::new(42, 54);\\n\\n\\n\\n let mut results = [0u32; 6];\\n\\n for i in results.iter_mut() {\\n\\n *i = rng.next_u32();\\n\\n }\\n\\n let expected: [u32; 6] = [\\n\\n 0xa15c02b7, 0x7b47f409, 0xba1d3330, 0x83d2f293, 0xbfa4784b, 0xcbed606e,\\n\\n ];\\n\\n assert_eq!(results, expected);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"tests/complex/rand/rand_pcg/tests/lcg64xsh32.rs\",\n \"rank\": 85,\n \"score\": 104164.96528912253\n },\n {\n \"content\": \"#[test]\\n\\nfn test_lcg64xsh32_advancing() {\\n\\n for seed in 0..20 {\\n\\n let mut rng1 = Lcg64Xsh32::seed_from_u64(seed);\\n\\n let mut rng2 = rng1.clone();\\n\\n for _ in 0..20 {\\n\\n rng1.next_u32();\\n\\n }\\n\\n rng2.advance(20);\\n\\n assert_eq!(rng1, rng2);\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"tests/complex/rand/rand_pcg/tests/lcg64xsh32.rs\",\n \"rank\": 86,\n \"score\": 104164.96528912253\n },\n {\n \"content\": \"#[cfg(feature = \\\"serde1\\\")]\\n\\n#[test]\\n\\nfn test_lcg128cmdxsm64_serde() {\\n\\n use bincode;\\n\\n use std::io::{BufReader, BufWriter};\\n\\n\\n\\n let mut rng = Lcg128CmDxsm64::seed_from_u64(0);\\n\\n\\n\\n let buf: Vec<u8> = Vec::new();\\n\\n let mut buf = BufWriter::new(buf);\\n\\n bincode::serialize_into(&mut buf, &rng).expect(\\\"Could not serialize\\\");\\n\\n\\n\\n let buf = buf.into_inner().unwrap();\\n\\n let mut read = BufReader::new(&buf[..]);\\n\\n let mut deserialized: Lcg128CmDxsm64 =\\n\\n bincode::deserialize_from(&mut read).expect(\\\"Could not deserialize\\\");\\n\\n\\n\\n for _ in 0..16 {\\n\\n assert_eq!(rng.next_u64(), deserialized.next_u64());\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"tests/complex/rand/rand_pcg/tests/lcg128cmdxsm64.rs\",\n \"rank\": 87,\n \"score\": 104164.79789396032\n },\n {\n \"content\": \"#[cfg(feature = \\\"serde1\\\")]\\n\\n#[test]\\n\\nfn test_lcg128xsl64_serde() {\\n\\n use bincode;\\n\\n use std::io::{BufReader, BufWriter};\\n\\n\\n\\n let mut rng = Lcg128Xsl64::seed_from_u64(0);\\n\\n\\n\\n let buf: Vec<u8> = Vec::new();\\n\\n let mut buf = BufWriter::new(buf);\\n\\n bincode::serialize_into(&mut buf, &rng).expect(\\\"Could not serialize\\\");\\n\\n\\n\\n let buf = buf.into_inner().unwrap();\\n\\n let mut read = BufReader::new(&buf[..]);\\n\\n let mut deserialized: Lcg128Xsl64 =\\n\\n bincode::deserialize_from(&mut read).expect(\\\"Could not deserialize\\\");\\n\\n\\n\\n for _ in 0..16 {\\n\\n assert_eq!(rng.next_u64(), deserialized.next_u64());\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"tests/complex/rand/rand_pcg/tests/lcg128xsl64.rs\",\n \"rank\": 88,\n \"score\": 104164.79789396032\n },\n {\n \"content\": \"#[cfg(feature = \\\"serde1\\\")]\\n\\n#[test]\\n\\nfn test_lcg64xsh32_serde() {\\n\\n use bincode;\\n\\n use std::io::{BufReader, BufWriter};\\n\\n\\n\\n let mut rng = Lcg64Xsh32::seed_from_u64(0);\\n\\n\\n\\n let buf: Vec<u8> = Vec::new();\\n\\n let mut buf = BufWriter::new(buf);\\n\\n bincode::serialize_into(&mut buf, &rng).expect(\\\"Could not serialize\\\");\\n\\n\\n\\n let buf = buf.into_inner().unwrap();\\n\\n let mut read = BufReader::new(&buf[..]);\\n\\n let mut deserialized: Lcg64Xsh32 =\\n\\n bincode::deserialize_from(&mut read).expect(\\\"Could not deserialize\\\");\\n\\n\\n\\n for _ in 0..16 {\\n\\n assert_eq!(rng.next_u64(), deserialized.next_u64());\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"tests/complex/rand/rand_pcg/tests/lcg64xsh32.rs\",\n \"rank\": 89,\n \"score\": 104164.79789396032\n },\n {\n \"content\": \"#[cfg(feature = \\\"serde1\\\")]\\n\\n#[test]\\n\\nfn test_mcg128xsl64_serde() {\\n\\n use bincode;\\n\\n use std::io::{BufReader, BufWriter};\\n\\n\\n\\n let mut rng = Mcg128Xsl64::seed_from_u64(0);\\n\\n\\n\\n let buf: Vec<u8> = Vec::new();\\n\\n let mut buf = BufWriter::new(buf);\\n\\n bincode::serialize_into(&mut buf, &rng).expect(\\\"Could not serialize\\\");\\n\\n\\n\\n let buf = buf.into_inner().unwrap();\\n\\n let mut read = BufReader::new(&buf[..]);\\n\\n let mut deserialized: Mcg128Xsl64 =\\n\\n bincode::deserialize_from(&mut read).expect(\\\"Could not deserialize\\\");\\n\\n\\n\\n for _ in 0..16 {\\n\\n assert_eq!(rng.next_u64(), deserialized.next_u64());\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"tests/complex/rand/rand_pcg/tests/mcg128xsl64.rs\",\n \"rank\": 90,\n \"score\": 104164.79789396032\n },\n {\n \"content\": \"#[test]\\n\\nfn normal() {\\n\\n const N_SAMPLES: u64 = 1_000_000;\\n\\n const MEAN: f64 = 2.;\\n\\n const STD_DEV: f64 = 0.5;\\n\\n const MIN_X: f64 = -1.;\\n\\n const MAX_X: f64 = 5.;\\n\\n\\n\\n let dist = Normal::new(MEAN, STD_DEV).unwrap();\\n\\n let mut hist = Histogram100::with_const_width(MIN_X, MAX_X);\\n\\n let mut rng = rand::rngs::SmallRng::seed_from_u64(1);\\n\\n\\n\\n for _ in 0..N_SAMPLES {\\n\\n let _ = hist.add(rng.sample(dist)); // Ignore out-of-range values\\n\\n }\\n\\n\\n\\n println!(\\n\\n \\\"Sampled normal distribution:\\\\n{}\\\",\\n\\n sparkline::render_u64_as_string(hist.bins())\\n\\n );\\n\\n\\n\",\n \"file_path\": \"tests/complex/rand/rand_distr/tests/pdf.rs\",\n \"rank\": 91,\n \"score\": 103424.04217583881\n },\n {\n \"content\": \"#[test]\\n\\nfn test_read() {\\n\\n let bytes = [1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16];\\n\\n\\n\\n let mut buf = [0u32; 4];\\n\\n read_u32_into(&bytes, &mut buf);\\n\\n assert_eq!(buf[0], 0x04030201);\\n\\n assert_eq!(buf[3], 0x100F0E0D);\\n\\n\\n\\n let mut buf = [0u32; 3];\\n\\n read_u32_into(&bytes[1..13], &mut buf); // unaligned\\n\\n assert_eq!(buf[0], 0x05040302);\\n\\n assert_eq!(buf[2], 0x0D0C0B0A);\\n\\n\\n\\n let mut buf = [0u64; 2];\\n\\n read_u64_into(&bytes, &mut buf);\\n\\n assert_eq!(buf[0], 0x0807060504030201);\\n\\n assert_eq!(buf[1], 0x100F0E0D0C0B0A09);\\n\\n\\n\\n let mut buf = [0u64; 1];\\n\\n read_u64_into(&bytes[7..15], &mut buf); // unaligned\\n\\n assert_eq!(buf[0], 0x0F0E0D0C0B0A0908);\\n\\n}\\n\",\n \"file_path\": \"tests/complex/rand/rand_core/src/le.rs\",\n \"rank\": 92,\n \"score\": 101997.16742505129\n },\n {\n \"content\": \"#[test]\\n\\nfn skew_normal() {\\n\\n const N_SAMPLES: u64 = 1_000_000;\\n\\n const LOCATION: f64 = 2.;\\n\\n const SCALE: f64 = 0.5;\\n\\n const SHAPE: f64 = -3.0;\\n\\n const MIN_X: f64 = -1.;\\n\\n const MAX_X: f64 = 4.;\\n\\n\\n\\n let dist = SkewNormal::new(LOCATION, SCALE, SHAPE).unwrap();\\n\\n let mut hist = Histogram100::with_const_width(MIN_X, MAX_X);\\n\\n let mut rng = rand::rngs::SmallRng::seed_from_u64(1);\\n\\n\\n\\n for _ in 0..N_SAMPLES {\\n\\n let _ = hist.add(rng.sample(dist)); // Ignore out-of-range values\\n\\n }\\n\\n\\n\\n println!(\\n\\n \\\"Sampled skew normal distribution:\\\\n{}\\\",\\n\\n sparkline::render_u64_as_string(hist.bins())\\n\\n );\\n\",\n \"file_path\": \"tests/complex/rand/rand_distr/tests/pdf.rs\",\n \"rank\": 93,\n \"score\": 101997.16742505129\n },\n {\n \"content\": \"#[test]\\n\\nfn test_construction() {\\n\\n let mut rng = OsRng::default();\\n\\n assert!(rng.next_u64() != 0);\\n\\n}\\n\",\n \"file_path\": \"tests/complex/rand/rand_core/src/os.rs\",\n \"rank\": 94,\n \"score\": 101997.16742505129\n },\n {\n \"content\": \"#[test]\\n\\nfn unit_sphere() {\\n\\n const N_DIM: usize = 3;\\n\\n let h = Histogram100::with_const_width(-1., 1.);\\n\\n let mut histograms = [h.clone(), h.clone(), h];\\n\\n let dist = rand_distr::UnitSphere;\\n\\n let mut rng = rand_pcg::Pcg32::from_entropy();\\n\\n for _ in 0..N_SAMPLES {\\n\\n let v: [f64; 3] = dist.sample(&mut rng);\\n\\n for i in 0..N_DIM {\\n\\n histograms[i]\\n\\n .add(v[i])\\n\\n .map_err(|e| {\\n\\n println!(\\\"v: {}\\\", v[i]);\\n\\n e\\n\\n })\\n\\n .unwrap();\\n\\n }\\n\\n }\\n\\n for h in &histograms {\\n\\n let sum: u64 = h.bins().iter().sum();\\n\\n println!(\\\"{:?}\\\", h);\\n\\n for &b in h.bins() {\\n\\n let p = (b as f64) / (sum as f64);\\n\\n assert!((p - 1.0 / (N_BINS as f64)).abs() < TOL, \\\"{}\\\", p);\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"tests/complex/rand/rand_distr/tests/uniformity.rs\",\n \"rank\": 95,\n \"score\": 101997.16742505129\n },\n {\n \"content\": \"#[test]\\n\\nfn unit_circle() {\\n\\n use core::f64::consts::PI;\\n\\n let mut h = Histogram100::with_const_width(-PI, PI);\\n\\n let dist = rand_distr::UnitCircle;\\n\\n let mut rng = rand_pcg::Pcg32::from_entropy();\\n\\n for _ in 0..N_SAMPLES {\\n\\n let v: [f64; 2] = dist.sample(&mut rng);\\n\\n h.add(v[0].atan2(v[1])).unwrap();\\n\\n }\\n\\n let sum: u64 = h.bins().iter().sum();\\n\\n println!(\\\"{:?}\\\", h);\\n\\n for &b in h.bins() {\\n\\n let p = (b as f64) / (sum as f64);\\n\\n assert!((p - 1.0 / (N_BINS as f64)).abs() < TOL, \\\"{}\\\", p);\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"tests/complex/rand/rand_distr/tests/uniformity.rs\",\n \"rank\": 96,\n \"score\": 101997.16742505129\n },\n {\n \"content\": \"#[test]\\n\\nfn geometric_stability() {\\n\\n test_samples(464, StandardGeometric, &[3, 0, 1, 0, 0, 3, 2, 1, 2, 0]);\\n\\n \\n\\n test_samples(464, Geometric::new(0.5).unwrap(), &[2, 1, 1, 0, 0, 1, 0, 1]);\\n\\n test_samples(464, Geometric::new(0.05).unwrap(), &[24, 51, 81, 67, 27, 11, 7, 6]);\\n\\n test_samples(464, Geometric::new(0.95).unwrap(), &[0, 0, 0, 0, 1, 0, 0, 0]);\\n\\n\\n\\n // expect non-random behaviour for series of pre-determined trials\\n\\n test_samples(464, Geometric::new(0.0).unwrap(), &[u64::max_value(); 100][..]);\\n\\n test_samples(464, Geometric::new(1.0).unwrap(), &[0; 100][..]);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"tests/complex/rand/rand_distr/tests/value_stability.rs\",\n \"rank\": 97,\n \"score\": 100624.01512182111\n },\n {\n \"content\": \"#[test]\\n\\nfn hypergeometric_stability() {\\n\\n // We have multiple code paths based on the distribution's mode and sample_size\\n\\n test_samples(7221, Hypergeometric::new(99, 33, 8).unwrap(), &[4, 3, 2, 2, 3, 2, 3, 1]); // Algorithm HIN\\n\\n test_samples(7221, Hypergeometric::new(100, 50, 50).unwrap(), &[23, 27, 26, 27, 22, 24, 31, 22]); // Algorithm H2PE\\n\\n}\\n\\n\\n\",\n \"file_path\": \"tests/complex/rand/rand_distr/tests/value_stability.rs\",\n \"rank\": 98,\n \"score\": 100624.01512182111\n },\n {\n \"content\": \"#[test]\\n\\nfn binominal_stability() {\\n\\n // We have multiple code paths: np < 10, p > 0.5\\n\\n test_samples(353, Binomial::new(2, 0.7).unwrap(), &[1, 1, 2, 1]);\\n\\n test_samples(353, Binomial::new(20, 0.3).unwrap(), &[7, 7, 5, 7]);\\n\\n test_samples(353, Binomial::new(2000, 0.6).unwrap(), &[1194, 1208, 1192, 1210]);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"tests/complex/rand/rand_distr/tests/value_stability.rs\",\n \"rank\": 99,\n \"score\": 100624.01512182111\n }\n]","isConversational":false}}},{"rowIdx":2379,"cells":{"lang":{"kind":"string","value":"Rust"},"file_path":{"kind":"string","value":"src/connectivity/network/ping3/src/store.rs"},"repo_name":{"kind":"string","value":"EnderNightLord-ChromeBook/zircon-rpi"},"commit":{"kind":"string","value":"b09b1eb3aa7a127c65568229fe10edd251869283"},"file_code":{"kind":"string","value":"\n\nuse fuchsia_async as fasync;\nuse fuchsia_zircon as zx;\nuse thiserror::Error;\n\n#[derive(Clone)]\npub struct SequenceStore {\n \n next_seq: u16,\n\n \n last_seq: u16,\n\n \n \n start_time: zx::Time,\n}\n\n#[derive(Error, Debug)]\n#[error(\"No sequence numbers available\")]\npub struct OutOfSequencesError;\n\n#[derive(Error, Debug)]\npub enum GiveError {\n \n \n #[error(\"Sequence number received that has not been sent out yet\")]\n DoesNotExist(Option<zx::Duration>),\n\n \n \n #[error(\"Duplicate sequence number received\")]\n Duplicate(Option<zx::Duration>),\n\n \n \n #[error(\"Out-of-order sequence number received\")]\n OutOfOrder(Option<zx::Duration>),\n}\n\nimpl SequenceStore {\n \n pub fn new() -> Self {\n SequenceStore {\n next_seq: 0,\n last_seq: std::u16::MAX,\n start_time: fasync::Time::now().into_zx(),\n }\n }\n\n \n pub fn take(&mut self) -> Result<(u16, zx::Duration), OutOfSequencesError> {\n let seq_num = self.next_seq;\n let (next_seq, overflow) = self.next_seq.overflowing_add(1);\n self.next_seq = next_seq;\n if overflow {\n return Err(OutOfSequencesError);\n }\n let offset_from_start_time = fasync::Time::now().into_zx() - self.start_time;\n Ok((seq_num, offset_from_start_time))\n }\n\n \n \n pub fn give(\n &mut self,\n sequence_num: u16,\n offset_from_start_time: Option<zx::Duration>,\n ) -> Result<Option<zx::Duration>, GiveError> {\n let now = fasync::Time::now().into_zx();\n let latency = offset_from_start_time.map(|time| now - self.start_time - time);\n\n if sequence_num >= self.next_seq {\n return Err(GiveError::DoesNotExist(latency));\n }\n\n let (expected, _) = self.last_seq.overflowing_add(1);\n if sequence_num == expected {\n self.last_seq = sequence_num;\n Ok(latency)\n } else if sequence_num < expected {\n Err(GiveError::Duplicate(latency))\n } else {\n Err(GiveError::OutOfOrder(latency))\n }\n }\n}\n\n#[cfg(test)]\nmod test {\n use super::*;\n\n const SHORT_DELAY: zx::Duration = zx::Duration::from_nanos(1);\n\n #[test]\n fn take_all() {\n let _executor = fasync::Executor::new_with_fake_time().expect(\"Failed to create executor\");\n let mut s = SequenceStore::new();\n for i in 0..std::u16::MAX {\n assert_eq!(s.take().expect(\"Failed to take\").0, i);\n }\n }\n\n #[test]\n fn take_too_much() {\n let _executor = fasync::Executor::new_with_fake_time().expect(\"Failed to create executor\");\n let mut s = SequenceStore::new();\n for i in 0..std::u16::MAX {\n assert_eq!(s.take().expect(\"Failed to take\").0, i);\n }\n s.take().expect_err(\"There shouldn't be any more sequence numbers available\");\n }\n\n #[test]\n fn give_out_of_order() {\n let _executor = fasync::Executor::new_with_fake_time().expect(\"Failed to create executor\");\n let mut s = SequenceStore::new();\n s.take().expect(\"Failed to take\");\n let (n, _) = s.take().expect(\"Failed to take\");\n s.give(n, None).expect_err(\"Should error on out-of-order responses\");\n }\n\n #[test]\n fn give_duplicate() {\n let _executor = fasync::Executor::new_with_fake_time().expect(\"Failed to create executor\");\n let mut s = SequenceStore::new();\n s.give(42, None).expect_err(\"Should not be able to give seq_nums that haven't been given\");\n }\n\n #[test]\n fn give_same_number() {\n let _executor = fasync::Executor::new_with_fake_time().expect(\"Failed to create executor\");\n let mut s = SequenceStore::new();\n let (num, _) = s.take().expect(\"Failed to take\");\n s.give(num, None).expect(\"Failed to give\");\n s.give(num, None).expect_err(\"Should not be able to give duplicates\");\n }\n\n #[test]\n fn give_same_times() {\n let _executor = fasync::Executor::new_with_fake_time().expect(\"Failed to create executor\");\n let mut s = SequenceStore::new();\n\n let (_, a_time) = s.take().expect(\"Failed to take\");\n let (_, b_time) = s.take().expect(\"Failed to take\");\n assert_eq!(a_time, b_time);\n }\n\n #[test]\n fn give_different_times() {\n let executor = fasync::Executor::new_with_fake_time().expect(\"Failed to create executor\");\n let mut s = SequenceStore::new();\n\n let (_, a_time) = s.take().expect(\"Failed to take\");\n executor.set_fake_time(executor.now() + SHORT_DELAY);\n let (_, b_time) = s.take().expect(\"Failed to take\");\n assert_eq!(b_time - a_time, SHORT_DELAY);\n }\n\n #[test]\n fn give_latency() {\n let executor = fasync::Executor::new_with_fake_time().expect(\"Failed to create executor\");\n let mut s = SequenceStore::new();\n\n let (a, a_time) = s.take().expect(\"Failed to take\");\n executor.set_fake_time(executor.now() + SHORT_DELAY);\n\n let a_latency = s.give(a, Some(a_time)).expect(\"Failed to give\");\n assert_eq!(a_latency, Some(SHORT_DELAY));\n }\n\n #[test]\n fn give_same_latencies() {\n let executor = fasync::Executor::new_with_fake_time().expect(\"Failed to create executor\");\n let mut s = SequenceStore::new();\n\n let (a, a_time) = s.take().expect(\"Failed to take\");\n executor.set_fake_time(executor.now() + SHORT_DELAY);\n let (b, b_time) = s.take().expect(\"Failed to take\");\n\n let a_latency = s.give(a, Some(a_time)).expect(\"Failed to give\");\n executor.set_fake_time(executor.now() + SHORT_DELAY);\n let b_latency = s.give(b, Some(b_time)).expect(\"Failed to give\");\n assert_eq!(a_latency, b_latency);\n }\n\n #[test]\n fn give_different_latencies() {\n let executor = fasync::Executor::new_with_fake_time().expect(\"Failed to create executor\");\n let mut s = SequenceStore::new();\n\n let (a, a_time) = s.take().expect(\"Failed to take\");\n executor.set_fake_time(executor.now() + SHORT_DELAY);\n let (b, b_time) = s.take().expect(\"Failed to take\");\n\n let a_latency = s.give(a, Some(a_time)).expect(\"Failed to give\");\n let b_latency = s.give(b, Some(b_time)).expect(\"Failed to give\");\n assert_eq!(a_latency.unwrap() - b_latency.unwrap(), SHORT_DELAY);\n }\n}\n"},"prefix":{"kind":"string","value":"\n\nuse fuchsia_async as fasync;\nuse fuchsia_zircon as zx;\nuse thiserror::Error;\n\n#[derive(Clone)]\npub struct SequenceStore {\n \n next_seq: u16,\n\n \n last_seq: u16,\n\n \n \n start_time: zx::Time,\n}\n\n#[derive(Error, Debug)]\n#[error(\"No sequence numbers available\")]\npub struct OutOfSequencesError;\n\n#[derive(Error, Debug)]\npub enum GiveError {\n \n \n #[error(\"Sequence number received that has not been sent out yet\")]\n DoesNotExist(Option<zx::Duration>),\n\n \n \n #[error(\"Duplicate sequence number received\")]\n Duplicate(Option<zx::Duration>),\n\n \n \n #[error(\"Out-of-order sequence number received\")]\n OutOfOrder(Option<zx::Duration>),\n}\n\nimpl SequenceStore {\n \n pub fn new() -> Self {\n SequenceStore {\n next_seq: 0,\n last_seq: std::u16::MAX,\n start_time: fasync::Time::now().into_zx(),\n }\n }\n\n \n pub fn take(&mut self) -> Result<(u16, zx::Duration), OutOfSequencesError> {\n let seq_num = self.next_seq;\n let (next_seq, overflow) = self.next_seq.overflowing_add(1);\n self.next_seq = next_seq;\n if overflow {\n return Err(OutOfSequencesError);\n }\n let offset_from_start_time = fasync::Time::now().into_zx() - self.start_time;\n Ok((seq_num, offset_from_start_time))\n }\n\n \n \n pub fn give(\n &mut self,\n sequence_num: u16,\n offset_from_start_time: Option<zx::Duration>,\n ) -> Result<Option<zx::Duration>, GiveError> {\n let now = fasync::Time::now().into_zx();\n let latency = offset_from_start_time.map(|time| now - self.start_time - time);\n\n if sequence_num >= self.next_seq {\n return Err(GiveError::DoesNotExist(latency));\n }\n\n let (expected, _) = self.last_seq.overflowing_add(1);\n if sequence_num == expected {\n self.last_seq = sequence_num;\n Ok(latency)\n } else if sequence_num < expected {\n Err(GiveError::Duplicate(latency))\n } else {\n Err(GiveError::OutOfOrder(latency))\n }\n }\n}\n\n#[cfg(test)]\nmod test {\n use super::*;\n\n const SHORT_DELAY: zx::Duration = zx::Duration::from_nanos(1);\n\n #[test]\n fn take_all() {\n let _executor = fasync::Executor::new_with_fake_time().expect(\"Failed to create executor\");\n let mut s = SequenceStore::new();\n for i in 0..std::u16::MAX {\n assert_eq!(s.take().expect(\"Failed to take\").0, i);\n }\n }\n\n #[test]\n fn take_too_much() {\n let _executor = fasync::Executor::new_with_fake_time().expect(\"Failed to create executor\");\n let mut s = SequenceStore::new();\n for i in 0..std::u16::MAX {\n assert_eq!(s.take()"},"suffix":{"kind":"string","value":");\n let (_, b_time) = s.take().expect(\"Failed to take\");\n assert_eq!(b_time - a_time, SHORT_DELAY);\n }\n\n #[test]\n fn give_latency() {\n let executor = fasync::Executor::new_with_fake_time().expect(\"Failed to create executor\");\n let mut s = SequenceStore::new();\n\n let (a, a_time) = s.take().expect(\"Failed to take\");\n executor.set_fake_time(executor.now() + SHORT_DELAY);\n\n let a_latency = s.give(a, Some(a_time)).expect(\"Failed to give\");\n assert_eq!(a_latency, Some(SHORT_DELAY));\n }\n\n #[test]\n fn give_same_latencies() {\n let executor = fasync::Executor::new_with_fake_time().expect(\"Failed to create executor\");\n let mut s = SequenceStore::new();\n\n let (a, a_time) = s.take().expect(\"Failed to take\");\n executor.set_fake_time(executor.now() + SHORT_DELAY);\n let (b, b_time) = s.take().expect(\"Failed to take\");\n\n let a_latency = s.give(a, Some(a_time)).expect(\"Failed to give\");\n executor.set_fake_time(executor.now() + SHORT_DELAY);\n let b_latency = s.give(b, Some(b_time)).expect(\"Failed to give\");\n assert_eq!(a_latency, b_latency);\n }\n\n #[test]\n fn give_different_latencies() {\n let executor = fasync::Executor::new_with_fake_time().expect(\"Failed to create executor\");\n let mut s = SequenceStore::new();\n\n let (a, a_time) = s.take().expect(\"Failed to take\");\n executor.set_fake_time(executor.now() + SHORT_DELAY);\n let (b, b_time) = s.take().expect(\"Failed to take\");\n\n let a_latency = s.give(a, Some(a_time)).expect(\"Failed to give\");\n let b_latency = s.give(b, Some(b_time)).expect(\"Failed to give\");\n assert_eq!(a_latency.unwrap() - b_latency.unwrap(), SHORT_DELAY);\n }\n}\n"},"middle":{"kind":"string","value":".expect(\"Failed to take\").0, i);\n }\n s.take().expect_err(\"There shouldn't be any more sequence numbers available\");\n }\n\n #[test]\n fn give_out_of_order() {\n let _executor = fasync::Executor::new_with_fake_time().expect(\"Failed to create executor\");\n let mut s = SequenceStore::new();\n s.take().expect(\"Failed to take\");\n let (n, _) = s.take().expect(\"Failed to take\");\n s.give(n, None).expect_err(\"Should error on out-of-order responses\");\n }\n\n #[test]\n fn give_duplicate() {\n let _executor = fasync::Executor::new_with_fake_time().expect(\"Failed to create executor\");\n let mut s = SequenceStore::new();\n s.give(42, None).expect_err(\"Should not be able to give seq_nums that haven't been given\");\n }\n\n #[test]\n fn give_same_number() {\n let _executor = fasync::Executor::new_with_fake_time().expect(\"Failed to create executor\");\n let mut s = SequenceStore::new();\n let (num, _) = s.take().expect(\"Failed to take\");\n s.give(num, None).expect(\"Failed to give\");\n s.give(num, None).expect_err(\"Should not be able to give duplicates\");\n }\n\n #[test]\n fn give_same_times() {\n let _executor = fasync::Executor::new_with_fake_time().expect(\"Failed to create executor\");\n let mut s = SequenceStore::new();\n\n let (_, a_time) = s.take().expect(\"Failed to take\");\n let (_, b_time) = s.take().expect(\"Failed to take\");\n assert_eq!(a_time, b_time);\n }\n\n #[test]\n fn give_different_times() {\n let executor = fasync::Executor::new_with_fake_time().expect(\"Failed to create executor\");\n let mut s = SequenceStore::new();\n\n let (_, a_time) = s.take().expect(\"Failed to take\");\n executor.set_fake_time(executor.now() + SHORT_DELAY"},"strategy":{"kind":"string","value":"random"},"context_items":{"kind":"list like","value":[],"string":"[]","isConversational":false}}},{"rowIdx":2380,"cells":{"lang":{"kind":"string","value":"Rust"},"file_path":{"kind":"string","value":"src/application/core.rs"},"repo_name":{"kind":"string","value":"mass10/rzip"},"commit":{"kind":"string","value":"d9a3cf8dbe3208a382bd5da3d353331a27e59df0"},"file_code":{"kind":"string","value":"\n\nuse super::errors::ApplicationError;\nuse crate::configuration;\nuse crate::functions;\nuse std::io::Read;\n\n#[allow(unused)]\nfn matches(pattern: &str, text: &str) -> bool {\n\tlet reg = regex::Regex::new(pattern);\n\tif reg.is_err() {\n\t\tpanic!(\"[ERROR] Fatal error. (reason: {})\", reg.err().unwrap());\n\t\treturn false;\n\t}\n\tlet result = reg.unwrap().find(text);\n\tif result.is_none() {\n\t\treturn false;\n\t}\n\treturn true;\n}\n\npub struct Zipper;\n\nimpl Zipper {\n\t\n\t\n\t\n\t\n\tpub fn new() -> Zipper {\n\t\tlet instance = Zipper {};\n\t\treturn instance;\n\t}\n\n\t\n\t\n\t\n\t\n\t\n\t\n\tfn append_entry(&self, archiver: &mut zip::ZipWriter<std::fs::File>, base_name: &str, path: &str, settings: &configuration::Settings) -> Result<(), Box<dyn std::error::Error>> {\n\t\tuse crate::helpers::DirEntityHelper;\n\t\tuse crate::helpers::PathHelper;\n\t\tuse std::io::Write;\n\n\t\tlet unknown = std::path::Path::new(path);\n\t\tif unknown.is_dir() {\n\t\t\t\n\t\t\tlet name = unknown.name_as_str();\n\t\t\t\n\t\t\tif !settings.is_valid_dir(name) {\n\t\t\t\tprintln!(\"[INFO] IGNORE {}\", name);\n\t\t\t\treturn Ok(());\n\t\t\t}\n\n\t\t\t\n\t\t\tlet internal_path = functions::build_path(base_name, name);\n\n\t\t\t\n\t\t\tif base_name != \"\" {\n\t\t\t\tprintln!(\"[INFO] adding ... {}\", &base_name);\n\t\t\t\tlet options = zip::write::FileOptions::default().compression_method(zip::CompressionMethod::Stored);\n\t\t\t\tarchiver.add_directory(&internal_path, options)?;\n\t\t\t}\n\n\t\t\t\n\t\t\tlet it = std::fs::read_dir(path)?;\n\t\t\tfor e in it {\n\t\t\t\tlet entry = e?;\n\t\t\t\tlet fullpath = entry.path_as_string();\n\t\t\t\tself.append_entry(archiver, &internal_path, &fullpath, &settings)?;\n\t\t\t}\n\t\t} else if unknown.is_file() {\n\t\t\tuse crate::helpers::SystemTimeHelper;\n\t\t\t\n\t\t\tlet name = unknown.name_as_str();\n\t\t\t\n\t\t\tif !settings.is_valid_filename(name)? {\n\t\t\t\tprintln!(\"[INFO] IGNORE {}\", name);\n\t\t\t\treturn Ok(());\n\t\t\t}\n\n\t\t\tlet options = zip::write::FileOptions::default();\n\t\t\t\n\t\t\tlet internal_path = functions::build_path(base_name, name);\n\t\t\t\n\t\t\tlet meta = unknown.metadata()?;\n\t\t\t\n\t\t\tlet options = options.compression_method(zip::CompressionMethod::Stored);\n\t\t\t\n\t\t\tlet last_modified = meta.modified()?;\n\t\t\tlet last_modified = last_modified.as_ziptime();\n\t\t\tlet options = options.last_modified_time(last_modified);\n\n\t\t\t\n\t\t\tprintln!(\"[INFO] adding ... {}\", &internal_path);\n\t\t\tarchiver.start_file(&internal_path, options)?;\n\t\t\tlet mut stream = std::fs::File::open(path)?;\n\t\t\tloop {\n\t\t\t\tlet mut buffer = [0; 1000];\n\t\t\t\tlet bytes_read = stream.read(&mut buffer)?;\n\t\t\t\tif bytes_read == 0 {\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\tlet write_buffer = &buffer[..bytes_read];\n\t\t\t\tarchiver.write(&write_buffer)?;\n\t\t\t}\n\t\t} else {\n\t\t\tlet message = format!(\"Unknown filesystem [{}].\", path);\n\t\t\tlet err = ApplicationError::new(&message);\n\t\t\treturn Err(Box::new(err));\n\t\t}\n\n\t\treturn Ok(());\n\t}\n\n\t\n\t\n\t\n\t\n\tpub fn archive(&self, settings: &configuration::Settings, path: &str) -> Result<(), Box<dyn std::error::Error>> {\n\t\t\n\t\tlet path = functions::canonicalize_path(path)?;\n\t\t\n\t\tlet current_timestamp = functions::timestamp1();\n\t\t\n\t\tlet archive_path_name = format!(\"{}-{}.zip\", &path, ¤t_timestamp);\n\n\t\tprintln!(\"[INFO] archiving ... {} >> {}\", &path, &archive_path_name);\n\n\t\t\n\t\tfunctions::unlink(&archive_path_name)?;\n\n\t\t\n\t\tlet w = std::fs::File::create(archive_path_name)?;\n\t\tlet mut archiver = zip::ZipWriter::new(w);\n\n\t\t\n\t\tself.append_entry(&mut archiver, \"\", &path, &settings)?;\n\n\t\t\n\t\tarchiver.finish()?;\n\n\t\treturn Ok(());\n\t}\n}\n"},"prefix":{"kind":"string","value":"\n\nuse super::errors::ApplicationError;\nuse crate::configuration;\nuse crate::functions;\nuse std::io::Read;\n\n#[allow(unused)]\nfn matches(pattern: &str, text: &str) -> bool {\n\tlet reg = regex::Regex::new(pattern);\n\tif reg.is_err() {\n\t\tpani"},"suffix":{"kind":"string","value":"\n\npub struct Zipper;\n\nimpl Zipper {\n\t\n\t\n\t\n\t\n\tpub fn new() -> Zipper {\n\t\tlet instance = Zipper {};\n\t\treturn instance;\n\t}\n\n\t\n\t\n\t\n\t\n\t\n\t\n\tfn append_entry(&self, archiver: &mut zip::ZipWriter<std::fs::File>, base_name: &str, path: &str, settings: &configuration::Settings) -> Result<(), Box<dyn std::error::Error>> {\n\t\tuse crate::helpers::DirEntityHelper;\n\t\tuse crate::helpers::PathHelper;\n\t\tuse std::io::Write;\n\n\t\tlet unknown = std::path::Path::new(path);\n\t\tif unknown.is_dir() {\n\t\t\t\n\t\t\tlet name = unknown.name_as_str();\n\t\t\t\n\t\t\tif !settings.is_valid_dir(name) {\n\t\t\t\tprintln!(\"[INFO] IGNORE {}\", name);\n\t\t\t\treturn Ok(());\n\t\t\t}\n\n\t\t\t\n\t\t\tlet internal_path = functions::build_path(base_name, name);\n\n\t\t\t\n\t\t\tif base_name != \"\" {\n\t\t\t\tprintln!(\"[INFO] adding ... {}\", &base_name);\n\t\t\t\tlet options = zip::write::FileOptions::default().compression_method(zip::CompressionMethod::Stored);\n\t\t\t\tarchiver.add_directory(&internal_path, options)?;\n\t\t\t}\n\n\t\t\t\n\t\t\tlet it = std::fs::read_dir(path)?;\n\t\t\tfor e in it {\n\t\t\t\tlet entry = e?;\n\t\t\t\tlet fullpath = entry.path_as_string();\n\t\t\t\tself.append_entry(archiver, &internal_path, &fullpath, &settings)?;\n\t\t\t}\n\t\t} else if unknown.is_file() {\n\t\t\tuse crate::helpers::SystemTimeHelper;\n\t\t\t\n\t\t\tlet name = unknown.name_as_str();\n\t\t\t\n\t\t\tif !settings.is_valid_filename(name)? {\n\t\t\t\tprintln!(\"[INFO] IGNORE {}\", name);\n\t\t\t\treturn Ok(());\n\t\t\t}\n\n\t\t\tlet options = zip::write::FileOptions::default();\n\t\t\t\n\t\t\tlet internal_path = functions::build_path(base_name, name);\n\t\t\t\n\t\t\tlet meta = unknown.metadata()?;\n\t\t\t\n\t\t\tlet options = options.compression_method(zip::CompressionMethod::Stored);\n\t\t\t\n\t\t\tlet last_modified = meta.modified()?;\n\t\t\tlet last_modified = last_modified.as_ziptime();\n\t\t\tlet options = options.last_modified_time(last_modified);\n\n\t\t\t\n\t\t\tprintln!(\"[INFO] adding ... {}\", &internal_path);\n\t\t\tarchiver.start_file(&internal_path, options)?;\n\t\t\tlet mut stream = std::fs::File::open(path)?;\n\t\t\tloop {\n\t\t\t\tlet mut buffer = [0; 1000];\n\t\t\t\tlet bytes_read = stream.read(&mut buffer)?;\n\t\t\t\tif bytes_read == 0 {\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\tlet write_buffer = &buffer[..bytes_read];\n\t\t\t\tarchiver.write(&write_buffer)?;\n\t\t\t}\n\t\t} else {\n\t\t\tlet message = format!(\"Unknown filesystem [{}].\", path);\n\t\t\tlet err = ApplicationError::new(&message);\n\t\t\treturn Err(Box::new(err));\n\t\t}\n\n\t\treturn Ok(());\n\t}\n\n\t\n\t\n\t\n\t\n\tpub fn archive(&self, settings: &configuration::Settings, path: &str) -> Result<(), Box<dyn std::error::Error>> {\n\t\t\n\t\tlet path = functions::canonicalize_path(path)?;\n\t\t\n\t\tlet current_timestamp = functions::timestamp1();\n\t\t\n\t\tlet archive_path_name = format!(\"{}-{}.zip\", &path, ¤t_timestamp);\n\n\t\tprintln!(\"[INFO] archiving ... {} >> {}\", &path, &archive_path_name);\n\n\t\t\n\t\tfunctions::unlink(&archive_path_name)?;\n\n\t\t\n\t\tlet w = std::fs::File::create(archive_path_name)?;\n\t\tlet mut archiver = zip::ZipWriter::new(w);\n\n\t\t\n\t\tself.append_entry(&mut archiver, \"\", &path, &settings)?;\n\n\t\t\n\t\tarchiver.finish()?;\n\n\t\treturn Ok(());\n\t}\n}\n"},"middle":{"kind":"string","value":"c!(\"[ERROR] Fatal error. (reason: {})\", reg.err().unwrap());\n\t\treturn false;\n\t}\n\tlet result = reg.unwrap().find(text);\n\tif result.is_none() {\n\t\treturn false;\n\t}\n\treturn true;\n}"},"strategy":{"kind":"string","value":"function_block-function_prefixed"},"context_items":{"kind":"list like","value":[{"content":"/// Build a path from `path` and `name`.\n\n///\n\n/// # Arguments\n\n/// * `parent` Parent path.\n\n/// * `name` Name of the file or directory.\n\n///\n\n/// # Returns\n\n/// * Path to the file or directory.\n\npub fn build_path(parent: &str, name: &str) -> String {\n\n\tif parent == \"\" {\n\n\t\treturn name.to_string();\n\n\t}\n\n\treturn format!(\"{}/{}\", parent, name);\n\n}\n\n\n\n/// Get current time as a string in the format `%Y-%m-%d %H:%M:%S%.3f`.\n\n///\n\n/// # Returns\n\n/// Current time as a [String]\n","file_path":"src/functions/mod.rs","rank":1,"score":54275.675100441185},{"content":"/// マッチング記述文字列の終端文字を、適切なキャラクターに変換します。\n\n///\n\n/// # Arguments\n\n/// * `wildcard` マッチング記述文字列\n\n///\n\n/// # Returns\n\n/// 変換後の文字列\n\nfn tail(wildcard: &str) -> String {\n\n\tif wildcard.ends_with(\"*\") {\n\n\t\treturn wildcard.to_string();\n\n\t}\n\n\treturn format!(\"{}$\", wildcard);\n\n}\n\n\n","file_path":"src/configuration/mod.rs","rank":2,"score":52972.484416304935},{"content":"/// マッチング記述文字列の先頭文字を、適切なキャラクターに変換します。\n\n///\n\n/// # Arguments\n\n/// * `wildcard` マッチング記述文字列\n\n///\n\n/// # Returns\n\n/// 変換後の文字列\n\nfn head(wildcard: &str) -> String {\n\n\tif wildcard.starts_with(\"*\") {\n\n\t\treturn wildcard.to_string();\n\n\t}\n\n\treturn format!(\"^{}\", wildcard);\n\n}\n\n\n","file_path":"src/configuration/mod.rs","rank":3,"score":52972.484416304935},{"content":"fn get_env(name: &str) -> String {\n\n\tlet value = std::env::var(name);\n\n\tif value.is_err() {\n\n\t\treturn \"\".to_string();\n\n\t}\n\n\treturn value.unwrap();\n\n}\n\n\n","file_path":"src/configuration/mod.rs","rank":4,"score":51520.690113465374},{"content":"fn fix_unc_path(path: &str) -> String {\n\n\tif !path.starts_with(\"\\\\\\\\?\\\\\") {\n\n\t\treturn path.to_string();\n\n\t}\n\n\tlet mut tmp = path.to_string();\n\n\ttmp = tmp.replace(\"\\\\\\\\?\\\\\", \"\");\n\n\treturn tmp;\n\n}\n\n\n\nimpl PathHelper for std::path::Path {\n\n\t/// Get the name as &str\n\n\t///\n\n\t/// # Returns\n\n\t/// name as &str\n\n\tfn name_as_str(&self) -> &str {\n\n\t\treturn self.file_name().unwrap().to_str().unwrap();\n\n\t}\n\n\n\n\t/// Get the name as [String]\n\n\t///\n","file_path":"src/helpers/mod.rs","rank":5,"score":50194.50720704571},{"content":"fn make_name_filter(wildcard: &str) -> String {\n\n\tlet wildcard = head(wildcard);\n\n\tlet wildcard = tail(&wildcard);\n\n\tlet wildcard = wildcard.replace(\"[\", \"\\\\[\");\n\n\tlet wildcard = wildcard.replace(\"]\", \"\\\\]\");\n\n\tlet wildcard = wildcard.replace(\".\", \"\\\\.\");\n\n\tlet wildcard = wildcard.replace(\"*\", \".+\");\n\n\treturn wildcard;\n\n}\n\n\n","file_path":"src/configuration/mod.rs","rank":6,"score":50194.50720704571},{"content":"/// Retrieve the whole content of file\n\n///\n\n/// ### Returns\n\n/// Entire content of file as `String`\n\npub fn read_text_file_all(path: &str) -> std::result::Result<String, Box<dyn std::error::Error>> {\n\n\tuse std::io::Read;\n\n\n\n\tlet mut file = std::fs::File::open(path)?;\n\n\tlet mut s = String::new();\n\n\tfile.read_to_string(&mut s)?;\n\n\treturn Ok(s);\n\n}\n","file_path":"src/functions/mod.rs","rank":7,"score":44401.36012907053},{"content":"/// Remove directory or file specified by `path`.\n\n///\n\n/// # Arguments\n\n/// * `path` Path to remove.\n\npub fn unlink(path: &str) -> Result<(), Box<dyn std::error::Error>> {\n\n\tif path == \"\" {\n\n\t\treturn Ok(());\n\n\t}\n\n\tlet e = std::path::Path::new(path);\n\n\tif e.is_dir() {\n\n\t\t// Remove directory.\n\n\t\tstd::fs::remove_dir_all(path)?;\n\n\t} else if e.is_file() {\n\n\t\t// Remove file.\n\n\t\tstd::fs::remove_file(path)?;\n\n\t}\n\n\treturn Ok(());\n\n}\n\n\n","file_path":"src/functions/mod.rs","rank":8,"score":39023.55812462047},{"content":"/// Get canonical path of `path`.\n\npub fn canonicalize_path(path: &str) -> Result<String, Box<dyn std::error::Error>> {\n\n\tuse crate::helpers::PathHelper;\n\n\n\n\tlet path = std::path::Path::new(path);\n\n\treturn path.canonical_path_as_string();\n\n}\n\n\n","file_path":"src/functions/mod.rs","rank":9,"score":36579.27271346352},{"content":"/// entrypoint.\n\nfn main() {\n\n\t// configure.\n\n\tlet result = configuration::Settings::new();\n\n\tif result.is_err() {\n\n\t\tprintln!(\"[ERROR] Configuration error. reason: {}\", result.err().unwrap());\n\n\t\treturn;\n\n\t}\n\n\tlet settings = result.unwrap();\n\n\n\n\t// reading commandline options.\n\n\tlet args: std::vec::Vec<String> = std::env::args().skip(1).collect();\n\n\tif args.len() == 0 {\n\n\t\tprintln!(\"Path to directory needed.\");\n\n\t\tstd::thread::sleep(std::time::Duration::from_secs(2));\n\n\t\treturn;\n\n\t}\n\n\n\n\t// Stopwatch. For printing summary.\n\n\tlet stopwatch = util::time::Stopwatch::new();\n\n\n","file_path":"src/main.rs","rank":10,"score":32096.41581940171},{"content":"/// Get current time as a string in the format `%Y%m%d-%H%M%S`.\n\n///\n\n/// # Returns\n\n/// Current time as a [String]\n\npub fn timestamp1() -> String {\n\n\tlet date = chrono::Local::now();\n\n\treturn format!(\"{}\", date.format(\"%Y%m%d-%H%M%S\"));\n\n}\n\n\n","file_path":"src/functions/mod.rs","rank":11,"score":26957.506002088536},{"content":"#[allow(unused)]\n\npub fn timestamp0() -> String {\n\n\tlet date = chrono::Local::now();\n\n\treturn format!(\"{}\", date.format(\"%Y-%m-%d %H:%M:%S%.3f\"));\n\n}\n\n\n","file_path":"src/functions/mod.rs","rank":12,"score":26957.506002088536},{"content":"fn find_settings_toml() -> Result<String, Box<dyn std::error::Error>> {\n\n\tuse crate::helpers::PathHelper;\n\n\n\n\tconst NAME: &str = \"settings.toml\";\n\n\n\n\t// カレントディレクトリを調べます。\n\n\tif std::path::Path::new(NAME).is_file() {\n\n\t\treturn Ok(NAME.to_string());\n\n\t}\n\n\n\n\t// ユーザーのホームディレクトリを調べます。(Windows)\n\n\tlet home = get_env(\"USERPROFILE\");\n\n\tif home != \"\" {\n\n\t\treturn std::path::Path::new(&home).join_as_string(NAME);\n\n\t}\n\n\n\n\t// ユーザーのホームディレクトリを調べます。(Linux)\n\n\tlet home = get_env(\"HOME\");\n\n\tif home != \"\" {\n\n\t\treturn std::path::Path::new(&home).join_as_string(NAME);\n","file_path":"src/configuration/mod.rs","rank":13,"score":19493.60239854641},{"content":"\t/// # Arguments\n\n\t/// * `path` 設定ファイルのパス\n\n\tfn configure(&mut self, path: &str) -> Result<(), Box<dyn std::error::Error>> {\n\n\t\t// パスが指定されていなければスキップします。\n\n\t\tif path == \"\" {\n\n\t\t\treturn Ok(());\n\n\t\t}\n\n\n\n\t\t// ファイルが無ければスキップします。\n\n\t\tif !std::path::Path::new(path).is_file() {\n\n\t\t\tprintln!(\"[INFO] Configuration file not found. (settings.toml)\");\n\n\t\t\treturn Ok(());\n\n\t\t}\n\n\n\n\t\t// テキストファイル全体を読み込み\n\n\t\tlet content = functions::read_text_file_all(&path)?;\n\n\n\n\t\t// toml ファイルをパース\n\n\t\t*self = toml::from_str(&content)?;\n\n\t\tif self.exclude_dirs.is_none() {\n","file_path":"src/configuration/mod.rs","rank":16,"score":2.475522716383316},{"content":"\t\tlet names = self.exclude_dirs.as_ref().unwrap();\n\n\t\tfor e in names {\n\n\t\t\tif name == e {\n\n\t\t\t\treturn false;\n\n\t\t\t}\n\n\t\t}\n\n\t\treturn true;\n\n\t}\n\n\n\n\t/// 指定された名前が処理対象のファイルか調べます。\n\n\t///\n\n\t/// # Arguments\n\n\t/// * `name` ファイルの名前\n\n\t///\n\n\t/// # Returns\n\n\t/// 処理対象(=つまり除外ファイル名に指定されていない)なら `true` を返します。\n\n\tpub fn is_valid_filename(&self, name: &str) -> Result<bool, Box<dyn std::error::Error>> {\n\n\t\tif self.exclude_files.is_none() {\n\n\t\t\treturn Ok(true);\n\n\t\t}\n","file_path":"src/configuration/mod.rs","rank":17,"score":2.339519943896571},{"content":"\t\t\tself.exclude_dirs = Some(std::collections::HashSet::new());\n\n\t\t}\n\n\t\tif self.exclude_files.is_none() {\n\n\t\t\tself.exclude_files = Some(std::collections::HashSet::new());\n\n\t\t}\n\n\n\n\t\treturn Ok(());\n\n\t}\n\n\n\n\t/// 指定された名前が処理対象か調べます。\n\n\t///\n\n\t/// # Arguments\n\n\t/// * `name` ディレクトリの名前\n\n\t///\n\n\t/// # Returns\n\n\t/// 処理対象(=つまり除外ディレクトリ名に指定されていない)なら `true` を返します。\n\n\tpub fn is_valid_dir(&self, name: &str) -> bool {\n\n\t\tif self.exclude_dirs.is_none() {\n\n\t\t\treturn true;\n\n\t\t}\n","file_path":"src/configuration/mod.rs","rank":18,"score":2.251116736462524},{"content":"//!\n\n//! Configuration\n\n//!\n\n\n\nextern crate serde_derive;\n\n\n\nuse crate::functions;\n\n\n\n/// マッチング記述文字列の先頭文字を、適切なキャラクターに変換します。\n\n///\n\n/// # Arguments\n\n/// * `wildcard` マッチング記述文字列\n\n///\n\n/// # Returns\n\n/// 変換後の文字列\n","file_path":"src/configuration/mod.rs","rank":19,"score":1.873554298496696},{"content":"\t/// # Returns\n\n\t/// name as [String]\n\n\tfn name_as_string(&self) -> String {\n\n\t\treturn self.file_name().unwrap().to_str().unwrap().to_string();\n\n\t}\n\n\n\n\t/// Get canonical path as [String]\n\n\t///\n\n\t/// # Returns\n\n\t/// canonical path as [String]\n\n\tfn canonical_path_as_string(&self) -> Result<String, Box<dyn std::error::Error>> {\n\n\t\tlet path = self.canonicalize()?;\n\n\t\tlet s = path.to_str().unwrap().to_string();\n\n\t\treturn Ok(fix_unc_path(&s));\n\n\t}\n\n\n\n\t/// Join path as [String]\n\n\t///\n\n\t/// # Returns\n\n\t/// joined path as [String]\n\n\tfn join_as_string(&self, child: &str) -> Result<String, Box<dyn std::error::Error>> {\n\n\t\tlet result = self.join(child);\n\n\t\tlet s = result.to_str().unwrap().to_string();\n\n\t\treturn Ok(s);\n\n\t}\n\n}\n\n\n","file_path":"src/helpers/mod.rs","rank":20,"score":1.7330404325148725},{"content":"\t/// `ApplicationError` の新しいインスタンス\n\n\tpub fn new(description: &str) -> ApplicationError {\n\n\t\treturn ApplicationError { description: description.to_string() };\n\n\t}\n\n}\n\n\n\nimpl std::fmt::Display for ApplicationError {\n\n\t/// [std::fmt::Display] としての振る舞いを実装します。\n\n\tfn fmt(&self, f: &mut std::fmt::Formatter) -> Result<(), std::fmt::Error> {\n\n\t\treturn write!(f, \"{}\", self.description);\n\n\t}\n\n}\n\n\n\nimpl std::error::Error for ApplicationError {\n\n\t/// [std::error::Error] としての振る舞いを実装します。\n\n\t///\n\n\t/// # Returns\n\n\t/// エラー文字列\n\n\tfn description(&self) -> &str {\n\n\t\treturn &self.description;\n\n\t}\n\n}\n","file_path":"src/application/errors.rs","rank":22,"score":1.400847721286222},{"content":"}\n\n\n\nimpl std::fmt::Display for Stopwatch {\n\n\t/// Implements default behavior as [std::fmt::Display].\n\n\t///\n\n\t/// ### Returns\n\n\t/// Duration as formatted string.\n\n\tfn fmt(&self, f: &mut std::fmt::Formatter) -> std::fmt::Result {\n\n\t\tuse crate::helpers::DurationFormatter;\n\n\n\n\t\tlet elapsed = std::time::Instant::now() - self.time;\n\n\t\twrite!(f, \"{}\", elapsed.to_string())?;\n\n\t\treturn Ok(());\n\n\t}\n\n}\n","file_path":"src/util/time.rs","rank":23,"score":1.015123214357696}],"string":"[\n {\n \"content\": \"/// Build a path from `path` and `name`.\\n\\n///\\n\\n/// # Arguments\\n\\n/// * `parent` Parent path.\\n\\n/// * `name` Name of the file or directory.\\n\\n///\\n\\n/// # Returns\\n\\n/// * Path to the file or directory.\\n\\npub fn build_path(parent: &str, name: &str) -> String {\\n\\n\\tif parent == \\\"\\\" {\\n\\n\\t\\treturn name.to_string();\\n\\n\\t}\\n\\n\\treturn format!(\\\"{}/{}\\\", parent, name);\\n\\n}\\n\\n\\n\\n/// Get current time as a string in the format `%Y-%m-%d %H:%M:%S%.3f`.\\n\\n///\\n\\n/// # Returns\\n\\n/// Current time as a [String]\\n\",\n \"file_path\": \"src/functions/mod.rs\",\n \"rank\": 1,\n \"score\": 54275.675100441185\n },\n {\n \"content\": \"/// マッチング記述文字列の終端文字を、適切なキャラクターに変換します。\\n\\n///\\n\\n/// # Arguments\\n\\n/// * `wildcard` マッチング記述文字列\\n\\n///\\n\\n/// # Returns\\n\\n/// 変換後の文字列\\n\\nfn tail(wildcard: &str) -> String {\\n\\n\\tif wildcard.ends_with(\\\"*\\\") {\\n\\n\\t\\treturn wildcard.to_string();\\n\\n\\t}\\n\\n\\treturn format!(\\\"{}$\\\", wildcard);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/configuration/mod.rs\",\n \"rank\": 2,\n \"score\": 52972.484416304935\n },\n {\n \"content\": \"/// マッチング記述文字列の先頭文字を、適切なキャラクターに変換します。\\n\\n///\\n\\n/// # Arguments\\n\\n/// * `wildcard` マッチング記述文字列\\n\\n///\\n\\n/// # Returns\\n\\n/// 変換後の文字列\\n\\nfn head(wildcard: &str) -> String {\\n\\n\\tif wildcard.starts_with(\\\"*\\\") {\\n\\n\\t\\treturn wildcard.to_string();\\n\\n\\t}\\n\\n\\treturn format!(\\\"^{}\\\", wildcard);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/configuration/mod.rs\",\n \"rank\": 3,\n \"score\": 52972.484416304935\n },\n {\n \"content\": \"fn get_env(name: &str) -> String {\\n\\n\\tlet value = std::env::var(name);\\n\\n\\tif value.is_err() {\\n\\n\\t\\treturn \\\"\\\".to_string();\\n\\n\\t}\\n\\n\\treturn value.unwrap();\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/configuration/mod.rs\",\n \"rank\": 4,\n \"score\": 51520.690113465374\n },\n {\n \"content\": \"fn fix_unc_path(path: &str) -> String {\\n\\n\\tif !path.starts_with(\\\"\\\\\\\\\\\\\\\\?\\\\\\\\\\\") {\\n\\n\\t\\treturn path.to_string();\\n\\n\\t}\\n\\n\\tlet mut tmp = path.to_string();\\n\\n\\ttmp = tmp.replace(\\\"\\\\\\\\\\\\\\\\?\\\\\\\\\\\", \\\"\\\");\\n\\n\\treturn tmp;\\n\\n}\\n\\n\\n\\nimpl PathHelper for std::path::Path {\\n\\n\\t/// Get the name as &str\\n\\n\\t///\\n\\n\\t/// # Returns\\n\\n\\t/// name as &str\\n\\n\\tfn name_as_str(&self) -> &str {\\n\\n\\t\\treturn self.file_name().unwrap().to_str().unwrap();\\n\\n\\t}\\n\\n\\n\\n\\t/// Get the name as [String]\\n\\n\\t///\\n\",\n \"file_path\": \"src/helpers/mod.rs\",\n \"rank\": 5,\n \"score\": 50194.50720704571\n },\n {\n \"content\": \"fn make_name_filter(wildcard: &str) -> String {\\n\\n\\tlet wildcard = head(wildcard);\\n\\n\\tlet wildcard = tail(&wildcard);\\n\\n\\tlet wildcard = wildcard.replace(\\\"[\\\", \\\"\\\\\\\\[\\\");\\n\\n\\tlet wildcard = wildcard.replace(\\\"]\\\", \\\"\\\\\\\\]\\\");\\n\\n\\tlet wildcard = wildcard.replace(\\\".\\\", \\\"\\\\\\\\.\\\");\\n\\n\\tlet wildcard = wildcard.replace(\\\"*\\\", \\\".+\\\");\\n\\n\\treturn wildcard;\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/configuration/mod.rs\",\n \"rank\": 6,\n \"score\": 50194.50720704571\n },\n {\n \"content\": \"/// Retrieve the whole content of file\\n\\n///\\n\\n/// ### Returns\\n\\n/// Entire content of file as `String`\\n\\npub fn read_text_file_all(path: &str) -> std::result::Result<String, Box<dyn std::error::Error>> {\\n\\n\\tuse std::io::Read;\\n\\n\\n\\n\\tlet mut file = std::fs::File::open(path)?;\\n\\n\\tlet mut s = String::new();\\n\\n\\tfile.read_to_string(&mut s)?;\\n\\n\\treturn Ok(s);\\n\\n}\\n\",\n \"file_path\": \"src/functions/mod.rs\",\n \"rank\": 7,\n \"score\": 44401.36012907053\n },\n {\n \"content\": \"/// Remove directory or file specified by `path`.\\n\\n///\\n\\n/// # Arguments\\n\\n/// * `path` Path to remove.\\n\\npub fn unlink(path: &str) -> Result<(), Box<dyn std::error::Error>> {\\n\\n\\tif path == \\\"\\\" {\\n\\n\\t\\treturn Ok(());\\n\\n\\t}\\n\\n\\tlet e = std::path::Path::new(path);\\n\\n\\tif e.is_dir() {\\n\\n\\t\\t// Remove directory.\\n\\n\\t\\tstd::fs::remove_dir_all(path)?;\\n\\n\\t} else if e.is_file() {\\n\\n\\t\\t// Remove file.\\n\\n\\t\\tstd::fs::remove_file(path)?;\\n\\n\\t}\\n\\n\\treturn Ok(());\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/functions/mod.rs\",\n \"rank\": 8,\n \"score\": 39023.55812462047\n },\n {\n \"content\": \"/// Get canonical path of `path`.\\n\\npub fn canonicalize_path(path: &str) -> Result<String, Box<dyn std::error::Error>> {\\n\\n\\tuse crate::helpers::PathHelper;\\n\\n\\n\\n\\tlet path = std::path::Path::new(path);\\n\\n\\treturn path.canonical_path_as_string();\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/functions/mod.rs\",\n \"rank\": 9,\n \"score\": 36579.27271346352\n },\n {\n \"content\": \"/// entrypoint.\\n\\nfn main() {\\n\\n\\t// configure.\\n\\n\\tlet result = configuration::Settings::new();\\n\\n\\tif result.is_err() {\\n\\n\\t\\tprintln!(\\\"[ERROR] Configuration error. reason: {}\\\", result.err().unwrap());\\n\\n\\t\\treturn;\\n\\n\\t}\\n\\n\\tlet settings = result.unwrap();\\n\\n\\n\\n\\t// reading commandline options.\\n\\n\\tlet args: std::vec::Vec<String> = std::env::args().skip(1).collect();\\n\\n\\tif args.len() == 0 {\\n\\n\\t\\tprintln!(\\\"Path to directory needed.\\\");\\n\\n\\t\\tstd::thread::sleep(std::time::Duration::from_secs(2));\\n\\n\\t\\treturn;\\n\\n\\t}\\n\\n\\n\\n\\t// Stopwatch. For printing summary.\\n\\n\\tlet stopwatch = util::time::Stopwatch::new();\\n\\n\\n\",\n \"file_path\": \"src/main.rs\",\n \"rank\": 10,\n \"score\": 32096.41581940171\n },\n {\n \"content\": \"/// Get current time as a string in the format `%Y%m%d-%H%M%S`.\\n\\n///\\n\\n/// # Returns\\n\\n/// Current time as a [String]\\n\\npub fn timestamp1() -> String {\\n\\n\\tlet date = chrono::Local::now();\\n\\n\\treturn format!(\\\"{}\\\", date.format(\\\"%Y%m%d-%H%M%S\\\"));\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/functions/mod.rs\",\n \"rank\": 11,\n \"score\": 26957.506002088536\n },\n {\n \"content\": \"#[allow(unused)]\\n\\npub fn timestamp0() -> String {\\n\\n\\tlet date = chrono::Local::now();\\n\\n\\treturn format!(\\\"{}\\\", date.format(\\\"%Y-%m-%d %H:%M:%S%.3f\\\"));\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/functions/mod.rs\",\n \"rank\": 12,\n \"score\": 26957.506002088536\n },\n {\n \"content\": \"fn find_settings_toml() -> Result<String, Box<dyn std::error::Error>> {\\n\\n\\tuse crate::helpers::PathHelper;\\n\\n\\n\\n\\tconst NAME: &str = \\\"settings.toml\\\";\\n\\n\\n\\n\\t// カレントディレクトリを調べます。\\n\\n\\tif std::path::Path::new(NAME).is_file() {\\n\\n\\t\\treturn Ok(NAME.to_string());\\n\\n\\t}\\n\\n\\n\\n\\t// ユーザーのホームディレクトリを調べます。(Windows)\\n\\n\\tlet home = get_env(\\\"USERPROFILE\\\");\\n\\n\\tif home != \\\"\\\" {\\n\\n\\t\\treturn std::path::Path::new(&home).join_as_string(NAME);\\n\\n\\t}\\n\\n\\n\\n\\t// ユーザーのホームディレクトリを調べます。(Linux)\\n\\n\\tlet home = get_env(\\\"HOME\\\");\\n\\n\\tif home != \\\"\\\" {\\n\\n\\t\\treturn std::path::Path::new(&home).join_as_string(NAME);\\n\",\n \"file_path\": \"src/configuration/mod.rs\",\n \"rank\": 13,\n \"score\": 19493.60239854641\n },\n {\n \"content\": \"\\t/// # Arguments\\n\\n\\t/// * `path` 設定ファイルのパス\\n\\n\\tfn configure(&mut self, path: &str) -> Result<(), Box<dyn std::error::Error>> {\\n\\n\\t\\t// パスが指定されていなければスキップします。\\n\\n\\t\\tif path == \\\"\\\" {\\n\\n\\t\\t\\treturn Ok(());\\n\\n\\t\\t}\\n\\n\\n\\n\\t\\t// ファイルが無ければスキップします。\\n\\n\\t\\tif !std::path::Path::new(path).is_file() {\\n\\n\\t\\t\\tprintln!(\\\"[INFO] Configuration file not found. (settings.toml)\\\");\\n\\n\\t\\t\\treturn Ok(());\\n\\n\\t\\t}\\n\\n\\n\\n\\t\\t// テキストファイル全体を読み込み\\n\\n\\t\\tlet content = functions::read_text_file_all(&path)?;\\n\\n\\n\\n\\t\\t// toml ファイルをパース\\n\\n\\t\\t*self = toml::from_str(&content)?;\\n\\n\\t\\tif self.exclude_dirs.is_none() {\\n\",\n \"file_path\": \"src/configuration/mod.rs\",\n \"rank\": 16,\n \"score\": 2.475522716383316\n },\n {\n \"content\": \"\\t\\tlet names = self.exclude_dirs.as_ref().unwrap();\\n\\n\\t\\tfor e in names {\\n\\n\\t\\t\\tif name == e {\\n\\n\\t\\t\\t\\treturn false;\\n\\n\\t\\t\\t}\\n\\n\\t\\t}\\n\\n\\t\\treturn true;\\n\\n\\t}\\n\\n\\n\\n\\t/// 指定された名前が処理対象のファイルか調べます。\\n\\n\\t///\\n\\n\\t/// # Arguments\\n\\n\\t/// * `name` ファイルの名前\\n\\n\\t///\\n\\n\\t/// # Returns\\n\\n\\t/// 処理対象(=つまり除外ファイル名に指定されていない)なら `true` を返します。\\n\\n\\tpub fn is_valid_filename(&self, name: &str) -> Result<bool, Box<dyn std::error::Error>> {\\n\\n\\t\\tif self.exclude_files.is_none() {\\n\\n\\t\\t\\treturn Ok(true);\\n\\n\\t\\t}\\n\",\n \"file_path\": \"src/configuration/mod.rs\",\n \"rank\": 17,\n \"score\": 2.339519943896571\n },\n {\n \"content\": \"\\t\\t\\tself.exclude_dirs = Some(std::collections::HashSet::new());\\n\\n\\t\\t}\\n\\n\\t\\tif self.exclude_files.is_none() {\\n\\n\\t\\t\\tself.exclude_files = Some(std::collections::HashSet::new());\\n\\n\\t\\t}\\n\\n\\n\\n\\t\\treturn Ok(());\\n\\n\\t}\\n\\n\\n\\n\\t/// 指定された名前が処理対象か調べます。\\n\\n\\t///\\n\\n\\t/// # Arguments\\n\\n\\t/// * `name` ディレクトリの名前\\n\\n\\t///\\n\\n\\t/// # Returns\\n\\n\\t/// 処理対象(=つまり除外ディレクトリ名に指定されていない)なら `true` を返します。\\n\\n\\tpub fn is_valid_dir(&self, name: &str) -> bool {\\n\\n\\t\\tif self.exclude_dirs.is_none() {\\n\\n\\t\\t\\treturn true;\\n\\n\\t\\t}\\n\",\n \"file_path\": \"src/configuration/mod.rs\",\n \"rank\": 18,\n \"score\": 2.251116736462524\n },\n {\n \"content\": \"//!\\n\\n//! Configuration\\n\\n//!\\n\\n\\n\\nextern crate serde_derive;\\n\\n\\n\\nuse crate::functions;\\n\\n\\n\\n/// マッチング記述文字列の先頭文字を、適切なキャラクターに変換します。\\n\\n///\\n\\n/// # Arguments\\n\\n/// * `wildcard` マッチング記述文字列\\n\\n///\\n\\n/// # Returns\\n\\n/// 変換後の文字列\\n\",\n \"file_path\": \"src/configuration/mod.rs\",\n \"rank\": 19,\n \"score\": 1.873554298496696\n },\n {\n \"content\": \"\\t/// # Returns\\n\\n\\t/// name as [String]\\n\\n\\tfn name_as_string(&self) -> String {\\n\\n\\t\\treturn self.file_name().unwrap().to_str().unwrap().to_string();\\n\\n\\t}\\n\\n\\n\\n\\t/// Get canonical path as [String]\\n\\n\\t///\\n\\n\\t/// # Returns\\n\\n\\t/// canonical path as [String]\\n\\n\\tfn canonical_path_as_string(&self) -> Result<String, Box<dyn std::error::Error>> {\\n\\n\\t\\tlet path = self.canonicalize()?;\\n\\n\\t\\tlet s = path.to_str().unwrap().to_string();\\n\\n\\t\\treturn Ok(fix_unc_path(&s));\\n\\n\\t}\\n\\n\\n\\n\\t/// Join path as [String]\\n\\n\\t///\\n\\n\\t/// # Returns\\n\\n\\t/// joined path as [String]\\n\\n\\tfn join_as_string(&self, child: &str) -> Result<String, Box<dyn std::error::Error>> {\\n\\n\\t\\tlet result = self.join(child);\\n\\n\\t\\tlet s = result.to_str().unwrap().to_string();\\n\\n\\t\\treturn Ok(s);\\n\\n\\t}\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/helpers/mod.rs\",\n \"rank\": 20,\n \"score\": 1.7330404325148725\n },\n {\n \"content\": \"\\t/// `ApplicationError` の新しいインスタンス\\n\\n\\tpub fn new(description: &str) -> ApplicationError {\\n\\n\\t\\treturn ApplicationError { description: description.to_string() };\\n\\n\\t}\\n\\n}\\n\\n\\n\\nimpl std::fmt::Display for ApplicationError {\\n\\n\\t/// [std::fmt::Display] としての振る舞いを実装します。\\n\\n\\tfn fmt(&self, f: &mut std::fmt::Formatter) -> Result<(), std::fmt::Error> {\\n\\n\\t\\treturn write!(f, \\\"{}\\\", self.description);\\n\\n\\t}\\n\\n}\\n\\n\\n\\nimpl std::error::Error for ApplicationError {\\n\\n\\t/// [std::error::Error] としての振る舞いを実装します。\\n\\n\\t///\\n\\n\\t/// # Returns\\n\\n\\t/// エラー文字列\\n\\n\\tfn description(&self) -> &str {\\n\\n\\t\\treturn &self.description;\\n\\n\\t}\\n\\n}\\n\",\n \"file_path\": \"src/application/errors.rs\",\n \"rank\": 22,\n \"score\": 1.400847721286222\n },\n {\n \"content\": \"}\\n\\n\\n\\nimpl std::fmt::Display for Stopwatch {\\n\\n\\t/// Implements default behavior as [std::fmt::Display].\\n\\n\\t///\\n\\n\\t/// ### Returns\\n\\n\\t/// Duration as formatted string.\\n\\n\\tfn fmt(&self, f: &mut std::fmt::Formatter) -> std::fmt::Result {\\n\\n\\t\\tuse crate::helpers::DurationFormatter;\\n\\n\\n\\n\\t\\tlet elapsed = std::time::Instant::now() - self.time;\\n\\n\\t\\twrite!(f, \\\"{}\\\", elapsed.to_string())?;\\n\\n\\t\\treturn Ok(());\\n\\n\\t}\\n\\n}\\n\",\n \"file_path\": \"src/util/time.rs\",\n \"rank\": 23,\n \"score\": 1.015123214357696\n }\n]","isConversational":false}}},{"rowIdx":2381,"cells":{"lang":{"kind":"string","value":"Rust"},"file_path":{"kind":"string","value":"src/headers/mod.rs"},"repo_name":{"kind":"string","value":"vv9k/mobi-rs"},"commit":{"kind":"string","value":"c15606e2842759db9797122c5f8196d36388feba"},"file_code":{"kind":"string","value":"pub(crate) mod exth;\npub(crate) mod header;\npub(crate) mod mobih;\npub(crate) mod palmdoch;\n\npub use self::{\n exth::{ExtHeader, ExthRecord},\n header::{Header, HeaderParseError},\n mobih::{Language, MobiHeader, MobiType, TextEncoding},\n palmdoch::{Compression, Encryption, PalmDocHeader},\n};\n\nuse crate::record::PdbRecords;\nuse crate::{Reader, Writer};\n\n#[cfg(feature = \"time\")]\nuse chrono::NaiveDateTime;\nuse std::fs::File;\nuse std::io::{self, BufReader, Read};\nuse std::path::Path;\nuse thiserror::Error;\n\n#[derive(Debug, Error)]\npub enum MetadataParseError {\n #[error(transparent)]\n HeaderParseError(#[from] HeaderParseError),\n #[error(transparent)]\n IoError(#[from] std::io::Error),\n}\n\n#[derive(Debug, Default)]\n\npub struct MobiMetadata {\n pub name: Vec<u8>,\n pub header: Header,\n pub records: PdbRecords,\n pub palmdoc: PalmDocHeader,\n pub mobi: MobiHeader,\n pub exth: ExtHeader,\n}\nimpl MobiMetadata {\n \n pub fn new<B: AsRef<Vec<u8>>>(bytes: B) -> Result<MobiMetadata, MetadataParseError> {\n MobiMetadata::from_reader(&mut Reader::new(std::io::Cursor::new(bytes.as_ref())))\n }\n\n \n pub fn from_path<P: AsRef<Path>>(file_path: P) -> Result<MobiMetadata, MetadataParseError> {\n let mut reader = Reader::new(BufReader::new(File::open(file_path)?));\n MobiMetadata::from_reader(&mut reader)\n }\n\n \n pub fn from_read<R: Read>(reader: R) -> Result<MobiMetadata, MetadataParseError> {\n MobiMetadata::from_reader(&mut Reader::new(reader))\n }\n\n pub(crate) fn from_reader<R: Read>(\n reader: &mut Reader<R>,\n ) -> Result<MobiMetadata, MetadataParseError> {\n let header = Header::parse(reader)?;\n let records = PdbRecords::new(reader, header.num_records)?;\n let palmdoc = PalmDocHeader::parse(reader)?;\n let mobi = MobiHeader::parse(reader)?;\n\n let exth = if mobi.has_exth_header() {\n ExtHeader::parse(reader)?\n } else {\n ExtHeader::default()\n };\n\n reader.set_position((records.records[0].offset + mobi.name_offset) as usize)?;\n let name = reader.read_vec_header(mobi.name_length as usize)?;\n\n Ok(MobiMetadata {\n name,\n header,\n records,\n palmdoc,\n mobi,\n exth,\n })\n }\n\n #[allow(dead_code)]\n fn write(&self, writer: &mut impl io::Write) -> io::Result<()> {\n self.write_into(&mut Writer::new(writer))\n }\n\n pub(crate) fn write_into<W: io::Write>(&self, w: &mut Writer<W>) -> io::Result<()> {\n self.header.write(w, self.records.num_records())?;\n self.records.write(w)?;\n self.palmdoc.write(w)?;\n self.mobi.write(w)?;\n if self.mobi.has_exth_header() {\n self.exth.write(w)?;\n }\n\n let fill = ((self.records.records[0].offset + self.mobi.name_offset) as usize)\n .saturating_sub(w.bytes_written());\n w.write_be(vec![0; fill])?;\n w.write_be(&self.name)\n }\n\n \n \n\n \n \n \n \n \n pub fn exth_record(&self, record: ExthRecord) -> Option<&Vec<Vec<u8>>> {\n self.exth.get_record(record)\n }\n\n \n \n \n \n \n \n \n \n \n \n pub fn exth_record_at(&self, position: u32) -> Option<&Vec<Vec<u8>>> {\n self.exth.get_record_position(position)\n }\n\n \n \n\n \n pub fn author(&self) -> Option<String> {\n self.exth.get_record_string_lossy(exth::ExthRecord::Author)\n }\n\n \n pub fn publisher(&self) -> Option<String> {\n self.exth\n .get_record_string_lossy(exth::ExthRecord::Publisher)\n }\n\n \n pub fn description(&self) -> Option<String> {\n self.exth\n .get_record_string_lossy(exth::ExthRecord::Description)\n }\n\n \n pub fn isbn(&self) -> Option<String> {\n self.exth.get_record_string_lossy(exth::ExthRecord::Isbn)\n }\n\n \n pub fn publish_date(&self) -> Option<String> {\n self.exth\n .get_record_string_lossy(exth::ExthRecord::PublishDate)\n }\n\n \n pub fn contributor(&self) -> Option<String> {\n self.exth\n .get_record_string_lossy(exth::ExthRecord::Contributor)\n }\n\n \n \n \n pub fn title(&self) -> String {\n self.exth\n .get_record_string_lossy(exth::ExthRecord::Title)\n .map_or(String::from_utf8_lossy(&self.name).to_string(), |v| v)\n }\n\n \n pub fn text_encoding(&self) -> TextEncoding {\n self.mobi.text_encoding()\n }\n\n \n pub fn mobi_type(&self) -> MobiType {\n self.mobi.mobi_type()\n }\n\n \n pub fn language(&self) -> Language {\n self.mobi.language()\n }\n\n #[cfg(feature = \"time\")]\n \n \n pub fn created_datetime(&self) -> NaiveDateTime {\n self.header.created_datetime()\n }\n\n #[cfg(feature = \"time\")]\n \n \n pub fn mod_datetime(&self) -> NaiveDateTime {\n self.header.mod_datetime()\n }\n\n #[cfg(not(feature = \"time\"))]\n \n pub fn created_time(&self) -> u32 {\n self.header.created_datetime()\n }\n\n #[cfg(not(feature = \"time\"))]\n \n pub fn mod_time(&self) -> u32 {\n self.header.mod_datetime()\n }\n\n \n pub fn compression(&self) -> Compression {\n self.palmdoc.compression()\n }\n\n \n pub fn encryption(&self) -> Encryption {\n self.palmdoc.encryption()\n }\n\n \n pub fn subjects(&self) -> Option<Vec<String>> {\n self.exth_record(ExthRecord::Subject).map(|s| {\n s.iter()\n .map(|s| String::from_utf8_lossy(s).to_string())\n .collect()\n })\n }\n}\n\n#[cfg(test)]\nmod test {\n use super::*;\n use crate::book;\n\n #[test]\n fn test_mobi_metadata() {\n let mut reader = book::u8_reader(book::full_book());\n assert!(MobiMetadata::from_reader(&mut reader).is_ok());\n }\n\n #[test]\n fn test_mobi_write() {\n \n let m = MobiMetadata::from_reader(&mut book::u8_reader(book::full_book())).unwrap();\n let mut bytes = vec![];\n assert!(m.write(&mut bytes).is_ok());\n assert_eq!(bytes, book::MOBI_METADATA);\n }\n}\n"},"prefix":{"kind":"string","value":"pub(crate) mod exth;\npub(crate) mod header;\npub(crate) mod mobih;\npub(crate) mod palmdoch;\n\npub use self::{\n exth::{ExtHeader, ExthRecord},\n header::{Header, HeaderParseError},\n mobih::{Language, MobiHeader, MobiType, TextEncoding},\n palmdoch::{Compression, Encryption, PalmDocHeader},\n};\n\nuse crate::record::PdbRecords;\nuse crate::{Reader, Writer};\n\n#[cfg(feature = \"time\")]\nuse chrono::NaiveDateTime;\nuse std::fs::File;\nuse std::io::{self, BufReader, Read};\nuse std::path::Path;\nuse thiserror::Error;\n\n#[derive(Debug, Error)]\npub enum MetadataParseError {\n #[error(transparent)]\n HeaderParseError(#[from] HeaderParseError),\n #[error(transparent)]\n IoError(#[from] std::io::Error),\n}\n\n#[derive(Debug, Default)]\n\npub struct MobiMetadata {\n pub name: Vec<u8>,\n pub header: Header,\n pub records: PdbRecords,\n pub palmdoc: PalmDocHeader,\n pub mobi: MobiHeader,\n pub exth: ExtHeader,\n}\nimpl MobiMetadata {\n \n pub fn new<B: AsRef<Vec<u8>>>(bytes: B) -> Result<MobiMetadata, MetadataParseError> {\n MobiMetadata::from_reader(&mut Reader::new(std::io::Cursor::new(bytes.as_ref())))\n }\n\n \n pub fn from_path<P: AsRef<Path>>(file_path: P) -> Result<MobiMetadata, MetadataParseError> {\n let mut reader = Reader::new(BufReader::new(File::open(file_path)?));\n MobiMetadata::from_reader(&mut reader)\n }\n\n \n pub fn from_read<R: Read>(reader: R) -> Result<MobiMetadata, MetadataParseError> {\n MobiMetadata::from_reader(&mut Reader::new(reader))\n }\n\n pub(crate) fn from_reader<R: Read>(\n reader: &mut Reader<R>,\n ) -> Result<MobiMetadata, MetadataParseError> {\n let header = Header::parse(reader)?;\n let records = PdbRecords::new(reader, header.num_records)?;\n let palmdoc = PalmDocHeader::parse(reader)?;\n let mobi = MobiHeader::parse(reader)?;\n\n let exth = "},"suffix":{"kind":"string","value":";\n\n reader.set_position((records.records[0].offset + mobi.name_offset) as usize)?;\n let name = reader.read_vec_header(mobi.name_length as usize)?;\n\n Ok(MobiMetadata {\n name,\n header,\n records,\n palmdoc,\n mobi,\n exth,\n })\n }\n\n #[allow(dead_code)]\n fn write(&self, writer: &mut impl io::Write) -> io::Result<()> {\n self.write_into(&mut Writer::new(writer))\n }\n\n pub(crate) fn write_into<W: io::Write>(&self, w: &mut Writer<W>) -> io::Result<()> {\n self.header.write(w, self.records.num_records())?;\n self.records.write(w)?;\n self.palmdoc.write(w)?;\n self.mobi.write(w)?;\n if self.mobi.has_exth_header() {\n self.exth.write(w)?;\n }\n\n let fill = ((self.records.records[0].offset + self.mobi.name_offset) as usize)\n .saturating_sub(w.bytes_written());\n w.write_be(vec![0; fill])?;\n w.write_be(&self.name)\n }\n\n \n \n\n \n \n \n \n \n pub fn exth_record(&self, record: ExthRecord) -> Option<&Vec<Vec<u8>>> {\n self.exth.get_record(record)\n }\n\n \n \n \n \n \n \n \n \n \n \n pub fn exth_record_at(&self, position: u32) -> Option<&Vec<Vec<u8>>> {\n self.exth.get_record_position(position)\n }\n\n \n \n\n \n pub fn author(&self) -> Option<String> {\n self.exth.get_record_string_lossy(exth::ExthRecord::Author)\n }\n\n \n pub fn publisher(&self) -> Option<String> {\n self.exth\n .get_record_string_lossy(exth::ExthRecord::Publisher)\n }\n\n \n pub fn description(&self) -> Option<String> {\n self.exth\n .get_record_string_lossy(exth::ExthRecord::Description)\n }\n\n \n pub fn isbn(&self) -> Option<String> {\n self.exth.get_record_string_lossy(exth::ExthRecord::Isbn)\n }\n\n \n pub fn publish_date(&self) -> Option<String> {\n self.exth\n .get_record_string_lossy(exth::ExthRecord::PublishDate)\n }\n\n \n pub fn contributor(&self) -> Option<String> {\n self.exth\n .get_record_string_lossy(exth::ExthRecord::Contributor)\n }\n\n \n \n \n pub fn title(&self) -> String {\n self.exth\n .get_record_string_lossy(exth::ExthRecord::Title)\n .map_or(String::from_utf8_lossy(&self.name).to_string(), |v| v)\n }\n\n \n pub fn text_encoding(&self) -> TextEncoding {\n self.mobi.text_encoding()\n }\n\n \n pub fn mobi_type(&self) -> MobiType {\n self.mobi.mobi_type()\n }\n\n \n pub fn language(&self) -> Language {\n self.mobi.language()\n }\n\n #[cfg(feature = \"time\")]\n \n \n pub fn created_datetime(&self) -> NaiveDateTime {\n self.header.created_datetime()\n }\n\n #[cfg(feature = \"time\")]\n \n \n pub fn mod_datetime(&self) -> NaiveDateTime {\n self.header.mod_datetime()\n }\n\n #[cfg(not(feature = \"time\"))]\n \n pub fn created_time(&self) -> u32 {\n self.header.created_datetime()\n }\n\n #[cfg(not(feature = \"time\"))]\n \n pub fn mod_time(&self) -> u32 {\n self.header.mod_datetime()\n }\n\n \n pub fn compression(&self) -> Compression {\n self.palmdoc.compression()\n }\n\n \n pub fn encryption(&self) -> Encryption {\n self.palmdoc.encryption()\n }\n\n \n pub fn subjects(&self) -> Option<Vec<String>> {\n self.exth_record(ExthRecord::Subject).map(|s| {\n s.iter()\n .map(|s| String::from_utf8_lossy(s).to_string())\n .collect()\n })\n }\n}\n\n#[cfg(test)]\nmod test {\n use super::*;\n use crate::book;\n\n #[test]\n fn test_mobi_metadata() {\n let mut reader = book::u8_reader(book::full_book());\n assert!(MobiMetadata::from_reader(&mut reader).is_ok());\n }\n\n #[test]\n fn test_mobi_write() {\n \n let m = MobiMetadata::from_reader(&mut book::u8_reader(book::full_book())).unwrap();\n let mut bytes = vec![];\n assert!(m.write(&mut bytes).is_ok());\n assert_eq!(bytes, book::MOBI_METADATA);\n }\n}\n"},"middle":{"kind":"string","value":"if mobi.has_exth_header() {\n ExtHeader::parse(reader)?\n } else {\n ExtHeader::default()\n }"},"strategy":{"kind":"string","value":"if_condition"},"context_items":{"kind":"list like","value":[{"content":"pub fn decompress(data: &[u8]) -> Vec<u8> {\n\n let length = data.len();\n\n let mut pos: usize = 0;\n\n let mut text_pos: usize = 0;\n\n let mut text: Vec<u8> = vec![];\n\n\n\n let mut prev = None;\n\n while pos < length {\n\n let byte = data[pos];\n\n pos += 1;\n\n\n\n match byte {\n\n new if prev.is_some() => {\n\n let old = prev.take().unwrap();\n\n\n\n // Combine with previous byte to get a distance-length pair.\n\n let mut dist_len_bytes = u16::from_be_bytes([old, new]);\n\n\n\n dist_len_bytes &= 0x3fff; // Leftmost two bits are ID bits and need to be dropped\n\n let offset = (dist_len_bytes >> 3) as usize; // Remaining 11 bits are offset\n","file_path":"src/compression/palmdoc.rs","rank":0,"score":66256.6608076857},{"content":" u16::from(*self).write_be_bytes(writer)\n\n }\n\n}\n\n\n\n#[derive(Debug, PartialEq, Default)]\n\n/// Strcture that holds PalmDOC header information\n\npub struct PalmDocHeader {\n\n pub compression: Compression,\n\n pub text_length: u32,\n\n unused0: u16,\n\n pub record_count: u16,\n\n pub record_size: u16,\n\n pub encryption: Encryption,\n\n unused1: u16,\n\n}\n\n\n\nimpl PalmDocHeader {\n\n /// Parse a PalmDOC header from a reader. Reader must be advanced to the starting position\n\n /// of the PalmDocHeader, at byte 80 + 8 * num_records.\n\n pub(crate) fn parse<R: io::Read>(reader: &mut Reader<R>) -> io::Result<PalmDocHeader> {\n","file_path":"src/headers/palmdoch.rs","rank":1,"score":49088.846833333104},{"content":" record_count: 282,\n\n record_size: 4096,\n\n encryption: Encryption::No,\n\n ..Default::default()\n\n };\n\n\n\n let mut reader = book::u8_reader(book::PALMDOCHEADER.to_vec());\n\n\n\n assert_eq!(pdheader, PalmDocHeader::parse(&mut reader).unwrap());\n\n }\n\n\n\n #[test]\n\n fn test_write() {\n\n let input_bytes = book::PALMDOCHEADER.to_vec();\n\n\n\n let palmdoc = PalmDocHeader::parse(&mut book::u8_reader(input_bytes.clone())).unwrap();\n\n\n\n let mut output_bytes = vec![];\n\n assert!(palmdoc.write(&mut Writer::new(&mut output_bytes)).is_ok());\n\n assert_eq!(input_bytes, output_bytes);\n\n }\n\n}\n","file_path":"src/headers/palmdoch.rs","rank":2,"score":49086.08165592752},{"content":" u16::from(*self).write_be_bytes(writer)\n\n }\n\n}\n\n\n\n#[derive(Debug, Copy, Clone, PartialEq)]\n\n/// Encryption types available in MOBI format.\n\npub enum Encryption {\n\n No,\n\n OldMobiPocket,\n\n MobiPocket,\n\n}\n\n\n\nimpl Default for Encryption {\n\n fn default() -> Self {\n\n Encryption::No\n\n }\n\n}\n\n\n\nimpl From<u16> for Encryption {\n\n fn from(n: u16) -> Encryption {\n","file_path":"src/headers/palmdoch.rs","rank":3,"score":49083.487368527865},{"content":" Ok(PalmDocHeader {\n\n compression: reader.read_u16_be()?.into(),\n\n unused0: reader.read_u16_be()?,\n\n text_length: reader.read_u32_be()?,\n\n record_count: reader.read_u16_be()?,\n\n record_size: reader.read_u16_be()?,\n\n encryption: reader.read_u16_be()?.into(),\n\n unused1: reader.read_u16_be()?,\n\n })\n\n }\n\n\n\n pub(crate) fn write<W: io::Write>(&self, w: &mut Writer<W>) -> io::Result<()> {\n\n w.write_be(self.compression)?;\n\n w.write_be(self.unused0)?;\n\n w.write_be(self.text_length)?;\n\n w.write_be(self.record_count)?;\n\n w.write_be(self.record_size)?;\n\n w.write_be(self.encryption)?;\n\n w.write_be(self.unused1)\n\n }\n","file_path":"src/headers/palmdoch.rs","rank":4,"score":49083.360631183394},{"content":"use crate::writer::WriteBeBytes;\n\nuse crate::{Reader, Writer};\n\n\n\nuse std::io;\n\n\n\n#[derive(Debug, Copy, Clone, PartialEq)]\n\n/// Compression types available in MOBI format.\n\npub enum Compression {\n\n No,\n\n PalmDoc,\n\n Huff,\n\n}\n\n\n\nimpl Default for Compression {\n\n fn default() -> Compression {\n\n Compression::No\n\n }\n\n}\n\n\n\nimpl From<u16> for Compression {\n","file_path":"src/headers/palmdoch.rs","rank":5,"score":49081.66054564129},{"content":" match n {\n\n 2 => Encryption::MobiPocket,\n\n 1 => Encryption::OldMobiPocket,\n\n _ => Encryption::No,\n\n }\n\n }\n\n}\n\n\n\nimpl From<Encryption> for u16 {\n\n fn from(encryption: Encryption) -> u16 {\n\n match encryption {\n\n Encryption::No => 0,\n\n Encryption::MobiPocket => 1,\n\n Encryption::OldMobiPocket => 2,\n\n }\n\n }\n\n}\n\n\n\nimpl WriteBeBytes for Encryption {\n\n fn write_be_bytes<W: io::Write>(&self, writer: &mut W) -> io::Result<usize> {\n","file_path":"src/headers/palmdoch.rs","rank":6,"score":49078.42297112809},{"content":"\n\n pub fn compression(&self) -> Compression {\n\n self.compression\n\n }\n\n\n\n pub fn encryption(&self) -> Encryption {\n\n self.encryption\n\n }\n\n}\n\n\n\n#[cfg(test)]\n\nmod tests {\n\n use super::*;\n\n use crate::book;\n\n\n\n #[test]\n\n fn parse() {\n\n let pdheader = PalmDocHeader {\n\n compression: Compression::PalmDoc,\n\n text_length: 1151461,\n","file_path":"src/headers/palmdoch.rs","rank":7,"score":49078.02128563255},{"content":" fn from(n: u16) -> Compression {\n\n match n {\n\n 2 => Compression::PalmDoc,\n\n 17480 => Compression::Huff,\n\n _ => Compression::No,\n\n }\n\n }\n\n}\n\nimpl From<Compression> for u16 {\n\n fn from(compression: Compression) -> u16 {\n\n match compression {\n\n Compression::No => 1,\n\n Compression::PalmDoc => 2,\n\n Compression::Huff => 17480,\n\n }\n\n }\n\n}\n\n\n\nimpl WriteBeBytes for Compression {\n\n fn write_be_bytes<W: io::Write>(&self, writer: &mut W) -> io::Result<usize> {\n","file_path":"src/headers/palmdoch.rs","rank":8,"score":49070.52388523071},{"content":"}\n\n\n\nimpl ExtHeader {\n\n /// Parse a EXTH header from the content. Reader must be at starting\n\n /// location of exth header.\n\n pub(crate) fn parse<R: io::Read>(reader: &mut Reader<R>) -> io::Result<ExtHeader> {\n\n let mut extheader = ExtHeader {\n\n identifier: reader.read_u32_be()?,\n\n header_length: reader.read_u32_be()?,\n\n record_count: reader.read_u32_be()?,\n\n records: IndexMap::new(),\n\n };\n\n\n\n if &extheader.identifier.to_be_bytes() == b\"EXTH\" {\n\n extheader.populate_records(reader)?;\n\n Ok(extheader)\n\n } else {\n\n Err(io::Error::new(\n\n io::ErrorKind::InvalidData,\n\n \"invalid header identifier (expected EXTH)\",\n","file_path":"src/headers/exth.rs","rank":22,"score":48666.838672619226},{"content":" let parsed_header = ExtHeader::parse(&mut reader).unwrap();\n\n let mut records: Vec<_> = parsed_header.records().collect();\n\n\n\n _records.sort();\n\n records.sort();\n\n for (a, b) in records.into_iter().zip(_records) {\n\n assert_eq!(*a.0, b.0);\n\n assert_eq!(a.1, b.1);\n\n }\n\n }\n\n\n\n mod records {\n\n use crate::book;\n\n use crate::headers::{ExtHeader, ExthRecord};\n\n use pretty_assertions::assert_eq;\n\n\n\n macro_rules! info {\n\n ($t: ident, $s: expr) => {\n\n let mut reader = book::u8_reader(book::BOOK.to_vec());\n\n let exth = ExtHeader::parse(&mut reader).unwrap();\n","file_path":"src/headers/exth.rs","rank":23,"score":48657.46496018674},{"content":" ))\n\n }\n\n }\n\n\n\n /// Gets header records\n\n fn populate_records<R: io::Read>(&mut self, reader: &mut Reader<R>) -> io::Result<()> {\n\n for _i in 0..self.record_count {\n\n let record_type = ExthRecord::from(reader.read_u32_be()?);\n\n let record_len = reader.read_u32_be()?;\n\n\n\n let mut record_data = vec![0; (record_len - 8) as usize];\n\n reader.read_exact(&mut record_data)?;\n\n\n\n if let Some(record) = self.records.get_mut(&record_type) {\n\n record.push(record_data);\n\n } else {\n\n self.records.insert(record_type, vec![record_data]);\n\n }\n\n }\n\n\n","file_path":"src/headers/exth.rs","rank":24,"score":48657.139199664634},{"content":" 405 => IsRented,\n\n 406 => BorrowExpirationDate,\n\n 501 => Cdetype,\n\n 502 => LastUpdateTime,\n\n 503 => Title,\n\n 524 => Language,\n\n n => Other(n),\n\n }\n\n }\n\n}\n\n\n\n#[derive(Debug, Default, PartialEq)]\n\n/// Optional header containing extended information. If the MOBI header\n\n/// indicates that there's an EXTH header, it follows immediately after\n\n/// the MOBI header.\n\npub struct ExtHeader {\n\n pub identifier: u32,\n\n pub header_length: u32,\n\n pub record_count: u32,\n\n pub records: IndexMap<ExthRecord, Vec<Vec<u8>>>,\n","file_path":"src/headers/exth.rs","rank":25,"score":48655.92209842272},{"content":"use crate::{Reader, Writer};\n\n\n\nuse indexmap::IndexMap;\n\nuse std::io;\n\n\n\n#[derive(Debug, Clone, Copy, PartialEq, Eq, Hash, PartialOrd, Ord)]\n\n// Records available in EXTH header\n\npub enum ExthRecord {\n\n // source - https://wiki.mobileread.com/wiki/MOBI#EXTH_Header\n\n DrmServerId,\n\n DrmCommerceId,\n\n DrmEbookbaseBookId,\n\n Author,\n\n Publisher,\n\n Imprint,\n\n Description,\n\n Isbn,\n\n Subject,\n\n PublishDate,\n\n Review,\n","file_path":"src/headers/exth.rs","rank":26,"score":48654.98741928723},{"content":" (202.into(), vec![b\"\\0\\0\\0\\x01\".to_vec()]),\n\n (108.into(), vec![b\"calibre (0.7.31) [http://calibre-ebook.com]\".to_vec()]),\n\n ];\n\n _records.into_iter().for_each(|(k, v)| {\n\n records.insert(k, v);\n\n });\n\n\n\n let extheader = ExtHeader {\n\n identifier: 1163416648,\n\n header_length: 1109,\n\n record_count: 11,\n\n records,\n\n };\n\n\n\n let mut reader = book::u8_reader(book::BOOK.to_vec());\n\n let parsed_header = ExtHeader::parse(&mut reader).unwrap();\n\n for (k, v) in &extheader.records {\n\n let record = parsed_header.get_record(*k);\n\n assert!(record.is_some());\n\n assert_eq!(v, record.unwrap());\n","file_path":"src/headers/exth.rs","rank":27,"score":48652.41169158151},{"content":" TamperProofKeys => 209,\n\n FontSignature => 300,\n\n ClippingLimit => 401,\n\n PublisherLimit => 402,\n\n TtsFlag => 404,\n\n IsRented => 405,\n\n BorrowExpirationDate => 406,\n\n Cdetype => 501,\n\n LastUpdateTime => 502,\n\n Title => 503,\n\n Language => 524,\n\n Other(n) => n,\n\n }\n\n }\n\n}\n\n\n\nimpl From<u32> for ExthRecord {\n\n fn from(ty: u32) -> Self {\n\n use ExthRecord::*;\n\n match ty {\n","file_path":"src/headers/exth.rs","rank":28,"score":48651.99255958876},{"content":" }\n\n Ok(())\n\n }\n\n\n\n /// Returns exth record data located at position. This is a low level function intended\n\n /// to use with wrapper get_record, but exposed for convienience.\n\n pub fn get_record_position(&self, position: u32) -> Option<&Vec<Vec<u8>>> {\n\n self.get_record(ExthRecord::from(position))\n\n }\n\n\n\n /// Returns exth record data. This function limits possible queried records to only those\n\n /// commonly available among mobi ebooks.\n\n pub fn get_record(&self, record: ExthRecord) -> Option<&Vec<Vec<u8>>> {\n\n self.records.get(&record)\n\n }\n\n\n\n /// Returns an iterator over all available raw EXTH records.\n\n pub fn raw_records(&self) -> impl Iterator<Item = (&ExthRecord, &Vec<Vec<u8>>)> {\n\n self.records.iter()\n\n }\n","file_path":"src/headers/exth.rs","rank":29,"score":48651.11404649738},{"content":"\n\nimpl From<ExthRecord> for u32 {\n\n fn from(r: ExthRecord) -> Self {\n\n use ExthRecord::*;\n\n match r {\n\n DrmServerId => 1,\n\n DrmCommerceId => 2,\n\n DrmEbookbaseBookId => 3,\n\n Author => 100,\n\n Publisher => 101,\n\n Imprint => 102,\n\n Description => 103,\n\n Isbn => 104,\n\n Subject => 105,\n\n PublishDate => 106,\n\n Review => 107,\n\n Contributor => 108,\n\n Rights => 109,\n\n Subjectcode => 110,\n\n Type => 111,\n","file_path":"src/headers/exth.rs","rank":30,"score":48650.193632566006},{"content":" }\n\n assert_eq!(extheader, parsed_header);\n\n }\n\n\n\n #[test]\n\n fn test_exth_records() {\n\n let mut _records: Vec<(ExthRecord, Vec<String>)> = vec![\n\n (ExthRecord::Isbn, vec![\"9780261102316\".to_string()]),\n\n (ExthRecord::Title, vec![\"Lord of the Rings - Fellowship of the Ring\".to_string()]),\n\n (ExthRecord::HasFakeCover, vec![\"\\0\\0\\0\\0\".to_string()]),\n\n (ExthRecord::Description, vec![\"<h3>From Library Journal</h3><p>New Line Cinema will be releasing \\\"The Lord of the Rings\\\" trilogy in three separate installments, and Houghton Mifflin Tolkien's U.S. publisher since the release of The Hobbit in 1938 will be re-releasing each volume of the trilogy separately and in a boxed set (ISBN 0-618-15397-7. $22; pap. ISBN 0-618-15396-9. $12). <br />Copyright 2001 Reed Business Information, Inc. </p><h3>Review</h3><p>'An extraordinary book. It deals with a stupendous theme. It leads us through a succession of strange and astonishing episodes, some of them magnificent, in a region where everything is invented, forest, moor, river, wilderness, town and the races which inhabit them.' The Observer 'Among the greatest works of imaginative fiction of the twentieth century.' Sunday Telegraph </p>\".to_string()]),\n\n (ExthRecord::CoverOffset, vec![\"\\0\\0\\0\\0\".to_string()]),\n\n (ExthRecord::Publisher, vec![\"HarperCollins Publishers Ltd\".to_string()]),\n\n (ExthRecord::PublishDate, vec![\"2010-12-21T00:00:00+00:00\".to_string(),\"2010-12-21T00:00:00+00:00\".to_string()]),\n\n (ExthRecord::Author, vec![\"J. R. R. Tolkien\".to_string()]),\n\n (ExthRecord::ThumbOffset, vec![\"\\0\\0\\0\\x01\".to_string()]),\n\n (ExthRecord::Contributor, vec![\"calibre (0.7.31) [http://calibre-ebook.com]\".to_string()]),\n\n ];\n\n\n\n let mut reader = book::u8_reader(book::BOOK.to_vec());\n","file_path":"src/headers/exth.rs","rank":31,"score":48649.724952016084},{"content":"\n\n /// Returns an iterator over all available EXTH records and performs a loseless conversion of\n\n /// record data to string.\n\n pub fn records(&self) -> impl Iterator<Item = (&ExthRecord, Vec<String>)> {\n\n self.records.iter().map(|(r, data)| {\n\n (\n\n r,\n\n data.iter()\n\n .map(|d| String::from_utf8_lossy(d).to_string())\n\n .collect(),\n\n )\n\n })\n\n }\n\n\n\n pub(crate) fn get_record_string_lossy(&self, record: ExthRecord) -> Option<String> {\n\n self.get_record(record)\n\n .and_then(|r| r.first())\n\n .map(|r| String::from_utf8_lossy(r).to_string())\n\n }\n\n}\n","file_path":"src/headers/exth.rs","rank":32,"score":48647.88120783786},{"content":"\n\n // This fields are unsure\n\n /// 1 in this field seems to indicate a rental book\n\n IsRented,\n\n /// If this field is removed from a rental, the book says it expired in 1969\n\n BorrowExpirationDate,\n\n //\n\n ///PDOC - Personal Doc; EBOK - ebook; EBSP - ebook sample;\n\n Cdetype,\n\n LastUpdateTime,\n\n Title,\n\n Language,\n\n Other(u32),\n\n}\n\n\n\nimpl ExthRecord {\n\n pub fn position(&self) -> u32 {\n\n (*self).into()\n\n }\n\n}\n","file_path":"src/headers/exth.rs","rank":33,"score":48647.268130296026},{"content":" Ok(())\n\n }\n\n\n\n pub(crate) fn write<W: io::Write>(&self, w: &mut Writer<W>) -> io::Result<()> {\n\n w.write_be(self.identifier)?;\n\n w.write_be(\n\n 12u32\n\n + self\n\n .records\n\n .iter()\n\n .map(|(_, d)| 8 + d.len() as u32)\n\n .sum::<u32>(),\n\n )?;\n\n w.write_be(self.records.len() as u32)?;\n\n for (&id, records) in self.records.iter() {\n\n for record_data in records {\n\n w.write_be(id.position())?;\n\n w.write_be(record_data.len() as u32 + 8)?;\n\n w.write_be(record_data)?;\n\n }\n","file_path":"src/headers/exth.rs","rank":34,"score":48646.09254012007},{"content":" DictionaryShortName,\n\n /// Add to first image field in Mobi Header to find PDB record containing the cover image\n\n CoverOffset,\n\n /// Add to first image field in Mobi Header to find PDB record containing the thumbnail cover image\n\n ThumbOffset,\n\n HasFakeCover,\n\n /// Known Values: 1=mobigen, 2=Mobipocket Creator, 200=kindlegen (Windows), 201=kindlegen (Linux), 202=kindlegen (Mac). Warning: Calibre creates fake creator entries, pretending to be a Linux kindlegen 1.2 (201, 1, 2, 33307) for normal ebooks and a non-public Linux kindlegen 2.0 (201, 2, 0, 101) for periodicals.\n\n CreatorSoftware,\n\n CreatoreMajorVersion,\n\n CreatorMinorVersion,\n\n CreatorBuildNumber,\n\n Watermark,\n\n /// Used by the Kindle (and Android app) for generating book-specific PIDs.\n\n TamperProofKeys,\n\n FontSignature,\n\n /// Integer percentage of the text allowed to be clipped. Usually 10.\n\n ClippingLimit,\n\n PublisherLimit,\n\n /// 1 - Text to Speech disabled; 0 - Text to Speech enabled\n\n TtsFlag,\n","file_path":"src/headers/exth.rs","rank":35,"score":48645.00007682923},{"content":"\n\n#[cfg(test)]\n\nmod tests {\n\n use super::*;\n\n use crate::book;\n\n use pretty_assertions::assert_eq;\n\n\n\n #[test]\n\n fn test_parse() {\n\n let mut records = IndexMap::new();\n\n #[rustfmt::skip]\n\n let _records = vec![\n\n (104.into(), vec![b\"9780261102316\".to_vec()]),\n\n (503.into(), vec![b\"Lord of the Rings - Fellowship of the Ring\".to_vec()]),\n\n (203.into(), vec![b\"\\0\\0\\0\\0\".to_vec()]),\n\n (103.into(), vec![b\"<h3>From Library Journal</h3><p>New Line Cinema will be releasing \\\"The Lord of the Rings\\\" trilogy in three separate installments, and Houghton Mifflin Tolkien's U.S. publisher since the release of The Hobbit in 1938 will be re-releasing each volume of the trilogy separately and in a boxed set (ISBN 0-618-15397-7. $22; pap. ISBN 0-618-15396-9. $12). <br />Copyright 2001 Reed Business Information, Inc. </p><h3>Review</h3><p>'An extraordinary book. It deals with a stupendous theme. It leads us through a succession of strange and astonishing episodes, some of them magnificent, in a region where everything is invented, forest, moor, river, wilderness, town and the races which inhabit them.' The Observer 'Among the greatest works of imaginative fiction of the twentieth century.' Sunday Telegraph </p>\".to_vec()]),\n\n (201.into(), vec![b\"\\0\\0\\0\\0\".to_vec()]),\n\n (101.into(), vec![b\"HarperCollins Publishers Ltd\".to_vec()]),\n\n (106.into(), vec![b\"2010-12-21T00:00:00+00:00\".to_vec(),b\"2010-12-21T00:00:00+00:00\".to_vec()]),\n\n (100.into(), vec![b\"J. R. R. Tolkien\".to_vec()]),\n","file_path":"src/headers/exth.rs","rank":36,"score":48644.47771713341},{"content":" let data = exth.get_record_string_lossy(ExthRecord::$t);\n\n assert_eq!(data, Some(String::from($s)));\n\n };\n\n }\n\n\n\n #[test]\n\n fn author() {\n\n info!(Author, \"J. R. R. Tolkien\");\n\n }\n\n\n\n #[test]\n\n fn publisher() {\n\n info!(Publisher, \"HarperCollins Publishers Ltd\");\n\n }\n\n\n\n #[test]\n\n fn description() {\n\n info!(Description, \"<h3>From Library Journal</h3><p>New Line Cinema will be releasing \\\"The Lord of the Rings\\\" trilogy in three separate installments, and Houghton Mifflin Tolkien\\'s U.S. publisher since the release of The Hobbit in 1938 will be re-releasing each volume of the trilogy separately and in a boxed set (ISBN 0-618-15397-7. $22; pap. ISBN 0-618-15396-9. $12). <br />Copyright 2001 Reed Business Information, Inc. </p><h3>Review</h3><p>\\'An extraordinary book. It deals with a stupendous theme. It leads us through a succession of strange and astonishing episodes, some of them magnificent, in a region where everything is invented, forest, moor, river, wilderness, town and the races which inhabit them.\\' The Observer \\'Among the greatest works of imaginative fiction of the twentieth century.\\' Sunday Telegraph </p>\");\n\n }\n\n\n","file_path":"src/headers/exth.rs","rank":37,"score":48642.40485998816},{"content":" Source => 112,\n\n Asin => 113,\n\n VersionNumber => 114,\n\n Sample => 115,\n\n Startreading => 116,\n\n Adult => 117,\n\n RetailPrice => 118,\n\n RetailPriceCurrency => 119,\n\n KF8BoundaryOffset => 121,\n\n CountOfResources => 125,\n\n KF8CoverURI => 129,\n\n DictionaryShortName => 200,\n\n CoverOffset => 201,\n\n ThumbOffset => 202,\n\n HasFakeCover => 203,\n\n CreatorSoftware => 204,\n\n CreatoreMajorVersion => 205,\n\n CreatorMinorVersion => 206,\n\n CreatorBuildNumber => 207,\n\n Watermark => 208,\n","file_path":"src/headers/exth.rs","rank":38,"score":48638.59226938024},{"content":" 117 => Adult,\n\n 118 => RetailPrice,\n\n 119 => RetailPriceCurrency,\n\n 121 => KF8BoundaryOffset,\n\n 125 => CountOfResources,\n\n 129 => KF8CoverURI,\n\n 200 => DictionaryShortName,\n\n 201 => CoverOffset,\n\n 202 => ThumbOffset,\n\n 203 => HasFakeCover,\n\n 204 => CreatorSoftware,\n\n 205 => CreatoreMajorVersion,\n\n 206 => CreatorMinorVersion,\n\n 207 => CreatorBuildNumber,\n\n 208 => Watermark,\n\n 209 => TamperProofKeys,\n\n 300 => FontSignature,\n\n 401 => ClippingLimit,\n\n 402 => PublisherLimit,\n\n 404 => TtsFlag,\n","file_path":"src/headers/exth.rs","rank":39,"score":48638.4867990493},{"content":" Contributor,\n\n Rights,\n\n Subjectcode,\n\n Type,\n\n Source,\n\n Asin,\n\n VersionNumber,\n\n /// 0x0001 if the book content is only a sample of the full book\n\n Sample,\n\n /// Position (4-byte offset) in file at which to open when first opened\n\n Startreading,\n\n /// Mobipocket Creator adds this if Adult only is checked on its GUI; contents: \"yes\"\n\n Adult,\n\n /// As text, e.g. \"4.99\"\n\n RetailPrice,\n\n /// As text, e.g. \"USD\"\n\n RetailPriceCurrency,\n\n KF8BoundaryOffset,\n\n CountOfResources,\n\n KF8CoverURI,\n","file_path":"src/headers/exth.rs","rank":40,"score":48636.34828913833},{"content":" #[test]\n\n fn isbn() {\n\n info!(Isbn, \"9780261102316\");\n\n }\n\n\n\n #[test]\n\n fn publish_date() {\n\n info!(PublishDate, \"2010-12-21T00:00:00+00:00\");\n\n }\n\n\n\n #[test]\n\n fn contributor() {\n\n info!(Contributor, \"calibre (0.7.31) [http://calibre-ebook.com]\");\n\n }\n\n\n\n #[test]\n\n fn title() {\n\n info!(Title, \"Lord of the Rings - Fellowship of the Ring\");\n\n }\n\n }\n\n}\n","file_path":"src/headers/exth.rs","rank":41,"score":48636.34828913833},{"content":" 1 => DrmServerId,\n\n 2 => DrmCommerceId,\n\n 3 => DrmEbookbaseBookId,\n\n 100 => Author,\n\n 101 => Publisher,\n\n 102 => Imprint,\n\n 103 => Description,\n\n 104 => Isbn,\n\n 105 => Subject,\n\n 106 => PublishDate,\n\n 107 => Review,\n\n 108 => Contributor,\n\n 109 => Rights,\n\n 110 => Subjectcode,\n\n 111 => Type,\n\n 112 => Source,\n\n 113 => Asin,\n\n 114 => VersionNumber,\n\n 115 => Sample,\n\n 116 => Startreading,\n","file_path":"src/headers/exth.rs","rank":42,"score":48636.34828913833},{"content":" first_index_record: 0xFFFF_FFFF,\n\n unused_9: vec![],\n\n }\n\n }\n\n}\n\n\n\nimpl MobiHeader {\n\n /// Parse a Mobi header from the content. The reader must be advanced to the starting\n\n /// position of the Mobi header.\n\n pub(crate) fn parse<R: io::Read>(reader: &mut Reader<R>) -> io::Result<MobiHeader> {\n\n let identifier = reader.read_u32_be()?;\n\n if &identifier.to_be_bytes() != b\"MOBI\" {\n\n return Err(io::Error::new(\n\n io::ErrorKind::InvalidData,\n\n \"invalid header identifier (expected MOBI)\",\n\n ));\n\n }\n\n let header_length = reader.read_u32_be()?;\n\n\n\n Ok(MobiHeader {\n","file_path":"src/headers/mobih.rs","rank":43,"score":48046.45534447323},{"content":"}\n\n\n\nimpl Default for Language {\n\n fn default() -> Self {\n\n Language::Neutral\n\n }\n\n}\n\n\n\nimpl WriteBeBytes for Language {\n\n fn write_be_bytes<W: io::Write>(&self, writer: &mut W) -> io::Result<usize> {\n\n u8::from(*self).write_be_bytes(writer)\n\n }\n\n}\n\n\n\n#[cfg(test)]\n\nmod tests {\n\n use super::{Language, MobiHeader, MobiType, TextEncoding};\n\n use crate::book;\n\n use crate::writer::Writer;\n\n\n","file_path":"src/headers/mobih.rs","rank":44,"score":48043.46264850513},{"content":" extra_record_data_flags: reader.read_u32_be()?,\n\n first_index_record: reader.read_u32_be()?,\n\n unused_9: {\n\n let mut unused = vec![0; header_length as usize - 232];\n\n reader.read_exact(&mut unused)?;\n\n unused\n\n },\n\n })\n\n }\n\n\n\n /// Parse a Mobi header from the content. The reader must be advanced to the starting\n\n /// position of the Mobi header.\n\n pub(crate) fn write<W: io::Write>(&self, w: &mut Writer<W>) -> io::Result<()> {\n\n w.write_be(self.identifier)?;\n\n w.write_be(self.header_length)?;\n\n w.write_be(self.mobi_type)?;\n\n w.write_be(self.text_encoding)?;\n\n w.write_be(self.id)?;\n\n w.write_be(self.gen_version)?;\n\n w.write_be(self.ortho_index)?;\n","file_path":"src/headers/mobih.rs","rank":45,"score":48041.34131027723},{"content":" unused_5: u32, // flis record count?\n\n unused_6: u64,\n\n unused_7: u32,\n\n first_compilation_data_section_count: u32,\n\n data_section_count: u32,\n\n unused_8: u32,\n\n extra_record_data_flags: u32,\n\n pub first_index_record: u32,\n\n unused_9: Vec<u8>,\n\n}\n\n\n\nimpl Default for MobiHeader {\n\n fn default() -> Self {\n\n MobiHeader {\n\n identifier: 0,\n\n header_length: 0,\n\n mobi_type: MobiType::default(),\n\n text_encoding: TextEncoding::default(),\n\n id: 0,\n\n gen_version: 0,\n","file_path":"src/headers/mobih.rs","rank":46,"score":48037.04151479006},{"content":" unused_3: 1,\n\n unused_4: 1,\n\n unused_5: 1,\n\n unused_6: 0,\n\n unused_7: 0xFFFF_FFFF,\n\n first_compilation_data_section_count: 0,\n\n data_section_count: 0xFFFF_FFFF,\n\n unused_8: 0xFFFF_FFFF,\n\n extra_record_data_flags: 7,\n\n first_index_record: 284,\n\n unused_9: vec![],\n\n };\n\n\n\n let mut reader = book::u8_reader(book::MOBIHEADER.to_vec());\n\n let test_header = MobiHeader::parse(&mut reader).unwrap();\n\n\n\n assert_eq!(mobiheader, test_header);\n\n }\n\n\n\n #[test]\n","file_path":"src/headers/mobih.rs","rank":47,"score":48036.82446619371},{"content":" name_length: reader.read_u32_be()?,\n\n unused: reader.read_u16_be()?,\n\n locale: reader.read_u8()?,\n\n language_code: reader.read_u8()?.into(),\n\n input_language: reader.read_u32_be()?,\n\n output_language: reader.read_u32_be()?,\n\n format_version: reader.read_u32_be()?,\n\n first_image_index: reader.read_u32_be()?,\n\n first_huff_record: reader.read_u32_be()?,\n\n huff_record_count: reader.read_u32_be()?,\n\n huff_table_offset: reader.read_u32_be()?,\n\n huff_table_length: reader.read_u32_be()?,\n\n exth_flags: reader.read_u32_be()?,\n\n unused_0: {\n\n let mut bytes = [0; 32];\n\n reader.read_exact(&mut bytes)?;\n\n Box::new(bytes)\n\n },\n\n unused_1: reader.read_u32_be()?,\n\n drm_offset: reader.read_u32_be()?,\n","file_path":"src/headers/mobih.rs","rank":48,"score":48036.00402987107},{"content":" w.write_be(self.extra_record_data_flags)?;\n\n w.write_be(self.first_index_record)?;\n\n w.write_be(self.unused_9.as_slice())\n\n }\n\n\n\n /// Checks if there is a Exth Header and changes the parameter\n\n pub fn has_exth_header(&self) -> bool {\n\n (self.exth_flags & EXTH_ON_FLAG) != 0\n\n }\n\n\n\n /// Checks if there is DRM on this book\n\n pub fn has_drm(&self) -> bool {\n\n self.drm_offset != DRM_ON_FLAG\n\n }\n\n\n\n /// Converts numerical value into a type\n\n pub fn mobi_type(&self) -> MobiType {\n\n self.mobi_type\n\n }\n\n\n","file_path":"src/headers/mobih.rs","rank":49,"score":48035.81736865054},{"content":"use crate::writer::WriteBeBytes;\n\nuse crate::{Reader, Writer};\n\n\n\nuse std::io;\n\n\n\nconst DRM_ON_FLAG: u32 = 0xFFFF_FFFF;\n\nconst EXTH_ON_FLAG: u32 = 0x40;\n\n\n\n#[derive(Debug, PartialEq, Copy, Clone)]\n\npub enum MobiType {\n\n MobiPocketBook,\n\n PalmDocBook,\n\n Audio,\n\n News,\n\n NewsFeed,\n\n NewsMagazine,\n\n PICS,\n\n WORD,\n\n XLS,\n\n PPT,\n","file_path":"src/headers/mobih.rs","rank":50,"score":48035.47945984232},{"content":" fn test_write() {\n\n let input_bytes = book::MOBIHEADER.to_vec();\n\n\n\n let mobiheader = MobiHeader::parse(&mut book::u8_reader(input_bytes.clone())).unwrap();\n\n\n\n let mut output_bytes = vec![];\n\n assert!(mobiheader\n\n .write(&mut Writer::new(&mut output_bytes))\n\n .is_ok());\n\n assert_eq!(input_bytes.len(), output_bytes.len());\n\n assert_eq!(input_bytes, output_bytes);\n\n }\n\n}\n","file_path":"src/headers/mobih.rs","rank":51,"score":48035.40500386029},{"content":" TEXT,\n\n HTML,\n\n Unknown,\n\n}\n\n\n\nimpl Default for MobiType {\n\n fn default() -> Self {\n\n MobiType::Unknown\n\n }\n\n}\n\n\n\nimpl From<u32> for MobiType {\n\n fn from(ty: u32) -> Self {\n\n use MobiType::*;\n\n match ty {\n\n 2 => MobiPocketBook,\n\n 3 => PalmDocBook,\n\n 4 => Audio,\n\n 257 => News,\n\n 258 => NewsFeed,\n","file_path":"src/headers/mobih.rs","rank":52,"score":48035.33812423011},{"content":" identifier,\n\n header_length,\n\n mobi_type: reader.read_u32_be()?.into(),\n\n text_encoding: reader.read_u32_be()?.into(),\n\n id: reader.read_u32_be()?,\n\n gen_version: reader.read_u32_be()?,\n\n ortho_index: reader.read_u32_be()?,\n\n inflect_index: reader.read_u32_be()?,\n\n index_names: reader.read_u32_be()?,\n\n index_keys: reader.read_u32_be()?,\n\n extra_indices: [\n\n reader.read_u32_be()?,\n\n reader.read_u32_be()?,\n\n reader.read_u32_be()?,\n\n reader.read_u32_be()?,\n\n reader.read_u32_be()?,\n\n reader.read_u32_be()?,\n\n ],\n\n first_non_book_index: reader.read_u32_be()?,\n\n name_offset: reader.read_u32_be()?,\n","file_path":"src/headers/mobih.rs","rank":53,"score":48034.59545345812},{"content":" fn test_drm() {\n\n let mobiheader = MobiHeader {\n\n drm_offset: 1,\n\n ..Default::default()\n\n };\n\n\n\n assert!(mobiheader.has_drm());\n\n }\n\n\n\n #[test]\n\n fn test_no_drm() {\n\n let mobiheader = MobiHeader {\n\n drm_offset: 0xFFFF_FFFF,\n\n ..Default::default()\n\n };\n\n\n\n assert!(!mobiheader.has_drm());\n\n }\n\n\n\n #[test]\n","file_path":"src/headers/mobih.rs","rank":54,"score":48034.193614258336},{"content":"}\n\n\n\nimpl From<TextEncoding> for u32 {\n\n fn from(encoding: TextEncoding) -> Self {\n\n match encoding {\n\n TextEncoding::CP1252 => 1252,\n\n TextEncoding::UTF8 => 65001,\n\n TextEncoding::Unknown(n) => n,\n\n }\n\n }\n\n}\n\n\n\nimpl WriteBeBytes for TextEncoding {\n\n fn write_be_bytes<W: io::Write>(&self, writer: &mut W) -> io::Result<usize> {\n\n u32::from(*self).write_be_bytes(writer)\n\n }\n\n}\n\n\n\n#[derive(Debug, PartialEq)]\n\n/// Strcture that holds Mobi header information\n","file_path":"src/headers/mobih.rs","rank":55,"score":48034.17503776838},{"content":" drm_count: reader.read_u32_be()?,\n\n drm_size: reader.read_u32_be()?,\n\n drm_flags: reader.read_u32_be()?,\n\n unused_2: {\n\n let mut bytes = [0; 8];\n\n reader.read_exact(&mut bytes)?;\n\n Box::new(bytes)\n\n },\n\n first_content_record: reader.read_u16_be()?,\n\n last_content_record: reader.read_u16_be()?,\n\n unused_3: reader.read_u32_be()?,\n\n fcis_record: reader.read_u32_be()?,\n\n unused_4: reader.read_u32_be()?,\n\n flis_record: reader.read_u32_be()?,\n\n unused_5: reader.read_u32_be()?,\n\n unused_6: reader.read_u64_be()?,\n\n unused_7: reader.read_u32_be()?,\n\n first_compilation_data_section_count: reader.read_u32_be()?,\n\n data_section_count: reader.read_u32_be()?,\n\n unused_8: reader.read_u32_be()?,\n","file_path":"src/headers/mobih.rs","rank":56,"score":48033.75592989133},{"content":"pub struct MobiHeader {\n\n pub identifier: u32,\n\n pub header_length: u32,\n\n pub mobi_type: MobiType,\n\n pub text_encoding: TextEncoding,\n\n pub id: u32,\n\n pub gen_version: u32,\n\n pub ortho_index: u32,\n\n pub inflect_index: u32,\n\n pub index_names: u32,\n\n pub index_keys: u32,\n\n pub extra_indices: [u32; 6],\n\n pub first_non_book_index: u32,\n\n pub name_offset: u32,\n\n pub name_length: u32,\n\n unused: u16,\n\n pub locale: u8,\n\n pub language_code: Language,\n\n pub input_language: u32,\n\n pub output_language: u32,\n","file_path":"src/headers/mobih.rs","rank":57,"score":48032.425938546476},{"content":" #[test]\n\n fn test_parse() {\n\n let mobiheader = MobiHeader {\n\n identifier: 1297039945,\n\n header_length: 232,\n\n mobi_type: MobiType::MobiPocketBook,\n\n text_encoding: TextEncoding::UTF8,\n\n id: 3428045761,\n\n gen_version: 6,\n\n ortho_index: 0xFFFF_FFFF,\n\n inflect_index: 0xFFFF_FFFF,\n\n index_names: 0xFFFF_FFFF,\n\n index_keys: 0xFFFF_FFFF,\n\n extra_indices: [0xFFFF_FFFF; 6],\n\n first_non_book_index: 284,\n\n name_offset: 1360,\n\n name_length: 42,\n\n unused: 0,\n\n locale: 8,\n\n language_code: Language::English,\n","file_path":"src/headers/mobih.rs","rank":58,"score":48031.52662397992},{"content":"pub enum TextEncoding {\n\n CP1252,\n\n UTF8,\n\n Unknown(u32),\n\n}\n\n\n\nimpl Default for TextEncoding {\n\n fn default() -> Self {\n\n TextEncoding::UTF8\n\n }\n\n}\n\n\n\nimpl From<u32> for TextEncoding {\n\n fn from(num: u32) -> Self {\n\n match num {\n\n 1252 => TextEncoding::CP1252,\n\n 65001 => TextEncoding::UTF8,\n\n n => TextEncoding::Unknown(n),\n\n }\n\n }\n","file_path":"src/headers/mobih.rs","rank":59,"score":48031.383116584744},{"content":" NewsFeed => 258,\n\n NewsMagazine => 259,\n\n PICS => 513,\n\n WORD => 514,\n\n XLS => 515,\n\n PPT => 516,\n\n TEXT => 517,\n\n HTML => 518,\n\n Unknown => 0,\n\n }\n\n }\n\n}\n\n\n\nimpl WriteBeBytes for MobiType {\n\n fn write_be_bytes<W: io::Write>(&self, writer: &mut W) -> io::Result<usize> {\n\n u32::from(*self).write_be_bytes(writer)\n\n }\n\n}\n\n\n\n#[derive(Debug, PartialEq, Copy, Clone)]\n","file_path":"src/headers/mobih.rs","rank":60,"score":48030.15587003768},{"content":" pub format_version: u32,\n\n pub first_image_index: u32,\n\n pub first_huff_record: u32,\n\n pub huff_record_count: u32,\n\n pub huff_table_offset: u32,\n\n pub huff_table_length: u32,\n\n pub exth_flags: u32,\n\n unused_0: Box<[u8; 32]>,\n\n unused_1: u32,\n\n pub drm_offset: u32,\n\n pub drm_count: u32,\n\n pub drm_size: u32,\n\n pub drm_flags: u32,\n\n unused_2: Box<[u8; 8]>,\n\n pub first_content_record: u16,\n\n pub last_content_record: u16,\n\n unused_3: u32,\n\n pub fcis_record: u32,\n\n unused_4: u32, // fcis record count?\n\n pub flis_record: u32,\n","file_path":"src/headers/mobih.rs","rank":61,"score":48029.15998343508},{"content":" 259 => NewsMagazine,\n\n 513 => PICS,\n\n 514 => WORD,\n\n 515 => XLS,\n\n 516 => PPT,\n\n 517 => TEXT,\n\n 518 => HTML,\n\n _ => Unknown,\n\n }\n\n }\n\n}\n\n\n\nimpl From<MobiType> for u32 {\n\n fn from(ty: MobiType) -> u32 {\n\n use MobiType::*;\n\n match ty {\n\n MobiPocketBook => 2,\n\n PalmDocBook => 3,\n\n Audio => 4,\n\n News => 257,\n","file_path":"src/headers/mobih.rs","rank":62,"score":48029.000248510376},{"content":" 68 => Tatar,\n\n 74 => Telugu,\n\n 30 => Thai,\n\n 49 => Tsonga,\n\n 50 => Tswana,\n\n 31 => Turkish,\n\n 34 => Ukrainian,\n\n 32 => Urdu,\n\n 67 => Uzbek,\n\n 42 => Vietnamese,\n\n 52 => Xhosa,\n\n 53 => Zulu,\n\n _ => Unknown,\n\n }\n\n }\n\n}\n\n\n\nimpl From<Language> for u8 {\n\n fn from(lang: Language) -> Self {\n\n use Language::*;\n","file_path":"src/headers/mobih.rs","rank":63,"score":48028.65821311584},{"content":" Tsonga,\n\n Tswana,\n\n Turkish,\n\n Ukrainian,\n\n Urdu,\n\n Uzbek,\n\n Vietnamese,\n\n Xhosa,\n\n Zulu,\n\n Unknown,\n\n}\n\n\n\nimpl From<u8> for Language {\n\n fn from(code: u8) -> Self {\n\n use Language::*;\n\n match code {\n\n 0 => Neutral,\n\n 54 => Afrikaans,\n\n 28 => Albanian,\n\n 1 => Arabic,\n","file_path":"src/headers/mobih.rs","rank":64,"score":48028.36609169285},{"content":" ortho_index: 0xFFFF_FFFF,\n\n inflect_index: 0xFFFF_FFFF,\n\n index_names: 0xFFFF_FFFF,\n\n index_keys: 0xFFFF_FFFF,\n\n extra_indices: [0xFFFF_FFFF; 6],\n\n first_non_book_index: 0,\n\n name_offset: 0,\n\n name_length: 0,\n\n unused: 0,\n\n locale: 0,\n\n language_code: Language::default(),\n\n input_language: 0,\n\n output_language: 0,\n\n format_version: 0,\n\n first_image_index: 0,\n\n first_huff_record: 0,\n\n huff_record_count: 0,\n\n huff_table_offset: 0,\n\n huff_table_length: 0,\n\n exth_flags: 0,\n","file_path":"src/headers/mobih.rs","rank":65,"score":48028.018065801996},{"content":" w.write_be(self.inflect_index)?;\n\n w.write_be(self.index_names)?;\n\n w.write_be(self.index_keys)?;\n\n for &i in &self.extra_indices {\n\n w.write_be(i)?;\n\n }\n\n w.write_be(self.first_non_book_index)?;\n\n w.write_be(self.name_offset)?;\n\n w.write_be(self.name_length)?;\n\n w.write_be(self.unused)?;\n\n w.write_be(self.locale)?;\n\n w.write_be(self.language_code)?;\n\n w.write_be(self.input_language)?;\n\n w.write_be(self.output_language)?;\n\n w.write_be(self.format_version)?;\n\n w.write_be(self.first_image_index)?;\n\n w.write_be(self.first_huff_record)?;\n\n w.write_be(self.huff_record_count)?;\n\n w.write_be(self.huff_table_offset)?;\n\n w.write_be(self.huff_table_length)?;\n","file_path":"src/headers/mobih.rs","rank":66,"score":48026.060447126765},{"content":" input_language: 0,\n\n output_language: 0,\n\n format_version: 6,\n\n first_image_index: 287,\n\n first_huff_record: 0,\n\n huff_record_count: 0,\n\n huff_table_offset: 0,\n\n huff_table_length: 0,\n\n exth_flags: 80,\n\n drm_offset: 4294967295,\n\n drm_count: 0,\n\n drm_size: 0,\n\n drm_flags: 0,\n\n first_content_record: 1,\n\n last_content_record: 288,\n\n fcis_record: 290,\n\n flis_record: 289,\n\n unused_0: Box::new([0; 32]),\n\n unused_1: 0xFFFF_FFFF,\n\n unused_2: Box::new([0, 0, 0, 0, 0, 0, 0, 0]),\n","file_path":"src/headers/mobih.rs","rank":67,"score":48025.9497781146},{"content":" // Mobi format only specifies this two encodings so\n\n // this should never panic\n\n pub fn text_encoding(&self) -> TextEncoding {\n\n self.text_encoding\n\n }\n\n\n\n pub fn language(&self) -> Language {\n\n self.language_code\n\n }\n\n}\n\n\n\n#[derive(Debug, PartialEq, Copy, Clone)]\n\npub enum Language {\n\n Neutral,\n\n Afrikaans,\n\n Albanian,\n\n Arabic,\n\n Armenian,\n\n Assamese,\n\n Azeri,\n","file_path":"src/headers/mobih.rs","rank":68,"score":48025.94429699753},{"content":" w.write_be(self.exth_flags)?;\n\n w.write_be(self.unused_0.as_ref().as_ref())?;\n\n w.write_be(self.unused_1)?;\n\n w.write_be(self.drm_offset)?;\n\n w.write_be(self.drm_count)?;\n\n w.write_be(self.drm_size)?;\n\n w.write_be(self.drm_flags)?;\n\n w.write_be(self.unused_2.as_ref().as_ref())?;\n\n w.write_be(self.first_content_record)?;\n\n w.write_be(self.last_content_record)?;\n\n w.write_be(self.unused_3)?;\n\n w.write_be(self.fcis_record)?;\n\n w.write_be(self.unused_4)?;\n\n w.write_be(self.flis_record)?;\n\n w.write_be(self.unused_5)?;\n\n w.write_be(self.unused_6)?;\n\n w.write_be(self.unused_7)?;\n\n w.write_be(self.first_compilation_data_section_count)?;\n\n w.write_be(self.data_section_count)?;\n\n w.write_be(self.unused_8)?;\n","file_path":"src/headers/mobih.rs","rank":69,"score":48025.33438369866},{"content":" unused_0: Box::new([0; 32]),\n\n unused_1: 0xFFFF_FFFF,\n\n drm_offset: 0,\n\n drm_count: 0,\n\n drm_size: 0,\n\n drm_flags: 0,\n\n unused_2: Box::new([0; 8]),\n\n first_content_record: 1,\n\n last_content_record: 0,\n\n unused_3: 1,\n\n fcis_record: 0,\n\n unused_4: 1,\n\n flis_record: 0,\n\n unused_5: 1,\n\n unused_6: 0,\n\n unused_7: 0xFFFF_FFFF,\n\n first_compilation_data_section_count: 0,\n\n data_section_count: 0xFFFF_FFFF,\n\n unused_8: 0xFFFF_FFFF,\n\n extra_record_data_flags: 0,\n","file_path":"src/headers/mobih.rs","rank":70,"score":48023.79485098548},{"content":" Basque,\n\n Belarusian,\n\n Bengali,\n\n Bulgarian,\n\n Catalan,\n\n Chinese,\n\n Czech,\n\n Danish,\n\n Dutch,\n\n English,\n\n Estonian,\n\n Faeroese,\n\n Farsi,\n\n Finnish,\n\n French,\n\n Georgian,\n\n German,\n\n Greek,\n\n Gujarati,\n\n Hebrew,\n","file_path":"src/headers/mobih.rs","rank":71,"score":48020.44184131855},{"content":" Polish,\n\n Portuguese,\n\n Punjabi,\n\n Rhaetoromanic,\n\n Romanian,\n\n Russian,\n\n Sami,\n\n Sanskrit,\n\n Serbian,\n\n Slovak,\n\n Slovenian,\n\n Sorbian,\n\n Spanish,\n\n Sutu,\n\n Swahili,\n\n Swedish,\n\n Tamil,\n\n Tatar,\n\n Telugu,\n\n Thai,\n","file_path":"src/headers/mobih.rs","rank":72,"score":48020.44184131855},{"content":" match lang {\n\n Neutral => 0,\n\n Afrikaans => 54,\n\n Albanian => 28,\n\n Arabic => 1,\n\n Armenian => 43,\n\n Assamese => 77,\n\n Azeri => 44,\n\n Basque => 45,\n\n Belarusian => 35,\n\n Bengali => 69,\n\n Bulgarian => 2,\n\n Catalan => 3,\n\n Chinese => 4,\n\n Czech => 5,\n\n Danish => 6,\n\n Dutch => 19,\n\n English => 9,\n\n Estonian => 37,\n\n Faeroese => 56,\n","file_path":"src/headers/mobih.rs","rank":73,"score":48020.44184131855},{"content":" Hindi,\n\n Hungarian,\n\n Icelandic,\n\n Indonesian,\n\n Italian,\n\n Japanese,\n\n Kannada,\n\n Kazak,\n\n Konkani,\n\n Korean,\n\n Latvian,\n\n Lithuanian,\n\n Macedonian,\n\n Malay,\n\n Malayalam,\n\n Maltese,\n\n Marathi,\n\n Nepali,\n\n Norwegian,\n\n Oriya,\n","file_path":"src/headers/mobih.rs","rank":74,"score":48020.44184131855},{"content":" Spanish => 10,\n\n Sutu => 48,\n\n Swahili => 65,\n\n Swedish => 29,\n\n Tamil => 73,\n\n Tatar => 68,\n\n Telugu => 74,\n\n Thai => 30,\n\n Tsonga => 49,\n\n Tswana => 50,\n\n Turkish => 31,\n\n Ukrainian => 34,\n\n Urdu => 32,\n\n Uzbek => 67,\n\n Vietnamese => 42,\n\n Xhosa => 52,\n\n Zulu => 53,\n\n Unknown => u8::MAX,\n\n }\n\n }\n","file_path":"src/headers/mobih.rs","rank":75,"score":48020.44184131855},{"content":" 43 => Armenian,\n\n 77 => Assamese,\n\n 44 => Azeri,\n\n 45 => Basque,\n\n 35 => Belarusian,\n\n 69 => Bengali,\n\n 2 => Bulgarian,\n\n 3 => Catalan,\n\n 4 => Chinese,\n\n 5 => Czech,\n\n 6 => Danish,\n\n 19 => Dutch,\n\n 9 => English,\n\n 37 => Estonian,\n\n 56 => Faeroese,\n\n 41 => Farsi,\n\n 11 => Finnish,\n\n 12 => French,\n\n 55 => Georgian,\n\n 7 => German,\n","file_path":"src/headers/mobih.rs","rank":76,"score":48020.44184131855},{"content":" Farsi => 41,\n\n Finnish => 11,\n\n French => 12,\n\n Georgian => 55,\n\n German => 7,\n\n Greek => 8,\n\n Gujarati => 71,\n\n Hebrew => 13,\n\n Hindi => 57,\n\n Hungarian => 14,\n\n Icelandic => 15,\n\n Indonesian => 33,\n\n Italian => 16,\n\n Japanese => 17,\n\n Kannada => 75,\n\n Kazak => 63,\n\n Konkani => 87,\n\n Korean => 18,\n\n Latvian => 38,\n\n Lithuanian => 39,\n","file_path":"src/headers/mobih.rs","rank":77,"score":48020.44184131855},{"content":" 97 => Nepali,\n\n 20 => Norwegian,\n\n 72 => Oriya,\n\n 21 => Polish,\n\n 22 => Portuguese,\n\n 70 => Punjabi,\n\n 23 => Rhaetoromanic,\n\n 24 => Romanian,\n\n 25 => Russian,\n\n 59 => Sami,\n\n 79 => Sanskrit,\n\n 26 => Serbian,\n\n 27 => Slovak,\n\n 36 => Slovenian,\n\n 46 => Sorbian,\n\n 10 => Spanish,\n\n 48 => Sutu,\n\n 65 => Swahili,\n\n 29 => Swedish,\n\n 73 => Tamil,\n","file_path":"src/headers/mobih.rs","rank":78,"score":48020.44184131855},{"content":" Macedonian => 47,\n\n Malay => 62,\n\n Malayalam => 76,\n\n Maltese => 58,\n\n Marathi => 78,\n\n Nepali => 97,\n\n Norwegian => 20,\n\n Oriya => 72,\n\n Polish => 21,\n\n Portuguese => 22,\n\n Punjabi => 70,\n\n Rhaetoromanic => 23,\n\n Romanian => 24,\n\n Russian => 25,\n\n Sami => 59,\n\n Sanskrit => 79,\n\n Serbian => 26,\n\n Slovak => 27,\n\n Slovenian => 36,\n\n Sorbian => 46,\n","file_path":"src/headers/mobih.rs","rank":79,"score":48020.44184131855},{"content":" 8 => Greek,\n\n 71 => Gujarati,\n\n 13 => Hebrew,\n\n 57 => Hindi,\n\n 14 => Hungarian,\n\n 15 => Icelandic,\n\n 33 => Indonesian,\n\n 16 => Italian,\n\n 17 => Japanese,\n\n 75 => Kannada,\n\n 63 => Kazak,\n\n 87 => Konkani,\n\n 18 => Korean,\n\n 38 => Latvian,\n\n 39 => Lithuanian,\n\n 47 => Macedonian,\n\n 62 => Malay,\n\n 76 => Malayalam,\n\n 58 => Maltese,\n\n 78 => Marathi,\n","file_path":"src/headers/mobih.rs","rank":80,"score":48020.44184131855},{"content":"pub fn decompress(huffs: &[&[u8]], sections: &[&[u8]]) -> HuffmanResult<Vec<Vec<u8>>> {\n\n let mut decoder = HuffmanDecoder::init(huffs)?;\n\n decoder.unpack_sections(sections)\n\n}\n","file_path":"src/compression/huff.rs","rank":81,"score":37012.10972283298},{"content":"#[derive(Debug)]\n\nstruct HuffmanDecoder {\n\n dictionary: HuffmanDictionary,\n\n code_dict: CodeDictionary,\n\n min_codes: MinCodesMapping,\n\n max_codes: MaxCodesMapping,\n\n}\n\n\n\nimpl Default for HuffmanDecoder {\n\n fn default() -> Self {\n\n Self {\n\n dictionary: vec![],\n\n code_dict: [(0, false, 0); 256],\n\n min_codes: [0; 33],\n\n max_codes: [u32::MAX; 33],\n\n }\n\n }\n\n}\n\n\n\nimpl HuffmanDecoder {\n\n fn load_code_dictionary<R: std::io::Read>(\n","file_path":"src/compression/huff.rs","rank":82,"score":35421.597047755306},{"content":"impl Header {\n\n /// Parse a header from the content. The reader must be advanced to the starting position of the\n\n /// header, at byte 0.\n\n pub(crate) fn parse<R: io::Read>(reader: &mut Reader<R>) -> Result<Header, HeaderParseError> {\n\n Ok(Header {\n\n name: {\n\n let bytes = reader.read_vec_header(32)?;\n\n if bytes.starts_with(b\"TPZ\") {\n\n return Err(HeaderParseError::IsTopazError);\n\n } else if bytes.starts_with(b\"\\xeaDRMION\\xee\") {\n\n return Err(HeaderParseError::IsKfxError);\n\n }\n\n bytes\n\n },\n\n attributes: reader.read_u16_be()?,\n\n version: reader.read_u16_be()?,\n\n created: reader.read_u32_be()?,\n\n modified: reader.read_u32_be()?,\n\n backup: reader.read_u32_be()?,\n\n modnum: reader.read_u32_be()?,\n","file_path":"src/headers/header.rs","rank":83,"score":30082.261942614085},{"content":"use crate::{Reader, Writer};\n\n\n\n#[cfg(feature = \"time\")]\n\nuse chrono::NaiveDateTime;\n\nuse std::io;\n\nuse thiserror::Error;\n\n\n\n#[derive(Error, Debug)]\n\npub enum HeaderParseError {\n\n #[error(\"this book is an Amazon Topaz book and it cannot be processed\")]\n\n IsTopazError,\n\n #[error(\"this book is an Amazon KFX book and it cannot be processed\")]\n\n IsKfxError,\n\n #[error(\"expected type header identifier BOOK or TEXT\")]\n\n InvalidTypeIdentifier,\n\n #[error(\"expected creator header identifier MOBI or READ\")]\n\n InvalidCreatorIdentifier,\n\n #[error(transparent)]\n\n IoError(#[from] std::io::Error),\n\n}\n","file_path":"src/headers/header.rs","rank":84,"score":30080.312146375316},{"content":" app_info_id: reader.read_u32_be()?,\n\n sort_info_id: reader.read_u32_be()?,\n\n type_: {\n\n let ty = reader.read_vec_header(4)?;\n\n if ty != b\"BOOK\" && ty != b\"TEXT\" {\n\n return Err(HeaderParseError::InvalidTypeIdentifier);\n\n }\n\n ty\n\n },\n\n creator: {\n\n let creator = reader.read_vec_header(4)?;\n\n if creator != b\"MOBI\" && creator != b\"READ\" {\n\n return Err(HeaderParseError::InvalidCreatorIdentifier);\n\n }\n\n creator\n\n },\n\n unique_id_seed: reader.read_u32_be()?,\n\n next_record_list_id: reader.read_u32_be()?,\n\n num_records: reader.read_u16_be()?,\n\n })\n","file_path":"src/headers/header.rs","rank":85,"score":30076.32561732988},{"content":" fn parse() {\n\n let header = Header {\n\n name: b\"Lord_of_the_Rings_-_Fellowship_\\0\".to_vec(),\n\n attributes: 0,\n\n version: 0,\n\n created: 1299709979,\n\n modified: 1299709979,\n\n backup: 0,\n\n modnum: 0,\n\n app_info_id: 0,\n\n sort_info_id: 0,\n\n type_: b\"BOOK\".to_vec(),\n\n creator: b\"MOBI\".to_vec(),\n\n unique_id_seed: 292,\n\n next_record_list_id: 0,\n\n num_records: 292,\n\n };\n\n\n\n let mut reader = book::u8_reader(book::HEADER.to_vec());\n\n let parsed_header = Header::parse(&mut reader);\n","file_path":"src/headers/header.rs","rank":86,"score":30074.971425692565},{"content":" /// method when `time` feature is disabled.\n\n pub(crate) fn created_datetime(&self) -> u32 {\n\n self.created\n\n }\n\n\n\n #[cfg(not(feature = \"time\"))]\n\n /// Returns a u32 timestamp of last modification. This is a fallback\n\n /// method when `time` feature is disabled.\n\n pub(crate) fn mod_datetime(&self) -> u32 {\n\n self.modified\n\n }\n\n}\n\n\n\n#[cfg(test)]\n\nmod tests {\n\n use super::*;\n\n use crate::book;\n\n use crate::writer::Writer;\n\n\n\n #[test]\n","file_path":"src/headers/header.rs","rank":87,"score":30074.304017947994},{"content":" assert_eq!(header, parsed_header.unwrap());\n\n }\n\n\n\n #[test]\n\n fn write() {\n\n let header = book::HEADER.to_vec();\n\n\n\n let mut reader = book::u8_reader(header.clone());\n\n let parsed_header = Header::parse(&mut reader).unwrap();\n\n\n\n let mut buf = vec![];\n\n\n\n parsed_header\n\n .write(&mut Writer::new(&mut buf), 292)\n\n .unwrap();\n\n assert_eq!(header.len(), buf.len());\n\n assert_eq!(header, buf);\n\n }\n\n}\n","file_path":"src/headers/header.rs","rank":88,"score":30071.683980291466},{"content":" w.write_be(self.next_record_list_id)?;\n\n w.write_be(num_records)\n\n }\n\n\n\n #[cfg(feature = \"time\")]\n\n /// Returns a chrono::NaiveDateTime timestamp of file creation\n\n /// This field is only available using `time` feature\n\n pub(crate) fn created_datetime(&self) -> NaiveDateTime {\n\n NaiveDateTime::from_timestamp(i64::from(self.created), 0)\n\n }\n\n\n\n #[cfg(feature = \"time\")]\n\n /// Returns a chrono::NaiveDateTime timestamp of file modification\n\n /// This field is only available using `time` feature\n\n pub(crate) fn mod_datetime(&self) -> NaiveDateTime {\n\n NaiveDateTime::from_timestamp(i64::from(self.modified), 0)\n\n }\n\n\n\n #[cfg(not(feature = \"time\"))]\n\n /// Returns a u32 timestamp of creation. This is a fallback\n","file_path":"src/headers/header.rs","rank":89,"score":30071.4935969524},{"content":"\n\n#[derive(Debug, PartialEq, Default)]\n\n/// Strcture that holds header information\n\npub struct Header {\n\n pub name: Vec<u8>,\n\n pub attributes: u16,\n\n pub version: u16,\n\n pub created: u32,\n\n pub modified: u32,\n\n pub backup: u32,\n\n pub modnum: u32,\n\n pub app_info_id: u32,\n\n pub sort_info_id: u32,\n\n pub type_: Vec<u8>,\n\n pub creator: Vec<u8>,\n\n pub unique_id_seed: u32,\n\n pub next_record_list_id: u32,\n\n pub num_records: u16,\n\n}\n\n\n","file_path":"src/headers/header.rs","rank":90,"score":30071.08386555564},{"content":" }\n\n\n\n pub(crate) fn write<W: io::Write>(\n\n &self,\n\n w: &mut Writer<W>,\n\n num_records: u16,\n\n ) -> io::Result<()> {\n\n w.write_be(&self.name)?;\n\n w.write_be(self.attributes)?;\n\n w.write_be(self.version)?;\n\n w.write_be(self.created)?;\n\n // User should change this themselves?\n\n w.write_be(self.modified)?;\n\n w.write_be(self.backup)?;\n\n w.write_be(self.modnum)?;\n\n w.write_be(self.app_info_id)?;\n\n w.write_be(self.sort_info_id)?;\n\n w.write_be(&self.type_)?;\n\n w.write_be(&self.creator)?;\n\n w.write_be(self.unique_id_seed)?;\n","file_path":"src/headers/header.rs","rank":91,"score":30068.817678665582},{"content":"use std::io::{self, Read};\n\n\n\n#[derive(Debug, Default, Clone)]\n\n/// Helper struct for reading header values from content.\n\n/// Only allows forward reads.\n\npub(crate) struct Reader<R> {\n\n reader: R,\n\n position: usize,\n\n}\n\n\n\nimpl<R: std::io::Read> Reader<R> {\n\n pub(crate) fn new(content: R) -> Reader<R> {\n\n Reader {\n\n reader: content,\n\n position: 0,\n\n }\n\n }\n\n\n\n pub(crate) fn read_to_end(&mut self) -> io::Result<Vec<u8>> {\n\n // Zero-fill so that Records parsing works as expected.\n","file_path":"src/reader.rs","rank":92,"score":28304.506579701185},{"content":"\n\nimpl WriteBeBytes for u32 {\n\n fn write_be_bytes<W: io::Write>(&self, writer: &mut W) -> io::Result<usize> {\n\n writer.write_all(&self.to_be_bytes())?;\n\n Ok(self.to_be_bytes().len())\n\n }\n\n}\n\n\n\nimpl WriteBeBytes for u64 {\n\n fn write_be_bytes<W: io::Write>(&self, writer: &mut W) -> io::Result<usize> {\n\n writer.write_all(&self.to_be_bytes())?;\n\n Ok(self.to_be_bytes().len())\n\n }\n\n}\n\n\n\n#[derive(Debug, Default, Clone)]\n\n/// Helper struct for reading header values from content.\n\n/// Only allows forward reads.\n\npub(crate) struct Writer<W> {\n\n writer: W,\n","file_path":"src/writer.rs","rank":93,"score":28296.27934785495},{"content":" bytes_written: usize,\n\n}\n\n\n\nimpl<W: std::io::Write> Writer<W> {\n\n pub(crate) fn new(writer: W) -> Writer<W> {\n\n Writer {\n\n writer,\n\n bytes_written: 0,\n\n }\n\n }\n\n\n\n pub(crate) fn bytes_written(&self) -> usize {\n\n self.bytes_written\n\n }\n\n\n\n #[inline]\n\n pub(crate) fn write_be<B: WriteBeBytes>(&mut self, b: B) -> io::Result<()> {\n\n self.bytes_written += b.write_be_bytes(&mut self.writer)?;\n\n Ok(())\n\n }\n\n}\n","file_path":"src/writer.rs","rank":94,"score":28294.192378389955},{"content":"use std::io;\n\n\n\npub(crate) trait WriteBeBytes {\n\n fn write_be_bytes<W: io::Write>(&self, writer: &mut W) -> io::Result<usize>;\n\n}\n\n\n\nimpl WriteBeBytes for &[u8] {\n\n fn write_be_bytes<W: io::Write>(&self, writer: &mut W) -> io::Result<usize> {\n\n writer.write_all(self)?;\n\n Ok(self.len())\n\n }\n\n}\n\n\n\nimpl WriteBeBytes for Vec<u8> {\n\n fn write_be_bytes<W: io::Write>(&self, writer: &mut W) -> io::Result<usize> {\n\n writer.write_all(self)?;\n\n Ok(self.len())\n\n }\n\n}\n\n\n","file_path":"src/writer.rs","rank":95,"score":28292.205601899586},{"content":" let mut first_buf = vec![0; self.position];\n\n // read_to_end appends to the end of the buffer.\n\n self.reader.read_to_end(&mut first_buf)?;\n\n self.position = first_buf.len();\n\n Ok(first_buf)\n\n }\n\n\n\n pub(crate) fn read_exact(&mut self, buf: &mut [u8]) -> io::Result<()> {\n\n self.reader.read_exact(buf)?;\n\n self.position += buf.len();\n\n Ok(())\n\n }\n\n\n\n #[inline]\n\n pub(crate) fn set_position(&mut self, p: usize) -> io::Result<()> {\n\n debug_assert!(p >= self.position, \"{}, {}\", p, self.position);\n\n\n\n if p >= self.position {\n\n std::io::copy(\n\n &mut self.reader.by_ref().take((p - self.position) as u64),\n","file_path":"src/reader.rs","rank":96,"score":28291.648944245862},{"content":" }\n\n\n\n #[inline]\n\n pub(crate) fn read_u16_be(&mut self) -> io::Result<u16> {\n\n let mut bytes = [0; 2];\n\n self.read_exact(&mut bytes)?;\n\n Ok(u16::from_be_bytes(bytes))\n\n }\n\n\n\n #[inline]\n\n #[allow(dead_code)]\n\n pub(crate) fn read_u8(&mut self) -> io::Result<u8> {\n\n let mut bytes = [0; 1];\n\n self.read_exact(&mut bytes)?;\n\n Ok(u8::from_be_bytes(bytes))\n\n }\n\n\n\n pub(crate) fn read_vec_header(&mut self, len: usize) -> io::Result<Vec<u8>> {\n\n let mut buf = vec![0; len];\n\n self.read_exact(&mut buf)?;\n\n Ok(buf)\n\n }\n\n}\n","file_path":"src/reader.rs","rank":97,"score":28291.429868057727},{"content":" &mut io::sink(),\n\n )?;\n\n self.position = p;\n\n }\n\n\n\n Ok(())\n\n }\n\n\n\n #[inline]\n\n pub(crate) fn read_u64_be(&mut self) -> io::Result<u64> {\n\n let mut bytes = [0; 8];\n\n self.read_exact(&mut bytes)?;\n\n Ok(u64::from_be_bytes(bytes))\n\n }\n\n\n\n #[inline]\n\n pub(crate) fn read_u32_be(&mut self) -> io::Result<u32> {\n\n let mut bytes = [0; 4];\n\n self.read_exact(&mut bytes)?;\n\n Ok(u32::from_be_bytes(bytes))\n","file_path":"src/reader.rs","rank":98,"score":28289.528571467145},{"content":"impl WriteBeBytes for &Vec<u8> {\n\n fn write_be_bytes<W: io::Write>(&self, writer: &mut W) -> io::Result<usize> {\n\n writer.write_all(self)?;\n\n Ok(self.len())\n\n }\n\n}\n\n\n\nimpl WriteBeBytes for u8 {\n\n fn write_be_bytes<W: io::Write>(&self, writer: &mut W) -> io::Result<usize> {\n\n writer.write_all(&self.to_be_bytes())?;\n\n Ok(self.to_be_bytes().len())\n\n }\n\n}\n\n\n\nimpl WriteBeBytes for u16 {\n\n fn write_be_bytes<W: io::Write>(&self, writer: &mut W) -> io::Result<usize> {\n\n writer.write_all(&self.to_be_bytes())?;\n\n Ok(self.to_be_bytes().len())\n\n }\n\n}\n","file_path":"src/writer.rs","rank":99,"score":28289.096689868835}],"string":"[\n {\n \"content\": \"pub fn decompress(data: &[u8]) -> Vec<u8> {\\n\\n let length = data.len();\\n\\n let mut pos: usize = 0;\\n\\n let mut text_pos: usize = 0;\\n\\n let mut text: Vec<u8> = vec![];\\n\\n\\n\\n let mut prev = None;\\n\\n while pos < length {\\n\\n let byte = data[pos];\\n\\n pos += 1;\\n\\n\\n\\n match byte {\\n\\n new if prev.is_some() => {\\n\\n let old = prev.take().unwrap();\\n\\n\\n\\n // Combine with previous byte to get a distance-length pair.\\n\\n let mut dist_len_bytes = u16::from_be_bytes([old, new]);\\n\\n\\n\\n dist_len_bytes &= 0x3fff; // Leftmost two bits are ID bits and need to be dropped\\n\\n let offset = (dist_len_bytes >> 3) as usize; // Remaining 11 bits are offset\\n\",\n \"file_path\": \"src/compression/palmdoc.rs\",\n \"rank\": 0,\n \"score\": 66256.6608076857\n },\n {\n \"content\": \" u16::from(*self).write_be_bytes(writer)\\n\\n }\\n\\n}\\n\\n\\n\\n#[derive(Debug, PartialEq, Default)]\\n\\n/// Strcture that holds PalmDOC header information\\n\\npub struct PalmDocHeader {\\n\\n pub compression: Compression,\\n\\n pub text_length: u32,\\n\\n unused0: u16,\\n\\n pub record_count: u16,\\n\\n pub record_size: u16,\\n\\n pub encryption: Encryption,\\n\\n unused1: u16,\\n\\n}\\n\\n\\n\\nimpl PalmDocHeader {\\n\\n /// Parse a PalmDOC header from a reader. Reader must be advanced to the starting position\\n\\n /// of the PalmDocHeader, at byte 80 + 8 * num_records.\\n\\n pub(crate) fn parse<R: io::Read>(reader: &mut Reader<R>) -> io::Result<PalmDocHeader> {\\n\",\n \"file_path\": \"src/headers/palmdoch.rs\",\n \"rank\": 1,\n \"score\": 49088.846833333104\n },\n {\n \"content\": \" record_count: 282,\\n\\n record_size: 4096,\\n\\n encryption: Encryption::No,\\n\\n ..Default::default()\\n\\n };\\n\\n\\n\\n let mut reader = book::u8_reader(book::PALMDOCHEADER.to_vec());\\n\\n\\n\\n assert_eq!(pdheader, PalmDocHeader::parse(&mut reader).unwrap());\\n\\n }\\n\\n\\n\\n #[test]\\n\\n fn test_write() {\\n\\n let input_bytes = book::PALMDOCHEADER.to_vec();\\n\\n\\n\\n let palmdoc = PalmDocHeader::parse(&mut book::u8_reader(input_bytes.clone())).unwrap();\\n\\n\\n\\n let mut output_bytes = vec![];\\n\\n assert!(palmdoc.write(&mut Writer::new(&mut output_bytes)).is_ok());\\n\\n assert_eq!(input_bytes, output_bytes);\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/headers/palmdoch.rs\",\n \"rank\": 2,\n \"score\": 49086.08165592752\n },\n {\n \"content\": \" u16::from(*self).write_be_bytes(writer)\\n\\n }\\n\\n}\\n\\n\\n\\n#[derive(Debug, Copy, Clone, PartialEq)]\\n\\n/// Encryption types available in MOBI format.\\n\\npub enum Encryption {\\n\\n No,\\n\\n OldMobiPocket,\\n\\n MobiPocket,\\n\\n}\\n\\n\\n\\nimpl Default for Encryption {\\n\\n fn default() -> Self {\\n\\n Encryption::No\\n\\n }\\n\\n}\\n\\n\\n\\nimpl From<u16> for Encryption {\\n\\n fn from(n: u16) -> Encryption {\\n\",\n \"file_path\": \"src/headers/palmdoch.rs\",\n \"rank\": 3,\n \"score\": 49083.487368527865\n },\n {\n \"content\": \" Ok(PalmDocHeader {\\n\\n compression: reader.read_u16_be()?.into(),\\n\\n unused0: reader.read_u16_be()?,\\n\\n text_length: reader.read_u32_be()?,\\n\\n record_count: reader.read_u16_be()?,\\n\\n record_size: reader.read_u16_be()?,\\n\\n encryption: reader.read_u16_be()?.into(),\\n\\n unused1: reader.read_u16_be()?,\\n\\n })\\n\\n }\\n\\n\\n\\n pub(crate) fn write<W: io::Write>(&self, w: &mut Writer<W>) -> io::Result<()> {\\n\\n w.write_be(self.compression)?;\\n\\n w.write_be(self.unused0)?;\\n\\n w.write_be(self.text_length)?;\\n\\n w.write_be(self.record_count)?;\\n\\n w.write_be(self.record_size)?;\\n\\n w.write_be(self.encryption)?;\\n\\n w.write_be(self.unused1)\\n\\n }\\n\",\n \"file_path\": \"src/headers/palmdoch.rs\",\n \"rank\": 4,\n \"score\": 49083.360631183394\n },\n {\n \"content\": \"use crate::writer::WriteBeBytes;\\n\\nuse crate::{Reader, Writer};\\n\\n\\n\\nuse std::io;\\n\\n\\n\\n#[derive(Debug, Copy, Clone, PartialEq)]\\n\\n/// Compression types available in MOBI format.\\n\\npub enum Compression {\\n\\n No,\\n\\n PalmDoc,\\n\\n Huff,\\n\\n}\\n\\n\\n\\nimpl Default for Compression {\\n\\n fn default() -> Compression {\\n\\n Compression::No\\n\\n }\\n\\n}\\n\\n\\n\\nimpl From<u16> for Compression {\\n\",\n \"file_path\": \"src/headers/palmdoch.rs\",\n \"rank\": 5,\n \"score\": 49081.66054564129\n },\n {\n \"content\": \" match n {\\n\\n 2 => Encryption::MobiPocket,\\n\\n 1 => Encryption::OldMobiPocket,\\n\\n _ => Encryption::No,\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\nimpl From<Encryption> for u16 {\\n\\n fn from(encryption: Encryption) -> u16 {\\n\\n match encryption {\\n\\n Encryption::No => 0,\\n\\n Encryption::MobiPocket => 1,\\n\\n Encryption::OldMobiPocket => 2,\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\nimpl WriteBeBytes for Encryption {\\n\\n fn write_be_bytes<W: io::Write>(&self, writer: &mut W) -> io::Result<usize> {\\n\",\n \"file_path\": \"src/headers/palmdoch.rs\",\n \"rank\": 6,\n \"score\": 49078.42297112809\n },\n {\n \"content\": \"\\n\\n pub fn compression(&self) -> Compression {\\n\\n self.compression\\n\\n }\\n\\n\\n\\n pub fn encryption(&self) -> Encryption {\\n\\n self.encryption\\n\\n }\\n\\n}\\n\\n\\n\\n#[cfg(test)]\\n\\nmod tests {\\n\\n use super::*;\\n\\n use crate::book;\\n\\n\\n\\n #[test]\\n\\n fn parse() {\\n\\n let pdheader = PalmDocHeader {\\n\\n compression: Compression::PalmDoc,\\n\\n text_length: 1151461,\\n\",\n \"file_path\": \"src/headers/palmdoch.rs\",\n \"rank\": 7,\n \"score\": 49078.02128563255\n },\n {\n \"content\": \" fn from(n: u16) -> Compression {\\n\\n match n {\\n\\n 2 => Compression::PalmDoc,\\n\\n 17480 => Compression::Huff,\\n\\n _ => Compression::No,\\n\\n }\\n\\n }\\n\\n}\\n\\nimpl From<Compression> for u16 {\\n\\n fn from(compression: Compression) -> u16 {\\n\\n match compression {\\n\\n Compression::No => 1,\\n\\n Compression::PalmDoc => 2,\\n\\n Compression::Huff => 17480,\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\nimpl WriteBeBytes for Compression {\\n\\n fn write_be_bytes<W: io::Write>(&self, writer: &mut W) -> io::Result<usize> {\\n\",\n \"file_path\": \"src/headers/palmdoch.rs\",\n \"rank\": 8,\n \"score\": 49070.52388523071\n },\n {\n \"content\": \"}\\n\\n\\n\\nimpl ExtHeader {\\n\\n /// Parse a EXTH header from the content. Reader must be at starting\\n\\n /// location of exth header.\\n\\n pub(crate) fn parse<R: io::Read>(reader: &mut Reader<R>) -> io::Result<ExtHeader> {\\n\\n let mut extheader = ExtHeader {\\n\\n identifier: reader.read_u32_be()?,\\n\\n header_length: reader.read_u32_be()?,\\n\\n record_count: reader.read_u32_be()?,\\n\\n records: IndexMap::new(),\\n\\n };\\n\\n\\n\\n if &extheader.identifier.to_be_bytes() == b\\\"EXTH\\\" {\\n\\n extheader.populate_records(reader)?;\\n\\n Ok(extheader)\\n\\n } else {\\n\\n Err(io::Error::new(\\n\\n io::ErrorKind::InvalidData,\\n\\n \\\"invalid header identifier (expected EXTH)\\\",\\n\",\n \"file_path\": \"src/headers/exth.rs\",\n \"rank\": 22,\n \"score\": 48666.838672619226\n },\n {\n \"content\": \" let parsed_header = ExtHeader::parse(&mut reader).unwrap();\\n\\n let mut records: Vec<_> = parsed_header.records().collect();\\n\\n\\n\\n _records.sort();\\n\\n records.sort();\\n\\n for (a, b) in records.into_iter().zip(_records) {\\n\\n assert_eq!(*a.0, b.0);\\n\\n assert_eq!(a.1, b.1);\\n\\n }\\n\\n }\\n\\n\\n\\n mod records {\\n\\n use crate::book;\\n\\n use crate::headers::{ExtHeader, ExthRecord};\\n\\n use pretty_assertions::assert_eq;\\n\\n\\n\\n macro_rules! info {\\n\\n ($t: ident, $s: expr) => {\\n\\n let mut reader = book::u8_reader(book::BOOK.to_vec());\\n\\n let exth = ExtHeader::parse(&mut reader).unwrap();\\n\",\n \"file_path\": \"src/headers/exth.rs\",\n \"rank\": 23,\n \"score\": 48657.46496018674\n },\n {\n \"content\": \" ))\\n\\n }\\n\\n }\\n\\n\\n\\n /// Gets header records\\n\\n fn populate_records<R: io::Read>(&mut self, reader: &mut Reader<R>) -> io::Result<()> {\\n\\n for _i in 0..self.record_count {\\n\\n let record_type = ExthRecord::from(reader.read_u32_be()?);\\n\\n let record_len = reader.read_u32_be()?;\\n\\n\\n\\n let mut record_data = vec![0; (record_len - 8) as usize];\\n\\n reader.read_exact(&mut record_data)?;\\n\\n\\n\\n if let Some(record) = self.records.get_mut(&record_type) {\\n\\n record.push(record_data);\\n\\n } else {\\n\\n self.records.insert(record_type, vec![record_data]);\\n\\n }\\n\\n }\\n\\n\\n\",\n \"file_path\": \"src/headers/exth.rs\",\n \"rank\": 24,\n \"score\": 48657.139199664634\n },\n {\n \"content\": \" 405 => IsRented,\\n\\n 406 => BorrowExpirationDate,\\n\\n 501 => Cdetype,\\n\\n 502 => LastUpdateTime,\\n\\n 503 => Title,\\n\\n 524 => Language,\\n\\n n => Other(n),\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\n#[derive(Debug, Default, PartialEq)]\\n\\n/// Optional header containing extended information. If the MOBI header\\n\\n/// indicates that there's an EXTH header, it follows immediately after\\n\\n/// the MOBI header.\\n\\npub struct ExtHeader {\\n\\n pub identifier: u32,\\n\\n pub header_length: u32,\\n\\n pub record_count: u32,\\n\\n pub records: IndexMap<ExthRecord, Vec<Vec<u8>>>,\\n\",\n \"file_path\": \"src/headers/exth.rs\",\n \"rank\": 25,\n \"score\": 48655.92209842272\n },\n {\n \"content\": \"use crate::{Reader, Writer};\\n\\n\\n\\nuse indexmap::IndexMap;\\n\\nuse std::io;\\n\\n\\n\\n#[derive(Debug, Clone, Copy, PartialEq, Eq, Hash, PartialOrd, Ord)]\\n\\n// Records available in EXTH header\\n\\npub enum ExthRecord {\\n\\n // source - https://wiki.mobileread.com/wiki/MOBI#EXTH_Header\\n\\n DrmServerId,\\n\\n DrmCommerceId,\\n\\n DrmEbookbaseBookId,\\n\\n Author,\\n\\n Publisher,\\n\\n Imprint,\\n\\n Description,\\n\\n Isbn,\\n\\n Subject,\\n\\n PublishDate,\\n\\n Review,\\n\",\n \"file_path\": \"src/headers/exth.rs\",\n \"rank\": 26,\n \"score\": 48654.98741928723\n },\n {\n \"content\": \" (202.into(), vec![b\\\"\\\\0\\\\0\\\\0\\\\x01\\\".to_vec()]),\\n\\n (108.into(), vec![b\\\"calibre (0.7.31) [http://calibre-ebook.com]\\\".to_vec()]),\\n\\n ];\\n\\n _records.into_iter().for_each(|(k, v)| {\\n\\n records.insert(k, v);\\n\\n });\\n\\n\\n\\n let extheader = ExtHeader {\\n\\n identifier: 1163416648,\\n\\n header_length: 1109,\\n\\n record_count: 11,\\n\\n records,\\n\\n };\\n\\n\\n\\n let mut reader = book::u8_reader(book::BOOK.to_vec());\\n\\n let parsed_header = ExtHeader::parse(&mut reader).unwrap();\\n\\n for (k, v) in &extheader.records {\\n\\n let record = parsed_header.get_record(*k);\\n\\n assert!(record.is_some());\\n\\n assert_eq!(v, record.unwrap());\\n\",\n \"file_path\": \"src/headers/exth.rs\",\n \"rank\": 27,\n \"score\": 48652.41169158151\n },\n {\n \"content\": \" TamperProofKeys => 209,\\n\\n FontSignature => 300,\\n\\n ClippingLimit => 401,\\n\\n PublisherLimit => 402,\\n\\n TtsFlag => 404,\\n\\n IsRented => 405,\\n\\n BorrowExpirationDate => 406,\\n\\n Cdetype => 501,\\n\\n LastUpdateTime => 502,\\n\\n Title => 503,\\n\\n Language => 524,\\n\\n Other(n) => n,\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\nimpl From<u32> for ExthRecord {\\n\\n fn from(ty: u32) -> Self {\\n\\n use ExthRecord::*;\\n\\n match ty {\\n\",\n \"file_path\": \"src/headers/exth.rs\",\n \"rank\": 28,\n \"score\": 48651.99255958876\n },\n {\n \"content\": \" }\\n\\n Ok(())\\n\\n }\\n\\n\\n\\n /// Returns exth record data located at position. This is a low level function intended\\n\\n /// to use with wrapper get_record, but exposed for convienience.\\n\\n pub fn get_record_position(&self, position: u32) -> Option<&Vec<Vec<u8>>> {\\n\\n self.get_record(ExthRecord::from(position))\\n\\n }\\n\\n\\n\\n /// Returns exth record data. This function limits possible queried records to only those\\n\\n /// commonly available among mobi ebooks.\\n\\n pub fn get_record(&self, record: ExthRecord) -> Option<&Vec<Vec<u8>>> {\\n\\n self.records.get(&record)\\n\\n }\\n\\n\\n\\n /// Returns an iterator over all available raw EXTH records.\\n\\n pub fn raw_records(&self) -> impl Iterator<Item = (&ExthRecord, &Vec<Vec<u8>>)> {\\n\\n self.records.iter()\\n\\n }\\n\",\n \"file_path\": \"src/headers/exth.rs\",\n \"rank\": 29,\n \"score\": 48651.11404649738\n },\n {\n \"content\": \"\\n\\nimpl From<ExthRecord> for u32 {\\n\\n fn from(r: ExthRecord) -> Self {\\n\\n use ExthRecord::*;\\n\\n match r {\\n\\n DrmServerId => 1,\\n\\n DrmCommerceId => 2,\\n\\n DrmEbookbaseBookId => 3,\\n\\n Author => 100,\\n\\n Publisher => 101,\\n\\n Imprint => 102,\\n\\n Description => 103,\\n\\n Isbn => 104,\\n\\n Subject => 105,\\n\\n PublishDate => 106,\\n\\n Review => 107,\\n\\n Contributor => 108,\\n\\n Rights => 109,\\n\\n Subjectcode => 110,\\n\\n Type => 111,\\n\",\n \"file_path\": \"src/headers/exth.rs\",\n \"rank\": 30,\n \"score\": 48650.193632566006\n },\n {\n \"content\": \" }\\n\\n assert_eq!(extheader, parsed_header);\\n\\n }\\n\\n\\n\\n #[test]\\n\\n fn test_exth_records() {\\n\\n let mut _records: Vec<(ExthRecord, Vec<String>)> = vec![\\n\\n (ExthRecord::Isbn, vec![\\\"9780261102316\\\".to_string()]),\\n\\n (ExthRecord::Title, vec![\\\"Lord of the Rings - Fellowship of the Ring\\\".to_string()]),\\n\\n (ExthRecord::HasFakeCover, vec![\\\"\\\\0\\\\0\\\\0\\\\0\\\".to_string()]),\\n\\n (ExthRecord::Description, vec![\\\"<h3>From Library Journal</h3><p>New Line Cinema will be releasing \\\\\\\"The Lord of the Rings\\\\\\\" trilogy in three separate installments, and Houghton Mifflin Tolkien's U.S. publisher since the release of The Hobbit in 1938 will be re-releasing each volume of the trilogy separately and in a boxed set (ISBN 0-618-15397-7. $22; pap. ISBN 0-618-15396-9. $12). <br />Copyright 2001 Reed Business Information, Inc. </p><h3>Review</h3><p>'An extraordinary book. It deals with a stupendous theme. It leads us through a succession of strange and astonishing episodes, some of them magnificent, in a region where everything is invented, forest, moor, river, wilderness, town and the races which inhabit them.' The Observer 'Among the greatest works of imaginative fiction of the twentieth century.' Sunday Telegraph </p>\\\".to_string()]),\\n\\n (ExthRecord::CoverOffset, vec![\\\"\\\\0\\\\0\\\\0\\\\0\\\".to_string()]),\\n\\n (ExthRecord::Publisher, vec![\\\"HarperCollins Publishers Ltd\\\".to_string()]),\\n\\n (ExthRecord::PublishDate, vec![\\\"2010-12-21T00:00:00+00:00\\\".to_string(),\\\"2010-12-21T00:00:00+00:00\\\".to_string()]),\\n\\n (ExthRecord::Author, vec![\\\"J. R. R. Tolkien\\\".to_string()]),\\n\\n (ExthRecord::ThumbOffset, vec![\\\"\\\\0\\\\0\\\\0\\\\x01\\\".to_string()]),\\n\\n (ExthRecord::Contributor, vec![\\\"calibre (0.7.31) [http://calibre-ebook.com]\\\".to_string()]),\\n\\n ];\\n\\n\\n\\n let mut reader = book::u8_reader(book::BOOK.to_vec());\\n\",\n \"file_path\": \"src/headers/exth.rs\",\n \"rank\": 31,\n \"score\": 48649.724952016084\n },\n {\n \"content\": \"\\n\\n /// Returns an iterator over all available EXTH records and performs a loseless conversion of\\n\\n /// record data to string.\\n\\n pub fn records(&self) -> impl Iterator<Item = (&ExthRecord, Vec<String>)> {\\n\\n self.records.iter().map(|(r, data)| {\\n\\n (\\n\\n r,\\n\\n data.iter()\\n\\n .map(|d| String::from_utf8_lossy(d).to_string())\\n\\n .collect(),\\n\\n )\\n\\n })\\n\\n }\\n\\n\\n\\n pub(crate) fn get_record_string_lossy(&self, record: ExthRecord) -> Option<String> {\\n\\n self.get_record(record)\\n\\n .and_then(|r| r.first())\\n\\n .map(|r| String::from_utf8_lossy(r).to_string())\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/headers/exth.rs\",\n \"rank\": 32,\n \"score\": 48647.88120783786\n },\n {\n \"content\": \"\\n\\n // This fields are unsure\\n\\n /// 1 in this field seems to indicate a rental book\\n\\n IsRented,\\n\\n /// If this field is removed from a rental, the book says it expired in 1969\\n\\n BorrowExpirationDate,\\n\\n //\\n\\n ///PDOC - Personal Doc; EBOK - ebook; EBSP - ebook sample;\\n\\n Cdetype,\\n\\n LastUpdateTime,\\n\\n Title,\\n\\n Language,\\n\\n Other(u32),\\n\\n}\\n\\n\\n\\nimpl ExthRecord {\\n\\n pub fn position(&self) -> u32 {\\n\\n (*self).into()\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/headers/exth.rs\",\n \"rank\": 33,\n \"score\": 48647.268130296026\n },\n {\n \"content\": \" Ok(())\\n\\n }\\n\\n\\n\\n pub(crate) fn write<W: io::Write>(&self, w: &mut Writer<W>) -> io::Result<()> {\\n\\n w.write_be(self.identifier)?;\\n\\n w.write_be(\\n\\n 12u32\\n\\n + self\\n\\n .records\\n\\n .iter()\\n\\n .map(|(_, d)| 8 + d.len() as u32)\\n\\n .sum::<u32>(),\\n\\n )?;\\n\\n w.write_be(self.records.len() as u32)?;\\n\\n for (&id, records) in self.records.iter() {\\n\\n for record_data in records {\\n\\n w.write_be(id.position())?;\\n\\n w.write_be(record_data.len() as u32 + 8)?;\\n\\n w.write_be(record_data)?;\\n\\n }\\n\",\n \"file_path\": \"src/headers/exth.rs\",\n \"rank\": 34,\n \"score\": 48646.09254012007\n },\n {\n \"content\": \" DictionaryShortName,\\n\\n /// Add to first image field in Mobi Header to find PDB record containing the cover image\\n\\n CoverOffset,\\n\\n /// Add to first image field in Mobi Header to find PDB record containing the thumbnail cover image\\n\\n ThumbOffset,\\n\\n HasFakeCover,\\n\\n /// Known Values: 1=mobigen, 2=Mobipocket Creator, 200=kindlegen (Windows), 201=kindlegen (Linux), 202=kindlegen (Mac). Warning: Calibre creates fake creator entries, pretending to be a Linux kindlegen 1.2 (201, 1, 2, 33307) for normal ebooks and a non-public Linux kindlegen 2.0 (201, 2, 0, 101) for periodicals.\\n\\n CreatorSoftware,\\n\\n CreatoreMajorVersion,\\n\\n CreatorMinorVersion,\\n\\n CreatorBuildNumber,\\n\\n Watermark,\\n\\n /// Used by the Kindle (and Android app) for generating book-specific PIDs.\\n\\n TamperProofKeys,\\n\\n FontSignature,\\n\\n /// Integer percentage of the text allowed to be clipped. Usually 10.\\n\\n ClippingLimit,\\n\\n PublisherLimit,\\n\\n /// 1 - Text to Speech disabled; 0 - Text to Speech enabled\\n\\n TtsFlag,\\n\",\n \"file_path\": \"src/headers/exth.rs\",\n \"rank\": 35,\n \"score\": 48645.00007682923\n },\n {\n \"content\": \"\\n\\n#[cfg(test)]\\n\\nmod tests {\\n\\n use super::*;\\n\\n use crate::book;\\n\\n use pretty_assertions::assert_eq;\\n\\n\\n\\n #[test]\\n\\n fn test_parse() {\\n\\n let mut records = IndexMap::new();\\n\\n #[rustfmt::skip]\\n\\n let _records = vec![\\n\\n (104.into(), vec![b\\\"9780261102316\\\".to_vec()]),\\n\\n (503.into(), vec![b\\\"Lord of the Rings - Fellowship of the Ring\\\".to_vec()]),\\n\\n (203.into(), vec![b\\\"\\\\0\\\\0\\\\0\\\\0\\\".to_vec()]),\\n\\n (103.into(), vec![b\\\"<h3>From Library Journal</h3><p>New Line Cinema will be releasing \\\\\\\"The Lord of the Rings\\\\\\\" trilogy in three separate installments, and Houghton Mifflin Tolkien's U.S. publisher since the release of The Hobbit in 1938 will be re-releasing each volume of the trilogy separately and in a boxed set (ISBN 0-618-15397-7. $22; pap. ISBN 0-618-15396-9. $12). <br />Copyright 2001 Reed Business Information, Inc. </p><h3>Review</h3><p>'An extraordinary book. It deals with a stupendous theme. It leads us through a succession of strange and astonishing episodes, some of them magnificent, in a region where everything is invented, forest, moor, river, wilderness, town and the races which inhabit them.' The Observer 'Among the greatest works of imaginative fiction of the twentieth century.' Sunday Telegraph </p>\\\".to_vec()]),\\n\\n (201.into(), vec![b\\\"\\\\0\\\\0\\\\0\\\\0\\\".to_vec()]),\\n\\n (101.into(), vec![b\\\"HarperCollins Publishers Ltd\\\".to_vec()]),\\n\\n (106.into(), vec![b\\\"2010-12-21T00:00:00+00:00\\\".to_vec(),b\\\"2010-12-21T00:00:00+00:00\\\".to_vec()]),\\n\\n (100.into(), vec![b\\\"J. R. R. Tolkien\\\".to_vec()]),\\n\",\n \"file_path\": \"src/headers/exth.rs\",\n \"rank\": 36,\n \"score\": 48644.47771713341\n },\n {\n \"content\": \" let data = exth.get_record_string_lossy(ExthRecord::$t);\\n\\n assert_eq!(data, Some(String::from($s)));\\n\\n };\\n\\n }\\n\\n\\n\\n #[test]\\n\\n fn author() {\\n\\n info!(Author, \\\"J. R. R. Tolkien\\\");\\n\\n }\\n\\n\\n\\n #[test]\\n\\n fn publisher() {\\n\\n info!(Publisher, \\\"HarperCollins Publishers Ltd\\\");\\n\\n }\\n\\n\\n\\n #[test]\\n\\n fn description() {\\n\\n info!(Description, \\\"<h3>From Library Journal</h3><p>New Line Cinema will be releasing \\\\\\\"The Lord of the Rings\\\\\\\" trilogy in three separate installments, and Houghton Mifflin Tolkien\\\\'s U.S. publisher since the release of The Hobbit in 1938 will be re-releasing each volume of the trilogy separately and in a boxed set (ISBN 0-618-15397-7. $22; pap. ISBN 0-618-15396-9. $12). <br />Copyright 2001 Reed Business Information, Inc. </p><h3>Review</h3><p>\\\\'An extraordinary book. It deals with a stupendous theme. It leads us through a succession of strange and astonishing episodes, some of them magnificent, in a region where everything is invented, forest, moor, river, wilderness, town and the races which inhabit them.\\\\' The Observer \\\\'Among the greatest works of imaginative fiction of the twentieth century.\\\\' Sunday Telegraph </p>\\\");\\n\\n }\\n\\n\\n\",\n \"file_path\": \"src/headers/exth.rs\",\n \"rank\": 37,\n \"score\": 48642.40485998816\n },\n {\n \"content\": \" Source => 112,\\n\\n Asin => 113,\\n\\n VersionNumber => 114,\\n\\n Sample => 115,\\n\\n Startreading => 116,\\n\\n Adult => 117,\\n\\n RetailPrice => 118,\\n\\n RetailPriceCurrency => 119,\\n\\n KF8BoundaryOffset => 121,\\n\\n CountOfResources => 125,\\n\\n KF8CoverURI => 129,\\n\\n DictionaryShortName => 200,\\n\\n CoverOffset => 201,\\n\\n ThumbOffset => 202,\\n\\n HasFakeCover => 203,\\n\\n CreatorSoftware => 204,\\n\\n CreatoreMajorVersion => 205,\\n\\n CreatorMinorVersion => 206,\\n\\n CreatorBuildNumber => 207,\\n\\n Watermark => 208,\\n\",\n \"file_path\": \"src/headers/exth.rs\",\n \"rank\": 38,\n \"score\": 48638.59226938024\n },\n {\n \"content\": \" 117 => Adult,\\n\\n 118 => RetailPrice,\\n\\n 119 => RetailPriceCurrency,\\n\\n 121 => KF8BoundaryOffset,\\n\\n 125 => CountOfResources,\\n\\n 129 => KF8CoverURI,\\n\\n 200 => DictionaryShortName,\\n\\n 201 => CoverOffset,\\n\\n 202 => ThumbOffset,\\n\\n 203 => HasFakeCover,\\n\\n 204 => CreatorSoftware,\\n\\n 205 => CreatoreMajorVersion,\\n\\n 206 => CreatorMinorVersion,\\n\\n 207 => CreatorBuildNumber,\\n\\n 208 => Watermark,\\n\\n 209 => TamperProofKeys,\\n\\n 300 => FontSignature,\\n\\n 401 => ClippingLimit,\\n\\n 402 => PublisherLimit,\\n\\n 404 => TtsFlag,\\n\",\n \"file_path\": \"src/headers/exth.rs\",\n \"rank\": 39,\n \"score\": 48638.4867990493\n },\n {\n \"content\": \" Contributor,\\n\\n Rights,\\n\\n Subjectcode,\\n\\n Type,\\n\\n Source,\\n\\n Asin,\\n\\n VersionNumber,\\n\\n /// 0x0001 if the book content is only a sample of the full book\\n\\n Sample,\\n\\n /// Position (4-byte offset) in file at which to open when first opened\\n\\n Startreading,\\n\\n /// Mobipocket Creator adds this if Adult only is checked on its GUI; contents: \\\"yes\\\"\\n\\n Adult,\\n\\n /// As text, e.g. \\\"4.99\\\"\\n\\n RetailPrice,\\n\\n /// As text, e.g. \\\"USD\\\"\\n\\n RetailPriceCurrency,\\n\\n KF8BoundaryOffset,\\n\\n CountOfResources,\\n\\n KF8CoverURI,\\n\",\n \"file_path\": \"src/headers/exth.rs\",\n \"rank\": 40,\n \"score\": 48636.34828913833\n },\n {\n \"content\": \" #[test]\\n\\n fn isbn() {\\n\\n info!(Isbn, \\\"9780261102316\\\");\\n\\n }\\n\\n\\n\\n #[test]\\n\\n fn publish_date() {\\n\\n info!(PublishDate, \\\"2010-12-21T00:00:00+00:00\\\");\\n\\n }\\n\\n\\n\\n #[test]\\n\\n fn contributor() {\\n\\n info!(Contributor, \\\"calibre (0.7.31) [http://calibre-ebook.com]\\\");\\n\\n }\\n\\n\\n\\n #[test]\\n\\n fn title() {\\n\\n info!(Title, \\\"Lord of the Rings - Fellowship of the Ring\\\");\\n\\n }\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/headers/exth.rs\",\n \"rank\": 41,\n \"score\": 48636.34828913833\n },\n {\n \"content\": \" 1 => DrmServerId,\\n\\n 2 => DrmCommerceId,\\n\\n 3 => DrmEbookbaseBookId,\\n\\n 100 => Author,\\n\\n 101 => Publisher,\\n\\n 102 => Imprint,\\n\\n 103 => Description,\\n\\n 104 => Isbn,\\n\\n 105 => Subject,\\n\\n 106 => PublishDate,\\n\\n 107 => Review,\\n\\n 108 => Contributor,\\n\\n 109 => Rights,\\n\\n 110 => Subjectcode,\\n\\n 111 => Type,\\n\\n 112 => Source,\\n\\n 113 => Asin,\\n\\n 114 => VersionNumber,\\n\\n 115 => Sample,\\n\\n 116 => Startreading,\\n\",\n \"file_path\": \"src/headers/exth.rs\",\n \"rank\": 42,\n \"score\": 48636.34828913833\n },\n {\n \"content\": \" first_index_record: 0xFFFF_FFFF,\\n\\n unused_9: vec![],\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\nimpl MobiHeader {\\n\\n /// Parse a Mobi header from the content. The reader must be advanced to the starting\\n\\n /// position of the Mobi header.\\n\\n pub(crate) fn parse<R: io::Read>(reader: &mut Reader<R>) -> io::Result<MobiHeader> {\\n\\n let identifier = reader.read_u32_be()?;\\n\\n if &identifier.to_be_bytes() != b\\\"MOBI\\\" {\\n\\n return Err(io::Error::new(\\n\\n io::ErrorKind::InvalidData,\\n\\n \\\"invalid header identifier (expected MOBI)\\\",\\n\\n ));\\n\\n }\\n\\n let header_length = reader.read_u32_be()?;\\n\\n\\n\\n Ok(MobiHeader {\\n\",\n \"file_path\": \"src/headers/mobih.rs\",\n \"rank\": 43,\n \"score\": 48046.45534447323\n },\n {\n \"content\": \"}\\n\\n\\n\\nimpl Default for Language {\\n\\n fn default() -> Self {\\n\\n Language::Neutral\\n\\n }\\n\\n}\\n\\n\\n\\nimpl WriteBeBytes for Language {\\n\\n fn write_be_bytes<W: io::Write>(&self, writer: &mut W) -> io::Result<usize> {\\n\\n u8::from(*self).write_be_bytes(writer)\\n\\n }\\n\\n}\\n\\n\\n\\n#[cfg(test)]\\n\\nmod tests {\\n\\n use super::{Language, MobiHeader, MobiType, TextEncoding};\\n\\n use crate::book;\\n\\n use crate::writer::Writer;\\n\\n\\n\",\n \"file_path\": \"src/headers/mobih.rs\",\n \"rank\": 44,\n \"score\": 48043.46264850513\n },\n {\n \"content\": \" extra_record_data_flags: reader.read_u32_be()?,\\n\\n first_index_record: reader.read_u32_be()?,\\n\\n unused_9: {\\n\\n let mut unused = vec![0; header_length as usize - 232];\\n\\n reader.read_exact(&mut unused)?;\\n\\n unused\\n\\n },\\n\\n })\\n\\n }\\n\\n\\n\\n /// Parse a Mobi header from the content. The reader must be advanced to the starting\\n\\n /// position of the Mobi header.\\n\\n pub(crate) fn write<W: io::Write>(&self, w: &mut Writer<W>) -> io::Result<()> {\\n\\n w.write_be(self.identifier)?;\\n\\n w.write_be(self.header_length)?;\\n\\n w.write_be(self.mobi_type)?;\\n\\n w.write_be(self.text_encoding)?;\\n\\n w.write_be(self.id)?;\\n\\n w.write_be(self.gen_version)?;\\n\\n w.write_be(self.ortho_index)?;\\n\",\n \"file_path\": \"src/headers/mobih.rs\",\n \"rank\": 45,\n \"score\": 48041.34131027723\n },\n {\n \"content\": \" unused_5: u32, // flis record count?\\n\\n unused_6: u64,\\n\\n unused_7: u32,\\n\\n first_compilation_data_section_count: u32,\\n\\n data_section_count: u32,\\n\\n unused_8: u32,\\n\\n extra_record_data_flags: u32,\\n\\n pub first_index_record: u32,\\n\\n unused_9: Vec<u8>,\\n\\n}\\n\\n\\n\\nimpl Default for MobiHeader {\\n\\n fn default() -> Self {\\n\\n MobiHeader {\\n\\n identifier: 0,\\n\\n header_length: 0,\\n\\n mobi_type: MobiType::default(),\\n\\n text_encoding: TextEncoding::default(),\\n\\n id: 0,\\n\\n gen_version: 0,\\n\",\n \"file_path\": \"src/headers/mobih.rs\",\n \"rank\": 46,\n \"score\": 48037.04151479006\n },\n {\n \"content\": \" unused_3: 1,\\n\\n unused_4: 1,\\n\\n unused_5: 1,\\n\\n unused_6: 0,\\n\\n unused_7: 0xFFFF_FFFF,\\n\\n first_compilation_data_section_count: 0,\\n\\n data_section_count: 0xFFFF_FFFF,\\n\\n unused_8: 0xFFFF_FFFF,\\n\\n extra_record_data_flags: 7,\\n\\n first_index_record: 284,\\n\\n unused_9: vec![],\\n\\n };\\n\\n\\n\\n let mut reader = book::u8_reader(book::MOBIHEADER.to_vec());\\n\\n let test_header = MobiHeader::parse(&mut reader).unwrap();\\n\\n\\n\\n assert_eq!(mobiheader, test_header);\\n\\n }\\n\\n\\n\\n #[test]\\n\",\n \"file_path\": \"src/headers/mobih.rs\",\n \"rank\": 47,\n \"score\": 48036.82446619371\n },\n {\n \"content\": \" name_length: reader.read_u32_be()?,\\n\\n unused: reader.read_u16_be()?,\\n\\n locale: reader.read_u8()?,\\n\\n language_code: reader.read_u8()?.into(),\\n\\n input_language: reader.read_u32_be()?,\\n\\n output_language: reader.read_u32_be()?,\\n\\n format_version: reader.read_u32_be()?,\\n\\n first_image_index: reader.read_u32_be()?,\\n\\n first_huff_record: reader.read_u32_be()?,\\n\\n huff_record_count: reader.read_u32_be()?,\\n\\n huff_table_offset: reader.read_u32_be()?,\\n\\n huff_table_length: reader.read_u32_be()?,\\n\\n exth_flags: reader.read_u32_be()?,\\n\\n unused_0: {\\n\\n let mut bytes = [0; 32];\\n\\n reader.read_exact(&mut bytes)?;\\n\\n Box::new(bytes)\\n\\n },\\n\\n unused_1: reader.read_u32_be()?,\\n\\n drm_offset: reader.read_u32_be()?,\\n\",\n \"file_path\": \"src/headers/mobih.rs\",\n \"rank\": 48,\n \"score\": 48036.00402987107\n },\n {\n \"content\": \" w.write_be(self.extra_record_data_flags)?;\\n\\n w.write_be(self.first_index_record)?;\\n\\n w.write_be(self.unused_9.as_slice())\\n\\n }\\n\\n\\n\\n /// Checks if there is a Exth Header and changes the parameter\\n\\n pub fn has_exth_header(&self) -> bool {\\n\\n (self.exth_flags & EXTH_ON_FLAG) != 0\\n\\n }\\n\\n\\n\\n /// Checks if there is DRM on this book\\n\\n pub fn has_drm(&self) -> bool {\\n\\n self.drm_offset != DRM_ON_FLAG\\n\\n }\\n\\n\\n\\n /// Converts numerical value into a type\\n\\n pub fn mobi_type(&self) -> MobiType {\\n\\n self.mobi_type\\n\\n }\\n\\n\\n\",\n \"file_path\": \"src/headers/mobih.rs\",\n \"rank\": 49,\n \"score\": 48035.81736865054\n },\n {\n \"content\": \"use crate::writer::WriteBeBytes;\\n\\nuse crate::{Reader, Writer};\\n\\n\\n\\nuse std::io;\\n\\n\\n\\nconst DRM_ON_FLAG: u32 = 0xFFFF_FFFF;\\n\\nconst EXTH_ON_FLAG: u32 = 0x40;\\n\\n\\n\\n#[derive(Debug, PartialEq, Copy, Clone)]\\n\\npub enum MobiType {\\n\\n MobiPocketBook,\\n\\n PalmDocBook,\\n\\n Audio,\\n\\n News,\\n\\n NewsFeed,\\n\\n NewsMagazine,\\n\\n PICS,\\n\\n WORD,\\n\\n XLS,\\n\\n PPT,\\n\",\n \"file_path\": \"src/headers/mobih.rs\",\n \"rank\": 50,\n \"score\": 48035.47945984232\n },\n {\n \"content\": \" fn test_write() {\\n\\n let input_bytes = book::MOBIHEADER.to_vec();\\n\\n\\n\\n let mobiheader = MobiHeader::parse(&mut book::u8_reader(input_bytes.clone())).unwrap();\\n\\n\\n\\n let mut output_bytes = vec![];\\n\\n assert!(mobiheader\\n\\n .write(&mut Writer::new(&mut output_bytes))\\n\\n .is_ok());\\n\\n assert_eq!(input_bytes.len(), output_bytes.len());\\n\\n assert_eq!(input_bytes, output_bytes);\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/headers/mobih.rs\",\n \"rank\": 51,\n \"score\": 48035.40500386029\n },\n {\n \"content\": \" TEXT,\\n\\n HTML,\\n\\n Unknown,\\n\\n}\\n\\n\\n\\nimpl Default for MobiType {\\n\\n fn default() -> Self {\\n\\n MobiType::Unknown\\n\\n }\\n\\n}\\n\\n\\n\\nimpl From<u32> for MobiType {\\n\\n fn from(ty: u32) -> Self {\\n\\n use MobiType::*;\\n\\n match ty {\\n\\n 2 => MobiPocketBook,\\n\\n 3 => PalmDocBook,\\n\\n 4 => Audio,\\n\\n 257 => News,\\n\\n 258 => NewsFeed,\\n\",\n \"file_path\": \"src/headers/mobih.rs\",\n \"rank\": 52,\n \"score\": 48035.33812423011\n },\n {\n \"content\": \" identifier,\\n\\n header_length,\\n\\n mobi_type: reader.read_u32_be()?.into(),\\n\\n text_encoding: reader.read_u32_be()?.into(),\\n\\n id: reader.read_u32_be()?,\\n\\n gen_version: reader.read_u32_be()?,\\n\\n ortho_index: reader.read_u32_be()?,\\n\\n inflect_index: reader.read_u32_be()?,\\n\\n index_names: reader.read_u32_be()?,\\n\\n index_keys: reader.read_u32_be()?,\\n\\n extra_indices: [\\n\\n reader.read_u32_be()?,\\n\\n reader.read_u32_be()?,\\n\\n reader.read_u32_be()?,\\n\\n reader.read_u32_be()?,\\n\\n reader.read_u32_be()?,\\n\\n reader.read_u32_be()?,\\n\\n ],\\n\\n first_non_book_index: reader.read_u32_be()?,\\n\\n name_offset: reader.read_u32_be()?,\\n\",\n \"file_path\": \"src/headers/mobih.rs\",\n \"rank\": 53,\n \"score\": 48034.59545345812\n },\n {\n \"content\": \" fn test_drm() {\\n\\n let mobiheader = MobiHeader {\\n\\n drm_offset: 1,\\n\\n ..Default::default()\\n\\n };\\n\\n\\n\\n assert!(mobiheader.has_drm());\\n\\n }\\n\\n\\n\\n #[test]\\n\\n fn test_no_drm() {\\n\\n let mobiheader = MobiHeader {\\n\\n drm_offset: 0xFFFF_FFFF,\\n\\n ..Default::default()\\n\\n };\\n\\n\\n\\n assert!(!mobiheader.has_drm());\\n\\n }\\n\\n\\n\\n #[test]\\n\",\n \"file_path\": \"src/headers/mobih.rs\",\n \"rank\": 54,\n \"score\": 48034.193614258336\n },\n {\n \"content\": \"}\\n\\n\\n\\nimpl From<TextEncoding> for u32 {\\n\\n fn from(encoding: TextEncoding) -> Self {\\n\\n match encoding {\\n\\n TextEncoding::CP1252 => 1252,\\n\\n TextEncoding::UTF8 => 65001,\\n\\n TextEncoding::Unknown(n) => n,\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\nimpl WriteBeBytes for TextEncoding {\\n\\n fn write_be_bytes<W: io::Write>(&self, writer: &mut W) -> io::Result<usize> {\\n\\n u32::from(*self).write_be_bytes(writer)\\n\\n }\\n\\n}\\n\\n\\n\\n#[derive(Debug, PartialEq)]\\n\\n/// Strcture that holds Mobi header information\\n\",\n \"file_path\": \"src/headers/mobih.rs\",\n \"rank\": 55,\n \"score\": 48034.17503776838\n },\n {\n \"content\": \" drm_count: reader.read_u32_be()?,\\n\\n drm_size: reader.read_u32_be()?,\\n\\n drm_flags: reader.read_u32_be()?,\\n\\n unused_2: {\\n\\n let mut bytes = [0; 8];\\n\\n reader.read_exact(&mut bytes)?;\\n\\n Box::new(bytes)\\n\\n },\\n\\n first_content_record: reader.read_u16_be()?,\\n\\n last_content_record: reader.read_u16_be()?,\\n\\n unused_3: reader.read_u32_be()?,\\n\\n fcis_record: reader.read_u32_be()?,\\n\\n unused_4: reader.read_u32_be()?,\\n\\n flis_record: reader.read_u32_be()?,\\n\\n unused_5: reader.read_u32_be()?,\\n\\n unused_6: reader.read_u64_be()?,\\n\\n unused_7: reader.read_u32_be()?,\\n\\n first_compilation_data_section_count: reader.read_u32_be()?,\\n\\n data_section_count: reader.read_u32_be()?,\\n\\n unused_8: reader.read_u32_be()?,\\n\",\n \"file_path\": \"src/headers/mobih.rs\",\n \"rank\": 56,\n \"score\": 48033.75592989133\n },\n {\n \"content\": \"pub struct MobiHeader {\\n\\n pub identifier: u32,\\n\\n pub header_length: u32,\\n\\n pub mobi_type: MobiType,\\n\\n pub text_encoding: TextEncoding,\\n\\n pub id: u32,\\n\\n pub gen_version: u32,\\n\\n pub ortho_index: u32,\\n\\n pub inflect_index: u32,\\n\\n pub index_names: u32,\\n\\n pub index_keys: u32,\\n\\n pub extra_indices: [u32; 6],\\n\\n pub first_non_book_index: u32,\\n\\n pub name_offset: u32,\\n\\n pub name_length: u32,\\n\\n unused: u16,\\n\\n pub locale: u8,\\n\\n pub language_code: Language,\\n\\n pub input_language: u32,\\n\\n pub output_language: u32,\\n\",\n \"file_path\": \"src/headers/mobih.rs\",\n \"rank\": 57,\n \"score\": 48032.425938546476\n },\n {\n \"content\": \" #[test]\\n\\n fn test_parse() {\\n\\n let mobiheader = MobiHeader {\\n\\n identifier: 1297039945,\\n\\n header_length: 232,\\n\\n mobi_type: MobiType::MobiPocketBook,\\n\\n text_encoding: TextEncoding::UTF8,\\n\\n id: 3428045761,\\n\\n gen_version: 6,\\n\\n ortho_index: 0xFFFF_FFFF,\\n\\n inflect_index: 0xFFFF_FFFF,\\n\\n index_names: 0xFFFF_FFFF,\\n\\n index_keys: 0xFFFF_FFFF,\\n\\n extra_indices: [0xFFFF_FFFF; 6],\\n\\n first_non_book_index: 284,\\n\\n name_offset: 1360,\\n\\n name_length: 42,\\n\\n unused: 0,\\n\\n locale: 8,\\n\\n language_code: Language::English,\\n\",\n \"file_path\": \"src/headers/mobih.rs\",\n \"rank\": 58,\n \"score\": 48031.52662397992\n },\n {\n \"content\": \"pub enum TextEncoding {\\n\\n CP1252,\\n\\n UTF8,\\n\\n Unknown(u32),\\n\\n}\\n\\n\\n\\nimpl Default for TextEncoding {\\n\\n fn default() -> Self {\\n\\n TextEncoding::UTF8\\n\\n }\\n\\n}\\n\\n\\n\\nimpl From<u32> for TextEncoding {\\n\\n fn from(num: u32) -> Self {\\n\\n match num {\\n\\n 1252 => TextEncoding::CP1252,\\n\\n 65001 => TextEncoding::UTF8,\\n\\n n => TextEncoding::Unknown(n),\\n\\n }\\n\\n }\\n\",\n \"file_path\": \"src/headers/mobih.rs\",\n \"rank\": 59,\n \"score\": 48031.383116584744\n },\n {\n \"content\": \" NewsFeed => 258,\\n\\n NewsMagazine => 259,\\n\\n PICS => 513,\\n\\n WORD => 514,\\n\\n XLS => 515,\\n\\n PPT => 516,\\n\\n TEXT => 517,\\n\\n HTML => 518,\\n\\n Unknown => 0,\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\nimpl WriteBeBytes for MobiType {\\n\\n fn write_be_bytes<W: io::Write>(&self, writer: &mut W) -> io::Result<usize> {\\n\\n u32::from(*self).write_be_bytes(writer)\\n\\n }\\n\\n}\\n\\n\\n\\n#[derive(Debug, PartialEq, Copy, Clone)]\\n\",\n \"file_path\": \"src/headers/mobih.rs\",\n \"rank\": 60,\n \"score\": 48030.15587003768\n },\n {\n \"content\": \" pub format_version: u32,\\n\\n pub first_image_index: u32,\\n\\n pub first_huff_record: u32,\\n\\n pub huff_record_count: u32,\\n\\n pub huff_table_offset: u32,\\n\\n pub huff_table_length: u32,\\n\\n pub exth_flags: u32,\\n\\n unused_0: Box<[u8; 32]>,\\n\\n unused_1: u32,\\n\\n pub drm_offset: u32,\\n\\n pub drm_count: u32,\\n\\n pub drm_size: u32,\\n\\n pub drm_flags: u32,\\n\\n unused_2: Box<[u8; 8]>,\\n\\n pub first_content_record: u16,\\n\\n pub last_content_record: u16,\\n\\n unused_3: u32,\\n\\n pub fcis_record: u32,\\n\\n unused_4: u32, // fcis record count?\\n\\n pub flis_record: u32,\\n\",\n \"file_path\": \"src/headers/mobih.rs\",\n \"rank\": 61,\n \"score\": 48029.15998343508\n },\n {\n \"content\": \" 259 => NewsMagazine,\\n\\n 513 => PICS,\\n\\n 514 => WORD,\\n\\n 515 => XLS,\\n\\n 516 => PPT,\\n\\n 517 => TEXT,\\n\\n 518 => HTML,\\n\\n _ => Unknown,\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\nimpl From<MobiType> for u32 {\\n\\n fn from(ty: MobiType) -> u32 {\\n\\n use MobiType::*;\\n\\n match ty {\\n\\n MobiPocketBook => 2,\\n\\n PalmDocBook => 3,\\n\\n Audio => 4,\\n\\n News => 257,\\n\",\n \"file_path\": \"src/headers/mobih.rs\",\n \"rank\": 62,\n \"score\": 48029.000248510376\n },\n {\n \"content\": \" 68 => Tatar,\\n\\n 74 => Telugu,\\n\\n 30 => Thai,\\n\\n 49 => Tsonga,\\n\\n 50 => Tswana,\\n\\n 31 => Turkish,\\n\\n 34 => Ukrainian,\\n\\n 32 => Urdu,\\n\\n 67 => Uzbek,\\n\\n 42 => Vietnamese,\\n\\n 52 => Xhosa,\\n\\n 53 => Zulu,\\n\\n _ => Unknown,\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\nimpl From<Language> for u8 {\\n\\n fn from(lang: Language) -> Self {\\n\\n use Language::*;\\n\",\n \"file_path\": \"src/headers/mobih.rs\",\n \"rank\": 63,\n \"score\": 48028.65821311584\n },\n {\n \"content\": \" Tsonga,\\n\\n Tswana,\\n\\n Turkish,\\n\\n Ukrainian,\\n\\n Urdu,\\n\\n Uzbek,\\n\\n Vietnamese,\\n\\n Xhosa,\\n\\n Zulu,\\n\\n Unknown,\\n\\n}\\n\\n\\n\\nimpl From<u8> for Language {\\n\\n fn from(code: u8) -> Self {\\n\\n use Language::*;\\n\\n match code {\\n\\n 0 => Neutral,\\n\\n 54 => Afrikaans,\\n\\n 28 => Albanian,\\n\\n 1 => Arabic,\\n\",\n \"file_path\": \"src/headers/mobih.rs\",\n \"rank\": 64,\n \"score\": 48028.36609169285\n },\n {\n \"content\": \" ortho_index: 0xFFFF_FFFF,\\n\\n inflect_index: 0xFFFF_FFFF,\\n\\n index_names: 0xFFFF_FFFF,\\n\\n index_keys: 0xFFFF_FFFF,\\n\\n extra_indices: [0xFFFF_FFFF; 6],\\n\\n first_non_book_index: 0,\\n\\n name_offset: 0,\\n\\n name_length: 0,\\n\\n unused: 0,\\n\\n locale: 0,\\n\\n language_code: Language::default(),\\n\\n input_language: 0,\\n\\n output_language: 0,\\n\\n format_version: 0,\\n\\n first_image_index: 0,\\n\\n first_huff_record: 0,\\n\\n huff_record_count: 0,\\n\\n huff_table_offset: 0,\\n\\n huff_table_length: 0,\\n\\n exth_flags: 0,\\n\",\n \"file_path\": \"src/headers/mobih.rs\",\n \"rank\": 65,\n \"score\": 48028.018065801996\n },\n {\n \"content\": \" w.write_be(self.inflect_index)?;\\n\\n w.write_be(self.index_names)?;\\n\\n w.write_be(self.index_keys)?;\\n\\n for &i in &self.extra_indices {\\n\\n w.write_be(i)?;\\n\\n }\\n\\n w.write_be(self.first_non_book_index)?;\\n\\n w.write_be(self.name_offset)?;\\n\\n w.write_be(self.name_length)?;\\n\\n w.write_be(self.unused)?;\\n\\n w.write_be(self.locale)?;\\n\\n w.write_be(self.language_code)?;\\n\\n w.write_be(self.input_language)?;\\n\\n w.write_be(self.output_language)?;\\n\\n w.write_be(self.format_version)?;\\n\\n w.write_be(self.first_image_index)?;\\n\\n w.write_be(self.first_huff_record)?;\\n\\n w.write_be(self.huff_record_count)?;\\n\\n w.write_be(self.huff_table_offset)?;\\n\\n w.write_be(self.huff_table_length)?;\\n\",\n \"file_path\": \"src/headers/mobih.rs\",\n \"rank\": 66,\n \"score\": 48026.060447126765\n },\n {\n \"content\": \" input_language: 0,\\n\\n output_language: 0,\\n\\n format_version: 6,\\n\\n first_image_index: 287,\\n\\n first_huff_record: 0,\\n\\n huff_record_count: 0,\\n\\n huff_table_offset: 0,\\n\\n huff_table_length: 0,\\n\\n exth_flags: 80,\\n\\n drm_offset: 4294967295,\\n\\n drm_count: 0,\\n\\n drm_size: 0,\\n\\n drm_flags: 0,\\n\\n first_content_record: 1,\\n\\n last_content_record: 288,\\n\\n fcis_record: 290,\\n\\n flis_record: 289,\\n\\n unused_0: Box::new([0; 32]),\\n\\n unused_1: 0xFFFF_FFFF,\\n\\n unused_2: Box::new([0, 0, 0, 0, 0, 0, 0, 0]),\\n\",\n \"file_path\": \"src/headers/mobih.rs\",\n \"rank\": 67,\n \"score\": 48025.9497781146\n },\n {\n \"content\": \" // Mobi format only specifies this two encodings so\\n\\n // this should never panic\\n\\n pub fn text_encoding(&self) -> TextEncoding {\\n\\n self.text_encoding\\n\\n }\\n\\n\\n\\n pub fn language(&self) -> Language {\\n\\n self.language_code\\n\\n }\\n\\n}\\n\\n\\n\\n#[derive(Debug, PartialEq, Copy, Clone)]\\n\\npub enum Language {\\n\\n Neutral,\\n\\n Afrikaans,\\n\\n Albanian,\\n\\n Arabic,\\n\\n Armenian,\\n\\n Assamese,\\n\\n Azeri,\\n\",\n \"file_path\": \"src/headers/mobih.rs\",\n \"rank\": 68,\n \"score\": 48025.94429699753\n },\n {\n \"content\": \" w.write_be(self.exth_flags)?;\\n\\n w.write_be(self.unused_0.as_ref().as_ref())?;\\n\\n w.write_be(self.unused_1)?;\\n\\n w.write_be(self.drm_offset)?;\\n\\n w.write_be(self.drm_count)?;\\n\\n w.write_be(self.drm_size)?;\\n\\n w.write_be(self.drm_flags)?;\\n\\n w.write_be(self.unused_2.as_ref().as_ref())?;\\n\\n w.write_be(self.first_content_record)?;\\n\\n w.write_be(self.last_content_record)?;\\n\\n w.write_be(self.unused_3)?;\\n\\n w.write_be(self.fcis_record)?;\\n\\n w.write_be(self.unused_4)?;\\n\\n w.write_be(self.flis_record)?;\\n\\n w.write_be(self.unused_5)?;\\n\\n w.write_be(self.unused_6)?;\\n\\n w.write_be(self.unused_7)?;\\n\\n w.write_be(self.first_compilation_data_section_count)?;\\n\\n w.write_be(self.data_section_count)?;\\n\\n w.write_be(self.unused_8)?;\\n\",\n \"file_path\": \"src/headers/mobih.rs\",\n \"rank\": 69,\n \"score\": 48025.33438369866\n },\n {\n \"content\": \" unused_0: Box::new([0; 32]),\\n\\n unused_1: 0xFFFF_FFFF,\\n\\n drm_offset: 0,\\n\\n drm_count: 0,\\n\\n drm_size: 0,\\n\\n drm_flags: 0,\\n\\n unused_2: Box::new([0; 8]),\\n\\n first_content_record: 1,\\n\\n last_content_record: 0,\\n\\n unused_3: 1,\\n\\n fcis_record: 0,\\n\\n unused_4: 1,\\n\\n flis_record: 0,\\n\\n unused_5: 1,\\n\\n unused_6: 0,\\n\\n unused_7: 0xFFFF_FFFF,\\n\\n first_compilation_data_section_count: 0,\\n\\n data_section_count: 0xFFFF_FFFF,\\n\\n unused_8: 0xFFFF_FFFF,\\n\\n extra_record_data_flags: 0,\\n\",\n \"file_path\": \"src/headers/mobih.rs\",\n \"rank\": 70,\n \"score\": 48023.79485098548\n },\n {\n \"content\": \" Basque,\\n\\n Belarusian,\\n\\n Bengali,\\n\\n Bulgarian,\\n\\n Catalan,\\n\\n Chinese,\\n\\n Czech,\\n\\n Danish,\\n\\n Dutch,\\n\\n English,\\n\\n Estonian,\\n\\n Faeroese,\\n\\n Farsi,\\n\\n Finnish,\\n\\n French,\\n\\n Georgian,\\n\\n German,\\n\\n Greek,\\n\\n Gujarati,\\n\\n Hebrew,\\n\",\n \"file_path\": \"src/headers/mobih.rs\",\n \"rank\": 71,\n \"score\": 48020.44184131855\n },\n {\n \"content\": \" Polish,\\n\\n Portuguese,\\n\\n Punjabi,\\n\\n Rhaetoromanic,\\n\\n Romanian,\\n\\n Russian,\\n\\n Sami,\\n\\n Sanskrit,\\n\\n Serbian,\\n\\n Slovak,\\n\\n Slovenian,\\n\\n Sorbian,\\n\\n Spanish,\\n\\n Sutu,\\n\\n Swahili,\\n\\n Swedish,\\n\\n Tamil,\\n\\n Tatar,\\n\\n Telugu,\\n\\n Thai,\\n\",\n \"file_path\": \"src/headers/mobih.rs\",\n \"rank\": 72,\n \"score\": 48020.44184131855\n },\n {\n \"content\": \" match lang {\\n\\n Neutral => 0,\\n\\n Afrikaans => 54,\\n\\n Albanian => 28,\\n\\n Arabic => 1,\\n\\n Armenian => 43,\\n\\n Assamese => 77,\\n\\n Azeri => 44,\\n\\n Basque => 45,\\n\\n Belarusian => 35,\\n\\n Bengali => 69,\\n\\n Bulgarian => 2,\\n\\n Catalan => 3,\\n\\n Chinese => 4,\\n\\n Czech => 5,\\n\\n Danish => 6,\\n\\n Dutch => 19,\\n\\n English => 9,\\n\\n Estonian => 37,\\n\\n Faeroese => 56,\\n\",\n \"file_path\": \"src/headers/mobih.rs\",\n \"rank\": 73,\n \"score\": 48020.44184131855\n },\n {\n \"content\": \" Hindi,\\n\\n Hungarian,\\n\\n Icelandic,\\n\\n Indonesian,\\n\\n Italian,\\n\\n Japanese,\\n\\n Kannada,\\n\\n Kazak,\\n\\n Konkani,\\n\\n Korean,\\n\\n Latvian,\\n\\n Lithuanian,\\n\\n Macedonian,\\n\\n Malay,\\n\\n Malayalam,\\n\\n Maltese,\\n\\n Marathi,\\n\\n Nepali,\\n\\n Norwegian,\\n\\n Oriya,\\n\",\n \"file_path\": \"src/headers/mobih.rs\",\n \"rank\": 74,\n \"score\": 48020.44184131855\n },\n {\n \"content\": \" Spanish => 10,\\n\\n Sutu => 48,\\n\\n Swahili => 65,\\n\\n Swedish => 29,\\n\\n Tamil => 73,\\n\\n Tatar => 68,\\n\\n Telugu => 74,\\n\\n Thai => 30,\\n\\n Tsonga => 49,\\n\\n Tswana => 50,\\n\\n Turkish => 31,\\n\\n Ukrainian => 34,\\n\\n Urdu => 32,\\n\\n Uzbek => 67,\\n\\n Vietnamese => 42,\\n\\n Xhosa => 52,\\n\\n Zulu => 53,\\n\\n Unknown => u8::MAX,\\n\\n }\\n\\n }\\n\",\n \"file_path\": \"src/headers/mobih.rs\",\n \"rank\": 75,\n \"score\": 48020.44184131855\n },\n {\n \"content\": \" 43 => Armenian,\\n\\n 77 => Assamese,\\n\\n 44 => Azeri,\\n\\n 45 => Basque,\\n\\n 35 => Belarusian,\\n\\n 69 => Bengali,\\n\\n 2 => Bulgarian,\\n\\n 3 => Catalan,\\n\\n 4 => Chinese,\\n\\n 5 => Czech,\\n\\n 6 => Danish,\\n\\n 19 => Dutch,\\n\\n 9 => English,\\n\\n 37 => Estonian,\\n\\n 56 => Faeroese,\\n\\n 41 => Farsi,\\n\\n 11 => Finnish,\\n\\n 12 => French,\\n\\n 55 => Georgian,\\n\\n 7 => German,\\n\",\n \"file_path\": \"src/headers/mobih.rs\",\n \"rank\": 76,\n \"score\": 48020.44184131855\n },\n {\n \"content\": \" Farsi => 41,\\n\\n Finnish => 11,\\n\\n French => 12,\\n\\n Georgian => 55,\\n\\n German => 7,\\n\\n Greek => 8,\\n\\n Gujarati => 71,\\n\\n Hebrew => 13,\\n\\n Hindi => 57,\\n\\n Hungarian => 14,\\n\\n Icelandic => 15,\\n\\n Indonesian => 33,\\n\\n Italian => 16,\\n\\n Japanese => 17,\\n\\n Kannada => 75,\\n\\n Kazak => 63,\\n\\n Konkani => 87,\\n\\n Korean => 18,\\n\\n Latvian => 38,\\n\\n Lithuanian => 39,\\n\",\n \"file_path\": \"src/headers/mobih.rs\",\n \"rank\": 77,\n \"score\": 48020.44184131855\n },\n {\n \"content\": \" 97 => Nepali,\\n\\n 20 => Norwegian,\\n\\n 72 => Oriya,\\n\\n 21 => Polish,\\n\\n 22 => Portuguese,\\n\\n 70 => Punjabi,\\n\\n 23 => Rhaetoromanic,\\n\\n 24 => Romanian,\\n\\n 25 => Russian,\\n\\n 59 => Sami,\\n\\n 79 => Sanskrit,\\n\\n 26 => Serbian,\\n\\n 27 => Slovak,\\n\\n 36 => Slovenian,\\n\\n 46 => Sorbian,\\n\\n 10 => Spanish,\\n\\n 48 => Sutu,\\n\\n 65 => Swahili,\\n\\n 29 => Swedish,\\n\\n 73 => Tamil,\\n\",\n \"file_path\": \"src/headers/mobih.rs\",\n \"rank\": 78,\n \"score\": 48020.44184131855\n },\n {\n \"content\": \" Macedonian => 47,\\n\\n Malay => 62,\\n\\n Malayalam => 76,\\n\\n Maltese => 58,\\n\\n Marathi => 78,\\n\\n Nepali => 97,\\n\\n Norwegian => 20,\\n\\n Oriya => 72,\\n\\n Polish => 21,\\n\\n Portuguese => 22,\\n\\n Punjabi => 70,\\n\\n Rhaetoromanic => 23,\\n\\n Romanian => 24,\\n\\n Russian => 25,\\n\\n Sami => 59,\\n\\n Sanskrit => 79,\\n\\n Serbian => 26,\\n\\n Slovak => 27,\\n\\n Slovenian => 36,\\n\\n Sorbian => 46,\\n\",\n \"file_path\": \"src/headers/mobih.rs\",\n \"rank\": 79,\n \"score\": 48020.44184131855\n },\n {\n \"content\": \" 8 => Greek,\\n\\n 71 => Gujarati,\\n\\n 13 => Hebrew,\\n\\n 57 => Hindi,\\n\\n 14 => Hungarian,\\n\\n 15 => Icelandic,\\n\\n 33 => Indonesian,\\n\\n 16 => Italian,\\n\\n 17 => Japanese,\\n\\n 75 => Kannada,\\n\\n 63 => Kazak,\\n\\n 87 => Konkani,\\n\\n 18 => Korean,\\n\\n 38 => Latvian,\\n\\n 39 => Lithuanian,\\n\\n 47 => Macedonian,\\n\\n 62 => Malay,\\n\\n 76 => Malayalam,\\n\\n 58 => Maltese,\\n\\n 78 => Marathi,\\n\",\n \"file_path\": \"src/headers/mobih.rs\",\n \"rank\": 80,\n \"score\": 48020.44184131855\n },\n {\n \"content\": \"pub fn decompress(huffs: &[&[u8]], sections: &[&[u8]]) -> HuffmanResult<Vec<Vec<u8>>> {\\n\\n let mut decoder = HuffmanDecoder::init(huffs)?;\\n\\n decoder.unpack_sections(sections)\\n\\n}\\n\",\n \"file_path\": \"src/compression/huff.rs\",\n \"rank\": 81,\n \"score\": 37012.10972283298\n },\n {\n \"content\": \"#[derive(Debug)]\\n\\nstruct HuffmanDecoder {\\n\\n dictionary: HuffmanDictionary,\\n\\n code_dict: CodeDictionary,\\n\\n min_codes: MinCodesMapping,\\n\\n max_codes: MaxCodesMapping,\\n\\n}\\n\\n\\n\\nimpl Default for HuffmanDecoder {\\n\\n fn default() -> Self {\\n\\n Self {\\n\\n dictionary: vec![],\\n\\n code_dict: [(0, false, 0); 256],\\n\\n min_codes: [0; 33],\\n\\n max_codes: [u32::MAX; 33],\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\nimpl HuffmanDecoder {\\n\\n fn load_code_dictionary<R: std::io::Read>(\\n\",\n \"file_path\": \"src/compression/huff.rs\",\n \"rank\": 82,\n \"score\": 35421.597047755306\n },\n {\n \"content\": \"impl Header {\\n\\n /// Parse a header from the content. The reader must be advanced to the starting position of the\\n\\n /// header, at byte 0.\\n\\n pub(crate) fn parse<R: io::Read>(reader: &mut Reader<R>) -> Result<Header, HeaderParseError> {\\n\\n Ok(Header {\\n\\n name: {\\n\\n let bytes = reader.read_vec_header(32)?;\\n\\n if bytes.starts_with(b\\\"TPZ\\\") {\\n\\n return Err(HeaderParseError::IsTopazError);\\n\\n } else if bytes.starts_with(b\\\"\\\\xeaDRMION\\\\xee\\\") {\\n\\n return Err(HeaderParseError::IsKfxError);\\n\\n }\\n\\n bytes\\n\\n },\\n\\n attributes: reader.read_u16_be()?,\\n\\n version: reader.read_u16_be()?,\\n\\n created: reader.read_u32_be()?,\\n\\n modified: reader.read_u32_be()?,\\n\\n backup: reader.read_u32_be()?,\\n\\n modnum: reader.read_u32_be()?,\\n\",\n \"file_path\": \"src/headers/header.rs\",\n \"rank\": 83,\n \"score\": 30082.261942614085\n },\n {\n \"content\": \"use crate::{Reader, Writer};\\n\\n\\n\\n#[cfg(feature = \\\"time\\\")]\\n\\nuse chrono::NaiveDateTime;\\n\\nuse std::io;\\n\\nuse thiserror::Error;\\n\\n\\n\\n#[derive(Error, Debug)]\\n\\npub enum HeaderParseError {\\n\\n #[error(\\\"this book is an Amazon Topaz book and it cannot be processed\\\")]\\n\\n IsTopazError,\\n\\n #[error(\\\"this book is an Amazon KFX book and it cannot be processed\\\")]\\n\\n IsKfxError,\\n\\n #[error(\\\"expected type header identifier BOOK or TEXT\\\")]\\n\\n InvalidTypeIdentifier,\\n\\n #[error(\\\"expected creator header identifier MOBI or READ\\\")]\\n\\n InvalidCreatorIdentifier,\\n\\n #[error(transparent)]\\n\\n IoError(#[from] std::io::Error),\\n\\n}\\n\",\n \"file_path\": \"src/headers/header.rs\",\n \"rank\": 84,\n \"score\": 30080.312146375316\n },\n {\n \"content\": \" app_info_id: reader.read_u32_be()?,\\n\\n sort_info_id: reader.read_u32_be()?,\\n\\n type_: {\\n\\n let ty = reader.read_vec_header(4)?;\\n\\n if ty != b\\\"BOOK\\\" && ty != b\\\"TEXT\\\" {\\n\\n return Err(HeaderParseError::InvalidTypeIdentifier);\\n\\n }\\n\\n ty\\n\\n },\\n\\n creator: {\\n\\n let creator = reader.read_vec_header(4)?;\\n\\n if creator != b\\\"MOBI\\\" && creator != b\\\"READ\\\" {\\n\\n return Err(HeaderParseError::InvalidCreatorIdentifier);\\n\\n }\\n\\n creator\\n\\n },\\n\\n unique_id_seed: reader.read_u32_be()?,\\n\\n next_record_list_id: reader.read_u32_be()?,\\n\\n num_records: reader.read_u16_be()?,\\n\\n })\\n\",\n \"file_path\": \"src/headers/header.rs\",\n \"rank\": 85,\n \"score\": 30076.32561732988\n },\n {\n \"content\": \" fn parse() {\\n\\n let header = Header {\\n\\n name: b\\\"Lord_of_the_Rings_-_Fellowship_\\\\0\\\".to_vec(),\\n\\n attributes: 0,\\n\\n version: 0,\\n\\n created: 1299709979,\\n\\n modified: 1299709979,\\n\\n backup: 0,\\n\\n modnum: 0,\\n\\n app_info_id: 0,\\n\\n sort_info_id: 0,\\n\\n type_: b\\\"BOOK\\\".to_vec(),\\n\\n creator: b\\\"MOBI\\\".to_vec(),\\n\\n unique_id_seed: 292,\\n\\n next_record_list_id: 0,\\n\\n num_records: 292,\\n\\n };\\n\\n\\n\\n let mut reader = book::u8_reader(book::HEADER.to_vec());\\n\\n let parsed_header = Header::parse(&mut reader);\\n\",\n \"file_path\": \"src/headers/header.rs\",\n \"rank\": 86,\n \"score\": 30074.971425692565\n },\n {\n \"content\": \" /// method when `time` feature is disabled.\\n\\n pub(crate) fn created_datetime(&self) -> u32 {\\n\\n self.created\\n\\n }\\n\\n\\n\\n #[cfg(not(feature = \\\"time\\\"))]\\n\\n /// Returns a u32 timestamp of last modification. This is a fallback\\n\\n /// method when `time` feature is disabled.\\n\\n pub(crate) fn mod_datetime(&self) -> u32 {\\n\\n self.modified\\n\\n }\\n\\n}\\n\\n\\n\\n#[cfg(test)]\\n\\nmod tests {\\n\\n use super::*;\\n\\n use crate::book;\\n\\n use crate::writer::Writer;\\n\\n\\n\\n #[test]\\n\",\n \"file_path\": \"src/headers/header.rs\",\n \"rank\": 87,\n \"score\": 30074.304017947994\n },\n {\n \"content\": \" assert_eq!(header, parsed_header.unwrap());\\n\\n }\\n\\n\\n\\n #[test]\\n\\n fn write() {\\n\\n let header = book::HEADER.to_vec();\\n\\n\\n\\n let mut reader = book::u8_reader(header.clone());\\n\\n let parsed_header = Header::parse(&mut reader).unwrap();\\n\\n\\n\\n let mut buf = vec![];\\n\\n\\n\\n parsed_header\\n\\n .write(&mut Writer::new(&mut buf), 292)\\n\\n .unwrap();\\n\\n assert_eq!(header.len(), buf.len());\\n\\n assert_eq!(header, buf);\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/headers/header.rs\",\n \"rank\": 88,\n \"score\": 30071.683980291466\n },\n {\n \"content\": \" w.write_be(self.next_record_list_id)?;\\n\\n w.write_be(num_records)\\n\\n }\\n\\n\\n\\n #[cfg(feature = \\\"time\\\")]\\n\\n /// Returns a chrono::NaiveDateTime timestamp of file creation\\n\\n /// This field is only available using `time` feature\\n\\n pub(crate) fn created_datetime(&self) -> NaiveDateTime {\\n\\n NaiveDateTime::from_timestamp(i64::from(self.created), 0)\\n\\n }\\n\\n\\n\\n #[cfg(feature = \\\"time\\\")]\\n\\n /// Returns a chrono::NaiveDateTime timestamp of file modification\\n\\n /// This field is only available using `time` feature\\n\\n pub(crate) fn mod_datetime(&self) -> NaiveDateTime {\\n\\n NaiveDateTime::from_timestamp(i64::from(self.modified), 0)\\n\\n }\\n\\n\\n\\n #[cfg(not(feature = \\\"time\\\"))]\\n\\n /// Returns a u32 timestamp of creation. This is a fallback\\n\",\n \"file_path\": \"src/headers/header.rs\",\n \"rank\": 89,\n \"score\": 30071.4935969524\n },\n {\n \"content\": \"\\n\\n#[derive(Debug, PartialEq, Default)]\\n\\n/// Strcture that holds header information\\n\\npub struct Header {\\n\\n pub name: Vec<u8>,\\n\\n pub attributes: u16,\\n\\n pub version: u16,\\n\\n pub created: u32,\\n\\n pub modified: u32,\\n\\n pub backup: u32,\\n\\n pub modnum: u32,\\n\\n pub app_info_id: u32,\\n\\n pub sort_info_id: u32,\\n\\n pub type_: Vec<u8>,\\n\\n pub creator: Vec<u8>,\\n\\n pub unique_id_seed: u32,\\n\\n pub next_record_list_id: u32,\\n\\n pub num_records: u16,\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/headers/header.rs\",\n \"rank\": 90,\n \"score\": 30071.08386555564\n },\n {\n \"content\": \" }\\n\\n\\n\\n pub(crate) fn write<W: io::Write>(\\n\\n &self,\\n\\n w: &mut Writer<W>,\\n\\n num_records: u16,\\n\\n ) -> io::Result<()> {\\n\\n w.write_be(&self.name)?;\\n\\n w.write_be(self.attributes)?;\\n\\n w.write_be(self.version)?;\\n\\n w.write_be(self.created)?;\\n\\n // User should change this themselves?\\n\\n w.write_be(self.modified)?;\\n\\n w.write_be(self.backup)?;\\n\\n w.write_be(self.modnum)?;\\n\\n w.write_be(self.app_info_id)?;\\n\\n w.write_be(self.sort_info_id)?;\\n\\n w.write_be(&self.type_)?;\\n\\n w.write_be(&self.creator)?;\\n\\n w.write_be(self.unique_id_seed)?;\\n\",\n \"file_path\": \"src/headers/header.rs\",\n \"rank\": 91,\n \"score\": 30068.817678665582\n },\n {\n \"content\": \"use std::io::{self, Read};\\n\\n\\n\\n#[derive(Debug, Default, Clone)]\\n\\n/// Helper struct for reading header values from content.\\n\\n/// Only allows forward reads.\\n\\npub(crate) struct Reader<R> {\\n\\n reader: R,\\n\\n position: usize,\\n\\n}\\n\\n\\n\\nimpl<R: std::io::Read> Reader<R> {\\n\\n pub(crate) fn new(content: R) -> Reader<R> {\\n\\n Reader {\\n\\n reader: content,\\n\\n position: 0,\\n\\n }\\n\\n }\\n\\n\\n\\n pub(crate) fn read_to_end(&mut self) -> io::Result<Vec<u8>> {\\n\\n // Zero-fill so that Records parsing works as expected.\\n\",\n \"file_path\": \"src/reader.rs\",\n \"rank\": 92,\n \"score\": 28304.506579701185\n },\n {\n \"content\": \"\\n\\nimpl WriteBeBytes for u32 {\\n\\n fn write_be_bytes<W: io::Write>(&self, writer: &mut W) -> io::Result<usize> {\\n\\n writer.write_all(&self.to_be_bytes())?;\\n\\n Ok(self.to_be_bytes().len())\\n\\n }\\n\\n}\\n\\n\\n\\nimpl WriteBeBytes for u64 {\\n\\n fn write_be_bytes<W: io::Write>(&self, writer: &mut W) -> io::Result<usize> {\\n\\n writer.write_all(&self.to_be_bytes())?;\\n\\n Ok(self.to_be_bytes().len())\\n\\n }\\n\\n}\\n\\n\\n\\n#[derive(Debug, Default, Clone)]\\n\\n/// Helper struct for reading header values from content.\\n\\n/// Only allows forward reads.\\n\\npub(crate) struct Writer<W> {\\n\\n writer: W,\\n\",\n \"file_path\": \"src/writer.rs\",\n \"rank\": 93,\n \"score\": 28296.27934785495\n },\n {\n \"content\": \" bytes_written: usize,\\n\\n}\\n\\n\\n\\nimpl<W: std::io::Write> Writer<W> {\\n\\n pub(crate) fn new(writer: W) -> Writer<W> {\\n\\n Writer {\\n\\n writer,\\n\\n bytes_written: 0,\\n\\n }\\n\\n }\\n\\n\\n\\n pub(crate) fn bytes_written(&self) -> usize {\\n\\n self.bytes_written\\n\\n }\\n\\n\\n\\n #[inline]\\n\\n pub(crate) fn write_be<B: WriteBeBytes>(&mut self, b: B) -> io::Result<()> {\\n\\n self.bytes_written += b.write_be_bytes(&mut self.writer)?;\\n\\n Ok(())\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/writer.rs\",\n \"rank\": 94,\n \"score\": 28294.192378389955\n },\n {\n \"content\": \"use std::io;\\n\\n\\n\\npub(crate) trait WriteBeBytes {\\n\\n fn write_be_bytes<W: io::Write>(&self, writer: &mut W) -> io::Result<usize>;\\n\\n}\\n\\n\\n\\nimpl WriteBeBytes for &[u8] {\\n\\n fn write_be_bytes<W: io::Write>(&self, writer: &mut W) -> io::Result<usize> {\\n\\n writer.write_all(self)?;\\n\\n Ok(self.len())\\n\\n }\\n\\n}\\n\\n\\n\\nimpl WriteBeBytes for Vec<u8> {\\n\\n fn write_be_bytes<W: io::Write>(&self, writer: &mut W) -> io::Result<usize> {\\n\\n writer.write_all(self)?;\\n\\n Ok(self.len())\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/writer.rs\",\n \"rank\": 95,\n \"score\": 28292.205601899586\n },\n {\n \"content\": \" let mut first_buf = vec![0; self.position];\\n\\n // read_to_end appends to the end of the buffer.\\n\\n self.reader.read_to_end(&mut first_buf)?;\\n\\n self.position = first_buf.len();\\n\\n Ok(first_buf)\\n\\n }\\n\\n\\n\\n pub(crate) fn read_exact(&mut self, buf: &mut [u8]) -> io::Result<()> {\\n\\n self.reader.read_exact(buf)?;\\n\\n self.position += buf.len();\\n\\n Ok(())\\n\\n }\\n\\n\\n\\n #[inline]\\n\\n pub(crate) fn set_position(&mut self, p: usize) -> io::Result<()> {\\n\\n debug_assert!(p >= self.position, \\\"{}, {}\\\", p, self.position);\\n\\n\\n\\n if p >= self.position {\\n\\n std::io::copy(\\n\\n &mut self.reader.by_ref().take((p - self.position) as u64),\\n\",\n \"file_path\": \"src/reader.rs\",\n \"rank\": 96,\n \"score\": 28291.648944245862\n },\n {\n \"content\": \" }\\n\\n\\n\\n #[inline]\\n\\n pub(crate) fn read_u16_be(&mut self) -> io::Result<u16> {\\n\\n let mut bytes = [0; 2];\\n\\n self.read_exact(&mut bytes)?;\\n\\n Ok(u16::from_be_bytes(bytes))\\n\\n }\\n\\n\\n\\n #[inline]\\n\\n #[allow(dead_code)]\\n\\n pub(crate) fn read_u8(&mut self) -> io::Result<u8> {\\n\\n let mut bytes = [0; 1];\\n\\n self.read_exact(&mut bytes)?;\\n\\n Ok(u8::from_be_bytes(bytes))\\n\\n }\\n\\n\\n\\n pub(crate) fn read_vec_header(&mut self, len: usize) -> io::Result<Vec<u8>> {\\n\\n let mut buf = vec![0; len];\\n\\n self.read_exact(&mut buf)?;\\n\\n Ok(buf)\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/reader.rs\",\n \"rank\": 97,\n \"score\": 28291.429868057727\n },\n {\n \"content\": \" &mut io::sink(),\\n\\n )?;\\n\\n self.position = p;\\n\\n }\\n\\n\\n\\n Ok(())\\n\\n }\\n\\n\\n\\n #[inline]\\n\\n pub(crate) fn read_u64_be(&mut self) -> io::Result<u64> {\\n\\n let mut bytes = [0; 8];\\n\\n self.read_exact(&mut bytes)?;\\n\\n Ok(u64::from_be_bytes(bytes))\\n\\n }\\n\\n\\n\\n #[inline]\\n\\n pub(crate) fn read_u32_be(&mut self) -> io::Result<u32> {\\n\\n let mut bytes = [0; 4];\\n\\n self.read_exact(&mut bytes)?;\\n\\n Ok(u32::from_be_bytes(bytes))\\n\",\n \"file_path\": \"src/reader.rs\",\n \"rank\": 98,\n \"score\": 28289.528571467145\n },\n {\n \"content\": \"impl WriteBeBytes for &Vec<u8> {\\n\\n fn write_be_bytes<W: io::Write>(&self, writer: &mut W) -> io::Result<usize> {\\n\\n writer.write_all(self)?;\\n\\n Ok(self.len())\\n\\n }\\n\\n}\\n\\n\\n\\nimpl WriteBeBytes for u8 {\\n\\n fn write_be_bytes<W: io::Write>(&self, writer: &mut W) -> io::Result<usize> {\\n\\n writer.write_all(&self.to_be_bytes())?;\\n\\n Ok(self.to_be_bytes().len())\\n\\n }\\n\\n}\\n\\n\\n\\nimpl WriteBeBytes for u16 {\\n\\n fn write_be_bytes<W: io::Write>(&self, writer: &mut W) -> io::Result<usize> {\\n\\n writer.write_all(&self.to_be_bytes())?;\\n\\n Ok(self.to_be_bytes().len())\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/writer.rs\",\n \"rank\": 99,\n \"score\": 28289.096689868835\n }\n]","isConversational":false}}},{"rowIdx":2382,"cells":{"lang":{"kind":"string","value":"Rust"},"file_path":{"kind":"string","value":"src/walker.rs"},"repo_name":{"kind":"string","value":"oxidecomputer/openapi-lint"},"commit":{"kind":"string","value":"025fc867b7da62b33474d0a765823653a437f362"},"file_code":{"kind":"string","value":"\n\nuse indexmap::IndexMap;\nuse openapiv3::{\n Components, MediaType, OpenAPI, Operation, Parameter, ParameterSchemaOrContent, PathItem,\n ReferenceOr, RequestBody, Response, Schema,\n};\n\npub(crate) trait SchemaWalker<'a> {\n type SchemaIterator: Iterator<Item = (Option<String>, &'a Schema)>;\n fn walk(&'a self) -> Self::SchemaIterator;\n}\n\nimpl<'a> SchemaWalker<'a> for OpenAPI {\n type SchemaIterator = std::vec::IntoIter<(Option<String>, &'a Schema)>;\n\n fn walk(&'a self) -> Self::SchemaIterator {\n self.paths\n .iter()\n .flat_map(|(_, path)| path.walk())\n .chain(self.components.walk())\n .collect::<Vec<_>>()\n .into_iter()\n }\n}\n\nimpl<'a, T> SchemaWalker<'a> for ReferenceOr<T>\nwhere\n T: SchemaWalker<'a>,\n{\n type SchemaIterator = std::vec::IntoIter<(Option<String>, &'a Schema)>;\n\n fn walk(&'a self) -> Self::SchemaIterator {\n match self {\n ReferenceOr::Reference { .. } => Vec::<(Option<String>, &Schema)>::new().into_iter(),\n ReferenceOr::Item(walker) => walker.walk().collect::<Vec<_>>().into_iter(),\n }\n }\n}\n\nimpl<'a, T> SchemaWalker<'a> for Option<T>\nwhere\n T: SchemaWalker<'a>,\n{\n type SchemaIterator = std::vec::IntoIter<(Option<String>, &'a Schema)>;\n\n fn walk(&'a self) -> Self::SchemaIterator {\n match self {\n None => Vec::<(Option<String>, &Schema)>::new().into_iter(),\n Some(walker) => walker.walk().collect::<Vec<_>>().into_iter(),\n }\n }\n}\n\nimpl<'a> SchemaWalker<'a> for IndexMap<String, ReferenceOr<Schema>> {\n type SchemaIterator = std::vec::IntoIter<(Option<String>, &'a Schema)>;\n\n fn walk(&'a self) -> Self::SchemaIterator {\n self.iter()\n .flat_map(|(key, value)| {\n value\n .walk()\n .map(|(_, schema)| (Some(key.clone()), schema))\n .collect::<Vec<_>>()\n .into_iter()\n })\n .collect::<Vec<_>>()\n .into_iter()\n }\n}\n\nimpl<'a, K> SchemaWalker<'a> for IndexMap<K, MediaType> {\n type SchemaIterator = std::vec::IntoIter<(Option<String>, &'a Schema)>;\n\n fn walk(&'a self) -> Self::SchemaIterator {\n self.iter()\n .flat_map(|(_key, value)| value.walk())\n .collect::<Vec<_>>()\n .into_iter()\n }\n}\n\nimpl<'a, K> SchemaWalker<'a> for IndexMap<K, ReferenceOr<Response>> {\n type SchemaIterator = std::vec::IntoIter<(Option<String>, &'a Schema)>;\n\n fn walk(&'a self) -> Self::SchemaIterator {\n self.iter()\n .flat_map(|(_key, value)| value.walk())\n .collect::<Vec<_>>()\n .into_iter()\n }\n}\n\nimpl<'a> SchemaWalker<'a> for PathItem {\n type SchemaIterator = std::vec::IntoIter<(Option<String>, &'a Schema)>;\n\n fn walk(&'a self) -> Self::SchemaIterator {\n self.iter()\n .flat_map(|(_, op)| SchemaWalker::walk(op))\n .chain(self.parameters.iter().flat_map(SchemaWalker::walk))\n .collect::<Vec<_>>()\n .into_iter()\n }\n}\n\nimpl<'a> SchemaWalker<'a> for Operation {\n type SchemaIterator = std::vec::IntoIter<(Option<String>, &'a Schema)>;\n\n fn walk(&'a self) -> Self::SchemaIterator {\n self.parameters\n .iter()\n .flat_map(SchemaWalker::walk)\n .chain(self.request_body.walk())\n .chain(self.responses.default.walk())\n .chain(self.responses.responses.walk())\n .collect::<Vec<_>>()\n .into_iter()\n }\n}\n\nimpl<'a> SchemaWalker<'a> for Components {\n type SchemaIterator = std::vec::IntoIter<(Option<String>, &'a Schema)>;\n\n fn walk(&'a self) -> Self::SchemaIterator {\n self.responses\n .walk()\n .chain(\n self.parameters\n .iter()\n .flat_map(|(_, parameter)| parameter.walk()),\n )\n .chain(\n self.request_bodies\n .iter()\n .flat_map(|(_, request_body)| request_body.walk()),\n )\n .chain(self.schemas.walk())\n .collect::<Vec<_>>()\n .into_iter()\n }\n}\n\nimpl<'a> SchemaWalker<'a> for Response {\n type SchemaIterator = <IndexMap<String, MediaType> as SchemaWalker<'a>>::SchemaIterator;\n\n fn walk(&'a self) -> Self::SchemaIterator {\n self.content.walk()\n }\n}\n\nimpl<'a> SchemaWalker<'a> for MediaType {\n type SchemaIterator = <Option<Schema> as SchemaWalker<'a>>::SchemaIterator;\n\n fn walk(&'a self) -> Self::SchemaIterator {\n self.schema.walk()\n }\n}\n\nimpl<'a> SchemaWalker<'a> for Parameter {\n type SchemaIterator = std::vec::IntoIter<(Option<String>, &'a Schema)>;\n\n fn walk(&'a self) -> Self::SchemaIterator {\n match self {\n Parameter::Query { parameter_data, .. } => parameter_data,\n Parameter::Header { parameter_data, .. } => parameter_data,\n Parameter::Path { parameter_data, .. } => parameter_data,\n Parameter::Cookie { parameter_data, .. } => parameter_data,\n }\n .format\n .walk()\n }\n}\n\nimpl<'a> SchemaWalker<'a> for ParameterSchemaOrContent {\n type SchemaIterator = std::vec::IntoIter<(Option<String>, &'a Schema)>;\n\n fn walk(&'a self) -> Self::SchemaIterator {\n match self {\n ParameterSchemaOrContent::Schema(schema) => {\n schema.walk().collect::<Vec<_>>().into_iter()\n }\n ParameterSchemaOrContent::Content(content) => {\n content.walk().collect::<Vec<_>>().into_iter()\n }\n }\n }\n}\n\nimpl<'a> SchemaWalker<'a> for RequestBody {\n type SchemaIterator = std::vec::IntoIter<(Option<String>, &'a Schema)>;\n\n fn walk(&'a self) -> Self::SchemaIterator {\n self.content.walk()\n }\n}\n\nimpl<'a> SchemaWalker<'a> for Schema {\n type SchemaIterator = std::iter::Once<(Option<String>, &'a Schema)>;\n\n fn walk(&'a self) -> Self::SchemaIterator {\n \n \n \n\n std::iter::once((None, self))\n }\n}\n"},"prefix":{"kind":"string","value":"\n\nuse indexmap::IndexMap;\nuse openapiv3::{\n Components, MediaType, OpenAPI, Operation, Parameter, ParameterSchemaOrContent, PathItem,\n ReferenceOr, RequestBody, Response, Schema,\n};\n\npub(crate) trait SchemaWalker<'a> {\n type SchemaIterator: Iterator<Item = (Option<String>, &'a Schema)>;\n fn walk(&'a self) -> Self::SchemaIterator;\n}\n\nimpl<'a> SchemaWalker<'a> for OpenAPI {\n type SchemaIterator = std::vec::IntoIter<(Option<String>, &'a Schema)>;\n\n fn walk(&'a self) -> Self::SchemaIterator {\n self.paths\n .iter()\n .flat_map(|(_, path)| path.walk())\n .chain(self.components.walk())\n .collect::<Vec<_>>()\n .into_iter()\n }\n}\n\nimpl<'a, T> SchemaWalker<'a> for ReferenceOr<T>\nwhere\n T: SchemaWalker<'a>,\n{\n type SchemaIterator = std::vec::IntoIter<(Option<String>, &'a Schema)>;\n\n fn walk(&'a self) -> Self::SchemaIterator {\n match self {\n ReferenceOr::Reference { .. } => Vec::<(Option<String>, &Schema)>::new().into_iter(),\n ReferenceOr::Item(walker) => walker.walk().collect::<Vec<_>>().into_iter(),\n }\n }\n}\n\nimpl<'a, T> SchemaWalker<'a> for Option<T>\nwhere\n T: SchemaWalker<'a>,\n{\n type SchemaIterator = std::vec::IntoIter<(Option<String>, &'a Schema)>;\n\n "},"suffix":{"kind":"string","value":"\n}\n\nimpl<'a> SchemaWalker<'a> for IndexMap<String, ReferenceOr<Schema>> {\n type SchemaIterator = std::vec::IntoIter<(Option<String>, &'a Schema)>;\n\n fn walk(&'a self) -> Self::SchemaIterator {\n self.iter()\n .flat_map(|(key, value)| {\n value\n .walk()\n .map(|(_, schema)| (Some(key.clone()), schema))\n .collect::<Vec<_>>()\n .into_iter()\n })\n .collect::<Vec<_>>()\n .into_iter()\n }\n}\n\nimpl<'a, K> SchemaWalker<'a> for IndexMap<K, MediaType> {\n type SchemaIterator = std::vec::IntoIter<(Option<String>, &'a Schema)>;\n\n fn walk(&'a self) -> Self::SchemaIterator {\n self.iter()\n .flat_map(|(_key, value)| value.walk())\n .collect::<Vec<_>>()\n .into_iter()\n }\n}\n\nimpl<'a, K> SchemaWalker<'a> for IndexMap<K, ReferenceOr<Response>> {\n type SchemaIterator = std::vec::IntoIter<(Option<String>, &'a Schema)>;\n\n fn walk(&'a self) -> Self::SchemaIterator {\n self.iter()\n .flat_map(|(_key, value)| value.walk())\n .collect::<Vec<_>>()\n .into_iter()\n }\n}\n\nimpl<'a> SchemaWalker<'a> for PathItem {\n type SchemaIterator = std::vec::IntoIter<(Option<String>, &'a Schema)>;\n\n fn walk(&'a self) -> Self::SchemaIterator {\n self.iter()\n .flat_map(|(_, op)| SchemaWalker::walk(op))\n .chain(self.parameters.iter().flat_map(SchemaWalker::walk))\n .collect::<Vec<_>>()\n .into_iter()\n }\n}\n\nimpl<'a> SchemaWalker<'a> for Operation {\n type SchemaIterator = std::vec::IntoIter<(Option<String>, &'a Schema)>;\n\n fn walk(&'a self) -> Self::SchemaIterator {\n self.parameters\n .iter()\n .flat_map(SchemaWalker::walk)\n .chain(self.request_body.walk())\n .chain(self.responses.default.walk())\n .chain(self.responses.responses.walk())\n .collect::<Vec<_>>()\n .into_iter()\n }\n}\n\nimpl<'a> SchemaWalker<'a> for Components {\n type SchemaIterator = std::vec::IntoIter<(Option<String>, &'a Schema)>;\n\n fn walk(&'a self) -> Self::SchemaIterator {\n self.responses\n .walk()\n .chain(\n self.parameters\n .iter()\n .flat_map(|(_, parameter)| parameter.walk()),\n )\n .chain(\n self.request_bodies\n .iter()\n .flat_map(|(_, request_body)| request_body.walk()),\n )\n .chain(self.schemas.walk())\n .collect::<Vec<_>>()\n .into_iter()\n }\n}\n\nimpl<'a> SchemaWalker<'a> for Response {\n type SchemaIterator = <IndexMap<String, MediaType> as SchemaWalker<'a>>::SchemaIterator;\n\n fn walk(&'a self) -> Self::SchemaIterator {\n self.content.walk()\n }\n}\n\nimpl<'a> SchemaWalker<'a> for MediaType {\n type SchemaIterator = <Option<Schema> as SchemaWalker<'a>>::SchemaIterator;\n\n fn walk(&'a self) -> Self::SchemaIterator {\n self.schema.walk()\n }\n}\n\nimpl<'a> SchemaWalker<'a> for Parameter {\n type SchemaIterator = std::vec::IntoIter<(Option<String>, &'a Schema)>;\n\n fn walk(&'a self) -> Self::SchemaIterator {\n match self {\n Parameter::Query { parameter_data, .. } => parameter_data,\n Parameter::Header { parameter_data, .. } => parameter_data,\n Parameter::Path { parameter_data, .. } => parameter_data,\n Parameter::Cookie { parameter_data, .. } => parameter_data,\n }\n .format\n .walk()\n }\n}\n\nimpl<'a> SchemaWalker<'a> for ParameterSchemaOrContent {\n type SchemaIterator = std::vec::IntoIter<(Option<String>, &'a Schema)>;\n\n fn walk(&'a self) -> Self::SchemaIterator {\n match self {\n ParameterSchemaOrContent::Schema(schema) => {\n schema.walk().collect::<Vec<_>>().into_iter()\n }\n ParameterSchemaOrContent::Content(content) => {\n content.walk().collect::<Vec<_>>().into_iter()\n }\n }\n }\n}\n\nimpl<'a> SchemaWalker<'a> for RequestBody {\n type SchemaIterator = std::vec::IntoIter<(Option<String>, &'a Schema)>;\n\n fn walk(&'a self) -> Self::SchemaIterator {\n self.content.walk()\n }\n}\n\nimpl<'a> SchemaWalker<'a> for Schema {\n type SchemaIterator = std::iter::Once<(Option<String>, &'a Schema)>;\n\n fn walk(&'a self) -> Self::SchemaIterator {\n \n \n \n\n std::iter::once((None, self))\n }\n}\n"},"middle":{"kind":"string","value":"fn walk(&'a self) -> Self::SchemaIterator {\n match self {\n None => Vec::<(Option<String>, &Schema)>::new().into_iter(),\n Some(walker) => walker.walk().collect::<Vec<_>>().into_iter(),\n }\n }"},"strategy":{"kind":"string","value":"function_block-full_function"},"context_items":{"kind":"list like","value":[{"content":"trait ComponentLookup: Sized {\n\n fn get_components(components: &Components) -> &IndexMap<String, ReferenceOr<Self>>;\n\n}\n\n\n\nimpl<T: ComponentLookup> ReferenceOrExt<T> for openapiv3::ReferenceOr<T> {\n\n fn item<'a>(&'a self, components: &'a Option<Components>) -> Option<&'a T> {\n\n match self {\n\n ReferenceOr::Item(item) => Some(item),\n\n ReferenceOr::Reference { reference } => {\n\n let idx = reference.rfind('/').unwrap();\n\n let key = &reference[idx + 1..];\n\n let parameters = T::get_components(components.as_ref().unwrap());\n\n parameters.get(key).unwrap().item(components)\n\n }\n\n }\n\n }\n\n}\n\n\n\nimpl ComponentLookup for Parameter {\n\n fn get_components(components: &Components) -> &IndexMap<String, ReferenceOr<Self>> {\n","file_path":"src/lib.rs","rank":0,"score":35618.954072413435},{"content":"trait ReferenceOrExt<T: ComponentLookup> {\n\n fn item<'a>(&'a self, components: &'a Option<Components>) -> Option<&'a T>;\n\n}\n","file_path":"src/lib.rs","rank":1,"score":31676.782139688145},{"content":"pub fn validate(spec: &OpenAPI) -> Vec<String> {\n\n Validator::default().validate(spec)\n\n}\n\n\n","file_path":"src/lib.rs","rank":2,"score":22286.058919276235},{"content":"# openapi-lint\n\n\n\nThis is a simple crate to validate OpenAPI v3.0.3 content. It flags constructs\n\nthat we've determined are not \"ergonomic\" or \"well-designed\". In particular we\n\ntry to avoid constructs that lead to structures that SDK generators would have\n\na hard time turning into easy-to-use native constructs.\n\n\n\n## Rules\n\n\n\n### Type mismatch\n\n\n\nA schema that describes a type may include subschemas where one, all, or any of\n\nthe subschemas might match ( for the `oneOf`, `allOf`, and `anyOf` fields\n\nrespectively). For example, the following Rust code produces such a schema with\n\nmixed types:\n\n\n\n```rust\n\n#[derive(JsonSchema)]\n\npub enum E {\n\n ThingA(String),\n\n ThingB,\n\n}\n\n```\n\n\n\nA JSON object that used this `enum` for the type of a field could look like this:\n\n\n\n```json\n\n{\n\n \"field\": { \"ThingA\": \"some value\" }\n\n}\n\n```\n\n\n\nor this:\n\n\n\n```json\n\n{\n\n \"field\": \"ThingB\"\n\n}\n\n```\n\n\n\nSo `field` may be either a string **or** an object. This complicates the\n\ndescription of these types and is harder to represent in SDKs (in particular\n\nthose without Rust's ability for enums to have associated values). To avoid\n\nthis, we can simply use `serde`'s facility for annotating enums. In particular,\n\nwe prefer [\"adjacently\n\ntagged\"](https://serde.rs/container-attrs.html#tag--content) enums:\n\n\n\n```rust\n\n#[derive(JsonSchema)]\n\n#[serde(tag = \"type\", content = \"value\")]\n\npub enum E {\n\n ThingA(String),\n\n ThingB,\n\n}\n\n```\n\n\n\nThis produces JSON like this:\n\n\n\n```json\n\n{\n\n \"field1\": { \"type\": \"ThingA\", \"value\": \"some value\" },\n\n \"field2\": { \"type\": \"ThingB\" }\n\n}\n\n```\n\n\n\n### Naming\n\n\n\nIn general, we use the typical Rust naming conventions.\n\n\n\n- All type names should be PascalCase.\n\n- All `operation_id`s should be snake_case.\n\n- All operation properties should be snake_case\n\n- All struct (and struct enum variant) members should be snake_case.\n\n\n\nType names are already PascalCase by normal Rust conventions. If you need\n\n(really?) to have a type with a non-PascalCase name, you can renamed it like\n","file_path":"README.md","rank":3,"score":9620.523508944687},{"content":"this:\n\n\n\n```rust\n\n#[derive(JsonSchema)]\n\n#[allow(non_camel_case_types)]\n\n#[serde(rename = \"IllumosButUpperCase\")]\n\nstruct illumosIsAlwaysLowerCaseIGuess {\n\n // ...\n\n}\n\n```\n\n\n\nOperation IDs come from the function name. If you obey the normal Rust\n\nconvention, your functions are already snake_case. There isn't currently a\n\nfacility to change the operation name; file an issue in\n","file_path":"README.md","rank":4,"score":9618.134029731287},{"content":" \"problem with type {}: {}\",\n\n name.unwrap_or_else(|| \"<unknown>\".to_string()),\n\n msg\n\n )\n\n })\n\n .into_iter()\n\n .chain(self.validate_object_camel_case(schema))\n\n });\n\n\n\n let operations = spec\n\n .operations()\n\n .filter_map(|path_method_op| self.validate_operation_id(path_method_op));\n\n let parameters = spec\n\n .operations()\n\n .flat_map(|(_, _, op)| self.validate_operation_parameters(spec, op));\n\n let named_schemas = spec.components.iter().flat_map(|components| {\n\n components\n\n .schemas\n\n .keys()\n\n .filter_map(|type_name| self.validate_named_schema(type_name))\n","file_path":"src/lib.rs","rank":7,"score":9.426650119476218},{"content":" &components.parameters\n\n }\n\n}\n\n\n\nimpl ComponentLookup for Schema {\n\n fn get_components(components: &Components) -> &IndexMap<String, ReferenceOr<Self>> {\n\n &components.schemas\n\n }\n\n}\n\n\n\n#[cfg(test)]\n\nmod tests {\n\n use crate::{validate, Validator};\n\n\n\n #[test]\n\n fn bad_schema() {\n\n let openapi = serde_json::from_str(include_str!(\"tests/errors.json\")).unwrap();\n\n\n\n let actual = validate(&openapi).join(\"\\n\\n\");\n\n expectorate::assert_contents(\"src/tests/errors.out\", &actual);\n","file_path":"src/lib.rs","rank":8,"score":8.427637153887922},{"content":"// Copyright 2022 Oxide Computer Company\n\n\n\n//! This is a simple crate to validate OpenAPI v3.0.3 content. It flags\n\n//! constructs that we've determined are not \"ergonomic\" or \"well-designed\". In\n\n//! particular we try to avoid constructs that lead to structures that SDK\n\n//! generators would have a hard time turning into easy-to-use native\n\n//! constructs.\n\n\n\nuse convert_case::{Boundary, Case, Casing, Converter};\n\nuse indexmap::IndexMap;\n\nuse openapiv3::{Components, OpenAPI, Operation, Parameter, ReferenceOr, Schema, Type};\n\n\n\nmod walker;\n\n\n\nuse walker::SchemaWalker;\n\n\n","file_path":"src/lib.rs","rank":9,"score":8.370020264088161},{"content":"\n\n fn subschemas<'a>(&self, spec: &'a OpenAPI, schema: &'a Schema) -> Vec<&'a Type> {\n\n match &schema.schema_kind {\n\n openapiv3::SchemaKind::OneOf { one_of: ofs }\n\n | openapiv3::SchemaKind::AllOf { all_of: ofs }\n\n | openapiv3::SchemaKind::AnyOf { any_of: ofs } => ofs\n\n .iter()\n\n .flat_map(|subschema| {\n\n self.subschemas(spec, subschema.item(&spec.components).unwrap())\n\n })\n\n .collect(),\n\n openapiv3::SchemaKind::Not { .. } => todo!(),\n\n openapiv3::SchemaKind::Type(t) => vec![t],\n\n openapiv3::SchemaKind::Any(_) => todo!(),\n\n }\n\n }\n\n\n\n fn validate_object_camel_case(&self, schema: &Schema) -> Vec<String> {\n\n let mut ret = Vec::new();\n\n\n","file_path":"src/lib.rs","rank":10,"score":8.122161490683165},{"content":" });\n\n\n\n schema\n\n .chain(operations)\n\n .chain(parameters)\n\n .chain(named_schemas)\n\n .collect()\n\n }\n\n\n\n fn validate_subschemas(&self, spec: &OpenAPI, schema: &Schema) -> Option<String> {\n\n let subschemas = self.subschemas(spec, schema);\n\n let mut iter = subschemas.into_iter();\n\n\n\n const PRE: &str = \"mismatched types between subschemas; this is often \\\n\n due to enums with different data payloads and can be resolved using serde \\\n\n adjacent tagging.\";\n\n const POST: &str = \"For more info, see \\\n\n https://github.com/oxidecomputer/openapi-lint#type-mismatch\";\n\n\n\n if let Some(first) = iter.next() {\n","file_path":"src/lib.rs","rank":13,"score":7.095590064049411},{"content":" }\n\n }\n\n\n\n fn validate_operation_parameters(&self, spec: &OpenAPI, op: &Operation) -> Vec<String> {\n\n const INFO: &str = \"For more info, see \\\n\n https://github.com/oxidecomputer/openapi-lint#naming\";\n\n\n\n let operation_id = op.operation_id.as_deref().unwrap_or(\"<unknown>\");\n\n op.parameters\n\n .iter()\n\n .filter_map(|ref_or_param| {\n\n let param = ref_or_param.item(&spec.components)?;\n\n\n\n let name = ¶m.parameter_data_ref().name;\n\n let snake = self.snakifier.convert(name);\n\n\n\n if name.as_str() != snake {\n\n Some(format!(\n\n \"The parameter \\\"{}\\\" to {} should be snake_case.\\n{}\",\n\n name, operation_id, INFO,\n","file_path":"src/lib.rs","rank":16,"score":6.740300860354111},{"content":" for ty in iter {\n\n match (first, ty) {\n\n (Type::String(_), Type::String(_))\n\n | (Type::Number(_), Type::Number(_))\n\n | (Type::Integer(_), Type::Integer(_))\n\n | (Type::Object(_), Type::Object(_))\n\n | (Type::Array(_), Type::Array(_))\n\n | (Type::Boolean {}, Type::Boolean {}) => {}\n\n (a, b) => {\n\n return Some(format!(\n\n \"{}\\nthis schema's type\\n{:#?}\\ndiffers from this\\n{:#?}\\n\\n{}\",\n\n PRE, a, b, POST,\n\n ))\n\n }\n\n }\n\n }\n\n }\n\n\n\n None\n\n }\n","file_path":"src/lib.rs","rank":19,"score":5.749700144417176},{"content":" fn validate_operation_id(&self, path_method_op: (&str, &str, &Operation)) -> Option<String> {\n\n let (path, method, op) = path_method_op;\n\n\n\n const INFO: &str = \"For more info, see \\\n\n https://github.com/oxidecomputer/openapi-lint#naming\";\n\n\n\n if let Some(operation_id) = &op.operation_id {\n\n let snake = self.snakifier.convert(operation_id);\n\n if operation_id.as_str() == snake {\n\n return None;\n\n }\n\n Some(format!(\n\n \"The operation for {} {} is named \\\"{}\\\" which is not snake_case\\n{}\",\n\n path, method, operation_id, INFO,\n\n ))\n\n } else {\n\n Some(format!(\n\n \"The operation for {} {} does not have an operation_id\\n{}\",\n\n path, method, INFO,\n\n ))\n","file_path":"src/lib.rs","rank":20,"score":5.666404386754406},{"content":" if let openapiv3::SchemaKind::Type(Type::Object(obj)) = &schema.schema_kind {\n\n for prop_name in obj.properties.keys() {\n\n let snake = self.snakifier.convert(prop_name);\n\n if prop_name.clone() != snake {\n\n ret.push(format!(\n\n \"an object contains a property '{}' which is not \\\n\n snake_case:\\n{:#?}\\n\\\n\n Add #[serde(rename = \\\"{}\\\")] to the member or \\\n\n #[serde(rename_all = \\\"snake_case\\\")] to the struct.\\n\\\n\n For more info see \\\n\n https://github.com/oxidecomputer/openapi-lint#naming\",\n\n prop_name, schema, snake\n\n ))\n\n }\n\n }\n\n }\n\n\n\n ret\n\n }\n\n\n","file_path":"src/lib.rs","rank":23,"score":5.086125757044144},{"content":" ))\n\n } else {\n\n None\n\n }\n\n })\n\n .collect()\n\n }\n\n\n\n fn validate_named_schema(&self, type_name: &str) -> Option<String> {\n\n const INFO: &str = \"For more info, see \\\n\n https://github.com/oxidecomputer/openapi-lint#naming\";\n\n\n\n let pascal = type_name.to_case(Case::Pascal);\n\n if type_name == pascal {\n\n return None;\n\n }\n\n\n\n Some(format!(\n\n \"The type \\\"{}\\\" has a name that is not PascalCase; to rename it add \\\n\n #[serde(rename = \\\"{}\\\")]\\n{}\",\n\n type_name, pascal, INFO,\n\n ))\n\n }\n\n}\n\n\n","file_path":"src/lib.rs","rank":24,"score":2.042962908448616}],"string":"[\n {\n \"content\": \"trait ComponentLookup: Sized {\\n\\n fn get_components(components: &Components) -> &IndexMap<String, ReferenceOr<Self>>;\\n\\n}\\n\\n\\n\\nimpl<T: ComponentLookup> ReferenceOrExt<T> for openapiv3::ReferenceOr<T> {\\n\\n fn item<'a>(&'a self, components: &'a Option<Components>) -> Option<&'a T> {\\n\\n match self {\\n\\n ReferenceOr::Item(item) => Some(item),\\n\\n ReferenceOr::Reference { reference } => {\\n\\n let idx = reference.rfind('/').unwrap();\\n\\n let key = &reference[idx + 1..];\\n\\n let parameters = T::get_components(components.as_ref().unwrap());\\n\\n parameters.get(key).unwrap().item(components)\\n\\n }\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\nimpl ComponentLookup for Parameter {\\n\\n fn get_components(components: &Components) -> &IndexMap<String, ReferenceOr<Self>> {\\n\",\n \"file_path\": \"src/lib.rs\",\n \"rank\": 0,\n \"score\": 35618.954072413435\n },\n {\n \"content\": \"trait ReferenceOrExt<T: ComponentLookup> {\\n\\n fn item<'a>(&'a self, components: &'a Option<Components>) -> Option<&'a T>;\\n\\n}\\n\",\n \"file_path\": \"src/lib.rs\",\n \"rank\": 1,\n \"score\": 31676.782139688145\n },\n {\n \"content\": \"pub fn validate(spec: &OpenAPI) -> Vec<String> {\\n\\n Validator::default().validate(spec)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/lib.rs\",\n \"rank\": 2,\n \"score\": 22286.058919276235\n },\n {\n \"content\": \"# openapi-lint\\n\\n\\n\\nThis is a simple crate to validate OpenAPI v3.0.3 content. It flags constructs\\n\\nthat we've determined are not \\\"ergonomic\\\" or \\\"well-designed\\\". In particular we\\n\\ntry to avoid constructs that lead to structures that SDK generators would have\\n\\na hard time turning into easy-to-use native constructs.\\n\\n\\n\\n## Rules\\n\\n\\n\\n### Type mismatch\\n\\n\\n\\nA schema that describes a type may include subschemas where one, all, or any of\\n\\nthe subschemas might match ( for the `oneOf`, `allOf`, and `anyOf` fields\\n\\nrespectively). For example, the following Rust code produces such a schema with\\n\\nmixed types:\\n\\n\\n\\n```rust\\n\\n#[derive(JsonSchema)]\\n\\npub enum E {\\n\\n ThingA(String),\\n\\n ThingB,\\n\\n}\\n\\n```\\n\\n\\n\\nA JSON object that used this `enum` for the type of a field could look like this:\\n\\n\\n\\n```json\\n\\n{\\n\\n \\\"field\\\": { \\\"ThingA\\\": \\\"some value\\\" }\\n\\n}\\n\\n```\\n\\n\\n\\nor this:\\n\\n\\n\\n```json\\n\\n{\\n\\n \\\"field\\\": \\\"ThingB\\\"\\n\\n}\\n\\n```\\n\\n\\n\\nSo `field` may be either a string **or** an object. This complicates the\\n\\ndescription of these types and is harder to represent in SDKs (in particular\\n\\nthose without Rust's ability for enums to have associated values). To avoid\\n\\nthis, we can simply use `serde`'s facility for annotating enums. In particular,\\n\\nwe prefer [\\\"adjacently\\n\\ntagged\\\"](https://serde.rs/container-attrs.html#tag--content) enums:\\n\\n\\n\\n```rust\\n\\n#[derive(JsonSchema)]\\n\\n#[serde(tag = \\\"type\\\", content = \\\"value\\\")]\\n\\npub enum E {\\n\\n ThingA(String),\\n\\n ThingB,\\n\\n}\\n\\n```\\n\\n\\n\\nThis produces JSON like this:\\n\\n\\n\\n```json\\n\\n{\\n\\n \\\"field1\\\": { \\\"type\\\": \\\"ThingA\\\", \\\"value\\\": \\\"some value\\\" },\\n\\n \\\"field2\\\": { \\\"type\\\": \\\"ThingB\\\" }\\n\\n}\\n\\n```\\n\\n\\n\\n### Naming\\n\\n\\n\\nIn general, we use the typical Rust naming conventions.\\n\\n\\n\\n- All type names should be PascalCase.\\n\\n- All `operation_id`s should be snake_case.\\n\\n- All operation properties should be snake_case\\n\\n- All struct (and struct enum variant) members should be snake_case.\\n\\n\\n\\nType names are already PascalCase by normal Rust conventions. If you need\\n\\n(really?) to have a type with a non-PascalCase name, you can renamed it like\\n\",\n \"file_path\": \"README.md\",\n \"rank\": 3,\n \"score\": 9620.523508944687\n },\n {\n \"content\": \"this:\\n\\n\\n\\n```rust\\n\\n#[derive(JsonSchema)]\\n\\n#[allow(non_camel_case_types)]\\n\\n#[serde(rename = \\\"IllumosButUpperCase\\\")]\\n\\nstruct illumosIsAlwaysLowerCaseIGuess {\\n\\n // ...\\n\\n}\\n\\n```\\n\\n\\n\\nOperation IDs come from the function name. If you obey the normal Rust\\n\\nconvention, your functions are already snake_case. There isn't currently a\\n\\nfacility to change the operation name; file an issue in\\n\",\n \"file_path\": \"README.md\",\n \"rank\": 4,\n \"score\": 9618.134029731287\n },\n {\n \"content\": \" \\\"problem with type {}: {}\\\",\\n\\n name.unwrap_or_else(|| \\\"<unknown>\\\".to_string()),\\n\\n msg\\n\\n )\\n\\n })\\n\\n .into_iter()\\n\\n .chain(self.validate_object_camel_case(schema))\\n\\n });\\n\\n\\n\\n let operations = spec\\n\\n .operations()\\n\\n .filter_map(|path_method_op| self.validate_operation_id(path_method_op));\\n\\n let parameters = spec\\n\\n .operations()\\n\\n .flat_map(|(_, _, op)| self.validate_operation_parameters(spec, op));\\n\\n let named_schemas = spec.components.iter().flat_map(|components| {\\n\\n components\\n\\n .schemas\\n\\n .keys()\\n\\n .filter_map(|type_name| self.validate_named_schema(type_name))\\n\",\n \"file_path\": \"src/lib.rs\",\n \"rank\": 7,\n \"score\": 9.426650119476218\n },\n {\n \"content\": \" &components.parameters\\n\\n }\\n\\n}\\n\\n\\n\\nimpl ComponentLookup for Schema {\\n\\n fn get_components(components: &Components) -> &IndexMap<String, ReferenceOr<Self>> {\\n\\n &components.schemas\\n\\n }\\n\\n}\\n\\n\\n\\n#[cfg(test)]\\n\\nmod tests {\\n\\n use crate::{validate, Validator};\\n\\n\\n\\n #[test]\\n\\n fn bad_schema() {\\n\\n let openapi = serde_json::from_str(include_str!(\\\"tests/errors.json\\\")).unwrap();\\n\\n\\n\\n let actual = validate(&openapi).join(\\\"\\\\n\\\\n\\\");\\n\\n expectorate::assert_contents(\\\"src/tests/errors.out\\\", &actual);\\n\",\n \"file_path\": \"src/lib.rs\",\n \"rank\": 8,\n \"score\": 8.427637153887922\n },\n {\n \"content\": \"// Copyright 2022 Oxide Computer Company\\n\\n\\n\\n//! This is a simple crate to validate OpenAPI v3.0.3 content. It flags\\n\\n//! constructs that we've determined are not \\\"ergonomic\\\" or \\\"well-designed\\\". In\\n\\n//! particular we try to avoid constructs that lead to structures that SDK\\n\\n//! generators would have a hard time turning into easy-to-use native\\n\\n//! constructs.\\n\\n\\n\\nuse convert_case::{Boundary, Case, Casing, Converter};\\n\\nuse indexmap::IndexMap;\\n\\nuse openapiv3::{Components, OpenAPI, Operation, Parameter, ReferenceOr, Schema, Type};\\n\\n\\n\\nmod walker;\\n\\n\\n\\nuse walker::SchemaWalker;\\n\\n\\n\",\n \"file_path\": \"src/lib.rs\",\n \"rank\": 9,\n \"score\": 8.370020264088161\n },\n {\n \"content\": \"\\n\\n fn subschemas<'a>(&self, spec: &'a OpenAPI, schema: &'a Schema) -> Vec<&'a Type> {\\n\\n match &schema.schema_kind {\\n\\n openapiv3::SchemaKind::OneOf { one_of: ofs }\\n\\n | openapiv3::SchemaKind::AllOf { all_of: ofs }\\n\\n | openapiv3::SchemaKind::AnyOf { any_of: ofs } => ofs\\n\\n .iter()\\n\\n .flat_map(|subschema| {\\n\\n self.subschemas(spec, subschema.item(&spec.components).unwrap())\\n\\n })\\n\\n .collect(),\\n\\n openapiv3::SchemaKind::Not { .. } => todo!(),\\n\\n openapiv3::SchemaKind::Type(t) => vec![t],\\n\\n openapiv3::SchemaKind::Any(_) => todo!(),\\n\\n }\\n\\n }\\n\\n\\n\\n fn validate_object_camel_case(&self, schema: &Schema) -> Vec<String> {\\n\\n let mut ret = Vec::new();\\n\\n\\n\",\n \"file_path\": \"src/lib.rs\",\n \"rank\": 10,\n \"score\": 8.122161490683165\n },\n {\n \"content\": \" });\\n\\n\\n\\n schema\\n\\n .chain(operations)\\n\\n .chain(parameters)\\n\\n .chain(named_schemas)\\n\\n .collect()\\n\\n }\\n\\n\\n\\n fn validate_subschemas(&self, spec: &OpenAPI, schema: &Schema) -> Option<String> {\\n\\n let subschemas = self.subschemas(spec, schema);\\n\\n let mut iter = subschemas.into_iter();\\n\\n\\n\\n const PRE: &str = \\\"mismatched types between subschemas; this is often \\\\\\n\\n due to enums with different data payloads and can be resolved using serde \\\\\\n\\n adjacent tagging.\\\";\\n\\n const POST: &str = \\\"For more info, see \\\\\\n\\n https://github.com/oxidecomputer/openapi-lint#type-mismatch\\\";\\n\\n\\n\\n if let Some(first) = iter.next() {\\n\",\n \"file_path\": \"src/lib.rs\",\n \"rank\": 13,\n \"score\": 7.095590064049411\n },\n {\n \"content\": \" }\\n\\n }\\n\\n\\n\\n fn validate_operation_parameters(&self, spec: &OpenAPI, op: &Operation) -> Vec<String> {\\n\\n const INFO: &str = \\\"For more info, see \\\\\\n\\n https://github.com/oxidecomputer/openapi-lint#naming\\\";\\n\\n\\n\\n let operation_id = op.operation_id.as_deref().unwrap_or(\\\"<unknown>\\\");\\n\\n op.parameters\\n\\n .iter()\\n\\n .filter_map(|ref_or_param| {\\n\\n let param = ref_or_param.item(&spec.components)?;\\n\\n\\n\\n let name = ¶m.parameter_data_ref().name;\\n\\n let snake = self.snakifier.convert(name);\\n\\n\\n\\n if name.as_str() != snake {\\n\\n Some(format!(\\n\\n \\\"The parameter \\\\\\\"{}\\\\\\\" to {} should be snake_case.\\\\n{}\\\",\\n\\n name, operation_id, INFO,\\n\",\n \"file_path\": \"src/lib.rs\",\n \"rank\": 16,\n \"score\": 6.740300860354111\n },\n {\n \"content\": \" for ty in iter {\\n\\n match (first, ty) {\\n\\n (Type::String(_), Type::String(_))\\n\\n | (Type::Number(_), Type::Number(_))\\n\\n | (Type::Integer(_), Type::Integer(_))\\n\\n | (Type::Object(_), Type::Object(_))\\n\\n | (Type::Array(_), Type::Array(_))\\n\\n | (Type::Boolean {}, Type::Boolean {}) => {}\\n\\n (a, b) => {\\n\\n return Some(format!(\\n\\n \\\"{}\\\\nthis schema's type\\\\n{:#?}\\\\ndiffers from this\\\\n{:#?}\\\\n\\\\n{}\\\",\\n\\n PRE, a, b, POST,\\n\\n ))\\n\\n }\\n\\n }\\n\\n }\\n\\n }\\n\\n\\n\\n None\\n\\n }\\n\",\n \"file_path\": \"src/lib.rs\",\n \"rank\": 19,\n \"score\": 5.749700144417176\n },\n {\n \"content\": \" fn validate_operation_id(&self, path_method_op: (&str, &str, &Operation)) -> Option<String> {\\n\\n let (path, method, op) = path_method_op;\\n\\n\\n\\n const INFO: &str = \\\"For more info, see \\\\\\n\\n https://github.com/oxidecomputer/openapi-lint#naming\\\";\\n\\n\\n\\n if let Some(operation_id) = &op.operation_id {\\n\\n let snake = self.snakifier.convert(operation_id);\\n\\n if operation_id.as_str() == snake {\\n\\n return None;\\n\\n }\\n\\n Some(format!(\\n\\n \\\"The operation for {} {} is named \\\\\\\"{}\\\\\\\" which is not snake_case\\\\n{}\\\",\\n\\n path, method, operation_id, INFO,\\n\\n ))\\n\\n } else {\\n\\n Some(format!(\\n\\n \\\"The operation for {} {} does not have an operation_id\\\\n{}\\\",\\n\\n path, method, INFO,\\n\\n ))\\n\",\n \"file_path\": \"src/lib.rs\",\n \"rank\": 20,\n \"score\": 5.666404386754406\n },\n {\n \"content\": \" if let openapiv3::SchemaKind::Type(Type::Object(obj)) = &schema.schema_kind {\\n\\n for prop_name in obj.properties.keys() {\\n\\n let snake = self.snakifier.convert(prop_name);\\n\\n if prop_name.clone() != snake {\\n\\n ret.push(format!(\\n\\n \\\"an object contains a property '{}' which is not \\\\\\n\\n snake_case:\\\\n{:#?}\\\\n\\\\\\n\\n Add #[serde(rename = \\\\\\\"{}\\\\\\\")] to the member or \\\\\\n\\n #[serde(rename_all = \\\\\\\"snake_case\\\\\\\")] to the struct.\\\\n\\\\\\n\\n For more info see \\\\\\n\\n https://github.com/oxidecomputer/openapi-lint#naming\\\",\\n\\n prop_name, schema, snake\\n\\n ))\\n\\n }\\n\\n }\\n\\n }\\n\\n\\n\\n ret\\n\\n }\\n\\n\\n\",\n \"file_path\": \"src/lib.rs\",\n \"rank\": 23,\n \"score\": 5.086125757044144\n },\n {\n \"content\": \" ))\\n\\n } else {\\n\\n None\\n\\n }\\n\\n })\\n\\n .collect()\\n\\n }\\n\\n\\n\\n fn validate_named_schema(&self, type_name: &str) -> Option<String> {\\n\\n const INFO: &str = \\\"For more info, see \\\\\\n\\n https://github.com/oxidecomputer/openapi-lint#naming\\\";\\n\\n\\n\\n let pascal = type_name.to_case(Case::Pascal);\\n\\n if type_name == pascal {\\n\\n return None;\\n\\n }\\n\\n\\n\\n Some(format!(\\n\\n \\\"The type \\\\\\\"{}\\\\\\\" has a name that is not PascalCase; to rename it add \\\\\\n\\n #[serde(rename = \\\\\\\"{}\\\\\\\")]\\\\n{}\\\",\\n\\n type_name, pascal, INFO,\\n\\n ))\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/lib.rs\",\n \"rank\": 24,\n \"score\": 2.042962908448616\n }\n]","isConversational":false}}},{"rowIdx":2383,"cells":{"lang":{"kind":"string","value":"Rust"},"file_path":{"kind":"string","value":"native-windows-gui/src/controls/notice.rs"},"repo_name":{"kind":"string","value":"gyk/native-windows-gui"},"commit":{"kind":"string","value":"163d0fcb5c2af8a859f603ce23a7ec218e9b6813"},"file_code":{"kind":"string","value":"use super::control_handle::ControlHandle;\nuse crate::win32::{window::build_notice, window_helper as wh};\nuse crate::NwgError;\n\nconst NOT_BOUND: &str = \"Notice is not yet bound to a winapi object\";\nconst UNUSABLE_NOTICE: &str = \"Notice parent window was freed\";\nconst BAD_HANDLE: &str = \"INTERNAL ERROR: Notice handle is not Notice!\";\n\n/**\nAn invisible component that can be triggered by other thread.\n\nA notice object does not send data between threads. Rust has already plenty of way to do this.\nThe notice object only serve to \"wake up\" the GUI thread.\n\nA notice must have a parent window. If the parent is destroyed before the notice, the notice becomes invalid.\n\nRequires the `notice` feature.\n\n## Example\n\n```rust\nuse native_windows_gui as nwg;\nfn build_notice(notice: &mut nwg::Notice, window: &nwg::Window) {\n nwg::Notice::builder()\n .parent(window)\n .build(notice);\n}\n```\n\n```rust\nuse native_windows_gui as nwg;\nuse std::thread;\nuse std::time;\n\nfn notice(noticer: &nwg::Notice) {\n let sender = noticer.sender();\n\n thread::spawn(move || {\n thread::sleep(time::Duration::new(5, 0));\n sender.notice();\n });\n}\n\n```\n\n*/\n#[derive(Default, PartialEq, Eq)]\npub struct Notice {\n pub handle: ControlHandle,\n}\n\nimpl Notice {\n pub fn builder() -> NoticeBuilder {\n NoticeBuilder { parent: None }\n }\n\n \n pub fn create<C: Into<ControlHandle>>(parent: C) -> Result<Notice, NwgError> {\n let mut notice = Self::default();\n Self::builder().parent(parent).build(&mut notice)?;\n\n Ok(notice)\n }\n\n \n \n pub fn valid(&self) -> bool {\n if self.handle.blank() {\n return false;\n }\n let (hwnd, _) = self.handle.notice().expect(BAD_HANDLE);\n wh::window_valid(hwnd)\n }\n\n \n pub fn window_handle(&self) -> Option<ControlHandle> {\n match self.valid() {\n true => Some(ControlHandle::Hwnd(self.handle.notice().unwrap().0)),\n false => None,\n }\n }\n\n \n \n pub fn set_window_handle<C: Into<ControlHandle>>(&mut self, window: C) {\n if self.handle.blank() {\n panic!(\"{}\", NOT_BOUND);\n }\n\n let hwnd = window\n .into()\n .hwnd()\n .expect(\"New notice parent is not a window control\");\n let (_, id) = self.handle.notice().expect(BAD_HANDLE);\n\n self.handle = ControlHandle::Notice(hwnd, id);\n }\n\n \n pub fn sender(&self) -> NoticeSender {\n if self.handle.blank() {\n panic!(\"{}\", NOT_BOUND);\n }\n if !self.valid() {\n panic!(\"{}\", UNUSABLE_NOTICE);\n }\n let (hwnd, id) = self.handle.notice().expect(BAD_HANDLE);\n\n NoticeSender {\n hwnd: hwnd as usize,\n id,\n }\n }\n}\n\nimpl Drop for Notice {\n fn drop(&mut self) {\n self.handle.destroy();\n }\n}\n\n#[derive(Clone, Copy)]\npub struct NoticeSender {\n hwnd: usize,\n id: u32,\n}\n\nimpl NoticeSender {\n \n pub fn notice(&self) {\n use winapi::shared::minwindef::{LPARAM, WPARAM};\n use winapi::shared::windef::HWND;\n use winapi::um::winuser::SendNotifyMessageW;\n\n unsafe {\n SendNotifyMessageW(\n self.hwnd as HWND,\n wh::NOTICE_MESSAGE,\n self.id as WPARAM,\n self.hwnd as LPARAM,\n );\n }\n }\n}\n\npub struct NoticeBuilder {\n parent: Option<ControlHandle>,\n}\n\nimpl NoticeBuilder {\n pub fn parent<C: Into<ControlHandle>>(mut self, p: C) -> NoticeBuilder {\n self.parent = Some(p.into());\n self\n }\n\n pub fn build(self, out: &mut Notice) -> Result<(), NwgError> {\n let parent = match self.parent {\n Some(p) => match p.hwnd() {\n Some(handle) => Ok(handle),\n None => Err(NwgError::control_create(\"Wrong parent type\")),\n },\n None => Err(NwgError::no_parent(\"Notice\")),\n }?;\n\n out.handle = build_notice(parent);\n\n Ok(())\n }\n}\n"},"prefix":{"kind":"string","value":"use super::control_handle::ControlHandle;\nuse crate::win32::{window::build_notice, window_helper as wh};\nuse crate::NwgError;\n\nconst NOT_BOUND: &str = \"Notice is not yet bound to a winapi object\";\nconst UNUSABLE_NOTICE: &str = \"Notice parent window was freed\";\nconst BAD_HANDLE: &str = \"INTERNAL ERROR: Notice handle is not Notice!\";\n\n/**\nAn invisible component that can be triggered by other thread.\n\nA notice object does not send data between threads. Rust has already plenty of way to do this.\nThe notice object only serve to \"wake up\" the GUI thread.\n\nA notice must have a parent window. If the parent is destroyed before the notice, the notice becomes invalid.\n\nRequires the `notice` feature.\n\n## Example\n\n```rust\nuse native_windows_gui as nwg;\nfn build_notice(notice: &mut nwg::Notice, window: &nwg::Window) {\n nwg::Notice::builder()\n .parent(window)\n .build(notice);\n}\n```\n\n```rust\nuse native_windows_gui as nwg;\nuse std::thread;\nuse std::time;\n\nfn notice(noticer: &nwg::Notice) {\n let sender = noticer.sender();\n\n thread::spawn(move || {\n thread::sleep(time::Duration::new(5, 0));\n sender.notice();\n });\n}\n\n```\n\n*/\n#[derive(Default, PartialEq, Eq)]\npub struct Notice {\n pub handle: ControlHandle,\n}\n\nimpl Notice {\n pub fn builder() -> NoticeBuilder {\n NoticeBuilder { parent: None }\n }\n\n \n pub fn create<C: Into<ControlHandle>>(parent: C) -> Result<Notice, NwgError> {\n let mut notice = Self::default();\n Self::builder().parent(parent).build(&mut notice)?;\n\n Ok(notice)\n }\n\n \n \n pub fn valid(&self) -> bool {\n if self.handle.blank() {\n return false;\n }\n let (hwnd, _) = self.handle.notice().expect(BAD_HANDLE);\n wh::window_valid(hwnd)\n }\n\n \n pub fn window_handle(&self) -> Option<ControlHandle> {\n match self.valid() {\n true => Some(ControlHandle::Hwnd(self.handle.notice().unwrap().0)),\n false => None,\n }\n }\n\n \n \n pub fn set_window_handle<C: Into<ControlHandle>>(&mut self, window: C) {\n if self.handle.blank() {\n panic!(\"{}\", NOT_BOUND);\n }\n\n let hwnd = window\n .into()\n .hwnd()\n .expect(\"New notice parent is not a window control\");\n let (_, id) = self.handle.notice().expect(BAD_HANDLE);\n\n self.handle = ControlHandle::Notice(hwnd, id);\n }\n\n \n pub fn sender(&self) -> NoticeSender {\n if self.handle.blank() {\n panic!(\"{}\", NOT_BOUND);\n }\n if !self.valid() {\n panic!(\"{}\", UNUSABLE_NOTICE);\n }\n let (hwnd, id) = self.handle.notice().expect(BAD_HANDLE);\n\n NoticeSender {\n hwnd: hwnd as usize,\n id,\n }\n }\n}\n\nimpl Drop for Notice {\n fn drop(&mut self) {\n self.handle.destroy();\n }\n}\n\n#[derive(Clone, Copy)]\npub struct NoticeSender {\n hwnd: usize,\n id: u32,\n}\n\nimpl NoticeSender {\n \n pub fn notice(&self) {\n use winapi::shared::minwindef::{LPARAM, WPARAM};\n use winapi::shared::windef::HWND;\n use winapi::um::winuser::SendNotifyMessageW;\n\n unsafe {\n SendNotifyMessageW(\n self.hwnd as HWND,\n wh::NOTICE_MESSAGE,\n self.id as WPARAM,\n self.hwnd as LPARAM,\n );\n }\n }\n}\n\npub struct NoticeBuilder {\n parent: Option<ControlHandle>,\n}\n\nimpl NoticeBuilder {\n pub fn parent<C: Into<ControlHandle>>(mut self, p: C) -> NoticeBuilder {\n self.parent = Some(p.into());\n self\n }\n\n "},"suffix":{"kind":"string","value":"\n}\n"},"middle":{"kind":"string","value":"pub fn build(self, out: &mut Notice) -> Result<(), NwgError> {\n let parent = match self.parent {\n Some(p) => match p.hwnd() {\n Some(handle) => Ok(handle),\n None => Err(NwgError::control_create(\"Wrong parent type\")),\n },\n None => Err(NwgError::no_parent(\"Notice\")),\n }?;\n\n out.handle = build_notice(parent);\n\n Ok(())\n }"},"strategy":{"kind":"string","value":"function_block-full_function"},"context_items":{"kind":"list like","value":[{"content":"pub fn check_hwnd(handle: &ControlHandle, not_bound: &str, bad_handle: &str) -> HWND {\n\n use winapi::um::winuser::IsWindow;\n\n\n\n if handle.blank() {\n\n panic!(\"{}\", not_bound);\n\n }\n\n match handle.hwnd() {\n\n Some(hwnd) => match unsafe { IsWindow(hwnd) } {\n\n 0 => {\n\n panic!(\"The window handle is no longer valid. This usually means the control was freed by the OS\");\n\n }\n\n _ => hwnd,\n\n },\n\n None => {\n\n panic!(\"{}\", bad_handle);\n\n }\n\n }\n\n}\n\n\n","file_path":"native-windows-gui/src/win32/base_helper.rs","rank":0,"score":425792.8063651537},{"content":"pub fn build_notice(parent: HWND) -> ControlHandle {\n\n let id = NOTICE_ID.fetch_add(1, Ordering::SeqCst);\n\n ControlHandle::Notice(parent, id)\n\n}\n\n\n\npub unsafe fn build_timer(parent: HWND, interval: u32, stopped: bool) -> ControlHandle {\n\n use winapi::um::winuser::SetTimer;\n\n\n\n let id = TIMER_ID.fetch_add(1, Ordering::SeqCst);\n\n\n\n if !stopped {\n\n SetTimer(parent, id as UINT_PTR, interval as UINT, None);\n\n }\n\n\n\n ControlHandle::Timer(parent, id)\n\n}\n\n\n\n/**\n\n Hook the window subclass with the default event dispatcher.\n\n The hook is applied to the window and all it's children (recursively).\n\n\n\n Returns a `EventHandler` that can be passed to `unbind_event_handler` to remove the callbacks.\n\n\n\n This function will panic if `handle` is not a window handle.\n\n*/\n","file_path":"native-windows-gui/src/win32/window.rs","rank":1,"score":407816.1004294588},{"content":"#[cfg(feature = \"timer\")]\n\npub fn start_timer(hwnd: HWND, id: u32, interval: u32) {\n\n use winapi::shared::basetsd::UINT_PTR;\n\n use winapi::um::winuser::SetTimer;\n\n\n\n unsafe {\n\n SetTimer(hwnd, id as UINT_PTR, interval, None);\n\n }\n\n}\n\n\n","file_path":"native-windows-gui/src/win32/window_helper.rs","rank":2,"score":364809.42708012677},{"content":"#[cfg(feature = \"timer\")]\n\npub fn kill_timer(hwnd: HWND, id: u32) {\n\n use winapi::shared::basetsd::UINT_PTR;\n\n use winapi::um::winuser::KillTimer;\n\n\n\n unsafe {\n\n KillTimer(hwnd, id as UINT_PTR);\n\n }\n\n}\n\n\n","file_path":"native-windows-gui/src/win32/window_helper.rs","rank":3,"score":364542.670746353},{"content":"pub fn send_message(hwnd: HWND, msg: UINT, w: WPARAM, l: LPARAM) -> LRESULT {\n\n unsafe { ::winapi::um::winuser::SendMessageW(hwnd, msg, w, l) }\n\n}\n\n\n","file_path":"native-windows-gui/src/win32/window_helper.rs","rank":4,"score":359658.0169545327},{"content":"pub fn destroy_menu_item(parent: HMENU, item_id: u32) {\n\n use winapi::um::winuser::{DeleteMenu, GetMenuItemCount, GetMenuItemID, MF_BYPOSITION};\n\n\n\n unsafe {\n\n let count = GetMenuItemCount(parent);\n\n let mut index = 0;\n\n\n\n while index < count {\n\n let id = GetMenuItemID(parent, index);\n\n match id == item_id {\n\n true => {\n\n DeleteMenu(parent, index as u32, MF_BYPOSITION);\n\n index = count;\n\n }\n\n false => {\n\n index += 1;\n\n }\n\n }\n\n }\n\n }\n\n}\n\n\n","file_path":"native-windows-gui/src/win32/window_helper.rs","rank":6,"score":347390.88014093885},{"content":"/// Build two group of checkboxes on the same parent with the GROUP flags\n\nfn build_radio_groups(radios: &mut [nwg::RadioButton], parent: &nwg::Window) {\n\n use nwg::RadioButtonFlags as RadioF;\n\n\n\n // Group 1\n\n nwg::RadioButton::builder()\n\n .flags(RadioF::VISIBLE | RadioF::GROUP)\n\n .parent(parent)\n\n .build(&mut radios[0]);\n\n\n\n nwg::RadioButton::builder()\n\n .parent(parent)\n\n .build(&mut radios[1]);\n\n\n\n // Group 2\n\n nwg::RadioButton::builder()\n\n .flags(RadioF::VISIBLE | RadioF::GROUP)\n\n .parent(parent)\n\n .build(&mut radios[2]);\n\n\n\n nwg::RadioButton::builder()\n\n .parent(parent)\n\n .build(&mut radios[3]);\n\n}\n\n\n\n\n\n```\n\n\n\n```rust\n\nuse native_windows_gui as nwg;\n","file_path":"native-windows-gui/src/controls/radio_button.rs","rank":7,"score":331302.2963296169},{"content":"pub fn post_message(hwnd: HWND, msg: UINT, w: WPARAM, l: LPARAM) {\n\n unsafe { ::winapi::um::winuser::PostMessageW(hwnd, msg, w, l) };\n\n}\n\n\n\npub unsafe fn set_focus(handle: HWND) {\n\n ::winapi::um::winuser::SetFocus(handle);\n\n}\n\n\n\npub unsafe fn get_focus(handle: HWND) -> bool {\n\n ::winapi::um::winuser::GetFocus() == handle\n\n}\n\n\n\npub unsafe fn get_window_text(handle: HWND) -> String {\n\n use winapi::um::winuser::{GetWindowTextLengthW, GetWindowTextW};\n\n\n\n let buffer_size = GetWindowTextLengthW(handle) as usize + 1;\n\n if buffer_size == 0 {\n\n return String::new();\n\n }\n\n\n","file_path":"native-windows-gui/src/win32/window_helper.rs","rank":8,"score":330942.0133975375},{"content":"pub fn modal_error_message<'a, P: Into<ControlHandle>>(\n\n parent: P,\n\n title: &'a str,\n\n content: &'a str,\n\n) -> MessageChoice {\n\n let params = MessageParams {\n\n title,\n\n content,\n\n buttons: MessageButtons::Ok,\n\n icons: MessageIcons::Error,\n\n };\n\n\n\n modal_message(parent, ¶ms)\n\n}\n\n\n\n/**\n\n Display a simple message box. The message box has for style `MessageButtons::Ok` and `MessageIcons::Info`.\n\n It is recommended to use `modal_info_message` because it locks the window that creates the message box.\n\n This method may be deprecated in the future\n\n\n\n Parameters:\n\n * title: The message box title\n\n * content: The message box message\n\n*/\n","file_path":"native-windows-gui/src/win32/message_box.rs","rank":9,"score":330129.86239140213},{"content":"fn build_combobox(combo: &mut nwg::ComboBox<&'static str>, window: &nwg::Window) {\n\n let data = vec![\"one\", \"two\"];\n\n\n\n nwg::ComboBox::builder()\n\n .size((200, 300))\n\n .collection(data)\n\n .selected_index(Some(0))\n\n .parent(window)\n\n .build(combo);\n\n}\n\n```\n\n*/\n\n#[derive(Default)]\n\npub struct ComboBox<D: Display + Default> {\n\n pub handle: ControlHandle,\n\n collection: RefCell<Vec<D>>,\n\n handler0: RefCell<Option<RawEventHandler>>,\n\n}\n\n\n\nimpl<D: Display + Default> ComboBox<D> {\n","file_path":"native-windows-gui/src/controls/combo_box.rs","rank":10,"score":326640.941004106},{"content":"pub fn has_raw_handler(handle: &ControlHandle, handler_id: UINT_PTR) -> bool {\n\n let handle = handle\n\n .hwnd()\n\n .expect(\"This type of control cannot have a raw handler.\");\n\n let subclass_proc: SUBCLASSPROC = Some(process_raw_events);\n\n let mut tmp_value = 0;\n\n unsafe { GetWindowSubclass(handle, subclass_proc, handler_id, &mut tmp_value) != 0 }\n\n}\n\n\n\n/**\n\n Remove the raw event handler from the associated window.\n\n Calling unbind twice or trying to unbind an handler after destroying its parent will cause the function to panic.\n\n*/\n","file_path":"native-windows-gui/src/win32/window.rs","rank":11,"score":324714.097019256},{"content":"#[cfg(any(feature = \"list-view\", feature = \"progress-bar\"))]\n\npub fn set_style(handle: HWND, style: u32) {\n\n use ::winapi::um::winuser::GWL_STYLE;\n\n set_window_long(handle, GWL_STYLE, style as usize);\n\n}\n\n\n","file_path":"native-windows-gui/src/win32/window_helper.rs","rank":12,"score":317646.2883633448},{"content":"fn build_listbox(listb: &mut nwg::ListBox<&'static str>, window: &nwg::Window, font: &nwg::Font) {\n\n nwg::ListBox::builder()\n\n .flags(nwg::ListBoxFlags::VISIBLE | nwg::ListBoxFlags::MULTI_SELECT)\n\n .collection(vec![\"Hello\", \"World\", \"!!!!\"])\n\n .multi_selection(vec![0, 1, 2])\n\n .font(Some(font))\n\n .parent(window)\n\n .build(listb);\n\n}\n\n```\n\n\n\n*/\n\n#[derive(Default)]\n\npub struct ListBox<D: Display + Default> {\n\n pub handle: ControlHandle,\n\n collection: RefCell<Vec<D>>,\n\n}\n\n\n\nimpl<D: Display + Default> ListBox<D> {\n\n pub fn builder<'a>() -> ListBoxBuilder<'a, D> {\n","file_path":"native-windows-gui/src/controls/list_box.rs","rank":13,"score":315448.9148122943},{"content":"fn basic_stuff(window: &nwg::Window) -> Result<(), nwg::NwgError> {\n\n nwg::ControlBase::build_hwnd()\n\n .class_name(\"BUTTON\")\n\n .forced_flags(0)\n\n .flags(0)\n\n .size((100, 100))\n\n .position((100, 100))\n\n .text(\"HELLO\")\n\n .parent(Some(window.handle))\n\n .build()?;\n\n\n\n #[cfg(feature = \"menu\")]\n\n nwg::ControlBase::build_hmenu()\n\n .text(\"Item\")\n\n .item(true)\n\n .parent(window.handle)\n\n .build()?;\n\n\n\n Ok(())\n\n}\n","file_path":"native-windows-gui/src/controls/control_base.rs","rank":14,"score":314398.61692491896},{"content":"#[cfg(any(feature = \"timer\", feature = \"animation-timer\", feature = \"notice\"))]\n\npub fn window_valid(hwnd: HWND) -> bool {\n\n use winapi::um::winuser::IsWindow;\n\n\n\n unsafe { IsWindow(hwnd) != 0 }\n\n}\n\n\n","file_path":"native-windows-gui/src/win32/window_helper.rs","rank":15,"score":311848.95490275073},{"content":"pub fn init_common_controls() -> Result<(), NwgError> {\n\n use winapi::shared::winerror::{S_FALSE, S_OK};\n\n use winapi::um::commctrl::{InitCommonControlsEx, INITCOMMONCONTROLSEX};\n\n use winapi::um::commctrl::{\n\n ICC_BAR_CLASSES, ICC_DATE_CLASSES, ICC_LISTVIEW_CLASSES, ICC_PROGRESS_CLASS,\n\n ICC_STANDARD_CLASSES, ICC_TAB_CLASSES, ICC_TREEVIEW_CLASSES,\n\n };\n\n use winapi::um::libloaderapi::LoadLibraryW;\n\n use winapi::um::objbase::CoInitialize;\n\n\n\n unsafe {\n\n let mut classes = ICC_BAR_CLASSES | ICC_STANDARD_CLASSES;\n\n\n\n if cfg!(feature = \"datetime-picker\") {\n\n classes |= ICC_DATE_CLASSES;\n\n }\n\n\n\n if cfg!(feature = \"progress-bar\") {\n\n classes |= ICC_PROGRESS_CLASS;\n\n }\n","file_path":"native-windows-gui/src/win32/mod.rs","rank":16,"score":305404.44116310985},{"content":"fn build_timer(parent: &nwg::Window) {\n\n let mut timer = Default::default();\n\n nwg::Timer::builder()\n\n .parent(parent)\n\n .interval(100)\n\n .stopped(false)\n\n .build(&mut timer);\n\n}\n\n```\n\n*/\n\n#[deprecated(\n\n since = \"1.0.11\",\n\n note = \"Use AnimationTimer instead. The winapi timer does not have a constant tick and will call your single threaded from another thread.\"\n\n)]\n\n#[derive(Default)]\n\npub struct Timer {\n\n pub handle: ControlHandle,\n\n interval: RefCell<u32>,\n\n}\n\n\n","file_path":"native-windows-gui/src/controls/timer.rs","rank":17,"score":301945.42417021544},{"content":"/// Builds a timer that will animation something at 60fps for 3 sec\n\nfn build_timer(parent: &nwg::Window) {\n\n let mut timer = Default::default();\n\n nwg::AnimationTimer::builder()\n\n .parent(parent)\n\n .interval(Duration::from_millis(1000/60))\n\n .lifetime(Some(Duration::from_millis(3000)))\n\n .build(&mut timer);\n\n}\n\n```\n\n*/\n\n#[derive(Default, PartialEq, Eq)]\n\npub struct AnimationTimer {\n\n pub handle: ControlHandle,\n\n}\n\n\n\nimpl AnimationTimer {\n\n pub fn builder() -> AnimationTimerBuilder {\n\n AnimationTimerBuilder {\n\n parent: None,\n\n interval: Duration::from_millis(1000 / 60),\n","file_path":"native-windows-gui/src/controls/animation_timer.rs","rank":18,"score":297765.75520377525},{"content":"/// Haha you maybe though that destroying windows would be easy right? WRONG.\n\n/// The window children must first be destroyed otherwise `DestroyWindow` will free them and the associated rust value will be ~CORRUPTED~\n\npub fn destroy_window(hwnd: HWND) {\n\n use winapi::um::winuser::{DestroyWindow, SetParent};\n\n\n\n // Remove the children from the window\n\n iterate_window_children(hwnd, |child| unsafe {\n\n set_window_visibility(child, false);\n\n SetParent(child, ptr::null_mut());\n\n });\n\n\n\n unsafe {\n\n DestroyWindow(hwnd);\n\n }\n\n}\n\n\n","file_path":"native-windows-gui/src/win32/window_helper.rs","rank":19,"score":295672.14123838255},{"content":"pub fn modal_message<'a, P: Into<ControlHandle>>(\n\n parent: P,\n\n params: &MessageParams,\n\n) -> MessageChoice {\n\n let control_handle = parent.into();\n\n let hwnd = control_handle.hwnd().expect(\"expected window like control\");\n\n inner_message(hwnd, params)\n\n}\n\n\n\n/**\n\n Display a message box and then panic. The message box has for style `MessageButtons::Ok` and `MessageIcons::Error` .\n\n It is recommended to use `modal_fatal_message` because it locks the window that creates the message box.\n\n This method may be deprecated in the future\n\n\n\n Parameters:\n\n * title: The message box title\n\n * content: The message box message\n\n*/\n","file_path":"native-windows-gui/src/win32/message_box.rs","rank":20,"score":294954.52045271784},{"content":"pub fn get_window_parent(hwnd: HWND) -> HWND {\n\n use winapi::um::winuser::GetParent;\n\n unsafe { GetParent(hwnd) }\n\n}\n\n\n","file_path":"native-windows-gui/src/win32/window_helper.rs","rank":21,"score":294061.74235722877},{"content":"pub fn modal_fatal_message<'a, P: Into<ControlHandle>>(\n\n parent: P,\n\n title: &'a str,\n\n content: &'a str,\n\n) -> ! {\n\n modal_error_message(parent, title, content);\n\n panic!(\"{} - {}\", title, content);\n\n}\n\n\n\n/**\n\n Display a simple error message box. The message box has for style `MessageButtons::Ok` and `MessageIcons::Error`.\n\n It is recommended to use `modal_error_message` because it locks the window that creates the message box.\n\n This method may be deprecated in the future\n\n\n\n Parameters:\n\n * title: The message box title\n\n * content: The message box message\n\n*/\n","file_path":"native-windows-gui/src/win32/message_box.rs","rank":22,"score":290267.28053937166},{"content":"pub fn modal_info_message<'a, P: Into<ControlHandle>>(\n\n parent: P,\n\n title: &'a str,\n\n content: &'a str,\n\n) -> MessageChoice {\n\n let params = MessageParams {\n\n title,\n\n content,\n\n buttons: MessageButtons::Ok,\n\n icons: MessageIcons::Info,\n\n };\n\n\n\n modal_message(parent, ¶ms)\n\n}\n","file_path":"native-windows-gui/src/win32/message_box.rs","rank":23,"score":290267.28053937166},{"content":"fn print_char(data: &nwg::EventData) {\n\n println!(\"{:?}\", data.on_char());\n\n}\n\n\n","file_path":"native-windows-gui/examples/partials_d.rs","rank":24,"score":287202.4364616673},{"content":"fn build_dtp(date: &mut nwg::DatePicker, window: &nwg::Window) {\n\n let v = nwg::DatePickerValue { year: 2000, month: 10, day: 5 };\n\n let v1 = nwg::DatePickerValue { year: 2000, month: 10, day: 5 };\n\n let v2 = nwg::DatePickerValue { year: 2012, month: 10, day: 5 };\n\n\n\n nwg::DatePicker::builder()\n\n .size((200, 300))\n\n .position((0, 0))\n\n .date(Some(v))\n\n .format(Some(\"'YEAR: 'yyyy\"))\n\n .range(Some([v1, v2]))\n\n .parent(window)\n\n .build(date);\n\n}\n\n```\n\n*/\n\n#[derive(Default, PartialEq, Eq)]\n\npub struct DatePicker {\n\n pub handle: ControlHandle,\n\n}\n","file_path":"native-windows-gui/src/controls/date_picker.rs","rank":25,"score":287164.91250748653},{"content":"fn build_trackbar(track: &mut nwg::TrackBar, window: &nwg::Window) {\n\n nwg::TrackBar::builder()\n\n .range(Some(0..100))\n\n .pos(Some(10))\n\n .parent(window)\n\n .build(track);\n\n}\n\n```\n\n\n\n*/\n\n#[derive(Default)]\n\npub struct TrackBar {\n\n pub handle: ControlHandle,\n\n background_brush: Option<HBRUSH>,\n\n handler0: RefCell<Option<RawEventHandler>>,\n\n}\n\n\n\nimpl TrackBar {\n\n pub fn builder() -> TrackBarBuilder {\n\n TrackBarBuilder {\n","file_path":"native-windows-gui/src/controls/track_bar.rs","rank":26,"score":287164.91250748653},{"content":"fn build_scrollbar(button: &mut nwg::ScrollBar, window: &nwg::Window) {\n\n nwg::ScrollBar::builder()\n\n .range(Some(0..100))\n\n .pos(Some(10))\n\n .parent(window)\n\n .build(button);\n\n}\n\n```\n\n*/\n\n#[derive(Default)]\n\npub struct ScrollBar {\n\n pub handle: ControlHandle,\n\n handler0: RefCell<Option<RawEventHandler>>,\n\n handler1: RefCell<Option<RawEventHandler>>,\n\n}\n\n\n\nimpl ScrollBar {\n\n pub fn builder<'a>() -> ScrollBarBuilder {\n\n ScrollBarBuilder {\n\n size: (25, 100),\n","file_path":"native-windows-gui/src/controls/scroll_bar.rs","rank":27,"score":287164.9125074865},{"content":"fn build_progress_bar(bar: &mut nwg::ProgressBar, window: &nwg::Window) {\n\n nwg::ProgressBar::builder()\n\n .state(nwg::ProgressBarState::Paused)\n\n .step(10)\n\n .range(0..100)\n\n .parent(window)\n\n .build(bar);\n\n}\n\n```\n\n\n\n*/\n\n#[derive(Default, PartialEq, Eq)]\n\npub struct ProgressBar {\n\n pub handle: ControlHandle,\n\n}\n\n\n\nimpl ProgressBar {\n\n pub fn builder() -> ProgressBarBuilder {\n\n ProgressBarBuilder {\n\n size: (100, 40),\n","file_path":"native-windows-gui/src/controls/progress_bar.rs","rank":28,"score":283959.94054601033},{"content":"fn build_button(button: &mut nwg::Button, window: &nwg::Window, font: &nwg::Font) {\n\n nwg::Button::builder()\n\n .text(\"Hello\")\n\n .flags(nwg::ButtonFlags::VISIBLE)\n\n .font(Some(font))\n\n .parent(window)\n\n .build(button);\n\n}\n\n```\n\n\n\n*/\n\n#[derive(Default, Eq, PartialEq)]\n\npub struct Button {\n\n pub handle: ControlHandle,\n\n}\n\n\n\nimpl Button {\n\n pub fn builder<'a>() -> ButtonBuilder<'a> {\n\n ButtonBuilder {\n\n text: \"Button\",\n","file_path":"native-windows-gui/src/controls/button.rs","rank":29,"score":283457.0803326102},{"content":"fn build_label(label: &mut nwg::Label, window: &nwg::Window, font: &nwg::Font) {\n\n nwg::Label::builder()\n\n .text(\"Hello\")\n\n .font(Some(font))\n\n .parent(window)\n\n .build(label);\n\n}\n\n```\n\n\n\n*/\n\n#[derive(Default)]\n\npub struct Label {\n\n pub handle: ControlHandle,\n\n background_brush: Option<HBRUSH>,\n\n handler0: RefCell<Option<RawEventHandler>>,\n\n handler1: RefCell<Option<RawEventHandler>>,\n\n}\n\n\n\nimpl Label {\n\n pub fn builder<'a>() -> LabelBuilder<'a> {\n","file_path":"native-windows-gui/src/controls/label.rs","rank":30,"score":283457.0803326102},{"content":"fn print_char(data: &nwg::EventData) {\n\n println!(\"{:?}\", data.on_char());\n\n}\n\n\n","file_path":"native-windows-gui/examples/dyn_layout_d.rs","rank":31,"score":283124.6460254824},{"content":"fn build_frame(button: &mut nwg::ImageFrame, window: &nwg::Window, ico: &nwg::Icon) {\n\n nwg::ImageFrame::builder()\n\n .parent(window)\n\n .build(button);\n\n}\n\n```\n\n*/\n\n#[derive(Default)]\n\npub struct ImageFrame {\n\n pub handle: ControlHandle,\n\n background_brush: Option<HBRUSH>,\n\n handler0: RefCell<Option<RawEventHandler>>,\n\n}\n\n\n\nimpl ImageFrame {\n\n pub fn builder<'a>() -> ImageFrameBuilder<'a> {\n\n ImageFrameBuilder {\n\n size: (100, 100),\n\n position: (0, 0),\n\n flags: None,\n","file_path":"native-windows-gui/src/controls/image_frame.rs","rank":32,"score":277545.9951814688},{"content":"fn build_checkbox(button: &mut nwg::CheckBox, window: &nwg::Window, font: &nwg::Font) {\n\n nwg::CheckBox::builder()\n\n .text(\"Hello\")\n\n .flags(nwg::CheckBoxFlags::VISIBLE)\n\n .font(Some(font))\n\n .parent(window)\n\n .build(button);\n\n}\n\n```\n\n*/\n\n#[derive(Default)]\n\npub struct CheckBox {\n\n pub handle: ControlHandle,\n\n background_brush: Option<HBRUSH>,\n\n handler0: RefCell<Option<RawEventHandler>>,\n\n}\n\n\n\nimpl CheckBox {\n\n pub fn builder<'a>() -> CheckBoxBuilder<'a> {\n\n CheckBoxBuilder {\n","file_path":"native-windows-gui/src/controls/check_box.rs","rank":33,"score":277545.9951814688},{"content":"fn build_label(label: &mut nwg::RichLabel, window: &nwg::Window, font: &nwg::Font) {\n\n nwg::RichLabel::builder()\n\n .text(\"Hello\")\n\n .font(Some(font))\n\n .parent(window)\n\n .build(label);\n\n}\n\n\n\n*/\n\n#[derive(Default)]\n\npub struct RichLabel {\n\n pub handle: ControlHandle,\n\n line_height: Rc<RefCell<Option<i32>>>,\n\n handler0: RefCell<Option<RawEventHandler>>,\n\n}\n\n\n\nimpl RichLabel {\n\n pub fn builder<'a>() -> RichLabelBuilder<'a> {\n\n RichLabelBuilder {\n\n text: \"A rich label\",\n","file_path":"native-windows-gui/src/controls/rich_label.rs","rank":34,"score":277545.9951814688},{"content":"fn build_status(status: &mut nwg::StatusBar, window: &nwg::Window, font: &nwg::Font) {\n\n nwg::StatusBar::builder()\n\n .text(\"Hello\")\n\n .font(Some(font))\n\n .parent(window)\n\n .build(status);\n\n}\n\n```\n\n\n\n*/\n\n#[derive(Default)]\n\npub struct StatusBar {\n\n pub handle: ControlHandle,\n\n handler0: RefCell<Option<RawEventHandler>>,\n\n}\n\n\n\nimpl StatusBar {\n\n pub fn builder<'a>() -> StatusBarBuilder<'a> {\n\n StatusBarBuilder {\n\n text: \"\",\n","file_path":"native-windows-gui/src/controls/status_bar.rs","rank":35,"score":277545.9951814688},{"content":"fn build_box(tbox: &mut nwg::TextInput, window: &nwg::Window, font: &nwg::Font) {\n\n nwg::TextInput::builder()\n\n .text(\"Hello\")\n\n .font(Some(font))\n\n .parent(window)\n\n .build(tbox);\n\n}\n\n```\n\n*/\n\n#[derive(Default)]\n\npub struct TextInput {\n\n pub handle: ControlHandle,\n\n background_brush: Option<HBRUSH>,\n\n handler0: RefCell<Option<RawEventHandler>>,\n\n}\n\n\n\nimpl TextInput {\n\n pub fn builder<'a>() -> TextInputBuilder<'a> {\n\n TextInputBuilder {\n\n text: \"\",\n","file_path":"native-windows-gui/src/controls/text_input.rs","rank":36,"score":277545.9951814688},{"content":"fn build_box(tbox: &mut nwg::TextBox, window: &nwg::Window, font: &nwg::Font) {\n\n nwg::TextBox::builder()\n\n .text(\"Hello\")\n\n .font(Some(font))\n\n .parent(window)\n\n .build(tbox);\n\n}\n\n```\n\n*/\n\n#[derive(Default, PartialEq, Eq)]\n\npub struct TextBox {\n\n pub handle: ControlHandle,\n\n}\n\n\n\nimpl TextBox {\n\n pub fn builder<'a>() -> TextBoxBuilder<'a> {\n\n TextBoxBuilder {\n\n text: \"\",\n\n size: (100, 25),\n\n position: (0, 0),\n","file_path":"native-windows-gui/src/controls/text_box.rs","rank":37,"score":277545.9951814688},{"content":"fn build_radio(radio: &mut nwg::RadioButton, window: &nwg::Window, font: &nwg::Font) {\n\n nwg::RadioButton::builder()\n\n .text(\"Hello\")\n\n .flags(nwg::RadioButtonFlags::VISIBLE)\n\n .font(Some(font))\n\n .parent(window)\n\n .build(radio);\n\n}\n\n```\n\n\n\n*/\n\n#[derive(Default)]\n\npub struct RadioButton {\n\n pub handle: ControlHandle,\n\n background_brush: Option<HBRUSH>,\n\n handler0: RefCell<Option<RawEventHandler>>,\n\n}\n\n\n\nimpl RadioButton {\n\n pub fn builder<'a>() -> RadioButtonBuilder<'a> {\n","file_path":"native-windows-gui/src/controls/radio_button.rs","rank":38,"score":277545.9951814688},{"content":"#[inline(always)]\n\n#[cfg(target_pointer_width = \"32\")]\n\npub fn set_window_long(handle: HWND, index: c_int, v: usize) {\n\n unsafe {\n\n ::winapi::um::winuser::SetWindowLongW(handle, index, v as LONG);\n\n }\n\n}\n\n\n\n// Helper to wrap DeferWindowPos somewhat safely\n\n// Mostly to streamline the usage of the returned HWDP from DeferWindowPos\n\npub struct DeferredWindowPositioner {\n\n handle: winapi::um::winuser::HDWP,\n\n}\n\n\n\nimpl DeferredWindowPositioner {\n\n const MEM_FAIL: &'static str = \"Insufficient system resources\";\n\n\n\n /// Initialises a new DeferredWindowPositioner with memory for `item_count` windows\n\n pub fn new(item_count: i32) -> Result<DeferredWindowPositioner, &'static str> {\n\n use ::winapi::um::winuser::BeginDeferWindowPos;\n\n\n\n let handle = unsafe { BeginDeferWindowPos(item_count) };\n","file_path":"native-windows-gui/src/win32/window_helper.rs","rank":39,"score":277511.6840719576},{"content":"pub fn minimize_window(handle: HWND) {\n\n use winapi::um::winuser::{ShowWindow, SW_MINIMIZE};\n\n unsafe {\n\n ShowWindow(handle, SW_MINIMIZE);\n\n }\n\n}\n\n\n","file_path":"native-windows-gui/src/win32/window_helper.rs","rank":40,"score":273044.11719047313},{"content":"pub fn restore_window(handle: HWND) {\n\n use winapi::um::winuser::{ShowWindow, SW_RESTORE};\n\n unsafe {\n\n ShowWindow(handle, SW_RESTORE);\n\n }\n\n}\n\n\n\n/// Set the font of a window\n\npub unsafe fn set_window_font(handle: HWND, font_handle: Option<HFONT>, redraw: bool) {\n\n use winapi::um::winuser::SendMessageW;\n\n use winapi::um::winuser::WM_SETFONT;\n\n\n\n let font_handle = font_handle.unwrap_or(ptr::null_mut());\n\n\n\n SendMessageW(handle, WM_SETFONT, font_handle as usize, redraw as LPARAM);\n\n}\n\n\n","file_path":"native-windows-gui/src/win32/window_helper.rs","rank":41,"score":273044.11719047313},{"content":"pub fn maximize_window(handle: HWND) {\n\n use winapi::um::winuser::{ShowWindow, SW_MAXIMIZE};\n\n unsafe {\n\n ShowWindow(handle, SW_MAXIMIZE);\n\n }\n\n}\n\n\n","file_path":"native-windows-gui/src/win32/window_helper.rs","rank":42,"score":273044.11719047313},{"content":"fn build_number_select(num_select: &mut nwg::NumberSelect, window: &nwg::Window, font: &nwg::Font) {\n\n nwg::NumberSelect::builder()\n\n .font(Some(font))\n\n .parent(window)\n\n .build(num_select);\n\n}\n\n```\n\n\n\n*/\n\n#[derive(Default)]\n\npub struct NumberSelect {\n\n pub handle: ControlHandle,\n\n data: Rc<RefCell<NumberSelectData>>,\n\n edit: TextInput,\n\n btn_up: Button,\n\n btn_down: Button,\n\n handler: Option<RawEventHandler>,\n\n}\n\n\n\nimpl NumberSelect {\n","file_path":"native-windows-gui/src/controls/number_select.rs","rank":43,"score":272013.5809008528},{"content":"pub fn slice_as_bytes<'a, D: Copy>(data: &'a [D]) -> &'a [u8] {\n\n unsafe {\n\n data.align_to().1\n\n }\n\n}\n\n\n\n\n","file_path":"native-windows-gui/examples/wgpu_canvas/src/main.rs","rank":45,"score":268473.4726190473},{"content":"/// Create the NWG tab classes\n\npub fn create_tab_classes() -> Result<(), NwgError> {\n\n use winapi::shared::windef::HBRUSH;\n\n use winapi::um::libloaderapi::GetModuleHandleW;\n\n use winapi::um::winuser::COLOR_BTNFACE;\n\n\n\n let hmod = unsafe { GetModuleHandleW(ptr::null_mut()) };\n\n if hmod.is_null() {\n\n return Err(NwgError::initialization(\"GetModuleHandleW failed\"));\n\n }\n\n\n\n unsafe {\n\n build_sysclass(\n\n hmod,\n\n TAB_CLASS_ID,\n\n Some(tab_proc),\n\n Some(COLOR_BTNFACE as HBRUSH),\n\n None,\n\n )?;\n\n }\n\n\n","file_path":"native-windows-gui/src/win32/tabs.rs","rank":46,"score":267467.1926071784},{"content":"pub fn is_bitmap(handle: HBITMAP) -> bool {\n\n use winapi::shared::minwindef::LPVOID;\n\n use winapi::um::wingdi::GetBitmapBits;\n\n\n\n let mut bits: [u8; 1] = [0; 1];\n\n unsafe { GetBitmapBits(handle, 1, &mut bits as *mut [u8; 1] as LPVOID) != 0 }\n\n}\n\n\n","file_path":"native-windows-gui/src/win32/resources_helper.rs","rank":47,"score":266002.0258826976},{"content":"/// Initializes some application wide GUI settings.\n\n/// This includes default styling and common controls resources.\n\npub fn init() -> std::result::Result<(), errors::NwgError> {\n\n if cfg!(not(feature = \"no-styling\")) {\n\n enable_visual_styles();\n\n }\n\n\n\n init_common_controls()\n\n}\n","file_path":"native-windows-gui/src/lib.rs","rank":48,"score":265205.1994537726},{"content":"pub fn get_style(handle: HWND) -> UINT {\n\n use ::winapi::um::winuser::GWL_STYLE;\n\n get_window_long(handle, GWL_STYLE) as UINT\n\n}\n\n\n","file_path":"native-windows-gui/src/win32/window_helper.rs","rank":49,"score":262768.982102977},{"content":"fn read_custom_data_handle(window: &nwg::Window) -> Option<Hello> {\n\n unsafe {\n\n nwg::Clipboard::open(window);\n\n let handle = nwg::Clipboard::data_handle(nwg::ClipboardFormat::Global(\"Hello\"));\n\n let data = match handle {\n\n Some(h) => {\n\n let data_ptr: *const Hello = h.cast();\n\n let data = *data_ptr;\n\n h.release();\n\n Some(data)\n\n },\n\n None => None\n\n };\n\n\n\n nwg::Clipboard::close();\n\n data\n\n }\n\n}\n\n\n\n```\n","file_path":"native-windows-gui/src/win32/clipboard.rs","rank":50,"score":261150.74332321115},{"content":"/// Create the NWG tab classes\n\npub fn create_extern_canvas_classes() -> Result<(), NwgError> {\n\n use winapi::shared::windef::HBRUSH;\n\n use winapi::um::libloaderapi::GetModuleHandleW;\n\n use winapi::um::winuser::{CS_HREDRAW, CS_OWNDC, CS_VREDRAW};\n\n\n\n let hmod = unsafe { GetModuleHandleW(ptr::null_mut()) };\n\n if hmod.is_null() {\n\n return Err(NwgError::initialization(\"GetModuleHandleW failed\"));\n\n }\n\n\n\n unsafe {\n\n build_sysclass(\n\n hmod,\n\n EXT_CANVAS_CLASS_ID,\n\n Some(extern_canvas_proc),\n\n Some(0 as HBRUSH),\n\n Some(CS_OWNDC | CS_VREDRAW | CS_HREDRAW),\n\n )?;\n\n }\n\n\n","file_path":"native-windows-gui/src/win32/extern_canvas.rs","rank":51,"score":259813.6441822626},{"content":"#[cfg(feature = \"tree-view\")]\n\nfn tree_data(m: u32, notif_raw: *const NMHDR) -> EventData {\n\n use crate::{ExpandState, TreeItem, TreeItemAction, TreeItemState};\n\n use winapi::um::commctrl::{\n\n NMTREEVIEWW, NMTVDISPINFOW, NMTVITEMCHANGE, TVE_COLLAPSE, TVE_EXPAND, TVN_DELETEITEMW,\n\n TVN_ENDLABELEDITW, TVN_ITEMCHANGEDW, TVN_ITEMEXPANDEDW, TVN_SELCHANGEDW,\n\n };\n\n\n\n match m {\n\n TVN_DELETEITEMW => {\n\n let data = unsafe { &*(notif_raw as *const NMTREEVIEWW) };\n\n let item = TreeItem {\n\n handle: data.itemOld.hItem,\n\n };\n\n EventData::OnTreeItemDelete(item)\n\n }\n\n TVN_ITEMEXPANDEDW => {\n\n let data = unsafe { &*(notif_raw as *const NMTREEVIEWW) };\n\n let item = TreeItem {\n\n handle: data.itemNew.hItem,\n\n };\n","file_path":"native-windows-gui/src/win32/window.rs","rank":52,"score":259698.5517587432},{"content":"#[cfg(not(feature = \"tree-view\"))]\n\nfn tree_data(_m: u32, _notif_raw: *const NMHDR) -> EventData {\n\n // If tree-view is not enabled, the data type won't be available so we return NO_DATA\n\n NO_DATA\n\n}\n\n\n","file_path":"native-windows-gui/src/win32/window.rs","rank":53,"score":259698.55175874318},{"content":"pub fn get_window_font(handle: HWND) -> HFONT {\n\n use winapi::um::winuser::WM_GETFONT;\n\n unsafe {\n\n let h = send_message(handle, WM_GETFONT, 0, 0);\n\n mem::transmute(h)\n\n }\n\n}\n\n\n","file_path":"native-windows-gui/src/win32/window_helper.rs","rank":54,"score":259435.44622927145},{"content":"#[cfg(feature = \"list-view\")]\n\nfn list_view_data(m: u32, notif_raw: *const NMHDR) -> EventData {\n\n use winapi::um::commctrl::{\n\n LVIS_SELECTED, LVN_COLUMNCLICK, LVN_DELETEITEM, LVN_INSERTITEM, LVN_ITEMACTIVATE,\n\n LVN_ITEMCHANGED, NMITEMACTIVATE, NMLISTVIEW, NM_CLICK, NM_DBLCLK, NM_RCLICK,\n\n };\n\n\n\n match m {\n\n LVN_DELETEITEM | LVN_INSERTITEM | LVN_COLUMNCLICK => {\n\n let data: &NMLISTVIEW = unsafe { &*(notif_raw as *const NMLISTVIEW) };\n\n EventData::OnListViewItemIndex {\n\n row_index: data.iItem as _,\n\n column_index: data.iSubItem as _,\n\n }\n\n }\n\n LVN_ITEMACTIVATE | NM_CLICK | NM_DBLCLK | NM_RCLICK => {\n\n let data: &NMITEMACTIVATE = unsafe { &*(notif_raw as *const NMITEMACTIVATE) };\n\n EventData::OnListViewItemIndex {\n\n row_index: data.iItem as _,\n\n column_index: data.iSubItem as _,\n\n }\n","file_path":"native-windows-gui/src/win32/window.rs","rank":55,"score":256188.50690628233},{"content":"#[cfg(not(feature = \"list-view\"))]\n\nfn list_view_data(_m: u32, _notif_raw: *const NMHDR) -> EventData {\n\n // If list-view is not enabled, the data type won't be available so we return NO_DATA\n\n NO_DATA\n\n}\n\n\n\nunsafe fn static_commands(handle: HWND, m: u16) -> Event {\n\n use winapi::um::winuser::SendMessageW;\n\n use winapi::um::winuser::{\n\n IMAGE_BITMAP, IMAGE_CURSOR, IMAGE_ICON, STM_GETIMAGE, STN_CLICKED, STN_DBLCLK,\n\n };\n\n\n\n let has_image = SendMessageW(handle, STM_GETIMAGE, IMAGE_BITMAP as usize, 0) != 0;\n\n let has_icon = SendMessageW(handle, STM_GETIMAGE, IMAGE_ICON as usize, 0) != 0;\n\n let has_cursor = SendMessageW(handle, STM_GETIMAGE, IMAGE_CURSOR as usize, 0) != 0;\n\n\n\n if has_image | has_icon | has_cursor {\n\n match m {\n\n STN_CLICKED => Event::OnImageFrameClick,\n\n STN_DBLCLK => Event::OnImageFrameDoubleClick,\n\n _ => Event::Unknown,\n","file_path":"native-windows-gui/src/win32/window.rs","rank":56,"score":256188.50690628233},{"content":"type RawCallback = dyn Fn(HWND, UINT, WPARAM, LPARAM) -> Option<LRESULT>;\n","file_path":"native-windows-gui/src/win32/window.rs","rank":57,"score":255958.20301655075},{"content":"/// Building a tooltip and add tooltips at the same time\n\nfn build_tooltip(tt: &mut nwg::Tooltip, btn1: &nwg::Button, btn2: &nwg::Button) {\n\n nwg::Tooltip::builder()\n\n .register(btn1, \"A test button\")\n\n .register_callback(btn2)\n\n .build(tt);\n\n}\n\n\n","file_path":"native-windows-gui/src/controls/tooltip.rs","rank":58,"score":254496.10319004307},{"content":"pub fn error_message<'a>(title: &'a str, content: &'a str) -> MessageChoice {\n\n let params = MessageParams {\n\n title,\n\n content,\n\n buttons: MessageButtons::Ok,\n\n icons: MessageIcons::Error,\n\n };\n\n\n\n message(¶ms)\n\n}\n\n\n\n/**\n\n Display a simple error message box. The message box has for style `MessageButtons::Ok` and `MessageIcons::Error`.\n\n\n\n This functions panics if a non window control is used as parent (ex: a menu)\n\n\n\n Parameters:\n\n * parent: Parent window to lock for the duration of the message box\n\n * title: The message box title\n\n * content: The message box message\n\n*/\n","file_path":"native-windows-gui/src/win32/message_box.rs","rank":59,"score":254008.26055163238},{"content":"/// Execute the callback for each first level children of the window\n\npub fn iterate_window_children<F>(hwnd_parent: HWND, cb: F)\n\nwhere\n\n F: FnMut(HWND),\n\n{\n\n use winapi::shared::minwindef::BOOL;\n\n use winapi::um::winuser::EnumChildWindows;\n\n\n\n struct EnumChildData<F> {\n\n parent: HWND,\n\n callback: F,\n\n }\n\n\n\n unsafe extern \"system\" fn enum_child<F>(hwnd: HWND, p: LPARAM) -> BOOL\n\n where\n\n F: FnMut(HWND),\n\n {\n\n // Only iterate over the top level children\n\n let enum_data_ptr = p as *mut EnumChildData<F>;\n\n let enum_data = &mut *enum_data_ptr;\n\n if get_window_parent(hwnd) == enum_data.parent {\n","file_path":"native-windows-gui/src/win32/window_helper.rs","rank":60,"score":252583.84884426685},{"content":"fn iter_tree_view(tree: &mut nwg::TreeView) {\n\n for item in tree.iter() {\n\n println!(\"{:?}\", tree.item_text(&item));\n\n }\n\n}\n\n```\n\n*/\n\n#[allow(unused)]\n\npub struct TreeViewIterator<'a> {\n\n tree_view: &'a TreeView,\n\n tree_view_handle: HWND,\n\n base_item: HTREEITEM,\n\n current_item: HTREEITEM,\n\n action: NextAction,\n\n}\n\n\n\nimpl<'a> TreeViewIterator<'a> {\n\n /// Use `TreeView.iter` to create a `TreeViewIterator`\n\n pub(crate) fn new(tree_view: &'a TreeView, current_item: HTREEITEM) -> TreeViewIterator {\n\n let tree_view_handle = tree_view.handle.hwnd().unwrap();\n","file_path":"native-windows-gui/src/controls/treeview_iterator.rs","rank":61,"score":251711.63342688547},{"content":"pub fn dispatch_thread_events_with_callback<F>(mut cb: F)\n\nwhere\n\n F: FnMut() + 'static,\n\n{\n\n use winapi::um::winuser::MSG;\n\n use winapi::um::winuser::{PeekMessageW, PM_REMOVE, WM_QUIT};\n\n\n\n unsafe {\n\n let mut msg: MSG = mem::zeroed();\n\n while msg.message != WM_QUIT {\n\n let has_message = PeekMessageW(&mut msg, ptr::null_mut(), 0, 0, PM_REMOVE) != 0;\n\n if has_message && IsDialogMessageW(GetAncestor(msg.hwnd, GA_ROOT), &mut msg) == 0 {\n\n TranslateMessage(&msg);\n\n DispatchMessageW(&msg);\n\n }\n\n\n\n cb();\n\n }\n\n }\n\n}\n\n\n\n/**\n\n Break the events loop running on the current thread\n\n*/\n","file_path":"native-windows-gui/src/win32/mod.rs","rank":62,"score":249197.60342995398},{"content":"pub fn destroy_icon(icon: HANDLE) {\n\n unsafe {\n\n winapi::um::winuser::DestroyIcon(icon as _);\n\n }\n\n}\n\n\n","file_path":"native-windows-gui/src/win32/resources_helper.rs","rank":63,"score":243973.79548913508},{"content":"pub fn destroy_cursor(cursor: HANDLE) {\n\n unsafe {\n\n winapi::um::winuser::DestroyCursor(cursor as _);\n\n }\n\n}\n\n\n","file_path":"native-windows-gui/src/win32/resources_helper.rs","rank":64,"score":243973.79548913508},{"content":"pub fn destroy_obj(obj: HANDLE) {\n\n unsafe {\n\n winapi::um::wingdi::DeleteObject(obj as _);\n\n }\n\n}\n\n\n\npub unsafe fn build_font(\n\n size: i32,\n\n weight: u32,\n\n style: [bool; 3],\n\n family_name: Option<&str>,\n\n) -> Result<HFONT, NwgError> {\n\n use winapi::um::wingdi::CreateFontW;\n\n use winapi::um::wingdi::{\n\n CLEARTYPE_QUALITY, CLIP_DEFAULT_PRECIS, DEFAULT_CHARSET, OUT_DEFAULT_PRECIS, VARIABLE_PITCH,\n\n };\n\n let [use_italic, use_underline, use_strikeout] = style;\n\n\n\n let fam;\n\n let family_name_ptr;\n","file_path":"native-windows-gui/src/win32/resources_helper.rs","rank":65,"score":243973.79548913508},{"content":"fn set_tooltip_dynamic<'a>(app: &ControlsTest, handle: &ControlHandle, data: &ToolTipTextData) {\n\n if &app.window == handle {\n\n data.set_text(&format!(\"Control text: \\\"{}\\\"\", app.window.text()));\n\n } else if &app.test_text_input == handle {\n\n data.set_text(&format!(\"Control text: \\\"{}\\\"\", app.test_text_input.text()));\n\n }\n\n}\n\n\n","file_path":"native-windows-gui/src/tests/control_test.rs","rank":66,"score":243906.46143679644},{"content":"#[inline(always)]\n\n#[cfg(target_pointer_width = \"32\")]\n\npub fn get_window_long(handle: HWND, index: c_int) -> LONG {\n\n unsafe { ::winapi::um::winuser::GetWindowLongW(handle, index) }\n\n}\n\n\n","file_path":"native-windows-gui/src/win32/window_helper.rs","rank":67,"score":242951.16786354163},{"content":"fn write_custom_data(window: &nwg::Window) {\n\n let data = Hello {\n\n foo: 6529,\n\n bar: [0, 100, 20]\n\n };\n\n\n\n nwg::Clipboard::open(window);\n\n nwg::Clipboard::empty();\n\n unsafe {\n\n nwg::Clipboard::set_data(\n\n nwg::ClipboardFormat::Global(\"Hello\"),\n\n &data as *const Hello,\n\n 1\n\n );\n\n }\n\n\n\n nwg::Clipboard::close();\n\n}\n\n\n","file_path":"native-windows-gui/src/win32/clipboard.rs","rank":68,"score":241822.5161894818},{"content":"pub fn unbind_raw_event_handler(handler: &RawEventHandler) -> Result<(), NwgError> {\n\n let subclass_proc = handler.subclass_proc;\n\n let handler_id = handler.handler_id;\n\n let handle = handler.handle;\n\n\n\n unsafe {\n\n let mut callback_value: UINT_PTR = 0;\n\n let result = GetWindowSubclass(handle, subclass_proc, handler_id, &mut callback_value);\n\n if result == 0 {\n\n let err = format!(\n\n concat!(\n\n \"Could not fetch raw event handler #{:?}.\",\n\n \"This can happen if the control ({:?}) was freed or\",\n\n \"if this raw event handler was already unbound\"\n\n ),\n\n handler_id, handle\n\n );\n\n return Err(NwgError::EventsBinding(err));\n\n }\n\n\n","file_path":"native-windows-gui/src/win32/window.rs","rank":69,"score":239994.53392916656},{"content":"#[inline(always)]\n\n#[cfg(target_pointer_width = \"64\")]\n\npub fn get_window_long(handle: HWND, index: c_int) -> LONG_PTR {\n\n unsafe { ::winapi::um::winuser::GetWindowLongPtrW(handle, index) }\n\n}\n\n\n","file_path":"native-windows-gui/src/win32/window_helper.rs","rank":70,"score":239506.213011357},{"content":"#[cfg(feature = \"rich-textbox\")]\n\npub fn get_class_info(hwnd: HWND) -> Result<WNDCLASSEXW, ()> {\n\n use winapi::shared::ntdef::WCHAR;\n\n use winapi::um::libloaderapi::GetModuleHandleW;\n\n use winapi::um::winuser::{GetClassInfoExW, GetClassNameW};\n\n\n\n unsafe {\n\n let mut info: WNDCLASSEXW = mem::zeroed();\n\n\n\n let hinst = GetModuleHandleW(ptr::null_mut());\n\n\n\n let mut class_name_raw: [WCHAR; 100] = [0; 100];\n\n let count = GetClassNameW(hwnd, class_name_raw.as_mut_ptr(), 100) as usize;\n\n if count == 0 {\n\n return Err(());\n\n }\n\n\n\n let result = GetClassInfoExW(hinst, class_name_raw.as_ptr(), &mut info);\n\n match result == 0 {\n\n true => Err(()),\n\n false => Ok(info),\n\n }\n\n }\n\n}\n\n\n\n/// Reeturn the background color of a window\n","file_path":"native-windows-gui/src/win32/window_helper.rs","rank":71,"score":234188.4048338878},{"content":"#[cfg(feature = \"rich-textbox\")]\n\npub fn get_background_color(hwnd: HWND) -> Result<[u8; 3], ()> {\n\n use winapi::um::wingdi::{\n\n GetBValue, GetGValue, GetObjectW, GetRValue, GetStockObject, LOGBRUSH,\n\n };\n\n use winapi::um::winuser::GetSysColorBrush;\n\n\n\n match get_class_info(hwnd) {\n\n Ok(info) => unsafe {\n\n let brush = {\n\n let stock_handle = info.hbrBackground as usize as i32;\n\n let stock = GetStockObject(info.hbrBackground as usize as i32);\n\n match stock.is_null() {\n\n true => info.hbrBackground,\n\n false => {\n\n if stock_handle > 0 {\n\n // Windows use (stock handle - 1) for the real background color ¯\\_(ツ)_/¯\n\n GetSysColorBrush(stock_handle - 1)\n\n } else {\n\n GetSysColorBrush(0)\n\n }\n","file_path":"native-windows-gui/src/win32/window_helper.rs","rank":72,"score":229859.22177900473},{"content":"fn read_custom_data(window: &nwg::Window) -> Option<Hello> {\n\n unsafe {\n\n nwg::Clipboard::open(window);\n\n let data = nwg::Clipboard::data(nwg::ClipboardFormat::Global(\"Hello\"));\n\n nwg::Clipboard::close();\n\n data\n\n }\n\n}\n\n\n","file_path":"native-windows-gui/src/win32/clipboard.rs","rank":73,"score":225083.86477708165},{"content":"pub fn fatal_message<'a>(title: &'a str, content: &'a str) -> ! {\n\n error_message(title, content);\n\n panic!(\"{} - {}\", title, content);\n\n}\n\n\n\n/**\n\n Display a message box and then panic. The message box has for style `MessageButtons::Ok` and `MessageIcons::Error` .\n\n\n\n This functions panics if a non window control is used as parent (ex: a menu)\n\n\n\n Parameters:\n\n * parent: Parent window to lock for the duration of the message box\n\n * title: The message box title\n\n * content: The message box message\n\n*/\n","file_path":"native-windows-gui/src/win32/message_box.rs","rank":74,"score":224443.26939042963},{"content":"pub fn full_bind_event_handler<F>(handle: &ControlHandle, f: F) -> EventHandler\n\nwhere\n\n F: Fn(Event, EventData, ControlHandle) + 'static,\n\n{\n\n use winapi::um::winuser::EnumChildWindows;\n\n\n\n struct SetSubclassParam {\n\n callback_ptr: *mut *const Callback,\n\n subclass_id: UINT_PTR,\n\n }\n\n\n\n /**\n\n Function that iters over a top level window and bind the events dispatch callback\n\n */\n\n unsafe extern \"system\" fn set_children_subclass(h: HWND, p: LPARAM) -> i32 {\n\n let params_ptr = p as *mut SetSubclassParam;\n\n let params = &*params_ptr;\n\n\n\n let cb: Rc<Callback> = Rc::from_raw(*params.callback_ptr);\n\n\n","file_path":"native-windows-gui/src/win32/window.rs","rank":75,"score":221512.4861165614},{"content":"pub fn parameters(field: &syn::Field, attr_id: &'static str) -> (Vec<syn::Ident>, Vec<syn::Expr>) {\n\n let member = match field.ident.as_ref() {\n\n Some(m) => m,\n\n None => unreachable!()\n\n };\n\n\n\n let nwg_control = |attr: &&syn::Attribute| {\n\n attr.path.get_ident()\n\n .map(|id| id == attr_id )\n\n .unwrap_or(false)\n\n };\n\n\n\n let attr = match field.attrs.iter().find(nwg_control) {\n\n Some(attr) => attr,\n\n None => unreachable!()\n\n };\n\n\n\n let ctrl: Parameters = match syn::parse2(attr.tokens.clone()) {\n\n Ok(a) => a,\n\n Err(e) => panic!(\"Failed to parse field #{}: {}\", member, e)\n","file_path":"native-windows-derive/src/controls.rs","rank":76,"score":221007.08526839627},{"content":"pub fn to_utf16(s: &str) -> Vec<u16> {\n\n use std::ffi::OsStr;\n\n use std::os::windows::ffi::OsStrExt;\n\n\n\n OsStr::new(s)\n\n .encode_wide()\n\n .chain(Some(0u16).into_iter())\n\n .collect()\n\n}\n\n\n\n/**\n\n Decode a raw utf16 string. Should be null terminated.\n\n*/\n","file_path":"native-windows-gui/src/win32/base_helper.rs","rank":77,"score":219479.07605763437},{"content":"pub fn stop_thread_dispatch() {\n\n use winapi::um::winuser::PostMessageW;\n\n use winapi::um::winuser::WM_QUIT;\n\n\n\n unsafe { PostMessageW(ptr::null_mut(), WM_QUIT, 0, 0) };\n\n}\n\n\n\n/**\n\n Enable the Windows visual style in the application without having to use a manifest\n\n*/\n","file_path":"native-windows-gui/src/win32/mod.rs","rank":78,"score":218667.0639330725},{"content":"pub fn dispatch_thread_events() {\n\n use winapi::um::winuser::GetMessageW;\n\n use winapi::um::winuser::MSG;\n\n\n\n unsafe {\n\n let mut msg: MSG = mem::zeroed();\n\n while GetMessageW(&mut msg, ptr::null_mut(), 0, 0) != 0 {\n\n if IsDialogMessageW(GetAncestor(msg.hwnd, GA_ROOT), &mut msg) == 0 {\n\n TranslateMessage(&msg);\n\n DispatchMessageW(&msg);\n\n }\n\n }\n\n }\n\n}\n\n\n\n/**\n\n Dispatch system evetns in the current thread AND execute a callback after each peeking attempt.\n\n Unlike `dispath_thread_events`, this method will not pause the thread while waiting for events.\n\n*/\n","file_path":"native-windows-gui/src/win32/mod.rs","rank":79,"score":218667.06393307252},{"content":"fn print_char(data: &EventData) {\n\n match data {\n\n EventData::OnChar(c) => println!(\"{:?}\", c),\n\n _ => {}\n\n }\n\n}\n\n\n","file_path":"native-windows-gui/src/tests/control_test.rs","rank":80,"score":217291.50524632214},{"content":"pub fn main() {\n\n nwg::init().expect(\"Failed to init Native Windows GUI\");\n\n\n\n let app = ExternCanvas::build_ui(Default::default()).expect(\"Failed to build UI\");\n\n\n\n // Make sure to render everything at least once before showing the window to remove weird artifacts.\n\n app.canvas.create_context();\n\n app.canvas.render();\n\n\n\n // Here we use the `with_callback` version of dispatch_thread_events\n\n // Internally the callback will be executed almost as fast as `loop { callback() }`\n\n nwg::dispatch_thread_events_with_callback(move || {\n\n app.canvas.render();\n\n });\n\n}\n\n\n\n\n\nconst VS_SRC: &'static [u8] = b\"#version 330\n\nlayout (location=0) in vec2 a_position;\n\nlayout (location=1) in vec4 a_color;\n","file_path":"native-windows-gui/examples/opengl_canvas/src/main.rs","rank":81,"score":217281.71488364914},{"content":"pub fn simple_message<'a>(title: &'a str, content: &'a str) -> MessageChoice {\n\n let params = MessageParams {\n\n title,\n\n content,\n\n buttons: MessageButtons::Ok,\n\n icons: MessageIcons::Info,\n\n };\n\n\n\n message(¶ms)\n\n}\n\n\n\n/**\n\n Display a simple message box. The message box has for style `MessageButtons::Ok` and `MessageIcons::Info`.\n\n\n\n This functions panics if a non window control is used as parent (ex: a menu)\n\n\n\n Parameters:\n\n * parent: Parent window to lock for the duration of the message box\n\n * title: The message box title\n\n * content: The message box message\n\n*/\n","file_path":"native-windows-gui/src/win32/message_box.rs","rank":82,"score":215720.85242181097},{"content":"fn build_image_list(list: &mut nwg::ImageList) {\n\n nwg::ImageList::builder()\n\n .size((64, 64))\n\n .initial(10)\n\n .grow(1)\n\n .build(list);\n\n}\n\n```\n\n\n\n*/\n\npub struct ImageList {\n\n pub handle: HIMAGELIST,\n\n pub owned: bool,\n\n}\n\n\n\nimpl ImageList {\n\n pub fn builder() -> ImageListBuilder {\n\n ImageListBuilder {\n\n size: (32, 32),\n\n initial: 5,\n","file_path":"native-windows-gui/src/resources/image_list.rs","rank":83,"score":215298.53409579542},{"content":"#[cfg(not(feature = \"tabs\"))]\n\nfn tabs_init() -> Result<(), NwgError> {\n\n Ok(())\n\n}\n\n\n","file_path":"native-windows-gui/src/win32/mod.rs","rank":84,"score":210831.7348220347},{"content":"#[cfg(not(feature = \"frame\"))]\n\nfn frame_init() -> Result<(), NwgError> {\n\n Ok(())\n\n}\n","file_path":"native-windows-gui/src/win32/mod.rs","rank":85,"score":210831.7348220347},{"content":"fn load_cursor_builder() -> nwg::Cursor {\n\n let mut cursor = nwg::Cursor::default();\n\n\n\n nwg::Cursor::builder()\n\n .source_file(Some(\"Hello.cur\"))\n\n .strict(true)\n\n .build(&mut cursor)\n\n .unwrap();\n\n\n\n cursor\n\n}\n\n\n\n*/\n\n#[allow(unused)]\n\npub struct Cursor {\n\n pub handle: HANDLE,\n\n pub(crate) owned: bool,\n\n}\n\n\n\nimpl Cursor {\n","file_path":"native-windows-gui/src/resources/cursor.rs","rank":86,"score":210419.1390395962},{"content":"fn load_bitmap_builder() -> nwg::Bitmap {\n\n let mut bitmap = nwg::Bitmap::default();\n\n\n\n nwg::Bitmap::builder()\n\n .source_file(Some(\"Hello.bmp\"))\n\n .strict(true)\n\n .build(&mut bitmap)\n\n .unwrap();\n\n\n\n bitmap\n\n}\n\n\n\n```\n\n\n\n*/\n\n#[allow(unused)]\n\npub struct Bitmap {\n\n pub handle: HANDLE,\n\n pub(crate) owned: bool,\n\n}\n","file_path":"native-windows-gui/src/resources/bitmap.rs","rank":87,"score":210419.1390395962},{"content":"fn load_icon_builder() -> nwg::Icon {\n\n let mut icon = nwg::Icon::default();\n\n\n\n nwg::Icon::builder()\n\n .source_file(Some(\"hello.ico\"))\n\n .strict(true)\n\n .build(&mut icon);\n\n\n\n icon\n\n}\n\n\n\n*/\n\n#[allow(unused)]\n\npub struct Icon {\n\n pub handle: HANDLE,\n\n pub(crate) owned: bool,\n\n}\n\n\n\nimpl Icon {\n\n pub fn builder<'a>() -> IconBuilder<'a> {\n","file_path":"native-windows-gui/src/resources/icon.rs","rank":88,"score":210419.1390395962},{"content":"fn next_treeview_item(handle: &ControlHandle, action: usize, item: HTREEITEM) -> Option<TreeItem> {\n\n use winapi::um::commctrl::TVM_GETNEXTITEM;\n\n\n\n if handle.blank() {\n\n panic!(\"{}\", NOT_BOUND);\n\n }\n\n let handle = handle.hwnd().expect(BAD_HANDLE);\n\n\n\n let handle = wh::send_message(handle, TVM_GETNEXTITEM, action as _, item as _) as HTREEITEM;\n\n if handle.is_null() {\n\n None\n\n } else {\n\n Some(TreeItem { handle })\n\n }\n\n}\n\n\n","file_path":"native-windows-gui/src/controls/treeview.rs","rank":89,"score":208117.30517267445},{"content":"/// Inner function used by the message box function\n\nfn inner_message(parent: HWND, params: &MessageParams) -> MessageChoice {\n\n use winapi::um::winuser::{\n\n MB_ABORTRETRYIGNORE, MB_CANCELTRYCONTINUE, MB_ICONEXCLAMATION, MB_ICONINFORMATION,\n\n MB_ICONQUESTION, MB_ICONSTOP, MB_OK, MB_OKCANCEL, MB_RETRYCANCEL, MB_YESNO, MB_YESNOCANCEL,\n\n };\n\n\n\n use winapi::um::winuser::MessageBoxW;\n\n use winapi::um::winuser::{\n\n IDABORT, IDCANCEL, IDCONTINUE, IDIGNORE, IDNO, IDOK, IDRETRY, IDTRYAGAIN, IDYES,\n\n };\n\n\n\n let text = to_utf16(params.content);\n\n let title = to_utf16(params.title);\n\n\n\n let buttons = match params.buttons {\n\n MessageButtons::AbortTryIgnore => MB_ABORTRETRYIGNORE,\n\n MessageButtons::CancelTryContinue => MB_CANCELTRYCONTINUE,\n\n MessageButtons::Ok => MB_OK,\n\n MessageButtons::OkCancel => MB_OKCANCEL,\n\n MessageButtons::RetryCancel => MB_RETRYCANCEL,\n","file_path":"native-windows-gui/src/win32/message_box.rs","rank":90,"score":208045.5615791167},{"content":"#[cfg(not(feature = \"extern-canvas\"))]\n\nfn extern_canvas_init() -> Result<(), NwgError> {\n\n Ok(())\n\n}\n\n\n","file_path":"native-windows-gui/src/win32/mod.rs","rank":91,"score":207489.1784897462},{"content":"type Size = (u32, u32);\n\n\n\n/**\n\n Different mode in the application.\n\n\n\n - Draw: Paint pixels\n\n - Erase: Remove painted pixel\n\n*/\n\n#[derive(Debug, Copy, Clone)]\n\npub enum AppMode {\n\n Draw,\n\n Erase\n\n}\n\n\n\n/**\n\n Application state.\n\n Includes the current drawing state and relation with the other running instances of SyncDraw.\n\n*/\n\n#[derive(Default)]\n\npub struct AppData {\n","file_path":"native-windows-gui/examples/sync-draw/src/data.rs","rank":92,"score":207224.6649383987},{"content":"/// Adding/Updating a tooltip after the initial tooltip creation\n\nfn add_tooltip(btn: &nwg::Button, tt: &nwg::Tooltip) {\n\n tt.register(btn, \"This is a button!\");\n\n}\n\n\n","file_path":"native-windows-gui/src/controls/tooltip.rs","rank":93,"score":206784.86820316038},{"content":"#[cfg(feature = \"image-list\")]\n\nfn builder_set_image_list(builder: &TreeViewBuilder, out: &TreeView) {\n\n if builder.image_list.is_some() {\n\n out.set_image_list(builder.image_list);\n\n }\n\n}\n\n\n","file_path":"native-windows-gui/src/controls/treeview.rs","rank":94,"score":204440.68142523622},{"content":"type Callback = dyn Fn(Event, EventData, ControlHandle);\n\n\n\n/**\n\n An opaque structure that represent a window subclass hook.\n\n*/\n\npub struct EventHandler {\n\n handles: Vec<HWND>,\n\n id: SUBCLASSPROC,\n\n subclass_id: UINT_PTR,\n\n}\n\n\n\n/**\n\n An opaque structure that represent a window subclass hook.\n\n*/\n\npub struct RawEventHandler {\n\n handle: HWND,\n\n subclass_proc: SUBCLASSPROC,\n\n handler_id: UINT_PTR,\n\n}\n\n\n\n/**\n\n Note. While there might be a race condition here, it does not matter because\n\n All controls are thread local and the true id is (HANDLE + NOTICE_ID)\n\n The same apply to timers\n\n*/\n","file_path":"native-windows-gui/src/win32/window.rs","rank":95,"score":204399.61730785194}],"string":"[\n {\n \"content\": \"pub fn check_hwnd(handle: &ControlHandle, not_bound: &str, bad_handle: &str) -> HWND {\\n\\n use winapi::um::winuser::IsWindow;\\n\\n\\n\\n if handle.blank() {\\n\\n panic!(\\\"{}\\\", not_bound);\\n\\n }\\n\\n match handle.hwnd() {\\n\\n Some(hwnd) => match unsafe { IsWindow(hwnd) } {\\n\\n 0 => {\\n\\n panic!(\\\"The window handle is no longer valid. This usually means the control was freed by the OS\\\");\\n\\n }\\n\\n _ => hwnd,\\n\\n },\\n\\n None => {\\n\\n panic!(\\\"{}\\\", bad_handle);\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"native-windows-gui/src/win32/base_helper.rs\",\n \"rank\": 0,\n \"score\": 425792.8063651537\n },\n {\n \"content\": \"pub fn build_notice(parent: HWND) -> ControlHandle {\\n\\n let id = NOTICE_ID.fetch_add(1, Ordering::SeqCst);\\n\\n ControlHandle::Notice(parent, id)\\n\\n}\\n\\n\\n\\npub unsafe fn build_timer(parent: HWND, interval: u32, stopped: bool) -> ControlHandle {\\n\\n use winapi::um::winuser::SetTimer;\\n\\n\\n\\n let id = TIMER_ID.fetch_add(1, Ordering::SeqCst);\\n\\n\\n\\n if !stopped {\\n\\n SetTimer(parent, id as UINT_PTR, interval as UINT, None);\\n\\n }\\n\\n\\n\\n ControlHandle::Timer(parent, id)\\n\\n}\\n\\n\\n\\n/**\\n\\n Hook the window subclass with the default event dispatcher.\\n\\n The hook is applied to the window and all it's children (recursively).\\n\\n\\n\\n Returns a `EventHandler` that can be passed to `unbind_event_handler` to remove the callbacks.\\n\\n\\n\\n This function will panic if `handle` is not a window handle.\\n\\n*/\\n\",\n \"file_path\": \"native-windows-gui/src/win32/window.rs\",\n \"rank\": 1,\n \"score\": 407816.1004294588\n },\n {\n \"content\": \"#[cfg(feature = \\\"timer\\\")]\\n\\npub fn start_timer(hwnd: HWND, id: u32, interval: u32) {\\n\\n use winapi::shared::basetsd::UINT_PTR;\\n\\n use winapi::um::winuser::SetTimer;\\n\\n\\n\\n unsafe {\\n\\n SetTimer(hwnd, id as UINT_PTR, interval, None);\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"native-windows-gui/src/win32/window_helper.rs\",\n \"rank\": 2,\n \"score\": 364809.42708012677\n },\n {\n \"content\": \"#[cfg(feature = \\\"timer\\\")]\\n\\npub fn kill_timer(hwnd: HWND, id: u32) {\\n\\n use winapi::shared::basetsd::UINT_PTR;\\n\\n use winapi::um::winuser::KillTimer;\\n\\n\\n\\n unsafe {\\n\\n KillTimer(hwnd, id as UINT_PTR);\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"native-windows-gui/src/win32/window_helper.rs\",\n \"rank\": 3,\n \"score\": 364542.670746353\n },\n {\n \"content\": \"pub fn send_message(hwnd: HWND, msg: UINT, w: WPARAM, l: LPARAM) -> LRESULT {\\n\\n unsafe { ::winapi::um::winuser::SendMessageW(hwnd, msg, w, l) }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"native-windows-gui/src/win32/window_helper.rs\",\n \"rank\": 4,\n \"score\": 359658.0169545327\n },\n {\n \"content\": \"pub fn destroy_menu_item(parent: HMENU, item_id: u32) {\\n\\n use winapi::um::winuser::{DeleteMenu, GetMenuItemCount, GetMenuItemID, MF_BYPOSITION};\\n\\n\\n\\n unsafe {\\n\\n let count = GetMenuItemCount(parent);\\n\\n let mut index = 0;\\n\\n\\n\\n while index < count {\\n\\n let id = GetMenuItemID(parent, index);\\n\\n match id == item_id {\\n\\n true => {\\n\\n DeleteMenu(parent, index as u32, MF_BYPOSITION);\\n\\n index = count;\\n\\n }\\n\\n false => {\\n\\n index += 1;\\n\\n }\\n\\n }\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"native-windows-gui/src/win32/window_helper.rs\",\n \"rank\": 6,\n \"score\": 347390.88014093885\n },\n {\n \"content\": \"/// Build two group of checkboxes on the same parent with the GROUP flags\\n\\nfn build_radio_groups(radios: &mut [nwg::RadioButton], parent: &nwg::Window) {\\n\\n use nwg::RadioButtonFlags as RadioF;\\n\\n\\n\\n // Group 1\\n\\n nwg::RadioButton::builder()\\n\\n .flags(RadioF::VISIBLE | RadioF::GROUP)\\n\\n .parent(parent)\\n\\n .build(&mut radios[0]);\\n\\n\\n\\n nwg::RadioButton::builder()\\n\\n .parent(parent)\\n\\n .build(&mut radios[1]);\\n\\n\\n\\n // Group 2\\n\\n nwg::RadioButton::builder()\\n\\n .flags(RadioF::VISIBLE | RadioF::GROUP)\\n\\n .parent(parent)\\n\\n .build(&mut radios[2]);\\n\\n\\n\\n nwg::RadioButton::builder()\\n\\n .parent(parent)\\n\\n .build(&mut radios[3]);\\n\\n}\\n\\n\\n\\n\\n\\n```\\n\\n\\n\\n```rust\\n\\nuse native_windows_gui as nwg;\\n\",\n \"file_path\": \"native-windows-gui/src/controls/radio_button.rs\",\n \"rank\": 7,\n \"score\": 331302.2963296169\n },\n {\n \"content\": \"pub fn post_message(hwnd: HWND, msg: UINT, w: WPARAM, l: LPARAM) {\\n\\n unsafe { ::winapi::um::winuser::PostMessageW(hwnd, msg, w, l) };\\n\\n}\\n\\n\\n\\npub unsafe fn set_focus(handle: HWND) {\\n\\n ::winapi::um::winuser::SetFocus(handle);\\n\\n}\\n\\n\\n\\npub unsafe fn get_focus(handle: HWND) -> bool {\\n\\n ::winapi::um::winuser::GetFocus() == handle\\n\\n}\\n\\n\\n\\npub unsafe fn get_window_text(handle: HWND) -> String {\\n\\n use winapi::um::winuser::{GetWindowTextLengthW, GetWindowTextW};\\n\\n\\n\\n let buffer_size = GetWindowTextLengthW(handle) as usize + 1;\\n\\n if buffer_size == 0 {\\n\\n return String::new();\\n\\n }\\n\\n\\n\",\n \"file_path\": \"native-windows-gui/src/win32/window_helper.rs\",\n \"rank\": 8,\n \"score\": 330942.0133975375\n },\n {\n \"content\": \"pub fn modal_error_message<'a, P: Into<ControlHandle>>(\\n\\n parent: P,\\n\\n title: &'a str,\\n\\n content: &'a str,\\n\\n) -> MessageChoice {\\n\\n let params = MessageParams {\\n\\n title,\\n\\n content,\\n\\n buttons: MessageButtons::Ok,\\n\\n icons: MessageIcons::Error,\\n\\n };\\n\\n\\n\\n modal_message(parent, ¶ms)\\n\\n}\\n\\n\\n\\n/**\\n\\n Display a simple message box. The message box has for style `MessageButtons::Ok` and `MessageIcons::Info`.\\n\\n It is recommended to use `modal_info_message` because it locks the window that creates the message box.\\n\\n This method may be deprecated in the future\\n\\n\\n\\n Parameters:\\n\\n * title: The message box title\\n\\n * content: The message box message\\n\\n*/\\n\",\n \"file_path\": \"native-windows-gui/src/win32/message_box.rs\",\n \"rank\": 9,\n \"score\": 330129.86239140213\n },\n {\n \"content\": \"fn build_combobox(combo: &mut nwg::ComboBox<&'static str>, window: &nwg::Window) {\\n\\n let data = vec![\\\"one\\\", \\\"two\\\"];\\n\\n\\n\\n nwg::ComboBox::builder()\\n\\n .size((200, 300))\\n\\n .collection(data)\\n\\n .selected_index(Some(0))\\n\\n .parent(window)\\n\\n .build(combo);\\n\\n}\\n\\n```\\n\\n*/\\n\\n#[derive(Default)]\\n\\npub struct ComboBox<D: Display + Default> {\\n\\n pub handle: ControlHandle,\\n\\n collection: RefCell<Vec<D>>,\\n\\n handler0: RefCell<Option<RawEventHandler>>,\\n\\n}\\n\\n\\n\\nimpl<D: Display + Default> ComboBox<D> {\\n\",\n \"file_path\": \"native-windows-gui/src/controls/combo_box.rs\",\n \"rank\": 10,\n \"score\": 326640.941004106\n },\n {\n \"content\": \"pub fn has_raw_handler(handle: &ControlHandle, handler_id: UINT_PTR) -> bool {\\n\\n let handle = handle\\n\\n .hwnd()\\n\\n .expect(\\\"This type of control cannot have a raw handler.\\\");\\n\\n let subclass_proc: SUBCLASSPROC = Some(process_raw_events);\\n\\n let mut tmp_value = 0;\\n\\n unsafe { GetWindowSubclass(handle, subclass_proc, handler_id, &mut tmp_value) != 0 }\\n\\n}\\n\\n\\n\\n/**\\n\\n Remove the raw event handler from the associated window.\\n\\n Calling unbind twice or trying to unbind an handler after destroying its parent will cause the function to panic.\\n\\n*/\\n\",\n \"file_path\": \"native-windows-gui/src/win32/window.rs\",\n \"rank\": 11,\n \"score\": 324714.097019256\n },\n {\n \"content\": \"#[cfg(any(feature = \\\"list-view\\\", feature = \\\"progress-bar\\\"))]\\n\\npub fn set_style(handle: HWND, style: u32) {\\n\\n use ::winapi::um::winuser::GWL_STYLE;\\n\\n set_window_long(handle, GWL_STYLE, style as usize);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"native-windows-gui/src/win32/window_helper.rs\",\n \"rank\": 12,\n \"score\": 317646.2883633448\n },\n {\n \"content\": \"fn build_listbox(listb: &mut nwg::ListBox<&'static str>, window: &nwg::Window, font: &nwg::Font) {\\n\\n nwg::ListBox::builder()\\n\\n .flags(nwg::ListBoxFlags::VISIBLE | nwg::ListBoxFlags::MULTI_SELECT)\\n\\n .collection(vec![\\\"Hello\\\", \\\"World\\\", \\\"!!!!\\\"])\\n\\n .multi_selection(vec![0, 1, 2])\\n\\n .font(Some(font))\\n\\n .parent(window)\\n\\n .build(listb);\\n\\n}\\n\\n```\\n\\n\\n\\n*/\\n\\n#[derive(Default)]\\n\\npub struct ListBox<D: Display + Default> {\\n\\n pub handle: ControlHandle,\\n\\n collection: RefCell<Vec<D>>,\\n\\n}\\n\\n\\n\\nimpl<D: Display + Default> ListBox<D> {\\n\\n pub fn builder<'a>() -> ListBoxBuilder<'a, D> {\\n\",\n \"file_path\": \"native-windows-gui/src/controls/list_box.rs\",\n \"rank\": 13,\n \"score\": 315448.9148122943\n },\n {\n \"content\": \"fn basic_stuff(window: &nwg::Window) -> Result<(), nwg::NwgError> {\\n\\n nwg::ControlBase::build_hwnd()\\n\\n .class_name(\\\"BUTTON\\\")\\n\\n .forced_flags(0)\\n\\n .flags(0)\\n\\n .size((100, 100))\\n\\n .position((100, 100))\\n\\n .text(\\\"HELLO\\\")\\n\\n .parent(Some(window.handle))\\n\\n .build()?;\\n\\n\\n\\n #[cfg(feature = \\\"menu\\\")]\\n\\n nwg::ControlBase::build_hmenu()\\n\\n .text(\\\"Item\\\")\\n\\n .item(true)\\n\\n .parent(window.handle)\\n\\n .build()?;\\n\\n\\n\\n Ok(())\\n\\n}\\n\",\n \"file_path\": \"native-windows-gui/src/controls/control_base.rs\",\n \"rank\": 14,\n \"score\": 314398.61692491896\n },\n {\n \"content\": \"#[cfg(any(feature = \\\"timer\\\", feature = \\\"animation-timer\\\", feature = \\\"notice\\\"))]\\n\\npub fn window_valid(hwnd: HWND) -> bool {\\n\\n use winapi::um::winuser::IsWindow;\\n\\n\\n\\n unsafe { IsWindow(hwnd) != 0 }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"native-windows-gui/src/win32/window_helper.rs\",\n \"rank\": 15,\n \"score\": 311848.95490275073\n },\n {\n \"content\": \"pub fn init_common_controls() -> Result<(), NwgError> {\\n\\n use winapi::shared::winerror::{S_FALSE, S_OK};\\n\\n use winapi::um::commctrl::{InitCommonControlsEx, INITCOMMONCONTROLSEX};\\n\\n use winapi::um::commctrl::{\\n\\n ICC_BAR_CLASSES, ICC_DATE_CLASSES, ICC_LISTVIEW_CLASSES, ICC_PROGRESS_CLASS,\\n\\n ICC_STANDARD_CLASSES, ICC_TAB_CLASSES, ICC_TREEVIEW_CLASSES,\\n\\n };\\n\\n use winapi::um::libloaderapi::LoadLibraryW;\\n\\n use winapi::um::objbase::CoInitialize;\\n\\n\\n\\n unsafe {\\n\\n let mut classes = ICC_BAR_CLASSES | ICC_STANDARD_CLASSES;\\n\\n\\n\\n if cfg!(feature = \\\"datetime-picker\\\") {\\n\\n classes |= ICC_DATE_CLASSES;\\n\\n }\\n\\n\\n\\n if cfg!(feature = \\\"progress-bar\\\") {\\n\\n classes |= ICC_PROGRESS_CLASS;\\n\\n }\\n\",\n \"file_path\": \"native-windows-gui/src/win32/mod.rs\",\n \"rank\": 16,\n \"score\": 305404.44116310985\n },\n {\n \"content\": \"fn build_timer(parent: &nwg::Window) {\\n\\n let mut timer = Default::default();\\n\\n nwg::Timer::builder()\\n\\n .parent(parent)\\n\\n .interval(100)\\n\\n .stopped(false)\\n\\n .build(&mut timer);\\n\\n}\\n\\n```\\n\\n*/\\n\\n#[deprecated(\\n\\n since = \\\"1.0.11\\\",\\n\\n note = \\\"Use AnimationTimer instead. The winapi timer does not have a constant tick and will call your single threaded from another thread.\\\"\\n\\n)]\\n\\n#[derive(Default)]\\n\\npub struct Timer {\\n\\n pub handle: ControlHandle,\\n\\n interval: RefCell<u32>,\\n\\n}\\n\\n\\n\",\n \"file_path\": \"native-windows-gui/src/controls/timer.rs\",\n \"rank\": 17,\n \"score\": 301945.42417021544\n },\n {\n \"content\": \"/// Builds a timer that will animation something at 60fps for 3 sec\\n\\nfn build_timer(parent: &nwg::Window) {\\n\\n let mut timer = Default::default();\\n\\n nwg::AnimationTimer::builder()\\n\\n .parent(parent)\\n\\n .interval(Duration::from_millis(1000/60))\\n\\n .lifetime(Some(Duration::from_millis(3000)))\\n\\n .build(&mut timer);\\n\\n}\\n\\n```\\n\\n*/\\n\\n#[derive(Default, PartialEq, Eq)]\\n\\npub struct AnimationTimer {\\n\\n pub handle: ControlHandle,\\n\\n}\\n\\n\\n\\nimpl AnimationTimer {\\n\\n pub fn builder() -> AnimationTimerBuilder {\\n\\n AnimationTimerBuilder {\\n\\n parent: None,\\n\\n interval: Duration::from_millis(1000 / 60),\\n\",\n \"file_path\": \"native-windows-gui/src/controls/animation_timer.rs\",\n \"rank\": 18,\n \"score\": 297765.75520377525\n },\n {\n \"content\": \"/// Haha you maybe though that destroying windows would be easy right? WRONG.\\n\\n/// The window children must first be destroyed otherwise `DestroyWindow` will free them and the associated rust value will be ~CORRUPTED~\\n\\npub fn destroy_window(hwnd: HWND) {\\n\\n use winapi::um::winuser::{DestroyWindow, SetParent};\\n\\n\\n\\n // Remove the children from the window\\n\\n iterate_window_children(hwnd, |child| unsafe {\\n\\n set_window_visibility(child, false);\\n\\n SetParent(child, ptr::null_mut());\\n\\n });\\n\\n\\n\\n unsafe {\\n\\n DestroyWindow(hwnd);\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"native-windows-gui/src/win32/window_helper.rs\",\n \"rank\": 19,\n \"score\": 295672.14123838255\n },\n {\n \"content\": \"pub fn modal_message<'a, P: Into<ControlHandle>>(\\n\\n parent: P,\\n\\n params: &MessageParams,\\n\\n) -> MessageChoice {\\n\\n let control_handle = parent.into();\\n\\n let hwnd = control_handle.hwnd().expect(\\\"expected window like control\\\");\\n\\n inner_message(hwnd, params)\\n\\n}\\n\\n\\n\\n/**\\n\\n Display a message box and then panic. The message box has for style `MessageButtons::Ok` and `MessageIcons::Error` .\\n\\n It is recommended to use `modal_fatal_message` because it locks the window that creates the message box.\\n\\n This method may be deprecated in the future\\n\\n\\n\\n Parameters:\\n\\n * title: The message box title\\n\\n * content: The message box message\\n\\n*/\\n\",\n \"file_path\": \"native-windows-gui/src/win32/message_box.rs\",\n \"rank\": 20,\n \"score\": 294954.52045271784\n },\n {\n \"content\": \"pub fn get_window_parent(hwnd: HWND) -> HWND {\\n\\n use winapi::um::winuser::GetParent;\\n\\n unsafe { GetParent(hwnd) }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"native-windows-gui/src/win32/window_helper.rs\",\n \"rank\": 21,\n \"score\": 294061.74235722877\n },\n {\n \"content\": \"pub fn modal_fatal_message<'a, P: Into<ControlHandle>>(\\n\\n parent: P,\\n\\n title: &'a str,\\n\\n content: &'a str,\\n\\n) -> ! {\\n\\n modal_error_message(parent, title, content);\\n\\n panic!(\\\"{} - {}\\\", title, content);\\n\\n}\\n\\n\\n\\n/**\\n\\n Display a simple error message box. The message box has for style `MessageButtons::Ok` and `MessageIcons::Error`.\\n\\n It is recommended to use `modal_error_message` because it locks the window that creates the message box.\\n\\n This method may be deprecated in the future\\n\\n\\n\\n Parameters:\\n\\n * title: The message box title\\n\\n * content: The message box message\\n\\n*/\\n\",\n \"file_path\": \"native-windows-gui/src/win32/message_box.rs\",\n \"rank\": 22,\n \"score\": 290267.28053937166\n },\n {\n \"content\": \"pub fn modal_info_message<'a, P: Into<ControlHandle>>(\\n\\n parent: P,\\n\\n title: &'a str,\\n\\n content: &'a str,\\n\\n) -> MessageChoice {\\n\\n let params = MessageParams {\\n\\n title,\\n\\n content,\\n\\n buttons: MessageButtons::Ok,\\n\\n icons: MessageIcons::Info,\\n\\n };\\n\\n\\n\\n modal_message(parent, ¶ms)\\n\\n}\\n\",\n \"file_path\": \"native-windows-gui/src/win32/message_box.rs\",\n \"rank\": 23,\n \"score\": 290267.28053937166\n },\n {\n \"content\": \"fn print_char(data: &nwg::EventData) {\\n\\n println!(\\\"{:?}\\\", data.on_char());\\n\\n}\\n\\n\\n\",\n \"file_path\": \"native-windows-gui/examples/partials_d.rs\",\n \"rank\": 24,\n \"score\": 287202.4364616673\n },\n {\n \"content\": \"fn build_dtp(date: &mut nwg::DatePicker, window: &nwg::Window) {\\n\\n let v = nwg::DatePickerValue { year: 2000, month: 10, day: 5 };\\n\\n let v1 = nwg::DatePickerValue { year: 2000, month: 10, day: 5 };\\n\\n let v2 = nwg::DatePickerValue { year: 2012, month: 10, day: 5 };\\n\\n\\n\\n nwg::DatePicker::builder()\\n\\n .size((200, 300))\\n\\n .position((0, 0))\\n\\n .date(Some(v))\\n\\n .format(Some(\\\"'YEAR: 'yyyy\\\"))\\n\\n .range(Some([v1, v2]))\\n\\n .parent(window)\\n\\n .build(date);\\n\\n}\\n\\n```\\n\\n*/\\n\\n#[derive(Default, PartialEq, Eq)]\\n\\npub struct DatePicker {\\n\\n pub handle: ControlHandle,\\n\\n}\\n\",\n \"file_path\": \"native-windows-gui/src/controls/date_picker.rs\",\n \"rank\": 25,\n \"score\": 287164.91250748653\n },\n {\n \"content\": \"fn build_trackbar(track: &mut nwg::TrackBar, window: &nwg::Window) {\\n\\n nwg::TrackBar::builder()\\n\\n .range(Some(0..100))\\n\\n .pos(Some(10))\\n\\n .parent(window)\\n\\n .build(track);\\n\\n}\\n\\n```\\n\\n\\n\\n*/\\n\\n#[derive(Default)]\\n\\npub struct TrackBar {\\n\\n pub handle: ControlHandle,\\n\\n background_brush: Option<HBRUSH>,\\n\\n handler0: RefCell<Option<RawEventHandler>>,\\n\\n}\\n\\n\\n\\nimpl TrackBar {\\n\\n pub fn builder() -> TrackBarBuilder {\\n\\n TrackBarBuilder {\\n\",\n \"file_path\": \"native-windows-gui/src/controls/track_bar.rs\",\n \"rank\": 26,\n \"score\": 287164.91250748653\n },\n {\n \"content\": \"fn build_scrollbar(button: &mut nwg::ScrollBar, window: &nwg::Window) {\\n\\n nwg::ScrollBar::builder()\\n\\n .range(Some(0..100))\\n\\n .pos(Some(10))\\n\\n .parent(window)\\n\\n .build(button);\\n\\n}\\n\\n```\\n\\n*/\\n\\n#[derive(Default)]\\n\\npub struct ScrollBar {\\n\\n pub handle: ControlHandle,\\n\\n handler0: RefCell<Option<RawEventHandler>>,\\n\\n handler1: RefCell<Option<RawEventHandler>>,\\n\\n}\\n\\n\\n\\nimpl ScrollBar {\\n\\n pub fn builder<'a>() -> ScrollBarBuilder {\\n\\n ScrollBarBuilder {\\n\\n size: (25, 100),\\n\",\n \"file_path\": \"native-windows-gui/src/controls/scroll_bar.rs\",\n \"rank\": 27,\n \"score\": 287164.9125074865\n },\n {\n \"content\": \"fn build_progress_bar(bar: &mut nwg::ProgressBar, window: &nwg::Window) {\\n\\n nwg::ProgressBar::builder()\\n\\n .state(nwg::ProgressBarState::Paused)\\n\\n .step(10)\\n\\n .range(0..100)\\n\\n .parent(window)\\n\\n .build(bar);\\n\\n}\\n\\n```\\n\\n\\n\\n*/\\n\\n#[derive(Default, PartialEq, Eq)]\\n\\npub struct ProgressBar {\\n\\n pub handle: ControlHandle,\\n\\n}\\n\\n\\n\\nimpl ProgressBar {\\n\\n pub fn builder() -> ProgressBarBuilder {\\n\\n ProgressBarBuilder {\\n\\n size: (100, 40),\\n\",\n \"file_path\": \"native-windows-gui/src/controls/progress_bar.rs\",\n \"rank\": 28,\n \"score\": 283959.94054601033\n },\n {\n \"content\": \"fn build_button(button: &mut nwg::Button, window: &nwg::Window, font: &nwg::Font) {\\n\\n nwg::Button::builder()\\n\\n .text(\\\"Hello\\\")\\n\\n .flags(nwg::ButtonFlags::VISIBLE)\\n\\n .font(Some(font))\\n\\n .parent(window)\\n\\n .build(button);\\n\\n}\\n\\n```\\n\\n\\n\\n*/\\n\\n#[derive(Default, Eq, PartialEq)]\\n\\npub struct Button {\\n\\n pub handle: ControlHandle,\\n\\n}\\n\\n\\n\\nimpl Button {\\n\\n pub fn builder<'a>() -> ButtonBuilder<'a> {\\n\\n ButtonBuilder {\\n\\n text: \\\"Button\\\",\\n\",\n \"file_path\": \"native-windows-gui/src/controls/button.rs\",\n \"rank\": 29,\n \"score\": 283457.0803326102\n },\n {\n \"content\": \"fn build_label(label: &mut nwg::Label, window: &nwg::Window, font: &nwg::Font) {\\n\\n nwg::Label::builder()\\n\\n .text(\\\"Hello\\\")\\n\\n .font(Some(font))\\n\\n .parent(window)\\n\\n .build(label);\\n\\n}\\n\\n```\\n\\n\\n\\n*/\\n\\n#[derive(Default)]\\n\\npub struct Label {\\n\\n pub handle: ControlHandle,\\n\\n background_brush: Option<HBRUSH>,\\n\\n handler0: RefCell<Option<RawEventHandler>>,\\n\\n handler1: RefCell<Option<RawEventHandler>>,\\n\\n}\\n\\n\\n\\nimpl Label {\\n\\n pub fn builder<'a>() -> LabelBuilder<'a> {\\n\",\n \"file_path\": \"native-windows-gui/src/controls/label.rs\",\n \"rank\": 30,\n \"score\": 283457.0803326102\n },\n {\n \"content\": \"fn print_char(data: &nwg::EventData) {\\n\\n println!(\\\"{:?}\\\", data.on_char());\\n\\n}\\n\\n\\n\",\n \"file_path\": \"native-windows-gui/examples/dyn_layout_d.rs\",\n \"rank\": 31,\n \"score\": 283124.6460254824\n },\n {\n \"content\": \"fn build_frame(button: &mut nwg::ImageFrame, window: &nwg::Window, ico: &nwg::Icon) {\\n\\n nwg::ImageFrame::builder()\\n\\n .parent(window)\\n\\n .build(button);\\n\\n}\\n\\n```\\n\\n*/\\n\\n#[derive(Default)]\\n\\npub struct ImageFrame {\\n\\n pub handle: ControlHandle,\\n\\n background_brush: Option<HBRUSH>,\\n\\n handler0: RefCell<Option<RawEventHandler>>,\\n\\n}\\n\\n\\n\\nimpl ImageFrame {\\n\\n pub fn builder<'a>() -> ImageFrameBuilder<'a> {\\n\\n ImageFrameBuilder {\\n\\n size: (100, 100),\\n\\n position: (0, 0),\\n\\n flags: None,\\n\",\n \"file_path\": \"native-windows-gui/src/controls/image_frame.rs\",\n \"rank\": 32,\n \"score\": 277545.9951814688\n },\n {\n \"content\": \"fn build_checkbox(button: &mut nwg::CheckBox, window: &nwg::Window, font: &nwg::Font) {\\n\\n nwg::CheckBox::builder()\\n\\n .text(\\\"Hello\\\")\\n\\n .flags(nwg::CheckBoxFlags::VISIBLE)\\n\\n .font(Some(font))\\n\\n .parent(window)\\n\\n .build(button);\\n\\n}\\n\\n```\\n\\n*/\\n\\n#[derive(Default)]\\n\\npub struct CheckBox {\\n\\n pub handle: ControlHandle,\\n\\n background_brush: Option<HBRUSH>,\\n\\n handler0: RefCell<Option<RawEventHandler>>,\\n\\n}\\n\\n\\n\\nimpl CheckBox {\\n\\n pub fn builder<'a>() -> CheckBoxBuilder<'a> {\\n\\n CheckBoxBuilder {\\n\",\n \"file_path\": \"native-windows-gui/src/controls/check_box.rs\",\n \"rank\": 33,\n \"score\": 277545.9951814688\n },\n {\n \"content\": \"fn build_label(label: &mut nwg::RichLabel, window: &nwg::Window, font: &nwg::Font) {\\n\\n nwg::RichLabel::builder()\\n\\n .text(\\\"Hello\\\")\\n\\n .font(Some(font))\\n\\n .parent(window)\\n\\n .build(label);\\n\\n}\\n\\n\\n\\n*/\\n\\n#[derive(Default)]\\n\\npub struct RichLabel {\\n\\n pub handle: ControlHandle,\\n\\n line_height: Rc<RefCell<Option<i32>>>,\\n\\n handler0: RefCell<Option<RawEventHandler>>,\\n\\n}\\n\\n\\n\\nimpl RichLabel {\\n\\n pub fn builder<'a>() -> RichLabelBuilder<'a> {\\n\\n RichLabelBuilder {\\n\\n text: \\\"A rich label\\\",\\n\",\n \"file_path\": \"native-windows-gui/src/controls/rich_label.rs\",\n \"rank\": 34,\n \"score\": 277545.9951814688\n },\n {\n \"content\": \"fn build_status(status: &mut nwg::StatusBar, window: &nwg::Window, font: &nwg::Font) {\\n\\n nwg::StatusBar::builder()\\n\\n .text(\\\"Hello\\\")\\n\\n .font(Some(font))\\n\\n .parent(window)\\n\\n .build(status);\\n\\n}\\n\\n```\\n\\n\\n\\n*/\\n\\n#[derive(Default)]\\n\\npub struct StatusBar {\\n\\n pub handle: ControlHandle,\\n\\n handler0: RefCell<Option<RawEventHandler>>,\\n\\n}\\n\\n\\n\\nimpl StatusBar {\\n\\n pub fn builder<'a>() -> StatusBarBuilder<'a> {\\n\\n StatusBarBuilder {\\n\\n text: \\\"\\\",\\n\",\n \"file_path\": \"native-windows-gui/src/controls/status_bar.rs\",\n \"rank\": 35,\n \"score\": 277545.9951814688\n },\n {\n \"content\": \"fn build_box(tbox: &mut nwg::TextInput, window: &nwg::Window, font: &nwg::Font) {\\n\\n nwg::TextInput::builder()\\n\\n .text(\\\"Hello\\\")\\n\\n .font(Some(font))\\n\\n .parent(window)\\n\\n .build(tbox);\\n\\n}\\n\\n```\\n\\n*/\\n\\n#[derive(Default)]\\n\\npub struct TextInput {\\n\\n pub handle: ControlHandle,\\n\\n background_brush: Option<HBRUSH>,\\n\\n handler0: RefCell<Option<RawEventHandler>>,\\n\\n}\\n\\n\\n\\nimpl TextInput {\\n\\n pub fn builder<'a>() -> TextInputBuilder<'a> {\\n\\n TextInputBuilder {\\n\\n text: \\\"\\\",\\n\",\n \"file_path\": \"native-windows-gui/src/controls/text_input.rs\",\n \"rank\": 36,\n \"score\": 277545.9951814688\n },\n {\n \"content\": \"fn build_box(tbox: &mut nwg::TextBox, window: &nwg::Window, font: &nwg::Font) {\\n\\n nwg::TextBox::builder()\\n\\n .text(\\\"Hello\\\")\\n\\n .font(Some(font))\\n\\n .parent(window)\\n\\n .build(tbox);\\n\\n}\\n\\n```\\n\\n*/\\n\\n#[derive(Default, PartialEq, Eq)]\\n\\npub struct TextBox {\\n\\n pub handle: ControlHandle,\\n\\n}\\n\\n\\n\\nimpl TextBox {\\n\\n pub fn builder<'a>() -> TextBoxBuilder<'a> {\\n\\n TextBoxBuilder {\\n\\n text: \\\"\\\",\\n\\n size: (100, 25),\\n\\n position: (0, 0),\\n\",\n \"file_path\": \"native-windows-gui/src/controls/text_box.rs\",\n \"rank\": 37,\n \"score\": 277545.9951814688\n },\n {\n \"content\": \"fn build_radio(radio: &mut nwg::RadioButton, window: &nwg::Window, font: &nwg::Font) {\\n\\n nwg::RadioButton::builder()\\n\\n .text(\\\"Hello\\\")\\n\\n .flags(nwg::RadioButtonFlags::VISIBLE)\\n\\n .font(Some(font))\\n\\n .parent(window)\\n\\n .build(radio);\\n\\n}\\n\\n```\\n\\n\\n\\n*/\\n\\n#[derive(Default)]\\n\\npub struct RadioButton {\\n\\n pub handle: ControlHandle,\\n\\n background_brush: Option<HBRUSH>,\\n\\n handler0: RefCell<Option<RawEventHandler>>,\\n\\n}\\n\\n\\n\\nimpl RadioButton {\\n\\n pub fn builder<'a>() -> RadioButtonBuilder<'a> {\\n\",\n \"file_path\": \"native-windows-gui/src/controls/radio_button.rs\",\n \"rank\": 38,\n \"score\": 277545.9951814688\n },\n {\n \"content\": \"#[inline(always)]\\n\\n#[cfg(target_pointer_width = \\\"32\\\")]\\n\\npub fn set_window_long(handle: HWND, index: c_int, v: usize) {\\n\\n unsafe {\\n\\n ::winapi::um::winuser::SetWindowLongW(handle, index, v as LONG);\\n\\n }\\n\\n}\\n\\n\\n\\n// Helper to wrap DeferWindowPos somewhat safely\\n\\n// Mostly to streamline the usage of the returned HWDP from DeferWindowPos\\n\\npub struct DeferredWindowPositioner {\\n\\n handle: winapi::um::winuser::HDWP,\\n\\n}\\n\\n\\n\\nimpl DeferredWindowPositioner {\\n\\n const MEM_FAIL: &'static str = \\\"Insufficient system resources\\\";\\n\\n\\n\\n /// Initialises a new DeferredWindowPositioner with memory for `item_count` windows\\n\\n pub fn new(item_count: i32) -> Result<DeferredWindowPositioner, &'static str> {\\n\\n use ::winapi::um::winuser::BeginDeferWindowPos;\\n\\n\\n\\n let handle = unsafe { BeginDeferWindowPos(item_count) };\\n\",\n \"file_path\": \"native-windows-gui/src/win32/window_helper.rs\",\n \"rank\": 39,\n \"score\": 277511.6840719576\n },\n {\n \"content\": \"pub fn minimize_window(handle: HWND) {\\n\\n use winapi::um::winuser::{ShowWindow, SW_MINIMIZE};\\n\\n unsafe {\\n\\n ShowWindow(handle, SW_MINIMIZE);\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"native-windows-gui/src/win32/window_helper.rs\",\n \"rank\": 40,\n \"score\": 273044.11719047313\n },\n {\n \"content\": \"pub fn restore_window(handle: HWND) {\\n\\n use winapi::um::winuser::{ShowWindow, SW_RESTORE};\\n\\n unsafe {\\n\\n ShowWindow(handle, SW_RESTORE);\\n\\n }\\n\\n}\\n\\n\\n\\n/// Set the font of a window\\n\\npub unsafe fn set_window_font(handle: HWND, font_handle: Option<HFONT>, redraw: bool) {\\n\\n use winapi::um::winuser::SendMessageW;\\n\\n use winapi::um::winuser::WM_SETFONT;\\n\\n\\n\\n let font_handle = font_handle.unwrap_or(ptr::null_mut());\\n\\n\\n\\n SendMessageW(handle, WM_SETFONT, font_handle as usize, redraw as LPARAM);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"native-windows-gui/src/win32/window_helper.rs\",\n \"rank\": 41,\n \"score\": 273044.11719047313\n },\n {\n \"content\": \"pub fn maximize_window(handle: HWND) {\\n\\n use winapi::um::winuser::{ShowWindow, SW_MAXIMIZE};\\n\\n unsafe {\\n\\n ShowWindow(handle, SW_MAXIMIZE);\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"native-windows-gui/src/win32/window_helper.rs\",\n \"rank\": 42,\n \"score\": 273044.11719047313\n },\n {\n \"content\": \"fn build_number_select(num_select: &mut nwg::NumberSelect, window: &nwg::Window, font: &nwg::Font) {\\n\\n nwg::NumberSelect::builder()\\n\\n .font(Some(font))\\n\\n .parent(window)\\n\\n .build(num_select);\\n\\n}\\n\\n```\\n\\n\\n\\n*/\\n\\n#[derive(Default)]\\n\\npub struct NumberSelect {\\n\\n pub handle: ControlHandle,\\n\\n data: Rc<RefCell<NumberSelectData>>,\\n\\n edit: TextInput,\\n\\n btn_up: Button,\\n\\n btn_down: Button,\\n\\n handler: Option<RawEventHandler>,\\n\\n}\\n\\n\\n\\nimpl NumberSelect {\\n\",\n \"file_path\": \"native-windows-gui/src/controls/number_select.rs\",\n \"rank\": 43,\n \"score\": 272013.5809008528\n },\n {\n \"content\": \"pub fn slice_as_bytes<'a, D: Copy>(data: &'a [D]) -> &'a [u8] {\\n\\n unsafe {\\n\\n data.align_to().1\\n\\n }\\n\\n}\\n\\n\\n\\n\\n\",\n \"file_path\": \"native-windows-gui/examples/wgpu_canvas/src/main.rs\",\n \"rank\": 45,\n \"score\": 268473.4726190473\n },\n {\n \"content\": \"/// Create the NWG tab classes\\n\\npub fn create_tab_classes() -> Result<(), NwgError> {\\n\\n use winapi::shared::windef::HBRUSH;\\n\\n use winapi::um::libloaderapi::GetModuleHandleW;\\n\\n use winapi::um::winuser::COLOR_BTNFACE;\\n\\n\\n\\n let hmod = unsafe { GetModuleHandleW(ptr::null_mut()) };\\n\\n if hmod.is_null() {\\n\\n return Err(NwgError::initialization(\\\"GetModuleHandleW failed\\\"));\\n\\n }\\n\\n\\n\\n unsafe {\\n\\n build_sysclass(\\n\\n hmod,\\n\\n TAB_CLASS_ID,\\n\\n Some(tab_proc),\\n\\n Some(COLOR_BTNFACE as HBRUSH),\\n\\n None,\\n\\n )?;\\n\\n }\\n\\n\\n\",\n \"file_path\": \"native-windows-gui/src/win32/tabs.rs\",\n \"rank\": 46,\n \"score\": 267467.1926071784\n },\n {\n \"content\": \"pub fn is_bitmap(handle: HBITMAP) -> bool {\\n\\n use winapi::shared::minwindef::LPVOID;\\n\\n use winapi::um::wingdi::GetBitmapBits;\\n\\n\\n\\n let mut bits: [u8; 1] = [0; 1];\\n\\n unsafe { GetBitmapBits(handle, 1, &mut bits as *mut [u8; 1] as LPVOID) != 0 }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"native-windows-gui/src/win32/resources_helper.rs\",\n \"rank\": 47,\n \"score\": 266002.0258826976\n },\n {\n \"content\": \"/// Initializes some application wide GUI settings.\\n\\n/// This includes default styling and common controls resources.\\n\\npub fn init() -> std::result::Result<(), errors::NwgError> {\\n\\n if cfg!(not(feature = \\\"no-styling\\\")) {\\n\\n enable_visual_styles();\\n\\n }\\n\\n\\n\\n init_common_controls()\\n\\n}\\n\",\n \"file_path\": \"native-windows-gui/src/lib.rs\",\n \"rank\": 48,\n \"score\": 265205.1994537726\n },\n {\n \"content\": \"pub fn get_style(handle: HWND) -> UINT {\\n\\n use ::winapi::um::winuser::GWL_STYLE;\\n\\n get_window_long(handle, GWL_STYLE) as UINT\\n\\n}\\n\\n\\n\",\n \"file_path\": \"native-windows-gui/src/win32/window_helper.rs\",\n \"rank\": 49,\n \"score\": 262768.982102977\n },\n {\n \"content\": \"fn read_custom_data_handle(window: &nwg::Window) -> Option<Hello> {\\n\\n unsafe {\\n\\n nwg::Clipboard::open(window);\\n\\n let handle = nwg::Clipboard::data_handle(nwg::ClipboardFormat::Global(\\\"Hello\\\"));\\n\\n let data = match handle {\\n\\n Some(h) => {\\n\\n let data_ptr: *const Hello = h.cast();\\n\\n let data = *data_ptr;\\n\\n h.release();\\n\\n Some(data)\\n\\n },\\n\\n None => None\\n\\n };\\n\\n\\n\\n nwg::Clipboard::close();\\n\\n data\\n\\n }\\n\\n}\\n\\n\\n\\n```\\n\",\n \"file_path\": \"native-windows-gui/src/win32/clipboard.rs\",\n \"rank\": 50,\n \"score\": 261150.74332321115\n },\n {\n \"content\": \"/// Create the NWG tab classes\\n\\npub fn create_extern_canvas_classes() -> Result<(), NwgError> {\\n\\n use winapi::shared::windef::HBRUSH;\\n\\n use winapi::um::libloaderapi::GetModuleHandleW;\\n\\n use winapi::um::winuser::{CS_HREDRAW, CS_OWNDC, CS_VREDRAW};\\n\\n\\n\\n let hmod = unsafe { GetModuleHandleW(ptr::null_mut()) };\\n\\n if hmod.is_null() {\\n\\n return Err(NwgError::initialization(\\\"GetModuleHandleW failed\\\"));\\n\\n }\\n\\n\\n\\n unsafe {\\n\\n build_sysclass(\\n\\n hmod,\\n\\n EXT_CANVAS_CLASS_ID,\\n\\n Some(extern_canvas_proc),\\n\\n Some(0 as HBRUSH),\\n\\n Some(CS_OWNDC | CS_VREDRAW | CS_HREDRAW),\\n\\n )?;\\n\\n }\\n\\n\\n\",\n \"file_path\": \"native-windows-gui/src/win32/extern_canvas.rs\",\n \"rank\": 51,\n \"score\": 259813.6441822626\n },\n {\n \"content\": \"#[cfg(feature = \\\"tree-view\\\")]\\n\\nfn tree_data(m: u32, notif_raw: *const NMHDR) -> EventData {\\n\\n use crate::{ExpandState, TreeItem, TreeItemAction, TreeItemState};\\n\\n use winapi::um::commctrl::{\\n\\n NMTREEVIEWW, NMTVDISPINFOW, NMTVITEMCHANGE, TVE_COLLAPSE, TVE_EXPAND, TVN_DELETEITEMW,\\n\\n TVN_ENDLABELEDITW, TVN_ITEMCHANGEDW, TVN_ITEMEXPANDEDW, TVN_SELCHANGEDW,\\n\\n };\\n\\n\\n\\n match m {\\n\\n TVN_DELETEITEMW => {\\n\\n let data = unsafe { &*(notif_raw as *const NMTREEVIEWW) };\\n\\n let item = TreeItem {\\n\\n handle: data.itemOld.hItem,\\n\\n };\\n\\n EventData::OnTreeItemDelete(item)\\n\\n }\\n\\n TVN_ITEMEXPANDEDW => {\\n\\n let data = unsafe { &*(notif_raw as *const NMTREEVIEWW) };\\n\\n let item = TreeItem {\\n\\n handle: data.itemNew.hItem,\\n\\n };\\n\",\n \"file_path\": \"native-windows-gui/src/win32/window.rs\",\n \"rank\": 52,\n \"score\": 259698.5517587432\n },\n {\n \"content\": \"#[cfg(not(feature = \\\"tree-view\\\"))]\\n\\nfn tree_data(_m: u32, _notif_raw: *const NMHDR) -> EventData {\\n\\n // If tree-view is not enabled, the data type won't be available so we return NO_DATA\\n\\n NO_DATA\\n\\n}\\n\\n\\n\",\n \"file_path\": \"native-windows-gui/src/win32/window.rs\",\n \"rank\": 53,\n \"score\": 259698.55175874318\n },\n {\n \"content\": \"pub fn get_window_font(handle: HWND) -> HFONT {\\n\\n use winapi::um::winuser::WM_GETFONT;\\n\\n unsafe {\\n\\n let h = send_message(handle, WM_GETFONT, 0, 0);\\n\\n mem::transmute(h)\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"native-windows-gui/src/win32/window_helper.rs\",\n \"rank\": 54,\n \"score\": 259435.44622927145\n },\n {\n \"content\": \"#[cfg(feature = \\\"list-view\\\")]\\n\\nfn list_view_data(m: u32, notif_raw: *const NMHDR) -> EventData {\\n\\n use winapi::um::commctrl::{\\n\\n LVIS_SELECTED, LVN_COLUMNCLICK, LVN_DELETEITEM, LVN_INSERTITEM, LVN_ITEMACTIVATE,\\n\\n LVN_ITEMCHANGED, NMITEMACTIVATE, NMLISTVIEW, NM_CLICK, NM_DBLCLK, NM_RCLICK,\\n\\n };\\n\\n\\n\\n match m {\\n\\n LVN_DELETEITEM | LVN_INSERTITEM | LVN_COLUMNCLICK => {\\n\\n let data: &NMLISTVIEW = unsafe { &*(notif_raw as *const NMLISTVIEW) };\\n\\n EventData::OnListViewItemIndex {\\n\\n row_index: data.iItem as _,\\n\\n column_index: data.iSubItem as _,\\n\\n }\\n\\n }\\n\\n LVN_ITEMACTIVATE | NM_CLICK | NM_DBLCLK | NM_RCLICK => {\\n\\n let data: &NMITEMACTIVATE = unsafe { &*(notif_raw as *const NMITEMACTIVATE) };\\n\\n EventData::OnListViewItemIndex {\\n\\n row_index: data.iItem as _,\\n\\n column_index: data.iSubItem as _,\\n\\n }\\n\",\n \"file_path\": \"native-windows-gui/src/win32/window.rs\",\n \"rank\": 55,\n \"score\": 256188.50690628233\n },\n {\n \"content\": \"#[cfg(not(feature = \\\"list-view\\\"))]\\n\\nfn list_view_data(_m: u32, _notif_raw: *const NMHDR) -> EventData {\\n\\n // If list-view is not enabled, the data type won't be available so we return NO_DATA\\n\\n NO_DATA\\n\\n}\\n\\n\\n\\nunsafe fn static_commands(handle: HWND, m: u16) -> Event {\\n\\n use winapi::um::winuser::SendMessageW;\\n\\n use winapi::um::winuser::{\\n\\n IMAGE_BITMAP, IMAGE_CURSOR, IMAGE_ICON, STM_GETIMAGE, STN_CLICKED, STN_DBLCLK,\\n\\n };\\n\\n\\n\\n let has_image = SendMessageW(handle, STM_GETIMAGE, IMAGE_BITMAP as usize, 0) != 0;\\n\\n let has_icon = SendMessageW(handle, STM_GETIMAGE, IMAGE_ICON as usize, 0) != 0;\\n\\n let has_cursor = SendMessageW(handle, STM_GETIMAGE, IMAGE_CURSOR as usize, 0) != 0;\\n\\n\\n\\n if has_image | has_icon | has_cursor {\\n\\n match m {\\n\\n STN_CLICKED => Event::OnImageFrameClick,\\n\\n STN_DBLCLK => Event::OnImageFrameDoubleClick,\\n\\n _ => Event::Unknown,\\n\",\n \"file_path\": \"native-windows-gui/src/win32/window.rs\",\n \"rank\": 56,\n \"score\": 256188.50690628233\n },\n {\n \"content\": \"type RawCallback = dyn Fn(HWND, UINT, WPARAM, LPARAM) -> Option<LRESULT>;\\n\",\n \"file_path\": \"native-windows-gui/src/win32/window.rs\",\n \"rank\": 57,\n \"score\": 255958.20301655075\n },\n {\n \"content\": \"/// Building a tooltip and add tooltips at the same time\\n\\nfn build_tooltip(tt: &mut nwg::Tooltip, btn1: &nwg::Button, btn2: &nwg::Button) {\\n\\n nwg::Tooltip::builder()\\n\\n .register(btn1, \\\"A test button\\\")\\n\\n .register_callback(btn2)\\n\\n .build(tt);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"native-windows-gui/src/controls/tooltip.rs\",\n \"rank\": 58,\n \"score\": 254496.10319004307\n },\n {\n \"content\": \"pub fn error_message<'a>(title: &'a str, content: &'a str) -> MessageChoice {\\n\\n let params = MessageParams {\\n\\n title,\\n\\n content,\\n\\n buttons: MessageButtons::Ok,\\n\\n icons: MessageIcons::Error,\\n\\n };\\n\\n\\n\\n message(¶ms)\\n\\n}\\n\\n\\n\\n/**\\n\\n Display a simple error message box. The message box has for style `MessageButtons::Ok` and `MessageIcons::Error`.\\n\\n\\n\\n This functions panics if a non window control is used as parent (ex: a menu)\\n\\n\\n\\n Parameters:\\n\\n * parent: Parent window to lock for the duration of the message box\\n\\n * title: The message box title\\n\\n * content: The message box message\\n\\n*/\\n\",\n \"file_path\": \"native-windows-gui/src/win32/message_box.rs\",\n \"rank\": 59,\n \"score\": 254008.26055163238\n },\n {\n \"content\": \"/// Execute the callback for each first level children of the window\\n\\npub fn iterate_window_children<F>(hwnd_parent: HWND, cb: F)\\n\\nwhere\\n\\n F: FnMut(HWND),\\n\\n{\\n\\n use winapi::shared::minwindef::BOOL;\\n\\n use winapi::um::winuser::EnumChildWindows;\\n\\n\\n\\n struct EnumChildData<F> {\\n\\n parent: HWND,\\n\\n callback: F,\\n\\n }\\n\\n\\n\\n unsafe extern \\\"system\\\" fn enum_child<F>(hwnd: HWND, p: LPARAM) -> BOOL\\n\\n where\\n\\n F: FnMut(HWND),\\n\\n {\\n\\n // Only iterate over the top level children\\n\\n let enum_data_ptr = p as *mut EnumChildData<F>;\\n\\n let enum_data = &mut *enum_data_ptr;\\n\\n if get_window_parent(hwnd) == enum_data.parent {\\n\",\n \"file_path\": \"native-windows-gui/src/win32/window_helper.rs\",\n \"rank\": 60,\n \"score\": 252583.84884426685\n },\n {\n \"content\": \"fn iter_tree_view(tree: &mut nwg::TreeView) {\\n\\n for item in tree.iter() {\\n\\n println!(\\\"{:?}\\\", tree.item_text(&item));\\n\\n }\\n\\n}\\n\\n```\\n\\n*/\\n\\n#[allow(unused)]\\n\\npub struct TreeViewIterator<'a> {\\n\\n tree_view: &'a TreeView,\\n\\n tree_view_handle: HWND,\\n\\n base_item: HTREEITEM,\\n\\n current_item: HTREEITEM,\\n\\n action: NextAction,\\n\\n}\\n\\n\\n\\nimpl<'a> TreeViewIterator<'a> {\\n\\n /// Use `TreeView.iter` to create a `TreeViewIterator`\\n\\n pub(crate) fn new(tree_view: &'a TreeView, current_item: HTREEITEM) -> TreeViewIterator {\\n\\n let tree_view_handle = tree_view.handle.hwnd().unwrap();\\n\",\n \"file_path\": \"native-windows-gui/src/controls/treeview_iterator.rs\",\n \"rank\": 61,\n \"score\": 251711.63342688547\n },\n {\n \"content\": \"pub fn dispatch_thread_events_with_callback<F>(mut cb: F)\\n\\nwhere\\n\\n F: FnMut() + 'static,\\n\\n{\\n\\n use winapi::um::winuser::MSG;\\n\\n use winapi::um::winuser::{PeekMessageW, PM_REMOVE, WM_QUIT};\\n\\n\\n\\n unsafe {\\n\\n let mut msg: MSG = mem::zeroed();\\n\\n while msg.message != WM_QUIT {\\n\\n let has_message = PeekMessageW(&mut msg, ptr::null_mut(), 0, 0, PM_REMOVE) != 0;\\n\\n if has_message && IsDialogMessageW(GetAncestor(msg.hwnd, GA_ROOT), &mut msg) == 0 {\\n\\n TranslateMessage(&msg);\\n\\n DispatchMessageW(&msg);\\n\\n }\\n\\n\\n\\n cb();\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\n/**\\n\\n Break the events loop running on the current thread\\n\\n*/\\n\",\n \"file_path\": \"native-windows-gui/src/win32/mod.rs\",\n \"rank\": 62,\n \"score\": 249197.60342995398\n },\n {\n \"content\": \"pub fn destroy_icon(icon: HANDLE) {\\n\\n unsafe {\\n\\n winapi::um::winuser::DestroyIcon(icon as _);\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"native-windows-gui/src/win32/resources_helper.rs\",\n \"rank\": 63,\n \"score\": 243973.79548913508\n },\n {\n \"content\": \"pub fn destroy_cursor(cursor: HANDLE) {\\n\\n unsafe {\\n\\n winapi::um::winuser::DestroyCursor(cursor as _);\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"native-windows-gui/src/win32/resources_helper.rs\",\n \"rank\": 64,\n \"score\": 243973.79548913508\n },\n {\n \"content\": \"pub fn destroy_obj(obj: HANDLE) {\\n\\n unsafe {\\n\\n winapi::um::wingdi::DeleteObject(obj as _);\\n\\n }\\n\\n}\\n\\n\\n\\npub unsafe fn build_font(\\n\\n size: i32,\\n\\n weight: u32,\\n\\n style: [bool; 3],\\n\\n family_name: Option<&str>,\\n\\n) -> Result<HFONT, NwgError> {\\n\\n use winapi::um::wingdi::CreateFontW;\\n\\n use winapi::um::wingdi::{\\n\\n CLEARTYPE_QUALITY, CLIP_DEFAULT_PRECIS, DEFAULT_CHARSET, OUT_DEFAULT_PRECIS, VARIABLE_PITCH,\\n\\n };\\n\\n let [use_italic, use_underline, use_strikeout] = style;\\n\\n\\n\\n let fam;\\n\\n let family_name_ptr;\\n\",\n \"file_path\": \"native-windows-gui/src/win32/resources_helper.rs\",\n \"rank\": 65,\n \"score\": 243973.79548913508\n },\n {\n \"content\": \"fn set_tooltip_dynamic<'a>(app: &ControlsTest, handle: &ControlHandle, data: &ToolTipTextData) {\\n\\n if &app.window == handle {\\n\\n data.set_text(&format!(\\\"Control text: \\\\\\\"{}\\\\\\\"\\\", app.window.text()));\\n\\n } else if &app.test_text_input == handle {\\n\\n data.set_text(&format!(\\\"Control text: \\\\\\\"{}\\\\\\\"\\\", app.test_text_input.text()));\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"native-windows-gui/src/tests/control_test.rs\",\n \"rank\": 66,\n \"score\": 243906.46143679644\n },\n {\n \"content\": \"#[inline(always)]\\n\\n#[cfg(target_pointer_width = \\\"32\\\")]\\n\\npub fn get_window_long(handle: HWND, index: c_int) -> LONG {\\n\\n unsafe { ::winapi::um::winuser::GetWindowLongW(handle, index) }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"native-windows-gui/src/win32/window_helper.rs\",\n \"rank\": 67,\n \"score\": 242951.16786354163\n },\n {\n \"content\": \"fn write_custom_data(window: &nwg::Window) {\\n\\n let data = Hello {\\n\\n foo: 6529,\\n\\n bar: [0, 100, 20]\\n\\n };\\n\\n\\n\\n nwg::Clipboard::open(window);\\n\\n nwg::Clipboard::empty();\\n\\n unsafe {\\n\\n nwg::Clipboard::set_data(\\n\\n nwg::ClipboardFormat::Global(\\\"Hello\\\"),\\n\\n &data as *const Hello,\\n\\n 1\\n\\n );\\n\\n }\\n\\n\\n\\n nwg::Clipboard::close();\\n\\n}\\n\\n\\n\",\n \"file_path\": \"native-windows-gui/src/win32/clipboard.rs\",\n \"rank\": 68,\n \"score\": 241822.5161894818\n },\n {\n \"content\": \"pub fn unbind_raw_event_handler(handler: &RawEventHandler) -> Result<(), NwgError> {\\n\\n let subclass_proc = handler.subclass_proc;\\n\\n let handler_id = handler.handler_id;\\n\\n let handle = handler.handle;\\n\\n\\n\\n unsafe {\\n\\n let mut callback_value: UINT_PTR = 0;\\n\\n let result = GetWindowSubclass(handle, subclass_proc, handler_id, &mut callback_value);\\n\\n if result == 0 {\\n\\n let err = format!(\\n\\n concat!(\\n\\n \\\"Could not fetch raw event handler #{:?}.\\\",\\n\\n \\\"This can happen if the control ({:?}) was freed or\\\",\\n\\n \\\"if this raw event handler was already unbound\\\"\\n\\n ),\\n\\n handler_id, handle\\n\\n );\\n\\n return Err(NwgError::EventsBinding(err));\\n\\n }\\n\\n\\n\",\n \"file_path\": \"native-windows-gui/src/win32/window.rs\",\n \"rank\": 69,\n \"score\": 239994.53392916656\n },\n {\n \"content\": \"#[inline(always)]\\n\\n#[cfg(target_pointer_width = \\\"64\\\")]\\n\\npub fn get_window_long(handle: HWND, index: c_int) -> LONG_PTR {\\n\\n unsafe { ::winapi::um::winuser::GetWindowLongPtrW(handle, index) }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"native-windows-gui/src/win32/window_helper.rs\",\n \"rank\": 70,\n \"score\": 239506.213011357\n },\n {\n \"content\": \"#[cfg(feature = \\\"rich-textbox\\\")]\\n\\npub fn get_class_info(hwnd: HWND) -> Result<WNDCLASSEXW, ()> {\\n\\n use winapi::shared::ntdef::WCHAR;\\n\\n use winapi::um::libloaderapi::GetModuleHandleW;\\n\\n use winapi::um::winuser::{GetClassInfoExW, GetClassNameW};\\n\\n\\n\\n unsafe {\\n\\n let mut info: WNDCLASSEXW = mem::zeroed();\\n\\n\\n\\n let hinst = GetModuleHandleW(ptr::null_mut());\\n\\n\\n\\n let mut class_name_raw: [WCHAR; 100] = [0; 100];\\n\\n let count = GetClassNameW(hwnd, class_name_raw.as_mut_ptr(), 100) as usize;\\n\\n if count == 0 {\\n\\n return Err(());\\n\\n }\\n\\n\\n\\n let result = GetClassInfoExW(hinst, class_name_raw.as_ptr(), &mut info);\\n\\n match result == 0 {\\n\\n true => Err(()),\\n\\n false => Ok(info),\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\n/// Reeturn the background color of a window\\n\",\n \"file_path\": \"native-windows-gui/src/win32/window_helper.rs\",\n \"rank\": 71,\n \"score\": 234188.4048338878\n },\n {\n \"content\": \"#[cfg(feature = \\\"rich-textbox\\\")]\\n\\npub fn get_background_color(hwnd: HWND) -> Result<[u8; 3], ()> {\\n\\n use winapi::um::wingdi::{\\n\\n GetBValue, GetGValue, GetObjectW, GetRValue, GetStockObject, LOGBRUSH,\\n\\n };\\n\\n use winapi::um::winuser::GetSysColorBrush;\\n\\n\\n\\n match get_class_info(hwnd) {\\n\\n Ok(info) => unsafe {\\n\\n let brush = {\\n\\n let stock_handle = info.hbrBackground as usize as i32;\\n\\n let stock = GetStockObject(info.hbrBackground as usize as i32);\\n\\n match stock.is_null() {\\n\\n true => info.hbrBackground,\\n\\n false => {\\n\\n if stock_handle > 0 {\\n\\n // Windows use (stock handle - 1) for the real background color ¯\\\\_(ツ)_/¯\\n\\n GetSysColorBrush(stock_handle - 1)\\n\\n } else {\\n\\n GetSysColorBrush(0)\\n\\n }\\n\",\n \"file_path\": \"native-windows-gui/src/win32/window_helper.rs\",\n \"rank\": 72,\n \"score\": 229859.22177900473\n },\n {\n \"content\": \"fn read_custom_data(window: &nwg::Window) -> Option<Hello> {\\n\\n unsafe {\\n\\n nwg::Clipboard::open(window);\\n\\n let data = nwg::Clipboard::data(nwg::ClipboardFormat::Global(\\\"Hello\\\"));\\n\\n nwg::Clipboard::close();\\n\\n data\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"native-windows-gui/src/win32/clipboard.rs\",\n \"rank\": 73,\n \"score\": 225083.86477708165\n },\n {\n \"content\": \"pub fn fatal_message<'a>(title: &'a str, content: &'a str) -> ! {\\n\\n error_message(title, content);\\n\\n panic!(\\\"{} - {}\\\", title, content);\\n\\n}\\n\\n\\n\\n/**\\n\\n Display a message box and then panic. The message box has for style `MessageButtons::Ok` and `MessageIcons::Error` .\\n\\n\\n\\n This functions panics if a non window control is used as parent (ex: a menu)\\n\\n\\n\\n Parameters:\\n\\n * parent: Parent window to lock for the duration of the message box\\n\\n * title: The message box title\\n\\n * content: The message box message\\n\\n*/\\n\",\n \"file_path\": \"native-windows-gui/src/win32/message_box.rs\",\n \"rank\": 74,\n \"score\": 224443.26939042963\n },\n {\n \"content\": \"pub fn full_bind_event_handler<F>(handle: &ControlHandle, f: F) -> EventHandler\\n\\nwhere\\n\\n F: Fn(Event, EventData, ControlHandle) + 'static,\\n\\n{\\n\\n use winapi::um::winuser::EnumChildWindows;\\n\\n\\n\\n struct SetSubclassParam {\\n\\n callback_ptr: *mut *const Callback,\\n\\n subclass_id: UINT_PTR,\\n\\n }\\n\\n\\n\\n /**\\n\\n Function that iters over a top level window and bind the events dispatch callback\\n\\n */\\n\\n unsafe extern \\\"system\\\" fn set_children_subclass(h: HWND, p: LPARAM) -> i32 {\\n\\n let params_ptr = p as *mut SetSubclassParam;\\n\\n let params = &*params_ptr;\\n\\n\\n\\n let cb: Rc<Callback> = Rc::from_raw(*params.callback_ptr);\\n\\n\\n\",\n \"file_path\": \"native-windows-gui/src/win32/window.rs\",\n \"rank\": 75,\n \"score\": 221512.4861165614\n },\n {\n \"content\": \"pub fn parameters(field: &syn::Field, attr_id: &'static str) -> (Vec<syn::Ident>, Vec<syn::Expr>) {\\n\\n let member = match field.ident.as_ref() {\\n\\n Some(m) => m,\\n\\n None => unreachable!()\\n\\n };\\n\\n\\n\\n let nwg_control = |attr: &&syn::Attribute| {\\n\\n attr.path.get_ident()\\n\\n .map(|id| id == attr_id )\\n\\n .unwrap_or(false)\\n\\n };\\n\\n\\n\\n let attr = match field.attrs.iter().find(nwg_control) {\\n\\n Some(attr) => attr,\\n\\n None => unreachable!()\\n\\n };\\n\\n\\n\\n let ctrl: Parameters = match syn::parse2(attr.tokens.clone()) {\\n\\n Ok(a) => a,\\n\\n Err(e) => panic!(\\\"Failed to parse field #{}: {}\\\", member, e)\\n\",\n \"file_path\": \"native-windows-derive/src/controls.rs\",\n \"rank\": 76,\n \"score\": 221007.08526839627\n },\n {\n \"content\": \"pub fn to_utf16(s: &str) -> Vec<u16> {\\n\\n use std::ffi::OsStr;\\n\\n use std::os::windows::ffi::OsStrExt;\\n\\n\\n\\n OsStr::new(s)\\n\\n .encode_wide()\\n\\n .chain(Some(0u16).into_iter())\\n\\n .collect()\\n\\n}\\n\\n\\n\\n/**\\n\\n Decode a raw utf16 string. Should be null terminated.\\n\\n*/\\n\",\n \"file_path\": \"native-windows-gui/src/win32/base_helper.rs\",\n \"rank\": 77,\n \"score\": 219479.07605763437\n },\n {\n \"content\": \"pub fn stop_thread_dispatch() {\\n\\n use winapi::um::winuser::PostMessageW;\\n\\n use winapi::um::winuser::WM_QUIT;\\n\\n\\n\\n unsafe { PostMessageW(ptr::null_mut(), WM_QUIT, 0, 0) };\\n\\n}\\n\\n\\n\\n/**\\n\\n Enable the Windows visual style in the application without having to use a manifest\\n\\n*/\\n\",\n \"file_path\": \"native-windows-gui/src/win32/mod.rs\",\n \"rank\": 78,\n \"score\": 218667.0639330725\n },\n {\n \"content\": \"pub fn dispatch_thread_events() {\\n\\n use winapi::um::winuser::GetMessageW;\\n\\n use winapi::um::winuser::MSG;\\n\\n\\n\\n unsafe {\\n\\n let mut msg: MSG = mem::zeroed();\\n\\n while GetMessageW(&mut msg, ptr::null_mut(), 0, 0) != 0 {\\n\\n if IsDialogMessageW(GetAncestor(msg.hwnd, GA_ROOT), &mut msg) == 0 {\\n\\n TranslateMessage(&msg);\\n\\n DispatchMessageW(&msg);\\n\\n }\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\n/**\\n\\n Dispatch system evetns in the current thread AND execute a callback after each peeking attempt.\\n\\n Unlike `dispath_thread_events`, this method will not pause the thread while waiting for events.\\n\\n*/\\n\",\n \"file_path\": \"native-windows-gui/src/win32/mod.rs\",\n \"rank\": 79,\n \"score\": 218667.06393307252\n },\n {\n \"content\": \"fn print_char(data: &EventData) {\\n\\n match data {\\n\\n EventData::OnChar(c) => println!(\\\"{:?}\\\", c),\\n\\n _ => {}\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"native-windows-gui/src/tests/control_test.rs\",\n \"rank\": 80,\n \"score\": 217291.50524632214\n },\n {\n \"content\": \"pub fn main() {\\n\\n nwg::init().expect(\\\"Failed to init Native Windows GUI\\\");\\n\\n\\n\\n let app = ExternCanvas::build_ui(Default::default()).expect(\\\"Failed to build UI\\\");\\n\\n\\n\\n // Make sure to render everything at least once before showing the window to remove weird artifacts.\\n\\n app.canvas.create_context();\\n\\n app.canvas.render();\\n\\n\\n\\n // Here we use the `with_callback` version of dispatch_thread_events\\n\\n // Internally the callback will be executed almost as fast as `loop { callback() }`\\n\\n nwg::dispatch_thread_events_with_callback(move || {\\n\\n app.canvas.render();\\n\\n });\\n\\n}\\n\\n\\n\\n\\n\\nconst VS_SRC: &'static [u8] = b\\\"#version 330\\n\\nlayout (location=0) in vec2 a_position;\\n\\nlayout (location=1) in vec4 a_color;\\n\",\n \"file_path\": \"native-windows-gui/examples/opengl_canvas/src/main.rs\",\n \"rank\": 81,\n \"score\": 217281.71488364914\n },\n {\n \"content\": \"pub fn simple_message<'a>(title: &'a str, content: &'a str) -> MessageChoice {\\n\\n let params = MessageParams {\\n\\n title,\\n\\n content,\\n\\n buttons: MessageButtons::Ok,\\n\\n icons: MessageIcons::Info,\\n\\n };\\n\\n\\n\\n message(¶ms)\\n\\n}\\n\\n\\n\\n/**\\n\\n Display a simple message box. The message box has for style `MessageButtons::Ok` and `MessageIcons::Info`.\\n\\n\\n\\n This functions panics if a non window control is used as parent (ex: a menu)\\n\\n\\n\\n Parameters:\\n\\n * parent: Parent window to lock for the duration of the message box\\n\\n * title: The message box title\\n\\n * content: The message box message\\n\\n*/\\n\",\n \"file_path\": \"native-windows-gui/src/win32/message_box.rs\",\n \"rank\": 82,\n \"score\": 215720.85242181097\n },\n {\n \"content\": \"fn build_image_list(list: &mut nwg::ImageList) {\\n\\n nwg::ImageList::builder()\\n\\n .size((64, 64))\\n\\n .initial(10)\\n\\n .grow(1)\\n\\n .build(list);\\n\\n}\\n\\n```\\n\\n\\n\\n*/\\n\\npub struct ImageList {\\n\\n pub handle: HIMAGELIST,\\n\\n pub owned: bool,\\n\\n}\\n\\n\\n\\nimpl ImageList {\\n\\n pub fn builder() -> ImageListBuilder {\\n\\n ImageListBuilder {\\n\\n size: (32, 32),\\n\\n initial: 5,\\n\",\n \"file_path\": \"native-windows-gui/src/resources/image_list.rs\",\n \"rank\": 83,\n \"score\": 215298.53409579542\n },\n {\n \"content\": \"#[cfg(not(feature = \\\"tabs\\\"))]\\n\\nfn tabs_init() -> Result<(), NwgError> {\\n\\n Ok(())\\n\\n}\\n\\n\\n\",\n \"file_path\": \"native-windows-gui/src/win32/mod.rs\",\n \"rank\": 84,\n \"score\": 210831.7348220347\n },\n {\n \"content\": \"#[cfg(not(feature = \\\"frame\\\"))]\\n\\nfn frame_init() -> Result<(), NwgError> {\\n\\n Ok(())\\n\\n}\\n\",\n \"file_path\": \"native-windows-gui/src/win32/mod.rs\",\n \"rank\": 85,\n \"score\": 210831.7348220347\n },\n {\n \"content\": \"fn load_cursor_builder() -> nwg::Cursor {\\n\\n let mut cursor = nwg::Cursor::default();\\n\\n\\n\\n nwg::Cursor::builder()\\n\\n .source_file(Some(\\\"Hello.cur\\\"))\\n\\n .strict(true)\\n\\n .build(&mut cursor)\\n\\n .unwrap();\\n\\n\\n\\n cursor\\n\\n}\\n\\n\\n\\n*/\\n\\n#[allow(unused)]\\n\\npub struct Cursor {\\n\\n pub handle: HANDLE,\\n\\n pub(crate) owned: bool,\\n\\n}\\n\\n\\n\\nimpl Cursor {\\n\",\n \"file_path\": \"native-windows-gui/src/resources/cursor.rs\",\n \"rank\": 86,\n \"score\": 210419.1390395962\n },\n {\n \"content\": \"fn load_bitmap_builder() -> nwg::Bitmap {\\n\\n let mut bitmap = nwg::Bitmap::default();\\n\\n\\n\\n nwg::Bitmap::builder()\\n\\n .source_file(Some(\\\"Hello.bmp\\\"))\\n\\n .strict(true)\\n\\n .build(&mut bitmap)\\n\\n .unwrap();\\n\\n\\n\\n bitmap\\n\\n}\\n\\n\\n\\n```\\n\\n\\n\\n*/\\n\\n#[allow(unused)]\\n\\npub struct Bitmap {\\n\\n pub handle: HANDLE,\\n\\n pub(crate) owned: bool,\\n\\n}\\n\",\n \"file_path\": \"native-windows-gui/src/resources/bitmap.rs\",\n \"rank\": 87,\n \"score\": 210419.1390395962\n },\n {\n \"content\": \"fn load_icon_builder() -> nwg::Icon {\\n\\n let mut icon = nwg::Icon::default();\\n\\n\\n\\n nwg::Icon::builder()\\n\\n .source_file(Some(\\\"hello.ico\\\"))\\n\\n .strict(true)\\n\\n .build(&mut icon);\\n\\n\\n\\n icon\\n\\n}\\n\\n\\n\\n*/\\n\\n#[allow(unused)]\\n\\npub struct Icon {\\n\\n pub handle: HANDLE,\\n\\n pub(crate) owned: bool,\\n\\n}\\n\\n\\n\\nimpl Icon {\\n\\n pub fn builder<'a>() -> IconBuilder<'a> {\\n\",\n \"file_path\": \"native-windows-gui/src/resources/icon.rs\",\n \"rank\": 88,\n \"score\": 210419.1390395962\n },\n {\n \"content\": \"fn next_treeview_item(handle: &ControlHandle, action: usize, item: HTREEITEM) -> Option<TreeItem> {\\n\\n use winapi::um::commctrl::TVM_GETNEXTITEM;\\n\\n\\n\\n if handle.blank() {\\n\\n panic!(\\\"{}\\\", NOT_BOUND);\\n\\n }\\n\\n let handle = handle.hwnd().expect(BAD_HANDLE);\\n\\n\\n\\n let handle = wh::send_message(handle, TVM_GETNEXTITEM, action as _, item as _) as HTREEITEM;\\n\\n if handle.is_null() {\\n\\n None\\n\\n } else {\\n\\n Some(TreeItem { handle })\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"native-windows-gui/src/controls/treeview.rs\",\n \"rank\": 89,\n \"score\": 208117.30517267445\n },\n {\n \"content\": \"/// Inner function used by the message box function\\n\\nfn inner_message(parent: HWND, params: &MessageParams) -> MessageChoice {\\n\\n use winapi::um::winuser::{\\n\\n MB_ABORTRETRYIGNORE, MB_CANCELTRYCONTINUE, MB_ICONEXCLAMATION, MB_ICONINFORMATION,\\n\\n MB_ICONQUESTION, MB_ICONSTOP, MB_OK, MB_OKCANCEL, MB_RETRYCANCEL, MB_YESNO, MB_YESNOCANCEL,\\n\\n };\\n\\n\\n\\n use winapi::um::winuser::MessageBoxW;\\n\\n use winapi::um::winuser::{\\n\\n IDABORT, IDCANCEL, IDCONTINUE, IDIGNORE, IDNO, IDOK, IDRETRY, IDTRYAGAIN, IDYES,\\n\\n };\\n\\n\\n\\n let text = to_utf16(params.content);\\n\\n let title = to_utf16(params.title);\\n\\n\\n\\n let buttons = match params.buttons {\\n\\n MessageButtons::AbortTryIgnore => MB_ABORTRETRYIGNORE,\\n\\n MessageButtons::CancelTryContinue => MB_CANCELTRYCONTINUE,\\n\\n MessageButtons::Ok => MB_OK,\\n\\n MessageButtons::OkCancel => MB_OKCANCEL,\\n\\n MessageButtons::RetryCancel => MB_RETRYCANCEL,\\n\",\n \"file_path\": \"native-windows-gui/src/win32/message_box.rs\",\n \"rank\": 90,\n \"score\": 208045.5615791167\n },\n {\n \"content\": \"#[cfg(not(feature = \\\"extern-canvas\\\"))]\\n\\nfn extern_canvas_init() -> Result<(), NwgError> {\\n\\n Ok(())\\n\\n}\\n\\n\\n\",\n \"file_path\": \"native-windows-gui/src/win32/mod.rs\",\n \"rank\": 91,\n \"score\": 207489.1784897462\n },\n {\n \"content\": \"type Size = (u32, u32);\\n\\n\\n\\n/**\\n\\n Different mode in the application.\\n\\n\\n\\n - Draw: Paint pixels\\n\\n - Erase: Remove painted pixel\\n\\n*/\\n\\n#[derive(Debug, Copy, Clone)]\\n\\npub enum AppMode {\\n\\n Draw,\\n\\n Erase\\n\\n}\\n\\n\\n\\n/**\\n\\n Application state.\\n\\n Includes the current drawing state and relation with the other running instances of SyncDraw.\\n\\n*/\\n\\n#[derive(Default)]\\n\\npub struct AppData {\\n\",\n \"file_path\": \"native-windows-gui/examples/sync-draw/src/data.rs\",\n \"rank\": 92,\n \"score\": 207224.6649383987\n },\n {\n \"content\": \"/// Adding/Updating a tooltip after the initial tooltip creation\\n\\nfn add_tooltip(btn: &nwg::Button, tt: &nwg::Tooltip) {\\n\\n tt.register(btn, \\\"This is a button!\\\");\\n\\n}\\n\\n\\n\",\n \"file_path\": \"native-windows-gui/src/controls/tooltip.rs\",\n \"rank\": 93,\n \"score\": 206784.86820316038\n },\n {\n \"content\": \"#[cfg(feature = \\\"image-list\\\")]\\n\\nfn builder_set_image_list(builder: &TreeViewBuilder, out: &TreeView) {\\n\\n if builder.image_list.is_some() {\\n\\n out.set_image_list(builder.image_list);\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"native-windows-gui/src/controls/treeview.rs\",\n \"rank\": 94,\n \"score\": 204440.68142523622\n },\n {\n \"content\": \"type Callback = dyn Fn(Event, EventData, ControlHandle);\\n\\n\\n\\n/**\\n\\n An opaque structure that represent a window subclass hook.\\n\\n*/\\n\\npub struct EventHandler {\\n\\n handles: Vec<HWND>,\\n\\n id: SUBCLASSPROC,\\n\\n subclass_id: UINT_PTR,\\n\\n}\\n\\n\\n\\n/**\\n\\n An opaque structure that represent a window subclass hook.\\n\\n*/\\n\\npub struct RawEventHandler {\\n\\n handle: HWND,\\n\\n subclass_proc: SUBCLASSPROC,\\n\\n handler_id: UINT_PTR,\\n\\n}\\n\\n\\n\\n/**\\n\\n Note. While there might be a race condition here, it does not matter because\\n\\n All controls are thread local and the true id is (HANDLE + NOTICE_ID)\\n\\n The same apply to timers\\n\\n*/\\n\",\n \"file_path\": \"native-windows-gui/src/win32/window.rs\",\n \"rank\": 95,\n \"score\": 204399.61730785194\n }\n]","isConversational":false}}},{"rowIdx":2384,"cells":{"lang":{"kind":"string","value":"Rust"},"file_path":{"kind":"string","value":"src/lib.rs"},"repo_name":{"kind":"string","value":"helium/longfi-device-rs"},"commit":{"kind":"string","value":"97ad8f380205a0b0b1c90ff0513e30c576b71e5d"},"file_code":{"kind":"string","value":"#![cfg_attr(not(test), no_std)]\nuse longfi_sys;\n\npub use longfi_sys::AntPinsMode_t as AntPinsMode;\npub use longfi_sys::BoardBindings_t as BoardBindings;\npub use longfi_sys::ClientEvent_t as ClientEvent;\npub use longfi_sys::LongFiAuthCallbacks as AuthCb;\npub use longfi_sys::LongFiAuthMode_t as AuthMode;\npub use longfi_sys::LongFiConfig_t as Config;\npub use longfi_sys::LongFi_t;\nuse longfi_sys::Radio_t;\npub use longfi_sys::RfEvent_t;\npub use longfi_sys::RxPacket_t as RxPacket;\npub use longfi_sys::SX126xRadioNew;\npub use longfi_sys::SX1276RadioNew;\n\n#[derive(Debug)]\npub enum RfEvent {\n DIO0,\n DIO1,\n}\n\nstatic mut SX12XX: Option<Radio> = None;\n\npub struct LongFi {\n c_handle: LongFi_t,\n}\n\n#[derive(Debug)]\npub enum Error {\n NoRadioPointer,\n}\n\nunsafe impl Send for LongFi {}\n\npub struct Radio {\n c_handle: Radio_t,\n}\n\nimpl Radio {\n pub fn sx1262() -> Radio {\n Radio {\n c_handle: unsafe { SX126xRadioNew() },\n }\n }\n\n pub fn sx1276() -> Radio {\n Radio {\n c_handle: unsafe { SX1276RadioNew() },\n }\n }\n}\n\nimpl LongFi {\n pub fn new(\n radio: Radio,\n bindings: &mut BoardBindings,\n config: Config,\n auth_cb_set: &[u8; 16],\n ) -> Result<LongFi, Error> {\n unsafe {\n SX12XX = Some(radio);\n\n let mut auth_cb = core::mem::zeroed::<AuthCb>();\n *auth_cb.preshared_key.as_mut() = auth_cb_set.as_ptr();\n\n if let Some(radio) = &mut SX12XX {\n let radio_ptr: *mut Radio_t = &mut radio.c_handle;\n\n let mut longfi_radio = LongFi {\n c_handle: longfi_sys::longfi_new_handle(bindings, radio_ptr, config, auth_cb),\n };\n\n longfi_sys::longfi_init(&mut longfi_radio.c_handle);\n\n Ok(longfi_radio)\n } else {\n Err(Error::NoRadioPointer)\n }\n }\n }\n\n pub fn set_buffer(&mut self, buffer: &mut [u8]) {\n unsafe {\n longfi_sys::longfi_set_buf(&mut self.c_handle, buffer.as_mut_ptr(), buffer.len());\n }\n }\n\n pub fn handle_event(&mut self, event: RfEvent) -> ClientEvent {\n let event_for_c = match event {\n RfEvent::DIO0 => RfEvent_t::RFE_DIO0, \n RfEvent::DIO1 => RfEvent_t::RFE_DIO1,\n };\n unsafe { longfi_sys::longfi_handle_event(&mut self.c_handle, event_for_c) }\n }\n\n pub fn send(&mut self, buffer: &[u8]) {\n unsafe {\n longfi_sys::longfi_send(&mut self.c_handle, buffer.as_ptr(), buffer.len());\n }\n }\n\n pub fn send_test(&mut self) {\n unsafe {\n longfi_sys::longfi_rf_test(&mut self.c_handle);\n }\n }\n\n pub fn get_rx(&mut self) -> RxPacket {\n unsafe { longfi_sys::longfi_get_rx() }\n }\n}\n\nextern crate libm;\n\n#[no_mangle]\npub extern \"C\" fn ceil(expr: f64) -> f64 {\n libm::ceil(expr)\n}\n\n#[no_mangle]\npub extern \"C\" fn round(expr: f64) -> f64 {\n libm::round(expr)\n}\n\n#[no_mangle]\npub extern \"C\" fn floor(expr: f64) -> f64 {\n libm::floor(expr)\n}\n\n#[cfg(test)]\nmod tests {\n use super::*;\n use super::{LongFi, RfConfig};\n use longfi_sys::{\n GpioIrqHandler, Gpio_t, IrqModes, IrqPriorities, PinConfigs, PinModes, PinNames, PinTypes,\n Spi_t,\n };\n\n #[no_mangle]\n pub extern \"C\" fn spi_in_out(s: *mut Spi_t, out_data: u16) -> u16 {\n 0\n }\n #[no_mangle]\n pub extern \"C\" fn gpio_init(\n obj: *mut Gpio_t,\n pin: PinNames,\n mode: PinModes,\n config: PinConfigs,\n pin_type: PinTypes,\n value: u32,\n ) {\n }\n #[no_mangle]\n pub extern \"C\" fn gpio_write(obj: *mut Gpio_t, value: u32) {}\n #[no_mangle]\n pub extern \"C\" fn gpio_set_interrupt(\n obj: *mut Gpio_t,\n irq_mode: IrqModes,\n irq_priority: IrqPriorities,\n irq_handler: GpioIrqHandler,\n ) {\n }\n #[no_mangle]\n pub extern \"C\" fn delay_ms(ms: u32) {}\n\n static mut RFCONFIG: RfConfig = RfConfig {\n oui: 0x12345678,\n device_id: 0x9abc,\n };\n static mut BINDINGS: BoardBindings = BoardBindings {\n spi_in_out: Some(spi_in_out),\n delay_ms: Some(delay_ms),\n gpio_init: Some(gpio_init),\n gpio_write: Some(gpio_write),\n gpio_set_interrupt: Some(gpio_set_interrupt),\n };\n static mut LONGFI: Option<LongFi> = None;\n\n #[test]\n fn test_linking() {\n let mut longfi_radio = unsafe { LongFi::new(&mut BINDINGS, &mut RFCONFIG).unwrap() };\n longfi_radio.initialize();\n\n unsafe { LONGFI = Some(longfi_radio) };\n }\n\n #[test]\n fn test_sending() {\n let config = RfConfig {\n oui: 0x12345678,\n device_id: 0x9abc,\n };\n\n let bindings = BoardBindings {\n spi_in_out: Some(spi_in_out),\n delay_ms: Some(delay_ms),\n gpio_init: Some(gpio_init),\n gpio_write: Some(gpio_write),\n gpio_set_interrupt: Some(gpio_set_interrupt),\n };\n\n let packet: [u8; 5] = [0xDE, 0xAD, 0xBE, 0xEF, 0];\n unsafe {\n if let Some(longfi) = &mut LONGFI {\n longfi.send(&packet);\n }\n };\n }\n}\n"},"prefix":{"kind":"string","value":"#![cfg_attr(not(test), no_std)]\nuse longfi_sys;\n\npub use longfi_sys::AntPinsMode_t as AntPinsMode;\npub use longfi_sys::BoardBindings_t as BoardBindings;\npub use longfi_sys::ClientEvent_t as ClientEvent;\npub use longfi_sys::LongFiAuthCallbacks as AuthCb;\npub use longfi_sys::LongFiAuthMode_t as AuthMode;\npub use longfi_sys::LongFiConfig_t as Config;\npub use longfi_sys::LongFi_t;\nuse longfi_sys::Radio_t;\npub use longfi_sys::RfEvent_t;\npub use longfi_sys::RxPacket_t as RxPacket;\npub use longfi_sys::SX126xRadioNew;\npub use longfi_sys::SX1276RadioNew;\n\n#[derive(Debug)]\npub enum RfEvent {\n DIO0,\n DIO1,\n}\n\nstatic mut SX12XX: Option<Radio> = None;\n\npub struct LongFi {\n c_handle: LongFi_t,\n}\n\n#[derive(Debug)]\npub enum Error {\n NoRadioPointer,\n}\n\nunsafe impl Send for LongFi {}\n\npub struct Radio {\n c_handle: Radio_t,\n}\n\nimpl Radio {\n pub fn sx1262() -> Radio {\n Radio {\n c_handle: unsafe { SX126xRadioNew() },\n }\n }\n\n pub fn sx1276() -> Radio {\n Radio {\n c_handle: unsafe { SX1276RadioNew() },\n }\n }\n}\n\nimpl LongFi {\n pub fn new(\n radio: Radio,\n bindings: &mut BoardBindings,\n config: Config,\n auth_cb_set: &[u8; 16],\n ) -> Result<LongFi, Error> {\n unsafe {\n SX12XX = Some(radio);\n\n let mut auth_cb = core::mem::zeroed::<AuthCb>();\n *auth_cb.preshared_key.as_mut() = auth_cb_set.as_ptr();\n\n if let Some(radio) = &mut SX12XX {\n let radio_ptr: *mut Radio_t = &mut radio.c_handle;\n\n "},"suffix":{"kind":"string","value":"\n\n longfi_sys::longfi_init(&mut longfi_radio.c_handle);\n\n Ok(longfi_radio)\n } else {\n Err(Error::NoRadioPointer)\n }\n }\n }\n\n pub fn set_buffer(&mut self, buffer: &mut [u8]) {\n unsafe {\n longfi_sys::longfi_set_buf(&mut self.c_handle, buffer.as_mut_ptr(), buffer.len());\n }\n }\n\n pub fn handle_event(&mut self, event: RfEvent) -> ClientEvent {\n let event_for_c = match event {\n RfEvent::DIO0 => RfEvent_t::RFE_DIO0, \n RfEvent::DIO1 => RfEvent_t::RFE_DIO1,\n };\n unsafe { longfi_sys::longfi_handle_event(&mut self.c_handle, event_for_c) }\n }\n\n pub fn send(&mut self, buffer: &[u8]) {\n unsafe {\n longfi_sys::longfi_send(&mut self.c_handle, buffer.as_ptr(), buffer.len());\n }\n }\n\n pub fn send_test(&mut self) {\n unsafe {\n longfi_sys::longfi_rf_test(&mut self.c_handle);\n }\n }\n\n pub fn get_rx(&mut self) -> RxPacket {\n unsafe { longfi_sys::longfi_get_rx() }\n }\n}\n\nextern crate libm;\n\n#[no_mangle]\npub extern \"C\" fn ceil(expr: f64) -> f64 {\n libm::ceil(expr)\n}\n\n#[no_mangle]\npub extern \"C\" fn round(expr: f64) -> f64 {\n libm::round(expr)\n}\n\n#[no_mangle]\npub extern \"C\" fn floor(expr: f64) -> f64 {\n libm::floor(expr)\n}\n\n#[cfg(test)]\nmod tests {\n use super::*;\n use super::{LongFi, RfConfig};\n use longfi_sys::{\n GpioIrqHandler, Gpio_t, IrqModes, IrqPriorities, PinConfigs, PinModes, PinNames, PinTypes,\n Spi_t,\n };\n\n #[no_mangle]\n pub extern \"C\" fn spi_in_out(s: *mut Spi_t, out_data: u16) -> u16 {\n 0\n }\n #[no_mangle]\n pub extern \"C\" fn gpio_init(\n obj: *mut Gpio_t,\n pin: PinNames,\n mode: PinModes,\n config: PinConfigs,\n pin_type: PinTypes,\n value: u32,\n ) {\n }\n #[no_mangle]\n pub extern \"C\" fn gpio_write(obj: *mut Gpio_t, value: u32) {}\n #[no_mangle]\n pub extern \"C\" fn gpio_set_interrupt(\n obj: *mut Gpio_t,\n irq_mode: IrqModes,\n irq_priority: IrqPriorities,\n irq_handler: GpioIrqHandler,\n ) {\n }\n #[no_mangle]\n pub extern \"C\" fn delay_ms(ms: u32) {}\n\n static mut RFCONFIG: RfConfig = RfConfig {\n oui: 0x12345678,\n device_id: 0x9abc,\n };\n static mut BINDINGS: BoardBindings = BoardBindings {\n spi_in_out: Some(spi_in_out),\n delay_ms: Some(delay_ms),\n gpio_init: Some(gpio_init),\n gpio_write: Some(gpio_write),\n gpio_set_interrupt: Some(gpio_set_interrupt),\n };\n static mut LONGFI: Option<LongFi> = None;\n\n #[test]\n fn test_linking() {\n let mut longfi_radio = unsafe { LongFi::new(&mut BINDINGS, &mut RFCONFIG).unwrap() };\n longfi_radio.initialize();\n\n unsafe { LONGFI = Some(longfi_radio) };\n }\n\n #[test]\n fn test_sending() {\n let config = RfConfig {\n oui: 0x12345678,\n device_id: 0x9abc,\n };\n\n let bindings = BoardBindings {\n spi_in_out: Some(spi_in_out),\n delay_ms: Some(delay_ms),\n gpio_init: Some(gpio_init),\n gpio_write: Some(gpio_write),\n gpio_set_interrupt: Some(gpio_set_interrupt),\n };\n\n let packet: [u8; 5] = [0xDE, 0xAD, 0xBE, 0xEF, 0];\n unsafe {\n if let Some(longfi) = &mut LONGFI {\n longfi.send(&packet);\n }\n };\n }\n}\n"},"middle":{"kind":"string","value":"let mut longfi_radio = LongFi {\n c_handle: longfi_sys::longfi_new_handle(bindings, radio_ptr, config, auth_cb),\n };"},"strategy":{"kind":"string","value":"assignment_statement"},"context_items":{"kind":"list like","value":[{"content":"pub fn initialize_irq(\n\n pin: gpiob::PB4<Uninitialized>,\n\n syscfg: &mut hal::syscfg::SYSCFG,\n\n exti: &mut exti::Exti,\n\n) -> gpiob::PB4<Input<PullUp>> {\n\n let dio0 = pin.into_pull_up_input();\n\n\n\n exti.listen_gpio(\n\n syscfg,\n\n dio0.port(),\n\n GpioLine::from_raw_line(dio0.pin_number()).unwrap(),\n\n exti::TriggerEdge::Rising,\n\n );\n\n\n\n dio0\n\n}\n\n\n\npub type TcxoEn = gpioa::PA8<Output<PushPull>>;\n\n\n\nimpl LongFiBindings {\n","file_path":"examples/stm32l0x2/longfi_bindings.rs","rank":0,"score":77906.69035860432},{"content":"#[cfg(not(workaround_build))]\n\nfn main() {\n\n cargo_5730::run_build_script();\n\n}\n","file_path":"longfi-sys/build.rs","rank":1,"score":43781.01722061068},{"content":" set_antenna_pins: Some(set_antenna_pins),\n\n set_board_tcxo: None,\n\n busy_pin_status: None,\n\n reduce_power: None,\n\n },\n\n }\n\n }\n\n}\n\n\n\nstatic mut EN_TCXO: Option<TcxoEn> = None;\n\n\n\n#[no_mangle]\n\npub extern \"C\" fn set_tcxo(value: bool) -> u8 {\n\n unsafe {\n\n if let Some(pin) = &mut EN_TCXO {\n\n if value {\n\n pin.set_high().unwrap();\n\n } else {\n\n pin.set_low().unwrap();\n\n }\n\n }\n\n }\n\n 6\n\n}\n\n\n","file_path":"examples/stm32l0x2/longfi_bindings.rs","rank":2,"score":33567.77482476716},{"content":"}\n\n\n\nstatic mut SPI_NSS: Option<gpioa::PA15<Output<PushPull>>> = None;\n\n#[no_mangle]\n\nextern \"C\" fn spi_nss(value: bool) {\n\n unsafe {\n\n if let Some(pin) = &mut SPI_NSS {\n\n if value {\n\n pin.set_high().unwrap();\n\n } else {\n\n pin.set_low().unwrap();\n\n }\n\n }\n\n }\n\n}\n\n\n\nstatic mut RESET: Option<gpioc::PC0<Output<PushPull>>> = None;\n\n#[no_mangle]\n\nextern \"C\" fn radio_reset(value: bool) {\n\n unsafe {\n","file_path":"examples/stm32l0x2/longfi_bindings.rs","rank":3,"score":33566.99969049106},{"content":"use hal::exti;\n\nuse hal::exti::{ExtiLine, GpioLine};\n\nuse hal::gpio::*;\n\nuse hal::pac;\n\nuse hal::prelude::*;\n\nuse hal::rcc::Rcc;\n\nuse hal::rng;\n\nuse hal::spi;\n\n\n\nuse longfi_device::{AntPinsMode, BoardBindings};\n\nuse nb::block;\n\nuse stm32l0xx_hal as hal;\n\n\n\n#[allow(dead_code)]\n\npub struct LongFiBindings {\n\n pub bindings: BoardBindings,\n\n}\n\n\n","file_path":"examples/stm32l0x2/longfi_bindings.rs","rank":4,"score":33565.54099519093},{"content":" if let Some(pin) = &mut RESET {\n\n if value {\n\n pin.set_low().unwrap();\n\n } else {\n\n pin.set_high().unwrap();\n\n }\n\n }\n\n }\n\n}\n\n\n\n#[no_mangle]\n\nextern \"C\" fn delay_ms(ms: u32) {\n\n cortex_m::asm::delay(ms);\n\n}\n\n\n\nstatic mut RNG: Option<rng::Rng> = None;\n\nextern \"C\" fn get_random_bits(_bits: u8) -> u32 {\n\n unsafe {\n\n if let Some(rng) = &mut RNG {\n\n // enable starts the ADC conversions that generate the random number\n","file_path":"examples/stm32l0x2/longfi_bindings.rs","rank":5,"score":33565.45877937682},{"content":" pub fn new(\n\n spi_peripheral: pac::SPI1,\n\n rcc: &mut Rcc,\n\n rng: rng::Rng,\n\n spi_sck: gpiob::PB3<Uninitialized>,\n\n spi_miso: gpioa::PA6<Uninitialized>,\n\n spi_mosi: gpioa::PA7<Uninitialized>,\n\n spi_nss_pin: gpioa::PA15<Uninitialized>,\n\n reset: gpioc::PC0<Uninitialized>,\n\n rx: gpioa::PA1<Uninitialized>,\n\n tx_rfo: gpioc::PC2<Uninitialized>,\n\n tx_boost: gpioc::PC1<Uninitialized>,\n\n ) -> LongFiBindings {\n\n // store all of the necessary pins and peripherals into statics\n\n // this is necessary as the extern C functions need access\n\n // this is safe, thanks to ownership and because these statics are private\n\n unsafe {\n\n SPI = Some(spi_peripheral.spi(\n\n (spi_sck, spi_miso, spi_mosi),\n\n spi::MODE_0,\n","file_path":"examples/stm32l0x2/longfi_bindings.rs","rank":6,"score":33564.38779017199},{"content":"impl<Rx, TxRfo, TxBoost> AntennaSwitches<Rx, TxRfo, TxBoost>\n\nwhere\n\n Rx: embedded_hal::digital::v2::OutputPin,\n\n TxRfo: embedded_hal::digital::v2::OutputPin,\n\n TxBoost: embedded_hal::digital::v2::OutputPin,\n\n{\n\n pub fn new(rx: Rx, tx_rfo: TxRfo, tx_boost: TxBoost) -> AntennaSwitches<Rx, TxRfo, TxBoost> {\n\n AntennaSwitches {\n\n rx,\n\n tx_rfo,\n\n tx_boost,\n\n }\n\n }\n\n\n\n pub fn set_sleep(&mut self) {\n\n self.rx.set_low().unwrap_or(());\n\n self.tx_rfo.set_low().unwrap_or(());\n\n self.tx_boost.set_low().unwrap_or(());\n\n }\n\n\n","file_path":"examples/stm32l0x2/longfi_bindings.rs","rank":7,"score":33562.29289711423},{"content":" 1_000_000.hz(),\n\n rcc,\n\n ));\n\n SPI_NSS = Some(spi_nss_pin.into_push_pull_output());\n\n RESET = Some(reset.into_push_pull_output());\n\n ANT_SW = Some(AntennaSwitches::new(\n\n rx.into_push_pull_output(),\n\n tx_rfo.into_push_pull_output(),\n\n tx_boost.into_push_pull_output(),\n\n ));\n\n RNG = Some(rng);\n\n };\n\n\n\n LongFiBindings {\n\n bindings: BoardBindings {\n\n reset: Some(radio_reset),\n\n spi_in_out: Some(spi_in_out),\n\n spi_nss: Some(spi_nss),\n\n delay_ms: Some(delay_ms),\n\n get_random_bits: Some(get_random_bits),\n","file_path":"examples/stm32l0x2/longfi_bindings.rs","rank":8,"score":33561.659284180234},{"content":" pub fn set_tx(&mut self) {\n\n self.rx.set_low().unwrap_or(());\n\n self.tx_rfo.set_low().unwrap_or(());\n\n self.tx_boost.set_high().unwrap_or(());\n\n }\n\n\n\n pub fn set_rx(&mut self) {\n\n self.rx.set_high().unwrap_or(());\n\n self.tx_rfo.set_low().unwrap_or(());\n\n self.tx_boost.set_low().unwrap_or(());\n\n }\n\n}\n\n\n","file_path":"examples/stm32l0x2/longfi_bindings.rs","rank":9,"score":33561.37981536708},{"content":" rng.enable();\n\n // wait until the flag flips; interrupt driven is possible but no implemented\n\n rng.wait();\n\n // reading the result clears the ready flag\n\n let val = rng.take_result();\n\n // can save some power by disabling until next random number needed\n\n rng.disable();\n\n val\n\n } else {\n\n panic!(\"No Rng exists!\");\n\n }\n\n }\n\n}\n\n\n\npub struct AntennaSwitches<Rx, TxRfo, TxBoost> {\n\n rx: Rx,\n\n tx_rfo: TxRfo,\n\n tx_boost: TxBoost,\n\n}\n\n#[warn(unused_must_use)]\n","file_path":"examples/stm32l0x2/longfi_bindings.rs","rank":10,"score":33559.91984666426},{"content":"type Uninitialized = Input<Floating>;\n\n\n\npub type RadioIRQ = gpiob::PB4<Input<PullUp>>;\n\n\n","file_path":"examples/stm32l0x2/longfi_bindings.rs","rank":11,"score":28744.190913978713},{"content":"type AntSw = AntennaSwitches<\n\n stm32l0xx_hal::gpio::gpioa::PA1<stm32l0xx_hal::gpio::Output<stm32l0xx_hal::gpio::PushPull>>,\n\n stm32l0xx_hal::gpio::gpioc::PC2<stm32l0xx_hal::gpio::Output<stm32l0xx_hal::gpio::PushPull>>,\n\n stm32l0xx_hal::gpio::gpioc::PC1<stm32l0xx_hal::gpio::Output<stm32l0xx_hal::gpio::PushPull>>,\n\n>;\n\n\n\nstatic mut ANT_SW: Option<AntSw> = None;\n\n\n\npub extern \"C\" fn set_antenna_pins(mode: AntPinsMode, _power: u8) {\n\n unsafe {\n\n if let Some(ant_sw) = &mut ANT_SW {\n\n match mode {\n\n AntPinsMode::AntModeTx => {\n\n ant_sw.set_tx();\n\n }\n\n AntPinsMode::AntModeRx => {\n\n ant_sw.set_rx();\n\n }\n\n AntPinsMode::AntModeSleep => {\n\n ant_sw.set_sleep();\n\n }\n\n _ => (),\n\n }\n\n }\n\n }\n\n}\n","file_path":"examples/stm32l0x2/longfi_bindings.rs","rank":12,"score":27432.668895089955},{"content":"type SpiPort = hal::spi::Spi<\n\n hal::pac::SPI1,\n\n (\n\n hal::gpio::gpiob::PB3<hal::gpio::Input<hal::gpio::Floating>>,\n\n hal::gpio::gpioa::PA6<hal::gpio::Input<hal::gpio::Floating>>,\n\n hal::gpio::gpioa::PA7<hal::gpio::Input<hal::gpio::Floating>>,\n\n ),\n\n>;\n\nstatic mut SPI: Option<SpiPort> = None;\n\n#[no_mangle]\n\nextern \"C\" fn spi_in_out(out_data: u8) -> u8 {\n\n unsafe {\n\n if let Some(spi) = &mut SPI {\n\n spi.send(out_data).unwrap();\n\n let in_data = block!(spi.read()).unwrap();\n\n in_data\n\n } else {\n\n 0\n\n }\n\n }\n","file_path":"examples/stm32l0x2/longfi_bindings.rs","rank":13,"score":26235.606979667842},{"content":"\n\n // make the bindings\n\n let bindings = bindgen::Builder::default()\n\n .raw_line(\"use cty;\")\n\n .use_core()\n\n .ctypes_prefix(\"cty\")\n\n .detect_include_paths(true)\n\n .header(\"longfi-device/board.h\")\n\n .header(\"longfi-device/longfi.h\")\n\n .header(\"longfi-device/radio/radio.h\")\n\n .header(\"longfi-device/radio/sx1276/sx1276.h\")\n\n .header(\"longfi-device/radio/sx126x/sx126x.h\")\n\n .clang_arg(format!(\"-I{}/include\",dst.display()))\n\n .whitelist_var(\"XTAL_FREQ\")\n\n .whitelist_var(\"FREQ_STEP\")\n\n .whitelist_var(\"RX_BUFFER_SIZE\")\n\n .whitelist_type(\"RfEvent_t\")\n\n .whitelist_type(\"RadioState_t\")\n\n .whitelist_type(\"RadioModems_t\")\n\n .whitelist_type(\"ClientEvent_t\")\n","file_path":"longfi-sys/build.rs","rank":14,"score":16764.521864179274},{"content":" .whitelist_type(\"QualityOfService_t\")\n\n .whitelist_type(\"RfConfig_t\")\n\n .whitelist_type(\"RxPacket_t\")\n\n .whitelist_type(\"LF_Gpio_t\")\n\n .whitelist_type(\"LF_Spi_t\")\n\n .whitelist_type(\"AntPinsMode_t\")\n\n .whitelist_type(\"LongFiAuthMode_t\")\n\n .whitelist_type(\"LongFiAuthCallbacks\")\n\n .whitelist_function(\"longfi_init\")\n\n .whitelist_function(\"longfi_new_handle\")\n\n .whitelist_function(\"longfi_handle_event\")\n\n .whitelist_function(\"longfi_send\")\n\n .whitelist_function(\"longfi_get_rx\")\n\n .whitelist_function(\"longfi_set_buf\")\n\n .whitelist_function(\"longfi_rf_test\")\n\n .whitelist_function(\"longfi_get_random\")\n\n .whitelist_function(\"longfi_enable_tcxo\")\n\n .whitelist_function(\"board_set_bindings\")\n\n .whitelist_function(\"memcpy1\")\n\n .whitelist_function(\"SX1276RadioNew\")\n","file_path":"longfi-sys/build.rs","rank":15,"score":16763.903525329537},{"content":" .whitelist_function(\"SX126xRadioNew\")\n\n .whitelist_function(\"SX126xReadRegister\")\n\n .trust_clang_mangling(false)\n\n .rustfmt_bindings(true)\n\n .rustified_enum(\"ClientEvent_t\")\n\n .rustified_enum(\"RfEvent_t\")\n\n .rustified_enum(\"QualityOfService_t\")\n\n .rustified_enum(\"AntPinsMode_t\")\n\n .rustified_enum(\"LongFiAuthMode_t\")\n\n .derive_copy(false)\n\n .derive_debug(false)\n\n .layout_tests(false)\n\n .generate()\n\n .expect(\"Failed to generate sx1276 bindings!\");\n\n\n\n let out_path = PathBuf::from(env::var(\"OUT_DIR\").unwrap());\n\n bindings\n\n .write_to_file(out_path.join(\"bindings.rs\"))\n\n .expect(\"Couldn't write bindings!\");\n\n}\n\n\n","file_path":"longfi-sys/build.rs","rank":16,"score":16763.28232079036},{"content":"#[cfg(workaround_build)]\n","file_path":"longfi-sys/build.rs","rank":17,"score":16754.729134917987},{"content":"#![allow(non_upper_case_globals)]\n\n#![allow(non_camel_case_types)]\n\n#![allow(non_snake_case)]\n\n#![allow(clippy::all)]\n\n#![cfg_attr(not(test), no_std)]\n\n\n\ninclude!(concat!(env!(\"OUT_DIR\"), \"/bindings.rs\"));","file_path":"longfi-sys/src/lib.rs","rank":18,"score":15821.199156526407},{"content":"<!--\n\nM.m.p (YYYY-MM-DD)\n\n==================\n\nAdd a summary of this release.\n\n\n\n**BREAKING CHANGES**:\n\n\n\n* Some change which breaks API or ABI compatiblity with.\n\n\n\n\n\nFeature enhancements:\n\n\n\n* [Link to github PR]():\n\n A new feature.\n\n\n\nBug fixes:\n\n\n\n* [Link to github PR]():\n\n A bugfix.\n\n-->\n\n0.1.2 (2019-11-26)\n\n==================\n\n* [Workaround for SX126x](https://github.com/helium/longfi-device/pull/26)\n\nBump longfi-device submodule to allow SX126x to work\n\n* [Include only used radio in binary output](https://github.com/helium/longfi-device-rs/pull/23)\n\nAPI is changed so that its easier for rustc to only include relevant radio\n\n\n\n\n\n0.1.1 (2019-11-13)\n\n==================\n\nFixed bug where fingerprints failed due to memory misalignment with C bindings\n\n\n\n0.1.0 (2019-10-28)\n\n==================\n\nInitial release.\n","file_path":"CHANGELOG.md","rank":19,"score":10159.858949739053},{"content":"# longfi-device-rs\n\n[](https://travis-ci.com/helium/longfi-device-rs)\n\n\n\n## Summary\n\n\n\nThis project creates Rust bindings for the [LongFi Protocol C-library](https://github.com/helium/longfi-device).\n\n\n\n## Cloning, building, testing\n\n\n\nThis project contains the LongFi Protocol C-library as a submodule, so either clone the whole repo and submodules with one command:\n\n\t`git clone --recurse-submodules git@github.com:helium/longfi-device-rs.git`\n\n\n\nOr, if you've already cloned the top level without submodules, get the submodule:\n\n\t`git submodule update --init --recursive`\n\n\n\nYou can use cargo to build:\n\n\t`cargo build [--release]`\n\n\n\nThe configuration in `.cargo/config` is configured to build only for the `thumbv6m-none-eabi` platform currently.\n\n\n\nThe code in the example directory is for the [STM32L0 Discovery kit](https://www.st.com/en/evaluation-tools/b-l072z-lrwan1.html), which features the [STM32L072CZ](https://www.st.com/en/microcontrollers-microprocessors/stm32l072cz.html).\n\n\n\nTo upload the code, start a debug server using either JLink (Note: [you can reprogram the ST-Link](https://www.segger.com/products/debug-probes/j-link/models/other-j-links/st-link-on-board/) on the discovery kit to act like a JLink Server; you will lose the virtual UART over USB provided by the ST-Link):\n\n\t`JLinkGDBServer -device STM32L072CZ -speed 4000 -if swd -AutoConnect -1 -port 3333`\n\n\n\nor OpenOCD server (Note: if you are using the OpenOCD server, you will want to update `.cargo/config:runner` to use `openocd.gdb` instead of `jlink.gdb`):\n\n\t`openocd -f ./openocd.cfg`\n\n\n\nrun the example:\n\n\t`cargo run --example stm32l0x2 [--release]`\n\n\n\nRun tests:\n\n `cargo test --target x86_64-unknown-linux-gnu --tests`\n\n\n\n## Debugging the build\n\n\n\nThe `.travis.yml` will provide the most up to date hints on how to build this repository. Notably, the following dependencies exist:\n\n\n\n`cmake doxygen xdot install g++-multilib libc6-dev-i386 gcc-arm-none-eabi libnewlib-arm-none-eabi`\n\n\n\nIn addition, be sure to install `clang` as that appears to resolve header issues in some systems.\n","file_path":"README.md","rank":20,"score":10158.246422227174},{"content":"# How to Contribute to this repository #\n\n\n\nWe value contributions from the community and will do everything we\n\ncan go get them reviewed in a timely fashion. If you have code to send\n\nour way or a bug to report:\n\n\n\n* **Contributing Code**: If you have new code or a bug fix, fork this\n\n repo, create a logically-named branch, and [submit a PR against this\n\n repo](https://github.com/helium/longfi-device-rs/pulls). Include a\n\n write up of the PR with details on what it does.\n\n\n\n* **Reporting Bugs**: Open an issue [against this\n\n repo](https://github.com/helium/longfi-device-rs/issues) with as much\n\n detail as you can. At the very least you'll include steps to\n\n reproduce the problem.\n\n\n\nThis project is intended to be a safe, welcoming space for\n\ncollaboration, and contributors are expected to adhere to the\n\n[Contributor Covenant Code of\n\nConduct](http://contributor-covenant.org/).\n\n\n\nAbove all, thank you for taking the time to be a part of the Helium community.\n","file_path":"CONTRIBUTING.md","rank":21,"score":10156.485663166908},{"content":" gpioa.pa7,\n\n gpioa.pa15,\n\n gpioc.pc0,\n\n gpioa.pa1,\n\n gpioc.pc2,\n\n gpioc.pc1,\n\n ));\n\n\n\n let rf_config = Config {\n\n oui: OUI,\n\n device_id: DEVICE_ID,\n\n auth_mode: longfi_device::AuthMode::PresharedKey128,\n\n };\n\n\n\n let mut longfi_radio;\n\n if let Some(bindings) = BINDINGS {\n\n longfi_radio = LongFi::new(\n\n Radio::sx1276(),\n\n &mut bindings.bindings,\n\n rf_config,\n","file_path":"examples/stm32l0x2/main.rs","rank":28,"score":14.010459004795058},{"content":" count: u8,\n\n longfi: LongFi,\n\n }\n\n\n\n #[init(spawn = [send_ping], resources = [buffer])]\n\n fn init(ctx: init::Context) -> init::LateResources {\n\n static mut BINDINGS: Option<LongFiBindings> = None;\n\n let device = ctx.device;\n\n let mut rcc = device.RCC.freeze(rcc::Config::hsi16());\n\n let mut syscfg = syscfg::SYSCFG::new(device.SYSCFG, &mut rcc);\n\n\n\n let gpioa = device.GPIOA.split(&mut rcc);\n\n let gpiob = device.GPIOB.split(&mut rcc);\n\n let gpioc = device.GPIOC.split(&mut rcc);\n\n\n\n let (tx_pin, rx_pin, serial_peripheral) = (gpioa.pa2, gpioa.pa3, device.USART2);\n\n\n\n let mut serial = serial_peripheral\n\n .usart((tx_pin, rx_pin), serial::Config::default(), &mut rcc)\n\n .unwrap();\n","file_path":"examples/stm32l0x2/main.rs","rank":30,"score":12.075864097026022},{"content":"#![cfg_attr(not(test), no_std)]\n\n#![no_main]\n\n\n\n// To use example, press any key in serial terminal\n\n// Packet will send and \"Transmit Done!\" will print when radio is done sending packet\n\n\n\nextern crate nb;\n\nextern crate panic_halt;\n\n\n\nuse core::fmt::Write;\n\nuse hal::exti::{ExtiLine, GpioLine};\n\nuse hal::serial::USART2 as DebugUsart;\n\nuse hal::{exti::Exti, prelude::*, rcc, rng::Rng, serial, syscfg};\n\nuse longfi_device;\n\nuse longfi_device::{ClientEvent, Config, LongFi, Radio, RfEvent};\n\nuse rtfm::app;\n\nuse stm32l0xx_hal as hal;\n\n\n\nmod longfi_bindings;\n\npub use longfi_bindings::initialize_irq as initialize_radio_irq;\n","file_path":"examples/stm32l0x2/main.rs","rank":31,"score":11.8857631971435},{"content":"pub use longfi_bindings::LongFiBindings;\n\npub use longfi_bindings::RadioIRQ;\n\npub use longfi_bindings::TcxoEn;\n\n\n\nconst OUI: u32 = 1;\n\nconst DEVICE_ID: u16 = 3;\n\nconst PRESHARED_KEY: [u8; 16] = [\n\n 0x7B, 0x60, 0xC0, 0xF0, 0x77, 0x51, 0x50, 0xD3, 0x2, 0xCE, 0xAE, 0x50, 0xA0, 0xD2, 0x11, 0xC1,\n\n];\n\n\n\n#[app(device = stm32l0xx_hal::pac, peripherals = true)]\n\nconst APP: () = {\n\n struct Resources {\n\n int: Exti,\n\n radio_irq: RadioIRQ,\n\n debug_uart: serial::Tx<DebugUsart>,\n\n uart_rx: serial::Rx<DebugUsart>,\n\n #[init([0;512])]\n\n buffer: [u8; 512],\n\n #[init(0)]\n","file_path":"examples/stm32l0x2/main.rs","rank":32,"score":11.831859887137517},{"content":" }\n\n write!(debug, \"\\r\\n\").unwrap();\n\n }\n\n // give buffer back to library\n\n longfi_radio.set_buffer(ctx.resources.buffer);\n\n }\n\n ClientEvent::ClientEvent_None => {}\n\n }\n\n }\n\n\n\n #[task(capacity = 4, priority = 2, resources = [debug_uart, count, longfi])]\n\n fn send_ping(ctx: send_ping::Context) {\n\n write!(ctx.resources.debug_uart, \"Sending Ping\\r\\n\").unwrap();\n\n let packet: [u8; 5] = [0xDE, 0xAD, 0xBE, 0xEF, *ctx.resources.count];\n\n *ctx.resources.count += 1;\n\n ctx.resources.longfi.send(&packet);\n\n }\n\n\n\n #[task(binds = USART2, priority=1, resources = [uart_rx], spawn = [send_ping])]\n\n fn USART2(ctx: USART2::Context) {\n","file_path":"examples/stm32l0x2/main.rs","rank":35,"score":9.22257017003065},{"content":" let rx = ctx.resources.uart_rx;\n\n rx.read().unwrap();\n\n ctx.spawn.send_ping().unwrap();\n\n }\n\n\n\n #[task(binds = EXTI4_15, priority = 1, resources = [radio_irq, int], spawn = [radio_event])]\n\n fn EXTI4_15(ctx: EXTI4_15::Context) {\n\n Exti::unpend(GpioLine::from_raw_line(ctx.resources.radio_irq.pin_number()).unwrap());\n\n ctx.spawn.radio_event(RfEvent::DIO0).unwrap();\n\n }\n\n\n\n // Interrupt handlers used to dispatch software tasks\n\n extern \"C\" {\n\n fn USART4_USART5();\n\n }\n\n};\n","file_path":"examples/stm32l0x2/main.rs","rank":36,"score":7.665330387851416},{"content":"\n\n // listen for incoming bytes which will trigger transmits\n\n serial.listen(serial::Event::Rxne);\n\n let (mut tx, rx) = serial.split();\n\n\n\n write!(tx, \"LongFi Device Test\\r\\n\").unwrap();\n\n\n\n let mut exti = Exti::new(device.EXTI);\n\n // constructor initializes 48 MHz clock that RNG requires\n\n // Initialize 48 MHz clock and RNG\n\n let hsi48 = rcc.enable_hsi48(&mut syscfg, device.CRS);\n\n let rng = Rng::new(device.RNG, &mut rcc, hsi48);\n\n let radio_irq = initialize_radio_irq(gpiob.pb4, &mut syscfg, &mut exti);\n\n\n\n *BINDINGS = Some(LongFiBindings::new(\n\n device.SPI1,\n\n &mut rcc,\n\n rng,\n\n gpiob.pb3,\n\n gpioa.pa6,\n","file_path":"examples/stm32l0x2/main.rs","rank":37,"score":7.519191416544509},{"content":" &PRESHARED_KEY,\n\n )\n\n .unwrap()\n\n } else {\n\n panic!(\"No bindings exist\");\n\n }\n\n\n\n longfi_radio.set_buffer(ctx.resources.buffer);\n\n\n\n write!(tx, \"Going to main loop\\r\\n\").unwrap();\n\n\n\n // Return the initialised resources.\n\n init::LateResources {\n\n int: exti,\n\n radio_irq: radio_irq,\n\n debug_uart: tx,\n\n uart_rx: rx,\n\n longfi: longfi_radio,\n\n }\n\n }\n","file_path":"examples/stm32l0x2/main.rs","rank":40,"score":6.018540052101624},{"content":"\n\n #[task(capacity = 4, priority = 2, resources = [debug_uart, buffer, longfi])]\n\n fn radio_event(ctx: radio_event::Context, event: RfEvent) {\n\n let longfi_radio = ctx.resources.longfi;\n\n let client_event = longfi_radio.handle_event(event);\n\n let debug = ctx.resources.debug_uart;\n\n match client_event {\n\n ClientEvent::ClientEvent_TxDone => {\n\n write!(debug, \"Transmit Done!\\r\\n\").unwrap();\n\n }\n\n ClientEvent::ClientEvent_Rx => {\n\n // get receive buffer\n\n let rx_packet = longfi_radio.get_rx();\n\n write!(debug, \"Received packet\\r\\n\").unwrap();\n\n write!(debug, \" Length = {}\\r\\n\", rx_packet.len).unwrap();\n\n write!(debug, \" Rssi = {}\\r\\n\", rx_packet.rssi).unwrap();\n\n write!(debug, \" Snr = {}\\r\\n\", rx_packet.snr).unwrap();\n\n unsafe {\n\n for i in 0..rx_packet.len {\n\n write!(debug, \"{:X} \", *rx_packet.buf.offset(i as isize)).unwrap();\n","file_path":"examples/stm32l0x2/main.rs","rank":41,"score":5.1709385034571085}],"string":"[\n {\n \"content\": \"pub fn initialize_irq(\\n\\n pin: gpiob::PB4<Uninitialized>,\\n\\n syscfg: &mut hal::syscfg::SYSCFG,\\n\\n exti: &mut exti::Exti,\\n\\n) -> gpiob::PB4<Input<PullUp>> {\\n\\n let dio0 = pin.into_pull_up_input();\\n\\n\\n\\n exti.listen_gpio(\\n\\n syscfg,\\n\\n dio0.port(),\\n\\n GpioLine::from_raw_line(dio0.pin_number()).unwrap(),\\n\\n exti::TriggerEdge::Rising,\\n\\n );\\n\\n\\n\\n dio0\\n\\n}\\n\\n\\n\\npub type TcxoEn = gpioa::PA8<Output<PushPull>>;\\n\\n\\n\\nimpl LongFiBindings {\\n\",\n \"file_path\": \"examples/stm32l0x2/longfi_bindings.rs\",\n \"rank\": 0,\n \"score\": 77906.69035860432\n },\n {\n \"content\": \"#[cfg(not(workaround_build))]\\n\\nfn main() {\\n\\n cargo_5730::run_build_script();\\n\\n}\\n\",\n \"file_path\": \"longfi-sys/build.rs\",\n \"rank\": 1,\n \"score\": 43781.01722061068\n },\n {\n \"content\": \" set_antenna_pins: Some(set_antenna_pins),\\n\\n set_board_tcxo: None,\\n\\n busy_pin_status: None,\\n\\n reduce_power: None,\\n\\n },\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\nstatic mut EN_TCXO: Option<TcxoEn> = None;\\n\\n\\n\\n#[no_mangle]\\n\\npub extern \\\"C\\\" fn set_tcxo(value: bool) -> u8 {\\n\\n unsafe {\\n\\n if let Some(pin) = &mut EN_TCXO {\\n\\n if value {\\n\\n pin.set_high().unwrap();\\n\\n } else {\\n\\n pin.set_low().unwrap();\\n\\n }\\n\\n }\\n\\n }\\n\\n 6\\n\\n}\\n\\n\\n\",\n \"file_path\": \"examples/stm32l0x2/longfi_bindings.rs\",\n \"rank\": 2,\n \"score\": 33567.77482476716\n },\n {\n \"content\": \"}\\n\\n\\n\\nstatic mut SPI_NSS: Option<gpioa::PA15<Output<PushPull>>> = None;\\n\\n#[no_mangle]\\n\\nextern \\\"C\\\" fn spi_nss(value: bool) {\\n\\n unsafe {\\n\\n if let Some(pin) = &mut SPI_NSS {\\n\\n if value {\\n\\n pin.set_high().unwrap();\\n\\n } else {\\n\\n pin.set_low().unwrap();\\n\\n }\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\nstatic mut RESET: Option<gpioc::PC0<Output<PushPull>>> = None;\\n\\n#[no_mangle]\\n\\nextern \\\"C\\\" fn radio_reset(value: bool) {\\n\\n unsafe {\\n\",\n \"file_path\": \"examples/stm32l0x2/longfi_bindings.rs\",\n \"rank\": 3,\n \"score\": 33566.99969049106\n },\n {\n \"content\": \"use hal::exti;\\n\\nuse hal::exti::{ExtiLine, GpioLine};\\n\\nuse hal::gpio::*;\\n\\nuse hal::pac;\\n\\nuse hal::prelude::*;\\n\\nuse hal::rcc::Rcc;\\n\\nuse hal::rng;\\n\\nuse hal::spi;\\n\\n\\n\\nuse longfi_device::{AntPinsMode, BoardBindings};\\n\\nuse nb::block;\\n\\nuse stm32l0xx_hal as hal;\\n\\n\\n\\n#[allow(dead_code)]\\n\\npub struct LongFiBindings {\\n\\n pub bindings: BoardBindings,\\n\\n}\\n\\n\\n\",\n \"file_path\": \"examples/stm32l0x2/longfi_bindings.rs\",\n \"rank\": 4,\n \"score\": 33565.54099519093\n },\n {\n \"content\": \" if let Some(pin) = &mut RESET {\\n\\n if value {\\n\\n pin.set_low().unwrap();\\n\\n } else {\\n\\n pin.set_high().unwrap();\\n\\n }\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\n#[no_mangle]\\n\\nextern \\\"C\\\" fn delay_ms(ms: u32) {\\n\\n cortex_m::asm::delay(ms);\\n\\n}\\n\\n\\n\\nstatic mut RNG: Option<rng::Rng> = None;\\n\\nextern \\\"C\\\" fn get_random_bits(_bits: u8) -> u32 {\\n\\n unsafe {\\n\\n if let Some(rng) = &mut RNG {\\n\\n // enable starts the ADC conversions that generate the random number\\n\",\n \"file_path\": \"examples/stm32l0x2/longfi_bindings.rs\",\n \"rank\": 5,\n \"score\": 33565.45877937682\n },\n {\n \"content\": \" pub fn new(\\n\\n spi_peripheral: pac::SPI1,\\n\\n rcc: &mut Rcc,\\n\\n rng: rng::Rng,\\n\\n spi_sck: gpiob::PB3<Uninitialized>,\\n\\n spi_miso: gpioa::PA6<Uninitialized>,\\n\\n spi_mosi: gpioa::PA7<Uninitialized>,\\n\\n spi_nss_pin: gpioa::PA15<Uninitialized>,\\n\\n reset: gpioc::PC0<Uninitialized>,\\n\\n rx: gpioa::PA1<Uninitialized>,\\n\\n tx_rfo: gpioc::PC2<Uninitialized>,\\n\\n tx_boost: gpioc::PC1<Uninitialized>,\\n\\n ) -> LongFiBindings {\\n\\n // store all of the necessary pins and peripherals into statics\\n\\n // this is necessary as the extern C functions need access\\n\\n // this is safe, thanks to ownership and because these statics are private\\n\\n unsafe {\\n\\n SPI = Some(spi_peripheral.spi(\\n\\n (spi_sck, spi_miso, spi_mosi),\\n\\n spi::MODE_0,\\n\",\n \"file_path\": \"examples/stm32l0x2/longfi_bindings.rs\",\n \"rank\": 6,\n \"score\": 33564.38779017199\n },\n {\n \"content\": \"impl<Rx, TxRfo, TxBoost> AntennaSwitches<Rx, TxRfo, TxBoost>\\n\\nwhere\\n\\n Rx: embedded_hal::digital::v2::OutputPin,\\n\\n TxRfo: embedded_hal::digital::v2::OutputPin,\\n\\n TxBoost: embedded_hal::digital::v2::OutputPin,\\n\\n{\\n\\n pub fn new(rx: Rx, tx_rfo: TxRfo, tx_boost: TxBoost) -> AntennaSwitches<Rx, TxRfo, TxBoost> {\\n\\n AntennaSwitches {\\n\\n rx,\\n\\n tx_rfo,\\n\\n tx_boost,\\n\\n }\\n\\n }\\n\\n\\n\\n pub fn set_sleep(&mut self) {\\n\\n self.rx.set_low().unwrap_or(());\\n\\n self.tx_rfo.set_low().unwrap_or(());\\n\\n self.tx_boost.set_low().unwrap_or(());\\n\\n }\\n\\n\\n\",\n \"file_path\": \"examples/stm32l0x2/longfi_bindings.rs\",\n \"rank\": 7,\n \"score\": 33562.29289711423\n },\n {\n \"content\": \" 1_000_000.hz(),\\n\\n rcc,\\n\\n ));\\n\\n SPI_NSS = Some(spi_nss_pin.into_push_pull_output());\\n\\n RESET = Some(reset.into_push_pull_output());\\n\\n ANT_SW = Some(AntennaSwitches::new(\\n\\n rx.into_push_pull_output(),\\n\\n tx_rfo.into_push_pull_output(),\\n\\n tx_boost.into_push_pull_output(),\\n\\n ));\\n\\n RNG = Some(rng);\\n\\n };\\n\\n\\n\\n LongFiBindings {\\n\\n bindings: BoardBindings {\\n\\n reset: Some(radio_reset),\\n\\n spi_in_out: Some(spi_in_out),\\n\\n spi_nss: Some(spi_nss),\\n\\n delay_ms: Some(delay_ms),\\n\\n get_random_bits: Some(get_random_bits),\\n\",\n \"file_path\": \"examples/stm32l0x2/longfi_bindings.rs\",\n \"rank\": 8,\n \"score\": 33561.659284180234\n },\n {\n \"content\": \" pub fn set_tx(&mut self) {\\n\\n self.rx.set_low().unwrap_or(());\\n\\n self.tx_rfo.set_low().unwrap_or(());\\n\\n self.tx_boost.set_high().unwrap_or(());\\n\\n }\\n\\n\\n\\n pub fn set_rx(&mut self) {\\n\\n self.rx.set_high().unwrap_or(());\\n\\n self.tx_rfo.set_low().unwrap_or(());\\n\\n self.tx_boost.set_low().unwrap_or(());\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"examples/stm32l0x2/longfi_bindings.rs\",\n \"rank\": 9,\n \"score\": 33561.37981536708\n },\n {\n \"content\": \" rng.enable();\\n\\n // wait until the flag flips; interrupt driven is possible but no implemented\\n\\n rng.wait();\\n\\n // reading the result clears the ready flag\\n\\n let val = rng.take_result();\\n\\n // can save some power by disabling until next random number needed\\n\\n rng.disable();\\n\\n val\\n\\n } else {\\n\\n panic!(\\\"No Rng exists!\\\");\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\npub struct AntennaSwitches<Rx, TxRfo, TxBoost> {\\n\\n rx: Rx,\\n\\n tx_rfo: TxRfo,\\n\\n tx_boost: TxBoost,\\n\\n}\\n\\n#[warn(unused_must_use)]\\n\",\n \"file_path\": \"examples/stm32l0x2/longfi_bindings.rs\",\n \"rank\": 10,\n \"score\": 33559.91984666426\n },\n {\n \"content\": \"type Uninitialized = Input<Floating>;\\n\\n\\n\\npub type RadioIRQ = gpiob::PB4<Input<PullUp>>;\\n\\n\\n\",\n \"file_path\": \"examples/stm32l0x2/longfi_bindings.rs\",\n \"rank\": 11,\n \"score\": 28744.190913978713\n },\n {\n \"content\": \"type AntSw = AntennaSwitches<\\n\\n stm32l0xx_hal::gpio::gpioa::PA1<stm32l0xx_hal::gpio::Output<stm32l0xx_hal::gpio::PushPull>>,\\n\\n stm32l0xx_hal::gpio::gpioc::PC2<stm32l0xx_hal::gpio::Output<stm32l0xx_hal::gpio::PushPull>>,\\n\\n stm32l0xx_hal::gpio::gpioc::PC1<stm32l0xx_hal::gpio::Output<stm32l0xx_hal::gpio::PushPull>>,\\n\\n>;\\n\\n\\n\\nstatic mut ANT_SW: Option<AntSw> = None;\\n\\n\\n\\npub extern \\\"C\\\" fn set_antenna_pins(mode: AntPinsMode, _power: u8) {\\n\\n unsafe {\\n\\n if let Some(ant_sw) = &mut ANT_SW {\\n\\n match mode {\\n\\n AntPinsMode::AntModeTx => {\\n\\n ant_sw.set_tx();\\n\\n }\\n\\n AntPinsMode::AntModeRx => {\\n\\n ant_sw.set_rx();\\n\\n }\\n\\n AntPinsMode::AntModeSleep => {\\n\\n ant_sw.set_sleep();\\n\\n }\\n\\n _ => (),\\n\\n }\\n\\n }\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"examples/stm32l0x2/longfi_bindings.rs\",\n \"rank\": 12,\n \"score\": 27432.668895089955\n },\n {\n \"content\": \"type SpiPort = hal::spi::Spi<\\n\\n hal::pac::SPI1,\\n\\n (\\n\\n hal::gpio::gpiob::PB3<hal::gpio::Input<hal::gpio::Floating>>,\\n\\n hal::gpio::gpioa::PA6<hal::gpio::Input<hal::gpio::Floating>>,\\n\\n hal::gpio::gpioa::PA7<hal::gpio::Input<hal::gpio::Floating>>,\\n\\n ),\\n\\n>;\\n\\nstatic mut SPI: Option<SpiPort> = None;\\n\\n#[no_mangle]\\n\\nextern \\\"C\\\" fn spi_in_out(out_data: u8) -> u8 {\\n\\n unsafe {\\n\\n if let Some(spi) = &mut SPI {\\n\\n spi.send(out_data).unwrap();\\n\\n let in_data = block!(spi.read()).unwrap();\\n\\n in_data\\n\\n } else {\\n\\n 0\\n\\n }\\n\\n }\\n\",\n \"file_path\": \"examples/stm32l0x2/longfi_bindings.rs\",\n \"rank\": 13,\n \"score\": 26235.606979667842\n },\n {\n \"content\": \"\\n\\n // make the bindings\\n\\n let bindings = bindgen::Builder::default()\\n\\n .raw_line(\\\"use cty;\\\")\\n\\n .use_core()\\n\\n .ctypes_prefix(\\\"cty\\\")\\n\\n .detect_include_paths(true)\\n\\n .header(\\\"longfi-device/board.h\\\")\\n\\n .header(\\\"longfi-device/longfi.h\\\")\\n\\n .header(\\\"longfi-device/radio/radio.h\\\")\\n\\n .header(\\\"longfi-device/radio/sx1276/sx1276.h\\\")\\n\\n .header(\\\"longfi-device/radio/sx126x/sx126x.h\\\")\\n\\n .clang_arg(format!(\\\"-I{}/include\\\",dst.display()))\\n\\n .whitelist_var(\\\"XTAL_FREQ\\\")\\n\\n .whitelist_var(\\\"FREQ_STEP\\\")\\n\\n .whitelist_var(\\\"RX_BUFFER_SIZE\\\")\\n\\n .whitelist_type(\\\"RfEvent_t\\\")\\n\\n .whitelist_type(\\\"RadioState_t\\\")\\n\\n .whitelist_type(\\\"RadioModems_t\\\")\\n\\n .whitelist_type(\\\"ClientEvent_t\\\")\\n\",\n \"file_path\": \"longfi-sys/build.rs\",\n \"rank\": 14,\n \"score\": 16764.521864179274\n },\n {\n \"content\": \" .whitelist_type(\\\"QualityOfService_t\\\")\\n\\n .whitelist_type(\\\"RfConfig_t\\\")\\n\\n .whitelist_type(\\\"RxPacket_t\\\")\\n\\n .whitelist_type(\\\"LF_Gpio_t\\\")\\n\\n .whitelist_type(\\\"LF_Spi_t\\\")\\n\\n .whitelist_type(\\\"AntPinsMode_t\\\")\\n\\n .whitelist_type(\\\"LongFiAuthMode_t\\\")\\n\\n .whitelist_type(\\\"LongFiAuthCallbacks\\\")\\n\\n .whitelist_function(\\\"longfi_init\\\")\\n\\n .whitelist_function(\\\"longfi_new_handle\\\")\\n\\n .whitelist_function(\\\"longfi_handle_event\\\")\\n\\n .whitelist_function(\\\"longfi_send\\\")\\n\\n .whitelist_function(\\\"longfi_get_rx\\\")\\n\\n .whitelist_function(\\\"longfi_set_buf\\\")\\n\\n .whitelist_function(\\\"longfi_rf_test\\\")\\n\\n .whitelist_function(\\\"longfi_get_random\\\")\\n\\n .whitelist_function(\\\"longfi_enable_tcxo\\\")\\n\\n .whitelist_function(\\\"board_set_bindings\\\")\\n\\n .whitelist_function(\\\"memcpy1\\\")\\n\\n .whitelist_function(\\\"SX1276RadioNew\\\")\\n\",\n \"file_path\": \"longfi-sys/build.rs\",\n \"rank\": 15,\n \"score\": 16763.903525329537\n },\n {\n \"content\": \" .whitelist_function(\\\"SX126xRadioNew\\\")\\n\\n .whitelist_function(\\\"SX126xReadRegister\\\")\\n\\n .trust_clang_mangling(false)\\n\\n .rustfmt_bindings(true)\\n\\n .rustified_enum(\\\"ClientEvent_t\\\")\\n\\n .rustified_enum(\\\"RfEvent_t\\\")\\n\\n .rustified_enum(\\\"QualityOfService_t\\\")\\n\\n .rustified_enum(\\\"AntPinsMode_t\\\")\\n\\n .rustified_enum(\\\"LongFiAuthMode_t\\\")\\n\\n .derive_copy(false)\\n\\n .derive_debug(false)\\n\\n .layout_tests(false)\\n\\n .generate()\\n\\n .expect(\\\"Failed to generate sx1276 bindings!\\\");\\n\\n\\n\\n let out_path = PathBuf::from(env::var(\\\"OUT_DIR\\\").unwrap());\\n\\n bindings\\n\\n .write_to_file(out_path.join(\\\"bindings.rs\\\"))\\n\\n .expect(\\\"Couldn't write bindings!\\\");\\n\\n}\\n\\n\\n\",\n \"file_path\": \"longfi-sys/build.rs\",\n \"rank\": 16,\n \"score\": 16763.28232079036\n },\n {\n \"content\": \"#[cfg(workaround_build)]\\n\",\n \"file_path\": \"longfi-sys/build.rs\",\n \"rank\": 17,\n \"score\": 16754.729134917987\n },\n {\n \"content\": \"#![allow(non_upper_case_globals)]\\n\\n#![allow(non_camel_case_types)]\\n\\n#![allow(non_snake_case)]\\n\\n#![allow(clippy::all)]\\n\\n#![cfg_attr(not(test), no_std)]\\n\\n\\n\\ninclude!(concat!(env!(\\\"OUT_DIR\\\"), \\\"/bindings.rs\\\"));\",\n \"file_path\": \"longfi-sys/src/lib.rs\",\n \"rank\": 18,\n \"score\": 15821.199156526407\n },\n {\n \"content\": \"<!--\\n\\nM.m.p (YYYY-MM-DD)\\n\\n==================\\n\\nAdd a summary of this release.\\n\\n\\n\\n**BREAKING CHANGES**:\\n\\n\\n\\n* Some change which breaks API or ABI compatiblity with.\\n\\n\\n\\n\\n\\nFeature enhancements:\\n\\n\\n\\n* [Link to github PR]():\\n\\n A new feature.\\n\\n\\n\\nBug fixes:\\n\\n\\n\\n* [Link to github PR]():\\n\\n A bugfix.\\n\\n-->\\n\\n0.1.2 (2019-11-26)\\n\\n==================\\n\\n* [Workaround for SX126x](https://github.com/helium/longfi-device/pull/26)\\n\\nBump longfi-device submodule to allow SX126x to work\\n\\n* [Include only used radio in binary output](https://github.com/helium/longfi-device-rs/pull/23)\\n\\nAPI is changed so that its easier for rustc to only include relevant radio\\n\\n\\n\\n\\n\\n0.1.1 (2019-11-13)\\n\\n==================\\n\\nFixed bug where fingerprints failed due to memory misalignment with C bindings\\n\\n\\n\\n0.1.0 (2019-10-28)\\n\\n==================\\n\\nInitial release.\\n\",\n \"file_path\": \"CHANGELOG.md\",\n \"rank\": 19,\n \"score\": 10159.858949739053\n },\n {\n \"content\": \"# longfi-device-rs\\n\\n[](https://travis-ci.com/helium/longfi-device-rs)\\n\\n\\n\\n## Summary\\n\\n\\n\\nThis project creates Rust bindings for the [LongFi Protocol C-library](https://github.com/helium/longfi-device).\\n\\n\\n\\n## Cloning, building, testing\\n\\n\\n\\nThis project contains the LongFi Protocol C-library as a submodule, so either clone the whole repo and submodules with one command:\\n\\n\\t`git clone --recurse-submodules git@github.com:helium/longfi-device-rs.git`\\n\\n\\n\\nOr, if you've already cloned the top level without submodules, get the submodule:\\n\\n\\t`git submodule update --init --recursive`\\n\\n\\n\\nYou can use cargo to build:\\n\\n\\t`cargo build [--release]`\\n\\n\\n\\nThe configuration in `.cargo/config` is configured to build only for the `thumbv6m-none-eabi` platform currently.\\n\\n\\n\\nThe code in the example directory is for the [STM32L0 Discovery kit](https://www.st.com/en/evaluation-tools/b-l072z-lrwan1.html), which features the [STM32L072CZ](https://www.st.com/en/microcontrollers-microprocessors/stm32l072cz.html).\\n\\n\\n\\nTo upload the code, start a debug server using either JLink (Note: [you can reprogram the ST-Link](https://www.segger.com/products/debug-probes/j-link/models/other-j-links/st-link-on-board/) on the discovery kit to act like a JLink Server; you will lose the virtual UART over USB provided by the ST-Link):\\n\\n\\t`JLinkGDBServer -device STM32L072CZ -speed 4000 -if swd -AutoConnect -1 -port 3333`\\n\\n\\n\\nor OpenOCD server (Note: if you are using the OpenOCD server, you will want to update `.cargo/config:runner` to use `openocd.gdb` instead of `jlink.gdb`):\\n\\n\\t`openocd -f ./openocd.cfg`\\n\\n\\n\\nrun the example:\\n\\n\\t`cargo run --example stm32l0x2 [--release]`\\n\\n\\n\\nRun tests:\\n\\n `cargo test --target x86_64-unknown-linux-gnu --tests`\\n\\n\\n\\n## Debugging the build\\n\\n\\n\\nThe `.travis.yml` will provide the most up to date hints on how to build this repository. Notably, the following dependencies exist:\\n\\n\\n\\n`cmake doxygen xdot install g++-multilib libc6-dev-i386 gcc-arm-none-eabi libnewlib-arm-none-eabi`\\n\\n\\n\\nIn addition, be sure to install `clang` as that appears to resolve header issues in some systems.\\n\",\n \"file_path\": \"README.md\",\n \"rank\": 20,\n \"score\": 10158.246422227174\n },\n {\n \"content\": \"# How to Contribute to this repository #\\n\\n\\n\\nWe value contributions from the community and will do everything we\\n\\ncan go get them reviewed in a timely fashion. If you have code to send\\n\\nour way or a bug to report:\\n\\n\\n\\n* **Contributing Code**: If you have new code or a bug fix, fork this\\n\\n repo, create a logically-named branch, and [submit a PR against this\\n\\n repo](https://github.com/helium/longfi-device-rs/pulls). Include a\\n\\n write up of the PR with details on what it does.\\n\\n\\n\\n* **Reporting Bugs**: Open an issue [against this\\n\\n repo](https://github.com/helium/longfi-device-rs/issues) with as much\\n\\n detail as you can. At the very least you'll include steps to\\n\\n reproduce the problem.\\n\\n\\n\\nThis project is intended to be a safe, welcoming space for\\n\\ncollaboration, and contributors are expected to adhere to the\\n\\n[Contributor Covenant Code of\\n\\nConduct](http://contributor-covenant.org/).\\n\\n\\n\\nAbove all, thank you for taking the time to be a part of the Helium community.\\n\",\n \"file_path\": \"CONTRIBUTING.md\",\n \"rank\": 21,\n \"score\": 10156.485663166908\n },\n {\n \"content\": \" gpioa.pa7,\\n\\n gpioa.pa15,\\n\\n gpioc.pc0,\\n\\n gpioa.pa1,\\n\\n gpioc.pc2,\\n\\n gpioc.pc1,\\n\\n ));\\n\\n\\n\\n let rf_config = Config {\\n\\n oui: OUI,\\n\\n device_id: DEVICE_ID,\\n\\n auth_mode: longfi_device::AuthMode::PresharedKey128,\\n\\n };\\n\\n\\n\\n let mut longfi_radio;\\n\\n if let Some(bindings) = BINDINGS {\\n\\n longfi_radio = LongFi::new(\\n\\n Radio::sx1276(),\\n\\n &mut bindings.bindings,\\n\\n rf_config,\\n\",\n \"file_path\": \"examples/stm32l0x2/main.rs\",\n \"rank\": 28,\n \"score\": 14.010459004795058\n },\n {\n \"content\": \" count: u8,\\n\\n longfi: LongFi,\\n\\n }\\n\\n\\n\\n #[init(spawn = [send_ping], resources = [buffer])]\\n\\n fn init(ctx: init::Context) -> init::LateResources {\\n\\n static mut BINDINGS: Option<LongFiBindings> = None;\\n\\n let device = ctx.device;\\n\\n let mut rcc = device.RCC.freeze(rcc::Config::hsi16());\\n\\n let mut syscfg = syscfg::SYSCFG::new(device.SYSCFG, &mut rcc);\\n\\n\\n\\n let gpioa = device.GPIOA.split(&mut rcc);\\n\\n let gpiob = device.GPIOB.split(&mut rcc);\\n\\n let gpioc = device.GPIOC.split(&mut rcc);\\n\\n\\n\\n let (tx_pin, rx_pin, serial_peripheral) = (gpioa.pa2, gpioa.pa3, device.USART2);\\n\\n\\n\\n let mut serial = serial_peripheral\\n\\n .usart((tx_pin, rx_pin), serial::Config::default(), &mut rcc)\\n\\n .unwrap();\\n\",\n \"file_path\": \"examples/stm32l0x2/main.rs\",\n \"rank\": 30,\n \"score\": 12.075864097026022\n },\n {\n \"content\": \"#![cfg_attr(not(test), no_std)]\\n\\n#![no_main]\\n\\n\\n\\n// To use example, press any key in serial terminal\\n\\n// Packet will send and \\\"Transmit Done!\\\" will print when radio is done sending packet\\n\\n\\n\\nextern crate nb;\\n\\nextern crate panic_halt;\\n\\n\\n\\nuse core::fmt::Write;\\n\\nuse hal::exti::{ExtiLine, GpioLine};\\n\\nuse hal::serial::USART2 as DebugUsart;\\n\\nuse hal::{exti::Exti, prelude::*, rcc, rng::Rng, serial, syscfg};\\n\\nuse longfi_device;\\n\\nuse longfi_device::{ClientEvent, Config, LongFi, Radio, RfEvent};\\n\\nuse rtfm::app;\\n\\nuse stm32l0xx_hal as hal;\\n\\n\\n\\nmod longfi_bindings;\\n\\npub use longfi_bindings::initialize_irq as initialize_radio_irq;\\n\",\n \"file_path\": \"examples/stm32l0x2/main.rs\",\n \"rank\": 31,\n \"score\": 11.8857631971435\n },\n {\n \"content\": \"pub use longfi_bindings::LongFiBindings;\\n\\npub use longfi_bindings::RadioIRQ;\\n\\npub use longfi_bindings::TcxoEn;\\n\\n\\n\\nconst OUI: u32 = 1;\\n\\nconst DEVICE_ID: u16 = 3;\\n\\nconst PRESHARED_KEY: [u8; 16] = [\\n\\n 0x7B, 0x60, 0xC0, 0xF0, 0x77, 0x51, 0x50, 0xD3, 0x2, 0xCE, 0xAE, 0x50, 0xA0, 0xD2, 0x11, 0xC1,\\n\\n];\\n\\n\\n\\n#[app(device = stm32l0xx_hal::pac, peripherals = true)]\\n\\nconst APP: () = {\\n\\n struct Resources {\\n\\n int: Exti,\\n\\n radio_irq: RadioIRQ,\\n\\n debug_uart: serial::Tx<DebugUsart>,\\n\\n uart_rx: serial::Rx<DebugUsart>,\\n\\n #[init([0;512])]\\n\\n buffer: [u8; 512],\\n\\n #[init(0)]\\n\",\n \"file_path\": \"examples/stm32l0x2/main.rs\",\n \"rank\": 32,\n \"score\": 11.831859887137517\n },\n {\n \"content\": \" }\\n\\n write!(debug, \\\"\\\\r\\\\n\\\").unwrap();\\n\\n }\\n\\n // give buffer back to library\\n\\n longfi_radio.set_buffer(ctx.resources.buffer);\\n\\n }\\n\\n ClientEvent::ClientEvent_None => {}\\n\\n }\\n\\n }\\n\\n\\n\\n #[task(capacity = 4, priority = 2, resources = [debug_uart, count, longfi])]\\n\\n fn send_ping(ctx: send_ping::Context) {\\n\\n write!(ctx.resources.debug_uart, \\\"Sending Ping\\\\r\\\\n\\\").unwrap();\\n\\n let packet: [u8; 5] = [0xDE, 0xAD, 0xBE, 0xEF, *ctx.resources.count];\\n\\n *ctx.resources.count += 1;\\n\\n ctx.resources.longfi.send(&packet);\\n\\n }\\n\\n\\n\\n #[task(binds = USART2, priority=1, resources = [uart_rx], spawn = [send_ping])]\\n\\n fn USART2(ctx: USART2::Context) {\\n\",\n \"file_path\": \"examples/stm32l0x2/main.rs\",\n \"rank\": 35,\n \"score\": 9.22257017003065\n },\n {\n \"content\": \" let rx = ctx.resources.uart_rx;\\n\\n rx.read().unwrap();\\n\\n ctx.spawn.send_ping().unwrap();\\n\\n }\\n\\n\\n\\n #[task(binds = EXTI4_15, priority = 1, resources = [radio_irq, int], spawn = [radio_event])]\\n\\n fn EXTI4_15(ctx: EXTI4_15::Context) {\\n\\n Exti::unpend(GpioLine::from_raw_line(ctx.resources.radio_irq.pin_number()).unwrap());\\n\\n ctx.spawn.radio_event(RfEvent::DIO0).unwrap();\\n\\n }\\n\\n\\n\\n // Interrupt handlers used to dispatch software tasks\\n\\n extern \\\"C\\\" {\\n\\n fn USART4_USART5();\\n\\n }\\n\\n};\\n\",\n \"file_path\": \"examples/stm32l0x2/main.rs\",\n \"rank\": 36,\n \"score\": 7.665330387851416\n },\n {\n \"content\": \"\\n\\n // listen for incoming bytes which will trigger transmits\\n\\n serial.listen(serial::Event::Rxne);\\n\\n let (mut tx, rx) = serial.split();\\n\\n\\n\\n write!(tx, \\\"LongFi Device Test\\\\r\\\\n\\\").unwrap();\\n\\n\\n\\n let mut exti = Exti::new(device.EXTI);\\n\\n // constructor initializes 48 MHz clock that RNG requires\\n\\n // Initialize 48 MHz clock and RNG\\n\\n let hsi48 = rcc.enable_hsi48(&mut syscfg, device.CRS);\\n\\n let rng = Rng::new(device.RNG, &mut rcc, hsi48);\\n\\n let radio_irq = initialize_radio_irq(gpiob.pb4, &mut syscfg, &mut exti);\\n\\n\\n\\n *BINDINGS = Some(LongFiBindings::new(\\n\\n device.SPI1,\\n\\n &mut rcc,\\n\\n rng,\\n\\n gpiob.pb3,\\n\\n gpioa.pa6,\\n\",\n \"file_path\": \"examples/stm32l0x2/main.rs\",\n \"rank\": 37,\n \"score\": 7.519191416544509\n },\n {\n \"content\": \" &PRESHARED_KEY,\\n\\n )\\n\\n .unwrap()\\n\\n } else {\\n\\n panic!(\\\"No bindings exist\\\");\\n\\n }\\n\\n\\n\\n longfi_radio.set_buffer(ctx.resources.buffer);\\n\\n\\n\\n write!(tx, \\\"Going to main loop\\\\r\\\\n\\\").unwrap();\\n\\n\\n\\n // Return the initialised resources.\\n\\n init::LateResources {\\n\\n int: exti,\\n\\n radio_irq: radio_irq,\\n\\n debug_uart: tx,\\n\\n uart_rx: rx,\\n\\n longfi: longfi_radio,\\n\\n }\\n\\n }\\n\",\n \"file_path\": \"examples/stm32l0x2/main.rs\",\n \"rank\": 40,\n \"score\": 6.018540052101624\n },\n {\n \"content\": \"\\n\\n #[task(capacity = 4, priority = 2, resources = [debug_uart, buffer, longfi])]\\n\\n fn radio_event(ctx: radio_event::Context, event: RfEvent) {\\n\\n let longfi_radio = ctx.resources.longfi;\\n\\n let client_event = longfi_radio.handle_event(event);\\n\\n let debug = ctx.resources.debug_uart;\\n\\n match client_event {\\n\\n ClientEvent::ClientEvent_TxDone => {\\n\\n write!(debug, \\\"Transmit Done!\\\\r\\\\n\\\").unwrap();\\n\\n }\\n\\n ClientEvent::ClientEvent_Rx => {\\n\\n // get receive buffer\\n\\n let rx_packet = longfi_radio.get_rx();\\n\\n write!(debug, \\\"Received packet\\\\r\\\\n\\\").unwrap();\\n\\n write!(debug, \\\" Length = {}\\\\r\\\\n\\\", rx_packet.len).unwrap();\\n\\n write!(debug, \\\" Rssi = {}\\\\r\\\\n\\\", rx_packet.rssi).unwrap();\\n\\n write!(debug, \\\" Snr = {}\\\\r\\\\n\\\", rx_packet.snr).unwrap();\\n\\n unsafe {\\n\\n for i in 0..rx_packet.len {\\n\\n write!(debug, \\\"{:X} \\\", *rx_packet.buf.offset(i as isize)).unwrap();\\n\",\n \"file_path\": \"examples/stm32l0x2/main.rs\",\n \"rank\": 41,\n \"score\": 5.1709385034571085\n }\n]","isConversational":false}}},{"rowIdx":2385,"cells":{"lang":{"kind":"string","value":"Rust"},"file_path":{"kind":"string","value":"src/dft/mod.rs"},"repo_name":{"kind":"string","value":"feos-org/feos-gc-pcsaft"},"commit":{"kind":"string","value":"4ce900cab46848a4f6352432d6d23c8f1fda5b6b"},"file_code":{"kind":"string","value":"use crate::eos::GcPcSaftOptions;\nuse feos_core::MolarWeight;\nuse feos_dft::adsorption::FluidParameters;\nuse feos_dft::fundamental_measure_theory::{FMTContribution, FMTProperties, FMTVersion};\nuse feos_dft::{FunctionalContribution, HelmholtzEnergyFunctional, MoleculeShape, DFT};\nuse ndarray::Array1;\nuse num_dual::DualNum;\nuse petgraph::graph::UnGraph;\nuse quantity::si::{SIArray1, SIUnit, GRAM, MOL};\nuse std::f64::consts::FRAC_PI_6;\nuse std::rc::Rc;\n\nmod association;\nmod dispersion;\nmod hard_chain;\nmod parameter;\nuse association::AssociationFunctional;\nuse dispersion::AttractiveFunctional;\nuse hard_chain::ChainFunctional;\npub use parameter::GcPcSaftFunctionalParameters;\n\npub struct GcPcSaftFunctional {\n pub parameters: Rc<GcPcSaftFunctionalParameters>,\n fmt_version: FMTVersion,\n options: GcPcSaftOptions,\n contributions: Vec<Box<dyn FunctionalContribution>>,\n}\n\nimpl GcPcSaftFunctional {\n pub fn new(parameters: Rc<GcPcSaftFunctionalParameters>) -> DFT<Self> {\n Self::with_options(\n parameters,\n FMTVersion::WhiteBear,\n GcPcSaftOptions::default(),\n )\n }\n\n pub fn with_options(\n parameters: Rc<GcPcSaftFunctionalParameters>,\n fmt_version: FMTVersion,\n saft_options: GcPcSaftOptions,\n ) -> DFT<Self> {\n let mut contributions: Vec<Box<dyn FunctionalContribution>> = Vec::with_capacity(4);\n\n \n let hs = FMTContribution::new(¶meters, fmt_version);\n contributions.push(Box::new(hs));\n\n \n let chain = ChainFunctional::new(¶meters);\n contributions.push(Box::new(chain));\n\n \n let att = AttractiveFunctional::new(¶meters);\n contributions.push(Box::new(att));\n\n \n if !parameters.assoc_segment.is_empty() {\n let assoc = AssociationFunctional::new(\n ¶meters,\n saft_options.max_iter_cross_assoc,\n saft_options.tol_cross_assoc,\n );\n contributions.push(Box::new(assoc));\n }\n\n (Self {\n parameters,\n fmt_version,\n options: saft_options,\n contributions,\n })\n .into()\n }\n}\n\nimpl HelmholtzEnergyFunctional for GcPcSaftFunctional {\n fn molecule_shape(&self) -> MoleculeShape {\n MoleculeShape::Heterosegmented(&self.parameters.component_index)\n }\n\n fn subset(&self, component_list: &[usize]) -> DFT<Self> {\n Self::with_options(\n Rc::new(self.parameters.subset(component_list)),\n self.fmt_version,\n self.options,\n )\n }\n\n fn compute_max_density(&self, moles: &Array1<f64>) -> f64 {\n let p = &self.parameters;\n let moles_segments: Array1<f64> = p.component_index.iter().map(|&i| moles[i]).collect();\n self.options.max_eta * moles.sum()\n / (FRAC_PI_6 * &p.m * p.sigma.mapv(|v| v.powi(3)) * moles_segments).sum()\n }\n\n fn contributions(&self) -> &[Box<dyn FunctionalContribution>] {\n &self.contributions\n }\n\n fn bond_lengths(&self, temperature: f64) -> UnGraph<(), f64> {\n \n let d = self.parameters.hs_diameter(temperature);\n\n self.parameters.bonds.map(\n |_, _| (),\n |e, _| {\n let (i, j) = self.parameters.bonds.edge_endpoints(e).unwrap();\n let di = d[i.index()];\n let dj = d[j.index()];\n 0.5 * (di + dj)\n },\n )\n }\n}\n\nimpl MolarWeight<SIUnit> for GcPcSaftFunctional {\n fn molar_weight(&self) -> SIArray1 {\n self.parameters.molarweight.clone() * GRAM / MOL\n }\n}\n\nimpl FMTProperties for GcPcSaftFunctionalParameters {\n fn component_index(&self) -> Array1<usize> {\n self.component_index.clone()\n }\n\n fn chain_length(&self) -> Array1<f64> {\n self.m.clone()\n }\n\n fn hs_diameter<D: DualNum<f64>>(&self, temperature: D) -> Array1<D> {\n self.hs_diameter(temperature)\n }\n}\n\nimpl FluidParameters for GcPcSaftFunctional {\n fn epsilon_k_ff(&self) -> Array1<f64> {\n self.parameters.epsilon_k.clone()\n }\n\n fn sigma_ff(&self) -> &Array1<f64> {\n &self.parameters.sigma\n }\n}\n"},"prefix":{"kind":"string","value":"use crate::eos::GcPcSaftOptions;\nuse feos_core::MolarWeight;\nuse feos_dft::adsorption::FluidParameters;\nuse feos_dft::fundamental_measure_theory::{FMTContribution, FMTProperties, FMTVersion};\nuse feos_dft::{FunctionalContribution, HelmholtzEnergyFunctional, MoleculeShape, DFT};\nuse ndarray::Array1;\nuse num_dual::DualNum;\nuse petgraph::graph::UnGraph;\nuse quantity::si::{SIArray1, SIUnit, GRAM, MOL};\nuse std::f64::consts::FRAC_PI_6;\nuse std::rc::Rc;\n\nmod association;\nmod dispersion;\nmod hard_chain;\nmod parameter;\nuse association::AssociationFunctional;\nuse dispersion::AttractiveFunctional;\nuse hard_chain::ChainFunctional;\npub use parameter::GcPcSaftFunctionalParameters;\n\npub struct GcPcSaftFunctional {\n pub parameters: Rc<GcPcSaftFunctionalParameters>,\n fmt_version: FMTVersion,\n options: GcPcSaftOptions,\n contributions: Vec<Box<dyn FunctionalContribution>>,\n}\n\nimpl GcPcSaftFunctional {\n pub fn new(parameters: Rc<GcPcSaftFunctionalParameters>) -> DFT<Self> {\n Self::with_options(\n parameters,\n FMTVersion::WhiteBear,\n GcPcSaftOptions::default(),\n )\n }\n\n pub fn with_options(\n parameters: Rc<GcPcSaftFunctionalParameters>,\n fmt_version: FMTVersion,\n saft_options: GcPcSaftOptions,\n ) -> DFT<Self> {\n let mut contributions: Vec<Box<dyn FunctionalContribution>> = Vec::with_capacity(4);\n\n \n let hs = FMTContribution::new(¶meters, fmt_version);\n contributions.push(Box::new(hs));\n\n \n let chain = ChainFunctional::new(¶meters);\n contributions.push(Box::new(chain));\n\n \n let att = AttractiveFunctional::new(¶meters);\n contributions.push(Box::new(att));\n\n \n if !parameters.assoc_segment.is_empty() {\n let assoc = AssociationFunctional::new(\n ¶meters,\n saft_options.max_iter_cross_assoc,\n saft_options.tol_cross_assoc,\n );\n contributions.push(Box::new(assoc));\n }\n\n (Self {\n parameters,\n fmt_version,\n options: saft_options,\n contributions,\n })\n .into()\n }\n}\n\nimpl HelmholtzEnergyFunctional for GcPcSaftFunctional {\n fn molecule_shape(&self) -> MoleculeShape {\n MoleculeShape::Heterosegmented(&self.parameters.component_index)\n }\n\n "},"suffix":{"kind":"string","value":"\n\n fn compute_max_density(&self, moles: &Array1<f64>) -> f64 {\n let p = &self.parameters;\n let moles_segments: Array1<f64> = p.component_index.iter().map(|&i| moles[i]).collect();\n self.options.max_eta * moles.sum()\n / (FRAC_PI_6 * &p.m * p.sigma.mapv(|v| v.powi(3)) * moles_segments).sum()\n }\n\n fn contributions(&self) -> &[Box<dyn FunctionalContribution>] {\n &self.contributions\n }\n\n fn bond_lengths(&self, temperature: f64) -> UnGraph<(), f64> {\n \n let d = self.parameters.hs_diameter(temperature);\n\n self.parameters.bonds.map(\n |_, _| (),\n |e, _| {\n let (i, j) = self.parameters.bonds.edge_endpoints(e).unwrap();\n let di = d[i.index()];\n let dj = d[j.index()];\n 0.5 * (di + dj)\n },\n )\n }\n}\n\nimpl MolarWeight<SIUnit> for GcPcSaftFunctional {\n fn molar_weight(&self) -> SIArray1 {\n self.parameters.molarweight.clone() * GRAM / MOL\n }\n}\n\nimpl FMTProperties for GcPcSaftFunctionalParameters {\n fn component_index(&self) -> Array1<usize> {\n self.component_index.clone()\n }\n\n fn chain_length(&self) -> Array1<f64> {\n self.m.clone()\n }\n\n fn hs_diameter<D: DualNum<f64>>(&self, temperature: D) -> Array1<D> {\n self.hs_diameter(temperature)\n }\n}\n\nimpl FluidParameters for GcPcSaftFunctional {\n fn epsilon_k_ff(&self) -> Array1<f64> {\n self.parameters.epsilon_k.clone()\n }\n\n fn sigma_ff(&self) -> &Array1<f64> {\n &self.parameters.sigma\n }\n}\n"},"middle":{"kind":"string","value":"fn subset(&self, component_list: &[usize]) -> DFT<Self> {\n Self::with_options(\n Rc::new(self.parameters.subset(component_list)),\n self.fmt_version,\n self.options,\n )\n }"},"strategy":{"kind":"string","value":"function_block-full_function"},"context_items":{"kind":"list like","value":[{"content":"#[pymodule]\n\npub fn dft(_py: Python<'_>, m: &PyModule) -> PyResult<()> {\n\n m.add_class::<PyGcPcSaftFunctional>()?;\n\n m.add_class::<PyState>()?;\n\n m.add_class::<PyPhaseDiagram>()?;\n\n m.add_class::<PyPhaseEquilibrium>()?;\n\n m.add_class::<PyPlanarInterface>()?;\n\n m.add_class::<Geometry>()?;\n\n m.add_class::<PyPore1D>()?;\n\n m.add_class::<PyPore3D>()?;\n\n m.add_class::<PyExternalPotential>()?;\n\n m.add_class::<PyAdsorption1D>()?;\n\n m.add_class::<PyAdsorption3D>()?;\n\n m.add_class::<PySurfaceTensionDiagram>()?;\n\n m.add_class::<PyDFTSolver>()?;\n\n m.add_class::<PySolvationProfile>()?;\n\n m.add_class::<FMTVersion>()?;\n\n m.add_class::<PyMicelleProfile>()?;\n\n Ok(())\n\n}\n","file_path":"build_wheel/src/dft.rs","rank":0,"score":92379.61473575173},{"content":"#[test]\n\n#[allow(non_snake_case)]\n\nfn test_dft_assoc() -> Result<(), Box<dyn Error>> {\n\n let parameters = GcPcSaftFunctionalParameters::from_json_segments(\n\n &[\"1-pentanol\"],\n\n \"parameters/gc_substances.json\",\n\n \"parameters/sauer2014_hetero.json\",\n\n None,\n\n IdentifierOption::Name,\n\n )\n\n .unwrap();\n\n\n\n let func = Rc::new(GcPcSaftFunctional::new(Rc::new(parameters)));\n\n let t = 300.0 * KELVIN;\n\n let w = 100.0 * ANGSTROM;\n\n let points = 4096;\n\n let vle = PhaseEquilibrium::pure(&func, t, None, Default::default())?;\n\n let profile = PlanarInterface::from_tanh(&vle, points, w, 600.0 * KELVIN)?.solve(None)?;\n\n println!(\n\n \"hetero {} {} {}\",\n\n profile.surface_tension.unwrap(),\n\n vle.vapor().density,\n","file_path":"tests/dft.rs","rank":1,"score":79656.25002901137},{"content":"pub fn helmholtz_energy_density_cross_association<S, D: DualNum<f64> + ScalarOperand>(\n\n // p: &GcPcSaftParameters<B>,\n\n assoc_segment: &Array1<usize>,\n\n sigma3_kappa_aibj: &Array2<f64>,\n\n epsilon_k_aibj: &Array2<f64>,\n\n na: &Array1<f64>,\n\n nb: &Array1<f64>,\n\n temperature: D,\n\n density: &ArrayBase<S, Ix1>,\n\n diameter: &Array1<D>,\n\n n2: D,\n\n n3i: D,\n\n xi: D,\n\n max_iter: usize,\n\n tol: f64,\n\n x0: Option<&mut Array1<f64>>,\n\n) -> Result<D, EosError>\n\nwhere\n\n S: Data<Elem = D>,\n\n{\n","file_path":"src/eos/association.rs","rank":2,"score":75762.02849625803},{"content":"#[test]\n\n#[allow(non_snake_case)]\n\nfn test_dft() -> Result<(), Box<dyn Error>> {\n\n // correct for different k_B in old code\n\n let KB_old = 1.38064852e-23 * JOULE / KELVIN;\n\n let NAV_old = 6.022140857e23 / MOL;\n\n\n\n let parameters = GcPcSaftFunctionalParameters::from_json_segments(\n\n &[\"propane\"],\n\n \"parameters/gc_substances.json\",\n\n \"parameters/sauer2014_hetero.json\",\n\n None,\n\n IdentifierOption::Name,\n\n )\n\n .unwrap();\n\n\n\n let func = Rc::new(GcPcSaftFunctional::new(Rc::new(parameters)));\n\n let t = 200.0 * KELVIN;\n\n let w = 150.0 * ANGSTROM;\n\n let points = 2048;\n\n let tc = State::critical_point(&func, None, None, Default::default())?.temperature;\n\n let vle = PhaseEquilibrium::pure(&func, t, None, Default::default())?;\n","file_path":"tests/dft.rs","rank":3,"score":60265.56126956189},{"content":"fn association_strength<D: DualNum<f64>>(\n\n assoc_segment: &Array1<usize>,\n\n sigma3_kappa_aibj: &Array2<f64>,\n\n epsilon_k_aibj: &Array2<f64>,\n\n temperature: D,\n\n diameter: &Array1<D>,\n\n n2: D,\n\n n3i: D,\n\n xi: D,\n\n i: usize,\n\n j: usize,\n\n) -> D {\n\n let ai = assoc_segment[i];\n\n let aj = assoc_segment[j];\n\n let k = diameter[ai] * diameter[aj] / (diameter[ai] + diameter[aj]) * (n2 * n3i);\n\n n3i * (k * xi * (k / 18.0 + 0.5) + 1.0)\n\n * sigma3_kappa_aibj[(i, j)]\n\n * (temperature.recip() * epsilon_k_aibj[(i, j)]).exp_m1()\n\n}\n\n\n","file_path":"src/eos/association.rs","rank":4,"score":60265.02538949664},{"content":"#[pymodule]\n\npub fn eos(_py: Python<'_>, m: &PyModule) -> PyResult<()> {\n\n m.add_class::<PyGcPcSaft>()?;\n\n m.add_class::<PyState>()?;\n\n m.add_class::<PyPhaseDiagram>()?;\n\n m.add_class::<PyPhaseEquilibrium>()?;\n\n Ok(())\n\n}\n","file_path":"build_wheel/src/eos.rs","rank":5,"score":55469.1140607223},{"content":"use super::parameter::GcPcSaftFunctionalParameters;\n\nuse crate::eos::association::{\n\n assoc_site_frac_a, assoc_site_frac_ab, helmholtz_energy_density_cross_association,\n\n};\n\nuse feos_core::EosError;\n\nuse feos_dft::{\n\n FunctionalContributionDual, WeightFunction, WeightFunctionInfo, WeightFunctionShape,\n\n};\n\nuse ndarray::*;\n\nuse num_dual::DualNum;\n\nuse std::f64::consts::PI;\n\nuse std::fmt;\n\nuse std::ops::MulAssign;\n\nuse std::rc::Rc;\n\n\n\npub const N0_CUTOFF: f64 = 1e-9;\n\n\n\n#[derive(Clone)]\n\npub struct AssociationFunctional {\n\n parameters: Rc<GcPcSaftFunctionalParameters>,\n","file_path":"src/dft/association.rs","rank":13,"score":54453.0327986033},{"content":" max_iter: usize,\n\n tol: f64,\n\n}\n\n\n\nimpl AssociationFunctional {\n\n pub fn new(parameters: &Rc<GcPcSaftFunctionalParameters>, max_iter: usize, tol: f64) -> Self {\n\n Self {\n\n parameters: parameters.clone(),\n\n max_iter,\n\n tol,\n\n }\n\n }\n\n}\n\n\n\nimpl<N> FunctionalContributionDual<N> for AssociationFunctional\n\nwhere\n\n N: DualNum<f64> + ScalarOperand,\n\n{\n\n fn weight_functions(&self, temperature: N) -> WeightFunctionInfo<N> {\n\n let p = &self.parameters;\n","file_path":"src/dft/association.rs","rank":14,"score":54451.02118077254},{"content":" xi,\n\n self.max_iter,\n\n self.tol,\n\n Some(&mut x),\n\n )\n\n })\n\n .collect::<Result<Array1<N>, _>>()?\n\n .into_shape(n2.raw_dim())\n\n .unwrap())\n\n }\n\n }\n\n}\n\n\n\nimpl fmt::Display for AssociationFunctional {\n\n fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {\n\n write!(f, \"Association functional\")\n\n }\n\n}\n","file_path":"src/dft/association.rs","rank":15,"score":54444.12524107605},{"content":" * ((temperature.recip() * p.epsilon_k_aibj[(0, 0)]).exp_m1()\n\n * p.sigma3_kappa_aibj[(0, 0)])\n\n * rho0.index_axis(Axis(0), 0);\n\n\n\n let na = p.na[0];\n\n let nb = p.nb[0];\n\n let f = |x: N| x.ln() - x * 0.5 + 0.5;\n\n if nb > 0.0 {\n\n // no cross association, two association sites\n\n let xa = deltarho.mapv(|d| assoc_site_frac_ab(d, na, nb));\n\n let xb = (&xa - 1.0) * (na / nb) + 1.0;\n\n Ok((xa.mapv(f) * na + xb.mapv(f) * nb) * rho0.index_axis(Axis(0), 0))\n\n } else {\n\n // no cross association, one association site\n\n let xa = deltarho.mapv(|d| assoc_site_frac_a(d, na));\n\n\n\n Ok(xa.mapv(f) * na * rho0.index_axis(Axis(0), 0))\n\n }\n\n } else {\n\n let mut x: Array1<f64> = Array::from_elem(2 * nassoc, 0.2);\n","file_path":"src/dft/association.rs","rank":16,"score":54442.35295510072},{"content":" // weighted densities\n\n let n0i = weighted_densities.slice_axis(Axis(0), Slice::new(0, Some(segments as isize), 1));\n\n let n2vi: Vec<_> = (0..dim)\n\n .map(|i| {\n\n weighted_densities.slice_axis(\n\n Axis(0),\n\n Slice::new(\n\n (segments * (i + 1)) as isize,\n\n Some((segments * (i + 2)) as isize),\n\n 1,\n\n ),\n\n )\n\n })\n\n .collect();\n\n let n3 = weighted_densities.index_axis(Axis(0), segments * (dim + 1));\n\n\n\n // calculate rho0 (only associating segments)\n\n let diameter = p.hs_diameter(temperature);\n\n let mut n2i = n0i.to_owned();\n\n for (i, mut n2i) in n2i.outer_iter_mut().enumerate() {\n","file_path":"src/dft/association.rs","rank":17,"score":54442.079646429294},{"content":" true,\n\n )\n\n }\n\n\n\n fn calculate_helmholtz_energy_density(\n\n &self,\n\n temperature: N,\n\n weighted_densities: ArrayView2<N>,\n\n ) -> Result<Array1<N>, EosError> {\n\n let p = &self.parameters;\n\n\n\n // number of segments\n\n let segments = p.m.len();\n\n\n\n // number of associating segments\n\n let nassoc = p.assoc_segment.len();\n\n\n\n // number of dimensions\n\n let dim = (weighted_densities.shape()[0] - 1) / segments - 1;\n\n\n","file_path":"src/dft/association.rs","rank":18,"score":54441.759394945184},{"content":" .iter()\n\n .fold(Array::zeros(n2.raw_dim()), |acc, n2v| acc + n2v * n2v)\n\n / -(&n2 * &n2)\n\n + 1.0;\n\n xi.iter_mut()\n\n .zip(&n0i.sum_axis(Axis(0)))\n\n .for_each(|(xi, &n0i)| {\n\n if n0i.re() < N0_CUTOFF {\n\n *xi = N::one();\n\n }\n\n });\n\n\n\n // auxiliary variables\n\n let n3i = n3.mapv(|n3| (-n3 + 1.0).recip());\n\n\n\n // only one associating component\n\n if nassoc == 1 {\n\n // association strength\n\n let k = &n2 * &n3i * diameter[p.assoc_segment[0]] * 0.5;\n\n let deltarho = (((&k / 18.0 + 0.5) * &k * xi + 1.0) * n3i)\n","file_path":"src/dft/association.rs","rank":19,"score":54441.695990026354},{"content":" n2i.mul_assign(diameter[i].powi(2) * p.m[i] * PI);\n\n }\n\n let mut rho0: Array2<N> = (n2vi\n\n .iter()\n\n .fold(Array2::zeros(n2i.raw_dim()), |acc, n2vi| acc + n2vi * n2vi)\n\n / -(&n2i * &n2i)\n\n + 1.0)\n\n * n0i;\n\n rho0.iter_mut().zip(&n0i).for_each(|(rho0, &n0i)| {\n\n if n0i.re() < N0_CUTOFF {\n\n *rho0 = n0i;\n\n }\n\n });\n\n let rho0 =\n\n Array2::from_shape_fn((nassoc, n3.len()), |(i, j)| rho0[(p.assoc_segment[i], j)]);\n\n\n\n // calculate xi\n\n let n2v: Vec<_> = n2vi.iter().map(|n2vi| n2vi.sum_axis(Axis(0))).collect();\n\n let n2 = n2i.sum_axis(Axis(0));\n\n let mut xi = n2v\n","file_path":"src/dft/association.rs","rank":20,"score":54441.40563712252},{"content":" Ok(rho0\n\n .view()\n\n .into_shape([nassoc, rho0.len() / nassoc])\n\n .unwrap()\n\n .axis_iter(Axis(1))\n\n .zip(n2.iter())\n\n .zip(n3i.iter())\n\n .zip(xi.iter())\n\n .map(|(((rho0, &n2), &n3i), &xi)| {\n\n helmholtz_energy_density_cross_association(\n\n &p.assoc_segment,\n\n &p.sigma3_kappa_aibj,\n\n &p.epsilon_k_aibj,\n\n &p.na,\n\n &p.nb,\n\n temperature,\n\n &rho0,\n\n &diameter,\n\n n2,\n\n n3i,\n","file_path":"src/dft/association.rs","rank":21,"score":54439.13860810976},{"content":" let r = p.hs_diameter(temperature) * 0.5;\n\n WeightFunctionInfo::new(p.component_index.clone(), false)\n\n .add(\n\n WeightFunction::new_scaled(r.clone(), WeightFunctionShape::Delta),\n\n false,\n\n )\n\n .add(\n\n WeightFunction {\n\n prefactor: p.m.mapv(N::from),\n\n kernel_radius: r.clone(),\n\n shape: WeightFunctionShape::DeltaVec,\n\n },\n\n false,\n\n )\n\n .add(\n\n WeightFunction {\n\n prefactor: p.m.mapv(N::from),\n\n kernel_radius: r,\n\n shape: WeightFunctionShape::Theta,\n\n },\n","file_path":"src/dft/association.rs","rank":22,"score":54436.85413702663},{"content":" binary_segment_records: Option<Vec<BinaryRecord<String, f64>>>,\n\n}\n\n\n\nimpl GcPcSaftFunctionalParameters {\n\n pub fn from_segments(\n\n chemical_records: Vec<ChemicalRecord>,\n\n segment_records: Vec<SegmentRecord<GcPcSaftRecord, JobackRecord>>,\n\n binary_segment_records: Option<Vec<BinaryRecord<String, f64>>>,\n\n ) -> Result<Self, ParameterError> {\n\n let segment_map: IndexMap<_, _> = segment_records\n\n .iter()\n\n .map(|r| (r.identifier.clone(), r.clone()))\n\n .collect();\n\n\n\n let mut molarweight = Array1::zeros(chemical_records.len());\n\n let mut component_index = Vec::new();\n\n let mut identifiers = Vec::new();\n\n let mut m = Vec::new();\n\n let mut sigma = Vec::new();\n\n let mut epsilon_k = Vec::new();\n","file_path":"src/dft/parameter.rs","rank":23,"score":53991.1806523264},{"content":"use crate::record::GcPcSaftRecord;\n\nuse feos_core::joback::JobackRecord;\n\nuse feos_core::parameter::{\n\n BinaryRecord, ChemicalRecord, IdentifierOption, ParameterError, SegmentRecord,\n\n};\n\nuse indexmap::{IndexMap, IndexSet};\n\nuse ndarray::{Array1, Array2};\n\nuse num_dual::DualNum;\n\nuse petgraph::dot::{Config, Dot};\n\nuse petgraph::graph::{Graph, UnGraph};\n\nuse std::fmt::Write;\n\nuse std::fs::File;\n\nuse std::io::BufReader;\n\nuse std::path::Path;\n\n\n\n/// psi Parameter for heterosegmented DFT (Mairhofer2018)\n\nconst PSI_GC_DFT: f64 = 1.5357;\n\n\n\n/// Parameter set required for the gc-PC-SAFT Helmholtz energy functional.\n\npub struct GcPcSaftFunctionalParameters {\n","file_path":"src/dft/parameter.rs","rank":24,"score":53990.88141222919},{"content":" chemical_records,\n\n self.segment_records.clone(),\n\n self.binary_segment_records.clone(),\n\n )\n\n .unwrap()\n\n }\n\n\n\n pub fn hs_diameter<D: DualNum<f64>>(&self, temperature: D) -> Array1<D> {\n\n let ti = temperature.recip() * -3.0;\n\n Array1::from_shape_fn(self.sigma.len(), |i| {\n\n -((ti * self.epsilon_k[i]).exp() * 0.12 - 1.0) * self.sigma[i]\n\n })\n\n }\n\n\n\n pub fn to_markdown(&self) -> String {\n\n let mut output = String::new();\n\n let o = &mut output;\n\n write!(\n\n o,\n\n \"|component|molarweight|segment|$m$|$\\\\sigma$|$\\\\varepsilon$|$\\\\kappa_{{AB}}$|$\\\\varepsilon_{{AB}}$|$N_A$|$N_B$|\\n|-|-|-|-|-|-|-|-|-|-|\"\n","file_path":"src/dft/parameter.rs","rank":25,"score":53987.992184617055},{"content":" // Association\n\n let sigma3_kappa_aibj = Array2::from_shape_fn([kappa_ab.len(); 2], |(i, j)| {\n\n (sigma[assoc_segment[i]] * sigma[assoc_segment[j]]).powf(1.5)\n\n * (kappa_ab[i] * kappa_ab[j]).sqrt()\n\n });\n\n let epsilon_k_aibj = Array2::from_shape_fn([epsilon_k_ab.len(); 2], |(i, j)| {\n\n 0.5 * (epsilon_k_ab[i] + epsilon_k_ab[j])\n\n });\n\n\n\n Ok(Self {\n\n molarweight,\n\n component_index: Array1::from_vec(component_index),\n\n identifiers,\n\n m: Array1::from_vec(m),\n\n sigma: Array1::from_vec(sigma),\n\n epsilon_k: Array1::from_vec(epsilon_k),\n\n bonds,\n\n assoc_segment: Array1::from_vec(assoc_segment),\n\n kappa_ab: Array1::from_vec(kappa_ab),\n\n epsilon_k_ab: Array1::from_vec(epsilon_k_ab),\n","file_path":"src/dft/parameter.rs","rank":26,"score":53987.80421209468},{"content":" na: Array1::from_vec(na),\n\n nb: Array1::from_vec(nb),\n\n psi_dft: Array1::from_vec(psi_dft),\n\n k_ij,\n\n sigma_ij,\n\n epsilon_k_ij,\n\n sigma3_kappa_aibj,\n\n epsilon_k_aibj,\n\n chemical_records,\n\n segment_records,\n\n binary_segment_records,\n\n })\n\n }\n\n\n\n pub fn from_json_segments<P>(\n\n substances: &[&str],\n\n file_pure: P,\n\n file_segments: P,\n\n file_binary: Option<P>,\n\n search_option: IdentifierOption,\n","file_path":"src/dft/parameter.rs","rank":27,"score":53986.56216227673},{"content":" .map(|i, _| &self.identifiers[i.index()], |_, _| ());\n\n format!(\"{:?}\", Dot::with_config(&graph, &[Config::EdgeNoLabel]))\n\n }\n\n}\n\n\n\nimpl std::fmt::Display for GcPcSaftFunctionalParameters {\n\n fn fmt(&self, f: &mut std::fmt::Formatter<'_>) -> std::fmt::Result {\n\n write!(f, \"GcPcSaftFunctionalParameters(\")?;\n\n write!(f, \"\\n\\tmolarweight={}\", self.molarweight)?;\n\n write!(f, \"\\n\\tcomponent_index={}\", self.component_index)?;\n\n write!(f, \"\\n\\tm={}\", self.m)?;\n\n write!(f, \"\\n\\tsigma={}\", self.sigma)?;\n\n write!(f, \"\\n\\tepsilon_k={}\", self.epsilon_k)?;\n\n write!(f, \"\\n\\tbonds={:?}\", self.bonds)?;\n\n if !self.assoc_segment.is_empty() {\n\n write!(f, \"\\n\\tassoc_segment={}\", self.assoc_segment)?;\n\n write!(f, \"\\n\\tkappa_ab={}\", self.kappa_ab)?;\n\n write!(f, \"\\n\\tepsilon_k_ab={}\", self.epsilon_k_ab)?;\n\n write!(f, \"\\n\\tna={}\", self.na)?;\n\n write!(f, \"\\n\\tnb={}\", self.nb)?;\n\n }\n\n write!(f, \"\\n)\")\n\n }\n\n}\n","file_path":"src/dft/parameter.rs","rank":28,"score":53986.40010662325},{"content":" ) -> Result<Self, ParameterError>\n\n where\n\n P: AsRef<Path>,\n\n {\n\n let queried: IndexSet<String> = substances\n\n .iter()\n\n .map(|identifier| identifier.to_string())\n\n .collect();\n\n\n\n let reader = BufReader::new(File::open(file_pure)?);\n\n let chemical_records: Vec<ChemicalRecord> = serde_json::from_reader(reader)?;\n\n let mut record_map: IndexMap<_, _> = chemical_records\n\n .into_iter()\n\n .filter_map(|record| {\n\n record\n\n .identifier()\n\n .as_string(search_option)\n\n .map(|i| (i, record))\n\n })\n\n .collect();\n","file_path":"src/dft/parameter.rs","rank":29,"score":53986.11514384723},{"content":" let mut bonds = Graph::default();\n\n let mut assoc_segment = Vec::new();\n\n let mut kappa_ab = Vec::new();\n\n let mut epsilon_k_ab = Vec::new();\n\n let mut na = Vec::new();\n\n let mut nb = Vec::new();\n\n let mut psi_dft = Vec::new();\n\n\n\n let mut segment_index = 0;\n\n for (i, chemical_record) in chemical_records.iter().enumerate() {\n\n let (segment_list, bond_list) = chemical_record.segment_and_bond_list()?;\n\n\n\n bonds.extend_with_edges(bond_list.iter().map(|x| {\n\n (\n\n (segment_index + x[0]) as u32,\n\n (segment_index + x[1]) as u32,\n\n (),\n\n )\n\n }));\n\n\n","file_path":"src/dft/parameter.rs","rank":30,"score":53986.05201892374},{"content":" pub molarweight: Array1<f64>,\n\n pub component_index: Array1<usize>,\n\n identifiers: Vec<String>,\n\n pub m: Array1<f64>,\n\n pub sigma: Array1<f64>,\n\n pub epsilon_k: Array1<f64>,\n\n pub bonds: UnGraph<(), ()>,\n\n pub assoc_segment: Array1<usize>,\n\n kappa_ab: Array1<f64>,\n\n epsilon_k_ab: Array1<f64>,\n\n pub na: Array1<f64>,\n\n pub nb: Array1<f64>,\n\n pub psi_dft: Array1<f64>,\n\n pub k_ij: Array2<f64>,\n\n pub sigma_ij: Array2<f64>,\n\n pub epsilon_k_ij: Array2<f64>,\n\n pub sigma3_kappa_aibj: Array2<f64>,\n\n pub epsilon_k_aibj: Array2<f64>,\n\n chemical_records: Vec<ChemicalRecord>,\n\n segment_records: Vec<SegmentRecord<GcPcSaftRecord, JobackRecord>>,\n","file_path":"src/dft/parameter.rs","rank":31,"score":53985.4602108594},{"content":" }\n\n\n\n psi_dft.push(segment.model_record.psi_dft.unwrap_or(PSI_GC_DFT));\n\n\n\n segment_index += 1;\n\n }\n\n }\n\n\n\n // Binary interaction parameter\n\n let mut k_ij = Array2::zeros([epsilon_k.len(); 2]);\n\n if let Some(binary_segment_records) = binary_segment_records.as_ref() {\n\n let mut binary_segment_records_map = IndexMap::new();\n\n for binary_record in binary_segment_records {\n\n binary_segment_records_map.insert(\n\n (binary_record.id1.clone(), binary_record.id2.clone()),\n\n binary_record.model_record,\n\n );\n\n binary_segment_records_map.insert(\n\n (binary_record.id2.clone(), binary_record.id1.clone()),\n\n binary_record.model_record,\n","file_path":"src/dft/parameter.rs","rank":32,"score":53985.277587457895},{"content":"\n\n // Read binary records\n\n let binary_records = file_binary\n\n .map(|file_binary| {\n\n let reader = BufReader::new(File::open(file_binary)?);\n\n let binary_records: Result<Vec<BinaryRecord<String, f64>>, ParameterError> =\n\n Ok(serde_json::from_reader(reader)?);\n\n binary_records\n\n })\n\n .transpose()?;\n\n\n\n Self::from_segments(chemical_records, segment_records, binary_records)\n\n }\n\n\n\n pub fn subset(&self, component_list: &[usize]) -> Self {\n\n let chemical_records: Vec<_> = component_list\n\n .iter()\n\n .map(|&i| self.chemical_records[i].clone())\n\n .collect();\n\n Self::from_segments(\n","file_path":"src/dft/parameter.rs","rank":33,"score":53985.008247188736},{"content":" };\n\n write!(\n\n o,\n\n \"\\n|{}|{}|{}|{}|{}|{}|||\",\n\n component,\n\n self.identifiers[i],\n\n self.m[i],\n\n self.sigma[i],\n\n self.epsilon_k[i],\n\n association\n\n )\n\n .unwrap();\n\n }\n\n\n\n output\n\n }\n\n\n\n pub fn graph(&self) -> String {\n\n let graph = self\n\n .bonds\n","file_path":"src/dft/parameter.rs","rank":34,"score":53984.4903039491},{"content":" )\n\n .unwrap();\n\n for i in 0..self.m.len() {\n\n let component = if i > 0 && self.component_index[i] == self.component_index[i - 1] {\n\n \"|\".to_string()\n\n } else {\n\n let pure = self.chemical_records[self.component_index[i]].identifier();\n\n format!(\n\n \"{}|{}\",\n\n pure.name.as_ref().unwrap_or(&pure.cas),\n\n self.molarweight[self.component_index[i]]\n\n )\n\n };\n\n let association = if let Some(a) = self.assoc_segment.iter().position(|&a| a == i) {\n\n format!(\n\n \"{}|{}|{}|{}\",\n\n self.kappa_ab[a], self.epsilon_k_ab[a], self.na[a], self.nb[a]\n\n )\n\n } else {\n\n \"|||\".to_string()\n","file_path":"src/dft/parameter.rs","rank":35,"score":53983.01526303481},{"content":" for id in segment_list {\n\n let segment = segment_map\n\n .get(id)\n\n .ok_or_else(|| ParameterError::ComponentsNotFound(id.to_string()))?;\n\n molarweight[i] += segment.molarweight;\n\n component_index.push(i);\n\n identifiers.push(id.clone());\n\n m.push(segment.model_record.m);\n\n sigma.push(segment.model_record.sigma);\n\n epsilon_k.push(segment.model_record.epsilon_k);\n\n\n\n if let (Some(k), Some(e)) = (\n\n segment.model_record.kappa_ab,\n\n segment.model_record.epsilon_k_ab,\n\n ) {\n\n assoc_segment.push(segment_index);\n\n kappa_ab.push(k);\n\n epsilon_k_ab.push(e);\n\n na.push(segment.model_record.na.unwrap_or(1.0));\n\n nb.push(segment.model_record.nb.unwrap_or(1.0));\n","file_path":"src/dft/parameter.rs","rank":36,"score":53981.47804219263},{"content":" );\n\n }\n\n for (i, id1) in identifiers.iter().enumerate() {\n\n for (j, id2) in identifiers.iter().cloned().enumerate() {\n\n if component_index[i] != component_index[j] {\n\n if let Some(k) = binary_segment_records_map.get(&(id1.clone(), id2)) {\n\n k_ij[(i, j)] = *k;\n\n }\n\n }\n\n }\n\n }\n\n }\n\n\n\n // Combining rules dispersion\n\n let sigma_ij =\n\n Array2::from_shape_fn([sigma.len(); 2], |(i, j)| 0.5 * (sigma[i] + sigma[j]));\n\n let epsilon_k_ij = Array2::from_shape_fn([epsilon_k.len(); 2], |(i, j)| {\n\n (epsilon_k[i] * epsilon_k[j]).sqrt() * (1.0 - k_ij[(i, j)])\n\n });\n\n\n","file_path":"src/dft/parameter.rs","rank":37,"score":53981.39694829139},{"content":"\n\n // Compare queried components and available components\n\n let available: IndexSet<String> = record_map\n\n .keys()\n\n .map(|identifier| identifier.to_string())\n\n .collect();\n\n if !queried.is_subset(&available) {\n\n let missing: Vec<String> = queried.difference(&available).cloned().collect();\n\n return Err(ParameterError::ComponentsNotFound(format!(\"{:?}\", missing)));\n\n };\n\n\n\n // Collect all pure records that were queried\n\n let chemical_records: Vec<_> = queried\n\n .iter()\n\n .filter_map(|identifier| record_map.remove(&identifier.clone()))\n\n .collect();\n\n\n\n // Read segment records\n\n let segment_records: Vec<SegmentRecord<GcPcSaftRecord, JobackRecord>> =\n\n serde_json::from_reader(BufReader::new(File::open(file_segments)?))?;\n","file_path":"src/dft/parameter.rs","rank":38,"score":53979.7830609994},{"content":"#[pymodule]\n\npub fn feos_gc_pcsaft(py: Python<'_>, m: &PyModule) -> PyResult<()> {\n\n m.add_class::<PyIdentifier>()?;\n\n m.add_class::<Verbosity>()?;\n\n m.add_class::<Contributions>()?;\n\n m.add_class::<PyChemicalRecord>()?;\n\n m.add_class::<PyJobackRecord>()?;\n\n\n\n m.add_class::<PyGcPcSaftRecord>()?;\n\n m.add_class::<PySegmentRecord>()?;\n\n m.add_class::<PyBinaryRecord>()?;\n\n m.add_class::<PyBinarySegmentRecord>()?;\n\n m.add_class::<PyGcPcSaftEosParameters>()?;\n\n m.add_class::<PyGcPcSaftFunctionalParameters>()?;\n\n\n\n m.add_wrapped(wrap_pymodule!(eos))?;\n\n m.add_wrapped(wrap_pymodule!(dft))?;\n\n m.add_wrapped(wrap_pymodule!(quantity))?;\n\n\n\n py.run(\n\n \"\\\n","file_path":"build_wheel/src/lib.rs","rank":39,"score":52823.78508617848},{"content":"use super::GcPcSaftFunctionalParameters;\n\nuse feos_core::EosError;\n\nuse feos_dft::fundamental_measure_theory::FMTProperties;\n\nuse feos_dft::{\n\n FunctionalContributionDual, WeightFunction, WeightFunctionInfo, WeightFunctionShape,\n\n};\n\nuse ndarray::*;\n\nuse num_dual::DualNum;\n\nuse petgraph::visit::EdgeRef;\n\nuse std::fmt;\n\nuse std::rc::Rc;\n\n\n\n#[derive(Clone)]\n\npub struct ChainFunctional {\n\n parameters: Rc<GcPcSaftFunctionalParameters>,\n\n}\n\n\n\nimpl ChainFunctional {\n\n pub fn new(parameters: &Rc<GcPcSaftFunctionalParameters>) -> Self {\n\n Self {\n","file_path":"src/dft/hard_chain.rs","rank":40,"score":52036.12840368779},{"content":" parameters: parameters.clone(),\n\n }\n\n }\n\n}\n\n\n\nimpl<N: DualNum<f64> + ScalarOperand> FunctionalContributionDual<N> for ChainFunctional {\n\n fn weight_functions(&self, temperature: N) -> WeightFunctionInfo<N> {\n\n let p = &self.parameters;\n\n let d = p.hs_diameter(temperature);\n\n WeightFunctionInfo::new(p.component_index(), true)\n\n .add(\n\n WeightFunction {\n\n prefactor: p.chain_length().mapv(|m| m.into()) / (&d * 8.0),\n\n kernel_radius: d.clone(),\n\n shape: WeightFunctionShape::Theta,\n\n },\n\n true,\n\n )\n\n .add(\n\n WeightFunction {\n","file_path":"src/dft/hard_chain.rs","rank":41,"score":52027.601744047264},{"content":" .reduce(|acc, y| acc * y);\n\n if let Some(y) = y {\n\n phi -= &(y.map(N::ln) * rho_i * 0.5);\n\n }\n\n }\n\n\n\n Ok(phi)\n\n }\n\n}\n\n\n\nimpl fmt::Display for ChainFunctional {\n\n fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {\n\n write!(f, \"Hard chain functional (GC)\")\n\n }\n\n}\n","file_path":"src/dft/hard_chain.rs","rank":42,"score":52024.27785337071},{"content":" prefactor: p.chain_length().mapv(|m| (m / 8.0).into()),\n\n kernel_radius: d,\n\n shape: WeightFunctionShape::Theta,\n\n },\n\n true,\n\n )\n\n }\n\n\n\n fn calculate_helmholtz_energy_density(\n\n &self,\n\n temperature: N,\n\n weighted_densities: ArrayView2<N>,\n\n ) -> Result<Array1<N>, EosError> {\n\n let p = &self.parameters;\n\n // number of segments\n\n let segments = weighted_densities.shape()[0] - 2;\n\n\n\n // weighted densities\n\n let rho = weighted_densities.slice_axis(Axis(0), Slice::new(0, Some(segments as isize), 1));\n\n let zeta2 = weighted_densities.index_axis(Axis(0), segments);\n","file_path":"src/dft/hard_chain.rs","rank":43,"score":52019.36363803969},{"content":" let zeta3 = weighted_densities.index_axis(Axis(0), segments + 1);\n\n\n\n // temperature dependent segment diameter\n\n let d = p.hs_diameter(temperature);\n\n\n\n // Helmholtz energy\n\n let frac_1mz3 = zeta3.mapv(|z3| (-z3 + 1.0).recip());\n\n let c = &zeta2 * &frac_1mz3 * &frac_1mz3;\n\n\n\n let mut phi = Array::zeros(zeta2.raw_dim());\n\n for i in p.bonds.node_indices() {\n\n let rho_i = rho.index_axis(Axis(0), i.index());\n\n let edges = p.bonds.edges(i);\n\n let y = edges\n\n .map(|e| {\n\n let di = d[e.source().index()];\n\n let dj = d[e.target().index()];\n\n let cdij = &c * di * dj / (di + dj);\n\n &frac_1mz3 + &cdij * 3.0 - &cdij * &cdij * (&zeta3 - 1.0) * 2.0\n\n })\n","file_path":"src/dft/hard_chain.rs","rank":44,"score":52019.09680155728},{"content":"fn newton_step_cross_association<S, D: DualNum<f64> + ScalarOperand>(\n\n x: &mut Array1<D>,\n\n nassoc: usize,\n\n delta: &Array2<D>,\n\n na: &Array1<f64>,\n\n nb: &Array1<f64>,\n\n rho: &ArrayBase<S, Ix1>,\n\n tol: f64,\n\n) -> Result<bool, EosError>\n\nwhere\n\n S: Data<Elem = D>,\n\n{\n\n // gradient\n\n let mut g: Array1<D> = Array::zeros(2 * nassoc);\n\n // Hessian\n\n let mut h: Array2<D> = Array::zeros((2 * nassoc, 2 * nassoc));\n\n\n\n // slice arrays\n\n let (xa, xb) = x.multi_slice_mut((s![..nassoc], s![nassoc..]));\n\n let (mut ga, mut gb) = g.multi_slice_mut((s![..nassoc], s![nassoc..]));\n","file_path":"src/eos/association.rs","rank":45,"score":51341.76914057696},{"content":"#[test]\n\n#[allow(non_snake_case)]\n\nfn test_bulk_implementation() -> Result<(), Box<dyn Error>> {\n\n // correct for different k_B in old code\n\n let KB_old = 1.38064852e-23 * JOULE / KELVIN;\n\n let NAV_old = 6.022140857e23 / MOL;\n\n\n\n let parameters = GcPcSaftEosParameters::from_json_segments(\n\n &[\"propane\"],\n\n \"parameters/gc_substances.json\",\n\n \"parameters/sauer2014_hetero.json\",\n\n None,\n\n IdentifierOption::Name,\n\n )\n\n .unwrap();\n\n\n\n let parameters_func = GcPcSaftFunctionalParameters::from_json_segments(\n\n &[\"propane\"],\n\n \"parameters/gc_substances.json\",\n\n \"parameters/sauer2014_hetero.json\",\n\n None,\n\n IdentifierOption::Name,\n","file_path":"tests/dft.rs","rank":46,"score":50042.005575220304},{"content":"#[test]\n\nfn test_binary() -> EosResult<()> {\n\n let parameters = GcPcSaftEosParameters::from_json_segments(\n\n &[\"ethanol\", \"methanol\"],\n\n \"parameters/gc_substances.json\",\n\n \"parameters/sauer2014_hetero.json\",\n\n None,\n\n IdentifierOption::Name,\n\n )\n\n .unwrap();\n\n let parameters_func = GcPcSaftFunctionalParameters::from_json_segments(\n\n &[\"ethanol\", \"methanol\"],\n\n \"parameters/gc_substances.json\",\n\n \"parameters/sauer2014_hetero.json\",\n\n None,\n\n IdentifierOption::Name,\n\n )\n\n .unwrap();\n\n let eos = Rc::new(GcPcSaft::new(Rc::new(parameters)));\n\n let func = Rc::new(GcPcSaftFunctional::new(Rc::new(parameters_func)));\n\n let moles = arr1(&[0.5, 0.5]) * MOL;\n","file_path":"tests/binary.rs","rank":47,"score":35847.425916787724},{"content":"fn zeta_23<D: DualNum<f64>>(\n\n parameters: &GcPcSaftEosParameters,\n\n diameter: &Array1<D>,\n\n molefracs: &Array1<D>,\n\n) -> D {\n\n let mut zeta: [D; 2] = [D::zero(); 2];\n\n for i in 0..parameters.m.len() {\n\n for (k, z) in zeta.iter_mut().enumerate() {\n\n *z += molefracs[parameters.component_index[i]]\n\n * diameter[i].powi((k + 2) as i32)\n\n * (FRAC_PI_6 * parameters.m[i]);\n\n }\n\n }\n\n\n\n zeta[0] / zeta[1]\n\n}\n\n\n\n#[cfg(test)]\n\nmod test {\n\n use super::*;\n","file_path":"src/eos/hard_sphere.rs","rank":48,"score":30963.842916804453},{"content":"#![allow(clippy::excessive_precision)]\n\nuse approx::assert_relative_eq;\n\nuse feos_core::parameter::IdentifierOption;\n\nuse feos_core::{PhaseEquilibrium, State, StateBuilder, Verbosity};\n\nuse feos_dft::adsorption::{ExternalPotential, Pore1D, PoreSpecification};\n\nuse feos_dft::interface::PlanarInterface;\n\nuse feos_dft::{DFTSolver, Geometry};\n\nuse feos_gc_pcsaft::{\n\n GcPcSaft, GcPcSaftEosParameters, GcPcSaftFunctional, GcPcSaftFunctionalParameters,\n\n};\n\nuse ndarray::arr1;\n\nuse quantity::si::*;\n\nuse std::error::Error;\n\nuse std::rc::Rc;\n\n\n\n#[test]\n\n#[allow(non_snake_case)]\n","file_path":"tests/dft.rs","rank":49,"score":28338.399176851246},{"content":" )\n\n .unwrap();\n\n\n\n let eos = Rc::new(GcPcSaft::new(Rc::new(parameters)));\n\n let func = Rc::new(GcPcSaftFunctional::new(Rc::new(parameters_func)));\n\n let t = 200.0 * KELVIN;\n\n let v = 0.002 * METER.powi(3) * NAV / NAV_old;\n\n let n = arr1(&[1.5]) * MOL;\n\n let state_eos = State::new_nvt(&eos, t, v, &n)?;\n\n let state_func = State::new_nvt(&func, t, v, &n)?;\n\n let p_eos = state_eos.pressure_contributions();\n\n let p_func = state_func.pressure_contributions();\n\n\n\n println!(\"{:29}: {}\", p_eos[0].0, p_eos[0].1);\n\n println!(\"{:29}: {}\", p_func[0].0, p_func[0].1);\n\n println!();\n\n println!(\"{:29}: {}\", p_eos[1].0, p_eos[1].1);\n\n println!(\"{:29}: {}\", p_func[1].0, p_func[1].1);\n\n println!();\n\n println!(\"{:29}: {}\", p_eos[2].0, p_eos[2].1);\n","file_path":"tests/dft.rs","rank":50,"score":28333.66882890873},{"content":" let profile = PlanarInterface::from_tanh(&vle, points, w, tc)?.solve(None)?;\n\n println!(\n\n \"hetero {} {} {}\",\n\n profile.surface_tension.unwrap(),\n\n vle.vapor().density,\n\n vle.liquid().density,\n\n );\n\n\n\n assert_relative_eq!(\n\n vle.vapor().density,\n\n 12.8820179191167643 * MOL / METER.powi(3) * NAV_old / NAV,\n\n max_relative = 1e-13,\n\n );\n\n\n\n assert_relative_eq!(\n\n vle.liquid().density,\n\n 13.2705903446123212 * KILO * MOL / METER.powi(3) * NAV_old / NAV,\n\n max_relative = 1e-13,\n\n );\n\n\n\n assert_relative_eq!(\n\n profile.surface_tension.unwrap(),\n\n 21.1478901897016272 * MILLI * NEWTON / METER * KB / KB_old,\n\n max_relative = 6e-5,\n\n );\n\n Ok(())\n\n}\n\n\n","file_path":"tests/dft.rs","rank":51,"score":28329.432866228326},{"content":" vle.liquid().density,\n\n );\n\n\n\n let solver = DFTSolver::new(Verbosity::Iter)\n\n .picard_iteration(None)\n\n .beta(0.05)\n\n .tol(1e-5)\n\n .anderson_mixing(None);\n\n let bulk = StateBuilder::new(&func)\n\n .temperature(t)\n\n .pressure(5.0 * BAR)\n\n .build()?;\n\n Pore1D::new(\n\n Geometry::Cartesian,\n\n 20.0 * ANGSTROM,\n\n ExternalPotential::LJ93 {\n\n epsilon_k_ss: 10.0,\n\n sigma_ss: 3.0,\n\n rho_s: 0.08,\n\n },\n\n None,\n\n None,\n\n )\n\n .initialize(&bulk, None, None)?\n\n .solve(Some(&solver))?;\n\n Ok(())\n\n}\n","file_path":"tests/dft.rs","rank":52,"score":28328.814111580137},{"content":" assert_relative_eq!(\n\n p_eos[3].1,\n\n -763.2289230004602132 * KILO * PASCAL * KB / KB_old,\n\n max_relative = 1e-14,\n\n );\n\n\n\n assert_relative_eq!(\n\n p_func[0].1,\n\n 1.2471689792172869 * MEGA * PASCAL * KB / KB_old,\n\n max_relative = 1e-14,\n\n );\n\n assert_relative_eq!(\n\n p_func[1].1,\n\n 280.0635060891395938 * KILO * PASCAL * KB / KB_old,\n\n max_relative = 1e-14,\n\n );\n\n assert_relative_eq!(\n\n p_func[2].1,\n\n -141.9023918353318550 * KILO * PASCAL * KB / KB_old,\n\n max_relative = 1e-14,\n\n );\n\n assert_relative_eq!(\n\n p_func[3].1,\n\n -763.2289230004602132 * KILO * PASCAL * KB / KB_old,\n\n max_relative = 1e-14,\n\n );\n\n Ok(())\n\n}\n\n\n","file_path":"tests/dft.rs","rank":53,"score":28326.675850657615},{"content":" println!(\"{:29}: {}\", p_func[2].0, p_func[2].1);\n\n println!();\n\n println!(\"{:29}: {}\", p_eos[3].0, p_eos[3].1);\n\n println!(\"{:29}: {}\", p_func[3].0, p_func[3].1);\n\n\n\n assert_relative_eq!(\n\n p_eos[0].1,\n\n 1.2471689792172869 * MEGA * PASCAL * KB / KB_old,\n\n max_relative = 1e-14,\n\n );\n\n assert_relative_eq!(\n\n p_eos[1].1,\n\n 280.0635060891395938 * KILO * PASCAL * KB / KB_old,\n\n max_relative = 1e-14,\n\n );\n\n assert_relative_eq!(\n\n p_eos[2].1,\n\n -141.9023918353318550 * KILO * PASCAL * KB / KB_old,\n\n max_relative = 1e-14,\n\n );\n","file_path":"tests/dft.rs","rank":54,"score":28326.675850657615},{"content":"use feos_core::joback::Joback;\n\nuse feos_core::{EquationOfState, HelmholtzEnergy, IdealGasContribution, MolarWeight};\n\nuse ndarray::Array1;\n\nuse quantity::si::*;\n\nuse std::f64::consts::FRAC_PI_6;\n\nuse std::rc::Rc;\n\n\n\npub(crate) mod association;\n\npub(crate) mod dispersion;\n\nmod hard_chain;\n\nmod hard_sphere;\n\nmod parameter;\n\nmod polar;\n\nuse association::{Association, CrossAssociation};\n\nuse dispersion::Dispersion;\n\nuse hard_chain::HardChain;\n\nuse hard_sphere::HardSphere;\n\npub use parameter::GcPcSaftEosParameters;\n\nuse polar::Dipole;\n\n\n","file_path":"src/eos/mod.rs","rank":55,"score":28104.50636544062},{"content":"\n\n/// gc-PC-SAFT equation of state\n\npub struct GcPcSaft {\n\n pub parameters: Rc<GcPcSaftEosParameters>,\n\n options: GcPcSaftOptions,\n\n contributions: Vec<Box<dyn HelmholtzEnergy>>,\n\n joback: Joback,\n\n}\n\n\n\nimpl GcPcSaft {\n\n pub fn new(parameters: Rc<GcPcSaftEosParameters>) -> Self {\n\n Self::with_options(parameters, GcPcSaftOptions::default())\n\n }\n\n\n\n pub fn with_options(parameters: Rc<GcPcSaftEosParameters>, options: GcPcSaftOptions) -> Self {\n\n let mut contributions: Vec<Box<dyn HelmholtzEnergy>> = Vec::with_capacity(7);\n\n contributions.push(Box::new(HardSphere {\n\n parameters: parameters.clone(),\n\n }));\n\n contributions.push(Box::new(HardChain {\n","file_path":"src/eos/mod.rs","rank":56,"score":28103.698213446954},{"content":" parameters: parameters.clone(),\n\n }));\n\n contributions.push(Box::new(Dispersion {\n\n parameters: parameters.clone(),\n\n }));\n\n match parameters.assoc_segment.len() {\n\n 0 => (),\n\n 1 => contributions.push(Box::new(Association {\n\n parameters: parameters.clone(),\n\n })),\n\n _ => contributions.push(Box::new(CrossAssociation {\n\n parameters: parameters.clone(),\n\n max_iter: options.max_iter_cross_assoc,\n\n tol: options.tol_cross_assoc,\n\n })),\n\n };\n\n if !parameters.dipole_comp.is_empty() {\n\n contributions.push(Box::new(Dipole::new(¶meters)))\n\n }\n\n Self {\n","file_path":"src/eos/mod.rs","rank":57,"score":28101.138316418128},{"content":"/// Customization options for the gc-PC-SAFT equation of state and functional.\n\n#[derive(Copy, Clone)]\n\npub struct GcPcSaftOptions {\n\n /// maximum packing fraction\n\n pub max_eta: f64,\n\n /// maximum number of iterations for cross association calculation\n\n pub max_iter_cross_assoc: usize,\n\n /// tolerance for cross association calculation\n\n pub tol_cross_assoc: f64,\n\n}\n\n\n\nimpl Default for GcPcSaftOptions {\n\n fn default() -> Self {\n\n Self {\n\n max_eta: 0.5,\n\n max_iter_cross_assoc: 50,\n\n tol_cross_assoc: 1e-10,\n\n }\n\n }\n\n}\n","file_path":"src/eos/mod.rs","rank":58,"score":28100.08573216219},{"content":" parameters: parameters.clone(),\n\n options,\n\n contributions,\n\n joback: parameters.joback_records.clone().map_or_else(\n\n || Joback::default(parameters.chemical_records.len()),\n\n Joback::new,\n\n ),\n\n }\n\n }\n\n}\n\n\n\nimpl EquationOfState for GcPcSaft {\n\n fn components(&self) -> usize {\n\n self.parameters.molarweight.len()\n\n }\n\n\n\n fn subset(&self, component_list: &[usize]) -> Self {\n\n Self::with_options(\n\n Rc::new(self.parameters.subset(component_list)),\n\n self.options,\n","file_path":"src/eos/mod.rs","rank":59,"score":28097.207383151548},{"content":"use crate::dft::GcPcSaftFunctionalParameters;\n\nuse crate::eos::GcPcSaftEosParameters;\n\nuse crate::record::GcPcSaftRecord;\n\nuse feos_core::joback::JobackRecord;\n\nuse feos_core::parameter::{BinaryRecord, IdentifierOption, ParameterError, SegmentRecord};\n\nuse feos_core::python::joback::PyJobackRecord;\n\nuse feos_core::python::parameter::{PyBinarySegmentRecord, PyChemicalRecord};\n\nuse feos_core::{impl_json_handling, impl_parameter_from_segments, impl_segment_record};\n\nuse numpy::{PyArray2, ToPyArray};\n\nuse pyo3::prelude::*;\n\nuse std::convert::TryFrom;\n\nuse std::rc::Rc;\n\n\n\n#[cfg(feature = \"micelles\")]\n\nmod micelles;\n\n\n\n#[pyclass(name = \"GcPcSaftRecord\", unsendable)]\n\n#[pyo3(\n\n text_signature = \"(m, sigma, epsilon_k, mu=None, q=None, kappa_ab=None, epsilon_k_ab=None, na=None, nb=None)\"\n\n)]\n","file_path":"src/python/mod.rs","rank":60,"score":28096.060249098544},{"content":" )\n\n }\n\n\n\n fn compute_max_density(&self, moles: &Array1<f64>) -> f64 {\n\n let p = &self.parameters;\n\n let moles_segments: Array1<f64> = p.component_index.iter().map(|&i| moles[i]).collect();\n\n self.options.max_eta * moles.sum()\n\n / (FRAC_PI_6 * &p.m * p.sigma.mapv(|v| v.powi(3)) * moles_segments).sum()\n\n }\n\n\n\n fn residual(&self) -> &[Box<dyn HelmholtzEnergy>] {\n\n &self.contributions\n\n }\n\n\n\n fn ideal_gas(&self) -> &dyn IdealGasContribution {\n\n &self.joback\n\n }\n\n}\n\n\n\nimpl MolarWeight<SIUnit> for GcPcSaft {\n\n fn molar_weight(&self) -> SIArray1 {\n\n self.parameters.molarweight.clone() * GRAM / MOL\n\n }\n\n}\n","file_path":"src/eos/mod.rs","rank":61,"score":28095.59055925874},{"content":"#[derive(Clone)]\n\npub struct PyGcPcSaftRecord(GcPcSaftRecord);\n\n\n\n#[pymethods]\n\nimpl PyGcPcSaftRecord {\n\n #[new]\n\n fn new(\n\n m: f64,\n\n sigma: f64,\n\n epsilon_k: f64,\n\n mu: Option<f64>,\n\n kappa_ab: Option<f64>,\n\n epsilon_k_ab: Option<f64>,\n\n na: Option<f64>,\n\n nb: Option<f64>,\n\n psi_dft: Option<f64>,\n\n ) -> Self {\n\n Self(GcPcSaftRecord::new(\n\n m,\n\n sigma,\n","file_path":"src/python/mod.rs","rank":62,"score":28095.27343861241},{"content":" Ok(self.0.to_string())\n\n }\n\n}\n\n\n\n#[pyclass(name = \"GcPcSaftFunctionalParameters\", unsendable)]\n\n#[pyo3(\n\n text_signature = \"(pure_records, segmentbinary_records=None, substances=None, search_option='Name')\"\n\n)]\n\n#[derive(Clone)]\n\npub struct PyGcPcSaftFunctionalParameters(pub Rc<GcPcSaftFunctionalParameters>);\n\n\n\nimpl_parameter_from_segments!(GcPcSaftFunctionalParameters, PyGcPcSaftFunctionalParameters);\n\n\n\n#[pymethods]\n\nimpl PyGcPcSaftFunctionalParameters {\n\n fn _repr_markdown_(&self) -> String {\n\n self.0.to_markdown()\n\n }\n\n\n\n #[getter]\n","file_path":"src/python/mod.rs","rank":63,"score":28093.261698747672},{"content":" JobackRecord,\n\n PyJobackRecord\n\n);\n\n\n\n#[pyclass(name = \"GcPcSaftEosParameters\", unsendable)]\n\n#[pyo3(\n\n text_signature = \"(pure_records, segmentbinary_records=None, substances=None, search_option='Name')\"\n\n)]\n\n#[derive(Clone)]\n\npub struct PyGcPcSaftEosParameters(pub Rc<GcPcSaftEosParameters>);\n\n\n\nimpl_parameter_from_segments!(GcPcSaftEosParameters, PyGcPcSaftEosParameters);\n\n\n\n#[pymethods]\n\nimpl PyGcPcSaftEosParameters {\n\n fn _repr_markdown_(&self) -> String {\n\n self.0.to_markdown()\n\n }\n\n\n\n fn __repr__(&self) -> PyResult<String> {\n","file_path":"src/python/mod.rs","rank":64,"score":28092.950430101893},{"content":" epsilon_k,\n\n mu,\n\n kappa_ab,\n\n epsilon_k_ab,\n\n na,\n\n nb,\n\n psi_dft,\n\n ))\n\n }\n\n\n\n fn __repr__(&self) -> PyResult<String> {\n\n Ok(self.0.to_string())\n\n }\n\n}\n\n\n\nimpl_json_handling!(PyGcPcSaftRecord);\n\n\n\nimpl_segment_record!(\n\n GcPcSaftRecord,\n\n PyGcPcSaftRecord,\n","file_path":"src/python/mod.rs","rank":65,"score":28088.10590629121},{"content":" fn get_graph(&self, py: Python) -> PyResult<PyObject> {\n\n let fun: Py<PyAny> = PyModule::from_code(\n\n py,\n\n \"def f(s): \n\n import graphviz\n\n return graphviz.Source(s.replace('\\\\\\\\\\\"', ''))\",\n\n \"\",\n\n \"\",\n\n )?\n\n .getattr(\"f\")?\n\n .into();\n\n fun.call1(py, (self.0.graph(),))\n\n }\n\n\n\n #[getter]\n\n fn get_k_ij<'py>(&self, py: Python<'py>) -> &'py PyArray2<f64> {\n\n self.0.k_ij.view().to_pyarray(py)\n\n }\n\n\n\n fn __repr__(&self) -> PyResult<String> {\n\n Ok(self.0.to_string())\n\n }\n\n}\n","file_path":"src/python/mod.rs","rank":66,"score":28082.512211614587},{"content":"use super::hard_sphere::zeta;\n\nuse super::GcPcSaftEosParameters;\n\nuse feos_core::{EosError, HelmholtzEnergyDual, StateHD};\n\nuse ndarray::*;\n\nuse num_dual::linalg::{norm, LU};\n\nuse num_dual::*;\n\nuse std::fmt;\n\nuse std::rc::Rc;\n\n\n\n#[derive(Clone)]\n\npub struct Association {\n\n pub parameters: Rc<GcPcSaftEosParameters>,\n\n}\n\n\n\n#[derive(Clone)]\n\npub struct CrossAssociation {\n\n pub parameters: Rc<GcPcSaftEosParameters>,\n\n pub max_iter: usize,\n\n pub tol: f64,\n\n}\n\n\n","file_path":"src/eos/association.rs","rank":67,"score":27769.26177979532},{"content":"impl<D: DualNum<f64>> HelmholtzEnergyDual<D> for Association {\n\n fn helmholtz_energy(&self, state: &StateHD<D>) -> D {\n\n let p = &self.parameters;\n\n let c = p.component_index[p.assoc_segment[0]];\n\n\n\n // temperature dependent segment diameter\n\n let diameter = p.hs_diameter(state.temperature);\n\n\n\n // Packing fractions\n\n let n2 = zeta(p, &diameter, &state.partial_density, [2])[0] * 6.0;\n\n let n3 = zeta(p, &diameter, &state.partial_density, [3])[0];\n\n let n3i = (-n3 + 1.0).recip();\n\n\n\n // association strength\n\n let deltarho = association_strength(\n\n &p.assoc_segment,\n\n &p.sigma3_kappa_aibj,\n\n &p.epsilon_k_aibj,\n\n state.temperature,\n\n &diameter,\n","file_path":"src/eos/association.rs","rank":68,"score":27766.980352861596},{"content":" }\n\n\n\n // Newton step\n\n x.assign(&(&*x - &LU::new(h)?.solve(&g)));\n\n\n\n // check convergence\n\n Ok(norm(&g.map(D::re)) < tol)\n\n}\n\n\n\n#[cfg(test)]\n\nmod test {\n\n use super::*;\n\n use crate::eos::parameter::test::*;\n\n use approx::assert_relative_eq;\n\n use feos_core::EosUnit;\n\n use ndarray::arr1;\n\n use num_dual::Dual64;\n\n use quantity::si::{METER, MOL, PASCAL};\n\n\n\n #[test]\n","file_path":"src/eos/association.rs","rank":69,"score":27766.04092220018},{"content":" state.moles[c] * p.n[0] * (xa.ln() - xa * 0.5 + 0.5) * na\n\n }\n\n }\n\n}\n\n\n\nimpl fmt::Display for Association {\n\n fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {\n\n write!(f, \"Association\")\n\n }\n\n}\n\n\n\npub(crate) fn assoc_site_frac_ab<D: DualNum<f64>>(deltarho: D, na: f64, nb: f64) -> D {\n\n if deltarho.re() > f64::EPSILON.sqrt() {\n\n (((deltarho * (na - nb) + 1.0).powi(2) + deltarho * nb * 4.0).sqrt()\n\n - (deltarho * (nb - na) + 1.0))\n\n / (deltarho * na * 2.0)\n\n } else {\n\n D::one() + deltarho * nb * (deltarho * (nb + na) - 1.0)\n\n }\n\n}\n","file_path":"src/eos/association.rs","rank":70,"score":27765.981538662836},{"content":"\n\npub(crate) fn assoc_site_frac_a<D: DualNum<f64>>(deltarho: D, na: f64) -> D {\n\n if deltarho.re() > f64::EPSILON.sqrt() {\n\n ((deltarho * na * 4.0 + 1.0).powi(2) - 1.0).sqrt() / (deltarho * na * 2.0)\n\n } else {\n\n D::one() + deltarho * na * (deltarho * na * 2.0 - 1.0)\n\n }\n\n}\n\n\n\nimpl<D: DualNum<f64> + ScalarOperand> HelmholtzEnergyDual<D> for CrossAssociation {\n\n fn helmholtz_energy(&self, state: &StateHD<D>) -> D {\n\n let p = &self.parameters;\n\n\n\n // temperature dependent segment diameter\n\n let diameter = p.hs_diameter(state.temperature);\n\n\n\n // Packing fractions\n\n let n2 = zeta(p, &diameter, &state.partial_density, [2])[0] * 6.0;\n\n let n3 = zeta(p, &diameter, &state.partial_density, [3])[0];\n\n let n3i = (-n3 + 1.0).recip();\n","file_path":"src/eos/association.rs","rank":71,"score":27765.421098022092},{"content":"\n\n #[test]\n\n fn test_cross_assoc_propanol() {\n\n let parameters = propanol();\n\n let contrib = CrossAssociation {\n\n parameters: Rc::new(parameters),\n\n max_iter: 50,\n\n tol: 1e-10,\n\n };\n\n let temperature = 300.0;\n\n let volume = METER\n\n .powi(3)\n\n .to_reduced(EosUnit::reference_volume())\n\n .unwrap();\n\n let moles = (1.5 * MOL).to_reduced(EosUnit::reference_moles()).unwrap();\n\n let state = StateHD::new(\n\n Dual64::from_re(temperature),\n\n Dual64::from_re(volume).derive(),\n\n arr1(&[Dual64::from_re(moles)]),\n\n );\n","file_path":"src/eos/association.rs","rank":72,"score":27765.022587574662},{"content":" // check if density is close to 0\n\n if density.sum().re() < f64::EPSILON {\n\n if let Some(x0) = x0 {\n\n x0.fill(1.0);\n\n }\n\n return Ok(D::zero());\n\n }\n\n\n\n // number of associating segments\n\n let nassoc = assoc_segment.len();\n\n\n\n // association strength\n\n let delta = Array::from_shape_fn([nassoc; 2], |(i, j)| {\n\n association_strength(\n\n assoc_segment,\n\n sigma3_kappa_aibj,\n\n epsilon_k_aibj,\n\n temperature,\n\n diameter,\n\n n2,\n","file_path":"src/eos/association.rs","rank":73,"score":27764.6160833371},{"content":" let pressure =\n\n -contrib.helmholtz_energy(&state).eps[0] * temperature * EosUnit::reference_pressure();\n\n assert_relative_eq!(pressure, -3.6819598891967344 * PASCAL, max_relative = 1e-10);\n\n }\n\n\n\n #[test]\n\n fn test_cross_assoc_ethanol_propanol() {\n\n let parameters = ethanol_propanol(false);\n\n let contrib = CrossAssociation {\n\n parameters: Rc::new(parameters),\n\n max_iter: 50,\n\n tol: 1e-10,\n\n };\n\n let temperature = 300.0;\n\n let volume = METER\n\n .powi(3)\n\n .to_reduced(EosUnit::reference_volume())\n\n .unwrap();\n\n let moles = (arr1(&[1.5, 2.5]) * MOL)\n\n .to_reduced(EosUnit::reference_moles())\n","file_path":"src/eos/association.rs","rank":74,"score":27764.60491697488},{"content":" self.tol,\n\n None,\n\n )\n\n .unwrap_or_else(|_| D::from(std::f64::NAN))\n\n * state.volume\n\n }\n\n}\n\n\n\nimpl fmt::Display for CrossAssociation {\n\n fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {\n\n write!(f, \"Cross-association\")\n\n }\n\n}\n\n\n","file_path":"src/eos/association.rs","rank":75,"score":27764.45907335196},{"content":" fn test_assoc_propanol() {\n\n let parameters = propanol();\n\n let contrib = Association {\n\n parameters: Rc::new(parameters),\n\n };\n\n let temperature = 300.0;\n\n let volume = METER\n\n .powi(3)\n\n .to_reduced(EosUnit::reference_volume())\n\n .unwrap();\n\n let moles = (1.5 * MOL).to_reduced(EosUnit::reference_moles()).unwrap();\n\n let state = StateHD::new(\n\n Dual64::from_re(temperature),\n\n Dual64::from_re(volume).derive(),\n\n arr1(&[Dual64::from_re(moles)]),\n\n );\n\n let pressure =\n\n -contrib.helmholtz_energy(&state).eps[0] * temperature * EosUnit::reference_pressure();\n\n assert_relative_eq!(pressure, -3.6819598891967344 * PASCAL, max_relative = 1e-10);\n\n }\n","file_path":"src/eos/association.rs","rank":76,"score":27764.224295553755},{"content":"\n\n // extract densities of associating segments\n\n let rho_assoc = p\n\n .assoc_segment\n\n .mapv(|a| state.partial_density[p.component_index[a]])\n\n * &p.n;\n\n\n\n helmholtz_energy_density_cross_association(\n\n &p.assoc_segment,\n\n &p.sigma3_kappa_aibj,\n\n &p.epsilon_k_aibj,\n\n &p.na,\n\n &p.nb,\n\n state.temperature,\n\n &rho_assoc,\n\n &diameter,\n\n n2,\n\n n3i,\n\n D::one(),\n\n self.max_iter,\n","file_path":"src/eos/association.rs","rank":77,"score":27762.59039182737},{"content":" n2,\n\n n3i,\n\n D::one(),\n\n 0,\n\n 0,\n\n ) * state.partial_density[c];\n\n\n\n let na = p.na[0];\n\n let nb = p.nb[0];\n\n if nb > 0.0 {\n\n // no cross association, two association sites\n\n let xa = assoc_site_frac_ab(deltarho, na, nb);\n\n let xb = (xa - 1.0) * (na / nb) + 1.0;\n\n state.moles[c]\n\n * p.n[0]\n\n * ((xa.ln() - xa * 0.5 + 0.5) * na + (xb.ln() - xb * 0.5 + 0.5) * nb)\n\n } else {\n\n // no cross association, one association site\n\n let xa = assoc_site_frac_a(deltarho, na);\n\n\n","file_path":"src/eos/association.rs","rank":78,"score":27762.19838975217},{"content":" n3i,\n\n xi,\n\n i,\n\n j,\n\n )\n\n });\n\n\n\n // cross-association according to Michelsen2006\n\n // initialize monomer fraction\n\n let mut x = match &x0 {\n\n Some(x0) => (*x0).clone(),\n\n None => Array::from_elem(2 * nassoc, 0.2),\n\n };\n\n\n\n for k in 0..max_iter {\n\n if newton_step_cross_association::<_, f64>(\n\n &mut x,\n\n nassoc,\n\n &delta.map(D::re),\n\n na,\n","file_path":"src/eos/association.rs","rank":79,"score":27762.08743942443},{"content":" nb,\n\n &density.map(D::re),\n\n tol,\n\n )? {\n\n break;\n\n }\n\n if k == max_iter - 1 {\n\n return Err(EosError::NotConverged(\"Cross association\".into()));\n\n }\n\n }\n\n\n\n // calculate derivatives\n\n let mut x_dual = x.mapv(D::from);\n\n for _ in 0..D::NDERIV {\n\n newton_step_cross_association(&mut x_dual, nassoc, &delta, na, nb, density, tol)?;\n\n }\n\n\n\n // save monomer fraction\n\n if let Some(x0) = x0 {\n\n *x0 = x;\n\n }\n\n\n\n // Helmholtz energy density\n\n let xa = x_dual.slice(s![..nassoc]);\n\n let xb = x_dual.slice(s![nassoc..]);\n\n let f = |x: D| x.ln() - x * 0.5 + 0.5;\n\n Ok((density * (xa.mapv(f) * na + xb.mapv(f) * nb)).sum())\n\n}\n\n\n","file_path":"src/eos/association.rs","rank":80,"score":27760.92811335769},{"content":" let (mut haa, mut hab, mut hba, mut hbb) = h.multi_slice_mut((\n\n s![..nassoc, ..nassoc],\n\n s![..nassoc, nassoc..],\n\n s![nassoc.., ..nassoc],\n\n s![nassoc.., nassoc..],\n\n ));\n\n\n\n // calculate gradients and approximate Hessian\n\n for i in 0..nassoc {\n\n let d = &delta.index_axis(Axis(0), i) * rho;\n\n\n\n let dnx = (&xb * nb * &d).sum() + 1.0;\n\n ga[i] = xa[i].recip() - dnx;\n\n hab.index_axis_mut(Axis(0), i).assign(&(&d * &(-nb)));\n\n haa[(i, i)] = -dnx / xa[i];\n\n\n\n let dnx = (&xa * na * &d).sum() + 1.0;\n\n gb[i] = xb[i].recip() - dnx;\n\n hba.index_axis_mut(Axis(0), i).assign(&(&d * &(-na)));\n\n hbb[(i, i)] = -dnx / xb[i];\n","file_path":"src/eos/association.rs","rank":81,"score":27759.439456975077},{"content":" .unwrap();\n\n let state = StateHD::new(\n\n Dual64::from_re(temperature),\n\n Dual64::from_re(volume).derive(),\n\n moles.mapv(Dual64::from_re),\n\n );\n\n let pressure =\n\n -contrib.helmholtz_energy(&state).eps[0] * temperature * EosUnit::reference_pressure();\n\n assert_relative_eq!(pressure, -26.105606376765632 * PASCAL, max_relative = 1e-10);\n\n }\n\n}\n","file_path":"src/eos/association.rs","rank":82,"score":27755.500749845247},{"content":" if !self.assoc_segment.is_empty() {\n\n write!(f, \"\\n\\tassoc_segment={}\", self.assoc_segment)?;\n\n write!(f, \"\\n\\tkappa_ab={}\", self.kappa_ab)?;\n\n write!(f, \"\\n\\tepsilon_k_ab={}\", self.epsilon_k_ab)?;\n\n write!(f, \"\\n\\tna={}\", self.na)?;\n\n write!(f, \"\\n\\tnb={}\", self.nb)?;\n\n }\n\n if !self.dipole_comp.is_empty() {\n\n write!(f, \"\\n\\tdipole_comp={}\", self.dipole_comp)?;\n\n write!(f, \"\\n\\tmu={}\", self.mu)?;\n\n }\n\n write!(f, \"\\n)\")\n\n }\n\n}\n\n\n\n#[cfg(test)]\n\npub mod test {\n\n use super::*;\n\n use feos_core::parameter::{ChemicalRecord, Identifier};\n\n\n","file_path":"src/eos/parameter.rs","rank":83,"score":27311.127271043286},{"content":"use crate::record::GcPcSaftRecord;\n\nuse feos_core::joback::JobackRecord;\n\nuse feos_core::parameter::{\n\n BinaryRecord, ChemicalRecord, FromSegments, IdentifierOption, ParameterError, SegmentRecord,\n\n};\n\nuse indexmap::{IndexMap, IndexSet};\n\nuse ndarray::{Array1, Array2};\n\nuse quantity::si::{JOULE, KB, KELVIN};\n\nuse std::fmt::Write;\n\nuse std::fs::File;\n\nuse std::io::BufReader;\n\nuse std::path::Path;\n\n\n\n/// Parameter set required for the gc-PC-SAFT equation of state.\n\npub struct GcPcSaftEosParameters {\n\n pub molarweight: Array1<f64>,\n\n pub component_index: Array1<usize>,\n\n identifiers: Vec<String>,\n\n\n\n pub m: Array1<f64>,\n","file_path":"src/eos/parameter.rs","rank":84,"score":27310.715202899144},{"content":" pub epsilon_k_ij: Array2<f64>,\n\n pub sigma3_kappa_aibj: Array2<f64>,\n\n pub epsilon_k_aibj: Array2<f64>,\n\n\n\n pub chemical_records: Vec<ChemicalRecord>,\n\n segment_records: Vec<SegmentRecord<GcPcSaftRecord, JobackRecord>>,\n\n binary_segment_records: Option<Vec<BinaryRecord<String, f64>>>,\n\n pub joback_records: Option<Vec<JobackRecord>>,\n\n}\n\n\n\nimpl GcPcSaftEosParameters {\n\n pub fn from_segments(\n\n chemical_records: Vec<ChemicalRecord>,\n\n segment_records: Vec<SegmentRecord<GcPcSaftRecord, JobackRecord>>,\n\n binary_segment_records: Option<Vec<BinaryRecord<String, f64>>>,\n\n ) -> Result<Self, ParameterError> {\n\n let segment_map: IndexMap<_, _> = segment_records\n\n .iter()\n\n .map(|r| (r.identifier.clone(), r.clone()))\n\n .collect();\n","file_path":"src/eos/parameter.rs","rank":85,"score":27310.214313752487},{"content":" let e_k_ij = Array2::from_shape_fn([dipole_comp.len(); 2], |(i, j)| {\n\n (epsilon_k_mix[i] * epsilon_k_mix[j]).sqrt()\n\n });\n\n\n\n // Association\n\n let sigma3_kappa_aibj = Array2::from_shape_fn([kappa_ab.len(); 2], |(i, j)| {\n\n (sigma[assoc_segment[i]] * sigma[assoc_segment[j]]).powf(1.5)\n\n * (kappa_ab[i] * kappa_ab[j]).sqrt()\n\n });\n\n let epsilon_k_aibj = Array2::from_shape_fn([epsilon_k_ab.len(); 2], |(i, j)| {\n\n 0.5 * (epsilon_k_ab[i] + epsilon_k_ab[j])\n\n });\n\n\n\n Ok(Self {\n\n molarweight,\n\n component_index: Array1::from_vec(component_index),\n\n identifiers,\n\n n: Array1::from_vec(n),\n\n m: Array1::from_vec(m),\n\n sigma: Array1::from_vec(sigma),\n","file_path":"src/eos/parameter.rs","rank":86,"score":27308.79740943141},{"content":" binary_segment_records,\n\n joback_records: joback_records.into_iter().collect(),\n\n })\n\n }\n\n\n\n pub fn from_json_segments<P>(\n\n substances: &[&str],\n\n file_pure: P,\n\n file_segments: P,\n\n file_binary: Option<P>,\n\n search_option: IdentifierOption,\n\n ) -> Result<Self, ParameterError>\n\n where\n\n P: AsRef<Path>,\n\n {\n\n let queried: IndexSet<String> = substances\n\n .iter()\n\n .map(|identifier| identifier.to_string())\n\n .collect();\n\n\n","file_path":"src/eos/parameter.rs","rank":87,"score":27308.695795054784},{"content":" .transpose()?;\n\n\n\n Self::from_segments(chemical_records, segment_records, binary_records)\n\n }\n\n\n\n pub fn subset(&self, component_list: &[usize]) -> Self {\n\n let chemical_records: Vec<_> = component_list\n\n .iter()\n\n .map(|&i| self.chemical_records[i].clone())\n\n .collect();\n\n Self::from_segments(\n\n chemical_records,\n\n self.segment_records.clone(),\n\n self.binary_segment_records.clone(),\n\n )\n\n .unwrap()\n\n }\n\n\n\n pub fn to_markdown(&self) -> String {\n\n let mut output = String::new();\n","file_path":"src/eos/parameter.rs","rank":88,"score":27307.661542310067},{"content":" o,\n\n \"\\n|{}|{}|{}|{}|\",\n\n component, self.identifiers[*c1], self.identifiers[*c2], c\n\n )\n\n .unwrap();\n\n }\n\n\n\n output\n\n }\n\n}\n\n\n\nimpl std::fmt::Display for GcPcSaftEosParameters {\n\n fn fmt(&self, f: &mut std::fmt::Formatter<'_>) -> std::fmt::Result {\n\n write!(f, \"GcPcSaftParameters(\")?;\n\n write!(f, \"\\n\\tmolarweight={}\", self.molarweight)?;\n\n write!(f, \"\\n\\tcomponent_index={}\", self.component_index)?;\n\n write!(f, \"\\n\\tm={}\", self.m)?;\n\n write!(f, \"\\n\\tsigma={}\", self.sigma)?;\n\n write!(f, \"\\n\\tepsilon_k={}\", self.epsilon_k)?;\n\n write!(f, \"\\n\\tbonds={:?}\", self.bonds)?;\n","file_path":"src/eos/parameter.rs","rank":89,"score":27305.970600928835},{"content":" )\n\n };\n\n let association = if let Some(a) = self.assoc_segment.iter().position(|&a| a == i) {\n\n format!(\n\n \"{}|{}|{}|{}\",\n\n self.kappa_ab[a], self.epsilon_k_ab[a], self.na[a], self.nb[a]\n\n )\n\n } else {\n\n \"|||\".to_string()\n\n };\n\n write!(\n\n o,\n\n \"\\n|{}|{}|{}|{}|{}|{}|{}|||\",\n\n component,\n\n self.identifiers[i],\n\n self.n[i],\n\n self.m[i],\n\n self.sigma[i],\n\n self.epsilon_k[i],\n\n association\n","file_path":"src/eos/parameter.rs","rank":90,"score":27305.645880291828},{"content":" let mut epsilon_k_mix = Vec::new();\n\n\n\n let mut joback_records = Vec::new();\n\n\n\n for (i, chemical_record) in chemical_records.iter().enumerate() {\n\n let mut segment_indices = IndexMap::with_capacity(segment_records.len());\n\n let (segment_counts, bond_counts) = chemical_record.segment_and_bond_count();\n\n let count: IndexMap<_, _> = segment_counts\n\n .iter()\n\n .map(|(id, &count)| {\n\n let segment = segment_map\n\n .get(id)\n\n .ok_or_else(|| ParameterError::ComponentsNotFound(id.clone()))?;\n\n Ok((segment, count))\n\n })\n\n .collect::<Result<_, ParameterError>>()?;\n\n\n\n let mut m_i = 0.0;\n\n let mut sigma_i = 0.0;\n\n let mut epsilon_k_i = 0.0;\n","file_path":"src/eos/parameter.rs","rank":91,"score":27305.235030527456},{"content":"\n\n pub fn propane() -> GcPcSaftEosParameters {\n\n let pure = ChemicalRecord::new(\n\n Identifier::new(\"74-98-6\", Some(\"propane\"), None, None, None, None),\n\n vec![\"CH3\".into(), \"CH2\".into(), \"CH3\".into()],\n\n None,\n\n );\n\n GcPcSaftEosParameters::from_segments(vec![pure], vec![ch3(), ch2()], None).unwrap()\n\n }\n\n\n\n pub fn propanol() -> GcPcSaftEosParameters {\n\n let pure = ChemicalRecord::new(\n\n Identifier::new(\"71-23-8\", Some(\"1-propanol\"), None, None, None, None),\n\n vec![\"CH3\".into(), \"CH2\".into(), \"CH2\".into(), \"OH\".into()],\n\n None,\n\n );\n\n GcPcSaftEosParameters::from_segments(vec![pure], vec![ch3(), ch2(), oh()], None).unwrap()\n\n }\n\n\n\n pub fn ethanol_propanol(binary: bool) -> GcPcSaftEosParameters {\n","file_path":"src/eos/parameter.rs","rank":92,"score":27305.10228934368},{"content":" pub sigma: Array1<f64>,\n\n pub epsilon_k: Array1<f64>,\n\n pub bonds: IndexMap<[usize; 2], f64>,\n\n\n\n pub assoc_segment: Array1<usize>,\n\n pub n: Array1<f64>,\n\n kappa_ab: Array1<f64>,\n\n epsilon_k_ab: Array1<f64>,\n\n pub na: Array1<f64>,\n\n pub nb: Array1<f64>,\n\n\n\n pub dipole_comp: Array1<usize>,\n\n mu: Array1<f64>,\n\n pub mu2: Array1<f64>,\n\n pub m_mix: Array1<f64>,\n\n pub s_ij: Array2<f64>,\n\n pub e_k_ij: Array2<f64>,\n\n\n\n pub k_ij: Array2<f64>,\n\n pub sigma_ij: Array2<f64>,\n","file_path":"src/eos/parameter.rs","rank":93,"score":27305.09527163304},{"content":"\n\n let mut molarweight = Array1::zeros(chemical_records.len());\n\n let mut component_index = Vec::new();\n\n let mut identifiers = Vec::new();\n\n let mut m = Vec::new();\n\n let mut sigma = Vec::new();\n\n let mut epsilon_k = Vec::new();\n\n let mut bonds = IndexMap::with_capacity(segment_records.len());\n\n let mut assoc_segment = Vec::new();\n\n let mut n = Vec::new();\n\n let mut kappa_ab = Vec::new();\n\n let mut epsilon_k_ab = Vec::new();\n\n let mut na = Vec::new();\n\n let mut nb = Vec::new();\n\n\n\n let mut dipole_comp = Vec::new();\n\n let mut mu = Vec::new();\n\n let mut mu2 = Vec::new();\n\n let mut m_mix = Vec::new();\n\n let mut sigma_mix = Vec::new();\n","file_path":"src/eos/parameter.rs","rank":94,"score":27305.024215136196},{"content":" let reader = BufReader::new(File::open(file_pure)?);\n\n let chemical_records: Vec<ChemicalRecord> = serde_json::from_reader(reader)?;\n\n let mut record_map: IndexMap<_, _> = chemical_records\n\n .into_iter()\n\n .filter_map(|record| {\n\n record\n\n .identifier()\n\n .as_string(search_option)\n\n .map(|i| (i, record))\n\n })\n\n .collect();\n\n\n\n // Compare queried components and available components\n\n let available: IndexSet<String> = record_map\n\n .keys()\n\n .map(|identifier| identifier.to_string())\n\n .collect();\n\n if !queried.is_subset(&available) {\n\n let missing: Vec<String> = queried.difference(&available).cloned().collect();\n\n return Err(ParameterError::ComponentsNotFound(format!(\"{:?}\", missing)));\n","file_path":"src/eos/parameter.rs","rank":95,"score":27304.116847269925},{"content":" .map(|s| JobackRecord::from_segments(s)),\n\n );\n\n }\n\n\n\n // Binary interaction parameter\n\n let mut k_ij = Array2::zeros([epsilon_k.len(); 2]);\n\n if let Some(binary_segment_records) = binary_segment_records.as_ref() {\n\n let mut binary_segment_records_map = IndexMap::new();\n\n for binary_record in binary_segment_records {\n\n binary_segment_records_map.insert(\n\n (binary_record.id1.clone(), binary_record.id2.clone()),\n\n binary_record.model_record,\n\n );\n\n binary_segment_records_map.insert(\n\n (binary_record.id2.clone(), binary_record.id1.clone()),\n\n binary_record.model_record,\n\n );\n\n }\n\n for (i, id1) in identifiers.iter().enumerate() {\n\n for (j, id2) in identifiers.iter().cloned().enumerate() {\n","file_path":"src/eos/parameter.rs","rank":96,"score":27303.06918592327},{"content":" let mut mu2_i = 0.0;\n\n\n\n for (segment, count) in count.iter() {\n\n segment_indices.insert(segment.identifier.clone(), m.len());\n\n\n\n molarweight[i] += segment.molarweight * count;\n\n\n\n component_index.push(i);\n\n identifiers.push(segment.identifier.clone());\n\n m.push(segment.model_record.m * count);\n\n sigma.push(segment.model_record.sigma);\n\n epsilon_k.push(segment.model_record.epsilon_k);\n\n\n\n if let (Some(k), Some(e)) = (\n\n segment.model_record.kappa_ab,\n\n segment.model_record.epsilon_k_ab,\n\n ) {\n\n assoc_segment.push(m.len() - 1);\n\n n.push(*count);\n\n kappa_ab.push(k);\n","file_path":"src/eos/parameter.rs","rank":97,"score":27302.809952960553},{"content":" if component_index[i] != component_index[j] {\n\n if let Some(k) = binary_segment_records_map.get(&(id1.clone(), id2)) {\n\n k_ij[(i, j)] = *k;\n\n }\n\n }\n\n }\n\n }\n\n }\n\n\n\n // Combining rules dispersion\n\n let sigma_ij =\n\n Array2::from_shape_fn([sigma.len(); 2], |(i, j)| 0.5 * (sigma[i] + sigma[j]));\n\n let epsilon_k_ij = Array2::from_shape_fn([epsilon_k.len(); 2], |(i, j)| {\n\n (epsilon_k[i] * epsilon_k[j]).sqrt()\n\n }) * (1.0 - &k_ij);\n\n\n\n // Combining rules polar\n\n let s_ij = Array2::from_shape_fn([dipole_comp.len(); 2], |(i, j)| {\n\n 0.5 * (sigma_mix[i] + sigma_mix[j])\n\n });\n","file_path":"src/eos/parameter.rs","rank":98,"score":27302.56098059707},{"content":" epsilon_k: Array1::from_vec(epsilon_k),\n\n bonds,\n\n assoc_segment: Array1::from_vec(assoc_segment),\n\n kappa_ab: Array1::from_vec(kappa_ab),\n\n epsilon_k_ab: Array1::from_vec(epsilon_k_ab),\n\n na: Array1::from_vec(na),\n\n nb: Array1::from_vec(nb),\n\n dipole_comp: Array1::from_vec(dipole_comp),\n\n mu: Array1::from_vec(mu),\n\n mu2: Array1::from_vec(mu2),\n\n m_mix: Array1::from_vec(m_mix),\n\n s_ij,\n\n e_k_ij,\n\n k_ij,\n\n sigma_ij,\n\n epsilon_k_ij,\n\n sigma3_kappa_aibj,\n\n epsilon_k_aibj,\n\n chemical_records,\n\n segment_records,\n","file_path":"src/eos/parameter.rs","rank":99,"score":27301.722959683197}],"string":"[\n {\n \"content\": \"#[pymodule]\\n\\npub fn dft(_py: Python<'_>, m: &PyModule) -> PyResult<()> {\\n\\n m.add_class::<PyGcPcSaftFunctional>()?;\\n\\n m.add_class::<PyState>()?;\\n\\n m.add_class::<PyPhaseDiagram>()?;\\n\\n m.add_class::<PyPhaseEquilibrium>()?;\\n\\n m.add_class::<PyPlanarInterface>()?;\\n\\n m.add_class::<Geometry>()?;\\n\\n m.add_class::<PyPore1D>()?;\\n\\n m.add_class::<PyPore3D>()?;\\n\\n m.add_class::<PyExternalPotential>()?;\\n\\n m.add_class::<PyAdsorption1D>()?;\\n\\n m.add_class::<PyAdsorption3D>()?;\\n\\n m.add_class::<PySurfaceTensionDiagram>()?;\\n\\n m.add_class::<PyDFTSolver>()?;\\n\\n m.add_class::<PySolvationProfile>()?;\\n\\n m.add_class::<FMTVersion>()?;\\n\\n m.add_class::<PyMicelleProfile>()?;\\n\\n Ok(())\\n\\n}\\n\",\n \"file_path\": \"build_wheel/src/dft.rs\",\n \"rank\": 0,\n \"score\": 92379.61473575173\n },\n {\n \"content\": \"#[test]\\n\\n#[allow(non_snake_case)]\\n\\nfn test_dft_assoc() -> Result<(), Box<dyn Error>> {\\n\\n let parameters = GcPcSaftFunctionalParameters::from_json_segments(\\n\\n &[\\\"1-pentanol\\\"],\\n\\n \\\"parameters/gc_substances.json\\\",\\n\\n \\\"parameters/sauer2014_hetero.json\\\",\\n\\n None,\\n\\n IdentifierOption::Name,\\n\\n )\\n\\n .unwrap();\\n\\n\\n\\n let func = Rc::new(GcPcSaftFunctional::new(Rc::new(parameters)));\\n\\n let t = 300.0 * KELVIN;\\n\\n let w = 100.0 * ANGSTROM;\\n\\n let points = 4096;\\n\\n let vle = PhaseEquilibrium::pure(&func, t, None, Default::default())?;\\n\\n let profile = PlanarInterface::from_tanh(&vle, points, w, 600.0 * KELVIN)?.solve(None)?;\\n\\n println!(\\n\\n \\\"hetero {} {} {}\\\",\\n\\n profile.surface_tension.unwrap(),\\n\\n vle.vapor().density,\\n\",\n \"file_path\": \"tests/dft.rs\",\n \"rank\": 1,\n \"score\": 79656.25002901137\n },\n {\n \"content\": \"pub fn helmholtz_energy_density_cross_association<S, D: DualNum<f64> + ScalarOperand>(\\n\\n // p: &GcPcSaftParameters<B>,\\n\\n assoc_segment: &Array1<usize>,\\n\\n sigma3_kappa_aibj: &Array2<f64>,\\n\\n epsilon_k_aibj: &Array2<f64>,\\n\\n na: &Array1<f64>,\\n\\n nb: &Array1<f64>,\\n\\n temperature: D,\\n\\n density: &ArrayBase<S, Ix1>,\\n\\n diameter: &Array1<D>,\\n\\n n2: D,\\n\\n n3i: D,\\n\\n xi: D,\\n\\n max_iter: usize,\\n\\n tol: f64,\\n\\n x0: Option<&mut Array1<f64>>,\\n\\n) -> Result<D, EosError>\\n\\nwhere\\n\\n S: Data<Elem = D>,\\n\\n{\\n\",\n \"file_path\": \"src/eos/association.rs\",\n \"rank\": 2,\n \"score\": 75762.02849625803\n },\n {\n \"content\": \"#[test]\\n\\n#[allow(non_snake_case)]\\n\\nfn test_dft() -> Result<(), Box<dyn Error>> {\\n\\n // correct for different k_B in old code\\n\\n let KB_old = 1.38064852e-23 * JOULE / KELVIN;\\n\\n let NAV_old = 6.022140857e23 / MOL;\\n\\n\\n\\n let parameters = GcPcSaftFunctionalParameters::from_json_segments(\\n\\n &[\\\"propane\\\"],\\n\\n \\\"parameters/gc_substances.json\\\",\\n\\n \\\"parameters/sauer2014_hetero.json\\\",\\n\\n None,\\n\\n IdentifierOption::Name,\\n\\n )\\n\\n .unwrap();\\n\\n\\n\\n let func = Rc::new(GcPcSaftFunctional::new(Rc::new(parameters)));\\n\\n let t = 200.0 * KELVIN;\\n\\n let w = 150.0 * ANGSTROM;\\n\\n let points = 2048;\\n\\n let tc = State::critical_point(&func, None, None, Default::default())?.temperature;\\n\\n let vle = PhaseEquilibrium::pure(&func, t, None, Default::default())?;\\n\",\n \"file_path\": \"tests/dft.rs\",\n \"rank\": 3,\n \"score\": 60265.56126956189\n },\n {\n \"content\": \"fn association_strength<D: DualNum<f64>>(\\n\\n assoc_segment: &Array1<usize>,\\n\\n sigma3_kappa_aibj: &Array2<f64>,\\n\\n epsilon_k_aibj: &Array2<f64>,\\n\\n temperature: D,\\n\\n diameter: &Array1<D>,\\n\\n n2: D,\\n\\n n3i: D,\\n\\n xi: D,\\n\\n i: usize,\\n\\n j: usize,\\n\\n) -> D {\\n\\n let ai = assoc_segment[i];\\n\\n let aj = assoc_segment[j];\\n\\n let k = diameter[ai] * diameter[aj] / (diameter[ai] + diameter[aj]) * (n2 * n3i);\\n\\n n3i * (k * xi * (k / 18.0 + 0.5) + 1.0)\\n\\n * sigma3_kappa_aibj[(i, j)]\\n\\n * (temperature.recip() * epsilon_k_aibj[(i, j)]).exp_m1()\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/eos/association.rs\",\n \"rank\": 4,\n \"score\": 60265.02538949664\n },\n {\n \"content\": \"#[pymodule]\\n\\npub fn eos(_py: Python<'_>, m: &PyModule) -> PyResult<()> {\\n\\n m.add_class::<PyGcPcSaft>()?;\\n\\n m.add_class::<PyState>()?;\\n\\n m.add_class::<PyPhaseDiagram>()?;\\n\\n m.add_class::<PyPhaseEquilibrium>()?;\\n\\n Ok(())\\n\\n}\\n\",\n \"file_path\": \"build_wheel/src/eos.rs\",\n \"rank\": 5,\n \"score\": 55469.1140607223\n },\n {\n \"content\": \"use super::parameter::GcPcSaftFunctionalParameters;\\n\\nuse crate::eos::association::{\\n\\n assoc_site_frac_a, assoc_site_frac_ab, helmholtz_energy_density_cross_association,\\n\\n};\\n\\nuse feos_core::EosError;\\n\\nuse feos_dft::{\\n\\n FunctionalContributionDual, WeightFunction, WeightFunctionInfo, WeightFunctionShape,\\n\\n};\\n\\nuse ndarray::*;\\n\\nuse num_dual::DualNum;\\n\\nuse std::f64::consts::PI;\\n\\nuse std::fmt;\\n\\nuse std::ops::MulAssign;\\n\\nuse std::rc::Rc;\\n\\n\\n\\npub const N0_CUTOFF: f64 = 1e-9;\\n\\n\\n\\n#[derive(Clone)]\\n\\npub struct AssociationFunctional {\\n\\n parameters: Rc<GcPcSaftFunctionalParameters>,\\n\",\n \"file_path\": \"src/dft/association.rs\",\n \"rank\": 13,\n \"score\": 54453.0327986033\n },\n {\n \"content\": \" max_iter: usize,\\n\\n tol: f64,\\n\\n}\\n\\n\\n\\nimpl AssociationFunctional {\\n\\n pub fn new(parameters: &Rc<GcPcSaftFunctionalParameters>, max_iter: usize, tol: f64) -> Self {\\n\\n Self {\\n\\n parameters: parameters.clone(),\\n\\n max_iter,\\n\\n tol,\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\nimpl<N> FunctionalContributionDual<N> for AssociationFunctional\\n\\nwhere\\n\\n N: DualNum<f64> + ScalarOperand,\\n\\n{\\n\\n fn weight_functions(&self, temperature: N) -> WeightFunctionInfo<N> {\\n\\n let p = &self.parameters;\\n\",\n \"file_path\": \"src/dft/association.rs\",\n \"rank\": 14,\n \"score\": 54451.02118077254\n },\n {\n \"content\": \" xi,\\n\\n self.max_iter,\\n\\n self.tol,\\n\\n Some(&mut x),\\n\\n )\\n\\n })\\n\\n .collect::<Result<Array1<N>, _>>()?\\n\\n .into_shape(n2.raw_dim())\\n\\n .unwrap())\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\nimpl fmt::Display for AssociationFunctional {\\n\\n fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {\\n\\n write!(f, \\\"Association functional\\\")\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/dft/association.rs\",\n \"rank\": 15,\n \"score\": 54444.12524107605\n },\n {\n \"content\": \" * ((temperature.recip() * p.epsilon_k_aibj[(0, 0)]).exp_m1()\\n\\n * p.sigma3_kappa_aibj[(0, 0)])\\n\\n * rho0.index_axis(Axis(0), 0);\\n\\n\\n\\n let na = p.na[0];\\n\\n let nb = p.nb[0];\\n\\n let f = |x: N| x.ln() - x * 0.5 + 0.5;\\n\\n if nb > 0.0 {\\n\\n // no cross association, two association sites\\n\\n let xa = deltarho.mapv(|d| assoc_site_frac_ab(d, na, nb));\\n\\n let xb = (&xa - 1.0) * (na / nb) + 1.0;\\n\\n Ok((xa.mapv(f) * na + xb.mapv(f) * nb) * rho0.index_axis(Axis(0), 0))\\n\\n } else {\\n\\n // no cross association, one association site\\n\\n let xa = deltarho.mapv(|d| assoc_site_frac_a(d, na));\\n\\n\\n\\n Ok(xa.mapv(f) * na * rho0.index_axis(Axis(0), 0))\\n\\n }\\n\\n } else {\\n\\n let mut x: Array1<f64> = Array::from_elem(2 * nassoc, 0.2);\\n\",\n \"file_path\": \"src/dft/association.rs\",\n \"rank\": 16,\n \"score\": 54442.35295510072\n },\n {\n \"content\": \" // weighted densities\\n\\n let n0i = weighted_densities.slice_axis(Axis(0), Slice::new(0, Some(segments as isize), 1));\\n\\n let n2vi: Vec<_> = (0..dim)\\n\\n .map(|i| {\\n\\n weighted_densities.slice_axis(\\n\\n Axis(0),\\n\\n Slice::new(\\n\\n (segments * (i + 1)) as isize,\\n\\n Some((segments * (i + 2)) as isize),\\n\\n 1,\\n\\n ),\\n\\n )\\n\\n })\\n\\n .collect();\\n\\n let n3 = weighted_densities.index_axis(Axis(0), segments * (dim + 1));\\n\\n\\n\\n // calculate rho0 (only associating segments)\\n\\n let diameter = p.hs_diameter(temperature);\\n\\n let mut n2i = n0i.to_owned();\\n\\n for (i, mut n2i) in n2i.outer_iter_mut().enumerate() {\\n\",\n \"file_path\": \"src/dft/association.rs\",\n \"rank\": 17,\n \"score\": 54442.079646429294\n },\n {\n \"content\": \" true,\\n\\n )\\n\\n }\\n\\n\\n\\n fn calculate_helmholtz_energy_density(\\n\\n &self,\\n\\n temperature: N,\\n\\n weighted_densities: ArrayView2<N>,\\n\\n ) -> Result<Array1<N>, EosError> {\\n\\n let p = &self.parameters;\\n\\n\\n\\n // number of segments\\n\\n let segments = p.m.len();\\n\\n\\n\\n // number of associating segments\\n\\n let nassoc = p.assoc_segment.len();\\n\\n\\n\\n // number of dimensions\\n\\n let dim = (weighted_densities.shape()[0] - 1) / segments - 1;\\n\\n\\n\",\n \"file_path\": \"src/dft/association.rs\",\n \"rank\": 18,\n \"score\": 54441.759394945184\n },\n {\n \"content\": \" .iter()\\n\\n .fold(Array::zeros(n2.raw_dim()), |acc, n2v| acc + n2v * n2v)\\n\\n / -(&n2 * &n2)\\n\\n + 1.0;\\n\\n xi.iter_mut()\\n\\n .zip(&n0i.sum_axis(Axis(0)))\\n\\n .for_each(|(xi, &n0i)| {\\n\\n if n0i.re() < N0_CUTOFF {\\n\\n *xi = N::one();\\n\\n }\\n\\n });\\n\\n\\n\\n // auxiliary variables\\n\\n let n3i = n3.mapv(|n3| (-n3 + 1.0).recip());\\n\\n\\n\\n // only one associating component\\n\\n if nassoc == 1 {\\n\\n // association strength\\n\\n let k = &n2 * &n3i * diameter[p.assoc_segment[0]] * 0.5;\\n\\n let deltarho = (((&k / 18.0 + 0.5) * &k * xi + 1.0) * n3i)\\n\",\n \"file_path\": \"src/dft/association.rs\",\n \"rank\": 19,\n \"score\": 54441.695990026354\n },\n {\n \"content\": \" n2i.mul_assign(diameter[i].powi(2) * p.m[i] * PI);\\n\\n }\\n\\n let mut rho0: Array2<N> = (n2vi\\n\\n .iter()\\n\\n .fold(Array2::zeros(n2i.raw_dim()), |acc, n2vi| acc + n2vi * n2vi)\\n\\n / -(&n2i * &n2i)\\n\\n + 1.0)\\n\\n * n0i;\\n\\n rho0.iter_mut().zip(&n0i).for_each(|(rho0, &n0i)| {\\n\\n if n0i.re() < N0_CUTOFF {\\n\\n *rho0 = n0i;\\n\\n }\\n\\n });\\n\\n let rho0 =\\n\\n Array2::from_shape_fn((nassoc, n3.len()), |(i, j)| rho0[(p.assoc_segment[i], j)]);\\n\\n\\n\\n // calculate xi\\n\\n let n2v: Vec<_> = n2vi.iter().map(|n2vi| n2vi.sum_axis(Axis(0))).collect();\\n\\n let n2 = n2i.sum_axis(Axis(0));\\n\\n let mut xi = n2v\\n\",\n \"file_path\": \"src/dft/association.rs\",\n \"rank\": 20,\n \"score\": 54441.40563712252\n },\n {\n \"content\": \" Ok(rho0\\n\\n .view()\\n\\n .into_shape([nassoc, rho0.len() / nassoc])\\n\\n .unwrap()\\n\\n .axis_iter(Axis(1))\\n\\n .zip(n2.iter())\\n\\n .zip(n3i.iter())\\n\\n .zip(xi.iter())\\n\\n .map(|(((rho0, &n2), &n3i), &xi)| {\\n\\n helmholtz_energy_density_cross_association(\\n\\n &p.assoc_segment,\\n\\n &p.sigma3_kappa_aibj,\\n\\n &p.epsilon_k_aibj,\\n\\n &p.na,\\n\\n &p.nb,\\n\\n temperature,\\n\\n &rho0,\\n\\n &diameter,\\n\\n n2,\\n\\n n3i,\\n\",\n \"file_path\": \"src/dft/association.rs\",\n \"rank\": 21,\n \"score\": 54439.13860810976\n },\n {\n \"content\": \" let r = p.hs_diameter(temperature) * 0.5;\\n\\n WeightFunctionInfo::new(p.component_index.clone(), false)\\n\\n .add(\\n\\n WeightFunction::new_scaled(r.clone(), WeightFunctionShape::Delta),\\n\\n false,\\n\\n )\\n\\n .add(\\n\\n WeightFunction {\\n\\n prefactor: p.m.mapv(N::from),\\n\\n kernel_radius: r.clone(),\\n\\n shape: WeightFunctionShape::DeltaVec,\\n\\n },\\n\\n false,\\n\\n )\\n\\n .add(\\n\\n WeightFunction {\\n\\n prefactor: p.m.mapv(N::from),\\n\\n kernel_radius: r,\\n\\n shape: WeightFunctionShape::Theta,\\n\\n },\\n\",\n \"file_path\": \"src/dft/association.rs\",\n \"rank\": 22,\n \"score\": 54436.85413702663\n },\n {\n \"content\": \" binary_segment_records: Option<Vec<BinaryRecord<String, f64>>>,\\n\\n}\\n\\n\\n\\nimpl GcPcSaftFunctionalParameters {\\n\\n pub fn from_segments(\\n\\n chemical_records: Vec<ChemicalRecord>,\\n\\n segment_records: Vec<SegmentRecord<GcPcSaftRecord, JobackRecord>>,\\n\\n binary_segment_records: Option<Vec<BinaryRecord<String, f64>>>,\\n\\n ) -> Result<Self, ParameterError> {\\n\\n let segment_map: IndexMap<_, _> = segment_records\\n\\n .iter()\\n\\n .map(|r| (r.identifier.clone(), r.clone()))\\n\\n .collect();\\n\\n\\n\\n let mut molarweight = Array1::zeros(chemical_records.len());\\n\\n let mut component_index = Vec::new();\\n\\n let mut identifiers = Vec::new();\\n\\n let mut m = Vec::new();\\n\\n let mut sigma = Vec::new();\\n\\n let mut epsilon_k = Vec::new();\\n\",\n \"file_path\": \"src/dft/parameter.rs\",\n \"rank\": 23,\n \"score\": 53991.1806523264\n },\n {\n \"content\": \"use crate::record::GcPcSaftRecord;\\n\\nuse feos_core::joback::JobackRecord;\\n\\nuse feos_core::parameter::{\\n\\n BinaryRecord, ChemicalRecord, IdentifierOption, ParameterError, SegmentRecord,\\n\\n};\\n\\nuse indexmap::{IndexMap, IndexSet};\\n\\nuse ndarray::{Array1, Array2};\\n\\nuse num_dual::DualNum;\\n\\nuse petgraph::dot::{Config, Dot};\\n\\nuse petgraph::graph::{Graph, UnGraph};\\n\\nuse std::fmt::Write;\\n\\nuse std::fs::File;\\n\\nuse std::io::BufReader;\\n\\nuse std::path::Path;\\n\\n\\n\\n/// psi Parameter for heterosegmented DFT (Mairhofer2018)\\n\\nconst PSI_GC_DFT: f64 = 1.5357;\\n\\n\\n\\n/// Parameter set required for the gc-PC-SAFT Helmholtz energy functional.\\n\\npub struct GcPcSaftFunctionalParameters {\\n\",\n \"file_path\": \"src/dft/parameter.rs\",\n \"rank\": 24,\n \"score\": 53990.88141222919\n },\n {\n \"content\": \" chemical_records,\\n\\n self.segment_records.clone(),\\n\\n self.binary_segment_records.clone(),\\n\\n )\\n\\n .unwrap()\\n\\n }\\n\\n\\n\\n pub fn hs_diameter<D: DualNum<f64>>(&self, temperature: D) -> Array1<D> {\\n\\n let ti = temperature.recip() * -3.0;\\n\\n Array1::from_shape_fn(self.sigma.len(), |i| {\\n\\n -((ti * self.epsilon_k[i]).exp() * 0.12 - 1.0) * self.sigma[i]\\n\\n })\\n\\n }\\n\\n\\n\\n pub fn to_markdown(&self) -> String {\\n\\n let mut output = String::new();\\n\\n let o = &mut output;\\n\\n write!(\\n\\n o,\\n\\n \\\"|component|molarweight|segment|$m$|$\\\\\\\\sigma$|$\\\\\\\\varepsilon$|$\\\\\\\\kappa_{{AB}}$|$\\\\\\\\varepsilon_{{AB}}$|$N_A$|$N_B$|\\\\n|-|-|-|-|-|-|-|-|-|-|\\\"\\n\",\n \"file_path\": \"src/dft/parameter.rs\",\n \"rank\": 25,\n \"score\": 53987.992184617055\n },\n {\n \"content\": \" // Association\\n\\n let sigma3_kappa_aibj = Array2::from_shape_fn([kappa_ab.len(); 2], |(i, j)| {\\n\\n (sigma[assoc_segment[i]] * sigma[assoc_segment[j]]).powf(1.5)\\n\\n * (kappa_ab[i] * kappa_ab[j]).sqrt()\\n\\n });\\n\\n let epsilon_k_aibj = Array2::from_shape_fn([epsilon_k_ab.len(); 2], |(i, j)| {\\n\\n 0.5 * (epsilon_k_ab[i] + epsilon_k_ab[j])\\n\\n });\\n\\n\\n\\n Ok(Self {\\n\\n molarweight,\\n\\n component_index: Array1::from_vec(component_index),\\n\\n identifiers,\\n\\n m: Array1::from_vec(m),\\n\\n sigma: Array1::from_vec(sigma),\\n\\n epsilon_k: Array1::from_vec(epsilon_k),\\n\\n bonds,\\n\\n assoc_segment: Array1::from_vec(assoc_segment),\\n\\n kappa_ab: Array1::from_vec(kappa_ab),\\n\\n epsilon_k_ab: Array1::from_vec(epsilon_k_ab),\\n\",\n \"file_path\": \"src/dft/parameter.rs\",\n \"rank\": 26,\n \"score\": 53987.80421209468\n },\n {\n \"content\": \" na: Array1::from_vec(na),\\n\\n nb: Array1::from_vec(nb),\\n\\n psi_dft: Array1::from_vec(psi_dft),\\n\\n k_ij,\\n\\n sigma_ij,\\n\\n epsilon_k_ij,\\n\\n sigma3_kappa_aibj,\\n\\n epsilon_k_aibj,\\n\\n chemical_records,\\n\\n segment_records,\\n\\n binary_segment_records,\\n\\n })\\n\\n }\\n\\n\\n\\n pub fn from_json_segments<P>(\\n\\n substances: &[&str],\\n\\n file_pure: P,\\n\\n file_segments: P,\\n\\n file_binary: Option<P>,\\n\\n search_option: IdentifierOption,\\n\",\n \"file_path\": \"src/dft/parameter.rs\",\n \"rank\": 27,\n \"score\": 53986.56216227673\n },\n {\n \"content\": \" .map(|i, _| &self.identifiers[i.index()], |_, _| ());\\n\\n format!(\\\"{:?}\\\", Dot::with_config(&graph, &[Config::EdgeNoLabel]))\\n\\n }\\n\\n}\\n\\n\\n\\nimpl std::fmt::Display for GcPcSaftFunctionalParameters {\\n\\n fn fmt(&self, f: &mut std::fmt::Formatter<'_>) -> std::fmt::Result {\\n\\n write!(f, \\\"GcPcSaftFunctionalParameters(\\\")?;\\n\\n write!(f, \\\"\\\\n\\\\tmolarweight={}\\\", self.molarweight)?;\\n\\n write!(f, \\\"\\\\n\\\\tcomponent_index={}\\\", self.component_index)?;\\n\\n write!(f, \\\"\\\\n\\\\tm={}\\\", self.m)?;\\n\\n write!(f, \\\"\\\\n\\\\tsigma={}\\\", self.sigma)?;\\n\\n write!(f, \\\"\\\\n\\\\tepsilon_k={}\\\", self.epsilon_k)?;\\n\\n write!(f, \\\"\\\\n\\\\tbonds={:?}\\\", self.bonds)?;\\n\\n if !self.assoc_segment.is_empty() {\\n\\n write!(f, \\\"\\\\n\\\\tassoc_segment={}\\\", self.assoc_segment)?;\\n\\n write!(f, \\\"\\\\n\\\\tkappa_ab={}\\\", self.kappa_ab)?;\\n\\n write!(f, \\\"\\\\n\\\\tepsilon_k_ab={}\\\", self.epsilon_k_ab)?;\\n\\n write!(f, \\\"\\\\n\\\\tna={}\\\", self.na)?;\\n\\n write!(f, \\\"\\\\n\\\\tnb={}\\\", self.nb)?;\\n\\n }\\n\\n write!(f, \\\"\\\\n)\\\")\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/dft/parameter.rs\",\n \"rank\": 28,\n \"score\": 53986.40010662325\n },\n {\n \"content\": \" ) -> Result<Self, ParameterError>\\n\\n where\\n\\n P: AsRef<Path>,\\n\\n {\\n\\n let queried: IndexSet<String> = substances\\n\\n .iter()\\n\\n .map(|identifier| identifier.to_string())\\n\\n .collect();\\n\\n\\n\\n let reader = BufReader::new(File::open(file_pure)?);\\n\\n let chemical_records: Vec<ChemicalRecord> = serde_json::from_reader(reader)?;\\n\\n let mut record_map: IndexMap<_, _> = chemical_records\\n\\n .into_iter()\\n\\n .filter_map(|record| {\\n\\n record\\n\\n .identifier()\\n\\n .as_string(search_option)\\n\\n .map(|i| (i, record))\\n\\n })\\n\\n .collect();\\n\",\n \"file_path\": \"src/dft/parameter.rs\",\n \"rank\": 29,\n \"score\": 53986.11514384723\n },\n {\n \"content\": \" let mut bonds = Graph::default();\\n\\n let mut assoc_segment = Vec::new();\\n\\n let mut kappa_ab = Vec::new();\\n\\n let mut epsilon_k_ab = Vec::new();\\n\\n let mut na = Vec::new();\\n\\n let mut nb = Vec::new();\\n\\n let mut psi_dft = Vec::new();\\n\\n\\n\\n let mut segment_index = 0;\\n\\n for (i, chemical_record) in chemical_records.iter().enumerate() {\\n\\n let (segment_list, bond_list) = chemical_record.segment_and_bond_list()?;\\n\\n\\n\\n bonds.extend_with_edges(bond_list.iter().map(|x| {\\n\\n (\\n\\n (segment_index + x[0]) as u32,\\n\\n (segment_index + x[1]) as u32,\\n\\n (),\\n\\n )\\n\\n }));\\n\\n\\n\",\n \"file_path\": \"src/dft/parameter.rs\",\n \"rank\": 30,\n \"score\": 53986.05201892374\n },\n {\n \"content\": \" pub molarweight: Array1<f64>,\\n\\n pub component_index: Array1<usize>,\\n\\n identifiers: Vec<String>,\\n\\n pub m: Array1<f64>,\\n\\n pub sigma: Array1<f64>,\\n\\n pub epsilon_k: Array1<f64>,\\n\\n pub bonds: UnGraph<(), ()>,\\n\\n pub assoc_segment: Array1<usize>,\\n\\n kappa_ab: Array1<f64>,\\n\\n epsilon_k_ab: Array1<f64>,\\n\\n pub na: Array1<f64>,\\n\\n pub nb: Array1<f64>,\\n\\n pub psi_dft: Array1<f64>,\\n\\n pub k_ij: Array2<f64>,\\n\\n pub sigma_ij: Array2<f64>,\\n\\n pub epsilon_k_ij: Array2<f64>,\\n\\n pub sigma3_kappa_aibj: Array2<f64>,\\n\\n pub epsilon_k_aibj: Array2<f64>,\\n\\n chemical_records: Vec<ChemicalRecord>,\\n\\n segment_records: Vec<SegmentRecord<GcPcSaftRecord, JobackRecord>>,\\n\",\n \"file_path\": \"src/dft/parameter.rs\",\n \"rank\": 31,\n \"score\": 53985.4602108594\n },\n {\n \"content\": \" }\\n\\n\\n\\n psi_dft.push(segment.model_record.psi_dft.unwrap_or(PSI_GC_DFT));\\n\\n\\n\\n segment_index += 1;\\n\\n }\\n\\n }\\n\\n\\n\\n // Binary interaction parameter\\n\\n let mut k_ij = Array2::zeros([epsilon_k.len(); 2]);\\n\\n if let Some(binary_segment_records) = binary_segment_records.as_ref() {\\n\\n let mut binary_segment_records_map = IndexMap::new();\\n\\n for binary_record in binary_segment_records {\\n\\n binary_segment_records_map.insert(\\n\\n (binary_record.id1.clone(), binary_record.id2.clone()),\\n\\n binary_record.model_record,\\n\\n );\\n\\n binary_segment_records_map.insert(\\n\\n (binary_record.id2.clone(), binary_record.id1.clone()),\\n\\n binary_record.model_record,\\n\",\n \"file_path\": \"src/dft/parameter.rs\",\n \"rank\": 32,\n \"score\": 53985.277587457895\n },\n {\n \"content\": \"\\n\\n // Read binary records\\n\\n let binary_records = file_binary\\n\\n .map(|file_binary| {\\n\\n let reader = BufReader::new(File::open(file_binary)?);\\n\\n let binary_records: Result<Vec<BinaryRecord<String, f64>>, ParameterError> =\\n\\n Ok(serde_json::from_reader(reader)?);\\n\\n binary_records\\n\\n })\\n\\n .transpose()?;\\n\\n\\n\\n Self::from_segments(chemical_records, segment_records, binary_records)\\n\\n }\\n\\n\\n\\n pub fn subset(&self, component_list: &[usize]) -> Self {\\n\\n let chemical_records: Vec<_> = component_list\\n\\n .iter()\\n\\n .map(|&i| self.chemical_records[i].clone())\\n\\n .collect();\\n\\n Self::from_segments(\\n\",\n \"file_path\": \"src/dft/parameter.rs\",\n \"rank\": 33,\n \"score\": 53985.008247188736\n },\n {\n \"content\": \" };\\n\\n write!(\\n\\n o,\\n\\n \\\"\\\\n|{}|{}|{}|{}|{}|{}|||\\\",\\n\\n component,\\n\\n self.identifiers[i],\\n\\n self.m[i],\\n\\n self.sigma[i],\\n\\n self.epsilon_k[i],\\n\\n association\\n\\n )\\n\\n .unwrap();\\n\\n }\\n\\n\\n\\n output\\n\\n }\\n\\n\\n\\n pub fn graph(&self) -> String {\\n\\n let graph = self\\n\\n .bonds\\n\",\n \"file_path\": \"src/dft/parameter.rs\",\n \"rank\": 34,\n \"score\": 53984.4903039491\n },\n {\n \"content\": \" )\\n\\n .unwrap();\\n\\n for i in 0..self.m.len() {\\n\\n let component = if i > 0 && self.component_index[i] == self.component_index[i - 1] {\\n\\n \\\"|\\\".to_string()\\n\\n } else {\\n\\n let pure = self.chemical_records[self.component_index[i]].identifier();\\n\\n format!(\\n\\n \\\"{}|{}\\\",\\n\\n pure.name.as_ref().unwrap_or(&pure.cas),\\n\\n self.molarweight[self.component_index[i]]\\n\\n )\\n\\n };\\n\\n let association = if let Some(a) = self.assoc_segment.iter().position(|&a| a == i) {\\n\\n format!(\\n\\n \\\"{}|{}|{}|{}\\\",\\n\\n self.kappa_ab[a], self.epsilon_k_ab[a], self.na[a], self.nb[a]\\n\\n )\\n\\n } else {\\n\\n \\\"|||\\\".to_string()\\n\",\n \"file_path\": \"src/dft/parameter.rs\",\n \"rank\": 35,\n \"score\": 53983.01526303481\n },\n {\n \"content\": \" for id in segment_list {\\n\\n let segment = segment_map\\n\\n .get(id)\\n\\n .ok_or_else(|| ParameterError::ComponentsNotFound(id.to_string()))?;\\n\\n molarweight[i] += segment.molarweight;\\n\\n component_index.push(i);\\n\\n identifiers.push(id.clone());\\n\\n m.push(segment.model_record.m);\\n\\n sigma.push(segment.model_record.sigma);\\n\\n epsilon_k.push(segment.model_record.epsilon_k);\\n\\n\\n\\n if let (Some(k), Some(e)) = (\\n\\n segment.model_record.kappa_ab,\\n\\n segment.model_record.epsilon_k_ab,\\n\\n ) {\\n\\n assoc_segment.push(segment_index);\\n\\n kappa_ab.push(k);\\n\\n epsilon_k_ab.push(e);\\n\\n na.push(segment.model_record.na.unwrap_or(1.0));\\n\\n nb.push(segment.model_record.nb.unwrap_or(1.0));\\n\",\n \"file_path\": \"src/dft/parameter.rs\",\n \"rank\": 36,\n \"score\": 53981.47804219263\n },\n {\n \"content\": \" );\\n\\n }\\n\\n for (i, id1) in identifiers.iter().enumerate() {\\n\\n for (j, id2) in identifiers.iter().cloned().enumerate() {\\n\\n if component_index[i] != component_index[j] {\\n\\n if let Some(k) = binary_segment_records_map.get(&(id1.clone(), id2)) {\\n\\n k_ij[(i, j)] = *k;\\n\\n }\\n\\n }\\n\\n }\\n\\n }\\n\\n }\\n\\n\\n\\n // Combining rules dispersion\\n\\n let sigma_ij =\\n\\n Array2::from_shape_fn([sigma.len(); 2], |(i, j)| 0.5 * (sigma[i] + sigma[j]));\\n\\n let epsilon_k_ij = Array2::from_shape_fn([epsilon_k.len(); 2], |(i, j)| {\\n\\n (epsilon_k[i] * epsilon_k[j]).sqrt() * (1.0 - k_ij[(i, j)])\\n\\n });\\n\\n\\n\",\n \"file_path\": \"src/dft/parameter.rs\",\n \"rank\": 37,\n \"score\": 53981.39694829139\n },\n {\n \"content\": \"\\n\\n // Compare queried components and available components\\n\\n let available: IndexSet<String> = record_map\\n\\n .keys()\\n\\n .map(|identifier| identifier.to_string())\\n\\n .collect();\\n\\n if !queried.is_subset(&available) {\\n\\n let missing: Vec<String> = queried.difference(&available).cloned().collect();\\n\\n return Err(ParameterError::ComponentsNotFound(format!(\\\"{:?}\\\", missing)));\\n\\n };\\n\\n\\n\\n // Collect all pure records that were queried\\n\\n let chemical_records: Vec<_> = queried\\n\\n .iter()\\n\\n .filter_map(|identifier| record_map.remove(&identifier.clone()))\\n\\n .collect();\\n\\n\\n\\n // Read segment records\\n\\n let segment_records: Vec<SegmentRecord<GcPcSaftRecord, JobackRecord>> =\\n\\n serde_json::from_reader(BufReader::new(File::open(file_segments)?))?;\\n\",\n \"file_path\": \"src/dft/parameter.rs\",\n \"rank\": 38,\n \"score\": 53979.7830609994\n },\n {\n \"content\": \"#[pymodule]\\n\\npub fn feos_gc_pcsaft(py: Python<'_>, m: &PyModule) -> PyResult<()> {\\n\\n m.add_class::<PyIdentifier>()?;\\n\\n m.add_class::<Verbosity>()?;\\n\\n m.add_class::<Contributions>()?;\\n\\n m.add_class::<PyChemicalRecord>()?;\\n\\n m.add_class::<PyJobackRecord>()?;\\n\\n\\n\\n m.add_class::<PyGcPcSaftRecord>()?;\\n\\n m.add_class::<PySegmentRecord>()?;\\n\\n m.add_class::<PyBinaryRecord>()?;\\n\\n m.add_class::<PyBinarySegmentRecord>()?;\\n\\n m.add_class::<PyGcPcSaftEosParameters>()?;\\n\\n m.add_class::<PyGcPcSaftFunctionalParameters>()?;\\n\\n\\n\\n m.add_wrapped(wrap_pymodule!(eos))?;\\n\\n m.add_wrapped(wrap_pymodule!(dft))?;\\n\\n m.add_wrapped(wrap_pymodule!(quantity))?;\\n\\n\\n\\n py.run(\\n\\n \\\"\\\\\\n\",\n \"file_path\": \"build_wheel/src/lib.rs\",\n \"rank\": 39,\n \"score\": 52823.78508617848\n },\n {\n \"content\": \"use super::GcPcSaftFunctionalParameters;\\n\\nuse feos_core::EosError;\\n\\nuse feos_dft::fundamental_measure_theory::FMTProperties;\\n\\nuse feos_dft::{\\n\\n FunctionalContributionDual, WeightFunction, WeightFunctionInfo, WeightFunctionShape,\\n\\n};\\n\\nuse ndarray::*;\\n\\nuse num_dual::DualNum;\\n\\nuse petgraph::visit::EdgeRef;\\n\\nuse std::fmt;\\n\\nuse std::rc::Rc;\\n\\n\\n\\n#[derive(Clone)]\\n\\npub struct ChainFunctional {\\n\\n parameters: Rc<GcPcSaftFunctionalParameters>,\\n\\n}\\n\\n\\n\\nimpl ChainFunctional {\\n\\n pub fn new(parameters: &Rc<GcPcSaftFunctionalParameters>) -> Self {\\n\\n Self {\\n\",\n \"file_path\": \"src/dft/hard_chain.rs\",\n \"rank\": 40,\n \"score\": 52036.12840368779\n },\n {\n \"content\": \" parameters: parameters.clone(),\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\nimpl<N: DualNum<f64> + ScalarOperand> FunctionalContributionDual<N> for ChainFunctional {\\n\\n fn weight_functions(&self, temperature: N) -> WeightFunctionInfo<N> {\\n\\n let p = &self.parameters;\\n\\n let d = p.hs_diameter(temperature);\\n\\n WeightFunctionInfo::new(p.component_index(), true)\\n\\n .add(\\n\\n WeightFunction {\\n\\n prefactor: p.chain_length().mapv(|m| m.into()) / (&d * 8.0),\\n\\n kernel_radius: d.clone(),\\n\\n shape: WeightFunctionShape::Theta,\\n\\n },\\n\\n true,\\n\\n )\\n\\n .add(\\n\\n WeightFunction {\\n\",\n \"file_path\": \"src/dft/hard_chain.rs\",\n \"rank\": 41,\n \"score\": 52027.601744047264\n },\n {\n \"content\": \" .reduce(|acc, y| acc * y);\\n\\n if let Some(y) = y {\\n\\n phi -= &(y.map(N::ln) * rho_i * 0.5);\\n\\n }\\n\\n }\\n\\n\\n\\n Ok(phi)\\n\\n }\\n\\n}\\n\\n\\n\\nimpl fmt::Display for ChainFunctional {\\n\\n fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {\\n\\n write!(f, \\\"Hard chain functional (GC)\\\")\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/dft/hard_chain.rs\",\n \"rank\": 42,\n \"score\": 52024.27785337071\n },\n {\n \"content\": \" prefactor: p.chain_length().mapv(|m| (m / 8.0).into()),\\n\\n kernel_radius: d,\\n\\n shape: WeightFunctionShape::Theta,\\n\\n },\\n\\n true,\\n\\n )\\n\\n }\\n\\n\\n\\n fn calculate_helmholtz_energy_density(\\n\\n &self,\\n\\n temperature: N,\\n\\n weighted_densities: ArrayView2<N>,\\n\\n ) -> Result<Array1<N>, EosError> {\\n\\n let p = &self.parameters;\\n\\n // number of segments\\n\\n let segments = weighted_densities.shape()[0] - 2;\\n\\n\\n\\n // weighted densities\\n\\n let rho = weighted_densities.slice_axis(Axis(0), Slice::new(0, Some(segments as isize), 1));\\n\\n let zeta2 = weighted_densities.index_axis(Axis(0), segments);\\n\",\n \"file_path\": \"src/dft/hard_chain.rs\",\n \"rank\": 43,\n \"score\": 52019.36363803969\n },\n {\n \"content\": \" let zeta3 = weighted_densities.index_axis(Axis(0), segments + 1);\\n\\n\\n\\n // temperature dependent segment diameter\\n\\n let d = p.hs_diameter(temperature);\\n\\n\\n\\n // Helmholtz energy\\n\\n let frac_1mz3 = zeta3.mapv(|z3| (-z3 + 1.0).recip());\\n\\n let c = &zeta2 * &frac_1mz3 * &frac_1mz3;\\n\\n\\n\\n let mut phi = Array::zeros(zeta2.raw_dim());\\n\\n for i in p.bonds.node_indices() {\\n\\n let rho_i = rho.index_axis(Axis(0), i.index());\\n\\n let edges = p.bonds.edges(i);\\n\\n let y = edges\\n\\n .map(|e| {\\n\\n let di = d[e.source().index()];\\n\\n let dj = d[e.target().index()];\\n\\n let cdij = &c * di * dj / (di + dj);\\n\\n &frac_1mz3 + &cdij * 3.0 - &cdij * &cdij * (&zeta3 - 1.0) * 2.0\\n\\n })\\n\",\n \"file_path\": \"src/dft/hard_chain.rs\",\n \"rank\": 44,\n \"score\": 52019.09680155728\n },\n {\n \"content\": \"fn newton_step_cross_association<S, D: DualNum<f64> + ScalarOperand>(\\n\\n x: &mut Array1<D>,\\n\\n nassoc: usize,\\n\\n delta: &Array2<D>,\\n\\n na: &Array1<f64>,\\n\\n nb: &Array1<f64>,\\n\\n rho: &ArrayBase<S, Ix1>,\\n\\n tol: f64,\\n\\n) -> Result<bool, EosError>\\n\\nwhere\\n\\n S: Data<Elem = D>,\\n\\n{\\n\\n // gradient\\n\\n let mut g: Array1<D> = Array::zeros(2 * nassoc);\\n\\n // Hessian\\n\\n let mut h: Array2<D> = Array::zeros((2 * nassoc, 2 * nassoc));\\n\\n\\n\\n // slice arrays\\n\\n let (xa, xb) = x.multi_slice_mut((s![..nassoc], s![nassoc..]));\\n\\n let (mut ga, mut gb) = g.multi_slice_mut((s![..nassoc], s![nassoc..]));\\n\",\n \"file_path\": \"src/eos/association.rs\",\n \"rank\": 45,\n \"score\": 51341.76914057696\n },\n {\n \"content\": \"#[test]\\n\\n#[allow(non_snake_case)]\\n\\nfn test_bulk_implementation() -> Result<(), Box<dyn Error>> {\\n\\n // correct for different k_B in old code\\n\\n let KB_old = 1.38064852e-23 * JOULE / KELVIN;\\n\\n let NAV_old = 6.022140857e23 / MOL;\\n\\n\\n\\n let parameters = GcPcSaftEosParameters::from_json_segments(\\n\\n &[\\\"propane\\\"],\\n\\n \\\"parameters/gc_substances.json\\\",\\n\\n \\\"parameters/sauer2014_hetero.json\\\",\\n\\n None,\\n\\n IdentifierOption::Name,\\n\\n )\\n\\n .unwrap();\\n\\n\\n\\n let parameters_func = GcPcSaftFunctionalParameters::from_json_segments(\\n\\n &[\\\"propane\\\"],\\n\\n \\\"parameters/gc_substances.json\\\",\\n\\n \\\"parameters/sauer2014_hetero.json\\\",\\n\\n None,\\n\\n IdentifierOption::Name,\\n\",\n \"file_path\": \"tests/dft.rs\",\n \"rank\": 46,\n \"score\": 50042.005575220304\n },\n {\n \"content\": \"#[test]\\n\\nfn test_binary() -> EosResult<()> {\\n\\n let parameters = GcPcSaftEosParameters::from_json_segments(\\n\\n &[\\\"ethanol\\\", \\\"methanol\\\"],\\n\\n \\\"parameters/gc_substances.json\\\",\\n\\n \\\"parameters/sauer2014_hetero.json\\\",\\n\\n None,\\n\\n IdentifierOption::Name,\\n\\n )\\n\\n .unwrap();\\n\\n let parameters_func = GcPcSaftFunctionalParameters::from_json_segments(\\n\\n &[\\\"ethanol\\\", \\\"methanol\\\"],\\n\\n \\\"parameters/gc_substances.json\\\",\\n\\n \\\"parameters/sauer2014_hetero.json\\\",\\n\\n None,\\n\\n IdentifierOption::Name,\\n\\n )\\n\\n .unwrap();\\n\\n let eos = Rc::new(GcPcSaft::new(Rc::new(parameters)));\\n\\n let func = Rc::new(GcPcSaftFunctional::new(Rc::new(parameters_func)));\\n\\n let moles = arr1(&[0.5, 0.5]) * MOL;\\n\",\n \"file_path\": \"tests/binary.rs\",\n \"rank\": 47,\n \"score\": 35847.425916787724\n },\n {\n \"content\": \"fn zeta_23<D: DualNum<f64>>(\\n\\n parameters: &GcPcSaftEosParameters,\\n\\n diameter: &Array1<D>,\\n\\n molefracs: &Array1<D>,\\n\\n) -> D {\\n\\n let mut zeta: [D; 2] = [D::zero(); 2];\\n\\n for i in 0..parameters.m.len() {\\n\\n for (k, z) in zeta.iter_mut().enumerate() {\\n\\n *z += molefracs[parameters.component_index[i]]\\n\\n * diameter[i].powi((k + 2) as i32)\\n\\n * (FRAC_PI_6 * parameters.m[i]);\\n\\n }\\n\\n }\\n\\n\\n\\n zeta[0] / zeta[1]\\n\\n}\\n\\n\\n\\n#[cfg(test)]\\n\\nmod test {\\n\\n use super::*;\\n\",\n \"file_path\": \"src/eos/hard_sphere.rs\",\n \"rank\": 48,\n \"score\": 30963.842916804453\n },\n {\n \"content\": \"#![allow(clippy::excessive_precision)]\\n\\nuse approx::assert_relative_eq;\\n\\nuse feos_core::parameter::IdentifierOption;\\n\\nuse feos_core::{PhaseEquilibrium, State, StateBuilder, Verbosity};\\n\\nuse feos_dft::adsorption::{ExternalPotential, Pore1D, PoreSpecification};\\n\\nuse feos_dft::interface::PlanarInterface;\\n\\nuse feos_dft::{DFTSolver, Geometry};\\n\\nuse feos_gc_pcsaft::{\\n\\n GcPcSaft, GcPcSaftEosParameters, GcPcSaftFunctional, GcPcSaftFunctionalParameters,\\n\\n};\\n\\nuse ndarray::arr1;\\n\\nuse quantity::si::*;\\n\\nuse std::error::Error;\\n\\nuse std::rc::Rc;\\n\\n\\n\\n#[test]\\n\\n#[allow(non_snake_case)]\\n\",\n \"file_path\": \"tests/dft.rs\",\n \"rank\": 49,\n \"score\": 28338.399176851246\n },\n {\n \"content\": \" )\\n\\n .unwrap();\\n\\n\\n\\n let eos = Rc::new(GcPcSaft::new(Rc::new(parameters)));\\n\\n let func = Rc::new(GcPcSaftFunctional::new(Rc::new(parameters_func)));\\n\\n let t = 200.0 * KELVIN;\\n\\n let v = 0.002 * METER.powi(3) * NAV / NAV_old;\\n\\n let n = arr1(&[1.5]) * MOL;\\n\\n let state_eos = State::new_nvt(&eos, t, v, &n)?;\\n\\n let state_func = State::new_nvt(&func, t, v, &n)?;\\n\\n let p_eos = state_eos.pressure_contributions();\\n\\n let p_func = state_func.pressure_contributions();\\n\\n\\n\\n println!(\\\"{:29}: {}\\\", p_eos[0].0, p_eos[0].1);\\n\\n println!(\\\"{:29}: {}\\\", p_func[0].0, p_func[0].1);\\n\\n println!();\\n\\n println!(\\\"{:29}: {}\\\", p_eos[1].0, p_eos[1].1);\\n\\n println!(\\\"{:29}: {}\\\", p_func[1].0, p_func[1].1);\\n\\n println!();\\n\\n println!(\\\"{:29}: {}\\\", p_eos[2].0, p_eos[2].1);\\n\",\n \"file_path\": \"tests/dft.rs\",\n \"rank\": 50,\n \"score\": 28333.66882890873\n },\n {\n \"content\": \" let profile = PlanarInterface::from_tanh(&vle, points, w, tc)?.solve(None)?;\\n\\n println!(\\n\\n \\\"hetero {} {} {}\\\",\\n\\n profile.surface_tension.unwrap(),\\n\\n vle.vapor().density,\\n\\n vle.liquid().density,\\n\\n );\\n\\n\\n\\n assert_relative_eq!(\\n\\n vle.vapor().density,\\n\\n 12.8820179191167643 * MOL / METER.powi(3) * NAV_old / NAV,\\n\\n max_relative = 1e-13,\\n\\n );\\n\\n\\n\\n assert_relative_eq!(\\n\\n vle.liquid().density,\\n\\n 13.2705903446123212 * KILO * MOL / METER.powi(3) * NAV_old / NAV,\\n\\n max_relative = 1e-13,\\n\\n );\\n\\n\\n\\n assert_relative_eq!(\\n\\n profile.surface_tension.unwrap(),\\n\\n 21.1478901897016272 * MILLI * NEWTON / METER * KB / KB_old,\\n\\n max_relative = 6e-5,\\n\\n );\\n\\n Ok(())\\n\\n}\\n\\n\\n\",\n \"file_path\": \"tests/dft.rs\",\n \"rank\": 51,\n \"score\": 28329.432866228326\n },\n {\n \"content\": \" vle.liquid().density,\\n\\n );\\n\\n\\n\\n let solver = DFTSolver::new(Verbosity::Iter)\\n\\n .picard_iteration(None)\\n\\n .beta(0.05)\\n\\n .tol(1e-5)\\n\\n .anderson_mixing(None);\\n\\n let bulk = StateBuilder::new(&func)\\n\\n .temperature(t)\\n\\n .pressure(5.0 * BAR)\\n\\n .build()?;\\n\\n Pore1D::new(\\n\\n Geometry::Cartesian,\\n\\n 20.0 * ANGSTROM,\\n\\n ExternalPotential::LJ93 {\\n\\n epsilon_k_ss: 10.0,\\n\\n sigma_ss: 3.0,\\n\\n rho_s: 0.08,\\n\\n },\\n\\n None,\\n\\n None,\\n\\n )\\n\\n .initialize(&bulk, None, None)?\\n\\n .solve(Some(&solver))?;\\n\\n Ok(())\\n\\n}\\n\",\n \"file_path\": \"tests/dft.rs\",\n \"rank\": 52,\n \"score\": 28328.814111580137\n },\n {\n \"content\": \" assert_relative_eq!(\\n\\n p_eos[3].1,\\n\\n -763.2289230004602132 * KILO * PASCAL * KB / KB_old,\\n\\n max_relative = 1e-14,\\n\\n );\\n\\n\\n\\n assert_relative_eq!(\\n\\n p_func[0].1,\\n\\n 1.2471689792172869 * MEGA * PASCAL * KB / KB_old,\\n\\n max_relative = 1e-14,\\n\\n );\\n\\n assert_relative_eq!(\\n\\n p_func[1].1,\\n\\n 280.0635060891395938 * KILO * PASCAL * KB / KB_old,\\n\\n max_relative = 1e-14,\\n\\n );\\n\\n assert_relative_eq!(\\n\\n p_func[2].1,\\n\\n -141.9023918353318550 * KILO * PASCAL * KB / KB_old,\\n\\n max_relative = 1e-14,\\n\\n );\\n\\n assert_relative_eq!(\\n\\n p_func[3].1,\\n\\n -763.2289230004602132 * KILO * PASCAL * KB / KB_old,\\n\\n max_relative = 1e-14,\\n\\n );\\n\\n Ok(())\\n\\n}\\n\\n\\n\",\n \"file_path\": \"tests/dft.rs\",\n \"rank\": 53,\n \"score\": 28326.675850657615\n },\n {\n \"content\": \" println!(\\\"{:29}: {}\\\", p_func[2].0, p_func[2].1);\\n\\n println!();\\n\\n println!(\\\"{:29}: {}\\\", p_eos[3].0, p_eos[3].1);\\n\\n println!(\\\"{:29}: {}\\\", p_func[3].0, p_func[3].1);\\n\\n\\n\\n assert_relative_eq!(\\n\\n p_eos[0].1,\\n\\n 1.2471689792172869 * MEGA * PASCAL * KB / KB_old,\\n\\n max_relative = 1e-14,\\n\\n );\\n\\n assert_relative_eq!(\\n\\n p_eos[1].1,\\n\\n 280.0635060891395938 * KILO * PASCAL * KB / KB_old,\\n\\n max_relative = 1e-14,\\n\\n );\\n\\n assert_relative_eq!(\\n\\n p_eos[2].1,\\n\\n -141.9023918353318550 * KILO * PASCAL * KB / KB_old,\\n\\n max_relative = 1e-14,\\n\\n );\\n\",\n \"file_path\": \"tests/dft.rs\",\n \"rank\": 54,\n \"score\": 28326.675850657615\n },\n {\n \"content\": \"use feos_core::joback::Joback;\\n\\nuse feos_core::{EquationOfState, HelmholtzEnergy, IdealGasContribution, MolarWeight};\\n\\nuse ndarray::Array1;\\n\\nuse quantity::si::*;\\n\\nuse std::f64::consts::FRAC_PI_6;\\n\\nuse std::rc::Rc;\\n\\n\\n\\npub(crate) mod association;\\n\\npub(crate) mod dispersion;\\n\\nmod hard_chain;\\n\\nmod hard_sphere;\\n\\nmod parameter;\\n\\nmod polar;\\n\\nuse association::{Association, CrossAssociation};\\n\\nuse dispersion::Dispersion;\\n\\nuse hard_chain::HardChain;\\n\\nuse hard_sphere::HardSphere;\\n\\npub use parameter::GcPcSaftEosParameters;\\n\\nuse polar::Dipole;\\n\\n\\n\",\n \"file_path\": \"src/eos/mod.rs\",\n \"rank\": 55,\n \"score\": 28104.50636544062\n },\n {\n \"content\": \"\\n\\n/// gc-PC-SAFT equation of state\\n\\npub struct GcPcSaft {\\n\\n pub parameters: Rc<GcPcSaftEosParameters>,\\n\\n options: GcPcSaftOptions,\\n\\n contributions: Vec<Box<dyn HelmholtzEnergy>>,\\n\\n joback: Joback,\\n\\n}\\n\\n\\n\\nimpl GcPcSaft {\\n\\n pub fn new(parameters: Rc<GcPcSaftEosParameters>) -> Self {\\n\\n Self::with_options(parameters, GcPcSaftOptions::default())\\n\\n }\\n\\n\\n\\n pub fn with_options(parameters: Rc<GcPcSaftEosParameters>, options: GcPcSaftOptions) -> Self {\\n\\n let mut contributions: Vec<Box<dyn HelmholtzEnergy>> = Vec::with_capacity(7);\\n\\n contributions.push(Box::new(HardSphere {\\n\\n parameters: parameters.clone(),\\n\\n }));\\n\\n contributions.push(Box::new(HardChain {\\n\",\n \"file_path\": \"src/eos/mod.rs\",\n \"rank\": 56,\n \"score\": 28103.698213446954\n },\n {\n \"content\": \" parameters: parameters.clone(),\\n\\n }));\\n\\n contributions.push(Box::new(Dispersion {\\n\\n parameters: parameters.clone(),\\n\\n }));\\n\\n match parameters.assoc_segment.len() {\\n\\n 0 => (),\\n\\n 1 => contributions.push(Box::new(Association {\\n\\n parameters: parameters.clone(),\\n\\n })),\\n\\n _ => contributions.push(Box::new(CrossAssociation {\\n\\n parameters: parameters.clone(),\\n\\n max_iter: options.max_iter_cross_assoc,\\n\\n tol: options.tol_cross_assoc,\\n\\n })),\\n\\n };\\n\\n if !parameters.dipole_comp.is_empty() {\\n\\n contributions.push(Box::new(Dipole::new(¶meters)))\\n\\n }\\n\\n Self {\\n\",\n \"file_path\": \"src/eos/mod.rs\",\n \"rank\": 57,\n \"score\": 28101.138316418128\n },\n {\n \"content\": \"/// Customization options for the gc-PC-SAFT equation of state and functional.\\n\\n#[derive(Copy, Clone)]\\n\\npub struct GcPcSaftOptions {\\n\\n /// maximum packing fraction\\n\\n pub max_eta: f64,\\n\\n /// maximum number of iterations for cross association calculation\\n\\n pub max_iter_cross_assoc: usize,\\n\\n /// tolerance for cross association calculation\\n\\n pub tol_cross_assoc: f64,\\n\\n}\\n\\n\\n\\nimpl Default for GcPcSaftOptions {\\n\\n fn default() -> Self {\\n\\n Self {\\n\\n max_eta: 0.5,\\n\\n max_iter_cross_assoc: 50,\\n\\n tol_cross_assoc: 1e-10,\\n\\n }\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/eos/mod.rs\",\n \"rank\": 58,\n \"score\": 28100.08573216219\n },\n {\n \"content\": \" parameters: parameters.clone(),\\n\\n options,\\n\\n contributions,\\n\\n joback: parameters.joback_records.clone().map_or_else(\\n\\n || Joback::default(parameters.chemical_records.len()),\\n\\n Joback::new,\\n\\n ),\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\nimpl EquationOfState for GcPcSaft {\\n\\n fn components(&self) -> usize {\\n\\n self.parameters.molarweight.len()\\n\\n }\\n\\n\\n\\n fn subset(&self, component_list: &[usize]) -> Self {\\n\\n Self::with_options(\\n\\n Rc::new(self.parameters.subset(component_list)),\\n\\n self.options,\\n\",\n \"file_path\": \"src/eos/mod.rs\",\n \"rank\": 59,\n \"score\": 28097.207383151548\n },\n {\n \"content\": \"use crate::dft::GcPcSaftFunctionalParameters;\\n\\nuse crate::eos::GcPcSaftEosParameters;\\n\\nuse crate::record::GcPcSaftRecord;\\n\\nuse feos_core::joback::JobackRecord;\\n\\nuse feos_core::parameter::{BinaryRecord, IdentifierOption, ParameterError, SegmentRecord};\\n\\nuse feos_core::python::joback::PyJobackRecord;\\n\\nuse feos_core::python::parameter::{PyBinarySegmentRecord, PyChemicalRecord};\\n\\nuse feos_core::{impl_json_handling, impl_parameter_from_segments, impl_segment_record};\\n\\nuse numpy::{PyArray2, ToPyArray};\\n\\nuse pyo3::prelude::*;\\n\\nuse std::convert::TryFrom;\\n\\nuse std::rc::Rc;\\n\\n\\n\\n#[cfg(feature = \\\"micelles\\\")]\\n\\nmod micelles;\\n\\n\\n\\n#[pyclass(name = \\\"GcPcSaftRecord\\\", unsendable)]\\n\\n#[pyo3(\\n\\n text_signature = \\\"(m, sigma, epsilon_k, mu=None, q=None, kappa_ab=None, epsilon_k_ab=None, na=None, nb=None)\\\"\\n\\n)]\\n\",\n \"file_path\": \"src/python/mod.rs\",\n \"rank\": 60,\n \"score\": 28096.060249098544\n },\n {\n \"content\": \" )\\n\\n }\\n\\n\\n\\n fn compute_max_density(&self, moles: &Array1<f64>) -> f64 {\\n\\n let p = &self.parameters;\\n\\n let moles_segments: Array1<f64> = p.component_index.iter().map(|&i| moles[i]).collect();\\n\\n self.options.max_eta * moles.sum()\\n\\n / (FRAC_PI_6 * &p.m * p.sigma.mapv(|v| v.powi(3)) * moles_segments).sum()\\n\\n }\\n\\n\\n\\n fn residual(&self) -> &[Box<dyn HelmholtzEnergy>] {\\n\\n &self.contributions\\n\\n }\\n\\n\\n\\n fn ideal_gas(&self) -> &dyn IdealGasContribution {\\n\\n &self.joback\\n\\n }\\n\\n}\\n\\n\\n\\nimpl MolarWeight<SIUnit> for GcPcSaft {\\n\\n fn molar_weight(&self) -> SIArray1 {\\n\\n self.parameters.molarweight.clone() * GRAM / MOL\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/eos/mod.rs\",\n \"rank\": 61,\n \"score\": 28095.59055925874\n },\n {\n \"content\": \"#[derive(Clone)]\\n\\npub struct PyGcPcSaftRecord(GcPcSaftRecord);\\n\\n\\n\\n#[pymethods]\\n\\nimpl PyGcPcSaftRecord {\\n\\n #[new]\\n\\n fn new(\\n\\n m: f64,\\n\\n sigma: f64,\\n\\n epsilon_k: f64,\\n\\n mu: Option<f64>,\\n\\n kappa_ab: Option<f64>,\\n\\n epsilon_k_ab: Option<f64>,\\n\\n na: Option<f64>,\\n\\n nb: Option<f64>,\\n\\n psi_dft: Option<f64>,\\n\\n ) -> Self {\\n\\n Self(GcPcSaftRecord::new(\\n\\n m,\\n\\n sigma,\\n\",\n \"file_path\": \"src/python/mod.rs\",\n \"rank\": 62,\n \"score\": 28095.27343861241\n },\n {\n \"content\": \" Ok(self.0.to_string())\\n\\n }\\n\\n}\\n\\n\\n\\n#[pyclass(name = \\\"GcPcSaftFunctionalParameters\\\", unsendable)]\\n\\n#[pyo3(\\n\\n text_signature = \\\"(pure_records, segmentbinary_records=None, substances=None, search_option='Name')\\\"\\n\\n)]\\n\\n#[derive(Clone)]\\n\\npub struct PyGcPcSaftFunctionalParameters(pub Rc<GcPcSaftFunctionalParameters>);\\n\\n\\n\\nimpl_parameter_from_segments!(GcPcSaftFunctionalParameters, PyGcPcSaftFunctionalParameters);\\n\\n\\n\\n#[pymethods]\\n\\nimpl PyGcPcSaftFunctionalParameters {\\n\\n fn _repr_markdown_(&self) -> String {\\n\\n self.0.to_markdown()\\n\\n }\\n\\n\\n\\n #[getter]\\n\",\n \"file_path\": \"src/python/mod.rs\",\n \"rank\": 63,\n \"score\": 28093.261698747672\n },\n {\n \"content\": \" JobackRecord,\\n\\n PyJobackRecord\\n\\n);\\n\\n\\n\\n#[pyclass(name = \\\"GcPcSaftEosParameters\\\", unsendable)]\\n\\n#[pyo3(\\n\\n text_signature = \\\"(pure_records, segmentbinary_records=None, substances=None, search_option='Name')\\\"\\n\\n)]\\n\\n#[derive(Clone)]\\n\\npub struct PyGcPcSaftEosParameters(pub Rc<GcPcSaftEosParameters>);\\n\\n\\n\\nimpl_parameter_from_segments!(GcPcSaftEosParameters, PyGcPcSaftEosParameters);\\n\\n\\n\\n#[pymethods]\\n\\nimpl PyGcPcSaftEosParameters {\\n\\n fn _repr_markdown_(&self) -> String {\\n\\n self.0.to_markdown()\\n\\n }\\n\\n\\n\\n fn __repr__(&self) -> PyResult<String> {\\n\",\n \"file_path\": \"src/python/mod.rs\",\n \"rank\": 64,\n \"score\": 28092.950430101893\n },\n {\n \"content\": \" epsilon_k,\\n\\n mu,\\n\\n kappa_ab,\\n\\n epsilon_k_ab,\\n\\n na,\\n\\n nb,\\n\\n psi_dft,\\n\\n ))\\n\\n }\\n\\n\\n\\n fn __repr__(&self) -> PyResult<String> {\\n\\n Ok(self.0.to_string())\\n\\n }\\n\\n}\\n\\n\\n\\nimpl_json_handling!(PyGcPcSaftRecord);\\n\\n\\n\\nimpl_segment_record!(\\n\\n GcPcSaftRecord,\\n\\n PyGcPcSaftRecord,\\n\",\n \"file_path\": \"src/python/mod.rs\",\n \"rank\": 65,\n \"score\": 28088.10590629121\n },\n {\n \"content\": \" fn get_graph(&self, py: Python) -> PyResult<PyObject> {\\n\\n let fun: Py<PyAny> = PyModule::from_code(\\n\\n py,\\n\\n \\\"def f(s): \\n\\n import graphviz\\n\\n return graphviz.Source(s.replace('\\\\\\\\\\\\\\\\\\\\\\\"', ''))\\\",\\n\\n \\\"\\\",\\n\\n \\\"\\\",\\n\\n )?\\n\\n .getattr(\\\"f\\\")?\\n\\n .into();\\n\\n fun.call1(py, (self.0.graph(),))\\n\\n }\\n\\n\\n\\n #[getter]\\n\\n fn get_k_ij<'py>(&self, py: Python<'py>) -> &'py PyArray2<f64> {\\n\\n self.0.k_ij.view().to_pyarray(py)\\n\\n }\\n\\n\\n\\n fn __repr__(&self) -> PyResult<String> {\\n\\n Ok(self.0.to_string())\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/python/mod.rs\",\n \"rank\": 66,\n \"score\": 28082.512211614587\n },\n {\n \"content\": \"use super::hard_sphere::zeta;\\n\\nuse super::GcPcSaftEosParameters;\\n\\nuse feos_core::{EosError, HelmholtzEnergyDual, StateHD};\\n\\nuse ndarray::*;\\n\\nuse num_dual::linalg::{norm, LU};\\n\\nuse num_dual::*;\\n\\nuse std::fmt;\\n\\nuse std::rc::Rc;\\n\\n\\n\\n#[derive(Clone)]\\n\\npub struct Association {\\n\\n pub parameters: Rc<GcPcSaftEosParameters>,\\n\\n}\\n\\n\\n\\n#[derive(Clone)]\\n\\npub struct CrossAssociation {\\n\\n pub parameters: Rc<GcPcSaftEosParameters>,\\n\\n pub max_iter: usize,\\n\\n pub tol: f64,\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/eos/association.rs\",\n \"rank\": 67,\n \"score\": 27769.26177979532\n },\n {\n \"content\": \"impl<D: DualNum<f64>> HelmholtzEnergyDual<D> for Association {\\n\\n fn helmholtz_energy(&self, state: &StateHD<D>) -> D {\\n\\n let p = &self.parameters;\\n\\n let c = p.component_index[p.assoc_segment[0]];\\n\\n\\n\\n // temperature dependent segment diameter\\n\\n let diameter = p.hs_diameter(state.temperature);\\n\\n\\n\\n // Packing fractions\\n\\n let n2 = zeta(p, &diameter, &state.partial_density, [2])[0] * 6.0;\\n\\n let n3 = zeta(p, &diameter, &state.partial_density, [3])[0];\\n\\n let n3i = (-n3 + 1.0).recip();\\n\\n\\n\\n // association strength\\n\\n let deltarho = association_strength(\\n\\n &p.assoc_segment,\\n\\n &p.sigma3_kappa_aibj,\\n\\n &p.epsilon_k_aibj,\\n\\n state.temperature,\\n\\n &diameter,\\n\",\n \"file_path\": \"src/eos/association.rs\",\n \"rank\": 68,\n \"score\": 27766.980352861596\n },\n {\n \"content\": \" }\\n\\n\\n\\n // Newton step\\n\\n x.assign(&(&*x - &LU::new(h)?.solve(&g)));\\n\\n\\n\\n // check convergence\\n\\n Ok(norm(&g.map(D::re)) < tol)\\n\\n}\\n\\n\\n\\n#[cfg(test)]\\n\\nmod test {\\n\\n use super::*;\\n\\n use crate::eos::parameter::test::*;\\n\\n use approx::assert_relative_eq;\\n\\n use feos_core::EosUnit;\\n\\n use ndarray::arr1;\\n\\n use num_dual::Dual64;\\n\\n use quantity::si::{METER, MOL, PASCAL};\\n\\n\\n\\n #[test]\\n\",\n \"file_path\": \"src/eos/association.rs\",\n \"rank\": 69,\n \"score\": 27766.04092220018\n },\n {\n \"content\": \" state.moles[c] * p.n[0] * (xa.ln() - xa * 0.5 + 0.5) * na\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\nimpl fmt::Display for Association {\\n\\n fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {\\n\\n write!(f, \\\"Association\\\")\\n\\n }\\n\\n}\\n\\n\\n\\npub(crate) fn assoc_site_frac_ab<D: DualNum<f64>>(deltarho: D, na: f64, nb: f64) -> D {\\n\\n if deltarho.re() > f64::EPSILON.sqrt() {\\n\\n (((deltarho * (na - nb) + 1.0).powi(2) + deltarho * nb * 4.0).sqrt()\\n\\n - (deltarho * (nb - na) + 1.0))\\n\\n / (deltarho * na * 2.0)\\n\\n } else {\\n\\n D::one() + deltarho * nb * (deltarho * (nb + na) - 1.0)\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/eos/association.rs\",\n \"rank\": 70,\n \"score\": 27765.981538662836\n },\n {\n \"content\": \"\\n\\npub(crate) fn assoc_site_frac_a<D: DualNum<f64>>(deltarho: D, na: f64) -> D {\\n\\n if deltarho.re() > f64::EPSILON.sqrt() {\\n\\n ((deltarho * na * 4.0 + 1.0).powi(2) - 1.0).sqrt() / (deltarho * na * 2.0)\\n\\n } else {\\n\\n D::one() + deltarho * na * (deltarho * na * 2.0 - 1.0)\\n\\n }\\n\\n}\\n\\n\\n\\nimpl<D: DualNum<f64> + ScalarOperand> HelmholtzEnergyDual<D> for CrossAssociation {\\n\\n fn helmholtz_energy(&self, state: &StateHD<D>) -> D {\\n\\n let p = &self.parameters;\\n\\n\\n\\n // temperature dependent segment diameter\\n\\n let diameter = p.hs_diameter(state.temperature);\\n\\n\\n\\n // Packing fractions\\n\\n let n2 = zeta(p, &diameter, &state.partial_density, [2])[0] * 6.0;\\n\\n let n3 = zeta(p, &diameter, &state.partial_density, [3])[0];\\n\\n let n3i = (-n3 + 1.0).recip();\\n\",\n \"file_path\": \"src/eos/association.rs\",\n \"rank\": 71,\n \"score\": 27765.421098022092\n },\n {\n \"content\": \"\\n\\n #[test]\\n\\n fn test_cross_assoc_propanol() {\\n\\n let parameters = propanol();\\n\\n let contrib = CrossAssociation {\\n\\n parameters: Rc::new(parameters),\\n\\n max_iter: 50,\\n\\n tol: 1e-10,\\n\\n };\\n\\n let temperature = 300.0;\\n\\n let volume = METER\\n\\n .powi(3)\\n\\n .to_reduced(EosUnit::reference_volume())\\n\\n .unwrap();\\n\\n let moles = (1.5 * MOL).to_reduced(EosUnit::reference_moles()).unwrap();\\n\\n let state = StateHD::new(\\n\\n Dual64::from_re(temperature),\\n\\n Dual64::from_re(volume).derive(),\\n\\n arr1(&[Dual64::from_re(moles)]),\\n\\n );\\n\",\n \"file_path\": \"src/eos/association.rs\",\n \"rank\": 72,\n \"score\": 27765.022587574662\n },\n {\n \"content\": \" // check if density is close to 0\\n\\n if density.sum().re() < f64::EPSILON {\\n\\n if let Some(x0) = x0 {\\n\\n x0.fill(1.0);\\n\\n }\\n\\n return Ok(D::zero());\\n\\n }\\n\\n\\n\\n // number of associating segments\\n\\n let nassoc = assoc_segment.len();\\n\\n\\n\\n // association strength\\n\\n let delta = Array::from_shape_fn([nassoc; 2], |(i, j)| {\\n\\n association_strength(\\n\\n assoc_segment,\\n\\n sigma3_kappa_aibj,\\n\\n epsilon_k_aibj,\\n\\n temperature,\\n\\n diameter,\\n\\n n2,\\n\",\n \"file_path\": \"src/eos/association.rs\",\n \"rank\": 73,\n \"score\": 27764.6160833371\n },\n {\n \"content\": \" let pressure =\\n\\n -contrib.helmholtz_energy(&state).eps[0] * temperature * EosUnit::reference_pressure();\\n\\n assert_relative_eq!(pressure, -3.6819598891967344 * PASCAL, max_relative = 1e-10);\\n\\n }\\n\\n\\n\\n #[test]\\n\\n fn test_cross_assoc_ethanol_propanol() {\\n\\n let parameters = ethanol_propanol(false);\\n\\n let contrib = CrossAssociation {\\n\\n parameters: Rc::new(parameters),\\n\\n max_iter: 50,\\n\\n tol: 1e-10,\\n\\n };\\n\\n let temperature = 300.0;\\n\\n let volume = METER\\n\\n .powi(3)\\n\\n .to_reduced(EosUnit::reference_volume())\\n\\n .unwrap();\\n\\n let moles = (arr1(&[1.5, 2.5]) * MOL)\\n\\n .to_reduced(EosUnit::reference_moles())\\n\",\n \"file_path\": \"src/eos/association.rs\",\n \"rank\": 74,\n \"score\": 27764.60491697488\n },\n {\n \"content\": \" self.tol,\\n\\n None,\\n\\n )\\n\\n .unwrap_or_else(|_| D::from(std::f64::NAN))\\n\\n * state.volume\\n\\n }\\n\\n}\\n\\n\\n\\nimpl fmt::Display for CrossAssociation {\\n\\n fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {\\n\\n write!(f, \\\"Cross-association\\\")\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/eos/association.rs\",\n \"rank\": 75,\n \"score\": 27764.45907335196\n },\n {\n \"content\": \" fn test_assoc_propanol() {\\n\\n let parameters = propanol();\\n\\n let contrib = Association {\\n\\n parameters: Rc::new(parameters),\\n\\n };\\n\\n let temperature = 300.0;\\n\\n let volume = METER\\n\\n .powi(3)\\n\\n .to_reduced(EosUnit::reference_volume())\\n\\n .unwrap();\\n\\n let moles = (1.5 * MOL).to_reduced(EosUnit::reference_moles()).unwrap();\\n\\n let state = StateHD::new(\\n\\n Dual64::from_re(temperature),\\n\\n Dual64::from_re(volume).derive(),\\n\\n arr1(&[Dual64::from_re(moles)]),\\n\\n );\\n\\n let pressure =\\n\\n -contrib.helmholtz_energy(&state).eps[0] * temperature * EosUnit::reference_pressure();\\n\\n assert_relative_eq!(pressure, -3.6819598891967344 * PASCAL, max_relative = 1e-10);\\n\\n }\\n\",\n \"file_path\": \"src/eos/association.rs\",\n \"rank\": 76,\n \"score\": 27764.224295553755\n },\n {\n \"content\": \"\\n\\n // extract densities of associating segments\\n\\n let rho_assoc = p\\n\\n .assoc_segment\\n\\n .mapv(|a| state.partial_density[p.component_index[a]])\\n\\n * &p.n;\\n\\n\\n\\n helmholtz_energy_density_cross_association(\\n\\n &p.assoc_segment,\\n\\n &p.sigma3_kappa_aibj,\\n\\n &p.epsilon_k_aibj,\\n\\n &p.na,\\n\\n &p.nb,\\n\\n state.temperature,\\n\\n &rho_assoc,\\n\\n &diameter,\\n\\n n2,\\n\\n n3i,\\n\\n D::one(),\\n\\n self.max_iter,\\n\",\n \"file_path\": \"src/eos/association.rs\",\n \"rank\": 77,\n \"score\": 27762.59039182737\n },\n {\n \"content\": \" n2,\\n\\n n3i,\\n\\n D::one(),\\n\\n 0,\\n\\n 0,\\n\\n ) * state.partial_density[c];\\n\\n\\n\\n let na = p.na[0];\\n\\n let nb = p.nb[0];\\n\\n if nb > 0.0 {\\n\\n // no cross association, two association sites\\n\\n let xa = assoc_site_frac_ab(deltarho, na, nb);\\n\\n let xb = (xa - 1.0) * (na / nb) + 1.0;\\n\\n state.moles[c]\\n\\n * p.n[0]\\n\\n * ((xa.ln() - xa * 0.5 + 0.5) * na + (xb.ln() - xb * 0.5 + 0.5) * nb)\\n\\n } else {\\n\\n // no cross association, one association site\\n\\n let xa = assoc_site_frac_a(deltarho, na);\\n\\n\\n\",\n \"file_path\": \"src/eos/association.rs\",\n \"rank\": 78,\n \"score\": 27762.19838975217\n },\n {\n \"content\": \" n3i,\\n\\n xi,\\n\\n i,\\n\\n j,\\n\\n )\\n\\n });\\n\\n\\n\\n // cross-association according to Michelsen2006\\n\\n // initialize monomer fraction\\n\\n let mut x = match &x0 {\\n\\n Some(x0) => (*x0).clone(),\\n\\n None => Array::from_elem(2 * nassoc, 0.2),\\n\\n };\\n\\n\\n\\n for k in 0..max_iter {\\n\\n if newton_step_cross_association::<_, f64>(\\n\\n &mut x,\\n\\n nassoc,\\n\\n &delta.map(D::re),\\n\\n na,\\n\",\n \"file_path\": \"src/eos/association.rs\",\n \"rank\": 79,\n \"score\": 27762.08743942443\n },\n {\n \"content\": \" nb,\\n\\n &density.map(D::re),\\n\\n tol,\\n\\n )? {\\n\\n break;\\n\\n }\\n\\n if k == max_iter - 1 {\\n\\n return Err(EosError::NotConverged(\\\"Cross association\\\".into()));\\n\\n }\\n\\n }\\n\\n\\n\\n // calculate derivatives\\n\\n let mut x_dual = x.mapv(D::from);\\n\\n for _ in 0..D::NDERIV {\\n\\n newton_step_cross_association(&mut x_dual, nassoc, &delta, na, nb, density, tol)?;\\n\\n }\\n\\n\\n\\n // save monomer fraction\\n\\n if let Some(x0) = x0 {\\n\\n *x0 = x;\\n\\n }\\n\\n\\n\\n // Helmholtz energy density\\n\\n let xa = x_dual.slice(s![..nassoc]);\\n\\n let xb = x_dual.slice(s![nassoc..]);\\n\\n let f = |x: D| x.ln() - x * 0.5 + 0.5;\\n\\n Ok((density * (xa.mapv(f) * na + xb.mapv(f) * nb)).sum())\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/eos/association.rs\",\n \"rank\": 80,\n \"score\": 27760.92811335769\n },\n {\n \"content\": \" let (mut haa, mut hab, mut hba, mut hbb) = h.multi_slice_mut((\\n\\n s![..nassoc, ..nassoc],\\n\\n s![..nassoc, nassoc..],\\n\\n s![nassoc.., ..nassoc],\\n\\n s![nassoc.., nassoc..],\\n\\n ));\\n\\n\\n\\n // calculate gradients and approximate Hessian\\n\\n for i in 0..nassoc {\\n\\n let d = &delta.index_axis(Axis(0), i) * rho;\\n\\n\\n\\n let dnx = (&xb * nb * &d).sum() + 1.0;\\n\\n ga[i] = xa[i].recip() - dnx;\\n\\n hab.index_axis_mut(Axis(0), i).assign(&(&d * &(-nb)));\\n\\n haa[(i, i)] = -dnx / xa[i];\\n\\n\\n\\n let dnx = (&xa * na * &d).sum() + 1.0;\\n\\n gb[i] = xb[i].recip() - dnx;\\n\\n hba.index_axis_mut(Axis(0), i).assign(&(&d * &(-na)));\\n\\n hbb[(i, i)] = -dnx / xb[i];\\n\",\n \"file_path\": \"src/eos/association.rs\",\n \"rank\": 81,\n \"score\": 27759.439456975077\n },\n {\n \"content\": \" .unwrap();\\n\\n let state = StateHD::new(\\n\\n Dual64::from_re(temperature),\\n\\n Dual64::from_re(volume).derive(),\\n\\n moles.mapv(Dual64::from_re),\\n\\n );\\n\\n let pressure =\\n\\n -contrib.helmholtz_energy(&state).eps[0] * temperature * EosUnit::reference_pressure();\\n\\n assert_relative_eq!(pressure, -26.105606376765632 * PASCAL, max_relative = 1e-10);\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/eos/association.rs\",\n \"rank\": 82,\n \"score\": 27755.500749845247\n },\n {\n \"content\": \" if !self.assoc_segment.is_empty() {\\n\\n write!(f, \\\"\\\\n\\\\tassoc_segment={}\\\", self.assoc_segment)?;\\n\\n write!(f, \\\"\\\\n\\\\tkappa_ab={}\\\", self.kappa_ab)?;\\n\\n write!(f, \\\"\\\\n\\\\tepsilon_k_ab={}\\\", self.epsilon_k_ab)?;\\n\\n write!(f, \\\"\\\\n\\\\tna={}\\\", self.na)?;\\n\\n write!(f, \\\"\\\\n\\\\tnb={}\\\", self.nb)?;\\n\\n }\\n\\n if !self.dipole_comp.is_empty() {\\n\\n write!(f, \\\"\\\\n\\\\tdipole_comp={}\\\", self.dipole_comp)?;\\n\\n write!(f, \\\"\\\\n\\\\tmu={}\\\", self.mu)?;\\n\\n }\\n\\n write!(f, \\\"\\\\n)\\\")\\n\\n }\\n\\n}\\n\\n\\n\\n#[cfg(test)]\\n\\npub mod test {\\n\\n use super::*;\\n\\n use feos_core::parameter::{ChemicalRecord, Identifier};\\n\\n\\n\",\n \"file_path\": \"src/eos/parameter.rs\",\n \"rank\": 83,\n \"score\": 27311.127271043286\n },\n {\n \"content\": \"use crate::record::GcPcSaftRecord;\\n\\nuse feos_core::joback::JobackRecord;\\n\\nuse feos_core::parameter::{\\n\\n BinaryRecord, ChemicalRecord, FromSegments, IdentifierOption, ParameterError, SegmentRecord,\\n\\n};\\n\\nuse indexmap::{IndexMap, IndexSet};\\n\\nuse ndarray::{Array1, Array2};\\n\\nuse quantity::si::{JOULE, KB, KELVIN};\\n\\nuse std::fmt::Write;\\n\\nuse std::fs::File;\\n\\nuse std::io::BufReader;\\n\\nuse std::path::Path;\\n\\n\\n\\n/// Parameter set required for the gc-PC-SAFT equation of state.\\n\\npub struct GcPcSaftEosParameters {\\n\\n pub molarweight: Array1<f64>,\\n\\n pub component_index: Array1<usize>,\\n\\n identifiers: Vec<String>,\\n\\n\\n\\n pub m: Array1<f64>,\\n\",\n \"file_path\": \"src/eos/parameter.rs\",\n \"rank\": 84,\n \"score\": 27310.715202899144\n },\n {\n \"content\": \" pub epsilon_k_ij: Array2<f64>,\\n\\n pub sigma3_kappa_aibj: Array2<f64>,\\n\\n pub epsilon_k_aibj: Array2<f64>,\\n\\n\\n\\n pub chemical_records: Vec<ChemicalRecord>,\\n\\n segment_records: Vec<SegmentRecord<GcPcSaftRecord, JobackRecord>>,\\n\\n binary_segment_records: Option<Vec<BinaryRecord<String, f64>>>,\\n\\n pub joback_records: Option<Vec<JobackRecord>>,\\n\\n}\\n\\n\\n\\nimpl GcPcSaftEosParameters {\\n\\n pub fn from_segments(\\n\\n chemical_records: Vec<ChemicalRecord>,\\n\\n segment_records: Vec<SegmentRecord<GcPcSaftRecord, JobackRecord>>,\\n\\n binary_segment_records: Option<Vec<BinaryRecord<String, f64>>>,\\n\\n ) -> Result<Self, ParameterError> {\\n\\n let segment_map: IndexMap<_, _> = segment_records\\n\\n .iter()\\n\\n .map(|r| (r.identifier.clone(), r.clone()))\\n\\n .collect();\\n\",\n \"file_path\": \"src/eos/parameter.rs\",\n \"rank\": 85,\n \"score\": 27310.214313752487\n },\n {\n \"content\": \" let e_k_ij = Array2::from_shape_fn([dipole_comp.len(); 2], |(i, j)| {\\n\\n (epsilon_k_mix[i] * epsilon_k_mix[j]).sqrt()\\n\\n });\\n\\n\\n\\n // Association\\n\\n let sigma3_kappa_aibj = Array2::from_shape_fn([kappa_ab.len(); 2], |(i, j)| {\\n\\n (sigma[assoc_segment[i]] * sigma[assoc_segment[j]]).powf(1.5)\\n\\n * (kappa_ab[i] * kappa_ab[j]).sqrt()\\n\\n });\\n\\n let epsilon_k_aibj = Array2::from_shape_fn([epsilon_k_ab.len(); 2], |(i, j)| {\\n\\n 0.5 * (epsilon_k_ab[i] + epsilon_k_ab[j])\\n\\n });\\n\\n\\n\\n Ok(Self {\\n\\n molarweight,\\n\\n component_index: Array1::from_vec(component_index),\\n\\n identifiers,\\n\\n n: Array1::from_vec(n),\\n\\n m: Array1::from_vec(m),\\n\\n sigma: Array1::from_vec(sigma),\\n\",\n \"file_path\": \"src/eos/parameter.rs\",\n \"rank\": 86,\n \"score\": 27308.79740943141\n },\n {\n \"content\": \" binary_segment_records,\\n\\n joback_records: joback_records.into_iter().collect(),\\n\\n })\\n\\n }\\n\\n\\n\\n pub fn from_json_segments<P>(\\n\\n substances: &[&str],\\n\\n file_pure: P,\\n\\n file_segments: P,\\n\\n file_binary: Option<P>,\\n\\n search_option: IdentifierOption,\\n\\n ) -> Result<Self, ParameterError>\\n\\n where\\n\\n P: AsRef<Path>,\\n\\n {\\n\\n let queried: IndexSet<String> = substances\\n\\n .iter()\\n\\n .map(|identifier| identifier.to_string())\\n\\n .collect();\\n\\n\\n\",\n \"file_path\": \"src/eos/parameter.rs\",\n \"rank\": 87,\n \"score\": 27308.695795054784\n },\n {\n \"content\": \" .transpose()?;\\n\\n\\n\\n Self::from_segments(chemical_records, segment_records, binary_records)\\n\\n }\\n\\n\\n\\n pub fn subset(&self, component_list: &[usize]) -> Self {\\n\\n let chemical_records: Vec<_> = component_list\\n\\n .iter()\\n\\n .map(|&i| self.chemical_records[i].clone())\\n\\n .collect();\\n\\n Self::from_segments(\\n\\n chemical_records,\\n\\n self.segment_records.clone(),\\n\\n self.binary_segment_records.clone(),\\n\\n )\\n\\n .unwrap()\\n\\n }\\n\\n\\n\\n pub fn to_markdown(&self) -> String {\\n\\n let mut output = String::new();\\n\",\n \"file_path\": \"src/eos/parameter.rs\",\n \"rank\": 88,\n \"score\": 27307.661542310067\n },\n {\n \"content\": \" o,\\n\\n \\\"\\\\n|{}|{}|{}|{}|\\\",\\n\\n component, self.identifiers[*c1], self.identifiers[*c2], c\\n\\n )\\n\\n .unwrap();\\n\\n }\\n\\n\\n\\n output\\n\\n }\\n\\n}\\n\\n\\n\\nimpl std::fmt::Display for GcPcSaftEosParameters {\\n\\n fn fmt(&self, f: &mut std::fmt::Formatter<'_>) -> std::fmt::Result {\\n\\n write!(f, \\\"GcPcSaftParameters(\\\")?;\\n\\n write!(f, \\\"\\\\n\\\\tmolarweight={}\\\", self.molarweight)?;\\n\\n write!(f, \\\"\\\\n\\\\tcomponent_index={}\\\", self.component_index)?;\\n\\n write!(f, \\\"\\\\n\\\\tm={}\\\", self.m)?;\\n\\n write!(f, \\\"\\\\n\\\\tsigma={}\\\", self.sigma)?;\\n\\n write!(f, \\\"\\\\n\\\\tepsilon_k={}\\\", self.epsilon_k)?;\\n\\n write!(f, \\\"\\\\n\\\\tbonds={:?}\\\", self.bonds)?;\\n\",\n \"file_path\": \"src/eos/parameter.rs\",\n \"rank\": 89,\n \"score\": 27305.970600928835\n },\n {\n \"content\": \" )\\n\\n };\\n\\n let association = if let Some(a) = self.assoc_segment.iter().position(|&a| a == i) {\\n\\n format!(\\n\\n \\\"{}|{}|{}|{}\\\",\\n\\n self.kappa_ab[a], self.epsilon_k_ab[a], self.na[a], self.nb[a]\\n\\n )\\n\\n } else {\\n\\n \\\"|||\\\".to_string()\\n\\n };\\n\\n write!(\\n\\n o,\\n\\n \\\"\\\\n|{}|{}|{}|{}|{}|{}|{}|||\\\",\\n\\n component,\\n\\n self.identifiers[i],\\n\\n self.n[i],\\n\\n self.m[i],\\n\\n self.sigma[i],\\n\\n self.epsilon_k[i],\\n\\n association\\n\",\n \"file_path\": \"src/eos/parameter.rs\",\n \"rank\": 90,\n \"score\": 27305.645880291828\n },\n {\n \"content\": \" let mut epsilon_k_mix = Vec::new();\\n\\n\\n\\n let mut joback_records = Vec::new();\\n\\n\\n\\n for (i, chemical_record) in chemical_records.iter().enumerate() {\\n\\n let mut segment_indices = IndexMap::with_capacity(segment_records.len());\\n\\n let (segment_counts, bond_counts) = chemical_record.segment_and_bond_count();\\n\\n let count: IndexMap<_, _> = segment_counts\\n\\n .iter()\\n\\n .map(|(id, &count)| {\\n\\n let segment = segment_map\\n\\n .get(id)\\n\\n .ok_or_else(|| ParameterError::ComponentsNotFound(id.clone()))?;\\n\\n Ok((segment, count))\\n\\n })\\n\\n .collect::<Result<_, ParameterError>>()?;\\n\\n\\n\\n let mut m_i = 0.0;\\n\\n let mut sigma_i = 0.0;\\n\\n let mut epsilon_k_i = 0.0;\\n\",\n \"file_path\": \"src/eos/parameter.rs\",\n \"rank\": 91,\n \"score\": 27305.235030527456\n },\n {\n \"content\": \"\\n\\n pub fn propane() -> GcPcSaftEosParameters {\\n\\n let pure = ChemicalRecord::new(\\n\\n Identifier::new(\\\"74-98-6\\\", Some(\\\"propane\\\"), None, None, None, None),\\n\\n vec![\\\"CH3\\\".into(), \\\"CH2\\\".into(), \\\"CH3\\\".into()],\\n\\n None,\\n\\n );\\n\\n GcPcSaftEosParameters::from_segments(vec![pure], vec![ch3(), ch2()], None).unwrap()\\n\\n }\\n\\n\\n\\n pub fn propanol() -> GcPcSaftEosParameters {\\n\\n let pure = ChemicalRecord::new(\\n\\n Identifier::new(\\\"71-23-8\\\", Some(\\\"1-propanol\\\"), None, None, None, None),\\n\\n vec![\\\"CH3\\\".into(), \\\"CH2\\\".into(), \\\"CH2\\\".into(), \\\"OH\\\".into()],\\n\\n None,\\n\\n );\\n\\n GcPcSaftEosParameters::from_segments(vec![pure], vec![ch3(), ch2(), oh()], None).unwrap()\\n\\n }\\n\\n\\n\\n pub fn ethanol_propanol(binary: bool) -> GcPcSaftEosParameters {\\n\",\n \"file_path\": \"src/eos/parameter.rs\",\n \"rank\": 92,\n \"score\": 27305.10228934368\n },\n {\n \"content\": \" pub sigma: Array1<f64>,\\n\\n pub epsilon_k: Array1<f64>,\\n\\n pub bonds: IndexMap<[usize; 2], f64>,\\n\\n\\n\\n pub assoc_segment: Array1<usize>,\\n\\n pub n: Array1<f64>,\\n\\n kappa_ab: Array1<f64>,\\n\\n epsilon_k_ab: Array1<f64>,\\n\\n pub na: Array1<f64>,\\n\\n pub nb: Array1<f64>,\\n\\n\\n\\n pub dipole_comp: Array1<usize>,\\n\\n mu: Array1<f64>,\\n\\n pub mu2: Array1<f64>,\\n\\n pub m_mix: Array1<f64>,\\n\\n pub s_ij: Array2<f64>,\\n\\n pub e_k_ij: Array2<f64>,\\n\\n\\n\\n pub k_ij: Array2<f64>,\\n\\n pub sigma_ij: Array2<f64>,\\n\",\n \"file_path\": \"src/eos/parameter.rs\",\n \"rank\": 93,\n \"score\": 27305.09527163304\n },\n {\n \"content\": \"\\n\\n let mut molarweight = Array1::zeros(chemical_records.len());\\n\\n let mut component_index = Vec::new();\\n\\n let mut identifiers = Vec::new();\\n\\n let mut m = Vec::new();\\n\\n let mut sigma = Vec::new();\\n\\n let mut epsilon_k = Vec::new();\\n\\n let mut bonds = IndexMap::with_capacity(segment_records.len());\\n\\n let mut assoc_segment = Vec::new();\\n\\n let mut n = Vec::new();\\n\\n let mut kappa_ab = Vec::new();\\n\\n let mut epsilon_k_ab = Vec::new();\\n\\n let mut na = Vec::new();\\n\\n let mut nb = Vec::new();\\n\\n\\n\\n let mut dipole_comp = Vec::new();\\n\\n let mut mu = Vec::new();\\n\\n let mut mu2 = Vec::new();\\n\\n let mut m_mix = Vec::new();\\n\\n let mut sigma_mix = Vec::new();\\n\",\n \"file_path\": \"src/eos/parameter.rs\",\n \"rank\": 94,\n \"score\": 27305.024215136196\n },\n {\n \"content\": \" let reader = BufReader::new(File::open(file_pure)?);\\n\\n let chemical_records: Vec<ChemicalRecord> = serde_json::from_reader(reader)?;\\n\\n let mut record_map: IndexMap<_, _> = chemical_records\\n\\n .into_iter()\\n\\n .filter_map(|record| {\\n\\n record\\n\\n .identifier()\\n\\n .as_string(search_option)\\n\\n .map(|i| (i, record))\\n\\n })\\n\\n .collect();\\n\\n\\n\\n // Compare queried components and available components\\n\\n let available: IndexSet<String> = record_map\\n\\n .keys()\\n\\n .map(|identifier| identifier.to_string())\\n\\n .collect();\\n\\n if !queried.is_subset(&available) {\\n\\n let missing: Vec<String> = queried.difference(&available).cloned().collect();\\n\\n return Err(ParameterError::ComponentsNotFound(format!(\\\"{:?}\\\", missing)));\\n\",\n \"file_path\": \"src/eos/parameter.rs\",\n \"rank\": 95,\n \"score\": 27304.116847269925\n },\n {\n \"content\": \" .map(|s| JobackRecord::from_segments(s)),\\n\\n );\\n\\n }\\n\\n\\n\\n // Binary interaction parameter\\n\\n let mut k_ij = Array2::zeros([epsilon_k.len(); 2]);\\n\\n if let Some(binary_segment_records) = binary_segment_records.as_ref() {\\n\\n let mut binary_segment_records_map = IndexMap::new();\\n\\n for binary_record in binary_segment_records {\\n\\n binary_segment_records_map.insert(\\n\\n (binary_record.id1.clone(), binary_record.id2.clone()),\\n\\n binary_record.model_record,\\n\\n );\\n\\n binary_segment_records_map.insert(\\n\\n (binary_record.id2.clone(), binary_record.id1.clone()),\\n\\n binary_record.model_record,\\n\\n );\\n\\n }\\n\\n for (i, id1) in identifiers.iter().enumerate() {\\n\\n for (j, id2) in identifiers.iter().cloned().enumerate() {\\n\",\n \"file_path\": \"src/eos/parameter.rs\",\n \"rank\": 96,\n \"score\": 27303.06918592327\n },\n {\n \"content\": \" let mut mu2_i = 0.0;\\n\\n\\n\\n for (segment, count) in count.iter() {\\n\\n segment_indices.insert(segment.identifier.clone(), m.len());\\n\\n\\n\\n molarweight[i] += segment.molarweight * count;\\n\\n\\n\\n component_index.push(i);\\n\\n identifiers.push(segment.identifier.clone());\\n\\n m.push(segment.model_record.m * count);\\n\\n sigma.push(segment.model_record.sigma);\\n\\n epsilon_k.push(segment.model_record.epsilon_k);\\n\\n\\n\\n if let (Some(k), Some(e)) = (\\n\\n segment.model_record.kappa_ab,\\n\\n segment.model_record.epsilon_k_ab,\\n\\n ) {\\n\\n assoc_segment.push(m.len() - 1);\\n\\n n.push(*count);\\n\\n kappa_ab.push(k);\\n\",\n \"file_path\": \"src/eos/parameter.rs\",\n \"rank\": 97,\n \"score\": 27302.809952960553\n },\n {\n \"content\": \" if component_index[i] != component_index[j] {\\n\\n if let Some(k) = binary_segment_records_map.get(&(id1.clone(), id2)) {\\n\\n k_ij[(i, j)] = *k;\\n\\n }\\n\\n }\\n\\n }\\n\\n }\\n\\n }\\n\\n\\n\\n // Combining rules dispersion\\n\\n let sigma_ij =\\n\\n Array2::from_shape_fn([sigma.len(); 2], |(i, j)| 0.5 * (sigma[i] + sigma[j]));\\n\\n let epsilon_k_ij = Array2::from_shape_fn([epsilon_k.len(); 2], |(i, j)| {\\n\\n (epsilon_k[i] * epsilon_k[j]).sqrt()\\n\\n }) * (1.0 - &k_ij);\\n\\n\\n\\n // Combining rules polar\\n\\n let s_ij = Array2::from_shape_fn([dipole_comp.len(); 2], |(i, j)| {\\n\\n 0.5 * (sigma_mix[i] + sigma_mix[j])\\n\\n });\\n\",\n \"file_path\": \"src/eos/parameter.rs\",\n \"rank\": 98,\n \"score\": 27302.56098059707\n },\n {\n \"content\": \" epsilon_k: Array1::from_vec(epsilon_k),\\n\\n bonds,\\n\\n assoc_segment: Array1::from_vec(assoc_segment),\\n\\n kappa_ab: Array1::from_vec(kappa_ab),\\n\\n epsilon_k_ab: Array1::from_vec(epsilon_k_ab),\\n\\n na: Array1::from_vec(na),\\n\\n nb: Array1::from_vec(nb),\\n\\n dipole_comp: Array1::from_vec(dipole_comp),\\n\\n mu: Array1::from_vec(mu),\\n\\n mu2: Array1::from_vec(mu2),\\n\\n m_mix: Array1::from_vec(m_mix),\\n\\n s_ij,\\n\\n e_k_ij,\\n\\n k_ij,\\n\\n sigma_ij,\\n\\n epsilon_k_ij,\\n\\n sigma3_kappa_aibj,\\n\\n epsilon_k_aibj,\\n\\n chemical_records,\\n\\n segment_records,\\n\",\n \"file_path\": \"src/eos/parameter.rs\",\n \"rank\": 99,\n \"score\": 27301.722959683197\n }\n]","isConversational":false}}},{"rowIdx":2386,"cells":{"lang":{"kind":"string","value":"Rust"},"file_path":{"kind":"string","value":"rust-kernel-rdma/KRdmaKit/src/qp/rc_op.rs"},"repo_name":{"kind":"string","value":"Hf7WCdtO/KRCore"},"commit":{"kind":"string","value":"52369924ba175419912a274634d368d478dda501"},"file_code":{"kind":"string","value":"use rust_kernel_rdma_base::*;\nuse crate::qp::{DoorbellHelper, RC};\nuse core::option::Option;\nuse linux_kernel_module::bindings::*;\nuse linux_kernel_module::{Error};\nuse alloc::sync::Arc;\n\n#[allow(unused_imports)]\npub struct RCOp<'a> {\n qp: &'a Arc<RC>,\n}\n\nimpl<'a> RCOp<'a> {\n pub fn new(qp: &'a Arc<RC>) -> Self {\n Self {\n qp,\n }\n }\n\n #[inline]\n pub fn get_qp_status(&self) -> Option<u32> {\n self.qp.get_status()\n }\n}\n\nimpl<'a> RCOp<'a> {\n #[inline]\n pub fn push_with_imm(\n &mut self,\n op: u32, \n local_ptr: u64, \n lkey: u32, \n sz: usize, \n remote_addr: u64, \n rkey: u32, \n imm_data: u32,\n send_flag: i32,\n ) -> linux_kernel_module::KernelResult<()> {\n let mut wr: ib_rdma_wr = Default::default();\n let mut sge: ib_sge = Default::default();\n\n \n sge.addr = local_ptr;\n sge.length = sz as u32;\n sge.lkey = lkey;\n\n \n wr.wr.opcode = op;\n wr.wr.send_flags = send_flag;\n wr.wr.ex.imm_data = imm_data;\n wr.remote_addr = remote_addr;\n wr.rkey = rkey;\n\n \n self.post_send(sge, wr)\n }\n\n #[inline]\n pub fn push(\n &mut self,\n op: u32, \n local_ptr: u64, \n lkey: u32, \n sz: usize, \n remote_addr: u64, \n rkey: u32, \n send_flag: i32,\n ) -> linux_kernel_module::KernelResult<()> {\n self.push_with_imm(op, local_ptr, lkey, sz, remote_addr, rkey, 0, send_flag)\n }\n\n \n #[inline]\n pub fn pop(&mut self) -> Option<*mut ib_wc> {\n let mut wc: ib_wc = Default::default();\n let ret = unsafe { bd_ib_poll_cq(self.qp.get_cq(), 1, &mut wc as *mut ib_wc) };\n if ret < 0 {\n return None;\n } else if ret == 1 {\n if wc.status != 0 && wc.status != 5 {\n linux_kernel_module::println!(\"rc poll cq error, wc_status:{}\", wc.status);\n }\n return Some(&mut wc as *mut ib_wc);\n }\n None\n }\n\n #[inline]\n fn post_send(\n &mut self,\n mut sge: ib_sge,\n mut wr: ib_rdma_wr,\n ) -> linux_kernel_module::KernelResult<()> {\n \n wr.wr.sg_list = &mut sge as *mut _;\n wr.wr.num_sge = 1;\n\n let mut bad_wr: *mut ib_send_wr = core::ptr::null_mut();\n let err = unsafe {\n bd_ib_post_send(\n self.qp.get_qp(),\n &mut wr.wr as *mut _,\n &mut bad_wr as *mut _,\n )\n };\n\n if err != 0 {\n return Err(Error::from_kernel_errno(err));\n }\n\n Ok(())\n }\n\n #[inline]\n pub fn wait_til_comp(&mut self) -> Option<*mut ib_wc> {\n loop {\n let ret = self.pop();\n if ret.is_some() {\n return ret;\n }\n }\n }\n}\n\nimpl<'a> RCOp<'a> {\n #[inline]\n pub fn read(&mut self,\n local_ptr: u64,\n lkey: u32,\n sz: usize,\n remote_addr: u64,\n rkey: u32,\n ) -> linux_kernel_module::KernelResult<Option<*mut ib_wc>> {\n self.push(ib_wr_opcode::IB_WR_RDMA_READ,\n local_ptr, lkey, sz, remote_addr, rkey, ib_send_flags::IB_SEND_SIGNALED)\n .and_then(|()| Ok(self.wait_til_comp()))\n }\n\n #[inline]\n pub fn write(&mut self,\n local_ptr: u64,\n lkey: u32,\n sz: usize,\n remote_addr: u64,\n rkey: u32,\n ) -> linux_kernel_module::KernelResult<Option<*mut ib_wc>> {\n self.push(ib_wr_opcode::IB_WR_RDMA_WRITE,\n local_ptr, lkey, sz, remote_addr, rkey, ib_send_flags::IB_SEND_SIGNALED)\n .and_then(|()| Ok(self.wait_til_comp()))\n }\n\n #[inline]\n pub fn send(&mut self,\n local_ptr: u64,\n lkey: u32,\n sz: usize,\n remote_addr: u64,\n rkey: u32,\n ) -> linux_kernel_module::KernelResult<Option<*mut ib_wc>> {\n self.push(ib_wr_opcode::IB_WR_SEND,\n local_ptr, lkey, sz, remote_addr, rkey, ib_send_flags::IB_SEND_SIGNALED)\n .and_then(|()| Ok(self.wait_til_comp()))\n }\n}\n\nimpl RCOp<'_> {\n\n #[inline]\n pub fn post_doorbell(\n &mut self,\n doorbell: &mut DoorbellHelper,\n ) -> linux_kernel_module::KernelResult<()> {\n doorbell.freeze();\n let ret = self.post_send(doorbell.sges[0], doorbell.wrs[0]);\n doorbell.freeze_done();\n ret\n }\n}\n"},"prefix":{"kind":"string","value":"use rust_kernel_rdma_base::*;\nuse crate::qp::{DoorbellHelper, RC};\nuse core::option::Option;\nuse linux_kernel_module::bindings::*;\nuse linux_kernel_module::{Error};\nuse alloc::sync::Arc;\n\n#[allow(unused_imports)]\npub struct RCOp<'a> {\n qp: &'a Arc<RC>,\n}\n\nimpl<'a> RCOp<'a> {\n pub fn new(qp: &'a Arc<RC>) -> Self {\n Self {\n qp,\n }\n }\n\n #[inline]\n pub fn get_qp_status(&self) -> Option<u32> {\n self.qp.get_status()\n }\n}\n\nimpl<'a> RCOp<'a> {\n #[inline]\n pub fn push_with_imm(\n &mut self,\n op: u32, \n local_ptr: u64, \n lkey: u32, \n sz: usize, \n remote_addr: u64, \n rkey: u32, \n imm_data: u32,\n send_flag: i32,\n ) -> linux_kernel_module::KernelResult<()> {\n let mut wr: ib_rdma_wr = Default::default();\n let mut sge: ib_sge = Default::default();\n\n \n sge.addr = local_ptr;\n sge.length = sz as u32;\n sge.lkey = lkey;\n\n \n wr.wr.opcode = op;\n wr.wr.send_flags = send_flag;\n wr.wr.ex.imm_data = imm_data;\n wr.remote_addr = remote_addr;\n wr.rkey = rkey;\n\n \n self.post_send(sge, wr)\n }\n\n #[inline]\n pub fn push(\n &mut self,\n op: u32, \n local_ptr: u64, \n lkey: u32, \n sz: usize, \n remote_addr: u64, \n rkey: u32, \n send_flag: i32,\n ) -> linux_kernel_module::KernelResult<()> {\n self.push_with_imm(op, local_ptr, lkey, sz, remote_addr, rkey, 0, send_flag)\n }\n\n \n #[inline]\n pub fn pop(&mut self) -> Option<*mut ib_wc> {\n let mut wc: ib_wc = Default::default();\n let ret = unsafe { bd_ib_poll_cq(self.qp.get_cq(), 1, &mut wc as *mut ib_wc) };\n if ret < 0 {\n return None;\n } else if ret == 1 {\n if wc.status != 0 && wc.status != 5 {\n linux_kernel_module::println!(\"rc poll cq error, wc_status:{}\", wc.status);\n }\n return Some(&mut wc as *mut ib_wc);\n }\n "},"suffix":{"kind":"string","value":"WR_RDMA_READ,\n local_ptr, lkey, sz, remote_addr, rkey, ib_send_flags::IB_SEND_SIGNALED)\n .and_then(|()| Ok(self.wait_til_comp()))\n }\n\n #[inline]\n pub fn write(&mut self,\n local_ptr: u64,\n lkey: u32,\n sz: usize,\n remote_addr: u64,\n rkey: u32,\n ) -> linux_kernel_module::KernelResult<Option<*mut ib_wc>> {\n self.push(ib_wr_opcode::IB_WR_RDMA_WRITE,\n local_ptr, lkey, sz, remote_addr, rkey, ib_send_flags::IB_SEND_SIGNALED)\n .and_then(|()| Ok(self.wait_til_comp()))\n }\n\n #[inline]\n pub fn send(&mut self,\n local_ptr: u64,\n lkey: u32,\n sz: usize,\n remote_addr: u64,\n rkey: u32,\n ) -> linux_kernel_module::KernelResult<Option<*mut ib_wc>> {\n self.push(ib_wr_opcode::IB_WR_SEND,\n local_ptr, lkey, sz, remote_addr, rkey, ib_send_flags::IB_SEND_SIGNALED)\n .and_then(|()| Ok(self.wait_til_comp()))\n }\n}\n\nimpl RCOp<'_> {\n\n #[inline]\n pub fn post_doorbell(\n &mut self,\n doorbell: &mut DoorbellHelper,\n ) -> linux_kernel_module::KernelResult<()> {\n doorbell.freeze();\n let ret = self.post_send(doorbell.sges[0], doorbell.wrs[0]);\n doorbell.freeze_done();\n ret\n }\n}\n"},"middle":{"kind":"string","value":" None\n }\n\n #[inline]\n fn post_send(\n &mut self,\n mut sge: ib_sge,\n mut wr: ib_rdma_wr,\n ) -> linux_kernel_module::KernelResult<()> {\n \n wr.wr.sg_list = &mut sge as *mut _;\n wr.wr.num_sge = 1;\n\n let mut bad_wr: *mut ib_send_wr = core::ptr::null_mut();\n let err = unsafe {\n bd_ib_post_send(\n self.qp.get_qp(),\n &mut wr.wr as *mut _,\n &mut bad_wr as *mut _,\n )\n };\n\n if err != 0 {\n return Err(Error::from_kernel_errno(err));\n }\n\n Ok(())\n }\n\n #[inline]\n pub fn wait_til_comp(&mut self) -> Option<*mut ib_wc> {\n loop {\n let ret = self.pop();\n if ret.is_some() {\n return ret;\n }\n }\n }\n}\n\nimpl<'a> RCOp<'a> {\n #[inline]\n pub fn read(&mut self,\n local_ptr: u64,\n lkey: u32,\n sz: usize,\n remote_addr: u64,\n rkey: u32,\n ) -> linux_kernel_module::KernelResult<Option<*mut ib_wc>> {\n self.push(ib_wr_opcode::IB_"},"strategy":{"kind":"string","value":"random"},"context_items":{"kind":"list like","value":[{"content":"#[inline]\n\nfn create_ib_qp(config: &Config, pd: *mut ib_pd, qp_type: u32, cq: *mut ib_cq, recv_cq: *mut ib_cq, srq: *mut ib_srq) -> *mut ib_qp {\n\n let mut qp_attr: ib_qp_init_attr = Default::default();\n\n qp_attr.cap.max_send_wr = config.max_send_wr_sz as u32;\n\n qp_attr.cap.max_recv_wr = config.max_recv_wr_sz as u32;\n\n qp_attr.cap.max_recv_sge = config.max_recv_sge as u32;\n\n qp_attr.cap.max_send_sge = config.max_send_sge as u32;\n\n qp_attr.cap.max_inline_data = 64 as u32;\n\n qp_attr.sq_sig_type = ib_sig_type::IB_SIGNAL_REQ_WR;\n\n qp_attr.qp_type = qp_type;\n\n qp_attr.send_cq = cq;\n\n qp_attr.recv_cq = recv_cq;\n\n qp_attr.srq = srq;\n\n\n\n unsafe { ib_create_qp(pd, &mut qp_attr as *mut ib_qp_init_attr) }\n\n}\n\n\n\n\n\n/// Fetch the status of one target qp\n","file_path":"rust-kernel-rdma/KRdmaKit/src/qp/mod.rs","rank":0,"score":466219.8060344838},{"content":"#[inline]\n\npub fn create_dc_qp(ctx: &RContext, srq: *mut ib_srq, recv_cq: *mut ib_cq) -> (*mut ib_qp, *mut ib_cq, *mut ib_cq) {\n\n let pd = ctx.get_pd();\n\n if pd.is_null() {\n\n println!(\"[dct] err creating qp pd\");\n\n return (\n\n core::ptr::null_mut(),\n\n core::ptr::null_mut(),\n\n core::ptr::null_mut(),\n\n );\n\n }\n\n\n\n let mut cq_attr: ib_cq_init_attr = Default::default();\n\n cq_attr.cqe = 128;\n\n\n\n let cq = create_ib_cq(ctx.get_raw_dev(), &mut cq_attr as *mut _);\n\n if cq.is_null() {\n\n println!(\"[dct] qp null cq\");\n\n return (\n\n core::ptr::null_mut(),\n\n core::ptr::null_mut(),\n","file_path":"rust-kernel-rdma/KRdmaKit/src/qp/mod.rs","rank":1,"score":464611.8399973218},{"content":"#[inline]\n\npub fn handle_pop_ret(pop_ret: Option<*mut ib_wc>,\n\n req: &mut req_t,\n\n wc_len: usize,\n\n payload_sz: u32) -> u32 {\n\n match pop_ret {\n\n Some(wc) => {\n\n\n\n // assemble each wc element\n\n let wc_sz: u64 = core::mem::size_of::<ib_wc>() as u64;\n\n for i in 0..(wc_len as u64) {\n\n // assemble the wc\n\n let mut user_wc: user_wc_t = Default::default();\n\n let wc = unsafe { *((wc as u64 + i * wc_sz) as *const ib_wc) };\n\n user_wc.wc_op = wc.opcode;\n\n let va = wc.get_wr_id() as u64;\n\n user_wc.wc_wr_id = wc.get_wr_id() as u64;\n\n user_wc.wc_status = wc.status;\n\n user_wc.imm_data = unsafe { wc.ex.imm_data } as u32;\n\n unsafe {\n\n rust_kernel_linux_util::bindings::memcpy(\n","file_path":"KRdmaKit-syscall/src/core.rs","rank":2,"score":458854.8100402253},{"content":"#[inline]\n\npub fn get_qp_status(ib_qp: *mut ib_qp) -> Option<u32> {\n\n let mut attr: ib_qp_attr = Default::default();\n\n let mut init_attr: ib_qp_init_attr = Default::default();\n\n\n\n // query\n\n let ret = unsafe {\n\n ib_query_qp(\n\n ib_qp,\n\n &mut attr as *mut ib_qp_attr,\n\n ib_qp_attr_mask::IB_QP_STATE,\n\n &mut init_attr as *mut ib_qp_init_attr,\n\n )\n\n };\n\n\n\n if ret != 0 {\n\n return None;\n\n }\n\n\n\n Some(attr.qp_state)\n\n}\n\n\n","file_path":"rust-kernel-rdma/KRdmaKit/src/qp/mod.rs","rank":3,"score":452172.54415150254},{"content":"#[inline]\n\npub fn send_reg_mr(qp: *mut ib_qp, mr: *mut ib_mr, access_flags: u32, whether_signaled: bool) -> c_types::c_int {\n\n let rkey = unsafe { (*mr).rkey };\n\n let mut wr: ib_reg_wr = Default::default();\n\n\n\n wr.wr.opcode = ib_wr_opcode::IB_WR_REG_MR;\n\n wr.wr.num_sge = 0;\n\n wr.wr.send_flags = if whether_signaled { ib_send_flags::IB_SEND_SIGNALED } else { 0 };\n\n wr.mr = mr;\n\n wr.key = rkey;\n\n wr.access = access_flags as i32;\n\n let mut bad_wr: *mut ib_send_wr = core::ptr::null_mut();\n\n\n\n unsafe {\n\n bd_ib_post_send(qp, &mut wr.wr as *mut _,\n\n &mut bad_wr as *mut _, )\n\n }\n\n}\n\n\n\n\n\nconst DC_KEY: u64 = 73;\n\n\n\n\n\n// this function has memory leakage, but its fine since it is in the unittest\n","file_path":"rust-kernel-rdma/KRdmaKit/src/qp/mod.rs","rank":4,"score":437061.1890109604},{"content":"#[inline]\n\npub fn pop_recv(core_id: usize, pop_cnt: usize, offset: usize) -> (Option<*mut ib_wc>, usize) {\n\n let ctrl = get_global_rctrl(core_id);\n\n\n\n let recv_cq = ctrl.get_recv_cq();\n\n let recv = unsafe { Arc::get_mut_unchecked(ctrl.get_recv_buffer()) };\n\n recv.pop_recvs(recv_cq, pop_cnt, offset).unwrap()\n\n}\n\n\n\n\n","file_path":"KRdmaKit-syscall/src/core.rs","rank":5,"score":427122.63642619736},{"content":"#[inline]\n\npub fn op_code_table(op: u32) -> u32 {\n\n use KRdmaKit::rust_kernel_rdma_base::*;\n\n use crate::bindings::*;\n\n match op {\n\n lib_r_req::Read => ib_wr_opcode::IB_WR_RDMA_READ,\n\n lib_r_req::Write => ib_wr_opcode::IB_WR_RDMA_WRITE,\n\n lib_r_req::Send => ib_wr_opcode::IB_WR_SEND,\n\n lib_r_req::SendImm => ib_wr_opcode::IB_WR_SEND_WITH_IMM,\n\n lib_r_req::WriteImm => ib_wr_opcode::IB_WR_RDMA_WRITE_WITH_IMM,\n\n _ => unimplemented!(),\n\n }\n\n}\n\n\n\nimpl Drop for KRdmaKitSyscallModule {\n\n fn drop(&mut self) {\n\n println!(\"Goodbye KRdma syscall module!\");\n\n }\n\n}\n\n\n\nlinux_kernel_module::kernel_module!(\n\n KRdmaKitSyscallModule,\n\n author: b\"anonymous\",\n\n description: b\"KRdmaKit syscall tier\",\n\n license: b\"GPL\"\n\n);\n","file_path":"KRdmaKit-syscall/src/lib.rs","rank":6,"score":426301.1635615169},{"content":"/// Main func for qp connection in kernel space.\n\n/// The runtime latency of this function should be profiled in a more detailed way.\n\npub fn qp_connect(vid: usize, port: usize, path_rec: &sa_path_rec) -> KernelResult<Option<Arc<RC>>> {\n\n let remote_service_id = port as u64;\n\n let ctrl = get_global_rctrl(remote_service_id as usize);\n\n let ctx = ctrl.get_context();\n\n // create local qp\n\n let rc = RC::new_with_srq(\n\n Default::default(),\n\n ctx, null_mut(),\n\n null_mut(),\n\n ctrl.get_recv_cq(),\n\n );\n\n if rc.is_some() {\n\n let mut qp = rc.unwrap();\n\n let mrc = unsafe { Arc::get_mut_unchecked(&mut qp) };\n\n // connect handshake(param `vid` is useless)\n\n mrc.connect(vid as u64, *path_rec, remote_service_id)?;\n\n return Ok(Some(qp));\n\n }\n\n Ok(None)\n\n}\n\n\n\n\n","file_path":"KRdmaKit-syscall/src/core.rs","rank":7,"score":403858.64189286804},{"content":"#[inline]\n\npub fn bring_dc_to_ready(qp: *mut ib_qp) -> bool {\n\n if !unsafe { bring_dc_to_init(qp) } {\n\n println!(\"[dct] err to re-bring to init.\");\n\n return false;\n\n }\n\n if !unsafe { bring_dc_to_rtr(qp) } {\n\n println!(\"[dct] err to re-bring to rtr.\");\n\n return false;\n\n }\n\n if !unsafe { bring_dc_to_rts(qp) } {\n\n println!(\"[dct] err to re-bring to rts.\");\n\n return false;\n\n }\n\n return true;\n\n}\n\n\n\n#[inline]\n\npub unsafe fn bring_dc_to_init(qp: *mut ib_qp) -> bool {\n\n let mut attr: ib_qp_attr = Default::default();\n\n let mut mask: linux_kernel_module::c_types::c_int = ib_qp_attr_mask::IB_QP_STATE;\n","file_path":"rust-kernel-rdma/KRdmaKit/src/qp/mod.rs","rank":8,"score":386292.1433961146},{"content":"#[inline]\n\npub fn get_global_test_mem_pa(idx: usize) -> u64 {\n\n let len = GLOBAL_MEM.get_ref().len();\n\n { &mut GLOBAL_MEM.get_mut()[idx % len] }.get_dma_buf()\n\n}\n\n\n","file_path":"KRdmaKit-syscall/src/client.rs","rank":9,"score":360808.9233564251},{"content":"#[inline]\n\npub fn create_dct_server(pd: *mut ib_pd, device: *mut ib_device) -> *mut ib_dct {\n\n let mut cq_attr: ib_cq_init_attr = Default::default();\n\n cq_attr.cqe = 128;\n\n\n\n let cq = create_ib_cq(device, &mut cq_attr as *mut _);\n\n\n\n\n\n if cq.is_null() {\n\n println!(\"[dct] err dct server cq null\");\n\n return core::ptr::null_mut();\n\n }\n\n\n\n // create srq\n\n let mut cq_attr: ib_srq_init_attr = Default::default();\n\n cq_attr.attr.max_wr = 128;\n\n cq_attr.attr.max_sge = 1;\n\n\n\n let srq = unsafe { ib_create_srq(pd, &mut cq_attr as _) };\n\n\n\n if srq.is_null() {\n","file_path":"rust-kernel-rdma/KRdmaKit/src/qp/mod.rs","rank":10,"score":360084.4312719493},{"content":"#[inline]\n\npub fn post_recv(core_id: usize, post_cnt: usize, vid: usize) -> u32 {\n\n let ctrl = get_global_rctrl(core_id);\n\n let qp = ctrl.get_trc(vid).unwrap().get_qp();\n\n let recv_buffer = ctrl.get_recv_buffer();\n\n let recv = unsafe { Arc::get_mut_unchecked(recv_buffer) };\n\n return match recv.post_recvs(qp, core::ptr::null_mut(), post_cnt) {\n\n Ok(_) => {\n\n reply_status::ok\n\n }\n\n Err(_) => reply_status::err\n\n };\n\n}\n\n\n","file_path":"KRdmaKit-syscall/src/core.rs","rank":11,"score":355664.0710599885},{"content":"#[inline]\n\npub fn create_ib_ah(pd: *mut ib_pd, lid: u16, gid: ib_gid) -> *mut ib_ah {\n\n let mut ah_attr: rdma_ah_attr = Default::default();\n\n ah_attr.type_ = rdma_ah_attr_type::RDMA_AH_ATTR_TYPE_IB;\n\n\n\n unsafe { bd_rdma_ah_set_dlid(&mut ah_attr, lid as u32); }\n\n ah_attr.sl = 0;\n\n ah_attr.port_num = 1;\n\n\n\n unsafe {\n\n ah_attr.grh.dgid.global.subnet_prefix = gid.global.subnet_prefix;\n\n ah_attr.grh.dgid.global.interface_id = gid.global.interface_id;\n\n }\n\n\n\n let res = unsafe { rdma_create_ah_wrapper(pd, &mut ah_attr as _) };\n\n\n\n // maybe, we should wrapper ptr_is_err because this function is 100% safe\n\n if unsafe { ptr_is_err(res as _) } > 0 {\n\n return core::ptr::null_mut();\n\n }\n\n res\n\n}\n\n\n","file_path":"rust-kernel-rdma/KRdmaKit/src/qp/mod.rs","rank":12,"score":340542.59299386904},{"content":"#[inline]\n\npub fn get_global_rcontext(idx: usize) -> &'static mut RContext<'static> {\n\n let len = ALLRCONTEXTS.len();\n\n let ctx = &mut ALLRCONTEXTS.get_mut()[idx % len];\n\n return ctx;\n\n}\n\n\n","file_path":"KRdmaKit-syscall/src/client.rs","rank":13,"score":340347.6572164519},{"content":"#[inline]\n\npub fn get_rpc_client(idx: usize) -> &'static mut RPCClient<'static, RPC_BUFFER_N> {\n\n let len = RPC_CLIENTS.len();\n\n &mut RPC_CLIENTS.get_mut()[idx % len]\n\n}\n\n\n","file_path":"KRdmaKit-syscall/src/client.rs","rank":14,"score":330970.29328382213},{"content":"#[inline]\n\npub fn get_global_rctrl(idx: usize) -> &'static mut Pin<Box<RCtrl<'static>>> {\n\n let len = RCTRL.len();\n\n &mut RCTRL.get_mut()[idx % len]\n\n}\n\n\n","file_path":"KRdmaKit-syscall/src/client.rs","rank":15,"score":329778.13380939426},{"content":"#[inline]\n\npub fn get_bind_ctrl(port: usize) -> &'static mut Pin<Box<RCtrl<'static>>> {\n\n get_global_rctrl(port * 2)\n\n}\n\n\n\n\n","file_path":"KRdmaKit-syscall/src/client.rs","rank":16,"score":329778.13380939426},{"content":"fn wait_one_cq(cq: *mut ib_cq) {\n\n let mut wc: ib_wc = Default::default();\n\n let mut run_cnt = 0;\n\n loop {\n\n let ret = unsafe { bd_ib_poll_cq(cq, 1, &mut wc as *mut ib_wc) };\n\n if ret < 0 {\n\n linux_kernel_module::println!(\"ret < 0\");\n\n break;\n\n } else if ret == 1 {\n\n if wc.status != 0 && wc.status != 5 {\n\n linux_kernel_module::println!(\"rc poll cq error, wc_status:{}\", wc.status);\n\n }\n\n break;\n\n } else {\n\n run_cnt += 1;\n\n if run_cnt > 10000 {\n\n linux_kernel_module::println!(\"timeout\");\n\n break;\n\n }\n\n }\n\n }\n\n}\n\n\n","file_path":"rust-kernel-rdma/KRdmaKit/unitests/rfork/src/frwr.rs","rank":17,"score":311729.31154907483},{"content":"fn wait_one_cq(cq: *mut ib_cq) {\n\n let mut wc: ib_wc = Default::default();\n\n let mut run_cnt = 0;\n\n loop {\n\n let ret = unsafe { bd_ib_poll_cq(cq, 1, &mut wc as *mut ib_wc) };\n\n if ret < 0 {\n\n linux_kernel_module::println!(\"ret < 0\");\n\n break;\n\n } else if ret == 1 {\n\n if wc.status != 0 && wc.status != 5 {\n\n linux_kernel_module::println!(\"rc poll cq error, wc_status:{}\", wc.status);\n\n }\n\n break;\n\n } else {\n\n run_cnt += 1;\n\n if run_cnt > 10000 {\n\n linux_kernel_module::println!(\"timeout\");\n\n break;\n\n }\n\n }\n\n }\n\n}\n\n\n","file_path":"rust-kernel-rdma/KRdmaKit/unitests/reg_mr/src/lib.rs","rank":18,"score":310497.6772806411},{"content":"#[inline]\n\npub fn random_split(total: u64, shard_num: u64) -> Vec<u64> {\n\n let mut rand = random::FastRandom::new(0xdeadbeaf);\n\n let mut result: Vec<u64> = Vec::with_capacity(shard_num as usize);\n\n let mut sum = 0 as u64;\n\n for _ in 0..shard_num - 1 {\n\n let tmp = total - sum;\n\n let mut val = rand.get_next() % tmp;\n\n result.push(val);\n\n sum += val;\n\n }\n\n result.push(total - sum);\n\n result\n\n}\n\n\n\nimpl linux_kernel_module::KernelModule for RegMRTestModule {\n\n fn init() -> linux_kernel_module::KernelResult<Self> {\n\n ctx_init();\n\n // bench_frwr(); // FRWR\n\n // bench_pin();\n\n // bench_vma();\n","file_path":"rust-kernel-rdma/KRdmaKit/unitests/rfork/src/lib.rs","rank":19,"score":302908.6219936725},{"content":"/// Return back the reply length in bytes\n\ntype RpcHandlerT = fn(req_addr: u64, reply_addr: u64) -> u32;\n\n\n\n\n\n/// RPC Client based on UD\n\n///\n\n/// TODO: maybe we could extend to DC / RC ?\n\npub struct RPCClient<'a, const N: usize> {\n\n queue_pair: &'a Arc<UD>,\n\n ctx: &'a RContext<'a>,\n\n endpoint: EndPoint,\n\n\n\n send_buffer: RMemPhy,\n\n recv_buffer: RMemPhy,\n\n recv_helper: Arc<RecvHelper<N>>,\n\n\n\n reg_handlers: HashMap<u8, RpcHandlerT>,\n\n listened: bool,\n\n}\n\n\n\nimpl<'a, const N: usize> RPCClient<'a, N> {\n","file_path":"KRdmaKit-syscall/src/rpc/client.rs","rank":20,"score":295492.02494323323},{"content":"/// Return back the reply length in bytes\n\ntype RpcHandlerT = fn(req_addr: u64, reply_addr: u64) -> u32;\n\n\n\n\n\n/// RPC Client based on UD\n\n///\n\n/// TODO: maybe we could extend to DC / RC ?\n\npub struct RPCClient<'a, const N: usize> {\n\n queue_pair: &'a Arc<UD>,\n\n ctx: &'a RContext<'a>,\n\n endpoint: &'a EndPoint,\n\n\n\n send_buffer: RMemPhy,\n\n recv_buffer: RMemPhy,\n\n recv_helper: Arc<RecvHelper<N>>,\n\n\n\n reg_handlers: HashMap<u8, RpcHandlerT>,\n\n listened: bool,\n\n}\n\n\n\nimpl<'a, const N: usize> RPCClient<'a, N> {\n","file_path":"rust-kernel-rdma/KRdmaKit/unitests/rpc/src/rpc.rs","rank":21,"score":291639.58202354633},{"content":"pub fn demo_use_two_nics() {\n\n use crate::ib_wc;\n\n let ctx: &mut RContext = &mut ALLRCONTEXTS.get_mut()[0];\n\n let ctx_1: &mut RContext = &mut ALLRCONTEXTS.get_mut()[1];\n\n let sa_client = &mut SA_CLIENT.get_mut();\n\n\n\n // preparation\n\n let mut explorer = IBExplorer::new();\n\n\n\n let gid_addr = ctx.get_gid_as_string();\n\n let _ = explorer.resolve(1, ctx, &gid_addr, sa_client.get_inner_sa_client());\n\n\n\n let path_res = explorer.get_path_result().unwrap();\n\n // param\n\n let remote_service_id = 50;\n\n let qd_hint = 73;\n\n\n\n let mut ctrl = RCtrl::create(remote_service_id, &mut ALLRCONTEXTS.get_mut()[0]).unwrap();\n\n // end of preparation\n\n // let cm = SidrCM::new(ctx, core::ptr::null_mut());\n","file_path":"rust-kernel-rdma/KRdmaKit/unitests/rfork/src/two_nic.rs","rank":22,"score":288753.6215825609},{"content":"static void\n\nmlx5_send_wr_set_sge_rc_uc(struct ibv_qp_ex *ibqp, uint32_t lkey,\n\n\t\t\t uint64_t addr, uint32_t length)\n\n{\n\n\tstruct mlx5_qp *mqp = to_mqp((struct ibv_qp *)ibqp);\n\n\n\n\t_mlx5_send_wr_set_sge(mqp, lkey, addr, length);\n\n\t_common_wqe_finilize(mqp);\n","file_path":"mlnx-ofed-4.9-driver/rdma-core-50mlnx1/providers/mlx5/qp.c","rank":23,"score":287312.43589922565},{"content":"#[inline]\n\npub fn get_global_sa_client() -> &'static mut SAClient {\n\n SA_CLIENT.get_mut()\n\n}\n\n\n","file_path":"KRdmaKit-syscall/src/client.rs","rank":24,"score":285528.2577175508},{"content":"static void\n\nmlx5_send_wr_set_inline_data_rc_uc(struct ibv_qp_ex *ibqp, void *addr,\n\n\t\t\t\t size_t length)\n\n{\n\n\tstruct mlx5_qp *mqp = to_mqp((struct ibv_qp *)ibqp);\n\n\n\n\t_mlx5_send_wr_set_inline_data(mqp, addr, length);\n\n\t_common_wqe_finilize(mqp);\n","file_path":"mlnx-ofed-4.9-driver/rdma-core-50mlnx1/providers/mlx5/qp.c","rank":25,"score":285506.6880102676},{"content":"static void\n\nmlx5_send_wr_set_sge_list_rc_uc(struct ibv_qp_ex *ibqp, size_t num_sge,\n\n\t\t\t\tconst struct ibv_sge *sg_list)\n\n{\n\n\tstruct mlx5_qp *mqp = to_mqp((struct ibv_qp *)ibqp);\n\n\n\n\t_mlx5_send_wr_set_sge_list(mqp, num_sge, sg_list);\n\n\t_common_wqe_finilize(mqp);\n","file_path":"mlnx-ofed-4.9-driver/rdma-core-50mlnx1/providers/mlx5/qp.c","rank":26,"score":285500.0684744517},{"content":"#[inline]\n\npub fn get_global_rctrl_len() -> usize {\n\n RCTRL.len()\n\n}\n\n\n","file_path":"KRdmaKit-syscall/src/client.rs","rank":27,"score":283833.28235310136},{"content":"static void\n\nmlx5_send_wr_set_inline_data_list_rc_uc(struct ibv_qp_ex *ibqp,\n\n\t\t\t\t\tsize_t num_buf,\n\n\t\t\t\t\tconst struct ibv_data_buf *buf_list)\n\n{\n\n\tstruct mlx5_qp *mqp = to_mqp((struct ibv_qp *)ibqp);\n\n\n\n\t_mlx5_send_wr_set_inline_data_list(mqp, num_buf, buf_list);\n\n\t_common_wqe_finilize(mqp);\n","file_path":"mlnx-ofed-4.9-driver/rdma-core-50mlnx1/providers/mlx5/qp.c","rank":28,"score":283717.0005986171},{"content":"#[inline]\n\npub fn get_global_meta_kv_mem() -> &'static mut RMemPhy {\n\n &mut GLOBAL_MEM.get_mut()[1]\n\n}\n\n\n\n// we default use the nic_0\n","file_path":"KRdmaKit-syscall/src/client.rs","rank":29,"score":282567.22597532463},{"content":"#[inline]\n\npub fn get_global_test_mem_len() -> usize {\n\n GLOBAL_MEM.get_ref().len()\n\n}\n\n\n","file_path":"KRdmaKit-syscall/src/client.rs","rank":30,"score":282281.9756282196},{"content":"/// Test case for RC qp state change\n\nfn test_case_rc_1() {\n\n let ctx: &mut RContext = &mut ALLRCONTEXTS.get_mut()[0];\n\n // sa client\n\n println!(\"sa client registered\");\n\n\n\n\n\n let rc = RC::new(ctx, core::ptr::null_mut(), null_mut());\n\n if rc.is_some() {\n\n println!(\"create RC success\");\n\n // check field getter\n\n let mut rc = rc.unwrap();\n\n let mrc = unsafe { Arc::get_mut_unchecked(&mut rc) };\n\n\n\n println!(\"[1] state:{}\", get_qp_status(mrc.get_qp()).unwrap());\n\n }\n\n}\n\n\n","file_path":"rust-kernel-rdma/KRdmaKit/unitests/qp/src/lib.rs","rank":31,"score":269084.58170586854},{"content":"// path resolve\n\nfn test_case_rc_3() {\n\n println!(\">>>>>> start [test_case_rc_3] <<<<<<<\");\n\n let ctx: &mut RContext = &mut ALLRCONTEXTS.get_mut()[0];\n\n let sa_client = &mut SA_CLIENT.get_mut();\n\n let mut explorer = IBExplorer::new();\n\n let remote_service_id = 50;\n\n let qd_hint = 73;\n\n\n\n let gid_addr = ctx.get_gid_as_string();\n\n let _ = explorer.resolve(1, ctx, &gid_addr, sa_client.get_inner_sa_client());\n\n\n\n // get path\n\n let boxed_ctx = Box::pin(ctx);\n\n // thus the path resolver could be split out of other module\n\n let path_res = explorer.get_path_result().unwrap();\n\n println!(\"finish path get\");\n\n // create Ctrl. serve for cm handshakes\n\n let ctrl =\n\n RCtrl::create(remote_service_id, &mut ALLRCONTEXTS.get_mut()[0]).unwrap();\n\n\n","file_path":"rust-kernel-rdma/KRdmaKit/unitests/qp/src/lib.rs","rank":32,"score":269071.14190493786},{"content":"// test for inner completion waiting\n\nfn test_case_rc_2() {\n\n let ctx: &mut RContext = &mut ALLRCONTEXTS.get_mut()[0];\n\n // sa client\n\n let rc = RC::new(ctx, core::ptr::null_mut(), null_mut());\n\n if rc.is_some() {\n\n println!(\"test_case_2 create RC success\");\n\n // check field getter\n\n let mut rc = rc.unwrap();\n\n let _mrc = unsafe { Arc::get_mut_unchecked(&mut rc) };\n\n }\n\n}\n\n\n\n\n","file_path":"rust-kernel-rdma/KRdmaKit/unitests/qp/src/lib.rs","rank":33,"score":269071.14190493786},{"content":"// QP state\n\nfn test_case_rc_overflow() {\n\n println!(\">>>>>> start [test_case_rc_3] <<<<<<<\");\n\n let ctx: &mut RContext = &mut ALLRCONTEXTS.get_mut()[0];\n\n let sa_client = &mut SA_CLIENT.get_mut();\n\n let mut explorer = IBExplorer::new();\n\n let remote_service_id = 50;\n\n let qd_hint = 73;\n\n\n\n let gid_addr = ctx.get_gid_as_string();\n\n let _ = explorer.resolve(1, ctx, &gid_addr, sa_client.get_inner_sa_client());\n\n\n\n // get path\n\n let boxed_ctx = Box::pin(ctx);\n\n // thus the path resolver could be split out of other module\n\n let path_res = explorer.get_path_result().unwrap();\n\n println!(\"finish path get\");\n\n // create Ctrl. serve for cm handshakes\n\n let _ctrl =\n\n RCtrl::create(remote_service_id, &mut ALLRCONTEXTS.get_mut()[0]).unwrap();\n\n\n","file_path":"rust-kernel-rdma/KRdmaKit/unitests/qp_state/src/lib.rs","rank":34,"score":266042.26010341936},{"content":"#[inline]\n\npub fn get_remote_dc_meta_unsafe(remote_gid: &String) -> &EndPoint {\n\n META_INFO.get_mut().get(remote_gid).unwrap()\n\n}\n\n\n","file_path":"KRdmaKit-syscall/src/client.rs","rank":35,"score":262657.5319884323},{"content":"fn print_test_msgs(test_case_idx: usize, assert: bool) {\n\n if assert {\n\n println!(\"{:?}\", crate::console_msgs::SUCC[test_case_idx]);\n\n } else {\n\n println!(\"{:?}\", crate::console_msgs::ERR[test_case_idx]);\n\n }\n\n}\n\n\n","file_path":"benchs/rc_read/src/lib.rs","rank":36,"score":247197.4433239854},{"content":"fn print_test_msgs(test_case_idx: usize, assert: bool) {\n\n if assert {\n\n println!(\"{:?}\", crate::console_msgs::SUCC[test_case_idx]);\n\n } else {\n\n println!(\"{:?}\", crate::console_msgs::ERR[test_case_idx]);\n\n }\n\n}\n\n\n","file_path":"exp/motiv-kit-breakdown/rc_break_down_client/src/lib.rs","rank":37,"score":241275.44186629463},{"content":"fn print_test_msgs(test_case_idx: usize, assert: bool) {\n\n if assert {\n\n println!(\"{:?}\", crate::console_msgs::SUCC[test_case_idx]);\n\n } else {\n\n println!(\"{:?}\", crate::console_msgs::ERR[test_case_idx]);\n\n }\n\n}\n\n\n","file_path":"rust-kernel-rdma/KRdmaKit/unitests/qp/src/lib.rs","rank":38,"score":239543.1613531036},{"content":"fn print_test_msgs(test_case_idx: usize, assert: bool) {\n\n if assert {\n\n println!(\"{:?}\", crate::console_msgs::SUCC[test_case_idx]);\n\n } else {\n\n println!(\"{:?}\", crate::console_msgs::ERR[test_case_idx]);\n\n }\n\n}\n\n\n","file_path":"rust-kernel-rdma/KRdmaKit/unitests/qp_state/src/lib.rs","rank":39,"score":238130.91383053956},{"content":"static struct ibv_exp_cq_family_v1 mlx5_poll_cq_family_unsafe_tbl[MLX5_POLL_CQ_NUM_CQE_SIZES] = {\n\n\t\t[MLX5_POLL_CQ_CQE_64] = {\n\n\t\t\t\t.poll_cnt = mlx5_poll_cnt_unsafe_cqe64,\n\n\t\t\t\t.poll_length = mlx5_poll_length_unsafe_cqe64,\n\n\t\t\t\t.poll_length_flags = mlx5_poll_length_flags_unsafe_cqe64,\n\n\t\t\t\t.poll_length_flags_mp_rq = mlx5_poll_length_flags_mp_rq_unsafe_cqe64,\n\n\t\t\t\t.poll_length_flags_cvlan = mlx5_poll_length_flags_cvlan_unsafe_cqe64,\n\n\t\t\t\t.poll_length_flags_mp_rq_cvlan = mlx5_poll_length_flags_mp_rq_cvlan_unsafe_cqe64,\n\n\t\t\t\t.poll_length_flags_ts = mlx5_poll_length_flags_ts_unsafe_cqe64,\n\n\t\t\t\t.poll_length_flags_mp_rq_ts = mlx5_poll_length_flags_mp_rq_ts_unsafe_cqe64,\n\n\t\t\t\t.poll_length_flags_cvlan_ts = mlx5_poll_length_flags_cvlan_ts_unsafe_cqe64,\n\n\t\t\t\t.poll_length_flags_mp_rq_cvlan_ts = mlx5_poll_length_flags_mp_rq_cvlan_ts_unsafe_cqe64,\n\n\n\n\t\t},\n\n\t\t[MLX5_POLL_CQ_CQE_128] = {\n\n\t\t\t\t.poll_cnt = mlx5_poll_cnt_unsafe_cqe128,\n\n\t\t\t\t.poll_length = mlx5_poll_length_unsafe_cqe128,\n\n\t\t\t\t.poll_length_flags = mlx5_poll_length_flags_unsafe_cqe128,\n\n\t\t\t\t.poll_length_flags_mp_rq = mlx5_poll_length_flags_mp_rq_unsafe_cqe128,\n\n\t\t\t\t.poll_length_flags_cvlan = mlx5_poll_length_flags_cvlan_unsafe_cqe128,\n\n\t\t\t\t.poll_length_flags_mp_rq_cvlan = mlx5_poll_length_flags_mp_rq_cvlan_unsafe_cqe128,\n\n\t\t\t\t.poll_length_flags_ts = mlx5_poll_length_flags_ts_unsafe_cqe128,\n\n\t\t\t\t.poll_length_flags_mp_rq_ts = mlx5_poll_length_flags_mp_rq_ts_unsafe_cqe128,\n\n\t\t\t\t.poll_length_flags_cvlan_ts = mlx5_poll_length_flags_cvlan_ts_unsafe_cqe128,\n\n\t\t\t\t.poll_length_flags_mp_rq_cvlan_ts = mlx5_poll_length_flags_mp_rq_cvlan_ts_unsafe_cqe128,\n\n\n\n\t\t},\n","file_path":"mlnx-ofed-4.9-driver/src/cq.c","rank":40,"score":237108.63234159735},{"content":"fn print_test_msgs(test_case_idx: usize, assert: bool) {\n\n if assert {\n\n println!(\"{:?}\", crate::console_msgs::SUCC[test_case_idx]);\n\n } else {\n\n println!(\"{:?}\", crate::console_msgs::ERR[test_case_idx]);\n\n }\n\n}\n\n\n","file_path":"rust-kernel-rdma/KRdmaKit/unitests/rc_conn_bug/src/lib.rs","rank":41,"score":237032.56560970872},{"content":"static struct ibv_exp_cq_family_v1 mlx5_poll_cq_family_unsafe_v1_tbl[MLX5_POLL_CQ_NUM_CQE_SIZES] = {\n\n\t\t[MLX5_POLL_CQ_CQE_64] = {\n\n\t\t\t\t.poll_cnt = mlx5_poll_cnt_unsafe_cqe64_v1,\n\n\t\t\t\t.poll_length = mlx5_poll_length_unsafe_cqe64_v1,\n\n\t\t\t\t.poll_length_flags = mlx5_poll_length_flags_unsafe_cqe64_v1,\n\n\t\t\t\t.poll_length_flags_mp_rq = mlx5_poll_length_flags_mp_rq_unsafe_cqe64_v1,\n\n\t\t\t\t.poll_length_flags_cvlan = mlx5_poll_length_flags_cvlan_unsafe_cqe64_v1,\n\n\t\t\t\t.poll_length_flags_mp_rq_cvlan = mlx5_poll_length_flags_mp_rq_cvlan_unsafe_cqe64_v1,\n\n\t\t\t\t.poll_length_flags_ts = mlx5_poll_length_flags_ts_unsafe_cqe64_v1,\n\n\t\t\t\t.poll_length_flags_mp_rq_ts = mlx5_poll_length_flags_mp_rq_ts_unsafe_cqe64_v1,\n\n\t\t\t\t.poll_length_flags_cvlan_ts = mlx5_poll_length_flags_cvlan_ts_unsafe_cqe64_v1,\n\n\t\t\t\t.poll_length_flags_mp_rq_cvlan_ts = mlx5_poll_length_flags_mp_rq_cvlan_ts_unsafe_cqe64_v1,\n\n\t\t},\n\n\t\t[MLX5_POLL_CQ_CQE_128] = {\n\n\t\t\t\t.poll_cnt = mlx5_poll_cnt_unsafe_cqe128_v1,\n\n\t\t\t\t.poll_length = mlx5_poll_length_unsafe_cqe128_v1,\n\n\t\t\t\t.poll_length_flags = mlx5_poll_length_flags_unsafe_cqe128_v1,\n\n\t\t\t\t.poll_length_flags_mp_rq = mlx5_poll_length_flags_mp_rq_unsafe_cqe128_v1,\n\n\t\t\t\t.poll_length_flags_cvlan = mlx5_poll_length_flags_cvlan_unsafe_cqe128_v1,\n\n\t\t\t\t.poll_length_flags_mp_rq_cvlan = mlx5_poll_length_flags_mp_rq_cvlan_unsafe_cqe128_v1,\n\n\t\t\t\t.poll_length_flags_ts = mlx5_poll_length_flags_ts_unsafe_cqe128_v1,\n\n\t\t\t\t.poll_length_flags_mp_rq_ts = mlx5_poll_length_flags_mp_rq_ts_unsafe_cqe128_v1,\n\n\t\t\t\t.poll_length_flags_cvlan_ts = mlx5_poll_length_flags_cvlan_ts_unsafe_cqe128_v1,\n\n\t\t\t\t.poll_length_flags_mp_rq_cvlan_ts = mlx5_poll_length_flags_mp_rq_cvlan_ts_unsafe_cqe128_v1,\n\n\t\t},\n","file_path":"mlnx-ofed-4.9-driver/src/cq.c","rank":42,"score":235795.50136792386},{"content":"static inline uint32_t mlx5_cq_read_wc_src_qp(struct ibv_cq_ex *ibcq)\n\n{\n\n\tstruct mlx5_cq *cq = to_mcq(ibv_cq_ex_to_cq(ibcq));\n\n\n\n\treturn be32toh(cq->cqe64->flags_rqpn) & 0xffffff;\n","file_path":"mlnx-ofed-4.9-driver/rdma-core-50mlnx1/providers/mlx5/cq.c","rank":52,"score":231653.85641517077},{"content":"static uint32_t mlx4_cq_read_wc_src_qp(struct ibv_cq_ex *ibcq)\n\n{\n\n\tstruct mlx4_cq *cq = to_mcq(ibv_cq_ex_to_cq(ibcq));\n\n\n\n\treturn be32toh(cq->cqe->g_mlpath_rqpn) & 0xffffff;\n","file_path":"mlnx-ofed-4.9-driver/rdma-core-50mlnx1/providers/mlx4/cq.c","rank":53,"score":231653.85641517077},{"content":"static inline uint32_t mlx5_cq_read_wc_qp_num(struct ibv_cq_ex *ibcq)\n\n{\n\n\tstruct mlx5_cq *cq = to_mcq(ibv_cq_ex_to_cq(ibcq));\n\n\n\n\treturn be32toh(cq->cqe64->sop_drop_qpn) & 0xffffff;\n","file_path":"mlnx-ofed-4.9-driver/rdma-core-50mlnx1/providers/mlx5/cq.c","rank":54,"score":231653.85641517077},{"content":"static uint32_t mlx4_cq_read_wc_qp_num(struct ibv_cq_ex *ibcq)\n\n{\n\n\tstruct mlx4_cq *cq = to_mcq(ibv_cq_ex_to_cq(ibcq));\n\n\n\n\treturn be32toh(cq->cqe->vlan_my_qpn) & MLX4_CQE_QPN_MASK;\n","file_path":"mlnx-ofed-4.9-driver/rdma-core-50mlnx1/providers/mlx4/cq.c","rank":55,"score":231653.85641517077},{"content":"int32_t mlx5_poll_cnt_unsafe_cqe64(struct ibv_cq *ibcq, uint32_t max) __MLX5_ALGN_F__;\n","file_path":"mlnx-ofed-4.9-driver/src/cq.c","rank":56,"score":224114.05446446425},{"content":"int32_t mlx5_poll_cnt_unsafe_cqe128(struct ibv_cq *ibcq, uint32_t max) __MLX5_ALGN_F__;\n","file_path":"mlnx-ofed-4.9-driver/src/cq.c","rank":57,"score":224114.05446446425},{"content":"int32_t mlx5_poll_length_unsafe_cqe64(struct ibv_cq *cq, void *buf, uint32_t *inl) __MLX5_ALGN_F__;\n","file_path":"mlnx-ofed-4.9-driver/src/cq.c","rank":58,"score":224114.05446446425},{"content":"int32_t mlx5_poll_length_unsafe_cqe128(struct ibv_cq *cq, void *buf, uint32_t *inl) __MLX5_ALGN_F__;\n","file_path":"mlnx-ofed-4.9-driver/src/cq.c","rank":59,"score":224114.05446446425},{"content":"void rvt_rc_error(struct rvt_qp *qp, enum ib_wc_status err);\n","file_path":"mlnx-ofed-4.9-driver/include/rdma/rdmavt_qp.h","rank":60,"score":223946.26278071397},{"content":"int32_t mlx5_poll_length_flags_unsafe_cqe128(struct ibv_cq *cq, void *buf, uint32_t *inl, uint32_t *flags) __MLX5_ALGN_F__;\n","file_path":"mlnx-ofed-4.9-driver/src/cq.c","rank":61,"score":222644.7316079224},{"content":"int32_t mlx5_poll_cnt_unsafe_cqe128_v1(struct ibv_cq *ibcq, uint32_t max) __MLX5_ALGN_F__;\n","file_path":"mlnx-ofed-4.9-driver/src/cq.c","rank":62,"score":222644.7316079224},{"content":"int32_t mlx5_poll_length_unsafe_cqe64_v1(struct ibv_cq *cq, void *buf, uint32_t *inl) __MLX5_ALGN_F__;\n","file_path":"mlnx-ofed-4.9-driver/src/cq.c","rank":63,"score":222644.7316079224},{"content":"int32_t mlx5_poll_length_flags_unsafe_cqe64(struct ibv_cq *cq, void *buf, uint32_t *inl, uint32_t *flags) __MLX5_ALGN_F__;\n","file_path":"mlnx-ofed-4.9-driver/src/cq.c","rank":64,"score":222644.7316079224},{"content":"int32_t mlx5_poll_length_unsafe_cqe128_v1(struct ibv_cq *cq, void *buf, uint32_t *inl) __MLX5_ALGN_F__;\n","file_path":"mlnx-ofed-4.9-driver/src/cq.c","rank":65,"score":222644.7316079224},{"content":"int32_t mlx5_poll_cnt_unsafe_cqe64_v1(struct ibv_cq *ibcq, uint32_t max) __MLX5_ALGN_F__;\n","file_path":"mlnx-ofed-4.9-driver/src/cq.c","rank":66,"score":222644.7316079224},{"content":"static int poll_soft_wc(struct mlx5_ib_cq *cq, int num_entries,\n\n\t\t\tstruct ib_wc *wc, bool is_fatal_err)\n\n{\n\n\tstruct mlx5_ib_dev *dev = to_mdev(cq->ibcq.device);\n\n\tstruct mlx5_ib_wc *soft_wc, *next;\n\n\tint npolled = 0;\n\n\n\n\tlist_for_each_entry_safe(soft_wc, next, &cq->wc_list, list) {\n\n\t\tif (npolled >= num_entries)\n\n\t\t\tbreak;\n\n\n\n\t\tmlx5_ib_dbg(dev, \"polled software generated completion on CQ 0x%x\\n\",\n\n\t\t\t cq->mcq.cqn);\n\n\n\n\t\tif (unlikely(is_fatal_err)) {\n\n\t\t\tsoft_wc->wc.status = IB_WC_WR_FLUSH_ERR;\n\n\t\t\tsoft_wc->wc.vendor_err = MLX5_CQE_SYNDROME_WR_FLUSH_ERR;\n\n\t\t}\n\n\t\twc[npolled++] = soft_wc->wc;\n\n\t\tlist_del(&soft_wc->list);\n\n\t\tatomic_set(&soft_wc->in_use, 0);\n\n\t}\n\n\n\n\treturn npolled;\n","file_path":"mlnx-ofed-4.9-driver/drivers/infiniband/hw/mlx5/cq.c","rank":67,"score":222640.25932711567},{"content":"static int poll_cq(struct ibv_cq *cq, int num_entries, struct ibv_wc *wc)\n\n{\n\n\treturn EOPNOTSUPP;\n","file_path":"mlnx-ofed-4.9-driver/rdma-core-50mlnx1/libibverbs/dummy_ops.c","rank":68,"score":222580.74870568598},{"content":"int32_t mlx5_poll_length_flags_ts_unsafe_cqe128(struct ibv_cq *cq, void *buf, uint32_t *inl, uint32_t *flags, uint64_t *timestamp) __MLX5_ALGN_F__;\n","file_path":"mlnx-ofed-4.9-driver/src/cq.c","rank":69,"score":221194.5494317126},{"content":"int32_t mlx5_poll_length_flags_cvlan_unsafe_cqe128(struct ibv_cq *cq, void *buf, uint32_t *inl, uint32_t *flags, uint16_t *vlan_cti) __MLX5_ALGN_F__;\n","file_path":"mlnx-ofed-4.9-driver/src/cq.c","rank":70,"score":221194.5494317126},{"content":"int32_t mlx5_poll_length_flags_cvlan_unsafe_cqe64(struct ibv_cq *cq, void *buf, uint32_t *inl, uint32_t *flags, uint16_t *vlan_cti) __MLX5_ALGN_F__;\n","file_path":"mlnx-ofed-4.9-driver/src/cq.c","rank":71,"score":221194.5494317126},{"content":"int32_t mlx5_poll_length_flags_ts_unsafe_cqe64(struct ibv_cq *cq, void *buf, uint32_t *inl, uint32_t *flags, uint64_t *timestamp) __MLX5_ALGN_F__;\n","file_path":"mlnx-ofed-4.9-driver/src/cq.c","rank":72,"score":221194.5494317126},{"content":"int32_t mlx5_poll_length_flags_unsafe_cqe64_v1(struct ibv_cq *cq, void *buf, uint32_t *inl, uint32_t *flags) __MLX5_ALGN_F__;\n","file_path":"mlnx-ofed-4.9-driver/src/cq.c","rank":73,"score":221194.5494317126},{"content":"int32_t mlx5_poll_length_flags_unsafe_cqe128_v1(struct ibv_cq *cq, void *buf, uint32_t *inl, uint32_t *flags) __MLX5_ALGN_F__;\n","file_path":"mlnx-ofed-4.9-driver/src/cq.c","rank":74,"score":221194.5494317126},{"content":"static int test_wc_poll_cq(struct mlx5_ib_dev *dev, struct ib_cq *cq)\n\n{\n\n\tint ret;\n\n\tstruct ib_wc wc = {};\n\n\tunsigned long end = jiffies + TEST_WC_POLLING_MAX_TIME_JIFFIES;\n\n\n\n\twhile (!time_after(jiffies, end)) {\n\n\t\tret = ib_poll_cq(cq, 1, &wc);\n\n\t\tif (ret < 0 || wc.status)\n\n\t\t\treturn ret ? ret : -EINVAL;\n\n\t\tif (ret)\n\n\t\t\tbreak;\n\n\t}\n\n\tif (!ret)\n\n\t\treturn -ETIMEDOUT;\n\n\n\n\tif (wc.wr_id == WR_ID_FINAL)\n\n\t\tdev->wc_support = MLX5_IB_WC_NOT_SUPPORTED;\n\n\telse if (wc.wr_id == WR_ID_BF)\n\n\t\tdev->wc_support = MLX5_IB_WC_SUPPORTED;\n\n\telse\n\n\t\treturn -EINVAL;\n\n\n\n\treturn 0;\n","file_path":"mlnx-ofed-4.9-driver/drivers/infiniband/hw/mlx5/mem.c","rank":75,"score":221190.10628081998},{"content":"pub fn xx() {\n\n let len = 20;\n\n let runtime = Runtime::new();\n\n let mut t1 = Task::new(async move {\n\n async_run(0).await\n\n });\n\n\n\n let mut t2 = Task::new(async move {\n\n async_run(1).await\n\n });\n\n\n\n let mut t3 = Task::new(async move {\n\n async_run(3).await\n\n });\n\n\n\n let h1 = t1.spawn(&runtime);\n\n let h3 = t3.spawn(&runtime);\n\n let h2 = t2.spawn(&runtime);\n\n h1.join();\n\n}\n","file_path":"KRdmaKit-syscall/src/nostd_async/mod.rs","rank":76,"score":220147.4700047007},{"content":"int32_t mlx5_poll_length_flags_cvlan_ts_unsafe_cqe64(struct ibv_cq *cq, void *buf, uint32_t *inl, uint32_t *flags,\n\n\t\t\t\t\t\t uint16_t *vlan_cti, uint64_t *timestamp)\n\n{\n\n\treturn __poll_length(cq, buf, inl, 0, 64, NULL, flags, 0, vlan_cti,\n\n\t\t\t timestamp);\n","file_path":"mlnx-ofed-4.9-driver/src/cq.c","rank":77,"score":219763.13634141098},{"content":"int32_t mlx5_poll_length_flags_cvlan_unsafe_cqe128_v1(struct ibv_cq *cq, void *buf, uint32_t *inl, uint32_t *flags, uint16_t *vlan_cti)\n\n{\n\n\treturn poll_length(cq, buf, inl, 0, 128, NULL, flags, 1, vlan_cti);\n","file_path":"mlnx-ofed-4.9-driver/src/cq.c","rank":78,"score":219763.13634141098},{"content":"int32_t mlx5_poll_length_flags_mp_rq_unsafe_cqe64(struct ibv_cq *cq, uint32_t *offset, uint32_t *flags)\n\n{\n\n\treturn poll_length(cq, NULL, NULL, 0, 64, offset, flags, 0, NULL);\n","file_path":"mlnx-ofed-4.9-driver/src/cq.c","rank":79,"score":219763.13634141098},{"content":"int32_t mlx5_poll_length_flags_ts_unsafe_cqe128_v1(struct ibv_cq *cq, void *buf, uint32_t *inl, uint32_t *flags, uint64_t *timestamp)\n\n{\n\n\treturn __poll_length(cq, buf, inl, 0, 128, NULL, flags, 1, NULL,\n\n\t\t\t timestamp);\n","file_path":"mlnx-ofed-4.9-driver/src/cq.c","rank":80,"score":219763.13634141098},{"content":"int32_t mlx5_poll_length_flags_mp_rq_unsafe_cqe128(struct ibv_cq *cq, uint32_t *offset, uint32_t *flags)\n\n{\n\n\treturn poll_length(cq, NULL, NULL, 0, 128, offset, flags, 0, NULL);\n","file_path":"mlnx-ofed-4.9-driver/src/cq.c","rank":81,"score":219763.13634141098},{"content":"int32_t mlx5_poll_length_flags_ts_unsafe_cqe64_v1(struct ibv_cq *cq, void *buf, uint32_t *inl, uint32_t *flags, uint64_t *timestamp)\n\n{\n\n\treturn __poll_length(cq, buf, inl, 0, 64, NULL, flags, 1, NULL,\n\n\t\t\t timestamp);\n","file_path":"mlnx-ofed-4.9-driver/src/cq.c","rank":82,"score":219763.13634141098},{"content":"int32_t mlx5_poll_length_flags_cvlan_unsafe_cqe64_v1(struct ibv_cq *cq, void *buf, uint32_t *inl, uint32_t *flags, uint16_t *vlan_cti)\n\n{\n\n\treturn poll_length(cq, buf, inl, 0, 64, NULL, flags, 1, vlan_cti);\n","file_path":"mlnx-ofed-4.9-driver/src/cq.c","rank":83,"score":219763.13634141098},{"content":" pub fn pop_recv_cq(&mut self, pop_cnt: u32, wc_list: *mut ib_wc) -> Option<usize> {\n\n let ret = unsafe { bd_ib_poll_cq(self.qp.get_recv_cq(), pop_cnt as i32, wc_list) };\n\n if ret < 0 {\n\n return None;\n\n } else if ret > 0 {\n\n return Some(ret as usize);\n\n }\n\n None\n\n }\n\n\n\n #[inline]\n\n pub fn post_recv(\n\n &mut self,\n\n local_ptr: u64,\n\n lkey: u32,\n\n sz: usize,\n\n ) -> linux_kernel_module::KernelResult<()> {\n\n let mut wr: ib_recv_wr = Default::default();\n\n let mut sge: ib_sge = Default::default();\n\n\n","file_path":"rust-kernel-rdma/KRdmaKit/src/qp/ud_op.rs","rank":84,"score":110.65178674240738},{"content":" #[inline]\n\n pub fn push(&mut self,\n\n op: u32, // RDMA operation type (denote the type `ib_wr_opcode`)\n\n local_ptr: u64, // local mr address\n\n lkey: u32, // local key\n\n sz: usize, // request size (in Byte)\n\n remote_addr: u64, // remote mr address\n\n rkey: u32, // remote key\n\n end_point: &EndPoint,\n\n send_flag: i32,\n\n ) -> linux_kernel_module::KernelResult<()> {\n\n let mut wr: ib_dc_wr = Default::default();\n\n let mut sge: ib_sge = Default::default();\n\n\n\n let ah = end_point.ah;\n\n let dct_num = end_point.dct_num;\n\n // 1. set the sge\n\n sge.addr = local_ptr;\n\n sge.length = sz as _;\n\n sge.lkey = lkey;\n","file_path":"rust-kernel-rdma/KRdmaKit/src/qp/dc_op.rs","rank":85,"score":82.30623896969156},{"content":" }\n\n}\n\n\n\nimpl<'a> UDOp<'a> {\n\n #[inline]\n\n pub fn push(\n\n &mut self,\n\n op: u32, // RDMA operation type (denote the type `ib_wr_opcode`)\n\n local_ptr: u64,\n\n lkey: u32,\n\n end_point: &EndPoint,\n\n sz: usize,\n\n imm_data: u32,\n\n send_flag: i32,\n\n ) -> linux_kernel_module::KernelResult<()> {\n\n let mut wr: ib_ud_wr = Default::default();\n\n let mut sge: ib_sge = Default::default();\n\n\n\n // first set the sge\n\n sge.addr = local_ptr;\n","file_path":"rust-kernel-rdma/KRdmaKit/src/qp/ud_op.rs","rank":86,"score":79.0904280403489},{"content":" }\n\n }\n\n }\n\n\n\n #[inline]\n\n pub fn pop(&mut self) -> Option<*mut ib_wc> {\n\n let mut wc: ib_wc = Default::default();\n\n let ret = unsafe { bd_ib_poll_cq(self.qp.get_cq(), 1, &mut wc as *mut ib_wc) };\n\n if ret < 0 {\n\n return None;\n\n } else if ret == 1 {\n\n if wc.status != 0 && wc.status != 5 {\n\n linux_kernel_module::println!(\"ud poll cq error, wc_status:{}\", wc.status);\n\n }\n\n return Some(&mut wc as *mut ib_wc);\n\n }\n\n None\n\n }\n\n\n\n #[inline]\n","file_path":"rust-kernel-rdma/KRdmaKit/src/qp/ud_op.rs","rank":87,"score":73.19983457625649},{"content":"\n\nimpl<'a, const N: usize> RPCClient<'a, N> {\n\n async fn post_recv(&mut self, post_cnt: u64) {\n\n let recv = unsafe { Arc::get_mut_unchecked(&mut self.recv_helper) };\n\n let _ = recv.post_recvs(self.queue_pair.get_qp(), null_mut(), post_cnt as usize);\n\n }\n\n\n\n pub async fn poll_all(&mut self) {\n\n use rust_kernel_linux_util::bindings::memcpy;\n\n\n\n let send_addr = self.send_buffer.get_dma_buf();\n\n let send_va = self.send_buffer.get_ptr();\n\n\n\n let lkey = unsafe { self.ctx.get_lkey() };\n\n let mut op = UDOp::new(self.queue_pair);\n\n let wc_header = unsafe { Arc::get_mut_unchecked(&mut self.recv_helper) }.get_wc_header();\n\n\n\n let timer = KTimer::new();\n\n loop {\n\n let pop_res = op.pop_recv_cq(N as u32, wc_header);\n","file_path":"rust-kernel-rdma/KRdmaKit/unitests/rpc/src/rpc.rs","rank":88,"score":71.93001311640899},{"content":" return ret;\n\n }\n\n cnt += 1;\n\n if cnt > 10000 {\n\n linux_kernel_module::println!(\"dc op wait til comp timeout!\");\n\n break;\n\n }\n\n }\n\n None\n\n }\n\n\n\n #[inline]\n\n pub fn pop(&mut self) -> Option<*mut ib_wc> {\n\n let mut wc: ib_wc = Default::default();\n\n let ret = unsafe { bd_ib_poll_cq(self.qp.get_cq(), 1, &mut wc as *mut ib_wc) };\n\n if ret < 0 {\n\n return None;\n\n } else if ret == 1 {\n\n return Some(&mut wc as *mut _);\n\n }\n\n None\n\n }\n\n}","file_path":"rust-kernel-rdma/KRdmaKit/src/qp/dc_op.rs","rank":89,"score":71.21749226760338},{"content":" let mut test_mr = RMemPhy::new(1024 * 1024);\n\n // 2. get all of the params for later operation\n\n let lkey = unsafe { boxed_ctx.get_lkey() } as u32;\n\n let rkey = lkey as u32;\n\n let laddr = test_mr.get_pa(0) as u64; // use pa for RCOp\n\n let raddr = test_mr.get_pa(1024) as u64;\n\n let sz = 8 as usize;\n\n\n\n // va of the mr. These addrs are used to read/write value in test function\n\n let va_buf = (test_mr.get_ptr() as u64 + 1024) as *mut i8;\n\n let target_buf = (test_mr.get_ptr()) as *mut i8;\n\n\n\n // now write a value\n\n let write_value = 99 as i8;\n\n unsafe { *(va_buf) = write_value };\n\n unsafe { *(target_buf) = 4 };\n\n println!(\"[before] value = {}\", unsafe { *(target_buf) });\n\n // 3. send request of type `READ`\n\n let mut op = RCOp::new(&rc);\n\n let _ = op.read(laddr, lkey, sz, raddr, rkey);\n","file_path":"rust-kernel-rdma/KRdmaKit/unitests/qp/src/lib.rs","rank":90,"score":70.61044681443659},{"content":" pub fn create(entry_size: usize, lkey: u32, base_addr: u64) -> Arc<Self> {\n\n let ret = Self {\n\n capacity: N,\n\n cur_idx: 0,\n\n wrs: Box::new_zeroed_slice_in(N as usize, VmallocAllocator),\n\n sges: Box::new_zeroed_slice_in(N as usize, VmallocAllocator),\n\n wcs: Box::new_zeroed_slice_in(N as usize, VmallocAllocator),\n\n en_sz: entry_size,\n\n };\n\n let mut boxed = Arc::new(ret);\n\n let recvs = unsafe { Arc::get_mut_unchecked(&mut boxed) };\n\n\n\n let mut base: u64 = base_addr;\n\n for i in 0..recvs.capacity {\n\n let sge = recvs.sges[i].as_mut_ptr();\n\n let wr = recvs.wrs[i].as_mut_ptr();\n\n\n\n unsafe {\n\n let base_va = { pa_to_va(base as *mut i8) } as u64;\n\n (*sge).addr = base as u64;\n","file_path":"rust-kernel-rdma/KRdmaKit/src/qp/recv_helper.rs","rank":91,"score":70.24932340990095},{"content":" send_reg_mr(mrc.get_qp(), v_mem.get_inner_mr(), DEFAULT_MR_ACCESS_FLAGS);\n\n rkey = unsafe { (*v_mem.get_inner_mr()).rkey } as u32;\n\n lkey = unsafe { (*v_mem.get_inner_mr()).lkey } as u32;\n\n local_pa = v_mem.get_dma_buf();\n\n remote_pa = v_mem.get_dma_buf();\n\n } else {\n\n let mut ret = RMemPhy::new(min(1024 * 1024 * 4, alloc_sz as usize));\n\n lkey = unsafe { boxed_ctx.get_lkey() } as u32;\n\n rkey = unsafe { boxed_ctx.get_lkey() } as u32;\n\n local_pa = p_mem.get_dma_buf();\n\n remote_pa = p_mem.get_dma_buf();\n\n };\n\n\n\n\n\n // 3. send request of type `READ`\n\n let mut op = RCOp::new(mrc);\n\n\n\n let mut op_count: u64 = 0;\n\n let mut rand = random::FastRandom::new(0xdeadbeaf);\n\n\n","file_path":"benchs/rc_read/src/rc_read.rs","rank":92,"score":70.0370947941143},{"content":" // unsafe { (*dct).dct_num },\n\n // &_ctrl.get_self_test_mr());\n\n // let dc = DC::new(ctx);\n\n // if dc.is_none() {\n\n // println!(\"[dct] err create dc qp.\");\n\n // return;\n\n // }\n\n //\n\n // println!(\"create dc success\");\n\n //\n\n // let mut dc = dc.unwrap();\n\n // let mdc = unsafe { Arc::get_mut_unchecked(&mut dc) };\n\n //\n\n // // 1. generate MR\n\n // let mut test_mr = RMemPhy::new(1024 * 1024);\n\n //\n\n // // 2. get all of the params for later operation\n\n // let lkey = unsafe { ctx.get_lkey() } as u32;\n\n // let rkey = lkey as u32;\n\n // let local_pa = test_mr.get_pa(0) as u64; // use pa for RCOp\n","file_path":"rust-kernel-rdma/KRdmaKit/unitests/dct/src/lib.rs","rank":93,"score":68.26411521739416},{"content":" let path_res = explorer.get_path_result().unwrap();\n\n\n\n // create RC at one side\n\n let rc = RC::new(ctx, core::ptr::null_mut(), core::ptr::null_mut());\n\n let sz = 64 as u64;\n\n let mut rc = rc.unwrap();\n\n let mrc = unsafe { Arc::get_mut_unchecked(&mut rc) };\n\n // connect to the server (Ctrl)\n\n let _ = mrc.connect(qd_hint, path_res, 1 as u64);\n\n let lkey = unsafe { (*mr).lkey } as u32;\n\n let rkey = unsafe { (*mr).rkey } as u32;\n\n let local_pa = dma_pa;\n\n let remote_pa = local_pa + sz;\n\n\n\n let mut op = RCOp::new(&rc);\n\n let _ = op.read(local_pa, lkey,\n\n 64 as usize, remote_pa, lkey);\n\n }\n\n\n\n unsafe fn bench_pin(mr: *mut ib_mr, address: u64, size: u64) -> u64 {\n","file_path":"KRdmaKit-syscall/src/virtual_queue.rs","rank":94,"score":68.01086777767878},{"content":" sz: usize, // request size (in Byte)\n\n remote_addr: u64, // remote mr address\n\n rkey: u32, // remote key\n\n end_point: &EndPoint,\n\n send_flag: i32,\n\n imm_data: u32,\n\n ) -> linux_kernel_module::KernelResult<()> {\n\n let mut wr: ib_dc_wr = Default::default();\n\n let mut sge: ib_sge = Default::default();\n\n\n\n let ah = end_point.ah;\n\n let dct_num = end_point.dct_num;\n\n // 1. set the sge\n\n sge.addr = local_ptr;\n\n sge.length = sz as _;\n\n sge.lkey = lkey;\n\n\n\n // 2. set the wr\n\n wr.wr.opcode = op;\n\n wr.wr.send_flags = send_flag;\n","file_path":"rust-kernel-rdma/KRdmaKit/src/qp/dc_op.rs","rank":95,"score":66.47607611447182},{"content":" // connect to the server (Ctrl)\n\n let _ = mrc.connect(qd_hint + 1, path_res, remote_service_id as u64);\n\n\n\n // 1. generate MR\n\n let mut test_mr = RMemPhy::new(1024 * 1024);\n\n // 2. get all of the params for later operation\n\n let lkey = unsafe { boxed_ctx.get_lkey() } as u32;\n\n let rkey = lkey as u32;\n\n let laddr = test_mr.get_pa(0) as u64; // use pa for RCOp\n\n let raddr = test_mr.get_pa(1024) as u64;\n\n let sz = 8 as usize;\n\n\n\n // va of the mr. These addrs are used to read/write value in test function\n\n let va_buf = (test_mr.get_ptr() as u64 + 1024) as *mut i8;\n\n let target_buf = (test_mr.get_ptr()) as *mut i8;\n\n\n\n // 3. send request of type `READ`\n\n let mut op = RCOp::new(&rc);\n\n\n\n\n","file_path":"exp/motiv-kit-breakdown/rc_break_down_client/src/lib.rs","rank":96,"score":66.08398631814222},{"content":" sge.addr = local_ptr as u64;\n\n sge.length = sz as u32;\n\n sge.lkey = lkey as u32;\n\n\n\n // 1. reset the wr\n\n wr.sg_list = &mut sge as *mut _;\n\n wr.num_sge = 1;\n\n unsafe { bd_set_recv_wr_id(&mut wr, pa_to_va(local_ptr as *mut i8)) };\n\n let mut bad_wr: *mut ib_recv_wr = core::ptr::null_mut();\n\n let err = unsafe {\n\n bd_ib_post_recv(\n\n self.qp.get_qp(),\n\n &mut wr as *mut _,\n\n &mut bad_wr as *mut _,\n\n )\n\n };\n\n\n\n if err != 0 {\n\n println!(\"error when post recv {}\", err);\n\n return Err(Error::from_kernel_errno(err));\n\n }\n\n\n\n Ok(())\n\n }\n\n}\n","file_path":"rust-kernel-rdma/KRdmaKit/src/qp/ud_op.rs","rank":97,"score":65.95114441207579},{"content":" println!(\"[after] value = {}\", unsafe { *(target_buf) });\n\n print_test_msgs(0, unsafe { *(target_buf) } == write_value);\n\n\n\n\n\n let mut profile = Profile::new();\n\n profile.reset_timer();\n\n let running_cnt = 40000;\n\n for _ in 0..running_cnt {\n\n if op.push(ib_wr_opcode::IB_WR_RDMA_WRITE,\n\n (unsafe { pa_to_va(laddr as *mut i8) }) as u64, lkey, 32, raddr, rkey,\n\n ib_send_flags::IB_SEND_SIGNALED | ib_send_flags::IB_SEND_INLINE).is_err() {\n\n println!(\"push error\");\n\n return;\n\n };\n\n\n\n let mut cnt = 0;\n\n loop {\n\n let ret = op.pop();\n\n if ret.is_some() {\n\n break;\n","file_path":"rust-kernel-rdma/KRdmaKit/unitests/qp/src/lib.rs","rank":98,"score":65.9339681318883},{"content":"use rust_kernel_rdma_base::*;\n\npub const DEFAULT_BATCH_SZ: usize = 64;\n\n\n\npub struct DoorbellHelper {\n\n pub wrs: [ib_rdma_wr; DEFAULT_BATCH_SZ],\n\n pub sges: [ib_sge; DEFAULT_BATCH_SZ],\n\n\n\n cur_idx: isize,\n\n capacity: usize,\n\n}\n\n\n\nimpl DoorbellHelper {\n\n pub fn create(capacity: usize, op: u32) -> Self {\n\n let mut ret = Self {\n\n capacity,\n\n cur_idx: -1,\n\n wrs: [Default::default(); DEFAULT_BATCH_SZ],\n\n sges: [Default::default(); DEFAULT_BATCH_SZ],\n\n };\n\n for i in 0..capacity {\n","file_path":"rust-kernel-rdma/KRdmaKit/src/qp/doorbell.rs","rank":99,"score":65.7109583530209}],"string":"[\n {\n \"content\": \"#[inline]\\n\\nfn create_ib_qp(config: &Config, pd: *mut ib_pd, qp_type: u32, cq: *mut ib_cq, recv_cq: *mut ib_cq, srq: *mut ib_srq) -> *mut ib_qp {\\n\\n let mut qp_attr: ib_qp_init_attr = Default::default();\\n\\n qp_attr.cap.max_send_wr = config.max_send_wr_sz as u32;\\n\\n qp_attr.cap.max_recv_wr = config.max_recv_wr_sz as u32;\\n\\n qp_attr.cap.max_recv_sge = config.max_recv_sge as u32;\\n\\n qp_attr.cap.max_send_sge = config.max_send_sge as u32;\\n\\n qp_attr.cap.max_inline_data = 64 as u32;\\n\\n qp_attr.sq_sig_type = ib_sig_type::IB_SIGNAL_REQ_WR;\\n\\n qp_attr.qp_type = qp_type;\\n\\n qp_attr.send_cq = cq;\\n\\n qp_attr.recv_cq = recv_cq;\\n\\n qp_attr.srq = srq;\\n\\n\\n\\n unsafe { ib_create_qp(pd, &mut qp_attr as *mut ib_qp_init_attr) }\\n\\n}\\n\\n\\n\\n\\n\\n/// Fetch the status of one target qp\\n\",\n \"file_path\": \"rust-kernel-rdma/KRdmaKit/src/qp/mod.rs\",\n \"rank\": 0,\n \"score\": 466219.8060344838\n },\n {\n \"content\": \"#[inline]\\n\\npub fn create_dc_qp(ctx: &RContext, srq: *mut ib_srq, recv_cq: *mut ib_cq) -> (*mut ib_qp, *mut ib_cq, *mut ib_cq) {\\n\\n let pd = ctx.get_pd();\\n\\n if pd.is_null() {\\n\\n println!(\\\"[dct] err creating qp pd\\\");\\n\\n return (\\n\\n core::ptr::null_mut(),\\n\\n core::ptr::null_mut(),\\n\\n core::ptr::null_mut(),\\n\\n );\\n\\n }\\n\\n\\n\\n let mut cq_attr: ib_cq_init_attr = Default::default();\\n\\n cq_attr.cqe = 128;\\n\\n\\n\\n let cq = create_ib_cq(ctx.get_raw_dev(), &mut cq_attr as *mut _);\\n\\n if cq.is_null() {\\n\\n println!(\\\"[dct] qp null cq\\\");\\n\\n return (\\n\\n core::ptr::null_mut(),\\n\\n core::ptr::null_mut(),\\n\",\n \"file_path\": \"rust-kernel-rdma/KRdmaKit/src/qp/mod.rs\",\n \"rank\": 1,\n \"score\": 464611.8399973218\n },\n {\n \"content\": \"#[inline]\\n\\npub fn handle_pop_ret(pop_ret: Option<*mut ib_wc>,\\n\\n req: &mut req_t,\\n\\n wc_len: usize,\\n\\n payload_sz: u32) -> u32 {\\n\\n match pop_ret {\\n\\n Some(wc) => {\\n\\n\\n\\n // assemble each wc element\\n\\n let wc_sz: u64 = core::mem::size_of::<ib_wc>() as u64;\\n\\n for i in 0..(wc_len as u64) {\\n\\n // assemble the wc\\n\\n let mut user_wc: user_wc_t = Default::default();\\n\\n let wc = unsafe { *((wc as u64 + i * wc_sz) as *const ib_wc) };\\n\\n user_wc.wc_op = wc.opcode;\\n\\n let va = wc.get_wr_id() as u64;\\n\\n user_wc.wc_wr_id = wc.get_wr_id() as u64;\\n\\n user_wc.wc_status = wc.status;\\n\\n user_wc.imm_data = unsafe { wc.ex.imm_data } as u32;\\n\\n unsafe {\\n\\n rust_kernel_linux_util::bindings::memcpy(\\n\",\n \"file_path\": \"KRdmaKit-syscall/src/core.rs\",\n \"rank\": 2,\n \"score\": 458854.8100402253\n },\n {\n \"content\": \"#[inline]\\n\\npub fn get_qp_status(ib_qp: *mut ib_qp) -> Option<u32> {\\n\\n let mut attr: ib_qp_attr = Default::default();\\n\\n let mut init_attr: ib_qp_init_attr = Default::default();\\n\\n\\n\\n // query\\n\\n let ret = unsafe {\\n\\n ib_query_qp(\\n\\n ib_qp,\\n\\n &mut attr as *mut ib_qp_attr,\\n\\n ib_qp_attr_mask::IB_QP_STATE,\\n\\n &mut init_attr as *mut ib_qp_init_attr,\\n\\n )\\n\\n };\\n\\n\\n\\n if ret != 0 {\\n\\n return None;\\n\\n }\\n\\n\\n\\n Some(attr.qp_state)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"rust-kernel-rdma/KRdmaKit/src/qp/mod.rs\",\n \"rank\": 3,\n \"score\": 452172.54415150254\n },\n {\n \"content\": \"#[inline]\\n\\npub fn send_reg_mr(qp: *mut ib_qp, mr: *mut ib_mr, access_flags: u32, whether_signaled: bool) -> c_types::c_int {\\n\\n let rkey = unsafe { (*mr).rkey };\\n\\n let mut wr: ib_reg_wr = Default::default();\\n\\n\\n\\n wr.wr.opcode = ib_wr_opcode::IB_WR_REG_MR;\\n\\n wr.wr.num_sge = 0;\\n\\n wr.wr.send_flags = if whether_signaled { ib_send_flags::IB_SEND_SIGNALED } else { 0 };\\n\\n wr.mr = mr;\\n\\n wr.key = rkey;\\n\\n wr.access = access_flags as i32;\\n\\n let mut bad_wr: *mut ib_send_wr = core::ptr::null_mut();\\n\\n\\n\\n unsafe {\\n\\n bd_ib_post_send(qp, &mut wr.wr as *mut _,\\n\\n &mut bad_wr as *mut _, )\\n\\n }\\n\\n}\\n\\n\\n\\n\\n\\nconst DC_KEY: u64 = 73;\\n\\n\\n\\n\\n\\n// this function has memory leakage, but its fine since it is in the unittest\\n\",\n \"file_path\": \"rust-kernel-rdma/KRdmaKit/src/qp/mod.rs\",\n \"rank\": 4,\n \"score\": 437061.1890109604\n },\n {\n \"content\": \"#[inline]\\n\\npub fn pop_recv(core_id: usize, pop_cnt: usize, offset: usize) -> (Option<*mut ib_wc>, usize) {\\n\\n let ctrl = get_global_rctrl(core_id);\\n\\n\\n\\n let recv_cq = ctrl.get_recv_cq();\\n\\n let recv = unsafe { Arc::get_mut_unchecked(ctrl.get_recv_buffer()) };\\n\\n recv.pop_recvs(recv_cq, pop_cnt, offset).unwrap()\\n\\n}\\n\\n\\n\\n\\n\",\n \"file_path\": \"KRdmaKit-syscall/src/core.rs\",\n \"rank\": 5,\n \"score\": 427122.63642619736\n },\n {\n \"content\": \"#[inline]\\n\\npub fn op_code_table(op: u32) -> u32 {\\n\\n use KRdmaKit::rust_kernel_rdma_base::*;\\n\\n use crate::bindings::*;\\n\\n match op {\\n\\n lib_r_req::Read => ib_wr_opcode::IB_WR_RDMA_READ,\\n\\n lib_r_req::Write => ib_wr_opcode::IB_WR_RDMA_WRITE,\\n\\n lib_r_req::Send => ib_wr_opcode::IB_WR_SEND,\\n\\n lib_r_req::SendImm => ib_wr_opcode::IB_WR_SEND_WITH_IMM,\\n\\n lib_r_req::WriteImm => ib_wr_opcode::IB_WR_RDMA_WRITE_WITH_IMM,\\n\\n _ => unimplemented!(),\\n\\n }\\n\\n}\\n\\n\\n\\nimpl Drop for KRdmaKitSyscallModule {\\n\\n fn drop(&mut self) {\\n\\n println!(\\\"Goodbye KRdma syscall module!\\\");\\n\\n }\\n\\n}\\n\\n\\n\\nlinux_kernel_module::kernel_module!(\\n\\n KRdmaKitSyscallModule,\\n\\n author: b\\\"anonymous\\\",\\n\\n description: b\\\"KRdmaKit syscall tier\\\",\\n\\n license: b\\\"GPL\\\"\\n\\n);\\n\",\n \"file_path\": \"KRdmaKit-syscall/src/lib.rs\",\n \"rank\": 6,\n \"score\": 426301.1635615169\n },\n {\n \"content\": \"/// Main func for qp connection in kernel space.\\n\\n/// The runtime latency of this function should be profiled in a more detailed way.\\n\\npub fn qp_connect(vid: usize, port: usize, path_rec: &sa_path_rec) -> KernelResult<Option<Arc<RC>>> {\\n\\n let remote_service_id = port as u64;\\n\\n let ctrl = get_global_rctrl(remote_service_id as usize);\\n\\n let ctx = ctrl.get_context();\\n\\n // create local qp\\n\\n let rc = RC::new_with_srq(\\n\\n Default::default(),\\n\\n ctx, null_mut(),\\n\\n null_mut(),\\n\\n ctrl.get_recv_cq(),\\n\\n );\\n\\n if rc.is_some() {\\n\\n let mut qp = rc.unwrap();\\n\\n let mrc = unsafe { Arc::get_mut_unchecked(&mut qp) };\\n\\n // connect handshake(param `vid` is useless)\\n\\n mrc.connect(vid as u64, *path_rec, remote_service_id)?;\\n\\n return Ok(Some(qp));\\n\\n }\\n\\n Ok(None)\\n\\n}\\n\\n\\n\\n\\n\",\n \"file_path\": \"KRdmaKit-syscall/src/core.rs\",\n \"rank\": 7,\n \"score\": 403858.64189286804\n },\n {\n \"content\": \"#[inline]\\n\\npub fn bring_dc_to_ready(qp: *mut ib_qp) -> bool {\\n\\n if !unsafe { bring_dc_to_init(qp) } {\\n\\n println!(\\\"[dct] err to re-bring to init.\\\");\\n\\n return false;\\n\\n }\\n\\n if !unsafe { bring_dc_to_rtr(qp) } {\\n\\n println!(\\\"[dct] err to re-bring to rtr.\\\");\\n\\n return false;\\n\\n }\\n\\n if !unsafe { bring_dc_to_rts(qp) } {\\n\\n println!(\\\"[dct] err to re-bring to rts.\\\");\\n\\n return false;\\n\\n }\\n\\n return true;\\n\\n}\\n\\n\\n\\n#[inline]\\n\\npub unsafe fn bring_dc_to_init(qp: *mut ib_qp) -> bool {\\n\\n let mut attr: ib_qp_attr = Default::default();\\n\\n let mut mask: linux_kernel_module::c_types::c_int = ib_qp_attr_mask::IB_QP_STATE;\\n\",\n \"file_path\": \"rust-kernel-rdma/KRdmaKit/src/qp/mod.rs\",\n \"rank\": 8,\n \"score\": 386292.1433961146\n },\n {\n \"content\": \"#[inline]\\n\\npub fn get_global_test_mem_pa(idx: usize) -> u64 {\\n\\n let len = GLOBAL_MEM.get_ref().len();\\n\\n { &mut GLOBAL_MEM.get_mut()[idx % len] }.get_dma_buf()\\n\\n}\\n\\n\\n\",\n \"file_path\": \"KRdmaKit-syscall/src/client.rs\",\n \"rank\": 9,\n \"score\": 360808.9233564251\n },\n {\n \"content\": \"#[inline]\\n\\npub fn create_dct_server(pd: *mut ib_pd, device: *mut ib_device) -> *mut ib_dct {\\n\\n let mut cq_attr: ib_cq_init_attr = Default::default();\\n\\n cq_attr.cqe = 128;\\n\\n\\n\\n let cq = create_ib_cq(device, &mut cq_attr as *mut _);\\n\\n\\n\\n\\n\\n if cq.is_null() {\\n\\n println!(\\\"[dct] err dct server cq null\\\");\\n\\n return core::ptr::null_mut();\\n\\n }\\n\\n\\n\\n // create srq\\n\\n let mut cq_attr: ib_srq_init_attr = Default::default();\\n\\n cq_attr.attr.max_wr = 128;\\n\\n cq_attr.attr.max_sge = 1;\\n\\n\\n\\n let srq = unsafe { ib_create_srq(pd, &mut cq_attr as _) };\\n\\n\\n\\n if srq.is_null() {\\n\",\n \"file_path\": \"rust-kernel-rdma/KRdmaKit/src/qp/mod.rs\",\n \"rank\": 10,\n \"score\": 360084.4312719493\n },\n {\n \"content\": \"#[inline]\\n\\npub fn post_recv(core_id: usize, post_cnt: usize, vid: usize) -> u32 {\\n\\n let ctrl = get_global_rctrl(core_id);\\n\\n let qp = ctrl.get_trc(vid).unwrap().get_qp();\\n\\n let recv_buffer = ctrl.get_recv_buffer();\\n\\n let recv = unsafe { Arc::get_mut_unchecked(recv_buffer) };\\n\\n return match recv.post_recvs(qp, core::ptr::null_mut(), post_cnt) {\\n\\n Ok(_) => {\\n\\n reply_status::ok\\n\\n }\\n\\n Err(_) => reply_status::err\\n\\n };\\n\\n}\\n\\n\\n\",\n \"file_path\": \"KRdmaKit-syscall/src/core.rs\",\n \"rank\": 11,\n \"score\": 355664.0710599885\n },\n {\n \"content\": \"#[inline]\\n\\npub fn create_ib_ah(pd: *mut ib_pd, lid: u16, gid: ib_gid) -> *mut ib_ah {\\n\\n let mut ah_attr: rdma_ah_attr = Default::default();\\n\\n ah_attr.type_ = rdma_ah_attr_type::RDMA_AH_ATTR_TYPE_IB;\\n\\n\\n\\n unsafe { bd_rdma_ah_set_dlid(&mut ah_attr, lid as u32); }\\n\\n ah_attr.sl = 0;\\n\\n ah_attr.port_num = 1;\\n\\n\\n\\n unsafe {\\n\\n ah_attr.grh.dgid.global.subnet_prefix = gid.global.subnet_prefix;\\n\\n ah_attr.grh.dgid.global.interface_id = gid.global.interface_id;\\n\\n }\\n\\n\\n\\n let res = unsafe { rdma_create_ah_wrapper(pd, &mut ah_attr as _) };\\n\\n\\n\\n // maybe, we should wrapper ptr_is_err because this function is 100% safe\\n\\n if unsafe { ptr_is_err(res as _) } > 0 {\\n\\n return core::ptr::null_mut();\\n\\n }\\n\\n res\\n\\n}\\n\\n\\n\",\n \"file_path\": \"rust-kernel-rdma/KRdmaKit/src/qp/mod.rs\",\n \"rank\": 12,\n \"score\": 340542.59299386904\n },\n {\n \"content\": \"#[inline]\\n\\npub fn get_global_rcontext(idx: usize) -> &'static mut RContext<'static> {\\n\\n let len = ALLRCONTEXTS.len();\\n\\n let ctx = &mut ALLRCONTEXTS.get_mut()[idx % len];\\n\\n return ctx;\\n\\n}\\n\\n\\n\",\n \"file_path\": \"KRdmaKit-syscall/src/client.rs\",\n \"rank\": 13,\n \"score\": 340347.6572164519\n },\n {\n \"content\": \"#[inline]\\n\\npub fn get_rpc_client(idx: usize) -> &'static mut RPCClient<'static, RPC_BUFFER_N> {\\n\\n let len = RPC_CLIENTS.len();\\n\\n &mut RPC_CLIENTS.get_mut()[idx % len]\\n\\n}\\n\\n\\n\",\n \"file_path\": \"KRdmaKit-syscall/src/client.rs\",\n \"rank\": 14,\n \"score\": 330970.29328382213\n },\n {\n \"content\": \"#[inline]\\n\\npub fn get_global_rctrl(idx: usize) -> &'static mut Pin<Box<RCtrl<'static>>> {\\n\\n let len = RCTRL.len();\\n\\n &mut RCTRL.get_mut()[idx % len]\\n\\n}\\n\\n\\n\",\n \"file_path\": \"KRdmaKit-syscall/src/client.rs\",\n \"rank\": 15,\n \"score\": 329778.13380939426\n },\n {\n \"content\": \"#[inline]\\n\\npub fn get_bind_ctrl(port: usize) -> &'static mut Pin<Box<RCtrl<'static>>> {\\n\\n get_global_rctrl(port * 2)\\n\\n}\\n\\n\\n\\n\\n\",\n \"file_path\": \"KRdmaKit-syscall/src/client.rs\",\n \"rank\": 16,\n \"score\": 329778.13380939426\n },\n {\n \"content\": \"fn wait_one_cq(cq: *mut ib_cq) {\\n\\n let mut wc: ib_wc = Default::default();\\n\\n let mut run_cnt = 0;\\n\\n loop {\\n\\n let ret = unsafe { bd_ib_poll_cq(cq, 1, &mut wc as *mut ib_wc) };\\n\\n if ret < 0 {\\n\\n linux_kernel_module::println!(\\\"ret < 0\\\");\\n\\n break;\\n\\n } else if ret == 1 {\\n\\n if wc.status != 0 && wc.status != 5 {\\n\\n linux_kernel_module::println!(\\\"rc poll cq error, wc_status:{}\\\", wc.status);\\n\\n }\\n\\n break;\\n\\n } else {\\n\\n run_cnt += 1;\\n\\n if run_cnt > 10000 {\\n\\n linux_kernel_module::println!(\\\"timeout\\\");\\n\\n break;\\n\\n }\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"rust-kernel-rdma/KRdmaKit/unitests/rfork/src/frwr.rs\",\n \"rank\": 17,\n \"score\": 311729.31154907483\n },\n {\n \"content\": \"fn wait_one_cq(cq: *mut ib_cq) {\\n\\n let mut wc: ib_wc = Default::default();\\n\\n let mut run_cnt = 0;\\n\\n loop {\\n\\n let ret = unsafe { bd_ib_poll_cq(cq, 1, &mut wc as *mut ib_wc) };\\n\\n if ret < 0 {\\n\\n linux_kernel_module::println!(\\\"ret < 0\\\");\\n\\n break;\\n\\n } else if ret == 1 {\\n\\n if wc.status != 0 && wc.status != 5 {\\n\\n linux_kernel_module::println!(\\\"rc poll cq error, wc_status:{}\\\", wc.status);\\n\\n }\\n\\n break;\\n\\n } else {\\n\\n run_cnt += 1;\\n\\n if run_cnt > 10000 {\\n\\n linux_kernel_module::println!(\\\"timeout\\\");\\n\\n break;\\n\\n }\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"rust-kernel-rdma/KRdmaKit/unitests/reg_mr/src/lib.rs\",\n \"rank\": 18,\n \"score\": 310497.6772806411\n },\n {\n \"content\": \"#[inline]\\n\\npub fn random_split(total: u64, shard_num: u64) -> Vec<u64> {\\n\\n let mut rand = random::FastRandom::new(0xdeadbeaf);\\n\\n let mut result: Vec<u64> = Vec::with_capacity(shard_num as usize);\\n\\n let mut sum = 0 as u64;\\n\\n for _ in 0..shard_num - 1 {\\n\\n let tmp = total - sum;\\n\\n let mut val = rand.get_next() % tmp;\\n\\n result.push(val);\\n\\n sum += val;\\n\\n }\\n\\n result.push(total - sum);\\n\\n result\\n\\n}\\n\\n\\n\\nimpl linux_kernel_module::KernelModule for RegMRTestModule {\\n\\n fn init() -> linux_kernel_module::KernelResult<Self> {\\n\\n ctx_init();\\n\\n // bench_frwr(); // FRWR\\n\\n // bench_pin();\\n\\n // bench_vma();\\n\",\n \"file_path\": \"rust-kernel-rdma/KRdmaKit/unitests/rfork/src/lib.rs\",\n \"rank\": 19,\n \"score\": 302908.6219936725\n },\n {\n \"content\": \"/// Return back the reply length in bytes\\n\\ntype RpcHandlerT = fn(req_addr: u64, reply_addr: u64) -> u32;\\n\\n\\n\\n\\n\\n/// RPC Client based on UD\\n\\n///\\n\\n/// TODO: maybe we could extend to DC / RC ?\\n\\npub struct RPCClient<'a, const N: usize> {\\n\\n queue_pair: &'a Arc<UD>,\\n\\n ctx: &'a RContext<'a>,\\n\\n endpoint: EndPoint,\\n\\n\\n\\n send_buffer: RMemPhy,\\n\\n recv_buffer: RMemPhy,\\n\\n recv_helper: Arc<RecvHelper<N>>,\\n\\n\\n\\n reg_handlers: HashMap<u8, RpcHandlerT>,\\n\\n listened: bool,\\n\\n}\\n\\n\\n\\nimpl<'a, const N: usize> RPCClient<'a, N> {\\n\",\n \"file_path\": \"KRdmaKit-syscall/src/rpc/client.rs\",\n \"rank\": 20,\n \"score\": 295492.02494323323\n },\n {\n \"content\": \"/// Return back the reply length in bytes\\n\\ntype RpcHandlerT = fn(req_addr: u64, reply_addr: u64) -> u32;\\n\\n\\n\\n\\n\\n/// RPC Client based on UD\\n\\n///\\n\\n/// TODO: maybe we could extend to DC / RC ?\\n\\npub struct RPCClient<'a, const N: usize> {\\n\\n queue_pair: &'a Arc<UD>,\\n\\n ctx: &'a RContext<'a>,\\n\\n endpoint: &'a EndPoint,\\n\\n\\n\\n send_buffer: RMemPhy,\\n\\n recv_buffer: RMemPhy,\\n\\n recv_helper: Arc<RecvHelper<N>>,\\n\\n\\n\\n reg_handlers: HashMap<u8, RpcHandlerT>,\\n\\n listened: bool,\\n\\n}\\n\\n\\n\\nimpl<'a, const N: usize> RPCClient<'a, N> {\\n\",\n \"file_path\": \"rust-kernel-rdma/KRdmaKit/unitests/rpc/src/rpc.rs\",\n \"rank\": 21,\n \"score\": 291639.58202354633\n },\n {\n \"content\": \"pub fn demo_use_two_nics() {\\n\\n use crate::ib_wc;\\n\\n let ctx: &mut RContext = &mut ALLRCONTEXTS.get_mut()[0];\\n\\n let ctx_1: &mut RContext = &mut ALLRCONTEXTS.get_mut()[1];\\n\\n let sa_client = &mut SA_CLIENT.get_mut();\\n\\n\\n\\n // preparation\\n\\n let mut explorer = IBExplorer::new();\\n\\n\\n\\n let gid_addr = ctx.get_gid_as_string();\\n\\n let _ = explorer.resolve(1, ctx, &gid_addr, sa_client.get_inner_sa_client());\\n\\n\\n\\n let path_res = explorer.get_path_result().unwrap();\\n\\n // param\\n\\n let remote_service_id = 50;\\n\\n let qd_hint = 73;\\n\\n\\n\\n let mut ctrl = RCtrl::create(remote_service_id, &mut ALLRCONTEXTS.get_mut()[0]).unwrap();\\n\\n // end of preparation\\n\\n // let cm = SidrCM::new(ctx, core::ptr::null_mut());\\n\",\n \"file_path\": \"rust-kernel-rdma/KRdmaKit/unitests/rfork/src/two_nic.rs\",\n \"rank\": 22,\n \"score\": 288753.6215825609\n },\n {\n \"content\": \"static void\\n\\nmlx5_send_wr_set_sge_rc_uc(struct ibv_qp_ex *ibqp, uint32_t lkey,\\n\\n\\t\\t\\t uint64_t addr, uint32_t length)\\n\\n{\\n\\n\\tstruct mlx5_qp *mqp = to_mqp((struct ibv_qp *)ibqp);\\n\\n\\n\\n\\t_mlx5_send_wr_set_sge(mqp, lkey, addr, length);\\n\\n\\t_common_wqe_finilize(mqp);\\n\",\n \"file_path\": \"mlnx-ofed-4.9-driver/rdma-core-50mlnx1/providers/mlx5/qp.c\",\n \"rank\": 23,\n \"score\": 287312.43589922565\n },\n {\n \"content\": \"#[inline]\\n\\npub fn get_global_sa_client() -> &'static mut SAClient {\\n\\n SA_CLIENT.get_mut()\\n\\n}\\n\\n\\n\",\n \"file_path\": \"KRdmaKit-syscall/src/client.rs\",\n \"rank\": 24,\n \"score\": 285528.2577175508\n },\n {\n \"content\": \"static void\\n\\nmlx5_send_wr_set_inline_data_rc_uc(struct ibv_qp_ex *ibqp, void *addr,\\n\\n\\t\\t\\t\\t size_t length)\\n\\n{\\n\\n\\tstruct mlx5_qp *mqp = to_mqp((struct ibv_qp *)ibqp);\\n\\n\\n\\n\\t_mlx5_send_wr_set_inline_data(mqp, addr, length);\\n\\n\\t_common_wqe_finilize(mqp);\\n\",\n \"file_path\": \"mlnx-ofed-4.9-driver/rdma-core-50mlnx1/providers/mlx5/qp.c\",\n \"rank\": 25,\n \"score\": 285506.6880102676\n },\n {\n \"content\": \"static void\\n\\nmlx5_send_wr_set_sge_list_rc_uc(struct ibv_qp_ex *ibqp, size_t num_sge,\\n\\n\\t\\t\\t\\tconst struct ibv_sge *sg_list)\\n\\n{\\n\\n\\tstruct mlx5_qp *mqp = to_mqp((struct ibv_qp *)ibqp);\\n\\n\\n\\n\\t_mlx5_send_wr_set_sge_list(mqp, num_sge, sg_list);\\n\\n\\t_common_wqe_finilize(mqp);\\n\",\n \"file_path\": \"mlnx-ofed-4.9-driver/rdma-core-50mlnx1/providers/mlx5/qp.c\",\n \"rank\": 26,\n \"score\": 285500.0684744517\n },\n {\n \"content\": \"#[inline]\\n\\npub fn get_global_rctrl_len() -> usize {\\n\\n RCTRL.len()\\n\\n}\\n\\n\\n\",\n \"file_path\": \"KRdmaKit-syscall/src/client.rs\",\n \"rank\": 27,\n \"score\": 283833.28235310136\n },\n {\n \"content\": \"static void\\n\\nmlx5_send_wr_set_inline_data_list_rc_uc(struct ibv_qp_ex *ibqp,\\n\\n\\t\\t\\t\\t\\tsize_t num_buf,\\n\\n\\t\\t\\t\\t\\tconst struct ibv_data_buf *buf_list)\\n\\n{\\n\\n\\tstruct mlx5_qp *mqp = to_mqp((struct ibv_qp *)ibqp);\\n\\n\\n\\n\\t_mlx5_send_wr_set_inline_data_list(mqp, num_buf, buf_list);\\n\\n\\t_common_wqe_finilize(mqp);\\n\",\n \"file_path\": \"mlnx-ofed-4.9-driver/rdma-core-50mlnx1/providers/mlx5/qp.c\",\n \"rank\": 28,\n \"score\": 283717.0005986171\n },\n {\n \"content\": \"#[inline]\\n\\npub fn get_global_meta_kv_mem() -> &'static mut RMemPhy {\\n\\n &mut GLOBAL_MEM.get_mut()[1]\\n\\n}\\n\\n\\n\\n// we default use the nic_0\\n\",\n \"file_path\": \"KRdmaKit-syscall/src/client.rs\",\n \"rank\": 29,\n \"score\": 282567.22597532463\n },\n {\n \"content\": \"#[inline]\\n\\npub fn get_global_test_mem_len() -> usize {\\n\\n GLOBAL_MEM.get_ref().len()\\n\\n}\\n\\n\\n\",\n \"file_path\": \"KRdmaKit-syscall/src/client.rs\",\n \"rank\": 30,\n \"score\": 282281.9756282196\n },\n {\n \"content\": \"/// Test case for RC qp state change\\n\\nfn test_case_rc_1() {\\n\\n let ctx: &mut RContext = &mut ALLRCONTEXTS.get_mut()[0];\\n\\n // sa client\\n\\n println!(\\\"sa client registered\\\");\\n\\n\\n\\n\\n\\n let rc = RC::new(ctx, core::ptr::null_mut(), null_mut());\\n\\n if rc.is_some() {\\n\\n println!(\\\"create RC success\\\");\\n\\n // check field getter\\n\\n let mut rc = rc.unwrap();\\n\\n let mrc = unsafe { Arc::get_mut_unchecked(&mut rc) };\\n\\n\\n\\n println!(\\\"[1] state:{}\\\", get_qp_status(mrc.get_qp()).unwrap());\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"rust-kernel-rdma/KRdmaKit/unitests/qp/src/lib.rs\",\n \"rank\": 31,\n \"score\": 269084.58170586854\n },\n {\n \"content\": \"// path resolve\\n\\nfn test_case_rc_3() {\\n\\n println!(\\\">>>>>> start [test_case_rc_3] <<<<<<<\\\");\\n\\n let ctx: &mut RContext = &mut ALLRCONTEXTS.get_mut()[0];\\n\\n let sa_client = &mut SA_CLIENT.get_mut();\\n\\n let mut explorer = IBExplorer::new();\\n\\n let remote_service_id = 50;\\n\\n let qd_hint = 73;\\n\\n\\n\\n let gid_addr = ctx.get_gid_as_string();\\n\\n let _ = explorer.resolve(1, ctx, &gid_addr, sa_client.get_inner_sa_client());\\n\\n\\n\\n // get path\\n\\n let boxed_ctx = Box::pin(ctx);\\n\\n // thus the path resolver could be split out of other module\\n\\n let path_res = explorer.get_path_result().unwrap();\\n\\n println!(\\\"finish path get\\\");\\n\\n // create Ctrl. serve for cm handshakes\\n\\n let ctrl =\\n\\n RCtrl::create(remote_service_id, &mut ALLRCONTEXTS.get_mut()[0]).unwrap();\\n\\n\\n\",\n \"file_path\": \"rust-kernel-rdma/KRdmaKit/unitests/qp/src/lib.rs\",\n \"rank\": 32,\n \"score\": 269071.14190493786\n },\n {\n \"content\": \"// test for inner completion waiting\\n\\nfn test_case_rc_2() {\\n\\n let ctx: &mut RContext = &mut ALLRCONTEXTS.get_mut()[0];\\n\\n // sa client\\n\\n let rc = RC::new(ctx, core::ptr::null_mut(), null_mut());\\n\\n if rc.is_some() {\\n\\n println!(\\\"test_case_2 create RC success\\\");\\n\\n // check field getter\\n\\n let mut rc = rc.unwrap();\\n\\n let _mrc = unsafe { Arc::get_mut_unchecked(&mut rc) };\\n\\n }\\n\\n}\\n\\n\\n\\n\\n\",\n \"file_path\": \"rust-kernel-rdma/KRdmaKit/unitests/qp/src/lib.rs\",\n \"rank\": 33,\n \"score\": 269071.14190493786\n },\n {\n \"content\": \"// QP state\\n\\nfn test_case_rc_overflow() {\\n\\n println!(\\\">>>>>> start [test_case_rc_3] <<<<<<<\\\");\\n\\n let ctx: &mut RContext = &mut ALLRCONTEXTS.get_mut()[0];\\n\\n let sa_client = &mut SA_CLIENT.get_mut();\\n\\n let mut explorer = IBExplorer::new();\\n\\n let remote_service_id = 50;\\n\\n let qd_hint = 73;\\n\\n\\n\\n let gid_addr = ctx.get_gid_as_string();\\n\\n let _ = explorer.resolve(1, ctx, &gid_addr, sa_client.get_inner_sa_client());\\n\\n\\n\\n // get path\\n\\n let boxed_ctx = Box::pin(ctx);\\n\\n // thus the path resolver could be split out of other module\\n\\n let path_res = explorer.get_path_result().unwrap();\\n\\n println!(\\\"finish path get\\\");\\n\\n // create Ctrl. serve for cm handshakes\\n\\n let _ctrl =\\n\\n RCtrl::create(remote_service_id, &mut ALLRCONTEXTS.get_mut()[0]).unwrap();\\n\\n\\n\",\n \"file_path\": \"rust-kernel-rdma/KRdmaKit/unitests/qp_state/src/lib.rs\",\n \"rank\": 34,\n \"score\": 266042.26010341936\n },\n {\n \"content\": \"#[inline]\\n\\npub fn get_remote_dc_meta_unsafe(remote_gid: &String) -> &EndPoint {\\n\\n META_INFO.get_mut().get(remote_gid).unwrap()\\n\\n}\\n\\n\\n\",\n \"file_path\": \"KRdmaKit-syscall/src/client.rs\",\n \"rank\": 35,\n \"score\": 262657.5319884323\n },\n {\n \"content\": \"fn print_test_msgs(test_case_idx: usize, assert: bool) {\\n\\n if assert {\\n\\n println!(\\\"{:?}\\\", crate::console_msgs::SUCC[test_case_idx]);\\n\\n } else {\\n\\n println!(\\\"{:?}\\\", crate::console_msgs::ERR[test_case_idx]);\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"benchs/rc_read/src/lib.rs\",\n \"rank\": 36,\n \"score\": 247197.4433239854\n },\n {\n \"content\": \"fn print_test_msgs(test_case_idx: usize, assert: bool) {\\n\\n if assert {\\n\\n println!(\\\"{:?}\\\", crate::console_msgs::SUCC[test_case_idx]);\\n\\n } else {\\n\\n println!(\\\"{:?}\\\", crate::console_msgs::ERR[test_case_idx]);\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"exp/motiv-kit-breakdown/rc_break_down_client/src/lib.rs\",\n \"rank\": 37,\n \"score\": 241275.44186629463\n },\n {\n \"content\": \"fn print_test_msgs(test_case_idx: usize, assert: bool) {\\n\\n if assert {\\n\\n println!(\\\"{:?}\\\", crate::console_msgs::SUCC[test_case_idx]);\\n\\n } else {\\n\\n println!(\\\"{:?}\\\", crate::console_msgs::ERR[test_case_idx]);\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"rust-kernel-rdma/KRdmaKit/unitests/qp/src/lib.rs\",\n \"rank\": 38,\n \"score\": 239543.1613531036\n },\n {\n \"content\": \"fn print_test_msgs(test_case_idx: usize, assert: bool) {\\n\\n if assert {\\n\\n println!(\\\"{:?}\\\", crate::console_msgs::SUCC[test_case_idx]);\\n\\n } else {\\n\\n println!(\\\"{:?}\\\", crate::console_msgs::ERR[test_case_idx]);\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"rust-kernel-rdma/KRdmaKit/unitests/qp_state/src/lib.rs\",\n \"rank\": 39,\n \"score\": 238130.91383053956\n },\n {\n \"content\": \"static struct ibv_exp_cq_family_v1 mlx5_poll_cq_family_unsafe_tbl[MLX5_POLL_CQ_NUM_CQE_SIZES] = {\\n\\n\\t\\t[MLX5_POLL_CQ_CQE_64] = {\\n\\n\\t\\t\\t\\t.poll_cnt = mlx5_poll_cnt_unsafe_cqe64,\\n\\n\\t\\t\\t\\t.poll_length = mlx5_poll_length_unsafe_cqe64,\\n\\n\\t\\t\\t\\t.poll_length_flags = mlx5_poll_length_flags_unsafe_cqe64,\\n\\n\\t\\t\\t\\t.poll_length_flags_mp_rq = mlx5_poll_length_flags_mp_rq_unsafe_cqe64,\\n\\n\\t\\t\\t\\t.poll_length_flags_cvlan = mlx5_poll_length_flags_cvlan_unsafe_cqe64,\\n\\n\\t\\t\\t\\t.poll_length_flags_mp_rq_cvlan = mlx5_poll_length_flags_mp_rq_cvlan_unsafe_cqe64,\\n\\n\\t\\t\\t\\t.poll_length_flags_ts = mlx5_poll_length_flags_ts_unsafe_cqe64,\\n\\n\\t\\t\\t\\t.poll_length_flags_mp_rq_ts = mlx5_poll_length_flags_mp_rq_ts_unsafe_cqe64,\\n\\n\\t\\t\\t\\t.poll_length_flags_cvlan_ts = mlx5_poll_length_flags_cvlan_ts_unsafe_cqe64,\\n\\n\\t\\t\\t\\t.poll_length_flags_mp_rq_cvlan_ts = mlx5_poll_length_flags_mp_rq_cvlan_ts_unsafe_cqe64,\\n\\n\\n\\n\\t\\t},\\n\\n\\t\\t[MLX5_POLL_CQ_CQE_128] = {\\n\\n\\t\\t\\t\\t.poll_cnt = mlx5_poll_cnt_unsafe_cqe128,\\n\\n\\t\\t\\t\\t.poll_length = mlx5_poll_length_unsafe_cqe128,\\n\\n\\t\\t\\t\\t.poll_length_flags = mlx5_poll_length_flags_unsafe_cqe128,\\n\\n\\t\\t\\t\\t.poll_length_flags_mp_rq = mlx5_poll_length_flags_mp_rq_unsafe_cqe128,\\n\\n\\t\\t\\t\\t.poll_length_flags_cvlan = mlx5_poll_length_flags_cvlan_unsafe_cqe128,\\n\\n\\t\\t\\t\\t.poll_length_flags_mp_rq_cvlan = mlx5_poll_length_flags_mp_rq_cvlan_unsafe_cqe128,\\n\\n\\t\\t\\t\\t.poll_length_flags_ts = mlx5_poll_length_flags_ts_unsafe_cqe128,\\n\\n\\t\\t\\t\\t.poll_length_flags_mp_rq_ts = mlx5_poll_length_flags_mp_rq_ts_unsafe_cqe128,\\n\\n\\t\\t\\t\\t.poll_length_flags_cvlan_ts = mlx5_poll_length_flags_cvlan_ts_unsafe_cqe128,\\n\\n\\t\\t\\t\\t.poll_length_flags_mp_rq_cvlan_ts = mlx5_poll_length_flags_mp_rq_cvlan_ts_unsafe_cqe128,\\n\\n\\n\\n\\t\\t},\\n\",\n \"file_path\": \"mlnx-ofed-4.9-driver/src/cq.c\",\n \"rank\": 40,\n \"score\": 237108.63234159735\n },\n {\n \"content\": \"fn print_test_msgs(test_case_idx: usize, assert: bool) {\\n\\n if assert {\\n\\n println!(\\\"{:?}\\\", crate::console_msgs::SUCC[test_case_idx]);\\n\\n } else {\\n\\n println!(\\\"{:?}\\\", crate::console_msgs::ERR[test_case_idx]);\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"rust-kernel-rdma/KRdmaKit/unitests/rc_conn_bug/src/lib.rs\",\n \"rank\": 41,\n \"score\": 237032.56560970872\n },\n {\n \"content\": \"static struct ibv_exp_cq_family_v1 mlx5_poll_cq_family_unsafe_v1_tbl[MLX5_POLL_CQ_NUM_CQE_SIZES] = {\\n\\n\\t\\t[MLX5_POLL_CQ_CQE_64] = {\\n\\n\\t\\t\\t\\t.poll_cnt = mlx5_poll_cnt_unsafe_cqe64_v1,\\n\\n\\t\\t\\t\\t.poll_length = mlx5_poll_length_unsafe_cqe64_v1,\\n\\n\\t\\t\\t\\t.poll_length_flags = mlx5_poll_length_flags_unsafe_cqe64_v1,\\n\\n\\t\\t\\t\\t.poll_length_flags_mp_rq = mlx5_poll_length_flags_mp_rq_unsafe_cqe64_v1,\\n\\n\\t\\t\\t\\t.poll_length_flags_cvlan = mlx5_poll_length_flags_cvlan_unsafe_cqe64_v1,\\n\\n\\t\\t\\t\\t.poll_length_flags_mp_rq_cvlan = mlx5_poll_length_flags_mp_rq_cvlan_unsafe_cqe64_v1,\\n\\n\\t\\t\\t\\t.poll_length_flags_ts = mlx5_poll_length_flags_ts_unsafe_cqe64_v1,\\n\\n\\t\\t\\t\\t.poll_length_flags_mp_rq_ts = mlx5_poll_length_flags_mp_rq_ts_unsafe_cqe64_v1,\\n\\n\\t\\t\\t\\t.poll_length_flags_cvlan_ts = mlx5_poll_length_flags_cvlan_ts_unsafe_cqe64_v1,\\n\\n\\t\\t\\t\\t.poll_length_flags_mp_rq_cvlan_ts = mlx5_poll_length_flags_mp_rq_cvlan_ts_unsafe_cqe64_v1,\\n\\n\\t\\t},\\n\\n\\t\\t[MLX5_POLL_CQ_CQE_128] = {\\n\\n\\t\\t\\t\\t.poll_cnt = mlx5_poll_cnt_unsafe_cqe128_v1,\\n\\n\\t\\t\\t\\t.poll_length = mlx5_poll_length_unsafe_cqe128_v1,\\n\\n\\t\\t\\t\\t.poll_length_flags = mlx5_poll_length_flags_unsafe_cqe128_v1,\\n\\n\\t\\t\\t\\t.poll_length_flags_mp_rq = mlx5_poll_length_flags_mp_rq_unsafe_cqe128_v1,\\n\\n\\t\\t\\t\\t.poll_length_flags_cvlan = mlx5_poll_length_flags_cvlan_unsafe_cqe128_v1,\\n\\n\\t\\t\\t\\t.poll_length_flags_mp_rq_cvlan = mlx5_poll_length_flags_mp_rq_cvlan_unsafe_cqe128_v1,\\n\\n\\t\\t\\t\\t.poll_length_flags_ts = mlx5_poll_length_flags_ts_unsafe_cqe128_v1,\\n\\n\\t\\t\\t\\t.poll_length_flags_mp_rq_ts = mlx5_poll_length_flags_mp_rq_ts_unsafe_cqe128_v1,\\n\\n\\t\\t\\t\\t.poll_length_flags_cvlan_ts = mlx5_poll_length_flags_cvlan_ts_unsafe_cqe128_v1,\\n\\n\\t\\t\\t\\t.poll_length_flags_mp_rq_cvlan_ts = mlx5_poll_length_flags_mp_rq_cvlan_ts_unsafe_cqe128_v1,\\n\\n\\t\\t},\\n\",\n \"file_path\": \"mlnx-ofed-4.9-driver/src/cq.c\",\n \"rank\": 42,\n \"score\": 235795.50136792386\n },\n {\n \"content\": \"static inline uint32_t mlx5_cq_read_wc_src_qp(struct ibv_cq_ex *ibcq)\\n\\n{\\n\\n\\tstruct mlx5_cq *cq = to_mcq(ibv_cq_ex_to_cq(ibcq));\\n\\n\\n\\n\\treturn be32toh(cq->cqe64->flags_rqpn) & 0xffffff;\\n\",\n \"file_path\": \"mlnx-ofed-4.9-driver/rdma-core-50mlnx1/providers/mlx5/cq.c\",\n \"rank\": 52,\n \"score\": 231653.85641517077\n },\n {\n \"content\": \"static uint32_t mlx4_cq_read_wc_src_qp(struct ibv_cq_ex *ibcq)\\n\\n{\\n\\n\\tstruct mlx4_cq *cq = to_mcq(ibv_cq_ex_to_cq(ibcq));\\n\\n\\n\\n\\treturn be32toh(cq->cqe->g_mlpath_rqpn) & 0xffffff;\\n\",\n \"file_path\": \"mlnx-ofed-4.9-driver/rdma-core-50mlnx1/providers/mlx4/cq.c\",\n \"rank\": 53,\n \"score\": 231653.85641517077\n },\n {\n \"content\": \"static inline uint32_t mlx5_cq_read_wc_qp_num(struct ibv_cq_ex *ibcq)\\n\\n{\\n\\n\\tstruct mlx5_cq *cq = to_mcq(ibv_cq_ex_to_cq(ibcq));\\n\\n\\n\\n\\treturn be32toh(cq->cqe64->sop_drop_qpn) & 0xffffff;\\n\",\n \"file_path\": \"mlnx-ofed-4.9-driver/rdma-core-50mlnx1/providers/mlx5/cq.c\",\n \"rank\": 54,\n \"score\": 231653.85641517077\n },\n {\n \"content\": \"static uint32_t mlx4_cq_read_wc_qp_num(struct ibv_cq_ex *ibcq)\\n\\n{\\n\\n\\tstruct mlx4_cq *cq = to_mcq(ibv_cq_ex_to_cq(ibcq));\\n\\n\\n\\n\\treturn be32toh(cq->cqe->vlan_my_qpn) & MLX4_CQE_QPN_MASK;\\n\",\n \"file_path\": \"mlnx-ofed-4.9-driver/rdma-core-50mlnx1/providers/mlx4/cq.c\",\n \"rank\": 55,\n \"score\": 231653.85641517077\n },\n {\n \"content\": \"int32_t mlx5_poll_cnt_unsafe_cqe64(struct ibv_cq *ibcq, uint32_t max) __MLX5_ALGN_F__;\\n\",\n \"file_path\": \"mlnx-ofed-4.9-driver/src/cq.c\",\n \"rank\": 56,\n \"score\": 224114.05446446425\n },\n {\n \"content\": \"int32_t mlx5_poll_cnt_unsafe_cqe128(struct ibv_cq *ibcq, uint32_t max) __MLX5_ALGN_F__;\\n\",\n \"file_path\": \"mlnx-ofed-4.9-driver/src/cq.c\",\n \"rank\": 57,\n \"score\": 224114.05446446425\n },\n {\n \"content\": \"int32_t mlx5_poll_length_unsafe_cqe64(struct ibv_cq *cq, void *buf, uint32_t *inl) __MLX5_ALGN_F__;\\n\",\n \"file_path\": \"mlnx-ofed-4.9-driver/src/cq.c\",\n \"rank\": 58,\n \"score\": 224114.05446446425\n },\n {\n \"content\": \"int32_t mlx5_poll_length_unsafe_cqe128(struct ibv_cq *cq, void *buf, uint32_t *inl) __MLX5_ALGN_F__;\\n\",\n \"file_path\": \"mlnx-ofed-4.9-driver/src/cq.c\",\n \"rank\": 59,\n \"score\": 224114.05446446425\n },\n {\n \"content\": \"void rvt_rc_error(struct rvt_qp *qp, enum ib_wc_status err);\\n\",\n \"file_path\": \"mlnx-ofed-4.9-driver/include/rdma/rdmavt_qp.h\",\n \"rank\": 60,\n \"score\": 223946.26278071397\n },\n {\n \"content\": \"int32_t mlx5_poll_length_flags_unsafe_cqe128(struct ibv_cq *cq, void *buf, uint32_t *inl, uint32_t *flags) __MLX5_ALGN_F__;\\n\",\n \"file_path\": \"mlnx-ofed-4.9-driver/src/cq.c\",\n \"rank\": 61,\n \"score\": 222644.7316079224\n },\n {\n \"content\": \"int32_t mlx5_poll_cnt_unsafe_cqe128_v1(struct ibv_cq *ibcq, uint32_t max) __MLX5_ALGN_F__;\\n\",\n \"file_path\": \"mlnx-ofed-4.9-driver/src/cq.c\",\n \"rank\": 62,\n \"score\": 222644.7316079224\n },\n {\n \"content\": \"int32_t mlx5_poll_length_unsafe_cqe64_v1(struct ibv_cq *cq, void *buf, uint32_t *inl) __MLX5_ALGN_F__;\\n\",\n \"file_path\": \"mlnx-ofed-4.9-driver/src/cq.c\",\n \"rank\": 63,\n \"score\": 222644.7316079224\n },\n {\n \"content\": \"int32_t mlx5_poll_length_flags_unsafe_cqe64(struct ibv_cq *cq, void *buf, uint32_t *inl, uint32_t *flags) __MLX5_ALGN_F__;\\n\",\n \"file_path\": \"mlnx-ofed-4.9-driver/src/cq.c\",\n \"rank\": 64,\n \"score\": 222644.7316079224\n },\n {\n \"content\": \"int32_t mlx5_poll_length_unsafe_cqe128_v1(struct ibv_cq *cq, void *buf, uint32_t *inl) __MLX5_ALGN_F__;\\n\",\n \"file_path\": \"mlnx-ofed-4.9-driver/src/cq.c\",\n \"rank\": 65,\n \"score\": 222644.7316079224\n },\n {\n \"content\": \"int32_t mlx5_poll_cnt_unsafe_cqe64_v1(struct ibv_cq *ibcq, uint32_t max) __MLX5_ALGN_F__;\\n\",\n \"file_path\": \"mlnx-ofed-4.9-driver/src/cq.c\",\n \"rank\": 66,\n \"score\": 222644.7316079224\n },\n {\n \"content\": \"static int poll_soft_wc(struct mlx5_ib_cq *cq, int num_entries,\\n\\n\\t\\t\\tstruct ib_wc *wc, bool is_fatal_err)\\n\\n{\\n\\n\\tstruct mlx5_ib_dev *dev = to_mdev(cq->ibcq.device);\\n\\n\\tstruct mlx5_ib_wc *soft_wc, *next;\\n\\n\\tint npolled = 0;\\n\\n\\n\\n\\tlist_for_each_entry_safe(soft_wc, next, &cq->wc_list, list) {\\n\\n\\t\\tif (npolled >= num_entries)\\n\\n\\t\\t\\tbreak;\\n\\n\\n\\n\\t\\tmlx5_ib_dbg(dev, \\\"polled software generated completion on CQ 0x%x\\\\n\\\",\\n\\n\\t\\t\\t cq->mcq.cqn);\\n\\n\\n\\n\\t\\tif (unlikely(is_fatal_err)) {\\n\\n\\t\\t\\tsoft_wc->wc.status = IB_WC_WR_FLUSH_ERR;\\n\\n\\t\\t\\tsoft_wc->wc.vendor_err = MLX5_CQE_SYNDROME_WR_FLUSH_ERR;\\n\\n\\t\\t}\\n\\n\\t\\twc[npolled++] = soft_wc->wc;\\n\\n\\t\\tlist_del(&soft_wc->list);\\n\\n\\t\\tatomic_set(&soft_wc->in_use, 0);\\n\\n\\t}\\n\\n\\n\\n\\treturn npolled;\\n\",\n \"file_path\": \"mlnx-ofed-4.9-driver/drivers/infiniband/hw/mlx5/cq.c\",\n \"rank\": 67,\n \"score\": 222640.25932711567\n },\n {\n \"content\": \"static int poll_cq(struct ibv_cq *cq, int num_entries, struct ibv_wc *wc)\\n\\n{\\n\\n\\treturn EOPNOTSUPP;\\n\",\n \"file_path\": \"mlnx-ofed-4.9-driver/rdma-core-50mlnx1/libibverbs/dummy_ops.c\",\n \"rank\": 68,\n \"score\": 222580.74870568598\n },\n {\n \"content\": \"int32_t mlx5_poll_length_flags_ts_unsafe_cqe128(struct ibv_cq *cq, void *buf, uint32_t *inl, uint32_t *flags, uint64_t *timestamp) __MLX5_ALGN_F__;\\n\",\n \"file_path\": \"mlnx-ofed-4.9-driver/src/cq.c\",\n \"rank\": 69,\n \"score\": 221194.5494317126\n },\n {\n \"content\": \"int32_t mlx5_poll_length_flags_cvlan_unsafe_cqe128(struct ibv_cq *cq, void *buf, uint32_t *inl, uint32_t *flags, uint16_t *vlan_cti) __MLX5_ALGN_F__;\\n\",\n \"file_path\": \"mlnx-ofed-4.9-driver/src/cq.c\",\n \"rank\": 70,\n \"score\": 221194.5494317126\n },\n {\n \"content\": \"int32_t mlx5_poll_length_flags_cvlan_unsafe_cqe64(struct ibv_cq *cq, void *buf, uint32_t *inl, uint32_t *flags, uint16_t *vlan_cti) __MLX5_ALGN_F__;\\n\",\n \"file_path\": \"mlnx-ofed-4.9-driver/src/cq.c\",\n \"rank\": 71,\n \"score\": 221194.5494317126\n },\n {\n \"content\": \"int32_t mlx5_poll_length_flags_ts_unsafe_cqe64(struct ibv_cq *cq, void *buf, uint32_t *inl, uint32_t *flags, uint64_t *timestamp) __MLX5_ALGN_F__;\\n\",\n \"file_path\": \"mlnx-ofed-4.9-driver/src/cq.c\",\n \"rank\": 72,\n \"score\": 221194.5494317126\n },\n {\n \"content\": \"int32_t mlx5_poll_length_flags_unsafe_cqe64_v1(struct ibv_cq *cq, void *buf, uint32_t *inl, uint32_t *flags) __MLX5_ALGN_F__;\\n\",\n \"file_path\": \"mlnx-ofed-4.9-driver/src/cq.c\",\n \"rank\": 73,\n \"score\": 221194.5494317126\n },\n {\n \"content\": \"int32_t mlx5_poll_length_flags_unsafe_cqe128_v1(struct ibv_cq *cq, void *buf, uint32_t *inl, uint32_t *flags) __MLX5_ALGN_F__;\\n\",\n \"file_path\": \"mlnx-ofed-4.9-driver/src/cq.c\",\n \"rank\": 74,\n \"score\": 221194.5494317126\n },\n {\n \"content\": \"static int test_wc_poll_cq(struct mlx5_ib_dev *dev, struct ib_cq *cq)\\n\\n{\\n\\n\\tint ret;\\n\\n\\tstruct ib_wc wc = {};\\n\\n\\tunsigned long end = jiffies + TEST_WC_POLLING_MAX_TIME_JIFFIES;\\n\\n\\n\\n\\twhile (!time_after(jiffies, end)) {\\n\\n\\t\\tret = ib_poll_cq(cq, 1, &wc);\\n\\n\\t\\tif (ret < 0 || wc.status)\\n\\n\\t\\t\\treturn ret ? ret : -EINVAL;\\n\\n\\t\\tif (ret)\\n\\n\\t\\t\\tbreak;\\n\\n\\t}\\n\\n\\tif (!ret)\\n\\n\\t\\treturn -ETIMEDOUT;\\n\\n\\n\\n\\tif (wc.wr_id == WR_ID_FINAL)\\n\\n\\t\\tdev->wc_support = MLX5_IB_WC_NOT_SUPPORTED;\\n\\n\\telse if (wc.wr_id == WR_ID_BF)\\n\\n\\t\\tdev->wc_support = MLX5_IB_WC_SUPPORTED;\\n\\n\\telse\\n\\n\\t\\treturn -EINVAL;\\n\\n\\n\\n\\treturn 0;\\n\",\n \"file_path\": \"mlnx-ofed-4.9-driver/drivers/infiniband/hw/mlx5/mem.c\",\n \"rank\": 75,\n \"score\": 221190.10628081998\n },\n {\n \"content\": \"pub fn xx() {\\n\\n let len = 20;\\n\\n let runtime = Runtime::new();\\n\\n let mut t1 = Task::new(async move {\\n\\n async_run(0).await\\n\\n });\\n\\n\\n\\n let mut t2 = Task::new(async move {\\n\\n async_run(1).await\\n\\n });\\n\\n\\n\\n let mut t3 = Task::new(async move {\\n\\n async_run(3).await\\n\\n });\\n\\n\\n\\n let h1 = t1.spawn(&runtime);\\n\\n let h3 = t3.spawn(&runtime);\\n\\n let h2 = t2.spawn(&runtime);\\n\\n h1.join();\\n\\n}\\n\",\n \"file_path\": \"KRdmaKit-syscall/src/nostd_async/mod.rs\",\n \"rank\": 76,\n \"score\": 220147.4700047007\n },\n {\n \"content\": \"int32_t mlx5_poll_length_flags_cvlan_ts_unsafe_cqe64(struct ibv_cq *cq, void *buf, uint32_t *inl, uint32_t *flags,\\n\\n\\t\\t\\t\\t\\t\\t uint16_t *vlan_cti, uint64_t *timestamp)\\n\\n{\\n\\n\\treturn __poll_length(cq, buf, inl, 0, 64, NULL, flags, 0, vlan_cti,\\n\\n\\t\\t\\t timestamp);\\n\",\n \"file_path\": \"mlnx-ofed-4.9-driver/src/cq.c\",\n \"rank\": 77,\n \"score\": 219763.13634141098\n },\n {\n \"content\": \"int32_t mlx5_poll_length_flags_cvlan_unsafe_cqe128_v1(struct ibv_cq *cq, void *buf, uint32_t *inl, uint32_t *flags, uint16_t *vlan_cti)\\n\\n{\\n\\n\\treturn poll_length(cq, buf, inl, 0, 128, NULL, flags, 1, vlan_cti);\\n\",\n \"file_path\": \"mlnx-ofed-4.9-driver/src/cq.c\",\n \"rank\": 78,\n \"score\": 219763.13634141098\n },\n {\n \"content\": \"int32_t mlx5_poll_length_flags_mp_rq_unsafe_cqe64(struct ibv_cq *cq, uint32_t *offset, uint32_t *flags)\\n\\n{\\n\\n\\treturn poll_length(cq, NULL, NULL, 0, 64, offset, flags, 0, NULL);\\n\",\n \"file_path\": \"mlnx-ofed-4.9-driver/src/cq.c\",\n \"rank\": 79,\n \"score\": 219763.13634141098\n },\n {\n \"content\": \"int32_t mlx5_poll_length_flags_ts_unsafe_cqe128_v1(struct ibv_cq *cq, void *buf, uint32_t *inl, uint32_t *flags, uint64_t *timestamp)\\n\\n{\\n\\n\\treturn __poll_length(cq, buf, inl, 0, 128, NULL, flags, 1, NULL,\\n\\n\\t\\t\\t timestamp);\\n\",\n \"file_path\": \"mlnx-ofed-4.9-driver/src/cq.c\",\n \"rank\": 80,\n \"score\": 219763.13634141098\n },\n {\n \"content\": \"int32_t mlx5_poll_length_flags_mp_rq_unsafe_cqe128(struct ibv_cq *cq, uint32_t *offset, uint32_t *flags)\\n\\n{\\n\\n\\treturn poll_length(cq, NULL, NULL, 0, 128, offset, flags, 0, NULL);\\n\",\n \"file_path\": \"mlnx-ofed-4.9-driver/src/cq.c\",\n \"rank\": 81,\n \"score\": 219763.13634141098\n },\n {\n \"content\": \"int32_t mlx5_poll_length_flags_ts_unsafe_cqe64_v1(struct ibv_cq *cq, void *buf, uint32_t *inl, uint32_t *flags, uint64_t *timestamp)\\n\\n{\\n\\n\\treturn __poll_length(cq, buf, inl, 0, 64, NULL, flags, 1, NULL,\\n\\n\\t\\t\\t timestamp);\\n\",\n \"file_path\": \"mlnx-ofed-4.9-driver/src/cq.c\",\n \"rank\": 82,\n \"score\": 219763.13634141098\n },\n {\n \"content\": \"int32_t mlx5_poll_length_flags_cvlan_unsafe_cqe64_v1(struct ibv_cq *cq, void *buf, uint32_t *inl, uint32_t *flags, uint16_t *vlan_cti)\\n\\n{\\n\\n\\treturn poll_length(cq, buf, inl, 0, 64, NULL, flags, 1, vlan_cti);\\n\",\n \"file_path\": \"mlnx-ofed-4.9-driver/src/cq.c\",\n \"rank\": 83,\n \"score\": 219763.13634141098\n },\n {\n \"content\": \" pub fn pop_recv_cq(&mut self, pop_cnt: u32, wc_list: *mut ib_wc) -> Option<usize> {\\n\\n let ret = unsafe { bd_ib_poll_cq(self.qp.get_recv_cq(), pop_cnt as i32, wc_list) };\\n\\n if ret < 0 {\\n\\n return None;\\n\\n } else if ret > 0 {\\n\\n return Some(ret as usize);\\n\\n }\\n\\n None\\n\\n }\\n\\n\\n\\n #[inline]\\n\\n pub fn post_recv(\\n\\n &mut self,\\n\\n local_ptr: u64,\\n\\n lkey: u32,\\n\\n sz: usize,\\n\\n ) -> linux_kernel_module::KernelResult<()> {\\n\\n let mut wr: ib_recv_wr = Default::default();\\n\\n let mut sge: ib_sge = Default::default();\\n\\n\\n\",\n \"file_path\": \"rust-kernel-rdma/KRdmaKit/src/qp/ud_op.rs\",\n \"rank\": 84,\n \"score\": 110.65178674240738\n },\n {\n \"content\": \" #[inline]\\n\\n pub fn push(&mut self,\\n\\n op: u32, // RDMA operation type (denote the type `ib_wr_opcode`)\\n\\n local_ptr: u64, // local mr address\\n\\n lkey: u32, // local key\\n\\n sz: usize, // request size (in Byte)\\n\\n remote_addr: u64, // remote mr address\\n\\n rkey: u32, // remote key\\n\\n end_point: &EndPoint,\\n\\n send_flag: i32,\\n\\n ) -> linux_kernel_module::KernelResult<()> {\\n\\n let mut wr: ib_dc_wr = Default::default();\\n\\n let mut sge: ib_sge = Default::default();\\n\\n\\n\\n let ah = end_point.ah;\\n\\n let dct_num = end_point.dct_num;\\n\\n // 1. set the sge\\n\\n sge.addr = local_ptr;\\n\\n sge.length = sz as _;\\n\\n sge.lkey = lkey;\\n\",\n \"file_path\": \"rust-kernel-rdma/KRdmaKit/src/qp/dc_op.rs\",\n \"rank\": 85,\n \"score\": 82.30623896969156\n },\n {\n \"content\": \" }\\n\\n}\\n\\n\\n\\nimpl<'a> UDOp<'a> {\\n\\n #[inline]\\n\\n pub fn push(\\n\\n &mut self,\\n\\n op: u32, // RDMA operation type (denote the type `ib_wr_opcode`)\\n\\n local_ptr: u64,\\n\\n lkey: u32,\\n\\n end_point: &EndPoint,\\n\\n sz: usize,\\n\\n imm_data: u32,\\n\\n send_flag: i32,\\n\\n ) -> linux_kernel_module::KernelResult<()> {\\n\\n let mut wr: ib_ud_wr = Default::default();\\n\\n let mut sge: ib_sge = Default::default();\\n\\n\\n\\n // first set the sge\\n\\n sge.addr = local_ptr;\\n\",\n \"file_path\": \"rust-kernel-rdma/KRdmaKit/src/qp/ud_op.rs\",\n \"rank\": 86,\n \"score\": 79.0904280403489\n },\n {\n \"content\": \" }\\n\\n }\\n\\n }\\n\\n\\n\\n #[inline]\\n\\n pub fn pop(&mut self) -> Option<*mut ib_wc> {\\n\\n let mut wc: ib_wc = Default::default();\\n\\n let ret = unsafe { bd_ib_poll_cq(self.qp.get_cq(), 1, &mut wc as *mut ib_wc) };\\n\\n if ret < 0 {\\n\\n return None;\\n\\n } else if ret == 1 {\\n\\n if wc.status != 0 && wc.status != 5 {\\n\\n linux_kernel_module::println!(\\\"ud poll cq error, wc_status:{}\\\", wc.status);\\n\\n }\\n\\n return Some(&mut wc as *mut ib_wc);\\n\\n }\\n\\n None\\n\\n }\\n\\n\\n\\n #[inline]\\n\",\n \"file_path\": \"rust-kernel-rdma/KRdmaKit/src/qp/ud_op.rs\",\n \"rank\": 87,\n \"score\": 73.19983457625649\n },\n {\n \"content\": \"\\n\\nimpl<'a, const N: usize> RPCClient<'a, N> {\\n\\n async fn post_recv(&mut self, post_cnt: u64) {\\n\\n let recv = unsafe { Arc::get_mut_unchecked(&mut self.recv_helper) };\\n\\n let _ = recv.post_recvs(self.queue_pair.get_qp(), null_mut(), post_cnt as usize);\\n\\n }\\n\\n\\n\\n pub async fn poll_all(&mut self) {\\n\\n use rust_kernel_linux_util::bindings::memcpy;\\n\\n\\n\\n let send_addr = self.send_buffer.get_dma_buf();\\n\\n let send_va = self.send_buffer.get_ptr();\\n\\n\\n\\n let lkey = unsafe { self.ctx.get_lkey() };\\n\\n let mut op = UDOp::new(self.queue_pair);\\n\\n let wc_header = unsafe { Arc::get_mut_unchecked(&mut self.recv_helper) }.get_wc_header();\\n\\n\\n\\n let timer = KTimer::new();\\n\\n loop {\\n\\n let pop_res = op.pop_recv_cq(N as u32, wc_header);\\n\",\n \"file_path\": \"rust-kernel-rdma/KRdmaKit/unitests/rpc/src/rpc.rs\",\n \"rank\": 88,\n \"score\": 71.93001311640899\n },\n {\n \"content\": \" return ret;\\n\\n }\\n\\n cnt += 1;\\n\\n if cnt > 10000 {\\n\\n linux_kernel_module::println!(\\\"dc op wait til comp timeout!\\\");\\n\\n break;\\n\\n }\\n\\n }\\n\\n None\\n\\n }\\n\\n\\n\\n #[inline]\\n\\n pub fn pop(&mut self) -> Option<*mut ib_wc> {\\n\\n let mut wc: ib_wc = Default::default();\\n\\n let ret = unsafe { bd_ib_poll_cq(self.qp.get_cq(), 1, &mut wc as *mut ib_wc) };\\n\\n if ret < 0 {\\n\\n return None;\\n\\n } else if ret == 1 {\\n\\n return Some(&mut wc as *mut _);\\n\\n }\\n\\n None\\n\\n }\\n\\n}\",\n \"file_path\": \"rust-kernel-rdma/KRdmaKit/src/qp/dc_op.rs\",\n \"rank\": 89,\n \"score\": 71.21749226760338\n },\n {\n \"content\": \" let mut test_mr = RMemPhy::new(1024 * 1024);\\n\\n // 2. get all of the params for later operation\\n\\n let lkey = unsafe { boxed_ctx.get_lkey() } as u32;\\n\\n let rkey = lkey as u32;\\n\\n let laddr = test_mr.get_pa(0) as u64; // use pa for RCOp\\n\\n let raddr = test_mr.get_pa(1024) as u64;\\n\\n let sz = 8 as usize;\\n\\n\\n\\n // va of the mr. These addrs are used to read/write value in test function\\n\\n let va_buf = (test_mr.get_ptr() as u64 + 1024) as *mut i8;\\n\\n let target_buf = (test_mr.get_ptr()) as *mut i8;\\n\\n\\n\\n // now write a value\\n\\n let write_value = 99 as i8;\\n\\n unsafe { *(va_buf) = write_value };\\n\\n unsafe { *(target_buf) = 4 };\\n\\n println!(\\\"[before] value = {}\\\", unsafe { *(target_buf) });\\n\\n // 3. send request of type `READ`\\n\\n let mut op = RCOp::new(&rc);\\n\\n let _ = op.read(laddr, lkey, sz, raddr, rkey);\\n\",\n \"file_path\": \"rust-kernel-rdma/KRdmaKit/unitests/qp/src/lib.rs\",\n \"rank\": 90,\n \"score\": 70.61044681443659\n },\n {\n \"content\": \" pub fn create(entry_size: usize, lkey: u32, base_addr: u64) -> Arc<Self> {\\n\\n let ret = Self {\\n\\n capacity: N,\\n\\n cur_idx: 0,\\n\\n wrs: Box::new_zeroed_slice_in(N as usize, VmallocAllocator),\\n\\n sges: Box::new_zeroed_slice_in(N as usize, VmallocAllocator),\\n\\n wcs: Box::new_zeroed_slice_in(N as usize, VmallocAllocator),\\n\\n en_sz: entry_size,\\n\\n };\\n\\n let mut boxed = Arc::new(ret);\\n\\n let recvs = unsafe { Arc::get_mut_unchecked(&mut boxed) };\\n\\n\\n\\n let mut base: u64 = base_addr;\\n\\n for i in 0..recvs.capacity {\\n\\n let sge = recvs.sges[i].as_mut_ptr();\\n\\n let wr = recvs.wrs[i].as_mut_ptr();\\n\\n\\n\\n unsafe {\\n\\n let base_va = { pa_to_va(base as *mut i8) } as u64;\\n\\n (*sge).addr = base as u64;\\n\",\n \"file_path\": \"rust-kernel-rdma/KRdmaKit/src/qp/recv_helper.rs\",\n \"rank\": 91,\n \"score\": 70.24932340990095\n },\n {\n \"content\": \" send_reg_mr(mrc.get_qp(), v_mem.get_inner_mr(), DEFAULT_MR_ACCESS_FLAGS);\\n\\n rkey = unsafe { (*v_mem.get_inner_mr()).rkey } as u32;\\n\\n lkey = unsafe { (*v_mem.get_inner_mr()).lkey } as u32;\\n\\n local_pa = v_mem.get_dma_buf();\\n\\n remote_pa = v_mem.get_dma_buf();\\n\\n } else {\\n\\n let mut ret = RMemPhy::new(min(1024 * 1024 * 4, alloc_sz as usize));\\n\\n lkey = unsafe { boxed_ctx.get_lkey() } as u32;\\n\\n rkey = unsafe { boxed_ctx.get_lkey() } as u32;\\n\\n local_pa = p_mem.get_dma_buf();\\n\\n remote_pa = p_mem.get_dma_buf();\\n\\n };\\n\\n\\n\\n\\n\\n // 3. send request of type `READ`\\n\\n let mut op = RCOp::new(mrc);\\n\\n\\n\\n let mut op_count: u64 = 0;\\n\\n let mut rand = random::FastRandom::new(0xdeadbeaf);\\n\\n\\n\",\n \"file_path\": \"benchs/rc_read/src/rc_read.rs\",\n \"rank\": 92,\n \"score\": 70.0370947941143\n },\n {\n \"content\": \" // unsafe { (*dct).dct_num },\\n\\n // &_ctrl.get_self_test_mr());\\n\\n // let dc = DC::new(ctx);\\n\\n // if dc.is_none() {\\n\\n // println!(\\\"[dct] err create dc qp.\\\");\\n\\n // return;\\n\\n // }\\n\\n //\\n\\n // println!(\\\"create dc success\\\");\\n\\n //\\n\\n // let mut dc = dc.unwrap();\\n\\n // let mdc = unsafe { Arc::get_mut_unchecked(&mut dc) };\\n\\n //\\n\\n // // 1. generate MR\\n\\n // let mut test_mr = RMemPhy::new(1024 * 1024);\\n\\n //\\n\\n // // 2. get all of the params for later operation\\n\\n // let lkey = unsafe { ctx.get_lkey() } as u32;\\n\\n // let rkey = lkey as u32;\\n\\n // let local_pa = test_mr.get_pa(0) as u64; // use pa for RCOp\\n\",\n \"file_path\": \"rust-kernel-rdma/KRdmaKit/unitests/dct/src/lib.rs\",\n \"rank\": 93,\n \"score\": 68.26411521739416\n },\n {\n \"content\": \" let path_res = explorer.get_path_result().unwrap();\\n\\n\\n\\n // create RC at one side\\n\\n let rc = RC::new(ctx, core::ptr::null_mut(), core::ptr::null_mut());\\n\\n let sz = 64 as u64;\\n\\n let mut rc = rc.unwrap();\\n\\n let mrc = unsafe { Arc::get_mut_unchecked(&mut rc) };\\n\\n // connect to the server (Ctrl)\\n\\n let _ = mrc.connect(qd_hint, path_res, 1 as u64);\\n\\n let lkey = unsafe { (*mr).lkey } as u32;\\n\\n let rkey = unsafe { (*mr).rkey } as u32;\\n\\n let local_pa = dma_pa;\\n\\n let remote_pa = local_pa + sz;\\n\\n\\n\\n let mut op = RCOp::new(&rc);\\n\\n let _ = op.read(local_pa, lkey,\\n\\n 64 as usize, remote_pa, lkey);\\n\\n }\\n\\n\\n\\n unsafe fn bench_pin(mr: *mut ib_mr, address: u64, size: u64) -> u64 {\\n\",\n \"file_path\": \"KRdmaKit-syscall/src/virtual_queue.rs\",\n \"rank\": 94,\n \"score\": 68.01086777767878\n },\n {\n \"content\": \" sz: usize, // request size (in Byte)\\n\\n remote_addr: u64, // remote mr address\\n\\n rkey: u32, // remote key\\n\\n end_point: &EndPoint,\\n\\n send_flag: i32,\\n\\n imm_data: u32,\\n\\n ) -> linux_kernel_module::KernelResult<()> {\\n\\n let mut wr: ib_dc_wr = Default::default();\\n\\n let mut sge: ib_sge = Default::default();\\n\\n\\n\\n let ah = end_point.ah;\\n\\n let dct_num = end_point.dct_num;\\n\\n // 1. set the sge\\n\\n sge.addr = local_ptr;\\n\\n sge.length = sz as _;\\n\\n sge.lkey = lkey;\\n\\n\\n\\n // 2. set the wr\\n\\n wr.wr.opcode = op;\\n\\n wr.wr.send_flags = send_flag;\\n\",\n \"file_path\": \"rust-kernel-rdma/KRdmaKit/src/qp/dc_op.rs\",\n \"rank\": 95,\n \"score\": 66.47607611447182\n },\n {\n \"content\": \" // connect to the server (Ctrl)\\n\\n let _ = mrc.connect(qd_hint + 1, path_res, remote_service_id as u64);\\n\\n\\n\\n // 1. generate MR\\n\\n let mut test_mr = RMemPhy::new(1024 * 1024);\\n\\n // 2. get all of the params for later operation\\n\\n let lkey = unsafe { boxed_ctx.get_lkey() } as u32;\\n\\n let rkey = lkey as u32;\\n\\n let laddr = test_mr.get_pa(0) as u64; // use pa for RCOp\\n\\n let raddr = test_mr.get_pa(1024) as u64;\\n\\n let sz = 8 as usize;\\n\\n\\n\\n // va of the mr. These addrs are used to read/write value in test function\\n\\n let va_buf = (test_mr.get_ptr() as u64 + 1024) as *mut i8;\\n\\n let target_buf = (test_mr.get_ptr()) as *mut i8;\\n\\n\\n\\n // 3. send request of type `READ`\\n\\n let mut op = RCOp::new(&rc);\\n\\n\\n\\n\\n\",\n \"file_path\": \"exp/motiv-kit-breakdown/rc_break_down_client/src/lib.rs\",\n \"rank\": 96,\n \"score\": 66.08398631814222\n },\n {\n \"content\": \" sge.addr = local_ptr as u64;\\n\\n sge.length = sz as u32;\\n\\n sge.lkey = lkey as u32;\\n\\n\\n\\n // 1. reset the wr\\n\\n wr.sg_list = &mut sge as *mut _;\\n\\n wr.num_sge = 1;\\n\\n unsafe { bd_set_recv_wr_id(&mut wr, pa_to_va(local_ptr as *mut i8)) };\\n\\n let mut bad_wr: *mut ib_recv_wr = core::ptr::null_mut();\\n\\n let err = unsafe {\\n\\n bd_ib_post_recv(\\n\\n self.qp.get_qp(),\\n\\n &mut wr as *mut _,\\n\\n &mut bad_wr as *mut _,\\n\\n )\\n\\n };\\n\\n\\n\\n if err != 0 {\\n\\n println!(\\\"error when post recv {}\\\", err);\\n\\n return Err(Error::from_kernel_errno(err));\\n\\n }\\n\\n\\n\\n Ok(())\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"rust-kernel-rdma/KRdmaKit/src/qp/ud_op.rs\",\n \"rank\": 97,\n \"score\": 65.95114441207579\n },\n {\n \"content\": \" println!(\\\"[after] value = {}\\\", unsafe { *(target_buf) });\\n\\n print_test_msgs(0, unsafe { *(target_buf) } == write_value);\\n\\n\\n\\n\\n\\n let mut profile = Profile::new();\\n\\n profile.reset_timer();\\n\\n let running_cnt = 40000;\\n\\n for _ in 0..running_cnt {\\n\\n if op.push(ib_wr_opcode::IB_WR_RDMA_WRITE,\\n\\n (unsafe { pa_to_va(laddr as *mut i8) }) as u64, lkey, 32, raddr, rkey,\\n\\n ib_send_flags::IB_SEND_SIGNALED | ib_send_flags::IB_SEND_INLINE).is_err() {\\n\\n println!(\\\"push error\\\");\\n\\n return;\\n\\n };\\n\\n\\n\\n let mut cnt = 0;\\n\\n loop {\\n\\n let ret = op.pop();\\n\\n if ret.is_some() {\\n\\n break;\\n\",\n \"file_path\": \"rust-kernel-rdma/KRdmaKit/unitests/qp/src/lib.rs\",\n \"rank\": 98,\n \"score\": 65.9339681318883\n },\n {\n \"content\": \"use rust_kernel_rdma_base::*;\\n\\npub const DEFAULT_BATCH_SZ: usize = 64;\\n\\n\\n\\npub struct DoorbellHelper {\\n\\n pub wrs: [ib_rdma_wr; DEFAULT_BATCH_SZ],\\n\\n pub sges: [ib_sge; DEFAULT_BATCH_SZ],\\n\\n\\n\\n cur_idx: isize,\\n\\n capacity: usize,\\n\\n}\\n\\n\\n\\nimpl DoorbellHelper {\\n\\n pub fn create(capacity: usize, op: u32) -> Self {\\n\\n let mut ret = Self {\\n\\n capacity,\\n\\n cur_idx: -1,\\n\\n wrs: [Default::default(); DEFAULT_BATCH_SZ],\\n\\n sges: [Default::default(); DEFAULT_BATCH_SZ],\\n\\n };\\n\\n for i in 0..capacity {\\n\",\n \"file_path\": \"rust-kernel-rdma/KRdmaKit/src/qp/doorbell.rs\",\n \"rank\": 99,\n \"score\": 65.7109583530209\n }\n]","isConversational":false}}},{"rowIdx":2387,"cells":{"lang":{"kind":"string","value":"Rust"},"file_path":{"kind":"string","value":"pallet/src/tests.rs"},"repo_name":{"kind":"string","value":"4meta5/deleg8"},"commit":{"kind":"string","value":"6bca6d8e1385ea259f7e52eb03dee46d2be112b7"},"file_code":{"kind":"string","value":"#![cfg(test)]\n\nuse super::*;\nuse frame_support::{\n assert_noop,\n assert_ok,\n impl_outer_event,\n impl_outer_origin,\n parameter_types,\n weights::Weight,\n};\nuse sp_core::H256;\nuse sp_runtime::{\n testing::Header,\n traits::IdentityLookup,\n Perbill,\n};\n\npub type AccountId = u64;\npub type BlockNumber = u64;\n\nimpl_outer_origin! {\n pub enum Origin for TestRuntime {}\n}\n\nmod delegate {\n pub use super::super::*;\n}\n\nimpl_outer_event! {\n pub enum TestEvent for TestRuntime {\n frame_system<T>,\n pallet_balances<T>,\n delegate<T>,\n }\n}\n\n#[derive(Clone, Eq, PartialEq)]\npub struct TestRuntime;\nparameter_types! {\n pub const BlockHashCount: u64 = 250;\n pub const MaximumBlockWeight: Weight = 1024;\n pub const MaximumBlockLength: u32 = 2 * 1024;\n pub const AvailableBlockRatio: Perbill = Perbill::one();\n}\nimpl frame_system::Trait for TestRuntime {\n type Origin = Origin;\n type Index = u64;\n type BlockNumber = BlockNumber;\n type Call = ();\n type Hash = H256;\n type Hashing = ::sp_runtime::traits::BlakeTwo256;\n type AccountId = AccountId;\n type Lookup = IdentityLookup<Self::AccountId>;\n type Header = Header;\n type Event = TestEvent;\n type BlockHashCount = BlockHashCount;\n type MaximumBlockWeight = MaximumBlockWeight;\n type MaximumExtrinsicWeight = MaximumBlockWeight;\n type DbWeight = ();\n type BlockExecutionWeight = ();\n type ExtrinsicBaseWeight = ();\n type AvailableBlockRatio = AvailableBlockRatio;\n type MaximumBlockLength = MaximumBlockLength;\n type Version = ();\n type ModuleToIndex = ();\n type AccountData = pallet_balances::AccountData<u64>;\n type OnNewAccount = ();\n type OnKilledAccount = ();\n type BaseCallFilter = ();\n type SystemWeightInfo = ();\n}\nparameter_types! {\n pub const ExistentialDeposit: u64 = 1;\n}\nimpl pallet_balances::Trait for TestRuntime {\n type Balance = u64;\n type Event = TestEvent;\n type DustRemoval = ();\n type ExistentialDeposit = ExistentialDeposit;\n type AccountStore = System;\n type WeightInfo = ();\n}\nparameter_types! {\n pub const Bond: u64 = 2;\n pub const MaxSize: u32 = 5;\n pub const MaxDepth: u32 = 3;\n pub const MaxKids: u32 = 3;\n}\nimpl Trait for TestRuntime {\n type Event = TestEvent;\n type TreeId = u64;\n type Bond = Bond;\n type MaxSize = MaxSize;\n type MaxDepth = MaxDepth;\n type MaxKids = MaxKids;\n type Currency = Balances;\n}\npub type System = frame_system::Module<TestRuntime>;\npub type Balances = pallet_balances::Module<TestRuntime>;\npub type Delegate = Module<TestRuntime>;\n\nfn get_last_event() -> RawEvent<u64, u64, u64> {\n System::events()\n .into_iter()\n .map(|r| r.event)\n .filter_map(|e| {\n if let TestEvent::delegate(inner) = e {\n Some(inner)\n } else {\n None\n }\n })\n .last()\n .unwrap()\n}\n\nfn new_test_ext() -> sp_io::TestExternalities {\n let mut t = frame_system::GenesisConfig::default()\n .build_storage::<TestRuntime>()\n .unwrap();\n pallet_balances::GenesisConfig::<TestRuntime> {\n balances: vec![\n (1, 1000),\n (2, 100),\n (3, 100),\n (4, 100),\n (5, 100),\n (6, 100),\n ],\n }\n .assimilate_storage(&mut t)\n .unwrap();\n let mut ext: sp_io::TestExternalities = t.into();\n ext.execute_with(|| System::set_block_number(1));\n ext\n}\n\n#[test]\nfn genesis_config_works() {\n new_test_ext().execute_with(|| {\n assert!(System::events().is_empty());\n });\n}\n\n#[test]\nfn create_root_works() {\n new_test_ext().execute_with(|| {\n assert_noop!(\n Delegate::create_root(Origin::signed(21)),\n DispatchError::Module {\n index: 0,\n error: 3,\n message: Some(\"InsufficientBalance\")\n }\n );\n assert_eq!(Balances::free_balance(&1), 1000);\n assert_ok!(Delegate::create_root(Origin::signed(1)));\n assert_eq!(RawEvent::RegisterIdRoot(0, 1, 2), get_last_event());\n assert_eq!(Balances::free_balance(&1), 998);\n for i in 2u64..7u64 {\n assert_eq!(Balances::free_balance(&i), 100);\n assert_ok!(Delegate::create_root(Origin::signed(i)));\n assert_eq!(\n RawEvent::RegisterIdRoot(i - 1u64, i, 2),\n get_last_event()\n );\n assert_eq!(Balances::free_balance(&i), 98);\n }\n });\n}\n\n#[test]\nfn base_case_revoke_works() {\n new_test_ext().execute_with(|| {\n assert_eq!(Balances::free_balance(&1), 1000);\n assert_ok!(Delegate::create_root(Origin::signed(1)));\n assert_eq!(RawEvent::RegisterIdRoot(0, 1, 2), get_last_event());\n assert_eq!(Balances::free_balance(&1), 998);\n assert_ok!(Delegate::revoke(Origin::signed(1), 0, false));\n assert_eq!(RawEvent::RevokeDelegation(0), get_last_event());\n assert_eq!(Balances::free_balance(&1), 1000);\n for i in 2u64..7u64 {\n assert_eq!(Balances::free_balance(&i), 100);\n assert_ok!(Delegate::create_root(Origin::signed(i)));\n assert_eq!(\n RawEvent::RegisterIdRoot(i - 1u64, i, 2),\n get_last_event()\n );\n assert_eq!(Balances::free_balance(&i), 98);\n assert_ok!(Delegate::revoke(Origin::signed(i), i - 1u64, false));\n assert_eq!(RawEvent::RevokeDelegation(i - 1), get_last_event());\n assert_eq!(Balances::free_balance(&i), 100);\n }\n });\n}\n\n#[test]\nfn add_remove_members_works() {\n new_test_ext().execute_with(|| {\n assert_eq!(Balances::free_balance(&1), 1000);\n assert_ok!(Delegate::create_root(Origin::signed(1)));\n assert_eq!(RawEvent::RegisterIdRoot(0, 1, 2), get_last_event());\n assert_eq!(Balances::free_balance(&1), 998);\n \n assert_noop!(\n Delegate::add_members(Origin::signed(1), 0, vec![1, 2, 3, 4, 5, 6]),\n Error::<TestRuntime>::CannotAddGroupAboveMaxSize\n );\n \n assert_ok!(Delegate::add_members(\n Origin::signed(1),\n 0,\n vec![2, 3, 4, 5]\n ));\n \n \n assert_eq!(Balances::free_balance(&1), 988);\n assert_noop!(\n Delegate::remove_members(\n Origin::signed(2),\n 0,\n vec![1, 3, 5],\n false,\n ),\n Error::<TestRuntime>::NotAuthorized\n );\n assert_ok!(Delegate::remove_members(\n Origin::signed(1),\n 0,\n vec![2],\n false,\n ));\n });\n}\n\n#[test]\nfn delegate_works() {\n new_test_ext().execute_with(|| {\n assert_ok!(Delegate::create_root(Origin::signed(1)));\n assert_eq!(RawEvent::RegisterIdRoot(0, 1, 2), get_last_event());\n assert_eq!(Balances::free_balance(&1), 998);\n assert_ok!(Delegate::delegate(Origin::signed(1), 0, vec![2, 3, 4]));\n \n assert_eq!(Balances::free_balance(&1), 994);\n assert_eq!(RawEvent::DelegateBranch(0, 1, 1, 4), get_last_event());\n assert_ok!(Delegate::delegate(Origin::signed(1), 0, vec![3, 4, 6]));\n \n assert_eq!(Balances::free_balance(&1), 986);\n assert_eq!(RawEvent::DelegateBranch(0, 2, 1, 8), get_last_event());\n assert_ok!(Delegate::delegate(Origin::signed(2), 1, vec![3, 5]));\n \n assert_eq!(Balances::free_balance(&2), 92);\n assert_eq!(RawEvent::DelegateBranch(1, 3, 2, 8), get_last_event());\n assert_ok!(Delegate::delegate(Origin::signed(3), 3, vec![1, 2]));\n \n assert_eq!(Balances::free_balance(&3), 84);\n assert_eq!(RawEvent::DelegateBranch(3, 4, 3, 16), get_last_event());\n \n assert_noop!(\n Delegate::delegate(Origin::signed(2), 4, vec![5, 6]),\n Error::<TestRuntime>::CannotDelegateBelowMaxDepth\n );\n assert_ok!(Delegate::delegate(Origin::signed(1), 0, vec![5, 6]));\n \n assert_eq!(Balances::free_balance(&1), 970);\n assert_eq!(RawEvent::DelegateBranch(0, 5, 1, 16), get_last_event());\n \n assert_noop!(\n Delegate::delegate(Origin::signed(1), 0, vec![2, 8]),\n Error::<TestRuntime>::CannotDelegateAboveMaxKids\n );\n });\n}\n\n#[test]\nfn recursive_revoke_works() {\n new_test_ext().execute_with(|| {\n assert_ok!(Delegate::create_root(Origin::signed(1)));\n assert_eq!(RawEvent::RegisterIdRoot(0, 1, 2), get_last_event());\n assert_eq!(Balances::free_balance(&1), 998);\n assert_ok!(Delegate::delegate(Origin::signed(1), 0, vec![2, 3, 4]));\n \n assert_eq!(Balances::free_balance(&1), 994);\n assert_eq!(RawEvent::DelegateBranch(0, 1, 1, 4), get_last_event());\n \n assert_eq!(Balances::free_balance(&1), 994);\n assert_eq!(RawEvent::DelegateBranch(0, 1, 1, 4), get_last_event());\n assert_ok!(Delegate::delegate(Origin::signed(1), 0, vec![3, 4, 6]));\n \n assert_eq!(Balances::free_balance(&1), 986);\n assert_eq!(RawEvent::DelegateBranch(0, 2, 1, 8), get_last_event());\n assert_ok!(Delegate::delegate(Origin::signed(2), 1, vec![3, 5]));\n \n assert_eq!(Balances::free_balance(&2), 92);\n assert_eq!(RawEvent::DelegateBranch(1, 3, 2, 8), get_last_event());\n assert_ok!(Delegate::delegate(Origin::signed(3), 3, vec![1, 2]));\n \n assert_eq!(Balances::free_balance(&3), 84);\n assert_eq!(RawEvent::DelegateBranch(3, 4, 3, 16), get_last_event());\n assert_ok!(Delegate::delegate(Origin::signed(5), 3, vec![1, 2]));\n \n assert_eq!(Balances::free_balance(&5), 68);\n assert_eq!(RawEvent::DelegateBranch(3, 5, 5, 32), get_last_event());\n assert_ok!(Delegate::revoke(Origin::signed(1), 0, false));\n assert_eq!(Balances::free_balance(&5), 100);\n assert_eq!(Balances::free_balance(&3), 100);\n assert_eq!(Balances::free_balance(&1), 1000);\n assert_eq!(Balances::free_balance(&2), 100);\n });\n}\n"},"prefix":{"kind":"string","value":"#![cfg(test)]\n\nuse super::*;\nuse frame_support::{\n assert_noop,\n assert_ok,\n impl_outer_event,\n impl_outer_origin,\n parameter_types,\n weights::Weight,\n};\nuse sp_core::H256;\nuse sp_runtime::{\n testing::Header,\n traits::IdentityLookup,\n Perbill,\n};\n\npub type AccountId = u64;\npub type BlockNumber = u64;\n\nimpl_outer_origin! {\n pub enum Origin for TestRuntime {}\n}\n\nmod delegate {\n pub use super::super::*;\n}\n\nimpl_outer_event! {\n pub enum TestEvent for TestRuntime {\n frame_system<T>,\n pallet_balances<T>,\n delegate<T>,\n }\n}\n\n#[derive(Clone, Eq, PartialEq)]\npub struct TestRuntime;\nparameter_types! {\n pub const BlockHashCount: u64 = 250;\n pub const MaximumBlockWeight: Weight = 1024;\n pub const MaximumBlockLength: u32 = 2 * 1024;\n pub const AvailableBlockRatio: Perbill = Perbill::one();\n}\nimpl frame_system::Trait for TestRuntime {\n type Origin = Origin;\n type Index = u64;\n type BlockNumber = BlockNumber;\n type Call = ();\n type Hash = H256;\n type Hashing = ::sp_runtime::traits::BlakeTwo256;\n type AccountId = AccountId;\n type Lookup = IdentityLookup<Self::AccountId>;\n type Header = Header;\n type Event = TestEvent;\n type BlockHashCount = BlockHashCount;\n type MaximumBlockWeight = MaximumBlockWeight;\n type MaximumExtrinsicWeight = MaximumBlockWeight;\n type DbWeight = ();\n type BlockExecutionWeight = ();\n type ExtrinsicBaseWeight = ();\n type AvailableBlockRatio = AvailableBlockRatio;\n type MaximumBlockLength = MaximumBlockLength;\n type Version = ();\n type ModuleToIndex = ();\n type AccountData = pallet_balances::AccountData<u64>;\n type OnNewAccount = ();\n type OnKilledAccount = ();\n type BaseCallFilter = ();\n type SystemWeightInfo = ();\n}\nparameter_types! {\n pub const ExistentialDeposit: u64 = 1;\n}\nimpl pallet_balances::Trait for TestRuntime {\n type Balance = u64;\n type Event = TestEvent;\n type DustRemoval = ();\n type ExistentialDeposit = ExistentialDeposit;\n type AccountStore = System;\n type WeightInfo = ();\n}\nparameter_types! {\n pub const Bond: u64 = 2;\n pub const MaxSize: u32 = 5;\n pub const MaxDepth: u32 = 3;\n pub const MaxKids: u32 = 3;\n}\nimpl Trait for TestRuntime {\n type Event = TestEvent;\n type TreeId = u64;\n type Bond = Bond;\n type MaxSize = MaxSize;\n type MaxDepth = MaxDepth;\n type MaxKids = MaxKids;\n type Currency = Balances;\n}\npub type System = frame_system::Module<TestRuntime>;\npub type Balances = pallet_balances::Module<TestRuntime>;\npub type Delegate = Module<TestRuntime>;\n\nfn get_last_event() -> RawEvent<u64, u64, u64> {\n System::events()\n .into_iter()\n .map(|r| r.event)\n .filter_map(|e| {\n if let TestEvent::delegate(inner) = e {\n Some(inner)\n } else {\n None\n }\n })\n .last()\n .unwrap()\n}\n\nfn new_test_ext() -> sp_io::TestExternalities {\n let mut t = frame_system::GenesisConfig::default()\n .build_storage::<TestRuntime>()\n ."},"suffix":{"kind":"string","value":"\n\n#[test]\nfn genesis_config_works() {\n new_test_ext().execute_with(|| {\n assert!(System::events().is_empty());\n });\n}\n\n#[test]\nfn create_root_works() {\n new_test_ext().execute_with(|| {\n assert_noop!(\n Delegate::create_root(Origin::signed(21)),\n DispatchError::Module {\n index: 0,\n error: 3,\n message: Some(\"InsufficientBalance\")\n }\n );\n assert_eq!(Balances::free_balance(&1), 1000);\n assert_ok!(Delegate::create_root(Origin::signed(1)));\n assert_eq!(RawEvent::RegisterIdRoot(0, 1, 2), get_last_event());\n assert_eq!(Balances::free_balance(&1), 998);\n for i in 2u64..7u64 {\n assert_eq!(Balances::free_balance(&i), 100);\n assert_ok!(Delegate::create_root(Origin::signed(i)));\n assert_eq!(\n RawEvent::RegisterIdRoot(i - 1u64, i, 2),\n get_last_event()\n );\n assert_eq!(Balances::free_balance(&i), 98);\n }\n });\n}\n\n#[test]\nfn base_case_revoke_works() {\n new_test_ext().execute_with(|| {\n assert_eq!(Balances::free_balance(&1), 1000);\n assert_ok!(Delegate::create_root(Origin::signed(1)));\n assert_eq!(RawEvent::RegisterIdRoot(0, 1, 2), get_last_event());\n assert_eq!(Balances::free_balance(&1), 998);\n assert_ok!(Delegate::revoke(Origin::signed(1), 0, false));\n assert_eq!(RawEvent::RevokeDelegation(0), get_last_event());\n assert_eq!(Balances::free_balance(&1), 1000);\n for i in 2u64..7u64 {\n assert_eq!(Balances::free_balance(&i), 100);\n assert_ok!(Delegate::create_root(Origin::signed(i)));\n assert_eq!(\n RawEvent::RegisterIdRoot(i - 1u64, i, 2),\n get_last_event()\n );\n assert_eq!(Balances::free_balance(&i), 98);\n assert_ok!(Delegate::revoke(Origin::signed(i), i - 1u64, false));\n assert_eq!(RawEvent::RevokeDelegation(i - 1), get_last_event());\n assert_eq!(Balances::free_balance(&i), 100);\n }\n });\n}\n\n#[test]\nfn add_remove_members_works() {\n new_test_ext().execute_with(|| {\n assert_eq!(Balances::free_balance(&1), 1000);\n assert_ok!(Delegate::create_root(Origin::signed(1)));\n assert_eq!(RawEvent::RegisterIdRoot(0, 1, 2), get_last_event());\n assert_eq!(Balances::free_balance(&1), 998);\n \n assert_noop!(\n Delegate::add_members(Origin::signed(1), 0, vec![1, 2, 3, 4, 5, 6]),\n Error::<TestRuntime>::CannotAddGroupAboveMaxSize\n );\n \n assert_ok!(Delegate::add_members(\n Origin::signed(1),\n 0,\n vec![2, 3, 4, 5]\n ));\n \n \n assert_eq!(Balances::free_balance(&1), 988);\n assert_noop!(\n Delegate::remove_members(\n Origin::signed(2),\n 0,\n vec![1, 3, 5],\n false,\n ),\n Error::<TestRuntime>::NotAuthorized\n );\n assert_ok!(Delegate::remove_members(\n Origin::signed(1),\n 0,\n vec![2],\n false,\n ));\n });\n}\n\n#[test]\nfn delegate_works() {\n new_test_ext().execute_with(|| {\n assert_ok!(Delegate::create_root(Origin::signed(1)));\n assert_eq!(RawEvent::RegisterIdRoot(0, 1, 2), get_last_event());\n assert_eq!(Balances::free_balance(&1), 998);\n assert_ok!(Delegate::delegate(Origin::signed(1), 0, vec![2, 3, 4]));\n \n assert_eq!(Balances::free_balance(&1), 994);\n assert_eq!(RawEvent::DelegateBranch(0, 1, 1, 4), get_last_event());\n assert_ok!(Delegate::delegate(Origin::signed(1), 0, vec![3, 4, 6]));\n \n assert_eq!(Balances::free_balance(&1), 986);\n assert_eq!(RawEvent::DelegateBranch(0, 2, 1, 8), get_last_event());\n assert_ok!(Delegate::delegate(Origin::signed(2), 1, vec![3, 5]));\n \n assert_eq!(Balances::free_balance(&2), 92);\n assert_eq!(RawEvent::DelegateBranch(1, 3, 2, 8), get_last_event());\n assert_ok!(Delegate::delegate(Origin::signed(3), 3, vec![1, 2]));\n \n assert_eq!(Balances::free_balance(&3), 84);\n assert_eq!(RawEvent::DelegateBranch(3, 4, 3, 16), get_last_event());\n \n assert_noop!(\n Delegate::delegate(Origin::signed(2), 4, vec![5, 6]),\n Error::<TestRuntime>::CannotDelegateBelowMaxDepth\n );\n assert_ok!(Delegate::delegate(Origin::signed(1), 0, vec![5, 6]));\n \n assert_eq!(Balances::free_balance(&1), 970);\n assert_eq!(RawEvent::DelegateBranch(0, 5, 1, 16), get_last_event());\n \n assert_noop!(\n Delegate::delegate(Origin::signed(1), 0, vec![2, 8]),\n Error::<TestRuntime>::CannotDelegateAboveMaxKids\n );\n });\n}\n\n#[test]\nfn recursive_revoke_works() {\n new_test_ext().execute_with(|| {\n assert_ok!(Delegate::create_root(Origin::signed(1)));\n assert_eq!(RawEvent::RegisterIdRoot(0, 1, 2), get_last_event());\n assert_eq!(Balances::free_balance(&1), 998);\n assert_ok!(Delegate::delegate(Origin::signed(1), 0, vec![2, 3, 4]));\n \n assert_eq!(Balances::free_balance(&1), 994);\n assert_eq!(RawEvent::DelegateBranch(0, 1, 1, 4), get_last_event());\n \n assert_eq!(Balances::free_balance(&1), 994);\n assert_eq!(RawEvent::DelegateBranch(0, 1, 1, 4), get_last_event());\n assert_ok!(Delegate::delegate(Origin::signed(1), 0, vec![3, 4, 6]));\n \n assert_eq!(Balances::free_balance(&1), 986);\n assert_eq!(RawEvent::DelegateBranch(0, 2, 1, 8), get_last_event());\n assert_ok!(Delegate::delegate(Origin::signed(2), 1, vec![3, 5]));\n \n assert_eq!(Balances::free_balance(&2), 92);\n assert_eq!(RawEvent::DelegateBranch(1, 3, 2, 8), get_last_event());\n assert_ok!(Delegate::delegate(Origin::signed(3), 3, vec![1, 2]));\n \n assert_eq!(Balances::free_balance(&3), 84);\n assert_eq!(RawEvent::DelegateBranch(3, 4, 3, 16), get_last_event());\n assert_ok!(Delegate::delegate(Origin::signed(5), 3, vec![1, 2]));\n \n assert_eq!(Balances::free_balance(&5), 68);\n assert_eq!(RawEvent::DelegateBranch(3, 5, 5, 32), get_last_event());\n assert_ok!(Delegate::revoke(Origin::signed(1), 0, false));\n assert_eq!(Balances::free_balance(&5), 100);\n assert_eq!(Balances::free_balance(&3), 100);\n assert_eq!(Balances::free_balance(&1), 1000);\n assert_eq!(Balances::free_balance(&2), 100);\n });\n}\n"},"middle":{"kind":"string","value":"unwrap();\n pallet_balances::GenesisConfig::<TestRuntime> {\n balances: vec![\n (1, 1000),\n (2, 100),\n (3, 100),\n (4, 100),\n (5, 100),\n (6, 100),\n ],\n }\n .assimilate_storage(&mut t)\n .unwrap();\n let mut ext: sp_io::TestExternalities = t.into();\n ext.execute_with(|| System::set_block_number(1));\n ext\n}"},"strategy":{"kind":"string","value":"function_block-function_prefix_line"},"context_items":{"kind":"list like","value":[{"content":"pub trait Trait: System {\n\n /// Overarching event type\n\n type Event: From<Event<Self>> + Into<<Self as System>::Event>;\n\n\n\n /// The identifier for trees\n\n type TreeId: Parameter\n\n + Member\n\n + AtLeast32Bit\n\n + Codec\n\n + Default\n\n + Copy\n\n + MaybeSerializeDeserialize\n\n + Debug\n\n + PartialOrd\n\n + PartialEq\n\n + Zero;\n\n\n\n /// Bond amount, charged per depth\n\n type Bond: Get<BalanceOf<Self>>;\n\n\n","file_path":"pallet/src/lib.rs","rank":0,"score":122043.88438855714},{"content":"type TreeSt<T> = TreeState<<T as Trait>::TreeId, <T as System>::AccountId>;\n","file_path":"pallet/src/lib.rs","rank":2,"score":89373.51030809613},{"content":"#[cfg(feature = \"std\")]\n\npub fn native_version() -> NativeVersion {\n\n NativeVersion {\n\n runtime_version: VERSION,\n\n can_author_with: Default::default(),\n\n }\n\n}\n\n\n\nparameter_types! {\n\n pub const BlockHashCount: BlockNumber = 250;\n\n /// We allow for 2 seconds of compute with a 6 second average block time.\n\n pub const MaximumBlockWeight: Weight = 2 * WEIGHT_PER_SECOND;\n\n pub const AvailableBlockRatio: Perbill = Perbill::from_percent(75);\n\n /// Assume 10% of weight for average on_initialize calls.\n\n pub MaximumExtrinsicWeight: Weight = AvailableBlockRatio::get()\n\n .saturating_sub(Perbill::from_percent(10)) * MaximumBlockWeight::get();\n\n pub const MaximumBlockLength: u32 = 5 * 1024 * 1024;\n\n pub const Version: RuntimeVersion = VERSION;\n\n}\n\n\n\nimpl frame_system::Trait for Runtime {\n","file_path":"node/runtime/src/lib.rs","rank":3,"score":86483.72164489393},{"content":"pub fn testnet_genesis(\n\n initial_authorities: Vec<(AuraId, GrandpaId)>,\n\n endowed_accounts: Vec<AccountId>,\n\n) -> GenesisConfig {\n\n GenesisConfig {\n\n frame_system: Some(SystemConfig {\n\n code: WASM_BINARY.to_vec(),\n\n changes_trie_config: Default::default(),\n\n }),\n\n pallet_balances: Some(BalancesConfig {\n\n balances: endowed_accounts\n\n .iter()\n\n .cloned()\n\n .map(|k| (k, 1 << 60))\n\n .collect(),\n\n }),\n\n pallet_aura: Some(AuraConfig {\n\n authorities: initial_authorities\n\n .iter()\n\n .map(|x| (x.0.clone()))\n","file_path":"node/src/lib.rs","rank":4,"score":67584.81048756083},{"content":" trait Store for Module<T: Trait> as Delegate {\n\n /// The nonce for unique tree id generation\n\n TreeIdCounter get(fn tree_id_counter): T::TreeId;\n\n\n\n /// The state of trees\n\n pub Trees get(fn trees): map\n\n hasher(blake2_128_concat) T::TreeId => Option<TreeSt<T>>;\n\n\n\n /// Membership, also tracks bonded amount for existing members\n\n pub Members get(fn members): double_map\n\n hasher(blake2_128_concat) T::TreeId,\n\n hasher(blake2_128_concat) T::AccountId => Option<BalanceOf<T>>;\n\n }\n\n}\n\n\n\ndecl_module! {\n\n pub struct Module<T: Trait> for enum Call where origin: T::Origin {\n\n type Error = Error<T>;\n\n fn deposit_event() = default;\n\n\n","file_path":"pallet/src/lib.rs","rank":5,"score":63326.96391685682},{"content":"type BalanceOf<T> =\n\n <<T as Trait>::Currency as Currency<<T as System>::AccountId>>::Balance;\n","file_path":"pallet/src/lib.rs","rank":6,"score":61839.296888245524},{"content":"pub fn development_config() -> ChainSpec {\n\n ChainSpec::from_genesis(\n\n \"Development\",\n\n \"dev\",\n\n ChainType::Development,\n\n || {\n\n testnet_genesis(\n\n // initial authorities\n\n vec![get_authority_keys_from_seed(\"Alice\")],\n\n // endowed accounts\n\n vec![\n\n get_account_id_from_seed::<sr25519::Public>(\"Alice\"),\n\n get_account_id_from_seed::<sr25519::Public>(\"Bob\"),\n\n get_account_id_from_seed::<sr25519::Public>(\"Alice//stash\"),\n\n get_account_id_from_seed::<sr25519::Public>(\"Bob//stash\"),\n\n ],\n\n )\n\n },\n\n vec![],\n\n None,\n\n None,\n\n None,\n\n None,\n\n )\n\n}\n\n\n","file_path":"node/src/lib.rs","rank":7,"score":61668.23201614833},{"content":"pub fn local_testnet_config() -> ChainSpec {\n\n ChainSpec::from_genesis(\n\n \"Local Testnet\",\n\n \"local_testnet\",\n\n ChainType::Local,\n\n || {\n\n testnet_genesis(\n\n // initial authorities\n\n vec![\n\n get_authority_keys_from_seed(\"Alice\"),\n\n get_authority_keys_from_seed(\"Bob\"),\n\n ],\n\n // endowed accounts\n\n vec![\n\n get_account_id_from_seed::<sr25519::Public>(\"Alice\"),\n\n get_account_id_from_seed::<sr25519::Public>(\"Bob\"),\n\n get_account_id_from_seed::<sr25519::Public>(\"Charlie\"),\n\n get_account_id_from_seed::<sr25519::Public>(\"Dave\"),\n\n get_account_id_from_seed::<sr25519::Public>(\"Eve\"),\n\n get_account_id_from_seed::<sr25519::Public>(\"Ferdie\"),\n","file_path":"node/src/lib.rs","rank":8,"score":60102.70789364768},{"content":"/// Helper function to generate an account ID from seed\n\npub fn get_account_id_from_seed<TPublic: Public>(seed: &str) -> AccountId\n\nwhere\n\n AccountPublic: From<<TPublic::Pair as Pair>::Public>,\n\n{\n\n AccountPublic::from(get_from_seed::<TPublic>(seed)).into_account()\n\n}\n\n\n","file_path":"node/src/lib.rs","rank":9,"score":58282.324555532454},{"content":"/// Helper function to generate a crypto pair from seed\n\npub fn get_from_seed<TPublic: Public>(\n\n seed: &str,\n\n) -> <TPublic::Pair as Pair>::Public {\n\n TPublic::Pair::from_string(&format!(\"//{}\", seed), None)\n\n .expect(\"static values are valid; qed\")\n\n .public()\n\n}\n\n\n","file_path":"node/src/lib.rs","rank":10,"score":58144.70629694857},{"content":"fn force_parity_db(runner: &mut Runner<Cli>) {\n\n let config = runner.config_mut();\n\n let path = config.database.path().unwrap().to_path_buf();\n\n config.database = DatabaseConfig::ParityDb { path };\n\n}\n","file_path":"node/src/main.rs","rank":11,"score":56812.677221288744},{"content":"/// Helper function to generate an authority key for Aura\n\npub fn get_authority_keys_from_seed(s: &str) -> (AuraId, GrandpaId) {\n\n (get_from_seed::<AuraId>(s), get_from_seed::<GrandpaId>(s))\n\n}\n\n\n","file_path":"node/src/lib.rs","rank":13,"score":49906.2183535926},{"content":"fn main() {\n\n generate_cargo_keys();\n\n\n\n rerun_if_git_head_changed();\n\n}\n","file_path":"node/build.rs","rank":15,"score":35385.938812718494},{"content":"fn main() {\n\n WasmBuilder::new()\n\n .with_current_project()\n\n .with_wasm_builder_from_crates(\"1.0.9\")\n\n .export_heap_base()\n\n .import_memory()\n\n .build()\n\n}\n","file_path":"node/runtime/build.rs","rank":16,"score":34144.85612808063},{"content":"type AccountPublic = <Signature as Verify>::Signer;\n\n\n","file_path":"node/src/lib.rs","rank":17,"score":32643.25899483379},{"content":"fn main() -> sc_cli::Result<()> {\n\n let cli = <Cli as SubstrateCli>::from_args();\n\n match &cli.subcommand {\n\n Some(subcommand) => {\n\n let mut runner = cli.create_runner(subcommand)?;\n\n force_parity_db(&mut runner);\n\n runner.run_subcommand(subcommand, |config| {\n\n let PartialComponents {\n\n client,\n\n backend,\n\n task_manager,\n\n import_queue,\n\n ..\n\n } = test_node::new_partial(&config)?;\n\n Ok((client, backend, import_queue, task_manager))\n\n })\n\n }\n\n None => {\n\n let mut runner = cli.create_runner(&cli.run)?;\n\n force_parity_db(&mut runner);\n","file_path":"node/src/main.rs","rank":23,"score":29011.627171096152},{"content":" /// The identifier used to distinguish between accounts.\n\n type AccountId = AccountId;\n\n /// The aggregated dispatch type that is available for extrinsics.\n\n type Call = Call;\n\n /// The lookup mechanism to get account ID from whatever is passed in dispatchers.\n\n type Lookup = traits::IdentityLookup<AccountId>;\n\n /// The index type for storing how many extrinsics an account has signed.\n\n type Index = Index;\n\n /// The index type for blocks.\n\n type BlockNumber = BlockNumber;\n\n /// The type for hashing blocks and tries.\n\n type Hash = Hash;\n\n /// The hashing algorithm used.\n\n type Hashing = BlakeTwo256;\n\n /// The header type.\n\n type Header = generic::Header<BlockNumber, BlakeTwo256>;\n\n /// The ubiquitous event type.\n\n type Event = Event;\n\n /// The ubiquitous origin type.\n\n type Origin = Origin;\n","file_path":"node/runtime/src/lib.rs","rank":28,"score":20.153000457675635},{"content":"};\n\npub use pallet_balances::Call as BalancesCall;\n\npub use pallet_timestamp::Call as TimestampCall;\n\n#[cfg(any(feature = \"std\", test))]\n\npub use sp_runtime::BuildStorage;\n\npub use sp_runtime::{\n\n traits,\n\n Perbill,\n\n Permill,\n\n};\n\n\n\n/// Tree identifier\n\npub type TreeId = u64;\n\n\n\n/// An index to a block.\n\npub type BlockNumber = u32;\n\n\n\n/// Alias to 512-bit hash when used in the context of a transaction signature on the chain.\n\npub type Signature = MultiSignature;\n\n\n","file_path":"node/runtime/src/lib.rs","rank":30,"score":19.56125223281105},{"content":" pub const Bond: Balance = 10;\n\n pub const MaxSize: u32 = 5;\n\n pub const MaxDepth: u32 = 5;\n\n pub const MaxKids: u32 = 2;\n\n}\n\nimpl delegate::Trait for Runtime {\n\n type Event = Event;\n\n type TreeId = TreeId;\n\n type Bond = Bond;\n\n type MaxSize = MaxSize;\n\n type MaxDepth = MaxDepth;\n\n type MaxKids = MaxKids;\n\n type Currency = Balances;\n\n}\n\n\n\nconstruct_runtime!(\n\n pub enum Runtime where\n\n Block = Block,\n\n NodeBlock = opaque::Block,\n\n UncheckedExtrinsic = UncheckedExtrinsic\n","file_path":"node/runtime/src/lib.rs","rank":32,"score":17.627023453439357},{"content":" /// The ubiquitous event type.\n\n type Event = Event;\n\n type DustRemoval = ();\n\n type ExistentialDeposit = ExistentialDeposit;\n\n type AccountStore = System;\n\n type WeightInfo = ();\n\n}\n\n\n\nparameter_types! {\n\n pub const TransactionByteFee: Balance = 1;\n\n}\n\n\n\nimpl pallet_transaction_payment::Trait for Runtime {\n\n type Currency = pallet_balances::Module<Runtime>;\n\n type OnTransactionPayment = ();\n\n type TransactionByteFee = TransactionByteFee;\n\n type WeightToFee = IdentityFee<Balance>;\n\n type FeeMultiplierUpdate = ();\n\n}\n\nparameter_types! {\n","file_path":"node/runtime/src/lib.rs","rank":33,"score":16.78380436485226},{"content":" pub grandpa: Grandpa,\n\n }\n\n }\n\n}\n\n\n\nimpl frame_system::offchain::SigningTypes for Runtime {\n\n type Public = <Signature as traits::Verify>::Signer;\n\n type Signature = Signature;\n\n}\n\n\n\nimpl<C> frame_system::offchain::SendTransactionTypes<C> for Runtime\n\nwhere\n\n Call: From<C>,\n\n{\n\n type OverarchingCall = Call;\n\n type Extrinsic = UncheckedExtrinsic;\n\n}\n\n\n\n/// This runtime version.\n\npub const VERSION: RuntimeVersion = RuntimeVersion {\n","file_path":"node/runtime/src/lib.rs","rank":34,"score":16.415100743289802},{"content":" /// Converts a module to the index of the module in `construct_runtime!`.\n\n ///\n\n /// This type is being generated by `construct_runtime!`.\n\n type ModuleToIndex = ModuleToIndex;\n\n /// What to do if a new account is created.\n\n type OnNewAccount = ();\n\n /// What to do if an account is fully reaped from the system.\n\n type OnKilledAccount = ();\n\n /// The data to be stored in an account.\n\n type AccountData = pallet_balances::AccountData<Balance>;\n\n type BaseCallFilter = ();\n\n type SystemWeightInfo = ();\n\n}\n\n\n\nimpl pallet_aura::Trait for Runtime {\n\n type AuthorityId = AuraId;\n\n}\n\n\n\nimpl pallet_grandpa::Trait for Runtime {\n\n type Event = Event;\n","file_path":"node/runtime/src/lib.rs","rank":36,"score":15.994345374893362},{"content":"\n\nparameter_types! {\n\n pub const MinimumPeriod: u64 = SLOT_DURATION / 2;\n\n}\n\n\n\nimpl pallet_timestamp::Trait for Runtime {\n\n /// A timestamp: milliseconds since the unix epoch.\n\n type Moment = u64;\n\n type OnTimestampSet = Aura;\n\n type MinimumPeriod = MinimumPeriod;\n\n type WeightInfo = ();\n\n}\n\n\n\nparameter_types! {\n\n pub const ExistentialDeposit: u128 = 500;\n\n}\n\n\n\nimpl pallet_balances::Trait for Runtime {\n\n /// The type for recording an account's balance.\n\n type Balance = Balance;\n","file_path":"node/runtime/src/lib.rs","rank":37,"score":15.718592478088745},{"content":"/// Some way of identifying an account on the chain. We intentionally make it equivalent\n\n/// to the public key of our transaction signing scheme.\n\npub type AccountId =\n\n <<Signature as Verify>::Signer as IdentifyAccount>::AccountId;\n\n\n\n/// The type for looking up accounts. We don't expect more than 4 billion of them, but you\n\n/// never know...\n\npub type AccountIndex = u32;\n\n\n\n/// Balance of an account.\n\npub type Balance = u128;\n\n\n\n/// Index of a transaction in the chain.\n\npub type Index = u32;\n\n\n\n/// A hash of some data used by the chain.\n\npub type Hash = sp_core::H256;\n\n\n\n/// Digest item type.\n\npub type DigestItem = generic::DigestItem<Hash>;\n","file_path":"node/runtime/src/lib.rs","rank":38,"score":14.832122866667948},{"content":" {\n\n System: frame_system::{Module, Call, Config, Storage, Event<T>},\n\n RandomnessCollectiveFlip: pallet_randomness_collective_flip::{Module, Call, Storage},\n\n Timestamp: pallet_timestamp::{Module, Call, Storage, Inherent},\n\n Aura: pallet_aura::{Module, Config<T>, Inherent},\n\n Grandpa: pallet_grandpa::{Module, Call, Storage, Config, Event},\n\n Balances: pallet_balances::{Module, Call, Storage, Config<T>, Event<T>},\n\n TransactionPayment: pallet_transaction_payment::{Module, Storage},\n\n // delegate module\n\n Delegate: delegate::{Module, Call, Storage, Event<T>},\n\n }\n\n);\n\n\n\n/// The address format for describing accounts.\n\npub type Address = AccountId;\n\n/// Block header type as expected by this runtime.\n\npub type Header = generic::Header<BlockNumber, BlakeTwo256>;\n\n/// Block type as expected by this runtime.\n\npub type Block = generic::Block<Header, UncheckedExtrinsic>;\n\n/// A Block signed with a Justification\n","file_path":"node/runtime/src/lib.rs","rank":39,"score":14.427297896138997},{"content":" /// Maximum group size for all trees\n\n type MaxSize: Get<u32>;\n\n\n\n /// Maximum depth for all trees\n\n type MaxDepth: Get<u32>;\n\n\n\n /// Maximum number of subtrees per tree\n\n type MaxKids: Get<u32>;\n\n\n\n /// Currency type\n\n type Currency: Currency<Self::AccountId>\n\n + ReservableCurrency<Self::AccountId>;\n\n}\n\n\n\ndecl_event!(\n\n pub enum Event<T>\n\n where\n\n <T as Trait>::TreeId,\n\n <T as System>::AccountId,\n\n Balance = BalanceOf<T>,\n","file_path":"pallet/src/lib.rs","rank":40,"score":14.087399979315862},{"content":" #[weight = 0]\n\n fn create_root(\n\n origin,\n\n ) -> DispatchResult {\n\n let caller = ensure_signed(origin)?;\n\n let bond = T::Bond::get();\n\n T::Currency::reserve(&caller, bond)?;\n\n let id = Self::gen_uid();\n\n let state = TreeState {\n\n id,\n\n parent: None,\n\n bonded: caller.clone(),\n\n height: 0u32,\n\n kids: 0u32,\n\n size: 1u32,\n\n };\n\n <Trees<T>>::insert(id, state);\n\n <Members<T>>::insert(id, caller.clone(), bond);\n\n Self::deposit_event(RawEvent::RegisterIdRoot(id, caller, bond));\n\n Ok(())\n","file_path":"pallet/src/lib.rs","rank":41,"score":13.518792111422815},{"content":"\n\npub use frame_support::{\n\n construct_runtime,\n\n debug,\n\n parameter_types,\n\n traits::{\n\n KeyOwnerProofSystem,\n\n Randomness,\n\n },\n\n weights::{\n\n constants::{\n\n BlockExecutionWeight,\n\n ExtrinsicBaseWeight,\n\n RocksDbWeight,\n\n WEIGHT_PER_SECOND,\n\n },\n\n IdentityFee,\n\n Weight,\n\n },\n\n StorageValue,\n","file_path":"node/runtime/src/lib.rs","rank":42,"score":12.235079501256832},{"content":" Encode,\n\n};\n\nuse sp_runtime::{\n\n traits::{\n\n AtLeast32Bit,\n\n MaybeSerializeDeserialize,\n\n Member,\n\n Zero,\n\n },\n\n DispatchResult,\n\n};\n\nuse sp_std::{\n\n fmt::Debug,\n\n prelude::*,\n\n};\n\n\n\n#[derive(PartialEq, Eq, Clone, Encode, Decode, sp_runtime::RuntimeDebug)]\n\npub struct TreeState<TreeId, AccountId> {\n\n pub id: TreeId,\n\n pub parent: Option<TreeId>,\n\n pub bonded: AccountId,\n\n pub height: u32,\n\n pub kids: u32,\n\n pub size: u32,\n\n}\n\n\n","file_path":"pallet/src/lib.rs","rank":43,"score":12.213303095549783},{"content":" type Call = Call;\n\n\n\n type KeyOwnerProofSystem = ();\n\n\n\n type KeyOwnerProof = <Self::KeyOwnerProofSystem as KeyOwnerProofSystem<\n\n (KeyTypeId, AuthorityId),\n\n >>::Proof;\n\n\n\n type KeyOwnerIdentification =\n\n <Self::KeyOwnerProofSystem as KeyOwnerProofSystem<(\n\n KeyTypeId,\n\n AuthorityId,\n\n )>>::IdentificationTuple;\n\n\n\n type HandleEquivocation = ();\n\n}\n\n\n\nparameter_types! {\n\n pub const IndexDeposit: Balance = 1u128;\n\n}\n","file_path":"node/runtime/src/lib.rs","rank":44,"score":12.142243774718004},{"content":" decl_event,\n\n decl_module,\n\n decl_storage,\n\n dispatch::DispatchError,\n\n ensure,\n\n storage::IterableStorageMap,\n\n traits::{\n\n Currency,\n\n Get,\n\n ReservableCurrency,\n\n },\n\n Parameter,\n\n};\n\nuse frame_system::{\n\n ensure_signed,\n\n Trait as System,\n\n};\n\nuse parity_scale_codec::{\n\n Codec,\n\n Decode,\n","file_path":"pallet/src/lib.rs","rank":45,"score":11.848390493061885},{"content":" Ok(())\n\n }\n\n }\n\n}\n\n\n\n// Infallible Storage Mutators\n\n// -> check permissions in caller code before calls\n\nimpl<T: Trait> Module<T> {\n\n /// Generate Unique TreeId\n\n pub fn gen_uid() -> T::TreeId {\n\n let mut counter = <TreeIdCounter<T>>::get();\n\n while <Trees<T>>::get(counter).is_some() {\n\n counter += 1u32.into();\n\n }\n\n counter\n\n }\n\n /// Linear Bond\n\n /// -> bond amount scales linearly with number of members in Tree\n\n pub fn reserve_linear_bond(\n\n tree: T::TreeId,\n","file_path":"pallet/src/lib.rs","rank":46,"score":11.589031835667415},{"content":" bonded: caller.clone(),\n\n height: new_height,\n\n kids: 0u32,\n\n size: 0u32,\n\n };\n\n Self::add_mems(state, members);\n\n <Trees<T>>::insert(parent, TreeState {kids: new_kids, ..parent_st});\n\n Self::deposit_event(RawEvent::DelegateBranch(parent, id, caller, bond));\n\n Ok(())\n\n }\n\n #[weight = 0]\n\n fn revoke(\n\n origin,\n\n branch: T::TreeId,\n\n penalty: bool,\n\n ) -> DispatchResult {\n\n let caller = ensure_signed(origin)?;\n\n let tree = <Trees<T>>::get(branch).ok_or(Error::<T>::TreeDNE)?;\n\n ensure!(tree.bonded == caller, Error::<T>::NotAuthorized);\n\n Self::remove_mems(tree, None, penalty);\n","file_path":"pallet/src/lib.rs","rank":47,"score":11.298508270505327},{"content":"\n\n/// Opaque types. These are used by the CLI to instantiate machinery that don't need to know\n\n/// the specifics of the runtime. They can then be made to be agnostic over specific formats\n\n/// of data like extrinsics, allowing for them to continue syncing the network through upgrades\n\n/// to even the core data structures.\n\npub mod opaque {\n\n use super::*;\n\n\n\n pub use sp_runtime::OpaqueExtrinsic as UncheckedExtrinsic;\n\n\n\n /// Opaque block header type.\n\n pub type Header = generic::Header<BlockNumber, BlakeTwo256>;\n\n /// Opaque block type.\n\n pub type Block = generic::Block<Header, UncheckedExtrinsic>;\n\n /// Opaque block identifier type.\n\n pub type BlockId = generic::BlockId<Block>;\n\n\n\n impl_opaque_keys! {\n\n pub struct SessionKeys {\n\n pub aura: Aura,\n","file_path":"node/runtime/src/lib.rs","rank":48,"score":11.181492125096254},{"content":" spec_name: create_runtime_str!(\"sun-spec\"),\n\n impl_name: create_runtime_str!(\"sun-time\"),\n\n authoring_version: 1,\n\n // Per convention: if the runtime behavior changes, increment spec_version\n\n // and set impl_version to 0. If only runtime\n\n // implementation changes and behavior does not, then leave spec_version as\n\n // is and increment impl_version.\n\n spec_version: 1,\n\n impl_version: 1,\n\n transaction_version: 1,\n\n apis: RUNTIME_API_VERSIONS,\n\n};\n\n\n\npub const MILLISECS_PER_BLOCK: u64 = 6000;\n\n\n\npub const SLOT_DURATION: u64 = MILLISECS_PER_BLOCK;\n\n\n\n// These time units are defined in number of blocks.\n\npub const MINUTES: BlockNumber = 60_000 / (MILLISECS_PER_BLOCK as BlockNumber);\n\npub const HOURS: BlockNumber = MINUTES * 60;\n\npub const DAYS: BlockNumber = HOURS * 24;\n\n\n\n/// The version information used to identify this runtime when compiled natively.\n\n#[cfg(feature = \"std\")]\n","file_path":"node/runtime/src/lib.rs","rank":49,"score":10.611706648759027},{"content":"//! The bounds described above are not good enough. The variance of cost for\n\n//! tree deletion is high because it is recursive and high variance poses a\n\n//! problem. Although this recursion is bounded by the constraints, it can\n\n//! still be very expensive if the overall Tree explores the limits of the\n\n//! constraints and revokes the highest root. With this scenario in mind, the\n\n//! incentives should discourage large groups and wide or deep delegation.\n\n//!\n\n//! ### Bonds for Adding Members Scales Linearly With Group Size\n\n//!\n\n//! ### Bonds for Delegating to Tree Scales Exponentially With Depth and Span\n\n//!\n\n//! [`Call`]: ./enum.Call.html\n\n//! [`Trait`]: ./trait.Trait.html\n\n#![cfg_attr(not(feature = \"std\"), no_std)]\n\n\n\n#[cfg(test)]\n\nmod tests;\n\n\n\nuse frame_support::{\n\n decl_error,\n","file_path":"pallet/src/lib.rs","rank":50,"score":10.26699439442333},{"content":" kids: u32,\n\n ) -> Result<BalanceOf<T>, DispatchError> {\n\n let exp = (height + kids) as usize;\n\n // Exponential closure n ^ exp\n\n // - no punishment for calling this and not having enough balance is an attack vector\n\n // -- could match on reservation error and deduct a fee but would cause storage noop\n\n let power = |n: BalanceOf<T>, exp: usize| {\n\n vec![n; exp]\n\n .iter()\n\n .fold(BalanceOf::<T>::zero() + 1u32.into(), |a, b| a * *b)\n\n };\n\n let bond: BalanceOf<T> = power(T::Bond::get(), exp);\n\n T::Currency::reserve(account, bond)?;\n\n let b = if let Some(total) = <Members<T>>::get(tree, account) {\n\n total + bond\n\n } else {\n\n bond\n\n };\n\n <Members<T>>::insert(tree, account, b);\n\n Ok(bond)\n","file_path":"pallet/src/lib.rs","rank":51,"score":10.08528721994811},{"content":" Self::deposit_event(RawEvent::RevokeDelegation(branch));\n\n Ok(())\n\n }\n\n #[weight = 0]\n\n fn add_members(\n\n origin,\n\n tree_id: T::TreeId,\n\n members: Vec<T::AccountId>,\n\n ) -> DispatchResult {\n\n let caller = ensure_signed(origin)?;\n\n let tree = <Trees<T>>::get(tree_id).ok_or(Error::<T>::TreeDNE)?;\n\n // auth requires member of direct parent || bonded caller\n\n let auth = if let Some(p) = tree.parent {\n\n <Members<T>>::get(p, &caller).is_some()\n\n } else { tree.bonded == caller };\n\n ensure!(auth, Error::<T>::NotAuthorized);\n\n let mut mems = members; mems.dedup();\n\n let new_size = mems.len() as u32 + tree.size;\n\n ensure!(new_size <= T::MaxSize::get(), Error::<T>::CannotAddGroupAboveMaxSize);\n\n let bond = Self::reserve_linear_bond(tree_id, &caller, new_size)?;\n","file_path":"pallet/src/lib.rs","rank":52,"score":9.600785248067218},{"content":" account: &T::AccountId,\n\n new_size: u32,\n\n ) -> Result<BalanceOf<T>, DispatchError> {\n\n let bond: BalanceOf<T> = T::Bond::get() * new_size.into();\n\n T::Currency::reserve(account, bond)?;\n\n let b = if let Some(total) = <Members<T>>::get(tree, account) {\n\n total + bond\n\n } else {\n\n bond\n\n };\n\n <Members<T>>::insert(tree, account, b);\n\n Ok(bond)\n\n }\n\n /// Exponential Bond\n\n /// -> bond amount scales exponentially with height and number of kids\n\n /// ```(bond)^{height} * (bond)^{kids} = (bond)^{height + kids}```\n\n pub fn reserve_exponential_bond(\n\n tree: T::TreeId,\n\n account: &T::AccountId,\n\n height: u32,\n","file_path":"pallet/src/lib.rs","rank":53,"score":9.543013197088664},{"content":"pub type SignedBlock = generic::SignedBlock<Block>;\n\n/// BlockId type as expected by this runtime.\n\npub type BlockId = generic::BlockId<Block>;\n\n/// The SignedExtension to the basic transaction logic.\n\npub type SignedExtra = (\n\n frame_system::CheckSpecVersion<Runtime>,\n\n frame_system::CheckTxVersion<Runtime>,\n\n frame_system::CheckGenesis<Runtime>,\n\n frame_system::CheckEra<Runtime>,\n\n frame_system::CheckNonce<Runtime>,\n\n frame_system::CheckWeight<Runtime>,\n\n pallet_transaction_payment::ChargeTransactionPayment<Runtime>,\n\n);\n\n/// Unchecked extrinsic type as expected by this runtime.\n\npub type UncheckedExtrinsic =\n\n generic::UncheckedExtrinsic<Address, Call, Signature, SignedExtra>;\n\n/// The payload being signed in transactions.\n\npub type SignedPayload = generic::SignedPayload<Call, SignedExtra>;\n\n/// Extrinsic type that has already been checked.\n\npub type CheckedExtrinsic =\n","file_path":"node/runtime/src/lib.rs","rank":54,"score":9.502360356862216},{"content":" generic::CheckedExtrinsic<AccountId, Call, SignedExtra>;\n\n/// Executive: handles dispatch to the various modules.\n\npub type Executive = frame_executive::Executive<\n\n Runtime,\n\n Block,\n\n frame_system::ChainContext<Runtime>,\n\n Runtime,\n\n AllModules,\n\n>;\n\n\n\nimpl_runtime_apis! {\n\n impl sp_api::Core<Block> for Runtime {\n\n fn version() -> RuntimeVersion {\n\n VERSION\n\n }\n\n\n\n fn execute_block(block: Block) {\n\n Executive::execute_block(block)\n\n }\n\n\n","file_path":"node/runtime/src/lib.rs","rank":55,"score":9.450136532162109},{"content":"use sc_cli::{\n\n RunCmd,\n\n Runner,\n\n RuntimeVersion,\n\n Subcommand,\n\n SubstrateCli,\n\n};\n\nuse sc_service::{\n\n ChainSpec,\n\n DatabaseConfig,\n\n PartialComponents,\n\n Role,\n\n};\n\nuse structopt::StructOpt;\n\n\n\n#[derive(Debug, StructOpt)]\n\npub struct Cli {\n\n #[structopt(subcommand)]\n\n pub subcommand: Option<Subcommand>,\n\n\n","file_path":"node/src/main.rs","rank":56,"score":9.417721360690424},{"content":"use sc_executor::native_executor_instance;\n\nuse sc_service::ChainType;\n\nuse sp_core::{\n\n sr25519,\n\n Pair,\n\n Public,\n\n};\n\nuse sp_runtime::traits::{\n\n IdentifyAccount,\n\n Verify,\n\n};\n\nuse sunshine_node_utils::node_service;\n\nuse test_runtime::{\n\n AccountId,\n\n AuraConfig,\n\n BalancesConfig,\n\n GenesisConfig,\n\n GrandpaConfig,\n\n Signature,\n\n SystemConfig,\n","file_path":"node/src/lib.rs","rank":57,"score":9.394105995646447},{"content":" penalty: bool,\n\n ) {\n\n let mut size_decrease = 0u32;\n\n if let Some(mut mem) = mems {\n\n mem.dedup();\n\n mem.into_iter().for_each(|m| {\n\n if let Some(bond) = <Members<T>>::get(tree.id, &m) {\n\n // constraint: cannot remove the account who created the hierarchy\n\n if tree.bonded != m {\n\n T::Currency::unreserve(&m, bond);\n\n if penalty {\n\n // (could) transfer the bond to some (treasury) account\n\n // instead of returning the bond\n\n todo!();\n\n }\n\n <Members<T>>::remove(tree.id, m);\n\n size_decrease += 1u32;\n\n }\n\n }\n\n });\n","file_path":"pallet/src/lib.rs","rank":58,"score":9.195848123282925},{"content":"use sp_runtime::{\n\n create_runtime_str,\n\n generic,\n\n impl_opaque_keys,\n\n traits::{\n\n BlakeTwo256,\n\n Block as BlockT,\n\n IdentifyAccount,\n\n NumberFor,\n\n Saturating,\n\n Verify,\n\n },\n\n transaction_validity::TransactionValidity,\n\n ApplyExtrinsicResult,\n\n MultiSignature,\n\n};\n\nuse sp_std::prelude::*;\n\n#[cfg(feature = \"std\")]\n\nuse sp_version::NativeVersion;\n\nuse sp_version::RuntimeVersion;\n","file_path":"node/runtime/src/lib.rs","rank":59,"score":8.819788073669},{"content":" }\n\n /// Add Members to Tree\n\n pub fn add_mems(mut tree: TreeSt<T>, mut mems: Vec<T::AccountId>) {\n\n mems.dedup();\n\n let mut size_increase = 0u32;\n\n mems.into_iter().for_each(|m| {\n\n // only insert if profile does not already exist\n\n if <Members<T>>::get(tree.id, &m).is_none() {\n\n <Members<T>>::insert(tree.id, m, BalanceOf::<T>::zero());\n\n size_increase += 1u32;\n\n }\n\n });\n\n // insert actual size increase\n\n tree.size += size_increase;\n\n <Trees<T>>::insert(tree.id, tree);\n\n }\n\n /// Remove Members of Tree\n\n pub fn remove_mems(\n\n mut tree: TreeSt<T>,\n\n mems: Option<Vec<T::AccountId>>,\n","file_path":"pallet/src/lib.rs","rank":60,"score":8.460280830196433},{"content":"#![recursion_limit = \"256\"]\n\n//! # Delegate Module\n\n//! This module demonstrates an approach for bounding runtime\n\n//! recursion. In particular, it places module-level constraints on\n\n//! * the size of each group\n\n//! * the number of subgroups\n\n//! * the depth of delegation\n\n//! These constraints allow us to use recursion in the module\n\n//! with strict bounds on worst-case complexity.\n\n//!\n\n//! - [`delegate::Trait`](./trait.Trait.html)\n\n//! - [`Call`](./enum.Call.html)\n\n//!\n\n//! ## Overview\n\n//! This pallet allows delegation to a bounded depth. The incentives discourage\n\n//! (1) adding members to large groups\n\n//! (2) delegating to a new subgroup\n\n//! The module enforces strict bounds on the size of a group, the number of\n\n//! subgroups, and the depth of delegation to place explicit bounds on runtime\n\n//! recursion. Each group registered on-chain has a `TreeId`. To get the state\n","file_path":"pallet/src/lib.rs","rank":61,"score":8.209406610577},{"content":" }\n\n #[weight = 0]\n\n fn delegate(\n\n origin,\n\n parent: T::TreeId,\n\n members: Vec<T::AccountId>,\n\n ) -> DispatchResult {\n\n let caller = ensure_signed(origin)?;\n\n ensure!(<Members<T>>::get(parent, &caller).is_some(), Error::<T>::NotAuthorized);\n\n let parent_st = <Trees<T>>::get(parent).ok_or(Error::<T>::TreeDNE)?;\n\n let (new_kids, new_height) = (parent_st.kids + 1u32, parent_st.height + 1u32);\n\n // check that delegating does not violate module kids constraints (num of children)\n\n ensure!(new_kids <= T::MaxKids::get(), Error::<T>::CannotDelegateAboveMaxKids);\n\n // check that delegating does not violate module depth constraints\n\n ensure!(new_height <= T::MaxDepth::get(), Error::<T>::CannotDelegateBelowMaxDepth);\n\n let bond = Self::reserve_exponential_bond(parent, &caller, new_height, new_kids)?;\n\n let id = Self::gen_uid();\n\n let state = TreeState {\n\n id,\n\n parent: Some(parent_st.id),\n","file_path":"pallet/src/lib.rs","rank":62,"score":7.82533076436332},{"content":" {\n\n RegisterIdRoot(TreeId, AccountId, Balance),\n\n AddedMembers(AccountId, TreeId, Balance),\n\n RemovedMembers(AccountId, TreeId),\n\n DelegateBranch(TreeId, TreeId, AccountId, Balance),\n\n RevokeDelegation(TreeId),\n\n }\n\n);\n\n\n\ndecl_error! {\n\n pub enum Error for Module<T: Trait> {\n\n // Tree does not exist\n\n TreeDNE,\n\n NotAuthorized,\n\n CannotAddGroupAboveMaxSize,\n\n CannotDelegateBelowMaxDepth,\n\n CannotDelegateAboveMaxKids,\n\n }\n\n}\n\n\n\ndecl_storage! {\n","file_path":"pallet/src/lib.rs","rank":63,"score":7.792968747011701},{"content":" #[structopt(flatten)]\n\n pub run: RunCmd,\n\n}\n\n\n\nimpl SubstrateCli for Cli {\n\n fn impl_name() -> String {\n\n test_node::IMPL_NAME.into()\n\n }\n\n\n\n fn impl_version() -> String {\n\n test_node::IMPL_VERSION.into()\n\n }\n\n\n\n fn description() -> String {\n\n test_node::DESCRIPTION.into()\n\n }\n\n\n\n fn author() -> String {\n\n test_node::AUTHOR.into()\n\n }\n","file_path":"node/src/main.rs","rank":64,"score":7.417338164986029},{"content":" Self::add_mems(tree, mems);\n\n Self::deposit_event(RawEvent::AddedMembers(caller, tree_id, bond));\n\n Ok(())\n\n }\n\n #[weight = 0]\n\n fn remove_members(\n\n origin,\n\n tree_id: T::TreeId,\n\n members: Vec<T::AccountId>,\n\n penalty: bool,\n\n ) -> DispatchResult {\n\n let caller = ensure_signed(origin)?;\n\n let tree = <Trees<T>>::get(tree_id).ok_or(Error::<T>::TreeDNE)?;\n\n // auth requires member of direct parent || bonded caller\n\n let auth = if let Some(p) = tree.parent {\n\n <Members<T>>::get(p, &caller).is_some()\n\n } else { tree.bonded == caller };\n\n ensure!(auth, Error::<T>::NotAuthorized);\n\n Self::remove_mems(tree, Some(members), penalty);\n\n Self::deposit_event(RawEvent::RemovedMembers(caller, tree_id));\n","file_path":"pallet/src/lib.rs","rank":65,"score":7.278060525321486},{"content":" /// Maximum number of block number to block hash mappings to keep (oldest pruned first).\n\n type BlockHashCount = BlockHashCount;\n\n /// Maximum weight of each block.\n\n type MaximumBlockWeight = MaximumBlockWeight;\n\n /// Maximum size of all encoded transactions (in bytes) that are allowed in one block.\n\n type MaximumBlockLength = MaximumBlockLength;\n\n /// Portion of the block weight that is available to all normal transactions.\n\n type AvailableBlockRatio = AvailableBlockRatio;\n\n /// The weight of the overhead invoked on the block import process, independent of the\n\n /// extrinsics included in that block.\n\n type BlockExecutionWeight = BlockExecutionWeight;\n\n /// The weight of database operations that the runtime can invoke.\n\n type DbWeight = RocksDbWeight;\n\n /// The base weight of any extrinsic processed by the runtime, independent of the\n\n /// logic of that extrinsic. (Signature verification, nonce increment, fee, etc...)\n\n type ExtrinsicBaseWeight = ExtrinsicBaseWeight;\n\n /// The maximum weight for any extrinsic\n\n type MaximumExtrinsicWeight = MaximumExtrinsicWeight;\n\n /// Version of the runtime.\n\n type Version = Version;\n","file_path":"node/runtime/src/lib.rs","rank":66,"score":7.244405939935623},{"content":"//! of a group, we use the `Trees` map\n\n//! ```rust, ignore\n\n//! map TreeId => Option<TreeState<T::TreeId, T::AccountId>>;\n\n//! ```\n\n//! The `TreeState<_, _>` struct contains the data relevant to the bounds that\n\n//! the module places on length, width and depth.\n\n//! ```rust, ignore\n\n//! pub struct TreeState<TreeId, AccountId> {\n\n//! pub id: TreeId,\n\n//! pub parent: Option<TreeId>,\n\n//! pub bonded: AccountId,\n\n//! pub height: u32,\n\n//! pub kids: u32,\n\n//! pub size: u32,\n\n//! }\n\n//! ```\n\n//! The module's runtime configuration sets the maximum depth (`height`),\n\n//! number of subgroups (`kids`), and number of members (`size`). Each\n\n//! `TreeState<_, _>` is either a root or the child of a parent tree.\n\n//! We define an algorithm for tree creation.\n","file_path":"pallet/src/lib.rs","rank":67,"score":7.171075501198186},{"content":" WASM_BINARY,\n\n};\n\n\n\npub const IMPL_NAME: &str = \"Sunshine Node\";\n\npub const IMPL_VERSION: &str = env!(\"CARGO_PKG_VERSION\");\n\npub const DESCRIPTION: &str = env!(\"CARGO_PKG_DESCRIPTION\");\n\npub const AUTHOR: &str = env!(\"CARGO_PKG_AUTHORS\");\n\npub const SUPPORT_URL: &str = env!(\"CARGO_PKG_HOMEPAGE\");\n\npub const COPYRIGHT_START_YEAR: i32 = 2020;\n\npub const EXECUTABLE_NAME: &str = env!(\"CARGO_PKG_NAME\");\n\n\n\nnative_executor_instance!(\n\n pub Executor,\n\n test_runtime::api::dispatch,\n\n test_runtime::native_version,\n\n);\n\n\n\nnode_service!(\n\n test_runtime::opaque::Block,\n\n test_runtime::RuntimeApi,\n\n Executor\n\n);\n\n\n\n/// Specialized `ChainSpec`.\n\npub type ChainSpec = sc_service::GenericChainSpec<GenesisConfig>;\n\n\n\n/// Helper function to generate a crypto pair from seed\n","file_path":"node/src/lib.rs","rank":68,"score":6.5856036581310455},{"content":" }\n\n\n\n impl sp_offchain::OffchainWorkerApi<Block> for Runtime {\n\n fn offchain_worker(header: &<Block as BlockT>::Header) {\n\n Executive::offchain_worker(header)\n\n }\n\n }\n\n\n\n impl sp_consensus_aura::AuraApi<Block, AuraId> for Runtime {\n\n fn slot_duration() -> u64 {\n\n Aura::slot_duration()\n\n }\n\n\n\n fn authorities() -> Vec<AuraId> {\n\n Aura::authorities()\n\n }\n\n }\n\n\n\n impl sp_session::SessionKeys<Block> for Runtime {\n\n fn generate_session_keys(seed: Option<Vec<u8>>) -> Vec<u8> {\n","file_path":"node/runtime/src/lib.rs","rank":69,"score":6.438717164950031},{"content":"#![allow(clippy::large_enum_variant)]\n\n#![cfg_attr(not(feature = \"std\"), no_std)]\n\n// `construct_runtime!` does a lot of recursion and requires us to increase the limit to 256.\n\n#![recursion_limit = \"256\"]\n\n\n\n// Make the WASM binary available.\n\n#[cfg(feature = \"std\")]\n\ninclude!(concat!(env!(\"OUT_DIR\"), \"/wasm_binary.rs\"));\n\n\n\nuse pallet_grandpa::{\n\n fg_primitives,\n\n AuthorityId,\n\n AuthorityList as GrandpaAuthorityList,\n\n};\n\nuse sp_api::impl_runtime_apis;\n\nuse sp_consensus_aura::sr25519::AuthorityId as AuraId;\n\nuse sp_core::{\n\n crypto::KeyTypeId,\n\n OpaqueMetadata,\n\n};\n","file_path":"node/runtime/src/lib.rs","rank":70,"score":6.293078647035683},{"content":"# Delegate\n\n\n\nThis pallet demonstrates how to safely bound runtime recursion with module-level constraints. The associated types of the module's Trait bound and disincentivize (1) large, (2) wide, and (3) deep tree delegation.\n\n1. group size, number of members `Vec<AccountId>` associated on-chain with `TreeId` s.t. each tree can only have up to `Trait::MaxSize` members in total\n\n2. number of subtrees, each tree can only have up to `Trait::MaxKids` number of subtrees for delegation\n\n3. depth, a tree can only have height up to `Trait::MaxDepth` or it is not allowed to be created for delegation, `depth_of_child = depth_of_parent + 1`\n\n\n\nAdding new members and delegating to subtrees is disincentivized by collateral requirements. Bonds for adding new members scale linearly with group size. Bonds for adding new subtrees scales exponentially with number of children and depth.\n\n\n\n## Rules\n\n\n\n* Any account can register a tree with a `TreeId` and add a set of members `Vec<AccountId>`\n\n* If the `TreeState` has `height = 0`, the account that registered the Tree is the only account that can add and remove members\n\n* Otherwise (`height > 0`), any account in the parent tree can add or remove members (as long as new member count is leq `Trait::MaxSize`)\n\n* Any member of the set `Vec<AccountId>` associated with the `TreeId` can delegate permissions to a new `TreeId` (as long as subtree height is leq `Trait::MaxDepth` and parent's kid count is leq `Trait::MaxKids`)\n\n* Only the account that registered the Tree can revoke it, triggering recursion to delete all subtrees. To disincentivize expensive recursion, actions for adding members and adding subtrees require collateral in proportion to the marginal contribution of each action to worst case deletion complexity.\n\n * Collateral requirements for adding new members scale linearly with group size. \n","file_path":"README.md","rank":71,"score":5.743065186236498},{"content":"//! ```ignore\n\n//! TreeCreation(parent: TreeState<_, _>)\n\n//! let kid = TreeState {\n\n//! parent: Some(parent.id)\n\n//! height: parent.height + 1u32,\n\n//! ..\n\n//! }\n\n//! parent.kids += 1u32;\n\n//! Storage::insert(kid);\n\n//! Storage::insert(parent)\n\n//! ```\n\n//! Before this algorithm is called, the runtime methods verify that\n\n//! the kid's height does not exceed the `Trait::MaxDepth` and the parent's\n\n//! kid count does not exceed `Trait::MaxKids`.\n\n//!\n\n//! Similarly, the runtime verifies that the new group count is below\n\n//! the `Trait::MaxSize` before adding new members to the set of `AccountId`\n\n//! associated on-chain with the group `TreeId`.\n\n//!\n\n//! ## Incentives\n","file_path":"pallet/src/lib.rs","rank":73,"score":5.511879289720847},{"content":" fn initialize_block(header: &<Block as BlockT>::Header) {\n\n Executive::initialize_block(header)\n\n }\n\n }\n\n\n\n impl sp_api::Metadata<Block> for Runtime {\n\n fn metadata() -> OpaqueMetadata {\n\n Runtime::metadata().into()\n\n }\n\n }\n\n\n\n impl sp_block_builder::BlockBuilder<Block> for Runtime {\n\n fn apply_extrinsic(extrinsic: <Block as BlockT>::Extrinsic) -> ApplyExtrinsicResult {\n\n Executive::apply_extrinsic(extrinsic)\n\n }\n\n\n\n fn finalize_block() -> <Block as BlockT>::Header {\n\n Executive::finalize_block()\n\n }\n\n\n","file_path":"node/runtime/src/lib.rs","rank":74,"score":4.996364927762014},{"content":" // insert actual size decrease\n\n tree.size -= size_decrease;\n\n <Trees<T>>::insert(tree.id, tree);\n\n } else {\n\n <Members<T>>::iter_prefix(tree.id).for_each(|(a, b)| {\n\n T::Currency::unreserve(&a, b);\n\n if penalty {\n\n // (could) transfer the bond to some (treasury) account\n\n // instead of returning the bond\n\n todo!();\n\n }\n\n <Members<T>>::remove(tree.id, a);\n\n size_decrease += 1u32;\n\n });\n\n // if parent exists, decrement parent kids count\n\n if let Some(p) = tree.parent {\n\n if let Some(tp) = <Trees<T>>::get(p) {\n\n <Trees<T>>::insert(\n\n p,\n\n TreeState {\n","file_path":"pallet/src/lib.rs","rank":75,"score":4.875329683767991},{"content":" opaque::SessionKeys::generate(seed)\n\n }\n\n\n\n fn decode_session_keys(\n\n encoded: Vec<u8>,\n\n ) -> Option<Vec<(Vec<u8>, sp_core::crypto::KeyTypeId)>> {\n\n opaque::SessionKeys::decode_into_raw_public_keys(&encoded)\n\n }\n\n }\n\n\n\n impl fg_primitives::GrandpaApi<Block> for Runtime {\n\n fn grandpa_authorities() -> GrandpaAuthorityList {\n\n Grandpa::grandpa_authorities()\n\n }\n\n fn submit_report_equivocation_unsigned_extrinsic(\n\n _equivocation_proof: fg_primitives::EquivocationProof<\n\n <Block as BlockT>::Hash,\n\n NumberFor<Block>,\n\n >,\n\n _key_owner_proof: fg_primitives::OpaqueKeyOwnershipProof,\n","file_path":"node/runtime/src/lib.rs","rank":76,"score":3.7484966399186774},{"content":" kids: tp.kids - 1,\n\n ..tp\n\n },\n\n );\n\n }\n\n }\n\n // Recursively remove all Children\n\n // runtime recursion bounded by module-level constraints on\n\n // * delegation depth/height (MaxDepth)\n\n // * children (subtrees) per tree (MaxKids)\n\n // * members (accounts) per tree (MaxSize)\n\n <Trees<T>>::iter().for_each(|(_, child)| {\n\n if child.parent == Some(tree.id) {\n\n Self::remove_mems(child, None, penalty);\n\n }\n\n });\n\n }\n\n }\n\n}\n","file_path":"pallet/src/lib.rs","rank":77,"score":3.305339259286845},{"content":" path => {\n\n Box::new(test_node::ChainSpec::from_json_file(path.into())?)\n\n }\n\n })\n\n }\n\n\n\n fn native_runtime_version(\n\n _: &Box<dyn ChainSpec>,\n\n ) -> &'static RuntimeVersion {\n\n &test_runtime::VERSION\n\n }\n\n}\n\n\n","file_path":"node/src/main.rs","rank":78,"score":3.157032786163076},{"content":" get_account_id_from_seed::<sr25519::Public>(\"Alice//stash\"),\n\n get_account_id_from_seed::<sr25519::Public>(\"Bob//stash\"),\n\n get_account_id_from_seed::<sr25519::Public>(\n\n \"Charlie//stash\",\n\n ),\n\n get_account_id_from_seed::<sr25519::Public>(\"Dave//stash\"),\n\n get_account_id_from_seed::<sr25519::Public>(\"Eve//stash\"),\n\n get_account_id_from_seed::<sr25519::Public>(\n\n \"Ferdie//stash\",\n\n ),\n\n ],\n\n )\n\n },\n\n vec![],\n\n None,\n\n None,\n\n None,\n\n None,\n\n )\n\n}\n\n\n","file_path":"node/src/lib.rs","rank":79,"score":2.918847740283818},{"content":"use substrate_wasm_builder_runner::WasmBuilder;\n\n\n","file_path":"node/runtime/build.rs","rank":80,"score":2.6863147317277183},{"content":" ) -> Option<()> {\n\n None\n\n }\n\n\n\n fn generate_key_ownership_proof(\n\n _set_id: fg_primitives::SetId,\n\n _authority_id: AuthorityId,\n\n ) -> Option<fg_primitives::OpaqueKeyOwnershipProof> {\n\n // NOTE: this is the only implementation possible since we've\n\n // defined our key owner proof type as a bottom type (i.e. a type\n\n // with no values).\n\n None\n\n }\n\n }\n\n}\n","file_path":"node/runtime/src/lib.rs","rank":81,"score":2.5721139610932804},{"content":"use substrate_build_script_utils::{\n\n generate_cargo_keys,\n\n rerun_if_git_head_changed,\n\n};\n\n\n","file_path":"node/build.rs","rank":82,"score":2.4539840547245424},{"content":" fn inherent_extrinsics(data: sp_inherents::InherentData) -> Vec<<Block as BlockT>::Extrinsic> {\n\n data.create_extrinsics()\n\n }\n\n\n\n fn check_inherents(\n\n block: Block,\n\n data: sp_inherents::InherentData,\n\n ) -> sp_inherents::CheckInherentsResult {\n\n data.check_extrinsics(&block)\n\n }\n\n\n\n fn random_seed() -> <Block as BlockT>::Hash {\n\n RandomnessCollectiveFlip::random_seed()\n\n }\n\n }\n\n\n\n impl sp_transaction_pool::runtime_api::TaggedTransactionQueue<Block> for Runtime {\n\n fn validate_transaction(source: sp_runtime::transaction_validity::TransactionSource, uxt: <Block as BlockT>::Extrinsic) -> TransactionValidity {\n\n Executive::validate_transaction(source, uxt)\n\n }\n","file_path":"node/runtime/src/lib.rs","rank":83,"score":2.3697096428060505}],"string":"[\n {\n \"content\": \"pub trait Trait: System {\\n\\n /// Overarching event type\\n\\n type Event: From<Event<Self>> + Into<<Self as System>::Event>;\\n\\n\\n\\n /// The identifier for trees\\n\\n type TreeId: Parameter\\n\\n + Member\\n\\n + AtLeast32Bit\\n\\n + Codec\\n\\n + Default\\n\\n + Copy\\n\\n + MaybeSerializeDeserialize\\n\\n + Debug\\n\\n + PartialOrd\\n\\n + PartialEq\\n\\n + Zero;\\n\\n\\n\\n /// Bond amount, charged per depth\\n\\n type Bond: Get<BalanceOf<Self>>;\\n\\n\\n\",\n \"file_path\": \"pallet/src/lib.rs\",\n \"rank\": 0,\n \"score\": 122043.88438855714\n },\n {\n \"content\": \"type TreeSt<T> = TreeState<<T as Trait>::TreeId, <T as System>::AccountId>;\\n\",\n \"file_path\": \"pallet/src/lib.rs\",\n \"rank\": 2,\n \"score\": 89373.51030809613\n },\n {\n \"content\": \"#[cfg(feature = \\\"std\\\")]\\n\\npub fn native_version() -> NativeVersion {\\n\\n NativeVersion {\\n\\n runtime_version: VERSION,\\n\\n can_author_with: Default::default(),\\n\\n }\\n\\n}\\n\\n\\n\\nparameter_types! {\\n\\n pub const BlockHashCount: BlockNumber = 250;\\n\\n /// We allow for 2 seconds of compute with a 6 second average block time.\\n\\n pub const MaximumBlockWeight: Weight = 2 * WEIGHT_PER_SECOND;\\n\\n pub const AvailableBlockRatio: Perbill = Perbill::from_percent(75);\\n\\n /// Assume 10% of weight for average on_initialize calls.\\n\\n pub MaximumExtrinsicWeight: Weight = AvailableBlockRatio::get()\\n\\n .saturating_sub(Perbill::from_percent(10)) * MaximumBlockWeight::get();\\n\\n pub const MaximumBlockLength: u32 = 5 * 1024 * 1024;\\n\\n pub const Version: RuntimeVersion = VERSION;\\n\\n}\\n\\n\\n\\nimpl frame_system::Trait for Runtime {\\n\",\n \"file_path\": \"node/runtime/src/lib.rs\",\n \"rank\": 3,\n \"score\": 86483.72164489393\n },\n {\n \"content\": \"pub fn testnet_genesis(\\n\\n initial_authorities: Vec<(AuraId, GrandpaId)>,\\n\\n endowed_accounts: Vec<AccountId>,\\n\\n) -> GenesisConfig {\\n\\n GenesisConfig {\\n\\n frame_system: Some(SystemConfig {\\n\\n code: WASM_BINARY.to_vec(),\\n\\n changes_trie_config: Default::default(),\\n\\n }),\\n\\n pallet_balances: Some(BalancesConfig {\\n\\n balances: endowed_accounts\\n\\n .iter()\\n\\n .cloned()\\n\\n .map(|k| (k, 1 << 60))\\n\\n .collect(),\\n\\n }),\\n\\n pallet_aura: Some(AuraConfig {\\n\\n authorities: initial_authorities\\n\\n .iter()\\n\\n .map(|x| (x.0.clone()))\\n\",\n \"file_path\": \"node/src/lib.rs\",\n \"rank\": 4,\n \"score\": 67584.81048756083\n },\n {\n \"content\": \" trait Store for Module<T: Trait> as Delegate {\\n\\n /// The nonce for unique tree id generation\\n\\n TreeIdCounter get(fn tree_id_counter): T::TreeId;\\n\\n\\n\\n /// The state of trees\\n\\n pub Trees get(fn trees): map\\n\\n hasher(blake2_128_concat) T::TreeId => Option<TreeSt<T>>;\\n\\n\\n\\n /// Membership, also tracks bonded amount for existing members\\n\\n pub Members get(fn members): double_map\\n\\n hasher(blake2_128_concat) T::TreeId,\\n\\n hasher(blake2_128_concat) T::AccountId => Option<BalanceOf<T>>;\\n\\n }\\n\\n}\\n\\n\\n\\ndecl_module! {\\n\\n pub struct Module<T: Trait> for enum Call where origin: T::Origin {\\n\\n type Error = Error<T>;\\n\\n fn deposit_event() = default;\\n\\n\\n\",\n \"file_path\": \"pallet/src/lib.rs\",\n \"rank\": 5,\n \"score\": 63326.96391685682\n },\n {\n \"content\": \"type BalanceOf<T> =\\n\\n <<T as Trait>::Currency as Currency<<T as System>::AccountId>>::Balance;\\n\",\n \"file_path\": \"pallet/src/lib.rs\",\n \"rank\": 6,\n \"score\": 61839.296888245524\n },\n {\n \"content\": \"pub fn development_config() -> ChainSpec {\\n\\n ChainSpec::from_genesis(\\n\\n \\\"Development\\\",\\n\\n \\\"dev\\\",\\n\\n ChainType::Development,\\n\\n || {\\n\\n testnet_genesis(\\n\\n // initial authorities\\n\\n vec![get_authority_keys_from_seed(\\\"Alice\\\")],\\n\\n // endowed accounts\\n\\n vec![\\n\\n get_account_id_from_seed::<sr25519::Public>(\\\"Alice\\\"),\\n\\n get_account_id_from_seed::<sr25519::Public>(\\\"Bob\\\"),\\n\\n get_account_id_from_seed::<sr25519::Public>(\\\"Alice//stash\\\"),\\n\\n get_account_id_from_seed::<sr25519::Public>(\\\"Bob//stash\\\"),\\n\\n ],\\n\\n )\\n\\n },\\n\\n vec![],\\n\\n None,\\n\\n None,\\n\\n None,\\n\\n None,\\n\\n )\\n\\n}\\n\\n\\n\",\n \"file_path\": \"node/src/lib.rs\",\n \"rank\": 7,\n \"score\": 61668.23201614833\n },\n {\n \"content\": \"pub fn local_testnet_config() -> ChainSpec {\\n\\n ChainSpec::from_genesis(\\n\\n \\\"Local Testnet\\\",\\n\\n \\\"local_testnet\\\",\\n\\n ChainType::Local,\\n\\n || {\\n\\n testnet_genesis(\\n\\n // initial authorities\\n\\n vec![\\n\\n get_authority_keys_from_seed(\\\"Alice\\\"),\\n\\n get_authority_keys_from_seed(\\\"Bob\\\"),\\n\\n ],\\n\\n // endowed accounts\\n\\n vec![\\n\\n get_account_id_from_seed::<sr25519::Public>(\\\"Alice\\\"),\\n\\n get_account_id_from_seed::<sr25519::Public>(\\\"Bob\\\"),\\n\\n get_account_id_from_seed::<sr25519::Public>(\\\"Charlie\\\"),\\n\\n get_account_id_from_seed::<sr25519::Public>(\\\"Dave\\\"),\\n\\n get_account_id_from_seed::<sr25519::Public>(\\\"Eve\\\"),\\n\\n get_account_id_from_seed::<sr25519::Public>(\\\"Ferdie\\\"),\\n\",\n \"file_path\": \"node/src/lib.rs\",\n \"rank\": 8,\n \"score\": 60102.70789364768\n },\n {\n \"content\": \"/// Helper function to generate an account ID from seed\\n\\npub fn get_account_id_from_seed<TPublic: Public>(seed: &str) -> AccountId\\n\\nwhere\\n\\n AccountPublic: From<<TPublic::Pair as Pair>::Public>,\\n\\n{\\n\\n AccountPublic::from(get_from_seed::<TPublic>(seed)).into_account()\\n\\n}\\n\\n\\n\",\n \"file_path\": \"node/src/lib.rs\",\n \"rank\": 9,\n \"score\": 58282.324555532454\n },\n {\n \"content\": \"/// Helper function to generate a crypto pair from seed\\n\\npub fn get_from_seed<TPublic: Public>(\\n\\n seed: &str,\\n\\n) -> <TPublic::Pair as Pair>::Public {\\n\\n TPublic::Pair::from_string(&format!(\\\"//{}\\\", seed), None)\\n\\n .expect(\\\"static values are valid; qed\\\")\\n\\n .public()\\n\\n}\\n\\n\\n\",\n \"file_path\": \"node/src/lib.rs\",\n \"rank\": 10,\n \"score\": 58144.70629694857\n },\n {\n \"content\": \"fn force_parity_db(runner: &mut Runner<Cli>) {\\n\\n let config = runner.config_mut();\\n\\n let path = config.database.path().unwrap().to_path_buf();\\n\\n config.database = DatabaseConfig::ParityDb { path };\\n\\n}\\n\",\n \"file_path\": \"node/src/main.rs\",\n \"rank\": 11,\n \"score\": 56812.677221288744\n },\n {\n \"content\": \"/// Helper function to generate an authority key for Aura\\n\\npub fn get_authority_keys_from_seed(s: &str) -> (AuraId, GrandpaId) {\\n\\n (get_from_seed::<AuraId>(s), get_from_seed::<GrandpaId>(s))\\n\\n}\\n\\n\\n\",\n \"file_path\": \"node/src/lib.rs\",\n \"rank\": 13,\n \"score\": 49906.2183535926\n },\n {\n \"content\": \"fn main() {\\n\\n generate_cargo_keys();\\n\\n\\n\\n rerun_if_git_head_changed();\\n\\n}\\n\",\n \"file_path\": \"node/build.rs\",\n \"rank\": 15,\n \"score\": 35385.938812718494\n },\n {\n \"content\": \"fn main() {\\n\\n WasmBuilder::new()\\n\\n .with_current_project()\\n\\n .with_wasm_builder_from_crates(\\\"1.0.9\\\")\\n\\n .export_heap_base()\\n\\n .import_memory()\\n\\n .build()\\n\\n}\\n\",\n \"file_path\": \"node/runtime/build.rs\",\n \"rank\": 16,\n \"score\": 34144.85612808063\n },\n {\n \"content\": \"type AccountPublic = <Signature as Verify>::Signer;\\n\\n\\n\",\n \"file_path\": \"node/src/lib.rs\",\n \"rank\": 17,\n \"score\": 32643.25899483379\n },\n {\n \"content\": \"fn main() -> sc_cli::Result<()> {\\n\\n let cli = <Cli as SubstrateCli>::from_args();\\n\\n match &cli.subcommand {\\n\\n Some(subcommand) => {\\n\\n let mut runner = cli.create_runner(subcommand)?;\\n\\n force_parity_db(&mut runner);\\n\\n runner.run_subcommand(subcommand, |config| {\\n\\n let PartialComponents {\\n\\n client,\\n\\n backend,\\n\\n task_manager,\\n\\n import_queue,\\n\\n ..\\n\\n } = test_node::new_partial(&config)?;\\n\\n Ok((client, backend, import_queue, task_manager))\\n\\n })\\n\\n }\\n\\n None => {\\n\\n let mut runner = cli.create_runner(&cli.run)?;\\n\\n force_parity_db(&mut runner);\\n\",\n \"file_path\": \"node/src/main.rs\",\n \"rank\": 23,\n \"score\": 29011.627171096152\n },\n {\n \"content\": \" /// The identifier used to distinguish between accounts.\\n\\n type AccountId = AccountId;\\n\\n /// The aggregated dispatch type that is available for extrinsics.\\n\\n type Call = Call;\\n\\n /// The lookup mechanism to get account ID from whatever is passed in dispatchers.\\n\\n type Lookup = traits::IdentityLookup<AccountId>;\\n\\n /// The index type for storing how many extrinsics an account has signed.\\n\\n type Index = Index;\\n\\n /// The index type for blocks.\\n\\n type BlockNumber = BlockNumber;\\n\\n /// The type for hashing blocks and tries.\\n\\n type Hash = Hash;\\n\\n /// The hashing algorithm used.\\n\\n type Hashing = BlakeTwo256;\\n\\n /// The header type.\\n\\n type Header = generic::Header<BlockNumber, BlakeTwo256>;\\n\\n /// The ubiquitous event type.\\n\\n type Event = Event;\\n\\n /// The ubiquitous origin type.\\n\\n type Origin = Origin;\\n\",\n \"file_path\": \"node/runtime/src/lib.rs\",\n \"rank\": 28,\n \"score\": 20.153000457675635\n },\n {\n \"content\": \"};\\n\\npub use pallet_balances::Call as BalancesCall;\\n\\npub use pallet_timestamp::Call as TimestampCall;\\n\\n#[cfg(any(feature = \\\"std\\\", test))]\\n\\npub use sp_runtime::BuildStorage;\\n\\npub use sp_runtime::{\\n\\n traits,\\n\\n Perbill,\\n\\n Permill,\\n\\n};\\n\\n\\n\\n/// Tree identifier\\n\\npub type TreeId = u64;\\n\\n\\n\\n/// An index to a block.\\n\\npub type BlockNumber = u32;\\n\\n\\n\\n/// Alias to 512-bit hash when used in the context of a transaction signature on the chain.\\n\\npub type Signature = MultiSignature;\\n\\n\\n\",\n \"file_path\": \"node/runtime/src/lib.rs\",\n \"rank\": 30,\n \"score\": 19.56125223281105\n },\n {\n \"content\": \" pub const Bond: Balance = 10;\\n\\n pub const MaxSize: u32 = 5;\\n\\n pub const MaxDepth: u32 = 5;\\n\\n pub const MaxKids: u32 = 2;\\n\\n}\\n\\nimpl delegate::Trait for Runtime {\\n\\n type Event = Event;\\n\\n type TreeId = TreeId;\\n\\n type Bond = Bond;\\n\\n type MaxSize = MaxSize;\\n\\n type MaxDepth = MaxDepth;\\n\\n type MaxKids = MaxKids;\\n\\n type Currency = Balances;\\n\\n}\\n\\n\\n\\nconstruct_runtime!(\\n\\n pub enum Runtime where\\n\\n Block = Block,\\n\\n NodeBlock = opaque::Block,\\n\\n UncheckedExtrinsic = UncheckedExtrinsic\\n\",\n \"file_path\": \"node/runtime/src/lib.rs\",\n \"rank\": 32,\n \"score\": 17.627023453439357\n },\n {\n \"content\": \" /// The ubiquitous event type.\\n\\n type Event = Event;\\n\\n type DustRemoval = ();\\n\\n type ExistentialDeposit = ExistentialDeposit;\\n\\n type AccountStore = System;\\n\\n type WeightInfo = ();\\n\\n}\\n\\n\\n\\nparameter_types! {\\n\\n pub const TransactionByteFee: Balance = 1;\\n\\n}\\n\\n\\n\\nimpl pallet_transaction_payment::Trait for Runtime {\\n\\n type Currency = pallet_balances::Module<Runtime>;\\n\\n type OnTransactionPayment = ();\\n\\n type TransactionByteFee = TransactionByteFee;\\n\\n type WeightToFee = IdentityFee<Balance>;\\n\\n type FeeMultiplierUpdate = ();\\n\\n}\\n\\nparameter_types! {\\n\",\n \"file_path\": \"node/runtime/src/lib.rs\",\n \"rank\": 33,\n \"score\": 16.78380436485226\n },\n {\n \"content\": \" pub grandpa: Grandpa,\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\nimpl frame_system::offchain::SigningTypes for Runtime {\\n\\n type Public = <Signature as traits::Verify>::Signer;\\n\\n type Signature = Signature;\\n\\n}\\n\\n\\n\\nimpl<C> frame_system::offchain::SendTransactionTypes<C> for Runtime\\n\\nwhere\\n\\n Call: From<C>,\\n\\n{\\n\\n type OverarchingCall = Call;\\n\\n type Extrinsic = UncheckedExtrinsic;\\n\\n}\\n\\n\\n\\n/// This runtime version.\\n\\npub const VERSION: RuntimeVersion = RuntimeVersion {\\n\",\n \"file_path\": \"node/runtime/src/lib.rs\",\n \"rank\": 34,\n \"score\": 16.415100743289802\n },\n {\n \"content\": \" /// Converts a module to the index of the module in `construct_runtime!`.\\n\\n ///\\n\\n /// This type is being generated by `construct_runtime!`.\\n\\n type ModuleToIndex = ModuleToIndex;\\n\\n /// What to do if a new account is created.\\n\\n type OnNewAccount = ();\\n\\n /// What to do if an account is fully reaped from the system.\\n\\n type OnKilledAccount = ();\\n\\n /// The data to be stored in an account.\\n\\n type AccountData = pallet_balances::AccountData<Balance>;\\n\\n type BaseCallFilter = ();\\n\\n type SystemWeightInfo = ();\\n\\n}\\n\\n\\n\\nimpl pallet_aura::Trait for Runtime {\\n\\n type AuthorityId = AuraId;\\n\\n}\\n\\n\\n\\nimpl pallet_grandpa::Trait for Runtime {\\n\\n type Event = Event;\\n\",\n \"file_path\": \"node/runtime/src/lib.rs\",\n \"rank\": 36,\n \"score\": 15.994345374893362\n },\n {\n \"content\": \"\\n\\nparameter_types! {\\n\\n pub const MinimumPeriod: u64 = SLOT_DURATION / 2;\\n\\n}\\n\\n\\n\\nimpl pallet_timestamp::Trait for Runtime {\\n\\n /// A timestamp: milliseconds since the unix epoch.\\n\\n type Moment = u64;\\n\\n type OnTimestampSet = Aura;\\n\\n type MinimumPeriod = MinimumPeriod;\\n\\n type WeightInfo = ();\\n\\n}\\n\\n\\n\\nparameter_types! {\\n\\n pub const ExistentialDeposit: u128 = 500;\\n\\n}\\n\\n\\n\\nimpl pallet_balances::Trait for Runtime {\\n\\n /// The type for recording an account's balance.\\n\\n type Balance = Balance;\\n\",\n \"file_path\": \"node/runtime/src/lib.rs\",\n \"rank\": 37,\n \"score\": 15.718592478088745\n },\n {\n \"content\": \"/// Some way of identifying an account on the chain. We intentionally make it equivalent\\n\\n/// to the public key of our transaction signing scheme.\\n\\npub type AccountId =\\n\\n <<Signature as Verify>::Signer as IdentifyAccount>::AccountId;\\n\\n\\n\\n/// The type for looking up accounts. We don't expect more than 4 billion of them, but you\\n\\n/// never know...\\n\\npub type AccountIndex = u32;\\n\\n\\n\\n/// Balance of an account.\\n\\npub type Balance = u128;\\n\\n\\n\\n/// Index of a transaction in the chain.\\n\\npub type Index = u32;\\n\\n\\n\\n/// A hash of some data used by the chain.\\n\\npub type Hash = sp_core::H256;\\n\\n\\n\\n/// Digest item type.\\n\\npub type DigestItem = generic::DigestItem<Hash>;\\n\",\n \"file_path\": \"node/runtime/src/lib.rs\",\n \"rank\": 38,\n \"score\": 14.832122866667948\n },\n {\n \"content\": \" {\\n\\n System: frame_system::{Module, Call, Config, Storage, Event<T>},\\n\\n RandomnessCollectiveFlip: pallet_randomness_collective_flip::{Module, Call, Storage},\\n\\n Timestamp: pallet_timestamp::{Module, Call, Storage, Inherent},\\n\\n Aura: pallet_aura::{Module, Config<T>, Inherent},\\n\\n Grandpa: pallet_grandpa::{Module, Call, Storage, Config, Event},\\n\\n Balances: pallet_balances::{Module, Call, Storage, Config<T>, Event<T>},\\n\\n TransactionPayment: pallet_transaction_payment::{Module, Storage},\\n\\n // delegate module\\n\\n Delegate: delegate::{Module, Call, Storage, Event<T>},\\n\\n }\\n\\n);\\n\\n\\n\\n/// The address format for describing accounts.\\n\\npub type Address = AccountId;\\n\\n/// Block header type as expected by this runtime.\\n\\npub type Header = generic::Header<BlockNumber, BlakeTwo256>;\\n\\n/// Block type as expected by this runtime.\\n\\npub type Block = generic::Block<Header, UncheckedExtrinsic>;\\n\\n/// A Block signed with a Justification\\n\",\n \"file_path\": \"node/runtime/src/lib.rs\",\n \"rank\": 39,\n \"score\": 14.427297896138997\n },\n {\n \"content\": \" /// Maximum group size for all trees\\n\\n type MaxSize: Get<u32>;\\n\\n\\n\\n /// Maximum depth for all trees\\n\\n type MaxDepth: Get<u32>;\\n\\n\\n\\n /// Maximum number of subtrees per tree\\n\\n type MaxKids: Get<u32>;\\n\\n\\n\\n /// Currency type\\n\\n type Currency: Currency<Self::AccountId>\\n\\n + ReservableCurrency<Self::AccountId>;\\n\\n}\\n\\n\\n\\ndecl_event!(\\n\\n pub enum Event<T>\\n\\n where\\n\\n <T as Trait>::TreeId,\\n\\n <T as System>::AccountId,\\n\\n Balance = BalanceOf<T>,\\n\",\n \"file_path\": \"pallet/src/lib.rs\",\n \"rank\": 40,\n \"score\": 14.087399979315862\n },\n {\n \"content\": \" #[weight = 0]\\n\\n fn create_root(\\n\\n origin,\\n\\n ) -> DispatchResult {\\n\\n let caller = ensure_signed(origin)?;\\n\\n let bond = T::Bond::get();\\n\\n T::Currency::reserve(&caller, bond)?;\\n\\n let id = Self::gen_uid();\\n\\n let state = TreeState {\\n\\n id,\\n\\n parent: None,\\n\\n bonded: caller.clone(),\\n\\n height: 0u32,\\n\\n kids: 0u32,\\n\\n size: 1u32,\\n\\n };\\n\\n <Trees<T>>::insert(id, state);\\n\\n <Members<T>>::insert(id, caller.clone(), bond);\\n\\n Self::deposit_event(RawEvent::RegisterIdRoot(id, caller, bond));\\n\\n Ok(())\\n\",\n \"file_path\": \"pallet/src/lib.rs\",\n \"rank\": 41,\n \"score\": 13.518792111422815\n },\n {\n \"content\": \"\\n\\npub use frame_support::{\\n\\n construct_runtime,\\n\\n debug,\\n\\n parameter_types,\\n\\n traits::{\\n\\n KeyOwnerProofSystem,\\n\\n Randomness,\\n\\n },\\n\\n weights::{\\n\\n constants::{\\n\\n BlockExecutionWeight,\\n\\n ExtrinsicBaseWeight,\\n\\n RocksDbWeight,\\n\\n WEIGHT_PER_SECOND,\\n\\n },\\n\\n IdentityFee,\\n\\n Weight,\\n\\n },\\n\\n StorageValue,\\n\",\n \"file_path\": \"node/runtime/src/lib.rs\",\n \"rank\": 42,\n \"score\": 12.235079501256832\n },\n {\n \"content\": \" Encode,\\n\\n};\\n\\nuse sp_runtime::{\\n\\n traits::{\\n\\n AtLeast32Bit,\\n\\n MaybeSerializeDeserialize,\\n\\n Member,\\n\\n Zero,\\n\\n },\\n\\n DispatchResult,\\n\\n};\\n\\nuse sp_std::{\\n\\n fmt::Debug,\\n\\n prelude::*,\\n\\n};\\n\\n\\n\\n#[derive(PartialEq, Eq, Clone, Encode, Decode, sp_runtime::RuntimeDebug)]\\n\\npub struct TreeState<TreeId, AccountId> {\\n\\n pub id: TreeId,\\n\\n pub parent: Option<TreeId>,\\n\\n pub bonded: AccountId,\\n\\n pub height: u32,\\n\\n pub kids: u32,\\n\\n pub size: u32,\\n\\n}\\n\\n\\n\",\n \"file_path\": \"pallet/src/lib.rs\",\n \"rank\": 43,\n \"score\": 12.213303095549783\n },\n {\n \"content\": \" type Call = Call;\\n\\n\\n\\n type KeyOwnerProofSystem = ();\\n\\n\\n\\n type KeyOwnerProof = <Self::KeyOwnerProofSystem as KeyOwnerProofSystem<\\n\\n (KeyTypeId, AuthorityId),\\n\\n >>::Proof;\\n\\n\\n\\n type KeyOwnerIdentification =\\n\\n <Self::KeyOwnerProofSystem as KeyOwnerProofSystem<(\\n\\n KeyTypeId,\\n\\n AuthorityId,\\n\\n )>>::IdentificationTuple;\\n\\n\\n\\n type HandleEquivocation = ();\\n\\n}\\n\\n\\n\\nparameter_types! {\\n\\n pub const IndexDeposit: Balance = 1u128;\\n\\n}\\n\",\n \"file_path\": \"node/runtime/src/lib.rs\",\n \"rank\": 44,\n \"score\": 12.142243774718004\n },\n {\n \"content\": \" decl_event,\\n\\n decl_module,\\n\\n decl_storage,\\n\\n dispatch::DispatchError,\\n\\n ensure,\\n\\n storage::IterableStorageMap,\\n\\n traits::{\\n\\n Currency,\\n\\n Get,\\n\\n ReservableCurrency,\\n\\n },\\n\\n Parameter,\\n\\n};\\n\\nuse frame_system::{\\n\\n ensure_signed,\\n\\n Trait as System,\\n\\n};\\n\\nuse parity_scale_codec::{\\n\\n Codec,\\n\\n Decode,\\n\",\n \"file_path\": \"pallet/src/lib.rs\",\n \"rank\": 45,\n \"score\": 11.848390493061885\n },\n {\n \"content\": \" Ok(())\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\n// Infallible Storage Mutators\\n\\n// -> check permissions in caller code before calls\\n\\nimpl<T: Trait> Module<T> {\\n\\n /// Generate Unique TreeId\\n\\n pub fn gen_uid() -> T::TreeId {\\n\\n let mut counter = <TreeIdCounter<T>>::get();\\n\\n while <Trees<T>>::get(counter).is_some() {\\n\\n counter += 1u32.into();\\n\\n }\\n\\n counter\\n\\n }\\n\\n /// Linear Bond\\n\\n /// -> bond amount scales linearly with number of members in Tree\\n\\n pub fn reserve_linear_bond(\\n\\n tree: T::TreeId,\\n\",\n \"file_path\": \"pallet/src/lib.rs\",\n \"rank\": 46,\n \"score\": 11.589031835667415\n },\n {\n \"content\": \" bonded: caller.clone(),\\n\\n height: new_height,\\n\\n kids: 0u32,\\n\\n size: 0u32,\\n\\n };\\n\\n Self::add_mems(state, members);\\n\\n <Trees<T>>::insert(parent, TreeState {kids: new_kids, ..parent_st});\\n\\n Self::deposit_event(RawEvent::DelegateBranch(parent, id, caller, bond));\\n\\n Ok(())\\n\\n }\\n\\n #[weight = 0]\\n\\n fn revoke(\\n\\n origin,\\n\\n branch: T::TreeId,\\n\\n penalty: bool,\\n\\n ) -> DispatchResult {\\n\\n let caller = ensure_signed(origin)?;\\n\\n let tree = <Trees<T>>::get(branch).ok_or(Error::<T>::TreeDNE)?;\\n\\n ensure!(tree.bonded == caller, Error::<T>::NotAuthorized);\\n\\n Self::remove_mems(tree, None, penalty);\\n\",\n \"file_path\": \"pallet/src/lib.rs\",\n \"rank\": 47,\n \"score\": 11.298508270505327\n },\n {\n \"content\": \"\\n\\n/// Opaque types. These are used by the CLI to instantiate machinery that don't need to know\\n\\n/// the specifics of the runtime. They can then be made to be agnostic over specific formats\\n\\n/// of data like extrinsics, allowing for them to continue syncing the network through upgrades\\n\\n/// to even the core data structures.\\n\\npub mod opaque {\\n\\n use super::*;\\n\\n\\n\\n pub use sp_runtime::OpaqueExtrinsic as UncheckedExtrinsic;\\n\\n\\n\\n /// Opaque block header type.\\n\\n pub type Header = generic::Header<BlockNumber, BlakeTwo256>;\\n\\n /// Opaque block type.\\n\\n pub type Block = generic::Block<Header, UncheckedExtrinsic>;\\n\\n /// Opaque block identifier type.\\n\\n pub type BlockId = generic::BlockId<Block>;\\n\\n\\n\\n impl_opaque_keys! {\\n\\n pub struct SessionKeys {\\n\\n pub aura: Aura,\\n\",\n \"file_path\": \"node/runtime/src/lib.rs\",\n \"rank\": 48,\n \"score\": 11.181492125096254\n },\n {\n \"content\": \" spec_name: create_runtime_str!(\\\"sun-spec\\\"),\\n\\n impl_name: create_runtime_str!(\\\"sun-time\\\"),\\n\\n authoring_version: 1,\\n\\n // Per convention: if the runtime behavior changes, increment spec_version\\n\\n // and set impl_version to 0. If only runtime\\n\\n // implementation changes and behavior does not, then leave spec_version as\\n\\n // is and increment impl_version.\\n\\n spec_version: 1,\\n\\n impl_version: 1,\\n\\n transaction_version: 1,\\n\\n apis: RUNTIME_API_VERSIONS,\\n\\n};\\n\\n\\n\\npub const MILLISECS_PER_BLOCK: u64 = 6000;\\n\\n\\n\\npub const SLOT_DURATION: u64 = MILLISECS_PER_BLOCK;\\n\\n\\n\\n// These time units are defined in number of blocks.\\n\\npub const MINUTES: BlockNumber = 60_000 / (MILLISECS_PER_BLOCK as BlockNumber);\\n\\npub const HOURS: BlockNumber = MINUTES * 60;\\n\\npub const DAYS: BlockNumber = HOURS * 24;\\n\\n\\n\\n/// The version information used to identify this runtime when compiled natively.\\n\\n#[cfg(feature = \\\"std\\\")]\\n\",\n \"file_path\": \"node/runtime/src/lib.rs\",\n \"rank\": 49,\n \"score\": 10.611706648759027\n },\n {\n \"content\": \"//! The bounds described above are not good enough. The variance of cost for\\n\\n//! tree deletion is high because it is recursive and high variance poses a\\n\\n//! problem. Although this recursion is bounded by the constraints, it can\\n\\n//! still be very expensive if the overall Tree explores the limits of the\\n\\n//! constraints and revokes the highest root. With this scenario in mind, the\\n\\n//! incentives should discourage large groups and wide or deep delegation.\\n\\n//!\\n\\n//! ### Bonds for Adding Members Scales Linearly With Group Size\\n\\n//!\\n\\n//! ### Bonds for Delegating to Tree Scales Exponentially With Depth and Span\\n\\n//!\\n\\n//! [`Call`]: ./enum.Call.html\\n\\n//! [`Trait`]: ./trait.Trait.html\\n\\n#![cfg_attr(not(feature = \\\"std\\\"), no_std)]\\n\\n\\n\\n#[cfg(test)]\\n\\nmod tests;\\n\\n\\n\\nuse frame_support::{\\n\\n decl_error,\\n\",\n \"file_path\": \"pallet/src/lib.rs\",\n \"rank\": 50,\n \"score\": 10.26699439442333\n },\n {\n \"content\": \" kids: u32,\\n\\n ) -> Result<BalanceOf<T>, DispatchError> {\\n\\n let exp = (height + kids) as usize;\\n\\n // Exponential closure n ^ exp\\n\\n // - no punishment for calling this and not having enough balance is an attack vector\\n\\n // -- could match on reservation error and deduct a fee but would cause storage noop\\n\\n let power = |n: BalanceOf<T>, exp: usize| {\\n\\n vec![n; exp]\\n\\n .iter()\\n\\n .fold(BalanceOf::<T>::zero() + 1u32.into(), |a, b| a * *b)\\n\\n };\\n\\n let bond: BalanceOf<T> = power(T::Bond::get(), exp);\\n\\n T::Currency::reserve(account, bond)?;\\n\\n let b = if let Some(total) = <Members<T>>::get(tree, account) {\\n\\n total + bond\\n\\n } else {\\n\\n bond\\n\\n };\\n\\n <Members<T>>::insert(tree, account, b);\\n\\n Ok(bond)\\n\",\n \"file_path\": \"pallet/src/lib.rs\",\n \"rank\": 51,\n \"score\": 10.08528721994811\n },\n {\n \"content\": \" Self::deposit_event(RawEvent::RevokeDelegation(branch));\\n\\n Ok(())\\n\\n }\\n\\n #[weight = 0]\\n\\n fn add_members(\\n\\n origin,\\n\\n tree_id: T::TreeId,\\n\\n members: Vec<T::AccountId>,\\n\\n ) -> DispatchResult {\\n\\n let caller = ensure_signed(origin)?;\\n\\n let tree = <Trees<T>>::get(tree_id).ok_or(Error::<T>::TreeDNE)?;\\n\\n // auth requires member of direct parent || bonded caller\\n\\n let auth = if let Some(p) = tree.parent {\\n\\n <Members<T>>::get(p, &caller).is_some()\\n\\n } else { tree.bonded == caller };\\n\\n ensure!(auth, Error::<T>::NotAuthorized);\\n\\n let mut mems = members; mems.dedup();\\n\\n let new_size = mems.len() as u32 + tree.size;\\n\\n ensure!(new_size <= T::MaxSize::get(), Error::<T>::CannotAddGroupAboveMaxSize);\\n\\n let bond = Self::reserve_linear_bond(tree_id, &caller, new_size)?;\\n\",\n \"file_path\": \"pallet/src/lib.rs\",\n \"rank\": 52,\n \"score\": 9.600785248067218\n },\n {\n \"content\": \" account: &T::AccountId,\\n\\n new_size: u32,\\n\\n ) -> Result<BalanceOf<T>, DispatchError> {\\n\\n let bond: BalanceOf<T> = T::Bond::get() * new_size.into();\\n\\n T::Currency::reserve(account, bond)?;\\n\\n let b = if let Some(total) = <Members<T>>::get(tree, account) {\\n\\n total + bond\\n\\n } else {\\n\\n bond\\n\\n };\\n\\n <Members<T>>::insert(tree, account, b);\\n\\n Ok(bond)\\n\\n }\\n\\n /// Exponential Bond\\n\\n /// -> bond amount scales exponentially with height and number of kids\\n\\n /// ```(bond)^{height} * (bond)^{kids} = (bond)^{height + kids}```\\n\\n pub fn reserve_exponential_bond(\\n\\n tree: T::TreeId,\\n\\n account: &T::AccountId,\\n\\n height: u32,\\n\",\n \"file_path\": \"pallet/src/lib.rs\",\n \"rank\": 53,\n \"score\": 9.543013197088664\n },\n {\n \"content\": \"pub type SignedBlock = generic::SignedBlock<Block>;\\n\\n/// BlockId type as expected by this runtime.\\n\\npub type BlockId = generic::BlockId<Block>;\\n\\n/// The SignedExtension to the basic transaction logic.\\n\\npub type SignedExtra = (\\n\\n frame_system::CheckSpecVersion<Runtime>,\\n\\n frame_system::CheckTxVersion<Runtime>,\\n\\n frame_system::CheckGenesis<Runtime>,\\n\\n frame_system::CheckEra<Runtime>,\\n\\n frame_system::CheckNonce<Runtime>,\\n\\n frame_system::CheckWeight<Runtime>,\\n\\n pallet_transaction_payment::ChargeTransactionPayment<Runtime>,\\n\\n);\\n\\n/// Unchecked extrinsic type as expected by this runtime.\\n\\npub type UncheckedExtrinsic =\\n\\n generic::UncheckedExtrinsic<Address, Call, Signature, SignedExtra>;\\n\\n/// The payload being signed in transactions.\\n\\npub type SignedPayload = generic::SignedPayload<Call, SignedExtra>;\\n\\n/// Extrinsic type that has already been checked.\\n\\npub type CheckedExtrinsic =\\n\",\n \"file_path\": \"node/runtime/src/lib.rs\",\n \"rank\": 54,\n \"score\": 9.502360356862216\n },\n {\n \"content\": \" generic::CheckedExtrinsic<AccountId, Call, SignedExtra>;\\n\\n/// Executive: handles dispatch to the various modules.\\n\\npub type Executive = frame_executive::Executive<\\n\\n Runtime,\\n\\n Block,\\n\\n frame_system::ChainContext<Runtime>,\\n\\n Runtime,\\n\\n AllModules,\\n\\n>;\\n\\n\\n\\nimpl_runtime_apis! {\\n\\n impl sp_api::Core<Block> for Runtime {\\n\\n fn version() -> RuntimeVersion {\\n\\n VERSION\\n\\n }\\n\\n\\n\\n fn execute_block(block: Block) {\\n\\n Executive::execute_block(block)\\n\\n }\\n\\n\\n\",\n \"file_path\": \"node/runtime/src/lib.rs\",\n \"rank\": 55,\n \"score\": 9.450136532162109\n },\n {\n \"content\": \"use sc_cli::{\\n\\n RunCmd,\\n\\n Runner,\\n\\n RuntimeVersion,\\n\\n Subcommand,\\n\\n SubstrateCli,\\n\\n};\\n\\nuse sc_service::{\\n\\n ChainSpec,\\n\\n DatabaseConfig,\\n\\n PartialComponents,\\n\\n Role,\\n\\n};\\n\\nuse structopt::StructOpt;\\n\\n\\n\\n#[derive(Debug, StructOpt)]\\n\\npub struct Cli {\\n\\n #[structopt(subcommand)]\\n\\n pub subcommand: Option<Subcommand>,\\n\\n\\n\",\n \"file_path\": \"node/src/main.rs\",\n \"rank\": 56,\n \"score\": 9.417721360690424\n },\n {\n \"content\": \"use sc_executor::native_executor_instance;\\n\\nuse sc_service::ChainType;\\n\\nuse sp_core::{\\n\\n sr25519,\\n\\n Pair,\\n\\n Public,\\n\\n};\\n\\nuse sp_runtime::traits::{\\n\\n IdentifyAccount,\\n\\n Verify,\\n\\n};\\n\\nuse sunshine_node_utils::node_service;\\n\\nuse test_runtime::{\\n\\n AccountId,\\n\\n AuraConfig,\\n\\n BalancesConfig,\\n\\n GenesisConfig,\\n\\n GrandpaConfig,\\n\\n Signature,\\n\\n SystemConfig,\\n\",\n \"file_path\": \"node/src/lib.rs\",\n \"rank\": 57,\n \"score\": 9.394105995646447\n },\n {\n \"content\": \" penalty: bool,\\n\\n ) {\\n\\n let mut size_decrease = 0u32;\\n\\n if let Some(mut mem) = mems {\\n\\n mem.dedup();\\n\\n mem.into_iter().for_each(|m| {\\n\\n if let Some(bond) = <Members<T>>::get(tree.id, &m) {\\n\\n // constraint: cannot remove the account who created the hierarchy\\n\\n if tree.bonded != m {\\n\\n T::Currency::unreserve(&m, bond);\\n\\n if penalty {\\n\\n // (could) transfer the bond to some (treasury) account\\n\\n // instead of returning the bond\\n\\n todo!();\\n\\n }\\n\\n <Members<T>>::remove(tree.id, m);\\n\\n size_decrease += 1u32;\\n\\n }\\n\\n }\\n\\n });\\n\",\n \"file_path\": \"pallet/src/lib.rs\",\n \"rank\": 58,\n \"score\": 9.195848123282925\n },\n {\n \"content\": \"use sp_runtime::{\\n\\n create_runtime_str,\\n\\n generic,\\n\\n impl_opaque_keys,\\n\\n traits::{\\n\\n BlakeTwo256,\\n\\n Block as BlockT,\\n\\n IdentifyAccount,\\n\\n NumberFor,\\n\\n Saturating,\\n\\n Verify,\\n\\n },\\n\\n transaction_validity::TransactionValidity,\\n\\n ApplyExtrinsicResult,\\n\\n MultiSignature,\\n\\n};\\n\\nuse sp_std::prelude::*;\\n\\n#[cfg(feature = \\\"std\\\")]\\n\\nuse sp_version::NativeVersion;\\n\\nuse sp_version::RuntimeVersion;\\n\",\n \"file_path\": \"node/runtime/src/lib.rs\",\n \"rank\": 59,\n \"score\": 8.819788073669\n },\n {\n \"content\": \" }\\n\\n /// Add Members to Tree\\n\\n pub fn add_mems(mut tree: TreeSt<T>, mut mems: Vec<T::AccountId>) {\\n\\n mems.dedup();\\n\\n let mut size_increase = 0u32;\\n\\n mems.into_iter().for_each(|m| {\\n\\n // only insert if profile does not already exist\\n\\n if <Members<T>>::get(tree.id, &m).is_none() {\\n\\n <Members<T>>::insert(tree.id, m, BalanceOf::<T>::zero());\\n\\n size_increase += 1u32;\\n\\n }\\n\\n });\\n\\n // insert actual size increase\\n\\n tree.size += size_increase;\\n\\n <Trees<T>>::insert(tree.id, tree);\\n\\n }\\n\\n /// Remove Members of Tree\\n\\n pub fn remove_mems(\\n\\n mut tree: TreeSt<T>,\\n\\n mems: Option<Vec<T::AccountId>>,\\n\",\n \"file_path\": \"pallet/src/lib.rs\",\n \"rank\": 60,\n \"score\": 8.460280830196433\n },\n {\n \"content\": \"#![recursion_limit = \\\"256\\\"]\\n\\n//! # Delegate Module\\n\\n//! This module demonstrates an approach for bounding runtime\\n\\n//! recursion. In particular, it places module-level constraints on\\n\\n//! * the size of each group\\n\\n//! * the number of subgroups\\n\\n//! * the depth of delegation\\n\\n//! These constraints allow us to use recursion in the module\\n\\n//! with strict bounds on worst-case complexity.\\n\\n//!\\n\\n//! - [`delegate::Trait`](./trait.Trait.html)\\n\\n//! - [`Call`](./enum.Call.html)\\n\\n//!\\n\\n//! ## Overview\\n\\n//! This pallet allows delegation to a bounded depth. The incentives discourage\\n\\n//! (1) adding members to large groups\\n\\n//! (2) delegating to a new subgroup\\n\\n//! The module enforces strict bounds on the size of a group, the number of\\n\\n//! subgroups, and the depth of delegation to place explicit bounds on runtime\\n\\n//! recursion. Each group registered on-chain has a `TreeId`. To get the state\\n\",\n \"file_path\": \"pallet/src/lib.rs\",\n \"rank\": 61,\n \"score\": 8.209406610577\n },\n {\n \"content\": \" }\\n\\n #[weight = 0]\\n\\n fn delegate(\\n\\n origin,\\n\\n parent: T::TreeId,\\n\\n members: Vec<T::AccountId>,\\n\\n ) -> DispatchResult {\\n\\n let caller = ensure_signed(origin)?;\\n\\n ensure!(<Members<T>>::get(parent, &caller).is_some(), Error::<T>::NotAuthorized);\\n\\n let parent_st = <Trees<T>>::get(parent).ok_or(Error::<T>::TreeDNE)?;\\n\\n let (new_kids, new_height) = (parent_st.kids + 1u32, parent_st.height + 1u32);\\n\\n // check that delegating does not violate module kids constraints (num of children)\\n\\n ensure!(new_kids <= T::MaxKids::get(), Error::<T>::CannotDelegateAboveMaxKids);\\n\\n // check that delegating does not violate module depth constraints\\n\\n ensure!(new_height <= T::MaxDepth::get(), Error::<T>::CannotDelegateBelowMaxDepth);\\n\\n let bond = Self::reserve_exponential_bond(parent, &caller, new_height, new_kids)?;\\n\\n let id = Self::gen_uid();\\n\\n let state = TreeState {\\n\\n id,\\n\\n parent: Some(parent_st.id),\\n\",\n \"file_path\": \"pallet/src/lib.rs\",\n \"rank\": 62,\n \"score\": 7.82533076436332\n },\n {\n \"content\": \" {\\n\\n RegisterIdRoot(TreeId, AccountId, Balance),\\n\\n AddedMembers(AccountId, TreeId, Balance),\\n\\n RemovedMembers(AccountId, TreeId),\\n\\n DelegateBranch(TreeId, TreeId, AccountId, Balance),\\n\\n RevokeDelegation(TreeId),\\n\\n }\\n\\n);\\n\\n\\n\\ndecl_error! {\\n\\n pub enum Error for Module<T: Trait> {\\n\\n // Tree does not exist\\n\\n TreeDNE,\\n\\n NotAuthorized,\\n\\n CannotAddGroupAboveMaxSize,\\n\\n CannotDelegateBelowMaxDepth,\\n\\n CannotDelegateAboveMaxKids,\\n\\n }\\n\\n}\\n\\n\\n\\ndecl_storage! {\\n\",\n \"file_path\": \"pallet/src/lib.rs\",\n \"rank\": 63,\n \"score\": 7.792968747011701\n },\n {\n \"content\": \" #[structopt(flatten)]\\n\\n pub run: RunCmd,\\n\\n}\\n\\n\\n\\nimpl SubstrateCli for Cli {\\n\\n fn impl_name() -> String {\\n\\n test_node::IMPL_NAME.into()\\n\\n }\\n\\n\\n\\n fn impl_version() -> String {\\n\\n test_node::IMPL_VERSION.into()\\n\\n }\\n\\n\\n\\n fn description() -> String {\\n\\n test_node::DESCRIPTION.into()\\n\\n }\\n\\n\\n\\n fn author() -> String {\\n\\n test_node::AUTHOR.into()\\n\\n }\\n\",\n \"file_path\": \"node/src/main.rs\",\n \"rank\": 64,\n \"score\": 7.417338164986029\n },\n {\n \"content\": \" Self::add_mems(tree, mems);\\n\\n Self::deposit_event(RawEvent::AddedMembers(caller, tree_id, bond));\\n\\n Ok(())\\n\\n }\\n\\n #[weight = 0]\\n\\n fn remove_members(\\n\\n origin,\\n\\n tree_id: T::TreeId,\\n\\n members: Vec<T::AccountId>,\\n\\n penalty: bool,\\n\\n ) -> DispatchResult {\\n\\n let caller = ensure_signed(origin)?;\\n\\n let tree = <Trees<T>>::get(tree_id).ok_or(Error::<T>::TreeDNE)?;\\n\\n // auth requires member of direct parent || bonded caller\\n\\n let auth = if let Some(p) = tree.parent {\\n\\n <Members<T>>::get(p, &caller).is_some()\\n\\n } else { tree.bonded == caller };\\n\\n ensure!(auth, Error::<T>::NotAuthorized);\\n\\n Self::remove_mems(tree, Some(members), penalty);\\n\\n Self::deposit_event(RawEvent::RemovedMembers(caller, tree_id));\\n\",\n \"file_path\": \"pallet/src/lib.rs\",\n \"rank\": 65,\n \"score\": 7.278060525321486\n },\n {\n \"content\": \" /// Maximum number of block number to block hash mappings to keep (oldest pruned first).\\n\\n type BlockHashCount = BlockHashCount;\\n\\n /// Maximum weight of each block.\\n\\n type MaximumBlockWeight = MaximumBlockWeight;\\n\\n /// Maximum size of all encoded transactions (in bytes) that are allowed in one block.\\n\\n type MaximumBlockLength = MaximumBlockLength;\\n\\n /// Portion of the block weight that is available to all normal transactions.\\n\\n type AvailableBlockRatio = AvailableBlockRatio;\\n\\n /// The weight of the overhead invoked on the block import process, independent of the\\n\\n /// extrinsics included in that block.\\n\\n type BlockExecutionWeight = BlockExecutionWeight;\\n\\n /// The weight of database operations that the runtime can invoke.\\n\\n type DbWeight = RocksDbWeight;\\n\\n /// The base weight of any extrinsic processed by the runtime, independent of the\\n\\n /// logic of that extrinsic. (Signature verification, nonce increment, fee, etc...)\\n\\n type ExtrinsicBaseWeight = ExtrinsicBaseWeight;\\n\\n /// The maximum weight for any extrinsic\\n\\n type MaximumExtrinsicWeight = MaximumExtrinsicWeight;\\n\\n /// Version of the runtime.\\n\\n type Version = Version;\\n\",\n \"file_path\": \"node/runtime/src/lib.rs\",\n \"rank\": 66,\n \"score\": 7.244405939935623\n },\n {\n \"content\": \"//! of a group, we use the `Trees` map\\n\\n//! ```rust, ignore\\n\\n//! map TreeId => Option<TreeState<T::TreeId, T::AccountId>>;\\n\\n//! ```\\n\\n//! The `TreeState<_, _>` struct contains the data relevant to the bounds that\\n\\n//! the module places on length, width and depth.\\n\\n//! ```rust, ignore\\n\\n//! pub struct TreeState<TreeId, AccountId> {\\n\\n//! pub id: TreeId,\\n\\n//! pub parent: Option<TreeId>,\\n\\n//! pub bonded: AccountId,\\n\\n//! pub height: u32,\\n\\n//! pub kids: u32,\\n\\n//! pub size: u32,\\n\\n//! }\\n\\n//! ```\\n\\n//! The module's runtime configuration sets the maximum depth (`height`),\\n\\n//! number of subgroups (`kids`), and number of members (`size`). Each\\n\\n//! `TreeState<_, _>` is either a root or the child of a parent tree.\\n\\n//! We define an algorithm for tree creation.\\n\",\n \"file_path\": \"pallet/src/lib.rs\",\n \"rank\": 67,\n \"score\": 7.171075501198186\n },\n {\n \"content\": \" WASM_BINARY,\\n\\n};\\n\\n\\n\\npub const IMPL_NAME: &str = \\\"Sunshine Node\\\";\\n\\npub const IMPL_VERSION: &str = env!(\\\"CARGO_PKG_VERSION\\\");\\n\\npub const DESCRIPTION: &str = env!(\\\"CARGO_PKG_DESCRIPTION\\\");\\n\\npub const AUTHOR: &str = env!(\\\"CARGO_PKG_AUTHORS\\\");\\n\\npub const SUPPORT_URL: &str = env!(\\\"CARGO_PKG_HOMEPAGE\\\");\\n\\npub const COPYRIGHT_START_YEAR: i32 = 2020;\\n\\npub const EXECUTABLE_NAME: &str = env!(\\\"CARGO_PKG_NAME\\\");\\n\\n\\n\\nnative_executor_instance!(\\n\\n pub Executor,\\n\\n test_runtime::api::dispatch,\\n\\n test_runtime::native_version,\\n\\n);\\n\\n\\n\\nnode_service!(\\n\\n test_runtime::opaque::Block,\\n\\n test_runtime::RuntimeApi,\\n\\n Executor\\n\\n);\\n\\n\\n\\n/// Specialized `ChainSpec`.\\n\\npub type ChainSpec = sc_service::GenericChainSpec<GenesisConfig>;\\n\\n\\n\\n/// Helper function to generate a crypto pair from seed\\n\",\n \"file_path\": \"node/src/lib.rs\",\n \"rank\": 68,\n \"score\": 6.5856036581310455\n },\n {\n \"content\": \" }\\n\\n\\n\\n impl sp_offchain::OffchainWorkerApi<Block> for Runtime {\\n\\n fn offchain_worker(header: &<Block as BlockT>::Header) {\\n\\n Executive::offchain_worker(header)\\n\\n }\\n\\n }\\n\\n\\n\\n impl sp_consensus_aura::AuraApi<Block, AuraId> for Runtime {\\n\\n fn slot_duration() -> u64 {\\n\\n Aura::slot_duration()\\n\\n }\\n\\n\\n\\n fn authorities() -> Vec<AuraId> {\\n\\n Aura::authorities()\\n\\n }\\n\\n }\\n\\n\\n\\n impl sp_session::SessionKeys<Block> for Runtime {\\n\\n fn generate_session_keys(seed: Option<Vec<u8>>) -> Vec<u8> {\\n\",\n \"file_path\": \"node/runtime/src/lib.rs\",\n \"rank\": 69,\n \"score\": 6.438717164950031\n },\n {\n \"content\": \"#![allow(clippy::large_enum_variant)]\\n\\n#![cfg_attr(not(feature = \\\"std\\\"), no_std)]\\n\\n// `construct_runtime!` does a lot of recursion and requires us to increase the limit to 256.\\n\\n#![recursion_limit = \\\"256\\\"]\\n\\n\\n\\n// Make the WASM binary available.\\n\\n#[cfg(feature = \\\"std\\\")]\\n\\ninclude!(concat!(env!(\\\"OUT_DIR\\\"), \\\"/wasm_binary.rs\\\"));\\n\\n\\n\\nuse pallet_grandpa::{\\n\\n fg_primitives,\\n\\n AuthorityId,\\n\\n AuthorityList as GrandpaAuthorityList,\\n\\n};\\n\\nuse sp_api::impl_runtime_apis;\\n\\nuse sp_consensus_aura::sr25519::AuthorityId as AuraId;\\n\\nuse sp_core::{\\n\\n crypto::KeyTypeId,\\n\\n OpaqueMetadata,\\n\\n};\\n\",\n \"file_path\": \"node/runtime/src/lib.rs\",\n \"rank\": 70,\n \"score\": 6.293078647035683\n },\n {\n \"content\": \"# Delegate\\n\\n\\n\\nThis pallet demonstrates how to safely bound runtime recursion with module-level constraints. The associated types of the module's Trait bound and disincentivize (1) large, (2) wide, and (3) deep tree delegation.\\n\\n1. group size, number of members `Vec<AccountId>` associated on-chain with `TreeId` s.t. each tree can only have up to `Trait::MaxSize` members in total\\n\\n2. number of subtrees, each tree can only have up to `Trait::MaxKids` number of subtrees for delegation\\n\\n3. depth, a tree can only have height up to `Trait::MaxDepth` or it is not allowed to be created for delegation, `depth_of_child = depth_of_parent + 1`\\n\\n\\n\\nAdding new members and delegating to subtrees is disincentivized by collateral requirements. Bonds for adding new members scale linearly with group size. Bonds for adding new subtrees scales exponentially with number of children and depth.\\n\\n\\n\\n## Rules\\n\\n\\n\\n* Any account can register a tree with a `TreeId` and add a set of members `Vec<AccountId>`\\n\\n* If the `TreeState` has `height = 0`, the account that registered the Tree is the only account that can add and remove members\\n\\n* Otherwise (`height > 0`), any account in the parent tree can add or remove members (as long as new member count is leq `Trait::MaxSize`)\\n\\n* Any member of the set `Vec<AccountId>` associated with the `TreeId` can delegate permissions to a new `TreeId` (as long as subtree height is leq `Trait::MaxDepth` and parent's kid count is leq `Trait::MaxKids`)\\n\\n* Only the account that registered the Tree can revoke it, triggering recursion to delete all subtrees. To disincentivize expensive recursion, actions for adding members and adding subtrees require collateral in proportion to the marginal contribution of each action to worst case deletion complexity.\\n\\n * Collateral requirements for adding new members scale linearly with group size. \\n\",\n \"file_path\": \"README.md\",\n \"rank\": 71,\n \"score\": 5.743065186236498\n },\n {\n \"content\": \"//! ```ignore\\n\\n//! TreeCreation(parent: TreeState<_, _>)\\n\\n//! let kid = TreeState {\\n\\n//! parent: Some(parent.id)\\n\\n//! height: parent.height + 1u32,\\n\\n//! ..\\n\\n//! }\\n\\n//! parent.kids += 1u32;\\n\\n//! Storage::insert(kid);\\n\\n//! Storage::insert(parent)\\n\\n//! ```\\n\\n//! Before this algorithm is called, the runtime methods verify that\\n\\n//! the kid's height does not exceed the `Trait::MaxDepth` and the parent's\\n\\n//! kid count does not exceed `Trait::MaxKids`.\\n\\n//!\\n\\n//! Similarly, the runtime verifies that the new group count is below\\n\\n//! the `Trait::MaxSize` before adding new members to the set of `AccountId`\\n\\n//! associated on-chain with the group `TreeId`.\\n\\n//!\\n\\n//! ## Incentives\\n\",\n \"file_path\": \"pallet/src/lib.rs\",\n \"rank\": 73,\n \"score\": 5.511879289720847\n },\n {\n \"content\": \" fn initialize_block(header: &<Block as BlockT>::Header) {\\n\\n Executive::initialize_block(header)\\n\\n }\\n\\n }\\n\\n\\n\\n impl sp_api::Metadata<Block> for Runtime {\\n\\n fn metadata() -> OpaqueMetadata {\\n\\n Runtime::metadata().into()\\n\\n }\\n\\n }\\n\\n\\n\\n impl sp_block_builder::BlockBuilder<Block> for Runtime {\\n\\n fn apply_extrinsic(extrinsic: <Block as BlockT>::Extrinsic) -> ApplyExtrinsicResult {\\n\\n Executive::apply_extrinsic(extrinsic)\\n\\n }\\n\\n\\n\\n fn finalize_block() -> <Block as BlockT>::Header {\\n\\n Executive::finalize_block()\\n\\n }\\n\\n\\n\",\n \"file_path\": \"node/runtime/src/lib.rs\",\n \"rank\": 74,\n \"score\": 4.996364927762014\n },\n {\n \"content\": \" // insert actual size decrease\\n\\n tree.size -= size_decrease;\\n\\n <Trees<T>>::insert(tree.id, tree);\\n\\n } else {\\n\\n <Members<T>>::iter_prefix(tree.id).for_each(|(a, b)| {\\n\\n T::Currency::unreserve(&a, b);\\n\\n if penalty {\\n\\n // (could) transfer the bond to some (treasury) account\\n\\n // instead of returning the bond\\n\\n todo!();\\n\\n }\\n\\n <Members<T>>::remove(tree.id, a);\\n\\n size_decrease += 1u32;\\n\\n });\\n\\n // if parent exists, decrement parent kids count\\n\\n if let Some(p) = tree.parent {\\n\\n if let Some(tp) = <Trees<T>>::get(p) {\\n\\n <Trees<T>>::insert(\\n\\n p,\\n\\n TreeState {\\n\",\n \"file_path\": \"pallet/src/lib.rs\",\n \"rank\": 75,\n \"score\": 4.875329683767991\n },\n {\n \"content\": \" opaque::SessionKeys::generate(seed)\\n\\n }\\n\\n\\n\\n fn decode_session_keys(\\n\\n encoded: Vec<u8>,\\n\\n ) -> Option<Vec<(Vec<u8>, sp_core::crypto::KeyTypeId)>> {\\n\\n opaque::SessionKeys::decode_into_raw_public_keys(&encoded)\\n\\n }\\n\\n }\\n\\n\\n\\n impl fg_primitives::GrandpaApi<Block> for Runtime {\\n\\n fn grandpa_authorities() -> GrandpaAuthorityList {\\n\\n Grandpa::grandpa_authorities()\\n\\n }\\n\\n fn submit_report_equivocation_unsigned_extrinsic(\\n\\n _equivocation_proof: fg_primitives::EquivocationProof<\\n\\n <Block as BlockT>::Hash,\\n\\n NumberFor<Block>,\\n\\n >,\\n\\n _key_owner_proof: fg_primitives::OpaqueKeyOwnershipProof,\\n\",\n \"file_path\": \"node/runtime/src/lib.rs\",\n \"rank\": 76,\n \"score\": 3.7484966399186774\n },\n {\n \"content\": \" kids: tp.kids - 1,\\n\\n ..tp\\n\\n },\\n\\n );\\n\\n }\\n\\n }\\n\\n // Recursively remove all Children\\n\\n // runtime recursion bounded by module-level constraints on\\n\\n // * delegation depth/height (MaxDepth)\\n\\n // * children (subtrees) per tree (MaxKids)\\n\\n // * members (accounts) per tree (MaxSize)\\n\\n <Trees<T>>::iter().for_each(|(_, child)| {\\n\\n if child.parent == Some(tree.id) {\\n\\n Self::remove_mems(child, None, penalty);\\n\\n }\\n\\n });\\n\\n }\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"pallet/src/lib.rs\",\n \"rank\": 77,\n \"score\": 3.305339259286845\n },\n {\n \"content\": \" path => {\\n\\n Box::new(test_node::ChainSpec::from_json_file(path.into())?)\\n\\n }\\n\\n })\\n\\n }\\n\\n\\n\\n fn native_runtime_version(\\n\\n _: &Box<dyn ChainSpec>,\\n\\n ) -> &'static RuntimeVersion {\\n\\n &test_runtime::VERSION\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"node/src/main.rs\",\n \"rank\": 78,\n \"score\": 3.157032786163076\n },\n {\n \"content\": \" get_account_id_from_seed::<sr25519::Public>(\\\"Alice//stash\\\"),\\n\\n get_account_id_from_seed::<sr25519::Public>(\\\"Bob//stash\\\"),\\n\\n get_account_id_from_seed::<sr25519::Public>(\\n\\n \\\"Charlie//stash\\\",\\n\\n ),\\n\\n get_account_id_from_seed::<sr25519::Public>(\\\"Dave//stash\\\"),\\n\\n get_account_id_from_seed::<sr25519::Public>(\\\"Eve//stash\\\"),\\n\\n get_account_id_from_seed::<sr25519::Public>(\\n\\n \\\"Ferdie//stash\\\",\\n\\n ),\\n\\n ],\\n\\n )\\n\\n },\\n\\n vec![],\\n\\n None,\\n\\n None,\\n\\n None,\\n\\n None,\\n\\n )\\n\\n}\\n\\n\\n\",\n \"file_path\": \"node/src/lib.rs\",\n \"rank\": 79,\n \"score\": 2.918847740283818\n },\n {\n \"content\": \"use substrate_wasm_builder_runner::WasmBuilder;\\n\\n\\n\",\n \"file_path\": \"node/runtime/build.rs\",\n \"rank\": 80,\n \"score\": 2.6863147317277183\n },\n {\n \"content\": \" ) -> Option<()> {\\n\\n None\\n\\n }\\n\\n\\n\\n fn generate_key_ownership_proof(\\n\\n _set_id: fg_primitives::SetId,\\n\\n _authority_id: AuthorityId,\\n\\n ) -> Option<fg_primitives::OpaqueKeyOwnershipProof> {\\n\\n // NOTE: this is the only implementation possible since we've\\n\\n // defined our key owner proof type as a bottom type (i.e. a type\\n\\n // with no values).\\n\\n None\\n\\n }\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"node/runtime/src/lib.rs\",\n \"rank\": 81,\n \"score\": 2.5721139610932804\n },\n {\n \"content\": \"use substrate_build_script_utils::{\\n\\n generate_cargo_keys,\\n\\n rerun_if_git_head_changed,\\n\\n};\\n\\n\\n\",\n \"file_path\": \"node/build.rs\",\n \"rank\": 82,\n \"score\": 2.4539840547245424\n },\n {\n \"content\": \" fn inherent_extrinsics(data: sp_inherents::InherentData) -> Vec<<Block as BlockT>::Extrinsic> {\\n\\n data.create_extrinsics()\\n\\n }\\n\\n\\n\\n fn check_inherents(\\n\\n block: Block,\\n\\n data: sp_inherents::InherentData,\\n\\n ) -> sp_inherents::CheckInherentsResult {\\n\\n data.check_extrinsics(&block)\\n\\n }\\n\\n\\n\\n fn random_seed() -> <Block as BlockT>::Hash {\\n\\n RandomnessCollectiveFlip::random_seed()\\n\\n }\\n\\n }\\n\\n\\n\\n impl sp_transaction_pool::runtime_api::TaggedTransactionQueue<Block> for Runtime {\\n\\n fn validate_transaction(source: sp_runtime::transaction_validity::TransactionSource, uxt: <Block as BlockT>::Extrinsic) -> TransactionValidity {\\n\\n Executive::validate_transaction(source, uxt)\\n\\n }\\n\",\n \"file_path\": \"node/runtime/src/lib.rs\",\n \"rank\": 83,\n \"score\": 2.3697096428060505\n }\n]","isConversational":false}}},{"rowIdx":2388,"cells":{"lang":{"kind":"string","value":"Rust"},"file_path":{"kind":"string","value":"src/run_plan.rs"},"repo_name":{"kind":"string","value":"camchenry/lolbench"},"commit":{"kind":"string","value":"941ebb099a398ad33cb3658bcd021a98081dfa80"},"file_code":{"kind":"string","value":"use super::Result;\n\nuse std::{\n fmt::{Display, Formatter, Result as FmtResult},\n path::PathBuf,\n process::Command,\n};\n\nuse ring::digest::{digest, SHA256};\n\nuse marky_mark::Benchmark;\n\nuse cpu_shield::{RenameThisCommandWrapper, ShieldSpec};\nuse toolchain::Toolchain;\nuse CriterionConfig;\n\n#[derive(Clone, Debug, Deserialize, Eq, PartialEq, PartialOrd, Ord, Serialize)]\npub struct RunPlan {\n pub binary_name: String,\n pub benchmark: Benchmark,\n pub toolchain: Option<Toolchain>,\n pub bench_config: Option<CriterionConfig>,\n pub shield: Option<ShieldSpec>,\n pub source_path: PathBuf,\n pub manifest_path: PathBuf,\n}\n\nimpl Display for RunPlan {\n fn fmt(&self, f: &mut Formatter) -> FmtResult {\n let tcs = self\n .toolchain\n .as_ref()\n .map(|tc| tc.to_string())\n .unwrap_or_else(|| \"current\".to_string());\n f.write_fmt(format_args!(\n \"{}: {}::{}@{:?}\",\n tcs, self.benchmark.crate_name, self.benchmark.name, self.benchmark.runner,\n ))\n }\n}\n\nimpl RunPlan {\n pub fn new(\n benchmark: Benchmark,\n bench_config: Option<CriterionConfig>,\n shield: Option<ShieldSpec>,\n toolchain: Option<Toolchain>,\n source_path: PathBuf,\n ) -> Result<Self> {\n let binary_name = source_path\n .file_stem()\n .unwrap()\n .to_string_lossy()\n .to_string();\n\n let mut manifest_path = None;\n for dir in source_path.ancestors() {\n let candidate = dir.join(\"Cargo.toml\");\n if candidate.is_file() {\n manifest_path = Some(candidate);\n break;\n }\n }\n\n let manifest_path = manifest_path.unwrap();\n\n Ok(Self {\n benchmark,\n shield,\n toolchain,\n source_path,\n manifest_path,\n binary_name,\n bench_config,\n })\n }\n\n fn binary_path(&self) -> PathBuf {\n self.target_dir().join(\"release\").join(&self.binary_name)\n }\n\n fn target_dir(&self) -> PathBuf {\n use std::env::var as envvar;\n\n match self.toolchain {\n Some(ref t) => t.target_dir(),\n None => {\n PathBuf::from(envvar(\"CARGO_TARGET_DIR\").unwrap_or_else(|_| String::from(\"target\")))\n }\n }\n }\n\n pub fn validate(&self) -> Result<()> {\n ensure!(self.source_path.is_file(), \"source_path is not a file\");\n ensure!(self.manifest_path.is_file(), \"manifest_path is not a file\");\n\n \n if let Some(_spec) = &self.shield {\n \n }\n\n if let Some(_cfg) = &self.bench_config {\n \n }\n\n Ok(())\n }\n\n \n pub fn build(&self) -> Result<Vec<u8>> {\n let target_name = self.source_path.file_stem().unwrap().to_string_lossy();\n info!(\"building {} with {:?}\", target_name, self.toolchain);\n\n let mut cmd = Command::new(\"cargo\");\n\n if let Some(ref t) = self.toolchain {\n cmd.arg(format!(\"+{}\", t));\n }\n\n let output = cmd\n .arg(\"build\")\n .arg(\"--release\")\n .arg(\"--manifest-path\")\n .arg(&self.manifest_path)\n .arg(\"--bin\")\n .arg(&*target_name)\n .env(\"CARGO_TARGET_DIR\", &*self.target_dir())\n .output()?;\n\n if !output.status.success() {\n let stdout = String::from_utf8_lossy(&output.stdout);\n let stderr = String::from_utf8_lossy(&output.stderr);\n bail!(\n \"Unable to build {} with {:?} (None means current, adam is lazy).\\nstdout:{}\\nstderr:{}\",\n target_name,\n self.toolchain,\n stdout,\n stderr\n );\n }\n\n info!(\"done building {}\", self.source_path.display());\n\n let bin_path = self.binary_path();\n\n debug!(\"reading contents of {} at {}\", self, bin_path.display());\n let bin_contents = ::std::fs::read(&bin_path)?;\n\n debug!(\"hashing binary contents\");\n Ok(digest(&SHA256, &bin_contents).as_ref().to_owned())\n }\n\n \n pub fn exec(&self) -> Result<()> {\n debug!(\"configuring command for {}\", self);\n\n let mut cmd = RenameThisCommandWrapper::new(\"cargo\", self.shield.clone());\n\n if let Some(ref t) = self.toolchain {\n cmd.arg(format!(\"+{}\", t));\n }\n\n cmd.args(&[\"run\", \"--release\", \"--manifest-path\"]);\n cmd.arg(&self.manifest_path); \n cmd.args(&[\"--bin\", &self.binary_name]);\n\n cmd.env(\"CARGO_TARGET_DIR\", &*self.target_dir());\n\n if let Some(cfg) = &self.bench_config {\n debug!(\"applying criterion config\");\n for (k, v) in cfg.envs() {\n cmd.env(k, v);\n }\n }\n\n debug!(\"running {} with {:?}\", self, cmd);\n let output = cmd.output()?;\n\n let stdout = String::from_utf8_lossy(&output.stdout);\n let stderr = String::from_utf8_lossy(&output.stderr);\n\n if !output.status.success() {\n bail!(\"benchmark failed! stdout: {}, stderr: {}\", stdout, stderr);\n }\n\n Ok(())\n }\n}\n"},"prefix":{"kind":"string","value":"use super::Result;\n\nuse std::{\n fmt::{Display, Formatter, Result as FmtResult},\n path::PathBuf,\n process::Command,\n};\n\nuse ring::digest::{digest, SHA256};\n\nuse marky_mark::Benchmark;\n\nuse cpu_shield::{RenameThisCommandWrapper, ShieldSpec};\nuse toolchain::Toolchain;\nuse CriterionConfig;\n\n#[derive(Clone, Debug, Deserialize, Eq, PartialEq, PartialOrd, Ord, Serialize)]\npub struct RunPlan {\n pub binary_name: String,\n pub benchmark: Benchmark,\n pub toolchain: Option<Toolchain>,\n pub bench_config: Option<CriterionConfig>,\n pub shield: Option<ShieldSpec>,\n pub source_path: PathBuf,\n pub manifest_path: PathBuf,\n}\n\nimpl Display for RunPlan {\n fn fmt(&self, f: &mut Formatter) -> FmtResult {\n let tcs = self\n .toolchain\n .as_ref()\n .map(|tc| tc.to_string())\n .unwrap_or_else(|| \"current\".to_string());\n f.write_fmt(format_arg"},"suffix":{"kind":"string","value":"\n}\n\nimpl RunPlan {\n pub fn new(\n benchmark: Benchmark,\n bench_config: Option<CriterionConfig>,\n shield: Option<ShieldSpec>,\n toolchain: Option<Toolchain>,\n source_path: PathBuf,\n ) -> Result<Self> {\n let binary_name = source_path\n .file_stem()\n .unwrap()\n .to_string_lossy()\n .to_string();\n\n let mut manifest_path = None;\n for dir in source_path.ancestors() {\n let candidate = dir.join(\"Cargo.toml\");\n if candidate.is_file() {\n manifest_path = Some(candidate);\n break;\n }\n }\n\n let manifest_path = manifest_path.unwrap();\n\n Ok(Self {\n benchmark,\n shield,\n toolchain,\n source_path,\n manifest_path,\n binary_name,\n bench_config,\n })\n }\n\n fn binary_path(&self) -> PathBuf {\n self.target_dir().join(\"release\").join(&self.binary_name)\n }\n\n fn target_dir(&self) -> PathBuf {\n use std::env::var as envvar;\n\n match self.toolchain {\n Some(ref t) => t.target_dir(),\n None => {\n PathBuf::from(envvar(\"CARGO_TARGET_DIR\").unwrap_or_else(|_| String::from(\"target\")))\n }\n }\n }\n\n pub fn validate(&self) -> Result<()> {\n ensure!(self.source_path.is_file(), \"source_path is not a file\");\n ensure!(self.manifest_path.is_file(), \"manifest_path is not a file\");\n\n \n if let Some(_spec) = &self.shield {\n \n }\n\n if let Some(_cfg) = &self.bench_config {\n \n }\n\n Ok(())\n }\n\n \n pub fn build(&self) -> Result<Vec<u8>> {\n let target_name = self.source_path.file_stem().unwrap().to_string_lossy();\n info!(\"building {} with {:?}\", target_name, self.toolchain);\n\n let mut cmd = Command::new(\"cargo\");\n\n if let Some(ref t) = self.toolchain {\n cmd.arg(format!(\"+{}\", t));\n }\n\n let output = cmd\n .arg(\"build\")\n .arg(\"--release\")\n .arg(\"--manifest-path\")\n .arg(&self.manifest_path)\n .arg(\"--bin\")\n .arg(&*target_name)\n .env(\"CARGO_TARGET_DIR\", &*self.target_dir())\n .output()?;\n\n if !output.status.success() {\n let stdout = String::from_utf8_lossy(&output.stdout);\n let stderr = String::from_utf8_lossy(&output.stderr);\n bail!(\n \"Unable to build {} with {:?} (None means current, adam is lazy).\\nstdout:{}\\nstderr:{}\",\n target_name,\n self.toolchain,\n stdout,\n stderr\n );\n }\n\n info!(\"done building {}\", self.source_path.display());\n\n let bin_path = self.binary_path();\n\n debug!(\"reading contents of {} at {}\", self, bin_path.display());\n let bin_contents = ::std::fs::read(&bin_path)?;\n\n debug!(\"hashing binary contents\");\n Ok(digest(&SHA256, &bin_contents).as_ref().to_owned())\n }\n\n \n pub fn exec(&self) -> Result<()> {\n debug!(\"configuring command for {}\", self);\n\n let mut cmd = RenameThisCommandWrapper::new(\"cargo\", self.shield.clone());\n\n if let Some(ref t) = self.toolchain {\n cmd.arg(format!(\"+{}\", t));\n }\n\n cmd.args(&[\"run\", \"--release\", \"--manifest-path\"]);\n cmd.arg(&self.manifest_path); \n cmd.args(&[\"--bin\", &self.binary_name]);\n\n cmd.env(\"CARGO_TARGET_DIR\", &*self.target_dir());\n\n if let Some(cfg) = &self.bench_config {\n debug!(\"applying criterion config\");\n for (k, v) in cfg.envs() {\n cmd.env(k, v);\n }\n }\n\n debug!(\"running {} with {:?}\", self, cmd);\n let output = cmd.output()?;\n\n let stdout = String::from_utf8_lossy(&output.stdout);\n let stderr = String::from_utf8_lossy(&output.stderr);\n\n if !output.status.success() {\n bail!(\"benchmark failed! stdout: {}, stderr: {}\", stdout, stderr);\n }\n\n Ok(())\n }\n}\n"},"middle":{"kind":"string","value":"s!(\n \"{}: {}::{}@{:?}\",\n tcs, self.benchmark.crate_name, self.benchmark.name, self.benchmark.runner,\n ))\n }"},"strategy":{"kind":"string","value":"function_block-function_prefixed"},"context_items":{"kind":"list like","value":[{"content":"fn most_covered_toolchains_runtimes(data_dir: impl AsRef<Path>) -> Result<Vec<(R64, String)>> {\n\n info!(\"finding all existing estimates\");\n\n let estimates = GitStore::ensure_initialized(data_dir)?.all_stored_estimates()?;\n\n\n\n info!(\"reorganizing them by toolchain\");\n\n let mut by_toolchain = BTreeMap::new();\n\n for (bench_key, toolchains) in estimates {\n\n for (toolchain, estimate) in toolchains {\n\n by_toolchain\n\n .entry(toolchain)\n\n .or_insert_with(BTreeMap::new)\n\n .insert(bench_key.clone(), estimate);\n\n }\n\n }\n\n\n\n let mut lens = by_toolchain\n\n .iter()\n\n .map(|(tc, by_bench)| (tc, by_bench.len()))\n\n .collect::<Vec<_>>();\n\n lens.sort();\n","file_path":"src/registry.rs","rank":0,"score":227281.4841318139},{"content":"pub fn rebalance(sample_data_dir: impl AsRef<Path>) -> Result<()> {\n\n let (mut registry, _) = Registry::from_disk()?;\n\n let runners = registry.runners().to_owned();\n\n\n\n // fill the minheap with runners and 0 scores\n\n let mut weights = Vec::from_iter(runners.iter().map(|r| (r64(0.0), r.clone())));\n\n // also create a mapping of benchmark assignments\n\n let mut new_assignments: BTreeMap<String, Vec<String>> = BTreeMap::new();\n\n let runners_by_bench_key = registry\n\n .benches()\n\n .into_iter()\n\n .filter_map(|b| {\n\n let bench_key = format!(\"{}::{}\", b.crate_name, b.name);\n\n b.runner.map(|r| (bench_key, r))\n\n }).collect::<BTreeMap<String, String>>();\n\n\n\n for (ns, bench_key) in most_covered_toolchains_runtimes(sample_data_dir)? {\n\n if let Some(assigned) = runners_by_bench_key.get(&bench_key) {\n\n // this has already been assigned, so we just need to track its runtime\n\n weights\n","file_path":"src/registry.rs","rank":1,"score":216835.91909350664},{"content":"fn bench_harness<F: FnMut(&mut [u32])>(mut f: F, b: &mut Bencher) {\n\n let base_vec = super::default_vec(BENCH_SIZE);\n\n let mut sort_vec = vec![];\n\n b.iter(|| {\n\n sort_vec = base_vec.clone();\n\n f(&mut sort_vec);\n\n });\n\n assert!(super::is_sorted(&mut sort_vec));\n\n}\n\n\n\nwrap_libtest! {\n\n quicksort::bench,\n\n fn quick_sort_par_bench(b: &mut Bencher) {\n\n bench_harness(super::quick_sort::<Parallel, u32>, b);\n\n }\n\n}\n\n\n\nwrap_libtest! {\n\n quicksort::bench,\n\n fn quick_sort_seq_bench(b: &mut Bencher) {\n","file_path":"benches/rayon_1_0_0/src/quicksort/bench.rs","rank":2,"score":215967.3935970734},{"content":"fn bench_harness<F: FnMut(&mut [u32])>(mut f: F, b: &mut Bencher) {\n\n let base_vec = super::default_vec(BENCH_SIZE);\n\n let mut sort_vec = vec![];\n\n b.iter(|| {\n\n sort_vec = base_vec.clone();\n\n f(&mut sort_vec);\n\n });\n\n assert!(super::is_sorted(&mut sort_vec));\n\n}\n\n\n\nwrap_libtest! {\n\n mergesort::bench,\n\n fn merge_sort_par_bench(b: &mut Bencher) {\n\n bench_harness(super::merge_sort, b);\n\n }\n\n}\n\n\n\nwrap_libtest! {\n\n mergesort::bench,\n\n fn merge_sort_seq_bench(b: &mut Bencher) {\n\n bench_harness(super::seq_merge_sort, b);\n\n }\n\n}\n","file_path":"benches/rayon_1_0_0/src/mergesort/bench.rs","rank":3,"score":215967.3935970734},{"content":"pub fn get_benches(runner: Option<&str>) -> Result<Vec<Benchmark>> {\n\n let (reg, _f) = Registry::from_disk()?;\n\n let benchmarks = reg.benches();\n\n\n\n info!(\"Found and parsed {} benchmarks.\", benchmarks.len());\n\n\n\n Ok(if let Some(r) = runner {\n\n let b = benchmarks\n\n .into_iter()\n\n .filter(|b| b.runner.as_ref().map(String::as_str) == runner)\n\n .collect::<Vec<_>>();\n\n\n\n info!(\n\n \"{} benchmarks assigned to the requested runner ({}).\",\n\n b.len(),\n\n r\n\n );\n\n\n\n b\n\n } else {\n\n benchmarks\n\n })\n\n}\n\n\n","file_path":"src/registry.rs","rank":4,"score":211405.51424658275},{"content":"pub fn generate_new_benchmark_crate(name: &str) -> Result<()> {\n\n let crate_dir = Path::new(env!(\"CARGO_MANIFEST_DIR\"))\n\n .join(\"benches\")\n\n .join(name);\n\n\n\n let manifest_path = crate_dir.join(\"Cargo.toml\");\n\n let src_dir = crate_dir.join(\"src\");\n\n let source_path = src_dir.join(\"lib.rs\");\n\n\n\n let manifest_contents = MANIFEST.replace(\"{{ crate_name }}\", name);\n\n\n\n use std::fs;\n\n fs::create_dir_all(&src_dir)?;\n\n fs::write(&manifest_path, &manifest_contents)?;\n\n fs::write(&source_path, LIB_RS)?;\n\n Ok(())\n\n}\n","file_path":"src/generator.rs","rank":5,"score":208740.71370389214},{"content":"pub fn bench<T, F>(trials: usize, f: F) -> Duration\n\nwhere\n\n F: Fn() -> T,\n\n{\n\n let mut benchmark = Benchmark::new();\n\n for _ in 0..trials {\n\n let mut timer = benchmark.start();\n\n let _keep = f();\n\n timer.stop();\n\n }\n\n benchmark.min_elapsed()\n\n}\n\n\n","file_path":"benches/json_benchmark_c7d3d9b/src/timer.rs","rank":6,"score":205126.42804453627},{"content":"pub fn seq_merge_sort<T: Ord + Copy>(v: &mut [T]) {\n\n let n = v.len();\n\n let mut buf = Vec::with_capacity(n);\n\n // We always overwrite the buffer before reading to it, and we want to\n\n // duplicate the behavior of parallel sort.\n\n unsafe {\n\n buf.set_len(n);\n\n }\n\n seq_sort(v, &mut buf[..]);\n\n}\n\n\n","file_path":"benches/rayon_1_0_0/src/mergesort/mod.rs","rank":7,"score":199479.20140446923},{"content":"pub fn is_sorted<T: Send + Ord>(v: &mut [T]) -> bool {\n\n let n = v.len();\n\n if n <= SORT_CHUNK {\n\n for i in 1..n {\n\n if v[i - 1] > v[i] {\n\n return false;\n\n }\n\n }\n\n return true;\n\n }\n\n\n\n let mid = n / 2;\n\n if v[mid - 1] > v[mid] {\n\n return false;\n\n }\n\n let (a, b) = v.split_at_mut(mid);\n\n let (left, right) = rayon::join(|| is_sorted(a), || is_sorted(b));\n\n return left && right;\n\n}\n\n\n","file_path":"benches/rayon_1_0_0/src/mergesort/mod.rs","rank":8,"score":198762.4596541265},{"content":"struct BenchmarkPassthrough<'a>(pub &'a mut lolbench_support::Bencher);\n\nimpl<'a> Runner for BenchmarkPassthrough<'a> {\n\n fn iter<Fn: FnMut()>(&mut self, cb: &mut Fn) {\n\n self.0.iter(cb)\n\n }\n\n}\n\n\n\nimpl UnlimitedBuffer {\n\n pub fn new(buf: &[u8]) -> Self {\n\n let mut ret = UnlimitedBuffer {\n\n data: Vec::<u8>::new(),\n\n read_offset: 0,\n\n };\n\n ret.data.extend(buf);\n\n return ret;\n\n }\n\n pub fn reset_read(&mut self) {\n\n self.read_offset = 0;\n\n }\n\n}\n","file_path":"benches/brotli_1_1_3/src/lib.rs","rank":9,"score":197992.3317169592},{"content":"pub fn merge_sort<T: Ord + Send + Copy>(v: &mut [T]) {\n\n let n = v.len();\n\n let mut buf = Vec::with_capacity(n);\n\n // We always overwrite the buffer before reading to it, and letting rust\n\n // initialize it would increase the critical path to O(n).\n\n unsafe {\n\n buf.set_len(n);\n\n }\n\n rsort(v, &mut buf[..]);\n\n}\n\n\n\n// Values from manual tuning gigasort on one machine.\n\nconst SORT_CHUNK: usize = 32 * 1024;\n\nconst MERGE_CHUNK: usize = 64 * 1024;\n\n\n","file_path":"benches/rayon_1_0_0/src/mergesort/mod.rs","rank":10,"score":195057.12078787107},{"content":"pub fn bench_with_buf<T, F>(trials: usize, len: usize, f: F) -> Duration\n\nwhere\n\n F: Fn(&mut Vec<u8>) -> T,\n\n{\n\n let mut benchmark = Benchmark::new();\n\n for _ in 0..trials {\n\n let mut buf = Vec::with_capacity(len);\n\n let mut timer = benchmark.start();\n\n let _keep = f(&mut buf);\n\n timer.stop();\n\n }\n\n benchmark.min_elapsed()\n\n}\n\n\n\npub struct Benchmark {\n\n min_elapsed: Option<Duration>,\n\n}\n\n\n\nimpl Benchmark {\n\n pub fn new() -> Self {\n","file_path":"benches/json_benchmark_c7d3d9b/src/timer.rs","rank":11,"score":189282.08879775862},{"content":"pub fn quick_sort<J: Joiner, T: PartialOrd + Send>(v: &mut [T]) {\n\n if v.len() <= 1 {\n\n return;\n\n }\n\n\n\n if J::is_parallel() && v.len() <= 5 * 1024 {\n\n return quick_sort::<Sequential, T>(v);\n\n }\n\n\n\n let mid = partition(v);\n\n let (lo, hi) = v.split_at_mut(mid);\n\n J::join(|| quick_sort::<J, T>(lo), || quick_sort::<J, T>(hi));\n\n}\n\n\n","file_path":"benches/rayon_1_0_0/src/quicksort/mod.rs","rank":12,"score":184383.8470332951},{"content":"fn read_utf8_file(path: &Path, into: &mut String) -> IoResult<()> {\n\n try!(File::open(path)).read_to_string(into).map(|_| ())\n\n}\n\n\n\nconst SAMPLER: Option<SamplerBehavior> = Some(SamplerBehavior {\n\n wrap_function: (\n\n SamplerWrapFunction::Repeat,\n\n SamplerWrapFunction::Repeat,\n\n SamplerWrapFunction::Repeat,\n\n ),\n\n minify_filter: MinifySamplerFilter::Nearest,\n\n magnify_filter: MagnifySamplerFilter::Nearest,\n\n max_anisotropy: 1,\n\n});\n\n\n\nconst PALETTE_SAMPLER: Option<SamplerBehavior> = Some(SamplerBehavior {\n\n wrap_function: (\n\n SamplerWrapFunction::Clamp,\n\n SamplerWrapFunction::Clamp,\n\n SamplerWrapFunction::Clamp,\n\n ),\n\n minify_filter: MinifySamplerFilter::Nearest,\n\n magnify_filter: MagnifySamplerFilter::Nearest,\n\n max_anisotropy: 1,\n\n});\n","file_path":"benches/doom_9e197d7/src/gfx/scene.rs","rank":13,"score":180457.73389847288},{"content":"fn lolbench_entrypoint(bench_path: &str) -> Result<String> {\n\n let bench_path = bench_path\n\n .replace(' ', \"\")\n\n .replace('\\t', \"\")\n\n .replace('\\n', \"\");\n\n\n\n let returned = Ok(format!(\n\n \"println!(\\\"entering lolbench-generated benchmark {}\\\");\",\n\n bench_path.trim()\n\n ));\n\n\n\n let crate_name = ::std::env::var(\"CARGO_PKG_NAME\")?;\n\n let manifest_dir = env::var(\"CARGO_MANIFEST_DIR\")?;\n\n\n\n let bin_name = slugify(bench_path.to_string());\n\n let source_name = format!(\"{}.rs\", bin_name);\n\n let full_path = Path::new(&manifest_dir)\n\n .join(\"src\")\n\n .join(\"bin\")\n\n .join(&source_name);\n\n\n\n let test_path = Path::new(&manifest_dir).join(\"tests\").join(&source_name);\n\n let test_source = test_source(&bench_path, &crate_name);\n\n\n\n Benchmark::new(&crate_name, &bench_path, &full_path).write_and_register(&full_path)?;\n\n write_if_changed(&test_source, &test_path)?;\n\n\n\n returned\n\n}\n","file_path":"extractor/src/lib.rs","rank":14,"score":174695.96141013608},{"content":"fn rustc_serialize_parse_struct<T>(bytes: &[u8]) -> rustc_serialize::json::DecodeResult<T>\n\nwhere\n\n T: rustc_serialize::Decodable,\n\n{\n\n use std::str;\n\n let s = str::from_utf8(bytes).unwrap();\n\n rustc_serialize::json::decode(s)\n\n}\n\n\n","file_path":"benches/json_benchmark_c7d3d9b/src/lib.rs","rank":15,"score":164918.77250301832},{"content":"// Merge sorted inputs a and b, putting result in dest.\n\n//\n\n// Note: `a` and `b` have type `&mut [T]` and not `&[T]` because we do\n\n// not want to require a `T: Sync` bound. Using `&mut` references\n\n// proves to the compiler that we are not sharing `a` and `b` across\n\n// threads and thus we only need a `T: Send` bound.\n\nfn rmerge<T: Ord + Send + Copy>(a: &mut [T], b: &mut [T], dest: &mut [T]) {\n\n // Swap so a is always longer.\n\n let (a, b) = if a.len() > b.len() { (a, b) } else { (b, a) };\n\n if dest.len() <= MERGE_CHUNK {\n\n seq_merge(a, b, dest);\n\n return;\n\n }\n\n\n\n // Find the middle element of the longer list, and\n\n // use binary search to find its location in the shorter list.\n\n let ma = a.len() / 2;\n\n let mb = match b.binary_search(&a[ma]) {\n\n Ok(i) => i,\n\n Err(i) => i,\n\n };\n\n\n\n let (a1, a2) = a.split_at_mut(ma);\n\n let (b1, b2) = b.split_at_mut(mb);\n\n let (d1, d2) = dest.split_at_mut(ma + mb);\n\n rayon::join(|| rmerge(a1, b1, d1), || rmerge(a2, b2, d2));\n\n}\n\n\n\n// Merges sorted a and b into sorted dest.\n","file_path":"benches/rayon_1_0_0/src/mergesort/mod.rs","rank":16,"score":160925.60821252313},{"content":"// Sort src, putting the result into dest.\n\nfn seq_sort_into<T: Ord + Copy>(src: &mut [T], dest: &mut [T]) {\n\n let mid = src.len() / 2;\n\n let (s1, s2) = src.split_at_mut(mid);\n\n {\n\n // Sort each half.\n\n let (d1, d2) = dest.split_at_mut(mid);\n\n seq_sort(s1, d1);\n\n seq_sort(s2, d2);\n\n }\n\n\n\n // Merge the halves into dest.\n\n seq_merge(s1, s2, dest);\n\n}\n\n\n","file_path":"benches/rayon_1_0_0/src/mergesort/mod.rs","rank":17,"score":160050.67733203853},{"content":"// Sort src, possibly making use of identically sized buf.\n\nfn seq_sort<T: Ord + Copy>(src: &mut [T], buf: &mut [T]) {\n\n if src.len() <= SORT_CHUNK {\n\n src.sort();\n\n return;\n\n }\n\n\n\n // Sort each half into half of the buffer.\n\n let mid = src.len() / 2;\n\n let (bufa, bufb) = buf.split_at_mut(mid);\n\n {\n\n let (sa, sb) = src.split_at_mut(mid);\n\n seq_sort_into(sa, bufa);\n\n seq_sort_into(sb, bufb);\n\n }\n\n\n\n // Merge the buffer halves back into the original.\n\n seq_merge(bufa, bufb, src);\n\n}\n\n\n","file_path":"benches/rayon_1_0_0/src/mergesort/mod.rs","rank":18,"score":160050.34636880222},{"content":"// Sort src, putting the result into dest.\n\nfn rsort_into<T: Ord + Send + Copy>(src: &mut [T], dest: &mut [T]) {\n\n let mid = src.len() / 2;\n\n let (s1, s2) = src.split_at_mut(mid);\n\n {\n\n // Sort each half.\n\n let (d1, d2) = dest.split_at_mut(mid);\n\n rayon::join(|| rsort(s1, d1), || rsort(s2, d2));\n\n }\n\n\n\n // Merge the halves into dest.\n\n rmerge(s1, s2, dest);\n\n}\n\n\n","file_path":"benches/rayon_1_0_0/src/mergesort/mod.rs","rank":19,"score":157250.5385414236},{"content":"// Sort src, possibly making use of identically sized buf.\n\nfn rsort<T: Ord + Send + Copy>(src: &mut [T], buf: &mut [T]) {\n\n if src.len() <= SORT_CHUNK {\n\n src.sort();\n\n return;\n\n }\n\n\n\n // Sort each half into half of the buffer.\n\n let mid = src.len() / 2;\n\n let (bufa, bufb) = buf.split_at_mut(mid);\n\n {\n\n let (sa, sb) = src.split_at_mut(mid);\n\n rayon::join(|| rsort_into(sa, bufa), || rsort_into(sb, bufb));\n\n }\n\n\n\n // Merge the buffer halves back into the original.\n\n rmerge(bufa, bufb, src);\n\n}\n\n\n","file_path":"benches/rayon_1_0_0/src/mergesort/mod.rs","rank":20,"score":157250.20757818726},{"content":"pub fn init() -> Result<Sdl2TtfContext, Error> {\n\n Ok(Sdl2TtfContext)\n\n}\n\n\n","file_path":"benches/doom_9e197d7/src/shims/sdl2_ttf/src/lib.rs","rank":21,"score":156618.68841819293},{"content":"#[derive(Debug, Serialize, Deserialize, PartialEq)]\n\nstruct GAMERowOwned(String, String, String, String, i32, String);\n\n\n","file_path":"benches/csv_1_0_2/src/lib.rs","rank":22,"score":155605.51403971858},{"content":"#[inline(always)]\n\nfn compress(input: &[u8], output: &mut [u8]) -> Result<usize> {\n\n Encoder::new().compress(input, output)\n\n}\n\n\n","file_path":"benches/snap_0_2_4/src/lib.rs","rank":23,"score":154793.77165995623},{"content":"#[inline(always)]\n\nfn decompress(input: &[u8], output: &mut [u8]) -> Result<usize> {\n\n Decoder::new().decompress(input, output)\n\n}\n\n\n\ncompress!(compress, zflat00_html, \"html\");\n\ncompress!(compress, zflat01_urls, \"urls.10K\");\n\ncompress!(compress, zflat02_jpg, \"fireworks.jpeg\");\n\ncompress!(compress, zflat03_jpg_200, \"fireworks.jpeg\", 200);\n\ncompress!(compress, zflat04_pdf, \"paper-100k.pdf\");\n\ncompress!(compress, zflat05_html4, \"html_x_4\");\n\ncompress!(compress, zflat06_txt1, \"alice29.txt\");\n\ncompress!(compress, zflat07_txt2, \"asyoulik.txt\");\n\ncompress!(compress, zflat08_txt3, \"lcet10.txt\");\n\ncompress!(compress, zflat09_txt4, \"plrabn12.txt\");\n\ncompress!(compress, zflat10_pb, \"geo.protodata\");\n\ncompress!(compress, zflat11_gaviota, \"kppkn.gtb\");\n\n\n\ndecompress!(decompress, uflat00_html, \"html\");\n\ndecompress!(decompress, uflat01_urls, \"urls.10K\");\n\ndecompress!(decompress, uflat02_jpg, \"fireworks.jpeg\");\n\ndecompress!(decompress, uflat03_jpg_200, \"fireworks.jpeg\", 200);\n\ndecompress!(decompress, uflat04_pdf, \"paper-100k.pdf\");\n\ndecompress!(decompress, uflat05_html4, \"html_x_4\");\n\ndecompress!(decompress, uflat06_txt1, \"alice29.txt\");\n\ndecompress!(decompress, uflat07_txt2, \"asyoulik.txt\");\n\ndecompress!(decompress, uflat08_txt3, \"lcet10.txt\");\n\ndecompress!(decompress, uflat09_txt4, \"plrabn12.txt\");\n\ndecompress!(decompress, uflat10_pb, \"geo.protodata\");\n\ndecompress!(decompress, uflat11_gaviota, \"kppkn.gtb\");\n","file_path":"benches/snap_0_2_4/src/lib.rs","rank":24,"score":154793.77165995623},{"content":"pub fn is_sorted<T: Send + Ord>(v: &[T]) -> bool {\n\n (1..v.len()).all(|i| v[i - 1] <= v[i])\n\n}\n\n\n","file_path":"benches/rayon_1_0_0/src/quicksort/mod.rs","rank":25,"score":154712.91307584563},{"content":"pub fn random_in_unit_sphere(rng: &mut XorShiftRng) -> Vec3 {\n\n loop {\n\n let p = 2.0 * rng.gen::<Vec3>() - Vec3(1.0, 1.0, 1.0);\n\n if p.dot(p) < 1.0 {\n\n return p;\n\n }\n\n }\n\n}\n\n\n","file_path":"benches/raytrace_8de9020/src/vec.rs","rank":26,"score":153770.81134947325},{"content":"pub fn random_in_unit_disc(rng: &mut XorShiftRng) -> Vec3 {\n\n loop {\n\n let p = Vec3(\n\n 2.0 * rng.gen::<f32>() - 1.0,\n\n 2.0 * rng.gen::<f32>() - 1.0,\n\n 0.0,\n\n );\n\n if p.dot(p) < 1.0 {\n\n return p;\n\n }\n\n }\n\n}\n\n\n\n#[derive(Clone, Copy, Debug)]\n\npub struct Ray {\n\n pub origin: Vec3,\n\n pub direction: Vec3,\n\n}\n\n\n\nimpl Ray {\n","file_path":"benches/raytrace_8de9020/src/vec.rs","rank":27,"score":153770.81134947325},{"content":"pub fn test_source(bench_name: &str, crate_name: &str) -> String {\n\n let source = quote! {\n\n extern crate lolbench;\n\n\n\n #[test]\n\n fn end_to_end() {\n\n lolbench::end_to_end_test(\n\n #crate_name,\n\n #bench_name,\n\n );\n\n }\n\n };\n\n\n\n source.to_string()\n\n}\n\n\n","file_path":"marky_mark/src/lib.rs","rank":28,"score":152644.63406784553},{"content":"fn partition<T: PartialOrd + Send>(v: &mut [T]) -> usize {\n\n let pivot = v.len() - 1;\n\n let mut i = 0;\n\n for j in 0..pivot {\n\n if v[j] <= v[pivot] {\n\n v.swap(i, j);\n\n i += 1;\n\n }\n\n }\n\n v.swap(i, pivot);\n\n i\n\n}\n\n\n","file_path":"benches/rayon_1_0_0/src/quicksort/mod.rs","rank":29,"score":152033.52398112504},{"content":"// Multiply two square power of two matrices, given in Z-order.\n\npub fn matmulz(a: &[f32], b: &[f32], dest: &mut [f32]) {\n\n if a.len() <= MULT_CHUNK {\n\n seq_matmulz(a, b, dest);\n\n return;\n\n }\n\n\n\n // Allocate uninitialized scratch space.\n\n let mut tmp = raw_buffer(dest.len());\n\n\n\n let (a1, a2, a3, a4) = quarter_chunks(a);\n\n let (b1, b2, b3, b4) = quarter_chunks(b);\n\n {\n\n let (d1, d2, d3, d4) = quarter_chunks_mut(dest);\n\n let (t1, t2, t3, t4) = quarter_chunks_mut(&mut tmp[..]);\n\n // Multiply 8 submatrices\n\n join8(\n\n || matmulz(a1, b1, d1),\n\n || matmulz(a1, b2, d2),\n\n || matmulz(a3, b1, d3),\n\n || matmulz(a3, b2, d4),\n","file_path":"benches/rayon_1_0_0/src/matmul/mod.rs","rank":30,"score":150940.18938764848},{"content":"#[inline(never)]\n\npub fn seq_matmulz(a: &[f32], b: &[f32], dest: &mut [f32]) {\n\n // All inputs need to be the same length.\n\n assert!(a.len() == b.len() && a.len() == dest.len());\n\n // Input matrices must be square with each side a power of 2.\n\n assert!(a.len().count_ones() == 1 && a.len().trailing_zeros() % 2 == 0);\n\n // Zero dest, as it may be uninitialized.\n\n for d in dest.iter_mut() {\n\n *d = 0.0;\n\n }\n\n\n\n // Multiply in morton order\n\n // D[i,j] = sum for all k A[i,k] * B[k,j]\n\n let n = dest.len();\n\n for ij in 0..n {\n\n let i = ij & 0xaaaaaaaa;\n\n let j = ij & 0x55555555;\n\n let mut sum = 0.0;\n\n for k in SplayedBitsCounter::new(n) {\n\n // sum += a[i, k] * b[k, j];\n\n sum += unsafe {\n","file_path":"benches/rayon_1_0_0/src/matmul/mod.rs","rank":31,"score":147994.95073193836},{"content":"pub fn matmul_strassen(a: &[f32], b: &[f32], dest: &mut [f32]) {\n\n if a.len() <= MULT_CHUNK {\n\n seq_matmulz(a, b, dest);\n\n return;\n\n }\n\n\n\n // Naming taken from https://en.wikipedia.org/wiki/Strassen_algorithm\n\n let (a11, a12, a21, a22) = quarter_chunks(a);\n\n let (b11, b12, b21, b22) = quarter_chunks(b);\n\n // 7 submatrix multiplies.\n\n // Maybe the tree should be leaning the other way...\n\n let (m1, m2, m3, m4, m5, m6, m7, _) = join8(\n\n || strassen_add2_mul(a11, a22, b11, b22),\n\n || strassen_add_mul(a21, a22, b11),\n\n || strassen_sub_mul(b12, b22, a11),\n\n || strassen_sub_mul(b21, b11, a22),\n\n || strassen_add_mul(a11, a12, b22),\n\n || strassen_sub_add_mul(a21, a11, b11, b12),\n\n || strassen_sub_add_mul(a12, a22, b21, b22),\n\n || (),\n","file_path":"benches/rayon_1_0_0/src/matmul/mod.rs","rank":32,"score":147994.95073193836},{"content":"// TODO: Investigate other cache patterns for row-major order that may be more\n\n// parallelizable.\n\n// https://tavianator.com/a-quick-trick-for-faster-naive-matrix-multiplication/\n\npub fn seq_matmul(a: &[f32], b: &[f32], dest: &mut [f32]) {\n\n // Zero dest, as it may be uninitialized.\n\n for d in dest.iter_mut() {\n\n *d = 0.0;\n\n }\n\n // Multiply in row-major order.\n\n // D[i,j] = sum for all k A[i,k] * B[k,j]\n\n let bits = dest.len().trailing_zeros() / 2;\n\n let n = 1 << bits;\n\n for i in 0..n {\n\n for j in 0..n {\n\n let mut sum = 0.0;\n\n for k in 0..n {\n\n sum += unsafe { a.get_unchecked(i << bits | k) * b.get_unchecked(k << bits | j) };\n\n }\n\n dest[i << bits | j] = sum;\n\n }\n\n }\n\n}\n\n\n","file_path":"benches/rayon_1_0_0/src/matmul/mod.rs","rank":33,"score":147994.95073193836},{"content":"pub fn write_if_changed(file_contents: &str, test_path: &Path) -> Result<bool> {\n\n let need_to_write = match read_to_string(&test_path) {\n\n Ok(existing) => existing != file_contents,\n\n _ => true,\n\n };\n\n\n\n if need_to_write {\n\n create_dir_all(test_path.parent().unwrap())?;\n\n write(&test_path, file_contents.as_bytes())?;\n\n }\n\n\n\n Ok(need_to_write)\n\n}\n\n\n\n#[derive(Clone, Debug, Deserialize, Serialize)]\n\npub struct Registry {\n\n pub workers: Vec<String>,\n\n pub benchmarks: BTreeMap<String, Benchmark>,\n\n}\n\n\n","file_path":"marky_mark/src/lib.rs","rank":34,"score":146250.4707041441},{"content":"fn main() -> Result<()> {\n\n simple_logger::init_with_level(log::Level::Debug).unwrap();\n\n Cli::from_args().exec()\n\n}\n\n\n","file_path":"src/main.rs","rank":35,"score":145731.29104261455},{"content":"pub fn init() -> SdlResult<Sdl> {\n\n Ok(Sdl)\n\n}\n\n\n\npub mod version {\n\n pub use std::fmt::{Display, Formatter, Result as FmtResult};\n\n\n\n pub struct Version(pub String);\n\n impl Display for Version {\n\n fn fmt(&self, fmt: &mut Formatter) -> FmtResult {\n\n write!(fmt, \"{}\", self.0)\n\n }\n\n }\n\n}\n\n\n\npub mod video {\n\n pub use super::*;\n\n\n\n pub enum GLProfile {\n\n Core,\n","file_path":"benches/doom_9e197d7/src/shims/sdl2/src/lib.rs","rank":36,"score":143865.9368692944},{"content":"type Result<T> = std::result::Result<T, failure::Error>;\n\n\n\nproc_macro_expr_impl! {\n\n /// Prepare and write to disk a single-function CLI entry-point for the passed benchmark fn.\n\n pub fn lolbench_entrypoint_impl(bench_path: &str) -> String {\n\n lolbench_entrypoint(bench_path).unwrap()\n\n }\n\n}\n\n\n","file_path":"extractor/src/lib.rs","rank":37,"score":143159.22718194965},{"content":"fn serde_json_parse_struct<'de, T>(bytes: &'de [u8]) -> serde_json::Result<T>\n\nwhere\n\n T: serde::Deserialize<'de>,\n\n{\n\n use std::str;\n\n let s = str::from_utf8(bytes).unwrap();\n\n serde_json::from_str(s)\n\n}\n\n\n","file_path":"benches/json_benchmark_c7d3d9b/src/lib.rs","rank":38,"score":142605.61659727228},{"content":"pub fn build_website(\n\n data_dir: impl AsRef<Path>,\n\n output_dir: impl AsRef<Path>,\n\n publish: bool,\n\n) -> Result<()> {\n\n info!(\"reading all estimates from the data directory...\");\n\n let data_storage = GitStore::ensure_initialized(data_dir.as_ref())?;\n\n let estimates = data_storage\n\n .all_stored_estimates()?\n\n .into_iter()\n\n .map(|(name, estimates)| {\n\n (\n\n name,\n\n estimates\n\n .into_iter()\n\n .filter_map(|(maybe_tc, ests)| maybe_tc.map(|tc| (tc, ests)))\n\n .collect(),\n\n )\n\n }).collect();\n\n\n","file_path":"src/website.rs","rank":39,"score":141390.06728842465},{"content":"pub fn normalized_against_first(\n\n values: impl IntoIterator<Item = R64>,\n\n) -> impl IntoIterator<Item = R64> {\n\n let mut values = values.into_iter();\n\n let first = values.next().unwrap();\n\n ::std::iter::once(r64(1.0)).chain(values.map(move |v| v / first))\n\n}\n\n\n\n#[derive(Clone, Debug, Eq, Ord, PartialEq, PartialOrd, Serialize)]\n\npub struct TimingRecord {\n\n pub binary_hash: String,\n\n pub toolchains: Vec<Toolchain>,\n\n pub anomaly_index: Option<AnomalyIndex>,\n\n pub metrics: RuntimeMetrics,\n\n pub normalized_metrics: RuntimeMetrics,\n\n}\n\n\n\nimpl TimingRecord {\n\n pub fn new(\n\n current_binhash: &[u8],\n","file_path":"src/analysis.rs","rank":40,"score":141390.06728842465},{"content":"pub fn exit_if_needed() {\n\n for signal in SIGNALS.pending() {\n\n match signal {\n\n SIGINT => {\n\n println!(\"received SIGINT, exiting\");\n\n ::std::process::exit(1);\n\n }\n\n SIGTERM => {\n\n println!(\"received SIGTERM, exiting\");\n\n ::std::process::exit(0);\n\n }\n\n sig => panic!(\"we didn't register for it but we received {}\", sig),\n\n }\n\n }\n\n}\n","file_path":"src/signal.rs","rank":41,"score":141390.06728842465},{"content":"type Result<T> = ::std::result::Result<T, failure::Error>;\n\n\n\nmacro_rules! ecx {\n\n ($ctx:expr, $inner:expr) => {\n\n $inner.with_context(|e| format!(concat!($ctx, \": {}\"), e))\n\n };\n\n}\n\n\n\n#[derive(Clone, Debug, Deserialize, Eq, PartialEq, PartialOrd, Ord, Serialize)]\n\npub struct Benchmark {\n\n #[serde(skip_serializing_if = \"Option::is_none\")]\n\n pub runner: Option<String>,\n\n pub name: String,\n\n #[serde(rename = \"crate\")]\n\n pub crate_name: String,\n\n pub entrypoint_path: PathBuf,\n\n}\n\n\n\nimpl Benchmark {\n\n pub fn new(crate_name: &str, name: &str, path: &Path) -> Self {\n","file_path":"marky_mark/src/lib.rs","rank":42,"score":141223.0361978968},{"content":"fn _write_all<OutputType>(w: &mut OutputType, buf: &[u8]) -> Result<(), io::Error>\n\nwhere\n\n OutputType: io::Write,\n\n{\n\n let mut total_written: usize = 0;\n\n while total_written < buf.len() {\n\n match w.write(&buf[total_written..]) {\n\n Err(e) => match e.kind() {\n\n io::ErrorKind::Interrupted => continue,\n\n _ => return Err(e),\n\n },\n\n Ok(cur_written) => {\n\n if cur_written == 0 {\n\n return Err(io::Error::new(io::ErrorKind::UnexpectedEof, \"Write EOF\"));\n\n }\n\n total_written += cur_written;\n\n }\n\n }\n\n }\n\n Ok(())\n\n}\n","file_path":"benches/brotli_1_1_3/src/lib.rs","rank":43,"score":140233.77090633023},{"content":"#[inline(never)]\n\nfn seq_merge<T: Ord + Copy>(a: &[T], b: &[T], dest: &mut [T]) {\n\n if b.is_empty() {\n\n dest.copy_from_slice(a);\n\n return;\n\n }\n\n let biggest = max(*a.last().unwrap(), *b.last().unwrap());\n\n let mut ai = a.iter();\n\n let mut an = *ai.next().unwrap();\n\n let mut bi = b.iter();\n\n let mut bn = *bi.next().unwrap();\n\n for d in dest.iter_mut() {\n\n if an < bn {\n\n *d = an;\n\n an = match ai.next() {\n\n Some(x) => *x,\n\n None => biggest,\n\n }\n\n } else {\n\n *d = bn;\n\n bn = match bi.next() {\n\n Some(x) => *x,\n\n None => biggest,\n\n }\n\n }\n\n }\n\n}\n\n\n","file_path":"benches/rayon_1_0_0/src/mergesort/mod.rs","rank":44,"score":137718.23164257157},{"content":"fn reallyhard2_suffix() -> String {\n\n \"Sherlock Holmes\".to_string()\n\n}\n\n\n\nmacro_rules! reallyhard2 {\n\n () => {\n\n r\"\\w+\\s+Holmes\"\n\n };\n\n}\n\n\n\nbench_match!(\n\n misc,\n\n reallyhard2_1K,\n\n reallyhard2!(),\n\n get_text(TXT_1K, reallyhard2_suffix())\n\n);\n\n\n\n//\n\n// Benchmarks to justify the short-haystack NFA fallthrough optimization\n\n// implemented by `read_captures_at` in regex/src/exec.rs. See github issue\n","file_path":"benches/regex_0_2_6/src/misc.rs","rank":45,"score":136300.51882641914},{"content":"fn medium_suffix() -> String {\n\n \"XABCDEFGHIJKLMNOPQRSTUVWXYZ\".to_string()\n\n}\n\n\n\nmacro_rules! medium {\n\n () => {\n\n r\"[XYZ]ABCDEFGHIJKLMNOPQRSTUVWXYZ$\"\n\n };\n\n}\n\n\n\nbench_match!(\n\n misc,\n\n medium_32,\n\n medium!(),\n\n get_text(TXT_32, medium_suffix())\n\n);\n\nbench_match!(\n\n misc,\n\n medium_1K,\n\n medium!(),\n","file_path":"benches/regex_0_2_6/src/misc.rs","rank":46,"score":136300.51882641914},{"content":"fn easy1_suffix() -> String {\n\n \"AABCCCDEEEFGGHHHIJJ\".to_string()\n\n}\n\n\n\nmacro_rules! easy1 {\n\n () => {\n\n r\"A[AB]B[BC]C[CD]D[DE]E[EF]F[FG]G[GH]H[HI]I[IJ]J$\"\n\n };\n\n}\n\n\n\nbench_match!(misc, easy1_32, easy1!(), get_text(TXT_32, easy1_suffix()));\n\nbench_match!(misc, easy1_1K, easy1!(), get_text(TXT_1K, easy1_suffix()));\n\nbench_match!(misc, easy1_32K, easy1!(), get_text(TXT_32K, easy1_suffix()));\n\nbench_match!(misc, easy1_1MB, easy1!(), get_text(TXT_1MB, easy1_suffix()));\n\n\n","file_path":"benches/regex_0_2_6/src/misc.rs","rank":47,"score":136300.51882641914},{"content":"fn easy0_suffix() -> String {\n\n \"ABCDEFGHIJKLMNOPQRSTUVWXYZ\".to_string()\n\n}\n\n\n\nmacro_rules! easy0 {\n\n () => {\n\n \"ABCDEFGHIJKLMNOPQRSTUVWXYZ$\"\n\n };\n\n}\n\n\n\nbench_match!(misc, easy0_32, easy0!(), get_text(TXT_32, easy0_suffix()));\n\nbench_match!(misc, easy0_1K, easy0!(), get_text(TXT_1K, easy0_suffix()));\n\nbench_match!(misc, easy0_32K, easy0!(), get_text(TXT_32K, easy0_suffix()));\n\nbench_match!(misc, easy0_1MB, easy0!(), get_text(TXT_1MB, easy0_suffix()));\n\n\n","file_path":"benches/regex_0_2_6/src/misc.rs","rank":48,"score":136300.51882641914},{"content":"fn hard_suffix() -> String {\n\n \"ABCDEFGHIJKLMNOPQRSTUVWXYZ\".to_string()\n\n}\n\n\n\nmacro_rules! hard {\n\n () => {\n\n r\"[ -~]*ABCDEFGHIJKLMNOPQRSTUVWXYZ$\"\n\n };\n\n}\n\n\n\nbench_match!(misc, hard_32, hard!(), get_text(TXT_32, hard_suffix()));\n\nbench_match!(misc, hard_1K, hard!(), get_text(TXT_1K, hard_suffix()));\n\nbench_match!(misc, hard_32K, hard!(), get_text(TXT_32K, hard_suffix()));\n\nbench_match!(misc, hard_1MB, hard!(), get_text(TXT_1MB, hard_suffix()));\n\n\n","file_path":"benches/regex_0_2_6/src/misc.rs","rank":49,"score":136300.51882641914},{"content":"fn reallyhard_suffix() -> String {\n\n \"ABCDEFGHIJKLMNOPQRSTUVWXYZ\".to_string()\n\n}\n\n\n\nmacro_rules! reallyhard {\n\n () => {\n\n // The point of this being \"really\" hard is that it should completely\n\n // thwart any prefix or suffix literal optimizations.\n\n r\"[ -~]*ABCDEFGHIJKLMNOPQRSTUVWXYZ.*\"\n\n };\n\n}\n\n\n\nbench_match!(\n\n misc,\n\n reallyhard_32,\n\n reallyhard!(),\n\n get_text(TXT_32, reallyhard_suffix())\n\n);\n\nbench_match!(\n\n misc,\n","file_path":"benches/regex_0_2_6/src/misc.rs","rank":50,"score":136300.51882641914},{"content":"pub fn measure(opts: BenchOpts, data_dir: &Path, site_dir: &Path, publish: bool) -> Result<()> {\n\n info!(\"ensuring data dir {} exists\", data_dir.display());\n\n let mut collector = Collector::new(data_dir, site_dir)?;\n\n\n\n info!(\"cataloging potential builds to run\");\n\n let candidates = opts.enumerate_bench_candidates()?;\n\n\n\n info!(\n\n \"{} possible toolchains to run to satisfy provided options, pruning...\",\n\n candidates.len()\n\n );\n\n\n\n let to_run = collector.compute_builds_needed(&candidates)?;\n\n\n\n info!(\"{} plans to run after pruning, running...\", to_run.len());\n\n\n\n for (toolchain, benches) in to_run.into_iter().rev() {\n\n info!(\"running {} benches with {}\", benches.len(), toolchain);\n\n if let Err(why) = collector.run_benches_with_toolchain(toolchain, &benches, publish) {\n\n warn!(\"problem running benchmarks: {}\", why);\n\n }\n\n }\n\n\n\n info!(\"all done!\");\n\n\n\n Ok(())\n\n}\n\n\n","file_path":"src/lib.rs","rank":51,"score":134966.77462166117},{"content":"fn rustc_serialize_parse_dom(\n\n mut bytes: &[u8],\n\n) -> Result<rustc_serialize::json::Json, rustc_serialize::json::BuilderError> {\n\n rustc_serialize::json::Json::from_reader(&mut bytes)\n\n}\n\n\n","file_path":"benches/json_benchmark_c7d3d9b/src/lib.rs","rank":52,"score":134835.42962447315},{"content":"fn get_text(corpus: &str, suffix: String) -> String {\n\n let mut corpus = corpus.to_string();\n\n corpus.push_str(&suffix);\n\n corpus\n\n}\n\n\n","file_path":"benches/regex_0_2_6/src/misc.rs","rank":53,"score":132653.05880068932},{"content":"fn read_sprites(wad: &Archive, textures: &mut BTreeMap<WadName, Image>) -> Result<usize> {\n\n let start_index = try!(wad.required_named_lump_index(b\"S_START\\0\")) + 1;\n\n let end_index = try!(wad.required_named_lump_index(b\"S_END\\0\\0\\0\"));\n\n info!(\"Reading {} sprites....\", end_index - start_index);\n\n let t0 = time::precise_time_s();\n\n for index in start_index..end_index {\n\n let name = *wad.lump_name(index);\n\n match Image::from_buffer(&try!(wad.read_lump(index))) {\n\n Ok(texture) => {\n\n textures.insert(name, texture);\n\n }\n\n Err(e) => {\n\n warn!(\"Skipping sprite: {}\", BadImage(name, e));\n\n continue;\n\n }\n\n }\n\n }\n\n let time = time::precise_time_s() - t0;\n\n info!(\"Done in {:.4}s.\", time);\n\n Ok(end_index - start_index)\n\n}\n\n\n","file_path":"benches/doom_9e197d7/src/wad/tex.rs","rank":54,"score":129077.97801356117},{"content":"fn gen_strings(len: usize) -> Vec<String> {\n\n let mut rng = XorShiftRng::from_seed([0, 1, 2, 3]);\n\n let mut v = vec![];\n\n for _ in 0..len {\n\n let n = rng.gen::<usize>() % 20 + 1;\n\n v.push(rng.gen_ascii_chars().take(n).collect());\n\n }\n\n v\n\n}\n\n\n","file_path":"benches/rayon_1_0_0/src/sort.rs","rank":55,"score":128017.80818087074},{"content":"pub fn connection() -> TestConnection {\n\n let result = connection_without_transaction();\n\n result.execute(\"PRAGMA foreign_keys = ON\").unwrap();\n\n result.begin_test_transaction().unwrap();\n\n result\n\n}\n\n\n\nembed_migrations!(\"migrations/sqlite\");\n\n\n","file_path":"benches/diesel_1_1_1/src/schema.rs","rank":56,"score":127362.23906199334},{"content":"fn count_deserialize_owned_bytes<R, D>(rdr: &mut Reader<R>) -> u64\n\n where R: io::Read, D: DeserializeOwned\n\n{\n\n let mut count = 0;\n\n let mut rec = ByteRecord::new();\n\n while rdr.read_byte_record(&mut rec).unwrap() {\n\n let _: D = rec.deserialize(None).unwrap();\n\n count += 1;\n\n }\n\n count\n\n}\n\n\n","file_path":"benches/csv_1_0_2/src/lib.rs","rank":57,"score":126688.41696351155},{"content":"fn count_deserialize_owned_str<R, D>(rdr: &mut Reader<R>) -> u64\n\n where R: io::Read, D: DeserializeOwned\n\n{\n\n let mut count = 0;\n\n for rec in rdr.deserialize::<D>() {\n\n let _ = rec.unwrap();\n\n count += 1;\n\n }\n\n count\n\n}\n\n\n","file_path":"benches/csv_1_0_2/src/lib.rs","rank":58,"score":126688.41696351155},{"content":"pub fn clear_error() {}\n\n\n\npub mod pixels {\n\n pub enum Color {\n\n RGBA(u8, u8, u8, u8),\n\n }\n\n\n\n pub enum PixelFormatEnum {\n\n ARGB8888,\n\n BGR24,\n\n }\n\n}\n\n\n\npub mod rect {\n\n use super::*;\n\n\n\n #[allow(unused)]\n\n pub struct Rect {\n\n x: Coord,\n\n y: Coord,\n","file_path":"benches/doom_9e197d7/src/shims/sdl2/src/lib.rs","rank":59,"score":125444.33030381786},{"content":"#[bench]\n\nfn float_bytes(b: &mut Bencher) {\n\n use nom::float;\n\n b.iter(|| float(&b\"-1.234E-12\"[..]));\n\n}\n\n\n","file_path":"benches/nom_4_0_0/src/json.rs","rank":60,"score":123272.3711254322},{"content":"#[bench]\n\nfn json_bench(b: &mut Bencher) {\n\n let data = &b\" { \\\"a\\\"\\t: 42,\n\n \\\"b\\\": [ \\\"x\\\", \\\"y\\\", 12 ] ,\n\n \\\"c\\\": { \\\"hello\\\" : \\\"world\\\"\n\n }\n\n } \\0\";\n\n\n\n //println!(\"data:\\n{:?}\", value(&data[..]));\n\n b.iter(|| value(&data[..]).unwrap());\n\n}\n\n\n","file_path":"benches/nom_4_0_0/src/json.rs","rank":61,"score":123272.3711254322},{"content":"fn one_test(b: &mut Bencher) {\n\n let data = &b\"GET / HTTP/1.1\n\n Host: www.reddit.com\n\n User-Agent: Mozilla/5.0 (Macintosh; Intel Mac OS X 10.8; rv:15.0) Gecko/20100101 Firefox/15.0.1\n\n Accept: text/html,application/xhtml+xml,application/xml;q=0.9,*/*;q=0.8\n\n Accept-Language: en-us,en;q=0.5\n\n Accept-Encoding: gzip, deflate\n\n Connection: keep-alive\"\n\n [..];\n\n b.iter(|| parse(data));\n\n}\n\n}\n","file_path":"benches/nom_4_0_0/src/http.rs","rank":62,"score":123272.3711254322},{"content":"#[bench]\n\nfn float_str(b: &mut Bencher) {\n\n use nom::float_s;\n\n b.iter(|| float_s(\"-1.234E-12\"));\n\n}\n","file_path":"benches/nom_4_0_0/src/json.rs","rank":63,"score":123272.3711254322},{"content":"fn sieve_bench<TICK>(b: &mut Bencher, mut tick: TICK)\n\nwhere\n\n TICK: FnMut(usize) -> Vec<bool>,\n\n{\n\n let mut result = vec![];\n\n b.iter(|| result = tick(super::max(MAGNITUDE)));\n\n let num_primes = 1 + result.into_iter().filter(|&b| b).count();\n\n assert_eq!(num_primes, NUM_PRIMES[MAGNITUDE]);\n\n}\n\n\n\nwrap_libtest! {\n\n sieve::bench,\n\n fn sieve_serial(b: &mut Bencher) {\n\n sieve_bench(b, super::sieve_serial);\n\n }\n\n}\n\n\n\nwrap_libtest! {\n\n sieve::bench,\n\n fn sieve_chunks(b: &mut Bencher) {\n","file_path":"benches/rayon_1_0_0/src/sieve/bench.rs","rank":64,"score":122562.32861173693},{"content":"fn nbody_bench<TICK>(b: &mut Bencher, mut tick: TICK)\n\nwhere\n\n TICK: FnMut(&mut NBodyBenchmark),\n\n{\n\n let mut rng = XorShiftRng::from_seed([0, 1, 2, 3]);\n\n let mut benchmark = NBodyBenchmark::new(BENCH_BODIES, &mut rng);\n\n b.iter(|| {\n\n for _ in 0..BENCH_TICKS {\n\n tick(&mut benchmark);\n\n }\n\n });\n\n}\n\n\n\nwrap_libtest! {\n\n nbody::bench,\n\n fn nbody_seq(b: &mut Bencher) {\n\n nbody_bench(b, |n| { n.tick_seq(); });\n\n }\n\n}\n\n\n","file_path":"benches/rayon_1_0_0/src/nbody/bench.rs","rank":65,"score":122562.32861173693},{"content":"pub fn connection_without_transaction() -> TestConnection {\n\n let connection = SqliteConnection::establish(\":memory:\").unwrap();\n\n embedded_migrations::run(&connection).unwrap();\n\n connection\n\n}\n\n\n\nsql_function!(_nextval, nextval_t, (a: types::VarChar) -> sql_types::BigInt);\n","file_path":"benches/diesel_1_1_1/src/schema.rs","rank":66,"score":122451.6177301991},{"content":"fn serde_json_parse_dom(bytes: &[u8]) -> serde_json::Result<serde_json::Value> {\n\n use std::str;\n\n let s = str::from_utf8(bytes).unwrap();\n\n serde_json::from_str(s)\n\n}\n\n\n","file_path":"benches/json_benchmark_c7d3d9b/src/lib.rs","rank":67,"score":122164.49929265317},{"content":"fn rustc_serialize_stringify<W, T: ?Sized>(\n\n writer: W,\n\n value: &T,\n\n) -> rustc_serialize::json::EncodeResult<()>\n\nwhere\n\n W: Write,\n\n T: rustc_serialize::Encodable,\n\n{\n\n let mut writer = adapter::IoWriteAsFmtWrite::new(writer);\n\n let mut encoder = rustc_serialize::json::Encoder::new(&mut writer);\n\n value.encode(&mut encoder)\n\n}\n","file_path":"benches/json_benchmark_c7d3d9b/src/lib.rs","rank":68,"score":120910.22955612472},{"content":"#[bench]\n\nfn recognize_float_bytes(b: &mut Bencher) {\n\n use nom::recognize_float;\n\n b.iter(|| recognize_float(&b\"-1.234E-12\"[..]));\n\n}\n\n\n","file_path":"benches/nom_4_0_0/src/json.rs","rank":69,"score":120732.36810535102},{"content":"#[bench]\n\nfn recognize_float_str(b: &mut Bencher) {\n\n use nom::recognize_float;\n\n b.iter(|| recognize_float(\"-1.234E-12\"));\n\n}\n\n\n","file_path":"benches/nom_4_0_0/src/json.rs","rank":70,"score":120732.36810535102},{"content":"struct SliceU8Ref<'a>(pub &'a [u8]);\n\n\n\nimpl<'a> fmt::LowerHex for SliceU8Ref<'a> {\n\n fn fmt(&self, fmtr: &mut fmt::Formatter) -> Result<(), fmt::Error> {\n\n for item in self.0 {\n\n try!(fmtr.write_fmt(format_args!(\"{:02x}\", item)));\n\n }\n\n Ok(())\n\n }\n\n}\n\n\n\nimpl<'a, OutputType: Write> brotli::CustomWrite<io::Error> for IoWriterWrapper<'a, OutputType> {\n\n fn flush(self: &mut Self) -> Result<(), io::Error> {\n\n loop {\n\n match self.0.flush() {\n\n Err(e) => match e.kind() {\n\n ErrorKind::Interrupted => continue,\n\n _ => return Err(e),\n\n },\n\n Ok(_) => return Ok(()),\n","file_path":"benches/brotli_1_1_3/src/lib.rs","rank":71,"score":120489.63335765319},{"content":"pub fn geometric_mean(values: &[R64]) -> R64 {\n\n values\n\n .iter()\n\n .fold(r64(1.0), |a_n, &a_n1| a_n * a_n1)\n\n .powf(r64(1.0 / values.len() as f64))\n\n}\n\n\n","file_path":"src/analysis.rs","rank":72,"score":119323.29685341167},{"content":"pub fn has_been_initialized() -> bool {\n\n true\n\n}\n\n\n\n#[derive(PartialEq)]\n\npub struct Font;\n\n\n\nimpl Drop for Font {\n\n fn drop(&mut self) {}\n\n}\n\n\n\npub enum Text<'a> {\n\n Latin1(&'a [u8]),\n\n Utf8(&'a str),\n\n Char(char),\n\n}\n\n\n\nimpl<'a> From<&'a str> for Text<'a> {\n\n fn from(string: &'a str) -> Text<'a> {\n\n Text::Utf8(string)\n","file_path":"benches/doom_9e197d7/src/shims/sdl2_ttf/src/lib.rs","rank":73,"score":118146.66883942173},{"content":"pub fn decompress<InputType, OutputType>(\n\n r: &mut InputType,\n\n w: &mut OutputType,\n\n buffer_size: usize,\n\n) -> Result<(), io::Error>\n\nwhere\n\n InputType: Read,\n\n OutputType: Write,\n\n{\n\n let mut alloc_u8 = HeapAllocator::<u8> { default_value: 0 };\n\n let mut input_buffer = alloc_u8.alloc_cell(buffer_size);\n\n let mut output_buffer = alloc_u8.alloc_cell(buffer_size);\n\n brotli::BrotliDecompressCustomIo(\n\n &mut IoReaderWrapper::<InputType>(r),\n\n &mut IoWriterWrapper::<OutputType>(w),\n\n input_buffer.slice_mut(),\n\n output_buffer.slice_mut(),\n\n alloc_u8,\n\n HeapAllocator::<u32> { default_value: 0 },\n\n HeapAllocator::<HuffmanCode> {\n\n default_value: HuffmanCode::default(),\n\n },\n\n Error::new(ErrorKind::UnexpectedEof, \"Unexpected EOF\"),\n\n )\n\n}\n\n\n","file_path":"benches/brotli_1_1_3/src/lib.rs","rank":74,"score":118099.8900920744},{"content":"pub fn compress<InputType, OutputType>(\n\n r: &mut InputType,\n\n w: &mut OutputType,\n\n buffer_size: usize,\n\n params: &brotli::enc::BrotliEncoderParams,\n\n) -> Result<usize, io::Error>\n\nwhere\n\n InputType: Read,\n\n OutputType: Write,\n\n{\n\n let mut alloc_u8 = HeapAllocator::<u8> { default_value: 0 };\n\n let mut input_buffer = alloc_u8.alloc_cell(buffer_size);\n\n let mut output_buffer = alloc_u8.alloc_cell(buffer_size);\n\n let mut log = |data: &[brotli::interface::Command<brotli::InputReference>]| {\n\n for cmd in data.iter() {\n\n write_one(cmd)\n\n }\n\n };\n\n if params.log_meta_block {\n\n println_stderr!(\"window {} 0 0 0\", params.lgwin);\n","file_path":"benches/brotli_1_1_3/src/lib.rs","rank":75,"score":118099.8900920744},{"content":"pub fn get_linked_version() -> Version {\n\n Version(\"ttf-shim\".to_owned())\n\n}\n\n\n\n#[derive(Debug)]\n\npub enum Error {}\n\n\n\nimpl std::error::Error for Error {\n\n fn description(&self) -> &str {\n\n \"ttf-shim-error-description\"\n\n }\n\n\n\n fn cause(&self) -> Option<&std::error::Error> {\n\n None\n\n }\n\n}\n\n\n\nimpl Display for Error {\n\n fn fmt(&self, fmt: &mut Formatter) -> FmtResult {\n\n write!(fmt, \"ttf-shim-error-display\")\n\n }\n\n}\n\n\n","file_path":"benches/doom_9e197d7/src/shims/sdl2_ttf/src/lib.rs","rank":76,"score":114341.8465684494},{"content":"fn color(mut r: Ray, model: &Model, rng: &mut XorShiftRng) -> Vec3 {\n\n const WHITE: Vec3 = Vec3(1.0, 1.0, 1.0);\n\n let sky_blue = 0.3 * Vec3(0.5, 0.7, 1.0) + 0.7 * WHITE;\n\n\n\n let mut attenuation = WHITE;\n\n let mut depth = 0;\n\n while let Some(hit) = model.hit(&r) {\n\n let scattered = hit.material.scatter(&r, &hit, rng);\n\n attenuation = attenuation * scattered.color;\n\n if let Some(bounce) = scattered.ray {\n\n r = bounce;\n\n } else {\n\n break;\n\n }\n\n\n\n depth += 1;\n\n if depth >= 50 {\n\n break;\n\n }\n\n }\n","file_path":"benches/raytrace_8de9020/src/render.rs","rank":77,"score":112952.12424750593},{"content":"extern crate lolbench ; # [ test ] fn end_to_end ( ) { lolbench :: end_to_end_test ( \"json_benchmark_c7d3d9b\" , \"serialize_citm_struct\" , ) ; }","file_path":"benches/json_benchmark_c7d3d9b/tests/serialize-citm-struct.rs","rank":78,"score":112579.35099311701},{"content":"extern crate lolbench ; # [ test ] fn end_to_end ( ) { lolbench :: end_to_end_test ( \"json_benchmark_c7d3d9b\" , \"serialize_twitter_struct\" , ) ; }","file_path":"benches/json_benchmark_c7d3d9b/tests/serialize-twitter-struct.rs","rank":79,"score":112579.35099311701},{"content":"extern crate lolbench ; # [ test ] fn end_to_end ( ) { lolbench :: end_to_end_test ( \"json_benchmark_c7d3d9b\" , \"serialize_canada_struct\" , ) ; }","file_path":"benches/json_benchmark_c7d3d9b/tests/serialize-canada-struct.rs","rank":80,"score":112579.35099311701},{"content":"fn points_to_polygon(points: &mut Vec<Vec2f>) {\n\n // Sort points in polygonal CCW order around their center.\n\n let center = polygon_center(points);\n\n points.sort_by(|a, b| {\n\n let ac = *a - center;\n\n let bc = *b - center;\n\n if ac[0] >= 0.0 && bc[0] < 0.0 {\n\n return Ordering::Less;\n\n }\n\n if ac[0] < 0.0 && bc[0] >= 0.0 {\n\n return Ordering::Greater;\n\n }\n\n if ac[0] == 0.0 && bc[0] == 0.0 {\n\n if ac[1] >= 0.0 || bc[1] >= 0.0 {\n\n return if a[1] > b[1] {\n\n Ordering::Less\n\n } else {\n\n Ordering::Greater\n\n };\n\n }\n","file_path":"benches/doom_9e197d7/src/wad/visitor.rs","rank":81,"score":110347.84245375593},{"content":"pub fn from_wad_height(x: WadCoord) -> f32 {\n\n (x as f32) / 100.0\n\n}\n\n\n","file_path":"benches/doom_9e197d7/src/wad/util.rs","rank":82,"score":110107.72663084006},{"content":"pub fn is_untextured(name: &WadName) -> bool {\n\n name[0] == b'-' && name[1] == b'\\0'\n\n}\n\n\n","file_path":"benches/doom_9e197d7/src/wad/util.rs","rank":83,"score":110107.72663084006},{"content":"fn rmatsub(src: &[f32], dest: &mut [f32]) {\n\n dest.par_iter_mut()\n\n .zip(src.par_iter())\n\n .for_each(|(d, s)| *d -= *s);\n\n}\n\n\n","file_path":"benches/rayon_1_0_0/src/matmul/mod.rs","rank":84,"score":109254.04536844068},{"content":"// Any layout works, we're just adding by element.\n\nfn rmatsum(src: &[f32], dest: &mut [f32]) {\n\n dest.par_iter_mut()\n\n .zip(src.par_iter())\n\n .for_each(|(d, s)| *d += *s);\n\n}\n\n\n","file_path":"benches/rayon_1_0_0/src/matmul/mod.rs","rank":85,"score":109254.04536844068},{"content":"fn rcopy(src: &[f32], dest: &mut [f32]) {\n\n if dest.len() <= LINEAR_CHUNK {\n\n dest.copy_from_slice(src);\n\n return;\n\n }\n\n\n\n let mid = dest.len() / 2;\n\n let (s1, s2) = src.split_at(mid);\n\n let (d1, d2) = dest.split_at_mut(mid);\n\n rayon::join(|| rcopy(s1, d1), || rcopy(s2, d2));\n\n}\n\n\n","file_path":"benches/rayon_1_0_0/src/matmul/mod.rs","rank":86,"score":109254.04536844068},{"content":"pub fn is_sky_flat(name: &WadName) -> bool {\n\n name == b\"F_SKY1\\0\\0\"\n\n}\n\n\n","file_path":"benches/doom_9e197d7/src/wad/util.rs","rank":87,"score":108148.40967659061},{"content":"fn main() {\n\n println!(\"========================== decode | encode ===\");\n\n\n\n #[cfg(feature = \"file-canada\")]\n\n bench_file! {\n\n path: \"data/canada.json\",\n\n structure: canada::Canada,\n\n }\n\n\n\n #[cfg(feature = \"file-citm-catalog\")]\n\n bench_file! {\n\n path: \"data/citm_catalog.json\",\n\n structure: citm_catalog::CitmCatalog,\n\n }\n\n\n\n #[cfg(feature = \"file-twitter\")]\n\n bench_file! {\n\n path: \"data/twitter.json\",\n\n structure: twitter::Twitter,\n\n }\n\n}\n\n\n","file_path":"benches/json_benchmark_c7d3d9b/src/binary.rs","rank":88,"score":107260.61212803473},{"content":"pub fn end_to_end_test(crate_name: &str, bench_name: &str) {\n\n let bench_source_name = format!(\"{}.rs\", slugify(bench_name));\n\n\n\n let _ = simple_logger::init();\n\n\n\n let entrypoint_path = Path::new(\"benches\")\n\n .join(crate_name)\n\n .join(\"src\")\n\n .join(\"bin\")\n\n .join(bench_source_name);\n\n\n\n let source_path = Path::new(env!(\"CARGO_MANIFEST_DIR\")).join(&entrypoint_path);\n\n let plan = RunPlan::new(\n\n Benchmark {\n\n runner: None,\n\n name: String::from(bench_name),\n\n crate_name: String::from(crate_name),\n\n entrypoint_path,\n\n },\n\n Some(CriterionConfig {\n","file_path":"src/lib.rs","rank":89,"score":106943.6142262768},{"content":"#[test]\n\nfn test_color() {\n\n let mut buf: [u8; 6] = unsafe { ::std::mem::uninitialized() };\n\n let string = Color(0xA0A0A0).as_str(&mut buf);\n\n assert_eq!(string, \"A0A0A0\");\n\n}\n","file_path":"benches/json_benchmark_c7d3d9b/src/color.rs","rank":90,"score":104546.98822800412},{"content":"/// Generate a Model containing a bunch of randomly placed spheres.\n\nfn random_scene(rng: &mut XorShiftRng) -> Box<Model> {\n\n let mut spheres: Vec<Sphere> = vec![\n\n Sphere {\n\n center: Vec3(0.0, 0.0, -1000.0),\n\n radius: 1000.0,\n\n material: Box::new(Lambertian {\n\n albedo: Vec3(1.0, 0.6, 0.5),\n\n }),\n\n },\n\n Sphere {\n\n center: Vec3(-4.0, 0.0, 2.0),\n\n radius: 2.0,\n\n material: Box::new(Lambertian {\n\n albedo: Vec3(0.6, 0.2, 0.2),\n\n }),\n\n },\n\n Sphere {\n\n center: Vec3(0.0, 0.0, 2.0),\n\n radius: 2.0,\n\n material: Box::new(Dielectric { index: 1.5 }),\n","file_path":"benches/raytrace_8de9020/src/lib.rs","rank":91,"score":103362.29489496411},{"content":"struct IoWriterWrapper<'a, OutputType: Write + 'a>(&'a mut OutputType);\n\n\n","file_path":"benches/brotli_1_1_3/src/lib.rs","rank":92,"score":103081.08376812904},{"content":"struct IoReaderWrapper<'a, OutputType: Read + 'a>(&'a mut OutputType);\n\n\n\nmacro_rules! println_stderr(\n\n ($($val:tt)*) => { {\n\n writeln!(&mut ::std::io::stderr(), $($val)*).unwrap();\n\n } }\n\n);\n\n\n","file_path":"benches/brotli_1_1_3/src/lib.rs","rank":93,"score":103081.08376812904},{"content":"fn strassen_sum(a: &[f32], b: &[f32], dest: &mut [f32]) {\n\n rcopy(a, dest);\n\n rmatsum(b, dest);\n\n}\n\n\n","file_path":"benches/rayon_1_0_0/src/matmul/mod.rs","rank":94,"score":101996.19949846648},{"content":"fn quarter_chunks_mut<'a>(\n\n v: &'a mut [f32],\n\n) -> (&'a mut [f32], &'a mut [f32], &'a mut [f32], &'a mut [f32]) {\n\n let mid = v.len() / 2;\n\n let quarter = mid / 2;\n\n let (left, right) = v.split_at_mut(mid);\n\n let (a, b) = left.split_at_mut(quarter);\n\n let (c, d) = right.split_at_mut(quarter);\n\n (a, b, c, d)\n\n}\n\n\n","file_path":"benches/rayon_1_0_0/src/matmul/mod.rs","rank":95,"score":101882.50192927764},{"content":"pub fn parse_child_id(id: ChildId) -> (usize, bool) {\n\n ((id & 0x7fff) as usize, id & 0x8000 != 0)\n\n}\n","file_path":"benches/doom_9e197d7/src/wad/util.rs","rank":96,"score":101397.4616260739},{"content":"pub fn from_wad_coords(x: WadCoord, y: WadCoord) -> Vec2f {\n\n Vec2::new(-from_wad_height(x), from_wad_height(y))\n\n}\n\n\n","file_path":"benches/doom_9e197d7/src/wad/util.rs","rank":97,"score":100393.83687665939},{"content":"fn clear_stride(slice: &mut [bool], from: usize, stride: usize) {\n\n let slice = &mut slice[from..];\n\n for x in StrideMut::from_slice(slice, stride as isize) {\n\n *x = false;\n\n }\n\n}\n","file_path":"benches/rayon_1_0_0/src/sieve/mod.rs","rank":98,"score":100035.90549399421},{"content":"pub fn solid<T>(foreground: T) -> RenderMode\n\nwhere\n\n T: Into<Color>,\n\n{\n\n RenderMode::Solid {\n\n foreground: foreground.into(),\n\n }\n\n}\n\n\n","file_path":"benches/doom_9e197d7/src/shims/sdl2_ttf/src/lib.rs","rank":99,"score":99751.72770944922}],"string":"[\n {\n \"content\": \"fn most_covered_toolchains_runtimes(data_dir: impl AsRef<Path>) -> Result<Vec<(R64, String)>> {\\n\\n info!(\\\"finding all existing estimates\\\");\\n\\n let estimates = GitStore::ensure_initialized(data_dir)?.all_stored_estimates()?;\\n\\n\\n\\n info!(\\\"reorganizing them by toolchain\\\");\\n\\n let mut by_toolchain = BTreeMap::new();\\n\\n for (bench_key, toolchains) in estimates {\\n\\n for (toolchain, estimate) in toolchains {\\n\\n by_toolchain\\n\\n .entry(toolchain)\\n\\n .or_insert_with(BTreeMap::new)\\n\\n .insert(bench_key.clone(), estimate);\\n\\n }\\n\\n }\\n\\n\\n\\n let mut lens = by_toolchain\\n\\n .iter()\\n\\n .map(|(tc, by_bench)| (tc, by_bench.len()))\\n\\n .collect::<Vec<_>>();\\n\\n lens.sort();\\n\",\n \"file_path\": \"src/registry.rs\",\n \"rank\": 0,\n \"score\": 227281.4841318139\n },\n {\n \"content\": \"pub fn rebalance(sample_data_dir: impl AsRef<Path>) -> Result<()> {\\n\\n let (mut registry, _) = Registry::from_disk()?;\\n\\n let runners = registry.runners().to_owned();\\n\\n\\n\\n // fill the minheap with runners and 0 scores\\n\\n let mut weights = Vec::from_iter(runners.iter().map(|r| (r64(0.0), r.clone())));\\n\\n // also create a mapping of benchmark assignments\\n\\n let mut new_assignments: BTreeMap<String, Vec<String>> = BTreeMap::new();\\n\\n let runners_by_bench_key = registry\\n\\n .benches()\\n\\n .into_iter()\\n\\n .filter_map(|b| {\\n\\n let bench_key = format!(\\\"{}::{}\\\", b.crate_name, b.name);\\n\\n b.runner.map(|r| (bench_key, r))\\n\\n }).collect::<BTreeMap<String, String>>();\\n\\n\\n\\n for (ns, bench_key) in most_covered_toolchains_runtimes(sample_data_dir)? {\\n\\n if let Some(assigned) = runners_by_bench_key.get(&bench_key) {\\n\\n // this has already been assigned, so we just need to track its runtime\\n\\n weights\\n\",\n \"file_path\": \"src/registry.rs\",\n \"rank\": 1,\n \"score\": 216835.91909350664\n },\n {\n \"content\": \"fn bench_harness<F: FnMut(&mut [u32])>(mut f: F, b: &mut Bencher) {\\n\\n let base_vec = super::default_vec(BENCH_SIZE);\\n\\n let mut sort_vec = vec![];\\n\\n b.iter(|| {\\n\\n sort_vec = base_vec.clone();\\n\\n f(&mut sort_vec);\\n\\n });\\n\\n assert!(super::is_sorted(&mut sort_vec));\\n\\n}\\n\\n\\n\\nwrap_libtest! {\\n\\n quicksort::bench,\\n\\n fn quick_sort_par_bench(b: &mut Bencher) {\\n\\n bench_harness(super::quick_sort::<Parallel, u32>, b);\\n\\n }\\n\\n}\\n\\n\\n\\nwrap_libtest! {\\n\\n quicksort::bench,\\n\\n fn quick_sort_seq_bench(b: &mut Bencher) {\\n\",\n \"file_path\": \"benches/rayon_1_0_0/src/quicksort/bench.rs\",\n \"rank\": 2,\n \"score\": 215967.3935970734\n },\n {\n \"content\": \"fn bench_harness<F: FnMut(&mut [u32])>(mut f: F, b: &mut Bencher) {\\n\\n let base_vec = super::default_vec(BENCH_SIZE);\\n\\n let mut sort_vec = vec![];\\n\\n b.iter(|| {\\n\\n sort_vec = base_vec.clone();\\n\\n f(&mut sort_vec);\\n\\n });\\n\\n assert!(super::is_sorted(&mut sort_vec));\\n\\n}\\n\\n\\n\\nwrap_libtest! {\\n\\n mergesort::bench,\\n\\n fn merge_sort_par_bench(b: &mut Bencher) {\\n\\n bench_harness(super::merge_sort, b);\\n\\n }\\n\\n}\\n\\n\\n\\nwrap_libtest! {\\n\\n mergesort::bench,\\n\\n fn merge_sort_seq_bench(b: &mut Bencher) {\\n\\n bench_harness(super::seq_merge_sort, b);\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"benches/rayon_1_0_0/src/mergesort/bench.rs\",\n \"rank\": 3,\n \"score\": 215967.3935970734\n },\n {\n \"content\": \"pub fn get_benches(runner: Option<&str>) -> Result<Vec<Benchmark>> {\\n\\n let (reg, _f) = Registry::from_disk()?;\\n\\n let benchmarks = reg.benches();\\n\\n\\n\\n info!(\\\"Found and parsed {} benchmarks.\\\", benchmarks.len());\\n\\n\\n\\n Ok(if let Some(r) = runner {\\n\\n let b = benchmarks\\n\\n .into_iter()\\n\\n .filter(|b| b.runner.as_ref().map(String::as_str) == runner)\\n\\n .collect::<Vec<_>>();\\n\\n\\n\\n info!(\\n\\n \\\"{} benchmarks assigned to the requested runner ({}).\\\",\\n\\n b.len(),\\n\\n r\\n\\n );\\n\\n\\n\\n b\\n\\n } else {\\n\\n benchmarks\\n\\n })\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/registry.rs\",\n \"rank\": 4,\n \"score\": 211405.51424658275\n },\n {\n \"content\": \"pub fn generate_new_benchmark_crate(name: &str) -> Result<()> {\\n\\n let crate_dir = Path::new(env!(\\\"CARGO_MANIFEST_DIR\\\"))\\n\\n .join(\\\"benches\\\")\\n\\n .join(name);\\n\\n\\n\\n let manifest_path = crate_dir.join(\\\"Cargo.toml\\\");\\n\\n let src_dir = crate_dir.join(\\\"src\\\");\\n\\n let source_path = src_dir.join(\\\"lib.rs\\\");\\n\\n\\n\\n let manifest_contents = MANIFEST.replace(\\\"{{ crate_name }}\\\", name);\\n\\n\\n\\n use std::fs;\\n\\n fs::create_dir_all(&src_dir)?;\\n\\n fs::write(&manifest_path, &manifest_contents)?;\\n\\n fs::write(&source_path, LIB_RS)?;\\n\\n Ok(())\\n\\n}\\n\",\n \"file_path\": \"src/generator.rs\",\n \"rank\": 5,\n \"score\": 208740.71370389214\n },\n {\n \"content\": \"pub fn bench<T, F>(trials: usize, f: F) -> Duration\\n\\nwhere\\n\\n F: Fn() -> T,\\n\\n{\\n\\n let mut benchmark = Benchmark::new();\\n\\n for _ in 0..trials {\\n\\n let mut timer = benchmark.start();\\n\\n let _keep = f();\\n\\n timer.stop();\\n\\n }\\n\\n benchmark.min_elapsed()\\n\\n}\\n\\n\\n\",\n \"file_path\": \"benches/json_benchmark_c7d3d9b/src/timer.rs\",\n \"rank\": 6,\n \"score\": 205126.42804453627\n },\n {\n \"content\": \"pub fn seq_merge_sort<T: Ord + Copy>(v: &mut [T]) {\\n\\n let n = v.len();\\n\\n let mut buf = Vec::with_capacity(n);\\n\\n // We always overwrite the buffer before reading to it, and we want to\\n\\n // duplicate the behavior of parallel sort.\\n\\n unsafe {\\n\\n buf.set_len(n);\\n\\n }\\n\\n seq_sort(v, &mut buf[..]);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"benches/rayon_1_0_0/src/mergesort/mod.rs\",\n \"rank\": 7,\n \"score\": 199479.20140446923\n },\n {\n \"content\": \"pub fn is_sorted<T: Send + Ord>(v: &mut [T]) -> bool {\\n\\n let n = v.len();\\n\\n if n <= SORT_CHUNK {\\n\\n for i in 1..n {\\n\\n if v[i - 1] > v[i] {\\n\\n return false;\\n\\n }\\n\\n }\\n\\n return true;\\n\\n }\\n\\n\\n\\n let mid = n / 2;\\n\\n if v[mid - 1] > v[mid] {\\n\\n return false;\\n\\n }\\n\\n let (a, b) = v.split_at_mut(mid);\\n\\n let (left, right) = rayon::join(|| is_sorted(a), || is_sorted(b));\\n\\n return left && right;\\n\\n}\\n\\n\\n\",\n \"file_path\": \"benches/rayon_1_0_0/src/mergesort/mod.rs\",\n \"rank\": 8,\n \"score\": 198762.4596541265\n },\n {\n \"content\": \"struct BenchmarkPassthrough<'a>(pub &'a mut lolbench_support::Bencher);\\n\\nimpl<'a> Runner for BenchmarkPassthrough<'a> {\\n\\n fn iter<Fn: FnMut()>(&mut self, cb: &mut Fn) {\\n\\n self.0.iter(cb)\\n\\n }\\n\\n}\\n\\n\\n\\nimpl UnlimitedBuffer {\\n\\n pub fn new(buf: &[u8]) -> Self {\\n\\n let mut ret = UnlimitedBuffer {\\n\\n data: Vec::<u8>::new(),\\n\\n read_offset: 0,\\n\\n };\\n\\n ret.data.extend(buf);\\n\\n return ret;\\n\\n }\\n\\n pub fn reset_read(&mut self) {\\n\\n self.read_offset = 0;\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"benches/brotli_1_1_3/src/lib.rs\",\n \"rank\": 9,\n \"score\": 197992.3317169592\n },\n {\n \"content\": \"pub fn merge_sort<T: Ord + Send + Copy>(v: &mut [T]) {\\n\\n let n = v.len();\\n\\n let mut buf = Vec::with_capacity(n);\\n\\n // We always overwrite the buffer before reading to it, and letting rust\\n\\n // initialize it would increase the critical path to O(n).\\n\\n unsafe {\\n\\n buf.set_len(n);\\n\\n }\\n\\n rsort(v, &mut buf[..]);\\n\\n}\\n\\n\\n\\n// Values from manual tuning gigasort on one machine.\\n\\nconst SORT_CHUNK: usize = 32 * 1024;\\n\\nconst MERGE_CHUNK: usize = 64 * 1024;\\n\\n\\n\",\n \"file_path\": \"benches/rayon_1_0_0/src/mergesort/mod.rs\",\n \"rank\": 10,\n \"score\": 195057.12078787107\n },\n {\n \"content\": \"pub fn bench_with_buf<T, F>(trials: usize, len: usize, f: F) -> Duration\\n\\nwhere\\n\\n F: Fn(&mut Vec<u8>) -> T,\\n\\n{\\n\\n let mut benchmark = Benchmark::new();\\n\\n for _ in 0..trials {\\n\\n let mut buf = Vec::with_capacity(len);\\n\\n let mut timer = benchmark.start();\\n\\n let _keep = f(&mut buf);\\n\\n timer.stop();\\n\\n }\\n\\n benchmark.min_elapsed()\\n\\n}\\n\\n\\n\\npub struct Benchmark {\\n\\n min_elapsed: Option<Duration>,\\n\\n}\\n\\n\\n\\nimpl Benchmark {\\n\\n pub fn new() -> Self {\\n\",\n \"file_path\": \"benches/json_benchmark_c7d3d9b/src/timer.rs\",\n \"rank\": 11,\n \"score\": 189282.08879775862\n },\n {\n \"content\": \"pub fn quick_sort<J: Joiner, T: PartialOrd + Send>(v: &mut [T]) {\\n\\n if v.len() <= 1 {\\n\\n return;\\n\\n }\\n\\n\\n\\n if J::is_parallel() && v.len() <= 5 * 1024 {\\n\\n return quick_sort::<Sequential, T>(v);\\n\\n }\\n\\n\\n\\n let mid = partition(v);\\n\\n let (lo, hi) = v.split_at_mut(mid);\\n\\n J::join(|| quick_sort::<J, T>(lo), || quick_sort::<J, T>(hi));\\n\\n}\\n\\n\\n\",\n \"file_path\": \"benches/rayon_1_0_0/src/quicksort/mod.rs\",\n \"rank\": 12,\n \"score\": 184383.8470332951\n },\n {\n \"content\": \"fn read_utf8_file(path: &Path, into: &mut String) -> IoResult<()> {\\n\\n try!(File::open(path)).read_to_string(into).map(|_| ())\\n\\n}\\n\\n\\n\\nconst SAMPLER: Option<SamplerBehavior> = Some(SamplerBehavior {\\n\\n wrap_function: (\\n\\n SamplerWrapFunction::Repeat,\\n\\n SamplerWrapFunction::Repeat,\\n\\n SamplerWrapFunction::Repeat,\\n\\n ),\\n\\n minify_filter: MinifySamplerFilter::Nearest,\\n\\n magnify_filter: MagnifySamplerFilter::Nearest,\\n\\n max_anisotropy: 1,\\n\\n});\\n\\n\\n\\nconst PALETTE_SAMPLER: Option<SamplerBehavior> = Some(SamplerBehavior {\\n\\n wrap_function: (\\n\\n SamplerWrapFunction::Clamp,\\n\\n SamplerWrapFunction::Clamp,\\n\\n SamplerWrapFunction::Clamp,\\n\\n ),\\n\\n minify_filter: MinifySamplerFilter::Nearest,\\n\\n magnify_filter: MagnifySamplerFilter::Nearest,\\n\\n max_anisotropy: 1,\\n\\n});\\n\",\n \"file_path\": \"benches/doom_9e197d7/src/gfx/scene.rs\",\n \"rank\": 13,\n \"score\": 180457.73389847288\n },\n {\n \"content\": \"fn lolbench_entrypoint(bench_path: &str) -> Result<String> {\\n\\n let bench_path = bench_path\\n\\n .replace(' ', \\\"\\\")\\n\\n .replace('\\\\t', \\\"\\\")\\n\\n .replace('\\\\n', \\\"\\\");\\n\\n\\n\\n let returned = Ok(format!(\\n\\n \\\"println!(\\\\\\\"entering lolbench-generated benchmark {}\\\\\\\");\\\",\\n\\n bench_path.trim()\\n\\n ));\\n\\n\\n\\n let crate_name = ::std::env::var(\\\"CARGO_PKG_NAME\\\")?;\\n\\n let manifest_dir = env::var(\\\"CARGO_MANIFEST_DIR\\\")?;\\n\\n\\n\\n let bin_name = slugify(bench_path.to_string());\\n\\n let source_name = format!(\\\"{}.rs\\\", bin_name);\\n\\n let full_path = Path::new(&manifest_dir)\\n\\n .join(\\\"src\\\")\\n\\n .join(\\\"bin\\\")\\n\\n .join(&source_name);\\n\\n\\n\\n let test_path = Path::new(&manifest_dir).join(\\\"tests\\\").join(&source_name);\\n\\n let test_source = test_source(&bench_path, &crate_name);\\n\\n\\n\\n Benchmark::new(&crate_name, &bench_path, &full_path).write_and_register(&full_path)?;\\n\\n write_if_changed(&test_source, &test_path)?;\\n\\n\\n\\n returned\\n\\n}\\n\",\n \"file_path\": \"extractor/src/lib.rs\",\n \"rank\": 14,\n \"score\": 174695.96141013608\n },\n {\n \"content\": \"fn rustc_serialize_parse_struct<T>(bytes: &[u8]) -> rustc_serialize::json::DecodeResult<T>\\n\\nwhere\\n\\n T: rustc_serialize::Decodable,\\n\\n{\\n\\n use std::str;\\n\\n let s = str::from_utf8(bytes).unwrap();\\n\\n rustc_serialize::json::decode(s)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"benches/json_benchmark_c7d3d9b/src/lib.rs\",\n \"rank\": 15,\n \"score\": 164918.77250301832\n },\n {\n \"content\": \"// Merge sorted inputs a and b, putting result in dest.\\n\\n//\\n\\n// Note: `a` and `b` have type `&mut [T]` and not `&[T]` because we do\\n\\n// not want to require a `T: Sync` bound. Using `&mut` references\\n\\n// proves to the compiler that we are not sharing `a` and `b` across\\n\\n// threads and thus we only need a `T: Send` bound.\\n\\nfn rmerge<T: Ord + Send + Copy>(a: &mut [T], b: &mut [T], dest: &mut [T]) {\\n\\n // Swap so a is always longer.\\n\\n let (a, b) = if a.len() > b.len() { (a, b) } else { (b, a) };\\n\\n if dest.len() <= MERGE_CHUNK {\\n\\n seq_merge(a, b, dest);\\n\\n return;\\n\\n }\\n\\n\\n\\n // Find the middle element of the longer list, and\\n\\n // use binary search to find its location in the shorter list.\\n\\n let ma = a.len() / 2;\\n\\n let mb = match b.binary_search(&a[ma]) {\\n\\n Ok(i) => i,\\n\\n Err(i) => i,\\n\\n };\\n\\n\\n\\n let (a1, a2) = a.split_at_mut(ma);\\n\\n let (b1, b2) = b.split_at_mut(mb);\\n\\n let (d1, d2) = dest.split_at_mut(ma + mb);\\n\\n rayon::join(|| rmerge(a1, b1, d1), || rmerge(a2, b2, d2));\\n\\n}\\n\\n\\n\\n// Merges sorted a and b into sorted dest.\\n\",\n \"file_path\": \"benches/rayon_1_0_0/src/mergesort/mod.rs\",\n \"rank\": 16,\n \"score\": 160925.60821252313\n },\n {\n \"content\": \"// Sort src, putting the result into dest.\\n\\nfn seq_sort_into<T: Ord + Copy>(src: &mut [T], dest: &mut [T]) {\\n\\n let mid = src.len() / 2;\\n\\n let (s1, s2) = src.split_at_mut(mid);\\n\\n {\\n\\n // Sort each half.\\n\\n let (d1, d2) = dest.split_at_mut(mid);\\n\\n seq_sort(s1, d1);\\n\\n seq_sort(s2, d2);\\n\\n }\\n\\n\\n\\n // Merge the halves into dest.\\n\\n seq_merge(s1, s2, dest);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"benches/rayon_1_0_0/src/mergesort/mod.rs\",\n \"rank\": 17,\n \"score\": 160050.67733203853\n },\n {\n \"content\": \"// Sort src, possibly making use of identically sized buf.\\n\\nfn seq_sort<T: Ord + Copy>(src: &mut [T], buf: &mut [T]) {\\n\\n if src.len() <= SORT_CHUNK {\\n\\n src.sort();\\n\\n return;\\n\\n }\\n\\n\\n\\n // Sort each half into half of the buffer.\\n\\n let mid = src.len() / 2;\\n\\n let (bufa, bufb) = buf.split_at_mut(mid);\\n\\n {\\n\\n let (sa, sb) = src.split_at_mut(mid);\\n\\n seq_sort_into(sa, bufa);\\n\\n seq_sort_into(sb, bufb);\\n\\n }\\n\\n\\n\\n // Merge the buffer halves back into the original.\\n\\n seq_merge(bufa, bufb, src);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"benches/rayon_1_0_0/src/mergesort/mod.rs\",\n \"rank\": 18,\n \"score\": 160050.34636880222\n },\n {\n \"content\": \"// Sort src, putting the result into dest.\\n\\nfn rsort_into<T: Ord + Send + Copy>(src: &mut [T], dest: &mut [T]) {\\n\\n let mid = src.len() / 2;\\n\\n let (s1, s2) = src.split_at_mut(mid);\\n\\n {\\n\\n // Sort each half.\\n\\n let (d1, d2) = dest.split_at_mut(mid);\\n\\n rayon::join(|| rsort(s1, d1), || rsort(s2, d2));\\n\\n }\\n\\n\\n\\n // Merge the halves into dest.\\n\\n rmerge(s1, s2, dest);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"benches/rayon_1_0_0/src/mergesort/mod.rs\",\n \"rank\": 19,\n \"score\": 157250.5385414236\n },\n {\n \"content\": \"// Sort src, possibly making use of identically sized buf.\\n\\nfn rsort<T: Ord + Send + Copy>(src: &mut [T], buf: &mut [T]) {\\n\\n if src.len() <= SORT_CHUNK {\\n\\n src.sort();\\n\\n return;\\n\\n }\\n\\n\\n\\n // Sort each half into half of the buffer.\\n\\n let mid = src.len() / 2;\\n\\n let (bufa, bufb) = buf.split_at_mut(mid);\\n\\n {\\n\\n let (sa, sb) = src.split_at_mut(mid);\\n\\n rayon::join(|| rsort_into(sa, bufa), || rsort_into(sb, bufb));\\n\\n }\\n\\n\\n\\n // Merge the buffer halves back into the original.\\n\\n rmerge(bufa, bufb, src);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"benches/rayon_1_0_0/src/mergesort/mod.rs\",\n \"rank\": 20,\n \"score\": 157250.20757818726\n },\n {\n \"content\": \"pub fn init() -> Result<Sdl2TtfContext, Error> {\\n\\n Ok(Sdl2TtfContext)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"benches/doom_9e197d7/src/shims/sdl2_ttf/src/lib.rs\",\n \"rank\": 21,\n \"score\": 156618.68841819293\n },\n {\n \"content\": \"#[derive(Debug, Serialize, Deserialize, PartialEq)]\\n\\nstruct GAMERowOwned(String, String, String, String, i32, String);\\n\\n\\n\",\n \"file_path\": \"benches/csv_1_0_2/src/lib.rs\",\n \"rank\": 22,\n \"score\": 155605.51403971858\n },\n {\n \"content\": \"#[inline(always)]\\n\\nfn compress(input: &[u8], output: &mut [u8]) -> Result<usize> {\\n\\n Encoder::new().compress(input, output)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"benches/snap_0_2_4/src/lib.rs\",\n \"rank\": 23,\n \"score\": 154793.77165995623\n },\n {\n \"content\": \"#[inline(always)]\\n\\nfn decompress(input: &[u8], output: &mut [u8]) -> Result<usize> {\\n\\n Decoder::new().decompress(input, output)\\n\\n}\\n\\n\\n\\ncompress!(compress, zflat00_html, \\\"html\\\");\\n\\ncompress!(compress, zflat01_urls, \\\"urls.10K\\\");\\n\\ncompress!(compress, zflat02_jpg, \\\"fireworks.jpeg\\\");\\n\\ncompress!(compress, zflat03_jpg_200, \\\"fireworks.jpeg\\\", 200);\\n\\ncompress!(compress, zflat04_pdf, \\\"paper-100k.pdf\\\");\\n\\ncompress!(compress, zflat05_html4, \\\"html_x_4\\\");\\n\\ncompress!(compress, zflat06_txt1, \\\"alice29.txt\\\");\\n\\ncompress!(compress, zflat07_txt2, \\\"asyoulik.txt\\\");\\n\\ncompress!(compress, zflat08_txt3, \\\"lcet10.txt\\\");\\n\\ncompress!(compress, zflat09_txt4, \\\"plrabn12.txt\\\");\\n\\ncompress!(compress, zflat10_pb, \\\"geo.protodata\\\");\\n\\ncompress!(compress, zflat11_gaviota, \\\"kppkn.gtb\\\");\\n\\n\\n\\ndecompress!(decompress, uflat00_html, \\\"html\\\");\\n\\ndecompress!(decompress, uflat01_urls, \\\"urls.10K\\\");\\n\\ndecompress!(decompress, uflat02_jpg, \\\"fireworks.jpeg\\\");\\n\\ndecompress!(decompress, uflat03_jpg_200, \\\"fireworks.jpeg\\\", 200);\\n\\ndecompress!(decompress, uflat04_pdf, \\\"paper-100k.pdf\\\");\\n\\ndecompress!(decompress, uflat05_html4, \\\"html_x_4\\\");\\n\\ndecompress!(decompress, uflat06_txt1, \\\"alice29.txt\\\");\\n\\ndecompress!(decompress, uflat07_txt2, \\\"asyoulik.txt\\\");\\n\\ndecompress!(decompress, uflat08_txt3, \\\"lcet10.txt\\\");\\n\\ndecompress!(decompress, uflat09_txt4, \\\"plrabn12.txt\\\");\\n\\ndecompress!(decompress, uflat10_pb, \\\"geo.protodata\\\");\\n\\ndecompress!(decompress, uflat11_gaviota, \\\"kppkn.gtb\\\");\\n\",\n \"file_path\": \"benches/snap_0_2_4/src/lib.rs\",\n \"rank\": 24,\n \"score\": 154793.77165995623\n },\n {\n \"content\": \"pub fn is_sorted<T: Send + Ord>(v: &[T]) -> bool {\\n\\n (1..v.len()).all(|i| v[i - 1] <= v[i])\\n\\n}\\n\\n\\n\",\n \"file_path\": \"benches/rayon_1_0_0/src/quicksort/mod.rs\",\n \"rank\": 25,\n \"score\": 154712.91307584563\n },\n {\n \"content\": \"pub fn random_in_unit_sphere(rng: &mut XorShiftRng) -> Vec3 {\\n\\n loop {\\n\\n let p = 2.0 * rng.gen::<Vec3>() - Vec3(1.0, 1.0, 1.0);\\n\\n if p.dot(p) < 1.0 {\\n\\n return p;\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"benches/raytrace_8de9020/src/vec.rs\",\n \"rank\": 26,\n \"score\": 153770.81134947325\n },\n {\n \"content\": \"pub fn random_in_unit_disc(rng: &mut XorShiftRng) -> Vec3 {\\n\\n loop {\\n\\n let p = Vec3(\\n\\n 2.0 * rng.gen::<f32>() - 1.0,\\n\\n 2.0 * rng.gen::<f32>() - 1.0,\\n\\n 0.0,\\n\\n );\\n\\n if p.dot(p) < 1.0 {\\n\\n return p;\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\n#[derive(Clone, Copy, Debug)]\\n\\npub struct Ray {\\n\\n pub origin: Vec3,\\n\\n pub direction: Vec3,\\n\\n}\\n\\n\\n\\nimpl Ray {\\n\",\n \"file_path\": \"benches/raytrace_8de9020/src/vec.rs\",\n \"rank\": 27,\n \"score\": 153770.81134947325\n },\n {\n \"content\": \"pub fn test_source(bench_name: &str, crate_name: &str) -> String {\\n\\n let source = quote! {\\n\\n extern crate lolbench;\\n\\n\\n\\n #[test]\\n\\n fn end_to_end() {\\n\\n lolbench::end_to_end_test(\\n\\n #crate_name,\\n\\n #bench_name,\\n\\n );\\n\\n }\\n\\n };\\n\\n\\n\\n source.to_string()\\n\\n}\\n\\n\\n\",\n \"file_path\": \"marky_mark/src/lib.rs\",\n \"rank\": 28,\n \"score\": 152644.63406784553\n },\n {\n \"content\": \"fn partition<T: PartialOrd + Send>(v: &mut [T]) -> usize {\\n\\n let pivot = v.len() - 1;\\n\\n let mut i = 0;\\n\\n for j in 0..pivot {\\n\\n if v[j] <= v[pivot] {\\n\\n v.swap(i, j);\\n\\n i += 1;\\n\\n }\\n\\n }\\n\\n v.swap(i, pivot);\\n\\n i\\n\\n}\\n\\n\\n\",\n \"file_path\": \"benches/rayon_1_0_0/src/quicksort/mod.rs\",\n \"rank\": 29,\n \"score\": 152033.52398112504\n },\n {\n \"content\": \"// Multiply two square power of two matrices, given in Z-order.\\n\\npub fn matmulz(a: &[f32], b: &[f32], dest: &mut [f32]) {\\n\\n if a.len() <= MULT_CHUNK {\\n\\n seq_matmulz(a, b, dest);\\n\\n return;\\n\\n }\\n\\n\\n\\n // Allocate uninitialized scratch space.\\n\\n let mut tmp = raw_buffer(dest.len());\\n\\n\\n\\n let (a1, a2, a3, a4) = quarter_chunks(a);\\n\\n let (b1, b2, b3, b4) = quarter_chunks(b);\\n\\n {\\n\\n let (d1, d2, d3, d4) = quarter_chunks_mut(dest);\\n\\n let (t1, t2, t3, t4) = quarter_chunks_mut(&mut tmp[..]);\\n\\n // Multiply 8 submatrices\\n\\n join8(\\n\\n || matmulz(a1, b1, d1),\\n\\n || matmulz(a1, b2, d2),\\n\\n || matmulz(a3, b1, d3),\\n\\n || matmulz(a3, b2, d4),\\n\",\n \"file_path\": \"benches/rayon_1_0_0/src/matmul/mod.rs\",\n \"rank\": 30,\n \"score\": 150940.18938764848\n },\n {\n \"content\": \"#[inline(never)]\\n\\npub fn seq_matmulz(a: &[f32], b: &[f32], dest: &mut [f32]) {\\n\\n // All inputs need to be the same length.\\n\\n assert!(a.len() == b.len() && a.len() == dest.len());\\n\\n // Input matrices must be square with each side a power of 2.\\n\\n assert!(a.len().count_ones() == 1 && a.len().trailing_zeros() % 2 == 0);\\n\\n // Zero dest, as it may be uninitialized.\\n\\n for d in dest.iter_mut() {\\n\\n *d = 0.0;\\n\\n }\\n\\n\\n\\n // Multiply in morton order\\n\\n // D[i,j] = sum for all k A[i,k] * B[k,j]\\n\\n let n = dest.len();\\n\\n for ij in 0..n {\\n\\n let i = ij & 0xaaaaaaaa;\\n\\n let j = ij & 0x55555555;\\n\\n let mut sum = 0.0;\\n\\n for k in SplayedBitsCounter::new(n) {\\n\\n // sum += a[i, k] * b[k, j];\\n\\n sum += unsafe {\\n\",\n \"file_path\": \"benches/rayon_1_0_0/src/matmul/mod.rs\",\n \"rank\": 31,\n \"score\": 147994.95073193836\n },\n {\n \"content\": \"pub fn matmul_strassen(a: &[f32], b: &[f32], dest: &mut [f32]) {\\n\\n if a.len() <= MULT_CHUNK {\\n\\n seq_matmulz(a, b, dest);\\n\\n return;\\n\\n }\\n\\n\\n\\n // Naming taken from https://en.wikipedia.org/wiki/Strassen_algorithm\\n\\n let (a11, a12, a21, a22) = quarter_chunks(a);\\n\\n let (b11, b12, b21, b22) = quarter_chunks(b);\\n\\n // 7 submatrix multiplies.\\n\\n // Maybe the tree should be leaning the other way...\\n\\n let (m1, m2, m3, m4, m5, m6, m7, _) = join8(\\n\\n || strassen_add2_mul(a11, a22, b11, b22),\\n\\n || strassen_add_mul(a21, a22, b11),\\n\\n || strassen_sub_mul(b12, b22, a11),\\n\\n || strassen_sub_mul(b21, b11, a22),\\n\\n || strassen_add_mul(a11, a12, b22),\\n\\n || strassen_sub_add_mul(a21, a11, b11, b12),\\n\\n || strassen_sub_add_mul(a12, a22, b21, b22),\\n\\n || (),\\n\",\n \"file_path\": \"benches/rayon_1_0_0/src/matmul/mod.rs\",\n \"rank\": 32,\n \"score\": 147994.95073193836\n },\n {\n \"content\": \"// TODO: Investigate other cache patterns for row-major order that may be more\\n\\n// parallelizable.\\n\\n// https://tavianator.com/a-quick-trick-for-faster-naive-matrix-multiplication/\\n\\npub fn seq_matmul(a: &[f32], b: &[f32], dest: &mut [f32]) {\\n\\n // Zero dest, as it may be uninitialized.\\n\\n for d in dest.iter_mut() {\\n\\n *d = 0.0;\\n\\n }\\n\\n // Multiply in row-major order.\\n\\n // D[i,j] = sum for all k A[i,k] * B[k,j]\\n\\n let bits = dest.len().trailing_zeros() / 2;\\n\\n let n = 1 << bits;\\n\\n for i in 0..n {\\n\\n for j in 0..n {\\n\\n let mut sum = 0.0;\\n\\n for k in 0..n {\\n\\n sum += unsafe { a.get_unchecked(i << bits | k) * b.get_unchecked(k << bits | j) };\\n\\n }\\n\\n dest[i << bits | j] = sum;\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"benches/rayon_1_0_0/src/matmul/mod.rs\",\n \"rank\": 33,\n \"score\": 147994.95073193836\n },\n {\n \"content\": \"pub fn write_if_changed(file_contents: &str, test_path: &Path) -> Result<bool> {\\n\\n let need_to_write = match read_to_string(&test_path) {\\n\\n Ok(existing) => existing != file_contents,\\n\\n _ => true,\\n\\n };\\n\\n\\n\\n if need_to_write {\\n\\n create_dir_all(test_path.parent().unwrap())?;\\n\\n write(&test_path, file_contents.as_bytes())?;\\n\\n }\\n\\n\\n\\n Ok(need_to_write)\\n\\n}\\n\\n\\n\\n#[derive(Clone, Debug, Deserialize, Serialize)]\\n\\npub struct Registry {\\n\\n pub workers: Vec<String>,\\n\\n pub benchmarks: BTreeMap<String, Benchmark>,\\n\\n}\\n\\n\\n\",\n \"file_path\": \"marky_mark/src/lib.rs\",\n \"rank\": 34,\n \"score\": 146250.4707041441\n },\n {\n \"content\": \"fn main() -> Result<()> {\\n\\n simple_logger::init_with_level(log::Level::Debug).unwrap();\\n\\n Cli::from_args().exec()\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/main.rs\",\n \"rank\": 35,\n \"score\": 145731.29104261455\n },\n {\n \"content\": \"pub fn init() -> SdlResult<Sdl> {\\n\\n Ok(Sdl)\\n\\n}\\n\\n\\n\\npub mod version {\\n\\n pub use std::fmt::{Display, Formatter, Result as FmtResult};\\n\\n\\n\\n pub struct Version(pub String);\\n\\n impl Display for Version {\\n\\n fn fmt(&self, fmt: &mut Formatter) -> FmtResult {\\n\\n write!(fmt, \\\"{}\\\", self.0)\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\npub mod video {\\n\\n pub use super::*;\\n\\n\\n\\n pub enum GLProfile {\\n\\n Core,\\n\",\n \"file_path\": \"benches/doom_9e197d7/src/shims/sdl2/src/lib.rs\",\n \"rank\": 36,\n \"score\": 143865.9368692944\n },\n {\n \"content\": \"type Result<T> = std::result::Result<T, failure::Error>;\\n\\n\\n\\nproc_macro_expr_impl! {\\n\\n /// Prepare and write to disk a single-function CLI entry-point for the passed benchmark fn.\\n\\n pub fn lolbench_entrypoint_impl(bench_path: &str) -> String {\\n\\n lolbench_entrypoint(bench_path).unwrap()\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"extractor/src/lib.rs\",\n \"rank\": 37,\n \"score\": 143159.22718194965\n },\n {\n \"content\": \"fn serde_json_parse_struct<'de, T>(bytes: &'de [u8]) -> serde_json::Result<T>\\n\\nwhere\\n\\n T: serde::Deserialize<'de>,\\n\\n{\\n\\n use std::str;\\n\\n let s = str::from_utf8(bytes).unwrap();\\n\\n serde_json::from_str(s)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"benches/json_benchmark_c7d3d9b/src/lib.rs\",\n \"rank\": 38,\n \"score\": 142605.61659727228\n },\n {\n \"content\": \"pub fn build_website(\\n\\n data_dir: impl AsRef<Path>,\\n\\n output_dir: impl AsRef<Path>,\\n\\n publish: bool,\\n\\n) -> Result<()> {\\n\\n info!(\\\"reading all estimates from the data directory...\\\");\\n\\n let data_storage = GitStore::ensure_initialized(data_dir.as_ref())?;\\n\\n let estimates = data_storage\\n\\n .all_stored_estimates()?\\n\\n .into_iter()\\n\\n .map(|(name, estimates)| {\\n\\n (\\n\\n name,\\n\\n estimates\\n\\n .into_iter()\\n\\n .filter_map(|(maybe_tc, ests)| maybe_tc.map(|tc| (tc, ests)))\\n\\n .collect(),\\n\\n )\\n\\n }).collect();\\n\\n\\n\",\n \"file_path\": \"src/website.rs\",\n \"rank\": 39,\n \"score\": 141390.06728842465\n },\n {\n \"content\": \"pub fn normalized_against_first(\\n\\n values: impl IntoIterator<Item = R64>,\\n\\n) -> impl IntoIterator<Item = R64> {\\n\\n let mut values = values.into_iter();\\n\\n let first = values.next().unwrap();\\n\\n ::std::iter::once(r64(1.0)).chain(values.map(move |v| v / first))\\n\\n}\\n\\n\\n\\n#[derive(Clone, Debug, Eq, Ord, PartialEq, PartialOrd, Serialize)]\\n\\npub struct TimingRecord {\\n\\n pub binary_hash: String,\\n\\n pub toolchains: Vec<Toolchain>,\\n\\n pub anomaly_index: Option<AnomalyIndex>,\\n\\n pub metrics: RuntimeMetrics,\\n\\n pub normalized_metrics: RuntimeMetrics,\\n\\n}\\n\\n\\n\\nimpl TimingRecord {\\n\\n pub fn new(\\n\\n current_binhash: &[u8],\\n\",\n \"file_path\": \"src/analysis.rs\",\n \"rank\": 40,\n \"score\": 141390.06728842465\n },\n {\n \"content\": \"pub fn exit_if_needed() {\\n\\n for signal in SIGNALS.pending() {\\n\\n match signal {\\n\\n SIGINT => {\\n\\n println!(\\\"received SIGINT, exiting\\\");\\n\\n ::std::process::exit(1);\\n\\n }\\n\\n SIGTERM => {\\n\\n println!(\\\"received SIGTERM, exiting\\\");\\n\\n ::std::process::exit(0);\\n\\n }\\n\\n sig => panic!(\\\"we didn't register for it but we received {}\\\", sig),\\n\\n }\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/signal.rs\",\n \"rank\": 41,\n \"score\": 141390.06728842465\n },\n {\n \"content\": \"type Result<T> = ::std::result::Result<T, failure::Error>;\\n\\n\\n\\nmacro_rules! ecx {\\n\\n ($ctx:expr, $inner:expr) => {\\n\\n $inner.with_context(|e| format!(concat!($ctx, \\\": {}\\\"), e))\\n\\n };\\n\\n}\\n\\n\\n\\n#[derive(Clone, Debug, Deserialize, Eq, PartialEq, PartialOrd, Ord, Serialize)]\\n\\npub struct Benchmark {\\n\\n #[serde(skip_serializing_if = \\\"Option::is_none\\\")]\\n\\n pub runner: Option<String>,\\n\\n pub name: String,\\n\\n #[serde(rename = \\\"crate\\\")]\\n\\n pub crate_name: String,\\n\\n pub entrypoint_path: PathBuf,\\n\\n}\\n\\n\\n\\nimpl Benchmark {\\n\\n pub fn new(crate_name: &str, name: &str, path: &Path) -> Self {\\n\",\n \"file_path\": \"marky_mark/src/lib.rs\",\n \"rank\": 42,\n \"score\": 141223.0361978968\n },\n {\n \"content\": \"fn _write_all<OutputType>(w: &mut OutputType, buf: &[u8]) -> Result<(), io::Error>\\n\\nwhere\\n\\n OutputType: io::Write,\\n\\n{\\n\\n let mut total_written: usize = 0;\\n\\n while total_written < buf.len() {\\n\\n match w.write(&buf[total_written..]) {\\n\\n Err(e) => match e.kind() {\\n\\n io::ErrorKind::Interrupted => continue,\\n\\n _ => return Err(e),\\n\\n },\\n\\n Ok(cur_written) => {\\n\\n if cur_written == 0 {\\n\\n return Err(io::Error::new(io::ErrorKind::UnexpectedEof, \\\"Write EOF\\\"));\\n\\n }\\n\\n total_written += cur_written;\\n\\n }\\n\\n }\\n\\n }\\n\\n Ok(())\\n\\n}\\n\",\n \"file_path\": \"benches/brotli_1_1_3/src/lib.rs\",\n \"rank\": 43,\n \"score\": 140233.77090633023\n },\n {\n \"content\": \"#[inline(never)]\\n\\nfn seq_merge<T: Ord + Copy>(a: &[T], b: &[T], dest: &mut [T]) {\\n\\n if b.is_empty() {\\n\\n dest.copy_from_slice(a);\\n\\n return;\\n\\n }\\n\\n let biggest = max(*a.last().unwrap(), *b.last().unwrap());\\n\\n let mut ai = a.iter();\\n\\n let mut an = *ai.next().unwrap();\\n\\n let mut bi = b.iter();\\n\\n let mut bn = *bi.next().unwrap();\\n\\n for d in dest.iter_mut() {\\n\\n if an < bn {\\n\\n *d = an;\\n\\n an = match ai.next() {\\n\\n Some(x) => *x,\\n\\n None => biggest,\\n\\n }\\n\\n } else {\\n\\n *d = bn;\\n\\n bn = match bi.next() {\\n\\n Some(x) => *x,\\n\\n None => biggest,\\n\\n }\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"benches/rayon_1_0_0/src/mergesort/mod.rs\",\n \"rank\": 44,\n \"score\": 137718.23164257157\n },\n {\n \"content\": \"fn reallyhard2_suffix() -> String {\\n\\n \\\"Sherlock Holmes\\\".to_string()\\n\\n}\\n\\n\\n\\nmacro_rules! reallyhard2 {\\n\\n () => {\\n\\n r\\\"\\\\w+\\\\s+Holmes\\\"\\n\\n };\\n\\n}\\n\\n\\n\\nbench_match!(\\n\\n misc,\\n\\n reallyhard2_1K,\\n\\n reallyhard2!(),\\n\\n get_text(TXT_1K, reallyhard2_suffix())\\n\\n);\\n\\n\\n\\n//\\n\\n// Benchmarks to justify the short-haystack NFA fallthrough optimization\\n\\n// implemented by `read_captures_at` in regex/src/exec.rs. See github issue\\n\",\n \"file_path\": \"benches/regex_0_2_6/src/misc.rs\",\n \"rank\": 45,\n \"score\": 136300.51882641914\n },\n {\n \"content\": \"fn medium_suffix() -> String {\\n\\n \\\"XABCDEFGHIJKLMNOPQRSTUVWXYZ\\\".to_string()\\n\\n}\\n\\n\\n\\nmacro_rules! medium {\\n\\n () => {\\n\\n r\\\"[XYZ]ABCDEFGHIJKLMNOPQRSTUVWXYZ$\\\"\\n\\n };\\n\\n}\\n\\n\\n\\nbench_match!(\\n\\n misc,\\n\\n medium_32,\\n\\n medium!(),\\n\\n get_text(TXT_32, medium_suffix())\\n\\n);\\n\\nbench_match!(\\n\\n misc,\\n\\n medium_1K,\\n\\n medium!(),\\n\",\n \"file_path\": \"benches/regex_0_2_6/src/misc.rs\",\n \"rank\": 46,\n \"score\": 136300.51882641914\n },\n {\n \"content\": \"fn easy1_suffix() -> String {\\n\\n \\\"AABCCCDEEEFGGHHHIJJ\\\".to_string()\\n\\n}\\n\\n\\n\\nmacro_rules! easy1 {\\n\\n () => {\\n\\n r\\\"A[AB]B[BC]C[CD]D[DE]E[EF]F[FG]G[GH]H[HI]I[IJ]J$\\\"\\n\\n };\\n\\n}\\n\\n\\n\\nbench_match!(misc, easy1_32, easy1!(), get_text(TXT_32, easy1_suffix()));\\n\\nbench_match!(misc, easy1_1K, easy1!(), get_text(TXT_1K, easy1_suffix()));\\n\\nbench_match!(misc, easy1_32K, easy1!(), get_text(TXT_32K, easy1_suffix()));\\n\\nbench_match!(misc, easy1_1MB, easy1!(), get_text(TXT_1MB, easy1_suffix()));\\n\\n\\n\",\n \"file_path\": \"benches/regex_0_2_6/src/misc.rs\",\n \"rank\": 47,\n \"score\": 136300.51882641914\n },\n {\n \"content\": \"fn easy0_suffix() -> String {\\n\\n \\\"ABCDEFGHIJKLMNOPQRSTUVWXYZ\\\".to_string()\\n\\n}\\n\\n\\n\\nmacro_rules! easy0 {\\n\\n () => {\\n\\n \\\"ABCDEFGHIJKLMNOPQRSTUVWXYZ$\\\"\\n\\n };\\n\\n}\\n\\n\\n\\nbench_match!(misc, easy0_32, easy0!(), get_text(TXT_32, easy0_suffix()));\\n\\nbench_match!(misc, easy0_1K, easy0!(), get_text(TXT_1K, easy0_suffix()));\\n\\nbench_match!(misc, easy0_32K, easy0!(), get_text(TXT_32K, easy0_suffix()));\\n\\nbench_match!(misc, easy0_1MB, easy0!(), get_text(TXT_1MB, easy0_suffix()));\\n\\n\\n\",\n \"file_path\": \"benches/regex_0_2_6/src/misc.rs\",\n \"rank\": 48,\n \"score\": 136300.51882641914\n },\n {\n \"content\": \"fn hard_suffix() -> String {\\n\\n \\\"ABCDEFGHIJKLMNOPQRSTUVWXYZ\\\".to_string()\\n\\n}\\n\\n\\n\\nmacro_rules! hard {\\n\\n () => {\\n\\n r\\\"[ -~]*ABCDEFGHIJKLMNOPQRSTUVWXYZ$\\\"\\n\\n };\\n\\n}\\n\\n\\n\\nbench_match!(misc, hard_32, hard!(), get_text(TXT_32, hard_suffix()));\\n\\nbench_match!(misc, hard_1K, hard!(), get_text(TXT_1K, hard_suffix()));\\n\\nbench_match!(misc, hard_32K, hard!(), get_text(TXT_32K, hard_suffix()));\\n\\nbench_match!(misc, hard_1MB, hard!(), get_text(TXT_1MB, hard_suffix()));\\n\\n\\n\",\n \"file_path\": \"benches/regex_0_2_6/src/misc.rs\",\n \"rank\": 49,\n \"score\": 136300.51882641914\n },\n {\n \"content\": \"fn reallyhard_suffix() -> String {\\n\\n \\\"ABCDEFGHIJKLMNOPQRSTUVWXYZ\\\".to_string()\\n\\n}\\n\\n\\n\\nmacro_rules! reallyhard {\\n\\n () => {\\n\\n // The point of this being \\\"really\\\" hard is that it should completely\\n\\n // thwart any prefix or suffix literal optimizations.\\n\\n r\\\"[ -~]*ABCDEFGHIJKLMNOPQRSTUVWXYZ.*\\\"\\n\\n };\\n\\n}\\n\\n\\n\\nbench_match!(\\n\\n misc,\\n\\n reallyhard_32,\\n\\n reallyhard!(),\\n\\n get_text(TXT_32, reallyhard_suffix())\\n\\n);\\n\\nbench_match!(\\n\\n misc,\\n\",\n \"file_path\": \"benches/regex_0_2_6/src/misc.rs\",\n \"rank\": 50,\n \"score\": 136300.51882641914\n },\n {\n \"content\": \"pub fn measure(opts: BenchOpts, data_dir: &Path, site_dir: &Path, publish: bool) -> Result<()> {\\n\\n info!(\\\"ensuring data dir {} exists\\\", data_dir.display());\\n\\n let mut collector = Collector::new(data_dir, site_dir)?;\\n\\n\\n\\n info!(\\\"cataloging potential builds to run\\\");\\n\\n let candidates = opts.enumerate_bench_candidates()?;\\n\\n\\n\\n info!(\\n\\n \\\"{} possible toolchains to run to satisfy provided options, pruning...\\\",\\n\\n candidates.len()\\n\\n );\\n\\n\\n\\n let to_run = collector.compute_builds_needed(&candidates)?;\\n\\n\\n\\n info!(\\\"{} plans to run after pruning, running...\\\", to_run.len());\\n\\n\\n\\n for (toolchain, benches) in to_run.into_iter().rev() {\\n\\n info!(\\\"running {} benches with {}\\\", benches.len(), toolchain);\\n\\n if let Err(why) = collector.run_benches_with_toolchain(toolchain, &benches, publish) {\\n\\n warn!(\\\"problem running benchmarks: {}\\\", why);\\n\\n }\\n\\n }\\n\\n\\n\\n info!(\\\"all done!\\\");\\n\\n\\n\\n Ok(())\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/lib.rs\",\n \"rank\": 51,\n \"score\": 134966.77462166117\n },\n {\n \"content\": \"fn rustc_serialize_parse_dom(\\n\\n mut bytes: &[u8],\\n\\n) -> Result<rustc_serialize::json::Json, rustc_serialize::json::BuilderError> {\\n\\n rustc_serialize::json::Json::from_reader(&mut bytes)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"benches/json_benchmark_c7d3d9b/src/lib.rs\",\n \"rank\": 52,\n \"score\": 134835.42962447315\n },\n {\n \"content\": \"fn get_text(corpus: &str, suffix: String) -> String {\\n\\n let mut corpus = corpus.to_string();\\n\\n corpus.push_str(&suffix);\\n\\n corpus\\n\\n}\\n\\n\\n\",\n \"file_path\": \"benches/regex_0_2_6/src/misc.rs\",\n \"rank\": 53,\n \"score\": 132653.05880068932\n },\n {\n \"content\": \"fn read_sprites(wad: &Archive, textures: &mut BTreeMap<WadName, Image>) -> Result<usize> {\\n\\n let start_index = try!(wad.required_named_lump_index(b\\\"S_START\\\\0\\\")) + 1;\\n\\n let end_index = try!(wad.required_named_lump_index(b\\\"S_END\\\\0\\\\0\\\\0\\\"));\\n\\n info!(\\\"Reading {} sprites....\\\", end_index - start_index);\\n\\n let t0 = time::precise_time_s();\\n\\n for index in start_index..end_index {\\n\\n let name = *wad.lump_name(index);\\n\\n match Image::from_buffer(&try!(wad.read_lump(index))) {\\n\\n Ok(texture) => {\\n\\n textures.insert(name, texture);\\n\\n }\\n\\n Err(e) => {\\n\\n warn!(\\\"Skipping sprite: {}\\\", BadImage(name, e));\\n\\n continue;\\n\\n }\\n\\n }\\n\\n }\\n\\n let time = time::precise_time_s() - t0;\\n\\n info!(\\\"Done in {:.4}s.\\\", time);\\n\\n Ok(end_index - start_index)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"benches/doom_9e197d7/src/wad/tex.rs\",\n \"rank\": 54,\n \"score\": 129077.97801356117\n },\n {\n \"content\": \"fn gen_strings(len: usize) -> Vec<String> {\\n\\n let mut rng = XorShiftRng::from_seed([0, 1, 2, 3]);\\n\\n let mut v = vec![];\\n\\n for _ in 0..len {\\n\\n let n = rng.gen::<usize>() % 20 + 1;\\n\\n v.push(rng.gen_ascii_chars().take(n).collect());\\n\\n }\\n\\n v\\n\\n}\\n\\n\\n\",\n \"file_path\": \"benches/rayon_1_0_0/src/sort.rs\",\n \"rank\": 55,\n \"score\": 128017.80818087074\n },\n {\n \"content\": \"pub fn connection() -> TestConnection {\\n\\n let result = connection_without_transaction();\\n\\n result.execute(\\\"PRAGMA foreign_keys = ON\\\").unwrap();\\n\\n result.begin_test_transaction().unwrap();\\n\\n result\\n\\n}\\n\\n\\n\\nembed_migrations!(\\\"migrations/sqlite\\\");\\n\\n\\n\",\n \"file_path\": \"benches/diesel_1_1_1/src/schema.rs\",\n \"rank\": 56,\n \"score\": 127362.23906199334\n },\n {\n \"content\": \"fn count_deserialize_owned_bytes<R, D>(rdr: &mut Reader<R>) -> u64\\n\\n where R: io::Read, D: DeserializeOwned\\n\\n{\\n\\n let mut count = 0;\\n\\n let mut rec = ByteRecord::new();\\n\\n while rdr.read_byte_record(&mut rec).unwrap() {\\n\\n let _: D = rec.deserialize(None).unwrap();\\n\\n count += 1;\\n\\n }\\n\\n count\\n\\n}\\n\\n\\n\",\n \"file_path\": \"benches/csv_1_0_2/src/lib.rs\",\n \"rank\": 57,\n \"score\": 126688.41696351155\n },\n {\n \"content\": \"fn count_deserialize_owned_str<R, D>(rdr: &mut Reader<R>) -> u64\\n\\n where R: io::Read, D: DeserializeOwned\\n\\n{\\n\\n let mut count = 0;\\n\\n for rec in rdr.deserialize::<D>() {\\n\\n let _ = rec.unwrap();\\n\\n count += 1;\\n\\n }\\n\\n count\\n\\n}\\n\\n\\n\",\n \"file_path\": \"benches/csv_1_0_2/src/lib.rs\",\n \"rank\": 58,\n \"score\": 126688.41696351155\n },\n {\n \"content\": \"pub fn clear_error() {}\\n\\n\\n\\npub mod pixels {\\n\\n pub enum Color {\\n\\n RGBA(u8, u8, u8, u8),\\n\\n }\\n\\n\\n\\n pub enum PixelFormatEnum {\\n\\n ARGB8888,\\n\\n BGR24,\\n\\n }\\n\\n}\\n\\n\\n\\npub mod rect {\\n\\n use super::*;\\n\\n\\n\\n #[allow(unused)]\\n\\n pub struct Rect {\\n\\n x: Coord,\\n\\n y: Coord,\\n\",\n \"file_path\": \"benches/doom_9e197d7/src/shims/sdl2/src/lib.rs\",\n \"rank\": 59,\n \"score\": 125444.33030381786\n },\n {\n \"content\": \"#[bench]\\n\\nfn float_bytes(b: &mut Bencher) {\\n\\n use nom::float;\\n\\n b.iter(|| float(&b\\\"-1.234E-12\\\"[..]));\\n\\n}\\n\\n\\n\",\n \"file_path\": \"benches/nom_4_0_0/src/json.rs\",\n \"rank\": 60,\n \"score\": 123272.3711254322\n },\n {\n \"content\": \"#[bench]\\n\\nfn json_bench(b: &mut Bencher) {\\n\\n let data = &b\\\" { \\\\\\\"a\\\\\\\"\\\\t: 42,\\n\\n \\\\\\\"b\\\\\\\": [ \\\\\\\"x\\\\\\\", \\\\\\\"y\\\\\\\", 12 ] ,\\n\\n \\\\\\\"c\\\\\\\": { \\\\\\\"hello\\\\\\\" : \\\\\\\"world\\\\\\\"\\n\\n }\\n\\n } \\\\0\\\";\\n\\n\\n\\n //println!(\\\"data:\\\\n{:?}\\\", value(&data[..]));\\n\\n b.iter(|| value(&data[..]).unwrap());\\n\\n}\\n\\n\\n\",\n \"file_path\": \"benches/nom_4_0_0/src/json.rs\",\n \"rank\": 61,\n \"score\": 123272.3711254322\n },\n {\n \"content\": \"fn one_test(b: &mut Bencher) {\\n\\n let data = &b\\\"GET / HTTP/1.1\\n\\n Host: www.reddit.com\\n\\n User-Agent: Mozilla/5.0 (Macintosh; Intel Mac OS X 10.8; rv:15.0) Gecko/20100101 Firefox/15.0.1\\n\\n Accept: text/html,application/xhtml+xml,application/xml;q=0.9,*/*;q=0.8\\n\\n Accept-Language: en-us,en;q=0.5\\n\\n Accept-Encoding: gzip, deflate\\n\\n Connection: keep-alive\\\"\\n\\n [..];\\n\\n b.iter(|| parse(data));\\n\\n}\\n\\n}\\n\",\n \"file_path\": \"benches/nom_4_0_0/src/http.rs\",\n \"rank\": 62,\n \"score\": 123272.3711254322\n },\n {\n \"content\": \"#[bench]\\n\\nfn float_str(b: &mut Bencher) {\\n\\n use nom::float_s;\\n\\n b.iter(|| float_s(\\\"-1.234E-12\\\"));\\n\\n}\\n\",\n \"file_path\": \"benches/nom_4_0_0/src/json.rs\",\n \"rank\": 63,\n \"score\": 123272.3711254322\n },\n {\n \"content\": \"fn sieve_bench<TICK>(b: &mut Bencher, mut tick: TICK)\\n\\nwhere\\n\\n TICK: FnMut(usize) -> Vec<bool>,\\n\\n{\\n\\n let mut result = vec![];\\n\\n b.iter(|| result = tick(super::max(MAGNITUDE)));\\n\\n let num_primes = 1 + result.into_iter().filter(|&b| b).count();\\n\\n assert_eq!(num_primes, NUM_PRIMES[MAGNITUDE]);\\n\\n}\\n\\n\\n\\nwrap_libtest! {\\n\\n sieve::bench,\\n\\n fn sieve_serial(b: &mut Bencher) {\\n\\n sieve_bench(b, super::sieve_serial);\\n\\n }\\n\\n}\\n\\n\\n\\nwrap_libtest! {\\n\\n sieve::bench,\\n\\n fn sieve_chunks(b: &mut Bencher) {\\n\",\n \"file_path\": \"benches/rayon_1_0_0/src/sieve/bench.rs\",\n \"rank\": 64,\n \"score\": 122562.32861173693\n },\n {\n \"content\": \"fn nbody_bench<TICK>(b: &mut Bencher, mut tick: TICK)\\n\\nwhere\\n\\n TICK: FnMut(&mut NBodyBenchmark),\\n\\n{\\n\\n let mut rng = XorShiftRng::from_seed([0, 1, 2, 3]);\\n\\n let mut benchmark = NBodyBenchmark::new(BENCH_BODIES, &mut rng);\\n\\n b.iter(|| {\\n\\n for _ in 0..BENCH_TICKS {\\n\\n tick(&mut benchmark);\\n\\n }\\n\\n });\\n\\n}\\n\\n\\n\\nwrap_libtest! {\\n\\n nbody::bench,\\n\\n fn nbody_seq(b: &mut Bencher) {\\n\\n nbody_bench(b, |n| { n.tick_seq(); });\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"benches/rayon_1_0_0/src/nbody/bench.rs\",\n \"rank\": 65,\n \"score\": 122562.32861173693\n },\n {\n \"content\": \"pub fn connection_without_transaction() -> TestConnection {\\n\\n let connection = SqliteConnection::establish(\\\":memory:\\\").unwrap();\\n\\n embedded_migrations::run(&connection).unwrap();\\n\\n connection\\n\\n}\\n\\n\\n\\nsql_function!(_nextval, nextval_t, (a: types::VarChar) -> sql_types::BigInt);\\n\",\n \"file_path\": \"benches/diesel_1_1_1/src/schema.rs\",\n \"rank\": 66,\n \"score\": 122451.6177301991\n },\n {\n \"content\": \"fn serde_json_parse_dom(bytes: &[u8]) -> serde_json::Result<serde_json::Value> {\\n\\n use std::str;\\n\\n let s = str::from_utf8(bytes).unwrap();\\n\\n serde_json::from_str(s)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"benches/json_benchmark_c7d3d9b/src/lib.rs\",\n \"rank\": 67,\n \"score\": 122164.49929265317\n },\n {\n \"content\": \"fn rustc_serialize_stringify<W, T: ?Sized>(\\n\\n writer: W,\\n\\n value: &T,\\n\\n) -> rustc_serialize::json::EncodeResult<()>\\n\\nwhere\\n\\n W: Write,\\n\\n T: rustc_serialize::Encodable,\\n\\n{\\n\\n let mut writer = adapter::IoWriteAsFmtWrite::new(writer);\\n\\n let mut encoder = rustc_serialize::json::Encoder::new(&mut writer);\\n\\n value.encode(&mut encoder)\\n\\n}\\n\",\n \"file_path\": \"benches/json_benchmark_c7d3d9b/src/lib.rs\",\n \"rank\": 68,\n \"score\": 120910.22955612472\n },\n {\n \"content\": \"#[bench]\\n\\nfn recognize_float_bytes(b: &mut Bencher) {\\n\\n use nom::recognize_float;\\n\\n b.iter(|| recognize_float(&b\\\"-1.234E-12\\\"[..]));\\n\\n}\\n\\n\\n\",\n \"file_path\": \"benches/nom_4_0_0/src/json.rs\",\n \"rank\": 69,\n \"score\": 120732.36810535102\n },\n {\n \"content\": \"#[bench]\\n\\nfn recognize_float_str(b: &mut Bencher) {\\n\\n use nom::recognize_float;\\n\\n b.iter(|| recognize_float(\\\"-1.234E-12\\\"));\\n\\n}\\n\\n\\n\",\n \"file_path\": \"benches/nom_4_0_0/src/json.rs\",\n \"rank\": 70,\n \"score\": 120732.36810535102\n },\n {\n \"content\": \"struct SliceU8Ref<'a>(pub &'a [u8]);\\n\\n\\n\\nimpl<'a> fmt::LowerHex for SliceU8Ref<'a> {\\n\\n fn fmt(&self, fmtr: &mut fmt::Formatter) -> Result<(), fmt::Error> {\\n\\n for item in self.0 {\\n\\n try!(fmtr.write_fmt(format_args!(\\\"{:02x}\\\", item)));\\n\\n }\\n\\n Ok(())\\n\\n }\\n\\n}\\n\\n\\n\\nimpl<'a, OutputType: Write> brotli::CustomWrite<io::Error> for IoWriterWrapper<'a, OutputType> {\\n\\n fn flush(self: &mut Self) -> Result<(), io::Error> {\\n\\n loop {\\n\\n match self.0.flush() {\\n\\n Err(e) => match e.kind() {\\n\\n ErrorKind::Interrupted => continue,\\n\\n _ => return Err(e),\\n\\n },\\n\\n Ok(_) => return Ok(()),\\n\",\n \"file_path\": \"benches/brotli_1_1_3/src/lib.rs\",\n \"rank\": 71,\n \"score\": 120489.63335765319\n },\n {\n \"content\": \"pub fn geometric_mean(values: &[R64]) -> R64 {\\n\\n values\\n\\n .iter()\\n\\n .fold(r64(1.0), |a_n, &a_n1| a_n * a_n1)\\n\\n .powf(r64(1.0 / values.len() as f64))\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/analysis.rs\",\n \"rank\": 72,\n \"score\": 119323.29685341167\n },\n {\n \"content\": \"pub fn has_been_initialized() -> bool {\\n\\n true\\n\\n}\\n\\n\\n\\n#[derive(PartialEq)]\\n\\npub struct Font;\\n\\n\\n\\nimpl Drop for Font {\\n\\n fn drop(&mut self) {}\\n\\n}\\n\\n\\n\\npub enum Text<'a> {\\n\\n Latin1(&'a [u8]),\\n\\n Utf8(&'a str),\\n\\n Char(char),\\n\\n}\\n\\n\\n\\nimpl<'a> From<&'a str> for Text<'a> {\\n\\n fn from(string: &'a str) -> Text<'a> {\\n\\n Text::Utf8(string)\\n\",\n \"file_path\": \"benches/doom_9e197d7/src/shims/sdl2_ttf/src/lib.rs\",\n \"rank\": 73,\n \"score\": 118146.66883942173\n },\n {\n \"content\": \"pub fn decompress<InputType, OutputType>(\\n\\n r: &mut InputType,\\n\\n w: &mut OutputType,\\n\\n buffer_size: usize,\\n\\n) -> Result<(), io::Error>\\n\\nwhere\\n\\n InputType: Read,\\n\\n OutputType: Write,\\n\\n{\\n\\n let mut alloc_u8 = HeapAllocator::<u8> { default_value: 0 };\\n\\n let mut input_buffer = alloc_u8.alloc_cell(buffer_size);\\n\\n let mut output_buffer = alloc_u8.alloc_cell(buffer_size);\\n\\n brotli::BrotliDecompressCustomIo(\\n\\n &mut IoReaderWrapper::<InputType>(r),\\n\\n &mut IoWriterWrapper::<OutputType>(w),\\n\\n input_buffer.slice_mut(),\\n\\n output_buffer.slice_mut(),\\n\\n alloc_u8,\\n\\n HeapAllocator::<u32> { default_value: 0 },\\n\\n HeapAllocator::<HuffmanCode> {\\n\\n default_value: HuffmanCode::default(),\\n\\n },\\n\\n Error::new(ErrorKind::UnexpectedEof, \\\"Unexpected EOF\\\"),\\n\\n )\\n\\n}\\n\\n\\n\",\n \"file_path\": \"benches/brotli_1_1_3/src/lib.rs\",\n \"rank\": 74,\n \"score\": 118099.8900920744\n },\n {\n \"content\": \"pub fn compress<InputType, OutputType>(\\n\\n r: &mut InputType,\\n\\n w: &mut OutputType,\\n\\n buffer_size: usize,\\n\\n params: &brotli::enc::BrotliEncoderParams,\\n\\n) -> Result<usize, io::Error>\\n\\nwhere\\n\\n InputType: Read,\\n\\n OutputType: Write,\\n\\n{\\n\\n let mut alloc_u8 = HeapAllocator::<u8> { default_value: 0 };\\n\\n let mut input_buffer = alloc_u8.alloc_cell(buffer_size);\\n\\n let mut output_buffer = alloc_u8.alloc_cell(buffer_size);\\n\\n let mut log = |data: &[brotli::interface::Command<brotli::InputReference>]| {\\n\\n for cmd in data.iter() {\\n\\n write_one(cmd)\\n\\n }\\n\\n };\\n\\n if params.log_meta_block {\\n\\n println_stderr!(\\\"window {} 0 0 0\\\", params.lgwin);\\n\",\n \"file_path\": \"benches/brotli_1_1_3/src/lib.rs\",\n \"rank\": 75,\n \"score\": 118099.8900920744\n },\n {\n \"content\": \"pub fn get_linked_version() -> Version {\\n\\n Version(\\\"ttf-shim\\\".to_owned())\\n\\n}\\n\\n\\n\\n#[derive(Debug)]\\n\\npub enum Error {}\\n\\n\\n\\nimpl std::error::Error for Error {\\n\\n fn description(&self) -> &str {\\n\\n \\\"ttf-shim-error-description\\\"\\n\\n }\\n\\n\\n\\n fn cause(&self) -> Option<&std::error::Error> {\\n\\n None\\n\\n }\\n\\n}\\n\\n\\n\\nimpl Display for Error {\\n\\n fn fmt(&self, fmt: &mut Formatter) -> FmtResult {\\n\\n write!(fmt, \\\"ttf-shim-error-display\\\")\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"benches/doom_9e197d7/src/shims/sdl2_ttf/src/lib.rs\",\n \"rank\": 76,\n \"score\": 114341.8465684494\n },\n {\n \"content\": \"fn color(mut r: Ray, model: &Model, rng: &mut XorShiftRng) -> Vec3 {\\n\\n const WHITE: Vec3 = Vec3(1.0, 1.0, 1.0);\\n\\n let sky_blue = 0.3 * Vec3(0.5, 0.7, 1.0) + 0.7 * WHITE;\\n\\n\\n\\n let mut attenuation = WHITE;\\n\\n let mut depth = 0;\\n\\n while let Some(hit) = model.hit(&r) {\\n\\n let scattered = hit.material.scatter(&r, &hit, rng);\\n\\n attenuation = attenuation * scattered.color;\\n\\n if let Some(bounce) = scattered.ray {\\n\\n r = bounce;\\n\\n } else {\\n\\n break;\\n\\n }\\n\\n\\n\\n depth += 1;\\n\\n if depth >= 50 {\\n\\n break;\\n\\n }\\n\\n }\\n\",\n \"file_path\": \"benches/raytrace_8de9020/src/render.rs\",\n \"rank\": 77,\n \"score\": 112952.12424750593\n },\n {\n \"content\": \"extern crate lolbench ; # [ test ] fn end_to_end ( ) { lolbench :: end_to_end_test ( \\\"json_benchmark_c7d3d9b\\\" , \\\"serialize_citm_struct\\\" , ) ; }\",\n \"file_path\": \"benches/json_benchmark_c7d3d9b/tests/serialize-citm-struct.rs\",\n \"rank\": 78,\n \"score\": 112579.35099311701\n },\n {\n \"content\": \"extern crate lolbench ; # [ test ] fn end_to_end ( ) { lolbench :: end_to_end_test ( \\\"json_benchmark_c7d3d9b\\\" , \\\"serialize_twitter_struct\\\" , ) ; }\",\n \"file_path\": \"benches/json_benchmark_c7d3d9b/tests/serialize-twitter-struct.rs\",\n \"rank\": 79,\n \"score\": 112579.35099311701\n },\n {\n \"content\": \"extern crate lolbench ; # [ test ] fn end_to_end ( ) { lolbench :: end_to_end_test ( \\\"json_benchmark_c7d3d9b\\\" , \\\"serialize_canada_struct\\\" , ) ; }\",\n \"file_path\": \"benches/json_benchmark_c7d3d9b/tests/serialize-canada-struct.rs\",\n \"rank\": 80,\n \"score\": 112579.35099311701\n },\n {\n \"content\": \"fn points_to_polygon(points: &mut Vec<Vec2f>) {\\n\\n // Sort points in polygonal CCW order around their center.\\n\\n let center = polygon_center(points);\\n\\n points.sort_by(|a, b| {\\n\\n let ac = *a - center;\\n\\n let bc = *b - center;\\n\\n if ac[0] >= 0.0 && bc[0] < 0.0 {\\n\\n return Ordering::Less;\\n\\n }\\n\\n if ac[0] < 0.0 && bc[0] >= 0.0 {\\n\\n return Ordering::Greater;\\n\\n }\\n\\n if ac[0] == 0.0 && bc[0] == 0.0 {\\n\\n if ac[1] >= 0.0 || bc[1] >= 0.0 {\\n\\n return if a[1] > b[1] {\\n\\n Ordering::Less\\n\\n } else {\\n\\n Ordering::Greater\\n\\n };\\n\\n }\\n\",\n \"file_path\": \"benches/doom_9e197d7/src/wad/visitor.rs\",\n \"rank\": 81,\n \"score\": 110347.84245375593\n },\n {\n \"content\": \"pub fn from_wad_height(x: WadCoord) -> f32 {\\n\\n (x as f32) / 100.0\\n\\n}\\n\\n\\n\",\n \"file_path\": \"benches/doom_9e197d7/src/wad/util.rs\",\n \"rank\": 82,\n \"score\": 110107.72663084006\n },\n {\n \"content\": \"pub fn is_untextured(name: &WadName) -> bool {\\n\\n name[0] == b'-' && name[1] == b'\\\\0'\\n\\n}\\n\\n\\n\",\n \"file_path\": \"benches/doom_9e197d7/src/wad/util.rs\",\n \"rank\": 83,\n \"score\": 110107.72663084006\n },\n {\n \"content\": \"fn rmatsub(src: &[f32], dest: &mut [f32]) {\\n\\n dest.par_iter_mut()\\n\\n .zip(src.par_iter())\\n\\n .for_each(|(d, s)| *d -= *s);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"benches/rayon_1_0_0/src/matmul/mod.rs\",\n \"rank\": 84,\n \"score\": 109254.04536844068\n },\n {\n \"content\": \"// Any layout works, we're just adding by element.\\n\\nfn rmatsum(src: &[f32], dest: &mut [f32]) {\\n\\n dest.par_iter_mut()\\n\\n .zip(src.par_iter())\\n\\n .for_each(|(d, s)| *d += *s);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"benches/rayon_1_0_0/src/matmul/mod.rs\",\n \"rank\": 85,\n \"score\": 109254.04536844068\n },\n {\n \"content\": \"fn rcopy(src: &[f32], dest: &mut [f32]) {\\n\\n if dest.len() <= LINEAR_CHUNK {\\n\\n dest.copy_from_slice(src);\\n\\n return;\\n\\n }\\n\\n\\n\\n let mid = dest.len() / 2;\\n\\n let (s1, s2) = src.split_at(mid);\\n\\n let (d1, d2) = dest.split_at_mut(mid);\\n\\n rayon::join(|| rcopy(s1, d1), || rcopy(s2, d2));\\n\\n}\\n\\n\\n\",\n \"file_path\": \"benches/rayon_1_0_0/src/matmul/mod.rs\",\n \"rank\": 86,\n \"score\": 109254.04536844068\n },\n {\n \"content\": \"pub fn is_sky_flat(name: &WadName) -> bool {\\n\\n name == b\\\"F_SKY1\\\\0\\\\0\\\"\\n\\n}\\n\\n\\n\",\n \"file_path\": \"benches/doom_9e197d7/src/wad/util.rs\",\n \"rank\": 87,\n \"score\": 108148.40967659061\n },\n {\n \"content\": \"fn main() {\\n\\n println!(\\\"========================== decode | encode ===\\\");\\n\\n\\n\\n #[cfg(feature = \\\"file-canada\\\")]\\n\\n bench_file! {\\n\\n path: \\\"data/canada.json\\\",\\n\\n structure: canada::Canada,\\n\\n }\\n\\n\\n\\n #[cfg(feature = \\\"file-citm-catalog\\\")]\\n\\n bench_file! {\\n\\n path: \\\"data/citm_catalog.json\\\",\\n\\n structure: citm_catalog::CitmCatalog,\\n\\n }\\n\\n\\n\\n #[cfg(feature = \\\"file-twitter\\\")]\\n\\n bench_file! {\\n\\n path: \\\"data/twitter.json\\\",\\n\\n structure: twitter::Twitter,\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"benches/json_benchmark_c7d3d9b/src/binary.rs\",\n \"rank\": 88,\n \"score\": 107260.61212803473\n },\n {\n \"content\": \"pub fn end_to_end_test(crate_name: &str, bench_name: &str) {\\n\\n let bench_source_name = format!(\\\"{}.rs\\\", slugify(bench_name));\\n\\n\\n\\n let _ = simple_logger::init();\\n\\n\\n\\n let entrypoint_path = Path::new(\\\"benches\\\")\\n\\n .join(crate_name)\\n\\n .join(\\\"src\\\")\\n\\n .join(\\\"bin\\\")\\n\\n .join(bench_source_name);\\n\\n\\n\\n let source_path = Path::new(env!(\\\"CARGO_MANIFEST_DIR\\\")).join(&entrypoint_path);\\n\\n let plan = RunPlan::new(\\n\\n Benchmark {\\n\\n runner: None,\\n\\n name: String::from(bench_name),\\n\\n crate_name: String::from(crate_name),\\n\\n entrypoint_path,\\n\\n },\\n\\n Some(CriterionConfig {\\n\",\n \"file_path\": \"src/lib.rs\",\n \"rank\": 89,\n \"score\": 106943.6142262768\n },\n {\n \"content\": \"#[test]\\n\\nfn test_color() {\\n\\n let mut buf: [u8; 6] = unsafe { ::std::mem::uninitialized() };\\n\\n let string = Color(0xA0A0A0).as_str(&mut buf);\\n\\n assert_eq!(string, \\\"A0A0A0\\\");\\n\\n}\\n\",\n \"file_path\": \"benches/json_benchmark_c7d3d9b/src/color.rs\",\n \"rank\": 90,\n \"score\": 104546.98822800412\n },\n {\n \"content\": \"/// Generate a Model containing a bunch of randomly placed spheres.\\n\\nfn random_scene(rng: &mut XorShiftRng) -> Box<Model> {\\n\\n let mut spheres: Vec<Sphere> = vec![\\n\\n Sphere {\\n\\n center: Vec3(0.0, 0.0, -1000.0),\\n\\n radius: 1000.0,\\n\\n material: Box::new(Lambertian {\\n\\n albedo: Vec3(1.0, 0.6, 0.5),\\n\\n }),\\n\\n },\\n\\n Sphere {\\n\\n center: Vec3(-4.0, 0.0, 2.0),\\n\\n radius: 2.0,\\n\\n material: Box::new(Lambertian {\\n\\n albedo: Vec3(0.6, 0.2, 0.2),\\n\\n }),\\n\\n },\\n\\n Sphere {\\n\\n center: Vec3(0.0, 0.0, 2.0),\\n\\n radius: 2.0,\\n\\n material: Box::new(Dielectric { index: 1.5 }),\\n\",\n \"file_path\": \"benches/raytrace_8de9020/src/lib.rs\",\n \"rank\": 91,\n \"score\": 103362.29489496411\n },\n {\n \"content\": \"struct IoWriterWrapper<'a, OutputType: Write + 'a>(&'a mut OutputType);\\n\\n\\n\",\n \"file_path\": \"benches/brotli_1_1_3/src/lib.rs\",\n \"rank\": 92,\n \"score\": 103081.08376812904\n },\n {\n \"content\": \"struct IoReaderWrapper<'a, OutputType: Read + 'a>(&'a mut OutputType);\\n\\n\\n\\nmacro_rules! println_stderr(\\n\\n ($($val:tt)*) => { {\\n\\n writeln!(&mut ::std::io::stderr(), $($val)*).unwrap();\\n\\n } }\\n\\n);\\n\\n\\n\",\n \"file_path\": \"benches/brotli_1_1_3/src/lib.rs\",\n \"rank\": 93,\n \"score\": 103081.08376812904\n },\n {\n \"content\": \"fn strassen_sum(a: &[f32], b: &[f32], dest: &mut [f32]) {\\n\\n rcopy(a, dest);\\n\\n rmatsum(b, dest);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"benches/rayon_1_0_0/src/matmul/mod.rs\",\n \"rank\": 94,\n \"score\": 101996.19949846648\n },\n {\n \"content\": \"fn quarter_chunks_mut<'a>(\\n\\n v: &'a mut [f32],\\n\\n) -> (&'a mut [f32], &'a mut [f32], &'a mut [f32], &'a mut [f32]) {\\n\\n let mid = v.len() / 2;\\n\\n let quarter = mid / 2;\\n\\n let (left, right) = v.split_at_mut(mid);\\n\\n let (a, b) = left.split_at_mut(quarter);\\n\\n let (c, d) = right.split_at_mut(quarter);\\n\\n (a, b, c, d)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"benches/rayon_1_0_0/src/matmul/mod.rs\",\n \"rank\": 95,\n \"score\": 101882.50192927764\n },\n {\n \"content\": \"pub fn parse_child_id(id: ChildId) -> (usize, bool) {\\n\\n ((id & 0x7fff) as usize, id & 0x8000 != 0)\\n\\n}\\n\",\n \"file_path\": \"benches/doom_9e197d7/src/wad/util.rs\",\n \"rank\": 96,\n \"score\": 101397.4616260739\n },\n {\n \"content\": \"pub fn from_wad_coords(x: WadCoord, y: WadCoord) -> Vec2f {\\n\\n Vec2::new(-from_wad_height(x), from_wad_height(y))\\n\\n}\\n\\n\\n\",\n \"file_path\": \"benches/doom_9e197d7/src/wad/util.rs\",\n \"rank\": 97,\n \"score\": 100393.83687665939\n },\n {\n \"content\": \"fn clear_stride(slice: &mut [bool], from: usize, stride: usize) {\\n\\n let slice = &mut slice[from..];\\n\\n for x in StrideMut::from_slice(slice, stride as isize) {\\n\\n *x = false;\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"benches/rayon_1_0_0/src/sieve/mod.rs\",\n \"rank\": 98,\n \"score\": 100035.90549399421\n },\n {\n \"content\": \"pub fn solid<T>(foreground: T) -> RenderMode\\n\\nwhere\\n\\n T: Into<Color>,\\n\\n{\\n\\n RenderMode::Solid {\\n\\n foreground: foreground.into(),\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"benches/doom_9e197d7/src/shims/sdl2_ttf/src/lib.rs\",\n \"rank\": 99,\n \"score\": 99751.72770944922\n }\n]","isConversational":false}}},{"rowIdx":2389,"cells":{"lang":{"kind":"string","value":"Rust"},"file_path":{"kind":"string","value":"bin/inx-chronicle/src/api/stardust/v2/routes.rs"},"repo_name":{"kind":"string","value":"iotaledger/inx-chronicle"},"commit":{"kind":"string","value":"d7d1643a57f418fec5550ad8c24a63986a2c91a6"},"file_code":{"kind":"string","value":"\n\nuse std::str::FromStr;\n\nuse axum::{\n extract::{Extension, Path},\n routing::*,\n Router,\n};\nuse chronicle::{\n db::MongoDb,\n types::{\n stardust::block::{BlockId, MilestoneId, OutputId, TransactionId},\n tangle::MilestoneIndex,\n },\n};\n\nuse super::responses::*;\nuse crate::api::{error::ApiError, ApiResult};\n\npub fn routes() -> Router {\n Router::new()\n .nest(\n \"/blocks\",\n Router::new()\n .route(\"/:block_id\", get(block))\n .route(\"/:block_id/raw\", get(block_raw))\n .route(\"/:block_id/metadata\", get(block_metadata)),\n )\n .nest(\n \"/outputs\",\n Router::new()\n .route(\"/:output_id\", get(output))\n .route(\"/:output_id/metadata\", get(output_metadata)),\n )\n .nest(\n \"/transactions\",\n Router::new().route(\"/:transaction_id/included-block\", get(transaction_included_block)),\n )\n .nest(\n \"/milestones\",\n Router::new()\n .route(\"/:milestone_id\", get(milestone))\n .route(\"/by-index/:index\", get(milestone_by_index)),\n )\n}\n\nasync fn block(database: Extension<MongoDb>, Path(block_id): Path<String>) -> ApiResult<BlockResponse> {\n let block_id = BlockId::from_str(&block_id).map_err(ApiError::bad_parse)?;\n let rec = database.get_block(&block_id).await?.ok_or(ApiError::NoResults)?;\n Ok(BlockResponse {\n protocol_version: rec.protocol_version,\n parents: rec.parents.iter().map(|m| m.to_hex()).collect(),\n payload: rec.payload,\n nonce: rec.nonce,\n })\n}\n\nasync fn block_raw(database: Extension<MongoDb>, Path(block_id): Path<String>) -> ApiResult<Vec<u8>> {\n let block_id = BlockId::from_str(&block_id).map_err(ApiError::bad_parse)?;\n database.get_block_raw(&block_id).await?.ok_or(ApiError::NoResults)\n}\n\nasync fn block_metadata(\n database: Extension<MongoDb>,\n Path(block_id): Path<String>,\n) -> ApiResult<BlockMetadataResponse> {\n let block_id = BlockId::from_str(&block_id).map_err(ApiError::bad_parse)?;\n let metadata = database\n .get_block_metadata(&block_id)\n .await?\n .ok_or(ApiError::NoResults)?;\n\n Ok(BlockMetadataResponse {\n block_id: metadata.block_id.to_hex(),\n parents: metadata.parents.iter().map(|id| id.to_hex()).collect(),\n is_solid: Some(metadata.is_solid),\n referenced_by_milestone_index: Some(metadata.referenced_by_milestone_index),\n milestone_index: Some(metadata.milestone_index),\n should_promote: Some(metadata.should_promote),\n should_reattach: Some(metadata.should_reattach),\n ledger_inclusion_state: Some(metadata.inclusion_state),\n conflict_reason: Some(metadata.conflict_reason as u8),\n })\n}\n\nasync fn output(database: Extension<MongoDb>, Path(output_id): Path<String>) -> ApiResult<OutputResponse> {\n let output_id = OutputId::from_str(&output_id).map_err(ApiError::bad_parse)?;\n let (output, metadata) = database\n .get_output_and_metadata(&output_id)\n .await?\n .ok_or(ApiError::NoResults)?;\n\n Ok(OutputResponse {\n block_id: metadata.block_id.to_hex(),\n transaction_id: metadata.transaction_id.to_hex(),\n output_index: metadata.output_id.index,\n is_spent: metadata.spent.is_some(),\n milestone_index_spent: metadata.spent.as_ref().map(|s| s.spent.milestone_index),\n milestone_ts_spent: metadata.spent.as_ref().map(|s| s.spent.milestone_timestamp),\n milestone_index_booked: metadata.booked.milestone_index,\n milestone_ts_booked: metadata.booked.milestone_timestamp,\n output,\n })\n}\n\nasync fn output_metadata(\n database: Extension<MongoDb>,\n Path(output_id): Path<String>,\n) -> ApiResult<OutputMetadataResponse> {\n let output_id = OutputId::from_str(&output_id).map_err(ApiError::bad_parse)?;\n let metadata = database\n .get_output_metadata(&output_id)\n .await?\n .ok_or(ApiError::NoResults)?;\n\n Ok(OutputMetadataResponse {\n block_id: metadata.block_id.to_hex(),\n transaction_id: metadata.transaction_id.to_hex(),\n output_index: metadata.output_id.index,\n is_spent: metadata.spent.is_some(),\n milestone_index_spent: metadata.spent.as_ref().map(|s| s.spent.milestone_index),\n milestone_ts_spent: metadata.spent.as_ref().map(|s| s.spent.milestone_timestamp),\n transaction_id_spent: metadata.spent.as_ref().map(|s| s.transaction_id.to_hex()),\n milestone_index_booked: metadata.booked.milestone_index,\n milestone_ts_booked: metadata.booked.milestone_timestamp,\n })\n}\n\nasync fn transaction_included_block(\n database: Extension<MongoDb>,\n Path(transaction_id): Path<String>,\n) -> ApiResult<BlockResponse> {\n let transaction_id_dto = TransactionId::from_str(&transaction_id).map_err(ApiError::bad_parse)?;\n let block = database\n .get_block_for_transaction(&transaction_id_dto)\n .await?\n .ok_or(ApiError::NoResults)?;\n\n Ok(BlockResponse {\n protocol_version: block.protocol_version,\n parents: block.parents.iter().map(|m| m.to_hex()).collect(),\n payload: block.payload,\n nonce: block.nonce,\n })\n}\n\nasync fn milestone(database: Extension<MongoDb>, Path(milestone_id): Path<String>) -> ApiResult<MilestoneResponse> {\n let milestone_id = MilestoneId::from_str(&milestone_id).map_err(ApiError::bad_parse)?;\n let payload = database\n .get_milestone_payload_by_id(&milestone_id)\n .await?\n .ok_or(ApiError::NoResults)?;\n\n Ok(MilestoneResponse { payload })\n}\n\nasync fn milestone_by_index(\n database: Extension<MongoDb>,\n Path(index): Path<MilestoneIndex>,\n) -> ApiResult<MilestoneResponse> {\n let payload = database\n .get_milestone_payload(index)\n .await?\n .ok_or(ApiError::NoResults)?;\n\n Ok(MilestoneResponse { payload })\n}\n"},"prefix":{"kind":"string","value":"\n\nuse std::str::FromStr;\n\nuse axum::{\n extract::{Extension, Path},\n routing::*,\n Router,\n};\nuse chronicle::{\n db::MongoDb,\n types::{\n stardust::block::{BlockId, MilestoneId, OutputId, TransactionId},\n tangle::MilestoneIndex,\n },\n};\n\nuse super::responses::*;\nuse crate::api::{error::ApiError, ApiResult};\n\npub fn routes() -> Router {\n Router::new()\n .nest(\n \"/blocks\",\n Router::new()\n .route(\"/:block_id\", get(block))\n .route(\"/:block_id/raw\", get(block_raw))\n .route(\"/:block_id/metadata\", get(block_metadata)),\n )\n .nest(\n \"/outputs\",\n Router::new()\n .route(\"/:output_id\", get(output))\n .route(\"/:output_id/metadata\", get(output_metadata)),\n )\n .nest(\n \"/transactions\",\n Router::new().route(\"/:transaction_id/included-block\", get(transaction_included_block)),\n )\n .nest(\n \"/milestones\",\n Router::new()\n .route(\"/:milestone_id\", get(milestone))\n .route(\"/by-index/:index\", get(milestone_by_index)),\n )\n}\n\nasync fn block(database: Extension<MongoDb>, Path(block_id): Path<String>) -> ApiResult<BlockResponse> {\n let block_id = BlockId::from_str(&block_id).map_err(ApiError::bad_parse)?;\n let rec = database.get_block(&block_id).await?.ok_or(ApiError::NoResults)?;\n Ok(BlockResponse {\n protocol_version: rec.protocol_version,\n parents: rec.parents.iter().map(|m| m.to_hex()).collect(),\n payload: rec.payload,\n nonce: rec.nonce,\n })\n}\n\nasync fn block_raw(database: Extension<MongoDb>, Path(block_id): Path<String>) -> ApiResult<Vec<u8>> {\n let block_id = BlockId::from_str(&block_id).map_err(ApiError::bad_parse)?;\n database.get_block_raw(&block_id).await?.ok_or(ApiError::NoResults)\n}\n\nasync fn block_metadata(\n database: Extension<MongoDb>,\n Path(block_id): Path<String>,\n) -> ApiResult<BlockMetadataResponse> {\n let block_id = BlockId::from_str(&block_id).map_err(ApiError::bad_parse)?;\n let metadata = database\n .get_block_metadata(&block_id)\n .await?\n .ok_or(ApiError::NoResults)?;\n\n Ok(BlockMetadataResponse {\n block_id: metadata.block_id.to_hex(),\n parents: metadata.parents.iter().map(|id| id.to_hex()).collect(),\n is_solid: Some(metadata.is_solid),\n referenced_by_milestone_index: Some(metadata.referenced_by_milestone_index),\n milestone_index: Some(metadata.milestone_index),\n should_promote: Some(metadata.should_promote),\n should_reattach: Some(metadata.should_reattach),\n ledger_inclusion_state: Some(metadata.inclusion_state),\n conflict_reason: Some(metadata.conflict_reason as u8),\n })\n}\n\nasync fn output(database: Extension<MongoDb>, Path(output_id): Path<String>) -> ApiResult<OutputResponse> {\n let output_id = OutputId::from_str(&output_id).map_err(ApiError::bad_parse)?;\n let (output, metadata) = database\n .get_output_and_metadata(&output_id)\n .await?\n .ok_or(ApiError::NoResults)?;\n\n Ok(OutputResponse {\n block_id: metadata.block_id.to_hex(),\n transaction_id: metadata.transaction_id.to_hex(),\n output_index: metadata.output_id.index,\n is_spent: metadata.spent.is_some(),\n milestone_index_spent: metadata.spent.as_ref().map(|s| s.spent.milestone_index),\n milestone_ts_spent: metadata.spent.as_ref().map(|s| s.spent.milestone_timestamp),\n milestone_index_booked: metadata.booked.milestone_index,\n milestone_ts_booked: metadata.booked.milestone_timestamp,\n output,\n })\n}\n\nasync fn output_metadata(\n database: Extension<MongoDb>,\n Path(output_id): Path<String>,\n) -> ApiResult<OutputMetadataResponse> {\n let output_id = OutputId::from_str(&output_id).map_err(ApiError::bad_parse)?;\n let metadata = database\n .get_output_metadata(&output_id)\n .await?\n .ok_or(ApiError::NoResults)?;\n\n "},"suffix":{"kind":"string","value":"\n}\n\nasync fn transaction_included_block(\n database: Extension<MongoDb>,\n Path(transaction_id): Path<String>,\n) -> ApiResult<BlockResponse> {\n let transaction_id_dto = TransactionId::from_str(&transaction_id).map_err(ApiError::bad_parse)?;\n let block = database\n .get_block_for_transaction(&transaction_id_dto)\n .await?\n .ok_or(ApiError::NoResults)?;\n\n Ok(BlockResponse {\n protocol_version: block.protocol_version,\n parents: block.parents.iter().map(|m| m.to_hex()).collect(),\n payload: block.payload,\n nonce: block.nonce,\n })\n}\n\nasync fn milestone(database: Extension<MongoDb>, Path(milestone_id): Path<String>) -> ApiResult<MilestoneResponse> {\n let milestone_id = MilestoneId::from_str(&milestone_id).map_err(ApiError::bad_parse)?;\n let payload = database\n .get_milestone_payload_by_id(&milestone_id)\n .await?\n .ok_or(ApiError::NoResults)?;\n\n Ok(MilestoneResponse { payload })\n}\n\nasync fn milestone_by_index(\n database: Extension<MongoDb>,\n Path(index): Path<MilestoneIndex>,\n) -> ApiResult<MilestoneResponse> {\n let payload = database\n .get_milestone_payload(index)\n .await?\n .ok_or(ApiError::NoResults)?;\n\n Ok(MilestoneResponse { payload })\n}\n"},"middle":{"kind":"string","value":"Ok(OutputMetadataResponse {\n block_id: metadata.block_id.to_hex(),\n transaction_id: metadata.transaction_id.to_hex(),\n output_index: metadata.output_id.index,\n is_spent: metadata.spent.is_some(),\n milestone_index_spent: metadata.spent.as_ref().map(|s| s.spent.milestone_index),\n milestone_ts_spent: metadata.spent.as_ref().map(|s| s.spent.milestone_timestamp),\n transaction_id_spent: metadata.spent.as_ref().map(|s| s.transaction_id.to_hex()),\n milestone_index_booked: metadata.booked.milestone_index,\n milestone_ts_booked: metadata.booked.milestone_timestamp,\n })"},"strategy":{"kind":"string","value":"call_expression"},"context_items":{"kind":"list like","value":[{"content":"// Copyright 2022 IOTA Stiftung\n\n// SPDX-License-Identifier: Apache-2.0\n\n\n\nuse std::str::FromStr;\n\n\n\nuse bee_block_stardust::payload::milestone as bee;\n\nuse mongodb::bson::{spec::BinarySubtype, Binary, Bson};\n\nuse serde::{Deserialize, Serialize};\n\n\n\nuse crate::types::util::bytify;\n\n\n\n#[derive(Copy, Clone, Debug, PartialEq, Eq, Serialize, Deserialize)]\n\n#[serde(transparent)]\n\npub struct MilestoneId(#[serde(with = \"bytify\")] pub [u8; Self::LENGTH]);\n\n\n\nimpl MilestoneId {\n\n const LENGTH: usize = bee::MilestoneId::LENGTH;\n\n}\n\n\n\nimpl From<bee::MilestoneId> for MilestoneId {\n","file_path":"src/types/stardust/block/payload/milestone/milestone_id.rs","rank":0,"score":134919.454855},{"content":" fn from(value: bee::MilestoneId) -> Self {\n\n Self(*value)\n\n }\n\n}\n\n\n\nimpl From<MilestoneId> for bee::MilestoneId {\n\n fn from(value: MilestoneId) -> Self {\n\n bee::MilestoneId::new(value.0)\n\n }\n\n}\n\n\n\nimpl FromStr for MilestoneId {\n\n type Err = bee_block_stardust::Error;\n\n\n\n fn from_str(s: &str) -> Result<Self, Self::Err> {\n\n Ok(bee::MilestoneId::from_str(s)?.into())\n\n }\n\n}\n\n\n\nimpl From<MilestoneId> for Bson {\n\n fn from(val: MilestoneId) -> Self {\n\n Binary {\n\n subtype: BinarySubtype::Generic,\n\n bytes: val.0.to_vec(),\n\n }\n\n .into()\n\n }\n\n}\n","file_path":"src/types/stardust/block/payload/milestone/milestone_id.rs","rank":1,"score":134907.39880959404},{"content":"// Copyright 2022 IOTA Stiftung\n\n// SPDX-License-Identifier: Apache-2.0\n\n\n\nuse std::str::FromStr;\n\n\n\nuse bee_block_stardust::{output::InputsCommitment, payload::transaction as bee};\n\nuse mongodb::bson::{spec::BinarySubtype, Binary, Bson};\n\nuse serde::{Deserialize, Serialize};\n\n\n\nuse crate::types::{\n\n stardust::block::{Input, Output, Payload, Unlock},\n\n util::bytify,\n\n};\n\n\n\n#[derive(Copy, Clone, Debug, PartialEq, Eq, Serialize, Deserialize)]\n\n#[serde(transparent)]\n\npub struct TransactionId(#[serde(with = \"bytify\")] pub [u8; Self::LENGTH]);\n\n\n\nimpl TransactionId {\n\n const LENGTH: usize = bee::TransactionId::LENGTH;\n","file_path":"src/types/stardust/block/payload/transaction.rs","rank":2,"score":133051.35291114094},{"content":" pub(crate) const OUTPUT_ID1: &str = \"0x52fdfc072182654f163f5f0f9a621d729566c74d10037c4d7bbb0407d1e2c6492a00\";\n\n pub(crate) const OUTPUT_ID2: &str = \"0x52fdfc072182654f163f5f0f9a621d729566c74d10037c4d7bbb0407d1e2c6492b00\";\n\n pub(crate) const OUTPUT_ID3: &str = \"0x52fdfc072182654f163f5f0f9a621d729566c74d10037c4d7bbb0407d1e2c6492c00\";\n\n pub(crate) const OUTPUT_ID4: &str = \"0x52fdfc072182654f163f5f0f9a621d729566c74d10037c4d7bbb0407d1e2c6492d00\";\n\n\n\n use bee_block_stardust::unlock::Unlocks;\n\n use mongodb::bson::{from_bson, to_bson};\n\n\n\n use super::*;\n\n use crate::types::stardust::block::{\n\n output::test::{get_test_alias_output, get_test_basic_output, get_test_foundry_output, get_test_nft_output},\n\n unlock::test::{\n\n get_test_alias_unlock, get_test_nft_unlock, get_test_reference_unlock, get_test_signature_unlock,\n\n },\n\n OutputId,\n\n };\n\n\n\n #[test]\n\n fn test_transaction_id_bson() {\n\n let transaction_id = TransactionId::from(bee_test::rand::transaction::rand_transaction_id());\n","file_path":"src/types/stardust/block/payload/transaction.rs","rank":3,"score":133046.49560605662},{"content":" bee_block_stardust::output::InputsCommitment::new(outputs.iter()),\n\n )\n\n .with_inputs(\n\n Vec::from(inputs)\n\n .into_iter()\n\n .map(TryInto::try_into)\n\n .collect::<Result<Vec<_>, _>>()?,\n\n )\n\n .with_outputs(outputs);\n\n if let Some(payload) = payload {\n\n builder = builder.with_payload(payload.try_into()?);\n\n }\n\n bee::TransactionEssence::Regular(builder.finish()?)\n\n }\n\n })\n\n }\n\n}\n\n\n\n#[cfg(test)]\n\npub(crate) mod test {\n","file_path":"src/types/stardust/block/payload/transaction.rs","rank":4,"score":133045.08445107532},{"content":" let bson = to_bson(&transaction_id).unwrap();\n\n assert_eq!(Bson::from(transaction_id), bson);\n\n assert_eq!(transaction_id, from_bson::<TransactionId>(bson).unwrap());\n\n }\n\n\n\n #[test]\n\n fn test_transaction_payload_bson() {\n\n let payload = get_test_transaction_payload();\n\n let bson = to_bson(&payload).unwrap();\n\n assert_eq!(payload, from_bson::<TransactionPayload>(bson).unwrap());\n\n }\n\n\n\n pub(crate) fn get_test_transaction_essence() -> TransactionEssence {\n\n TransactionEssence::from(&bee::TransactionEssence::Regular(\n\n bee::RegularTransactionEssenceBuilder::new(0, [0; 32].into())\n\n .with_inputs(vec![\n\n Input::Utxo(OutputId::from_str(OUTPUT_ID1).unwrap()).try_into().unwrap(),\n\n Input::Utxo(OutputId::from_str(OUTPUT_ID2).unwrap()).try_into().unwrap(),\n\n Input::Utxo(OutputId::from_str(OUTPUT_ID3).unwrap()).try_into().unwrap(),\n\n Input::Utxo(OutputId::from_str(OUTPUT_ID4).unwrap()).try_into().unwrap(),\n","file_path":"src/types/stardust/block/payload/transaction.rs","rank":5,"score":133042.8464917851},{"content":" pub unlocks: Box<[Unlock]>,\n\n}\n\n\n\nimpl From<&bee::TransactionPayload> for TransactionPayload {\n\n fn from(value: &bee::TransactionPayload) -> Self {\n\n Self {\n\n id: value.id().into(),\n\n essence: value.essence().into(),\n\n unlocks: value.unlocks().iter().map(Into::into).collect(),\n\n }\n\n }\n\n}\n\n\n\nimpl TryFrom<TransactionPayload> for bee::TransactionPayload {\n\n type Error = bee_block_stardust::Error;\n\n\n\n fn try_from(value: TransactionPayload) -> Result<Self, Self::Error> {\n\n bee::TransactionPayload::new(\n\n value.essence.try_into()?,\n\n bee_block_stardust::unlock::Unlocks::new(\n","file_path":"src/types/stardust/block/payload/transaction.rs","rank":6,"score":133042.58206452074},{"content":"}\n\n\n\nimpl TryFrom<TransactionEssence> for bee::TransactionEssence {\n\n type Error = bee_block_stardust::Error;\n\n\n\n fn try_from(value: TransactionEssence) -> Result<Self, Self::Error> {\n\n Ok(match value {\n\n TransactionEssence::Regular {\n\n network_id,\n\n inputs,\n\n inputs_commitment: _,\n\n outputs,\n\n payload,\n\n } => {\n\n let outputs = Vec::from(outputs)\n\n .into_iter()\n\n .map(TryInto::try_into)\n\n .collect::<Result<Vec<bee_block_stardust::output::Output>, _>>()?;\n\n let mut builder = bee::RegularTransactionEssence::builder(\n\n network_id,\n","file_path":"src/types/stardust/block/payload/transaction.rs","rank":7,"score":133042.55650379395},{"content":" ])\n\n .with_outputs(vec![\n\n get_test_basic_output().try_into().unwrap(),\n\n get_test_alias_output().try_into().unwrap(),\n\n get_test_foundry_output().try_into().unwrap(),\n\n get_test_nft_output().try_into().unwrap(),\n\n ])\n\n .finish()\n\n .unwrap(),\n\n ))\n\n }\n\n\n\n pub(crate) fn get_test_transaction_payload() -> TransactionPayload {\n\n TransactionPayload::from(\n\n &bee::TransactionPayload::new(\n\n get_test_transaction_essence().try_into().unwrap(),\n\n Unlocks::new(vec![\n\n get_test_signature_unlock().try_into().unwrap(),\n\n get_test_reference_unlock().try_into().unwrap(),\n\n get_test_alias_unlock().try_into().unwrap(),\n\n get_test_nft_unlock().try_into().unwrap(),\n\n ])\n\n .unwrap(),\n\n )\n\n .unwrap(),\n\n )\n\n }\n\n}\n","file_path":"src/types/stardust/block/payload/transaction.rs","rank":8,"score":133042.55428993094},{"content":" payload: Option<Payload>,\n\n },\n\n}\n\n\n\nimpl TransactionEssence {\n\n const INPUTS_COMMITMENT_LENGTH: usize = InputsCommitment::LENGTH;\n\n}\n\n\n\nimpl From<&bee::TransactionEssence> for TransactionEssence {\n\n fn from(value: &bee::TransactionEssence) -> Self {\n\n match value {\n\n bee::TransactionEssence::Regular(essence) => Self::Regular {\n\n network_id: essence.network_id(),\n\n inputs: essence.inputs().iter().map(Into::into).collect(),\n\n inputs_commitment: **essence.inputs_commitment(),\n\n outputs: essence.outputs().iter().map(Into::into).collect(),\n\n payload: essence.payload().map(Into::into),\n\n },\n\n }\n\n }\n","file_path":"src/types/stardust/block/payload/transaction.rs","rank":9,"score":133039.66256965726},{"content":" Vec::from(value.unlocks)\n\n .into_iter()\n\n .map(TryInto::try_into)\n\n .collect::<Result<Vec<_>, _>>()?,\n\n )?,\n\n )\n\n }\n\n}\n\n\n\n#[derive(Clone, Debug, PartialEq, Eq, Serialize, Deserialize)]\n\n#[serde(tag = \"kind\")]\n\npub enum TransactionEssence {\n\n #[serde(rename = \"regular\")]\n\n Regular {\n\n #[serde(with = \"crate::types::util::stringify\")]\n\n network_id: u64,\n\n inputs: Box<[Input]>,\n\n #[serde(with = \"bytify\")]\n\n inputs_commitment: [u8; Self::INPUTS_COMMITMENT_LENGTH],\n\n outputs: Box<[Output]>,\n","file_path":"src/types/stardust/block/payload/transaction.rs","rank":10,"score":133039.11510938575},{"content":"\n\n fn from_str(s: &str) -> Result<Self, Self::Err> {\n\n Ok(bee::TransactionId::from_str(s)?.into())\n\n }\n\n}\n\n\n\nimpl From<TransactionId> for Bson {\n\n fn from(val: TransactionId) -> Self {\n\n Binary {\n\n subtype: BinarySubtype::Generic,\n\n bytes: val.0.to_vec(),\n\n }\n\n .into()\n\n }\n\n}\n\n\n\n#[derive(Clone, Debug, PartialEq, Eq, Serialize, Deserialize)]\n\npub struct TransactionPayload {\n\n pub id: TransactionId,\n\n pub essence: TransactionEssence,\n","file_path":"src/types/stardust/block/payload/transaction.rs","rank":11,"score":133038.60486887593},{"content":"\n\n pub fn to_hex(&self) -> String {\n\n prefix_hex::encode(self.0.as_ref())\n\n }\n\n}\n\n\n\nimpl From<bee::TransactionId> for TransactionId {\n\n fn from(value: bee::TransactionId) -> Self {\n\n Self(*value)\n\n }\n\n}\n\n\n\nimpl From<TransactionId> for bee::TransactionId {\n\n fn from(value: TransactionId) -> Self {\n\n bee::TransactionId::new(value.0)\n\n }\n\n}\n\n\n\nimpl FromStr for TransactionId {\n\n type Err = bee_block_stardust::Error;\n","file_path":"src/types/stardust/block/payload/transaction.rs","rank":12,"score":133037.51573851294},{"content":"// Copyright 2022 IOTA Stiftung\n\n// SPDX-License-Identifier: Apache-2.0\n\n\n\nuse bee_block_stardust::payload as bee;\n\nuse serde::{Deserialize, Serialize};\n\n\n\nuse super::MilestoneId;\n\n\n\n#[derive(Copy, Clone, Debug, PartialEq, Eq, Serialize, Deserialize)]\n\npub struct TreasuryTransactionPayload {\n\n input_milestone_id: MilestoneId,\n\n #[serde(with = \"crate::types::util::stringify\")]\n\n output_amount: u64,\n\n}\n\n\n\nimpl From<&bee::TreasuryTransactionPayload> for TreasuryTransactionPayload {\n\n fn from(value: &bee::TreasuryTransactionPayload) -> Self {\n\n Self {\n\n input_milestone_id: (*value.input().milestone_id()).into(),\n\n output_amount: value.output().amount(),\n","file_path":"src/types/stardust/block/payload/treasury_transaction.rs","rank":13,"score":129821.90234700298},{"content":" }\n\n }\n\n}\n\n\n\nimpl TryFrom<TreasuryTransactionPayload> for bee::TreasuryTransactionPayload {\n\n type Error = bee_block_stardust::Error;\n\n\n\n fn try_from(value: TreasuryTransactionPayload) -> Result<Self, Self::Error> {\n\n Self::new(\n\n bee_block_stardust::input::TreasuryInput::new(value.input_milestone_id.into()),\n\n bee_block_stardust::output::TreasuryOutput::new(value.output_amount)?,\n\n )\n\n }\n\n}\n\n\n\n#[cfg(test)]\n\npub(crate) mod test {\n\n use mongodb::bson::{from_bson, to_bson};\n\n\n\n use super::*;\n","file_path":"src/types/stardust/block/payload/treasury_transaction.rs","rank":14,"score":129821.39951225316},{"content":"\n\n #[test]\n\n fn test_treasury_transaction_payload_bson() {\n\n let payload = get_test_treasury_transaction_payload();\n\n let bson = to_bson(&payload).unwrap();\n\n assert_eq!(payload, from_bson::<TreasuryTransactionPayload>(bson).unwrap());\n\n }\n\n\n\n pub(crate) fn get_test_treasury_transaction_payload() -> TreasuryTransactionPayload {\n\n TreasuryTransactionPayload::from(\n\n &bee::TreasuryTransactionPayload::new(\n\n bee_test::rand::input::rand_treasury_input(),\n\n bee_test::rand::output::rand_treasury_output(),\n\n )\n\n .unwrap(),\n\n )\n\n }\n\n}\n","file_path":"src/types/stardust/block/payload/treasury_transaction.rs","rank":15,"score":129812.42073482573},{"content":"// Copyright 2022 IOTA Stiftung\n\n// SPDX-License-Identifier: Apache-2.0\n\n\n\nmod milestone_id;\n\n\n\nuse bee_block_stardust::payload::milestone as bee;\n\nuse serde::{Deserialize, Serialize};\n\n\n\npub use self::milestone_id::MilestoneId;\n\nuse crate::types::{\n\n stardust::block::{Address, BlockId, Signature, TreasuryTransactionPayload},\n\n tangle::MilestoneIndex,\n\n util::bytify,\n\n};\n\n\n\n#[derive(Clone, Debug, PartialEq, Eq, Serialize, Deserialize)]\n\npub struct MilestonePayload {\n\n pub essence: MilestoneEssence,\n\n pub signatures: Box<[Signature]>,\n\n}\n","file_path":"src/types/stardust/block/payload/milestone/mod.rs","rank":16,"score":129353.04705101726},{"content":" )\n\n }\n\n}\n\n\n\n#[derive(Clone, Debug, PartialEq, Eq, Serialize, Deserialize)]\n\npub struct MilestoneEssence {\n\n pub index: MilestoneIndex,\n\n pub timestamp: u32,\n\n pub previous_milestone_id: MilestoneId,\n\n pub parents: Box<[BlockId]>,\n\n #[serde(with = \"bytify\")]\n\n pub inclusion_merkle_root: [u8; Self::MERKLE_PROOF_LENGTH],\n\n #[serde(with = \"bytify\")]\n\n pub applied_merkle_root: [u8; Self::MERKLE_PROOF_LENGTH],\n\n #[serde(with = \"serde_bytes\")]\n\n pub metadata: Vec<u8>,\n\n pub options: Box<[MilestoneOption]>,\n\n}\n\n\n\nimpl MilestoneEssence {\n","file_path":"src/types/stardust/block/payload/milestone/mod.rs","rank":17,"score":129350.35581215912},{"content":"\n\n use bee_block_stardust::payload::TreasuryTransactionPayload;\n\n use mongodb::bson::{from_bson, to_bson, Bson};\n\n\n\n use super::*;\n\n use crate::types::stardust::block::signature::test::get_test_signature;\n\n\n\n #[test]\n\n fn test_milestone_id_bson() {\n\n let milestone_id = MilestoneId::from(bee_test::rand::milestone::rand_milestone_id());\n\n let bson = to_bson(&milestone_id).unwrap();\n\n assert_eq!(Bson::from(milestone_id), bson);\n\n assert_eq!(milestone_id, from_bson::<MilestoneId>(bson).unwrap());\n\n }\n\n\n\n #[test]\n\n fn test_milestone_payload_bson() {\n\n let payload = get_test_milestone_payload();\n\n let bson = to_bson(&payload).unwrap();\n\n assert_eq!(payload, from_bson::<MilestonePayload>(bson).unwrap());\n","file_path":"src/types/stardust/block/payload/milestone/mod.rs","rank":18,"score":129348.8643037681},{"content":"\n\n fn try_from(value: MilestoneEssence) -> Result<Self, Self::Error> {\n\n bee::MilestoneEssence::new(\n\n value.index.into(),\n\n value.timestamp,\n\n value.previous_milestone_id.into(),\n\n bee_block_stardust::parent::Parents::new(\n\n Vec::from(value.parents).into_iter().map(Into::into).collect::<Vec<_>>(),\n\n )?,\n\n bee_block_stardust::payload::milestone::MerkleRoot::from(value.inclusion_merkle_root),\n\n bee_block_stardust::payload::milestone::MerkleRoot::from(value.applied_merkle_root),\n\n value.metadata,\n\n bee_block_stardust::payload::MilestoneOptions::new(\n\n Vec::from(value.options)\n\n .into_iter()\n\n .map(TryInto::try_into)\n\n .collect::<Result<Vec<_>, _>>()?,\n\n )?,\n\n )\n\n }\n","file_path":"src/types/stardust/block/payload/milestone/mod.rs","rank":19,"score":129348.78188267091},{"content":"}\n\n\n\n#[derive(Clone, Debug, PartialEq, Eq, Serialize, Deserialize)]\n\n#[serde(tag = \"kind\")]\n\npub enum MilestoneOption {\n\n #[serde(rename = \"receipt\")]\n\n Receipt {\n\n migrated_at: MilestoneIndex,\n\n last: bool,\n\n funds: Box<[MigratedFundsEntry]>,\n\n transaction: TreasuryTransactionPayload,\n\n },\n\n #[serde(rename = \"parameters\")]\n\n Parameters {\n\n target_milestone_index: MilestoneIndex,\n\n protocol_version: u8,\n\n binary_parameters: Box<[u8]>,\n\n },\n\n}\n\n\n","file_path":"src/types/stardust/block/payload/milestone/mod.rs","rank":20,"score":129347.25078850386},{"content":" bee_test::rand::milestone::rand_milestone_id(),\n\n bee_test::rand::parents::rand_parents(),\n\n bee_test::rand::milestone::rand_merkle_root(),\n\n bee_test::rand::milestone::rand_merkle_root(),\n\n \"Foo\".as_bytes().to_vec(),\n\n bee::MilestoneOptions::new(vec![bee::option::MilestoneOption::Receipt(\n\n bee::option::ReceiptMilestoneOption::new(\n\n 1.into(),\n\n false,\n\n vec![\n\n get_test_ed25519_migrated_funds_entry().try_into().unwrap(),\n\n get_test_alias_migrated_funds_entry().try_into().unwrap(),\n\n get_test_nft_migrated_funds_entry().try_into().unwrap(),\n\n ],\n\n TreasuryTransactionPayload::new(\n\n bee_test::rand::input::rand_treasury_input(),\n\n bee_test::rand::output::rand_treasury_output(),\n\n )\n\n .unwrap(),\n\n )\n","file_path":"src/types/stardust/block/payload/milestone/mod.rs","rank":21,"score":129345.27595303954},{"content":" const MERKLE_PROOF_LENGTH: usize = bee::MerkleRoot::LENGTH;\n\n}\n\n\n\nimpl From<&bee::MilestoneEssence> for MilestoneEssence {\n\n fn from(value: &bee::MilestoneEssence) -> Self {\n\n Self {\n\n index: value.index().0.into(),\n\n timestamp: value.timestamp(),\n\n previous_milestone_id: (*value.previous_milestone_id()).into(),\n\n parents: value.parents().iter().map(|id| BlockId::from(*id)).collect(),\n\n inclusion_merkle_root: **value.inclusion_merkle_root(),\n\n applied_merkle_root: **value.applied_merkle_root(),\n\n metadata: value.metadata().to_vec(),\n\n options: value.options().iter().map(Into::into).collect(),\n\n }\n\n }\n\n}\n\n\n\nimpl TryFrom<MilestoneEssence> for bee::MilestoneEssence {\n\n type Error = bee_block_stardust::Error;\n","file_path":"src/types/stardust/block/payload/milestone/mod.rs","rank":22,"score":129344.25899800277},{"content":" .unwrap(),\n\n )\n\n }\n\n\n\n pub(crate) fn get_test_nft_migrated_funds_entry() -> MigratedFundsEntry {\n\n MigratedFundsEntry::from(\n\n &bee::option::MigratedFundsEntry::new(\n\n bee::option::TailTransactionHash::new(TAIL_TRANSACTION_HASH3).unwrap(),\n\n bee_block_stardust::address::Address::Nft(bee_test::rand::address::rand_nft_address()),\n\n 2000000,\n\n )\n\n .unwrap(),\n\n )\n\n }\n\n\n\n pub(crate) fn get_test_milestone_essence() -> MilestoneEssence {\n\n MilestoneEssence::from(\n\n &bee::MilestoneEssence::new(\n\n 1.into(),\n\n 12345,\n","file_path":"src/types/stardust/block/payload/milestone/mod.rs","rank":23,"score":129343.34158634528},{"content":" binary_parameters,\n\n } => Self::Parameters(bee::ParametersMilestoneOption::new(\n\n target_milestone_index.into(),\n\n protocol_version,\n\n binary_parameters.into_vec(),\n\n )?),\n\n })\n\n }\n\n}\n\n\n\n#[derive(Copy, Clone, Debug, PartialEq, Eq, Serialize, Deserialize)]\n\npub struct MigratedFundsEntry {\n\n #[serde(with = \"bytify\")]\n\n tail_transaction_hash: [u8; Self::TAIL_TRANSACTION_HASH_LENGTH],\n\n address: Address,\n\n #[serde(with = \"crate::types::util::stringify\")]\n\n amount: u64,\n\n}\n\n\n\nimpl MigratedFundsEntry {\n","file_path":"src/types/stardust/block/payload/milestone/mod.rs","rank":24,"score":129342.34821978457},{"content":" .unwrap(),\n\n )])\n\n .unwrap(),\n\n )\n\n .unwrap(),\n\n )\n\n }\n\n\n\n pub(crate) fn get_test_milestone_payload() -> MilestonePayload {\n\n MilestonePayload::from(\n\n &bee::MilestonePayload::new(\n\n get_test_milestone_essence().try_into().unwrap(),\n\n vec![get_test_signature().try_into().unwrap()],\n\n )\n\n .unwrap(),\n\n )\n\n }\n\n}\n","file_path":"src/types/stardust/block/payload/milestone/mod.rs","rank":25,"score":129342.20252853967},{"content":" value.address.into(),\n\n value.amount,\n\n )\n\n }\n\n}\n\n\n\n#[cfg(test)]\n\npub(crate) mod test {\n\n const TAIL_TRANSACTION_HASH1: [u8; 49] = [\n\n 222, 235, 107, 67, 2, 173, 253, 93, 165, 90, 166, 45, 102, 91, 19, 137, 71, 146, 156, 180, 248, 31, 56, 25, 68,\n\n 154, 98, 100, 64, 108, 203, 48, 76, 75, 114, 150, 34, 153, 203, 35, 225, 120, 194, 175, 169, 207, 80, 229, 10,\n\n ];\n\n const TAIL_TRANSACTION_HASH2: [u8; 49] = [\n\n 222, 235, 107, 67, 2, 173, 253, 93, 165, 90, 166, 45, 102, 91, 19, 137, 71, 146, 156, 180, 248, 31, 56, 25, 68,\n\n 154, 98, 100, 64, 108, 203, 48, 76, 75, 114, 150, 34, 153, 203, 35, 225, 120, 194, 175, 169, 207, 80, 229, 11,\n\n ];\n\n const TAIL_TRANSACTION_HASH3: [u8; 49] = [\n\n 222, 235, 107, 67, 2, 173, 253, 93, 165, 90, 166, 45, 102, 91, 19, 137, 71, 146, 156, 180, 248, 31, 56, 25, 68,\n\n 154, 98, 100, 64, 108, 203, 48, 76, 75, 114, 150, 34, 153, 203, 35, 225, 120, 194, 175, 169, 207, 80, 229, 12,\n\n ];\n","file_path":"src/types/stardust/block/payload/milestone/mod.rs","rank":26,"score":129342.10835923479},{"content":"\n\nimpl From<&bee::MilestonePayload> for MilestonePayload {\n\n fn from(value: &bee::MilestonePayload) -> Self {\n\n Self {\n\n essence: MilestoneEssence::from(value.essence()),\n\n signatures: value.signatures().iter().map(Into::into).collect(),\n\n }\n\n }\n\n}\n\n\n\nimpl TryFrom<MilestonePayload> for bee::MilestonePayload {\n\n type Error = bee_block_stardust::Error;\n\n\n\n fn try_from(value: MilestonePayload) -> Result<Self, Self::Error> {\n\n bee::MilestonePayload::new(\n\n value.essence.try_into()?,\n\n Vec::from(value.signatures)\n\n .into_iter()\n\n .map(Into::into)\n\n .collect::<Vec<_>>(),\n","file_path":"src/types/stardust/block/payload/milestone/mod.rs","rank":27,"score":129342.03759231679},{"content":"impl From<&bee::MilestoneOption> for MilestoneOption {\n\n fn from(value: &bee::MilestoneOption) -> Self {\n\n match value {\n\n bee::MilestoneOption::Receipt(r) => Self::Receipt {\n\n migrated_at: r.migrated_at().into(),\n\n last: r.last(),\n\n funds: r.funds().iter().map(Into::into).collect(),\n\n transaction: r.transaction().into(),\n\n },\n\n bee::MilestoneOption::Parameters(p) => Self::Parameters {\n\n target_milestone_index: p.target_milestone_index().into(),\n\n protocol_version: p.protocol_version(),\n\n binary_parameters: p.binary_parameters().to_owned().into_boxed_slice(),\n\n },\n\n }\n\n }\n\n}\n\n\n\nimpl TryFrom<MilestoneOption> for bee::MilestoneOption {\n\n type Error = bee_block_stardust::Error;\n","file_path":"src/types/stardust/block/payload/milestone/mod.rs","rank":28,"score":129340.52913975384},{"content":" }\n\n\n\n pub(crate) fn get_test_ed25519_migrated_funds_entry() -> MigratedFundsEntry {\n\n MigratedFundsEntry::from(\n\n &bee::option::MigratedFundsEntry::new(\n\n bee::option::TailTransactionHash::new(TAIL_TRANSACTION_HASH1).unwrap(),\n\n bee_block_stardust::address::Address::Ed25519(bee_test::rand::address::rand_ed25519_address()),\n\n 2000000,\n\n )\n\n .unwrap(),\n\n )\n\n }\n\n\n\n pub(crate) fn get_test_alias_migrated_funds_entry() -> MigratedFundsEntry {\n\n MigratedFundsEntry::from(\n\n &bee::option::MigratedFundsEntry::new(\n\n bee::option::TailTransactionHash::new(TAIL_TRANSACTION_HASH2).unwrap(),\n\n bee_block_stardust::address::Address::Alias(bee_test::rand::address::rand_alias_address()),\n\n 2000000,\n\n )\n","file_path":"src/types/stardust/block/payload/milestone/mod.rs","rank":29,"score":129339.66311598828},{"content":"\n\n fn try_from(value: MilestoneOption) -> Result<Self, Self::Error> {\n\n Ok(match value {\n\n MilestoneOption::Receipt {\n\n migrated_at,\n\n last,\n\n funds,\n\n transaction,\n\n } => Self::Receipt(bee::ReceiptMilestoneOption::new(\n\n migrated_at.into(),\n\n last,\n\n Vec::from(funds)\n\n .into_iter()\n\n .map(TryInto::try_into)\n\n .collect::<Result<Vec<_>, _>>()?,\n\n transaction.try_into()?,\n\n )?),\n\n MilestoneOption::Parameters {\n\n target_milestone_index,\n\n protocol_version,\n","file_path":"src/types/stardust/block/payload/milestone/mod.rs","rank":30,"score":129338.22106784781},{"content":" const TAIL_TRANSACTION_HASH_LENGTH: usize = bee::option::TailTransactionHash::LENGTH;\n\n}\n\n\n\nimpl From<&bee::option::MigratedFundsEntry> for MigratedFundsEntry {\n\n fn from(value: &bee::option::MigratedFundsEntry) -> Self {\n\n Self {\n\n // Unwrap: Should not fail as the length is defined by the struct\n\n tail_transaction_hash: value.tail_transaction_hash().as_ref().try_into().unwrap(),\n\n address: (*value.address()).into(),\n\n amount: value.amount(),\n\n }\n\n }\n\n}\n\n\n\nimpl TryFrom<MigratedFundsEntry> for bee::option::MigratedFundsEntry {\n\n type Error = bee_block_stardust::Error;\n\n\n\n fn try_from(value: MigratedFundsEntry) -> Result<Self, Self::Error> {\n\n Self::new(\n\n bee::option::TailTransactionHash::new(value.tail_transaction_hash)?,\n","file_path":"src/types/stardust/block/payload/milestone/mod.rs","rank":31,"score":129336.41802715464},{"content":"#[allow(missing_docs)]\n\npub trait AsyncFn<'a, O> {\n\n type Output: 'a + Future<Output = O> + Send;\n\n fn call(self, cx: &'a mut RuntimeScope) -> Self::Output;\n\n}\n\nimpl<'a, Fn, Fut, O> AsyncFn<'a, O> for Fn\n\nwhere\n\n Fn: FnOnce(&'a mut RuntimeScope) -> Fut,\n\n Fut: 'a + Future<Output = O> + Send,\n\n{\n\n type Output = Fut;\n\n fn call(self, cx: &'a mut RuntimeScope) -> Self::Output {\n\n (self)(cx)\n\n }\n\n}\n\n\n\n/// Starting point for the runtime.\n\npub struct Runtime;\n\n\n\nimpl Runtime {\n\n /// Launches a new root runtime scope.\n","file_path":"src/runtime/mod.rs","rank":32,"score":114329.4486232494},{"content":"pub struct SpentMetadata {\n\n pub transaction_id: TransactionId,\n\n pub spent: MilestoneIndexTimestamp,\n\n}\n\n\n\n/// Block metadata.\n\n#[derive(Clone, Debug, Serialize, Deserialize)]\n\npub struct OutputMetadata {\n\n pub output_id: OutputId,\n\n pub block_id: BlockId,\n\n pub transaction_id: TransactionId,\n\n pub booked: MilestoneIndexTimestamp,\n\n pub spent: Option<SpentMetadata>,\n\n}\n\n\n\npub struct OutputWithMetadata {\n\n pub output: Output,\n\n pub metadata: OutputMetadata,\n\n}\n\n\n","file_path":"src/types/ledger/output_metadata.rs","rank":33,"score":103354.92735694497},{"content":"// Copyright 2022 IOTA Stiftung\n\n// SPDX-License-Identifier: Apache-2.0\n\n\n\nuse serde::{Deserialize, Serialize};\n\n\n\nuse crate::types::{\n\n stardust::{\n\n block::{BlockId, Output, OutputId, TransactionId},\n\n milestone::MilestoneTimestamp,\n\n },\n\n tangle::MilestoneIndex,\n\n};\n\n\n\n#[derive(Clone, Debug, Serialize, Deserialize)]\n\npub struct MilestoneIndexTimestamp {\n\n pub milestone_index: MilestoneIndex,\n\n pub milestone_timestamp: MilestoneTimestamp,\n\n}\n\n\n\n#[derive(Clone, Debug, Serialize, Deserialize)]\n","file_path":"src/types/ledger/output_metadata.rs","rank":34,"score":103351.14616774209},{"content":"#[cfg(feature = \"inx\")]\n\nimpl From<inx::LedgerOutput> for OutputWithMetadata {\n\n fn from(value: inx::LedgerOutput) -> Self {\n\n let output_id = OutputId::from(value.output_id);\n\n let metadata = OutputMetadata {\n\n output_id,\n\n block_id: value.block_id.into(),\n\n transaction_id: output_id.transaction_id,\n\n booked: MilestoneIndexTimestamp {\n\n milestone_index: value.milestone_index_booked.into(),\n\n milestone_timestamp: value.milestone_timestamp_booked.into(),\n\n },\n\n spent: None,\n\n };\n\n Self {\n\n output: (&value.output).into(),\n\n metadata,\n\n }\n\n }\n\n}\n","file_path":"src/types/ledger/output_metadata.rs","rank":35,"score":103349.88685232421},{"content":"\n\n#[cfg(feature = \"inx\")]\n\nimpl From<inx::LedgerSpent> for OutputWithMetadata {\n\n fn from(value: inx::LedgerSpent) -> Self {\n\n let mut output_with_metadata = OutputWithMetadata::from(value.output);\n\n\n\n output_with_metadata.metadata.spent = Some(SpentMetadata {\n\n transaction_id: value.transaction_id_spent.into(),\n\n spent: MilestoneIndexTimestamp {\n\n milestone_index: value.milestone_index_spent.into(),\n\n milestone_timestamp: value.milestone_timestamp_spent.into(),\n\n },\n\n });\n\n\n\n output_with_metadata\n\n }\n\n}\n","file_path":"src/types/ledger/output_metadata.rs","rank":36,"score":103346.91862958245},{"content":"// Copyright 2022 IOTA Stiftung\n\n// SPDX-License-Identifier: Apache-2.0\n\n\n\nuse serde::{Deserialize, Serialize};\n\n\n\nuse super::{ConflictReason, LedgerInclusionState};\n\nuse crate::types::{stardust::block::BlockId, tangle::MilestoneIndex};\n\n\n\n/// Block metadata.\n\n#[derive(Clone, Debug, Serialize, Deserialize)]\n\npub struct BlockMetadata {\n\n /// The id of the corresponding block.\n\n pub block_id: BlockId,\n\n /// The parents of the corresponding block.\n\n pub parents: Box<[BlockId]>,\n\n /// Status of the solidification process.\n\n pub is_solid: bool,\n\n /// Indicates that the block should be promoted.\n\n pub should_promote: bool,\n\n /// Indicates that the block should be reattached.\n","file_path":"src/types/ledger/block_metadata.rs","rank":37,"score":100939.79969603356},{"content":" pub should_reattach: bool,\n\n /// The milestone index referencing the block.\n\n pub referenced_by_milestone_index: MilestoneIndex,\n\n /// The corresponding milestone index.\n\n pub milestone_index: MilestoneIndex,\n\n /// The inclusion state of the block.\n\n pub inclusion_state: LedgerInclusionState,\n\n /// If the ledger inclusion state is conflicting, the reason for the conflict.\n\n pub conflict_reason: ConflictReason,\n\n}\n\n\n\n#[cfg(feature = \"inx\")]\n\nimpl From<inx::BlockMetadata> for BlockMetadata {\n\n fn from(metadata: inx::BlockMetadata) -> Self {\n\n Self {\n\n block_id: metadata.block_id.into(),\n\n parents: metadata.parents.into_iter().map(|id| id.into()).collect(),\n\n is_solid: metadata.is_solid,\n\n should_promote: metadata.should_promote,\n\n should_reattach: metadata.should_reattach,\n\n referenced_by_milestone_index: metadata.referenced_by_milestone_index.into(),\n\n milestone_index: metadata.milestone_index.into(),\n\n inclusion_state: metadata.ledger_inclusion_state.into(),\n\n conflict_reason: metadata.conflict_reason.into(),\n\n }\n\n }\n\n}\n","file_path":"src/types/ledger/block_metadata.rs","rank":38,"score":100938.44387855426},{"content":"/// Spawn a tokio task. The provided name will be used to configure the task if console tracing is enabled.\n\npub fn spawn_task<F>(name: &str, task: F) -> tokio::task::JoinHandle<F::Output>\n\nwhere\n\n F: 'static + Future + Send,\n\n F::Output: 'static + Send,\n\n{\n\n log::trace!(\"Spawning task {}\", name);\n\n #[cfg(all(tokio_unstable, feature = \"console\"))]\n\n return tokio::task::Builder::new().name(name).spawn(task);\n\n #[cfg(not(all(tokio_unstable, feature = \"console\")))]\n\n return tokio::spawn(task);\n\n}\n","file_path":"src/runtime/mod.rs","rank":39,"score":99117.31356198348},{"content":"// Copyright 2022 IOTA Stiftung\n\n// SPDX-License-Identifier: Apache-2.0\n\n\n\nuse bee_block_stardust::payload as bee;\n\nuse serde::{Deserialize, Serialize};\n\n\n\nmod milestone;\n\nmod tagged_data;\n\nmod transaction;\n\nmod treasury_transaction;\n\n\n\npub use self::{\n\n milestone::{MilestoneEssence, MilestoneId, MilestoneOption, MilestonePayload},\n\n tagged_data::TaggedDataPayload,\n\n transaction::{TransactionEssence, TransactionId, TransactionPayload},\n\n treasury_transaction::TreasuryTransactionPayload,\n\n};\n\n\n\n#[derive(Clone, Debug, PartialEq, Eq, Serialize, Deserialize)]\n\n#[serde(tag = \"kind\")]\n","file_path":"src/types/stardust/block/payload/mod.rs","rank":40,"score":97747.76516629719},{"content":"}\n\n\n\nimpl TryFrom<Payload> for bee::Payload {\n\n type Error = bee_block_stardust::Error;\n\n\n\n fn try_from(value: Payload) -> Result<Self, Self::Error> {\n\n Ok(match value {\n\n Payload::Transaction(p) => bee::Payload::Transaction(Box::new((*p).try_into()?)),\n\n Payload::Milestone(p) => bee::Payload::Milestone(Box::new((*p).try_into()?)),\n\n Payload::TreasuryTransaction(p) => bee::Payload::TreasuryTransaction(Box::new((*p).try_into()?)),\n\n Payload::TaggedData(p) => bee::Payload::TaggedData(Box::new((*p).try_into()?)),\n\n })\n\n }\n\n}\n\n\n\n#[cfg(test)]\n\npub(crate) mod test {\n\n use mongodb::bson::{from_bson, to_bson};\n\n\n\n use super::{milestone, tagged_data, transaction, treasury_transaction, *};\n","file_path":"src/types/stardust/block/payload/mod.rs","rank":41,"score":97746.7027412807},{"content":" pub(crate) fn get_test_transaction_payload() -> Payload {\n\n Payload::Transaction(Box::new(transaction::test::get_test_transaction_payload()))\n\n }\n\n\n\n pub(crate) fn get_test_milestone_payload() -> Payload {\n\n Payload::Milestone(Box::new(milestone::test::get_test_milestone_payload()))\n\n }\n\n\n\n pub(crate) fn get_test_treasury_transaction_payload() -> Payload {\n\n Payload::TreasuryTransaction(Box::new(\n\n treasury_transaction::test::get_test_treasury_transaction_payload(),\n\n ))\n\n }\n\n\n\n pub(crate) fn get_test_tagged_data_payload() -> Payload {\n\n Payload::TaggedData(Box::new(tagged_data::test::get_test_tagged_data_payload()))\n\n }\n\n}\n","file_path":"src/types/stardust/block/payload/mod.rs","rank":42,"score":97742.93375341487},{"content":"pub enum Payload {\n\n #[serde(rename = \"transaction\")]\n\n Transaction(Box<TransactionPayload>),\n\n #[serde(rename = \"milestone\")]\n\n Milestone(Box<MilestonePayload>),\n\n #[serde(rename = \"treasury_transaction\")]\n\n TreasuryTransaction(Box<TreasuryTransactionPayload>),\n\n #[serde(rename = \"tagged_data\")]\n\n TaggedData(Box<TaggedDataPayload>),\n\n}\n\n\n\nimpl From<&bee::Payload> for Payload {\n\n fn from(value: &bee::Payload) -> Self {\n\n match value {\n\n bee::Payload::Transaction(p) => Self::Transaction(Box::new(p.as_ref().into())),\n\n bee::Payload::Milestone(p) => Self::Milestone(Box::new(p.as_ref().into())),\n\n bee::Payload::TreasuryTransaction(p) => Self::TreasuryTransaction(Box::new(p.as_ref().into())),\n\n bee::Payload::TaggedData(p) => Self::TaggedData(Box::new(p.as_ref().into())),\n\n }\n\n }\n","file_path":"src/types/stardust/block/payload/mod.rs","rank":43,"score":97741.42557414039},{"content":"\n\n #[test]\n\n fn test_payload_bson() {\n\n let payload = get_test_transaction_payload();\n\n let bson = to_bson(&payload).unwrap();\n\n assert_eq!(payload, from_bson::<Payload>(bson).unwrap());\n\n\n\n let payload = get_test_milestone_payload();\n\n let bson = to_bson(&payload).unwrap();\n\n assert_eq!(payload, from_bson::<Payload>(bson).unwrap());\n\n\n\n let payload = get_test_treasury_transaction_payload();\n\n let bson = to_bson(&payload).unwrap();\n\n assert_eq!(payload, from_bson::<Payload>(bson).unwrap());\n\n\n\n let payload = get_test_tagged_data_payload();\n\n let bson = to_bson(&payload).unwrap();\n\n assert_eq!(payload, from_bson::<Payload>(bson).unwrap());\n\n }\n\n\n","file_path":"src/types/stardust/block/payload/mod.rs","rank":44,"score":97736.38158374898},{"content":"pub use self::{\n\n alias::{AliasId, AliasOutput},\n\n basic::BasicOutput,\n\n feature::Feature,\n\n foundry::FoundryOutput,\n\n native_token::{NativeToken, TokenScheme},\n\n nft::{NftId, NftOutput},\n\n treasury::TreasuryOutput,\n\n unlock_condition::UnlockCondition,\n\n};\n\nuse super::Address;\n\nuse crate::types::stardust::block::TransactionId;\n\n\n\npub type OutputAmount = u64;\n\npub type OutputIndex = u16;\n\n\n\n#[derive(Copy, Clone, Debug, PartialEq, Eq, Serialize, Deserialize)]\n\npub struct OutputId {\n\n pub transaction_id: TransactionId,\n\n pub index: OutputIndex,\n","file_path":"src/types/stardust/block/output/mod.rs","rank":45,"score":96955.51244849453},{"content":"// Copyright 2022 IOTA Stiftung\n\n// SPDX-License-Identifier: Apache-2.0\n\n\n\nuse bee_block_stardust::output::feature as bee;\n\nuse serde::{Deserialize, Serialize};\n\n\n\nuse crate::types::stardust::block::Address;\n\n\n\n#[derive(Clone, Debug, PartialEq, Eq, Serialize, Deserialize)]\n\n#[serde(tag = \"kind\")]\n\npub enum Feature {\n\n #[serde(rename = \"sender\")]\n\n Sender { address: Address },\n\n #[serde(rename = \"issuer\")]\n\n Issuer { address: Address },\n\n #[serde(rename = \"metadata\")]\n\n Metadata {\n\n #[serde(with = \"serde_bytes\")]\n\n data: Box<[u8]>,\n\n },\n","file_path":"src/types/stardust/block/output/feature.rs","rank":46,"score":96955.43962970749},{"content":"// Copyright 2022 IOTA Stiftung\n\n// SPDX-License-Identifier: Apache-2.0\n\n\n\nuse std::str::FromStr;\n\n\n\nuse bee_block_stardust::output as bee;\n\nuse mongodb::bson::{spec::BinarySubtype, Binary, Bson};\n\nuse serde::{Deserialize, Serialize};\n\n\n\nuse super::{Feature, NativeToken, OutputAmount, UnlockCondition};\n\nuse crate::types::util::bytify;\n\n\n\n#[derive(Copy, Clone, Debug, PartialEq, Eq, Serialize, Deserialize)]\n\n#[serde(transparent)]\n\npub struct NftId(#[serde(with = \"bytify\")] pub [u8; Self::LENGTH]);\n\n\n\nimpl NftId {\n\n const LENGTH: usize = bee::NftId::LENGTH;\n\n\n\n pub fn from_output_id_str(s: &str) -> Result<Self, bee_block_stardust::Error> {\n","file_path":"src/types/stardust/block/output/nft.rs","rank":47,"score":96953.5296143417},{"content":"// Copyright 2022 IOTA Stiftung\n\n// SPDX-License-Identifier: Apache-2.0\n\n\n\nuse std::str::FromStr;\n\n\n\nuse bee_block_stardust::output as bee;\n\nuse mongodb::bson::{spec::BinarySubtype, Binary, Bson};\n\nuse serde::{Deserialize, Serialize};\n\n\n\nuse super::{feature::Feature, native_token::NativeToken, unlock_condition::UnlockCondition, OutputAmount};\n\nuse crate::types::util::bytify;\n\n\n\n#[derive(Copy, Clone, Debug, PartialEq, Eq, Serialize, Deserialize)]\n\n#[serde(transparent)]\n\npub struct AliasId(#[serde(with = \"bytify\")] pub [u8; Self::LENGTH]);\n\n\n\nimpl AliasId {\n\n const LENGTH: usize = bee::AliasId::LENGTH;\n\n\n\n pub fn from_output_id_str(s: &str) -> Result<Self, bee_block_stardust::Error> {\n","file_path":"src/types/stardust/block/output/alias.rs","rank":48,"score":96953.26400668887},{"content":" .into_iter()\n\n .map(TryInto::try_into)\n\n .collect::<Result<Vec<_>, _>>()?,\n\n )\n\n .finish()\n\n }\n\n}\n\n\n\n#[cfg(test)]\n\npub(crate) mod test {\n\n use mongodb::bson::{from_bson, to_bson};\n\n\n\n use super::*;\n\n use crate::types::stardust::block::output::{\n\n feature::test::get_test_metadata_block,\n\n native_token::test::get_test_native_token,\n\n unlock_condition::test::{get_test_alias_address_as_address, get_test_immut_alias_address_condition},\n\n };\n\n\n\n #[test]\n","file_path":"src/types/stardust/block/output/foundry.rs","rank":49,"score":96952.11374456997},{"content":" use crate::types::stardust::block::output::{\n\n feature::test::{get_test_metadata_block, get_test_sender_block, get_test_tag_block},\n\n native_token::test::get_test_native_token,\n\n unlock_condition::test::{\n\n get_test_address_condition, get_test_expiration_condition, get_test_storage_deposit_return_condition,\n\n get_test_timelock_condition,\n\n },\n\n };\n\n\n\n #[test]\n\n fn test_basic_output_bson() {\n\n let output = get_test_basic_output();\n\n let bson = to_bson(&output).unwrap();\n\n assert_eq!(output, from_bson::<BasicOutput>(bson).unwrap());\n\n }\n\n\n\n pub(crate) fn get_test_basic_output() -> BasicOutput {\n\n BasicOutput::from(\n\n &bee::BasicOutput::build_with_amount(100)\n\n .unwrap()\n","file_path":"src/types/stardust/block/output/basic.rs","rank":50,"score":96951.86005502268},{"content":" .with_immutable_features(\n\n Vec::from(value.immutable_features)\n\n .into_iter()\n\n .map(TryInto::try_into)\n\n .collect::<Result<Vec<_>, _>>()?,\n\n )\n\n .finish()\n\n }\n\n}\n\n\n\n#[cfg(test)]\n\npub(crate) mod test {\n\n use mongodb::bson::{from_bson, to_bson};\n\n\n\n use super::*;\n\n use crate::types::stardust::block::output::{\n\n feature::test::{get_test_issuer_block, get_test_metadata_block, get_test_sender_block, get_test_tag_block},\n\n native_token::test::get_test_native_token,\n\n unlock_condition::test::{\n\n get_test_address_condition, get_test_expiration_condition, get_test_storage_deposit_return_condition,\n","file_path":"src/types/stardust/block/output/nft.rs","rank":51,"score":96951.63389101074},{"content":"\n\n#[cfg(test)]\n\npub(crate) mod test {\n\n use mongodb::bson::{from_bson, to_bson};\n\n\n\n use super::*;\n\n use crate::types::stardust::block::output::{\n\n feature::test::{get_test_issuer_block, get_test_metadata_block, get_test_sender_block},\n\n native_token::test::get_test_native_token,\n\n unlock_condition::test::{get_test_governor_address_condition, get_test_state_controller_address_condition},\n\n };\n\n\n\n #[test]\n\n fn test_alias_id_bson() {\n\n let alias_id = AliasId::from(bee_test::rand::output::rand_alias_id());\n\n let bson = to_bson(&alias_id).unwrap();\n\n assert_eq!(Bson::from(alias_id), bson);\n\n assert_eq!(alias_id, from_bson::<AliasId>(bson).unwrap());\n\n }\n\n\n","file_path":"src/types/stardust/block/output/alias.rs","rank":52,"score":96951.44045329442},{"content":"// Copyright 2022 IOTA Stiftung\n\n// SPDX-License-Identifier: Apache-2.0\n\n\n\nuse bee_block_stardust::output as bee;\n\nuse serde::{Deserialize, Serialize};\n\n\n\nuse super::{Feature, NativeToken, OutputAmount, UnlockCondition};\n\n\n\n#[derive(Clone, Debug, PartialEq, Eq, Serialize, Deserialize)]\n\npub struct BasicOutput {\n\n #[serde(with = \"crate::types::util::stringify\")]\n\n pub amount: OutputAmount,\n\n pub native_tokens: Box<[NativeToken]>,\n\n pub unlock_conditions: Box<[UnlockCondition]>,\n\n pub features: Box<[Feature]>,\n\n}\n\n\n\nimpl From<&bee::BasicOutput> for BasicOutput {\n\n fn from(value: &bee::BasicOutput) -> Self {\n\n Self {\n","file_path":"src/types/stardust/block/output/basic.rs","rank":53,"score":96951.16841045592},{"content":"// Copyright 2022 IOTA Stiftung\n\n// SPDX-License-Identifier: Apache-2.0\n\n\n\nuse bee_block_stardust::output as bee;\n\nuse serde::{Deserialize, Serialize};\n\n\n\nuse super::{Feature, NativeToken, OutputAmount, TokenScheme, UnlockCondition};\n\n\n\n#[derive(Clone, Debug, PartialEq, Eq, Serialize, Deserialize)]\n\npub struct FoundryOutput {\n\n #[serde(with = \"crate::types::util::stringify\")]\n\n pub amount: OutputAmount,\n\n pub native_tokens: Box<[NativeToken]>,\n\n #[serde(with = \"crate::types::util::stringify\")]\n\n pub serial_number: u32,\n\n pub token_scheme: TokenScheme,\n\n pub unlock_conditions: Box<[UnlockCondition]>,\n\n pub features: Box<[Feature]>,\n\n pub immutable_features: Box<[Feature]>,\n\n}\n","file_path":"src/types/stardust/block/output/foundry.rs","rank":54,"score":96950.68784180892},{"content":"// Copyright 2022 IOTA Stiftung\n\n// SPDX-License-Identifier: Apache-2.0\n\n\n\nuse bee_block_stardust::output as bee;\n\nuse serde::{Deserialize, Serialize};\n\n\n\n#[derive(Copy, Clone, Debug, PartialEq, Eq, Serialize, Deserialize)]\n\npub struct TreasuryOutput {\n\n #[serde(with = \"crate::types::util::stringify\")]\n\n amount: u64,\n\n}\n\n\n\nimpl From<&bee::TreasuryOutput> for TreasuryOutput {\n\n fn from(value: &bee::TreasuryOutput) -> Self {\n\n Self { amount: value.amount() }\n\n }\n\n}\n\n\n\nimpl TryFrom<TreasuryOutput> for bee::TreasuryOutput {\n\n type Error = bee_block_stardust::Error;\n","file_path":"src/types/stardust/block/output/treasury.rs","rank":55,"score":96950.39550187178},{"content":" pub state_index: u32,\n\n #[serde(with = \"serde_bytes\")]\n\n pub state_metadata: Box<[u8]>,\n\n pub foundry_counter: u32,\n\n pub unlock_conditions: Box<[UnlockCondition]>,\n\n pub features: Box<[Feature]>,\n\n pub immutable_features: Box<[Feature]>,\n\n}\n\n\n\nimpl From<&bee::AliasOutput> for AliasOutput {\n\n fn from(value: &bee::AliasOutput) -> Self {\n\n Self {\n\n amount: value.amount(),\n\n native_tokens: value.native_tokens().iter().map(Into::into).collect(),\n\n alias_id: (*value.alias_id()).into(),\n\n state_index: value.state_index(),\n\n state_metadata: value.state_metadata().to_vec().into_boxed_slice(),\n\n foundry_counter: value.foundry_counter(),\n\n unlock_conditions: value.unlock_conditions().iter().map(Into::into).collect(),\n\n features: value.features().iter().map(Into::into).collect(),\n","file_path":"src/types/stardust/block/output/alias.rs","rank":56,"score":96950.08191236915},{"content":"// Copyright 2022 IOTA Stiftung\n\n// SPDX-License-Identifier: Apache-2.0\n\n\n\nmod feature;\n\nmod native_token;\n\nmod unlock_condition;\n\n\n\n// The different output types\n\nmod alias;\n\nmod basic;\n\nmod foundry;\n\nmod nft;\n\npub(crate) mod treasury;\n\n\n\nuse std::str::FromStr;\n\n\n\nuse bee_block_stardust::output as bee;\n\nuse mongodb::bson::{doc, Bson};\n\nuse serde::{Deserialize, Serialize};\n\n\n","file_path":"src/types/stardust/block/output/mod.rs","rank":57,"score":96949.94756166391},{"content":" fn test_foundry_output_bson() {\n\n let output = get_test_foundry_output();\n\n let bson = to_bson(&output).unwrap();\n\n assert_eq!(output, from_bson::<FoundryOutput>(bson).unwrap());\n\n }\n\n\n\n pub(crate) fn get_test_foundry_output() -> FoundryOutput {\n\n FoundryOutput::from(\n\n &bee::FoundryOutput::build_with_amount(\n\n 100,\n\n bee_test::rand::number::rand_number(),\n\n bee::TokenScheme::Simple(bee::SimpleTokenScheme::new(250.into(), 200.into(), 300.into()).unwrap()),\n\n )\n\n .unwrap()\n\n .with_native_tokens(vec![get_test_native_token().try_into().unwrap()])\n\n .with_unlock_conditions(vec![\n\n get_test_immut_alias_address_condition(get_test_alias_address_as_address())\n\n .try_into()\n\n .unwrap(),\n\n ])\n\n .with_features(vec![get_test_metadata_block().try_into().unwrap()])\n\n .with_immutable_features(vec![get_test_metadata_block().try_into().unwrap()])\n\n .finish()\n\n .unwrap(),\n\n )\n\n }\n\n}\n","file_path":"src/types/stardust/block/output/foundry.rs","rank":58,"score":96949.39217722006},{"content":"pub(crate) mod test {\n\n use mongodb::bson::{from_bson, to_bson};\n\n\n\n use super::*;\n\n\n\n #[test]\n\n fn test_feature_bson() {\n\n let block = get_test_sender_block(bee_test::rand::address::rand_address().into());\n\n let bson = to_bson(&block).unwrap();\n\n assert_eq!(block, from_bson::<Feature>(bson).unwrap());\n\n\n\n let block = get_test_issuer_block(bee_test::rand::address::rand_address().into());\n\n let bson = to_bson(&block).unwrap();\n\n assert_eq!(block, from_bson::<Feature>(bson).unwrap());\n\n\n\n let block = get_test_metadata_block();\n\n let bson = to_bson(&block).unwrap();\n\n assert_eq!(block, from_bson::<Feature>(bson).unwrap());\n\n\n\n let block = get_test_tag_block();\n","file_path":"src/types/stardust/block/output/feature.rs","rank":59,"score":96949.0296664848},{"content":" let bson = to_bson(&block).unwrap();\n\n assert_eq!(block, from_bson::<Feature>(bson).unwrap());\n\n }\n\n\n\n pub(crate) fn get_test_sender_block(address: Address) -> Feature {\n\n Feature::Sender { address }\n\n }\n\n\n\n pub(crate) fn get_test_issuer_block(address: Address) -> Feature {\n\n Feature::Issuer { address }\n\n }\n\n\n\n pub(crate) fn get_test_metadata_block() -> Feature {\n\n Feature::Metadata {\n\n data: \"Foo\".as_bytes().to_vec().into_boxed_slice(),\n\n }\n\n }\n\n\n\n pub(crate) fn get_test_tag_block() -> Feature {\n\n Feature::Tag {\n\n data: \"Bar\".as_bytes().to_vec().into_boxed_slice(),\n\n }\n\n }\n\n}\n","file_path":"src/types/stardust/block/output/feature.rs","rank":60,"score":96948.26689028397},{"content":"}\n\n\n\nimpl From<bee::OutputId> for OutputId {\n\n fn from(value: bee::OutputId) -> Self {\n\n Self {\n\n transaction_id: (*value.transaction_id()).into(),\n\n index: value.index(),\n\n }\n\n }\n\n}\n\n\n\nimpl TryFrom<OutputId> for bee::OutputId {\n\n type Error = bee_block_stardust::Error;\n\n\n\n fn try_from(value: OutputId) -> Result<Self, Self::Error> {\n\n bee::OutputId::new(value.transaction_id.into(), value.index)\n\n }\n\n}\n\n\n\nimpl FromStr for OutputId {\n","file_path":"src/types/stardust/block/output/mod.rs","rank":61,"score":96948.2397301242},{"content":"\n\n fn try_from(value: TreasuryOutput) -> Result<Self, Self::Error> {\n\n Self::new(value.amount)\n\n }\n\n}\n\n\n\n#[cfg(test)]\n\npub(crate) mod test {\n\n use mongodb::bson::{from_bson, to_bson};\n\n\n\n use super::*;\n\n\n\n #[test]\n\n fn test_treasury_output_bson() {\n\n let output = TreasuryOutput::from(&bee_test::rand::output::rand_treasury_output());\n\n let bson = to_bson(&output).unwrap();\n\n assert_eq!(output, from_bson::<TreasuryOutput>(bson).unwrap());\n\n }\n\n}\n","file_path":"src/types/stardust/block/output/treasury.rs","rank":62,"score":96947.52891419535},{"content":" fn try_from(value: Output) -> Result<Self, Self::Error> {\n\n Ok(match value {\n\n Output::Treasury(o) => bee::Output::Treasury(o.try_into()?),\n\n Output::Basic(o) => bee::Output::Basic(o.try_into()?),\n\n Output::Alias(o) => bee::Output::Alias(o.try_into()?),\n\n Output::Foundry(o) => bee::Output::Foundry(o.try_into()?),\n\n Output::Nft(o) => bee::Output::Nft(o.try_into()?),\n\n })\n\n }\n\n}\n\n\n\n#[cfg(test)]\n\npub(crate) mod test {\n\n use mongodb::bson::{from_bson, to_bson};\n\n\n\n use super::{alias, basic, foundry, nft, *};\n\n\n\n #[test]\n\n fn test_output_id_bson() {\n\n let output_id = OutputId::from(bee_test::rand::output::rand_output_id());\n","file_path":"src/types/stardust/block/output/mod.rs","rank":63,"score":96947.20948343718},{"content":" immutable_features: value.immutable_features().iter().map(Into::into).collect(),\n\n }\n\n }\n\n}\n\n\n\nimpl TryFrom<AliasOutput> for bee::AliasOutput {\n\n type Error = bee_block_stardust::Error;\n\n\n\n fn try_from(value: AliasOutput) -> Result<Self, Self::Error> {\n\n Self::build_with_amount(value.amount, value.alias_id.into())?\n\n .with_native_tokens(\n\n Vec::from(value.native_tokens)\n\n .into_iter()\n\n .map(TryInto::try_into)\n\n .collect::<Result<Vec<_>, _>>()?,\n\n )\n\n .with_state_index(value.state_index)\n\n .with_state_metadata(value.state_metadata.into())\n\n .with_foundry_counter(value.foundry_counter)\n\n .with_unlock_conditions(\n","file_path":"src/types/stardust/block/output/alias.rs","rank":64,"score":96946.52582661774},{"content":" pub features: Box<[Feature]>,\n\n pub immutable_features: Box<[Feature]>,\n\n}\n\n\n\nimpl From<&bee::NftOutput> for NftOutput {\n\n fn from(value: &bee::NftOutput) -> Self {\n\n Self {\n\n amount: value.amount(),\n\n native_tokens: value.native_tokens().iter().map(Into::into).collect(),\n\n nft_id: (*value.nft_id()).into(),\n\n unlock_conditions: value.unlock_conditions().iter().map(Into::into).collect(),\n\n features: value.features().iter().map(Into::into).collect(),\n\n immutable_features: value.immutable_features().iter().map(Into::into).collect(),\n\n }\n\n }\n\n}\n\n\n\nimpl TryFrom<NftOutput> for bee::NftOutput {\n\n type Error = bee_block_stardust::Error;\n\n\n","file_path":"src/types/stardust/block/output/nft.rs","rank":65,"score":96946.25832120834},{"content":" type Err = bee_block_stardust::Error;\n\n\n\n fn from_str(s: &str) -> Result<Self, Self::Err> {\n\n Ok(bee::OutputId::from_str(s)?.into())\n\n }\n\n}\n\n\n\nimpl From<OutputId> for Bson {\n\n fn from(val: OutputId) -> Self {\n\n // Unwrap: Cannot fail as type is well defined\n\n mongodb::bson::to_bson(&val).unwrap()\n\n }\n\n}\n\n\n\n#[derive(Clone, Debug, PartialEq, Eq, Serialize, Deserialize)]\n\n#[serde(tag = \"kind\")]\n\npub enum Output {\n\n #[serde(rename = \"treasury\")]\n\n Treasury(TreasuryOutput),\n\n #[serde(rename = \"basic\")]\n","file_path":"src/types/stardust/block/output/mod.rs","rank":66,"score":96946.0531068816},{"content":" #[test]\n\n fn test_alias_output_bson() {\n\n let output = get_test_alias_output();\n\n let bson = to_bson(&output).unwrap();\n\n assert_eq!(output, from_bson::<AliasOutput>(bson).unwrap());\n\n }\n\n\n\n pub(crate) fn get_test_alias_output() -> AliasOutput {\n\n AliasOutput::from(\n\n &bee::AliasOutput::build_with_amount(100, bee_test::rand::output::rand_alias_id())\n\n .unwrap()\n\n .with_native_tokens(vec![get_test_native_token().try_into().unwrap()])\n\n .with_state_index(0)\n\n .with_state_metadata(\"Foo\".as_bytes().to_vec())\n\n .with_foundry_counter(0)\n\n .with_unlock_conditions(vec![\n\n get_test_state_controller_address_condition(bee_test::rand::address::rand_address().into())\n\n .try_into()\n\n .unwrap(),\n\n get_test_governor_address_condition(bee_test::rand::address::rand_address().into())\n","file_path":"src/types/stardust/block/output/alias.rs","rank":67,"score":96945.56570078425},{"content":" assert_eq!(output, from_bson::<Output>(bson).unwrap());\n\n\n\n let output = Output::from(&bee::Output::Treasury(bee_test::rand::output::rand_treasury_output()));\n\n let bson = to_bson(&output).unwrap();\n\n assert_eq!(output, from_bson::<Output>(bson).unwrap());\n\n }\n\n\n\n pub(crate) fn get_test_alias_output() -> Output {\n\n Output::Alias(alias::test::get_test_alias_output())\n\n }\n\n\n\n pub(crate) fn get_test_basic_output() -> Output {\n\n Output::Basic(basic::test::get_test_basic_output())\n\n }\n\n\n\n pub(crate) fn get_test_foundry_output() -> Output {\n\n Output::Foundry(foundry::test::get_test_foundry_output())\n\n }\n\n\n\n pub(crate) fn get_test_nft_output() -> Output {\n\n Output::Nft(nft::test::get_test_nft_output())\n\n }\n\n}\n","file_path":"src/types/stardust/block/output/mod.rs","rank":68,"score":96945.18269741761},{"content":" .with_features(vec![\n\n get_test_sender_block(bee_test::rand::address::rand_address().into())\n\n .try_into()\n\n .unwrap(),\n\n get_test_metadata_block().try_into().unwrap(),\n\n get_test_tag_block().try_into().unwrap(),\n\n ])\n\n .with_immutable_features(vec![\n\n get_test_issuer_block(bee_test::rand::address::rand_address().into())\n\n .try_into()\n\n .unwrap(),\n\n get_test_metadata_block().try_into().unwrap(),\n\n ])\n\n .finish()\n\n .unwrap(),\n\n )\n\n }\n\n}\n","file_path":"src/types/stardust/block/output/nft.rs","rank":69,"score":96944.89703433243},{"content":" .try_into()\n\n .unwrap(),\n\n ])\n\n .with_features(vec![\n\n get_test_sender_block(bee_test::rand::address::rand_address().into())\n\n .try_into()\n\n .unwrap(),\n\n get_test_metadata_block().try_into().unwrap(),\n\n ])\n\n .with_immutable_features(vec![\n\n get_test_issuer_block(bee_test::rand::address::rand_address().into())\n\n .try_into()\n\n .unwrap(),\n\n get_test_metadata_block().try_into().unwrap(),\n\n ])\n\n .finish()\n\n .unwrap(),\n\n )\n\n }\n\n}\n","file_path":"src/types/stardust/block/output/alias.rs","rank":70,"score":96944.85466524334},{"content":" .collect(),\n\n }\n\n }\n\n}\n\n\n\nimpl From<&bee::Output> for Output {\n\n fn from(value: &bee::Output) -> Self {\n\n match value {\n\n bee::Output::Treasury(o) => Self::Treasury(o.into()),\n\n bee::Output::Basic(o) => Self::Basic(o.into()),\n\n bee::Output::Alias(o) => Self::Alias(o.into()),\n\n bee::Output::Foundry(o) => Self::Foundry(o.into()),\n\n bee::Output::Nft(o) => Self::Nft(o.into()),\n\n }\n\n }\n\n}\n\n\n\nimpl TryFrom<Output> for bee::Output {\n\n type Error = bee_block_stardust::Error;\n\n\n","file_path":"src/types/stardust/block/output/mod.rs","rank":71,"score":96944.27512381315},{"content":" Ok(bee::NftId::from_str(s)?.into())\n\n }\n\n}\n\n\n\nimpl From<NftId> for Bson {\n\n fn from(val: NftId) -> Self {\n\n Binary {\n\n subtype: BinarySubtype::Generic,\n\n bytes: val.0.to_vec(),\n\n }\n\n .into()\n\n }\n\n}\n\n\n\n#[derive(Clone, Debug, PartialEq, Eq, Serialize, Deserialize)]\n\npub struct NftOutput {\n\n pub amount: OutputAmount,\n\n pub native_tokens: Box<[NativeToken]>,\n\n pub nft_id: NftId,\n\n pub unlock_conditions: Box<[UnlockCondition]>,\n","file_path":"src/types/stardust/block/output/nft.rs","rank":72,"score":96944.1701970994},{"content":" Ok(bee::AliasId::from_str(s)?.into())\n\n }\n\n}\n\n\n\nimpl From<AliasId> for Bson {\n\n fn from(val: AliasId) -> Self {\n\n Binary {\n\n subtype: BinarySubtype::Generic,\n\n bytes: val.0.to_vec(),\n\n }\n\n .into()\n\n }\n\n}\n\n\n\n#[derive(Clone, Debug, PartialEq, Eq, Serialize, Deserialize)]\n\npub struct AliasOutput {\n\n #[serde(with = \"crate::types::util::stringify\")]\n\n pub amount: OutputAmount,\n\n pub native_tokens: Box<[NativeToken]>,\n\n pub alias_id: AliasId,\n","file_path":"src/types/stardust/block/output/alias.rs","rank":73,"score":96944.0625751737},{"content":" Basic(BasicOutput),\n\n #[serde(rename = \"alias\")]\n\n Alias(AliasOutput),\n\n #[serde(rename = \"foundry\")]\n\n Foundry(FoundryOutput),\n\n #[serde(rename = \"nft\")]\n\n Nft(NftOutput),\n\n}\n\n\n\nimpl Output {\n\n pub fn owning_addresses(&self) -> Vec<Address> {\n\n match self {\n\n Self::Treasury(_) => Vec::new(),\n\n Self::Basic(BasicOutput { unlock_conditions, .. })\n\n | Self::Alias(AliasOutput { unlock_conditions, .. })\n\n | Self::Nft(NftOutput { unlock_conditions, .. })\n\n | Self::Foundry(FoundryOutput { unlock_conditions, .. }) => unlock_conditions\n\n .iter()\n\n .filter_map(UnlockCondition::owning_address)\n\n .cloned()\n","file_path":"src/types/stardust/block/output/mod.rs","rank":74,"score":96943.5370137277},{"content":" get_test_timelock_condition,\n\n },\n\n };\n\n\n\n #[test]\n\n fn test_nft_id_bson() {\n\n let nft_id = NftId::from(rand_nft_id());\n\n let bson = to_bson(&nft_id).unwrap();\n\n assert_eq!(Bson::from(nft_id), bson);\n\n assert_eq!(nft_id, from_bson::<NftId>(bson).unwrap());\n\n }\n\n\n\n #[test]\n\n fn test_nft_output_bson() {\n\n let output = get_test_nft_output();\n\n let bson = to_bson(&output).unwrap();\n\n assert_eq!(output, from_bson::<NftOutput>(bson).unwrap());\n\n }\n\n\n\n pub(crate) fn rand_nft_id() -> bee::NftId {\n","file_path":"src/types/stardust/block/output/nft.rs","rank":75,"score":96943.29631065803},{"content":" #[serde(rename = \"tag\")]\n\n Tag {\n\n #[serde(with = \"serde_bytes\")]\n\n data: Box<[u8]>,\n\n },\n\n}\n\n\n\nimpl From<&bee::Feature> for Feature {\n\n fn from(value: &bee::Feature) -> Self {\n\n match value {\n\n bee::Feature::Sender(a) => Self::Sender {\n\n address: (*a.address()).into(),\n\n },\n\n bee::Feature::Issuer(a) => Self::Issuer {\n\n address: (*a.address()).into(),\n\n },\n\n bee::Feature::Metadata(b) => Self::Metadata {\n\n data: b.data().to_vec().into_boxed_slice(),\n\n },\n\n bee::Feature::Tag(b) => Self::Tag {\n","file_path":"src/types/stardust/block/output/feature.rs","rank":76,"score":96943.23703248106},{"content":" Vec::from(value.unlock_conditions)\n\n .into_iter()\n\n .map(TryInto::try_into)\n\n .collect::<Result<Vec<_>, _>>()?,\n\n )\n\n .with_features(\n\n Vec::from(value.features)\n\n .into_iter()\n\n .map(TryInto::try_into)\n\n .collect::<Result<Vec<_>, _>>()?,\n\n )\n\n .finish()\n\n }\n\n}\n\n\n\n#[cfg(test)]\n\npub(crate) mod test {\n\n use mongodb::bson::{from_bson, to_bson};\n\n\n\n use super::*;\n","file_path":"src/types/stardust/block/output/basic.rs","rank":77,"score":96943.19217474507},{"content":"\n\nimpl From<&bee::FoundryOutput> for FoundryOutput {\n\n fn from(value: &bee::FoundryOutput) -> Self {\n\n Self {\n\n amount: value.amount(),\n\n native_tokens: value.native_tokens().iter().map(Into::into).collect(),\n\n serial_number: value.serial_number(),\n\n token_scheme: value.token_scheme().into(),\n\n unlock_conditions: value.unlock_conditions().iter().map(Into::into).collect(),\n\n features: value.features().iter().map(Into::into).collect(),\n\n immutable_features: value.immutable_features().iter().map(Into::into).collect(),\n\n }\n\n }\n\n}\n\n\n\nimpl TryFrom<FoundryOutput> for bee::FoundryOutput {\n\n type Error = bee_block_stardust::Error;\n\n\n\n fn try_from(value: FoundryOutput) -> Result<Self, Self::Error> {\n\n Self::build_with_amount(value.amount, value.serial_number, value.token_scheme.try_into()?)?\n","file_path":"src/types/stardust/block/output/foundry.rs","rank":78,"score":96943.10331984657},{"content":" amount: value.amount(),\n\n native_tokens: value.native_tokens().iter().map(Into::into).collect(),\n\n unlock_conditions: value.unlock_conditions().iter().map(Into::into).collect(),\n\n features: value.features().iter().map(Into::into).collect(),\n\n }\n\n }\n\n}\n\n\n\nimpl TryFrom<BasicOutput> for bee::BasicOutput {\n\n type Error = bee_block_stardust::Error;\n\n\n\n fn try_from(value: BasicOutput) -> Result<Self, Self::Error> {\n\n Self::build_with_amount(value.amount)?\n\n .with_native_tokens(\n\n Vec::from(value.native_tokens)\n\n .into_iter()\n\n .map(TryInto::try_into)\n\n .collect::<Result<Vec<_>, _>>()?,\n\n )\n\n .with_unlock_conditions(\n","file_path":"src/types/stardust/block/output/basic.rs","rank":79,"score":96942.95324415744},{"content":" data: b.tag().to_vec().into_boxed_slice(),\n\n },\n\n }\n\n }\n\n}\n\n\n\nimpl TryFrom<Feature> for bee::Feature {\n\n type Error = bee_block_stardust::Error;\n\n\n\n fn try_from(value: Feature) -> Result<Self, Self::Error> {\n\n Ok(match value {\n\n Feature::Sender { address } => bee::Feature::Sender(bee::SenderFeature::new(address.into())),\n\n Feature::Issuer { address } => bee::Feature::Issuer(bee::IssuerFeature::new(address.into())),\n\n Feature::Metadata { data } => bee::Feature::Metadata(bee::MetadataFeature::new(data.into())?),\n\n Feature::Tag { data } => bee::Feature::Tag(bee::TagFeature::new(data.into())?),\n\n })\n\n }\n\n}\n\n\n\n#[cfg(test)]\n","file_path":"src/types/stardust/block/output/feature.rs","rank":80,"score":96942.8785826638},{"content":" bee_test::rand::bytes::rand_bytes_array().into()\n\n }\n\n\n\n pub(crate) fn get_test_nft_output() -> NftOutput {\n\n NftOutput::from(\n\n &bee::NftOutput::build_with_amount(100, rand_nft_id())\n\n .unwrap()\n\n .with_native_tokens(vec![get_test_native_token().try_into().unwrap()])\n\n .with_unlock_conditions(vec![\n\n get_test_address_condition(bee_test::rand::address::rand_address().into())\n\n .try_into()\n\n .unwrap(),\n\n get_test_storage_deposit_return_condition(bee_test::rand::address::rand_address().into(), 1)\n\n .try_into()\n\n .unwrap(),\n\n get_test_timelock_condition(1, 1).try_into().unwrap(),\n\n get_test_expiration_condition(bee_test::rand::address::rand_address().into(), 1, 1)\n\n .try_into()\n\n .unwrap(),\n\n ])\n","file_path":"src/types/stardust/block/output/nft.rs","rank":81,"score":96942.70116867073},{"content":" .with_native_tokens(vec![get_test_native_token().try_into().unwrap()])\n\n .with_unlock_conditions(vec![\n\n get_test_address_condition(bee_test::rand::address::rand_address().into())\n\n .try_into()\n\n .unwrap(),\n\n get_test_storage_deposit_return_condition(bee_test::rand::address::rand_address().into(), 1)\n\n .try_into()\n\n .unwrap(),\n\n get_test_timelock_condition(1, 1).try_into().unwrap(),\n\n get_test_expiration_condition(bee_test::rand::address::rand_address().into(), 1, 1)\n\n .try_into()\n\n .unwrap(),\n\n ])\n\n .with_features(vec![\n\n get_test_sender_block(bee_test::rand::address::rand_address().into())\n\n .try_into()\n\n .unwrap(),\n\n get_test_metadata_block().try_into().unwrap(),\n\n get_test_tag_block().try_into().unwrap(),\n\n ])\n\n .finish()\n\n .unwrap(),\n\n )\n\n }\n\n}\n","file_path":"src/types/stardust/block/output/basic.rs","rank":82,"score":96942.63786981377},{"content":" Ok(bee::NftId::from(bee::OutputId::from_str(s)?).into())\n\n }\n\n}\n\n\n\nimpl From<bee::NftId> for NftId {\n\n fn from(value: bee::NftId) -> Self {\n\n Self(*value)\n\n }\n\n}\n\n\n\nimpl From<NftId> for bee::NftId {\n\n fn from(value: NftId) -> Self {\n\n bee::NftId::new(value.0)\n\n }\n\n}\n\n\n\nimpl FromStr for NftId {\n\n type Err = bee_block_stardust::Error;\n\n\n\n fn from_str(s: &str) -> Result<Self, Self::Err> {\n","file_path":"src/types/stardust/block/output/nft.rs","rank":83,"score":96941.9556016348},{"content":" Ok(bee::AliasId::from(bee::OutputId::from_str(s)?).into())\n\n }\n\n}\n\n\n\nimpl From<bee::AliasId> for AliasId {\n\n fn from(value: bee::AliasId) -> Self {\n\n Self(*value)\n\n }\n\n}\n\n\n\nimpl From<AliasId> for bee::AliasId {\n\n fn from(value: AliasId) -> Self {\n\n bee::AliasId::new(value.0)\n\n }\n\n}\n\n\n\nimpl FromStr for AliasId {\n\n type Err = bee_block_stardust::Error;\n\n\n\n fn from_str(s: &str) -> Result<Self, Self::Err> {\n","file_path":"src/types/stardust/block/output/alias.rs","rank":84,"score":96941.9556016348},{"content":" let bson = to_bson(&output_id).unwrap();\n\n from_bson::<OutputId>(bson).unwrap();\n\n }\n\n\n\n #[test]\n\n fn test_output_bson() {\n\n let output = get_test_alias_output();\n\n let bson = to_bson(&output).unwrap();\n\n assert_eq!(output, from_bson::<Output>(bson).unwrap());\n\n\n\n let output = get_test_basic_output();\n\n let bson = to_bson(&output).unwrap();\n\n assert_eq!(output, from_bson::<Output>(bson).unwrap());\n\n\n\n let output = get_test_foundry_output();\n\n let bson = to_bson(&output).unwrap();\n\n assert_eq!(output, from_bson::<Output>(bson).unwrap());\n\n\n\n let output = get_test_nft_output();\n\n let bson = to_bson(&output).unwrap();\n","file_path":"src/types/stardust/block/output/mod.rs","rank":85,"score":96941.62670454649},{"content":" fn try_from(value: NftOutput) -> Result<Self, Self::Error> {\n\n Self::build_with_amount(value.amount, value.nft_id.into())?\n\n .with_native_tokens(\n\n Vec::from(value.native_tokens)\n\n .into_iter()\n\n .map(TryInto::try_into)\n\n .collect::<Result<Vec<_>, _>>()?,\n\n )\n\n .with_unlock_conditions(\n\n Vec::from(value.unlock_conditions)\n\n .into_iter()\n\n .map(TryInto::try_into)\n\n .collect::<Result<Vec<_>, _>>()?,\n\n )\n\n .with_features(\n\n Vec::from(value.features)\n\n .into_iter()\n\n .map(TryInto::try_into)\n\n .collect::<Result<Vec<_>, _>>()?,\n\n )\n","file_path":"src/types/stardust/block/output/nft.rs","rank":86,"score":96939.28747071976},{"content":" Vec::from(value.unlock_conditions)\n\n .into_iter()\n\n .map(TryInto::try_into)\n\n .collect::<Result<Vec<_>, _>>()?,\n\n )\n\n .with_features(\n\n Vec::from(value.features)\n\n .into_iter()\n\n .map(TryInto::try_into)\n\n .collect::<Result<Vec<_>, _>>()?,\n\n )\n\n .with_immutable_features(\n\n Vec::from(value.immutable_features)\n\n .into_iter()\n\n .map(TryInto::try_into)\n\n .collect::<Result<Vec<_>, _>>()?,\n\n )\n\n .finish()\n\n }\n\n}\n","file_path":"src/types/stardust/block/output/alias.rs","rank":87,"score":96936.45805687236},{"content":" .with_native_tokens(\n\n Vec::from(value.native_tokens)\n\n .into_iter()\n\n .map(TryInto::try_into)\n\n .collect::<Result<Vec<_>, _>>()?,\n\n )\n\n .with_unlock_conditions(\n\n Vec::from(value.unlock_conditions)\n\n .into_iter()\n\n .map(TryInto::try_into)\n\n .collect::<Result<Vec<_>, _>>()?,\n\n )\n\n .with_features(\n\n Vec::from(value.features)\n\n .into_iter()\n\n .map(TryInto::try_into)\n\n .collect::<Result<Vec<_>, _>>()?,\n\n )\n\n .with_immutable_features(\n\n Vec::from(value.immutable_features)\n","file_path":"src/types/stardust/block/output/foundry.rs","rank":88,"score":96936.45805687236},{"content":"// Copyright 2022 IOTA Stiftung\n\n// SPDX-License-Identifier: Apache-2.0\n\n\n\nuse bee_block_stardust::payload::tagged_data as bee;\n\nuse serde::{Deserialize, Serialize};\n\n\n\n#[derive(Clone, Debug, PartialEq, Eq, Serialize, Deserialize)]\n\npub struct TaggedDataPayload {\n\n #[serde(with = \"serde_bytes\")]\n\n tag: Box<[u8]>,\n\n #[serde(with = \"serde_bytes\")]\n\n data: Box<[u8]>,\n\n}\n\n\n\nimpl From<&bee::TaggedDataPayload> for TaggedDataPayload {\n\n fn from(value: &bee::TaggedDataPayload) -> Self {\n\n Self {\n\n tag: value.tag().to_vec().into_boxed_slice(),\n\n data: value.data().to_vec().into_boxed_slice(),\n\n }\n","file_path":"src/types/stardust/block/payload/tagged_data.rs","rank":89,"score":95367.92426279467},{"content":" }\n\n}\n\n\n\nimpl TryFrom<TaggedDataPayload> for bee::TaggedDataPayload {\n\n type Error = bee_block_stardust::Error;\n\n\n\n fn try_from(value: TaggedDataPayload) -> Result<Self, Self::Error> {\n\n bee::TaggedDataPayload::new(value.tag.into(), value.data.into())\n\n }\n\n}\n\n\n\n#[cfg(test)]\n\npub(crate) mod test {\n\n use mongodb::bson::{from_bson, to_bson};\n\n\n\n use super::*;\n\n\n\n #[test]\n\n fn test_tagged_data_payload_bson() {\n\n let payload = get_test_tagged_data_payload();\n\n let bson = to_bson(&payload).unwrap();\n\n assert_eq!(payload, from_bson::<TaggedDataPayload>(bson).unwrap());\n\n }\n\n\n\n pub(crate) fn get_test_tagged_data_payload() -> TaggedDataPayload {\n\n (&bee_test::rand::payload::rand_tagged_data_payload()).into()\n\n }\n\n}\n","file_path":"src/types/stardust/block/payload/tagged_data.rs","rank":90,"score":95365.14509572591},{"content":"// Copyright 2022 IOTA Stiftung\n\n// SPDX-License-Identifier: Apache-2.0\n\n\n\nuse std::{mem::size_of, str::FromStr};\n\n\n\nuse bee_block_stardust::output as bee;\n\nuse primitive_types::U256;\n\nuse serde::{Deserialize, Serialize};\n\n\n\nuse crate::types::util::bytify;\n\n\n\n#[derive(Copy, Clone, Debug, PartialEq, Eq, Serialize, Deserialize)]\n\n#[serde(transparent)]\n\npub struct TokenAmount(#[serde(with = \"bytify\")] pub [u8; size_of::<U256>()]);\n\n\n\nimpl From<&U256> for TokenAmount {\n\n fn from(value: &U256) -> Self {\n\n let mut amount = [0; size_of::<U256>()];\n\n value.to_little_endian(&mut amount);\n\n Self(amount)\n","file_path":"src/types/stardust/block/output/native_token.rs","rank":91,"score":94599.92909212483},{"content":" use bee_block_stardust::address::{Address as BeeAddress, AliasAddress as BeeAliasAddress};\n\n BeeAddress::from(BeeAliasAddress::new(bee_test::rand::output::rand_alias_id())).into()\n\n }\n\n\n\n pub(crate) fn get_test_address_condition(address: Address) -> UnlockCondition {\n\n UnlockCondition::Address { address }\n\n }\n\n\n\n pub(crate) fn get_test_storage_deposit_return_condition(return_address: Address, amount: u64) -> UnlockCondition {\n\n UnlockCondition::StorageDepositReturn { return_address, amount }\n\n }\n\n\n\n pub(crate) fn get_test_timelock_condition(milestone_index: u32, timestamp: u32) -> UnlockCondition {\n\n UnlockCondition::Timelock {\n\n milestone_index,\n\n timestamp,\n\n }\n\n }\n\n\n\n pub(crate) fn get_test_expiration_condition(\n","file_path":"src/types/stardust/block/output/unlock_condition.rs","rank":92,"score":94595.90272536942},{"content":"// Copyright 2022 IOTA Stiftung\n\n// SPDX-License-Identifier: Apache-2.0\n\n\n\nuse bee_block_stardust::output::unlock_condition as bee;\n\nuse serde::{Deserialize, Serialize};\n\n\n\nuse crate::types::stardust::block::Address;\n\n\n\n#[derive(Copy, Clone, Debug, PartialEq, Eq, Serialize, Deserialize)]\n\n#[serde(tag = \"kind\")]\n\npub enum UnlockCondition {\n\n #[serde(rename = \"address\")]\n\n Address { address: Address },\n\n #[serde(rename = \"storage_deposit_return\")]\n\n StorageDepositReturn {\n\n return_address: Address,\n\n #[serde(with = \"crate::types::util::stringify\")]\n\n amount: u64,\n\n },\n\n #[serde(rename = \"timelock\")]\n","file_path":"src/types/stardust/block/output/unlock_condition.rs","rank":93,"score":94594.56032074922},{"content":"}\n\n\n\n#[cfg(test)]\n\npub(crate) mod test {\n\n use mongodb::bson::{from_bson, to_bson};\n\n\n\n use super::*;\n\n\n\n #[test]\n\n fn test_unlock_condition_bson() {\n\n let block = get_test_address_condition(bee_test::rand::address::rand_address().into());\n\n let bson = to_bson(&block).unwrap();\n\n assert_eq!(block, from_bson::<UnlockCondition>(bson).unwrap());\n\n\n\n let block = get_test_storage_deposit_return_condition(bee_test::rand::address::rand_address().into(), 1);\n\n let bson = to_bson(&block).unwrap();\n\n assert_eq!(block, from_bson::<UnlockCondition>(bson).unwrap());\n\n\n\n let block = get_test_timelock_condition(1, 1);\n\n let bson = to_bson(&block).unwrap();\n","file_path":"src/types/stardust/block/output/unlock_condition.rs","rank":94,"score":94592.40729019284},{"content":" return_address: Address,\n\n milestone_index: u32,\n\n timestamp: u32,\n\n ) -> UnlockCondition {\n\n UnlockCondition::Expiration {\n\n return_address,\n\n milestone_index,\n\n timestamp,\n\n }\n\n }\n\n\n\n pub(crate) fn get_test_state_controller_address_condition(address: Address) -> UnlockCondition {\n\n UnlockCondition::StateControllerAddress { address }\n\n }\n\n\n\n pub(crate) fn get_test_governor_address_condition(address: Address) -> UnlockCondition {\n\n UnlockCondition::GovernorAddress { address }\n\n }\n\n\n\n pub(crate) fn get_test_immut_alias_address_condition(address: Address) -> UnlockCondition {\n\n UnlockCondition::ImmutableAliasAddress { address }\n\n }\n\n}\n","file_path":"src/types/stardust/block/output/unlock_condition.rs","rank":95,"score":94589.32492546269},{"content":" assert_eq!(block, from_bson::<UnlockCondition>(bson).unwrap());\n\n\n\n let block = get_test_expiration_condition(bee_test::rand::address::rand_address().into(), 1, 1);\n\n let bson = to_bson(&block).unwrap();\n\n assert_eq!(block, from_bson::<UnlockCondition>(bson).unwrap());\n\n\n\n let block = get_test_state_controller_address_condition(bee_test::rand::address::rand_address().into());\n\n let bson = to_bson(&block).unwrap();\n\n assert_eq!(block, from_bson::<UnlockCondition>(bson).unwrap());\n\n\n\n let block = get_test_governor_address_condition(bee_test::rand::address::rand_address().into());\n\n let bson = to_bson(&block).unwrap();\n\n assert_eq!(block, from_bson::<UnlockCondition>(bson).unwrap());\n\n\n\n let block = get_test_immut_alias_address_condition(get_test_alias_address_as_address());\n\n let bson = to_bson(&block).unwrap();\n\n assert_eq!(block, from_bson::<UnlockCondition>(bson).unwrap());\n\n }\n\n\n\n pub(crate) fn get_test_alias_address_as_address() -> Address {\n","file_path":"src/types/stardust/block/output/unlock_condition.rs","rank":96,"score":94588.82453945692},{"content":" }\n\n}\n\n\n\nimpl From<TokenAmount> for U256 {\n\n fn from(value: TokenAmount) -> Self {\n\n U256::from_little_endian(&value.0)\n\n }\n\n}\n\n\n\n#[derive(Clone, Debug, PartialEq, Eq, Serialize, Deserialize)]\n\n#[serde(transparent)]\n\npub struct TokenId(#[serde(with = \"bytify\")] pub [u8; Self::LENGTH]);\n\n\n\nimpl TokenId {\n\n const LENGTH: usize = bee::TokenId::LENGTH;\n\n}\n\n\n\nimpl From<bee::TokenId> for TokenId {\n\n fn from(value: bee::TokenId) -> Self {\n\n Self(*value)\n","file_path":"src/types/stardust/block/output/native_token.rs","rank":97,"score":94588.50032707203},{"content":"\n\nimpl TryFrom<UnlockCondition> for bee::UnlockCondition {\n\n type Error = bee_block_stardust::Error;\n\n\n\n fn try_from(value: UnlockCondition) -> Result<Self, Self::Error> {\n\n Ok(match value {\n\n UnlockCondition::Address { address } => Self::Address(bee::AddressUnlockCondition::new(address.into())),\n\n UnlockCondition::StorageDepositReturn { return_address, amount } => Self::StorageDepositReturn(\n\n bee::StorageDepositReturnUnlockCondition::new(return_address.into(), amount)?,\n\n ),\n\n UnlockCondition::Timelock {\n\n milestone_index,\n\n timestamp,\n\n } => Self::Timelock(bee::TimelockUnlockCondition::new(milestone_index.into(), timestamp)?),\n\n UnlockCondition::Expiration {\n\n return_address,\n\n milestone_index,\n\n timestamp,\n\n } => Self::Expiration(bee::ExpirationUnlockCondition::new(\n\n return_address.into(),\n","file_path":"src/types/stardust/block/output/unlock_condition.rs","rank":98,"score":94588.34700746072},{"content":" milestone_index.into(),\n\n timestamp,\n\n )?),\n\n UnlockCondition::StateControllerAddress { address } => {\n\n Self::StateControllerAddress(bee::StateControllerAddressUnlockCondition::new(address.into()))\n\n }\n\n UnlockCondition::GovernorAddress { address } => {\n\n Self::GovernorAddress(bee::GovernorAddressUnlockCondition::new(address.into()))\n\n }\n\n UnlockCondition::ImmutableAliasAddress { address } => {\n\n let bee_address = bee_block_stardust::address::Address::from(address);\n\n\n\n if let bee_block_stardust::address::Address::Alias(alias_address) = bee_address {\n\n Self::ImmutableAliasAddress(bee::ImmutableAliasAddressUnlockCondition::new(alias_address))\n\n } else {\n\n Err(bee_block_stardust::Error::InvalidAddressKind(bee_address.kind()))?\n\n }\n\n }\n\n })\n\n }\n","file_path":"src/types/stardust/block/output/unlock_condition.rs","rank":99,"score":94588.31842809706}],"string":"[\n {\n \"content\": \"// Copyright 2022 IOTA Stiftung\\n\\n// SPDX-License-Identifier: Apache-2.0\\n\\n\\n\\nuse std::str::FromStr;\\n\\n\\n\\nuse bee_block_stardust::payload::milestone as bee;\\n\\nuse mongodb::bson::{spec::BinarySubtype, Binary, Bson};\\n\\nuse serde::{Deserialize, Serialize};\\n\\n\\n\\nuse crate::types::util::bytify;\\n\\n\\n\\n#[derive(Copy, Clone, Debug, PartialEq, Eq, Serialize, Deserialize)]\\n\\n#[serde(transparent)]\\n\\npub struct MilestoneId(#[serde(with = \\\"bytify\\\")] pub [u8; Self::LENGTH]);\\n\\n\\n\\nimpl MilestoneId {\\n\\n const LENGTH: usize = bee::MilestoneId::LENGTH;\\n\\n}\\n\\n\\n\\nimpl From<bee::MilestoneId> for MilestoneId {\\n\",\n \"file_path\": \"src/types/stardust/block/payload/milestone/milestone_id.rs\",\n \"rank\": 0,\n \"score\": 134919.454855\n },\n {\n \"content\": \" fn from(value: bee::MilestoneId) -> Self {\\n\\n Self(*value)\\n\\n }\\n\\n}\\n\\n\\n\\nimpl From<MilestoneId> for bee::MilestoneId {\\n\\n fn from(value: MilestoneId) -> Self {\\n\\n bee::MilestoneId::new(value.0)\\n\\n }\\n\\n}\\n\\n\\n\\nimpl FromStr for MilestoneId {\\n\\n type Err = bee_block_stardust::Error;\\n\\n\\n\\n fn from_str(s: &str) -> Result<Self, Self::Err> {\\n\\n Ok(bee::MilestoneId::from_str(s)?.into())\\n\\n }\\n\\n}\\n\\n\\n\\nimpl From<MilestoneId> for Bson {\\n\\n fn from(val: MilestoneId) -> Self {\\n\\n Binary {\\n\\n subtype: BinarySubtype::Generic,\\n\\n bytes: val.0.to_vec(),\\n\\n }\\n\\n .into()\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/types/stardust/block/payload/milestone/milestone_id.rs\",\n \"rank\": 1,\n \"score\": 134907.39880959404\n },\n {\n \"content\": \"// Copyright 2022 IOTA Stiftung\\n\\n// SPDX-License-Identifier: Apache-2.0\\n\\n\\n\\nuse std::str::FromStr;\\n\\n\\n\\nuse bee_block_stardust::{output::InputsCommitment, payload::transaction as bee};\\n\\nuse mongodb::bson::{spec::BinarySubtype, Binary, Bson};\\n\\nuse serde::{Deserialize, Serialize};\\n\\n\\n\\nuse crate::types::{\\n\\n stardust::block::{Input, Output, Payload, Unlock},\\n\\n util::bytify,\\n\\n};\\n\\n\\n\\n#[derive(Copy, Clone, Debug, PartialEq, Eq, Serialize, Deserialize)]\\n\\n#[serde(transparent)]\\n\\npub struct TransactionId(#[serde(with = \\\"bytify\\\")] pub [u8; Self::LENGTH]);\\n\\n\\n\\nimpl TransactionId {\\n\\n const LENGTH: usize = bee::TransactionId::LENGTH;\\n\",\n \"file_path\": \"src/types/stardust/block/payload/transaction.rs\",\n \"rank\": 2,\n \"score\": 133051.35291114094\n },\n {\n \"content\": \" pub(crate) const OUTPUT_ID1: &str = \\\"0x52fdfc072182654f163f5f0f9a621d729566c74d10037c4d7bbb0407d1e2c6492a00\\\";\\n\\n pub(crate) const OUTPUT_ID2: &str = \\\"0x52fdfc072182654f163f5f0f9a621d729566c74d10037c4d7bbb0407d1e2c6492b00\\\";\\n\\n pub(crate) const OUTPUT_ID3: &str = \\\"0x52fdfc072182654f163f5f0f9a621d729566c74d10037c4d7bbb0407d1e2c6492c00\\\";\\n\\n pub(crate) const OUTPUT_ID4: &str = \\\"0x52fdfc072182654f163f5f0f9a621d729566c74d10037c4d7bbb0407d1e2c6492d00\\\";\\n\\n\\n\\n use bee_block_stardust::unlock::Unlocks;\\n\\n use mongodb::bson::{from_bson, to_bson};\\n\\n\\n\\n use super::*;\\n\\n use crate::types::stardust::block::{\\n\\n output::test::{get_test_alias_output, get_test_basic_output, get_test_foundry_output, get_test_nft_output},\\n\\n unlock::test::{\\n\\n get_test_alias_unlock, get_test_nft_unlock, get_test_reference_unlock, get_test_signature_unlock,\\n\\n },\\n\\n OutputId,\\n\\n };\\n\\n\\n\\n #[test]\\n\\n fn test_transaction_id_bson() {\\n\\n let transaction_id = TransactionId::from(bee_test::rand::transaction::rand_transaction_id());\\n\",\n \"file_path\": \"src/types/stardust/block/payload/transaction.rs\",\n \"rank\": 3,\n \"score\": 133046.49560605662\n },\n {\n \"content\": \" bee_block_stardust::output::InputsCommitment::new(outputs.iter()),\\n\\n )\\n\\n .with_inputs(\\n\\n Vec::from(inputs)\\n\\n .into_iter()\\n\\n .map(TryInto::try_into)\\n\\n .collect::<Result<Vec<_>, _>>()?,\\n\\n )\\n\\n .with_outputs(outputs);\\n\\n if let Some(payload) = payload {\\n\\n builder = builder.with_payload(payload.try_into()?);\\n\\n }\\n\\n bee::TransactionEssence::Regular(builder.finish()?)\\n\\n }\\n\\n })\\n\\n }\\n\\n}\\n\\n\\n\\n#[cfg(test)]\\n\\npub(crate) mod test {\\n\",\n \"file_path\": \"src/types/stardust/block/payload/transaction.rs\",\n \"rank\": 4,\n \"score\": 133045.08445107532\n },\n {\n \"content\": \" let bson = to_bson(&transaction_id).unwrap();\\n\\n assert_eq!(Bson::from(transaction_id), bson);\\n\\n assert_eq!(transaction_id, from_bson::<TransactionId>(bson).unwrap());\\n\\n }\\n\\n\\n\\n #[test]\\n\\n fn test_transaction_payload_bson() {\\n\\n let payload = get_test_transaction_payload();\\n\\n let bson = to_bson(&payload).unwrap();\\n\\n assert_eq!(payload, from_bson::<TransactionPayload>(bson).unwrap());\\n\\n }\\n\\n\\n\\n pub(crate) fn get_test_transaction_essence() -> TransactionEssence {\\n\\n TransactionEssence::from(&bee::TransactionEssence::Regular(\\n\\n bee::RegularTransactionEssenceBuilder::new(0, [0; 32].into())\\n\\n .with_inputs(vec![\\n\\n Input::Utxo(OutputId::from_str(OUTPUT_ID1).unwrap()).try_into().unwrap(),\\n\\n Input::Utxo(OutputId::from_str(OUTPUT_ID2).unwrap()).try_into().unwrap(),\\n\\n Input::Utxo(OutputId::from_str(OUTPUT_ID3).unwrap()).try_into().unwrap(),\\n\\n Input::Utxo(OutputId::from_str(OUTPUT_ID4).unwrap()).try_into().unwrap(),\\n\",\n \"file_path\": \"src/types/stardust/block/payload/transaction.rs\",\n \"rank\": 5,\n \"score\": 133042.8464917851\n },\n {\n \"content\": \" pub unlocks: Box<[Unlock]>,\\n\\n}\\n\\n\\n\\nimpl From<&bee::TransactionPayload> for TransactionPayload {\\n\\n fn from(value: &bee::TransactionPayload) -> Self {\\n\\n Self {\\n\\n id: value.id().into(),\\n\\n essence: value.essence().into(),\\n\\n unlocks: value.unlocks().iter().map(Into::into).collect(),\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\nimpl TryFrom<TransactionPayload> for bee::TransactionPayload {\\n\\n type Error = bee_block_stardust::Error;\\n\\n\\n\\n fn try_from(value: TransactionPayload) -> Result<Self, Self::Error> {\\n\\n bee::TransactionPayload::new(\\n\\n value.essence.try_into()?,\\n\\n bee_block_stardust::unlock::Unlocks::new(\\n\",\n \"file_path\": \"src/types/stardust/block/payload/transaction.rs\",\n \"rank\": 6,\n \"score\": 133042.58206452074\n },\n {\n \"content\": \"}\\n\\n\\n\\nimpl TryFrom<TransactionEssence> for bee::TransactionEssence {\\n\\n type Error = bee_block_stardust::Error;\\n\\n\\n\\n fn try_from(value: TransactionEssence) -> Result<Self, Self::Error> {\\n\\n Ok(match value {\\n\\n TransactionEssence::Regular {\\n\\n network_id,\\n\\n inputs,\\n\\n inputs_commitment: _,\\n\\n outputs,\\n\\n payload,\\n\\n } => {\\n\\n let outputs = Vec::from(outputs)\\n\\n .into_iter()\\n\\n .map(TryInto::try_into)\\n\\n .collect::<Result<Vec<bee_block_stardust::output::Output>, _>>()?;\\n\\n let mut builder = bee::RegularTransactionEssence::builder(\\n\\n network_id,\\n\",\n \"file_path\": \"src/types/stardust/block/payload/transaction.rs\",\n \"rank\": 7,\n \"score\": 133042.55650379395\n },\n {\n \"content\": \" ])\\n\\n .with_outputs(vec![\\n\\n get_test_basic_output().try_into().unwrap(),\\n\\n get_test_alias_output().try_into().unwrap(),\\n\\n get_test_foundry_output().try_into().unwrap(),\\n\\n get_test_nft_output().try_into().unwrap(),\\n\\n ])\\n\\n .finish()\\n\\n .unwrap(),\\n\\n ))\\n\\n }\\n\\n\\n\\n pub(crate) fn get_test_transaction_payload() -> TransactionPayload {\\n\\n TransactionPayload::from(\\n\\n &bee::TransactionPayload::new(\\n\\n get_test_transaction_essence().try_into().unwrap(),\\n\\n Unlocks::new(vec![\\n\\n get_test_signature_unlock().try_into().unwrap(),\\n\\n get_test_reference_unlock().try_into().unwrap(),\\n\\n get_test_alias_unlock().try_into().unwrap(),\\n\\n get_test_nft_unlock().try_into().unwrap(),\\n\\n ])\\n\\n .unwrap(),\\n\\n )\\n\\n .unwrap(),\\n\\n )\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/types/stardust/block/payload/transaction.rs\",\n \"rank\": 8,\n \"score\": 133042.55428993094\n },\n {\n \"content\": \" payload: Option<Payload>,\\n\\n },\\n\\n}\\n\\n\\n\\nimpl TransactionEssence {\\n\\n const INPUTS_COMMITMENT_LENGTH: usize = InputsCommitment::LENGTH;\\n\\n}\\n\\n\\n\\nimpl From<&bee::TransactionEssence> for TransactionEssence {\\n\\n fn from(value: &bee::TransactionEssence) -> Self {\\n\\n match value {\\n\\n bee::TransactionEssence::Regular(essence) => Self::Regular {\\n\\n network_id: essence.network_id(),\\n\\n inputs: essence.inputs().iter().map(Into::into).collect(),\\n\\n inputs_commitment: **essence.inputs_commitment(),\\n\\n outputs: essence.outputs().iter().map(Into::into).collect(),\\n\\n payload: essence.payload().map(Into::into),\\n\\n },\\n\\n }\\n\\n }\\n\",\n \"file_path\": \"src/types/stardust/block/payload/transaction.rs\",\n \"rank\": 9,\n \"score\": 133039.66256965726\n },\n {\n \"content\": \" Vec::from(value.unlocks)\\n\\n .into_iter()\\n\\n .map(TryInto::try_into)\\n\\n .collect::<Result<Vec<_>, _>>()?,\\n\\n )?,\\n\\n )\\n\\n }\\n\\n}\\n\\n\\n\\n#[derive(Clone, Debug, PartialEq, Eq, Serialize, Deserialize)]\\n\\n#[serde(tag = \\\"kind\\\")]\\n\\npub enum TransactionEssence {\\n\\n #[serde(rename = \\\"regular\\\")]\\n\\n Regular {\\n\\n #[serde(with = \\\"crate::types::util::stringify\\\")]\\n\\n network_id: u64,\\n\\n inputs: Box<[Input]>,\\n\\n #[serde(with = \\\"bytify\\\")]\\n\\n inputs_commitment: [u8; Self::INPUTS_COMMITMENT_LENGTH],\\n\\n outputs: Box<[Output]>,\\n\",\n \"file_path\": \"src/types/stardust/block/payload/transaction.rs\",\n \"rank\": 10,\n \"score\": 133039.11510938575\n },\n {\n \"content\": \"\\n\\n fn from_str(s: &str) -> Result<Self, Self::Err> {\\n\\n Ok(bee::TransactionId::from_str(s)?.into())\\n\\n }\\n\\n}\\n\\n\\n\\nimpl From<TransactionId> for Bson {\\n\\n fn from(val: TransactionId) -> Self {\\n\\n Binary {\\n\\n subtype: BinarySubtype::Generic,\\n\\n bytes: val.0.to_vec(),\\n\\n }\\n\\n .into()\\n\\n }\\n\\n}\\n\\n\\n\\n#[derive(Clone, Debug, PartialEq, Eq, Serialize, Deserialize)]\\n\\npub struct TransactionPayload {\\n\\n pub id: TransactionId,\\n\\n pub essence: TransactionEssence,\\n\",\n \"file_path\": \"src/types/stardust/block/payload/transaction.rs\",\n \"rank\": 11,\n \"score\": 133038.60486887593\n },\n {\n \"content\": \"\\n\\n pub fn to_hex(&self) -> String {\\n\\n prefix_hex::encode(self.0.as_ref())\\n\\n }\\n\\n}\\n\\n\\n\\nimpl From<bee::TransactionId> for TransactionId {\\n\\n fn from(value: bee::TransactionId) -> Self {\\n\\n Self(*value)\\n\\n }\\n\\n}\\n\\n\\n\\nimpl From<TransactionId> for bee::TransactionId {\\n\\n fn from(value: TransactionId) -> Self {\\n\\n bee::TransactionId::new(value.0)\\n\\n }\\n\\n}\\n\\n\\n\\nimpl FromStr for TransactionId {\\n\\n type Err = bee_block_stardust::Error;\\n\",\n \"file_path\": \"src/types/stardust/block/payload/transaction.rs\",\n \"rank\": 12,\n \"score\": 133037.51573851294\n },\n {\n \"content\": \"// Copyright 2022 IOTA Stiftung\\n\\n// SPDX-License-Identifier: Apache-2.0\\n\\n\\n\\nuse bee_block_stardust::payload as bee;\\n\\nuse serde::{Deserialize, Serialize};\\n\\n\\n\\nuse super::MilestoneId;\\n\\n\\n\\n#[derive(Copy, Clone, Debug, PartialEq, Eq, Serialize, Deserialize)]\\n\\npub struct TreasuryTransactionPayload {\\n\\n input_milestone_id: MilestoneId,\\n\\n #[serde(with = \\\"crate::types::util::stringify\\\")]\\n\\n output_amount: u64,\\n\\n}\\n\\n\\n\\nimpl From<&bee::TreasuryTransactionPayload> for TreasuryTransactionPayload {\\n\\n fn from(value: &bee::TreasuryTransactionPayload) -> Self {\\n\\n Self {\\n\\n input_milestone_id: (*value.input().milestone_id()).into(),\\n\\n output_amount: value.output().amount(),\\n\",\n \"file_path\": \"src/types/stardust/block/payload/treasury_transaction.rs\",\n \"rank\": 13,\n \"score\": 129821.90234700298\n },\n {\n \"content\": \" }\\n\\n }\\n\\n}\\n\\n\\n\\nimpl TryFrom<TreasuryTransactionPayload> for bee::TreasuryTransactionPayload {\\n\\n type Error = bee_block_stardust::Error;\\n\\n\\n\\n fn try_from(value: TreasuryTransactionPayload) -> Result<Self, Self::Error> {\\n\\n Self::new(\\n\\n bee_block_stardust::input::TreasuryInput::new(value.input_milestone_id.into()),\\n\\n bee_block_stardust::output::TreasuryOutput::new(value.output_amount)?,\\n\\n )\\n\\n }\\n\\n}\\n\\n\\n\\n#[cfg(test)]\\n\\npub(crate) mod test {\\n\\n use mongodb::bson::{from_bson, to_bson};\\n\\n\\n\\n use super::*;\\n\",\n \"file_path\": \"src/types/stardust/block/payload/treasury_transaction.rs\",\n \"rank\": 14,\n \"score\": 129821.39951225316\n },\n {\n \"content\": \"\\n\\n #[test]\\n\\n fn test_treasury_transaction_payload_bson() {\\n\\n let payload = get_test_treasury_transaction_payload();\\n\\n let bson = to_bson(&payload).unwrap();\\n\\n assert_eq!(payload, from_bson::<TreasuryTransactionPayload>(bson).unwrap());\\n\\n }\\n\\n\\n\\n pub(crate) fn get_test_treasury_transaction_payload() -> TreasuryTransactionPayload {\\n\\n TreasuryTransactionPayload::from(\\n\\n &bee::TreasuryTransactionPayload::new(\\n\\n bee_test::rand::input::rand_treasury_input(),\\n\\n bee_test::rand::output::rand_treasury_output(),\\n\\n )\\n\\n .unwrap(),\\n\\n )\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/types/stardust/block/payload/treasury_transaction.rs\",\n \"rank\": 15,\n \"score\": 129812.42073482573\n },\n {\n \"content\": \"// Copyright 2022 IOTA Stiftung\\n\\n// SPDX-License-Identifier: Apache-2.0\\n\\n\\n\\nmod milestone_id;\\n\\n\\n\\nuse bee_block_stardust::payload::milestone as bee;\\n\\nuse serde::{Deserialize, Serialize};\\n\\n\\n\\npub use self::milestone_id::MilestoneId;\\n\\nuse crate::types::{\\n\\n stardust::block::{Address, BlockId, Signature, TreasuryTransactionPayload},\\n\\n tangle::MilestoneIndex,\\n\\n util::bytify,\\n\\n};\\n\\n\\n\\n#[derive(Clone, Debug, PartialEq, Eq, Serialize, Deserialize)]\\n\\npub struct MilestonePayload {\\n\\n pub essence: MilestoneEssence,\\n\\n pub signatures: Box<[Signature]>,\\n\\n}\\n\",\n \"file_path\": \"src/types/stardust/block/payload/milestone/mod.rs\",\n \"rank\": 16,\n \"score\": 129353.04705101726\n },\n {\n \"content\": \" )\\n\\n }\\n\\n}\\n\\n\\n\\n#[derive(Clone, Debug, PartialEq, Eq, Serialize, Deserialize)]\\n\\npub struct MilestoneEssence {\\n\\n pub index: MilestoneIndex,\\n\\n pub timestamp: u32,\\n\\n pub previous_milestone_id: MilestoneId,\\n\\n pub parents: Box<[BlockId]>,\\n\\n #[serde(with = \\\"bytify\\\")]\\n\\n pub inclusion_merkle_root: [u8; Self::MERKLE_PROOF_LENGTH],\\n\\n #[serde(with = \\\"bytify\\\")]\\n\\n pub applied_merkle_root: [u8; Self::MERKLE_PROOF_LENGTH],\\n\\n #[serde(with = \\\"serde_bytes\\\")]\\n\\n pub metadata: Vec<u8>,\\n\\n pub options: Box<[MilestoneOption]>,\\n\\n}\\n\\n\\n\\nimpl MilestoneEssence {\\n\",\n \"file_path\": \"src/types/stardust/block/payload/milestone/mod.rs\",\n \"rank\": 17,\n \"score\": 129350.35581215912\n },\n {\n \"content\": \"\\n\\n use bee_block_stardust::payload::TreasuryTransactionPayload;\\n\\n use mongodb::bson::{from_bson, to_bson, Bson};\\n\\n\\n\\n use super::*;\\n\\n use crate::types::stardust::block::signature::test::get_test_signature;\\n\\n\\n\\n #[test]\\n\\n fn test_milestone_id_bson() {\\n\\n let milestone_id = MilestoneId::from(bee_test::rand::milestone::rand_milestone_id());\\n\\n let bson = to_bson(&milestone_id).unwrap();\\n\\n assert_eq!(Bson::from(milestone_id), bson);\\n\\n assert_eq!(milestone_id, from_bson::<MilestoneId>(bson).unwrap());\\n\\n }\\n\\n\\n\\n #[test]\\n\\n fn test_milestone_payload_bson() {\\n\\n let payload = get_test_milestone_payload();\\n\\n let bson = to_bson(&payload).unwrap();\\n\\n assert_eq!(payload, from_bson::<MilestonePayload>(bson).unwrap());\\n\",\n \"file_path\": \"src/types/stardust/block/payload/milestone/mod.rs\",\n \"rank\": 18,\n \"score\": 129348.8643037681\n },\n {\n \"content\": \"\\n\\n fn try_from(value: MilestoneEssence) -> Result<Self, Self::Error> {\\n\\n bee::MilestoneEssence::new(\\n\\n value.index.into(),\\n\\n value.timestamp,\\n\\n value.previous_milestone_id.into(),\\n\\n bee_block_stardust::parent::Parents::new(\\n\\n Vec::from(value.parents).into_iter().map(Into::into).collect::<Vec<_>>(),\\n\\n )?,\\n\\n bee_block_stardust::payload::milestone::MerkleRoot::from(value.inclusion_merkle_root),\\n\\n bee_block_stardust::payload::milestone::MerkleRoot::from(value.applied_merkle_root),\\n\\n value.metadata,\\n\\n bee_block_stardust::payload::MilestoneOptions::new(\\n\\n Vec::from(value.options)\\n\\n .into_iter()\\n\\n .map(TryInto::try_into)\\n\\n .collect::<Result<Vec<_>, _>>()?,\\n\\n )?,\\n\\n )\\n\\n }\\n\",\n \"file_path\": \"src/types/stardust/block/payload/milestone/mod.rs\",\n \"rank\": 19,\n \"score\": 129348.78188267091\n },\n {\n \"content\": \"}\\n\\n\\n\\n#[derive(Clone, Debug, PartialEq, Eq, Serialize, Deserialize)]\\n\\n#[serde(tag = \\\"kind\\\")]\\n\\npub enum MilestoneOption {\\n\\n #[serde(rename = \\\"receipt\\\")]\\n\\n Receipt {\\n\\n migrated_at: MilestoneIndex,\\n\\n last: bool,\\n\\n funds: Box<[MigratedFundsEntry]>,\\n\\n transaction: TreasuryTransactionPayload,\\n\\n },\\n\\n #[serde(rename = \\\"parameters\\\")]\\n\\n Parameters {\\n\\n target_milestone_index: MilestoneIndex,\\n\\n protocol_version: u8,\\n\\n binary_parameters: Box<[u8]>,\\n\\n },\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/types/stardust/block/payload/milestone/mod.rs\",\n \"rank\": 20,\n \"score\": 129347.25078850386\n },\n {\n \"content\": \" bee_test::rand::milestone::rand_milestone_id(),\\n\\n bee_test::rand::parents::rand_parents(),\\n\\n bee_test::rand::milestone::rand_merkle_root(),\\n\\n bee_test::rand::milestone::rand_merkle_root(),\\n\\n \\\"Foo\\\".as_bytes().to_vec(),\\n\\n bee::MilestoneOptions::new(vec![bee::option::MilestoneOption::Receipt(\\n\\n bee::option::ReceiptMilestoneOption::new(\\n\\n 1.into(),\\n\\n false,\\n\\n vec![\\n\\n get_test_ed25519_migrated_funds_entry().try_into().unwrap(),\\n\\n get_test_alias_migrated_funds_entry().try_into().unwrap(),\\n\\n get_test_nft_migrated_funds_entry().try_into().unwrap(),\\n\\n ],\\n\\n TreasuryTransactionPayload::new(\\n\\n bee_test::rand::input::rand_treasury_input(),\\n\\n bee_test::rand::output::rand_treasury_output(),\\n\\n )\\n\\n .unwrap(),\\n\\n )\\n\",\n \"file_path\": \"src/types/stardust/block/payload/milestone/mod.rs\",\n \"rank\": 21,\n \"score\": 129345.27595303954\n },\n {\n \"content\": \" const MERKLE_PROOF_LENGTH: usize = bee::MerkleRoot::LENGTH;\\n\\n}\\n\\n\\n\\nimpl From<&bee::MilestoneEssence> for MilestoneEssence {\\n\\n fn from(value: &bee::MilestoneEssence) -> Self {\\n\\n Self {\\n\\n index: value.index().0.into(),\\n\\n timestamp: value.timestamp(),\\n\\n previous_milestone_id: (*value.previous_milestone_id()).into(),\\n\\n parents: value.parents().iter().map(|id| BlockId::from(*id)).collect(),\\n\\n inclusion_merkle_root: **value.inclusion_merkle_root(),\\n\\n applied_merkle_root: **value.applied_merkle_root(),\\n\\n metadata: value.metadata().to_vec(),\\n\\n options: value.options().iter().map(Into::into).collect(),\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\nimpl TryFrom<MilestoneEssence> for bee::MilestoneEssence {\\n\\n type Error = bee_block_stardust::Error;\\n\",\n \"file_path\": \"src/types/stardust/block/payload/milestone/mod.rs\",\n \"rank\": 22,\n \"score\": 129344.25899800277\n },\n {\n \"content\": \" .unwrap(),\\n\\n )\\n\\n }\\n\\n\\n\\n pub(crate) fn get_test_nft_migrated_funds_entry() -> MigratedFundsEntry {\\n\\n MigratedFundsEntry::from(\\n\\n &bee::option::MigratedFundsEntry::new(\\n\\n bee::option::TailTransactionHash::new(TAIL_TRANSACTION_HASH3).unwrap(),\\n\\n bee_block_stardust::address::Address::Nft(bee_test::rand::address::rand_nft_address()),\\n\\n 2000000,\\n\\n )\\n\\n .unwrap(),\\n\\n )\\n\\n }\\n\\n\\n\\n pub(crate) fn get_test_milestone_essence() -> MilestoneEssence {\\n\\n MilestoneEssence::from(\\n\\n &bee::MilestoneEssence::new(\\n\\n 1.into(),\\n\\n 12345,\\n\",\n \"file_path\": \"src/types/stardust/block/payload/milestone/mod.rs\",\n \"rank\": 23,\n \"score\": 129343.34158634528\n },\n {\n \"content\": \" binary_parameters,\\n\\n } => Self::Parameters(bee::ParametersMilestoneOption::new(\\n\\n target_milestone_index.into(),\\n\\n protocol_version,\\n\\n binary_parameters.into_vec(),\\n\\n )?),\\n\\n })\\n\\n }\\n\\n}\\n\\n\\n\\n#[derive(Copy, Clone, Debug, PartialEq, Eq, Serialize, Deserialize)]\\n\\npub struct MigratedFundsEntry {\\n\\n #[serde(with = \\\"bytify\\\")]\\n\\n tail_transaction_hash: [u8; Self::TAIL_TRANSACTION_HASH_LENGTH],\\n\\n address: Address,\\n\\n #[serde(with = \\\"crate::types::util::stringify\\\")]\\n\\n amount: u64,\\n\\n}\\n\\n\\n\\nimpl MigratedFundsEntry {\\n\",\n \"file_path\": \"src/types/stardust/block/payload/milestone/mod.rs\",\n \"rank\": 24,\n \"score\": 129342.34821978457\n },\n {\n \"content\": \" .unwrap(),\\n\\n )])\\n\\n .unwrap(),\\n\\n )\\n\\n .unwrap(),\\n\\n )\\n\\n }\\n\\n\\n\\n pub(crate) fn get_test_milestone_payload() -> MilestonePayload {\\n\\n MilestonePayload::from(\\n\\n &bee::MilestonePayload::new(\\n\\n get_test_milestone_essence().try_into().unwrap(),\\n\\n vec![get_test_signature().try_into().unwrap()],\\n\\n )\\n\\n .unwrap(),\\n\\n )\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/types/stardust/block/payload/milestone/mod.rs\",\n \"rank\": 25,\n \"score\": 129342.20252853967\n },\n {\n \"content\": \" value.address.into(),\\n\\n value.amount,\\n\\n )\\n\\n }\\n\\n}\\n\\n\\n\\n#[cfg(test)]\\n\\npub(crate) mod test {\\n\\n const TAIL_TRANSACTION_HASH1: [u8; 49] = [\\n\\n 222, 235, 107, 67, 2, 173, 253, 93, 165, 90, 166, 45, 102, 91, 19, 137, 71, 146, 156, 180, 248, 31, 56, 25, 68,\\n\\n 154, 98, 100, 64, 108, 203, 48, 76, 75, 114, 150, 34, 153, 203, 35, 225, 120, 194, 175, 169, 207, 80, 229, 10,\\n\\n ];\\n\\n const TAIL_TRANSACTION_HASH2: [u8; 49] = [\\n\\n 222, 235, 107, 67, 2, 173, 253, 93, 165, 90, 166, 45, 102, 91, 19, 137, 71, 146, 156, 180, 248, 31, 56, 25, 68,\\n\\n 154, 98, 100, 64, 108, 203, 48, 76, 75, 114, 150, 34, 153, 203, 35, 225, 120, 194, 175, 169, 207, 80, 229, 11,\\n\\n ];\\n\\n const TAIL_TRANSACTION_HASH3: [u8; 49] = [\\n\\n 222, 235, 107, 67, 2, 173, 253, 93, 165, 90, 166, 45, 102, 91, 19, 137, 71, 146, 156, 180, 248, 31, 56, 25, 68,\\n\\n 154, 98, 100, 64, 108, 203, 48, 76, 75, 114, 150, 34, 153, 203, 35, 225, 120, 194, 175, 169, 207, 80, 229, 12,\\n\\n ];\\n\",\n \"file_path\": \"src/types/stardust/block/payload/milestone/mod.rs\",\n \"rank\": 26,\n \"score\": 129342.10835923479\n },\n {\n \"content\": \"\\n\\nimpl From<&bee::MilestonePayload> for MilestonePayload {\\n\\n fn from(value: &bee::MilestonePayload) -> Self {\\n\\n Self {\\n\\n essence: MilestoneEssence::from(value.essence()),\\n\\n signatures: value.signatures().iter().map(Into::into).collect(),\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\nimpl TryFrom<MilestonePayload> for bee::MilestonePayload {\\n\\n type Error = bee_block_stardust::Error;\\n\\n\\n\\n fn try_from(value: MilestonePayload) -> Result<Self, Self::Error> {\\n\\n bee::MilestonePayload::new(\\n\\n value.essence.try_into()?,\\n\\n Vec::from(value.signatures)\\n\\n .into_iter()\\n\\n .map(Into::into)\\n\\n .collect::<Vec<_>>(),\\n\",\n \"file_path\": \"src/types/stardust/block/payload/milestone/mod.rs\",\n \"rank\": 27,\n \"score\": 129342.03759231679\n },\n {\n \"content\": \"impl From<&bee::MilestoneOption> for MilestoneOption {\\n\\n fn from(value: &bee::MilestoneOption) -> Self {\\n\\n match value {\\n\\n bee::MilestoneOption::Receipt(r) => Self::Receipt {\\n\\n migrated_at: r.migrated_at().into(),\\n\\n last: r.last(),\\n\\n funds: r.funds().iter().map(Into::into).collect(),\\n\\n transaction: r.transaction().into(),\\n\\n },\\n\\n bee::MilestoneOption::Parameters(p) => Self::Parameters {\\n\\n target_milestone_index: p.target_milestone_index().into(),\\n\\n protocol_version: p.protocol_version(),\\n\\n binary_parameters: p.binary_parameters().to_owned().into_boxed_slice(),\\n\\n },\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\nimpl TryFrom<MilestoneOption> for bee::MilestoneOption {\\n\\n type Error = bee_block_stardust::Error;\\n\",\n \"file_path\": \"src/types/stardust/block/payload/milestone/mod.rs\",\n \"rank\": 28,\n \"score\": 129340.52913975384\n },\n {\n \"content\": \" }\\n\\n\\n\\n pub(crate) fn get_test_ed25519_migrated_funds_entry() -> MigratedFundsEntry {\\n\\n MigratedFundsEntry::from(\\n\\n &bee::option::MigratedFundsEntry::new(\\n\\n bee::option::TailTransactionHash::new(TAIL_TRANSACTION_HASH1).unwrap(),\\n\\n bee_block_stardust::address::Address::Ed25519(bee_test::rand::address::rand_ed25519_address()),\\n\\n 2000000,\\n\\n )\\n\\n .unwrap(),\\n\\n )\\n\\n }\\n\\n\\n\\n pub(crate) fn get_test_alias_migrated_funds_entry() -> MigratedFundsEntry {\\n\\n MigratedFundsEntry::from(\\n\\n &bee::option::MigratedFundsEntry::new(\\n\\n bee::option::TailTransactionHash::new(TAIL_TRANSACTION_HASH2).unwrap(),\\n\\n bee_block_stardust::address::Address::Alias(bee_test::rand::address::rand_alias_address()),\\n\\n 2000000,\\n\\n )\\n\",\n \"file_path\": \"src/types/stardust/block/payload/milestone/mod.rs\",\n \"rank\": 29,\n \"score\": 129339.66311598828\n },\n {\n \"content\": \"\\n\\n fn try_from(value: MilestoneOption) -> Result<Self, Self::Error> {\\n\\n Ok(match value {\\n\\n MilestoneOption::Receipt {\\n\\n migrated_at,\\n\\n last,\\n\\n funds,\\n\\n transaction,\\n\\n } => Self::Receipt(bee::ReceiptMilestoneOption::new(\\n\\n migrated_at.into(),\\n\\n last,\\n\\n Vec::from(funds)\\n\\n .into_iter()\\n\\n .map(TryInto::try_into)\\n\\n .collect::<Result<Vec<_>, _>>()?,\\n\\n transaction.try_into()?,\\n\\n )?),\\n\\n MilestoneOption::Parameters {\\n\\n target_milestone_index,\\n\\n protocol_version,\\n\",\n \"file_path\": \"src/types/stardust/block/payload/milestone/mod.rs\",\n \"rank\": 30,\n \"score\": 129338.22106784781\n },\n {\n \"content\": \" const TAIL_TRANSACTION_HASH_LENGTH: usize = bee::option::TailTransactionHash::LENGTH;\\n\\n}\\n\\n\\n\\nimpl From<&bee::option::MigratedFundsEntry> for MigratedFundsEntry {\\n\\n fn from(value: &bee::option::MigratedFundsEntry) -> Self {\\n\\n Self {\\n\\n // Unwrap: Should not fail as the length is defined by the struct\\n\\n tail_transaction_hash: value.tail_transaction_hash().as_ref().try_into().unwrap(),\\n\\n address: (*value.address()).into(),\\n\\n amount: value.amount(),\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\nimpl TryFrom<MigratedFundsEntry> for bee::option::MigratedFundsEntry {\\n\\n type Error = bee_block_stardust::Error;\\n\\n\\n\\n fn try_from(value: MigratedFundsEntry) -> Result<Self, Self::Error> {\\n\\n Self::new(\\n\\n bee::option::TailTransactionHash::new(value.tail_transaction_hash)?,\\n\",\n \"file_path\": \"src/types/stardust/block/payload/milestone/mod.rs\",\n \"rank\": 31,\n \"score\": 129336.41802715464\n },\n {\n \"content\": \"#[allow(missing_docs)]\\n\\npub trait AsyncFn<'a, O> {\\n\\n type Output: 'a + Future<Output = O> + Send;\\n\\n fn call(self, cx: &'a mut RuntimeScope) -> Self::Output;\\n\\n}\\n\\nimpl<'a, Fn, Fut, O> AsyncFn<'a, O> for Fn\\n\\nwhere\\n\\n Fn: FnOnce(&'a mut RuntimeScope) -> Fut,\\n\\n Fut: 'a + Future<Output = O> + Send,\\n\\n{\\n\\n type Output = Fut;\\n\\n fn call(self, cx: &'a mut RuntimeScope) -> Self::Output {\\n\\n (self)(cx)\\n\\n }\\n\\n}\\n\\n\\n\\n/// Starting point for the runtime.\\n\\npub struct Runtime;\\n\\n\\n\\nimpl Runtime {\\n\\n /// Launches a new root runtime scope.\\n\",\n \"file_path\": \"src/runtime/mod.rs\",\n \"rank\": 32,\n \"score\": 114329.4486232494\n },\n {\n \"content\": \"pub struct SpentMetadata {\\n\\n pub transaction_id: TransactionId,\\n\\n pub spent: MilestoneIndexTimestamp,\\n\\n}\\n\\n\\n\\n/// Block metadata.\\n\\n#[derive(Clone, Debug, Serialize, Deserialize)]\\n\\npub struct OutputMetadata {\\n\\n pub output_id: OutputId,\\n\\n pub block_id: BlockId,\\n\\n pub transaction_id: TransactionId,\\n\\n pub booked: MilestoneIndexTimestamp,\\n\\n pub spent: Option<SpentMetadata>,\\n\\n}\\n\\n\\n\\npub struct OutputWithMetadata {\\n\\n pub output: Output,\\n\\n pub metadata: OutputMetadata,\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/types/ledger/output_metadata.rs\",\n \"rank\": 33,\n \"score\": 103354.92735694497\n },\n {\n \"content\": \"// Copyright 2022 IOTA Stiftung\\n\\n// SPDX-License-Identifier: Apache-2.0\\n\\n\\n\\nuse serde::{Deserialize, Serialize};\\n\\n\\n\\nuse crate::types::{\\n\\n stardust::{\\n\\n block::{BlockId, Output, OutputId, TransactionId},\\n\\n milestone::MilestoneTimestamp,\\n\\n },\\n\\n tangle::MilestoneIndex,\\n\\n};\\n\\n\\n\\n#[derive(Clone, Debug, Serialize, Deserialize)]\\n\\npub struct MilestoneIndexTimestamp {\\n\\n pub milestone_index: MilestoneIndex,\\n\\n pub milestone_timestamp: MilestoneTimestamp,\\n\\n}\\n\\n\\n\\n#[derive(Clone, Debug, Serialize, Deserialize)]\\n\",\n \"file_path\": \"src/types/ledger/output_metadata.rs\",\n \"rank\": 34,\n \"score\": 103351.14616774209\n },\n {\n \"content\": \"#[cfg(feature = \\\"inx\\\")]\\n\\nimpl From<inx::LedgerOutput> for OutputWithMetadata {\\n\\n fn from(value: inx::LedgerOutput) -> Self {\\n\\n let output_id = OutputId::from(value.output_id);\\n\\n let metadata = OutputMetadata {\\n\\n output_id,\\n\\n block_id: value.block_id.into(),\\n\\n transaction_id: output_id.transaction_id,\\n\\n booked: MilestoneIndexTimestamp {\\n\\n milestone_index: value.milestone_index_booked.into(),\\n\\n milestone_timestamp: value.milestone_timestamp_booked.into(),\\n\\n },\\n\\n spent: None,\\n\\n };\\n\\n Self {\\n\\n output: (&value.output).into(),\\n\\n metadata,\\n\\n }\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/types/ledger/output_metadata.rs\",\n \"rank\": 35,\n \"score\": 103349.88685232421\n },\n {\n \"content\": \"\\n\\n#[cfg(feature = \\\"inx\\\")]\\n\\nimpl From<inx::LedgerSpent> for OutputWithMetadata {\\n\\n fn from(value: inx::LedgerSpent) -> Self {\\n\\n let mut output_with_metadata = OutputWithMetadata::from(value.output);\\n\\n\\n\\n output_with_metadata.metadata.spent = Some(SpentMetadata {\\n\\n transaction_id: value.transaction_id_spent.into(),\\n\\n spent: MilestoneIndexTimestamp {\\n\\n milestone_index: value.milestone_index_spent.into(),\\n\\n milestone_timestamp: value.milestone_timestamp_spent.into(),\\n\\n },\\n\\n });\\n\\n\\n\\n output_with_metadata\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/types/ledger/output_metadata.rs\",\n \"rank\": 36,\n \"score\": 103346.91862958245\n },\n {\n \"content\": \"// Copyright 2022 IOTA Stiftung\\n\\n// SPDX-License-Identifier: Apache-2.0\\n\\n\\n\\nuse serde::{Deserialize, Serialize};\\n\\n\\n\\nuse super::{ConflictReason, LedgerInclusionState};\\n\\nuse crate::types::{stardust::block::BlockId, tangle::MilestoneIndex};\\n\\n\\n\\n/// Block metadata.\\n\\n#[derive(Clone, Debug, Serialize, Deserialize)]\\n\\npub struct BlockMetadata {\\n\\n /// The id of the corresponding block.\\n\\n pub block_id: BlockId,\\n\\n /// The parents of the corresponding block.\\n\\n pub parents: Box<[BlockId]>,\\n\\n /// Status of the solidification process.\\n\\n pub is_solid: bool,\\n\\n /// Indicates that the block should be promoted.\\n\\n pub should_promote: bool,\\n\\n /// Indicates that the block should be reattached.\\n\",\n \"file_path\": \"src/types/ledger/block_metadata.rs\",\n \"rank\": 37,\n \"score\": 100939.79969603356\n },\n {\n \"content\": \" pub should_reattach: bool,\\n\\n /// The milestone index referencing the block.\\n\\n pub referenced_by_milestone_index: MilestoneIndex,\\n\\n /// The corresponding milestone index.\\n\\n pub milestone_index: MilestoneIndex,\\n\\n /// The inclusion state of the block.\\n\\n pub inclusion_state: LedgerInclusionState,\\n\\n /// If the ledger inclusion state is conflicting, the reason for the conflict.\\n\\n pub conflict_reason: ConflictReason,\\n\\n}\\n\\n\\n\\n#[cfg(feature = \\\"inx\\\")]\\n\\nimpl From<inx::BlockMetadata> for BlockMetadata {\\n\\n fn from(metadata: inx::BlockMetadata) -> Self {\\n\\n Self {\\n\\n block_id: metadata.block_id.into(),\\n\\n parents: metadata.parents.into_iter().map(|id| id.into()).collect(),\\n\\n is_solid: metadata.is_solid,\\n\\n should_promote: metadata.should_promote,\\n\\n should_reattach: metadata.should_reattach,\\n\\n referenced_by_milestone_index: metadata.referenced_by_milestone_index.into(),\\n\\n milestone_index: metadata.milestone_index.into(),\\n\\n inclusion_state: metadata.ledger_inclusion_state.into(),\\n\\n conflict_reason: metadata.conflict_reason.into(),\\n\\n }\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/types/ledger/block_metadata.rs\",\n \"rank\": 38,\n \"score\": 100938.44387855426\n },\n {\n \"content\": \"/// Spawn a tokio task. The provided name will be used to configure the task if console tracing is enabled.\\n\\npub fn spawn_task<F>(name: &str, task: F) -> tokio::task::JoinHandle<F::Output>\\n\\nwhere\\n\\n F: 'static + Future + Send,\\n\\n F::Output: 'static + Send,\\n\\n{\\n\\n log::trace!(\\\"Spawning task {}\\\", name);\\n\\n #[cfg(all(tokio_unstable, feature = \\\"console\\\"))]\\n\\n return tokio::task::Builder::new().name(name).spawn(task);\\n\\n #[cfg(not(all(tokio_unstable, feature = \\\"console\\\")))]\\n\\n return tokio::spawn(task);\\n\\n}\\n\",\n \"file_path\": \"src/runtime/mod.rs\",\n \"rank\": 39,\n \"score\": 99117.31356198348\n },\n {\n \"content\": \"// Copyright 2022 IOTA Stiftung\\n\\n// SPDX-License-Identifier: Apache-2.0\\n\\n\\n\\nuse bee_block_stardust::payload as bee;\\n\\nuse serde::{Deserialize, Serialize};\\n\\n\\n\\nmod milestone;\\n\\nmod tagged_data;\\n\\nmod transaction;\\n\\nmod treasury_transaction;\\n\\n\\n\\npub use self::{\\n\\n milestone::{MilestoneEssence, MilestoneId, MilestoneOption, MilestonePayload},\\n\\n tagged_data::TaggedDataPayload,\\n\\n transaction::{TransactionEssence, TransactionId, TransactionPayload},\\n\\n treasury_transaction::TreasuryTransactionPayload,\\n\\n};\\n\\n\\n\\n#[derive(Clone, Debug, PartialEq, Eq, Serialize, Deserialize)]\\n\\n#[serde(tag = \\\"kind\\\")]\\n\",\n \"file_path\": \"src/types/stardust/block/payload/mod.rs\",\n \"rank\": 40,\n \"score\": 97747.76516629719\n },\n {\n \"content\": \"}\\n\\n\\n\\nimpl TryFrom<Payload> for bee::Payload {\\n\\n type Error = bee_block_stardust::Error;\\n\\n\\n\\n fn try_from(value: Payload) -> Result<Self, Self::Error> {\\n\\n Ok(match value {\\n\\n Payload::Transaction(p) => bee::Payload::Transaction(Box::new((*p).try_into()?)),\\n\\n Payload::Milestone(p) => bee::Payload::Milestone(Box::new((*p).try_into()?)),\\n\\n Payload::TreasuryTransaction(p) => bee::Payload::TreasuryTransaction(Box::new((*p).try_into()?)),\\n\\n Payload::TaggedData(p) => bee::Payload::TaggedData(Box::new((*p).try_into()?)),\\n\\n })\\n\\n }\\n\\n}\\n\\n\\n\\n#[cfg(test)]\\n\\npub(crate) mod test {\\n\\n use mongodb::bson::{from_bson, to_bson};\\n\\n\\n\\n use super::{milestone, tagged_data, transaction, treasury_transaction, *};\\n\",\n \"file_path\": \"src/types/stardust/block/payload/mod.rs\",\n \"rank\": 41,\n \"score\": 97746.7027412807\n },\n {\n \"content\": \" pub(crate) fn get_test_transaction_payload() -> Payload {\\n\\n Payload::Transaction(Box::new(transaction::test::get_test_transaction_payload()))\\n\\n }\\n\\n\\n\\n pub(crate) fn get_test_milestone_payload() -> Payload {\\n\\n Payload::Milestone(Box::new(milestone::test::get_test_milestone_payload()))\\n\\n }\\n\\n\\n\\n pub(crate) fn get_test_treasury_transaction_payload() -> Payload {\\n\\n Payload::TreasuryTransaction(Box::new(\\n\\n treasury_transaction::test::get_test_treasury_transaction_payload(),\\n\\n ))\\n\\n }\\n\\n\\n\\n pub(crate) fn get_test_tagged_data_payload() -> Payload {\\n\\n Payload::TaggedData(Box::new(tagged_data::test::get_test_tagged_data_payload()))\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/types/stardust/block/payload/mod.rs\",\n \"rank\": 42,\n \"score\": 97742.93375341487\n },\n {\n \"content\": \"pub enum Payload {\\n\\n #[serde(rename = \\\"transaction\\\")]\\n\\n Transaction(Box<TransactionPayload>),\\n\\n #[serde(rename = \\\"milestone\\\")]\\n\\n Milestone(Box<MilestonePayload>),\\n\\n #[serde(rename = \\\"treasury_transaction\\\")]\\n\\n TreasuryTransaction(Box<TreasuryTransactionPayload>),\\n\\n #[serde(rename = \\\"tagged_data\\\")]\\n\\n TaggedData(Box<TaggedDataPayload>),\\n\\n}\\n\\n\\n\\nimpl From<&bee::Payload> for Payload {\\n\\n fn from(value: &bee::Payload) -> Self {\\n\\n match value {\\n\\n bee::Payload::Transaction(p) => Self::Transaction(Box::new(p.as_ref().into())),\\n\\n bee::Payload::Milestone(p) => Self::Milestone(Box::new(p.as_ref().into())),\\n\\n bee::Payload::TreasuryTransaction(p) => Self::TreasuryTransaction(Box::new(p.as_ref().into())),\\n\\n bee::Payload::TaggedData(p) => Self::TaggedData(Box::new(p.as_ref().into())),\\n\\n }\\n\\n }\\n\",\n \"file_path\": \"src/types/stardust/block/payload/mod.rs\",\n \"rank\": 43,\n \"score\": 97741.42557414039\n },\n {\n \"content\": \"\\n\\n #[test]\\n\\n fn test_payload_bson() {\\n\\n let payload = get_test_transaction_payload();\\n\\n let bson = to_bson(&payload).unwrap();\\n\\n assert_eq!(payload, from_bson::<Payload>(bson).unwrap());\\n\\n\\n\\n let payload = get_test_milestone_payload();\\n\\n let bson = to_bson(&payload).unwrap();\\n\\n assert_eq!(payload, from_bson::<Payload>(bson).unwrap());\\n\\n\\n\\n let payload = get_test_treasury_transaction_payload();\\n\\n let bson = to_bson(&payload).unwrap();\\n\\n assert_eq!(payload, from_bson::<Payload>(bson).unwrap());\\n\\n\\n\\n let payload = get_test_tagged_data_payload();\\n\\n let bson = to_bson(&payload).unwrap();\\n\\n assert_eq!(payload, from_bson::<Payload>(bson).unwrap());\\n\\n }\\n\\n\\n\",\n \"file_path\": \"src/types/stardust/block/payload/mod.rs\",\n \"rank\": 44,\n \"score\": 97736.38158374898\n },\n {\n \"content\": \"pub use self::{\\n\\n alias::{AliasId, AliasOutput},\\n\\n basic::BasicOutput,\\n\\n feature::Feature,\\n\\n foundry::FoundryOutput,\\n\\n native_token::{NativeToken, TokenScheme},\\n\\n nft::{NftId, NftOutput},\\n\\n treasury::TreasuryOutput,\\n\\n unlock_condition::UnlockCondition,\\n\\n};\\n\\nuse super::Address;\\n\\nuse crate::types::stardust::block::TransactionId;\\n\\n\\n\\npub type OutputAmount = u64;\\n\\npub type OutputIndex = u16;\\n\\n\\n\\n#[derive(Copy, Clone, Debug, PartialEq, Eq, Serialize, Deserialize)]\\n\\npub struct OutputId {\\n\\n pub transaction_id: TransactionId,\\n\\n pub index: OutputIndex,\\n\",\n \"file_path\": \"src/types/stardust/block/output/mod.rs\",\n \"rank\": 45,\n \"score\": 96955.51244849453\n },\n {\n \"content\": \"// Copyright 2022 IOTA Stiftung\\n\\n// SPDX-License-Identifier: Apache-2.0\\n\\n\\n\\nuse bee_block_stardust::output::feature as bee;\\n\\nuse serde::{Deserialize, Serialize};\\n\\n\\n\\nuse crate::types::stardust::block::Address;\\n\\n\\n\\n#[derive(Clone, Debug, PartialEq, Eq, Serialize, Deserialize)]\\n\\n#[serde(tag = \\\"kind\\\")]\\n\\npub enum Feature {\\n\\n #[serde(rename = \\\"sender\\\")]\\n\\n Sender { address: Address },\\n\\n #[serde(rename = \\\"issuer\\\")]\\n\\n Issuer { address: Address },\\n\\n #[serde(rename = \\\"metadata\\\")]\\n\\n Metadata {\\n\\n #[serde(with = \\\"serde_bytes\\\")]\\n\\n data: Box<[u8]>,\\n\\n },\\n\",\n \"file_path\": \"src/types/stardust/block/output/feature.rs\",\n \"rank\": 46,\n \"score\": 96955.43962970749\n },\n {\n \"content\": \"// Copyright 2022 IOTA Stiftung\\n\\n// SPDX-License-Identifier: Apache-2.0\\n\\n\\n\\nuse std::str::FromStr;\\n\\n\\n\\nuse bee_block_stardust::output as bee;\\n\\nuse mongodb::bson::{spec::BinarySubtype, Binary, Bson};\\n\\nuse serde::{Deserialize, Serialize};\\n\\n\\n\\nuse super::{Feature, NativeToken, OutputAmount, UnlockCondition};\\n\\nuse crate::types::util::bytify;\\n\\n\\n\\n#[derive(Copy, Clone, Debug, PartialEq, Eq, Serialize, Deserialize)]\\n\\n#[serde(transparent)]\\n\\npub struct NftId(#[serde(with = \\\"bytify\\\")] pub [u8; Self::LENGTH]);\\n\\n\\n\\nimpl NftId {\\n\\n const LENGTH: usize = bee::NftId::LENGTH;\\n\\n\\n\\n pub fn from_output_id_str(s: &str) -> Result<Self, bee_block_stardust::Error> {\\n\",\n \"file_path\": \"src/types/stardust/block/output/nft.rs\",\n \"rank\": 47,\n \"score\": 96953.5296143417\n },\n {\n \"content\": \"// Copyright 2022 IOTA Stiftung\\n\\n// SPDX-License-Identifier: Apache-2.0\\n\\n\\n\\nuse std::str::FromStr;\\n\\n\\n\\nuse bee_block_stardust::output as bee;\\n\\nuse mongodb::bson::{spec::BinarySubtype, Binary, Bson};\\n\\nuse serde::{Deserialize, Serialize};\\n\\n\\n\\nuse super::{feature::Feature, native_token::NativeToken, unlock_condition::UnlockCondition, OutputAmount};\\n\\nuse crate::types::util::bytify;\\n\\n\\n\\n#[derive(Copy, Clone, Debug, PartialEq, Eq, Serialize, Deserialize)]\\n\\n#[serde(transparent)]\\n\\npub struct AliasId(#[serde(with = \\\"bytify\\\")] pub [u8; Self::LENGTH]);\\n\\n\\n\\nimpl AliasId {\\n\\n const LENGTH: usize = bee::AliasId::LENGTH;\\n\\n\\n\\n pub fn from_output_id_str(s: &str) -> Result<Self, bee_block_stardust::Error> {\\n\",\n \"file_path\": \"src/types/stardust/block/output/alias.rs\",\n \"rank\": 48,\n \"score\": 96953.26400668887\n },\n {\n \"content\": \" .into_iter()\\n\\n .map(TryInto::try_into)\\n\\n .collect::<Result<Vec<_>, _>>()?,\\n\\n )\\n\\n .finish()\\n\\n }\\n\\n}\\n\\n\\n\\n#[cfg(test)]\\n\\npub(crate) mod test {\\n\\n use mongodb::bson::{from_bson, to_bson};\\n\\n\\n\\n use super::*;\\n\\n use crate::types::stardust::block::output::{\\n\\n feature::test::get_test_metadata_block,\\n\\n native_token::test::get_test_native_token,\\n\\n unlock_condition::test::{get_test_alias_address_as_address, get_test_immut_alias_address_condition},\\n\\n };\\n\\n\\n\\n #[test]\\n\",\n \"file_path\": \"src/types/stardust/block/output/foundry.rs\",\n \"rank\": 49,\n \"score\": 96952.11374456997\n },\n {\n \"content\": \" use crate::types::stardust::block::output::{\\n\\n feature::test::{get_test_metadata_block, get_test_sender_block, get_test_tag_block},\\n\\n native_token::test::get_test_native_token,\\n\\n unlock_condition::test::{\\n\\n get_test_address_condition, get_test_expiration_condition, get_test_storage_deposit_return_condition,\\n\\n get_test_timelock_condition,\\n\\n },\\n\\n };\\n\\n\\n\\n #[test]\\n\\n fn test_basic_output_bson() {\\n\\n let output = get_test_basic_output();\\n\\n let bson = to_bson(&output).unwrap();\\n\\n assert_eq!(output, from_bson::<BasicOutput>(bson).unwrap());\\n\\n }\\n\\n\\n\\n pub(crate) fn get_test_basic_output() -> BasicOutput {\\n\\n BasicOutput::from(\\n\\n &bee::BasicOutput::build_with_amount(100)\\n\\n .unwrap()\\n\",\n \"file_path\": \"src/types/stardust/block/output/basic.rs\",\n \"rank\": 50,\n \"score\": 96951.86005502268\n },\n {\n \"content\": \" .with_immutable_features(\\n\\n Vec::from(value.immutable_features)\\n\\n .into_iter()\\n\\n .map(TryInto::try_into)\\n\\n .collect::<Result<Vec<_>, _>>()?,\\n\\n )\\n\\n .finish()\\n\\n }\\n\\n}\\n\\n\\n\\n#[cfg(test)]\\n\\npub(crate) mod test {\\n\\n use mongodb::bson::{from_bson, to_bson};\\n\\n\\n\\n use super::*;\\n\\n use crate::types::stardust::block::output::{\\n\\n feature::test::{get_test_issuer_block, get_test_metadata_block, get_test_sender_block, get_test_tag_block},\\n\\n native_token::test::get_test_native_token,\\n\\n unlock_condition::test::{\\n\\n get_test_address_condition, get_test_expiration_condition, get_test_storage_deposit_return_condition,\\n\",\n \"file_path\": \"src/types/stardust/block/output/nft.rs\",\n \"rank\": 51,\n \"score\": 96951.63389101074\n },\n {\n \"content\": \"\\n\\n#[cfg(test)]\\n\\npub(crate) mod test {\\n\\n use mongodb::bson::{from_bson, to_bson};\\n\\n\\n\\n use super::*;\\n\\n use crate::types::stardust::block::output::{\\n\\n feature::test::{get_test_issuer_block, get_test_metadata_block, get_test_sender_block},\\n\\n native_token::test::get_test_native_token,\\n\\n unlock_condition::test::{get_test_governor_address_condition, get_test_state_controller_address_condition},\\n\\n };\\n\\n\\n\\n #[test]\\n\\n fn test_alias_id_bson() {\\n\\n let alias_id = AliasId::from(bee_test::rand::output::rand_alias_id());\\n\\n let bson = to_bson(&alias_id).unwrap();\\n\\n assert_eq!(Bson::from(alias_id), bson);\\n\\n assert_eq!(alias_id, from_bson::<AliasId>(bson).unwrap());\\n\\n }\\n\\n\\n\",\n \"file_path\": \"src/types/stardust/block/output/alias.rs\",\n \"rank\": 52,\n \"score\": 96951.44045329442\n },\n {\n \"content\": \"// Copyright 2022 IOTA Stiftung\\n\\n// SPDX-License-Identifier: Apache-2.0\\n\\n\\n\\nuse bee_block_stardust::output as bee;\\n\\nuse serde::{Deserialize, Serialize};\\n\\n\\n\\nuse super::{Feature, NativeToken, OutputAmount, UnlockCondition};\\n\\n\\n\\n#[derive(Clone, Debug, PartialEq, Eq, Serialize, Deserialize)]\\n\\npub struct BasicOutput {\\n\\n #[serde(with = \\\"crate::types::util::stringify\\\")]\\n\\n pub amount: OutputAmount,\\n\\n pub native_tokens: Box<[NativeToken]>,\\n\\n pub unlock_conditions: Box<[UnlockCondition]>,\\n\\n pub features: Box<[Feature]>,\\n\\n}\\n\\n\\n\\nimpl From<&bee::BasicOutput> for BasicOutput {\\n\\n fn from(value: &bee::BasicOutput) -> Self {\\n\\n Self {\\n\",\n \"file_path\": \"src/types/stardust/block/output/basic.rs\",\n \"rank\": 53,\n \"score\": 96951.16841045592\n },\n {\n \"content\": \"// Copyright 2022 IOTA Stiftung\\n\\n// SPDX-License-Identifier: Apache-2.0\\n\\n\\n\\nuse bee_block_stardust::output as bee;\\n\\nuse serde::{Deserialize, Serialize};\\n\\n\\n\\nuse super::{Feature, NativeToken, OutputAmount, TokenScheme, UnlockCondition};\\n\\n\\n\\n#[derive(Clone, Debug, PartialEq, Eq, Serialize, Deserialize)]\\n\\npub struct FoundryOutput {\\n\\n #[serde(with = \\\"crate::types::util::stringify\\\")]\\n\\n pub amount: OutputAmount,\\n\\n pub native_tokens: Box<[NativeToken]>,\\n\\n #[serde(with = \\\"crate::types::util::stringify\\\")]\\n\\n pub serial_number: u32,\\n\\n pub token_scheme: TokenScheme,\\n\\n pub unlock_conditions: Box<[UnlockCondition]>,\\n\\n pub features: Box<[Feature]>,\\n\\n pub immutable_features: Box<[Feature]>,\\n\\n}\\n\",\n \"file_path\": \"src/types/stardust/block/output/foundry.rs\",\n \"rank\": 54,\n \"score\": 96950.68784180892\n },\n {\n \"content\": \"// Copyright 2022 IOTA Stiftung\\n\\n// SPDX-License-Identifier: Apache-2.0\\n\\n\\n\\nuse bee_block_stardust::output as bee;\\n\\nuse serde::{Deserialize, Serialize};\\n\\n\\n\\n#[derive(Copy, Clone, Debug, PartialEq, Eq, Serialize, Deserialize)]\\n\\npub struct TreasuryOutput {\\n\\n #[serde(with = \\\"crate::types::util::stringify\\\")]\\n\\n amount: u64,\\n\\n}\\n\\n\\n\\nimpl From<&bee::TreasuryOutput> for TreasuryOutput {\\n\\n fn from(value: &bee::TreasuryOutput) -> Self {\\n\\n Self { amount: value.amount() }\\n\\n }\\n\\n}\\n\\n\\n\\nimpl TryFrom<TreasuryOutput> for bee::TreasuryOutput {\\n\\n type Error = bee_block_stardust::Error;\\n\",\n \"file_path\": \"src/types/stardust/block/output/treasury.rs\",\n \"rank\": 55,\n \"score\": 96950.39550187178\n },\n {\n \"content\": \" pub state_index: u32,\\n\\n #[serde(with = \\\"serde_bytes\\\")]\\n\\n pub state_metadata: Box<[u8]>,\\n\\n pub foundry_counter: u32,\\n\\n pub unlock_conditions: Box<[UnlockCondition]>,\\n\\n pub features: Box<[Feature]>,\\n\\n pub immutable_features: Box<[Feature]>,\\n\\n}\\n\\n\\n\\nimpl From<&bee::AliasOutput> for AliasOutput {\\n\\n fn from(value: &bee::AliasOutput) -> Self {\\n\\n Self {\\n\\n amount: value.amount(),\\n\\n native_tokens: value.native_tokens().iter().map(Into::into).collect(),\\n\\n alias_id: (*value.alias_id()).into(),\\n\\n state_index: value.state_index(),\\n\\n state_metadata: value.state_metadata().to_vec().into_boxed_slice(),\\n\\n foundry_counter: value.foundry_counter(),\\n\\n unlock_conditions: value.unlock_conditions().iter().map(Into::into).collect(),\\n\\n features: value.features().iter().map(Into::into).collect(),\\n\",\n \"file_path\": \"src/types/stardust/block/output/alias.rs\",\n \"rank\": 56,\n \"score\": 96950.08191236915\n },\n {\n \"content\": \"// Copyright 2022 IOTA Stiftung\\n\\n// SPDX-License-Identifier: Apache-2.0\\n\\n\\n\\nmod feature;\\n\\nmod native_token;\\n\\nmod unlock_condition;\\n\\n\\n\\n// The different output types\\n\\nmod alias;\\n\\nmod basic;\\n\\nmod foundry;\\n\\nmod nft;\\n\\npub(crate) mod treasury;\\n\\n\\n\\nuse std::str::FromStr;\\n\\n\\n\\nuse bee_block_stardust::output as bee;\\n\\nuse mongodb::bson::{doc, Bson};\\n\\nuse serde::{Deserialize, Serialize};\\n\\n\\n\",\n \"file_path\": \"src/types/stardust/block/output/mod.rs\",\n \"rank\": 57,\n \"score\": 96949.94756166391\n },\n {\n \"content\": \" fn test_foundry_output_bson() {\\n\\n let output = get_test_foundry_output();\\n\\n let bson = to_bson(&output).unwrap();\\n\\n assert_eq!(output, from_bson::<FoundryOutput>(bson).unwrap());\\n\\n }\\n\\n\\n\\n pub(crate) fn get_test_foundry_output() -> FoundryOutput {\\n\\n FoundryOutput::from(\\n\\n &bee::FoundryOutput::build_with_amount(\\n\\n 100,\\n\\n bee_test::rand::number::rand_number(),\\n\\n bee::TokenScheme::Simple(bee::SimpleTokenScheme::new(250.into(), 200.into(), 300.into()).unwrap()),\\n\\n )\\n\\n .unwrap()\\n\\n .with_native_tokens(vec![get_test_native_token().try_into().unwrap()])\\n\\n .with_unlock_conditions(vec![\\n\\n get_test_immut_alias_address_condition(get_test_alias_address_as_address())\\n\\n .try_into()\\n\\n .unwrap(),\\n\\n ])\\n\\n .with_features(vec![get_test_metadata_block().try_into().unwrap()])\\n\\n .with_immutable_features(vec![get_test_metadata_block().try_into().unwrap()])\\n\\n .finish()\\n\\n .unwrap(),\\n\\n )\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/types/stardust/block/output/foundry.rs\",\n \"rank\": 58,\n \"score\": 96949.39217722006\n },\n {\n \"content\": \"pub(crate) mod test {\\n\\n use mongodb::bson::{from_bson, to_bson};\\n\\n\\n\\n use super::*;\\n\\n\\n\\n #[test]\\n\\n fn test_feature_bson() {\\n\\n let block = get_test_sender_block(bee_test::rand::address::rand_address().into());\\n\\n let bson = to_bson(&block).unwrap();\\n\\n assert_eq!(block, from_bson::<Feature>(bson).unwrap());\\n\\n\\n\\n let block = get_test_issuer_block(bee_test::rand::address::rand_address().into());\\n\\n let bson = to_bson(&block).unwrap();\\n\\n assert_eq!(block, from_bson::<Feature>(bson).unwrap());\\n\\n\\n\\n let block = get_test_metadata_block();\\n\\n let bson = to_bson(&block).unwrap();\\n\\n assert_eq!(block, from_bson::<Feature>(bson).unwrap());\\n\\n\\n\\n let block = get_test_tag_block();\\n\",\n \"file_path\": \"src/types/stardust/block/output/feature.rs\",\n \"rank\": 59,\n \"score\": 96949.0296664848\n },\n {\n \"content\": \" let bson = to_bson(&block).unwrap();\\n\\n assert_eq!(block, from_bson::<Feature>(bson).unwrap());\\n\\n }\\n\\n\\n\\n pub(crate) fn get_test_sender_block(address: Address) -> Feature {\\n\\n Feature::Sender { address }\\n\\n }\\n\\n\\n\\n pub(crate) fn get_test_issuer_block(address: Address) -> Feature {\\n\\n Feature::Issuer { address }\\n\\n }\\n\\n\\n\\n pub(crate) fn get_test_metadata_block() -> Feature {\\n\\n Feature::Metadata {\\n\\n data: \\\"Foo\\\".as_bytes().to_vec().into_boxed_slice(),\\n\\n }\\n\\n }\\n\\n\\n\\n pub(crate) fn get_test_tag_block() -> Feature {\\n\\n Feature::Tag {\\n\\n data: \\\"Bar\\\".as_bytes().to_vec().into_boxed_slice(),\\n\\n }\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/types/stardust/block/output/feature.rs\",\n \"rank\": 60,\n \"score\": 96948.26689028397\n },\n {\n \"content\": \"}\\n\\n\\n\\nimpl From<bee::OutputId> for OutputId {\\n\\n fn from(value: bee::OutputId) -> Self {\\n\\n Self {\\n\\n transaction_id: (*value.transaction_id()).into(),\\n\\n index: value.index(),\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\nimpl TryFrom<OutputId> for bee::OutputId {\\n\\n type Error = bee_block_stardust::Error;\\n\\n\\n\\n fn try_from(value: OutputId) -> Result<Self, Self::Error> {\\n\\n bee::OutputId::new(value.transaction_id.into(), value.index)\\n\\n }\\n\\n}\\n\\n\\n\\nimpl FromStr for OutputId {\\n\",\n \"file_path\": \"src/types/stardust/block/output/mod.rs\",\n \"rank\": 61,\n \"score\": 96948.2397301242\n },\n {\n \"content\": \"\\n\\n fn try_from(value: TreasuryOutput) -> Result<Self, Self::Error> {\\n\\n Self::new(value.amount)\\n\\n }\\n\\n}\\n\\n\\n\\n#[cfg(test)]\\n\\npub(crate) mod test {\\n\\n use mongodb::bson::{from_bson, to_bson};\\n\\n\\n\\n use super::*;\\n\\n\\n\\n #[test]\\n\\n fn test_treasury_output_bson() {\\n\\n let output = TreasuryOutput::from(&bee_test::rand::output::rand_treasury_output());\\n\\n let bson = to_bson(&output).unwrap();\\n\\n assert_eq!(output, from_bson::<TreasuryOutput>(bson).unwrap());\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/types/stardust/block/output/treasury.rs\",\n \"rank\": 62,\n \"score\": 96947.52891419535\n },\n {\n \"content\": \" fn try_from(value: Output) -> Result<Self, Self::Error> {\\n\\n Ok(match value {\\n\\n Output::Treasury(o) => bee::Output::Treasury(o.try_into()?),\\n\\n Output::Basic(o) => bee::Output::Basic(o.try_into()?),\\n\\n Output::Alias(o) => bee::Output::Alias(o.try_into()?),\\n\\n Output::Foundry(o) => bee::Output::Foundry(o.try_into()?),\\n\\n Output::Nft(o) => bee::Output::Nft(o.try_into()?),\\n\\n })\\n\\n }\\n\\n}\\n\\n\\n\\n#[cfg(test)]\\n\\npub(crate) mod test {\\n\\n use mongodb::bson::{from_bson, to_bson};\\n\\n\\n\\n use super::{alias, basic, foundry, nft, *};\\n\\n\\n\\n #[test]\\n\\n fn test_output_id_bson() {\\n\\n let output_id = OutputId::from(bee_test::rand::output::rand_output_id());\\n\",\n \"file_path\": \"src/types/stardust/block/output/mod.rs\",\n \"rank\": 63,\n \"score\": 96947.20948343718\n },\n {\n \"content\": \" immutable_features: value.immutable_features().iter().map(Into::into).collect(),\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\nimpl TryFrom<AliasOutput> for bee::AliasOutput {\\n\\n type Error = bee_block_stardust::Error;\\n\\n\\n\\n fn try_from(value: AliasOutput) -> Result<Self, Self::Error> {\\n\\n Self::build_with_amount(value.amount, value.alias_id.into())?\\n\\n .with_native_tokens(\\n\\n Vec::from(value.native_tokens)\\n\\n .into_iter()\\n\\n .map(TryInto::try_into)\\n\\n .collect::<Result<Vec<_>, _>>()?,\\n\\n )\\n\\n .with_state_index(value.state_index)\\n\\n .with_state_metadata(value.state_metadata.into())\\n\\n .with_foundry_counter(value.foundry_counter)\\n\\n .with_unlock_conditions(\\n\",\n \"file_path\": \"src/types/stardust/block/output/alias.rs\",\n \"rank\": 64,\n \"score\": 96946.52582661774\n },\n {\n \"content\": \" pub features: Box<[Feature]>,\\n\\n pub immutable_features: Box<[Feature]>,\\n\\n}\\n\\n\\n\\nimpl From<&bee::NftOutput> for NftOutput {\\n\\n fn from(value: &bee::NftOutput) -> Self {\\n\\n Self {\\n\\n amount: value.amount(),\\n\\n native_tokens: value.native_tokens().iter().map(Into::into).collect(),\\n\\n nft_id: (*value.nft_id()).into(),\\n\\n unlock_conditions: value.unlock_conditions().iter().map(Into::into).collect(),\\n\\n features: value.features().iter().map(Into::into).collect(),\\n\\n immutable_features: value.immutable_features().iter().map(Into::into).collect(),\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\nimpl TryFrom<NftOutput> for bee::NftOutput {\\n\\n type Error = bee_block_stardust::Error;\\n\\n\\n\",\n \"file_path\": \"src/types/stardust/block/output/nft.rs\",\n \"rank\": 65,\n \"score\": 96946.25832120834\n },\n {\n \"content\": \" type Err = bee_block_stardust::Error;\\n\\n\\n\\n fn from_str(s: &str) -> Result<Self, Self::Err> {\\n\\n Ok(bee::OutputId::from_str(s)?.into())\\n\\n }\\n\\n}\\n\\n\\n\\nimpl From<OutputId> for Bson {\\n\\n fn from(val: OutputId) -> Self {\\n\\n // Unwrap: Cannot fail as type is well defined\\n\\n mongodb::bson::to_bson(&val).unwrap()\\n\\n }\\n\\n}\\n\\n\\n\\n#[derive(Clone, Debug, PartialEq, Eq, Serialize, Deserialize)]\\n\\n#[serde(tag = \\\"kind\\\")]\\n\\npub enum Output {\\n\\n #[serde(rename = \\\"treasury\\\")]\\n\\n Treasury(TreasuryOutput),\\n\\n #[serde(rename = \\\"basic\\\")]\\n\",\n \"file_path\": \"src/types/stardust/block/output/mod.rs\",\n \"rank\": 66,\n \"score\": 96946.0531068816\n },\n {\n \"content\": \" #[test]\\n\\n fn test_alias_output_bson() {\\n\\n let output = get_test_alias_output();\\n\\n let bson = to_bson(&output).unwrap();\\n\\n assert_eq!(output, from_bson::<AliasOutput>(bson).unwrap());\\n\\n }\\n\\n\\n\\n pub(crate) fn get_test_alias_output() -> AliasOutput {\\n\\n AliasOutput::from(\\n\\n &bee::AliasOutput::build_with_amount(100, bee_test::rand::output::rand_alias_id())\\n\\n .unwrap()\\n\\n .with_native_tokens(vec![get_test_native_token().try_into().unwrap()])\\n\\n .with_state_index(0)\\n\\n .with_state_metadata(\\\"Foo\\\".as_bytes().to_vec())\\n\\n .with_foundry_counter(0)\\n\\n .with_unlock_conditions(vec![\\n\\n get_test_state_controller_address_condition(bee_test::rand::address::rand_address().into())\\n\\n .try_into()\\n\\n .unwrap(),\\n\\n get_test_governor_address_condition(bee_test::rand::address::rand_address().into())\\n\",\n \"file_path\": \"src/types/stardust/block/output/alias.rs\",\n \"rank\": 67,\n \"score\": 96945.56570078425\n },\n {\n \"content\": \" assert_eq!(output, from_bson::<Output>(bson).unwrap());\\n\\n\\n\\n let output = Output::from(&bee::Output::Treasury(bee_test::rand::output::rand_treasury_output()));\\n\\n let bson = to_bson(&output).unwrap();\\n\\n assert_eq!(output, from_bson::<Output>(bson).unwrap());\\n\\n }\\n\\n\\n\\n pub(crate) fn get_test_alias_output() -> Output {\\n\\n Output::Alias(alias::test::get_test_alias_output())\\n\\n }\\n\\n\\n\\n pub(crate) fn get_test_basic_output() -> Output {\\n\\n Output::Basic(basic::test::get_test_basic_output())\\n\\n }\\n\\n\\n\\n pub(crate) fn get_test_foundry_output() -> Output {\\n\\n Output::Foundry(foundry::test::get_test_foundry_output())\\n\\n }\\n\\n\\n\\n pub(crate) fn get_test_nft_output() -> Output {\\n\\n Output::Nft(nft::test::get_test_nft_output())\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/types/stardust/block/output/mod.rs\",\n \"rank\": 68,\n \"score\": 96945.18269741761\n },\n {\n \"content\": \" .with_features(vec![\\n\\n get_test_sender_block(bee_test::rand::address::rand_address().into())\\n\\n .try_into()\\n\\n .unwrap(),\\n\\n get_test_metadata_block().try_into().unwrap(),\\n\\n get_test_tag_block().try_into().unwrap(),\\n\\n ])\\n\\n .with_immutable_features(vec![\\n\\n get_test_issuer_block(bee_test::rand::address::rand_address().into())\\n\\n .try_into()\\n\\n .unwrap(),\\n\\n get_test_metadata_block().try_into().unwrap(),\\n\\n ])\\n\\n .finish()\\n\\n .unwrap(),\\n\\n )\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/types/stardust/block/output/nft.rs\",\n \"rank\": 69,\n \"score\": 96944.89703433243\n },\n {\n \"content\": \" .try_into()\\n\\n .unwrap(),\\n\\n ])\\n\\n .with_features(vec![\\n\\n get_test_sender_block(bee_test::rand::address::rand_address().into())\\n\\n .try_into()\\n\\n .unwrap(),\\n\\n get_test_metadata_block().try_into().unwrap(),\\n\\n ])\\n\\n .with_immutable_features(vec![\\n\\n get_test_issuer_block(bee_test::rand::address::rand_address().into())\\n\\n .try_into()\\n\\n .unwrap(),\\n\\n get_test_metadata_block().try_into().unwrap(),\\n\\n ])\\n\\n .finish()\\n\\n .unwrap(),\\n\\n )\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/types/stardust/block/output/alias.rs\",\n \"rank\": 70,\n \"score\": 96944.85466524334\n },\n {\n \"content\": \" .collect(),\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\nimpl From<&bee::Output> for Output {\\n\\n fn from(value: &bee::Output) -> Self {\\n\\n match value {\\n\\n bee::Output::Treasury(o) => Self::Treasury(o.into()),\\n\\n bee::Output::Basic(o) => Self::Basic(o.into()),\\n\\n bee::Output::Alias(o) => Self::Alias(o.into()),\\n\\n bee::Output::Foundry(o) => Self::Foundry(o.into()),\\n\\n bee::Output::Nft(o) => Self::Nft(o.into()),\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\nimpl TryFrom<Output> for bee::Output {\\n\\n type Error = bee_block_stardust::Error;\\n\\n\\n\",\n \"file_path\": \"src/types/stardust/block/output/mod.rs\",\n \"rank\": 71,\n \"score\": 96944.27512381315\n },\n {\n \"content\": \" Ok(bee::NftId::from_str(s)?.into())\\n\\n }\\n\\n}\\n\\n\\n\\nimpl From<NftId> for Bson {\\n\\n fn from(val: NftId) -> Self {\\n\\n Binary {\\n\\n subtype: BinarySubtype::Generic,\\n\\n bytes: val.0.to_vec(),\\n\\n }\\n\\n .into()\\n\\n }\\n\\n}\\n\\n\\n\\n#[derive(Clone, Debug, PartialEq, Eq, Serialize, Deserialize)]\\n\\npub struct NftOutput {\\n\\n pub amount: OutputAmount,\\n\\n pub native_tokens: Box<[NativeToken]>,\\n\\n pub nft_id: NftId,\\n\\n pub unlock_conditions: Box<[UnlockCondition]>,\\n\",\n \"file_path\": \"src/types/stardust/block/output/nft.rs\",\n \"rank\": 72,\n \"score\": 96944.1701970994\n },\n {\n \"content\": \" Ok(bee::AliasId::from_str(s)?.into())\\n\\n }\\n\\n}\\n\\n\\n\\nimpl From<AliasId> for Bson {\\n\\n fn from(val: AliasId) -> Self {\\n\\n Binary {\\n\\n subtype: BinarySubtype::Generic,\\n\\n bytes: val.0.to_vec(),\\n\\n }\\n\\n .into()\\n\\n }\\n\\n}\\n\\n\\n\\n#[derive(Clone, Debug, PartialEq, Eq, Serialize, Deserialize)]\\n\\npub struct AliasOutput {\\n\\n #[serde(with = \\\"crate::types::util::stringify\\\")]\\n\\n pub amount: OutputAmount,\\n\\n pub native_tokens: Box<[NativeToken]>,\\n\\n pub alias_id: AliasId,\\n\",\n \"file_path\": \"src/types/stardust/block/output/alias.rs\",\n \"rank\": 73,\n \"score\": 96944.0625751737\n },\n {\n \"content\": \" Basic(BasicOutput),\\n\\n #[serde(rename = \\\"alias\\\")]\\n\\n Alias(AliasOutput),\\n\\n #[serde(rename = \\\"foundry\\\")]\\n\\n Foundry(FoundryOutput),\\n\\n #[serde(rename = \\\"nft\\\")]\\n\\n Nft(NftOutput),\\n\\n}\\n\\n\\n\\nimpl Output {\\n\\n pub fn owning_addresses(&self) -> Vec<Address> {\\n\\n match self {\\n\\n Self::Treasury(_) => Vec::new(),\\n\\n Self::Basic(BasicOutput { unlock_conditions, .. })\\n\\n | Self::Alias(AliasOutput { unlock_conditions, .. })\\n\\n | Self::Nft(NftOutput { unlock_conditions, .. })\\n\\n | Self::Foundry(FoundryOutput { unlock_conditions, .. }) => unlock_conditions\\n\\n .iter()\\n\\n .filter_map(UnlockCondition::owning_address)\\n\\n .cloned()\\n\",\n \"file_path\": \"src/types/stardust/block/output/mod.rs\",\n \"rank\": 74,\n \"score\": 96943.5370137277\n },\n {\n \"content\": \" get_test_timelock_condition,\\n\\n },\\n\\n };\\n\\n\\n\\n #[test]\\n\\n fn test_nft_id_bson() {\\n\\n let nft_id = NftId::from(rand_nft_id());\\n\\n let bson = to_bson(&nft_id).unwrap();\\n\\n assert_eq!(Bson::from(nft_id), bson);\\n\\n assert_eq!(nft_id, from_bson::<NftId>(bson).unwrap());\\n\\n }\\n\\n\\n\\n #[test]\\n\\n fn test_nft_output_bson() {\\n\\n let output = get_test_nft_output();\\n\\n let bson = to_bson(&output).unwrap();\\n\\n assert_eq!(output, from_bson::<NftOutput>(bson).unwrap());\\n\\n }\\n\\n\\n\\n pub(crate) fn rand_nft_id() -> bee::NftId {\\n\",\n \"file_path\": \"src/types/stardust/block/output/nft.rs\",\n \"rank\": 75,\n \"score\": 96943.29631065803\n },\n {\n \"content\": \" #[serde(rename = \\\"tag\\\")]\\n\\n Tag {\\n\\n #[serde(with = \\\"serde_bytes\\\")]\\n\\n data: Box<[u8]>,\\n\\n },\\n\\n}\\n\\n\\n\\nimpl From<&bee::Feature> for Feature {\\n\\n fn from(value: &bee::Feature) -> Self {\\n\\n match value {\\n\\n bee::Feature::Sender(a) => Self::Sender {\\n\\n address: (*a.address()).into(),\\n\\n },\\n\\n bee::Feature::Issuer(a) => Self::Issuer {\\n\\n address: (*a.address()).into(),\\n\\n },\\n\\n bee::Feature::Metadata(b) => Self::Metadata {\\n\\n data: b.data().to_vec().into_boxed_slice(),\\n\\n },\\n\\n bee::Feature::Tag(b) => Self::Tag {\\n\",\n \"file_path\": \"src/types/stardust/block/output/feature.rs\",\n \"rank\": 76,\n \"score\": 96943.23703248106\n },\n {\n \"content\": \" Vec::from(value.unlock_conditions)\\n\\n .into_iter()\\n\\n .map(TryInto::try_into)\\n\\n .collect::<Result<Vec<_>, _>>()?,\\n\\n )\\n\\n .with_features(\\n\\n Vec::from(value.features)\\n\\n .into_iter()\\n\\n .map(TryInto::try_into)\\n\\n .collect::<Result<Vec<_>, _>>()?,\\n\\n )\\n\\n .finish()\\n\\n }\\n\\n}\\n\\n\\n\\n#[cfg(test)]\\n\\npub(crate) mod test {\\n\\n use mongodb::bson::{from_bson, to_bson};\\n\\n\\n\\n use super::*;\\n\",\n \"file_path\": \"src/types/stardust/block/output/basic.rs\",\n \"rank\": 77,\n \"score\": 96943.19217474507\n },\n {\n \"content\": \"\\n\\nimpl From<&bee::FoundryOutput> for FoundryOutput {\\n\\n fn from(value: &bee::FoundryOutput) -> Self {\\n\\n Self {\\n\\n amount: value.amount(),\\n\\n native_tokens: value.native_tokens().iter().map(Into::into).collect(),\\n\\n serial_number: value.serial_number(),\\n\\n token_scheme: value.token_scheme().into(),\\n\\n unlock_conditions: value.unlock_conditions().iter().map(Into::into).collect(),\\n\\n features: value.features().iter().map(Into::into).collect(),\\n\\n immutable_features: value.immutable_features().iter().map(Into::into).collect(),\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\nimpl TryFrom<FoundryOutput> for bee::FoundryOutput {\\n\\n type Error = bee_block_stardust::Error;\\n\\n\\n\\n fn try_from(value: FoundryOutput) -> Result<Self, Self::Error> {\\n\\n Self::build_with_amount(value.amount, value.serial_number, value.token_scheme.try_into()?)?\\n\",\n \"file_path\": \"src/types/stardust/block/output/foundry.rs\",\n \"rank\": 78,\n \"score\": 96943.10331984657\n },\n {\n \"content\": \" amount: value.amount(),\\n\\n native_tokens: value.native_tokens().iter().map(Into::into).collect(),\\n\\n unlock_conditions: value.unlock_conditions().iter().map(Into::into).collect(),\\n\\n features: value.features().iter().map(Into::into).collect(),\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\nimpl TryFrom<BasicOutput> for bee::BasicOutput {\\n\\n type Error = bee_block_stardust::Error;\\n\\n\\n\\n fn try_from(value: BasicOutput) -> Result<Self, Self::Error> {\\n\\n Self::build_with_amount(value.amount)?\\n\\n .with_native_tokens(\\n\\n Vec::from(value.native_tokens)\\n\\n .into_iter()\\n\\n .map(TryInto::try_into)\\n\\n .collect::<Result<Vec<_>, _>>()?,\\n\\n )\\n\\n .with_unlock_conditions(\\n\",\n \"file_path\": \"src/types/stardust/block/output/basic.rs\",\n \"rank\": 79,\n \"score\": 96942.95324415744\n },\n {\n \"content\": \" data: b.tag().to_vec().into_boxed_slice(),\\n\\n },\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\nimpl TryFrom<Feature> for bee::Feature {\\n\\n type Error = bee_block_stardust::Error;\\n\\n\\n\\n fn try_from(value: Feature) -> Result<Self, Self::Error> {\\n\\n Ok(match value {\\n\\n Feature::Sender { address } => bee::Feature::Sender(bee::SenderFeature::new(address.into())),\\n\\n Feature::Issuer { address } => bee::Feature::Issuer(bee::IssuerFeature::new(address.into())),\\n\\n Feature::Metadata { data } => bee::Feature::Metadata(bee::MetadataFeature::new(data.into())?),\\n\\n Feature::Tag { data } => bee::Feature::Tag(bee::TagFeature::new(data.into())?),\\n\\n })\\n\\n }\\n\\n}\\n\\n\\n\\n#[cfg(test)]\\n\",\n \"file_path\": \"src/types/stardust/block/output/feature.rs\",\n \"rank\": 80,\n \"score\": 96942.8785826638\n },\n {\n \"content\": \" bee_test::rand::bytes::rand_bytes_array().into()\\n\\n }\\n\\n\\n\\n pub(crate) fn get_test_nft_output() -> NftOutput {\\n\\n NftOutput::from(\\n\\n &bee::NftOutput::build_with_amount(100, rand_nft_id())\\n\\n .unwrap()\\n\\n .with_native_tokens(vec![get_test_native_token().try_into().unwrap()])\\n\\n .with_unlock_conditions(vec![\\n\\n get_test_address_condition(bee_test::rand::address::rand_address().into())\\n\\n .try_into()\\n\\n .unwrap(),\\n\\n get_test_storage_deposit_return_condition(bee_test::rand::address::rand_address().into(), 1)\\n\\n .try_into()\\n\\n .unwrap(),\\n\\n get_test_timelock_condition(1, 1).try_into().unwrap(),\\n\\n get_test_expiration_condition(bee_test::rand::address::rand_address().into(), 1, 1)\\n\\n .try_into()\\n\\n .unwrap(),\\n\\n ])\\n\",\n \"file_path\": \"src/types/stardust/block/output/nft.rs\",\n \"rank\": 81,\n \"score\": 96942.70116867073\n },\n {\n \"content\": \" .with_native_tokens(vec![get_test_native_token().try_into().unwrap()])\\n\\n .with_unlock_conditions(vec![\\n\\n get_test_address_condition(bee_test::rand::address::rand_address().into())\\n\\n .try_into()\\n\\n .unwrap(),\\n\\n get_test_storage_deposit_return_condition(bee_test::rand::address::rand_address().into(), 1)\\n\\n .try_into()\\n\\n .unwrap(),\\n\\n get_test_timelock_condition(1, 1).try_into().unwrap(),\\n\\n get_test_expiration_condition(bee_test::rand::address::rand_address().into(), 1, 1)\\n\\n .try_into()\\n\\n .unwrap(),\\n\\n ])\\n\\n .with_features(vec![\\n\\n get_test_sender_block(bee_test::rand::address::rand_address().into())\\n\\n .try_into()\\n\\n .unwrap(),\\n\\n get_test_metadata_block().try_into().unwrap(),\\n\\n get_test_tag_block().try_into().unwrap(),\\n\\n ])\\n\\n .finish()\\n\\n .unwrap(),\\n\\n )\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/types/stardust/block/output/basic.rs\",\n \"rank\": 82,\n \"score\": 96942.63786981377\n },\n {\n \"content\": \" Ok(bee::NftId::from(bee::OutputId::from_str(s)?).into())\\n\\n }\\n\\n}\\n\\n\\n\\nimpl From<bee::NftId> for NftId {\\n\\n fn from(value: bee::NftId) -> Self {\\n\\n Self(*value)\\n\\n }\\n\\n}\\n\\n\\n\\nimpl From<NftId> for bee::NftId {\\n\\n fn from(value: NftId) -> Self {\\n\\n bee::NftId::new(value.0)\\n\\n }\\n\\n}\\n\\n\\n\\nimpl FromStr for NftId {\\n\\n type Err = bee_block_stardust::Error;\\n\\n\\n\\n fn from_str(s: &str) -> Result<Self, Self::Err> {\\n\",\n \"file_path\": \"src/types/stardust/block/output/nft.rs\",\n \"rank\": 83,\n \"score\": 96941.9556016348\n },\n {\n \"content\": \" Ok(bee::AliasId::from(bee::OutputId::from_str(s)?).into())\\n\\n }\\n\\n}\\n\\n\\n\\nimpl From<bee::AliasId> for AliasId {\\n\\n fn from(value: bee::AliasId) -> Self {\\n\\n Self(*value)\\n\\n }\\n\\n}\\n\\n\\n\\nimpl From<AliasId> for bee::AliasId {\\n\\n fn from(value: AliasId) -> Self {\\n\\n bee::AliasId::new(value.0)\\n\\n }\\n\\n}\\n\\n\\n\\nimpl FromStr for AliasId {\\n\\n type Err = bee_block_stardust::Error;\\n\\n\\n\\n fn from_str(s: &str) -> Result<Self, Self::Err> {\\n\",\n \"file_path\": \"src/types/stardust/block/output/alias.rs\",\n \"rank\": 84,\n \"score\": 96941.9556016348\n },\n {\n \"content\": \" let bson = to_bson(&output_id).unwrap();\\n\\n from_bson::<OutputId>(bson).unwrap();\\n\\n }\\n\\n\\n\\n #[test]\\n\\n fn test_output_bson() {\\n\\n let output = get_test_alias_output();\\n\\n let bson = to_bson(&output).unwrap();\\n\\n assert_eq!(output, from_bson::<Output>(bson).unwrap());\\n\\n\\n\\n let output = get_test_basic_output();\\n\\n let bson = to_bson(&output).unwrap();\\n\\n assert_eq!(output, from_bson::<Output>(bson).unwrap());\\n\\n\\n\\n let output = get_test_foundry_output();\\n\\n let bson = to_bson(&output).unwrap();\\n\\n assert_eq!(output, from_bson::<Output>(bson).unwrap());\\n\\n\\n\\n let output = get_test_nft_output();\\n\\n let bson = to_bson(&output).unwrap();\\n\",\n \"file_path\": \"src/types/stardust/block/output/mod.rs\",\n \"rank\": 85,\n \"score\": 96941.62670454649\n },\n {\n \"content\": \" fn try_from(value: NftOutput) -> Result<Self, Self::Error> {\\n\\n Self::build_with_amount(value.amount, value.nft_id.into())?\\n\\n .with_native_tokens(\\n\\n Vec::from(value.native_tokens)\\n\\n .into_iter()\\n\\n .map(TryInto::try_into)\\n\\n .collect::<Result<Vec<_>, _>>()?,\\n\\n )\\n\\n .with_unlock_conditions(\\n\\n Vec::from(value.unlock_conditions)\\n\\n .into_iter()\\n\\n .map(TryInto::try_into)\\n\\n .collect::<Result<Vec<_>, _>>()?,\\n\\n )\\n\\n .with_features(\\n\\n Vec::from(value.features)\\n\\n .into_iter()\\n\\n .map(TryInto::try_into)\\n\\n .collect::<Result<Vec<_>, _>>()?,\\n\\n )\\n\",\n \"file_path\": \"src/types/stardust/block/output/nft.rs\",\n \"rank\": 86,\n \"score\": 96939.28747071976\n },\n {\n \"content\": \" Vec::from(value.unlock_conditions)\\n\\n .into_iter()\\n\\n .map(TryInto::try_into)\\n\\n .collect::<Result<Vec<_>, _>>()?,\\n\\n )\\n\\n .with_features(\\n\\n Vec::from(value.features)\\n\\n .into_iter()\\n\\n .map(TryInto::try_into)\\n\\n .collect::<Result<Vec<_>, _>>()?,\\n\\n )\\n\\n .with_immutable_features(\\n\\n Vec::from(value.immutable_features)\\n\\n .into_iter()\\n\\n .map(TryInto::try_into)\\n\\n .collect::<Result<Vec<_>, _>>()?,\\n\\n )\\n\\n .finish()\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/types/stardust/block/output/alias.rs\",\n \"rank\": 87,\n \"score\": 96936.45805687236\n },\n {\n \"content\": \" .with_native_tokens(\\n\\n Vec::from(value.native_tokens)\\n\\n .into_iter()\\n\\n .map(TryInto::try_into)\\n\\n .collect::<Result<Vec<_>, _>>()?,\\n\\n )\\n\\n .with_unlock_conditions(\\n\\n Vec::from(value.unlock_conditions)\\n\\n .into_iter()\\n\\n .map(TryInto::try_into)\\n\\n .collect::<Result<Vec<_>, _>>()?,\\n\\n )\\n\\n .with_features(\\n\\n Vec::from(value.features)\\n\\n .into_iter()\\n\\n .map(TryInto::try_into)\\n\\n .collect::<Result<Vec<_>, _>>()?,\\n\\n )\\n\\n .with_immutable_features(\\n\\n Vec::from(value.immutable_features)\\n\",\n \"file_path\": \"src/types/stardust/block/output/foundry.rs\",\n \"rank\": 88,\n \"score\": 96936.45805687236\n },\n {\n \"content\": \"// Copyright 2022 IOTA Stiftung\\n\\n// SPDX-License-Identifier: Apache-2.0\\n\\n\\n\\nuse bee_block_stardust::payload::tagged_data as bee;\\n\\nuse serde::{Deserialize, Serialize};\\n\\n\\n\\n#[derive(Clone, Debug, PartialEq, Eq, Serialize, Deserialize)]\\n\\npub struct TaggedDataPayload {\\n\\n #[serde(with = \\\"serde_bytes\\\")]\\n\\n tag: Box<[u8]>,\\n\\n #[serde(with = \\\"serde_bytes\\\")]\\n\\n data: Box<[u8]>,\\n\\n}\\n\\n\\n\\nimpl From<&bee::TaggedDataPayload> for TaggedDataPayload {\\n\\n fn from(value: &bee::TaggedDataPayload) -> Self {\\n\\n Self {\\n\\n tag: value.tag().to_vec().into_boxed_slice(),\\n\\n data: value.data().to_vec().into_boxed_slice(),\\n\\n }\\n\",\n \"file_path\": \"src/types/stardust/block/payload/tagged_data.rs\",\n \"rank\": 89,\n \"score\": 95367.92426279467\n },\n {\n \"content\": \" }\\n\\n}\\n\\n\\n\\nimpl TryFrom<TaggedDataPayload> for bee::TaggedDataPayload {\\n\\n type Error = bee_block_stardust::Error;\\n\\n\\n\\n fn try_from(value: TaggedDataPayload) -> Result<Self, Self::Error> {\\n\\n bee::TaggedDataPayload::new(value.tag.into(), value.data.into())\\n\\n }\\n\\n}\\n\\n\\n\\n#[cfg(test)]\\n\\npub(crate) mod test {\\n\\n use mongodb::bson::{from_bson, to_bson};\\n\\n\\n\\n use super::*;\\n\\n\\n\\n #[test]\\n\\n fn test_tagged_data_payload_bson() {\\n\\n let payload = get_test_tagged_data_payload();\\n\\n let bson = to_bson(&payload).unwrap();\\n\\n assert_eq!(payload, from_bson::<TaggedDataPayload>(bson).unwrap());\\n\\n }\\n\\n\\n\\n pub(crate) fn get_test_tagged_data_payload() -> TaggedDataPayload {\\n\\n (&bee_test::rand::payload::rand_tagged_data_payload()).into()\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/types/stardust/block/payload/tagged_data.rs\",\n \"rank\": 90,\n \"score\": 95365.14509572591\n },\n {\n \"content\": \"// Copyright 2022 IOTA Stiftung\\n\\n// SPDX-License-Identifier: Apache-2.0\\n\\n\\n\\nuse std::{mem::size_of, str::FromStr};\\n\\n\\n\\nuse bee_block_stardust::output as bee;\\n\\nuse primitive_types::U256;\\n\\nuse serde::{Deserialize, Serialize};\\n\\n\\n\\nuse crate::types::util::bytify;\\n\\n\\n\\n#[derive(Copy, Clone, Debug, PartialEq, Eq, Serialize, Deserialize)]\\n\\n#[serde(transparent)]\\n\\npub struct TokenAmount(#[serde(with = \\\"bytify\\\")] pub [u8; size_of::<U256>()]);\\n\\n\\n\\nimpl From<&U256> for TokenAmount {\\n\\n fn from(value: &U256) -> Self {\\n\\n let mut amount = [0; size_of::<U256>()];\\n\\n value.to_little_endian(&mut amount);\\n\\n Self(amount)\\n\",\n \"file_path\": \"src/types/stardust/block/output/native_token.rs\",\n \"rank\": 91,\n \"score\": 94599.92909212483\n },\n {\n \"content\": \" use bee_block_stardust::address::{Address as BeeAddress, AliasAddress as BeeAliasAddress};\\n\\n BeeAddress::from(BeeAliasAddress::new(bee_test::rand::output::rand_alias_id())).into()\\n\\n }\\n\\n\\n\\n pub(crate) fn get_test_address_condition(address: Address) -> UnlockCondition {\\n\\n UnlockCondition::Address { address }\\n\\n }\\n\\n\\n\\n pub(crate) fn get_test_storage_deposit_return_condition(return_address: Address, amount: u64) -> UnlockCondition {\\n\\n UnlockCondition::StorageDepositReturn { return_address, amount }\\n\\n }\\n\\n\\n\\n pub(crate) fn get_test_timelock_condition(milestone_index: u32, timestamp: u32) -> UnlockCondition {\\n\\n UnlockCondition::Timelock {\\n\\n milestone_index,\\n\\n timestamp,\\n\\n }\\n\\n }\\n\\n\\n\\n pub(crate) fn get_test_expiration_condition(\\n\",\n \"file_path\": \"src/types/stardust/block/output/unlock_condition.rs\",\n \"rank\": 92,\n \"score\": 94595.90272536942\n },\n {\n \"content\": \"// Copyright 2022 IOTA Stiftung\\n\\n// SPDX-License-Identifier: Apache-2.0\\n\\n\\n\\nuse bee_block_stardust::output::unlock_condition as bee;\\n\\nuse serde::{Deserialize, Serialize};\\n\\n\\n\\nuse crate::types::stardust::block::Address;\\n\\n\\n\\n#[derive(Copy, Clone, Debug, PartialEq, Eq, Serialize, Deserialize)]\\n\\n#[serde(tag = \\\"kind\\\")]\\n\\npub enum UnlockCondition {\\n\\n #[serde(rename = \\\"address\\\")]\\n\\n Address { address: Address },\\n\\n #[serde(rename = \\\"storage_deposit_return\\\")]\\n\\n StorageDepositReturn {\\n\\n return_address: Address,\\n\\n #[serde(with = \\\"crate::types::util::stringify\\\")]\\n\\n amount: u64,\\n\\n },\\n\\n #[serde(rename = \\\"timelock\\\")]\\n\",\n \"file_path\": \"src/types/stardust/block/output/unlock_condition.rs\",\n \"rank\": 93,\n \"score\": 94594.56032074922\n },\n {\n \"content\": \"}\\n\\n\\n\\n#[cfg(test)]\\n\\npub(crate) mod test {\\n\\n use mongodb::bson::{from_bson, to_bson};\\n\\n\\n\\n use super::*;\\n\\n\\n\\n #[test]\\n\\n fn test_unlock_condition_bson() {\\n\\n let block = get_test_address_condition(bee_test::rand::address::rand_address().into());\\n\\n let bson = to_bson(&block).unwrap();\\n\\n assert_eq!(block, from_bson::<UnlockCondition>(bson).unwrap());\\n\\n\\n\\n let block = get_test_storage_deposit_return_condition(bee_test::rand::address::rand_address().into(), 1);\\n\\n let bson = to_bson(&block).unwrap();\\n\\n assert_eq!(block, from_bson::<UnlockCondition>(bson).unwrap());\\n\\n\\n\\n let block = get_test_timelock_condition(1, 1);\\n\\n let bson = to_bson(&block).unwrap();\\n\",\n \"file_path\": \"src/types/stardust/block/output/unlock_condition.rs\",\n \"rank\": 94,\n \"score\": 94592.40729019284\n },\n {\n \"content\": \" return_address: Address,\\n\\n milestone_index: u32,\\n\\n timestamp: u32,\\n\\n ) -> UnlockCondition {\\n\\n UnlockCondition::Expiration {\\n\\n return_address,\\n\\n milestone_index,\\n\\n timestamp,\\n\\n }\\n\\n }\\n\\n\\n\\n pub(crate) fn get_test_state_controller_address_condition(address: Address) -> UnlockCondition {\\n\\n UnlockCondition::StateControllerAddress { address }\\n\\n }\\n\\n\\n\\n pub(crate) fn get_test_governor_address_condition(address: Address) -> UnlockCondition {\\n\\n UnlockCondition::GovernorAddress { address }\\n\\n }\\n\\n\\n\\n pub(crate) fn get_test_immut_alias_address_condition(address: Address) -> UnlockCondition {\\n\\n UnlockCondition::ImmutableAliasAddress { address }\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/types/stardust/block/output/unlock_condition.rs\",\n \"rank\": 95,\n \"score\": 94589.32492546269\n },\n {\n \"content\": \" assert_eq!(block, from_bson::<UnlockCondition>(bson).unwrap());\\n\\n\\n\\n let block = get_test_expiration_condition(bee_test::rand::address::rand_address().into(), 1, 1);\\n\\n let bson = to_bson(&block).unwrap();\\n\\n assert_eq!(block, from_bson::<UnlockCondition>(bson).unwrap());\\n\\n\\n\\n let block = get_test_state_controller_address_condition(bee_test::rand::address::rand_address().into());\\n\\n let bson = to_bson(&block).unwrap();\\n\\n assert_eq!(block, from_bson::<UnlockCondition>(bson).unwrap());\\n\\n\\n\\n let block = get_test_governor_address_condition(bee_test::rand::address::rand_address().into());\\n\\n let bson = to_bson(&block).unwrap();\\n\\n assert_eq!(block, from_bson::<UnlockCondition>(bson).unwrap());\\n\\n\\n\\n let block = get_test_immut_alias_address_condition(get_test_alias_address_as_address());\\n\\n let bson = to_bson(&block).unwrap();\\n\\n assert_eq!(block, from_bson::<UnlockCondition>(bson).unwrap());\\n\\n }\\n\\n\\n\\n pub(crate) fn get_test_alias_address_as_address() -> Address {\\n\",\n \"file_path\": \"src/types/stardust/block/output/unlock_condition.rs\",\n \"rank\": 96,\n \"score\": 94588.82453945692\n },\n {\n \"content\": \" }\\n\\n}\\n\\n\\n\\nimpl From<TokenAmount> for U256 {\\n\\n fn from(value: TokenAmount) -> Self {\\n\\n U256::from_little_endian(&value.0)\\n\\n }\\n\\n}\\n\\n\\n\\n#[derive(Clone, Debug, PartialEq, Eq, Serialize, Deserialize)]\\n\\n#[serde(transparent)]\\n\\npub struct TokenId(#[serde(with = \\\"bytify\\\")] pub [u8; Self::LENGTH]);\\n\\n\\n\\nimpl TokenId {\\n\\n const LENGTH: usize = bee::TokenId::LENGTH;\\n\\n}\\n\\n\\n\\nimpl From<bee::TokenId> for TokenId {\\n\\n fn from(value: bee::TokenId) -> Self {\\n\\n Self(*value)\\n\",\n \"file_path\": \"src/types/stardust/block/output/native_token.rs\",\n \"rank\": 97,\n \"score\": 94588.50032707203\n },\n {\n \"content\": \"\\n\\nimpl TryFrom<UnlockCondition> for bee::UnlockCondition {\\n\\n type Error = bee_block_stardust::Error;\\n\\n\\n\\n fn try_from(value: UnlockCondition) -> Result<Self, Self::Error> {\\n\\n Ok(match value {\\n\\n UnlockCondition::Address { address } => Self::Address(bee::AddressUnlockCondition::new(address.into())),\\n\\n UnlockCondition::StorageDepositReturn { return_address, amount } => Self::StorageDepositReturn(\\n\\n bee::StorageDepositReturnUnlockCondition::new(return_address.into(), amount)?,\\n\\n ),\\n\\n UnlockCondition::Timelock {\\n\\n milestone_index,\\n\\n timestamp,\\n\\n } => Self::Timelock(bee::TimelockUnlockCondition::new(milestone_index.into(), timestamp)?),\\n\\n UnlockCondition::Expiration {\\n\\n return_address,\\n\\n milestone_index,\\n\\n timestamp,\\n\\n } => Self::Expiration(bee::ExpirationUnlockCondition::new(\\n\\n return_address.into(),\\n\",\n \"file_path\": \"src/types/stardust/block/output/unlock_condition.rs\",\n \"rank\": 98,\n \"score\": 94588.34700746072\n },\n {\n \"content\": \" milestone_index.into(),\\n\\n timestamp,\\n\\n )?),\\n\\n UnlockCondition::StateControllerAddress { address } => {\\n\\n Self::StateControllerAddress(bee::StateControllerAddressUnlockCondition::new(address.into()))\\n\\n }\\n\\n UnlockCondition::GovernorAddress { address } => {\\n\\n Self::GovernorAddress(bee::GovernorAddressUnlockCondition::new(address.into()))\\n\\n }\\n\\n UnlockCondition::ImmutableAliasAddress { address } => {\\n\\n let bee_address = bee_block_stardust::address::Address::from(address);\\n\\n\\n\\n if let bee_block_stardust::address::Address::Alias(alias_address) = bee_address {\\n\\n Self::ImmutableAliasAddress(bee::ImmutableAliasAddressUnlockCondition::new(alias_address))\\n\\n } else {\\n\\n Err(bee_block_stardust::Error::InvalidAddressKind(bee_address.kind()))?\\n\\n }\\n\\n }\\n\\n })\\n\\n }\\n\",\n \"file_path\": \"src/types/stardust/block/output/unlock_condition.rs\",\n \"rank\": 99,\n \"score\": 94588.31842809706\n }\n]","isConversational":false}}},{"rowIdx":2390,"cells":{"lang":{"kind":"string","value":"Rust"},"file_path":{"kind":"string","value":"src/asm/aarch64/cdef.rs"},"repo_name":{"kind":"string","value":"EwoutH/rav1e"},"commit":{"kind":"string","value":"39f35d0c94a0523bc6c26042bb54f7dca28efb37"},"file_code":{"kind":"string","value":"\n\nuse crate::cdef::*;\nuse crate::cpu_features::CpuFeatureLevel;\nuse crate::frame::*;\nuse crate::tiling::PlaneRegionMut;\nuse crate::util::*;\n\ntype CdefPaddingFn = unsafe extern fn(\n tmp: *mut u16,\n src: *const u8,\n src_stride: isize,\n left: *const [u8; 2],\n top: *const u8,\n h: i32,\n edges: isize,\n);\n\ntype CdefPaddingHBDFn = unsafe extern fn(\n tmp: *mut u16,\n src: *const u16,\n src_stride: isize,\n left: *const [u16; 2],\n top: *const u16,\n h: i32,\n edges: isize,\n);\n\ntype CdefFilterFn = unsafe extern fn(\n dst: *mut u8,\n dst_stride: isize,\n tmp: *const u16,\n pri_strength: i32,\n sec_strength: i32,\n dir: i32,\n damping: i32,\n h: i32,\n edges: isize,\n);\n\ntype CdefFilterHBDFn = unsafe extern fn(\n dst: *mut u16,\n dst_stride: isize,\n tmp: *const u16,\n pri_strength: i32,\n sec_strength: i32,\n dir: i32,\n damping: i32,\n h: i32,\n edges: isize,\n bitdepth_max: i32,\n);\n\n#[inline(always)]\nconst fn decimate_index(xdec: usize, ydec: usize) -> usize {\n ((ydec << 1) | xdec) & 3\n}\n\npub(crate) unsafe fn cdef_filter_block<T: Pixel>(\n dst: &mut PlaneRegionMut<'_, T>, src: *const T, src_stride: isize,\n pri_strength: i32, sec_strength: i32, dir: usize, damping: i32,\n bit_depth: usize, xdec: usize, ydec: usize, edges: u8, cpu: CpuFeatureLevel,\n) {\n let call_rust = |dst: &mut PlaneRegionMut<T>| {\n rust::cdef_filter_block(\n dst,\n src,\n src_stride,\n pri_strength,\n sec_strength,\n dir,\n damping,\n bit_depth,\n xdec,\n ydec,\n edges,\n cpu,\n );\n };\n\n #[cfg(feature = \"check_asm\")]\n let ref_dst = {\n let mut copy = dst.scratch_copy();\n call_rust(&mut copy.as_region_mut());\n copy\n };\n match T::type_enum() {\n PixelType::U8 => {\n match (\n CDEF_PAD_FNS[cpu.as_index()][decimate_index(xdec, ydec)],\n CDEF_FILTER_FNS[cpu.as_index()][decimate_index(xdec, ydec)],\n ) {\n (Some(pad), Some(func)) => {\n let h = if ydec == 1 { 4 } else { 8 } as i32;\n let tmpstride = if xdec == 1 { 8 } else { 16 } as isize;\n const MAXTMPSTRIDE: isize = 16;\n const TMPSIZE: usize = (12 * MAXTMPSTRIDE + 8) as usize;\n let mut tmp: Aligned<[u16; TMPSIZE]> =\n Aligned::new([CDEF_VERY_LARGE; TMPSIZE]);\n let top = src.offset(-2 * src_stride);\n let mut left: Aligned<[[u8; 2]; 8]> = Aligned::new([[0; 2]; 8]);\n\n \n \n \n \n if edges & CDEF_HAVE_LEFT != 0 {\n let mut wptr = src.offset(-2) as *const u8;\n for i in 0..h {\n left.data[i as usize][0] = *wptr;\n left.data[i as usize][1] = *wptr.add(1);\n wptr = wptr.offset(src_stride);\n }\n }\n\n \n \n \n \n \n \n \n \n (pad)(\n tmp.data.as_mut_ptr().offset(2 * tmpstride + 8) as *mut u16,\n src as *const u8,\n T::to_asm_stride(src_stride as usize),\n left.data.as_ptr() as *const [u8; 2],\n top as *const u8,\n 8 >> ydec,\n edges.into(),\n );\n\n (func)(\n dst.data_ptr_mut() as *mut u8,\n T::to_asm_stride(dst.plane_cfg.stride),\n tmp.data.as_ptr().offset(2 * tmpstride + 8) as *const u16,\n pri_strength,\n sec_strength,\n dir as i32,\n damping,\n 8 >> ydec,\n edges.into(),\n );\n }\n _ => call_rust(dst),\n }\n }\n PixelType::U16 => {\n match (\n CDEF_PAD_HBD_FNS[cpu.as_index()][decimate_index(xdec, ydec)],\n CDEF_FILTER_HBD_FNS[cpu.as_index()][decimate_index(xdec, ydec)],\n ) {\n \n \n \n \n (Some(pad), Some(func)) => {\n let h = if ydec == 1 { 4 } else { 8 } as i32;\n let tmpstride = if xdec == 1 { 8 } else { 16 } as isize;\n const MAXTMPSTRIDE: isize = 16;\n const TMPSIZE: usize = (12 * MAXTMPSTRIDE + 8) as usize;\n let mut tmp: Aligned<[u16; TMPSIZE]> =\n Aligned::new([CDEF_VERY_LARGE; TMPSIZE]);\n let top = src.offset(-2 * src_stride);\n let mut left: Aligned<[[u16; 2]; 8]> = Aligned::new([[0; 2]; 8]);\n\n if edges & CDEF_HAVE_LEFT != 0 {\n let mut wptr = src.offset(-2) as *const u16;\n for i in 0..h {\n left.data[i as usize][0] = *wptr;\n left.data[i as usize][1] = *wptr.add(1);\n wptr = wptr.offset(src_stride);\n }\n }\n\n (pad)(\n tmp.data.as_mut_ptr().offset(2 * tmpstride + 8) as *mut u16,\n src as *const u16,\n T::to_asm_stride(src_stride as usize),\n left.data.as_ptr() as *const [u16; 2],\n top as *const u16,\n 8 >> ydec,\n edges.into(),\n );\n\n (func)(\n dst.data_ptr_mut() as *mut u16,\n T::to_asm_stride(dst.plane_cfg.stride),\n tmp.data.as_ptr().offset(2 * tmpstride + 8) as *const u16,\n pri_strength,\n sec_strength,\n dir as i32,\n damping,\n 8 >> ydec,\n edges.into(),\n (1 << bit_depth) - 1,\n );\n }\n _ => call_rust(dst),\n }\n }\n }\n #[cfg(feature = \"check_asm\")]\n {\n for (dst_row, ref_row) in\n dst.rows_iter().zip(ref_dst.as_region().rows_iter())\n {\n for (dst, reference) in dst_row.iter().zip(ref_row) {\n assert_eq!(*dst, *reference);\n }\n }\n }\n}\n\nextern {\n fn rav1e_cdef_filter4_8bpc_neon(\n dst: *mut u8, dst_stride: isize, tmp: *const u16, pri_strength: i32,\n sec_strength: i32, dir: i32, damping: i32, h: i32, edges: isize,\n );\n\n fn rav1e_cdef_padding4_8bpc_neon(\n tmp: *mut u16, src: *const u8, src_stride: isize, left: *const [u8; 2],\n top: *const u8, h: i32, edges: isize,\n );\n\n fn rav1e_cdef_filter8_8bpc_neon(\n dst: *mut u8, dst_stride: isize, tmp: *const u16, pri_strength: i32,\n sec_strength: i32, dir: i32, damping: i32, h: i32, edges: isize,\n );\n\n fn rav1e_cdef_padding8_8bpc_neon(\n tmp: *mut u16, src: *const u8, src_stride: isize, left: *const [u8; 2],\n top: *const u8, h: i32, edges: isize,\n );\n\n fn rav1e_cdef_filter4_16bpc_neon(\n dst: *mut u16, dst_stride: isize, tmp: *const u16, pri_strength: i32,\n sec_strength: i32, dir: i32, damping: i32, h: i32, edges: isize, bd: i32,\n );\n\n fn rav1e_cdef_padding4_16bpc_neon(\n tmp: *mut u16, src: *const u16, src_stride: isize, left: *const [u16; 2],\n top: *const u16, h: i32, edges: isize,\n );\n\n fn rav1e_cdef_filter8_16bpc_neon(\n dst: *mut u16, dst_stride: isize, tmp: *const u16, pri_strength: i32,\n sec_strength: i32, dir: i32, damping: i32, h: i32, edges: isize, bd: i32,\n );\n\n fn rav1e_cdef_padding8_16bpc_neon(\n tmp: *mut u16, src: *const u16, src_stride: isize, left: *const [u16; 2],\n top: *const u16, h: i32, edges: isize,\n );\n}\n\nstatic CDEF_PAD_FNS_NEON: [Option<CdefPaddingFn>; 4] = {\n let mut out: [Option<CdefPaddingFn>; 4] = [None; 4];\n out[decimate_index(1, 1)] = Some(rav1e_cdef_padding4_8bpc_neon);\n out[decimate_index(1, 0)] = Some(rav1e_cdef_padding4_8bpc_neon);\n out[decimate_index(0, 0)] = Some(rav1e_cdef_padding8_8bpc_neon);\n out\n};\n\nstatic CDEF_FILTER_FNS_NEON: [Option<CdefFilterFn>; 4] = {\n let mut out: [Option<CdefFilterFn>; 4] = [None; 4];\n out[decimate_index(1, 1)] = Some(rav1e_cdef_filter4_8bpc_neon);\n out[decimate_index(1, 0)] = Some(rav1e_cdef_filter4_8bpc_neon);\n out[decimate_index(0, 0)] = Some(rav1e_cdef_filter8_8bpc_neon);\n out\n};\n\nstatic CDEF_PAD_HBD_FNS_NEON: [Option<CdefPaddingHBDFn>; 4] = {\n let mut out: [Option<CdefPaddingHBDFn>; 4] = [None; 4];\n out[decimate_index(1, 1)] = Some(rav1e_cdef_padding4_16bpc_neon);\n out[decimate_index(1, 0)] = Some(rav1e_cdef_padding4_16bpc_neon);\n out[decimate_index(0, 0)] = Some(rav1e_cdef_padding8_16bpc_neon);\n out\n};\n\nstatic CDEF_FILTER_HBD_FNS_NEON: [Option<CdefFilterHBDFn>; 4] = {\n let mut out: [Option<CdefFilterHBDFn>; 4] = [None; 4];\n out[decimate_index(1, 1)] = Some(rav1e_cdef_filter4_16bpc_neon);\n out[decimate_index(1, 0)] = Some(rav1e_cdef_filter4_16bpc_neon);\n out[decimate_index(0, 0)] = Some(rav1e_cdef_filter8_16bpc_neon);\n out\n};\n\ncpu_function_lookup_table!(\n CDEF_PAD_FNS: [[Option<CdefPaddingFn>; 4]],\n default: [None; 4],\n [NEON]\n);\n\ncpu_function_lookup_table!(\n CDEF_FILTER_FNS: [[Option<CdefFilterFn>; 4]],\n default: [None; 4],\n [NEON]\n);\n\ncpu_function_lookup_table!(\n CDEF_PAD_HBD_FNS: [[Option<CdefPaddingHBDFn>; 4]],\n default: [None; 4],\n [NEON]\n);\n\ncpu_function_lookup_table!(\n CDEF_FILTER_HBD_FNS: [[Option<CdefFilterHBDFn>; 4]],\n default: [None; 4],\n [NEON]\n);\n\ntype CdefDirLBDFn =\n unsafe extern fn(tmp: *const u8, tmp_stride: isize, var: *mut u32) -> i32;\ntype CdefDirHBDFn = unsafe extern fn(\n tmp: *const u16,\n tmp_stride: isize,\n var: *mut u32,\n bitdepth_max: i32,\n) -> i32;\n\n#[inline(always)]\n#[allow(clippy::let_and_return)]\npub(crate) fn cdef_find_dir<T: Pixel>(\n img: &PlaneSlice<'_, T>, var: &mut u32, coeff_shift: usize,\n cpu: CpuFeatureLevel,\n) -> i32 {\n let call_rust =\n |var: &mut u32| rust::cdef_find_dir::<T>(img, var, coeff_shift, cpu);\n\n #[cfg(feature = \"check_asm\")]\n let (ref_dir, ref_var) = {\n let mut var: u32 = 0;\n let dir = call_rust(&mut var);\n (dir, var)\n };\n\n let dir = match T::type_enum() {\n PixelType::U8 => {\n if let Some(func) = CDEF_DIR_LBD_FNS[cpu.as_index()] {\n unsafe {\n (func)(\n img.as_ptr() as *const _,\n T::to_asm_stride(img.plane.cfg.stride),\n var as *mut u32,\n )\n }\n } else {\n call_rust(var)\n }\n }\n PixelType::U16 if coeff_shift > 0 => {\n if let Some(func) = CDEF_DIR_HBD_FNS[cpu.as_index()] {\n unsafe {\n (func)(\n img.as_ptr() as *const _,\n T::to_asm_stride(img.plane.cfg.stride),\n var as *mut u32,\n (1 << coeff_shift + 8) - 1,\n )\n }\n } else {\n call_rust(var)\n }\n }\n _ => call_rust(var),\n };\n\n #[cfg(feature = \"check_asm\")]\n {\n assert_eq!(dir, ref_dir);\n assert_eq!(*var, ref_var);\n }\n\n dir\n}\n\nextern {\n fn rav1e_cdef_find_dir_8bpc_neon(\n tmp: *const u8, tmp_stride: isize, var: *mut u32,\n ) -> i32;\n}\n\nextern {\n fn rav1e_cdef_find_dir_16bpc_neon(\n tmp: *const u16, tmp_stride: isize, var: *mut u32, max_bitdepth: i32,\n ) -> i32;\n}\n\ncpu_function_lookup_table!(\n CDEF_DIR_LBD_FNS: [Option<CdefDirLBDFn>],\n default: None,\n [(NEON, Some(rav1e_cdef_find_dir_8bpc_neon))]\n);\n\ncpu_function_lookup_table!(\n CDEF_DIR_HBD_FNS: [Option<CdefDirHBDFn>],\n default: None,\n [(NEON, Some(rav1e_cdef_find_dir_16bpc_neon))]\n);\n"},"prefix":{"kind":"string","value":"\n\nuse crate::cdef::*;\nuse crate::cpu_features::CpuFeatureLevel;\nuse crate::frame::*;\nuse crate::tiling::PlaneRegionMut;\nuse crate::util::*;\n\ntype CdefPaddingFn = unsafe extern fn(\n tmp: *mut u16,\n src: *const u8,\n src_stride: isize,\n left: *const [u8; 2],\n top: *const u8,\n h: i32,\n edges: isize,\n);\n\ntype CdefPaddingHBDFn = unsafe extern fn(\n tmp: *mut u16,\n src: *const u16,\n src_stride: isize,\n left: *const [u16; 2],\n top: *const u16,\n h: i32,\n edges: isize,\n);\n\ntype CdefFilterFn = unsafe extern fn(\n dst: *mut u8,\n dst_stride: isize,\n tmp: *const u16,\n pri_strength: i32,\n sec_strength: i32,\n dir: i32,\n damping: i32,\n h: i32,\n edges: isize,\n);\n\ntype CdefFilterHBDFn = unsafe extern fn(\n dst: *mut u16,\n dst_stride: isize,\n tmp: *const u16,\n pri_strength: i32,\n sec_strength: i32,\n dir: i32,\n damping: i32,\n h: i32,\n edges: isize,\n bitdepth_max: i32,\n);\n\n#[inline(always)]\nconst fn decimate_index(xdec: usize, ydec: usize) -> usize {\n ((ydec << 1) | xdec) & 3\n}\n\npub(crate) unsafe fn cdef_filter_block<T: Pixel>(\n dst: &mut PlaneRegionMut<'_, T>, src: *const T, src_stride: isize,\n pri_strength: i32, sec_strength: i32, dir: usize, damping: i32,\n bit_depth: usize, xdec: usize, ydec: usize, edges: u8, cpu: CpuFeatureLevel,\n) {\n let call_rust = |dst: &mut PlaneRegionMut<T>| {\n rust::cdef_filter_block(\n dst,\n src,\n src_stride,\n pri_strength,\n sec_strength,\n dir,\n damping,\n bit_depth,\n xdec,\n ydec,\n edges,\n cpu,\n );\n };\n\n #[cfg(feature = \"check_asm\")]\n let ref_dst = {\n let mut copy = dst.scratch_copy();\n call_rust(&mut copy.as_region_mut());\n copy\n };\n match T::type_enum() {\n PixelType::U8 => {\n match (\n CDEF_PAD_FNS[cpu.as_index()][decimate_index(xdec, ydec)],\n CDEF_FILTER_FNS[cpu.as_index()][decimate_index(xdec, ydec)],\n ) {\n (Some(pad), Some(func)) => {\n let h = if ydec == 1 { 4 } else { 8 } as i32;\n let tmpstride = if xdec == 1 { 8 } else { 16 } as isize;\n const MAXTMPSTRIDE: isize = 16;\n const TMPSIZE: usize = (12 * MAXTMPSTRIDE + 8) as usize;\n let mut tmp: Aligned<[u16; TMPSIZE]> =\n Aligned::new([CDEF_VERY_LARGE; TMPSIZE]);\n let top = src.offset(-2 * src_stride);\n let mut left: Aligned<[[u8; 2]; 8]> = Aligned::new([[0; 2]; 8]);\n\n \n \n \n \n if edges & CDEF_HAVE_LEFT != 0 {\n let mut wptr = src.offset(-2) as *const u8;\n for i in 0..h {\n left.data[i as usize][0] = *wptr;\n left.data[i as usize][1] = *wptr.add(1);\n wptr = wptr.offset(src_stride);\n }\n }\n\n \n \n \n \n \n \n \n \n (pad)(\n tmp.data.as_mut_ptr().offset(2 * tmpstride + 8) as *mut u16,\n src as *const u8,\n T::to_asm_stride(src_stride as usize),\n left.data.as_ptr() as *const [u8; 2],\n top as *const u8,\n 8 >> ydec,\n edges.into(),\n );\n\n (func)(\n dst.data_ptr_mut() as *mut u8,\n T::to_asm_stride(dst.plane_cfg.stride),\n tmp.data.as_ptr().offset(2 * tmpstride + 8) as *const u16,\n pri_strength,\n sec_strength,\n dir as i32,\n damping,\n 8 >> ydec,\n edges.into(),\n );\n }\n _ => call_rust(dst),\n }\n }\n PixelType::U16 => {\n match (\n CDEF_PAD_HBD_FNS[cpu.as_index()][decimate_index(xdec, ydec)],\n CDEF_FILTER_HBD_FNS[cpu.as_index()][decimate_index(xdec, ydec)],\n ) {\n \n \n \n \n (Some(pad), Some(func)) => {\n let h = if ydec == 1 { 4 } else { 8 } as i32;\n let tmpstride = if xdec == 1 { 8 } else { 16 } as isize;\n const MAXTMPSTRIDE: isize = 16;\n const TMPSIZE: usize = (12 * MAXTMPSTRIDE + 8) as usize;\n let mut tmp: Aligned<[u16; TMPSIZE]> =\n Aligned::new([CDEF_VERY_LARGE; TMPSIZE]);\n let top = src.offset(-2 * src_stride);\n let mut left: Aligned<[[u16; 2]; 8]> = Aligned::new([[0; 2]; 8]);\n\n if edges & CDEF_HAVE_LEFT != 0 {\n let mut wptr = src.offset(-2) as *const u16;\n for i in 0..h {\n left.data[i as usize][0] = *wptr;\n left.data[i as usize][1] = *wptr.add(1);\n wptr = wptr.offset(src_stride);\n }\n }\n\n (pad)(\n tmp.data.as_mut_ptr().offset(2 * tmpstride + 8) as *mut u16,\n src as *const u16,\n T::to_asm_stride(src_stride as usize),\n left.data.as_ptr() as *const [u16; 2],\n top as *const u16,\n 8 >> ydec,\n edges.into(),\n );\n\n (func)(\n dst.data_ptr_mut() as *mut u16,\n T::to_asm_stride(dst.plane_cfg.stride),\n tmp.data.as_ptr().offset(2 * tmpstride + 8) as *const u16,\n pri_strength,\n sec_strength,\n dir as i32,\n damping,\n 8 >> ydec,\n edges.into(),\n (1 << bit_depth) - 1,\n );\n }\n _ => call_rust(dst),\n }\n }\n }\n #[cfg(feature = \"check_asm\")]\n {\n for (dst_row, ref_row) in\n dst.rows_iter().zip(ref_dst.as_region().rows_iter())\n {\n for (dst, reference) in dst_row.iter().zip(ref_row) {\n assert_eq!(*dst, *reference);\n }\n }\n }\n}\n\nextern {\n fn rav1e_cdef_filter4_8bpc_neon(\n dst: *mut u8, dst_stride: isize, tmp: *const u16, pri_strength: i32,\n sec_strength: i32, dir: i32, damping: i32, h: i32, edges: isize,\n );\n\n fn rav1e_cdef_padding4_8bpc_neon(\n tmp: *mut u16, src: *const u8, src_stride: isize, left: *const [u8; 2],\n top: *const u8, h: i32, edges: isize,\n );\n\n fn rav1e_cdef_filter8_8bpc_neon(\n dst: *mut u8, dst_stride: isize, tmp: *const u16, pri_strength: i32,\n sec_strength: i32, dir: i32, damping: i32, h: i32, edges: isize,\n );\n\n fn rav1e_cdef_padding8_8bpc_neon(\n tmp: *mut u16, src: *const u8, src_stride: isize, left: *const [u8; 2],\n top: *const u8, h: i32, edges: isize,\n );\n\n fn rav1e_cdef_filter4_16bpc_neon(\n dst: *mut u16, dst_stride: isize, tmp: *const u16, pri_strength: i32,\n sec_strength: i32, dir: i32, damping: i32, h: i32, edges: isize, bd: i32,\n );\n\n fn rav1e_cdef_padding4_16bpc_neon(\n tmp: *mut u16, src: *const u16, src_stride: isize, left: *const [u16; 2],\n top: *const u16, h: i32, edges: isize,\n );\n\n fn rav1e_cdef_filter8_16bpc_neon(\n dst: *mut u16, dst_stride: isize, tmp: *const u16, pri_strength: i32,\n sec_strength: i32, dir: i32, damping: i32, h: i32, edges: isize, bd: i32,\n );\n\n fn rav1e_cdef_padding8_16bpc_neon(\n tmp: *mut u16, src: *const u16, src_stride: isize, left: *const [u16; 2],\n top: *const u16, h: i32, edges: isize,\n );\n}\n\nstatic CDEF_PAD_FNS_NEON: [Option<CdefPaddingFn>; 4] = {\n let mut out: [Option<CdefPaddingFn>; 4] = [None; 4];\n out[decimate_index(1, 1)] = Some(rav1e_cdef_padding4_8bpc_neon);\n out[decimate_index(1, 0)] = Some(rav1e_cdef_padding4_8bpc_neon);\n out[decimate_index(0, 0)] = Some(rav1e_cdef_padding8_8bpc_neon);\n out\n};\n\nstatic CDEF_FILTER_FNS_NEON: [Option<CdefFilterFn>; 4] = {\n let mut out: [Option<CdefFilterFn>; 4] = [None; 4];\n out[decimate_index(1, 1)] = Some(rav1e_cdef_filter4_8bpc_neon);\n out[decimate_index(1, 0)] = Some(rav1e_cdef_filter4_8bpc_neon);\n out[decimate_index(0, 0)] = Some(rav1e_cdef_filter8_8bpc_neon);\n out\n};\n\nstatic CDEF_PAD_HBD_FNS_NEON: [Option<CdefPaddingHBDFn>; 4] = {\n let mut out: [Option<CdefPaddingHBDFn>; 4] = [None; 4];\n out[decimate_index(1, 1)] = Some(rav1e_cdef_padding4_16bpc_neon);\n out[decimate_index(1, 0)] = Some(rav1e_cdef_padding4_16bpc_neon);\n out[decimate_index(0, 0)] = Some(rav1e_cdef_padding8_16bpc_neon);\n out\n};\n\nstatic CDEF_FILTER_HBD_FNS_NEON: [Option<CdefFilterHBDFn>; 4] = {\n let mut out: [Option<CdefFilterHBDFn>; 4] = [None; 4];\n out[decimate_index(1, 1)] = Some(rav1e_cdef_filter4_16bpc_neon);\n out[decimate_index(1, 0)] = Some(rav1e_cdef_filter4_16bpc_neon);\n out[decimate_index(0, 0)] = Some(rav1e_cdef_filter8_16bpc_neon);\n out\n};\n\ncpu_function_lookup_table!(\n CDEF_PAD_FNS: [[Option<CdefPaddingFn>; 4]],\n default: [None; 4],\n [NEON]\n);\n\ncpu_function_lookup_table!(\n CDEF_FILTER_FNS: [[Option<CdefFilterFn>; 4]],\n default: [None; 4],\n [NEON]\n);\n\ncpu_function_lookup_table!(\n CDEF_PAD_HBD_FNS: [[Option<CdefPaddingHBDFn>; 4]],\n default: [None; 4],\n [NEON]\n);\n\ncpu_function_lookup_table!(\n CDEF_FILTER_HBD_FNS: [[Option<CdefFilterHBDFn>; 4]],\n default: [None; 4],\n [NEON]\n);\n\ntype CdefDirLBDFn =\n unsafe extern fn(tmp: *const u8, tmp_stride: isize, var: *mut u32) -> i32;\ntype CdefDirHBDFn = unsafe extern fn(\n tmp: *const u16,\n tmp_stride: isize,\n var: *mut u32,\n bitdepth_max: i32,\n) -> i32;\n\n#[inline(always)]\n#[allow(clippy::let_and_return)]\n"},"suffix":{"kind":"string","value":"\n\nextern {\n fn rav1e_cdef_find_dir_8bpc_neon(\n tmp: *const u8, tmp_stride: isize, var: *mut u32,\n ) -> i32;\n}\n\nextern {\n fn rav1e_cdef_find_dir_16bpc_neon(\n tmp: *const u16, tmp_stride: isize, var: *mut u32, max_bitdepth: i32,\n ) -> i32;\n}\n\ncpu_function_lookup_table!(\n CDEF_DIR_LBD_FNS: [Option<CdefDirLBDFn>],\n default: None,\n [(NEON, Some(rav1e_cdef_find_dir_8bpc_neon))]\n);\n\ncpu_function_lookup_table!(\n CDEF_DIR_HBD_FNS: [Option<CdefDirHBDFn>],\n default: None,\n [(NEON, Some(rav1e_cdef_find_dir_16bpc_neon))]\n);\n"},"middle":{"kind":"string","value":"pub(crate) fn cdef_find_dir<T: Pixel>(\n img: &PlaneSlice<'_, T>, var: &mut u32, coeff_shift: usize,\n cpu: CpuFeatureLevel,\n) -> i32 {\n let call_rust =\n |var: &mut u32| rust::cdef_find_dir::<T>(img, var, coeff_shift, cpu);\n\n #[cfg(feature = \"check_asm\")]\n let (ref_dir, ref_var) = {\n let mut var: u32 = 0;\n let dir = call_rust(&mut var);\n (dir, var)\n };\n\n let dir = match T::type_enum() {\n PixelType::U8 => {\n if let Some(func) = CDEF_DIR_LBD_FNS[cpu.as_index()] {\n unsafe {\n (func)(\n img.as_ptr() as *const _,\n T::to_asm_stride(img.plane.cfg.stride),\n var as *mut u32,\n )\n }\n } else {\n call_rust(var)\n }\n }\n PixelType::U16 if coeff_shift > 0 => {\n if let Some(func) = CDEF_DIR_HBD_FNS[cpu.as_index()] {\n unsafe {\n (func)(\n img.as_ptr() as *const _,\n T::to_asm_stride(img.plane.cfg.stride),\n var as *mut u32,\n (1 << coeff_shift + 8) - 1,\n )\n }\n } else {\n call_rust(var)\n }\n }\n _ => call_rust(var),\n };\n\n #[cfg(feature = \"check_asm\")]\n {\n assert_eq!(dir, ref_dir);\n assert_eq!(*var, ref_var);\n }\n\n dir\n}"},"strategy":{"kind":"string","value":"function_block-full_function"},"context_items":{"kind":"list like","value":[{"content":"type CdefDirHBDFn = unsafe extern fn(\n\n tmp: *const u16,\n\n tmp_stride: isize,\n\n var: *mut u32,\n\n bitdepth_max: i32,\n\n) -> i32;\n\n\n\n#[inline(always)]\n\n#[allow(clippy::let_and_return)]\n\npub(crate) fn cdef_find_dir<T: Pixel>(\n\n img: &PlaneSlice<'_, T>, var: &mut u32, coeff_shift: usize,\n\n cpu: CpuFeatureLevel,\n\n) -> i32 {\n\n let call_rust =\n\n |var: &mut u32| rust::cdef_find_dir::<T>(img, var, coeff_shift, cpu);\n\n\n\n #[cfg(feature = \"check_asm\")]\n\n let (ref_dir, ref_var) = {\n\n let mut var: u32 = 0;\n\n let dir = call_rust(&mut var);\n","file_path":"src/asm/x86/cdef.rs","rank":2,"score":339233.4814169615},{"content":"type InvTxfmFn = fn(input: &[i32], output: &mut [i32], range: usize);\n\n\n\nstatic INV_TXFM_FNS: [[InvTxfmFn; 5]; 4] = [\n\n [av1_idct4, av1_idct8, av1_idct16, av1_idct32, av1_idct64],\n\n [\n\n av1_iadst4,\n\n av1_iadst8,\n\n av1_iadst16,\n\n |_, _, _| unimplemented!(),\n\n |_, _, _| unimplemented!(),\n\n ],\n\n [\n\n av1_iflipadst4,\n\n av1_iflipadst8,\n\n av1_iflipadst16,\n\n |_, _, _| unimplemented!(),\n\n |_, _, _| unimplemented!(),\n\n ],\n\n [\n\n av1_iidentity4,\n","file_path":"src/transform/inverse.rs","rank":4,"score":315219.2659027902},{"content":"type TxfmFuncI32X8 = unsafe fn(&mut [I32X8]);\n\n\n","file_path":"src/asm/x86/transform/forward.rs","rank":5,"score":314686.39609474444},{"content":"type CdefFilterFn = unsafe extern fn(\n\n dst: *mut u8,\n\n dst_stride: isize,\n\n tmp: *const u16,\n\n tmp_stride: isize,\n\n pri_strength: i32,\n\n sec_strength: i32,\n\n dir: i32,\n\n damping: i32,\n\n);\n\n\n","file_path":"src/asm/x86/cdef.rs","rank":7,"score":309037.9625222234},{"content":"type CdefFilterHBDFn = unsafe extern fn(\n\n dst: *mut u16,\n\n dst_stride: isize,\n\n tmp: *const u16,\n\n tmp_stride: isize,\n\n pri_strength: i32,\n\n sec_strength: i32,\n\n dir: i32,\n\n damping: i32,\n\n bitdepth_max: i32,\n\n);\n\n\n\n#[inline(always)]\n\nconst fn decimate_index(xdec: usize, ydec: usize) -> usize {\n\n ((ydec << 1) | xdec) & 3\n\n}\n\n\n\npub(crate) unsafe fn cdef_filter_block<T: Pixel>(\n\n dst: &mut PlaneRegionMut<'_, T>, src: *const T, src_stride: isize,\n\n pri_strength: i32, sec_strength: i32, dir: usize, damping: i32,\n","file_path":"src/asm/x86/cdef.rs","rank":8,"score":303521.3347403819},{"content":"type PutFn = unsafe extern fn(\n\n dst: *mut u8,\n\n dst_stride: isize,\n\n src: *const u8,\n\n src_stride: isize,\n\n width: i32,\n\n height: i32,\n\n col_frac: i32,\n\n row_frac: i32,\n\n);\n\n\n","file_path":"src/asm/aarch64/mc.rs","rank":10,"score":281639.66944238666},{"content":"type PrepFn = unsafe extern fn(\n\n tmp: *mut i16,\n\n src: *const u8,\n\n src_stride: isize,\n\n width: i32,\n\n height: i32,\n\n col_frac: i32,\n\n row_frac: i32,\n\n);\n\n\n","file_path":"src/asm/x86/mc.rs","rank":11,"score":281639.66944238666},{"content":"type AvgFn = unsafe extern fn(\n\n dst: *mut u8,\n\n dst_stride: isize,\n\n tmp1: *const i16,\n\n tmp2: *const i16,\n\n width: i32,\n\n height: i32,\n\n);\n\n\n","file_path":"src/asm/x86/mc.rs","rank":12,"score":281639.66944238666},{"content":"type SadFn = unsafe extern fn(\n\n src: *const u8,\n\n src_stride: isize,\n\n dst: *const u8,\n\n dst_stride: isize,\n\n) -> u32;\n\n\n\nmacro_rules! declare_asm_dist_fn {\n\n ($(($name: ident, $T: ident)),+) => (\n\n $(\n\n extern { fn $name (\n\n src: *const $T, src_stride: isize, dst: *const $T, dst_stride: isize\n\n ) -> u32; }\n\n )+\n\n )\n\n}\n\n\n\ndeclare_asm_dist_fn![\n\n (rav1e_sad4x4_neon, u8),\n\n (rav1e_sad4x8_neon, u8),\n","file_path":"src/asm/aarch64/dist.rs","rank":13,"score":281639.66944238666},{"content":"type PutFn = unsafe extern fn(\n\n dst: *mut u8,\n\n dst_stride: isize,\n\n src: *const u8,\n\n src_stride: isize,\n\n width: i32,\n\n height: i32,\n\n col_frac: i32,\n\n row_frac: i32,\n\n);\n\n\n","file_path":"src/asm/x86/mc.rs","rank":14,"score":281639.66944238666},{"content":"type AvgFn = unsafe extern fn(\n\n dst: *mut u8,\n\n dst_stride: isize,\n\n tmp1: *const i16,\n\n tmp2: *const i16,\n\n width: i32,\n\n height: i32,\n\n);\n\n\n","file_path":"src/asm/aarch64/mc.rs","rank":15,"score":281639.66944238666},{"content":"type PrepFn = unsafe extern fn(\n\n tmp: *mut i16,\n\n src: *const u8,\n\n src_stride: isize,\n\n width: i32,\n\n height: i32,\n\n col_frac: i32,\n\n row_frac: i32,\n\n);\n\n\n","file_path":"src/asm/aarch64/mc.rs","rank":16,"score":281639.66944238666},{"content":"type FrameOpaqueCb = Option<extern fn(*mut c_void)>;\n\n\n","file_path":"src/capi.rs","rank":17,"score":280774.34508468123},{"content":"type PutHBDFn = unsafe extern fn(\n\n dst: *mut u16,\n\n dst_stride: isize,\n\n src: *const u16,\n\n src_stride: isize,\n\n width: i32,\n\n height: i32,\n\n col_frac: i32,\n\n row_frac: i32,\n\n bitdepth_max: i32,\n\n);\n\n\n","file_path":"src/asm/x86/mc.rs","rank":18,"score":275762.42419201735},{"content":"type PrepHBDFn = unsafe extern fn(\n\n tmp: *mut i16,\n\n src: *const u16,\n\n src_stride: isize,\n\n width: i32,\n\n height: i32,\n\n col_frac: i32,\n\n row_frac: i32,\n\n bitdepth_max: i32,\n\n);\n\n\n","file_path":"src/asm/x86/mc.rs","rank":19,"score":275762.42419201735},{"content":"type PutHBDFn = unsafe extern fn(\n\n dst: *mut u16,\n\n dst_stride: isize,\n\n src: *const u16,\n\n src_stride: isize,\n\n width: i32,\n\n height: i32,\n\n col_frac: i32,\n\n row_frac: i32,\n\n bitdepth_max: i32,\n\n);\n\n\n","file_path":"src/asm/aarch64/mc.rs","rank":20,"score":275762.42419201735},{"content":"type AvgHBDFn = unsafe extern fn(\n\n dst: *mut u16,\n\n dst_stride: isize,\n\n tmp1: *const i16,\n\n tmp2: *const i16,\n\n width: i32,\n\n height: i32,\n\n bitdepth_max: i32,\n\n);\n\n\n\n// gets an index that can be mapped to a function for a pair of filter modes\n\n#[inline]\n\nconst fn get_2d_mode_idx(mode_x: FilterMode, mode_y: FilterMode) -> usize {\n\n (mode_x as usize + 4 * (mode_y as usize)) & 15\n\n}\n\n\n","file_path":"src/asm/aarch64/mc.rs","rank":21,"score":275762.42419201735},{"content":"type AvgHBDFn = unsafe extern fn(\n\n dst: *mut u16,\n\n dst_stride: isize,\n\n tmp1: *const i16,\n\n tmp2: *const i16,\n\n width: i32,\n\n height: i32,\n\n bitdepth_max: i32,\n\n);\n\n\n\n// gets an index that can be mapped to a function for a pair of filter modes\n\n#[inline]\n\nconst fn get_2d_mode_idx(mode_x: FilterMode, mode_y: FilterMode) -> usize {\n\n (mode_x as usize + 4 * (mode_y as usize)) & 15\n\n}\n\n\n","file_path":"src/asm/x86/mc.rs","rank":22,"score":275762.42419201735},{"content":"type PrepHBDFn = unsafe extern fn(\n\n tmp: *mut i16,\n\n src: *const u16,\n\n src_stride: isize,\n\n width: i32,\n\n height: i32,\n\n col_frac: i32,\n\n row_frac: i32,\n\n bitdepth_max: i32,\n\n);\n\n\n","file_path":"src/asm/aarch64/mc.rs","rank":23,"score":275762.42419201735},{"content":"#[inline(always)]\n\npub fn update_cdf(cdf: &mut [u16], val: u32) {\n\n if cdf.len() == 4 {\n\n return unsafe {\n\n update_cdf_4_sse2(cdf, val);\n\n };\n\n }\n\n\n\n rust::update_cdf(cdf, val);\n\n}\n\n\n\n#[target_feature(enable = \"sse2\")]\n\n#[inline]\n\nunsafe fn update_cdf_4_sse2(cdf: &mut [u16], val: u32) {\n\n let nsymbs = 4;\n\n let rate = 5 + (cdf[nsymbs - 1] >> 4) as usize;\n\n let count = cdf[nsymbs - 1] + (cdf[nsymbs - 1] < 32) as u16;\n\n\n\n // A bit of explanation of what is happening down here. First of all, let's look at the simple\n\n // implementation:\n\n //\n","file_path":"src/asm/x86/ec.rs","rank":24,"score":264691.6191634583},{"content":"#[inline(never)]\n\nfn variance_8x8<T: Pixel>(src: &PlaneRegion<'_, T>) -> u32 {\n\n debug_assert!(src.plane_cfg.xdec == 0);\n\n debug_assert!(src.plane_cfg.ydec == 0);\n\n\n\n // Sum into columns to improve auto-vectorization\n\n let mut sum_s_cols: [u16; 8] = [0; 8];\n\n let mut sum_s2_cols: [u32; 8] = [0; 8];\n\n\n\n // Check upfront that 8 rows are available.\n\n let _row = &src[7];\n\n\n\n for j in 0..8 {\n\n let row = &src[j][0..8];\n\n for (sum_s, sum_s2, s) in izip!(&mut sum_s_cols, &mut sum_s2_cols, row) {\n\n // Don't convert directly to u32 to allow better vectorization\n\n let s: u16 = u16::cast_from(*s);\n\n *sum_s += s;\n\n\n\n // Convert to u32 to avoid overflows when multiplying\n\n let s: u32 = s as u32;\n","file_path":"src/activity.rs","rank":25,"score":263612.36073993624},{"content":"#[inline(always)]\n\npub fn get_mv_class(z: u32, offset: &mut u32) -> usize {\n\n let c = if z >= CLASS0_SIZE as u32 * 4096 {\n\n MV_CLASS_10\n\n } else {\n\n log_in_base_2(z >> 3) as usize\n\n };\n\n\n\n *offset = z - mv_class_base(c);\n\n c\n\n}\n\n\n\nimpl<'a> ContextWriter<'a> {\n\n pub fn encode_mv_component<W: Writer>(\n\n &mut self, w: &mut W, comp: i32, axis: usize, precision: MvSubpelPrecision,\n\n ) {\n\n assert!(comp != 0);\n\n assert!(MV_LOW <= comp && comp <= MV_UPP);\n\n let mvcomp = &mut self.fc.nmv_context.comps[axis];\n\n let mut offset: u32 = 0;\n\n let sign: u32 = if comp < 0 { 1 } else { 0 };\n","file_path":"src/context/mod.rs","rank":26,"score":257373.02845419705},{"content":"fn av1_idct32(input: &[i32], output: &mut [i32], range: usize) {\n\n assert!(input.len() >= 32);\n\n assert!(output.len() >= 32);\n\n\n\n // stage 1;\n\n let stg1 = [\n\n input[0], input[16], input[8], input[24], input[4], input[20], input[12],\n\n input[28], input[2], input[18], input[10], input[26], input[6], input[22],\n\n input[14], input[30], input[1], input[17], input[9], input[25], input[5],\n\n input[21], input[13], input[29], input[3], input[19], input[11],\n\n input[27], input[7], input[23], input[15], input[31],\n\n ];\n\n\n\n // stage 2\n\n let stg2 = [\n\n stg1[0],\n\n stg1[1],\n\n stg1[2],\n\n stg1[3],\n\n stg1[4],\n","file_path":"src/transform/inverse.rs","rank":27,"score":257075.13247083267},{"content":"#[inline(always)]\n\nfn av1_iadst16(input: &[i32], output: &mut [i32], range: usize) {\n\n assert!(input.len() >= 16);\n\n assert!(output.len() >= 16);\n\n\n\n // stage 1\n\n let stg1 = [\n\n input[15], input[0], input[13], input[2], input[11], input[4], input[9],\n\n input[6], input[7], input[8], input[5], input[10], input[3], input[12],\n\n input[1], input[14],\n\n ];\n\n\n\n // stage 2\n\n let stg2 = [\n\n half_btf(COSPI_INV[2], stg1[0], COSPI_INV[62], stg1[1], INV_COS_BIT),\n\n half_btf(COSPI_INV[62], stg1[0], -COSPI_INV[2], stg1[1], INV_COS_BIT),\n\n half_btf(COSPI_INV[10], stg1[2], COSPI_INV[54], stg1[3], INV_COS_BIT),\n\n half_btf(COSPI_INV[54], stg1[2], -COSPI_INV[10], stg1[3], INV_COS_BIT),\n\n half_btf(COSPI_INV[18], stg1[4], COSPI_INV[46], stg1[5], INV_COS_BIT),\n\n half_btf(COSPI_INV[46], stg1[4], -COSPI_INV[18], stg1[5], INV_COS_BIT),\n\n half_btf(COSPI_INV[26], stg1[6], COSPI_INV[38], stg1[7], INV_COS_BIT),\n","file_path":"src/transform/inverse.rs","rank":28,"score":257075.13247083267},{"content":"fn av1_idct16(input: &[i32], output: &mut [i32], range: usize) {\n\n assert!(input.len() >= 16);\n\n assert!(output.len() >= 16);\n\n\n\n // call idct8\n\n let temp_in = [\n\n input[0], input[2], input[4], input[6], input[8], input[10], input[12],\n\n input[14],\n\n ];\n\n let mut temp_out: [i32; 8] = [0; 8];\n\n av1_idct8(&temp_in, &mut temp_out, range);\n\n\n\n // stage 1\n\n let stg1 = [\n\n input[1], input[9], input[5], input[13], input[3], input[11], input[7],\n\n input[15],\n\n ];\n\n\n\n // stage 2\n\n let stg2 = [\n","file_path":"src/transform/inverse.rs","rank":29,"score":257075.13247083267},{"content":"fn av1_iidentity16(input: &[i32], output: &mut [i32], _range: usize) {\n\n output[..16]\n\n .iter_mut()\n\n .zip(input[..16].iter())\n\n .for_each(|(outp, inp)| *outp = round_shift(SQRT2 * 2 * *inp, 12));\n\n}\n\n\n","file_path":"src/transform/inverse.rs","rank":30,"score":257075.13247083267},{"content":"fn av1_iidentity32(input: &[i32], output: &mut [i32], _range: usize) {\n\n output[..32]\n\n .iter_mut()\n\n .zip(input[..32].iter())\n\n .for_each(|(outp, inp)| *outp = 4 * *inp);\n\n}\n\n\n","file_path":"src/transform/inverse.rs","rank":31,"score":257075.13247083267},{"content":"fn av1_idct64(input: &[i32], output: &mut [i32], range: usize) {\n\n assert!(input.len() >= 64);\n\n assert!(output.len() >= 64);\n\n\n\n // stage 1;\n\n let stg1 = [\n\n input[0], input[32], input[16], input[48], input[8], input[40], input[24],\n\n input[56], input[4], input[36], input[20], input[52], input[12],\n\n input[44], input[28], input[60], input[2], input[34], input[18],\n\n input[50], input[10], input[42], input[26], input[58], input[6],\n\n input[38], input[22], input[54], input[14], input[46], input[30],\n\n input[62], input[1], input[33], input[17], input[49], input[9], input[41],\n\n input[25], input[57], input[5], input[37], input[21], input[53],\n\n input[13], input[45], input[29], input[61], input[3], input[35],\n\n input[19], input[51], input[11], input[43], input[27], input[59],\n\n input[7], input[39], input[23], input[55], input[15], input[47],\n\n input[31], input[63],\n\n ];\n\n\n\n // stage 2\n","file_path":"src/transform/inverse.rs","rank":32,"score":257075.13247083267},{"content":"#[inline]\n\nfn adjust_strength(strength: i32, var: i32) -> i32 {\n\n let i = if (var >> 6) != 0 { cmp::min(msb(var >> 6), 12) } else { 0 };\n\n if var != 0 {\n\n (strength * (4 + i) + 8) >> 4\n\n } else {\n\n 0\n\n }\n\n}\n\n\n","file_path":"src/cdef.rs","rank":33,"score":256824.279595226},{"content":"#[inline]\n\nfn copysign(value: u32, signed: i32) -> i32 {\n\n if signed < 0 {\n\n -(value as i32)\n\n } else {\n\n value as i32\n\n }\n\n}\n\n\n\n#[cfg(test)]\n\nmod test {\n\n use super::*;\n\n use crate::transform::TxSize::*;\n\n\n\n #[test]\n\n fn test_divu_pair() {\n\n for d in 1..1024 {\n\n for x in 0..1000 {\n\n let ab = divu_gen(d as u32);\n\n assert_eq!(x / d, divu_pair(x, ab));\n\n }\n","file_path":"src/quantize.rs","rank":34,"score":249160.12390556786},{"content":"pub fn av1_iflipadst8(input: &[i32], output: &mut [i32], range: usize) {\n\n av1_iadst8(input, output, range);\n\n output[..8].reverse();\n\n}\n\n\n","file_path":"src/transform/inverse.rs","rank":35,"score":248709.87332792315},{"content":"pub fn av1_iidentity8(input: &[i32], output: &mut [i32], _range: usize) {\n\n output[..8]\n\n .iter_mut()\n\n .zip(input[..8].iter())\n\n .for_each(|(outp, inp)| *outp = 2 * *inp);\n\n}\n\n\n","file_path":"src/transform/inverse.rs","rank":36,"score":248709.87332792315},{"content":"pub fn av1_iflipadst4(input: &[i32], output: &mut [i32], range: usize) {\n\n av1_iadst4(input, output, range);\n\n output[..4].reverse();\n\n}\n\n\n","file_path":"src/transform/inverse.rs","rank":37,"score":248709.87332792315},{"content":"#[inline(always)]\n\npub fn av1_iadst8(input: &[i32], output: &mut [i32], range: usize) {\n\n assert!(input.len() >= 8);\n\n assert!(output.len() >= 8);\n\n\n\n // stage 1\n\n let stg1 = [\n\n input[7], input[0], input[5], input[2], input[3], input[4], input[1],\n\n input[6],\n\n ];\n\n\n\n // stage 2\n\n let stg2 = [\n\n half_btf(COSPI_INV[4], stg1[0], COSPI_INV[60], stg1[1], INV_COS_BIT),\n\n half_btf(COSPI_INV[60], stg1[0], -COSPI_INV[4], stg1[1], INV_COS_BIT),\n\n half_btf(COSPI_INV[20], stg1[2], COSPI_INV[44], stg1[3], INV_COS_BIT),\n\n half_btf(COSPI_INV[44], stg1[2], -COSPI_INV[20], stg1[3], INV_COS_BIT),\n\n half_btf(COSPI_INV[36], stg1[4], COSPI_INV[28], stg1[5], INV_COS_BIT),\n\n half_btf(COSPI_INV[28], stg1[4], -COSPI_INV[36], stg1[5], INV_COS_BIT),\n\n half_btf(COSPI_INV[52], stg1[6], COSPI_INV[12], stg1[7], INV_COS_BIT),\n\n half_btf(COSPI_INV[12], stg1[6], -COSPI_INV[52], stg1[7], INV_COS_BIT),\n","file_path":"src/transform/inverse.rs","rank":38,"score":248709.87332792315},{"content":"#[inline(always)]\n\npub fn av1_iadst4(input: &[i32], output: &mut [i32], _range: usize) {\n\n assert!(input.len() >= 4);\n\n assert!(output.len() >= 4);\n\n\n\n let bit = 12;\n\n\n\n let x0 = input[0];\n\n let x1 = input[1];\n\n let x2 = input[2];\n\n let x3 = input[3];\n\n\n\n // stage 1\n\n let s0 = SINPI_INV[1] * x0;\n\n let s1 = SINPI_INV[2] * x0;\n\n let s2 = SINPI_INV[3] * x1;\n\n let s3 = SINPI_INV[4] * x2;\n\n let s4 = SINPI_INV[1] * x2;\n\n let s5 = SINPI_INV[2] * x3;\n\n let s6 = SINPI_INV[4] * x3;\n\n\n","file_path":"src/transform/inverse.rs","rank":39,"score":248709.87332792315},{"content":"pub fn av1_iflipadst16(input: &[i32], output: &mut [i32], range: usize) {\n\n av1_iadst16(input, output, range);\n\n output[..16].reverse();\n\n}\n\n\n","file_path":"src/transform/inverse.rs","rank":40,"score":248709.87332792315},{"content":"pub fn av1_idct8(input: &[i32], output: &mut [i32], range: usize) {\n\n assert!(input.len() >= 8);\n\n assert!(output.len() >= 8);\n\n\n\n // call idct4\n\n let temp_in = [input[0], input[2], input[4], input[6]];\n\n let mut temp_out: [i32; 4] = [0; 4];\n\n av1_idct4(&temp_in, &mut temp_out, range);\n\n\n\n // stage 0\n\n\n\n // stage 1\n\n let stg1 = [input[1], input[5], input[3], input[7]];\n\n\n\n // stage 2\n\n let stg2 = [\n\n half_btf(COSPI_INV[56], stg1[0], -COSPI_INV[8], stg1[3], INV_COS_BIT),\n\n half_btf(COSPI_INV[24], stg1[1], -COSPI_INV[40], stg1[2], INV_COS_BIT),\n\n half_btf(COSPI_INV[40], stg1[1], COSPI_INV[24], stg1[2], INV_COS_BIT),\n\n half_btf(COSPI_INV[8], stg1[0], COSPI_INV[56], stg1[3], INV_COS_BIT),\n","file_path":"src/transform/inverse.rs","rank":41,"score":248709.87332792315},{"content":"pub fn av1_iidentity4(input: &[i32], output: &mut [i32], _range: usize) {\n\n output[..4]\n\n .iter_mut()\n\n .zip(input[..4].iter())\n\n .for_each(|(outp, inp)| *outp = round_shift(SQRT2 * *inp, 12));\n\n}\n\n\n","file_path":"src/transform/inverse.rs","rank":42,"score":248709.87332792315},{"content":"pub fn av1_idct4(input: &[i32], output: &mut [i32], range: usize) {\n\n assert!(input.len() >= 4);\n\n assert!(output.len() >= 4);\n\n\n\n // stage 1\n\n let stg1 = [input[0], input[2], input[1], input[3]];\n\n\n\n // stage 2\n\n let stg2 = [\n\n half_btf(COSPI_INV[32], stg1[0], COSPI_INV[32], stg1[1], INV_COS_BIT),\n\n half_btf(COSPI_INV[32], stg1[0], -COSPI_INV[32], stg1[1], INV_COS_BIT),\n\n half_btf(COSPI_INV[48], stg1[2], -COSPI_INV[16], stg1[3], INV_COS_BIT),\n\n half_btf(COSPI_INV[16], stg1[2], COSPI_INV[48], stg1[3], INV_COS_BIT),\n\n ];\n\n\n\n // stage 3\n\n output[0] = clamp_value(stg2[0] + stg2[3], range);\n\n output[1] = clamp_value(stg2[1] + stg2[2], range);\n\n output[2] = clamp_value(stg2[1] - stg2[2], range);\n\n output[3] = clamp_value(stg2[0] - stg2[3], range);\n\n}\n\n\n","file_path":"src/transform/inverse.rs","rank":43,"score":248709.87332792315},{"content":"// If n != 0, returns the floor of log base 2 of n. If n == 0, returns 0.\n\npub fn log_in_base_2(n: u32) -> u8 {\n\n 31 - cmp::min(31, n.leading_zeros() as u8)\n\n}\n","file_path":"src/context/mod.rs","rank":44,"score":230091.78580263283},{"content":"type CdefDirLBDFn =\n\n unsafe extern fn(tmp: *const u8, tmp_stride: isize, var: *mut u32) -> i32;\n","file_path":"src/asm/x86/cdef.rs","rank":45,"score":224722.3418881266},{"content":"type DequantizeFn = unsafe fn(\n\n qindex: u8,\n\n coeffs_ptr: *const i16,\n\n _eob: usize,\n\n rcoeffs_ptr: *mut i16,\n\n tx_size: TxSize,\n\n bit_depth: usize,\n\n dc_delta_q: i8,\n\n ac_delta_q: i8,\n\n);\n\n\n\ncpu_function_lookup_table!(\n\n DEQUANTIZE_FNS: [Option<DequantizeFn>],\n\n default: None,\n\n [(AVX2, Some(dequantize_avx2))]\n\n);\n\n\n","file_path":"src/asm/x86/quantize.rs","rank":47,"score":219185.44724800315},{"content":"fn fill_frame_const<T: Pixel>(frame: &mut Frame<T>, value: T) {\n\n for plane in frame.planes.iter_mut() {\n\n let stride = plane.cfg.stride;\n\n for row in plane.data.chunks_mut(stride) {\n\n for pixel in row {\n\n *pixel = value;\n\n }\n\n }\n\n }\n\n}\n\n\n\n#[cfg(feature = \"channel-api\")]\n\nmod channel {\n\n use super::*;\n\n\n\n #[interpolate_test(low_latency_no_scene_change, true, true)]\n\n #[interpolate_test(reorder_no_scene_change, false, true)]\n\n #[interpolate_test(low_latency_scene_change_detection, true, false)]\n\n #[interpolate_test(reorder_scene_change_detection, false, false)]\n\n fn flush(low_lantency: bool, no_scene_detection: bool) {\n","file_path":"src/api/test.rs","rank":48,"score":218428.5430597763},{"content":"#[inline]\n\nfn nhev4(p1: i32, p0: i32, q0: i32, q1: i32, shift: usize) -> usize {\n\n thresh_to_level(cmp::max((p1 - p0).abs(), (q1 - q0).abs()), shift) as usize\n\n}\n\n\n","file_path":"src/deblock.rs","rank":49,"score":217783.75359949557},{"content":"#[inline]\n\nfn mask4(p1: i32, p0: i32, q0: i32, q1: i32, shift: usize) -> usize {\n\n cmp::max(\n\n limit_to_level(cmp::max((p1 - p0).abs(), (q1 - q0).abs()), shift),\n\n blimit_to_level((p0 - q0).abs() * 2 + (p1 - q1).abs() / 2, shift),\n\n ) as usize\n\n}\n\n\n","file_path":"src/deblock.rs","rank":50,"score":217783.75359949557},{"content":"fn sse_v_edge<T: Pixel>(\n\n blocks: &TileBlocks, bo: TileBlockOffset, rec_plane: &PlaneRegion<T>,\n\n src_plane: &PlaneRegion<T>, tally: &mut [i64; MAX_LOOP_FILTER + 2],\n\n pli: usize, bd: usize, xdec: usize, ydec: usize,\n\n) {\n\n let block = &blocks[bo];\n\n let txsize = if pli == 0 {\n\n block.txsize\n\n } else {\n\n block.bsize.largest_chroma_tx_size(xdec, ydec)\n\n };\n\n let tx_edge = bo.0.x >> xdec & (txsize.width_mi() - 1) == 0;\n\n if tx_edge {\n\n let prev_block = deblock_left(blocks, bo, rec_plane);\n\n let block_edge = bo.0.x & (block.n4_w as usize - 1) == 0;\n\n let filter_size =\n\n deblock_size(block, prev_block, rec_plane, pli, true, block_edge);\n\n if filter_size > 0 {\n\n let po = bo.plane_offset(rec_plane.plane_cfg); // rec and src have identical subsampling\n\n let rec_region = rec_plane.subregion(Area::Rect {\n","file_path":"src/deblock.rs","rank":51,"score":215568.60132778808},{"content":"fn filter_h_edge<T: Pixel>(\n\n deblock: &DeblockState, blocks: &TileBlocks, bo: TileBlockOffset,\n\n p: &mut PlaneRegionMut<T>, pli: usize, bd: usize, xdec: usize, ydec: usize,\n\n) {\n\n let block = &blocks[bo];\n\n let txsize = if pli == 0 {\n\n block.txsize\n\n } else {\n\n block.bsize.largest_chroma_tx_size(xdec, ydec)\n\n };\n\n let tx_edge = bo.0.y >> ydec & (txsize.height_mi() - 1) == 0;\n\n if tx_edge {\n\n let prev_block = deblock_up(blocks, bo, &p.as_const());\n\n let block_edge = bo.0.y & (block.n4_h as usize - 1) == 0;\n\n let filter_size =\n\n deblock_size(block, prev_block, &p.as_const(), pli, false, block_edge);\n\n if filter_size > 0 {\n\n let level = deblock_level(deblock, block, prev_block, pli, false);\n\n if level > 0 {\n\n let po = bo.plane_offset(p.plane_cfg);\n","file_path":"src/deblock.rs","rank":52,"score":215568.60132778814},{"content":"fn filter_v_edge<T: Pixel>(\n\n deblock: &DeblockState, blocks: &TileBlocks, bo: TileBlockOffset,\n\n p: &mut PlaneRegionMut<T>, pli: usize, bd: usize, xdec: usize, ydec: usize,\n\n) {\n\n let block = &blocks[bo];\n\n let txsize = if pli == 0 {\n\n block.txsize\n\n } else {\n\n block.bsize.largest_chroma_tx_size(xdec, ydec)\n\n };\n\n let tx_edge = bo.0.x >> xdec & (txsize.width_mi() - 1) == 0;\n\n if tx_edge {\n\n let prev_block = deblock_left(blocks, bo, &p.as_const());\n\n let block_edge = bo.0.x & (block.n4_w as usize - 1) == 0;\n\n let filter_size =\n\n deblock_size(block, prev_block, &p.as_const(), pli, true, block_edge);\n\n if filter_size > 0 {\n\n let level = deblock_level(deblock, block, prev_block, pli, true);\n\n if level > 0 {\n\n let po = bo.plane_offset(p.plane_cfg);\n","file_path":"src/deblock.rs","rank":53,"score":215568.60132778814},{"content":"fn sse_h_edge<T: Pixel>(\n\n blocks: &TileBlocks, bo: TileBlockOffset, rec_plane: &PlaneRegion<T>,\n\n src_plane: &PlaneRegion<T>, tally: &mut [i64; MAX_LOOP_FILTER + 2],\n\n pli: usize, bd: usize, xdec: usize, ydec: usize,\n\n) {\n\n let block = &blocks[bo];\n\n let txsize = if pli == 0 {\n\n block.txsize\n\n } else {\n\n block.bsize.largest_chroma_tx_size(xdec, ydec)\n\n };\n\n let tx_edge = bo.0.y >> ydec & (txsize.height_mi() - 1) == 0;\n\n if tx_edge {\n\n let prev_block = deblock_up(blocks, bo, rec_plane);\n\n let block_edge = bo.0.y & (block.n4_h as usize - 1) == 0;\n\n let filter_size =\n\n deblock_size(block, prev_block, rec_plane, pli, true, block_edge);\n\n if filter_size > 0 {\n\n let po = bo.plane_offset(rec_plane.plane_cfg); // rec and src have identical subsampling\n\n let rec_region = rec_plane.subregion(Area::Rect {\n","file_path":"src/deblock.rs","rank":54,"score":215568.60132778808},{"content":"#[inline]\n\nfn copy_vertical<T: Pixel>(\n\n dst: &mut PlaneRegionMut<'_, T>, x: usize, y: usize, src: &[i32],\n\n) {\n\n for (i, v) in src.iter().enumerate() {\n\n let p = &mut dst[y + i][x];\n\n *p = T::cast_from(*v);\n\n }\n\n}\n\n\n","file_path":"src/deblock.rs","rank":55,"score":215563.609898819},{"content":"#[inline]\n\nfn copy_horizontal<T: Pixel>(\n\n dst: &mut PlaneRegionMut<'_, T>, x: usize, y: usize, src: &[i32],\n\n) {\n\n let row = &mut dst[y][x..];\n\n for (dst, src) in row.iter_mut().take(src.len()).zip(src) {\n\n *dst = T::cast_from(*src);\n\n }\n\n}\n\n\n","file_path":"src/deblock.rs","rank":56,"score":215563.609898819},{"content":"pub fn av1_round_shift_array(arr: &mut [i32], size: usize, bit: i8) {\n\n if bit == 0 {\n\n return;\n\n }\n\n if bit > 0 {\n\n let bit = bit as usize;\n\n for i in arr.iter_mut().take(size) {\n\n *i = round_shift(*i, bit);\n\n }\n\n } else {\n\n for i in arr.iter_mut().take(size) {\n\n *i <<= -bit;\n\n }\n\n }\n\n}\n\n\n","file_path":"src/transform/mod.rs","rank":57,"score":215231.53213270966},{"content":"#[inline]\n\nfn deblock_left<'a, T: Pixel>(\n\n blocks: &'a TileBlocks, in_bo: TileBlockOffset, p: &PlaneRegion<T>,\n\n) -> &'a Block {\n\n let xdec = p.plane_cfg.xdec;\n\n let ydec = p.plane_cfg.ydec;\n\n\n\n // subsampled chroma uses odd mi row/col\n\n // We already know we're not at the upper/left corner, so prev_block is in frame\n\n &blocks[in_bo.0.y | ydec][(in_bo.0.x | xdec) - (1 << xdec)]\n\n}\n\n\n","file_path":"src/deblock.rs","rank":58,"score":211729.467200358},{"content":"#[inline]\n\nfn clamp_value(value: i32, bit: usize) -> i32 {\n\n let max_value: i32 = ((1i64 << (bit - 1)) - 1) as i32;\n\n let min_value: i32 = (-(1i64 << (bit - 1))) as i32;\n\n clamp(value, min_value, max_value)\n\n}\n\n\n","file_path":"src/transform/mod.rs","rank":59,"score":210127.8583767466},{"content":"#[inline(always)]\n\nfn rdo_partition_none<T: Pixel>(\n\n fi: &FrameInvariants<T>, ts: &mut TileStateMut<'_, T>,\n\n cw: &mut ContextWriter, bsize: BlockSize, tile_bo: TileBlockOffset,\n\n inter_cfg: &InterConfig, child_modes: &mut ArrayVec<PartitionParameters, 4>,\n\n) -> f64 {\n\n debug_assert!(tile_bo.0.x < ts.mi_width && tile_bo.0.y < ts.mi_height);\n\n\n\n let mode = rdo_mode_decision(fi, ts, cw, bsize, tile_bo, inter_cfg);\n\n let cost = mode.rd_cost;\n\n\n\n child_modes.push(mode);\n\n\n\n cost\n\n}\n\n\n\n// VERTICAL, HORIZONTAL or simple SPLIT\n","file_path":"src/rdo.rs","rank":60,"score":209770.5158869471},{"content":"pub fn get_sgr_sets(complexity: SGRComplexityLevel) -> &'static [u8] {\n\n match complexity {\n\n SGRComplexityLevel::Full => SGRPROJ_ALL_SETS,\n\n SGRComplexityLevel::Reduced => SGRPROJ_REDUCED_SETS,\n\n }\n\n}\n\n\n\npub const SOLVE_IMAGE_MAX: usize = 1 << RESTORATION_TILESIZE_MAX_LOG2;\n\npub const SOLVE_IMAGE_STRIDE: usize = SOLVE_IMAGE_MAX + 6 + 2;\n\npub const SOLVE_IMAGE_HEIGHT: usize = SOLVE_IMAGE_STRIDE;\n\npub const SOLVE_IMAGE_SIZE: usize = SOLVE_IMAGE_STRIDE * SOLVE_IMAGE_HEIGHT;\n\n\n\npub const STRIPE_IMAGE_MAX: usize = (1 << RESTORATION_TILESIZE_MAX_LOG2)\n\n + (1 << (RESTORATION_TILESIZE_MAX_LOG2 - 1));\n\npub const STRIPE_IMAGE_STRIDE: usize = STRIPE_IMAGE_MAX + 6 + 2;\n\npub const STRIPE_IMAGE_HEIGHT: usize = 64 + 6 + 2;\n\npub const STRIPE_IMAGE_SIZE: usize = STRIPE_IMAGE_STRIDE * STRIPE_IMAGE_HEIGHT;\n\n\n\npub const IMAGE_WIDTH_MAX: usize = [STRIPE_IMAGE_MAX, SOLVE_IMAGE_MAX]\n\n [(STRIPE_IMAGE_MAX < SOLVE_IMAGE_MAX) as usize];\n","file_path":"src/lrf.rs","rank":61,"score":207187.44466802134},{"content":"pub fn copy_from_raw_u8_8bit(c: &mut Criterion) {\n\n let input = init_raw_plane_data(1920, 1080);\n\n let dest = Plane::<u8>::new(1920, 1080, 0, 0, 0, 0);\n\n c.bench_function(\"copy_from_raw_u8\", move |b| {\n\n b.iter(|| {\n\n let mut dest = dest.clone();\n\n let _ = dest.copy_from_raw_u8(&input, dest.cfg.stride, 1);\n\n })\n\n });\n\n}\n\n\n","file_path":"benches/plane.rs","rank":62,"score":206879.08698978083},{"content":"pub fn copy_from_raw_u8_10bit(c: &mut Criterion) {\n\n let input = init_raw_plane_data(1920, 1080);\n\n let dest = Plane::<u16>::new(1920, 1080, 0, 0, 0, 0);\n\n c.bench_function(\"copy_from_raw_u8\", move |b| {\n\n b.iter(|| {\n\n let mut dest = dest.clone();\n\n let _ = dest.copy_from_raw_u8(&input, dest.cfg.stride, 2);\n\n })\n\n });\n\n}\n\n\n\ncriterion_group!(\n\n plane,\n\n downsample_8bit,\n\n downsample_odd,\n\n downsample_10bit,\n\n copy_from_raw_u8_8bit,\n\n copy_from_raw_u8_10bit\n\n);\n","file_path":"benches/plane.rs","rank":63,"score":206879.08698978083},{"content":"#[inline]\n\nfn flat6(p2: i32, p1: i32, p0: i32, q0: i32, q1: i32, q2: i32) -> usize {\n\n cmp::max(\n\n (p1 - p0).abs(),\n\n cmp::max((q1 - q0).abs(), cmp::max((p2 - p0).abs(), (q2 - q0).abs())),\n\n ) as usize\n\n}\n\n\n","file_path":"src/deblock.rs","rank":64,"score":206034.87988816714},{"content":"fn bench_put_8tap_top_left_lbd(c: &mut Criterion) {\n\n let mut ra = ChaChaRng::from_seed([0; 32]);\n\n let cpu = CpuFeatureLevel::default();\n\n let w = 640;\n\n let h = 480;\n\n let input_plane = new_plane::<u8>(&mut ra, w, h);\n\n let mut dst_plane = new_plane::<u8>(&mut ra, w, h);\n\n\n\n let (row_frac, col_frac, src) = get_params(\n\n &input_plane,\n\n PlaneOffset { x: 0, y: 0 },\n\n MotionVector { row: 0, col: 0 },\n\n );\n\n c.bench_function(\"put_8tap_top_left_lbd\", |b| {\n\n b.iter(|| {\n\n let _ = black_box(put_8tap(\n\n &mut dst_plane.as_region_mut(),\n\n src,\n\n 8,\n\n 8,\n","file_path":"benches/mc.rs","rank":65,"score":205172.61354594887},{"content":"fn bench_prep_8tap_top_left_lbd(c: &mut Criterion) {\n\n let mut ra = ChaChaRng::from_seed([0; 32]);\n\n let cpu = CpuFeatureLevel::default();\n\n let w = 640;\n\n let h = 480;\n\n let input_plane = new_plane::<u8>(&mut ra, w, h);\n\n let mut dst = Aligned::<[i16; 128 * 128]>::uninitialized();\n\n\n\n let (row_frac, col_frac, src) = get_params(\n\n &input_plane,\n\n PlaneOffset { x: 0, y: 0 },\n\n MotionVector { row: 0, col: 0 },\n\n );\n\n c.bench_function(\"prep_8tap_top_left_lbd\", |b| {\n\n b.iter(|| {\n\n let _ = black_box(prep_8tap(\n\n &mut dst.data,\n\n src,\n\n 8,\n\n 8,\n","file_path":"benches/mc.rs","rank":66,"score":205172.61354594887},{"content":"fn bench_put_8tap_top_left_hbd(c: &mut Criterion) {\n\n let mut ra = ChaChaRng::from_seed([0; 32]);\n\n let cpu = CpuFeatureLevel::default();\n\n let w = 640;\n\n let h = 480;\n\n let input_plane = new_plane::<u16>(&mut ra, w, h);\n\n let mut dst_plane = new_plane::<u16>(&mut ra, w, h);\n\n\n\n let (row_frac, col_frac, src) = get_params(\n\n &input_plane,\n\n PlaneOffset { x: 0, y: 0 },\n\n MotionVector { row: 0, col: 0 },\n\n );\n\n c.bench_function(\"put_8tap_top_left_hbd\", |b| {\n\n b.iter(|| {\n\n let _ = black_box(put_8tap(\n\n &mut dst_plane.as_region_mut(),\n\n src,\n\n 8,\n\n 8,\n","file_path":"benches/mc.rs","rank":67,"score":205172.61354594887},{"content":"fn bench_prep_8tap_top_left_hbd(c: &mut Criterion) {\n\n let mut ra = ChaChaRng::from_seed([0; 32]);\n\n let cpu = CpuFeatureLevel::default();\n\n let w = 640;\n\n let h = 480;\n\n let input_plane = new_plane::<u16>(&mut ra, w, h);\n\n let mut dst = Aligned::<[i16; 128 * 128]>::uninitialized();\n\n\n\n let (row_frac, col_frac, src) = get_params(\n\n &input_plane,\n\n PlaneOffset { x: 0, y: 0 },\n\n MotionVector { row: 0, col: 0 },\n\n );\n\n c.bench_function(\"prep_8tap_top_left_hbd\", |b| {\n\n b.iter(|| {\n\n let _ = black_box(prep_8tap(\n\n &mut dst.data,\n\n src,\n\n 8,\n\n 8,\n","file_path":"benches/mc.rs","rank":68,"score":205172.61354594887},{"content":"/// Fill data for scaling of one\n\nfn fill_scaling(ra: &mut ChaChaRng, scales: &mut [u32]) {\n\n for a in scales.iter_mut() {\n\n *a =\n\n ra.gen_range(DistortionScale::new(0.5).0..DistortionScale::new(1.5).0);\n\n }\n\n}\n\n\n","file_path":"benches/dist.rs","rank":69,"score":204326.0138262545},{"content":"#[inline]\n\nfn half_btf(w0: i32, in0: i32, w1: i32, in1: i32, bit: usize) -> i32 {\n\n // Ensure defined behaviour for when w0*in0 + w1*in1 is negative and\n\n // overflows, but w0*in0 + w1*in1 + rounding isn't.\n\n let result = (w0 * in0).wrapping_add(w1 * in1);\n\n // Implement a version of round_shift with wrapping\n\n if bit == 0 {\n\n result\n\n } else {\n\n result.wrapping_add(1 << (bit - 1)) >> bit\n\n }\n\n}\n\n\n\n// clamps value to a signed integer type of bit bits\n","file_path":"src/transform/mod.rs","rank":70,"score":204019.70082845344},{"content":"pub fn select_dc_qi(quantizer: i64, bit_depth: usize) -> u8 {\n\n let qlookup = match bit_depth {\n\n 8 => &dc_qlookup_Q3,\n\n 10 => &dc_qlookup_10_Q3,\n\n 12 => &dc_qlookup_12_Q3,\n\n _ => unimplemented!(),\n\n };\n\n select_qi(quantizer, qlookup)\n\n}\n\n\n","file_path":"src/quantize.rs","rank":71,"score":202779.76034380615},{"content":"pub fn select_ac_qi(quantizer: i64, bit_depth: usize) -> u8 {\n\n let qlookup = match bit_depth {\n\n 8 => &ac_qlookup_Q3,\n\n 10 => &ac_qlookup_10_Q3,\n\n 12 => &ac_qlookup_12_Q3,\n\n _ => unimplemented!(),\n\n };\n\n select_qi(quantizer, qlookup)\n\n}\n\n\n\n#[derive(Debug, Default, Clone, Copy)]\n\npub struct QuantizationContext {\n\n log_tx_scale: usize,\n\n dc_quant: u32,\n\n dc_offset: u32,\n\n dc_mul_add: (u32, u32, u32),\n\n\n\n ac_quant: u32,\n\n ac_offset_eob: u32,\n\n ac_offset0: u32,\n\n ac_offset1: u32,\n\n ac_mul_add: (u32, u32, u32),\n\n}\n\n\n","file_path":"src/quantize.rs","rank":72,"score":202779.76034380615},{"content":"pub fn get_intra_edges<T: Pixel>(\n\n dst: &PlaneRegion<'_, T>,\n\n partition_bo: TileBlockOffset, // partition bo, BlockOffset\n\n bx: usize,\n\n by: usize,\n\n partition_size: BlockSize, // partition size, BlockSize\n\n po: PlaneOffset,\n\n tx_size: TxSize,\n\n bit_depth: usize,\n\n opt_mode: Option<PredictionMode>,\n\n enable_intra_edge_filter: bool,\n\n intra_param: IntraParam,\n\n) -> Aligned<[T; 4 * MAX_TX_SIZE + 1]> {\n\n let plane_cfg = &dst.plane_cfg;\n\n\n\n let mut edge_buf: Aligned<[T; 4 * MAX_TX_SIZE + 1]> =\n\n Aligned::uninitialized();\n\n //Aligned::new([T::cast_from(0); 4 * MAX_TX_SIZE + 1]);\n\n let base = 128u16 << (bit_depth - 8);\n\n\n","file_path":"src/partition.rs","rank":73,"score":200549.06437569138},{"content":"fn fill_frame<T: Pixel>(ra: &mut ChaChaRng, frame: &mut Frame<T>) {\n\n for plane in frame.planes.iter_mut() {\n\n let stride = plane.cfg.stride;\n\n for row in plane.data.chunks_mut(stride) {\n\n for pixel in row {\n\n let v: u8 = ra.gen();\n\n *pixel = T::cast_from(v);\n\n }\n\n }\n\n }\n\n}\n\n*/\n\n\n","file_path":"src/api/test.rs","rank":74,"score":200416.35806258649},{"content":"fn divu_gen(d: u32) -> (u32, u32, u32) {\n\n let nbits = (mem::size_of_val(&d) as u64) * 8;\n\n let m = nbits - d.leading_zeros() as u64 - 1;\n\n if (d & (d - 1)) == 0 {\n\n (0xFFFF_FFFF, 0xFFFF_FFFF, m as u32)\n\n } else {\n\n let d = d as u64;\n\n let t = (1u64 << (m + nbits)) / d;\n\n let r = (t * d + d) & ((1 << nbits) - 1);\n\n if r <= 1u64 << m {\n\n (t as u32 + 1, 0u32, m as u32)\n\n } else {\n\n (t as u32, t as u32, m as u32)\n\n }\n\n }\n\n}\n\n\n","file_path":"src/quantize.rs","rank":75,"score":200175.5160053877},{"content":"#[inline]\n\nfn divu_pair(x: u32, d: (u32, u32, u32)) -> u32 {\n\n let x = x as u64;\n\n let (a, b, shift) = d;\n\n let shift = shift as u64;\n\n let a = a as u64;\n\n let b = b as u64;\n\n\n\n (((a * x + b) >> 32) >> shift) as u32\n\n}\n\n\n","file_path":"src/quantize.rs","rank":76,"score":197933.1110698115},{"content":"fn rav1e_frame_pad_internal<T: rav1e::Pixel>(\n\n f: &mut Arc<rav1e::Frame<T>>, planes: usize, width: usize, height: usize,\n\n) {\n\n if let Some(ref mut input) = Arc::get_mut(f) {\n\n for plane in input.planes[..planes].iter_mut() {\n\n plane.pad(width, height);\n\n }\n\n }\n\n}\n\n\n","file_path":"src/capi.rs","rank":77,"score":195541.8710749186},{"content":"/// RDO-based transform type decision\n\n/// If cw_checkpoint is None, a checkpoint for cw's (ContextWriter) current\n\n/// state is created and stored for later use.\n\npub fn rdo_tx_type_decision<T: Pixel>(\n\n fi: &FrameInvariants<T>, ts: &mut TileStateMut<'_, T>,\n\n cw: &mut ContextWriter, cw_checkpoint: &mut Option<ContextWriterCheckpoint>,\n\n mode: PredictionMode, ref_frames: [RefType; 2], mvs: [MotionVector; 2],\n\n bsize: BlockSize, tile_bo: TileBlockOffset, tx_size: TxSize, tx_set: TxSet,\n\n tx_types: &[TxType],\n\n) -> (TxType, f64) {\n\n let mut best_type = TxType::DCT_DCT;\n\n let mut best_rd = std::f64::MAX;\n\n\n\n let PlaneConfig { xdec, ydec, .. } = ts.input.planes[1].cfg;\n\n let is_chroma_block =\n\n has_chroma(tile_bo, bsize, xdec, ydec, fi.sequence.chroma_sampling);\n\n\n\n let is_inter = !mode.is_intra();\n\n\n\n if cw_checkpoint.is_none() {\n\n // Only run the first call\n\n // Prevents creating multiple checkpoints for own version of cw\n\n *cw_checkpoint =\n","file_path":"src/rdo.rs","rank":78,"score":195486.85701483034},{"content":"pub fn rdo_tx_size_type<T: Pixel>(\n\n fi: &FrameInvariants<T>, ts: &mut TileStateMut<'_, T>,\n\n cw: &mut ContextWriter, bsize: BlockSize, tile_bo: TileBlockOffset,\n\n luma_mode: PredictionMode, ref_frames: [RefType; 2], mvs: [MotionVector; 2],\n\n skip: bool,\n\n) -> (TxSize, TxType) {\n\n let is_inter = !luma_mode.is_intra();\n\n let mut tx_size = max_txsize_rect_lookup[bsize as usize];\n\n\n\n if fi.enable_inter_txfm_split && is_inter && !skip {\n\n tx_size = sub_tx_size_map[tx_size as usize]; // Always choose one level split size\n\n }\n\n\n\n let mut best_tx_type = TxType::DCT_DCT;\n\n let mut best_tx_size = tx_size;\n\n let mut best_rd = std::f64::MAX;\n\n\n\n let do_rdo_tx_size =\n\n fi.tx_mode_select && fi.config.speed_settings.rdo_tx_decision && !is_inter;\n\n let rdo_tx_depth = if do_rdo_tx_size { 2 } else { 0 };\n","file_path":"src/rdo.rs","rank":79,"score":195472.0199249656},{"content":"pub fn ac_q(qindex: u8, delta_q: i8, bit_depth: usize) -> i16 {\n\n static AC_Q: [&[i16; 256]; 3] =\n\n [&ac_qlookup_Q3, &ac_qlookup_10_Q3, &ac_qlookup_12_Q3];\n\n let bd = ((bit_depth ^ 8) >> 1).min(2);\n\n AC_Q[bd][((qindex as isize + delta_q as isize).max(0) as usize).min(255)]\n\n}\n\n\n","file_path":"src/quantize.rs","rank":80,"score":195382.14882731467},{"content":"pub fn dc_q(qindex: u8, delta_q: i8, bit_depth: usize) -> i16 {\n\n static DC_Q: [&[i16; 256]; 3] =\n\n [&dc_qlookup_Q3, &dc_qlookup_10_Q3, &dc_qlookup_12_Q3];\n\n let bd = ((bit_depth ^ 8) >> 1).min(2);\n\n DC_Q[bd][((qindex as isize + delta_q as isize).max(0) as usize).min(255)]\n\n}\n\n\n","file_path":"src/quantize.rs","rank":81,"score":195382.14882731467},{"content":"fn fill_frame<T: Pixel>(ra: &mut ChaChaRng, frame: &mut Frame<T>) {\n\n for plane in frame.planes.iter_mut() {\n\n let stride = plane.cfg.stride;\n\n for row in plane.data.chunks_mut(stride) {\n\n for pixel in row {\n\n let v: u8 = ra.gen();\n\n *pixel = T::cast_from(v);\n\n }\n\n }\n\n }\n\n}\n\n\n","file_path":"src/test_encode_decode/mod.rs","rank":82,"score":194410.55302969326},{"content":"type ec_window = u32;\n\n\n","file_path":"src/ec.rs","rank":83,"score":192606.92506458805},{"content":"fn init_plane_u8(width: usize, height: usize, seed: u8) -> Plane<u8> {\n\n let mut ra = ChaChaRng::from_seed([seed; 32]);\n\n let data: Vec<u8> = (0..(width * height)).map(|_| ra.gen()).collect();\n\n Plane::from_slice(&data, width)\n\n}\n\n\n","file_path":"benches/rdo.rs","rank":84,"score":190868.59962770974},{"content":"// Compute Bessel filter coefficients with the specified delay.\n\n// Return: Filter parameters (c[0], c[1], g).\n\nfn iir_bessel2_get_parameters(delay: i32) -> (i32, i32, i32) {\n\n // This borrows some code from an unreleased version of Postfish.\n\n // See the recipe at http://unicorn.us.com/alex/2polefilters.html for details\n\n // on deriving the filter coefficients.\n\n // alpha is Q24\n\n let alpha = (1 << 24) / delay;\n\n // warp is 7.12 (5.12? the max value is 70386 in Q12).\n\n let warp = warp_alpha(alpha).max(1) as i64;\n\n // k1 is 9.12 (6.12?)\n\n let k1 = 3 * warp;\n\n // k2 is 16.24 (11.24?)\n\n let k2 = k1 * warp;\n\n // d is 16.15 (10.15?)\n\n let d = ((((1 << 12) + k1) << 12) + k2 + 256) >> 9;\n\n // a is 0.32, since d is larger than both 1.0 and k2\n\n let a = (k2 << 23) / d;\n\n // ik2 is 25.24\n\n let ik2 = (1i64 << 48) / k2;\n\n // b1 is Q56; in practice, the integer ranges between -2 and 2.\n\n let b1 = 2 * a * (ik2 - (1i64 << 24));\n","file_path":"src/rate.rs","rank":85,"score":190790.35262186598},{"content":"fn sub_pixel_me<T: Pixel>(\n\n fi: &FrameInvariants<T>, po: PlaneOffset, org_region: &PlaneRegion<T>,\n\n p_ref: &Plane<T>, lambda: u32, pmv: [MotionVector; 2], mvx_min: isize,\n\n mvx_max: isize, mvy_min: isize, mvy_max: isize, bsize: BlockSize,\n\n use_satd: bool, best: &mut MVSearchResult, ref_frame: RefType,\n\n) {\n\n subpel_diamond_me_search(\n\n fi,\n\n po,\n\n org_region,\n\n p_ref,\n\n fi.sequence.bit_depth,\n\n pmv,\n\n lambda,\n\n mvx_min,\n\n mvx_max,\n\n mvy_min,\n\n mvy_max,\n\n bsize,\n\n use_satd,\n\n best,\n\n ref_frame,\n\n );\n\n}\n\n\n","file_path":"src/me.rs","rank":86,"score":190230.17393205734},{"content":"fn full_pixel_me<T: Pixel>(\n\n fi: &FrameInvariants<T>, ts: &TileStateMut<'_, T>,\n\n org_region: &PlaneRegion<T>, p_ref: &Plane<T>, tile_bo: TileBlockOffset,\n\n po: PlaneOffset, lambda: u32, pmv: [MotionVector; 2], bsize: BlockSize,\n\n mvx_min: isize, mvx_max: isize, mvy_min: isize, mvy_max: isize,\n\n ref_frame: RefType, conf: &FullpelConfig,\n\n) -> FullpelSearchResult {\n\n let ssdec = conf.ssdec;\n\n\n\n let tile_me_stats = &ts.me_stats[ref_frame.to_index()].as_const();\n\n let frame_ref =\n\n fi.rec_buffer.frames[fi.ref_frames[0] as usize].as_ref().map(Arc::as_ref);\n\n let subsets = get_subset_predictors(\n\n tile_bo,\n\n tile_me_stats,\n\n frame_ref,\n\n ref_frame.to_index(),\n\n bsize,\n\n mvx_min,\n\n mvx_max,\n","file_path":"src/me.rs","rank":87,"score":190230.17393205734},{"content":"// alpha is Q24 in the range [0,0.5).\n\n// The return value is 5.12.\n\n// TODO: Mark const once we can use local variables in a const function.\n\nfn warp_alpha(alpha: i32) -> i32 {\n\n let i = ((alpha * 36) >> 24).min(16);\n\n let t0 = ROUGH_TAN_LOOKUP[i as usize];\n\n let t1 = ROUGH_TAN_LOOKUP[i as usize + 1];\n\n let d = alpha * 36 - (i << 24);\n\n ((((t0 as i64) << 32) + (((t1 - t0) << 8) as i64) * (d as i64)) >> 32) as i32\n\n}\n\n\n","file_path":"src/rate.rs","rank":88,"score":189947.58252319932},{"content":"#[inline]\n\nfn get_func_i32x8(t: TxfmType) -> TxfmFuncI32X8 {\n\n use self::TxfmType::*;\n\n match t {\n\n DCT4 => daala_fdct4,\n\n DCT8 => daala_fdct8,\n\n DCT16 => daala_fdct16,\n\n DCT32 => daala_fdct32,\n\n DCT64 => daala_fdct64,\n\n ADST4 => daala_fdst_vii_4,\n\n ADST8 => daala_fdst8,\n\n ADST16 => daala_fdst16,\n\n Identity4 => fidentity,\n\n Identity8 => fidentity,\n\n Identity16 => fidentity,\n\n Identity32 => fidentity,\n\n _ => unreachable!(),\n\n }\n\n}\n\n\n","file_path":"src/asm/x86/transform/forward.rs","rank":89,"score":189839.47796263182},{"content":"#[inline(always)]\n\npub fn msb(x: i32) -> i32 {\n\n debug_assert!(x > 0);\n\n 31 ^ (x.leading_zeros() as i32)\n\n}\n\n\n\n#[inline(always)]\n\npub const fn round_shift(value: i32, bit: usize) -> i32 {\n\n (value + (1 << bit >> 1)) >> bit\n\n}\n","file_path":"v_frame/src/math.rs","rank":90,"score":186721.4239129549},{"content":"pub fn call_inverse_func<T: Pixel>(\n\n func: InvTxfmFunc, input: &[T::Coeff], output: &mut PlaneRegionMut<'_, T>,\n\n eob: usize, width: usize, height: usize, bd: usize,\n\n) {\n\n debug_assert!(bd == 8);\n\n\n\n // Only use at most 32 columns and 32 rows of input coefficients.\n\n let input: &[T::Coeff] = &input[..width.min(32) * height.min(32)];\n\n\n\n let mut copied: Aligned<[T::Coeff; 32 * 32]> = Aligned::uninitialized();\n\n\n\n // Convert input to 16-bits.\n\n // TODO: Remove by changing inverse assembly to not overwrite its input\n\n for (a, b) in copied.data.iter_mut().zip(input) {\n\n *a = *b;\n\n }\n\n\n\n // perform the inverse transform\n\n unsafe {\n\n func(\n\n output.data_ptr_mut() as *mut _,\n\n output.plane_cfg.stride as isize,\n\n copied.data.as_mut_ptr() as *mut _,\n\n eob as i32,\n\n );\n\n }\n\n}\n\n\n","file_path":"src/asm/shared/transform/inverse.rs","rank":91,"score":186511.22307659712},{"content":"fn send_frame_kf<T: Pixel>(ctx: &mut Context<T>, keyframe: bool) {\n\n let input = ctx.new_frame();\n\n\n\n let frame_type_override =\n\n if keyframe { FrameTypeOverride::Key } else { FrameTypeOverride::No };\n\n\n\n let opaque = Some(Opaque::new(keyframe));\n\n\n\n let fp = FrameParameters { frame_type_override, opaque };\n\n\n\n let _ = ctx.send_frame((input, fp));\n\n}\n\n\n","file_path":"src/api/test.rs","rank":92,"score":185902.65905756078},{"content":"#[inline(always)]\n\npub fn mv_class_base(mv_class: usize) -> u32 {\n\n if mv_class != MV_CLASS_0 {\n\n (CLASS0_SIZE << (mv_class as usize + 2)) as u32\n\n } else {\n\n 0\n\n }\n\n}\n\n#[inline(always)]\n","file_path":"src/context/mod.rs","rank":93,"score":184776.1583678454},{"content":"fn init_buffers(size: usize) -> (Vec<i32>, Vec<i32>) {\n\n let mut ra = ChaChaRng::from_seed([0; 32]);\n\n let input: Vec<i32> = (0..size).map(|_| ra.gen()).collect();\n\n let output = vec![0i32; size];\n\n\n\n (input, output)\n\n}\n\n\n","file_path":"benches/transform.rs","rank":94,"score":183932.0327562734},{"content":"fn init_plane_u16(width: usize, height: usize) -> Plane<u16> {\n\n let mut ra = ChaChaRng::from_seed([0; 32]);\n\n let data: Vec<u16> = (0..(width * height)).map(|_| ra.gen()).collect();\n\n Plane::from_slice(&data, width)\n\n}\n\n\n","file_path":"benches/plane.rs","rank":95,"score":183841.9542159572},{"content":"#[inline]\n\nfn stride_sse(a: &[i32], b: &[i32]) -> i64 {\n\n let mut acc: i32 = 0;\n\n for (a, b) in a.iter().take(b.len()).zip(b) {\n\n acc += (*a - *b) * (*a - *b)\n\n }\n\n acc as i64\n\n}\n\n\n\n#[inline]\n\nconst fn _level_to_limit(level: i32, shift: usize) -> i32 {\n\n level << shift\n\n}\n\n\n\n#[inline]\n\nconst fn limit_to_level(limit: i32, shift: usize) -> i32 {\n\n (limit + (1 << shift) - 1) >> shift\n\n}\n\n\n\n#[inline]\n\nconst fn _level_to_blimit(level: i32, shift: usize) -> i32 {\n","file_path":"src/deblock.rs","rank":96,"score":183803.8154035632},{"content":"fn init_plane_u8(width: usize, height: usize) -> Plane<u8> {\n\n let mut ra = ChaChaRng::from_seed([0; 32]);\n\n let data: Vec<u8> = (0..(width * height)).map(|_| ra.gen()).collect();\n\n let out = Plane::from_slice(&data, width);\n\n if out.cfg.width % 2 == 0 && out.cfg.height % 2 == 0 {\n\n out\n\n } else {\n\n let xpad = out.cfg.width % 2;\n\n let ypad = out.cfg.height % 2;\n\n let mut padded =\n\n Plane::new(out.cfg.width, out.cfg.height, 0, 0, xpad, ypad);\n\n let mut padded_slice = padded.mut_slice(PlaneOffset { x: 0, y: 0 });\n\n for (dst_row, src_row) in padded_slice.rows_iter_mut().zip(out.rows_iter())\n\n {\n\n dst_row[..out.cfg.width].copy_from_slice(&src_row[..out.cfg.width]);\n\n }\n\n padded\n\n }\n\n}\n\n\n","file_path":"benches/plane.rs","rank":97,"score":183724.00849805426},{"content":"fn fill_plane<T: Pixel>(ra: &mut ChaChaRng, plane: &mut Plane<T>) {\n\n let stride = plane.cfg.stride;\n\n for row in plane.data_origin_mut().chunks_mut(stride) {\n\n for pixel in row {\n\n let v: u8 = ra.gen();\n\n *pixel = T::cast_from(v);\n\n }\n\n }\n\n}\n\n\n","file_path":"benches/mc.rs","rank":98,"score":183526.5366885428},{"content":"fn fill_plane<T: Pixel>(ra: &mut ChaChaRng, plane: &mut Plane<T>) {\n\n let stride = plane.cfg.stride;\n\n for row in plane.data_origin_mut().chunks_mut(stride) {\n\n for pixel in row {\n\n let v: u8 = ra.gen();\n\n *pixel = T::cast_from(v);\n\n }\n\n }\n\n}\n\n\n","file_path":"benches/dist.rs","rank":99,"score":183526.5366885428}],"string":"[\n {\n \"content\": \"type CdefDirHBDFn = unsafe extern fn(\\n\\n tmp: *const u16,\\n\\n tmp_stride: isize,\\n\\n var: *mut u32,\\n\\n bitdepth_max: i32,\\n\\n) -> i32;\\n\\n\\n\\n#[inline(always)]\\n\\n#[allow(clippy::let_and_return)]\\n\\npub(crate) fn cdef_find_dir<T: Pixel>(\\n\\n img: &PlaneSlice<'_, T>, var: &mut u32, coeff_shift: usize,\\n\\n cpu: CpuFeatureLevel,\\n\\n) -> i32 {\\n\\n let call_rust =\\n\\n |var: &mut u32| rust::cdef_find_dir::<T>(img, var, coeff_shift, cpu);\\n\\n\\n\\n #[cfg(feature = \\\"check_asm\\\")]\\n\\n let (ref_dir, ref_var) = {\\n\\n let mut var: u32 = 0;\\n\\n let dir = call_rust(&mut var);\\n\",\n \"file_path\": \"src/asm/x86/cdef.rs\",\n \"rank\": 2,\n \"score\": 339233.4814169615\n },\n {\n \"content\": \"type InvTxfmFn = fn(input: &[i32], output: &mut [i32], range: usize);\\n\\n\\n\\nstatic INV_TXFM_FNS: [[InvTxfmFn; 5]; 4] = [\\n\\n [av1_idct4, av1_idct8, av1_idct16, av1_idct32, av1_idct64],\\n\\n [\\n\\n av1_iadst4,\\n\\n av1_iadst8,\\n\\n av1_iadst16,\\n\\n |_, _, _| unimplemented!(),\\n\\n |_, _, _| unimplemented!(),\\n\\n ],\\n\\n [\\n\\n av1_iflipadst4,\\n\\n av1_iflipadst8,\\n\\n av1_iflipadst16,\\n\\n |_, _, _| unimplemented!(),\\n\\n |_, _, _| unimplemented!(),\\n\\n ],\\n\\n [\\n\\n av1_iidentity4,\\n\",\n \"file_path\": \"src/transform/inverse.rs\",\n \"rank\": 4,\n \"score\": 315219.2659027902\n },\n {\n \"content\": \"type TxfmFuncI32X8 = unsafe fn(&mut [I32X8]);\\n\\n\\n\",\n \"file_path\": \"src/asm/x86/transform/forward.rs\",\n \"rank\": 5,\n \"score\": 314686.39609474444\n },\n {\n \"content\": \"type CdefFilterFn = unsafe extern fn(\\n\\n dst: *mut u8,\\n\\n dst_stride: isize,\\n\\n tmp: *const u16,\\n\\n tmp_stride: isize,\\n\\n pri_strength: i32,\\n\\n sec_strength: i32,\\n\\n dir: i32,\\n\\n damping: i32,\\n\\n);\\n\\n\\n\",\n \"file_path\": \"src/asm/x86/cdef.rs\",\n \"rank\": 7,\n \"score\": 309037.9625222234\n },\n {\n \"content\": \"type CdefFilterHBDFn = unsafe extern fn(\\n\\n dst: *mut u16,\\n\\n dst_stride: isize,\\n\\n tmp: *const u16,\\n\\n tmp_stride: isize,\\n\\n pri_strength: i32,\\n\\n sec_strength: i32,\\n\\n dir: i32,\\n\\n damping: i32,\\n\\n bitdepth_max: i32,\\n\\n);\\n\\n\\n\\n#[inline(always)]\\n\\nconst fn decimate_index(xdec: usize, ydec: usize) -> usize {\\n\\n ((ydec << 1) | xdec) & 3\\n\\n}\\n\\n\\n\\npub(crate) unsafe fn cdef_filter_block<T: Pixel>(\\n\\n dst: &mut PlaneRegionMut<'_, T>, src: *const T, src_stride: isize,\\n\\n pri_strength: i32, sec_strength: i32, dir: usize, damping: i32,\\n\",\n \"file_path\": \"src/asm/x86/cdef.rs\",\n \"rank\": 8,\n \"score\": 303521.3347403819\n },\n {\n \"content\": \"type PutFn = unsafe extern fn(\\n\\n dst: *mut u8,\\n\\n dst_stride: isize,\\n\\n src: *const u8,\\n\\n src_stride: isize,\\n\\n width: i32,\\n\\n height: i32,\\n\\n col_frac: i32,\\n\\n row_frac: i32,\\n\\n);\\n\\n\\n\",\n \"file_path\": \"src/asm/aarch64/mc.rs\",\n \"rank\": 10,\n \"score\": 281639.66944238666\n },\n {\n \"content\": \"type PrepFn = unsafe extern fn(\\n\\n tmp: *mut i16,\\n\\n src: *const u8,\\n\\n src_stride: isize,\\n\\n width: i32,\\n\\n height: i32,\\n\\n col_frac: i32,\\n\\n row_frac: i32,\\n\\n);\\n\\n\\n\",\n \"file_path\": \"src/asm/x86/mc.rs\",\n \"rank\": 11,\n \"score\": 281639.66944238666\n },\n {\n \"content\": \"type AvgFn = unsafe extern fn(\\n\\n dst: *mut u8,\\n\\n dst_stride: isize,\\n\\n tmp1: *const i16,\\n\\n tmp2: *const i16,\\n\\n width: i32,\\n\\n height: i32,\\n\\n);\\n\\n\\n\",\n \"file_path\": \"src/asm/x86/mc.rs\",\n \"rank\": 12,\n \"score\": 281639.66944238666\n },\n {\n \"content\": \"type SadFn = unsafe extern fn(\\n\\n src: *const u8,\\n\\n src_stride: isize,\\n\\n dst: *const u8,\\n\\n dst_stride: isize,\\n\\n) -> u32;\\n\\n\\n\\nmacro_rules! declare_asm_dist_fn {\\n\\n ($(($name: ident, $T: ident)),+) => (\\n\\n $(\\n\\n extern { fn $name (\\n\\n src: *const $T, src_stride: isize, dst: *const $T, dst_stride: isize\\n\\n ) -> u32; }\\n\\n )+\\n\\n )\\n\\n}\\n\\n\\n\\ndeclare_asm_dist_fn![\\n\\n (rav1e_sad4x4_neon, u8),\\n\\n (rav1e_sad4x8_neon, u8),\\n\",\n \"file_path\": \"src/asm/aarch64/dist.rs\",\n \"rank\": 13,\n \"score\": 281639.66944238666\n },\n {\n \"content\": \"type PutFn = unsafe extern fn(\\n\\n dst: *mut u8,\\n\\n dst_stride: isize,\\n\\n src: *const u8,\\n\\n src_stride: isize,\\n\\n width: i32,\\n\\n height: i32,\\n\\n col_frac: i32,\\n\\n row_frac: i32,\\n\\n);\\n\\n\\n\",\n \"file_path\": \"src/asm/x86/mc.rs\",\n \"rank\": 14,\n \"score\": 281639.66944238666\n },\n {\n \"content\": \"type AvgFn = unsafe extern fn(\\n\\n dst: *mut u8,\\n\\n dst_stride: isize,\\n\\n tmp1: *const i16,\\n\\n tmp2: *const i16,\\n\\n width: i32,\\n\\n height: i32,\\n\\n);\\n\\n\\n\",\n \"file_path\": \"src/asm/aarch64/mc.rs\",\n \"rank\": 15,\n \"score\": 281639.66944238666\n },\n {\n \"content\": \"type PrepFn = unsafe extern fn(\\n\\n tmp: *mut i16,\\n\\n src: *const u8,\\n\\n src_stride: isize,\\n\\n width: i32,\\n\\n height: i32,\\n\\n col_frac: i32,\\n\\n row_frac: i32,\\n\\n);\\n\\n\\n\",\n \"file_path\": \"src/asm/aarch64/mc.rs\",\n \"rank\": 16,\n \"score\": 281639.66944238666\n },\n {\n \"content\": \"type FrameOpaqueCb = Option<extern fn(*mut c_void)>;\\n\\n\\n\",\n \"file_path\": \"src/capi.rs\",\n \"rank\": 17,\n \"score\": 280774.34508468123\n },\n {\n \"content\": \"type PutHBDFn = unsafe extern fn(\\n\\n dst: *mut u16,\\n\\n dst_stride: isize,\\n\\n src: *const u16,\\n\\n src_stride: isize,\\n\\n width: i32,\\n\\n height: i32,\\n\\n col_frac: i32,\\n\\n row_frac: i32,\\n\\n bitdepth_max: i32,\\n\\n);\\n\\n\\n\",\n \"file_path\": \"src/asm/x86/mc.rs\",\n \"rank\": 18,\n \"score\": 275762.42419201735\n },\n {\n \"content\": \"type PrepHBDFn = unsafe extern fn(\\n\\n tmp: *mut i16,\\n\\n src: *const u16,\\n\\n src_stride: isize,\\n\\n width: i32,\\n\\n height: i32,\\n\\n col_frac: i32,\\n\\n row_frac: i32,\\n\\n bitdepth_max: i32,\\n\\n);\\n\\n\\n\",\n \"file_path\": \"src/asm/x86/mc.rs\",\n \"rank\": 19,\n \"score\": 275762.42419201735\n },\n {\n \"content\": \"type PutHBDFn = unsafe extern fn(\\n\\n dst: *mut u16,\\n\\n dst_stride: isize,\\n\\n src: *const u16,\\n\\n src_stride: isize,\\n\\n width: i32,\\n\\n height: i32,\\n\\n col_frac: i32,\\n\\n row_frac: i32,\\n\\n bitdepth_max: i32,\\n\\n);\\n\\n\\n\",\n \"file_path\": \"src/asm/aarch64/mc.rs\",\n \"rank\": 20,\n \"score\": 275762.42419201735\n },\n {\n \"content\": \"type AvgHBDFn = unsafe extern fn(\\n\\n dst: *mut u16,\\n\\n dst_stride: isize,\\n\\n tmp1: *const i16,\\n\\n tmp2: *const i16,\\n\\n width: i32,\\n\\n height: i32,\\n\\n bitdepth_max: i32,\\n\\n);\\n\\n\\n\\n// gets an index that can be mapped to a function for a pair of filter modes\\n\\n#[inline]\\n\\nconst fn get_2d_mode_idx(mode_x: FilterMode, mode_y: FilterMode) -> usize {\\n\\n (mode_x as usize + 4 * (mode_y as usize)) & 15\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/asm/aarch64/mc.rs\",\n \"rank\": 21,\n \"score\": 275762.42419201735\n },\n {\n \"content\": \"type AvgHBDFn = unsafe extern fn(\\n\\n dst: *mut u16,\\n\\n dst_stride: isize,\\n\\n tmp1: *const i16,\\n\\n tmp2: *const i16,\\n\\n width: i32,\\n\\n height: i32,\\n\\n bitdepth_max: i32,\\n\\n);\\n\\n\\n\\n// gets an index that can be mapped to a function for a pair of filter modes\\n\\n#[inline]\\n\\nconst fn get_2d_mode_idx(mode_x: FilterMode, mode_y: FilterMode) -> usize {\\n\\n (mode_x as usize + 4 * (mode_y as usize)) & 15\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/asm/x86/mc.rs\",\n \"rank\": 22,\n \"score\": 275762.42419201735\n },\n {\n \"content\": \"type PrepHBDFn = unsafe extern fn(\\n\\n tmp: *mut i16,\\n\\n src: *const u16,\\n\\n src_stride: isize,\\n\\n width: i32,\\n\\n height: i32,\\n\\n col_frac: i32,\\n\\n row_frac: i32,\\n\\n bitdepth_max: i32,\\n\\n);\\n\\n\\n\",\n \"file_path\": \"src/asm/aarch64/mc.rs\",\n \"rank\": 23,\n \"score\": 275762.42419201735\n },\n {\n \"content\": \"#[inline(always)]\\n\\npub fn update_cdf(cdf: &mut [u16], val: u32) {\\n\\n if cdf.len() == 4 {\\n\\n return unsafe {\\n\\n update_cdf_4_sse2(cdf, val);\\n\\n };\\n\\n }\\n\\n\\n\\n rust::update_cdf(cdf, val);\\n\\n}\\n\\n\\n\\n#[target_feature(enable = \\\"sse2\\\")]\\n\\n#[inline]\\n\\nunsafe fn update_cdf_4_sse2(cdf: &mut [u16], val: u32) {\\n\\n let nsymbs = 4;\\n\\n let rate = 5 + (cdf[nsymbs - 1] >> 4) as usize;\\n\\n let count = cdf[nsymbs - 1] + (cdf[nsymbs - 1] < 32) as u16;\\n\\n\\n\\n // A bit of explanation of what is happening down here. First of all, let's look at the simple\\n\\n // implementation:\\n\\n //\\n\",\n \"file_path\": \"src/asm/x86/ec.rs\",\n \"rank\": 24,\n \"score\": 264691.6191634583\n },\n {\n \"content\": \"#[inline(never)]\\n\\nfn variance_8x8<T: Pixel>(src: &PlaneRegion<'_, T>) -> u32 {\\n\\n debug_assert!(src.plane_cfg.xdec == 0);\\n\\n debug_assert!(src.plane_cfg.ydec == 0);\\n\\n\\n\\n // Sum into columns to improve auto-vectorization\\n\\n let mut sum_s_cols: [u16; 8] = [0; 8];\\n\\n let mut sum_s2_cols: [u32; 8] = [0; 8];\\n\\n\\n\\n // Check upfront that 8 rows are available.\\n\\n let _row = &src[7];\\n\\n\\n\\n for j in 0..8 {\\n\\n let row = &src[j][0..8];\\n\\n for (sum_s, sum_s2, s) in izip!(&mut sum_s_cols, &mut sum_s2_cols, row) {\\n\\n // Don't convert directly to u32 to allow better vectorization\\n\\n let s: u16 = u16::cast_from(*s);\\n\\n *sum_s += s;\\n\\n\\n\\n // Convert to u32 to avoid overflows when multiplying\\n\\n let s: u32 = s as u32;\\n\",\n \"file_path\": \"src/activity.rs\",\n \"rank\": 25,\n \"score\": 263612.36073993624\n },\n {\n \"content\": \"#[inline(always)]\\n\\npub fn get_mv_class(z: u32, offset: &mut u32) -> usize {\\n\\n let c = if z >= CLASS0_SIZE as u32 * 4096 {\\n\\n MV_CLASS_10\\n\\n } else {\\n\\n log_in_base_2(z >> 3) as usize\\n\\n };\\n\\n\\n\\n *offset = z - mv_class_base(c);\\n\\n c\\n\\n}\\n\\n\\n\\nimpl<'a> ContextWriter<'a> {\\n\\n pub fn encode_mv_component<W: Writer>(\\n\\n &mut self, w: &mut W, comp: i32, axis: usize, precision: MvSubpelPrecision,\\n\\n ) {\\n\\n assert!(comp != 0);\\n\\n assert!(MV_LOW <= comp && comp <= MV_UPP);\\n\\n let mvcomp = &mut self.fc.nmv_context.comps[axis];\\n\\n let mut offset: u32 = 0;\\n\\n let sign: u32 = if comp < 0 { 1 } else { 0 };\\n\",\n \"file_path\": \"src/context/mod.rs\",\n \"rank\": 26,\n \"score\": 257373.02845419705\n },\n {\n \"content\": \"fn av1_idct32(input: &[i32], output: &mut [i32], range: usize) {\\n\\n assert!(input.len() >= 32);\\n\\n assert!(output.len() >= 32);\\n\\n\\n\\n // stage 1;\\n\\n let stg1 = [\\n\\n input[0], input[16], input[8], input[24], input[4], input[20], input[12],\\n\\n input[28], input[2], input[18], input[10], input[26], input[6], input[22],\\n\\n input[14], input[30], input[1], input[17], input[9], input[25], input[5],\\n\\n input[21], input[13], input[29], input[3], input[19], input[11],\\n\\n input[27], input[7], input[23], input[15], input[31],\\n\\n ];\\n\\n\\n\\n // stage 2\\n\\n let stg2 = [\\n\\n stg1[0],\\n\\n stg1[1],\\n\\n stg1[2],\\n\\n stg1[3],\\n\\n stg1[4],\\n\",\n \"file_path\": \"src/transform/inverse.rs\",\n \"rank\": 27,\n \"score\": 257075.13247083267\n },\n {\n \"content\": \"#[inline(always)]\\n\\nfn av1_iadst16(input: &[i32], output: &mut [i32], range: usize) {\\n\\n assert!(input.len() >= 16);\\n\\n assert!(output.len() >= 16);\\n\\n\\n\\n // stage 1\\n\\n let stg1 = [\\n\\n input[15], input[0], input[13], input[2], input[11], input[4], input[9],\\n\\n input[6], input[7], input[8], input[5], input[10], input[3], input[12],\\n\\n input[1], input[14],\\n\\n ];\\n\\n\\n\\n // stage 2\\n\\n let stg2 = [\\n\\n half_btf(COSPI_INV[2], stg1[0], COSPI_INV[62], stg1[1], INV_COS_BIT),\\n\\n half_btf(COSPI_INV[62], stg1[0], -COSPI_INV[2], stg1[1], INV_COS_BIT),\\n\\n half_btf(COSPI_INV[10], stg1[2], COSPI_INV[54], stg1[3], INV_COS_BIT),\\n\\n half_btf(COSPI_INV[54], stg1[2], -COSPI_INV[10], stg1[3], INV_COS_BIT),\\n\\n half_btf(COSPI_INV[18], stg1[4], COSPI_INV[46], stg1[5], INV_COS_BIT),\\n\\n half_btf(COSPI_INV[46], stg1[4], -COSPI_INV[18], stg1[5], INV_COS_BIT),\\n\\n half_btf(COSPI_INV[26], stg1[6], COSPI_INV[38], stg1[7], INV_COS_BIT),\\n\",\n \"file_path\": \"src/transform/inverse.rs\",\n \"rank\": 28,\n \"score\": 257075.13247083267\n },\n {\n \"content\": \"fn av1_idct16(input: &[i32], output: &mut [i32], range: usize) {\\n\\n assert!(input.len() >= 16);\\n\\n assert!(output.len() >= 16);\\n\\n\\n\\n // call idct8\\n\\n let temp_in = [\\n\\n input[0], input[2], input[4], input[6], input[8], input[10], input[12],\\n\\n input[14],\\n\\n ];\\n\\n let mut temp_out: [i32; 8] = [0; 8];\\n\\n av1_idct8(&temp_in, &mut temp_out, range);\\n\\n\\n\\n // stage 1\\n\\n let stg1 = [\\n\\n input[1], input[9], input[5], input[13], input[3], input[11], input[7],\\n\\n input[15],\\n\\n ];\\n\\n\\n\\n // stage 2\\n\\n let stg2 = [\\n\",\n \"file_path\": \"src/transform/inverse.rs\",\n \"rank\": 29,\n \"score\": 257075.13247083267\n },\n {\n \"content\": \"fn av1_iidentity16(input: &[i32], output: &mut [i32], _range: usize) {\\n\\n output[..16]\\n\\n .iter_mut()\\n\\n .zip(input[..16].iter())\\n\\n .for_each(|(outp, inp)| *outp = round_shift(SQRT2 * 2 * *inp, 12));\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/transform/inverse.rs\",\n \"rank\": 30,\n \"score\": 257075.13247083267\n },\n {\n \"content\": \"fn av1_iidentity32(input: &[i32], output: &mut [i32], _range: usize) {\\n\\n output[..32]\\n\\n .iter_mut()\\n\\n .zip(input[..32].iter())\\n\\n .for_each(|(outp, inp)| *outp = 4 * *inp);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/transform/inverse.rs\",\n \"rank\": 31,\n \"score\": 257075.13247083267\n },\n {\n \"content\": \"fn av1_idct64(input: &[i32], output: &mut [i32], range: usize) {\\n\\n assert!(input.len() >= 64);\\n\\n assert!(output.len() >= 64);\\n\\n\\n\\n // stage 1;\\n\\n let stg1 = [\\n\\n input[0], input[32], input[16], input[48], input[8], input[40], input[24],\\n\\n input[56], input[4], input[36], input[20], input[52], input[12],\\n\\n input[44], input[28], input[60], input[2], input[34], input[18],\\n\\n input[50], input[10], input[42], input[26], input[58], input[6],\\n\\n input[38], input[22], input[54], input[14], input[46], input[30],\\n\\n input[62], input[1], input[33], input[17], input[49], input[9], input[41],\\n\\n input[25], input[57], input[5], input[37], input[21], input[53],\\n\\n input[13], input[45], input[29], input[61], input[3], input[35],\\n\\n input[19], input[51], input[11], input[43], input[27], input[59],\\n\\n input[7], input[39], input[23], input[55], input[15], input[47],\\n\\n input[31], input[63],\\n\\n ];\\n\\n\\n\\n // stage 2\\n\",\n \"file_path\": \"src/transform/inverse.rs\",\n \"rank\": 32,\n \"score\": 257075.13247083267\n },\n {\n \"content\": \"#[inline]\\n\\nfn adjust_strength(strength: i32, var: i32) -> i32 {\\n\\n let i = if (var >> 6) != 0 { cmp::min(msb(var >> 6), 12) } else { 0 };\\n\\n if var != 0 {\\n\\n (strength * (4 + i) + 8) >> 4\\n\\n } else {\\n\\n 0\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/cdef.rs\",\n \"rank\": 33,\n \"score\": 256824.279595226\n },\n {\n \"content\": \"#[inline]\\n\\nfn copysign(value: u32, signed: i32) -> i32 {\\n\\n if signed < 0 {\\n\\n -(value as i32)\\n\\n } else {\\n\\n value as i32\\n\\n }\\n\\n}\\n\\n\\n\\n#[cfg(test)]\\n\\nmod test {\\n\\n use super::*;\\n\\n use crate::transform::TxSize::*;\\n\\n\\n\\n #[test]\\n\\n fn test_divu_pair() {\\n\\n for d in 1..1024 {\\n\\n for x in 0..1000 {\\n\\n let ab = divu_gen(d as u32);\\n\\n assert_eq!(x / d, divu_pair(x, ab));\\n\\n }\\n\",\n \"file_path\": \"src/quantize.rs\",\n \"rank\": 34,\n \"score\": 249160.12390556786\n },\n {\n \"content\": \"pub fn av1_iflipadst8(input: &[i32], output: &mut [i32], range: usize) {\\n\\n av1_iadst8(input, output, range);\\n\\n output[..8].reverse();\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/transform/inverse.rs\",\n \"rank\": 35,\n \"score\": 248709.87332792315\n },\n {\n \"content\": \"pub fn av1_iidentity8(input: &[i32], output: &mut [i32], _range: usize) {\\n\\n output[..8]\\n\\n .iter_mut()\\n\\n .zip(input[..8].iter())\\n\\n .for_each(|(outp, inp)| *outp = 2 * *inp);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/transform/inverse.rs\",\n \"rank\": 36,\n \"score\": 248709.87332792315\n },\n {\n \"content\": \"pub fn av1_iflipadst4(input: &[i32], output: &mut [i32], range: usize) {\\n\\n av1_iadst4(input, output, range);\\n\\n output[..4].reverse();\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/transform/inverse.rs\",\n \"rank\": 37,\n \"score\": 248709.87332792315\n },\n {\n \"content\": \"#[inline(always)]\\n\\npub fn av1_iadst8(input: &[i32], output: &mut [i32], range: usize) {\\n\\n assert!(input.len() >= 8);\\n\\n assert!(output.len() >= 8);\\n\\n\\n\\n // stage 1\\n\\n let stg1 = [\\n\\n input[7], input[0], input[5], input[2], input[3], input[4], input[1],\\n\\n input[6],\\n\\n ];\\n\\n\\n\\n // stage 2\\n\\n let stg2 = [\\n\\n half_btf(COSPI_INV[4], stg1[0], COSPI_INV[60], stg1[1], INV_COS_BIT),\\n\\n half_btf(COSPI_INV[60], stg1[0], -COSPI_INV[4], stg1[1], INV_COS_BIT),\\n\\n half_btf(COSPI_INV[20], stg1[2], COSPI_INV[44], stg1[3], INV_COS_BIT),\\n\\n half_btf(COSPI_INV[44], stg1[2], -COSPI_INV[20], stg1[3], INV_COS_BIT),\\n\\n half_btf(COSPI_INV[36], stg1[4], COSPI_INV[28], stg1[5], INV_COS_BIT),\\n\\n half_btf(COSPI_INV[28], stg1[4], -COSPI_INV[36], stg1[5], INV_COS_BIT),\\n\\n half_btf(COSPI_INV[52], stg1[6], COSPI_INV[12], stg1[7], INV_COS_BIT),\\n\\n half_btf(COSPI_INV[12], stg1[6], -COSPI_INV[52], stg1[7], INV_COS_BIT),\\n\",\n \"file_path\": \"src/transform/inverse.rs\",\n \"rank\": 38,\n \"score\": 248709.87332792315\n },\n {\n \"content\": \"#[inline(always)]\\n\\npub fn av1_iadst4(input: &[i32], output: &mut [i32], _range: usize) {\\n\\n assert!(input.len() >= 4);\\n\\n assert!(output.len() >= 4);\\n\\n\\n\\n let bit = 12;\\n\\n\\n\\n let x0 = input[0];\\n\\n let x1 = input[1];\\n\\n let x2 = input[2];\\n\\n let x3 = input[3];\\n\\n\\n\\n // stage 1\\n\\n let s0 = SINPI_INV[1] * x0;\\n\\n let s1 = SINPI_INV[2] * x0;\\n\\n let s2 = SINPI_INV[3] * x1;\\n\\n let s3 = SINPI_INV[4] * x2;\\n\\n let s4 = SINPI_INV[1] * x2;\\n\\n let s5 = SINPI_INV[2] * x3;\\n\\n let s6 = SINPI_INV[4] * x3;\\n\\n\\n\",\n \"file_path\": \"src/transform/inverse.rs\",\n \"rank\": 39,\n \"score\": 248709.87332792315\n },\n {\n \"content\": \"pub fn av1_iflipadst16(input: &[i32], output: &mut [i32], range: usize) {\\n\\n av1_iadst16(input, output, range);\\n\\n output[..16].reverse();\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/transform/inverse.rs\",\n \"rank\": 40,\n \"score\": 248709.87332792315\n },\n {\n \"content\": \"pub fn av1_idct8(input: &[i32], output: &mut [i32], range: usize) {\\n\\n assert!(input.len() >= 8);\\n\\n assert!(output.len() >= 8);\\n\\n\\n\\n // call idct4\\n\\n let temp_in = [input[0], input[2], input[4], input[6]];\\n\\n let mut temp_out: [i32; 4] = [0; 4];\\n\\n av1_idct4(&temp_in, &mut temp_out, range);\\n\\n\\n\\n // stage 0\\n\\n\\n\\n // stage 1\\n\\n let stg1 = [input[1], input[5], input[3], input[7]];\\n\\n\\n\\n // stage 2\\n\\n let stg2 = [\\n\\n half_btf(COSPI_INV[56], stg1[0], -COSPI_INV[8], stg1[3], INV_COS_BIT),\\n\\n half_btf(COSPI_INV[24], stg1[1], -COSPI_INV[40], stg1[2], INV_COS_BIT),\\n\\n half_btf(COSPI_INV[40], stg1[1], COSPI_INV[24], stg1[2], INV_COS_BIT),\\n\\n half_btf(COSPI_INV[8], stg1[0], COSPI_INV[56], stg1[3], INV_COS_BIT),\\n\",\n \"file_path\": \"src/transform/inverse.rs\",\n \"rank\": 41,\n \"score\": 248709.87332792315\n },\n {\n \"content\": \"pub fn av1_iidentity4(input: &[i32], output: &mut [i32], _range: usize) {\\n\\n output[..4]\\n\\n .iter_mut()\\n\\n .zip(input[..4].iter())\\n\\n .for_each(|(outp, inp)| *outp = round_shift(SQRT2 * *inp, 12));\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/transform/inverse.rs\",\n \"rank\": 42,\n \"score\": 248709.87332792315\n },\n {\n \"content\": \"pub fn av1_idct4(input: &[i32], output: &mut [i32], range: usize) {\\n\\n assert!(input.len() >= 4);\\n\\n assert!(output.len() >= 4);\\n\\n\\n\\n // stage 1\\n\\n let stg1 = [input[0], input[2], input[1], input[3]];\\n\\n\\n\\n // stage 2\\n\\n let stg2 = [\\n\\n half_btf(COSPI_INV[32], stg1[0], COSPI_INV[32], stg1[1], INV_COS_BIT),\\n\\n half_btf(COSPI_INV[32], stg1[0], -COSPI_INV[32], stg1[1], INV_COS_BIT),\\n\\n half_btf(COSPI_INV[48], stg1[2], -COSPI_INV[16], stg1[3], INV_COS_BIT),\\n\\n half_btf(COSPI_INV[16], stg1[2], COSPI_INV[48], stg1[3], INV_COS_BIT),\\n\\n ];\\n\\n\\n\\n // stage 3\\n\\n output[0] = clamp_value(stg2[0] + stg2[3], range);\\n\\n output[1] = clamp_value(stg2[1] + stg2[2], range);\\n\\n output[2] = clamp_value(stg2[1] - stg2[2], range);\\n\\n output[3] = clamp_value(stg2[0] - stg2[3], range);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/transform/inverse.rs\",\n \"rank\": 43,\n \"score\": 248709.87332792315\n },\n {\n \"content\": \"// If n != 0, returns the floor of log base 2 of n. If n == 0, returns 0.\\n\\npub fn log_in_base_2(n: u32) -> u8 {\\n\\n 31 - cmp::min(31, n.leading_zeros() as u8)\\n\\n}\\n\",\n \"file_path\": \"src/context/mod.rs\",\n \"rank\": 44,\n \"score\": 230091.78580263283\n },\n {\n \"content\": \"type CdefDirLBDFn =\\n\\n unsafe extern fn(tmp: *const u8, tmp_stride: isize, var: *mut u32) -> i32;\\n\",\n \"file_path\": \"src/asm/x86/cdef.rs\",\n \"rank\": 45,\n \"score\": 224722.3418881266\n },\n {\n \"content\": \"type DequantizeFn = unsafe fn(\\n\\n qindex: u8,\\n\\n coeffs_ptr: *const i16,\\n\\n _eob: usize,\\n\\n rcoeffs_ptr: *mut i16,\\n\\n tx_size: TxSize,\\n\\n bit_depth: usize,\\n\\n dc_delta_q: i8,\\n\\n ac_delta_q: i8,\\n\\n);\\n\\n\\n\\ncpu_function_lookup_table!(\\n\\n DEQUANTIZE_FNS: [Option<DequantizeFn>],\\n\\n default: None,\\n\\n [(AVX2, Some(dequantize_avx2))]\\n\\n);\\n\\n\\n\",\n \"file_path\": \"src/asm/x86/quantize.rs\",\n \"rank\": 47,\n \"score\": 219185.44724800315\n },\n {\n \"content\": \"fn fill_frame_const<T: Pixel>(frame: &mut Frame<T>, value: T) {\\n\\n for plane in frame.planes.iter_mut() {\\n\\n let stride = plane.cfg.stride;\\n\\n for row in plane.data.chunks_mut(stride) {\\n\\n for pixel in row {\\n\\n *pixel = value;\\n\\n }\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\n#[cfg(feature = \\\"channel-api\\\")]\\n\\nmod channel {\\n\\n use super::*;\\n\\n\\n\\n #[interpolate_test(low_latency_no_scene_change, true, true)]\\n\\n #[interpolate_test(reorder_no_scene_change, false, true)]\\n\\n #[interpolate_test(low_latency_scene_change_detection, true, false)]\\n\\n #[interpolate_test(reorder_scene_change_detection, false, false)]\\n\\n fn flush(low_lantency: bool, no_scene_detection: bool) {\\n\",\n \"file_path\": \"src/api/test.rs\",\n \"rank\": 48,\n \"score\": 218428.5430597763\n },\n {\n \"content\": \"#[inline]\\n\\nfn nhev4(p1: i32, p0: i32, q0: i32, q1: i32, shift: usize) -> usize {\\n\\n thresh_to_level(cmp::max((p1 - p0).abs(), (q1 - q0).abs()), shift) as usize\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/deblock.rs\",\n \"rank\": 49,\n \"score\": 217783.75359949557\n },\n {\n \"content\": \"#[inline]\\n\\nfn mask4(p1: i32, p0: i32, q0: i32, q1: i32, shift: usize) -> usize {\\n\\n cmp::max(\\n\\n limit_to_level(cmp::max((p1 - p0).abs(), (q1 - q0).abs()), shift),\\n\\n blimit_to_level((p0 - q0).abs() * 2 + (p1 - q1).abs() / 2, shift),\\n\\n ) as usize\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/deblock.rs\",\n \"rank\": 50,\n \"score\": 217783.75359949557\n },\n {\n \"content\": \"fn sse_v_edge<T: Pixel>(\\n\\n blocks: &TileBlocks, bo: TileBlockOffset, rec_plane: &PlaneRegion<T>,\\n\\n src_plane: &PlaneRegion<T>, tally: &mut [i64; MAX_LOOP_FILTER + 2],\\n\\n pli: usize, bd: usize, xdec: usize, ydec: usize,\\n\\n) {\\n\\n let block = &blocks[bo];\\n\\n let txsize = if pli == 0 {\\n\\n block.txsize\\n\\n } else {\\n\\n block.bsize.largest_chroma_tx_size(xdec, ydec)\\n\\n };\\n\\n let tx_edge = bo.0.x >> xdec & (txsize.width_mi() - 1) == 0;\\n\\n if tx_edge {\\n\\n let prev_block = deblock_left(blocks, bo, rec_plane);\\n\\n let block_edge = bo.0.x & (block.n4_w as usize - 1) == 0;\\n\\n let filter_size =\\n\\n deblock_size(block, prev_block, rec_plane, pli, true, block_edge);\\n\\n if filter_size > 0 {\\n\\n let po = bo.plane_offset(rec_plane.plane_cfg); // rec and src have identical subsampling\\n\\n let rec_region = rec_plane.subregion(Area::Rect {\\n\",\n \"file_path\": \"src/deblock.rs\",\n \"rank\": 51,\n \"score\": 215568.60132778808\n },\n {\n \"content\": \"fn filter_h_edge<T: Pixel>(\\n\\n deblock: &DeblockState, blocks: &TileBlocks, bo: TileBlockOffset,\\n\\n p: &mut PlaneRegionMut<T>, pli: usize, bd: usize, xdec: usize, ydec: usize,\\n\\n) {\\n\\n let block = &blocks[bo];\\n\\n let txsize = if pli == 0 {\\n\\n block.txsize\\n\\n } else {\\n\\n block.bsize.largest_chroma_tx_size(xdec, ydec)\\n\\n };\\n\\n let tx_edge = bo.0.y >> ydec & (txsize.height_mi() - 1) == 0;\\n\\n if tx_edge {\\n\\n let prev_block = deblock_up(blocks, bo, &p.as_const());\\n\\n let block_edge = bo.0.y & (block.n4_h as usize - 1) == 0;\\n\\n let filter_size =\\n\\n deblock_size(block, prev_block, &p.as_const(), pli, false, block_edge);\\n\\n if filter_size > 0 {\\n\\n let level = deblock_level(deblock, block, prev_block, pli, false);\\n\\n if level > 0 {\\n\\n let po = bo.plane_offset(p.plane_cfg);\\n\",\n \"file_path\": \"src/deblock.rs\",\n \"rank\": 52,\n \"score\": 215568.60132778814\n },\n {\n \"content\": \"fn filter_v_edge<T: Pixel>(\\n\\n deblock: &DeblockState, blocks: &TileBlocks, bo: TileBlockOffset,\\n\\n p: &mut PlaneRegionMut<T>, pli: usize, bd: usize, xdec: usize, ydec: usize,\\n\\n) {\\n\\n let block = &blocks[bo];\\n\\n let txsize = if pli == 0 {\\n\\n block.txsize\\n\\n } else {\\n\\n block.bsize.largest_chroma_tx_size(xdec, ydec)\\n\\n };\\n\\n let tx_edge = bo.0.x >> xdec & (txsize.width_mi() - 1) == 0;\\n\\n if tx_edge {\\n\\n let prev_block = deblock_left(blocks, bo, &p.as_const());\\n\\n let block_edge = bo.0.x & (block.n4_w as usize - 1) == 0;\\n\\n let filter_size =\\n\\n deblock_size(block, prev_block, &p.as_const(), pli, true, block_edge);\\n\\n if filter_size > 0 {\\n\\n let level = deblock_level(deblock, block, prev_block, pli, true);\\n\\n if level > 0 {\\n\\n let po = bo.plane_offset(p.plane_cfg);\\n\",\n \"file_path\": \"src/deblock.rs\",\n \"rank\": 53,\n \"score\": 215568.60132778814\n },\n {\n \"content\": \"fn sse_h_edge<T: Pixel>(\\n\\n blocks: &TileBlocks, bo: TileBlockOffset, rec_plane: &PlaneRegion<T>,\\n\\n src_plane: &PlaneRegion<T>, tally: &mut [i64; MAX_LOOP_FILTER + 2],\\n\\n pli: usize, bd: usize, xdec: usize, ydec: usize,\\n\\n) {\\n\\n let block = &blocks[bo];\\n\\n let txsize = if pli == 0 {\\n\\n block.txsize\\n\\n } else {\\n\\n block.bsize.largest_chroma_tx_size(xdec, ydec)\\n\\n };\\n\\n let tx_edge = bo.0.y >> ydec & (txsize.height_mi() - 1) == 0;\\n\\n if tx_edge {\\n\\n let prev_block = deblock_up(blocks, bo, rec_plane);\\n\\n let block_edge = bo.0.y & (block.n4_h as usize - 1) == 0;\\n\\n let filter_size =\\n\\n deblock_size(block, prev_block, rec_plane, pli, true, block_edge);\\n\\n if filter_size > 0 {\\n\\n let po = bo.plane_offset(rec_plane.plane_cfg); // rec and src have identical subsampling\\n\\n let rec_region = rec_plane.subregion(Area::Rect {\\n\",\n \"file_path\": \"src/deblock.rs\",\n \"rank\": 54,\n \"score\": 215568.60132778808\n },\n {\n \"content\": \"#[inline]\\n\\nfn copy_vertical<T: Pixel>(\\n\\n dst: &mut PlaneRegionMut<'_, T>, x: usize, y: usize, src: &[i32],\\n\\n) {\\n\\n for (i, v) in src.iter().enumerate() {\\n\\n let p = &mut dst[y + i][x];\\n\\n *p = T::cast_from(*v);\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/deblock.rs\",\n \"rank\": 55,\n \"score\": 215563.609898819\n },\n {\n \"content\": \"#[inline]\\n\\nfn copy_horizontal<T: Pixel>(\\n\\n dst: &mut PlaneRegionMut<'_, T>, x: usize, y: usize, src: &[i32],\\n\\n) {\\n\\n let row = &mut dst[y][x..];\\n\\n for (dst, src) in row.iter_mut().take(src.len()).zip(src) {\\n\\n *dst = T::cast_from(*src);\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/deblock.rs\",\n \"rank\": 56,\n \"score\": 215563.609898819\n },\n {\n \"content\": \"pub fn av1_round_shift_array(arr: &mut [i32], size: usize, bit: i8) {\\n\\n if bit == 0 {\\n\\n return;\\n\\n }\\n\\n if bit > 0 {\\n\\n let bit = bit as usize;\\n\\n for i in arr.iter_mut().take(size) {\\n\\n *i = round_shift(*i, bit);\\n\\n }\\n\\n } else {\\n\\n for i in arr.iter_mut().take(size) {\\n\\n *i <<= -bit;\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/transform/mod.rs\",\n \"rank\": 57,\n \"score\": 215231.53213270966\n },\n {\n \"content\": \"#[inline]\\n\\nfn deblock_left<'a, T: Pixel>(\\n\\n blocks: &'a TileBlocks, in_bo: TileBlockOffset, p: &PlaneRegion<T>,\\n\\n) -> &'a Block {\\n\\n let xdec = p.plane_cfg.xdec;\\n\\n let ydec = p.plane_cfg.ydec;\\n\\n\\n\\n // subsampled chroma uses odd mi row/col\\n\\n // We already know we're not at the upper/left corner, so prev_block is in frame\\n\\n &blocks[in_bo.0.y | ydec][(in_bo.0.x | xdec) - (1 << xdec)]\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/deblock.rs\",\n \"rank\": 58,\n \"score\": 211729.467200358\n },\n {\n \"content\": \"#[inline]\\n\\nfn clamp_value(value: i32, bit: usize) -> i32 {\\n\\n let max_value: i32 = ((1i64 << (bit - 1)) - 1) as i32;\\n\\n let min_value: i32 = (-(1i64 << (bit - 1))) as i32;\\n\\n clamp(value, min_value, max_value)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/transform/mod.rs\",\n \"rank\": 59,\n \"score\": 210127.8583767466\n },\n {\n \"content\": \"#[inline(always)]\\n\\nfn rdo_partition_none<T: Pixel>(\\n\\n fi: &FrameInvariants<T>, ts: &mut TileStateMut<'_, T>,\\n\\n cw: &mut ContextWriter, bsize: BlockSize, tile_bo: TileBlockOffset,\\n\\n inter_cfg: &InterConfig, child_modes: &mut ArrayVec<PartitionParameters, 4>,\\n\\n) -> f64 {\\n\\n debug_assert!(tile_bo.0.x < ts.mi_width && tile_bo.0.y < ts.mi_height);\\n\\n\\n\\n let mode = rdo_mode_decision(fi, ts, cw, bsize, tile_bo, inter_cfg);\\n\\n let cost = mode.rd_cost;\\n\\n\\n\\n child_modes.push(mode);\\n\\n\\n\\n cost\\n\\n}\\n\\n\\n\\n// VERTICAL, HORIZONTAL or simple SPLIT\\n\",\n \"file_path\": \"src/rdo.rs\",\n \"rank\": 60,\n \"score\": 209770.5158869471\n },\n {\n \"content\": \"pub fn get_sgr_sets(complexity: SGRComplexityLevel) -> &'static [u8] {\\n\\n match complexity {\\n\\n SGRComplexityLevel::Full => SGRPROJ_ALL_SETS,\\n\\n SGRComplexityLevel::Reduced => SGRPROJ_REDUCED_SETS,\\n\\n }\\n\\n}\\n\\n\\n\\npub const SOLVE_IMAGE_MAX: usize = 1 << RESTORATION_TILESIZE_MAX_LOG2;\\n\\npub const SOLVE_IMAGE_STRIDE: usize = SOLVE_IMAGE_MAX + 6 + 2;\\n\\npub const SOLVE_IMAGE_HEIGHT: usize = SOLVE_IMAGE_STRIDE;\\n\\npub const SOLVE_IMAGE_SIZE: usize = SOLVE_IMAGE_STRIDE * SOLVE_IMAGE_HEIGHT;\\n\\n\\n\\npub const STRIPE_IMAGE_MAX: usize = (1 << RESTORATION_TILESIZE_MAX_LOG2)\\n\\n + (1 << (RESTORATION_TILESIZE_MAX_LOG2 - 1));\\n\\npub const STRIPE_IMAGE_STRIDE: usize = STRIPE_IMAGE_MAX + 6 + 2;\\n\\npub const STRIPE_IMAGE_HEIGHT: usize = 64 + 6 + 2;\\n\\npub const STRIPE_IMAGE_SIZE: usize = STRIPE_IMAGE_STRIDE * STRIPE_IMAGE_HEIGHT;\\n\\n\\n\\npub const IMAGE_WIDTH_MAX: usize = [STRIPE_IMAGE_MAX, SOLVE_IMAGE_MAX]\\n\\n [(STRIPE_IMAGE_MAX < SOLVE_IMAGE_MAX) as usize];\\n\",\n \"file_path\": \"src/lrf.rs\",\n \"rank\": 61,\n \"score\": 207187.44466802134\n },\n {\n \"content\": \"pub fn copy_from_raw_u8_8bit(c: &mut Criterion) {\\n\\n let input = init_raw_plane_data(1920, 1080);\\n\\n let dest = Plane::<u8>::new(1920, 1080, 0, 0, 0, 0);\\n\\n c.bench_function(\\\"copy_from_raw_u8\\\", move |b| {\\n\\n b.iter(|| {\\n\\n let mut dest = dest.clone();\\n\\n let _ = dest.copy_from_raw_u8(&input, dest.cfg.stride, 1);\\n\\n })\\n\\n });\\n\\n}\\n\\n\\n\",\n \"file_path\": \"benches/plane.rs\",\n \"rank\": 62,\n \"score\": 206879.08698978083\n },\n {\n \"content\": \"pub fn copy_from_raw_u8_10bit(c: &mut Criterion) {\\n\\n let input = init_raw_plane_data(1920, 1080);\\n\\n let dest = Plane::<u16>::new(1920, 1080, 0, 0, 0, 0);\\n\\n c.bench_function(\\\"copy_from_raw_u8\\\", move |b| {\\n\\n b.iter(|| {\\n\\n let mut dest = dest.clone();\\n\\n let _ = dest.copy_from_raw_u8(&input, dest.cfg.stride, 2);\\n\\n })\\n\\n });\\n\\n}\\n\\n\\n\\ncriterion_group!(\\n\\n plane,\\n\\n downsample_8bit,\\n\\n downsample_odd,\\n\\n downsample_10bit,\\n\\n copy_from_raw_u8_8bit,\\n\\n copy_from_raw_u8_10bit\\n\\n);\\n\",\n \"file_path\": \"benches/plane.rs\",\n \"rank\": 63,\n \"score\": 206879.08698978083\n },\n {\n \"content\": \"#[inline]\\n\\nfn flat6(p2: i32, p1: i32, p0: i32, q0: i32, q1: i32, q2: i32) -> usize {\\n\\n cmp::max(\\n\\n (p1 - p0).abs(),\\n\\n cmp::max((q1 - q0).abs(), cmp::max((p2 - p0).abs(), (q2 - q0).abs())),\\n\\n ) as usize\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/deblock.rs\",\n \"rank\": 64,\n \"score\": 206034.87988816714\n },\n {\n \"content\": \"fn bench_put_8tap_top_left_lbd(c: &mut Criterion) {\\n\\n let mut ra = ChaChaRng::from_seed([0; 32]);\\n\\n let cpu = CpuFeatureLevel::default();\\n\\n let w = 640;\\n\\n let h = 480;\\n\\n let input_plane = new_plane::<u8>(&mut ra, w, h);\\n\\n let mut dst_plane = new_plane::<u8>(&mut ra, w, h);\\n\\n\\n\\n let (row_frac, col_frac, src) = get_params(\\n\\n &input_plane,\\n\\n PlaneOffset { x: 0, y: 0 },\\n\\n MotionVector { row: 0, col: 0 },\\n\\n );\\n\\n c.bench_function(\\\"put_8tap_top_left_lbd\\\", |b| {\\n\\n b.iter(|| {\\n\\n let _ = black_box(put_8tap(\\n\\n &mut dst_plane.as_region_mut(),\\n\\n src,\\n\\n 8,\\n\\n 8,\\n\",\n \"file_path\": \"benches/mc.rs\",\n \"rank\": 65,\n \"score\": 205172.61354594887\n },\n {\n \"content\": \"fn bench_prep_8tap_top_left_lbd(c: &mut Criterion) {\\n\\n let mut ra = ChaChaRng::from_seed([0; 32]);\\n\\n let cpu = CpuFeatureLevel::default();\\n\\n let w = 640;\\n\\n let h = 480;\\n\\n let input_plane = new_plane::<u8>(&mut ra, w, h);\\n\\n let mut dst = Aligned::<[i16; 128 * 128]>::uninitialized();\\n\\n\\n\\n let (row_frac, col_frac, src) = get_params(\\n\\n &input_plane,\\n\\n PlaneOffset { x: 0, y: 0 },\\n\\n MotionVector { row: 0, col: 0 },\\n\\n );\\n\\n c.bench_function(\\\"prep_8tap_top_left_lbd\\\", |b| {\\n\\n b.iter(|| {\\n\\n let _ = black_box(prep_8tap(\\n\\n &mut dst.data,\\n\\n src,\\n\\n 8,\\n\\n 8,\\n\",\n \"file_path\": \"benches/mc.rs\",\n \"rank\": 66,\n \"score\": 205172.61354594887\n },\n {\n \"content\": \"fn bench_put_8tap_top_left_hbd(c: &mut Criterion) {\\n\\n let mut ra = ChaChaRng::from_seed([0; 32]);\\n\\n let cpu = CpuFeatureLevel::default();\\n\\n let w = 640;\\n\\n let h = 480;\\n\\n let input_plane = new_plane::<u16>(&mut ra, w, h);\\n\\n let mut dst_plane = new_plane::<u16>(&mut ra, w, h);\\n\\n\\n\\n let (row_frac, col_frac, src) = get_params(\\n\\n &input_plane,\\n\\n PlaneOffset { x: 0, y: 0 },\\n\\n MotionVector { row: 0, col: 0 },\\n\\n );\\n\\n c.bench_function(\\\"put_8tap_top_left_hbd\\\", |b| {\\n\\n b.iter(|| {\\n\\n let _ = black_box(put_8tap(\\n\\n &mut dst_plane.as_region_mut(),\\n\\n src,\\n\\n 8,\\n\\n 8,\\n\",\n \"file_path\": \"benches/mc.rs\",\n \"rank\": 67,\n \"score\": 205172.61354594887\n },\n {\n \"content\": \"fn bench_prep_8tap_top_left_hbd(c: &mut Criterion) {\\n\\n let mut ra = ChaChaRng::from_seed([0; 32]);\\n\\n let cpu = CpuFeatureLevel::default();\\n\\n let w = 640;\\n\\n let h = 480;\\n\\n let input_plane = new_plane::<u16>(&mut ra, w, h);\\n\\n let mut dst = Aligned::<[i16; 128 * 128]>::uninitialized();\\n\\n\\n\\n let (row_frac, col_frac, src) = get_params(\\n\\n &input_plane,\\n\\n PlaneOffset { x: 0, y: 0 },\\n\\n MotionVector { row: 0, col: 0 },\\n\\n );\\n\\n c.bench_function(\\\"prep_8tap_top_left_hbd\\\", |b| {\\n\\n b.iter(|| {\\n\\n let _ = black_box(prep_8tap(\\n\\n &mut dst.data,\\n\\n src,\\n\\n 8,\\n\\n 8,\\n\",\n \"file_path\": \"benches/mc.rs\",\n \"rank\": 68,\n \"score\": 205172.61354594887\n },\n {\n \"content\": \"/// Fill data for scaling of one\\n\\nfn fill_scaling(ra: &mut ChaChaRng, scales: &mut [u32]) {\\n\\n for a in scales.iter_mut() {\\n\\n *a =\\n\\n ra.gen_range(DistortionScale::new(0.5).0..DistortionScale::new(1.5).0);\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"benches/dist.rs\",\n \"rank\": 69,\n \"score\": 204326.0138262545\n },\n {\n \"content\": \"#[inline]\\n\\nfn half_btf(w0: i32, in0: i32, w1: i32, in1: i32, bit: usize) -> i32 {\\n\\n // Ensure defined behaviour for when w0*in0 + w1*in1 is negative and\\n\\n // overflows, but w0*in0 + w1*in1 + rounding isn't.\\n\\n let result = (w0 * in0).wrapping_add(w1 * in1);\\n\\n // Implement a version of round_shift with wrapping\\n\\n if bit == 0 {\\n\\n result\\n\\n } else {\\n\\n result.wrapping_add(1 << (bit - 1)) >> bit\\n\\n }\\n\\n}\\n\\n\\n\\n// clamps value to a signed integer type of bit bits\\n\",\n \"file_path\": \"src/transform/mod.rs\",\n \"rank\": 70,\n \"score\": 204019.70082845344\n },\n {\n \"content\": \"pub fn select_dc_qi(quantizer: i64, bit_depth: usize) -> u8 {\\n\\n let qlookup = match bit_depth {\\n\\n 8 => &dc_qlookup_Q3,\\n\\n 10 => &dc_qlookup_10_Q3,\\n\\n 12 => &dc_qlookup_12_Q3,\\n\\n _ => unimplemented!(),\\n\\n };\\n\\n select_qi(quantizer, qlookup)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/quantize.rs\",\n \"rank\": 71,\n \"score\": 202779.76034380615\n },\n {\n \"content\": \"pub fn select_ac_qi(quantizer: i64, bit_depth: usize) -> u8 {\\n\\n let qlookup = match bit_depth {\\n\\n 8 => &ac_qlookup_Q3,\\n\\n 10 => &ac_qlookup_10_Q3,\\n\\n 12 => &ac_qlookup_12_Q3,\\n\\n _ => unimplemented!(),\\n\\n };\\n\\n select_qi(quantizer, qlookup)\\n\\n}\\n\\n\\n\\n#[derive(Debug, Default, Clone, Copy)]\\n\\npub struct QuantizationContext {\\n\\n log_tx_scale: usize,\\n\\n dc_quant: u32,\\n\\n dc_offset: u32,\\n\\n dc_mul_add: (u32, u32, u32),\\n\\n\\n\\n ac_quant: u32,\\n\\n ac_offset_eob: u32,\\n\\n ac_offset0: u32,\\n\\n ac_offset1: u32,\\n\\n ac_mul_add: (u32, u32, u32),\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/quantize.rs\",\n \"rank\": 72,\n \"score\": 202779.76034380615\n },\n {\n \"content\": \"pub fn get_intra_edges<T: Pixel>(\\n\\n dst: &PlaneRegion<'_, T>,\\n\\n partition_bo: TileBlockOffset, // partition bo, BlockOffset\\n\\n bx: usize,\\n\\n by: usize,\\n\\n partition_size: BlockSize, // partition size, BlockSize\\n\\n po: PlaneOffset,\\n\\n tx_size: TxSize,\\n\\n bit_depth: usize,\\n\\n opt_mode: Option<PredictionMode>,\\n\\n enable_intra_edge_filter: bool,\\n\\n intra_param: IntraParam,\\n\\n) -> Aligned<[T; 4 * MAX_TX_SIZE + 1]> {\\n\\n let plane_cfg = &dst.plane_cfg;\\n\\n\\n\\n let mut edge_buf: Aligned<[T; 4 * MAX_TX_SIZE + 1]> =\\n\\n Aligned::uninitialized();\\n\\n //Aligned::new([T::cast_from(0); 4 * MAX_TX_SIZE + 1]);\\n\\n let base = 128u16 << (bit_depth - 8);\\n\\n\\n\",\n \"file_path\": \"src/partition.rs\",\n \"rank\": 73,\n \"score\": 200549.06437569138\n },\n {\n \"content\": \"fn fill_frame<T: Pixel>(ra: &mut ChaChaRng, frame: &mut Frame<T>) {\\n\\n for plane in frame.planes.iter_mut() {\\n\\n let stride = plane.cfg.stride;\\n\\n for row in plane.data.chunks_mut(stride) {\\n\\n for pixel in row {\\n\\n let v: u8 = ra.gen();\\n\\n *pixel = T::cast_from(v);\\n\\n }\\n\\n }\\n\\n }\\n\\n}\\n\\n*/\\n\\n\\n\",\n \"file_path\": \"src/api/test.rs\",\n \"rank\": 74,\n \"score\": 200416.35806258649\n },\n {\n \"content\": \"fn divu_gen(d: u32) -> (u32, u32, u32) {\\n\\n let nbits = (mem::size_of_val(&d) as u64) * 8;\\n\\n let m = nbits - d.leading_zeros() as u64 - 1;\\n\\n if (d & (d - 1)) == 0 {\\n\\n (0xFFFF_FFFF, 0xFFFF_FFFF, m as u32)\\n\\n } else {\\n\\n let d = d as u64;\\n\\n let t = (1u64 << (m + nbits)) / d;\\n\\n let r = (t * d + d) & ((1 << nbits) - 1);\\n\\n if r <= 1u64 << m {\\n\\n (t as u32 + 1, 0u32, m as u32)\\n\\n } else {\\n\\n (t as u32, t as u32, m as u32)\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/quantize.rs\",\n \"rank\": 75,\n \"score\": 200175.5160053877\n },\n {\n \"content\": \"#[inline]\\n\\nfn divu_pair(x: u32, d: (u32, u32, u32)) -> u32 {\\n\\n let x = x as u64;\\n\\n let (a, b, shift) = d;\\n\\n let shift = shift as u64;\\n\\n let a = a as u64;\\n\\n let b = b as u64;\\n\\n\\n\\n (((a * x + b) >> 32) >> shift) as u32\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/quantize.rs\",\n \"rank\": 76,\n \"score\": 197933.1110698115\n },\n {\n \"content\": \"fn rav1e_frame_pad_internal<T: rav1e::Pixel>(\\n\\n f: &mut Arc<rav1e::Frame<T>>, planes: usize, width: usize, height: usize,\\n\\n) {\\n\\n if let Some(ref mut input) = Arc::get_mut(f) {\\n\\n for plane in input.planes[..planes].iter_mut() {\\n\\n plane.pad(width, height);\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/capi.rs\",\n \"rank\": 77,\n \"score\": 195541.8710749186\n },\n {\n \"content\": \"/// RDO-based transform type decision\\n\\n/// If cw_checkpoint is None, a checkpoint for cw's (ContextWriter) current\\n\\n/// state is created and stored for later use.\\n\\npub fn rdo_tx_type_decision<T: Pixel>(\\n\\n fi: &FrameInvariants<T>, ts: &mut TileStateMut<'_, T>,\\n\\n cw: &mut ContextWriter, cw_checkpoint: &mut Option<ContextWriterCheckpoint>,\\n\\n mode: PredictionMode, ref_frames: [RefType; 2], mvs: [MotionVector; 2],\\n\\n bsize: BlockSize, tile_bo: TileBlockOffset, tx_size: TxSize, tx_set: TxSet,\\n\\n tx_types: &[TxType],\\n\\n) -> (TxType, f64) {\\n\\n let mut best_type = TxType::DCT_DCT;\\n\\n let mut best_rd = std::f64::MAX;\\n\\n\\n\\n let PlaneConfig { xdec, ydec, .. } = ts.input.planes[1].cfg;\\n\\n let is_chroma_block =\\n\\n has_chroma(tile_bo, bsize, xdec, ydec, fi.sequence.chroma_sampling);\\n\\n\\n\\n let is_inter = !mode.is_intra();\\n\\n\\n\\n if cw_checkpoint.is_none() {\\n\\n // Only run the first call\\n\\n // Prevents creating multiple checkpoints for own version of cw\\n\\n *cw_checkpoint =\\n\",\n \"file_path\": \"src/rdo.rs\",\n \"rank\": 78,\n \"score\": 195486.85701483034\n },\n {\n \"content\": \"pub fn rdo_tx_size_type<T: Pixel>(\\n\\n fi: &FrameInvariants<T>, ts: &mut TileStateMut<'_, T>,\\n\\n cw: &mut ContextWriter, bsize: BlockSize, tile_bo: TileBlockOffset,\\n\\n luma_mode: PredictionMode, ref_frames: [RefType; 2], mvs: [MotionVector; 2],\\n\\n skip: bool,\\n\\n) -> (TxSize, TxType) {\\n\\n let is_inter = !luma_mode.is_intra();\\n\\n let mut tx_size = max_txsize_rect_lookup[bsize as usize];\\n\\n\\n\\n if fi.enable_inter_txfm_split && is_inter && !skip {\\n\\n tx_size = sub_tx_size_map[tx_size as usize]; // Always choose one level split size\\n\\n }\\n\\n\\n\\n let mut best_tx_type = TxType::DCT_DCT;\\n\\n let mut best_tx_size = tx_size;\\n\\n let mut best_rd = std::f64::MAX;\\n\\n\\n\\n let do_rdo_tx_size =\\n\\n fi.tx_mode_select && fi.config.speed_settings.rdo_tx_decision && !is_inter;\\n\\n let rdo_tx_depth = if do_rdo_tx_size { 2 } else { 0 };\\n\",\n \"file_path\": \"src/rdo.rs\",\n \"rank\": 79,\n \"score\": 195472.0199249656\n },\n {\n \"content\": \"pub fn ac_q(qindex: u8, delta_q: i8, bit_depth: usize) -> i16 {\\n\\n static AC_Q: [&[i16; 256]; 3] =\\n\\n [&ac_qlookup_Q3, &ac_qlookup_10_Q3, &ac_qlookup_12_Q3];\\n\\n let bd = ((bit_depth ^ 8) >> 1).min(2);\\n\\n AC_Q[bd][((qindex as isize + delta_q as isize).max(0) as usize).min(255)]\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/quantize.rs\",\n \"rank\": 80,\n \"score\": 195382.14882731467\n },\n {\n \"content\": \"pub fn dc_q(qindex: u8, delta_q: i8, bit_depth: usize) -> i16 {\\n\\n static DC_Q: [&[i16; 256]; 3] =\\n\\n [&dc_qlookup_Q3, &dc_qlookup_10_Q3, &dc_qlookup_12_Q3];\\n\\n let bd = ((bit_depth ^ 8) >> 1).min(2);\\n\\n DC_Q[bd][((qindex as isize + delta_q as isize).max(0) as usize).min(255)]\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/quantize.rs\",\n \"rank\": 81,\n \"score\": 195382.14882731467\n },\n {\n \"content\": \"fn fill_frame<T: Pixel>(ra: &mut ChaChaRng, frame: &mut Frame<T>) {\\n\\n for plane in frame.planes.iter_mut() {\\n\\n let stride = plane.cfg.stride;\\n\\n for row in plane.data.chunks_mut(stride) {\\n\\n for pixel in row {\\n\\n let v: u8 = ra.gen();\\n\\n *pixel = T::cast_from(v);\\n\\n }\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/test_encode_decode/mod.rs\",\n \"rank\": 82,\n \"score\": 194410.55302969326\n },\n {\n \"content\": \"type ec_window = u32;\\n\\n\\n\",\n \"file_path\": \"src/ec.rs\",\n \"rank\": 83,\n \"score\": 192606.92506458805\n },\n {\n \"content\": \"fn init_plane_u8(width: usize, height: usize, seed: u8) -> Plane<u8> {\\n\\n let mut ra = ChaChaRng::from_seed([seed; 32]);\\n\\n let data: Vec<u8> = (0..(width * height)).map(|_| ra.gen()).collect();\\n\\n Plane::from_slice(&data, width)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"benches/rdo.rs\",\n \"rank\": 84,\n \"score\": 190868.59962770974\n },\n {\n \"content\": \"// Compute Bessel filter coefficients with the specified delay.\\n\\n// Return: Filter parameters (c[0], c[1], g).\\n\\nfn iir_bessel2_get_parameters(delay: i32) -> (i32, i32, i32) {\\n\\n // This borrows some code from an unreleased version of Postfish.\\n\\n // See the recipe at http://unicorn.us.com/alex/2polefilters.html for details\\n\\n // on deriving the filter coefficients.\\n\\n // alpha is Q24\\n\\n let alpha = (1 << 24) / delay;\\n\\n // warp is 7.12 (5.12? the max value is 70386 in Q12).\\n\\n let warp = warp_alpha(alpha).max(1) as i64;\\n\\n // k1 is 9.12 (6.12?)\\n\\n let k1 = 3 * warp;\\n\\n // k2 is 16.24 (11.24?)\\n\\n let k2 = k1 * warp;\\n\\n // d is 16.15 (10.15?)\\n\\n let d = ((((1 << 12) + k1) << 12) + k2 + 256) >> 9;\\n\\n // a is 0.32, since d is larger than both 1.0 and k2\\n\\n let a = (k2 << 23) / d;\\n\\n // ik2 is 25.24\\n\\n let ik2 = (1i64 << 48) / k2;\\n\\n // b1 is Q56; in practice, the integer ranges between -2 and 2.\\n\\n let b1 = 2 * a * (ik2 - (1i64 << 24));\\n\",\n \"file_path\": \"src/rate.rs\",\n \"rank\": 85,\n \"score\": 190790.35262186598\n },\n {\n \"content\": \"fn sub_pixel_me<T: Pixel>(\\n\\n fi: &FrameInvariants<T>, po: PlaneOffset, org_region: &PlaneRegion<T>,\\n\\n p_ref: &Plane<T>, lambda: u32, pmv: [MotionVector; 2], mvx_min: isize,\\n\\n mvx_max: isize, mvy_min: isize, mvy_max: isize, bsize: BlockSize,\\n\\n use_satd: bool, best: &mut MVSearchResult, ref_frame: RefType,\\n\\n) {\\n\\n subpel_diamond_me_search(\\n\\n fi,\\n\\n po,\\n\\n org_region,\\n\\n p_ref,\\n\\n fi.sequence.bit_depth,\\n\\n pmv,\\n\\n lambda,\\n\\n mvx_min,\\n\\n mvx_max,\\n\\n mvy_min,\\n\\n mvy_max,\\n\\n bsize,\\n\\n use_satd,\\n\\n best,\\n\\n ref_frame,\\n\\n );\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/me.rs\",\n \"rank\": 86,\n \"score\": 190230.17393205734\n },\n {\n \"content\": \"fn full_pixel_me<T: Pixel>(\\n\\n fi: &FrameInvariants<T>, ts: &TileStateMut<'_, T>,\\n\\n org_region: &PlaneRegion<T>, p_ref: &Plane<T>, tile_bo: TileBlockOffset,\\n\\n po: PlaneOffset, lambda: u32, pmv: [MotionVector; 2], bsize: BlockSize,\\n\\n mvx_min: isize, mvx_max: isize, mvy_min: isize, mvy_max: isize,\\n\\n ref_frame: RefType, conf: &FullpelConfig,\\n\\n) -> FullpelSearchResult {\\n\\n let ssdec = conf.ssdec;\\n\\n\\n\\n let tile_me_stats = &ts.me_stats[ref_frame.to_index()].as_const();\\n\\n let frame_ref =\\n\\n fi.rec_buffer.frames[fi.ref_frames[0] as usize].as_ref().map(Arc::as_ref);\\n\\n let subsets = get_subset_predictors(\\n\\n tile_bo,\\n\\n tile_me_stats,\\n\\n frame_ref,\\n\\n ref_frame.to_index(),\\n\\n bsize,\\n\\n mvx_min,\\n\\n mvx_max,\\n\",\n \"file_path\": \"src/me.rs\",\n \"rank\": 87,\n \"score\": 190230.17393205734\n },\n {\n \"content\": \"// alpha is Q24 in the range [0,0.5).\\n\\n// The return value is 5.12.\\n\\n// TODO: Mark const once we can use local variables in a const function.\\n\\nfn warp_alpha(alpha: i32) -> i32 {\\n\\n let i = ((alpha * 36) >> 24).min(16);\\n\\n let t0 = ROUGH_TAN_LOOKUP[i as usize];\\n\\n let t1 = ROUGH_TAN_LOOKUP[i as usize + 1];\\n\\n let d = alpha * 36 - (i << 24);\\n\\n ((((t0 as i64) << 32) + (((t1 - t0) << 8) as i64) * (d as i64)) >> 32) as i32\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/rate.rs\",\n \"rank\": 88,\n \"score\": 189947.58252319932\n },\n {\n \"content\": \"#[inline]\\n\\nfn get_func_i32x8(t: TxfmType) -> TxfmFuncI32X8 {\\n\\n use self::TxfmType::*;\\n\\n match t {\\n\\n DCT4 => daala_fdct4,\\n\\n DCT8 => daala_fdct8,\\n\\n DCT16 => daala_fdct16,\\n\\n DCT32 => daala_fdct32,\\n\\n DCT64 => daala_fdct64,\\n\\n ADST4 => daala_fdst_vii_4,\\n\\n ADST8 => daala_fdst8,\\n\\n ADST16 => daala_fdst16,\\n\\n Identity4 => fidentity,\\n\\n Identity8 => fidentity,\\n\\n Identity16 => fidentity,\\n\\n Identity32 => fidentity,\\n\\n _ => unreachable!(),\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/asm/x86/transform/forward.rs\",\n \"rank\": 89,\n \"score\": 189839.47796263182\n },\n {\n \"content\": \"#[inline(always)]\\n\\npub fn msb(x: i32) -> i32 {\\n\\n debug_assert!(x > 0);\\n\\n 31 ^ (x.leading_zeros() as i32)\\n\\n}\\n\\n\\n\\n#[inline(always)]\\n\\npub const fn round_shift(value: i32, bit: usize) -> i32 {\\n\\n (value + (1 << bit >> 1)) >> bit\\n\\n}\\n\",\n \"file_path\": \"v_frame/src/math.rs\",\n \"rank\": 90,\n \"score\": 186721.4239129549\n },\n {\n \"content\": \"pub fn call_inverse_func<T: Pixel>(\\n\\n func: InvTxfmFunc, input: &[T::Coeff], output: &mut PlaneRegionMut<'_, T>,\\n\\n eob: usize, width: usize, height: usize, bd: usize,\\n\\n) {\\n\\n debug_assert!(bd == 8);\\n\\n\\n\\n // Only use at most 32 columns and 32 rows of input coefficients.\\n\\n let input: &[T::Coeff] = &input[..width.min(32) * height.min(32)];\\n\\n\\n\\n let mut copied: Aligned<[T::Coeff; 32 * 32]> = Aligned::uninitialized();\\n\\n\\n\\n // Convert input to 16-bits.\\n\\n // TODO: Remove by changing inverse assembly to not overwrite its input\\n\\n for (a, b) in copied.data.iter_mut().zip(input) {\\n\\n *a = *b;\\n\\n }\\n\\n\\n\\n // perform the inverse transform\\n\\n unsafe {\\n\\n func(\\n\\n output.data_ptr_mut() as *mut _,\\n\\n output.plane_cfg.stride as isize,\\n\\n copied.data.as_mut_ptr() as *mut _,\\n\\n eob as i32,\\n\\n );\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/asm/shared/transform/inverse.rs\",\n \"rank\": 91,\n \"score\": 186511.22307659712\n },\n {\n \"content\": \"fn send_frame_kf<T: Pixel>(ctx: &mut Context<T>, keyframe: bool) {\\n\\n let input = ctx.new_frame();\\n\\n\\n\\n let frame_type_override =\\n\\n if keyframe { FrameTypeOverride::Key } else { FrameTypeOverride::No };\\n\\n\\n\\n let opaque = Some(Opaque::new(keyframe));\\n\\n\\n\\n let fp = FrameParameters { frame_type_override, opaque };\\n\\n\\n\\n let _ = ctx.send_frame((input, fp));\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/api/test.rs\",\n \"rank\": 92,\n \"score\": 185902.65905756078\n },\n {\n \"content\": \"#[inline(always)]\\n\\npub fn mv_class_base(mv_class: usize) -> u32 {\\n\\n if mv_class != MV_CLASS_0 {\\n\\n (CLASS0_SIZE << (mv_class as usize + 2)) as u32\\n\\n } else {\\n\\n 0\\n\\n }\\n\\n}\\n\\n#[inline(always)]\\n\",\n \"file_path\": \"src/context/mod.rs\",\n \"rank\": 93,\n \"score\": 184776.1583678454\n },\n {\n \"content\": \"fn init_buffers(size: usize) -> (Vec<i32>, Vec<i32>) {\\n\\n let mut ra = ChaChaRng::from_seed([0; 32]);\\n\\n let input: Vec<i32> = (0..size).map(|_| ra.gen()).collect();\\n\\n let output = vec![0i32; size];\\n\\n\\n\\n (input, output)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"benches/transform.rs\",\n \"rank\": 94,\n \"score\": 183932.0327562734\n },\n {\n \"content\": \"fn init_plane_u16(width: usize, height: usize) -> Plane<u16> {\\n\\n let mut ra = ChaChaRng::from_seed([0; 32]);\\n\\n let data: Vec<u16> = (0..(width * height)).map(|_| ra.gen()).collect();\\n\\n Plane::from_slice(&data, width)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"benches/plane.rs\",\n \"rank\": 95,\n \"score\": 183841.9542159572\n },\n {\n \"content\": \"#[inline]\\n\\nfn stride_sse(a: &[i32], b: &[i32]) -> i64 {\\n\\n let mut acc: i32 = 0;\\n\\n for (a, b) in a.iter().take(b.len()).zip(b) {\\n\\n acc += (*a - *b) * (*a - *b)\\n\\n }\\n\\n acc as i64\\n\\n}\\n\\n\\n\\n#[inline]\\n\\nconst fn _level_to_limit(level: i32, shift: usize) -> i32 {\\n\\n level << shift\\n\\n}\\n\\n\\n\\n#[inline]\\n\\nconst fn limit_to_level(limit: i32, shift: usize) -> i32 {\\n\\n (limit + (1 << shift) - 1) >> shift\\n\\n}\\n\\n\\n\\n#[inline]\\n\\nconst fn _level_to_blimit(level: i32, shift: usize) -> i32 {\\n\",\n \"file_path\": \"src/deblock.rs\",\n \"rank\": 96,\n \"score\": 183803.8154035632\n },\n {\n \"content\": \"fn init_plane_u8(width: usize, height: usize) -> Plane<u8> {\\n\\n let mut ra = ChaChaRng::from_seed([0; 32]);\\n\\n let data: Vec<u8> = (0..(width * height)).map(|_| ra.gen()).collect();\\n\\n let out = Plane::from_slice(&data, width);\\n\\n if out.cfg.width % 2 == 0 && out.cfg.height % 2 == 0 {\\n\\n out\\n\\n } else {\\n\\n let xpad = out.cfg.width % 2;\\n\\n let ypad = out.cfg.height % 2;\\n\\n let mut padded =\\n\\n Plane::new(out.cfg.width, out.cfg.height, 0, 0, xpad, ypad);\\n\\n let mut padded_slice = padded.mut_slice(PlaneOffset { x: 0, y: 0 });\\n\\n for (dst_row, src_row) in padded_slice.rows_iter_mut().zip(out.rows_iter())\\n\\n {\\n\\n dst_row[..out.cfg.width].copy_from_slice(&src_row[..out.cfg.width]);\\n\\n }\\n\\n padded\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"benches/plane.rs\",\n \"rank\": 97,\n \"score\": 183724.00849805426\n },\n {\n \"content\": \"fn fill_plane<T: Pixel>(ra: &mut ChaChaRng, plane: &mut Plane<T>) {\\n\\n let stride = plane.cfg.stride;\\n\\n for row in plane.data_origin_mut().chunks_mut(stride) {\\n\\n for pixel in row {\\n\\n let v: u8 = ra.gen();\\n\\n *pixel = T::cast_from(v);\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"benches/mc.rs\",\n \"rank\": 98,\n \"score\": 183526.5366885428\n },\n {\n \"content\": \"fn fill_plane<T: Pixel>(ra: &mut ChaChaRng, plane: &mut Plane<T>) {\\n\\n let stride = plane.cfg.stride;\\n\\n for row in plane.data_origin_mut().chunks_mut(stride) {\\n\\n for pixel in row {\\n\\n let v: u8 = ra.gen();\\n\\n *pixel = T::cast_from(v);\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"benches/dist.rs\",\n \"rank\": 99,\n \"score\": 183526.5366885428\n }\n]","isConversational":false}}},{"rowIdx":2391,"cells":{"lang":{"kind":"string","value":"Rust"},"file_path":{"kind":"string","value":"pnets_shrink/tests/standard_reduce_tests.rs"},"repo_name":{"kind":"string","value":"nicolasAmat/pnets"},"commit":{"kind":"string","value":"482d014001f31afe31bc1c47c08d5c1183bf78a3"},"file_code":{"kind":"string","value":"use pnets::standard::Net;\nuse pnets_shrink::modifications::{\n Agglomeration, InequalityReduction, Modification, Reduction, TransitionElimination,\n};\nuse pnets_shrink::reducers::standard::{\n IdentityPlaceReducer, IdentityTransitionReducer, ParallelPlaceReducer,\n ParallelTransitionReducer, SimpleChainReducer, SourceSinkReducer,\n};\nuse pnets_shrink::reducers::Reduce;\n\n#[test]\nfn simple_chain_agglomeration() {\n let parser = pnets_tina::Parser::new(include_str!(\"simple_chain_agglomeration.net\").as_bytes());\n\n let mut net = Net::from(parser.parse().unwrap());\n let mut modifications = vec![];\n SimpleChainReducer::reduce(&mut net, &mut modifications);\n assert_eq!(\n modifications[0],\n Modification::Agglomeration(Agglomeration {\n deleted_places: vec![\n (net.get_index_by_name(\"p1\").unwrap().as_place().unwrap(), 1),\n (net.get_index_by_name(\"p2\").unwrap().as_place().unwrap(), 1)\n ],\n new_place: net.places.last_idx().unwrap(),\n constant: 0,\n factor: 1,\n })\n );\n}\n\n#[test]\nfn parallel_transitions_fusion() {\n let parser =\n pnets_tina::Parser::new(include_str!(\"parallel_transitions_fusion.net\").as_bytes());\n\n let mut net = Net::from(parser.parse().unwrap());\n let mut modifications = vec![];\n ParallelTransitionReducer::reduce(&mut net, &mut modifications);\n assert_eq!(\n modifications[0],\n Modification::TransitionElimination(TransitionElimination {\n deleted_transitions: vec![net\n .get_index_by_name(\"t1\")\n .unwrap()\n .as_transition()\n .unwrap()]\n })\n );\n}\n\n#[test]\nfn parallel_places_fusion() {\n let parser = pnets_tina::Parser::new(include_str!(\"parallel_places_fusion.net\").as_bytes());\n\n let mut net = Net::from(parser.parse().unwrap());\n let mut modifications = vec![];\n ParallelPlaceReducer::reduce(&mut net, &mut modifications);\n assert_eq!(\n modifications[0],\n Modification::Reduction(Reduction {\n deleted_places: vec![(net.get_index_by_name(\"p1\").unwrap().as_place().unwrap(), 1)],\n equals_to: vec![(net.get_index_by_name(\"p2\").unwrap().as_place().unwrap(), 1)],\n constant: 0,\n })\n );\n}\n\n#[test]\nfn constant_places_elimination() {\n let parser =\n pnets_tina::Parser::new(include_str!(\"constant_places_elimination.net\").as_bytes());\n\n let mut net = Net::from(parser.parse().unwrap());\n println!(\"{:?}\", net);\n let mut modifications = vec![];\n IdentityPlaceReducer::reduce(&mut net, &mut modifications);\n println!(\"{:?}\", net);\n assert_eq!(\n modifications[0],\n Modification::Reduction(Reduction {\n deleted_places: vec![(net.get_index_by_name(\"p1\").unwrap().as_place().unwrap(), 1)],\n equals_to: vec![],\n constant: 5,\n })\n );\n}\n\n#[test]\nfn source_sink_convert() {\n let parser = pnets_tina::Parser::new(include_str!(\"source_sink_convert.net\").as_bytes());\n\n let mut net = Net::from(parser.parse().unwrap());\n let mut modifications = vec![];\n SourceSinkReducer::reduce(&mut net, &mut modifications);\n assert_eq!(\n modifications[0],\n Modification::InequalityReduction(InequalityReduction {\n deleted_places: vec![(net.get_index_by_name(\"p1\").unwrap().as_place().unwrap(), 1)],\n kept_places: vec![],\n constant: 5,\n })\n );\n}\n\n#[test]\nfn self_loop_place_elimination() {\n let parser =\n pnets_tina::Parser::new(include_str!(\"self_loop_place_eliminations.net\").as_bytes());\n\n let mut net = Net::from(parser.parse().unwrap());\n let mut modifications = vec![];\n IdentityPlaceReducer::reduce(&mut net, &mut modifications);\n\n assert_eq!(\n modifications[0],\n Modification::Reduction(Reduction {\n deleted_places: vec![(net.get_index_by_name(\"p1\").unwrap().as_place().unwrap(), 1)],\n equals_to: vec![],\n constant: 5,\n })\n );\n}\n\n#[test]\nfn self_loop_transition_elimination() {\n let parser =\n pnets_tina::Parser::new(include_str!(\"self_loop_transition_eliminations.net\").as_bytes());\n\n let mut net = Net::from(parser.parse().unwrap());\n let mut modifications = vec![];\n IdentityTransitionReducer::reduce(&mut net, &mut modifications);\n\n assert_eq!(\n modifications[0],\n Modification::TransitionElimination(TransitionElimination {\n deleted_transitions: vec![net\n .get_index_by_name(\"t1\")\n .unwrap()\n .as_transition()\n .unwrap()]\n })\n );\n}\n"},"prefix":{"kind":"string","value":"use pnets::standard::Net;\nuse pnets_shrink::modifications::{\n Agglomeration, InequalityReduction, Modification, Reduction, TransitionElimination,\n};\nuse pnets_shrink::reducers::standard::{\n IdentityPlaceReducer, IdentityTransitionReducer, ParallelPlaceReducer,\n ParallelTransitionReducer, SimpleChainReducer, SourceSinkReducer,\n};\nuse pnets_shrink::reducers::Reduce;\n\n#[test]\nfn simple_chain_agglomeration() {\n let parser = pnets_tina::Parser::new(include_str!(\"simple_chain_agglomeration.net\").as_bytes());\n\n let mut net = Net::from(parser.parse().unwrap());\n let mut modifications = vec![];\n SimpleChainReducer::reduce(&mut net, &mut modifications);\n assert_eq!(\n modifications[0],\n Modification::Agglomeration(Agglomeration {\n deleted_places: vec![\n (net.get_index_by_name(\"p1\").unwrap().as_place().unwrap(), 1),\n (net.get_index_by_name(\"p2\").unwrap().as_place().unwrap(), 1)\n ],\n new_place: net.places.last_idx().unwrap(),\n constant: 0,\n factor: 1,\n })\n );\n}\n\n#[test]\nfn parallel_transitions_fusion() {\n let parser =\n pnets_tina::Parser::new(include_str!(\"parallel_transitions_fusion.net\").as_bytes());\n\n let mut net = Net::from(parser.parse().unwrap());\n let mut modifications = vec![];\n ParallelTransitionReducer::reduce(&mut net, &mut modifications);\n assert_eq!(\n modifications[0],\n Modification::TransitionElimination(TransitionElimination {\n deleted_transitions: vec![net\n .get_index_by_name(\"t1\")\n .unwrap()\n .as_transition()\n .unwrap()]\n })\n );\n}\n\n#[test]\nfn parallel_places_fusion() {\n let parser = pnets_tina::Parser::new(include_str!(\"parallel_places_fusion.net\").as_bytes());\n\n let mut net = Net::from(parser.parse().unwrap());\n let mut modifications = vec![];\n ParallelPlaceReducer::reduce(&mut net, &mut modifications);\n assert_eq!(\n modifications[0],\n Modification::Reduction(Reduction {\n deleted_places: vec![(net.get_index_by_name(\"p1\").unwrap().as_place().unwrap(), 1)],\n equals_to: vec![(net.get_index_by_name(\"p2\").unwrap().as_place().unwrap(), 1)],\n constant: 0,\n })\n );\n}\n\n#[test]\nfn constant_places_elimination() {\n let parser =\n pnets_tina::Parser::new(include_str!(\"constant_places_elimination.net\").as_bytes());\n\n let mut net = Net::from(parser.parse().unwrap());\n println!(\"{:?}\", net);\n let mut modifications = vec![];\n IdentityPlaceReducer::reduce(&mut net, &mut modifications);\n println!(\"{:?}\", net);\n assert_eq!(\n modifications[0],\n Modification::Reduction(Reduction {\n deleted_places: vec![(net.get_index_by_name(\"p1\").unwrap().as_place().unwrap(), 1)],\n equals_to: vec![],\n constant: 5,\n })\n );\n}\n\n#[test]\nfn source_sink_convert() {\n let parser = pnets_tina::Parser::new(include_str!(\"source_sink_convert.net\").as_bytes());\n\n let mut net = Net::from(parser.parse().unwrap());\n let mut modifications = vec![];\n SourceSinkReducer::reduce(&mut net, &mut modifications);\n assert_eq!(\n modifications[0],\n Modification::InequalityReduction(InequalityReduction {\n deleted_places: vec![(net.get_index_by_name(\"p1\").unwrap().as_place().unwrap(), 1)],\n kept_places: vec![],\n constant: 5,\n })\n );\n}\n\n#[test]\nfn self_loop_place_elimination() {\n let parser =\n pnets_tina::Parser::new(include_str!(\"self_loop_place_eliminations.net\").as_bytes());\n\n let mut net = Net::from(parser.parse().unwrap());\n let mut modifications = vec![];\n IdentityPlaceReducer::reduce(&mut net, &mut modifications);\n\n assert_eq!(\n modifications[0],\n Modification::Reduction(Reduction {\n deleted_places: vec![(net.get_index_by_name(\"p1\").unwrap().as_place().unwrap(), 1)],\n equals_to: vec![],\n constant: 5,\n })\n );\n}\n\n#[test]\n"},"suffix":{"kind":"string","value":"\n"},"middle":{"kind":"string","value":"fn self_loop_transition_elimination() {\n let parser =\n pnets_tina::Parser::new(include_str!(\"self_loop_transition_eliminations.net\").as_bytes());\n\n let mut net = Net::from(parser.parse().unwrap());\n let mut modifications = vec![];\n IdentityTransitionReducer::reduce(&mut net, &mut modifications);\n\n assert_eq!(\n modifications[0],\n Modification::TransitionElimination(TransitionElimination {\n deleted_transitions: vec![net\n .get_index_by_name(\"t1\")\n .unwrap()\n .as_transition()\n .unwrap()]\n })\n );\n}"},"strategy":{"kind":"string","value":"function_block-function_prefix_line"},"context_items":{"kind":"list like","value":[{"content":"#[test]\n\nfn create_transition_with_used_name() {\n\n let mut net = Net::default();\n\n let tr_1 = net.create_transition();\n\n net.rename_node(NodeId::Transition(tr_1), \"tr_1\").unwrap();\n\n let tr_2 = net.create_transition();\n\n assert_eq!(net.transitions.len(), 2);\n\n assert_eq!(\n\n net.get_name_by_index(&NodeId::Transition(tr_1)).unwrap(),\n\n \"tr_1\".to_string()\n\n );\n\n assert_eq!(\n\n net.get_name_by_index(&NodeId::Transition(tr_2)).unwrap(),\n\n \"a1\".to_string()\n\n );\n\n assert_eq!(net[tr_1].label, None);\n\n assert_eq!(net[tr_2].label, None);\n\n}\n\n\n","file_path":"pnets/tests/timed_net_tests.rs","rank":0,"score":143815.43828950217},{"content":"#[test]\n\nfn create_place_with_used_name() {\n\n let mut net = Net::default();\n\n let pl_1 = net.create_place();\n\n net.rename_node(NodeId::Place(pl_1), \"pl_1\").unwrap();\n\n let pl_2 = net.create_place();\n\n assert_eq!(net.places.len(), 2);\n\n assert_eq!(\n\n net.get_name_by_index(&NodeId::Place(pl_1)).unwrap(),\n\n \"pl_1\".to_string()\n\n );\n\n assert_eq!(\n\n net.get_name_by_index(&NodeId::Place(pl_2)).unwrap(),\n\n \"a1\".to_string()\n\n );\n\n assert_eq!(net[pl_1].label, None);\n\n assert_eq!(net[pl_2].label, None);\n\n}\n\n\n","file_path":"pnets/tests/standard_net_tests.rs","rank":1,"score":143815.43828950217},{"content":"#[test]\n\nfn create_place_with_used_name() {\n\n let mut net = Net::default();\n\n let pl_1 = net.create_place();\n\n net.rename_node(NodeId::Place(pl_1), \"pl_1\").unwrap();\n\n let pl_2 = net.create_place();\n\n assert_eq!(net.places.len(), 2);\n\n assert_eq!(\n\n net.get_name_by_index(&NodeId::Place(pl_1)).unwrap(),\n\n \"pl_1\".to_string()\n\n );\n\n assert_eq!(\n\n net.get_name_by_index(&NodeId::Place(pl_2)).unwrap(),\n\n \"a1\".to_string()\n\n );\n\n assert_eq!(net[pl_1].label, None);\n\n assert_eq!(net[pl_2].label, None);\n\n}\n\n\n","file_path":"pnets/tests/timed_net_tests.rs","rank":2,"score":143815.43828950217},{"content":"#[test]\n\nfn create_transition_with_used_name() {\n\n let mut net = Net::default();\n\n let tr_1 = net.create_transition();\n\n net.rename_node(NodeId::Transition(tr_1), \"tr_1\").unwrap();\n\n let tr_2 = net.create_transition();\n\n assert_eq!(net.transitions.len(), 2);\n\n assert_eq!(\n\n net.get_name_by_index(&NodeId::Transition(tr_1)).unwrap(),\n\n \"tr_1\".to_string()\n\n );\n\n assert_eq!(\n\n net.get_name_by_index(&NodeId::Transition(tr_2)).unwrap(),\n\n \"a1\".to_string()\n\n );\n\n assert_eq!(net[tr_1].label, None);\n\n assert_eq!(net[tr_2].label, None);\n\n}\n\n\n","file_path":"pnets/tests/standard_net_tests.rs","rank":3,"score":143815.43828950217},{"content":"#[test]\n\nfn transition_test() {\n\n let parser =\n\n pnets_tina::Parser::new(\"tr t0 : transition_label [1,5] p0*3 p2?4 p3?-2 -> p1\".as_bytes());\n\n\n\n let net = parser.parse().unwrap();\n\n\n\n // Check if all places and transitions are created\n\n let t0: TransitionId = net\n\n .get_index_by_name(&\"t0\".to_string())\n\n .unwrap()\n\n .as_transition()\n\n .unwrap();\n\n let p0 = net\n\n .get_index_by_name(&\"p0\".to_string())\n\n .unwrap()\n\n .as_place()\n\n .unwrap();\n\n let p1: PlaceId = net\n\n .get_index_by_name(&\"p1\".to_string())\n\n .unwrap()\n","file_path":"pnets_tina/tests/parser_tests.rs","rank":4,"score":123087.95619426854},{"content":"#[test]\n\nfn place_test() {\n\n let parser = pnets_tina::Parser::new(\"pl p0 : label (43K) t0 -> t1 t2?1M t3?-2K\".as_bytes());\n\n let net = parser.parse().unwrap();\n\n println!(\"{:?}\", net);\n\n\n\n let p0 = net\n\n .get_index_by_name(&\"p0\".to_string())\n\n .unwrap()\n\n .as_place()\n\n .unwrap();\n\n let t0 = net\n\n .get_index_by_name(&\"t0\".to_string())\n\n .unwrap()\n\n .as_transition()\n\n .unwrap();\n\n let t1 = net\n\n .get_index_by_name(&\"t1\".to_string())\n\n .unwrap()\n\n .as_transition()\n\n .unwrap();\n","file_path":"pnets_tina/tests/parser_tests.rs","rank":5,"score":123087.95619426854},{"content":"#[test]\n\nfn note_test() {\n\n let parser = pnets_tina::Parser::new(\"nt note 0 {This is a note}\".as_bytes());\n\n parser.parse().unwrap();\n\n}\n\n\n","file_path":"pnets_tina/tests/parser_tests.rs","rank":6,"score":123087.95619426854},{"content":"#[test]\n\nfn sokoban_3_test() {\n\n let parser = pnets_tina::Parser::new(include_str!(\"sokoban_3.net\").as_bytes());\n\n parser.parse().unwrap();\n\n}\n","file_path":"pnets_tina/tests/parser_tests.rs","rank":7,"score":123087.95619426854},{"content":"#[test]\n\nfn priority_test() {\n\n let parser = pnets_tina::Parser::new(\"\".as_bytes());\n\n parser.parse().unwrap();\n\n}\n\n\n","file_path":"pnets_tina/tests/parser_tests.rs","rank":8,"score":123087.95619426854},{"content":"#[test]\n\nfn name_test() {\n\n let parser = pnets_tina::Parser::new(\"net Name\".as_bytes());\n\n let net = parser.parse().unwrap();\n\n assert_eq!(net.name, \"Name\".to_string())\n\n}\n\n\n\n// Should panic because lb is not implemented\n","file_path":"pnets_tina/tests/parser_tests.rs","rank":9,"score":123087.95619426854},{"content":"#[test]\n\nfn abp_test() {\n\n let parser = pnets_tina::Parser::new(include_str!(\"abp.net\").as_bytes());\n\n parser.parse().unwrap();\n\n}\n\n\n","file_path":"pnets_tina/tests/parser_tests.rs","rank":10,"score":123087.95619426854},{"content":"#[test]\n\nfn label_test() {\n\n let parser = pnets_tina::Parser::new(\n\n \"tr t0 p0 -> p1\\nlb t0 {transition}\\nlb p0 {place 0}\\nlb p1 {place 1}\".as_bytes(),\n\n );\n\n let net = parser.parse().unwrap();\n\n let t0 = net\n\n .get_index_by_name(\"t0\")\n\n .unwrap()\n\n .as_transition()\n\n .unwrap();\n\n assert_eq!(net[t0].label, Some(\"transition\".to_string()));\n\n let p0 = net.get_index_by_name(\"p0\").unwrap().as_place().unwrap();\n\n assert_eq!(net[p0].label, Some(\"place 0\".to_string()));\n\n let p1 = net.get_index_by_name(\"p1\").unwrap().as_place().unwrap();\n\n assert_eq!(net[p1].label, Some(\"place 1\".to_string()));\n\n}\n\n\n","file_path":"pnets_tina/tests/parser_tests.rs","rank":11,"score":123087.95619426854},{"content":"#[test]\n\nfn demo_test() {\n\n let parser = pnets_tina::Parser::new(include_str!(\"demo.net\").as_bytes());\n\n parser.parse().unwrap();\n\n}\n\n\n","file_path":"pnets_tina/tests/parser_tests.rs","rank":12,"score":123087.95619426854},{"content":"#[test]\n\nfn ifip_test() {\n\n let parser = pnets_tina::Parser::new(include_str!(\"ifip.net\").as_bytes());\n\n parser.parse().unwrap();\n\n}\n\n\n","file_path":"pnets_tina/tests/parser_tests.rs","rank":13,"score":123087.95619426854},{"content":"#[test]\n\nfn places() {\n\n let mut net = Net::default();\n\n let tr = net.create_transition();\n\n let pl = net.create_place();\n\n net.add_arc(Kind::Consume(pl, tr, 1)).unwrap();\n\n net.add_arc(Kind::Produce(pl, tr, 1)).unwrap();\n\n assert_eq!(net[pl].id(), pl);\n\n assert_eq!(net[pl].is_disconnected(), false);\n\n net.delete_place(pl);\n\n assert_eq!(net[pl].is_disconnected(), true);\n\n assert_eq!(net[pl].id(), pl);\n\n}\n\n\n","file_path":"pnets/tests/standard_net_tests.rs","rank":14,"score":121138.08552991209},{"content":"#[test]\n\nfn transition() {\n\n let mut net = Net::default();\n\n let tr = net.create_transition();\n\n let pl = net.create_place();\n\n net.add_arc(Kind::Consume(pl, tr, 1)).unwrap();\n\n net.add_arc(Kind::Produce(pl, tr, 1)).unwrap();\n\n assert_eq!(net[tr].id(), tr);\n\n assert_eq!(net[tr].is_disconnected(), false);\n\n net.delete_transition(tr);\n\n assert_eq!(net[tr].is_disconnected(), true);\n\n assert_eq!(net[tr].id(), tr);\n\n}\n\n\n","file_path":"pnets/tests/standard_net_tests.rs","rank":15,"score":121138.08552991209},{"content":"#[test]\n\nfn places() {\n\n let mut net = Net::default();\n\n let tr = net.create_transition();\n\n let pl = net.create_place();\n\n net.add_arc(Kind::Consume(pl, tr, 1)).unwrap();\n\n net.add_arc(Kind::Produce(pl, tr, 1)).unwrap();\n\n net.add_arc(Kind::Inhibitor(pl, tr, 1)).unwrap();\n\n net.add_arc(Kind::Test(pl, tr, 1)).unwrap();\n\n assert_eq!(net[pl].id(), pl);\n\n assert_eq!(net[pl].is_disconnected(), false);\n\n net.delete_place(pl);\n\n assert_eq!(net[pl].is_disconnected(), true);\n\n assert_eq!(net[pl].id(), pl);\n\n}\n\n\n","file_path":"pnets/tests/timed_net_tests.rs","rank":16,"score":121138.08552991209},{"content":"#[test]\n\nfn transition() {\n\n let mut net = Net::default();\n\n let tr = net.create_transition();\n\n let pl = net.create_place();\n\n net.add_arc(Kind::Consume(pl, tr, 1)).unwrap();\n\n net.add_arc(Kind::Produce(pl, tr, 1)).unwrap();\n\n net.add_arc(Kind::Inhibitor(pl, tr, 1)).unwrap();\n\n net.add_arc(Kind::Test(pl, tr, 1)).unwrap();\n\n assert_eq!(net[tr].id(), tr);\n\n assert_eq!(net[tr].is_disconnected(), false);\n\n net.delete_transition(tr);\n\n assert_eq!(net[tr].is_disconnected(), true);\n\n assert_eq!(net[tr].id(), tr);\n\n}\n\n\n","file_path":"pnets/tests/timed_net_tests.rs","rank":17,"score":121138.08552991209},{"content":"#[test]\n\nfn update_priorities_test() {\n\n let mut net = Net::default();\n\n let t0 = net.create_transition();\n\n let t1 = net.create_transition();\n\n let t2 = net.create_transition();\n\n let t3 = net.create_transition();\n\n\n\n net.add_priority(t0, t1);\n\n net.add_priority(t0, t2);\n\n net.add_priority(t1, t2);\n\n net.add_priority(t2, t3);\n\n\n\n assert!(net.update_priorities().is_ok());\n\n assert_eq!(net[t0].priorities, vec![t1, t2, t3]);\n\n assert_eq!(net[t1].priorities, vec![t2, t3]);\n\n assert_eq!(net[t2].priorities, vec![t3]);\n\n assert_eq!(net[t3].priorities, vec![]);\n\n}\n\n\n","file_path":"pnets/tests/timed_net_tests.rs","rank":18,"score":119993.4805131504},{"content":"#[test]\n\nfn create_transition() {\n\n let mut net = Net::default();\n\n let i = net.create_transition();\n\n assert_eq!(net.transitions.len(), 1);\n\n assert_eq!(\n\n net.get_name_by_index(&NodeId::Transition(i)).unwrap(),\n\n \"0\".to_string()\n\n )\n\n}\n\n\n","file_path":"pnets/tests/timed_net_tests.rs","rank":19,"score":118206.14284224808},{"content":"#[test]\n\nfn rename_node() {\n\n let mut net = Net::default();\n\n let tr = net.create_transition();\n\n let pl = net.create_place();\n\n assert_eq!(\n\n net.get_name_by_index(&NodeId::Transition(tr)),\n\n Some(\"0\".to_string())\n\n );\n\n assert_eq!(\n\n net.get_name_by_index(&NodeId::Place(pl)),\n\n Some(\"1\".to_string())\n\n );\n\n assert_eq!(net.rename_node(NodeId::Place(pl), \"pl\"), Ok(()));\n\n assert_eq!(net.rename_node(NodeId::Transition(tr), \"tr\"), Ok(()));\n\n assert_eq!(\n\n net.get_name_by_index(&NodeId::Transition(tr)),\n\n Some(\"tr\".to_string())\n\n );\n\n assert_eq!(\n\n net.get_name_by_index(&NodeId::Place(pl)),\n","file_path":"pnets/tests/timed_net_tests.rs","rank":20,"score":118206.14284224808},{"content":"#[test]\n\nfn create_place() {\n\n let mut net = Net::default();\n\n let i = net.create_place();\n\n assert_eq!(net.places.len(), 1);\n\n assert_eq!(\n\n net.get_name_by_index(&NodeId::Place(i)).unwrap(),\n\n \"0\".to_string()\n\n );\n\n assert_eq!(net[i].label, None);\n\n}\n\n\n","file_path":"pnets/tests/timed_net_tests.rs","rank":21,"score":118206.14284224808},{"content":"#[test]\n\nfn create_transition() {\n\n let mut net = Net::default();\n\n let i = net.create_transition();\n\n assert_eq!(net.transitions.len(), 1);\n\n assert_eq!(\n\n net.get_name_by_index(&NodeId::Transition(i)).unwrap(),\n\n \"0\".to_string()\n\n )\n\n}\n\n\n","file_path":"pnets/tests/standard_net_tests.rs","rank":22,"score":118206.14284224808},{"content":"#[test]\n\nfn rename_node() {\n\n let mut net = Net::default();\n\n let tr = net.create_transition();\n\n let pl = net.create_place();\n\n assert_eq!(\n\n net.get_name_by_index(&NodeId::Transition(tr)),\n\n Some(\"0\".to_string())\n\n );\n\n assert_eq!(\n\n net.get_name_by_index(&NodeId::Place(pl)),\n\n Some(\"1\".to_string())\n\n );\n\n assert_eq!(net.rename_node(NodeId::Place(pl), \"pl\"), Ok(()));\n\n assert_eq!(net.rename_node(NodeId::Transition(tr), \"tr\"), Ok(()));\n\n assert_eq!(\n\n net.get_name_by_index(&NodeId::Transition(tr)),\n\n Some(\"tr\".to_string())\n\n );\n\n assert_eq!(\n\n net.get_name_by_index(&NodeId::Place(pl)),\n","file_path":"pnets/tests/standard_net_tests.rs","rank":23,"score":118206.14284224808},{"content":"#[test]\n\nfn create_place() {\n\n let mut net = Net::default();\n\n let i = net.create_place();\n\n assert_eq!(net.places.len(), 1);\n\n assert_eq!(\n\n net.get_name_by_index(&NodeId::Place(i)).unwrap(),\n\n \"0\".to_string()\n\n );\n\n assert_eq!(net[i].label, None);\n\n}\n\n\n","file_path":"pnets/tests/standard_net_tests.rs","rank":24,"score":118206.14284224808},{"content":"#[test]\n\nfn name_test_invalid_identifier() {\n\n let parser = pnets_tina::Parser::new(\"net *\".as_bytes());\n\n assert_eq!(parser.parse().is_ok(), false);\n\n}\n\n\n","file_path":"pnets_tina/tests/parser_tests.rs","rank":25,"score":117946.6631700272},{"content":"#[test]\n\nfn node_transition_cast_test() {\n\n let tr = TransitionId::from(0);\n\n assert_eq!(\n\n NodeId::Transition(tr).as_transition(),\n\n Some(TransitionId::from(0))\n\n );\n\n assert_eq!(NodeId::Transition(tr).as_place(), None);\n\n}\n\n\n","file_path":"pnets/tests/timed_net_tests.rs","rank":26,"score":117504.12186480532},{"content":"#[test]\n\nfn node_place_cast_test() {\n\n let pl = PlaceId::from(0);\n\n assert_eq!(NodeId::Place(pl).as_transition(), None);\n\n assert_eq!(NodeId::Place(pl).as_place(), Some(PlaceId::from(0)));\n\n}\n","file_path":"pnets/tests/standard_net_tests.rs","rank":27,"score":117504.12186480532},{"content":"#[test]\n\nfn node_transition_cast_test() {\n\n let tr = TransitionId::from(0);\n\n assert_eq!(\n\n NodeId::Transition(tr).as_transition(),\n\n Some(TransitionId::from(0))\n\n );\n\n assert_eq!(NodeId::Transition(tr).as_place(), None);\n\n}\n\n\n","file_path":"pnets/tests/standard_net_tests.rs","rank":28,"score":117504.12186480532},{"content":"#[test]\n\nfn node_place_cast_test() {\n\n let pl = PlaceId::from(0);\n\n assert_eq!(NodeId::Place(pl).as_transition(), None);\n\n assert_eq!(NodeId::Place(pl).as_place(), Some(PlaceId::from(0)));\n\n}\n","file_path":"pnets/tests/timed_net_tests.rs","rank":29,"score":117504.12186480532},{"content":"#[test]\n\nfn test_get() {\n\n let mut marking: Marking<usize> = Default::default();\n\n marking.insert_or_add(2, 2);\n\n marking.insert_or_add(1, 3);\n\n marking.insert_or_add(3, 1);\n\n marking.insert_or_add(5, 5);\n\n\n\n assert_eq!(marking[1], 3);\n\n assert_eq!(marking[2], 2);\n\n assert_eq!(marking[3], 1);\n\n assert_eq!(marking[4], 0);\n\n assert_eq!(marking[5], 5);\n\n assert_eq!(marking[52], 0);\n\n}\n\n\n","file_path":"pnets/tests/marking_tests.rs","rank":32,"score":92419.59790721169},{"content":"#[test]\n\nfn test_insert_or_add() {\n\n let mut marking: Marking<usize> = Default::default();\n\n marking.insert_or_add(2, 2);\n\n marking.insert_or_add(1, 3);\n\n marking.insert_or_add(3, 1);\n\n marking.insert_or_add(2, 2);\n\n marking.insert_or_add(5, 5);\n\n marking.insert_or_add(4, 4);\n\n\n\n assert_eq!(marking[1], 3);\n\n assert_eq!(marking[2], 4);\n\n assert_eq!(marking[3], 1);\n\n assert_eq!(marking[4], 4);\n\n assert_eq!(marking[5], 5);\n\n}\n\n\n","file_path":"pnets/tests/marking_tests.rs","rank":33,"score":90683.90354554896},{"content":"#[test]\n\nfn test_insert_or_max() {\n\n let mut marking: Marking<usize> = Default::default();\n\n marking.insert_or_max(2, 2);\n\n marking.insert_or_max(2, 3);\n\n marking.insert_or_max(2, 2);\n\n marking.insert_or_max(5, 5);\n\n marking.insert_or_max(4, 4);\n\n\n\n assert_eq!(marking[2], 3);\n\n assert_eq!(marking[4], 4);\n\n assert_eq!(marking[5], 5);\n\n}\n\n\n","file_path":"pnets/tests/marking_tests.rs","rank":34,"score":90683.90354554896},{"content":"#[test]\n\nfn test_insert_or_min() {\n\n let mut marking: Marking<usize> = Default::default();\n\n marking.insert_or_min(2, 2);\n\n marking.insert_or_min(1, 3);\n\n marking.insert_or_min(1, 1);\n\n marking.insert_or_min(2, 2);\n\n marking.insert_or_min(5, 5);\n\n marking.insert_or_min(4, 4);\n\n\n\n assert_eq!(marking[1], 1);\n\n assert_eq!(marking[2], 2);\n\n assert_eq!(marking[4], 4);\n\n assert_eq!(marking[5], 5);\n\n}\n\n\n","file_path":"pnets/tests/marking_tests.rs","rank":35,"score":90683.90354554896},{"content":"#[test]\n\nfn test_dual_iterator_right() {\n\n let marking_1: Marking<usize> = Default::default();\n\n let mut marking_2: Marking<usize> = Default::default();\n\n marking_2.insert_or_max(0, 1);\n\n marking_2.insert_or_max(1, 1);\n\n marking_2.insert_or_max(2, 1);\n\n for (idx, v1, v2) in marking_1.iter_with(&marking_2) {\n\n assert_eq!(v1, marking_1[idx]);\n\n assert_eq!(v2, marking_2[idx]);\n\n }\n\n}\n","file_path":"pnets/tests/marking_tests.rs","rank":36,"score":89032.04317986383},{"content":"#[test]\n\nfn test_dual_iterator_left() {\n\n let mut marking_1: Marking<usize> = Default::default();\n\n let marking_2: Marking<usize> = Default::default();\n\n marking_1.insert_or_max(0, 1);\n\n marking_1.insert_or_max(1, 1);\n\n marking_1.insert_or_max(2, 1);\n\n for (idx, v1, v2) in marking_1.iter_with(&marking_2) {\n\n assert_eq!(v1, marking_1[idx]);\n\n assert_eq!(v2, marking_2[idx]);\n\n }\n\n}\n\n\n","file_path":"pnets/tests/marking_tests.rs","rank":37,"score":89032.04317986383},{"content":"#[test]\n\nfn test_dual_iterator_rand() {\n\n let mut marking_1: Marking<usize> = Default::default();\n\n let mut marking_2: Marking<usize> = Default::default();\n\n for _ in 0..fastrand::usize(0..1000) {\n\n marking_1.insert_or_max(\n\n fastrand::usize(0..usize::MAX),\n\n fastrand::usize(0..usize::MAX),\n\n );\n\n }\n\n for _ in 0..fastrand::usize(0..1000) {\n\n marking_2.insert_or_max(\n\n fastrand::usize(0..usize::MAX),\n\n fastrand::usize(0..usize::MAX),\n\n );\n\n }\n\n for (idx, v1, v2) in marking_1.iter_with(&marking_2) {\n\n assert_eq!(v1, marking_1[idx]);\n\n assert_eq!(v2, marking_2[idx]);\n\n }\n\n}\n\n\n","file_path":"pnets/tests/marking_tests.rs","rank":38,"score":89032.04317986383},{"content":"fn write_modifications(\n\n modifications: &[Modification],\n\n writer: &mut dyn Write,\n\n net: &Net,\n\n) -> Result<(), Box<dyn Error>> {\n\n writer.write_all(\"# generated equations\\n\".as_ref())?;\n\n for modification in modifications {\n\n match modification {\n\n Modification::Agglomeration(agg) => {\n\n if agg.factor == 1 {\n\n writer.write_all(\n\n format!(\n\n \"# A |- {} = \",\n\n net.get_name_by_index(&NodeId::Place(agg.new_place))\n\n .unwrap()\n\n )\n\n .as_ref(),\n\n )?;\n\n } else {\n\n writer.write_all(\n","file_path":"pnets_shrink/src/main.rs","rank":44,"score":79887.20780185173},{"content":" let t2 = net\n\n .get_index_by_name(&\"t2\".to_string())\n\n .unwrap()\n\n .as_transition()\n\n .unwrap();\n\n let t3 = net\n\n .get_index_by_name(&\"t3\".to_string())\n\n .unwrap()\n\n .as_transition()\n\n .unwrap();\n\n\n\n assert_eq!(net.get_name_by_index(&t0.into()).unwrap(), \"t0\".to_string());\n\n assert_eq!(net.get_name_by_index(&t1.into()).unwrap(), \"t1\".to_string());\n\n assert_eq!(net.get_name_by_index(&t2.into()).unwrap(), \"t2\".to_string());\n\n assert_eq!(net.get_name_by_index(&t3.into()).unwrap(), \"t3\".to_string());\n\n assert_eq!(net.get_name_by_index(&p0.into()).unwrap(), \"p0\".to_string());\n\n\n\n assert_eq!(net[p0].label, Some(\"label\".to_string()));\n\n assert_eq!(net[p0].initial, 43000);\n\n\n","file_path":"pnets_tina/tests/parser_tests.rs","rank":45,"score":77744.59969557908},{"content":" .as_place()\n\n .unwrap();\n\n let p2: PlaceId = net\n\n .get_index_by_name(&\"p2\".to_string())\n\n .unwrap()\n\n .as_place()\n\n .unwrap();\n\n let p3: PlaceId = net\n\n .get_index_by_name(&\"p3\".to_string())\n\n .unwrap()\n\n .as_place()\n\n .unwrap();\n\n\n\n assert_eq!(\n\n net.get_name_by_index(&NodeId::Transition(t0)).unwrap(),\n\n \"t0\".to_string()\n\n );\n\n assert_eq!(\n\n net.get_name_by_index(&NodeId::Place(p0)).unwrap(),\n\n \"p0\".to_string()\n","file_path":"pnets_tina/tests/parser_tests.rs","rank":46,"score":77744.31463129037},{"content":"use pnets::timed::{Bound, TimeRange};\n\nuse pnets::{NodeId, PlaceId, TransitionId};\n\n\n\n#[test]\n","file_path":"pnets_tina/tests/parser_tests.rs","rank":47,"score":77743.64032938647},{"content":" );\n\n assert_eq!(\n\n net.get_name_by_index(&NodeId::Place(p1)).unwrap(),\n\n \"p1\".to_string()\n\n );\n\n assert_eq!(\n\n net.get_name_by_index(&NodeId::Place(p2)).unwrap(),\n\n \"p2\".to_string()\n\n );\n\n assert_eq!(\n\n net.get_name_by_index(&NodeId::Place(p3)).unwrap(),\n\n \"p3\".to_string()\n\n );\n\n\n\n // Check transition information\n\n assert_eq!(\n\n net[t0].time,\n\n TimeRange {\n\n start: Bound::Closed(1),\n\n end: Bound::Closed(5),\n","file_path":"pnets_tina/tests/parser_tests.rs","rank":48,"score":77743.36062319315},{"content":" assert_eq!(net[p2].produced_by[t0], 0);\n\n assert_eq!(net[p3].produced_by[t0], 0);\n\n\n\n assert_eq!(net[t0].conditions[p0], 0);\n\n assert_eq!(net[t0].conditions[p1], 0);\n\n assert_eq!(net[t0].conditions[p2], 4);\n\n assert_eq!(net[t0].conditions[p3], 0);\n\n\n\n assert_eq!(net[p0].condition_for[t0], 0);\n\n assert_eq!(net[p1].condition_for[t0], 0);\n\n assert_eq!(net[p2].condition_for[t0], 4);\n\n assert_eq!(net[p3].condition_for[t0], 0);\n\n\n\n assert_eq!(net[t0].inhibitors[p0], 0);\n\n assert_eq!(net[t0].inhibitors[p1], 0);\n\n assert_eq!(net[t0].inhibitors[p2], 0);\n\n assert_eq!(net[t0].inhibitors[p3], 2);\n\n\n\n assert_eq!(net[p0].inhibitor_for[t0], 0);\n\n assert_eq!(net[p1].inhibitor_for[t0], 0);\n\n assert_eq!(net[p2].inhibitor_for[t0], 0);\n\n assert_eq!(net[p3].inhibitor_for[t0], 2);\n\n}\n\n\n","file_path":"pnets_tina/tests/parser_tests.rs","rank":49,"score":77740.2971454341},{"content":" assert_eq!(net[t0].produce[p0], 1);\n\n assert_eq!(net[t1].produce[p0], 0);\n\n assert_eq!(net[t2].produce[p0], 0);\n\n assert_eq!(net[t3].produce[p0], 0);\n\n\n\n assert_eq!(net[p0].produced_by[t0], 1);\n\n assert_eq!(net[p0].produced_by[t1], 0);\n\n assert_eq!(net[p0].produced_by[t2], 0);\n\n assert_eq!(net[p0].produced_by[t3], 0);\n\n\n\n assert_eq!(net[t0].consume[p0], 0);\n\n assert_eq!(net[t1].consume[p0], 1);\n\n assert_eq!(net[t2].consume[p0], 0);\n\n assert_eq!(net[t3].consume[p0], 0);\n\n\n\n assert_eq!(net[p0].consumed_by[t0], 0);\n\n assert_eq!(net[p0].consumed_by[t1], 1);\n\n assert_eq!(net[p0].consumed_by[t2], 0);\n\n assert_eq!(net[p0].consumed_by[t3], 0);\n\n\n","file_path":"pnets_tina/tests/parser_tests.rs","rank":50,"score":77740.28905672493},{"content":" assert_eq!(net[t0].conditions[p0], 0);\n\n assert_eq!(net[t1].conditions[p0], 0);\n\n assert_eq!(net[t2].conditions[p0], 1_000_000);\n\n assert_eq!(net[t3].conditions[p0], 0);\n\n\n\n assert_eq!(net[p0].condition_for[t0], 0);\n\n assert_eq!(net[p0].condition_for[t1], 0);\n\n assert_eq!(net[p0].condition_for[t2], 1_000_000);\n\n assert_eq!(net[p0].condition_for[t3], 0);\n\n\n\n assert_eq!(net[t0].inhibitors[p0], 0);\n\n assert_eq!(net[t1].inhibitors[p0], 0);\n\n assert_eq!(net[t2].inhibitors[p0], 0);\n\n assert_eq!(net[t3].inhibitors[p0], 2000);\n\n\n\n assert_eq!(net[p0].inhibitor_for[t0], 0);\n\n assert_eq!(net[p0].inhibitor_for[t1], 0);\n\n assert_eq!(net[p0].inhibitor_for[t2], 0);\n\n assert_eq!(net[p0].inhibitor_for[t3], 2_000);\n\n}\n\n\n","file_path":"pnets_tina/tests/parser_tests.rs","rank":51,"score":77740.28905672493},{"content":" }\n\n );\n\n assert_eq!(net[t0].label, Some(\"transition_label\".to_string()));\n\n assert_eq!(net[t0].consume[p0], 3);\n\n assert_eq!(net[t0].consume[p1], 0);\n\n assert_eq!(net[t0].consume[p2], 0);\n\n assert_eq!(net[t0].consume[p3], 0);\n\n\n\n assert_eq!(net[p0].consumed_by[t0], 3);\n\n assert_eq!(net[p1].consumed_by[t0], 0);\n\n assert_eq!(net[p2].consumed_by[t0], 0);\n\n assert_eq!(net[p3].consumed_by[t0], 0);\n\n\n\n assert_eq!(net[t0].produce[p0], 0);\n\n assert_eq!(net[t0].produce[p1], 1);\n\n assert_eq!(net[t0].produce[p2], 0);\n\n assert_eq!(net[t0].produce[p3], 0);\n\n\n\n assert_eq!(net[p0].produced_by[t0], 0);\n\n assert_eq!(net[p1].produced_by[t0], 1);\n","file_path":"pnets_tina/tests/parser_tests.rs","rank":52,"score":77740.27269971502},{"content":"use pnets::arc::Kind;\n\nuse pnets::standard::Net;\n\nuse pnets::{NetError, NodeId, PlaceId, TransitionId};\n\n\n\n#[test]\n","file_path":"pnets/tests/standard_net_tests.rs","rank":53,"score":77245.65206106889},{"content":"use pnets::arc::Kind;\n\nuse pnets::timed::Net;\n\nuse pnets::{NetError, NodeId, PlaceId, TransitionId};\n\n\n\n#[test]\n","file_path":"pnets/tests/timed_net_tests.rs","rank":54,"score":77245.65206106889},{"content":" Some(\"pl\".to_string())\n\n );\n\n assert_eq!(\n\n net.rename_node(NodeId::Place(pl), \"tr\"),\n\n Err(NetError::DuplicatedName(\"tr\".to_string()))\n\n );\n\n assert_eq!(\n\n net.rename_node(NodeId::Transition(tr), \"pl\"),\n\n Err(NetError::DuplicatedName(\"pl\".to_string()))\n\n );\n\n}\n\n\n","file_path":"pnets/tests/timed_net_tests.rs","rank":55,"score":77238.00200810182},{"content":" Some(\"pl\".to_string())\n\n );\n\n assert_eq!(\n\n net.rename_node(NodeId::Place(pl), \"tr\"),\n\n Err(NetError::DuplicatedName(\"tr\".to_string()))\n\n );\n\n assert_eq!(\n\n net.rename_node(NodeId::Transition(tr), \"pl\"),\n\n Err(NetError::DuplicatedName(\"pl\".to_string()))\n\n );\n\n}\n\n\n","file_path":"pnets/tests/standard_net_tests.rs","rank":56,"score":77238.00200810182},{"content":"fn main() -> Result<(), Box<dyn Error>> {\n\n let mut net = standard::Net::default();\n\n // Create places and transitions\n\n let pl_0 = net.create_place();\n\n let pl_1 = net.create_place();\n\n let pl_2 = net.create_place();\n\n let pl_3 = net.create_place();\n\n let pl_4 = net.create_place();\n\n let pl_5 = net.create_place();\n\n let pl_6 = net.create_place();\n\n let tr_0 = net.create_transition();\n\n let tr_1 = net.create_transition();\n\n let tr_2 = net.create_transition();\n\n let tr_3 = net.create_transition();\n\n let tr_4 = net.create_transition();\n\n // Rename node (by default they have automatic name)\n\n net.rename_node(pl_0.into(), \"p0\")?;\n\n net.rename_node(pl_1.into(), \"p1\")?;\n\n net.rename_node(pl_2.into(), \"p2\")?;\n\n net.rename_node(pl_3.into(), \"p3\")?;\n","file_path":"pnets/examples/net.rs","rank":57,"score":69966.71426996593},{"content":"/// All reduction which implement this trait should keep the count of markings (the set of equations\n\n/// should has exactly the same number of solutions than the original net)\n\npub trait ConservativeReduce<Net>: Reduce<Net> {}\n\n\n\n/// Try to apply a reduction rule on a specific place\n","file_path":"pnets_shrink/src/reducers/reduce.rs","rank":58,"score":58782.86410753522},{"content":"#[allow(clippy::module_name_repetitions)]\n\npub trait TransitionReduce<Net>: Reduce<Net> {\n\n /// Try to apply a reduction rule on a specific place\n\n fn transition_reduce(\n\n &self,\n\n net: &mut Net,\n\n tr: TransitionId,\n\n modifications: &mut Vec<Modification>,\n\n );\n\n}\n","file_path":"pnets_shrink/src/reducers/reduce.rs","rank":59,"score":58775.961958114116},{"content":"#[allow(clippy::module_name_repetitions)]\n\npub trait PlaceReduce<Net>: Reduce<Net> {\n\n /// Try to apply a reduction rule on a specific place\n\n fn place_reduce(&self, net: &mut Net, pl: PlaceId, modifications: &mut Vec<Modification>);\n\n}\n\n\n\n/// Try to apply a reduction rule on a specific place\n","file_path":"pnets_shrink/src/reducers/reduce.rs","rank":60,"score":58775.961958114116},{"content":"/// Apply a reduction rule to the net\n\npub trait Reduce<Net> {\n\n /// Compute a reduction rule on the net\n\n ///\n\n /// In general, this method should iterate over each place or transition and try to apply the\n\n /// reduction to each place or transition.\n\n fn reduce(&self, net: &mut Net, modifications: &mut Vec<Modification>);\n\n}\n\n\n","file_path":"pnets_shrink/src/reducers/reduce.rs","rank":61,"score":47964.48140345342},{"content":"fn new_redundant(\n\n args: &Args,\n\n) -> LoopReducer<\n\n Net,\n\n ChainReducer<\n\n Net,\n\n SmartReducer<\n\n Net,\n\n ChainReducer<\n\n Net,\n\n SmartReducer<\n\n Net,\n\n IdentityPlaceReducer,\n\n ParallelPlaceReducer,\n\n ParallelTransitionReducer,\n\n >,\n\n ChainReducer<Net, IdentityTransitionReducer, SourceSinkReducer>,\n\n >,\n\n ParallelPlaceReducer,\n\n ParallelTransitionReducer,\n","file_path":"pnets_shrink/src/main.rs","rank":62,"score":45895.95308670159},{"content":"fn write_output(\n\n net: &Net,\n\n modifications: &[Modification],\n\n args: Args,\n\n) -> Result<(), Box<dyn Error>> {\n\n info!(\"Start writing new net.\");\n\n let now = SystemTime::now();\n\n let mut buf_writer: Box<dyn Write> = match args.output.as_ref() {\n\n \"-\" => Box::new(stdout()),\n\n s => Box::new(File::create(s)?),\n\n };\n\n\n\n if args.equations {\n\n write_modifications(&modifications, buf_writer.as_mut(), &net)?;\n\n }\n\n ExporterBuilder::new(buf_writer.as_mut())\n\n .with_all_places(!args.clean)\n\n .with_disconnected_transitions(args.clean)\n\n .build()\n\n .export(&net.into())?;\n\n info!(\"Writing done: {:?}.\", now.elapsed()?);\n\n Ok(())\n\n}\n\n\n","file_path":"pnets_shrink/src/main.rs","rank":63,"score":45895.95308670159},{"content":"fn new_compact(\n\n args: &Args,\n\n) -> LoopReducer<Net, ChainReducer<Net, SimpleChainReducer, SimpleLoopAgglomeration>> {\n\n LoopReducer::new(\n\n ChainReducer::new2(SimpleChainReducer::new(), SimpleLoopAgglomeration::new()),\n\n args.max_iter,\n\n )\n\n}\n\n\n","file_path":"pnets_shrink/src/main.rs","rank":64,"score":45895.95308670159},{"content":"fn new_extra(\n\n args: &Args,\n\n) -> LoopReducer<\n\n Net,\n\n ChainReducer<Net, PseudoStart, ChainReducer<Net, RLReducer, WeightSimplification>>,\n\n> {\n\n LoopReducer::new(\n\n ChainReducer::new3(\n\n PseudoStart::new(),\n\n RLReducer::new(),\n\n WeightSimplification::new(),\n\n ),\n\n args.max_iter,\n\n )\n\n}\n\n\n","file_path":"pnets_shrink/src/main.rs","rank":65,"score":45895.95308670159},{"content":"fn new_redundant_compact(\n\n args: &Args,\n\n) -> LoopReducer<\n\n Net,\n\n ChainReducer<\n\n Net,\n\n SmartReducer<\n\n Net,\n\n ChainReducer<Net, IdentityPlaceReducer, SimpleLoopAgglomeration>,\n\n ParallelPlaceReducer,\n\n ParallelTransitionReducer,\n\n >,\n\n ChainReducer<\n\n Net,\n\n SmartReducer<\n\n Net,\n\n SimpleChainReducer,\n\n ChainReducer<Net, IdentityPlaceReducer, SourceSinkReducer>,\n\n IdentityTransitionReducer,\n\n >,\n","file_path":"pnets_shrink/src/main.rs","rank":66,"score":44854.690887524084},{"content":"fn new_compact_extra(\n\n args: &Args,\n\n) -> LoopReducer<\n\n Net,\n\n ChainReducer<\n\n Net,\n\n SimpleLoopAgglomeration,\n\n ChainReducer<\n\n Net,\n\n SimpleChainReducer,\n\n ChainReducer<Net, PseudoStart, ChainReducer<Net, RLReducer, WeightSimplification>>,\n\n >,\n\n >,\n\n> {\n\n LoopReducer::new(\n\n ChainReducer::new5(\n\n SimpleLoopAgglomeration::new(),\n\n SimpleChainReducer::new(),\n\n PseudoStart::new(),\n\n RLReducer::new(),\n\n WeightSimplification::new(),\n\n ),\n\n args.max_iter,\n\n )\n\n}\n\n\n","file_path":"pnets_shrink/src/main.rs","rank":67,"score":44854.690887524084},{"content":"fn new_redundant_extra(\n\n args: &Args,\n\n) -> LoopReducer<\n\n Net,\n\n ChainReducer<\n\n Net,\n\n SmartReducer<\n\n Net,\n\n ChainReducer<\n\n Net,\n\n SmartReducer<\n\n Net,\n\n IdentityPlaceReducer,\n\n ParallelPlaceReducer,\n\n ParallelTransitionReducer,\n\n >,\n\n ChainReducer<\n\n Net,\n\n IdentityTransitionReducer,\n\n ChainReducer<\n","file_path":"pnets_shrink/src/main.rs","rank":68,"score":44854.690887524084},{"content":"use pnets::Marking;\n\n\n\n#[test]\n","file_path":"pnets/tests/marking_tests.rs","rank":69,"score":44098.27558121698},{"content":"fn new_redundant_compact_extra(\n\n args: &Args,\n\n) -> LoopReducer<\n\n Net,\n\n ChainReducer<\n\n Net,\n\n SmartReducer<\n\n Net,\n\n ChainReducer<\n\n Net,\n\n SmartReducer<\n\n Net,\n\n ChainReducer<Net, IdentityPlaceReducer, SimpleLoopAgglomeration>,\n\n ParallelPlaceReducer,\n\n ParallelTransitionReducer,\n\n >,\n\n ChainReducer<\n\n Net,\n\n IdentityTransitionReducer,\n\n ChainReducer<\n","file_path":"pnets_shrink/src/main.rs","rank":70,"score":43876.8349133374},{"content":"fn main() -> Result<(), Box<dyn Error>> {\n\n let matches = App::new(\"Net print\")\n\n .version(\"1.0\")\n\n .author(\"Louis C. <louis.chauvet@free.fr>\")\n\n .about(\"Print a petri net from .net file\")\n\n .arg(\n\n Arg::with_name(\"INPUT\")\n\n .help(\"Sets the input file to use\")\n\n .required(true)\n\n .index(1),\n\n )\n\n .arg(\n\n Arg::with_name(\"CONTENT\")\n\n .help(\"Print net content\")\n\n .short(\"c\")\n\n .long(\"content\"),\n\n )\n\n .get_matches();\n\n\n\n let net = match matches.value_of(\"INPUT\") {\n","file_path":"pnets_print/src/main.rs","rank":72,"score":38085.206759697256},{"content":"fn main() -> Result<(), Box<dyn Error>> {\n\n let mut args = Args::parse();\n\n\n\n info!(\"Start parsing.\");\n\n let now = SystemTime::now();\n\n let buf_reader: Box<dyn BufRead> = match (args.input.as_ref(), args.format) {\n\n (\"-\", Format::Guess) => {\n\n args.format = Format::Net;\n\n Box::new(BufReader::new(stdin()))\n\n }\n\n (\"-\", _) => Box::new(BufReader::new(stdin())),\n\n (s, Format::Guess) => {\n\n if s.ends_with(\"pnml\") {\n\n args.format = Format::PNML;\n\n }\n\n Box::new(BufReader::new(File::open(s)?))\n\n }\n\n (s, _) => Box::new(BufReader::new(File::open(s)?)),\n\n };\n\n\n","file_path":"pnets_shrink/src/main.rs","rank":73,"score":38085.206759697256},{"content":" net.add_arc(arc::Kind::Consume(pl_6, tr_4, 1))?;\n\n net.add_arc(arc::Kind::Consume(pl_3, tr_4, 1))?;\n\n net.add_arc(arc::Kind::Consume(pl_3, tr_2, 1))?;\n\n net.add_arc(arc::Kind::Consume(pl_5, tr_3, 1))?;\n\n net.add_arc(arc::Kind::Consume(pl_4, tr_3, 1))?;\n\n net.add_arc(arc::Kind::Consume(pl_2, tr_3, 1))?;\n\n net.add_arc(arc::Kind::Consume(pl_1, tr_1, 1))?;\n\n net.add_arc(arc::Kind::Consume(pl_0, tr_0, 1))?;\n\n net.add_arc(arc::Kind::Produce(pl_3, tr_4, 1))?;\n\n net.add_arc(arc::Kind::Produce(pl_3, tr_0, 1))?;\n\n net.add_arc(arc::Kind::Produce(pl_4, tr_2, 1))?;\n\n net.add_arc(arc::Kind::Produce(pl_1, tr_0, 1))?;\n\n net.add_arc(arc::Kind::Produce(pl_0, tr_0, 1))?;\n\n\n\n // Get node id by its name\n\n println!(\n\n \"Place with name p0 has id {:?}\",\n\n net.get_index_by_name(\"p0\")\n\n );\n\n // Get node name\n\n println!(\n\n \"Transition with id {:?} has name {}\",\n\n NodeId::Transition(tr_0),\n\n net.get_name_by_index(&tr_0.into()).unwrap()\n\n );\n\n Ok(())\n\n}\n","file_path":"pnets/examples/net.rs","rank":74,"score":36528.95593387334},{"content":"use custom_derive::custom_derive;\n\nuse indexed_vec::Idx;\n\nuse newtype_derive::{\n\n newtype_as_item, newtype_fmt, newtype_wrap_bin_op, newtype_wrap_bin_op_assign, NewtypeAdd,\n\n NewtypeAddAssign, NewtypeDebug, NewtypeDisplay,\n\n};\n\n\n\ncustom_derive! {\n\n /// Represent a transition identifier in the net\n\n #[derive(\n\n Ord, PartialOrd, Clone, Copy, Eq, PartialEq, Hash,\n\n NewtypeDebug, NewtypeDisplay, NewtypeAddAssign(usize), Default, NewtypeAdd(usize)\n\n )]\n\n pub struct TransitionId(usize);\n\n}\n\n\n\nimpl Idx for TransitionId {\n\n fn new(v: usize) -> Self {\n\n Self::from(v)\n\n }\n","file_path":"pnets/src/net.rs","rank":75,"score":36528.35975460675},{"content":" net.rename_node(pl_4.into(), \"p4\")?;\n\n net.rename_node(pl_5.into(), \"p5\")?;\n\n net.rename_node(pl_6.into(), \"p6\")?;\n\n net.rename_node(tr_0.into(), \"t0\")?;\n\n net.rename_node(tr_1.into(), \"t1\")?;\n\n net.rename_node(tr_2.into(), \"t2\")?;\n\n net.rename_node(tr_3.into(), \"t3\")?;\n\n net.rename_node(tr_4.into(), \"t4\")?;\n\n\n\n // Set label for places and transitions\n\n net[tr_0].label = Some(\"a\".to_string());\n\n net[tr_1].label = Some(\"τ\".to_string());\n\n net[tr_3].label = Some(\"b\".to_string());\n\n net[tr_4].label = Some(\"c\".to_string());\n\n\n\n // Set initial values\n\n net[pl_0].initial = 5;\n\n net[pl_6].initial = 4;\n\n\n\n // Create arcs\n","file_path":"pnets/examples/net.rs","rank":76,"score":36525.74923945599},{"content":"use pnets::{arc, standard, NodeId};\n\nuse std::error::Error;\n\n\n","file_path":"pnets/examples/net.rs","rank":77,"score":36525.7391354408},{"content":" fn index(self) -> usize {\n\n self.0\n\n }\n\n}\n\n\n\nimpl ::std::convert::From<usize> for PlaceId {\n\n fn from(v: usize) -> Self {\n\n PlaceId(v)\n\n }\n\n}\n\n\n\nimpl ::std::convert::From<usize> for TransitionId {\n\n fn from(v: usize) -> Self {\n\n TransitionId(v)\n\n }\n\n}\n\n\n\n/// Represent an id in the net\n\n#[derive(Eq, PartialEq, Hash, Debug, Clone, Copy)]\n\npub enum NodeId {\n","file_path":"pnets/src/net.rs","rank":78,"score":36523.65559475027},{"content":"\n\n fn index(self) -> usize {\n\n self.0\n\n }\n\n}\n\n\n\ncustom_derive! {\n\n /// Represent a place identifier in the net\n\n #[derive(\n\n Ord, PartialOrd, Clone, Copy, Eq, PartialEq, Hash,\n\n NewtypeDebug, NewtypeDisplay, NewtypeAddAssign(usize), Default, NewtypeAdd(usize)\n\n )]\n\n pub struct PlaceId(usize);\n\n}\n\n\n\nimpl Idx for PlaceId {\n\n fn new(v: usize) -> Self {\n\n Self::from(v)\n\n }\n\n\n","file_path":"pnets/src/net.rs","rank":79,"score":36523.50886317843},{"content":" pub fn as_place(&self) -> Option<PlaceId> {\n\n match self {\n\n NodeId::Place(pl) => Some(*pl),\n\n NodeId::Transition(_) => None,\n\n }\n\n }\n\n\n\n /// Try to convert NodeId to TransitionId\n\n pub fn as_transition(&self) -> Option<TransitionId> {\n\n match self {\n\n NodeId::Place(_) => None,\n\n NodeId::Transition(tr) => Some(*tr),\n\n }\n\n }\n\n}\n","file_path":"pnets/src/net.rs","rank":80,"score":36521.2089029951},{"content":" /// Place\n\n Place(PlaceId),\n\n /// Transition\n\n Transition(TransitionId),\n\n}\n\n\n\nimpl From<TransitionId> for NodeId {\n\n fn from(tr: TransitionId) -> Self {\n\n Self::Transition(tr)\n\n }\n\n}\n\n\n\nimpl From<PlaceId> for NodeId {\n\n fn from(pl: PlaceId) -> Self {\n\n Self::Place(pl)\n\n }\n\n}\n\n\n\nimpl NodeId {\n\n /// Try to convert NodeId to PlaceId\n","file_path":"pnets/src/net.rs","rank":81,"score":36521.2089029951},{"content":"fn main() -> Result<(), Box<dyn Error>> {\n\n let pnml: Pnml = quick_xml::de::from_str(include_str!(\"HouseConstruction-002.pnml\"))?;\n\n let nets: Vec<standard::Net> = (&pnml).try_into()?;\n\n let pnml: Pnml = (&nets).into();\n\n println!(\"{:?}\", quick_xml::se::to_string(&pnml));\n\n Ok(())\n\n}\n","file_path":"pnets_pnml/examples/parse_pnml_file.rs","rank":82,"score":36399.07812135647},{"content":"fn main() -> Result<(), Box<dyn Error>> {\n\n let parser = pnets_tina::Parser::new(include_str!(\"sokoban_3.net\").as_bytes());\n\n let net = parser.parse().unwrap();\n\n let mut out = Box::new(stdout());\n\n let mut writer = ExporterBuilder::new(out.as_mut())\n\n .with_all_places(true)\n\n .with_disconnected_transitions(true)\n\n .build();\n\n writer.export(&net)?;\n\n Ok(())\n\n}\n","file_path":"pnets_tina/examples/parse_export_file.rs","rank":83,"score":36399.07812135647},{"content":"fn main() -> Result<(), Box<dyn Error>> {\n\n let ptnet: Ptnet = from_str(include_str!(\"HouseConstruction-002.pnml\"))?;\n\n let nets: Vec<standard::Net> = (&ptnet).try_into()?;\n\n println!(\"{:?}\", nets);\n\n let ptnet: Ptnet = (&nets).into();\n\n println!(\"{:?}\", quick_xml::se::to_string(&ptnet));\n\n Ok(())\n\n}\n","file_path":"pnets_pnml/examples/parse_ptnet_file.rs","rank":84,"score":36399.07812135647},{"content":" pub deleted_places: Vec<(PlaceId, isize)>,\n\n /// Constant to add at the end of equation\n\n pub constant: isize,\n\n}\n\n\n\n/// Deletion of several places because they are redundant with an other group of places.\n\n///\n\n/// The associated equation is [`Reduction::equals_to`] + [`Reduction::constant`] =\n\n/// [`Reduction::deleted_places`]\n\n#[derive(Clone, Debug, Eq, PartialEq)]\n\npub struct Reduction {\n\n /// Places which are kept during the modification\n\n ///\n\n /// This vector contains tuples ([`PlaceId`], [`isize`]) because sometimes you may need to add\n\n /// a weight on a specific place to keep the equation right.\n\n pub equals_to: Vec<(PlaceId, isize)>,\n\n /// Constant in the relation\n\n pub constant: isize,\n\n /// Places which are deleted during the modification\n\n ///\n","file_path":"pnets_shrink/src/modifications.rs","rank":85,"score":36361.223731237544},{"content":"/// [`InequalityReduction::constant`] => [`InequalityReduction::deleted_places`]\n\n#[derive(Clone, Debug, Eq, PartialEq)]\n\npub struct InequalityReduction {\n\n /// Places which are kept during the modification\n\n ///\n\n /// This vector contains tuples ([`PlaceId`], [`isize`]) because sometimes you may need to add\n\n /// a weight on a specific place to keep the equation right.\n\n pub kept_places: Vec<(PlaceId, isize)>,\n\n /// Constant in the relation\n\n pub constant: isize,\n\n /// Places which are deleted during the modification\n\n ///\n\n /// This vector contains tuples ([`PlaceId`], [`isize`]) because sometimes you may need to add\n\n /// a weight on a specific place to keep the equation right.\n\n pub deleted_places: Vec<(PlaceId, isize)>,\n\n}\n\n\n\n/// All reductions supported by this library\n\n#[derive(Clone, Debug, Eq, PartialEq)]\n\npub enum Modification {\n","file_path":"pnets_shrink/src/modifications.rs","rank":86,"score":36359.88456372542},{"content":"//! All modifications supported by this crate\n\n//!\n\n//! In this module you can found all modifications that are supported by this crate, you can found\n\n//! detailed explanation in structures documentation.\n\nuse pnets::{PlaceId, TransitionId};\n\n\n\n/// This modification correspond to an agglomeration of serval place in a unique new place.\n\n///\n\n/// The associated equation is [`Agglomeration::factor`] * [`Agglomeration::new_place`] =\n\n/// [`Agglomeration::deleted_places`] + [`Agglomeration::constant`]\n\n#[derive(Clone, Debug, Eq, PartialEq)]\n\npub struct Agglomeration {\n\n /// Place which is created during the modification\n\n pub new_place: PlaceId,\n\n /// Factor for new place in the equation\n\n pub factor: isize,\n\n /// Places which are deleted during the modification\n\n ///\n\n /// This vector contains tuples ([`PlaceId`], [`isize`]) because sometimes you may need to add\n\n /// a weight on a specific place to keep the equation right.\n","file_path":"pnets_shrink/src/modifications.rs","rank":87,"score":36357.473848769405},{"content":" /// This vector contains tuples ([`PlaceId`], [`isize`]) because sometimes you may need to add\n\n /// a weight on a specific place to keep the equation right.\n\n pub deleted_places: Vec<(PlaceId, isize)>,\n\n}\n\n\n\n/// Elimination of transitions\n\n///\n\n/// This reduction allows you to delete some transitions because they are redundant with others.\n\n/// There is no equations associated with this reduction\n\n#[derive(Clone, Debug, Eq, PartialEq)]\n\npub struct TransitionElimination {\n\n /// Deleted transitions\n\n pub deleted_transitions: Vec<TransitionId>,\n\n}\n\n\n\n/// Inequality reduction\n\n///\n\n/// This modification deletes some places because they are redundant with a group of other places.\n\n///\n\n/// The equation associated is [`InequalityReduction::kept_places`] +\n","file_path":"pnets_shrink/src/modifications.rs","rank":88,"score":36357.360357987935},{"content":" /// Agglomeration\n\n Agglomeration(Agglomeration),\n\n /// Reduction\n\n Reduction(Reduction),\n\n /// Transition elimination\n\n TransitionElimination(TransitionElimination),\n\n /// Inequality reduction\n\n InequalityReduction(InequalityReduction),\n\n}\n","file_path":"pnets_shrink/src/modifications.rs","rank":89,"score":36353.361915219466},{"content":"use std::error::Error;\n\n\n\nuse pnets::timed::{Net, TimeRange};\n\nuse pnets::{arc, NetError, NodeId};\n\nuse pnets::{PlaceId, TransitionId};\n\n\n\nuse crate::lexer::Lexer;\n\nuse crate::token;\n\nuse crate::token::Kind;\n\nuse crate::ParserError;\n\nuse std::io::BufRead;\n\n\n\n/// Position in a file\n\n#[derive(Copy, Clone, Debug, Eq, PartialEq)]\n\npub struct Position {\n\n /// Current line\n\n pub line: usize,\n\n /// Current column\n\n pub column: usize,\n\n}\n","file_path":"pnets_tina/src/parser.rs","rank":90,"score":35783.994890789654},{"content":"\n\n/// Exporter for [tina]() format.\n\n///\n\n/// It consume a reader and creates a [`pnets::timed::Net`]\n\npub struct Parser<R: BufRead> {\n\n lexer: Lexer<R>,\n\n net: Net,\n\n}\n\n\n\nimpl<R: BufRead> Parser<R> {\n\n /// Parse a timed net from a reader\n\n pub fn parse(mut self) -> Result<Net, Box<dyn Error>> {\n\n loop {\n\n let token = self.lexer.peek()?;\n\n\n\n match token.kind {\n\n token::Kind::NewLine | token::Kind::Comment(_) => {\n\n self.lexer.read()?;\n\n }\n\n token::Kind::Net => self.parse_net()?,\n","file_path":"pnets_tina/src/parser.rs","rank":91,"score":35783.871802124835},{"content":" ))),\n\n }\n\n }\n\n _ => Err(Box::new(ParserError::UnexpectedToken(\n\n token,\n\n \"Expected TokenKind::Identifier(_)\".to_string(),\n\n ))),\n\n }\n\n }\n\n\n\n /// Parse the net token\n\n fn parse_net(&mut self) -> Result<(), Box<dyn Error>> {\n\n self.lexer.read()?;\n\n let identifier = self.lexer.read()?;\n\n match identifier.kind {\n\n token::Kind::Identifier(id) => {\n\n self.net.name = id;\n\n Ok(())\n\n }\n\n _ => Err(Box::new(ParserError::UnexpectedToken(\n","file_path":"pnets_tina/src/parser.rs","rank":92,"score":35783.75408910578},{"content":" }\n\n }\n\n Ok(())\n\n }\n\n\n\n /// Parse a priority line\n\n fn parse_priority(&mut self) -> Result<(), Box<dyn Error>> {\n\n self.lexer.read()?;\n\n let mut pre = vec![];\n\n let mut post = vec![];\n\n while let token::Kind::Identifier(id) = self.lexer.peek()?.kind {\n\n self.lexer.read()?;\n\n pre.push(self.get_or_create_transition(&id)?);\n\n }\n\n let order = match self.lexer.read()?.kind {\n\n token::Kind::GreaterThan => false,\n\n token::Kind::LessThan => true,\n\n _ => {\n\n return Err(Box::new(ParserError::UnexpectedToken(\n\n self.lexer.current_token.clone(),\n","file_path":"pnets_tina/src/parser.rs","rank":93,"score":35783.36235761628},{"content":" /// let parser = Parser::new(&\"net Réseau\\ntr t0 p0 -> p1\\ntr t1 p1 -> p0\".as_bytes());\n\n /// ```\n\n pub fn new(reader: R) -> Self {\n\n Self {\n\n lexer: Lexer::new(reader),\n\n net: Net::default(),\n\n }\n\n }\n\n\n\n /// Get transition from net or create one\n\n fn get_or_create_transition(&mut self, name: &str) -> Result<TransitionId, Box<dyn Error>> {\n\n match self.net.get_index_by_name(name) {\n\n Some(NodeId::Transition(id)) => Ok(id),\n\n Some(NodeId::Place(_)) => Err(Box::new(NetError::DuplicatedName(name.to_string()))),\n\n None => {\n\n let tr = self.net.create_transition();\n\n self.net.rename_node(NodeId::Transition(tr), name)?;\n\n Ok(tr)\n\n }\n\n }\n","file_path":"pnets_tina/src/parser.rs","rank":94,"score":35782.921238715666},{"content":" }\n\n\n\n /// Get place from net or create one\n\n fn get_or_create_place(&mut self, name: &str) -> Result<PlaceId, Box<dyn Error>> {\n\n match self.net.get_index_by_name(name) {\n\n Some(NodeId::Place(id)) => Ok(id),\n\n Some(NodeId::Transition(_)) => {\n\n Err(Box::new(NetError::DuplicatedName(name.to_string())))\n\n }\n\n None => {\n\n let pl = self.net.create_place();\n\n self.net.rename_node(NodeId::Place(pl), name)?;\n\n Ok(pl)\n\n }\n\n }\n\n }\n\n\n\n /// Parse the label token\n\n fn parse_label(&mut self) -> Result<(), Box<dyn Error>> {\n\n self.lexer.read()?;\n","file_path":"pnets_tina/src/parser.rs","rank":95,"score":35780.97807600942},{"content":" ))),\n\n }\n\n }\n\n\n\n fn parse_transition_output_arc(\n\n &mut self,\n\n place: PlaceId,\n\n transition: TransitionId,\n\n ) -> Result<arc::Kind, Box<dyn Error>> {\n\n match self.lexer.peek()?.kind {\n\n token::Kind::NormalArc => {\n\n self.lexer.read()?;\n\n Ok(arc::Kind::Produce(place, transition, self.parse_int()?))\n\n }\n\n arc @ token::Kind::InhibitorArc\n\n | arc @ token::Kind::TestArc\n\n | arc @ token::Kind::StopWatchArc\n\n | arc @ token::Kind::StopWatchInhibitorArc => Err(Box::new(\n\n ParserError::UnexpectedArc(self.lexer.current_token.position, arc),\n\n )),\n","file_path":"pnets_tina/src/parser.rs","rank":96,"score":35780.256623394576},{"content":" self.lexer.read()?;\n\n value\n\n }\n\n _ => {\n\n return Err(Box::new(ParserError::UnexpectedToken(\n\n self.lexer.current_token.clone(),\n\n \"Expected TokenKind::Int(_)\".to_string(),\n\n )));\n\n }\n\n })\n\n }\n\n\n\n /// Try to parse arrow\n\n fn parse_arrow(&mut self) -> Result<(), Box<dyn Error>> {\n\n if self.lexer.read()?.kind == token::Kind::Arrow {\n\n Ok(())\n\n } else {\n\n Err(Box::new(ParserError::UnexpectedToken(\n\n self.lexer.current_token.clone(),\n\n \"Expected TokenKind::Arrow\".to_string(),\n","file_path":"pnets_tina/src/parser.rs","rank":97,"score":35779.918511627715},{"content":" let token = self.lexer.read()?;\n\n match token.kind {\n\n Kind::Identifier(identifier) => {\n\n let index = match self.net.get_index_by_name(&identifier) {\n\n None => return Err(Box::new(NetError::UnknownIdentifier(identifier))),\n\n Some(index) => index,\n\n };\n\n let token = self.lexer.read()?;\n\n match token.kind {\n\n Kind::Identifier(identifier) => {\n\n match index {\n\n NodeId::Place(pl) => self.net[pl].label = Some(identifier),\n\n NodeId::Transition(tr) => self.net[tr].label = Some(identifier),\n\n }\n\n Ok(())\n\n }\n\n\n\n _ => Err(Box::new(ParserError::UnexpectedToken(\n\n token,\n\n \"Expected TokenKind::Identifier(_)\".to_string(),\n","file_path":"pnets_tina/src/parser.rs","rank":98,"score":35779.91268461314},{"content":" token::Kind::Transition => self.parse_transition()?,\n\n token::Kind::Place => self.parse_place()?,\n\n token::Kind::Note => self.parse_note()?,\n\n token::Kind::Label => self.parse_label()?,\n\n token::Kind::Priority => self.parse_priority()?,\n\n token::Kind::EndOfFile => break,\n\n _ => {\n\n return Err(Box::new(ParserError::UnexpectedToken(\n\n token,\n\n \"This token can not start a line\".to_string(),\n\n )));\n\n }\n\n }\n\n }\n\n Ok(self.net)\n\n }\n\n\n\n /// Create a new parser from reader\n\n ///\n\n /// ```ignore\n","file_path":"pnets_tina/src/parser.rs","rank":99,"score":35779.84708460754}],"string":"[\n {\n \"content\": \"#[test]\\n\\nfn create_transition_with_used_name() {\\n\\n let mut net = Net::default();\\n\\n let tr_1 = net.create_transition();\\n\\n net.rename_node(NodeId::Transition(tr_1), \\\"tr_1\\\").unwrap();\\n\\n let tr_2 = net.create_transition();\\n\\n assert_eq!(net.transitions.len(), 2);\\n\\n assert_eq!(\\n\\n net.get_name_by_index(&NodeId::Transition(tr_1)).unwrap(),\\n\\n \\\"tr_1\\\".to_string()\\n\\n );\\n\\n assert_eq!(\\n\\n net.get_name_by_index(&NodeId::Transition(tr_2)).unwrap(),\\n\\n \\\"a1\\\".to_string()\\n\\n );\\n\\n assert_eq!(net[tr_1].label, None);\\n\\n assert_eq!(net[tr_2].label, None);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"pnets/tests/timed_net_tests.rs\",\n \"rank\": 0,\n \"score\": 143815.43828950217\n },\n {\n \"content\": \"#[test]\\n\\nfn create_place_with_used_name() {\\n\\n let mut net = Net::default();\\n\\n let pl_1 = net.create_place();\\n\\n net.rename_node(NodeId::Place(pl_1), \\\"pl_1\\\").unwrap();\\n\\n let pl_2 = net.create_place();\\n\\n assert_eq!(net.places.len(), 2);\\n\\n assert_eq!(\\n\\n net.get_name_by_index(&NodeId::Place(pl_1)).unwrap(),\\n\\n \\\"pl_1\\\".to_string()\\n\\n );\\n\\n assert_eq!(\\n\\n net.get_name_by_index(&NodeId::Place(pl_2)).unwrap(),\\n\\n \\\"a1\\\".to_string()\\n\\n );\\n\\n assert_eq!(net[pl_1].label, None);\\n\\n assert_eq!(net[pl_2].label, None);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"pnets/tests/standard_net_tests.rs\",\n \"rank\": 1,\n \"score\": 143815.43828950217\n },\n {\n \"content\": \"#[test]\\n\\nfn create_place_with_used_name() {\\n\\n let mut net = Net::default();\\n\\n let pl_1 = net.create_place();\\n\\n net.rename_node(NodeId::Place(pl_1), \\\"pl_1\\\").unwrap();\\n\\n let pl_2 = net.create_place();\\n\\n assert_eq!(net.places.len(), 2);\\n\\n assert_eq!(\\n\\n net.get_name_by_index(&NodeId::Place(pl_1)).unwrap(),\\n\\n \\\"pl_1\\\".to_string()\\n\\n );\\n\\n assert_eq!(\\n\\n net.get_name_by_index(&NodeId::Place(pl_2)).unwrap(),\\n\\n \\\"a1\\\".to_string()\\n\\n );\\n\\n assert_eq!(net[pl_1].label, None);\\n\\n assert_eq!(net[pl_2].label, None);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"pnets/tests/timed_net_tests.rs\",\n \"rank\": 2,\n \"score\": 143815.43828950217\n },\n {\n \"content\": \"#[test]\\n\\nfn create_transition_with_used_name() {\\n\\n let mut net = Net::default();\\n\\n let tr_1 = net.create_transition();\\n\\n net.rename_node(NodeId::Transition(tr_1), \\\"tr_1\\\").unwrap();\\n\\n let tr_2 = net.create_transition();\\n\\n assert_eq!(net.transitions.len(), 2);\\n\\n assert_eq!(\\n\\n net.get_name_by_index(&NodeId::Transition(tr_1)).unwrap(),\\n\\n \\\"tr_1\\\".to_string()\\n\\n );\\n\\n assert_eq!(\\n\\n net.get_name_by_index(&NodeId::Transition(tr_2)).unwrap(),\\n\\n \\\"a1\\\".to_string()\\n\\n );\\n\\n assert_eq!(net[tr_1].label, None);\\n\\n assert_eq!(net[tr_2].label, None);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"pnets/tests/standard_net_tests.rs\",\n \"rank\": 3,\n \"score\": 143815.43828950217\n },\n {\n \"content\": \"#[test]\\n\\nfn transition_test() {\\n\\n let parser =\\n\\n pnets_tina::Parser::new(\\\"tr t0 : transition_label [1,5] p0*3 p2?4 p3?-2 -> p1\\\".as_bytes());\\n\\n\\n\\n let net = parser.parse().unwrap();\\n\\n\\n\\n // Check if all places and transitions are created\\n\\n let t0: TransitionId = net\\n\\n .get_index_by_name(&\\\"t0\\\".to_string())\\n\\n .unwrap()\\n\\n .as_transition()\\n\\n .unwrap();\\n\\n let p0 = net\\n\\n .get_index_by_name(&\\\"p0\\\".to_string())\\n\\n .unwrap()\\n\\n .as_place()\\n\\n .unwrap();\\n\\n let p1: PlaceId = net\\n\\n .get_index_by_name(&\\\"p1\\\".to_string())\\n\\n .unwrap()\\n\",\n \"file_path\": \"pnets_tina/tests/parser_tests.rs\",\n \"rank\": 4,\n \"score\": 123087.95619426854\n },\n {\n \"content\": \"#[test]\\n\\nfn place_test() {\\n\\n let parser = pnets_tina::Parser::new(\\\"pl p0 : label (43K) t0 -> t1 t2?1M t3?-2K\\\".as_bytes());\\n\\n let net = parser.parse().unwrap();\\n\\n println!(\\\"{:?}\\\", net);\\n\\n\\n\\n let p0 = net\\n\\n .get_index_by_name(&\\\"p0\\\".to_string())\\n\\n .unwrap()\\n\\n .as_place()\\n\\n .unwrap();\\n\\n let t0 = net\\n\\n .get_index_by_name(&\\\"t0\\\".to_string())\\n\\n .unwrap()\\n\\n .as_transition()\\n\\n .unwrap();\\n\\n let t1 = net\\n\\n .get_index_by_name(&\\\"t1\\\".to_string())\\n\\n .unwrap()\\n\\n .as_transition()\\n\\n .unwrap();\\n\",\n \"file_path\": \"pnets_tina/tests/parser_tests.rs\",\n \"rank\": 5,\n \"score\": 123087.95619426854\n },\n {\n \"content\": \"#[test]\\n\\nfn note_test() {\\n\\n let parser = pnets_tina::Parser::new(\\\"nt note 0 {This is a note}\\\".as_bytes());\\n\\n parser.parse().unwrap();\\n\\n}\\n\\n\\n\",\n \"file_path\": \"pnets_tina/tests/parser_tests.rs\",\n \"rank\": 6,\n \"score\": 123087.95619426854\n },\n {\n \"content\": \"#[test]\\n\\nfn sokoban_3_test() {\\n\\n let parser = pnets_tina::Parser::new(include_str!(\\\"sokoban_3.net\\\").as_bytes());\\n\\n parser.parse().unwrap();\\n\\n}\\n\",\n \"file_path\": \"pnets_tina/tests/parser_tests.rs\",\n \"rank\": 7,\n \"score\": 123087.95619426854\n },\n {\n \"content\": \"#[test]\\n\\nfn priority_test() {\\n\\n let parser = pnets_tina::Parser::new(\\\"\\\".as_bytes());\\n\\n parser.parse().unwrap();\\n\\n}\\n\\n\\n\",\n \"file_path\": \"pnets_tina/tests/parser_tests.rs\",\n \"rank\": 8,\n \"score\": 123087.95619426854\n },\n {\n \"content\": \"#[test]\\n\\nfn name_test() {\\n\\n let parser = pnets_tina::Parser::new(\\\"net Name\\\".as_bytes());\\n\\n let net = parser.parse().unwrap();\\n\\n assert_eq!(net.name, \\\"Name\\\".to_string())\\n\\n}\\n\\n\\n\\n// Should panic because lb is not implemented\\n\",\n \"file_path\": \"pnets_tina/tests/parser_tests.rs\",\n \"rank\": 9,\n \"score\": 123087.95619426854\n },\n {\n \"content\": \"#[test]\\n\\nfn abp_test() {\\n\\n let parser = pnets_tina::Parser::new(include_str!(\\\"abp.net\\\").as_bytes());\\n\\n parser.parse().unwrap();\\n\\n}\\n\\n\\n\",\n \"file_path\": \"pnets_tina/tests/parser_tests.rs\",\n \"rank\": 10,\n \"score\": 123087.95619426854\n },\n {\n \"content\": \"#[test]\\n\\nfn label_test() {\\n\\n let parser = pnets_tina::Parser::new(\\n\\n \\\"tr t0 p0 -> p1\\\\nlb t0 {transition}\\\\nlb p0 {place 0}\\\\nlb p1 {place 1}\\\".as_bytes(),\\n\\n );\\n\\n let net = parser.parse().unwrap();\\n\\n let t0 = net\\n\\n .get_index_by_name(\\\"t0\\\")\\n\\n .unwrap()\\n\\n .as_transition()\\n\\n .unwrap();\\n\\n assert_eq!(net[t0].label, Some(\\\"transition\\\".to_string()));\\n\\n let p0 = net.get_index_by_name(\\\"p0\\\").unwrap().as_place().unwrap();\\n\\n assert_eq!(net[p0].label, Some(\\\"place 0\\\".to_string()));\\n\\n let p1 = net.get_index_by_name(\\\"p1\\\").unwrap().as_place().unwrap();\\n\\n assert_eq!(net[p1].label, Some(\\\"place 1\\\".to_string()));\\n\\n}\\n\\n\\n\",\n \"file_path\": \"pnets_tina/tests/parser_tests.rs\",\n \"rank\": 11,\n \"score\": 123087.95619426854\n },\n {\n \"content\": \"#[test]\\n\\nfn demo_test() {\\n\\n let parser = pnets_tina::Parser::new(include_str!(\\\"demo.net\\\").as_bytes());\\n\\n parser.parse().unwrap();\\n\\n}\\n\\n\\n\",\n \"file_path\": \"pnets_tina/tests/parser_tests.rs\",\n \"rank\": 12,\n \"score\": 123087.95619426854\n },\n {\n \"content\": \"#[test]\\n\\nfn ifip_test() {\\n\\n let parser = pnets_tina::Parser::new(include_str!(\\\"ifip.net\\\").as_bytes());\\n\\n parser.parse().unwrap();\\n\\n}\\n\\n\\n\",\n \"file_path\": \"pnets_tina/tests/parser_tests.rs\",\n \"rank\": 13,\n \"score\": 123087.95619426854\n },\n {\n \"content\": \"#[test]\\n\\nfn places() {\\n\\n let mut net = Net::default();\\n\\n let tr = net.create_transition();\\n\\n let pl = net.create_place();\\n\\n net.add_arc(Kind::Consume(pl, tr, 1)).unwrap();\\n\\n net.add_arc(Kind::Produce(pl, tr, 1)).unwrap();\\n\\n assert_eq!(net[pl].id(), pl);\\n\\n assert_eq!(net[pl].is_disconnected(), false);\\n\\n net.delete_place(pl);\\n\\n assert_eq!(net[pl].is_disconnected(), true);\\n\\n assert_eq!(net[pl].id(), pl);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"pnets/tests/standard_net_tests.rs\",\n \"rank\": 14,\n \"score\": 121138.08552991209\n },\n {\n \"content\": \"#[test]\\n\\nfn transition() {\\n\\n let mut net = Net::default();\\n\\n let tr = net.create_transition();\\n\\n let pl = net.create_place();\\n\\n net.add_arc(Kind::Consume(pl, tr, 1)).unwrap();\\n\\n net.add_arc(Kind::Produce(pl, tr, 1)).unwrap();\\n\\n assert_eq!(net[tr].id(), tr);\\n\\n assert_eq!(net[tr].is_disconnected(), false);\\n\\n net.delete_transition(tr);\\n\\n assert_eq!(net[tr].is_disconnected(), true);\\n\\n assert_eq!(net[tr].id(), tr);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"pnets/tests/standard_net_tests.rs\",\n \"rank\": 15,\n \"score\": 121138.08552991209\n },\n {\n \"content\": \"#[test]\\n\\nfn places() {\\n\\n let mut net = Net::default();\\n\\n let tr = net.create_transition();\\n\\n let pl = net.create_place();\\n\\n net.add_arc(Kind::Consume(pl, tr, 1)).unwrap();\\n\\n net.add_arc(Kind::Produce(pl, tr, 1)).unwrap();\\n\\n net.add_arc(Kind::Inhibitor(pl, tr, 1)).unwrap();\\n\\n net.add_arc(Kind::Test(pl, tr, 1)).unwrap();\\n\\n assert_eq!(net[pl].id(), pl);\\n\\n assert_eq!(net[pl].is_disconnected(), false);\\n\\n net.delete_place(pl);\\n\\n assert_eq!(net[pl].is_disconnected(), true);\\n\\n assert_eq!(net[pl].id(), pl);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"pnets/tests/timed_net_tests.rs\",\n \"rank\": 16,\n \"score\": 121138.08552991209\n },\n {\n \"content\": \"#[test]\\n\\nfn transition() {\\n\\n let mut net = Net::default();\\n\\n let tr = net.create_transition();\\n\\n let pl = net.create_place();\\n\\n net.add_arc(Kind::Consume(pl, tr, 1)).unwrap();\\n\\n net.add_arc(Kind::Produce(pl, tr, 1)).unwrap();\\n\\n net.add_arc(Kind::Inhibitor(pl, tr, 1)).unwrap();\\n\\n net.add_arc(Kind::Test(pl, tr, 1)).unwrap();\\n\\n assert_eq!(net[tr].id(), tr);\\n\\n assert_eq!(net[tr].is_disconnected(), false);\\n\\n net.delete_transition(tr);\\n\\n assert_eq!(net[tr].is_disconnected(), true);\\n\\n assert_eq!(net[tr].id(), tr);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"pnets/tests/timed_net_tests.rs\",\n \"rank\": 17,\n \"score\": 121138.08552991209\n },\n {\n \"content\": \"#[test]\\n\\nfn update_priorities_test() {\\n\\n let mut net = Net::default();\\n\\n let t0 = net.create_transition();\\n\\n let t1 = net.create_transition();\\n\\n let t2 = net.create_transition();\\n\\n let t3 = net.create_transition();\\n\\n\\n\\n net.add_priority(t0, t1);\\n\\n net.add_priority(t0, t2);\\n\\n net.add_priority(t1, t2);\\n\\n net.add_priority(t2, t3);\\n\\n\\n\\n assert!(net.update_priorities().is_ok());\\n\\n assert_eq!(net[t0].priorities, vec![t1, t2, t3]);\\n\\n assert_eq!(net[t1].priorities, vec![t2, t3]);\\n\\n assert_eq!(net[t2].priorities, vec![t3]);\\n\\n assert_eq!(net[t3].priorities, vec![]);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"pnets/tests/timed_net_tests.rs\",\n \"rank\": 18,\n \"score\": 119993.4805131504\n },\n {\n \"content\": \"#[test]\\n\\nfn create_transition() {\\n\\n let mut net = Net::default();\\n\\n let i = net.create_transition();\\n\\n assert_eq!(net.transitions.len(), 1);\\n\\n assert_eq!(\\n\\n net.get_name_by_index(&NodeId::Transition(i)).unwrap(),\\n\\n \\\"0\\\".to_string()\\n\\n )\\n\\n}\\n\\n\\n\",\n \"file_path\": \"pnets/tests/timed_net_tests.rs\",\n \"rank\": 19,\n \"score\": 118206.14284224808\n },\n {\n \"content\": \"#[test]\\n\\nfn rename_node() {\\n\\n let mut net = Net::default();\\n\\n let tr = net.create_transition();\\n\\n let pl = net.create_place();\\n\\n assert_eq!(\\n\\n net.get_name_by_index(&NodeId::Transition(tr)),\\n\\n Some(\\\"0\\\".to_string())\\n\\n );\\n\\n assert_eq!(\\n\\n net.get_name_by_index(&NodeId::Place(pl)),\\n\\n Some(\\\"1\\\".to_string())\\n\\n );\\n\\n assert_eq!(net.rename_node(NodeId::Place(pl), \\\"pl\\\"), Ok(()));\\n\\n assert_eq!(net.rename_node(NodeId::Transition(tr), \\\"tr\\\"), Ok(()));\\n\\n assert_eq!(\\n\\n net.get_name_by_index(&NodeId::Transition(tr)),\\n\\n Some(\\\"tr\\\".to_string())\\n\\n );\\n\\n assert_eq!(\\n\\n net.get_name_by_index(&NodeId::Place(pl)),\\n\",\n \"file_path\": \"pnets/tests/timed_net_tests.rs\",\n \"rank\": 20,\n \"score\": 118206.14284224808\n },\n {\n \"content\": \"#[test]\\n\\nfn create_place() {\\n\\n let mut net = Net::default();\\n\\n let i = net.create_place();\\n\\n assert_eq!(net.places.len(), 1);\\n\\n assert_eq!(\\n\\n net.get_name_by_index(&NodeId::Place(i)).unwrap(),\\n\\n \\\"0\\\".to_string()\\n\\n );\\n\\n assert_eq!(net[i].label, None);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"pnets/tests/timed_net_tests.rs\",\n \"rank\": 21,\n \"score\": 118206.14284224808\n },\n {\n \"content\": \"#[test]\\n\\nfn create_transition() {\\n\\n let mut net = Net::default();\\n\\n let i = net.create_transition();\\n\\n assert_eq!(net.transitions.len(), 1);\\n\\n assert_eq!(\\n\\n net.get_name_by_index(&NodeId::Transition(i)).unwrap(),\\n\\n \\\"0\\\".to_string()\\n\\n )\\n\\n}\\n\\n\\n\",\n \"file_path\": \"pnets/tests/standard_net_tests.rs\",\n \"rank\": 22,\n \"score\": 118206.14284224808\n },\n {\n \"content\": \"#[test]\\n\\nfn rename_node() {\\n\\n let mut net = Net::default();\\n\\n let tr = net.create_transition();\\n\\n let pl = net.create_place();\\n\\n assert_eq!(\\n\\n net.get_name_by_index(&NodeId::Transition(tr)),\\n\\n Some(\\\"0\\\".to_string())\\n\\n );\\n\\n assert_eq!(\\n\\n net.get_name_by_index(&NodeId::Place(pl)),\\n\\n Some(\\\"1\\\".to_string())\\n\\n );\\n\\n assert_eq!(net.rename_node(NodeId::Place(pl), \\\"pl\\\"), Ok(()));\\n\\n assert_eq!(net.rename_node(NodeId::Transition(tr), \\\"tr\\\"), Ok(()));\\n\\n assert_eq!(\\n\\n net.get_name_by_index(&NodeId::Transition(tr)),\\n\\n Some(\\\"tr\\\".to_string())\\n\\n );\\n\\n assert_eq!(\\n\\n net.get_name_by_index(&NodeId::Place(pl)),\\n\",\n \"file_path\": \"pnets/tests/standard_net_tests.rs\",\n \"rank\": 23,\n \"score\": 118206.14284224808\n },\n {\n \"content\": \"#[test]\\n\\nfn create_place() {\\n\\n let mut net = Net::default();\\n\\n let i = net.create_place();\\n\\n assert_eq!(net.places.len(), 1);\\n\\n assert_eq!(\\n\\n net.get_name_by_index(&NodeId::Place(i)).unwrap(),\\n\\n \\\"0\\\".to_string()\\n\\n );\\n\\n assert_eq!(net[i].label, None);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"pnets/tests/standard_net_tests.rs\",\n \"rank\": 24,\n \"score\": 118206.14284224808\n },\n {\n \"content\": \"#[test]\\n\\nfn name_test_invalid_identifier() {\\n\\n let parser = pnets_tina::Parser::new(\\\"net *\\\".as_bytes());\\n\\n assert_eq!(parser.parse().is_ok(), false);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"pnets_tina/tests/parser_tests.rs\",\n \"rank\": 25,\n \"score\": 117946.6631700272\n },\n {\n \"content\": \"#[test]\\n\\nfn node_transition_cast_test() {\\n\\n let tr = TransitionId::from(0);\\n\\n assert_eq!(\\n\\n NodeId::Transition(tr).as_transition(),\\n\\n Some(TransitionId::from(0))\\n\\n );\\n\\n assert_eq!(NodeId::Transition(tr).as_place(), None);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"pnets/tests/timed_net_tests.rs\",\n \"rank\": 26,\n \"score\": 117504.12186480532\n },\n {\n \"content\": \"#[test]\\n\\nfn node_place_cast_test() {\\n\\n let pl = PlaceId::from(0);\\n\\n assert_eq!(NodeId::Place(pl).as_transition(), None);\\n\\n assert_eq!(NodeId::Place(pl).as_place(), Some(PlaceId::from(0)));\\n\\n}\\n\",\n \"file_path\": \"pnets/tests/standard_net_tests.rs\",\n \"rank\": 27,\n \"score\": 117504.12186480532\n },\n {\n \"content\": \"#[test]\\n\\nfn node_transition_cast_test() {\\n\\n let tr = TransitionId::from(0);\\n\\n assert_eq!(\\n\\n NodeId::Transition(tr).as_transition(),\\n\\n Some(TransitionId::from(0))\\n\\n );\\n\\n assert_eq!(NodeId::Transition(tr).as_place(), None);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"pnets/tests/standard_net_tests.rs\",\n \"rank\": 28,\n \"score\": 117504.12186480532\n },\n {\n \"content\": \"#[test]\\n\\nfn node_place_cast_test() {\\n\\n let pl = PlaceId::from(0);\\n\\n assert_eq!(NodeId::Place(pl).as_transition(), None);\\n\\n assert_eq!(NodeId::Place(pl).as_place(), Some(PlaceId::from(0)));\\n\\n}\\n\",\n \"file_path\": \"pnets/tests/timed_net_tests.rs\",\n \"rank\": 29,\n \"score\": 117504.12186480532\n },\n {\n \"content\": \"#[test]\\n\\nfn test_get() {\\n\\n let mut marking: Marking<usize> = Default::default();\\n\\n marking.insert_or_add(2, 2);\\n\\n marking.insert_or_add(1, 3);\\n\\n marking.insert_or_add(3, 1);\\n\\n marking.insert_or_add(5, 5);\\n\\n\\n\\n assert_eq!(marking[1], 3);\\n\\n assert_eq!(marking[2], 2);\\n\\n assert_eq!(marking[3], 1);\\n\\n assert_eq!(marking[4], 0);\\n\\n assert_eq!(marking[5], 5);\\n\\n assert_eq!(marking[52], 0);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"pnets/tests/marking_tests.rs\",\n \"rank\": 32,\n \"score\": 92419.59790721169\n },\n {\n \"content\": \"#[test]\\n\\nfn test_insert_or_add() {\\n\\n let mut marking: Marking<usize> = Default::default();\\n\\n marking.insert_or_add(2, 2);\\n\\n marking.insert_or_add(1, 3);\\n\\n marking.insert_or_add(3, 1);\\n\\n marking.insert_or_add(2, 2);\\n\\n marking.insert_or_add(5, 5);\\n\\n marking.insert_or_add(4, 4);\\n\\n\\n\\n assert_eq!(marking[1], 3);\\n\\n assert_eq!(marking[2], 4);\\n\\n assert_eq!(marking[3], 1);\\n\\n assert_eq!(marking[4], 4);\\n\\n assert_eq!(marking[5], 5);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"pnets/tests/marking_tests.rs\",\n \"rank\": 33,\n \"score\": 90683.90354554896\n },\n {\n \"content\": \"#[test]\\n\\nfn test_insert_or_max() {\\n\\n let mut marking: Marking<usize> = Default::default();\\n\\n marking.insert_or_max(2, 2);\\n\\n marking.insert_or_max(2, 3);\\n\\n marking.insert_or_max(2, 2);\\n\\n marking.insert_or_max(5, 5);\\n\\n marking.insert_or_max(4, 4);\\n\\n\\n\\n assert_eq!(marking[2], 3);\\n\\n assert_eq!(marking[4], 4);\\n\\n assert_eq!(marking[5], 5);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"pnets/tests/marking_tests.rs\",\n \"rank\": 34,\n \"score\": 90683.90354554896\n },\n {\n \"content\": \"#[test]\\n\\nfn test_insert_or_min() {\\n\\n let mut marking: Marking<usize> = Default::default();\\n\\n marking.insert_or_min(2, 2);\\n\\n marking.insert_or_min(1, 3);\\n\\n marking.insert_or_min(1, 1);\\n\\n marking.insert_or_min(2, 2);\\n\\n marking.insert_or_min(5, 5);\\n\\n marking.insert_or_min(4, 4);\\n\\n\\n\\n assert_eq!(marking[1], 1);\\n\\n assert_eq!(marking[2], 2);\\n\\n assert_eq!(marking[4], 4);\\n\\n assert_eq!(marking[5], 5);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"pnets/tests/marking_tests.rs\",\n \"rank\": 35,\n \"score\": 90683.90354554896\n },\n {\n \"content\": \"#[test]\\n\\nfn test_dual_iterator_right() {\\n\\n let marking_1: Marking<usize> = Default::default();\\n\\n let mut marking_2: Marking<usize> = Default::default();\\n\\n marking_2.insert_or_max(0, 1);\\n\\n marking_2.insert_or_max(1, 1);\\n\\n marking_2.insert_or_max(2, 1);\\n\\n for (idx, v1, v2) in marking_1.iter_with(&marking_2) {\\n\\n assert_eq!(v1, marking_1[idx]);\\n\\n assert_eq!(v2, marking_2[idx]);\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"pnets/tests/marking_tests.rs\",\n \"rank\": 36,\n \"score\": 89032.04317986383\n },\n {\n \"content\": \"#[test]\\n\\nfn test_dual_iterator_left() {\\n\\n let mut marking_1: Marking<usize> = Default::default();\\n\\n let marking_2: Marking<usize> = Default::default();\\n\\n marking_1.insert_or_max(0, 1);\\n\\n marking_1.insert_or_max(1, 1);\\n\\n marking_1.insert_or_max(2, 1);\\n\\n for (idx, v1, v2) in marking_1.iter_with(&marking_2) {\\n\\n assert_eq!(v1, marking_1[idx]);\\n\\n assert_eq!(v2, marking_2[idx]);\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"pnets/tests/marking_tests.rs\",\n \"rank\": 37,\n \"score\": 89032.04317986383\n },\n {\n \"content\": \"#[test]\\n\\nfn test_dual_iterator_rand() {\\n\\n let mut marking_1: Marking<usize> = Default::default();\\n\\n let mut marking_2: Marking<usize> = Default::default();\\n\\n for _ in 0..fastrand::usize(0..1000) {\\n\\n marking_1.insert_or_max(\\n\\n fastrand::usize(0..usize::MAX),\\n\\n fastrand::usize(0..usize::MAX),\\n\\n );\\n\\n }\\n\\n for _ in 0..fastrand::usize(0..1000) {\\n\\n marking_2.insert_or_max(\\n\\n fastrand::usize(0..usize::MAX),\\n\\n fastrand::usize(0..usize::MAX),\\n\\n );\\n\\n }\\n\\n for (idx, v1, v2) in marking_1.iter_with(&marking_2) {\\n\\n assert_eq!(v1, marking_1[idx]);\\n\\n assert_eq!(v2, marking_2[idx]);\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"pnets/tests/marking_tests.rs\",\n \"rank\": 38,\n \"score\": 89032.04317986383\n },\n {\n \"content\": \"fn write_modifications(\\n\\n modifications: &[Modification],\\n\\n writer: &mut dyn Write,\\n\\n net: &Net,\\n\\n) -> Result<(), Box<dyn Error>> {\\n\\n writer.write_all(\\\"# generated equations\\\\n\\\".as_ref())?;\\n\\n for modification in modifications {\\n\\n match modification {\\n\\n Modification::Agglomeration(agg) => {\\n\\n if agg.factor == 1 {\\n\\n writer.write_all(\\n\\n format!(\\n\\n \\\"# A |- {} = \\\",\\n\\n net.get_name_by_index(&NodeId::Place(agg.new_place))\\n\\n .unwrap()\\n\\n )\\n\\n .as_ref(),\\n\\n )?;\\n\\n } else {\\n\\n writer.write_all(\\n\",\n \"file_path\": \"pnets_shrink/src/main.rs\",\n \"rank\": 44,\n \"score\": 79887.20780185173\n },\n {\n \"content\": \" let t2 = net\\n\\n .get_index_by_name(&\\\"t2\\\".to_string())\\n\\n .unwrap()\\n\\n .as_transition()\\n\\n .unwrap();\\n\\n let t3 = net\\n\\n .get_index_by_name(&\\\"t3\\\".to_string())\\n\\n .unwrap()\\n\\n .as_transition()\\n\\n .unwrap();\\n\\n\\n\\n assert_eq!(net.get_name_by_index(&t0.into()).unwrap(), \\\"t0\\\".to_string());\\n\\n assert_eq!(net.get_name_by_index(&t1.into()).unwrap(), \\\"t1\\\".to_string());\\n\\n assert_eq!(net.get_name_by_index(&t2.into()).unwrap(), \\\"t2\\\".to_string());\\n\\n assert_eq!(net.get_name_by_index(&t3.into()).unwrap(), \\\"t3\\\".to_string());\\n\\n assert_eq!(net.get_name_by_index(&p0.into()).unwrap(), \\\"p0\\\".to_string());\\n\\n\\n\\n assert_eq!(net[p0].label, Some(\\\"label\\\".to_string()));\\n\\n assert_eq!(net[p0].initial, 43000);\\n\\n\\n\",\n \"file_path\": \"pnets_tina/tests/parser_tests.rs\",\n \"rank\": 45,\n \"score\": 77744.59969557908\n },\n {\n \"content\": \" .as_place()\\n\\n .unwrap();\\n\\n let p2: PlaceId = net\\n\\n .get_index_by_name(&\\\"p2\\\".to_string())\\n\\n .unwrap()\\n\\n .as_place()\\n\\n .unwrap();\\n\\n let p3: PlaceId = net\\n\\n .get_index_by_name(&\\\"p3\\\".to_string())\\n\\n .unwrap()\\n\\n .as_place()\\n\\n .unwrap();\\n\\n\\n\\n assert_eq!(\\n\\n net.get_name_by_index(&NodeId::Transition(t0)).unwrap(),\\n\\n \\\"t0\\\".to_string()\\n\\n );\\n\\n assert_eq!(\\n\\n net.get_name_by_index(&NodeId::Place(p0)).unwrap(),\\n\\n \\\"p0\\\".to_string()\\n\",\n \"file_path\": \"pnets_tina/tests/parser_tests.rs\",\n \"rank\": 46,\n \"score\": 77744.31463129037\n },\n {\n \"content\": \"use pnets::timed::{Bound, TimeRange};\\n\\nuse pnets::{NodeId, PlaceId, TransitionId};\\n\\n\\n\\n#[test]\\n\",\n \"file_path\": \"pnets_tina/tests/parser_tests.rs\",\n \"rank\": 47,\n \"score\": 77743.64032938647\n },\n {\n \"content\": \" );\\n\\n assert_eq!(\\n\\n net.get_name_by_index(&NodeId::Place(p1)).unwrap(),\\n\\n \\\"p1\\\".to_string()\\n\\n );\\n\\n assert_eq!(\\n\\n net.get_name_by_index(&NodeId::Place(p2)).unwrap(),\\n\\n \\\"p2\\\".to_string()\\n\\n );\\n\\n assert_eq!(\\n\\n net.get_name_by_index(&NodeId::Place(p3)).unwrap(),\\n\\n \\\"p3\\\".to_string()\\n\\n );\\n\\n\\n\\n // Check transition information\\n\\n assert_eq!(\\n\\n net[t0].time,\\n\\n TimeRange {\\n\\n start: Bound::Closed(1),\\n\\n end: Bound::Closed(5),\\n\",\n \"file_path\": \"pnets_tina/tests/parser_tests.rs\",\n \"rank\": 48,\n \"score\": 77743.36062319315\n },\n {\n \"content\": \" assert_eq!(net[p2].produced_by[t0], 0);\\n\\n assert_eq!(net[p3].produced_by[t0], 0);\\n\\n\\n\\n assert_eq!(net[t0].conditions[p0], 0);\\n\\n assert_eq!(net[t0].conditions[p1], 0);\\n\\n assert_eq!(net[t0].conditions[p2], 4);\\n\\n assert_eq!(net[t0].conditions[p3], 0);\\n\\n\\n\\n assert_eq!(net[p0].condition_for[t0], 0);\\n\\n assert_eq!(net[p1].condition_for[t0], 0);\\n\\n assert_eq!(net[p2].condition_for[t0], 4);\\n\\n assert_eq!(net[p3].condition_for[t0], 0);\\n\\n\\n\\n assert_eq!(net[t0].inhibitors[p0], 0);\\n\\n assert_eq!(net[t0].inhibitors[p1], 0);\\n\\n assert_eq!(net[t0].inhibitors[p2], 0);\\n\\n assert_eq!(net[t0].inhibitors[p3], 2);\\n\\n\\n\\n assert_eq!(net[p0].inhibitor_for[t0], 0);\\n\\n assert_eq!(net[p1].inhibitor_for[t0], 0);\\n\\n assert_eq!(net[p2].inhibitor_for[t0], 0);\\n\\n assert_eq!(net[p3].inhibitor_for[t0], 2);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"pnets_tina/tests/parser_tests.rs\",\n \"rank\": 49,\n \"score\": 77740.2971454341\n },\n {\n \"content\": \" assert_eq!(net[t0].produce[p0], 1);\\n\\n assert_eq!(net[t1].produce[p0], 0);\\n\\n assert_eq!(net[t2].produce[p0], 0);\\n\\n assert_eq!(net[t3].produce[p0], 0);\\n\\n\\n\\n assert_eq!(net[p0].produced_by[t0], 1);\\n\\n assert_eq!(net[p0].produced_by[t1], 0);\\n\\n assert_eq!(net[p0].produced_by[t2], 0);\\n\\n assert_eq!(net[p0].produced_by[t3], 0);\\n\\n\\n\\n assert_eq!(net[t0].consume[p0], 0);\\n\\n assert_eq!(net[t1].consume[p0], 1);\\n\\n assert_eq!(net[t2].consume[p0], 0);\\n\\n assert_eq!(net[t3].consume[p0], 0);\\n\\n\\n\\n assert_eq!(net[p0].consumed_by[t0], 0);\\n\\n assert_eq!(net[p0].consumed_by[t1], 1);\\n\\n assert_eq!(net[p0].consumed_by[t2], 0);\\n\\n assert_eq!(net[p0].consumed_by[t3], 0);\\n\\n\\n\",\n \"file_path\": \"pnets_tina/tests/parser_tests.rs\",\n \"rank\": 50,\n \"score\": 77740.28905672493\n },\n {\n \"content\": \" assert_eq!(net[t0].conditions[p0], 0);\\n\\n assert_eq!(net[t1].conditions[p0], 0);\\n\\n assert_eq!(net[t2].conditions[p0], 1_000_000);\\n\\n assert_eq!(net[t3].conditions[p0], 0);\\n\\n\\n\\n assert_eq!(net[p0].condition_for[t0], 0);\\n\\n assert_eq!(net[p0].condition_for[t1], 0);\\n\\n assert_eq!(net[p0].condition_for[t2], 1_000_000);\\n\\n assert_eq!(net[p0].condition_for[t3], 0);\\n\\n\\n\\n assert_eq!(net[t0].inhibitors[p0], 0);\\n\\n assert_eq!(net[t1].inhibitors[p0], 0);\\n\\n assert_eq!(net[t2].inhibitors[p0], 0);\\n\\n assert_eq!(net[t3].inhibitors[p0], 2000);\\n\\n\\n\\n assert_eq!(net[p0].inhibitor_for[t0], 0);\\n\\n assert_eq!(net[p0].inhibitor_for[t1], 0);\\n\\n assert_eq!(net[p0].inhibitor_for[t2], 0);\\n\\n assert_eq!(net[p0].inhibitor_for[t3], 2_000);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"pnets_tina/tests/parser_tests.rs\",\n \"rank\": 51,\n \"score\": 77740.28905672493\n },\n {\n \"content\": \" }\\n\\n );\\n\\n assert_eq!(net[t0].label, Some(\\\"transition_label\\\".to_string()));\\n\\n assert_eq!(net[t0].consume[p0], 3);\\n\\n assert_eq!(net[t0].consume[p1], 0);\\n\\n assert_eq!(net[t0].consume[p2], 0);\\n\\n assert_eq!(net[t0].consume[p3], 0);\\n\\n\\n\\n assert_eq!(net[p0].consumed_by[t0], 3);\\n\\n assert_eq!(net[p1].consumed_by[t0], 0);\\n\\n assert_eq!(net[p2].consumed_by[t0], 0);\\n\\n assert_eq!(net[p3].consumed_by[t0], 0);\\n\\n\\n\\n assert_eq!(net[t0].produce[p0], 0);\\n\\n assert_eq!(net[t0].produce[p1], 1);\\n\\n assert_eq!(net[t0].produce[p2], 0);\\n\\n assert_eq!(net[t0].produce[p3], 0);\\n\\n\\n\\n assert_eq!(net[p0].produced_by[t0], 0);\\n\\n assert_eq!(net[p1].produced_by[t0], 1);\\n\",\n \"file_path\": \"pnets_tina/tests/parser_tests.rs\",\n \"rank\": 52,\n \"score\": 77740.27269971502\n },\n {\n \"content\": \"use pnets::arc::Kind;\\n\\nuse pnets::standard::Net;\\n\\nuse pnets::{NetError, NodeId, PlaceId, TransitionId};\\n\\n\\n\\n#[test]\\n\",\n \"file_path\": \"pnets/tests/standard_net_tests.rs\",\n \"rank\": 53,\n \"score\": 77245.65206106889\n },\n {\n \"content\": \"use pnets::arc::Kind;\\n\\nuse pnets::timed::Net;\\n\\nuse pnets::{NetError, NodeId, PlaceId, TransitionId};\\n\\n\\n\\n#[test]\\n\",\n \"file_path\": \"pnets/tests/timed_net_tests.rs\",\n \"rank\": 54,\n \"score\": 77245.65206106889\n },\n {\n \"content\": \" Some(\\\"pl\\\".to_string())\\n\\n );\\n\\n assert_eq!(\\n\\n net.rename_node(NodeId::Place(pl), \\\"tr\\\"),\\n\\n Err(NetError::DuplicatedName(\\\"tr\\\".to_string()))\\n\\n );\\n\\n assert_eq!(\\n\\n net.rename_node(NodeId::Transition(tr), \\\"pl\\\"),\\n\\n Err(NetError::DuplicatedName(\\\"pl\\\".to_string()))\\n\\n );\\n\\n}\\n\\n\\n\",\n \"file_path\": \"pnets/tests/timed_net_tests.rs\",\n \"rank\": 55,\n \"score\": 77238.00200810182\n },\n {\n \"content\": \" Some(\\\"pl\\\".to_string())\\n\\n );\\n\\n assert_eq!(\\n\\n net.rename_node(NodeId::Place(pl), \\\"tr\\\"),\\n\\n Err(NetError::DuplicatedName(\\\"tr\\\".to_string()))\\n\\n );\\n\\n assert_eq!(\\n\\n net.rename_node(NodeId::Transition(tr), \\\"pl\\\"),\\n\\n Err(NetError::DuplicatedName(\\\"pl\\\".to_string()))\\n\\n );\\n\\n}\\n\\n\\n\",\n \"file_path\": \"pnets/tests/standard_net_tests.rs\",\n \"rank\": 56,\n \"score\": 77238.00200810182\n },\n {\n \"content\": \"fn main() -> Result<(), Box<dyn Error>> {\\n\\n let mut net = standard::Net::default();\\n\\n // Create places and transitions\\n\\n let pl_0 = net.create_place();\\n\\n let pl_1 = net.create_place();\\n\\n let pl_2 = net.create_place();\\n\\n let pl_3 = net.create_place();\\n\\n let pl_4 = net.create_place();\\n\\n let pl_5 = net.create_place();\\n\\n let pl_6 = net.create_place();\\n\\n let tr_0 = net.create_transition();\\n\\n let tr_1 = net.create_transition();\\n\\n let tr_2 = net.create_transition();\\n\\n let tr_3 = net.create_transition();\\n\\n let tr_4 = net.create_transition();\\n\\n // Rename node (by default they have automatic name)\\n\\n net.rename_node(pl_0.into(), \\\"p0\\\")?;\\n\\n net.rename_node(pl_1.into(), \\\"p1\\\")?;\\n\\n net.rename_node(pl_2.into(), \\\"p2\\\")?;\\n\\n net.rename_node(pl_3.into(), \\\"p3\\\")?;\\n\",\n \"file_path\": \"pnets/examples/net.rs\",\n \"rank\": 57,\n \"score\": 69966.71426996593\n },\n {\n \"content\": \"/// All reduction which implement this trait should keep the count of markings (the set of equations\\n\\n/// should has exactly the same number of solutions than the original net)\\n\\npub trait ConservativeReduce<Net>: Reduce<Net> {}\\n\\n\\n\\n/// Try to apply a reduction rule on a specific place\\n\",\n \"file_path\": \"pnets_shrink/src/reducers/reduce.rs\",\n \"rank\": 58,\n \"score\": 58782.86410753522\n },\n {\n \"content\": \"#[allow(clippy::module_name_repetitions)]\\n\\npub trait TransitionReduce<Net>: Reduce<Net> {\\n\\n /// Try to apply a reduction rule on a specific place\\n\\n fn transition_reduce(\\n\\n &self,\\n\\n net: &mut Net,\\n\\n tr: TransitionId,\\n\\n modifications: &mut Vec<Modification>,\\n\\n );\\n\\n}\\n\",\n \"file_path\": \"pnets_shrink/src/reducers/reduce.rs\",\n \"rank\": 59,\n \"score\": 58775.961958114116\n },\n {\n \"content\": \"#[allow(clippy::module_name_repetitions)]\\n\\npub trait PlaceReduce<Net>: Reduce<Net> {\\n\\n /// Try to apply a reduction rule on a specific place\\n\\n fn place_reduce(&self, net: &mut Net, pl: PlaceId, modifications: &mut Vec<Modification>);\\n\\n}\\n\\n\\n\\n/// Try to apply a reduction rule on a specific place\\n\",\n \"file_path\": \"pnets_shrink/src/reducers/reduce.rs\",\n \"rank\": 60,\n \"score\": 58775.961958114116\n },\n {\n \"content\": \"/// Apply a reduction rule to the net\\n\\npub trait Reduce<Net> {\\n\\n /// Compute a reduction rule on the net\\n\\n ///\\n\\n /// In general, this method should iterate over each place or transition and try to apply the\\n\\n /// reduction to each place or transition.\\n\\n fn reduce(&self, net: &mut Net, modifications: &mut Vec<Modification>);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"pnets_shrink/src/reducers/reduce.rs\",\n \"rank\": 61,\n \"score\": 47964.48140345342\n },\n {\n \"content\": \"fn new_redundant(\\n\\n args: &Args,\\n\\n) -> LoopReducer<\\n\\n Net,\\n\\n ChainReducer<\\n\\n Net,\\n\\n SmartReducer<\\n\\n Net,\\n\\n ChainReducer<\\n\\n Net,\\n\\n SmartReducer<\\n\\n Net,\\n\\n IdentityPlaceReducer,\\n\\n ParallelPlaceReducer,\\n\\n ParallelTransitionReducer,\\n\\n >,\\n\\n ChainReducer<Net, IdentityTransitionReducer, SourceSinkReducer>,\\n\\n >,\\n\\n ParallelPlaceReducer,\\n\\n ParallelTransitionReducer,\\n\",\n \"file_path\": \"pnets_shrink/src/main.rs\",\n \"rank\": 62,\n \"score\": 45895.95308670159\n },\n {\n \"content\": \"fn write_output(\\n\\n net: &Net,\\n\\n modifications: &[Modification],\\n\\n args: Args,\\n\\n) -> Result<(), Box<dyn Error>> {\\n\\n info!(\\\"Start writing new net.\\\");\\n\\n let now = SystemTime::now();\\n\\n let mut buf_writer: Box<dyn Write> = match args.output.as_ref() {\\n\\n \\\"-\\\" => Box::new(stdout()),\\n\\n s => Box::new(File::create(s)?),\\n\\n };\\n\\n\\n\\n if args.equations {\\n\\n write_modifications(&modifications, buf_writer.as_mut(), &net)?;\\n\\n }\\n\\n ExporterBuilder::new(buf_writer.as_mut())\\n\\n .with_all_places(!args.clean)\\n\\n .with_disconnected_transitions(args.clean)\\n\\n .build()\\n\\n .export(&net.into())?;\\n\\n info!(\\\"Writing done: {:?}.\\\", now.elapsed()?);\\n\\n Ok(())\\n\\n}\\n\\n\\n\",\n \"file_path\": \"pnets_shrink/src/main.rs\",\n \"rank\": 63,\n \"score\": 45895.95308670159\n },\n {\n \"content\": \"fn new_compact(\\n\\n args: &Args,\\n\\n) -> LoopReducer<Net, ChainReducer<Net, SimpleChainReducer, SimpleLoopAgglomeration>> {\\n\\n LoopReducer::new(\\n\\n ChainReducer::new2(SimpleChainReducer::new(), SimpleLoopAgglomeration::new()),\\n\\n args.max_iter,\\n\\n )\\n\\n}\\n\\n\\n\",\n \"file_path\": \"pnets_shrink/src/main.rs\",\n \"rank\": 64,\n \"score\": 45895.95308670159\n },\n {\n \"content\": \"fn new_extra(\\n\\n args: &Args,\\n\\n) -> LoopReducer<\\n\\n Net,\\n\\n ChainReducer<Net, PseudoStart, ChainReducer<Net, RLReducer, WeightSimplification>>,\\n\\n> {\\n\\n LoopReducer::new(\\n\\n ChainReducer::new3(\\n\\n PseudoStart::new(),\\n\\n RLReducer::new(),\\n\\n WeightSimplification::new(),\\n\\n ),\\n\\n args.max_iter,\\n\\n )\\n\\n}\\n\\n\\n\",\n \"file_path\": \"pnets_shrink/src/main.rs\",\n \"rank\": 65,\n \"score\": 45895.95308670159\n },\n {\n \"content\": \"fn new_redundant_compact(\\n\\n args: &Args,\\n\\n) -> LoopReducer<\\n\\n Net,\\n\\n ChainReducer<\\n\\n Net,\\n\\n SmartReducer<\\n\\n Net,\\n\\n ChainReducer<Net, IdentityPlaceReducer, SimpleLoopAgglomeration>,\\n\\n ParallelPlaceReducer,\\n\\n ParallelTransitionReducer,\\n\\n >,\\n\\n ChainReducer<\\n\\n Net,\\n\\n SmartReducer<\\n\\n Net,\\n\\n SimpleChainReducer,\\n\\n ChainReducer<Net, IdentityPlaceReducer, SourceSinkReducer>,\\n\\n IdentityTransitionReducer,\\n\\n >,\\n\",\n \"file_path\": \"pnets_shrink/src/main.rs\",\n \"rank\": 66,\n \"score\": 44854.690887524084\n },\n {\n \"content\": \"fn new_compact_extra(\\n\\n args: &Args,\\n\\n) -> LoopReducer<\\n\\n Net,\\n\\n ChainReducer<\\n\\n Net,\\n\\n SimpleLoopAgglomeration,\\n\\n ChainReducer<\\n\\n Net,\\n\\n SimpleChainReducer,\\n\\n ChainReducer<Net, PseudoStart, ChainReducer<Net, RLReducer, WeightSimplification>>,\\n\\n >,\\n\\n >,\\n\\n> {\\n\\n LoopReducer::new(\\n\\n ChainReducer::new5(\\n\\n SimpleLoopAgglomeration::new(),\\n\\n SimpleChainReducer::new(),\\n\\n PseudoStart::new(),\\n\\n RLReducer::new(),\\n\\n WeightSimplification::new(),\\n\\n ),\\n\\n args.max_iter,\\n\\n )\\n\\n}\\n\\n\\n\",\n \"file_path\": \"pnets_shrink/src/main.rs\",\n \"rank\": 67,\n \"score\": 44854.690887524084\n },\n {\n \"content\": \"fn new_redundant_extra(\\n\\n args: &Args,\\n\\n) -> LoopReducer<\\n\\n Net,\\n\\n ChainReducer<\\n\\n Net,\\n\\n SmartReducer<\\n\\n Net,\\n\\n ChainReducer<\\n\\n Net,\\n\\n SmartReducer<\\n\\n Net,\\n\\n IdentityPlaceReducer,\\n\\n ParallelPlaceReducer,\\n\\n ParallelTransitionReducer,\\n\\n >,\\n\\n ChainReducer<\\n\\n Net,\\n\\n IdentityTransitionReducer,\\n\\n ChainReducer<\\n\",\n \"file_path\": \"pnets_shrink/src/main.rs\",\n \"rank\": 68,\n \"score\": 44854.690887524084\n },\n {\n \"content\": \"use pnets::Marking;\\n\\n\\n\\n#[test]\\n\",\n \"file_path\": \"pnets/tests/marking_tests.rs\",\n \"rank\": 69,\n \"score\": 44098.27558121698\n },\n {\n \"content\": \"fn new_redundant_compact_extra(\\n\\n args: &Args,\\n\\n) -> LoopReducer<\\n\\n Net,\\n\\n ChainReducer<\\n\\n Net,\\n\\n SmartReducer<\\n\\n Net,\\n\\n ChainReducer<\\n\\n Net,\\n\\n SmartReducer<\\n\\n Net,\\n\\n ChainReducer<Net, IdentityPlaceReducer, SimpleLoopAgglomeration>,\\n\\n ParallelPlaceReducer,\\n\\n ParallelTransitionReducer,\\n\\n >,\\n\\n ChainReducer<\\n\\n Net,\\n\\n IdentityTransitionReducer,\\n\\n ChainReducer<\\n\",\n \"file_path\": \"pnets_shrink/src/main.rs\",\n \"rank\": 70,\n \"score\": 43876.8349133374\n },\n {\n \"content\": \"fn main() -> Result<(), Box<dyn Error>> {\\n\\n let matches = App::new(\\\"Net print\\\")\\n\\n .version(\\\"1.0\\\")\\n\\n .author(\\\"Louis C. <louis.chauvet@free.fr>\\\")\\n\\n .about(\\\"Print a petri net from .net file\\\")\\n\\n .arg(\\n\\n Arg::with_name(\\\"INPUT\\\")\\n\\n .help(\\\"Sets the input file to use\\\")\\n\\n .required(true)\\n\\n .index(1),\\n\\n )\\n\\n .arg(\\n\\n Arg::with_name(\\\"CONTENT\\\")\\n\\n .help(\\\"Print net content\\\")\\n\\n .short(\\\"c\\\")\\n\\n .long(\\\"content\\\"),\\n\\n )\\n\\n .get_matches();\\n\\n\\n\\n let net = match matches.value_of(\\\"INPUT\\\") {\\n\",\n \"file_path\": \"pnets_print/src/main.rs\",\n \"rank\": 72,\n \"score\": 38085.206759697256\n },\n {\n \"content\": \"fn main() -> Result<(), Box<dyn Error>> {\\n\\n let mut args = Args::parse();\\n\\n\\n\\n info!(\\\"Start parsing.\\\");\\n\\n let now = SystemTime::now();\\n\\n let buf_reader: Box<dyn BufRead> = match (args.input.as_ref(), args.format) {\\n\\n (\\\"-\\\", Format::Guess) => {\\n\\n args.format = Format::Net;\\n\\n Box::new(BufReader::new(stdin()))\\n\\n }\\n\\n (\\\"-\\\", _) => Box::new(BufReader::new(stdin())),\\n\\n (s, Format::Guess) => {\\n\\n if s.ends_with(\\\"pnml\\\") {\\n\\n args.format = Format::PNML;\\n\\n }\\n\\n Box::new(BufReader::new(File::open(s)?))\\n\\n }\\n\\n (s, _) => Box::new(BufReader::new(File::open(s)?)),\\n\\n };\\n\\n\\n\",\n \"file_path\": \"pnets_shrink/src/main.rs\",\n \"rank\": 73,\n \"score\": 38085.206759697256\n },\n {\n \"content\": \" net.add_arc(arc::Kind::Consume(pl_6, tr_4, 1))?;\\n\\n net.add_arc(arc::Kind::Consume(pl_3, tr_4, 1))?;\\n\\n net.add_arc(arc::Kind::Consume(pl_3, tr_2, 1))?;\\n\\n net.add_arc(arc::Kind::Consume(pl_5, tr_3, 1))?;\\n\\n net.add_arc(arc::Kind::Consume(pl_4, tr_3, 1))?;\\n\\n net.add_arc(arc::Kind::Consume(pl_2, tr_3, 1))?;\\n\\n net.add_arc(arc::Kind::Consume(pl_1, tr_1, 1))?;\\n\\n net.add_arc(arc::Kind::Consume(pl_0, tr_0, 1))?;\\n\\n net.add_arc(arc::Kind::Produce(pl_3, tr_4, 1))?;\\n\\n net.add_arc(arc::Kind::Produce(pl_3, tr_0, 1))?;\\n\\n net.add_arc(arc::Kind::Produce(pl_4, tr_2, 1))?;\\n\\n net.add_arc(arc::Kind::Produce(pl_1, tr_0, 1))?;\\n\\n net.add_arc(arc::Kind::Produce(pl_0, tr_0, 1))?;\\n\\n\\n\\n // Get node id by its name\\n\\n println!(\\n\\n \\\"Place with name p0 has id {:?}\\\",\\n\\n net.get_index_by_name(\\\"p0\\\")\\n\\n );\\n\\n // Get node name\\n\\n println!(\\n\\n \\\"Transition with id {:?} has name {}\\\",\\n\\n NodeId::Transition(tr_0),\\n\\n net.get_name_by_index(&tr_0.into()).unwrap()\\n\\n );\\n\\n Ok(())\\n\\n}\\n\",\n \"file_path\": \"pnets/examples/net.rs\",\n \"rank\": 74,\n \"score\": 36528.95593387334\n },\n {\n \"content\": \"use custom_derive::custom_derive;\\n\\nuse indexed_vec::Idx;\\n\\nuse newtype_derive::{\\n\\n newtype_as_item, newtype_fmt, newtype_wrap_bin_op, newtype_wrap_bin_op_assign, NewtypeAdd,\\n\\n NewtypeAddAssign, NewtypeDebug, NewtypeDisplay,\\n\\n};\\n\\n\\n\\ncustom_derive! {\\n\\n /// Represent a transition identifier in the net\\n\\n #[derive(\\n\\n Ord, PartialOrd, Clone, Copy, Eq, PartialEq, Hash,\\n\\n NewtypeDebug, NewtypeDisplay, NewtypeAddAssign(usize), Default, NewtypeAdd(usize)\\n\\n )]\\n\\n pub struct TransitionId(usize);\\n\\n}\\n\\n\\n\\nimpl Idx for TransitionId {\\n\\n fn new(v: usize) -> Self {\\n\\n Self::from(v)\\n\\n }\\n\",\n \"file_path\": \"pnets/src/net.rs\",\n \"rank\": 75,\n \"score\": 36528.35975460675\n },\n {\n \"content\": \" net.rename_node(pl_4.into(), \\\"p4\\\")?;\\n\\n net.rename_node(pl_5.into(), \\\"p5\\\")?;\\n\\n net.rename_node(pl_6.into(), \\\"p6\\\")?;\\n\\n net.rename_node(tr_0.into(), \\\"t0\\\")?;\\n\\n net.rename_node(tr_1.into(), \\\"t1\\\")?;\\n\\n net.rename_node(tr_2.into(), \\\"t2\\\")?;\\n\\n net.rename_node(tr_3.into(), \\\"t3\\\")?;\\n\\n net.rename_node(tr_4.into(), \\\"t4\\\")?;\\n\\n\\n\\n // Set label for places and transitions\\n\\n net[tr_0].label = Some(\\\"a\\\".to_string());\\n\\n net[tr_1].label = Some(\\\"τ\\\".to_string());\\n\\n net[tr_3].label = Some(\\\"b\\\".to_string());\\n\\n net[tr_4].label = Some(\\\"c\\\".to_string());\\n\\n\\n\\n // Set initial values\\n\\n net[pl_0].initial = 5;\\n\\n net[pl_6].initial = 4;\\n\\n\\n\\n // Create arcs\\n\",\n \"file_path\": \"pnets/examples/net.rs\",\n \"rank\": 76,\n \"score\": 36525.74923945599\n },\n {\n \"content\": \"use pnets::{arc, standard, NodeId};\\n\\nuse std::error::Error;\\n\\n\\n\",\n \"file_path\": \"pnets/examples/net.rs\",\n \"rank\": 77,\n \"score\": 36525.7391354408\n },\n {\n \"content\": \" fn index(self) -> usize {\\n\\n self.0\\n\\n }\\n\\n}\\n\\n\\n\\nimpl ::std::convert::From<usize> for PlaceId {\\n\\n fn from(v: usize) -> Self {\\n\\n PlaceId(v)\\n\\n }\\n\\n}\\n\\n\\n\\nimpl ::std::convert::From<usize> for TransitionId {\\n\\n fn from(v: usize) -> Self {\\n\\n TransitionId(v)\\n\\n }\\n\\n}\\n\\n\\n\\n/// Represent an id in the net\\n\\n#[derive(Eq, PartialEq, Hash, Debug, Clone, Copy)]\\n\\npub enum NodeId {\\n\",\n \"file_path\": \"pnets/src/net.rs\",\n \"rank\": 78,\n \"score\": 36523.65559475027\n },\n {\n \"content\": \"\\n\\n fn index(self) -> usize {\\n\\n self.0\\n\\n }\\n\\n}\\n\\n\\n\\ncustom_derive! {\\n\\n /// Represent a place identifier in the net\\n\\n #[derive(\\n\\n Ord, PartialOrd, Clone, Copy, Eq, PartialEq, Hash,\\n\\n NewtypeDebug, NewtypeDisplay, NewtypeAddAssign(usize), Default, NewtypeAdd(usize)\\n\\n )]\\n\\n pub struct PlaceId(usize);\\n\\n}\\n\\n\\n\\nimpl Idx for PlaceId {\\n\\n fn new(v: usize) -> Self {\\n\\n Self::from(v)\\n\\n }\\n\\n\\n\",\n \"file_path\": \"pnets/src/net.rs\",\n \"rank\": 79,\n \"score\": 36523.50886317843\n },\n {\n \"content\": \" pub fn as_place(&self) -> Option<PlaceId> {\\n\\n match self {\\n\\n NodeId::Place(pl) => Some(*pl),\\n\\n NodeId::Transition(_) => None,\\n\\n }\\n\\n }\\n\\n\\n\\n /// Try to convert NodeId to TransitionId\\n\\n pub fn as_transition(&self) -> Option<TransitionId> {\\n\\n match self {\\n\\n NodeId::Place(_) => None,\\n\\n NodeId::Transition(tr) => Some(*tr),\\n\\n }\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"pnets/src/net.rs\",\n \"rank\": 80,\n \"score\": 36521.2089029951\n },\n {\n \"content\": \" /// Place\\n\\n Place(PlaceId),\\n\\n /// Transition\\n\\n Transition(TransitionId),\\n\\n}\\n\\n\\n\\nimpl From<TransitionId> for NodeId {\\n\\n fn from(tr: TransitionId) -> Self {\\n\\n Self::Transition(tr)\\n\\n }\\n\\n}\\n\\n\\n\\nimpl From<PlaceId> for NodeId {\\n\\n fn from(pl: PlaceId) -> Self {\\n\\n Self::Place(pl)\\n\\n }\\n\\n}\\n\\n\\n\\nimpl NodeId {\\n\\n /// Try to convert NodeId to PlaceId\\n\",\n \"file_path\": \"pnets/src/net.rs\",\n \"rank\": 81,\n \"score\": 36521.2089029951\n },\n {\n \"content\": \"fn main() -> Result<(), Box<dyn Error>> {\\n\\n let pnml: Pnml = quick_xml::de::from_str(include_str!(\\\"HouseConstruction-002.pnml\\\"))?;\\n\\n let nets: Vec<standard::Net> = (&pnml).try_into()?;\\n\\n let pnml: Pnml = (&nets).into();\\n\\n println!(\\\"{:?}\\\", quick_xml::se::to_string(&pnml));\\n\\n Ok(())\\n\\n}\\n\",\n \"file_path\": \"pnets_pnml/examples/parse_pnml_file.rs\",\n \"rank\": 82,\n \"score\": 36399.07812135647\n },\n {\n \"content\": \"fn main() -> Result<(), Box<dyn Error>> {\\n\\n let parser = pnets_tina::Parser::new(include_str!(\\\"sokoban_3.net\\\").as_bytes());\\n\\n let net = parser.parse().unwrap();\\n\\n let mut out = Box::new(stdout());\\n\\n let mut writer = ExporterBuilder::new(out.as_mut())\\n\\n .with_all_places(true)\\n\\n .with_disconnected_transitions(true)\\n\\n .build();\\n\\n writer.export(&net)?;\\n\\n Ok(())\\n\\n}\\n\",\n \"file_path\": \"pnets_tina/examples/parse_export_file.rs\",\n \"rank\": 83,\n \"score\": 36399.07812135647\n },\n {\n \"content\": \"fn main() -> Result<(), Box<dyn Error>> {\\n\\n let ptnet: Ptnet = from_str(include_str!(\\\"HouseConstruction-002.pnml\\\"))?;\\n\\n let nets: Vec<standard::Net> = (&ptnet).try_into()?;\\n\\n println!(\\\"{:?}\\\", nets);\\n\\n let ptnet: Ptnet = (&nets).into();\\n\\n println!(\\\"{:?}\\\", quick_xml::se::to_string(&ptnet));\\n\\n Ok(())\\n\\n}\\n\",\n \"file_path\": \"pnets_pnml/examples/parse_ptnet_file.rs\",\n \"rank\": 84,\n \"score\": 36399.07812135647\n },\n {\n \"content\": \" pub deleted_places: Vec<(PlaceId, isize)>,\\n\\n /// Constant to add at the end of equation\\n\\n pub constant: isize,\\n\\n}\\n\\n\\n\\n/// Deletion of several places because they are redundant with an other group of places.\\n\\n///\\n\\n/// The associated equation is [`Reduction::equals_to`] + [`Reduction::constant`] =\\n\\n/// [`Reduction::deleted_places`]\\n\\n#[derive(Clone, Debug, Eq, PartialEq)]\\n\\npub struct Reduction {\\n\\n /// Places which are kept during the modification\\n\\n ///\\n\\n /// This vector contains tuples ([`PlaceId`], [`isize`]) because sometimes you may need to add\\n\\n /// a weight on a specific place to keep the equation right.\\n\\n pub equals_to: Vec<(PlaceId, isize)>,\\n\\n /// Constant in the relation\\n\\n pub constant: isize,\\n\\n /// Places which are deleted during the modification\\n\\n ///\\n\",\n \"file_path\": \"pnets_shrink/src/modifications.rs\",\n \"rank\": 85,\n \"score\": 36361.223731237544\n },\n {\n \"content\": \"/// [`InequalityReduction::constant`] => [`InequalityReduction::deleted_places`]\\n\\n#[derive(Clone, Debug, Eq, PartialEq)]\\n\\npub struct InequalityReduction {\\n\\n /// Places which are kept during the modification\\n\\n ///\\n\\n /// This vector contains tuples ([`PlaceId`], [`isize`]) because sometimes you may need to add\\n\\n /// a weight on a specific place to keep the equation right.\\n\\n pub kept_places: Vec<(PlaceId, isize)>,\\n\\n /// Constant in the relation\\n\\n pub constant: isize,\\n\\n /// Places which are deleted during the modification\\n\\n ///\\n\\n /// This vector contains tuples ([`PlaceId`], [`isize`]) because sometimes you may need to add\\n\\n /// a weight on a specific place to keep the equation right.\\n\\n pub deleted_places: Vec<(PlaceId, isize)>,\\n\\n}\\n\\n\\n\\n/// All reductions supported by this library\\n\\n#[derive(Clone, Debug, Eq, PartialEq)]\\n\\npub enum Modification {\\n\",\n \"file_path\": \"pnets_shrink/src/modifications.rs\",\n \"rank\": 86,\n \"score\": 36359.88456372542\n },\n {\n \"content\": \"//! All modifications supported by this crate\\n\\n//!\\n\\n//! In this module you can found all modifications that are supported by this crate, you can found\\n\\n//! detailed explanation in structures documentation.\\n\\nuse pnets::{PlaceId, TransitionId};\\n\\n\\n\\n/// This modification correspond to an agglomeration of serval place in a unique new place.\\n\\n///\\n\\n/// The associated equation is [`Agglomeration::factor`] * [`Agglomeration::new_place`] =\\n\\n/// [`Agglomeration::deleted_places`] + [`Agglomeration::constant`]\\n\\n#[derive(Clone, Debug, Eq, PartialEq)]\\n\\npub struct Agglomeration {\\n\\n /// Place which is created during the modification\\n\\n pub new_place: PlaceId,\\n\\n /// Factor for new place in the equation\\n\\n pub factor: isize,\\n\\n /// Places which are deleted during the modification\\n\\n ///\\n\\n /// This vector contains tuples ([`PlaceId`], [`isize`]) because sometimes you may need to add\\n\\n /// a weight on a specific place to keep the equation right.\\n\",\n \"file_path\": \"pnets_shrink/src/modifications.rs\",\n \"rank\": 87,\n \"score\": 36357.473848769405\n },\n {\n \"content\": \" /// This vector contains tuples ([`PlaceId`], [`isize`]) because sometimes you may need to add\\n\\n /// a weight on a specific place to keep the equation right.\\n\\n pub deleted_places: Vec<(PlaceId, isize)>,\\n\\n}\\n\\n\\n\\n/// Elimination of transitions\\n\\n///\\n\\n/// This reduction allows you to delete some transitions because they are redundant with others.\\n\\n/// There is no equations associated with this reduction\\n\\n#[derive(Clone, Debug, Eq, PartialEq)]\\n\\npub struct TransitionElimination {\\n\\n /// Deleted transitions\\n\\n pub deleted_transitions: Vec<TransitionId>,\\n\\n}\\n\\n\\n\\n/// Inequality reduction\\n\\n///\\n\\n/// This modification deletes some places because they are redundant with a group of other places.\\n\\n///\\n\\n/// The equation associated is [`InequalityReduction::kept_places`] +\\n\",\n \"file_path\": \"pnets_shrink/src/modifications.rs\",\n \"rank\": 88,\n \"score\": 36357.360357987935\n },\n {\n \"content\": \" /// Agglomeration\\n\\n Agglomeration(Agglomeration),\\n\\n /// Reduction\\n\\n Reduction(Reduction),\\n\\n /// Transition elimination\\n\\n TransitionElimination(TransitionElimination),\\n\\n /// Inequality reduction\\n\\n InequalityReduction(InequalityReduction),\\n\\n}\\n\",\n \"file_path\": \"pnets_shrink/src/modifications.rs\",\n \"rank\": 89,\n \"score\": 36353.361915219466\n },\n {\n \"content\": \"use std::error::Error;\\n\\n\\n\\nuse pnets::timed::{Net, TimeRange};\\n\\nuse pnets::{arc, NetError, NodeId};\\n\\nuse pnets::{PlaceId, TransitionId};\\n\\n\\n\\nuse crate::lexer::Lexer;\\n\\nuse crate::token;\\n\\nuse crate::token::Kind;\\n\\nuse crate::ParserError;\\n\\nuse std::io::BufRead;\\n\\n\\n\\n/// Position in a file\\n\\n#[derive(Copy, Clone, Debug, Eq, PartialEq)]\\n\\npub struct Position {\\n\\n /// Current line\\n\\n pub line: usize,\\n\\n /// Current column\\n\\n pub column: usize,\\n\\n}\\n\",\n \"file_path\": \"pnets_tina/src/parser.rs\",\n \"rank\": 90,\n \"score\": 35783.994890789654\n },\n {\n \"content\": \"\\n\\n/// Exporter for [tina]() format.\\n\\n///\\n\\n/// It consume a reader and creates a [`pnets::timed::Net`]\\n\\npub struct Parser<R: BufRead> {\\n\\n lexer: Lexer<R>,\\n\\n net: Net,\\n\\n}\\n\\n\\n\\nimpl<R: BufRead> Parser<R> {\\n\\n /// Parse a timed net from a reader\\n\\n pub fn parse(mut self) -> Result<Net, Box<dyn Error>> {\\n\\n loop {\\n\\n let token = self.lexer.peek()?;\\n\\n\\n\\n match token.kind {\\n\\n token::Kind::NewLine | token::Kind::Comment(_) => {\\n\\n self.lexer.read()?;\\n\\n }\\n\\n token::Kind::Net => self.parse_net()?,\\n\",\n \"file_path\": \"pnets_tina/src/parser.rs\",\n \"rank\": 91,\n \"score\": 35783.871802124835\n },\n {\n \"content\": \" ))),\\n\\n }\\n\\n }\\n\\n _ => Err(Box::new(ParserError::UnexpectedToken(\\n\\n token,\\n\\n \\\"Expected TokenKind::Identifier(_)\\\".to_string(),\\n\\n ))),\\n\\n }\\n\\n }\\n\\n\\n\\n /// Parse the net token\\n\\n fn parse_net(&mut self) -> Result<(), Box<dyn Error>> {\\n\\n self.lexer.read()?;\\n\\n let identifier = self.lexer.read()?;\\n\\n match identifier.kind {\\n\\n token::Kind::Identifier(id) => {\\n\\n self.net.name = id;\\n\\n Ok(())\\n\\n }\\n\\n _ => Err(Box::new(ParserError::UnexpectedToken(\\n\",\n \"file_path\": \"pnets_tina/src/parser.rs\",\n \"rank\": 92,\n \"score\": 35783.75408910578\n },\n {\n \"content\": \" }\\n\\n }\\n\\n Ok(())\\n\\n }\\n\\n\\n\\n /// Parse a priority line\\n\\n fn parse_priority(&mut self) -> Result<(), Box<dyn Error>> {\\n\\n self.lexer.read()?;\\n\\n let mut pre = vec![];\\n\\n let mut post = vec![];\\n\\n while let token::Kind::Identifier(id) = self.lexer.peek()?.kind {\\n\\n self.lexer.read()?;\\n\\n pre.push(self.get_or_create_transition(&id)?);\\n\\n }\\n\\n let order = match self.lexer.read()?.kind {\\n\\n token::Kind::GreaterThan => false,\\n\\n token::Kind::LessThan => true,\\n\\n _ => {\\n\\n return Err(Box::new(ParserError::UnexpectedToken(\\n\\n self.lexer.current_token.clone(),\\n\",\n \"file_path\": \"pnets_tina/src/parser.rs\",\n \"rank\": 93,\n \"score\": 35783.36235761628\n },\n {\n \"content\": \" /// let parser = Parser::new(&\\\"net Réseau\\\\ntr t0 p0 -> p1\\\\ntr t1 p1 -> p0\\\".as_bytes());\\n\\n /// ```\\n\\n pub fn new(reader: R) -> Self {\\n\\n Self {\\n\\n lexer: Lexer::new(reader),\\n\\n net: Net::default(),\\n\\n }\\n\\n }\\n\\n\\n\\n /// Get transition from net or create one\\n\\n fn get_or_create_transition(&mut self, name: &str) -> Result<TransitionId, Box<dyn Error>> {\\n\\n match self.net.get_index_by_name(name) {\\n\\n Some(NodeId::Transition(id)) => Ok(id),\\n\\n Some(NodeId::Place(_)) => Err(Box::new(NetError::DuplicatedName(name.to_string()))),\\n\\n None => {\\n\\n let tr = self.net.create_transition();\\n\\n self.net.rename_node(NodeId::Transition(tr), name)?;\\n\\n Ok(tr)\\n\\n }\\n\\n }\\n\",\n \"file_path\": \"pnets_tina/src/parser.rs\",\n \"rank\": 94,\n \"score\": 35782.921238715666\n },\n {\n \"content\": \" }\\n\\n\\n\\n /// Get place from net or create one\\n\\n fn get_or_create_place(&mut self, name: &str) -> Result<PlaceId, Box<dyn Error>> {\\n\\n match self.net.get_index_by_name(name) {\\n\\n Some(NodeId::Place(id)) => Ok(id),\\n\\n Some(NodeId::Transition(_)) => {\\n\\n Err(Box::new(NetError::DuplicatedName(name.to_string())))\\n\\n }\\n\\n None => {\\n\\n let pl = self.net.create_place();\\n\\n self.net.rename_node(NodeId::Place(pl), name)?;\\n\\n Ok(pl)\\n\\n }\\n\\n }\\n\\n }\\n\\n\\n\\n /// Parse the label token\\n\\n fn parse_label(&mut self) -> Result<(), Box<dyn Error>> {\\n\\n self.lexer.read()?;\\n\",\n \"file_path\": \"pnets_tina/src/parser.rs\",\n \"rank\": 95,\n \"score\": 35780.97807600942\n },\n {\n \"content\": \" ))),\\n\\n }\\n\\n }\\n\\n\\n\\n fn parse_transition_output_arc(\\n\\n &mut self,\\n\\n place: PlaceId,\\n\\n transition: TransitionId,\\n\\n ) -> Result<arc::Kind, Box<dyn Error>> {\\n\\n match self.lexer.peek()?.kind {\\n\\n token::Kind::NormalArc => {\\n\\n self.lexer.read()?;\\n\\n Ok(arc::Kind::Produce(place, transition, self.parse_int()?))\\n\\n }\\n\\n arc @ token::Kind::InhibitorArc\\n\\n | arc @ token::Kind::TestArc\\n\\n | arc @ token::Kind::StopWatchArc\\n\\n | arc @ token::Kind::StopWatchInhibitorArc => Err(Box::new(\\n\\n ParserError::UnexpectedArc(self.lexer.current_token.position, arc),\\n\\n )),\\n\",\n \"file_path\": \"pnets_tina/src/parser.rs\",\n \"rank\": 96,\n \"score\": 35780.256623394576\n },\n {\n \"content\": \" self.lexer.read()?;\\n\\n value\\n\\n }\\n\\n _ => {\\n\\n return Err(Box::new(ParserError::UnexpectedToken(\\n\\n self.lexer.current_token.clone(),\\n\\n \\\"Expected TokenKind::Int(_)\\\".to_string(),\\n\\n )));\\n\\n }\\n\\n })\\n\\n }\\n\\n\\n\\n /// Try to parse arrow\\n\\n fn parse_arrow(&mut self) -> Result<(), Box<dyn Error>> {\\n\\n if self.lexer.read()?.kind == token::Kind::Arrow {\\n\\n Ok(())\\n\\n } else {\\n\\n Err(Box::new(ParserError::UnexpectedToken(\\n\\n self.lexer.current_token.clone(),\\n\\n \\\"Expected TokenKind::Arrow\\\".to_string(),\\n\",\n \"file_path\": \"pnets_tina/src/parser.rs\",\n \"rank\": 97,\n \"score\": 35779.918511627715\n },\n {\n \"content\": \" let token = self.lexer.read()?;\\n\\n match token.kind {\\n\\n Kind::Identifier(identifier) => {\\n\\n let index = match self.net.get_index_by_name(&identifier) {\\n\\n None => return Err(Box::new(NetError::UnknownIdentifier(identifier))),\\n\\n Some(index) => index,\\n\\n };\\n\\n let token = self.lexer.read()?;\\n\\n match token.kind {\\n\\n Kind::Identifier(identifier) => {\\n\\n match index {\\n\\n NodeId::Place(pl) => self.net[pl].label = Some(identifier),\\n\\n NodeId::Transition(tr) => self.net[tr].label = Some(identifier),\\n\\n }\\n\\n Ok(())\\n\\n }\\n\\n\\n\\n _ => Err(Box::new(ParserError::UnexpectedToken(\\n\\n token,\\n\\n \\\"Expected TokenKind::Identifier(_)\\\".to_string(),\\n\",\n \"file_path\": \"pnets_tina/src/parser.rs\",\n \"rank\": 98,\n \"score\": 35779.91268461314\n },\n {\n \"content\": \" token::Kind::Transition => self.parse_transition()?,\\n\\n token::Kind::Place => self.parse_place()?,\\n\\n token::Kind::Note => self.parse_note()?,\\n\\n token::Kind::Label => self.parse_label()?,\\n\\n token::Kind::Priority => self.parse_priority()?,\\n\\n token::Kind::EndOfFile => break,\\n\\n _ => {\\n\\n return Err(Box::new(ParserError::UnexpectedToken(\\n\\n token,\\n\\n \\\"This token can not start a line\\\".to_string(),\\n\\n )));\\n\\n }\\n\\n }\\n\\n }\\n\\n Ok(self.net)\\n\\n }\\n\\n\\n\\n /// Create a new parser from reader\\n\\n ///\\n\\n /// ```ignore\\n\",\n \"file_path\": \"pnets_tina/src/parser.rs\",\n \"rank\": 99,\n \"score\": 35779.84708460754\n }\n]","isConversational":false}}},{"rowIdx":2392,"cells":{"lang":{"kind":"string","value":"Rust"},"file_path":{"kind":"string","value":"src/api/data/client.rs"},"repo_name":{"kind":"string","value":"rnag/rust-wistia"},"commit":{"kind":"string","value":"91e430ad9ba3665e8b89fb2aa2acef25acf46483"},"file_code":{"kind":"string","value":"use crate::auth::auth_token;\nuse crate::constants::ENV_VAR_NAME;\nuse crate::https::{get_https_client, tls};\nuse crate::log::*;\nuse crate::models::*;\nuse crate::status::raise_for_status;\nuse crate::utils::{into_struct_from_slice, stream_reader_from_url};\nuse crate::RustWistiaError;\n\nuse std::borrow::Cow;\nuse std::io::Cursor;\nuse std::time::Instant;\n\nuse hyper::client::{Client, HttpConnector};\nuse hyper::header::AUTHORIZATION;\nuse hyper::{Body, Method, Request};\nuse serde::de::DeserializeOwned;\nuse serde::ser::Serialize;\nuse serde_json::to_vec;\nuse serde_urlencoded::to_string;\n\npub type WistiaClient<'a> = DataClient<'a>;\n\n#[derive(Clone)]\npub struct DataClient<'a> {\n \n \n \n \n \n pub access_token: Cow<'a, str>,\n \n pub client: Client<tls::HttpsConnector<HttpConnector>>,\n}\n\nimpl<'a> From<Cow<'a, str>> for DataClient<'a> {\n \n fn from(access_token: Cow<'a, str>) -> Self {\n let token = auth_token(&access_token);\n\n Self {\n access_token: Cow::Owned(token),\n client: get_https_client(),\n }\n }\n}\n\nimpl<'a> From<&'a str> for DataClient<'a> {\n \n fn from(access_token: &'a str) -> Self {\n Self::from(Cow::Borrowed(access_token))\n }\n}\n\nimpl<'a> From<String> for DataClient<'a> {\n \n fn from(access_token: String) -> Self {\n Self::from(Cow::Owned(access_token))\n }\n}\n\nimpl<'a> DataClient<'a> {\n \n pub fn new(access_token: &'a str) -> Self {\n Self::from(access_token)\n }\n\n \n \n pub fn from_env() -> crate::Result<Self> {\n let token: String =\n std::env::var(ENV_VAR_NAME).map_err(|_| RustWistiaError::EnvVarNotFound {\n name: ENV_VAR_NAME.to_owned(),\n })?;\n\n Ok(Self::from(token))\n }\n\n \n \n \n \n \n \n \n \n \n \n \n pub async fn download_asset(\n &'a self,\n req: DownloadAssetRequest<'a>,\n ) -> crate::Result<Cursor<hyper::body::Bytes>> {\n \n \n let media = if let Some(media) = req.media {\n media\n } else if let Some(media_id) = req.media_id {\n self.get_media(media_id).await?\n } else {\n return Err(RustWistiaError::MediaIsRequired);\n };\n\n \n let url = media.asset_url(req.asset_type)?;\n\n \n let media_content = stream_reader_from_url(&url, self.client.clone()).await;\n\n if let Some(file_path) = req.file_path {\n \n let mut content = media_content?;\n let mut file = std::fs::File::create(file_path)?;\n std::io::copy(&mut content, &mut file)?;\n\n Ok(content)\n } else {\n media_content\n }\n }\n\n \n \n \n \n pub async fn get_media(&self, video_id: &'a str) -> crate::Result<Media> {\n let url = format!(\n \"https://api.wistia.com/v1/medias/{media_id}.json\",\n media_id = video_id\n );\n\n self.get(&url).await\n }\n\n \n \n \n \n pub async fn update_media(&self, video: UpdateMediaRequest) -> crate::Result<MediaInfo> {\n let url = format!(\n \"https://api.wistia.com/v1/medias/{media_id}.json\",\n media_id = video.id\n );\n\n self.put(&url, video).await\n }\n\n \n pub async fn get<R: DeserializeOwned>(&'a self, url: &'a str) -> crate::Result<R> {\n let token = self.access_token.as_ref();\n\n let req = Request::builder()\n .method(Method::GET)\n .uri(url)\n .header(AUTHORIZATION, token)\n .body(Body::empty())?;\n\n self.make_request(url, req).await\n }\n\n \n pub async fn put<B: Serialize, R: DeserializeOwned>(\n &'a self,\n url: &'a str,\n body: B,\n ) -> crate::Result<R> {\n let token = self.access_token.as_ref();\n\n let mut uri: String;\n let params = to_string(body)?;\n let params_len = params.len();\n\n let url = if params_len != 0 {\n uri = String::with_capacity(url.len() + params.len() + 1);\n uri.push_str(url);\n uri.push('?');\n uri.push_str(¶ms);\n uri.as_str()\n } else {\n url\n };\n\n let req = Request::builder()\n .method(Method::PUT)\n .uri(url)\n .header(AUTHORIZATION, token)\n .body(Body::empty())?;\n\n self.make_request(url, req).await\n }\n\n \n pub async fn put_with_body<B: Serialize, R: DeserializeOwned>(\n &'a self,\n url: &'a str,\n body: B,\n ) -> crate::Result<R> {\n let token = self.access_token.as_ref();\n let body_data = to_vec(&body)?;\n\n let req = Request::builder()\n .method(Method::PUT)\n .uri(url)\n .header(AUTHORIZATION, token)\n .body(Body::from(body_data))?;\n\n self.make_request(url, req).await\n }\n\n \n pub(crate) async fn make_request<R: DeserializeOwned>(\n &'a self,\n url: &'a str,\n req: Request<Body>,\n ) -> crate::Result<R> {\n let start = Instant::now();\n let mut resp = self.client.request(req).await?;\n debug!(\"Call Data API completed {:.2?}\", start.elapsed());\n\n raise_for_status(url, &mut resp).await?;\n\n into_struct_from_slice(resp).await\n }\n}\n"},"prefix":{"kind":"string","value":"use crate::auth::auth_token;\nuse crate::constants::ENV_VAR_NAME;\nuse crate::https::{get_https_client, tls};\nuse crate::log::*;\nuse crate::models::*;\nuse crate::status::raise_for_status;\nuse crate::utils::{into_struct_from_slice, stream_reader_from_url};\nuse crate::RustWistiaError;\n\nuse std::borrow::Cow;\nuse std::io::Cursor;\nuse std::time::Instant;\n\nuse hyper::client::{Client, HttpConnector};\nuse hyper::header::AUTHORIZATION;\nuse hyper::{Body, Method, Request};\nuse serde::de::DeserializeOwned;\nuse serde::ser::Serialize;\nuse serde_json::to_vec;\nuse serde_urlencoded::to_string;\n\npub type WistiaClient<'a> = DataClient<'a>;\n\n#[derive(Clone)]\npub struct DataClient<'a> {\n \n \n \n \n \n pub access_token: Cow<'a, str>,\n \n pub client: Client<tls::HttpsConnector<HttpConnector>>,\n}\n\nimpl<'a> From<Cow<'a, str>> for DataClient<'a> {\n \n fn from(access_token: Cow<'a, str>) -> Self {\n let token = auth_token(&access_token);\n\n Self {\n access_token: Cow::Owned(token),\n client: get_https_client(),\n }\n }\n}\n\nimpl<'a> From<&'a str> for DataClient<'a> {\n \n fn from(access_token: &'a str) -> Self {\n Self::from(Cow::Borrowed(access_token))\n }\n}\n\nimpl<'a> From<String> for DataClient<'a> {\n \n fn from(access_token: String) -> Self {\n Self::from(Cow::Owned(access_token))\n }\n}\n\nimpl<'a> DataClient<'a> {\n \n pub fn new(access_token: &'a str) -> Self {\n Self::from(access_token)\n }\n\n \n \n pub fn from_env() -> crate::Result<Self> {\n let token: String =\n std::env::var(ENV_VAR_NAME).map_err(|_| RustWistiaError::EnvVarNotFound {\n name: ENV_VAR_NAME.to_owned(),\n })?;\n\n Ok(Self::from(token))\n }\n\n \n \n \n \n \n \n \n \n \n \n \n pub async fn download_asset(\n &'a self,\n req: DownloadAssetRequest<'a>,\n ) -> crate::Result<Cursor<hyper::body::Bytes>> {\n \n \n let media = if let Some(media) = req.media {\n media\n } else if let Some(media_id) = req.media_id {\n self.get_media(media_id).await?\n } else {\n return Err(RustWistiaError::MediaIsRequired);\n };\n\n \n let url = media.asset_url(req.asset_type)?;\n\n \n let media_content = stream_reader_from_url(&url, self.client.clone()).await;\n\n if let Some(file_path) = req.file_path {\n \n let mut content = media_content?;\n let mut file = std::fs::File::create(file_path)?;\n std::io::copy(&mut content, &mut file)?;\n\n Ok(content)\n } else {\n media_content\n }\n }\n\n \n \n \n \n pub async fn get_media(&self, video_id: &'a str) -> crate::Result<Media> {\n let url = format!(\n \"https://api.wistia.com/v1/medias/{media_id}.json\",\n media_id = video_id\n );\n\n self.get(&url).await\n }\n\n \n \n \n \n pub async fn update_media(&self, video: UpdateMediaRequest) -> crate::Result<MediaInfo> {\n let url = format!(\n \"https://api.wistia.com/v1/medias/{media_id}.json\",\n media_id = video.id\n );\n\n self.put(&url, video).await\n }\n\n \n pub async fn get<R: DeserializeOwned>(&'a self, url: &'a str) -> crate::Result<R> {\n let token = self.access_token.as_ref();\n\n let req = Request::builder()\n .method(Method::GET)\n .uri(url)\n .header(AUTHORIZATION, token)\n .body(Body::empty())?;\n\n self.make_request(url, req).await\n }\n\n \n pub async fn put<B: Serialize, R: DeserializeOwned>(\n &'a self,\n url: &'a str,\n body: B,\n ) -> crate::Result<R> {\n let token = self.access_token.as_ref();\n\n let mut uri: String;\n let params = to_string(body)?;\n let params_len = params.len();\n\n let url = "},"suffix":{"kind":"string","value":";\n\n let req = Request::builder()\n .method(Method::PUT)\n .uri(url)\n .header(AUTHORIZATION, token)\n .body(Body::empty())?;\n\n self.make_request(url, req).await\n }\n\n \n pub async fn put_with_body<B: Serialize, R: DeserializeOwned>(\n &'a self,\n url: &'a str,\n body: B,\n ) -> crate::Result<R> {\n let token = self.access_token.as_ref();\n let body_data = to_vec(&body)?;\n\n let req = Request::builder()\n .method(Method::PUT)\n .uri(url)\n .header(AUTHORIZATION, token)\n .body(Body::from(body_data))?;\n\n self.make_request(url, req).await\n }\n\n \n pub(crate) async fn make_request<R: DeserializeOwned>(\n &'a self,\n url: &'a str,\n req: Request<Body>,\n ) -> crate::Result<R> {\n let start = Instant::now();\n let mut resp = self.client.request(req).await?;\n debug!(\"Call Data API completed {:.2?}\", start.elapsed());\n\n raise_for_status(url, &mut resp).await?;\n\n into_struct_from_slice(resp).await\n }\n}\n"},"middle":{"kind":"string","value":"if params_len != 0 {\n uri = String::with_capacity(url.len() + params.len() + 1);\n uri.push_str(url);\n uri.push('?');\n uri.push_str(¶ms);\n uri.as_str()\n } else {\n url\n }"},"strategy":{"kind":"string","value":"if_condition"},"context_items":{"kind":"list like","value":[{"content":"/// Returns the value to set in the `AUTHORIZATION` header for a request.\n\npub fn auth_token(token: &str) -> String {\n\n // \"Bearer \".len() == 7\n\n let mut bearer_token = String::with_capacity(7 + token.len());\n\n bearer_token.push_str(\"Bearer \");\n\n bearer_token.push_str(token);\n\n\n\n bearer_token\n\n}\n","file_path":"src/auth.rs","rank":0,"score":198759.18778718382},{"content":"pub fn host_with_path(url: &str) -> Result<String> {\n\n let uri: Uri = url.parse()?;\n\n let host = uri.host().unwrap();\n\n let path = uri.path();\n\n\n\n Ok(format!(\"{}{}\", host, path))\n\n}\n\n\n\npub async fn into_struct_from_slice<T>(resp: Response<Body>) -> Result<T>\n\nwhere\n\n T: de::DeserializeOwned,\n\n{\n\n // asynchronously concatenate the buffer from a body into bytes\n\n let bytes = hyper::body::to_bytes(resp).await?;\n\n\n\n // try to parse as json with serde_json\n\n Ok(serde_json::from_slice(&bytes)?)\n\n}\n\n\n\n/// Read the body content of a mutable reference to a `Response` object\n","file_path":"src/utils.rs","rank":1,"score":181794.7753972338},{"content":"#[cfg(not(feature = \"rust-tls\"))]\n\npub fn get_https_client<T>() -> Client<tls::HttpsConnector<HttpConnector>, T>\n\nwhere\n\n T: hyper::body::HttpBody + std::marker::Send,\n\n <T as hyper::body::HttpBody>::Data: Send,\n\n{\n\n // Prepare the HTTPS connector\n\n let https_connector = tls::HttpsConnector::new();\n\n Client::builder().build::<_, T>(https_connector)\n\n}\n","file_path":"src/https.rs","rank":2,"score":120288.94990353339},{"content":"#[derive(Parser, Debug)]\n\nstruct Args {\n\n /// A publicly-accessible URL link to the media file\n\n #[clap(\n\n short,\n\n long,\n\n default_value = \"https://commondatastorage.googleapis.com/gtv-videos-bucket/sample/ForBiggerMeltdowns.mp4\"\n\n )]\n\n url: String,\n\n /// Name of the media file\n\n #[clap(short, long)]\n\n name: Option<String>,\n\n /// Description of the media file\n\n #[clap(short, long, default_value = \"My <i>test</i><br>Message <b>here</b>.\")]\n\n description: String,\n\n /// Hashed ID of the Wistia project to upload to\n\n #[clap(short, long)]\n\n project_id: Option<String>,\n\n /// A Wistia contact id, an integer value.\n\n #[clap(short, long)]\n\n contact_id: Option<String>,\n","file_path":"examples/upload_url.rs","rank":3,"score":75649.63493423292},{"content":"#[derive(Parser, Debug)]\n\nstruct Args {\n\n /// Hashed ID of the Wistia video to retrieve info on\n\n #[clap(short, long)]\n\n video_id: String,\n\n}\n\n\n\n#[tokio::main]\n\nasync fn main() -> Result<()> {\n\n sensible_env_logger::init!();\n\n\n\n let args: Args = Args::parse();\n\n\n\n // Alternatively, we could use `WistiaClient::from(token)?` to\n\n // create the new `WistiaClient` instance.\n\n let client = WistiaClient::from_env()?;\n\n\n\n let video_id = &args.video_id;\n\n\n\n let res = client.get_media(video_id).await?;\n\n\n\n trace!(\"Response: {}\", to_string_pretty(&res)?);\n\n\n\n Ok(())\n\n}\n","file_path":"examples/get_media.rs","rank":4,"score":75201.41712124602},{"content":"#[derive(Parser, Debug)]\n\nstruct Args {\n\n /// Hashed ID of the Wistia video to update\n\n #[clap(short, long)]\n\n video_id: String,\n\n /// The media's new name.\n\n #[clap(short, long)]\n\n name: Option<String>,\n\n /// The Wistia hashed ID of an image that will replace the still that’s\n\n /// displayed before the player starts playing. Will return failure message\n\n /// unless media to update is a video, and new still is an image.\n\n #[clap(short, long)]\n\n pub still_media_id: Option<String>,\n\n /// A new description for this media. Accepts plain text or markdown.\n\n #[clap(short, long)]\n\n pub description: Option<String>,\n\n}\n\n\n\n#[tokio::main]\n\nasync fn main() -> Result<()> {\n\n sensible_env_logger::init!();\n","file_path":"examples/update_media.rs","rank":5,"score":75201.41712124602},{"content":"#[derive(Parser, Debug)]\n\nstruct Args {\n\n /// Path to media file\n\n #[clap(\n\n short,\n\n long,\n\n parse(from_os_str),\n\n default_value = \"./examples/assets/sample-video.mp4\"\n\n )]\n\n file_path: PathBuf,\n\n /// Name of the media file\n\n #[clap(short, long, default_value_t = String::new())]\n\n name: String,\n\n /// Description of the media file\n\n #[clap(short, long, default_value = \"My <i>test</i><br>Message <b>here</b>.\")]\n\n description: String,\n\n /// Hashed ID of the Wistia project to upload to\n\n #[clap(short, long, default_value_t = String::new())]\n\n project_id: String,\n\n /// A Wistia contact id, an integer value.\n\n #[clap(short, long, default_value_t = String::new())]\n","file_path":"examples/upload_file.rs","rank":6,"score":74763.32568080392},{"content":"#[derive(Parser, Debug)]\n\nstruct Args {\n\n /// Hashed ID of the Wistia video to retrieve info on\n\n #[clap(short, long)]\n\n video_id: String,\n\n\n\n /// Type of the media asset to retrieve. Defaults to the original asset that was uploaded.\n\n #[clap(short = 't', long, default_value = \"OriginalFile\")]\n\n asset_type: String,\n\n\n\n /// Retrieve only the HTTP asset url, rather than the SSL (HTTPS) variant\n\n #[clap(short, long)]\n\n no_ssl: bool,\n\n}\n\n\n\n#[tokio::main]\n\nasync fn main() -> Result<()> {\n\n sensible_env_logger::init!();\n\n\n\n let args: Args = Args::parse();\n\n let asset_type = args.asset_type.as_str();\n","file_path":"examples/get_asset_url.rs","rank":7,"score":73541.32955939145},{"content":"#[derive(Parser, Debug)]\n\nstruct Args {\n\n /// A publicly-accessible URL link to the media file\n\n #[clap(\n\n short,\n\n long,\n\n default_value = \"https://commondatastorage.googleapis.com/gtv-videos-bucket/sample/ForBiggerMeltdowns.mp4\"\n\n )]\n\n url: String,\n\n /// Name of the media file\n\n #[clap(short, long)]\n\n name: Option<String>,\n\n /// Description of the media file\n\n #[clap(short, long, default_value = \"My <i>test</i><br>Message <b>here</b>.\")]\n\n description: String,\n\n /// Hashed ID of the Wistia project to upload to\n\n #[clap(short, long)]\n\n project_id: Option<String>,\n\n /// A Wistia contact id, an integer value.\n\n #[clap(short, long)]\n\n contact_id: Option<String>,\n","file_path":"examples/upload_url_stream.rs","rank":8,"score":73541.32955939145},{"content":"#[derive(Parser, Debug)]\n\nstruct Args {\n\n /// Path to media file\n\n #[clap(\n\n short,\n\n long,\n\n parse(from_os_str),\n\n default_value = \"./examples/assets/sample-video.mp4\"\n\n )]\n\n file_path: PathBuf,\n\n /// Name of the media file\n\n #[clap(short, long, default_value_t = String::new())]\n\n name: String,\n\n /// Description of the media file\n\n #[clap(short, long, default_value = \"My <i>test</i><br>Message <b>here</b>.\")]\n\n description: String,\n\n /// Hashed ID of the Wistia project to upload to\n\n #[clap(short, long, default_value_t = String::new())]\n\n project_id: String,\n\n /// A Wistia contact id, an integer value.\n\n #[clap(short, long, default_value_t = String::new())]\n","file_path":"examples/upload_file_stream.rs","rank":9,"score":72685.64985477287},{"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":"tests/version-number.rs","rank":10,"score":69186.65724292178},{"content":"pub fn is_default<T: Default + PartialEq>(t: &T) -> bool {\n\n t == &T::default()\n\n}\n\n\n","file_path":"src/utils.rs","rank":11,"score":66912.43108250119},{"content":"fn empty_string_is_none<'de, D>(deserializer: D) -> Result<Option<String>, D::Error>\n\nwhere\n\n D: Deserializer<'de>,\n\n{\n\n let s = String::deserialize(deserializer)?;\n\n if s.is_empty() {\n\n Ok(None)\n\n } else {\n\n Ok(Some(s))\n\n }\n\n}\n\n\n\n#[cfg(test)]\n\nmod tests {\n\n use super::*;\n\n\n\n use crate::log::debug;\n\n use serde_json::from_str;\n\n\n\n /// Using the provided [Example Response][]\n","file_path":"src/models/upload/response.rs","rank":12,"score":66772.96016708651},{"content":"use serde::{Deserialize, Serialize};\n\n\n\n/// A value which represents the type of media.\n\n///\n\n/// See more [on `type`][].\n\n///\n\n/// [on `type`]: https://wistia.com/support/developers/data-api#medias-response\n\n#[derive(Debug, PartialEq, Serialize, Deserialize)]\n\npub enum MediaType {\n\n Video,\n\n Audio,\n\n Image,\n\n PdfDocument,\n\n MicrosoftOfficeDocument,\n\n Swf,\n\n UnknownType,\n\n}\n\n\n\nimpl Default for MediaType {\n\n fn default() -> Self {\n\n MediaType::Video\n\n }\n\n}\n","file_path":"src/models/media/type.rs","rank":13,"score":60847.48356190733},{"content":"fn show_progress(msg: impl ToString) -> ProgressBar {\n\n let pb = ProgressBar::new_spinner();\n\n pb.enable_steady_tick(120);\n\n pb.set_style(\n\n ProgressStyle::default_spinner()\n\n .template(\"{spinner:.blue} {msg}\")\n\n .tick_strings(&[\n\n \"▹▹▹▹▹\",\n\n \"▸▹▹▹▹\",\n\n \"▹▸▹▹▹\",\n\n \"▹▹▸▹▹\",\n\n \"▹▹▹▸▹\",\n\n \"▹▹▹▹▸\",\n\n \"▪▪▪▪▪\",\n\n ]),\n\n );\n\n pb.set_message(msg.to_string());\n\n pb\n\n}\n","file_path":"examples/download_asset.rs","rank":14,"score":60082.46447281387},{"content":" #[serde(skip_serializing_if = \"Option::is_none\")]\n\n pub description: Option<String>,\n\n}\n\n\n\nimpl UpdateMediaRequest {\n\n /// Sets the media's new name\n\n pub fn name(mut self, name: &str) -> Self {\n\n self.name = Some(name.to_owned());\n\n self\n\n }\n\n\n\n /// Sets the Wistia hashed ID of an image that will replace the still that’s\n\n /// displayed before the player starts playing.\n\n pub fn new_still_media_id(mut self, new_still_media_id: &str) -> Self {\n\n self.new_still_media_id = Some(new_still_media_id.to_owned());\n\n self\n\n }\n\n\n\n /// Sets a new description for this media. Accepts plain text or markdown.\n\n pub fn description(mut self, description: &str) -> Self {\n\n self.description = Some(description.to_owned());\n\n self\n\n }\n\n}\n","file_path":"src/models/media/update_request.rs","rank":15,"score":58455.81365247546},{"content":"use serde::Serialize;\n\n\n\n/// Represents a [Medias: Update] request.\n\n///\n\n/// [Medias: Update]: https://wistia.com/support/developers/data-api#the-request-7\n\n///\n\n#[derive(Default, Debug, PartialEq, Serialize)]\n\npub struct UpdateMediaRequest {\n\n /// The hashed Video Id (example: `abc1234567`).\n\n #[serde(skip_serializing)]\n\n pub id: String,\n\n /// The media's new name.\n\n #[serde(skip_serializing_if = \"Option::is_none\")]\n\n pub name: Option<String>,\n\n /// The Wistia hashed ID of an image that will replace the still that’s\n\n /// displayed before the player starts playing. Will return failure message\n\n /// unless media to update is a video, and new still is an image.\n\n #[serde(skip_serializing_if = \"Option::is_none\")]\n\n pub new_still_media_id: Option<String>,\n\n /// A new description for this media. Accepts plain text or markdown.\n","file_path":"src/models/media/update_request.rs","rank":16,"score":58452.79305516511},{"content":"#[derive(Parser, Debug)]\n\nstruct Args {\n\n /// Path to image file\n\n #[clap(\n\n short,\n\n long,\n\n parse(from_os_str),\n\n default_value = \"./examples/assets/sample-thumbnail.png\"\n\n )]\n\n file_path: PathBuf,\n\n /// Name of the media file\n\n #[clap(short, long, default_value_t = String::new())]\n\n name: String,\n\n /// Description of the media file\n\n #[clap(short, long, default_value = \"My <i>test</i><br>Message <b>here</b>.\")]\n\n description: String,\n\n /// Hashed ID of the Wistia project to upload to\n\n #[clap(short, long, default_value_t = String::new())]\n\n project_id: String,\n\n /// A Wistia contact id, an integer value.\n\n #[clap(short, long, default_value_t = String::new())]\n","file_path":"examples/upload_thumbnail.rs","rank":17,"score":45223.96049933111},{"content":"#[derive(Parser, Debug)]\n\nstruct Args {\n\n /// Hashed ID of the Wistia video to retrieve info on\n\n #[clap(short, long)]\n\n video_id: String,\n\n\n\n /// Type of the media asset to download. Defaults to the original asset that was uploaded.\n\n #[clap(short = 't', long, default_value = \"OriginalFile\")]\n\n asset_type: String,\n\n\n\n /// Path to media file\n\n #[clap(short, long, parse(from_os_str), default_value = \"./my-video.mp4\")]\n\n file_path: PathBuf,\n\n}\n\n\n\n#[tokio::main]\n\nasync fn main() -> Result<()> {\n\n sensible_env_logger::init_timed_short!();\n\n\n\n let args: Args = Args::parse();\n\n\n","file_path":"examples/download_asset.rs","rank":18,"score":45223.96049933111},{"content":"#[test]\n\nfn test_readme_deps() {\n\n version_sync::assert_markdown_deps_updated!(\"README.md\");\n\n}\n\n\n","file_path":"tests/version-number.rs","rank":19,"score":42632.76706885571},{"content":"use super::{Asset, MediaStatus, MediaType, ProjectInfo, Thumbnail};\n\nuse crate::constants::*;\n\nuse crate::{Result, RustWistiaError};\n\n\n\nuse serde::{Deserialize, Serialize};\n\n\n\n#[derive(Default, Debug, PartialEq, Serialize, Deserialize)]\n\n#[serde(rename_all = \"camelCase\")]\n\npub struct Media {\n\n #[serde(rename = \"hashed_id\")]\n\n pub hashed_id: String,\n\n pub id: u64,\n\n pub name: String,\n\n #[serde(rename = \"type\")]\n\n pub type_field: MediaType,\n\n pub created: String,\n\n pub updated: String,\n\n /// Note: only videos have this attribute set; thumbnails and other\n\n /// medias don't.\n\n pub duration: Option<f64>,\n","file_path":"src/models/media/media.rs","rank":20,"score":37402.61634758801},{"content":" pub status: MediaStatus,\n\n #[serde(default)]\n\n pub description: String,\n\n #[serde(default)]\n\n pub progress: f64,\n\n pub thumbnail: Thumbnail,\n\n pub project: ProjectInfo,\n\n #[serde(skip_serializing)]\n\n pub embed_code: String,\n\n pub assets: Vec<Asset>,\n\n pub section: Option<String>,\n\n}\n\n\n\nimpl Media {\n\n /// Retrieve the *asset URL* for the original source media that was uploaded.\n\n pub fn source_url(&self) -> Result<String> {\n\n self.asset_url(None)\n\n }\n\n\n\n /// Retrieve the *asset URL* (default: **HTTPS**) for a specified `asset_type`, which\n","file_path":"src/models/media/media.rs","rank":21,"score":37397.23617368993},{"content":" /// defaults to the original source media if not provided.\n\n pub fn asset_url<'a>(&'a self, asset_type: impl Into<Option<&'a str>>) -> Result<String> {\n\n let url = self.asset_url_insecure(asset_type)?;\n\n\n\n let (_, id) = url.rsplit_once('/').unwrap();\n\n let id = match id.rsplit_once(\".bin\") {\n\n Some((id, _)) => id,\n\n None => id,\n\n };\n\n\n\n Ok(format!(\n\n \"https://embed-ssl.wistia.com/deliveries/{id}/{DEFAULT_FILENAME}\"\n\n ))\n\n }\n\n\n\n /// Retrieve the *asset URL* (default: **HTTP**) for a specified `asset_type`, which\n\n /// defaults to the original source media if not provided.\n\n pub fn asset_url_insecure<'a>(\n\n &'a self,\n\n asset_type: impl Into<Option<&'a str>>,\n","file_path":"src/models/media/media.rs","rank":22,"score":37396.35230057183},{"content":" ) -> Result<&'a str> {\n\n let r#type = asset_type.into().unwrap_or(ORIGINAL_ASSET);\n\n\n\n for asset in self.assets.iter() {\n\n if asset.type_field == r#type {\n\n return Ok(&asset.url);\n\n }\n\n }\n\n\n\n Err(RustWistiaError::AssetNotFound {\n\n r#type: r#type.to_string(),\n\n video_id: self.hashed_id.clone(),\n\n valid_types: self.assets.iter().map(|a| a.type_field.clone()).collect(),\n\n })\n\n }\n\n}\n","file_path":"src/models/media/media.rs","rank":23,"score":37392.18799516514},{"content":"use super::{MediaStatus, MediaType, Thumbnail};\n\nuse serde::{Deserialize, Serialize};\n\n\n\n#[derive(Default, Debug, PartialEq, Serialize, Deserialize)]\n\n#[serde(rename_all = \"camelCase\")]\n\npub struct MediaInfo {\n\n #[serde(rename = \"hashed_id\")]\n\n pub hashed_id: String,\n\n pub id: u64,\n\n pub name: String,\n\n #[serde(rename = \"type\")]\n\n pub type_field: MediaType,\n\n pub created: String,\n\n pub updated: String,\n\n /// Note: only videos have this attribute set; thumbnails and other\n\n /// medias don't.\n\n pub duration: Option<f64>,\n\n pub status: MediaStatus,\n\n pub description: String,\n\n pub progress: f64,\n\n pub thumbnail: Thumbnail,\n\n pub section: Option<String>,\n\n}\n","file_path":"src/models/media/media_info.rs","rank":24,"score":36586.26684478856},{"content":"//! Library-specific type definitions\n\n//!\n\nuse crate::RustWistiaError;\n\n\n\n/// Result type with errors populated solely by *our* library.\n\npub type Result<T> = std::result::Result<T, RustWistiaError>;\n","file_path":"src/types.rs","rank":25,"score":33232.416674900844},{"content":"}\n\n\n\n#[tokio::main]\n\nasync fn main() -> Result<()> {\n\n sensible_env_logger::init_timed_short!();\n\n\n\n let args: Args = Args::parse();\n\n\n\n trace!(\"Uploading link to Wistia...\");\n\n\n\n // Alternatively, we could use `UrlUploader::with_client(url, client)` to\n\n // create the new `UrlUploader` instance.\n\n let mut uploader = UrlUploader::new(&args.url)?;\n\n\n\n // Normally we'll just chain together the methods like below, but here we\n\n // need to explicitly exclude any empty string values.\n\n //\n\n // UrlUploader::new(&args.url)?\n\n // .name(&args.name)\n\n // .description(&args.description)\n","file_path":"examples/upload_url.rs","rank":26,"score":31576.30955145736},{"content":"use rust_wistia::{Result, UrlUploader};\n\n\n\n#[macro_use]\n\nextern crate log;\n\n\n\nuse clap::Parser;\n\n\n\n/// Upload a public accessible link to Wistia\n\n///\n\n/// You can find links to public test videos here:\n\n/// https://gist.github.com/jsturgis/3b19447b304616f18657?permalink_comment_id=3448015#gistcomment-3448015\n\n// noinspection DuplicatedCode\n\n#[derive(Parser, Debug)]\n","file_path":"examples/upload_url.rs","rank":27,"score":31563.716735594433},{"content":"\n\n if let Some(ref project_id) = args.project_id {\n\n uploader = uploader.project_id(project_id);\n\n };\n\n if let Some(ref name) = args.name {\n\n uploader = uploader.name(name);\n\n };\n\n if !args.description.is_empty() {\n\n uploader = uploader.description(&args.description);\n\n };\n\n if let Some(ref contact_id) = args.contact_id {\n\n uploader = uploader.contact_id(contact_id);\n\n };\n\n\n\n let res = uploader.send().await?;\n\n\n\n trace!(\"Response: {res:#?}\");\n\n trace!(\"Video ID: {}\", res.hashed_id);\n\n\n\n Ok(())\n\n}\n","file_path":"examples/upload_url.rs","rank":28,"score":31561.420167704793},{"content":"\n\n let args: Args = Args::parse();\n\n\n\n // Alternatively, we could use `WistiaClient::from(token)?` to\n\n // create the new `WistiaClient` instance.\n\n let client = WistiaClient::from_env()?;\n\n\n\n let req = UpdateMediaRequest {\n\n id: args.video_id,\n\n name: args.name,\n\n new_still_media_id: args.still_media_id,\n\n description: args.description,\n\n ..Default::default()\n\n };\n\n\n\n let res = client.update_media(req).await?;\n\n\n\n trace!(\"Response: {}\", to_string_pretty(&res)?);\n\n\n\n Ok(())\n\n}\n","file_path":"examples/update_media.rs","rank":29,"score":31115.639587921996},{"content":"use rust_wistia::{Result, WistiaClient};\n\n\n\n#[macro_use]\n\nextern crate log;\n\n\n\nuse clap::Parser;\n\nuse rust_wistia::models::UpdateMediaRequest;\n\nuse serde_json::to_string_pretty;\n\n\n\n/// Updates info on a Wistia video\n\n#[derive(Parser, Debug)]\n","file_path":"examples/update_media.rs","rank":30,"score":31107.398711209073},{"content":"use rust_wistia::{Result, WistiaClient};\n\n\n\n#[macro_use]\n\nextern crate log;\n\n\n\nuse clap::Parser;\n\nuse serde_json::to_string_pretty;\n\n\n\n/// Retrieve info on a Wistia video\n\n#[derive(Parser, Debug)]\n","file_path":"examples/get_media.rs","rank":31,"score":31102.559162597972},{"content":" contact_id: String,\n\n}\n\n\n\n// noinspection DuplicatedCode\n\n#[tokio::main]\n\nasync fn main() -> Result<()> {\n\n sensible_env_logger::init_timed_short!();\n\n\n\n let args: Args = Args::parse();\n\n\n\n trace!(\"Uploading file to Wistia...\");\n\n\n\n let client = UploadClient::from_env()?;\n\n let file_path = Path::new(&args.file_path);\n\n\n\n // Alternatively, we could use `FileUploader::new(path)?` to\n\n // create the new `FileUploader` instance.\n\n let res = FileUploader::with_client(file_path, client)\n\n .project_id(&args.project_id)\n\n .name(&args.name)\n","file_path":"examples/upload_file.rs","rank":32,"score":30652.682570260327},{"content":"use rust_wistia::{FileUploader, Result, UploadClient};\n\n\n\n#[macro_use]\n\nextern crate log;\n\n\n\nuse std::path::{Path, PathBuf};\n\n\n\nuse clap::Parser;\n\n\n\n/// Upload a local file to Wistia\n\n// noinspection DuplicatedCode\n\n#[derive(Parser, Debug)]\n","file_path":"examples/upload_file.rs","rank":33,"score":30645.03498041952},{"content":" .description(&args.description)\n\n .contact_id(&args.contact_id)\n\n .send()\n\n .await?;\n\n\n\n trace!(\"Response: {res:#?}\");\n\n trace!(\"Video ID: {}\", res.hashed_id);\n\n\n\n Ok(())\n\n}\n","file_path":"examples/upload_file.rs","rank":34,"score":30639.101034385792},{"content":"\n\n// We get a warning in the `examples/` that this is not used, but it *will*\n\n// be used when the optional feature is enabled.\n\n#[allow(unused)]\n\n#[derive(Clone)]\n\npub(crate) struct UploadFileRequest<'a, P: AsRef<Path>> {\n\n /// **Required**. The path to the media file. The contents of this file\n\n /// will be multipart-form encoded into the request body.\n\n pub file_path: P,\n\n /// The hashed id of the project to upload media into. If omitted, a new\n\n /// project will be created and uploaded to. The naming convention used\n\n /// for such projects is `Uploads_YYYY-MM-DD`.\n\n pub project_id: Option<&'a str>,\n\n /// A display name to use for the media in Wistia. If omitted, the filename\n\n /// will be used instead. This field is limited to 255 characters.\n\n pub name: Option<&'a str>,\n\n /// A description to use for the media in Wistia. You can use basic HTML\n\n /// here, but note that both HTML and CSS will be sanitized.\n\n pub description: Option<&'a str>,\n\n /// A Wistia contact id, an integer value. If omitted, it will default to\n","file_path":"src/models/upload/request.rs","rank":35,"score":30566.71598187623},{"content":" #[allow(unused)]\n\n pub(crate) fn new(file_path: &'a str) -> Self {\n\n Self {\n\n file_name: file_path,\n\n project_id: None,\n\n name: None,\n\n description: None,\n\n contact_id: None,\n\n }\n\n }\n\n}\n\n\n\n#[cfg(test)]\n\nmod tests {\n\n use super::*;\n\n use serde_urlencoded::to_string;\n\n\n\n #[test]\n\n fn test_it_works() {\n\n let req = UploadRequest {\n","file_path":"src/models/upload/request.rs","rank":36,"score":30565.027112899636},{"content":"}\n\n\n\n#[derive(Default, Clone)]\n\npub(crate) struct UploadUrlRequest<'a> {\n\n /// **Required**. The web location of the media file to import.\n\n pub url: &'a str,\n\n /// The hashed id of the project to upload media into. If omitted, a new\n\n /// project will be created and uploaded to. The naming convention used\n\n /// for such projects is `Uploads_YYYY-MM-DD`.\n\n pub project_id: Option<&'a str>,\n\n /// A display name to use for the media in Wistia. If omitted, the filename\n\n /// will be used instead. This field is limited to 255 characters.\n\n pub name: Option<&'a str>,\n\n /// A description to use for the media in Wistia. You can use basic HTML\n\n /// here, but note that both HTML and CSS will be sanitized.\n\n pub description: Option<&'a str>,\n\n /// A Wistia contact id, an integer value. If omitted, it will default to\n\n /// the contact_id of the account’s owner.\n\n pub contact_id: Option<&'a str>,\n\n}\n","file_path":"src/models/upload/request.rs","rank":37,"score":30563.880372813368},{"content":" /// on your [API access page].\n\n ///\n\n /// [API access page]: https://wistia.com/support/developers/data-api#getting-started\n\n pub access_token: &'a str,\n\n /// **Required** unless `file` is specified. The web location of the media\n\n /// file to import.\n\n pub url: Option<&'a str>,\n\n /// The hashed id of the project to upload media into. If omitted, a new\n\n /// project will be created and uploaded to. The naming convention used\n\n /// for such projects is `Uploads_YYYY-MM-DD`.\n\n pub project_id: Option<&'a str>,\n\n /// A display name to use for the media in Wistia. If omitted, the filename\n\n /// will be used instead. This field is limited to 255 characters.\n\n pub name: Option<&'a str>,\n\n /// A description to use for the media in Wistia. You can use basic HTML\n\n /// here, but note that both HTML and CSS will be sanitized.\n\n pub description: Option<&'a str>,\n\n /// A Wistia contact id, an integer value. If omitted, it will default to\n\n /// the contact_id of the account’s owner.\n\n pub contact_id: Option<&'a str>,\n","file_path":"src/models/upload/request.rs","rank":38,"score":30562.566582893138},{"content":"#[derive(Clone)]\n\npub(crate) struct UploadStreamRequest<'a> {\n\n /// Optional. The name of the media file.\n\n pub file_name: &'a str,\n\n /// The hashed id of the project to upload media into. If omitted, a new\n\n /// project will be created and uploaded to. The naming convention used\n\n /// for such projects is `Uploads_YYYY-MM-DD`.\n\n pub project_id: Option<&'a str>,\n\n /// A display name to use for the media in Wistia. If omitted, the filename\n\n /// will be used instead. This field is limited to 255 characters.\n\n pub name: Option<&'a str>,\n\n /// A description to use for the media in Wistia. You can use basic HTML\n\n /// here, but note that both HTML and CSS will be sanitized.\n\n pub description: Option<&'a str>,\n\n /// A Wistia contact id, an integer value. If omitted, it will default to\n\n /// the contact_id of the account’s owner.\n\n pub contact_id: Option<&'a str>,\n\n}\n\n\n\nimpl<'a> UploadStreamRequest<'a> {\n","file_path":"src/models/upload/request.rs","rank":39,"score":30562.4507674792},{"content":" access_token: \"abc123\",\n\n url: None,\n\n project_id: None,\n\n name: None,\n\n description: None,\n\n contact_id: None,\n\n };\n\n\n\n assert_eq!(to_string(req).unwrap(), \"access_token=abc123\");\n\n }\n\n\n\n #[test]\n\n fn test_it_works_with_other_params() {\n\n let req = UploadRequest {\n\n access_token: \"xyz123\",\n\n url: Some(\"https://test-url.com/my/path?key=\\\"hello world!@#$?%&\\\"&value=\"),\n\n project_id: Some(\"abc321\"),\n\n name: None,\n\n description: None,\n\n contact_id: Some(\"my contact <abc@xyz.org>\"),\n\n };\n\n\n\n assert_eq!(to_string(req).unwrap(), \"access_token=xyz123&url=https%3A%2F%2Ftest-url.com%2Fmy%2Fpath%3Fkey%3D%22hello+world%21%40%23%24%3F%25%26%22%26value%3D&project_id=abc321&contact_id=my+contact+%3Cabc%40xyz.org%3E\");\n\n }\n\n}\n","file_path":"src/models/upload/request.rs","rank":40,"score":30562.19006500645},{"content":" /// the contact_id of the account’s owner.\n\n pub contact_id: Option<&'a str>,\n\n}\n\n\n\nimpl<'a, P: AsRef<Path>> UploadFileRequest<'a, P> {\n\n #[allow(unused)]\n\n pub(crate) fn new(file_path: P) -> Self {\n\n Self {\n\n file_path,\n\n project_id: None,\n\n name: None,\n\n description: None,\n\n contact_id: None,\n\n }\n\n }\n\n}\n\n\n\n// We get a warning in the `examples/` that this is not used, but it *will*\n\n// be used when the optional feature is enabled.\n\n#[allow(unused)]\n","file_path":"src/models/upload/request.rs","rank":41,"score":30561.297425184064},{"content":"use serde::Serialize;\n\n\n\nuse std::path::Path;\n\n\n\n/// Model representing a [Request] to the Wistia [Upload API].\n\n///\n\n/// # Note\n\n/// This only includes the parameters which may be encoded into the part\n\n/// of the query string.\n\n///\n\n/// The only exceptions are `description`, which is expected to be long and\n\n/// which may be more performant to be multipart-form encoded, and the `file`\n\n/// parameter which *must* be multipart-form encoded into the request body.\n\n///\n\n/// [Upload API]: https://wistia.com/support/developers/upload-api\n\n/// [Request]: https://wistia.com/support/developers/upload-api#the-request\n\n///\n\n#[derive(Default, Serialize)]\n\npub struct UploadRequest<'a> {\n\n /// **Required**. A 64 character hex string. This parameter can be found\n","file_path":"src/models/upload/request.rs","rank":42,"score":30559.177859064675},{"content":"\n\n // Alternatively, we could use `WistiaClient::from(token)?` to\n\n // create the new `WistiaClient` instance.\n\n let client = WistiaClient::from_env()?;\n\n\n\n let video_id = &args.video_id;\n\n\n\n let media = client.get_media(video_id).await?;\n\n\n\n let url = if args.no_ssl {\n\n media.asset_url_insecure(asset_type)?.to_owned()\n\n } else {\n\n // as a shorthand, we could just call `media.source_url()?` in this case\n\n media.asset_url(asset_type)?\n\n };\n\n\n\n trace!(\"Asset URL: {url}\");\n\n\n\n Ok(())\n\n}\n","file_path":"examples/get_asset_url.rs","rank":43,"score":30448.664671412324},{"content":"}\n\n\n\n#[tokio::main]\n\nasync fn main() -> Result<()> {\n\n sensible_env_logger::init_timed_short!();\n\n\n\n let args: Args = Args::parse();\n\n\n\n trace!(\"Uploading bytes content in link to Wistia...\");\n\n\n\n // Alternatively, we could use `StreamUploader::with_url(&args.url)` to\n\n // create the new `StreamUploader` instance without an explicit HTTPS client.\n\n let client = get_https_client();\n\n let mut uploader = StreamUploader::with_url_and_client(&args.url, client).await?;\n\n\n\n // Normally we'll just chain together the methods like below, but here we\n\n // need to explicitly exclude any empty string values.\n\n //\n\n // StreamUploader::new(bytes)?\n\n // .name(&args.name)\n","file_path":"examples/upload_url_stream.rs","rank":44,"score":30448.52483179446},{"content":"use rust_wistia::{Result, WistiaClient};\n\n\n\n#[macro_use]\n\nextern crate log;\n\n\n\nuse clap::Parser;\n\n\n\n/// Retrieve the media [Asset URL] on a Wistia video\n\n///\n\n/// [Asset URL]: https://wistia.com/support/developers/asset-urls\n\n#[derive(Parser, Debug)]\n","file_path":"examples/get_asset_url.rs","rank":45,"score":30440.881202718443},{"content":"use rust_wistia::{Result, StreamUploader};\n\n\n\n#[macro_use]\n\nextern crate log;\n\n\n\nuse clap::Parser;\n\nuse rust_wistia::https::get_https_client;\n\n\n\n/// Upload the *bytes* data for a public accessible link to Wistia\n\n///\n\n/// You can find links to public test videos here:\n\n/// https://gist.github.com/jsturgis/3b19447b304616f18657?permalink_comment_id=3448015#gistcomment-3448015\n\n// noinspection DuplicatedCode\n\n#[derive(Parser, Debug)]\n","file_path":"examples/upload_url_stream.rs","rank":46,"score":30433.91779190569},{"content":" // .description(&args.description)\n\n\n\n if let Some(ref project_id) = args.project_id {\n\n uploader = uploader.project_id(project_id);\n\n };\n\n if let Some(ref name) = args.name {\n\n uploader = uploader.name(name);\n\n };\n\n if !args.description.is_empty() {\n\n uploader = uploader.description(&args.description);\n\n };\n\n if let Some(ref contact_id) = args.contact_id {\n\n uploader = uploader.contact_id(contact_id);\n\n };\n\n\n\n let res = uploader.send().await?;\n\n\n\n trace!(\"Response: {res:#?}\");\n\n trace!(\"Video ID: {}\", res.hashed_id);\n\n\n\n Ok(())\n\n}\n","file_path":"examples/upload_url_stream.rs","rank":47,"score":30431.80643180784},{"content":" Err(_) => Err(RustWistiaError::EnvVarNotFound {\n\n name: ENV_VAR_NAME.to_owned(),\n\n }),\n\n }?;\n\n\n\n Ok(Self::from(token))\n\n }\n\n\n\n /// Initialize a new `UploadClient` object from an [API access token].\n\n ///\n\n /// [API access token]: https://wistia.com/support/developers/data-api#getting-started\n\n pub fn from_token(token: &str) -> Self {\n\n Self::from(token)\n\n }\n\n\n\n /// Build the URL with the url-encoded *query parameters* included\n\n pub fn build_url(params: UploadRequest) -> Result<String> {\n\n let query = to_string(params)?;\n\n\n\n // Build the URL with the query parameters included\n","file_path":"src/api/upload/client.rs","rank":53,"score":30090.815452161612},{"content":" let mut url = String::with_capacity(UPLOAD_API.len() + 1 + query.len());\n\n url.push_str(UPLOAD_API);\n\n url.push('?');\n\n url.push_str(query.as_str());\n\n\n\n Ok(url)\n\n }\n\n\n\n /// Send the request to the Wistia Upload API\n\n pub async fn make_request<'a>(\n\n &'a self,\n\n url: &'a str,\n\n req: Request<B>,\n\n ) -> Result<UploadResponse> {\n\n let start = Instant::now();\n\n let mut resp = self.client.request(req).await?;\n\n debug!(\"Call Upload API completed {:.2?}\", start.elapsed());\n\n\n\n raise_for_status(url, &mut resp).await?;\n\n\n","file_path":"src/api/upload/client.rs","rank":54,"score":30090.478763394913},{"content":" fn from(token: &str) -> Self {\n\n Self {\n\n access_token: token.to_string(),\n\n client: get_https_client(),\n\n }\n\n }\n\n}\n\n\n\nimpl<B: HttpBody + Send + 'static> UploadClient<B>\n\nwhere\n\n <B as HttpBody>::Data: Send,\n\n <B as HttpBody>::Error: Into<Box<(dyn std::error::Error + Send + Sync + 'static)>>,\n\n{\n\n /// Initialize a new `UploadClient` object from an [API access token],\n\n /// assuming this is currently set in the environment.\n\n ///\n\n /// [API access token]: https://wistia.com/support/developers/data-api#getting-started\n\n pub fn from_env() -> Result<Self> {\n\n let token = match var(ENV_VAR_NAME) {\n\n Ok(val) => Ok(val),\n","file_path":"src/api/upload/client.rs","rank":55,"score":30087.55354589535},{"content":"/// Prefer to use this with one of the concrete implementations, i.e.\n\n/// [`crate::FileUploader`] or [`crate::UrlUploader`].\n\n///\n\n/// Also check out the [`rust-wistia`] docs for usage and examples.\n\n///\n\n/// [`rust-wistia`]: https://docs.rs/rust-wistia\n\n/// [Upload API]: https://wistia.com/support/developers/upload-api\n\n///\n\n#[derive(Clone)]\n\npub struct UploadClient<B = Body> {\n\n /// Represents the [API access token] used to authenticate requests to the\n\n /// [Wistia API].\n\n ///\n\n /// [API access token]: https://wistia.com/support/developers/data-api#getting-started\n\n /// [Wistia API]: https://wistia.com/support/developers/upload-api\n\n pub access_token: String,\n\n /// The HTTPS client to use for sending requests.\n\n client: Client<tls::HttpsConnector<HttpConnector>, B>,\n\n}\n\n\n","file_path":"src/api/upload/client.rs","rank":58,"score":30086.547915091724},{"content":"impl<B: HttpBody + Send + 'static> From<String> for UploadClient<B>\n\nwhere\n\n <B as HttpBody>::Data: Send,\n\n <B as HttpBody>::Error: Into<Box<(dyn std::error::Error + Send + Sync + 'static)>>,\n\n{\n\n /// Create a new `UploadClient` from an access token\n\n fn from(token: String) -> Self {\n\n Self {\n\n access_token: token,\n\n client: get_https_client(),\n\n }\n\n }\n\n}\n\n\n\nimpl<B: HttpBody + Send + 'static> From<&str> for UploadClient<B>\n\nwhere\n\n <B as HttpBody>::Data: Send,\n\n <B as HttpBody>::Error: Into<Box<(dyn std::error::Error + Send + Sync + 'static)>>,\n\n{\n\n /// Create a new `UploadClient` from an access token\n","file_path":"src/api/upload/client.rs","rank":60,"score":30085.00236688375},{"content":"use crate::constants::{ENV_VAR_NAME, UPLOAD_API};\n\nuse crate::https::{get_https_client, tls};\n\nuse crate::log::debug;\n\nuse crate::models::*;\n\nuse crate::status::raise_for_status;\n\nuse crate::types::Result;\n\nuse crate::utils::into_struct_from_slice;\n\nuse crate::RustWistiaError;\n\n\n\nuse std::env::var;\n\nuse std::time::Instant;\n\n\n\nuse hyper::body::HttpBody;\n\nuse hyper::client::HttpConnector;\n\nuse hyper::{Body, Client, Request};\n\nuse serde_urlencoded::to_string;\n\n\n\n/// Client used to make requests to the Wistia **[Upload API]**.\n\n///\n\n/// # Note\n","file_path":"src/api/upload/client.rs","rank":63,"score":30081.28709975525},{"content":" into_struct_from_slice(resp).await\n\n }\n\n}\n\n\n\n#[cfg(test)]\n\nmod tests {\n\n use serde::{Deserialize, Serialize};\n\n\n\n #[test]\n\n fn test_url_encoded_with_struct() {\n\n #[derive(Deserialize, Serialize, PartialEq, Debug)]\n\n struct Meal<'a> {\n\n bread: &'a str,\n\n cheese: &'a str,\n\n meat: &'a str,\n\n fat: &'a str,\n\n }\n\n\n\n let m = Meal {\n\n bread: \"baguette\",\n","file_path":"src/api/upload/client.rs","rank":65,"score":30077.607554351074},{"content":" cheese: \"comté\",\n\n meat: \"ham\",\n\n fat: \"butter\",\n\n };\n\n\n\n assert_eq!(\n\n serde_urlencoded::to_string::<Meal>(m),\n\n Ok(\"bread=baguette&cheese=comt%C3%A9&meat=ham&fat=butter\".to_owned())\n\n );\n\n }\n\n}\n","file_path":"src/api/upload/client.rs","rank":66,"score":30064.34831625462},{"content":"use crate::utils::is_default;\n\n\n\nuse serde::{Deserialize, Serialize};\n\n\n\n#[derive(Default, Debug, Clone, PartialEq, Serialize, Deserialize)]\n\n#[serde(rename_all = \"camelCase\")]\n\npub struct Asset {\n\n pub content_type: String,\n\n pub file_size: u64,\n\n #[serde(rename = \"type\")]\n\n pub type_field: String,\n\n pub url: String,\n\n /// Note: `height` will **not** be populated for audio (or alternate audio) files\n\n #[serde(skip_serializing_if = \"is_default\")]\n\n #[serde(default)]\n\n pub height: u64,\n\n /// Note: `width` will **not** be populated for audio (or alternate audio) files\n\n #[serde(skip_serializing_if = \"is_default\")]\n\n #[serde(default)]\n\n pub width: u64,\n\n}\n","file_path":"src/models/media/asset.rs","rank":67,"score":29997.326355250967},{"content":"use serde::{Deserialize, Serialize};\n\n\n\n/// An object representing the [thumbnail] for a media.\n\n///\n\n/// [thumbnail]: https://wistia.com/support/developers/data-api#medias-response\n\n#[derive(Default, Debug, PartialEq, Serialize, Deserialize)]\n\npub struct Thumbnail {\n\n pub url: String,\n\n pub width: u64,\n\n pub height: u64,\n\n}\n","file_path":"src/models/media/thumbnail.rs","rank":68,"score":29995.8050399402},{"content":"use serde::{Deserialize, Serialize};\n\n\n\n#[derive(Default, Debug, Clone, PartialEq, Serialize, Deserialize)]\n\npub struct ProjectInfo {\n\n pub hashed_id: String,\n\n pub id: u64,\n\n pub name: String,\n\n}\n","file_path":"src/models/media/project.rs","rank":69,"score":29994.16826941586},{"content":"mod asset;\n\nmod download_asset;\n\nmod media;\n\nmod media_info;\n\nmod project;\n\nmod status;\n\nmod thumbnail;\n\nmod r#type;\n\nmod update_request;\n\n\n\npub use asset::*;\n\npub use download_asset::*;\n\npub use media::*;\n\npub use media_info::*;\n\npub use project::*;\n\npub use r#type::*;\n\npub use status::*;\n\npub use thumbnail::*;\n\npub use update_request::*;\n","file_path":"src/models/media/mod.rs","rank":70,"score":29992.078313762875},{"content":"use serde::{Deserialize, Serialize};\n\n\n\n/// Media files return a response attribute called status.\n\n///\n\n/// After upload is complete, media files must be processed. Status indicates\n\n/// which stage in processing the file is at.\n\n///\n\n/// See also: [Media Status][]\n\n///\n\n/// [Media Status]: https://wistia.com/support/developers/data-api#media-status\n\n#[derive(Debug, PartialEq, Serialize, Deserialize)]\n\n#[serde(rename_all = \"lowercase\")]\n\npub enum MediaStatus {\n\n /// **queued**: the file is waiting in the queue to be processed\n\n Queued,\n\n /// **processing**: the file is actively being processed\n\n Processing,\n\n /// **ready**: the file has been fully processed and is ready for\n\n /// embedding and viewing.\n\n Ready,\n","file_path":"src/models/media/status.rs","rank":71,"score":29988.393904452525},{"content":" /// **failed**: the file was unable to be processed (usually a\n\n /// [format or size error](https://wistia.com/support/uploading/export-settings))\n\n Failed,\n\n}\n\n\n\nimpl Default for MediaStatus {\n\n fn default() -> Self {\n\n Self::Queued\n\n }\n\n}\n","file_path":"src/models/media/status.rs","rank":72,"score":29984.05899043098},{"content":" req: UploadFileRequest::new(file_path),\n\n })\n\n }\n\n\n\n /// Create a `FileUploader` with a new HTTPS client and a Wistia access\n\n /// token.\n\n ///\n\n /// # Arguments\n\n ///\n\n /// * `file_path` - The path to the media file. The contents of this file\n\n /// will be multipart-form encoded into the request body.\n\n /// * `access_token` - An API access token used to make requests to the\n\n /// Wistia API.\n\n ///\n\n pub fn with_token(file_path: P, access_token: &str) -> Self {\n\n Self {\n\n client: UploadClient::from_token(access_token),\n\n req: UploadFileRequest::new(file_path),\n\n }\n\n }\n","file_path":"src/api/upload/file.rs","rank":73,"score":29573.30699777039},{"content":"\n\n /// Create a `FileUploader` with a file path and an HTTPS client.\n\n ///\n\n /// # Arguments\n\n ///\n\n /// * `file_path` - The path to the media file. The contents of this file\n\n /// will be multipart-form encoded into the request body.\n\n /// * `client` - The HTTPS client (UploadClient) to use for requests.\n\n /// Note that the client must support multipart form requests, via a\n\n /// `multipart::Body`.\n\n ///\n\n pub fn with_client(file_path: P, client: UploadClient<Body>) -> Self {\n\n Self {\n\n client,\n\n req: UploadFileRequest::new(file_path),\n\n }\n\n }\n\n\n\n /// The hashed id of the project to upload media into. If omitted, a new\n\n /// project will be created and uploaded to. The naming convention used\n","file_path":"src/api/upload/file.rs","rank":74,"score":29570.351184432155},{"content":"/// [Upload API]: https://wistia.com/support/developers/upload-api\n\n///\n\n#[derive(Clone)]\n\npub struct FileUploader<'a, P: AsRef<Path>, B = Body> {\n\n client: UploadClient<B>,\n\n req: UploadFileRequest<'a, P>,\n\n}\n\n\n\nimpl<'a, P: AsRef<Path> + Debug> FileUploader<'a, P> {\n\n /// Create a `FileUploader` with a new HTTPS client, with the access token\n\n /// retrieved from the environment.\n\n ///\n\n /// # Arguments\n\n ///\n\n /// * `file_path` - The path to the media file. The contents of this file\n\n /// will be multipart-form encoded into the request body.\n\n ///\n\n pub fn new(file_path: P) -> Result<Self> {\n\n Ok(Self {\n\n client: UploadClient::from_env()?,\n","file_path":"src/api/upload/file.rs","rank":75,"score":29569.745590596503},{"content":" /// A Wistia contact id, an integer value. If omitted, it will default to\n\n /// the contact_id of the account’s owner.\n\n pub fn contact_id(mut self, contact_id: &'a str) -> Self {\n\n self.req.contact_id = Some(contact_id);\n\n self\n\n }\n\n\n\n /// Send the Upload File request (with the *multi-part form* data) to the\n\n /// Wistia [Upload API].\n\n ///\n\n /// [Upload API]: https://wistia.com/support/developers/upload-api\n\n ///\n\n // noinspection DuplicatedCode\n\n pub async fn send(&self) -> Result<UploadResponse> {\n\n // Build the query parameters to pass to the Upload API\n\n\n\n let params = UploadRequest {\n\n access_token: self.client.access_token.as_str(),\n\n url: None,\n\n project_id: self.req.project_id,\n","file_path":"src/api/upload/file.rs","rank":76,"score":29568.17768252009},{"content":" name: self.req.name,\n\n description: None,\n\n contact_id: self.req.contact_id,\n\n };\n\n\n\n let url = UploadClient::<Body>::build_url(params)?;\n\n\n\n // Create a request instance and multipart form\n\n let req_builder = Request::post(&url);\n\n let mut form = Form::default();\n\n\n\n // Add multi-part form fields\n\n\n\n form.add_file(\"file\", &self.req.file_path)\n\n .map_err(|e: io::Error| match e.kind() {\n\n io::ErrorKind::NotFound => RustWistiaError::FileNotFound(\n\n self.req.file_path.as_ref().to_string_lossy().to_string(),\n\n ),\n\n _ => RustWistiaError::Io(e),\n\n })?;\n","file_path":"src/api/upload/file.rs","rank":77,"score":29567.497480405807},{"content":" /// for such projects is `Uploads_YYYY-MM-DD`.\n\n pub fn project_id(mut self, project_id: &'a str) -> Self {\n\n self.req.project_id = Some(project_id);\n\n self\n\n }\n\n\n\n /// A display name to use for the media in Wistia. If omitted, the filename\n\n /// will be used instead. This field is limited to 255 characters.\n\n pub fn name(mut self, name: &'a str) -> Self {\n\n self.req.name = Some(name);\n\n self\n\n }\n\n\n\n /// A description to use for the media in Wistia. You can use basic HTML\n\n /// here, but note that both HTML and CSS will be sanitized.\n\n pub fn description(mut self, description: &'a str) -> Self {\n\n self.req.description = Some(description);\n\n self\n\n }\n\n\n","file_path":"src/api/upload/file.rs","rank":78,"score":29566.80963434476},{"content":"\n\n if let Some(description) = self.req.description {\n\n form.add_text(\"description\", description);\n\n }\n\n\n\n // Update a request instance with the multipart Content-Type header\n\n // and the payload data.\n\n let form = form.set_body::<Body>(req_builder).unwrap();\n\n\n\n // Send the request\n\n self.client.make_request(&url, form).await\n\n }\n\n}\n","file_path":"src/api/upload/file.rs","rank":79,"score":29561.62651409903},{"content":"use crate::api::client::UploadClient;\n\nuse crate::models::*;\n\nuse crate::types::Result;\n\nuse crate::RustWistiaError;\n\n\n\nuse std::fmt::Debug;\n\nuse std::io;\n\nuse std::path::Path;\n\n\n\nuse hyper::Request;\n\nuse hyper_multipart::client::multipart::Form;\n\nuse hyper_multipart_rfc7578 as hyper_multipart;\n\nuse hyper_multipart_rfc7578::client::multipart::Body;\n\n\n\n/// Client implementation to upload *files* and *videos* via the Wistia\n\n/// **[Upload API]**.\n\n///\n\n/// Also check out the [`rust-wistia`] docs for usage and examples.\n\n///\n\n/// [`rust-wistia`]: https://docs.rs/rust-wistia\n","file_path":"src/api/upload/file.rs","rank":80,"score":29552.98373699894},{"content":" contact_id: String,\n\n}\n\n\n\n// noinspection DuplicatedCode\n\n#[tokio::main]\n\nasync fn main() -> Result<()> {\n\n sensible_env_logger::init_timed_short!();\n\n\n\n let args: Args = Args::parse();\n\n\n\n trace!(\"Uploading file stream to Wistia...\");\n\n\n\n let bytes = fs::read(args.file_path)?;\n\n let reader = Cursor::new(bytes);\n\n\n\n // Alternatively, we could use `StreamUploader::new(path)?` to\n\n // create the new `StreamUploader` instance.\n\n let res = StreamUploader::new(reader)?\n\n .project_id(&args.project_id)\n\n .name(&args.name)\n","file_path":"examples/upload_file_stream.rs","rank":81,"score":29549.058840195696},{"content":"use rust_wistia::{Result, StreamUploader};\n\n\n\n#[macro_use]\n\nextern crate log;\n\n\n\nuse std::fs;\n\nuse std::io::Cursor;\n\nuse std::path::PathBuf;\n\n\n\nuse clap::Parser;\n\n\n\n/// Upload a local file stream to Wistia\n\n// noinspection DuplicatedCode\n\n#[derive(Parser, Debug)]\n","file_path":"examples/upload_file_stream.rs","rank":82,"score":29543.092270179306},{"content":" .description(&args.description)\n\n .contact_id(&args.contact_id)\n\n .send()\n\n .await?;\n\n\n\n trace!(\"Response: {res:#?}\");\n\n trace!(\"Video ID: {}\", res.hashed_id);\n\n\n\n Ok(())\n\n}\n","file_path":"examples/upload_file_stream.rs","rank":83,"score":29542.46779180645},{"content":"}\n\n\n\nimpl<'a> DownloadAssetRequest<'a> {\n\n /// Sets the media *asset type* to download from Wistia.\n\n ///\n\n /// # Examples\n\n ///\n\n /// ```\n\n /// use rust_wistia::models::DownloadAssetRequest;\n\n ///\n\n /// let info = DownloadAssetRequest::from(\"my-video-id\").asset_type(\"OriginalFile\");\n\n /// ``` \n\n pub fn asset_type(mut self, asset_type: &'a str) -> Self {\n\n self.asset_type = Some(asset_type);\n\n self\n\n }\n\n\n\n /// Sets a local *file path* to save the downloaded media content to.\n\n ///\n\n /// # Examples\n","file_path":"src/models/media/download_asset.rs","rank":84,"score":28971.749792946917},{"content":" /// let media = WistiaClient::from_env()?.get_media(\"my-id\").await?;\n\n /// let info = DownloadAssetRequest::from(media);\n\n /// ``` \n\n pub media: Option<Media>,\n\n\n\n /// The media *asset type* to download.\n\n pub asset_type: Option<&'a str>,\n\n\n\n /// Sets a local *file path* to save the downloaded media content to.\n\n pub file_path: Option<PathBuf>,\n\n}\n\n\n\nimpl<'a> From<&'a str> for DownloadAssetRequest<'a> {\n\n /// Create a new `DownloadAssetRequest` from a Wistia `media_id`\n\n fn from(media_id: &'a str) -> Self {\n\n Self {\n\n media_id: Some(media_id),\n\n ..Default::default()\n\n }\n\n }\n","file_path":"src/models/media/download_asset.rs","rank":85,"score":28965.37847036904},{"content":"use crate::models::Media;\n\nuse std::path::{Path, PathBuf};\n\n\n\n/// Represents a request to download an [Asset URL].\n\n///\n\n/// [Asset URL]: https://wistia.com/support/developers/asset-urls\n\n///\n\n#[derive(Default)]\n\npub struct DownloadAssetRequest<'a> {\n\n /// The Wistia media to download.\n\n pub media_id: Option<&'a str>,\n\n\n\n /// The Wistia media to download.\n\n ///\n\n /// # Example\n\n ///\n\n /// ```rust,ignore\n\n /// use rust_wistia::models::DownloadAssetRequest;\n\n /// use rust_wistia::WistiaClient;\n\n ///\n","file_path":"src/models/media/download_asset.rs","rank":86,"score":28962.657234306975},{"content":" ///\n\n /// ```rust,ignore\n\n /// use rust_wistia::models::DownloadAssetRequest;\n\n /// use rust_wistia::WistiaClient;\n\n ///\n\n /// let info = DownloadAssetRequest::from(\"my-video-id\").file_path(\"./my-file.mp4\");\n\n /// let _ = WistiaClient::from_env()?.download_asset(info).await?;\n\n /// ``` \n\n pub fn file_path(mut self, file_path: impl AsRef<Path>) -> Self {\n\n self.file_path = Some(file_path.as_ref().into());\n\n self\n\n }\n\n}\n","file_path":"src/models/media/download_asset.rs","rank":87,"score":28960.510646592968},{"content":"}\n\n\n\nimpl<'a> From<&'a String> for DownloadAssetRequest<'a> {\n\n /// Create a new `DownloadAssetRequest` from a Wistia `media_id`\n\n fn from(media_id: &'a String) -> Self {\n\n Self {\n\n media_id: Some(media_id),\n\n ..Default::default()\n\n }\n\n }\n\n}\n\n\n\nimpl<'a> From<Media> for DownloadAssetRequest<'a> {\n\n /// Create a new `DownloadAssetRequest` from a `Media` object\n\n fn from(media: Media) -> Self {\n\n Self {\n\n media: Some(media),\n\n ..Default::default()\n\n }\n\n }\n","file_path":"src/models/media/download_asset.rs","rank":88,"score":28956.717951011586},{"content":" ///\n\n /// ```\n\n /// use rust_wistia::{StreamUploader, https::get_https_client};\n\n ///\n\n /// let mut uploader = StreamUploader::with_url(\"https://google.com/my/image\").await?;\n\n /// ```\n\n pub async fn with_url(url: &str) -> Result<StreamUploader<'a, Cursor<Bytes>>> {\n\n let stream = stream_reader_from_url(url, None).await?;\n\n Self::new(stream)\n\n }\n\n\n\n /// Create a new `StreamUploader` which uses the *bytes* content downloaded\n\n /// from a publicly accessible **url**.\n\n ///\n\n /// # Arguments\n\n ///\n\n /// * `url` - A public accessible url to the media which will be downloaded.\n\n /// * `access_token` - An API access token used to make requests to the\n\n /// Wistia API.\n\n ///\n","file_path":"src/api/upload/file_stream.rs","rank":89,"score":28548.046012953157},{"content":"///\n\n/// [`rust-wistia`]: https://docs.rs/rust-wistia\n\n/// [Upload API]: https://wistia.com/support/developers/upload-api\n\n///\n\n#[derive(Clone)]\n\npub struct StreamUploader<'a, R: 'static + Read + Send + Sync, B = Body> {\n\n client: UploadClient<B>,\n\n req: UploadStreamRequest<'a>,\n\n reader: Option<R>,\n\n}\n\n\n\nimpl<'a> StreamUploader<'a, Cursor<Bytes>> {\n\n /// Create a new `StreamUploader` which uses the *bytes* content downloaded\n\n /// from a publicly accessible **url**.\n\n ///\n\n /// # Arguments\n\n ///\n\n /// * `url` - A public accessible url to the media which will be downloaded.\n\n ///\n\n /// # Examples\n","file_path":"src/api/upload/file_stream.rs","rank":90,"score":28546.29459353789},{"content":" /// # Examples\n\n ///\n\n /// ```\n\n /// use rust_wistia::{StreamUploader, https::get_https_client};\n\n ///\n\n /// let mut uploader = StreamUploader::with_url_and_token(\n\n /// \"https://google.com/my/image\",\n\n /// \"my-token\"\n\n /// )\n\n /// .await?;\n\n /// ```\n\n pub async fn with_url_and_token(\n\n url: &str,\n\n access_token: &str,\n\n ) -> Result<StreamUploader<'a, Cursor<Bytes>>> {\n\n let stream = stream_reader_from_url(url, None).await?;\n\n Ok(Self::with_token(access_token).stream(stream))\n\n }\n\n\n\n /// Create a new `StreamUploader` which uses the *bytes* content downloaded\n","file_path":"src/api/upload/file_stream.rs","rank":91,"score":28545.985026348586},{"content":" /// The hashed id of the project to upload media into. If omitted, a new\n\n /// project will be created and uploaded to. The naming convention used\n\n /// for such projects is `Uploads_YYYY-MM-DD`.\n\n pub fn project_id(mut self, project_id: &'a str) -> Self {\n\n self.req.project_id = Some(project_id);\n\n self\n\n }\n\n\n\n /// A display name to use for the media in Wistia. If omitted, the filename\n\n /// will be used instead. This field is limited to 255 characters.\n\n pub fn name(mut self, name: &'a str) -> Self {\n\n self.req.name = Some(name);\n\n self\n\n }\n\n\n\n /// A description to use for the media in Wistia. You can use basic HTML\n\n /// here, but note that both HTML and CSS will be sanitized.\n\n pub fn description(mut self, description: &'a str) -> Self {\n\n self.req.description = Some(description);\n\n self\n","file_path":"src/api/upload/file_stream.rs","rank":92,"score":28545.555317639017},{"content":" }\n\n\n\n /// A Wistia contact id, an integer value. If omitted, it will default to\n\n /// the contact_id of the account’s owner.\n\n pub fn contact_id(mut self, contact_id: &'a str) -> Self {\n\n self.req.contact_id = Some(contact_id);\n\n self\n\n }\n\n\n\n /// Send the Upload File request (with the *multi-part form* data) to the\n\n /// Wistia [Upload API].\n\n ///\n\n /// [Upload API]: https://wistia.com/support/developers/upload-api\n\n ///\n\n // noinspection DuplicatedCode\n\n pub async fn send(self) -> Result<UploadResponse> {\n\n // Build the query parameters to pass to the Upload API\n\n\n\n let params = UploadRequest {\n\n access_token: self.client.access_token.as_str(),\n","file_path":"src/api/upload/file_stream.rs","rank":93,"score":28545.465987401833},{"content":" pub fn with_filename(file_name: &'a str) -> Result<Self> {\n\n Ok(Self {\n\n client: UploadClient::from_env()?,\n\n req: UploadStreamRequest::new(file_name),\n\n reader: None,\n\n })\n\n }\n\n\n\n /// Create a `SteamUploader` with a new HTTPS client and a Wistia access\n\n /// token.\n\n ///\n\n /// # Arguments\n\n ///\n\n /// * `access_token` - An API access token used to make requests to the\n\n /// Wistia API.\n\n ///\n\n /// # Examples\n\n ///\n\n /// ```\n\n /// use rust_wistia::StreamUploader;\n","file_path":"src/api/upload/file_stream.rs","rank":94,"score":28545.439202917787},{"content":" ///\n\n /// # Examples\n\n ///\n\n /// ```\n\n /// use rust_wistia::StreamUploader;\n\n /// use std::io::Cursor;\n\n ///\n\n /// let bytes = Cursor::new(\"Hello World!\");\n\n /// let uploader = StreamUploader::with_stream_and_filename(bytes, \"my_file.mp4\")?;\n\n ///\n\n /// let res = uploader.send()?.await?;\n\n /// ```\n\n ///\n\n pub fn with_stream_and_filename(stream: R, file_name: &'a str) -> Result<Self> {\n\n Ok(Self {\n\n client: UploadClient::from_env()?,\n\n req: UploadStreamRequest::new(file_name),\n\n reader: Some(stream),\n\n })\n\n }\n","file_path":"src/api/upload/file_stream.rs","rank":95,"score":28545.054217213576},{"content":" url: None,\n\n project_id: self.req.project_id,\n\n name: self.req.name,\n\n description: None,\n\n contact_id: self.req.contact_id,\n\n };\n\n\n\n let url = UploadClient::<Body>::build_url(params)?;\n\n\n\n // Create a request instance and multipart form\n\n let req_builder = Request::post(&url);\n\n let mut form = Form::default();\n\n\n\n // Add multi-part form fields\n\n\n\n // TODO worth checking for unwrap()?\n\n form.add_reader_file(\"file\", self.reader.unwrap(), self.req.file_name);\n\n\n\n if let Some(description) = self.req.description {\n\n form.add_text(\"description\", description);\n","file_path":"src/api/upload/file_stream.rs","rank":96,"score":28544.172972864028},{"content":" /// use rust_wistia::StreamUploader;\n\n /// use std::io::Cursor;\n\n ///\n\n /// let bytes = Cursor::new(\"Hello World!\");\n\n /// let uploader = StreamUploader::new(bytes)?;\n\n ///\n\n /// let res = uploader.name(\"My Video Name\").send()?.await?;\n\n /// ```\n\n /// \n\n pub fn new(stream: R) -> Result<Self> {\n\n Self::with_stream_and_filename(stream, DEFAULT_FILENAME)\n\n }\n\n\n\n /// Create a `SteamUploader` with a new HTTPS client, with the access token\n\n /// retrieved from the environment.\n\n ///\n\n /// # Arguments\n\n ///\n\n /// * `stream` - A readable file-like *stream* object to upload.\n\n /// * `file_name` - The name of the media file.\n","file_path":"src/api/upload/file_stream.rs","rank":97,"score":28541.59565786041},{"content":" /// Set the publicly-accessible URL link to the media file. The link\n\n /// will be *form-url encoded* into the request body.\n\n ///\n\n /// # Note\n\n /// This method call is only needed when the `UrlUploader::from`\n\n /// constructor is called.\n\n pub fn url(mut self, url: &'a str) -> Self {\n\n self.req.url = url;\n\n self\n\n }\n\n\n\n /// The hashed id of the project to upload media into. If omitted, a new\n\n /// project will be created and uploaded to. The naming convention used\n\n /// for such projects is `Uploads_YYYY-MM-DD`.\n\n pub fn project_id(mut self, project_id: &'a str) -> Self {\n\n self.req.project_id = Some(project_id);\n\n self\n\n }\n\n\n\n /// A display name to use for the media in Wistia. If omitted, the filename\n","file_path":"src/api/upload/link.rs","rank":98,"score":34.03826458661081},{"content":" }\n\n\n\n /// Create an `UrlUploader` with a new HTTPS client and a Wistia access\n\n /// token.\n\n ///\n\n /// # Arguments\n\n ///\n\n /// * `url` - A publicly-accessible URL link to the media file. The link\n\n /// will be *form-url encoded* into the request body.\n\n /// * `access_token` - An API access token used to make requests to the\n\n /// Wistia API.\n\n ///\n\n pub fn with_token(url: &'a str, access_token: &str) -> Self {\n\n Self {\n\n client: UploadClient::from(access_token),\n\n req: UploadUrlRequest {\n\n url,\n\n ..Default::default()\n\n },\n\n }\n","file_path":"src/api/upload/link.rs","rank":99,"score":32.69777336956889}],"string":"[\n {\n \"content\": \"/// Returns the value to set in the `AUTHORIZATION` header for a request.\\n\\npub fn auth_token(token: &str) -> String {\\n\\n // \\\"Bearer \\\".len() == 7\\n\\n let mut bearer_token = String::with_capacity(7 + token.len());\\n\\n bearer_token.push_str(\\\"Bearer \\\");\\n\\n bearer_token.push_str(token);\\n\\n\\n\\n bearer_token\\n\\n}\\n\",\n \"file_path\": \"src/auth.rs\",\n \"rank\": 0,\n \"score\": 198759.18778718382\n },\n {\n \"content\": \"pub fn host_with_path(url: &str) -> Result<String> {\\n\\n let uri: Uri = url.parse()?;\\n\\n let host = uri.host().unwrap();\\n\\n let path = uri.path();\\n\\n\\n\\n Ok(format!(\\\"{}{}\\\", host, path))\\n\\n}\\n\\n\\n\\npub async fn into_struct_from_slice<T>(resp: Response<Body>) -> Result<T>\\n\\nwhere\\n\\n T: de::DeserializeOwned,\\n\\n{\\n\\n // asynchronously concatenate the buffer from a body into bytes\\n\\n let bytes = hyper::body::to_bytes(resp).await?;\\n\\n\\n\\n // try to parse as json with serde_json\\n\\n Ok(serde_json::from_slice(&bytes)?)\\n\\n}\\n\\n\\n\\n/// Read the body content of a mutable reference to a `Response` object\\n\",\n \"file_path\": \"src/utils.rs\",\n \"rank\": 1,\n \"score\": 181794.7753972338\n },\n {\n \"content\": \"#[cfg(not(feature = \\\"rust-tls\\\"))]\\n\\npub fn get_https_client<T>() -> Client<tls::HttpsConnector<HttpConnector>, T>\\n\\nwhere\\n\\n T: hyper::body::HttpBody + std::marker::Send,\\n\\n <T as hyper::body::HttpBody>::Data: Send,\\n\\n{\\n\\n // Prepare the HTTPS connector\\n\\n let https_connector = tls::HttpsConnector::new();\\n\\n Client::builder().build::<_, T>(https_connector)\\n\\n}\\n\",\n \"file_path\": \"src/https.rs\",\n \"rank\": 2,\n \"score\": 120288.94990353339\n },\n {\n \"content\": \"#[derive(Parser, Debug)]\\n\\nstruct Args {\\n\\n /// A publicly-accessible URL link to the media file\\n\\n #[clap(\\n\\n short,\\n\\n long,\\n\\n default_value = \\\"https://commondatastorage.googleapis.com/gtv-videos-bucket/sample/ForBiggerMeltdowns.mp4\\\"\\n\\n )]\\n\\n url: String,\\n\\n /// Name of the media file\\n\\n #[clap(short, long)]\\n\\n name: Option<String>,\\n\\n /// Description of the media file\\n\\n #[clap(short, long, default_value = \\\"My <i>test</i><br>Message <b>here</b>.\\\")]\\n\\n description: String,\\n\\n /// Hashed ID of the Wistia project to upload to\\n\\n #[clap(short, long)]\\n\\n project_id: Option<String>,\\n\\n /// A Wistia contact id, an integer value.\\n\\n #[clap(short, long)]\\n\\n contact_id: Option<String>,\\n\",\n \"file_path\": \"examples/upload_url.rs\",\n \"rank\": 3,\n \"score\": 75649.63493423292\n },\n {\n \"content\": \"#[derive(Parser, Debug)]\\n\\nstruct Args {\\n\\n /// Hashed ID of the Wistia video to retrieve info on\\n\\n #[clap(short, long)]\\n\\n video_id: String,\\n\\n}\\n\\n\\n\\n#[tokio::main]\\n\\nasync fn main() -> Result<()> {\\n\\n sensible_env_logger::init!();\\n\\n\\n\\n let args: Args = Args::parse();\\n\\n\\n\\n // Alternatively, we could use `WistiaClient::from(token)?` to\\n\\n // create the new `WistiaClient` instance.\\n\\n let client = WistiaClient::from_env()?;\\n\\n\\n\\n let video_id = &args.video_id;\\n\\n\\n\\n let res = client.get_media(video_id).await?;\\n\\n\\n\\n trace!(\\\"Response: {}\\\", to_string_pretty(&res)?);\\n\\n\\n\\n Ok(())\\n\\n}\\n\",\n \"file_path\": \"examples/get_media.rs\",\n \"rank\": 4,\n \"score\": 75201.41712124602\n },\n {\n \"content\": \"#[derive(Parser, Debug)]\\n\\nstruct Args {\\n\\n /// Hashed ID of the Wistia video to update\\n\\n #[clap(short, long)]\\n\\n video_id: String,\\n\\n /// The media's new name.\\n\\n #[clap(short, long)]\\n\\n name: Option<String>,\\n\\n /// The Wistia hashed ID of an image that will replace the still that’s\\n\\n /// displayed before the player starts playing. Will return failure message\\n\\n /// unless media to update is a video, and new still is an image.\\n\\n #[clap(short, long)]\\n\\n pub still_media_id: Option<String>,\\n\\n /// A new description for this media. Accepts plain text or markdown.\\n\\n #[clap(short, long)]\\n\\n pub description: Option<String>,\\n\\n}\\n\\n\\n\\n#[tokio::main]\\n\\nasync fn main() -> Result<()> {\\n\\n sensible_env_logger::init!();\\n\",\n \"file_path\": \"examples/update_media.rs\",\n \"rank\": 5,\n \"score\": 75201.41712124602\n },\n {\n \"content\": \"#[derive(Parser, Debug)]\\n\\nstruct Args {\\n\\n /// Path to media file\\n\\n #[clap(\\n\\n short,\\n\\n long,\\n\\n parse(from_os_str),\\n\\n default_value = \\\"./examples/assets/sample-video.mp4\\\"\\n\\n )]\\n\\n file_path: PathBuf,\\n\\n /// Name of the media file\\n\\n #[clap(short, long, default_value_t = String::new())]\\n\\n name: String,\\n\\n /// Description of the media file\\n\\n #[clap(short, long, default_value = \\\"My <i>test</i><br>Message <b>here</b>.\\\")]\\n\\n description: String,\\n\\n /// Hashed ID of the Wistia project to upload to\\n\\n #[clap(short, long, default_value_t = String::new())]\\n\\n project_id: String,\\n\\n /// A Wistia contact id, an integer value.\\n\\n #[clap(short, long, default_value_t = String::new())]\\n\",\n \"file_path\": \"examples/upload_file.rs\",\n \"rank\": 6,\n \"score\": 74763.32568080392\n },\n {\n \"content\": \"#[derive(Parser, Debug)]\\n\\nstruct Args {\\n\\n /// Hashed ID of the Wistia video to retrieve info on\\n\\n #[clap(short, long)]\\n\\n video_id: String,\\n\\n\\n\\n /// Type of the media asset to retrieve. Defaults to the original asset that was uploaded.\\n\\n #[clap(short = 't', long, default_value = \\\"OriginalFile\\\")]\\n\\n asset_type: String,\\n\\n\\n\\n /// Retrieve only the HTTP asset url, rather than the SSL (HTTPS) variant\\n\\n #[clap(short, long)]\\n\\n no_ssl: bool,\\n\\n}\\n\\n\\n\\n#[tokio::main]\\n\\nasync fn main() -> Result<()> {\\n\\n sensible_env_logger::init!();\\n\\n\\n\\n let args: Args = Args::parse();\\n\\n let asset_type = args.asset_type.as_str();\\n\",\n \"file_path\": \"examples/get_asset_url.rs\",\n \"rank\": 7,\n \"score\": 73541.32955939145\n },\n {\n \"content\": \"#[derive(Parser, Debug)]\\n\\nstruct Args {\\n\\n /// A publicly-accessible URL link to the media file\\n\\n #[clap(\\n\\n short,\\n\\n long,\\n\\n default_value = \\\"https://commondatastorage.googleapis.com/gtv-videos-bucket/sample/ForBiggerMeltdowns.mp4\\\"\\n\\n )]\\n\\n url: String,\\n\\n /// Name of the media file\\n\\n #[clap(short, long)]\\n\\n name: Option<String>,\\n\\n /// Description of the media file\\n\\n #[clap(short, long, default_value = \\\"My <i>test</i><br>Message <b>here</b>.\\\")]\\n\\n description: String,\\n\\n /// Hashed ID of the Wistia project to upload to\\n\\n #[clap(short, long)]\\n\\n project_id: Option<String>,\\n\\n /// A Wistia contact id, an integer value.\\n\\n #[clap(short, long)]\\n\\n contact_id: Option<String>,\\n\",\n \"file_path\": \"examples/upload_url_stream.rs\",\n \"rank\": 8,\n \"score\": 73541.32955939145\n },\n {\n \"content\": \"#[derive(Parser, Debug)]\\n\\nstruct Args {\\n\\n /// Path to media file\\n\\n #[clap(\\n\\n short,\\n\\n long,\\n\\n parse(from_os_str),\\n\\n default_value = \\\"./examples/assets/sample-video.mp4\\\"\\n\\n )]\\n\\n file_path: PathBuf,\\n\\n /// Name of the media file\\n\\n #[clap(short, long, default_value_t = String::new())]\\n\\n name: String,\\n\\n /// Description of the media file\\n\\n #[clap(short, long, default_value = \\\"My <i>test</i><br>Message <b>here</b>.\\\")]\\n\\n description: String,\\n\\n /// Hashed ID of the Wistia project to upload to\\n\\n #[clap(short, long, default_value_t = String::new())]\\n\\n project_id: String,\\n\\n /// A Wistia contact id, an integer value.\\n\\n #[clap(short, long, default_value_t = String::new())]\\n\",\n \"file_path\": \"examples/upload_file_stream.rs\",\n \"rank\": 9,\n \"score\": 72685.64985477287\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\",\n \"file_path\": \"tests/version-number.rs\",\n \"rank\": 10,\n \"score\": 69186.65724292178\n },\n {\n \"content\": \"pub fn is_default<T: Default + PartialEq>(t: &T) -> bool {\\n\\n t == &T::default()\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/utils.rs\",\n \"rank\": 11,\n \"score\": 66912.43108250119\n },\n {\n \"content\": \"fn empty_string_is_none<'de, D>(deserializer: D) -> Result<Option<String>, D::Error>\\n\\nwhere\\n\\n D: Deserializer<'de>,\\n\\n{\\n\\n let s = String::deserialize(deserializer)?;\\n\\n if s.is_empty() {\\n\\n Ok(None)\\n\\n } else {\\n\\n Ok(Some(s))\\n\\n }\\n\\n}\\n\\n\\n\\n#[cfg(test)]\\n\\nmod tests {\\n\\n use super::*;\\n\\n\\n\\n use crate::log::debug;\\n\\n use serde_json::from_str;\\n\\n\\n\\n /// Using the provided [Example Response][]\\n\",\n \"file_path\": \"src/models/upload/response.rs\",\n \"rank\": 12,\n \"score\": 66772.96016708651\n },\n {\n \"content\": \"use serde::{Deserialize, Serialize};\\n\\n\\n\\n/// A value which represents the type of media.\\n\\n///\\n\\n/// See more [on `type`][].\\n\\n///\\n\\n/// [on `type`]: https://wistia.com/support/developers/data-api#medias-response\\n\\n#[derive(Debug, PartialEq, Serialize, Deserialize)]\\n\\npub enum MediaType {\\n\\n Video,\\n\\n Audio,\\n\\n Image,\\n\\n PdfDocument,\\n\\n MicrosoftOfficeDocument,\\n\\n Swf,\\n\\n UnknownType,\\n\\n}\\n\\n\\n\\nimpl Default for MediaType {\\n\\n fn default() -> Self {\\n\\n MediaType::Video\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/models/media/type.rs\",\n \"rank\": 13,\n \"score\": 60847.48356190733\n },\n {\n \"content\": \"fn show_progress(msg: impl ToString) -> ProgressBar {\\n\\n let pb = ProgressBar::new_spinner();\\n\\n pb.enable_steady_tick(120);\\n\\n pb.set_style(\\n\\n ProgressStyle::default_spinner()\\n\\n .template(\\\"{spinner:.blue} {msg}\\\")\\n\\n .tick_strings(&[\\n\\n \\\"▹▹▹▹▹\\\",\\n\\n \\\"▸▹▹▹▹\\\",\\n\\n \\\"▹▸▹▹▹\\\",\\n\\n \\\"▹▹▸▹▹\\\",\\n\\n \\\"▹▹▹▸▹\\\",\\n\\n \\\"▹▹▹▹▸\\\",\\n\\n \\\"▪▪▪▪▪\\\",\\n\\n ]),\\n\\n );\\n\\n pb.set_message(msg.to_string());\\n\\n pb\\n\\n}\\n\",\n \"file_path\": \"examples/download_asset.rs\",\n \"rank\": 14,\n \"score\": 60082.46447281387\n },\n {\n \"content\": \" #[serde(skip_serializing_if = \\\"Option::is_none\\\")]\\n\\n pub description: Option<String>,\\n\\n}\\n\\n\\n\\nimpl UpdateMediaRequest {\\n\\n /// Sets the media's new name\\n\\n pub fn name(mut self, name: &str) -> Self {\\n\\n self.name = Some(name.to_owned());\\n\\n self\\n\\n }\\n\\n\\n\\n /// Sets the Wistia hashed ID of an image that will replace the still that’s\\n\\n /// displayed before the player starts playing.\\n\\n pub fn new_still_media_id(mut self, new_still_media_id: &str) -> Self {\\n\\n self.new_still_media_id = Some(new_still_media_id.to_owned());\\n\\n self\\n\\n }\\n\\n\\n\\n /// Sets a new description for this media. Accepts plain text or markdown.\\n\\n pub fn description(mut self, description: &str) -> Self {\\n\\n self.description = Some(description.to_owned());\\n\\n self\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/models/media/update_request.rs\",\n \"rank\": 15,\n \"score\": 58455.81365247546\n },\n {\n \"content\": \"use serde::Serialize;\\n\\n\\n\\n/// Represents a [Medias: Update] request.\\n\\n///\\n\\n/// [Medias: Update]: https://wistia.com/support/developers/data-api#the-request-7\\n\\n///\\n\\n#[derive(Default, Debug, PartialEq, Serialize)]\\n\\npub struct UpdateMediaRequest {\\n\\n /// The hashed Video Id (example: `abc1234567`).\\n\\n #[serde(skip_serializing)]\\n\\n pub id: String,\\n\\n /// The media's new name.\\n\\n #[serde(skip_serializing_if = \\\"Option::is_none\\\")]\\n\\n pub name: Option<String>,\\n\\n /// The Wistia hashed ID of an image that will replace the still that’s\\n\\n /// displayed before the player starts playing. Will return failure message\\n\\n /// unless media to update is a video, and new still is an image.\\n\\n #[serde(skip_serializing_if = \\\"Option::is_none\\\")]\\n\\n pub new_still_media_id: Option<String>,\\n\\n /// A new description for this media. Accepts plain text or markdown.\\n\",\n \"file_path\": \"src/models/media/update_request.rs\",\n \"rank\": 16,\n \"score\": 58452.79305516511\n },\n {\n \"content\": \"#[derive(Parser, Debug)]\\n\\nstruct Args {\\n\\n /// Path to image file\\n\\n #[clap(\\n\\n short,\\n\\n long,\\n\\n parse(from_os_str),\\n\\n default_value = \\\"./examples/assets/sample-thumbnail.png\\\"\\n\\n )]\\n\\n file_path: PathBuf,\\n\\n /// Name of the media file\\n\\n #[clap(short, long, default_value_t = String::new())]\\n\\n name: String,\\n\\n /// Description of the media file\\n\\n #[clap(short, long, default_value = \\\"My <i>test</i><br>Message <b>here</b>.\\\")]\\n\\n description: String,\\n\\n /// Hashed ID of the Wistia project to upload to\\n\\n #[clap(short, long, default_value_t = String::new())]\\n\\n project_id: String,\\n\\n /// A Wistia contact id, an integer value.\\n\\n #[clap(short, long, default_value_t = String::new())]\\n\",\n \"file_path\": \"examples/upload_thumbnail.rs\",\n \"rank\": 17,\n \"score\": 45223.96049933111\n },\n {\n \"content\": \"#[derive(Parser, Debug)]\\n\\nstruct Args {\\n\\n /// Hashed ID of the Wistia video to retrieve info on\\n\\n #[clap(short, long)]\\n\\n video_id: String,\\n\\n\\n\\n /// Type of the media asset to download. Defaults to the original asset that was uploaded.\\n\\n #[clap(short = 't', long, default_value = \\\"OriginalFile\\\")]\\n\\n asset_type: String,\\n\\n\\n\\n /// Path to media file\\n\\n #[clap(short, long, parse(from_os_str), default_value = \\\"./my-video.mp4\\\")]\\n\\n file_path: PathBuf,\\n\\n}\\n\\n\\n\\n#[tokio::main]\\n\\nasync fn main() -> Result<()> {\\n\\n sensible_env_logger::init_timed_short!();\\n\\n\\n\\n let args: Args = Args::parse();\\n\\n\\n\",\n \"file_path\": \"examples/download_asset.rs\",\n \"rank\": 18,\n \"score\": 45223.96049933111\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\": \"tests/version-number.rs\",\n \"rank\": 19,\n \"score\": 42632.76706885571\n },\n {\n \"content\": \"use super::{Asset, MediaStatus, MediaType, ProjectInfo, Thumbnail};\\n\\nuse crate::constants::*;\\n\\nuse crate::{Result, RustWistiaError};\\n\\n\\n\\nuse serde::{Deserialize, Serialize};\\n\\n\\n\\n#[derive(Default, Debug, PartialEq, Serialize, Deserialize)]\\n\\n#[serde(rename_all = \\\"camelCase\\\")]\\n\\npub struct Media {\\n\\n #[serde(rename = \\\"hashed_id\\\")]\\n\\n pub hashed_id: String,\\n\\n pub id: u64,\\n\\n pub name: String,\\n\\n #[serde(rename = \\\"type\\\")]\\n\\n pub type_field: MediaType,\\n\\n pub created: String,\\n\\n pub updated: String,\\n\\n /// Note: only videos have this attribute set; thumbnails and other\\n\\n /// medias don't.\\n\\n pub duration: Option<f64>,\\n\",\n \"file_path\": \"src/models/media/media.rs\",\n \"rank\": 20,\n \"score\": 37402.61634758801\n },\n {\n \"content\": \" pub status: MediaStatus,\\n\\n #[serde(default)]\\n\\n pub description: String,\\n\\n #[serde(default)]\\n\\n pub progress: f64,\\n\\n pub thumbnail: Thumbnail,\\n\\n pub project: ProjectInfo,\\n\\n #[serde(skip_serializing)]\\n\\n pub embed_code: String,\\n\\n pub assets: Vec<Asset>,\\n\\n pub section: Option<String>,\\n\\n}\\n\\n\\n\\nimpl Media {\\n\\n /// Retrieve the *asset URL* for the original source media that was uploaded.\\n\\n pub fn source_url(&self) -> Result<String> {\\n\\n self.asset_url(None)\\n\\n }\\n\\n\\n\\n /// Retrieve the *asset URL* (default: **HTTPS**) for a specified `asset_type`, which\\n\",\n \"file_path\": \"src/models/media/media.rs\",\n \"rank\": 21,\n \"score\": 37397.23617368993\n },\n {\n \"content\": \" /// defaults to the original source media if not provided.\\n\\n pub fn asset_url<'a>(&'a self, asset_type: impl Into<Option<&'a str>>) -> Result<String> {\\n\\n let url = self.asset_url_insecure(asset_type)?;\\n\\n\\n\\n let (_, id) = url.rsplit_once('/').unwrap();\\n\\n let id = match id.rsplit_once(\\\".bin\\\") {\\n\\n Some((id, _)) => id,\\n\\n None => id,\\n\\n };\\n\\n\\n\\n Ok(format!(\\n\\n \\\"https://embed-ssl.wistia.com/deliveries/{id}/{DEFAULT_FILENAME}\\\"\\n\\n ))\\n\\n }\\n\\n\\n\\n /// Retrieve the *asset URL* (default: **HTTP**) for a specified `asset_type`, which\\n\\n /// defaults to the original source media if not provided.\\n\\n pub fn asset_url_insecure<'a>(\\n\\n &'a self,\\n\\n asset_type: impl Into<Option<&'a str>>,\\n\",\n \"file_path\": \"src/models/media/media.rs\",\n \"rank\": 22,\n \"score\": 37396.35230057183\n },\n {\n \"content\": \" ) -> Result<&'a str> {\\n\\n let r#type = asset_type.into().unwrap_or(ORIGINAL_ASSET);\\n\\n\\n\\n for asset in self.assets.iter() {\\n\\n if asset.type_field == r#type {\\n\\n return Ok(&asset.url);\\n\\n }\\n\\n }\\n\\n\\n\\n Err(RustWistiaError::AssetNotFound {\\n\\n r#type: r#type.to_string(),\\n\\n video_id: self.hashed_id.clone(),\\n\\n valid_types: self.assets.iter().map(|a| a.type_field.clone()).collect(),\\n\\n })\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/models/media/media.rs\",\n \"rank\": 23,\n \"score\": 37392.18799516514\n },\n {\n \"content\": \"use super::{MediaStatus, MediaType, Thumbnail};\\n\\nuse serde::{Deserialize, Serialize};\\n\\n\\n\\n#[derive(Default, Debug, PartialEq, Serialize, Deserialize)]\\n\\n#[serde(rename_all = \\\"camelCase\\\")]\\n\\npub struct MediaInfo {\\n\\n #[serde(rename = \\\"hashed_id\\\")]\\n\\n pub hashed_id: String,\\n\\n pub id: u64,\\n\\n pub name: String,\\n\\n #[serde(rename = \\\"type\\\")]\\n\\n pub type_field: MediaType,\\n\\n pub created: String,\\n\\n pub updated: String,\\n\\n /// Note: only videos have this attribute set; thumbnails and other\\n\\n /// medias don't.\\n\\n pub duration: Option<f64>,\\n\\n pub status: MediaStatus,\\n\\n pub description: String,\\n\\n pub progress: f64,\\n\\n pub thumbnail: Thumbnail,\\n\\n pub section: Option<String>,\\n\\n}\\n\",\n \"file_path\": \"src/models/media/media_info.rs\",\n \"rank\": 24,\n \"score\": 36586.26684478856\n },\n {\n \"content\": \"//! Library-specific type definitions\\n\\n//!\\n\\nuse crate::RustWistiaError;\\n\\n\\n\\n/// Result type with errors populated solely by *our* library.\\n\\npub type Result<T> = std::result::Result<T, RustWistiaError>;\\n\",\n \"file_path\": \"src/types.rs\",\n \"rank\": 25,\n \"score\": 33232.416674900844\n },\n {\n \"content\": \"}\\n\\n\\n\\n#[tokio::main]\\n\\nasync fn main() -> Result<()> {\\n\\n sensible_env_logger::init_timed_short!();\\n\\n\\n\\n let args: Args = Args::parse();\\n\\n\\n\\n trace!(\\\"Uploading link to Wistia...\\\");\\n\\n\\n\\n // Alternatively, we could use `UrlUploader::with_client(url, client)` to\\n\\n // create the new `UrlUploader` instance.\\n\\n let mut uploader = UrlUploader::new(&args.url)?;\\n\\n\\n\\n // Normally we'll just chain together the methods like below, but here we\\n\\n // need to explicitly exclude any empty string values.\\n\\n //\\n\\n // UrlUploader::new(&args.url)?\\n\\n // .name(&args.name)\\n\\n // .description(&args.description)\\n\",\n \"file_path\": \"examples/upload_url.rs\",\n \"rank\": 26,\n \"score\": 31576.30955145736\n },\n {\n \"content\": \"use rust_wistia::{Result, UrlUploader};\\n\\n\\n\\n#[macro_use]\\n\\nextern crate log;\\n\\n\\n\\nuse clap::Parser;\\n\\n\\n\\n/// Upload a public accessible link to Wistia\\n\\n///\\n\\n/// You can find links to public test videos here:\\n\\n/// https://gist.github.com/jsturgis/3b19447b304616f18657?permalink_comment_id=3448015#gistcomment-3448015\\n\\n// noinspection DuplicatedCode\\n\\n#[derive(Parser, Debug)]\\n\",\n \"file_path\": \"examples/upload_url.rs\",\n \"rank\": 27,\n \"score\": 31563.716735594433\n },\n {\n \"content\": \"\\n\\n if let Some(ref project_id) = args.project_id {\\n\\n uploader = uploader.project_id(project_id);\\n\\n };\\n\\n if let Some(ref name) = args.name {\\n\\n uploader = uploader.name(name);\\n\\n };\\n\\n if !args.description.is_empty() {\\n\\n uploader = uploader.description(&args.description);\\n\\n };\\n\\n if let Some(ref contact_id) = args.contact_id {\\n\\n uploader = uploader.contact_id(contact_id);\\n\\n };\\n\\n\\n\\n let res = uploader.send().await?;\\n\\n\\n\\n trace!(\\\"Response: {res:#?}\\\");\\n\\n trace!(\\\"Video ID: {}\\\", res.hashed_id);\\n\\n\\n\\n Ok(())\\n\\n}\\n\",\n \"file_path\": \"examples/upload_url.rs\",\n \"rank\": 28,\n \"score\": 31561.420167704793\n },\n {\n \"content\": \"\\n\\n let args: Args = Args::parse();\\n\\n\\n\\n // Alternatively, we could use `WistiaClient::from(token)?` to\\n\\n // create the new `WistiaClient` instance.\\n\\n let client = WistiaClient::from_env()?;\\n\\n\\n\\n let req = UpdateMediaRequest {\\n\\n id: args.video_id,\\n\\n name: args.name,\\n\\n new_still_media_id: args.still_media_id,\\n\\n description: args.description,\\n\\n ..Default::default()\\n\\n };\\n\\n\\n\\n let res = client.update_media(req).await?;\\n\\n\\n\\n trace!(\\\"Response: {}\\\", to_string_pretty(&res)?);\\n\\n\\n\\n Ok(())\\n\\n}\\n\",\n \"file_path\": \"examples/update_media.rs\",\n \"rank\": 29,\n \"score\": 31115.639587921996\n },\n {\n \"content\": \"use rust_wistia::{Result, WistiaClient};\\n\\n\\n\\n#[macro_use]\\n\\nextern crate log;\\n\\n\\n\\nuse clap::Parser;\\n\\nuse rust_wistia::models::UpdateMediaRequest;\\n\\nuse serde_json::to_string_pretty;\\n\\n\\n\\n/// Updates info on a Wistia video\\n\\n#[derive(Parser, Debug)]\\n\",\n \"file_path\": \"examples/update_media.rs\",\n \"rank\": 30,\n \"score\": 31107.398711209073\n },\n {\n \"content\": \"use rust_wistia::{Result, WistiaClient};\\n\\n\\n\\n#[macro_use]\\n\\nextern crate log;\\n\\n\\n\\nuse clap::Parser;\\n\\nuse serde_json::to_string_pretty;\\n\\n\\n\\n/// Retrieve info on a Wistia video\\n\\n#[derive(Parser, Debug)]\\n\",\n \"file_path\": \"examples/get_media.rs\",\n \"rank\": 31,\n \"score\": 31102.559162597972\n },\n {\n \"content\": \" contact_id: String,\\n\\n}\\n\\n\\n\\n// noinspection DuplicatedCode\\n\\n#[tokio::main]\\n\\nasync fn main() -> Result<()> {\\n\\n sensible_env_logger::init_timed_short!();\\n\\n\\n\\n let args: Args = Args::parse();\\n\\n\\n\\n trace!(\\\"Uploading file to Wistia...\\\");\\n\\n\\n\\n let client = UploadClient::from_env()?;\\n\\n let file_path = Path::new(&args.file_path);\\n\\n\\n\\n // Alternatively, we could use `FileUploader::new(path)?` to\\n\\n // create the new `FileUploader` instance.\\n\\n let res = FileUploader::with_client(file_path, client)\\n\\n .project_id(&args.project_id)\\n\\n .name(&args.name)\\n\",\n \"file_path\": \"examples/upload_file.rs\",\n \"rank\": 32,\n \"score\": 30652.682570260327\n },\n {\n \"content\": \"use rust_wistia::{FileUploader, Result, UploadClient};\\n\\n\\n\\n#[macro_use]\\n\\nextern crate log;\\n\\n\\n\\nuse std::path::{Path, PathBuf};\\n\\n\\n\\nuse clap::Parser;\\n\\n\\n\\n/// Upload a local file to Wistia\\n\\n// noinspection DuplicatedCode\\n\\n#[derive(Parser, Debug)]\\n\",\n \"file_path\": \"examples/upload_file.rs\",\n \"rank\": 33,\n \"score\": 30645.03498041952\n },\n {\n \"content\": \" .description(&args.description)\\n\\n .contact_id(&args.contact_id)\\n\\n .send()\\n\\n .await?;\\n\\n\\n\\n trace!(\\\"Response: {res:#?}\\\");\\n\\n trace!(\\\"Video ID: {}\\\", res.hashed_id);\\n\\n\\n\\n Ok(())\\n\\n}\\n\",\n \"file_path\": \"examples/upload_file.rs\",\n \"rank\": 34,\n \"score\": 30639.101034385792\n },\n {\n \"content\": \"\\n\\n// We get a warning in the `examples/` that this is not used, but it *will*\\n\\n// be used when the optional feature is enabled.\\n\\n#[allow(unused)]\\n\\n#[derive(Clone)]\\n\\npub(crate) struct UploadFileRequest<'a, P: AsRef<Path>> {\\n\\n /// **Required**. The path to the media file. The contents of this file\\n\\n /// will be multipart-form encoded into the request body.\\n\\n pub file_path: P,\\n\\n /// The hashed id of the project to upload media into. If omitted, a new\\n\\n /// project will be created and uploaded to. The naming convention used\\n\\n /// for such projects is `Uploads_YYYY-MM-DD`.\\n\\n pub project_id: Option<&'a str>,\\n\\n /// A display name to use for the media in Wistia. If omitted, the filename\\n\\n /// will be used instead. This field is limited to 255 characters.\\n\\n pub name: Option<&'a str>,\\n\\n /// A description to use for the media in Wistia. You can use basic HTML\\n\\n /// here, but note that both HTML and CSS will be sanitized.\\n\\n pub description: Option<&'a str>,\\n\\n /// A Wistia contact id, an integer value. If omitted, it will default to\\n\",\n \"file_path\": \"src/models/upload/request.rs\",\n \"rank\": 35,\n \"score\": 30566.71598187623\n },\n {\n \"content\": \" #[allow(unused)]\\n\\n pub(crate) fn new(file_path: &'a str) -> Self {\\n\\n Self {\\n\\n file_name: file_path,\\n\\n project_id: None,\\n\\n name: None,\\n\\n description: None,\\n\\n contact_id: None,\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\n#[cfg(test)]\\n\\nmod tests {\\n\\n use super::*;\\n\\n use serde_urlencoded::to_string;\\n\\n\\n\\n #[test]\\n\\n fn test_it_works() {\\n\\n let req = UploadRequest {\\n\",\n \"file_path\": \"src/models/upload/request.rs\",\n \"rank\": 36,\n \"score\": 30565.027112899636\n },\n {\n \"content\": \"}\\n\\n\\n\\n#[derive(Default, Clone)]\\n\\npub(crate) struct UploadUrlRequest<'a> {\\n\\n /// **Required**. The web location of the media file to import.\\n\\n pub url: &'a str,\\n\\n /// The hashed id of the project to upload media into. If omitted, a new\\n\\n /// project will be created and uploaded to. The naming convention used\\n\\n /// for such projects is `Uploads_YYYY-MM-DD`.\\n\\n pub project_id: Option<&'a str>,\\n\\n /// A display name to use for the media in Wistia. If omitted, the filename\\n\\n /// will be used instead. This field is limited to 255 characters.\\n\\n pub name: Option<&'a str>,\\n\\n /// A description to use for the media in Wistia. You can use basic HTML\\n\\n /// here, but note that both HTML and CSS will be sanitized.\\n\\n pub description: Option<&'a str>,\\n\\n /// A Wistia contact id, an integer value. If omitted, it will default to\\n\\n /// the contact_id of the account’s owner.\\n\\n pub contact_id: Option<&'a str>,\\n\\n}\\n\",\n \"file_path\": \"src/models/upload/request.rs\",\n \"rank\": 37,\n \"score\": 30563.880372813368\n },\n {\n \"content\": \" /// on your [API access page].\\n\\n ///\\n\\n /// [API access page]: https://wistia.com/support/developers/data-api#getting-started\\n\\n pub access_token: &'a str,\\n\\n /// **Required** unless `file` is specified. The web location of the media\\n\\n /// file to import.\\n\\n pub url: Option<&'a str>,\\n\\n /// The hashed id of the project to upload media into. If omitted, a new\\n\\n /// project will be created and uploaded to. The naming convention used\\n\\n /// for such projects is `Uploads_YYYY-MM-DD`.\\n\\n pub project_id: Option<&'a str>,\\n\\n /// A display name to use for the media in Wistia. If omitted, the filename\\n\\n /// will be used instead. This field is limited to 255 characters.\\n\\n pub name: Option<&'a str>,\\n\\n /// A description to use for the media in Wistia. You can use basic HTML\\n\\n /// here, but note that both HTML and CSS will be sanitized.\\n\\n pub description: Option<&'a str>,\\n\\n /// A Wistia contact id, an integer value. If omitted, it will default to\\n\\n /// the contact_id of the account’s owner.\\n\\n pub contact_id: Option<&'a str>,\\n\",\n \"file_path\": \"src/models/upload/request.rs\",\n \"rank\": 38,\n \"score\": 30562.566582893138\n },\n {\n \"content\": \"#[derive(Clone)]\\n\\npub(crate) struct UploadStreamRequest<'a> {\\n\\n /// Optional. The name of the media file.\\n\\n pub file_name: &'a str,\\n\\n /// The hashed id of the project to upload media into. If omitted, a new\\n\\n /// project will be created and uploaded to. The naming convention used\\n\\n /// for such projects is `Uploads_YYYY-MM-DD`.\\n\\n pub project_id: Option<&'a str>,\\n\\n /// A display name to use for the media in Wistia. If omitted, the filename\\n\\n /// will be used instead. This field is limited to 255 characters.\\n\\n pub name: Option<&'a str>,\\n\\n /// A description to use for the media in Wistia. You can use basic HTML\\n\\n /// here, but note that both HTML and CSS will be sanitized.\\n\\n pub description: Option<&'a str>,\\n\\n /// A Wistia contact id, an integer value. If omitted, it will default to\\n\\n /// the contact_id of the account’s owner.\\n\\n pub contact_id: Option<&'a str>,\\n\\n}\\n\\n\\n\\nimpl<'a> UploadStreamRequest<'a> {\\n\",\n \"file_path\": \"src/models/upload/request.rs\",\n \"rank\": 39,\n \"score\": 30562.4507674792\n },\n {\n \"content\": \" access_token: \\\"abc123\\\",\\n\\n url: None,\\n\\n project_id: None,\\n\\n name: None,\\n\\n description: None,\\n\\n contact_id: None,\\n\\n };\\n\\n\\n\\n assert_eq!(to_string(req).unwrap(), \\\"access_token=abc123\\\");\\n\\n }\\n\\n\\n\\n #[test]\\n\\n fn test_it_works_with_other_params() {\\n\\n let req = UploadRequest {\\n\\n access_token: \\\"xyz123\\\",\\n\\n url: Some(\\\"https://test-url.com/my/path?key=\\\\\\\"hello world!@#$?%&\\\\\\\"&value=\\\"),\\n\\n project_id: Some(\\\"abc321\\\"),\\n\\n name: None,\\n\\n description: None,\\n\\n contact_id: Some(\\\"my contact <abc@xyz.org>\\\"),\\n\\n };\\n\\n\\n\\n assert_eq!(to_string(req).unwrap(), \\\"access_token=xyz123&url=https%3A%2F%2Ftest-url.com%2Fmy%2Fpath%3Fkey%3D%22hello+world%21%40%23%24%3F%25%26%22%26value%3D&project_id=abc321&contact_id=my+contact+%3Cabc%40xyz.org%3E\\\");\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/models/upload/request.rs\",\n \"rank\": 40,\n \"score\": 30562.19006500645\n },\n {\n \"content\": \" /// the contact_id of the account’s owner.\\n\\n pub contact_id: Option<&'a str>,\\n\\n}\\n\\n\\n\\nimpl<'a, P: AsRef<Path>> UploadFileRequest<'a, P> {\\n\\n #[allow(unused)]\\n\\n pub(crate) fn new(file_path: P) -> Self {\\n\\n Self {\\n\\n file_path,\\n\\n project_id: None,\\n\\n name: None,\\n\\n description: None,\\n\\n contact_id: None,\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\n// We get a warning in the `examples/` that this is not used, but it *will*\\n\\n// be used when the optional feature is enabled.\\n\\n#[allow(unused)]\\n\",\n \"file_path\": \"src/models/upload/request.rs\",\n \"rank\": 41,\n \"score\": 30561.297425184064\n },\n {\n \"content\": \"use serde::Serialize;\\n\\n\\n\\nuse std::path::Path;\\n\\n\\n\\n/// Model representing a [Request] to the Wistia [Upload API].\\n\\n///\\n\\n/// # Note\\n\\n/// This only includes the parameters which may be encoded into the part\\n\\n/// of the query string.\\n\\n///\\n\\n/// The only exceptions are `description`, which is expected to be long and\\n\\n/// which may be more performant to be multipart-form encoded, and the `file`\\n\\n/// parameter which *must* be multipart-form encoded into the request body.\\n\\n///\\n\\n/// [Upload API]: https://wistia.com/support/developers/upload-api\\n\\n/// [Request]: https://wistia.com/support/developers/upload-api#the-request\\n\\n///\\n\\n#[derive(Default, Serialize)]\\n\\npub struct UploadRequest<'a> {\\n\\n /// **Required**. A 64 character hex string. This parameter can be found\\n\",\n \"file_path\": \"src/models/upload/request.rs\",\n \"rank\": 42,\n \"score\": 30559.177859064675\n },\n {\n \"content\": \"\\n\\n // Alternatively, we could use `WistiaClient::from(token)?` to\\n\\n // create the new `WistiaClient` instance.\\n\\n let client = WistiaClient::from_env()?;\\n\\n\\n\\n let video_id = &args.video_id;\\n\\n\\n\\n let media = client.get_media(video_id).await?;\\n\\n\\n\\n let url = if args.no_ssl {\\n\\n media.asset_url_insecure(asset_type)?.to_owned()\\n\\n } else {\\n\\n // as a shorthand, we could just call `media.source_url()?` in this case\\n\\n media.asset_url(asset_type)?\\n\\n };\\n\\n\\n\\n trace!(\\\"Asset URL: {url}\\\");\\n\\n\\n\\n Ok(())\\n\\n}\\n\",\n \"file_path\": \"examples/get_asset_url.rs\",\n \"rank\": 43,\n \"score\": 30448.664671412324\n },\n {\n \"content\": \"}\\n\\n\\n\\n#[tokio::main]\\n\\nasync fn main() -> Result<()> {\\n\\n sensible_env_logger::init_timed_short!();\\n\\n\\n\\n let args: Args = Args::parse();\\n\\n\\n\\n trace!(\\\"Uploading bytes content in link to Wistia...\\\");\\n\\n\\n\\n // Alternatively, we could use `StreamUploader::with_url(&args.url)` to\\n\\n // create the new `StreamUploader` instance without an explicit HTTPS client.\\n\\n let client = get_https_client();\\n\\n let mut uploader = StreamUploader::with_url_and_client(&args.url, client).await?;\\n\\n\\n\\n // Normally we'll just chain together the methods like below, but here we\\n\\n // need to explicitly exclude any empty string values.\\n\\n //\\n\\n // StreamUploader::new(bytes)?\\n\\n // .name(&args.name)\\n\",\n \"file_path\": \"examples/upload_url_stream.rs\",\n \"rank\": 44,\n \"score\": 30448.52483179446\n },\n {\n \"content\": \"use rust_wistia::{Result, WistiaClient};\\n\\n\\n\\n#[macro_use]\\n\\nextern crate log;\\n\\n\\n\\nuse clap::Parser;\\n\\n\\n\\n/// Retrieve the media [Asset URL] on a Wistia video\\n\\n///\\n\\n/// [Asset URL]: https://wistia.com/support/developers/asset-urls\\n\\n#[derive(Parser, Debug)]\\n\",\n \"file_path\": \"examples/get_asset_url.rs\",\n \"rank\": 45,\n \"score\": 30440.881202718443\n },\n {\n \"content\": \"use rust_wistia::{Result, StreamUploader};\\n\\n\\n\\n#[macro_use]\\n\\nextern crate log;\\n\\n\\n\\nuse clap::Parser;\\n\\nuse rust_wistia::https::get_https_client;\\n\\n\\n\\n/// Upload the *bytes* data for a public accessible link to Wistia\\n\\n///\\n\\n/// You can find links to public test videos here:\\n\\n/// https://gist.github.com/jsturgis/3b19447b304616f18657?permalink_comment_id=3448015#gistcomment-3448015\\n\\n// noinspection DuplicatedCode\\n\\n#[derive(Parser, Debug)]\\n\",\n \"file_path\": \"examples/upload_url_stream.rs\",\n \"rank\": 46,\n \"score\": 30433.91779190569\n },\n {\n \"content\": \" // .description(&args.description)\\n\\n\\n\\n if let Some(ref project_id) = args.project_id {\\n\\n uploader = uploader.project_id(project_id);\\n\\n };\\n\\n if let Some(ref name) = args.name {\\n\\n uploader = uploader.name(name);\\n\\n };\\n\\n if !args.description.is_empty() {\\n\\n uploader = uploader.description(&args.description);\\n\\n };\\n\\n if let Some(ref contact_id) = args.contact_id {\\n\\n uploader = uploader.contact_id(contact_id);\\n\\n };\\n\\n\\n\\n let res = uploader.send().await?;\\n\\n\\n\\n trace!(\\\"Response: {res:#?}\\\");\\n\\n trace!(\\\"Video ID: {}\\\", res.hashed_id);\\n\\n\\n\\n Ok(())\\n\\n}\\n\",\n \"file_path\": \"examples/upload_url_stream.rs\",\n \"rank\": 47,\n \"score\": 30431.80643180784\n },\n {\n \"content\": \" Err(_) => Err(RustWistiaError::EnvVarNotFound {\\n\\n name: ENV_VAR_NAME.to_owned(),\\n\\n }),\\n\\n }?;\\n\\n\\n\\n Ok(Self::from(token))\\n\\n }\\n\\n\\n\\n /// Initialize a new `UploadClient` object from an [API access token].\\n\\n ///\\n\\n /// [API access token]: https://wistia.com/support/developers/data-api#getting-started\\n\\n pub fn from_token(token: &str) -> Self {\\n\\n Self::from(token)\\n\\n }\\n\\n\\n\\n /// Build the URL with the url-encoded *query parameters* included\\n\\n pub fn build_url(params: UploadRequest) -> Result<String> {\\n\\n let query = to_string(params)?;\\n\\n\\n\\n // Build the URL with the query parameters included\\n\",\n \"file_path\": \"src/api/upload/client.rs\",\n \"rank\": 53,\n \"score\": 30090.815452161612\n },\n {\n \"content\": \" let mut url = String::with_capacity(UPLOAD_API.len() + 1 + query.len());\\n\\n url.push_str(UPLOAD_API);\\n\\n url.push('?');\\n\\n url.push_str(query.as_str());\\n\\n\\n\\n Ok(url)\\n\\n }\\n\\n\\n\\n /// Send the request to the Wistia Upload API\\n\\n pub async fn make_request<'a>(\\n\\n &'a self,\\n\\n url: &'a str,\\n\\n req: Request<B>,\\n\\n ) -> Result<UploadResponse> {\\n\\n let start = Instant::now();\\n\\n let mut resp = self.client.request(req).await?;\\n\\n debug!(\\\"Call Upload API completed {:.2?}\\\", start.elapsed());\\n\\n\\n\\n raise_for_status(url, &mut resp).await?;\\n\\n\\n\",\n \"file_path\": \"src/api/upload/client.rs\",\n \"rank\": 54,\n \"score\": 30090.478763394913\n },\n {\n \"content\": \" fn from(token: &str) -> Self {\\n\\n Self {\\n\\n access_token: token.to_string(),\\n\\n client: get_https_client(),\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\nimpl<B: HttpBody + Send + 'static> UploadClient<B>\\n\\nwhere\\n\\n <B as HttpBody>::Data: Send,\\n\\n <B as HttpBody>::Error: Into<Box<(dyn std::error::Error + Send + Sync + 'static)>>,\\n\\n{\\n\\n /// Initialize a new `UploadClient` object from an [API access token],\\n\\n /// assuming this is currently set in the environment.\\n\\n ///\\n\\n /// [API access token]: https://wistia.com/support/developers/data-api#getting-started\\n\\n pub fn from_env() -> Result<Self> {\\n\\n let token = match var(ENV_VAR_NAME) {\\n\\n Ok(val) => Ok(val),\\n\",\n \"file_path\": \"src/api/upload/client.rs\",\n \"rank\": 55,\n \"score\": 30087.55354589535\n },\n {\n \"content\": \"/// Prefer to use this with one of the concrete implementations, i.e.\\n\\n/// [`crate::FileUploader`] or [`crate::UrlUploader`].\\n\\n///\\n\\n/// Also check out the [`rust-wistia`] docs for usage and examples.\\n\\n///\\n\\n/// [`rust-wistia`]: https://docs.rs/rust-wistia\\n\\n/// [Upload API]: https://wistia.com/support/developers/upload-api\\n\\n///\\n\\n#[derive(Clone)]\\n\\npub struct UploadClient<B = Body> {\\n\\n /// Represents the [API access token] used to authenticate requests to the\\n\\n /// [Wistia API].\\n\\n ///\\n\\n /// [API access token]: https://wistia.com/support/developers/data-api#getting-started\\n\\n /// [Wistia API]: https://wistia.com/support/developers/upload-api\\n\\n pub access_token: String,\\n\\n /// The HTTPS client to use for sending requests.\\n\\n client: Client<tls::HttpsConnector<HttpConnector>, B>,\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/api/upload/client.rs\",\n \"rank\": 58,\n \"score\": 30086.547915091724\n },\n {\n \"content\": \"impl<B: HttpBody + Send + 'static> From<String> for UploadClient<B>\\n\\nwhere\\n\\n <B as HttpBody>::Data: Send,\\n\\n <B as HttpBody>::Error: Into<Box<(dyn std::error::Error + Send + Sync + 'static)>>,\\n\\n{\\n\\n /// Create a new `UploadClient` from an access token\\n\\n fn from(token: String) -> Self {\\n\\n Self {\\n\\n access_token: token,\\n\\n client: get_https_client(),\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\nimpl<B: HttpBody + Send + 'static> From<&str> for UploadClient<B>\\n\\nwhere\\n\\n <B as HttpBody>::Data: Send,\\n\\n <B as HttpBody>::Error: Into<Box<(dyn std::error::Error + Send + Sync + 'static)>>,\\n\\n{\\n\\n /// Create a new `UploadClient` from an access token\\n\",\n \"file_path\": \"src/api/upload/client.rs\",\n \"rank\": 60,\n \"score\": 30085.00236688375\n },\n {\n \"content\": \"use crate::constants::{ENV_VAR_NAME, UPLOAD_API};\\n\\nuse crate::https::{get_https_client, tls};\\n\\nuse crate::log::debug;\\n\\nuse crate::models::*;\\n\\nuse crate::status::raise_for_status;\\n\\nuse crate::types::Result;\\n\\nuse crate::utils::into_struct_from_slice;\\n\\nuse crate::RustWistiaError;\\n\\n\\n\\nuse std::env::var;\\n\\nuse std::time::Instant;\\n\\n\\n\\nuse hyper::body::HttpBody;\\n\\nuse hyper::client::HttpConnector;\\n\\nuse hyper::{Body, Client, Request};\\n\\nuse serde_urlencoded::to_string;\\n\\n\\n\\n/// Client used to make requests to the Wistia **[Upload API]**.\\n\\n///\\n\\n/// # Note\\n\",\n \"file_path\": \"src/api/upload/client.rs\",\n \"rank\": 63,\n \"score\": 30081.28709975525\n },\n {\n \"content\": \" into_struct_from_slice(resp).await\\n\\n }\\n\\n}\\n\\n\\n\\n#[cfg(test)]\\n\\nmod tests {\\n\\n use serde::{Deserialize, Serialize};\\n\\n\\n\\n #[test]\\n\\n fn test_url_encoded_with_struct() {\\n\\n #[derive(Deserialize, Serialize, PartialEq, Debug)]\\n\\n struct Meal<'a> {\\n\\n bread: &'a str,\\n\\n cheese: &'a str,\\n\\n meat: &'a str,\\n\\n fat: &'a str,\\n\\n }\\n\\n\\n\\n let m = Meal {\\n\\n bread: \\\"baguette\\\",\\n\",\n \"file_path\": \"src/api/upload/client.rs\",\n \"rank\": 65,\n \"score\": 30077.607554351074\n },\n {\n \"content\": \" cheese: \\\"comté\\\",\\n\\n meat: \\\"ham\\\",\\n\\n fat: \\\"butter\\\",\\n\\n };\\n\\n\\n\\n assert_eq!(\\n\\n serde_urlencoded::to_string::<Meal>(m),\\n\\n Ok(\\\"bread=baguette&cheese=comt%C3%A9&meat=ham&fat=butter\\\".to_owned())\\n\\n );\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/api/upload/client.rs\",\n \"rank\": 66,\n \"score\": 30064.34831625462\n },\n {\n \"content\": \"use crate::utils::is_default;\\n\\n\\n\\nuse serde::{Deserialize, Serialize};\\n\\n\\n\\n#[derive(Default, Debug, Clone, PartialEq, Serialize, Deserialize)]\\n\\n#[serde(rename_all = \\\"camelCase\\\")]\\n\\npub struct Asset {\\n\\n pub content_type: String,\\n\\n pub file_size: u64,\\n\\n #[serde(rename = \\\"type\\\")]\\n\\n pub type_field: String,\\n\\n pub url: String,\\n\\n /// Note: `height` will **not** be populated for audio (or alternate audio) files\\n\\n #[serde(skip_serializing_if = \\\"is_default\\\")]\\n\\n #[serde(default)]\\n\\n pub height: u64,\\n\\n /// Note: `width` will **not** be populated for audio (or alternate audio) files\\n\\n #[serde(skip_serializing_if = \\\"is_default\\\")]\\n\\n #[serde(default)]\\n\\n pub width: u64,\\n\\n}\\n\",\n \"file_path\": \"src/models/media/asset.rs\",\n \"rank\": 67,\n \"score\": 29997.326355250967\n },\n {\n \"content\": \"use serde::{Deserialize, Serialize};\\n\\n\\n\\n/// An object representing the [thumbnail] for a media.\\n\\n///\\n\\n/// [thumbnail]: https://wistia.com/support/developers/data-api#medias-response\\n\\n#[derive(Default, Debug, PartialEq, Serialize, Deserialize)]\\n\\npub struct Thumbnail {\\n\\n pub url: String,\\n\\n pub width: u64,\\n\\n pub height: u64,\\n\\n}\\n\",\n \"file_path\": \"src/models/media/thumbnail.rs\",\n \"rank\": 68,\n \"score\": 29995.8050399402\n },\n {\n \"content\": \"use serde::{Deserialize, Serialize};\\n\\n\\n\\n#[derive(Default, Debug, Clone, PartialEq, Serialize, Deserialize)]\\n\\npub struct ProjectInfo {\\n\\n pub hashed_id: String,\\n\\n pub id: u64,\\n\\n pub name: String,\\n\\n}\\n\",\n \"file_path\": \"src/models/media/project.rs\",\n \"rank\": 69,\n \"score\": 29994.16826941586\n },\n {\n \"content\": \"mod asset;\\n\\nmod download_asset;\\n\\nmod media;\\n\\nmod media_info;\\n\\nmod project;\\n\\nmod status;\\n\\nmod thumbnail;\\n\\nmod r#type;\\n\\nmod update_request;\\n\\n\\n\\npub use asset::*;\\n\\npub use download_asset::*;\\n\\npub use media::*;\\n\\npub use media_info::*;\\n\\npub use project::*;\\n\\npub use r#type::*;\\n\\npub use status::*;\\n\\npub use thumbnail::*;\\n\\npub use update_request::*;\\n\",\n \"file_path\": \"src/models/media/mod.rs\",\n \"rank\": 70,\n \"score\": 29992.078313762875\n },\n {\n \"content\": \"use serde::{Deserialize, Serialize};\\n\\n\\n\\n/// Media files return a response attribute called status.\\n\\n///\\n\\n/// After upload is complete, media files must be processed. Status indicates\\n\\n/// which stage in processing the file is at.\\n\\n///\\n\\n/// See also: [Media Status][]\\n\\n///\\n\\n/// [Media Status]: https://wistia.com/support/developers/data-api#media-status\\n\\n#[derive(Debug, PartialEq, Serialize, Deserialize)]\\n\\n#[serde(rename_all = \\\"lowercase\\\")]\\n\\npub enum MediaStatus {\\n\\n /// **queued**: the file is waiting in the queue to be processed\\n\\n Queued,\\n\\n /// **processing**: the file is actively being processed\\n\\n Processing,\\n\\n /// **ready**: the file has been fully processed and is ready for\\n\\n /// embedding and viewing.\\n\\n Ready,\\n\",\n \"file_path\": \"src/models/media/status.rs\",\n \"rank\": 71,\n \"score\": 29988.393904452525\n },\n {\n \"content\": \" /// **failed**: the file was unable to be processed (usually a\\n\\n /// [format or size error](https://wistia.com/support/uploading/export-settings))\\n\\n Failed,\\n\\n}\\n\\n\\n\\nimpl Default for MediaStatus {\\n\\n fn default() -> Self {\\n\\n Self::Queued\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/models/media/status.rs\",\n \"rank\": 72,\n \"score\": 29984.05899043098\n },\n {\n \"content\": \" req: UploadFileRequest::new(file_path),\\n\\n })\\n\\n }\\n\\n\\n\\n /// Create a `FileUploader` with a new HTTPS client and a Wistia access\\n\\n /// token.\\n\\n ///\\n\\n /// # Arguments\\n\\n ///\\n\\n /// * `file_path` - The path to the media file. The contents of this file\\n\\n /// will be multipart-form encoded into the request body.\\n\\n /// * `access_token` - An API access token used to make requests to the\\n\\n /// Wistia API.\\n\\n ///\\n\\n pub fn with_token(file_path: P, access_token: &str) -> Self {\\n\\n Self {\\n\\n client: UploadClient::from_token(access_token),\\n\\n req: UploadFileRequest::new(file_path),\\n\\n }\\n\\n }\\n\",\n \"file_path\": \"src/api/upload/file.rs\",\n \"rank\": 73,\n \"score\": 29573.30699777039\n },\n {\n \"content\": \"\\n\\n /// Create a `FileUploader` with a file path and an HTTPS client.\\n\\n ///\\n\\n /// # Arguments\\n\\n ///\\n\\n /// * `file_path` - The path to the media file. The contents of this file\\n\\n /// will be multipart-form encoded into the request body.\\n\\n /// * `client` - The HTTPS client (UploadClient) to use for requests.\\n\\n /// Note that the client must support multipart form requests, via a\\n\\n /// `multipart::Body`.\\n\\n ///\\n\\n pub fn with_client(file_path: P, client: UploadClient<Body>) -> Self {\\n\\n Self {\\n\\n client,\\n\\n req: UploadFileRequest::new(file_path),\\n\\n }\\n\\n }\\n\\n\\n\\n /// The hashed id of the project to upload media into. If omitted, a new\\n\\n /// project will be created and uploaded to. The naming convention used\\n\",\n \"file_path\": \"src/api/upload/file.rs\",\n \"rank\": 74,\n \"score\": 29570.351184432155\n },\n {\n \"content\": \"/// [Upload API]: https://wistia.com/support/developers/upload-api\\n\\n///\\n\\n#[derive(Clone)]\\n\\npub struct FileUploader<'a, P: AsRef<Path>, B = Body> {\\n\\n client: UploadClient<B>,\\n\\n req: UploadFileRequest<'a, P>,\\n\\n}\\n\\n\\n\\nimpl<'a, P: AsRef<Path> + Debug> FileUploader<'a, P> {\\n\\n /// Create a `FileUploader` with a new HTTPS client, with the access token\\n\\n /// retrieved from the environment.\\n\\n ///\\n\\n /// # Arguments\\n\\n ///\\n\\n /// * `file_path` - The path to the media file. The contents of this file\\n\\n /// will be multipart-form encoded into the request body.\\n\\n ///\\n\\n pub fn new(file_path: P) -> Result<Self> {\\n\\n Ok(Self {\\n\\n client: UploadClient::from_env()?,\\n\",\n \"file_path\": \"src/api/upload/file.rs\",\n \"rank\": 75,\n \"score\": 29569.745590596503\n },\n {\n \"content\": \" /// A Wistia contact id, an integer value. If omitted, it will default to\\n\\n /// the contact_id of the account’s owner.\\n\\n pub fn contact_id(mut self, contact_id: &'a str) -> Self {\\n\\n self.req.contact_id = Some(contact_id);\\n\\n self\\n\\n }\\n\\n\\n\\n /// Send the Upload File request (with the *multi-part form* data) to the\\n\\n /// Wistia [Upload API].\\n\\n ///\\n\\n /// [Upload API]: https://wistia.com/support/developers/upload-api\\n\\n ///\\n\\n // noinspection DuplicatedCode\\n\\n pub async fn send(&self) -> Result<UploadResponse> {\\n\\n // Build the query parameters to pass to the Upload API\\n\\n\\n\\n let params = UploadRequest {\\n\\n access_token: self.client.access_token.as_str(),\\n\\n url: None,\\n\\n project_id: self.req.project_id,\\n\",\n \"file_path\": \"src/api/upload/file.rs\",\n \"rank\": 76,\n \"score\": 29568.17768252009\n },\n {\n \"content\": \" name: self.req.name,\\n\\n description: None,\\n\\n contact_id: self.req.contact_id,\\n\\n };\\n\\n\\n\\n let url = UploadClient::<Body>::build_url(params)?;\\n\\n\\n\\n // Create a request instance and multipart form\\n\\n let req_builder = Request::post(&url);\\n\\n let mut form = Form::default();\\n\\n\\n\\n // Add multi-part form fields\\n\\n\\n\\n form.add_file(\\\"file\\\", &self.req.file_path)\\n\\n .map_err(|e: io::Error| match e.kind() {\\n\\n io::ErrorKind::NotFound => RustWistiaError::FileNotFound(\\n\\n self.req.file_path.as_ref().to_string_lossy().to_string(),\\n\\n ),\\n\\n _ => RustWistiaError::Io(e),\\n\\n })?;\\n\",\n \"file_path\": \"src/api/upload/file.rs\",\n \"rank\": 77,\n \"score\": 29567.497480405807\n },\n {\n \"content\": \" /// for such projects is `Uploads_YYYY-MM-DD`.\\n\\n pub fn project_id(mut self, project_id: &'a str) -> Self {\\n\\n self.req.project_id = Some(project_id);\\n\\n self\\n\\n }\\n\\n\\n\\n /// A display name to use for the media in Wistia. If omitted, the filename\\n\\n /// will be used instead. This field is limited to 255 characters.\\n\\n pub fn name(mut self, name: &'a str) -> Self {\\n\\n self.req.name = Some(name);\\n\\n self\\n\\n }\\n\\n\\n\\n /// A description to use for the media in Wistia. You can use basic HTML\\n\\n /// here, but note that both HTML and CSS will be sanitized.\\n\\n pub fn description(mut self, description: &'a str) -> Self {\\n\\n self.req.description = Some(description);\\n\\n self\\n\\n }\\n\\n\\n\",\n \"file_path\": \"src/api/upload/file.rs\",\n \"rank\": 78,\n \"score\": 29566.80963434476\n },\n {\n \"content\": \"\\n\\n if let Some(description) = self.req.description {\\n\\n form.add_text(\\\"description\\\", description);\\n\\n }\\n\\n\\n\\n // Update a request instance with the multipart Content-Type header\\n\\n // and the payload data.\\n\\n let form = form.set_body::<Body>(req_builder).unwrap();\\n\\n\\n\\n // Send the request\\n\\n self.client.make_request(&url, form).await\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/api/upload/file.rs\",\n \"rank\": 79,\n \"score\": 29561.62651409903\n },\n {\n \"content\": \"use crate::api::client::UploadClient;\\n\\nuse crate::models::*;\\n\\nuse crate::types::Result;\\n\\nuse crate::RustWistiaError;\\n\\n\\n\\nuse std::fmt::Debug;\\n\\nuse std::io;\\n\\nuse std::path::Path;\\n\\n\\n\\nuse hyper::Request;\\n\\nuse hyper_multipart::client::multipart::Form;\\n\\nuse hyper_multipart_rfc7578 as hyper_multipart;\\n\\nuse hyper_multipart_rfc7578::client::multipart::Body;\\n\\n\\n\\n/// Client implementation to upload *files* and *videos* via the Wistia\\n\\n/// **[Upload API]**.\\n\\n///\\n\\n/// Also check out the [`rust-wistia`] docs for usage and examples.\\n\\n///\\n\\n/// [`rust-wistia`]: https://docs.rs/rust-wistia\\n\",\n \"file_path\": \"src/api/upload/file.rs\",\n \"rank\": 80,\n \"score\": 29552.98373699894\n },\n {\n \"content\": \" contact_id: String,\\n\\n}\\n\\n\\n\\n// noinspection DuplicatedCode\\n\\n#[tokio::main]\\n\\nasync fn main() -> Result<()> {\\n\\n sensible_env_logger::init_timed_short!();\\n\\n\\n\\n let args: Args = Args::parse();\\n\\n\\n\\n trace!(\\\"Uploading file stream to Wistia...\\\");\\n\\n\\n\\n let bytes = fs::read(args.file_path)?;\\n\\n let reader = Cursor::new(bytes);\\n\\n\\n\\n // Alternatively, we could use `StreamUploader::new(path)?` to\\n\\n // create the new `StreamUploader` instance.\\n\\n let res = StreamUploader::new(reader)?\\n\\n .project_id(&args.project_id)\\n\\n .name(&args.name)\\n\",\n \"file_path\": \"examples/upload_file_stream.rs\",\n \"rank\": 81,\n \"score\": 29549.058840195696\n },\n {\n \"content\": \"use rust_wistia::{Result, StreamUploader};\\n\\n\\n\\n#[macro_use]\\n\\nextern crate log;\\n\\n\\n\\nuse std::fs;\\n\\nuse std::io::Cursor;\\n\\nuse std::path::PathBuf;\\n\\n\\n\\nuse clap::Parser;\\n\\n\\n\\n/// Upload a local file stream to Wistia\\n\\n// noinspection DuplicatedCode\\n\\n#[derive(Parser, Debug)]\\n\",\n \"file_path\": \"examples/upload_file_stream.rs\",\n \"rank\": 82,\n \"score\": 29543.092270179306\n },\n {\n \"content\": \" .description(&args.description)\\n\\n .contact_id(&args.contact_id)\\n\\n .send()\\n\\n .await?;\\n\\n\\n\\n trace!(\\\"Response: {res:#?}\\\");\\n\\n trace!(\\\"Video ID: {}\\\", res.hashed_id);\\n\\n\\n\\n Ok(())\\n\\n}\\n\",\n \"file_path\": \"examples/upload_file_stream.rs\",\n \"rank\": 83,\n \"score\": 29542.46779180645\n },\n {\n \"content\": \"}\\n\\n\\n\\nimpl<'a> DownloadAssetRequest<'a> {\\n\\n /// Sets the media *asset type* to download from Wistia.\\n\\n ///\\n\\n /// # Examples\\n\\n ///\\n\\n /// ```\\n\\n /// use rust_wistia::models::DownloadAssetRequest;\\n\\n ///\\n\\n /// let info = DownloadAssetRequest::from(\\\"my-video-id\\\").asset_type(\\\"OriginalFile\\\");\\n\\n /// ``` \\n\\n pub fn asset_type(mut self, asset_type: &'a str) -> Self {\\n\\n self.asset_type = Some(asset_type);\\n\\n self\\n\\n }\\n\\n\\n\\n /// Sets a local *file path* to save the downloaded media content to.\\n\\n ///\\n\\n /// # Examples\\n\",\n \"file_path\": \"src/models/media/download_asset.rs\",\n \"rank\": 84,\n \"score\": 28971.749792946917\n },\n {\n \"content\": \" /// let media = WistiaClient::from_env()?.get_media(\\\"my-id\\\").await?;\\n\\n /// let info = DownloadAssetRequest::from(media);\\n\\n /// ``` \\n\\n pub media: Option<Media>,\\n\\n\\n\\n /// The media *asset type* to download.\\n\\n pub asset_type: Option<&'a str>,\\n\\n\\n\\n /// Sets a local *file path* to save the downloaded media content to.\\n\\n pub file_path: Option<PathBuf>,\\n\\n}\\n\\n\\n\\nimpl<'a> From<&'a str> for DownloadAssetRequest<'a> {\\n\\n /// Create a new `DownloadAssetRequest` from a Wistia `media_id`\\n\\n fn from(media_id: &'a str) -> Self {\\n\\n Self {\\n\\n media_id: Some(media_id),\\n\\n ..Default::default()\\n\\n }\\n\\n }\\n\",\n \"file_path\": \"src/models/media/download_asset.rs\",\n \"rank\": 85,\n \"score\": 28965.37847036904\n },\n {\n \"content\": \"use crate::models::Media;\\n\\nuse std::path::{Path, PathBuf};\\n\\n\\n\\n/// Represents a request to download an [Asset URL].\\n\\n///\\n\\n/// [Asset URL]: https://wistia.com/support/developers/asset-urls\\n\\n///\\n\\n#[derive(Default)]\\n\\npub struct DownloadAssetRequest<'a> {\\n\\n /// The Wistia media to download.\\n\\n pub media_id: Option<&'a str>,\\n\\n\\n\\n /// The Wistia media to download.\\n\\n ///\\n\\n /// # Example\\n\\n ///\\n\\n /// ```rust,ignore\\n\\n /// use rust_wistia::models::DownloadAssetRequest;\\n\\n /// use rust_wistia::WistiaClient;\\n\\n ///\\n\",\n \"file_path\": \"src/models/media/download_asset.rs\",\n \"rank\": 86,\n \"score\": 28962.657234306975\n },\n {\n \"content\": \" ///\\n\\n /// ```rust,ignore\\n\\n /// use rust_wistia::models::DownloadAssetRequest;\\n\\n /// use rust_wistia::WistiaClient;\\n\\n ///\\n\\n /// let info = DownloadAssetRequest::from(\\\"my-video-id\\\").file_path(\\\"./my-file.mp4\\\");\\n\\n /// let _ = WistiaClient::from_env()?.download_asset(info).await?;\\n\\n /// ``` \\n\\n pub fn file_path(mut self, file_path: impl AsRef<Path>) -> Self {\\n\\n self.file_path = Some(file_path.as_ref().into());\\n\\n self\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/models/media/download_asset.rs\",\n \"rank\": 87,\n \"score\": 28960.510646592968\n },\n {\n \"content\": \"}\\n\\n\\n\\nimpl<'a> From<&'a String> for DownloadAssetRequest<'a> {\\n\\n /// Create a new `DownloadAssetRequest` from a Wistia `media_id`\\n\\n fn from(media_id: &'a String) -> Self {\\n\\n Self {\\n\\n media_id: Some(media_id),\\n\\n ..Default::default()\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\nimpl<'a> From<Media> for DownloadAssetRequest<'a> {\\n\\n /// Create a new `DownloadAssetRequest` from a `Media` object\\n\\n fn from(media: Media) -> Self {\\n\\n Self {\\n\\n media: Some(media),\\n\\n ..Default::default()\\n\\n }\\n\\n }\\n\",\n \"file_path\": \"src/models/media/download_asset.rs\",\n \"rank\": 88,\n \"score\": 28956.717951011586\n },\n {\n \"content\": \" ///\\n\\n /// ```\\n\\n /// use rust_wistia::{StreamUploader, https::get_https_client};\\n\\n ///\\n\\n /// let mut uploader = StreamUploader::with_url(\\\"https://google.com/my/image\\\").await?;\\n\\n /// ```\\n\\n pub async fn with_url(url: &str) -> Result<StreamUploader<'a, Cursor<Bytes>>> {\\n\\n let stream = stream_reader_from_url(url, None).await?;\\n\\n Self::new(stream)\\n\\n }\\n\\n\\n\\n /// Create a new `StreamUploader` which uses the *bytes* content downloaded\\n\\n /// from a publicly accessible **url**.\\n\\n ///\\n\\n /// # Arguments\\n\\n ///\\n\\n /// * `url` - A public accessible url to the media which will be downloaded.\\n\\n /// * `access_token` - An API access token used to make requests to the\\n\\n /// Wistia API.\\n\\n ///\\n\",\n \"file_path\": \"src/api/upload/file_stream.rs\",\n \"rank\": 89,\n \"score\": 28548.046012953157\n },\n {\n \"content\": \"///\\n\\n/// [`rust-wistia`]: https://docs.rs/rust-wistia\\n\\n/// [Upload API]: https://wistia.com/support/developers/upload-api\\n\\n///\\n\\n#[derive(Clone)]\\n\\npub struct StreamUploader<'a, R: 'static + Read + Send + Sync, B = Body> {\\n\\n client: UploadClient<B>,\\n\\n req: UploadStreamRequest<'a>,\\n\\n reader: Option<R>,\\n\\n}\\n\\n\\n\\nimpl<'a> StreamUploader<'a, Cursor<Bytes>> {\\n\\n /// Create a new `StreamUploader` which uses the *bytes* content downloaded\\n\\n /// from a publicly accessible **url**.\\n\\n ///\\n\\n /// # Arguments\\n\\n ///\\n\\n /// * `url` - A public accessible url to the media which will be downloaded.\\n\\n ///\\n\\n /// # Examples\\n\",\n \"file_path\": \"src/api/upload/file_stream.rs\",\n \"rank\": 90,\n \"score\": 28546.29459353789\n },\n {\n \"content\": \" /// # Examples\\n\\n ///\\n\\n /// ```\\n\\n /// use rust_wistia::{StreamUploader, https::get_https_client};\\n\\n ///\\n\\n /// let mut uploader = StreamUploader::with_url_and_token(\\n\\n /// \\\"https://google.com/my/image\\\",\\n\\n /// \\\"my-token\\\"\\n\\n /// )\\n\\n /// .await?;\\n\\n /// ```\\n\\n pub async fn with_url_and_token(\\n\\n url: &str,\\n\\n access_token: &str,\\n\\n ) -> Result<StreamUploader<'a, Cursor<Bytes>>> {\\n\\n let stream = stream_reader_from_url(url, None).await?;\\n\\n Ok(Self::with_token(access_token).stream(stream))\\n\\n }\\n\\n\\n\\n /// Create a new `StreamUploader` which uses the *bytes* content downloaded\\n\",\n \"file_path\": \"src/api/upload/file_stream.rs\",\n \"rank\": 91,\n \"score\": 28545.985026348586\n },\n {\n \"content\": \" /// The hashed id of the project to upload media into. If omitted, a new\\n\\n /// project will be created and uploaded to. The naming convention used\\n\\n /// for such projects is `Uploads_YYYY-MM-DD`.\\n\\n pub fn project_id(mut self, project_id: &'a str) -> Self {\\n\\n self.req.project_id = Some(project_id);\\n\\n self\\n\\n }\\n\\n\\n\\n /// A display name to use for the media in Wistia. If omitted, the filename\\n\\n /// will be used instead. This field is limited to 255 characters.\\n\\n pub fn name(mut self, name: &'a str) -> Self {\\n\\n self.req.name = Some(name);\\n\\n self\\n\\n }\\n\\n\\n\\n /// A description to use for the media in Wistia. You can use basic HTML\\n\\n /// here, but note that both HTML and CSS will be sanitized.\\n\\n pub fn description(mut self, description: &'a str) -> Self {\\n\\n self.req.description = Some(description);\\n\\n self\\n\",\n \"file_path\": \"src/api/upload/file_stream.rs\",\n \"rank\": 92,\n \"score\": 28545.555317639017\n },\n {\n \"content\": \" }\\n\\n\\n\\n /// A Wistia contact id, an integer value. If omitted, it will default to\\n\\n /// the contact_id of the account’s owner.\\n\\n pub fn contact_id(mut self, contact_id: &'a str) -> Self {\\n\\n self.req.contact_id = Some(contact_id);\\n\\n self\\n\\n }\\n\\n\\n\\n /// Send the Upload File request (with the *multi-part form* data) to the\\n\\n /// Wistia [Upload API].\\n\\n ///\\n\\n /// [Upload API]: https://wistia.com/support/developers/upload-api\\n\\n ///\\n\\n // noinspection DuplicatedCode\\n\\n pub async fn send(self) -> Result<UploadResponse> {\\n\\n // Build the query parameters to pass to the Upload API\\n\\n\\n\\n let params = UploadRequest {\\n\\n access_token: self.client.access_token.as_str(),\\n\",\n \"file_path\": \"src/api/upload/file_stream.rs\",\n \"rank\": 93,\n \"score\": 28545.465987401833\n },\n {\n \"content\": \" pub fn with_filename(file_name: &'a str) -> Result<Self> {\\n\\n Ok(Self {\\n\\n client: UploadClient::from_env()?,\\n\\n req: UploadStreamRequest::new(file_name),\\n\\n reader: None,\\n\\n })\\n\\n }\\n\\n\\n\\n /// Create a `SteamUploader` with a new HTTPS client and a Wistia access\\n\\n /// token.\\n\\n ///\\n\\n /// # Arguments\\n\\n ///\\n\\n /// * `access_token` - An API access token used to make requests to the\\n\\n /// Wistia API.\\n\\n ///\\n\\n /// # Examples\\n\\n ///\\n\\n /// ```\\n\\n /// use rust_wistia::StreamUploader;\\n\",\n \"file_path\": \"src/api/upload/file_stream.rs\",\n \"rank\": 94,\n \"score\": 28545.439202917787\n },\n {\n \"content\": \" ///\\n\\n /// # Examples\\n\\n ///\\n\\n /// ```\\n\\n /// use rust_wistia::StreamUploader;\\n\\n /// use std::io::Cursor;\\n\\n ///\\n\\n /// let bytes = Cursor::new(\\\"Hello World!\\\");\\n\\n /// let uploader = StreamUploader::with_stream_and_filename(bytes, \\\"my_file.mp4\\\")?;\\n\\n ///\\n\\n /// let res = uploader.send()?.await?;\\n\\n /// ```\\n\\n ///\\n\\n pub fn with_stream_and_filename(stream: R, file_name: &'a str) -> Result<Self> {\\n\\n Ok(Self {\\n\\n client: UploadClient::from_env()?,\\n\\n req: UploadStreamRequest::new(file_name),\\n\\n reader: Some(stream),\\n\\n })\\n\\n }\\n\",\n \"file_path\": \"src/api/upload/file_stream.rs\",\n \"rank\": 95,\n \"score\": 28545.054217213576\n },\n {\n \"content\": \" url: None,\\n\\n project_id: self.req.project_id,\\n\\n name: self.req.name,\\n\\n description: None,\\n\\n contact_id: self.req.contact_id,\\n\\n };\\n\\n\\n\\n let url = UploadClient::<Body>::build_url(params)?;\\n\\n\\n\\n // Create a request instance and multipart form\\n\\n let req_builder = Request::post(&url);\\n\\n let mut form = Form::default();\\n\\n\\n\\n // Add multi-part form fields\\n\\n\\n\\n // TODO worth checking for unwrap()?\\n\\n form.add_reader_file(\\\"file\\\", self.reader.unwrap(), self.req.file_name);\\n\\n\\n\\n if let Some(description) = self.req.description {\\n\\n form.add_text(\\\"description\\\", description);\\n\",\n \"file_path\": \"src/api/upload/file_stream.rs\",\n \"rank\": 96,\n \"score\": 28544.172972864028\n },\n {\n \"content\": \" /// use rust_wistia::StreamUploader;\\n\\n /// use std::io::Cursor;\\n\\n ///\\n\\n /// let bytes = Cursor::new(\\\"Hello World!\\\");\\n\\n /// let uploader = StreamUploader::new(bytes)?;\\n\\n ///\\n\\n /// let res = uploader.name(\\\"My Video Name\\\").send()?.await?;\\n\\n /// ```\\n\\n /// \\n\\n pub fn new(stream: R) -> Result<Self> {\\n\\n Self::with_stream_and_filename(stream, DEFAULT_FILENAME)\\n\\n }\\n\\n\\n\\n /// Create a `SteamUploader` with a new HTTPS client, with the access token\\n\\n /// retrieved from the environment.\\n\\n ///\\n\\n /// # Arguments\\n\\n ///\\n\\n /// * `stream` - A readable file-like *stream* object to upload.\\n\\n /// * `file_name` - The name of the media file.\\n\",\n \"file_path\": \"src/api/upload/file_stream.rs\",\n \"rank\": 97,\n \"score\": 28541.59565786041\n },\n {\n \"content\": \" /// Set the publicly-accessible URL link to the media file. The link\\n\\n /// will be *form-url encoded* into the request body.\\n\\n ///\\n\\n /// # Note\\n\\n /// This method call is only needed when the `UrlUploader::from`\\n\\n /// constructor is called.\\n\\n pub fn url(mut self, url: &'a str) -> Self {\\n\\n self.req.url = url;\\n\\n self\\n\\n }\\n\\n\\n\\n /// The hashed id of the project to upload media into. If omitted, a new\\n\\n /// project will be created and uploaded to. The naming convention used\\n\\n /// for such projects is `Uploads_YYYY-MM-DD`.\\n\\n pub fn project_id(mut self, project_id: &'a str) -> Self {\\n\\n self.req.project_id = Some(project_id);\\n\\n self\\n\\n }\\n\\n\\n\\n /// A display name to use for the media in Wistia. If omitted, the filename\\n\",\n \"file_path\": \"src/api/upload/link.rs\",\n \"rank\": 98,\n \"score\": 34.03826458661081\n },\n {\n \"content\": \" }\\n\\n\\n\\n /// Create an `UrlUploader` with a new HTTPS client and a Wistia access\\n\\n /// token.\\n\\n ///\\n\\n /// # Arguments\\n\\n ///\\n\\n /// * `url` - A publicly-accessible URL link to the media file. The link\\n\\n /// will be *form-url encoded* into the request body.\\n\\n /// * `access_token` - An API access token used to make requests to the\\n\\n /// Wistia API.\\n\\n ///\\n\\n pub fn with_token(url: &'a str, access_token: &str) -> Self {\\n\\n Self {\\n\\n client: UploadClient::from(access_token),\\n\\n req: UploadUrlRequest {\\n\\n url,\\n\\n ..Default::default()\\n\\n },\\n\\n }\\n\",\n \"file_path\": \"src/api/upload/link.rs\",\n \"rank\": 99,\n \"score\": 32.69777336956889\n }\n]","isConversational":false}}},{"rowIdx":2393,"cells":{"lang":{"kind":"string","value":"Rust"},"file_path":{"kind":"string","value":"syn-meta-ext/src/lib.rs"},"repo_name":{"kind":"string","value":"YoloDev/evitable"},"commit":{"kind":"string","value":"c1284df0c60a99f07caf037e22b7c8ab37b28fca"},"file_code":{"kind":"string","value":"extern crate ident_case;\nextern crate proc_macro2;\n#[cfg_attr(test, macro_use)]\nextern crate quote;\n#[cfg_attr(test, macro_use)]\nextern crate syn;\n\nuse proc_macro2::TokenStream;\nuse quote::ToTokens;\n\nuse syn::parse::*;\nuse syn::{parenthesized, parse, token, Attribute, Ident, Lit, LitBool, Path, Token};\n\npub mod ast;\npub mod error;\nmod from_derive_input;\nmod from_field;\nmod from_meta;\nmod from_variant;\n\npub use ast::*;\npub use from_derive_input::FromDeriveInput;\npub use from_field::FromField;\npub use from_meta::FromMeta;\npub use from_variant::FromVariant;\n\npub trait PathExt {\n fn single_ident(&self) -> Option<&Ident>;\n fn to_compact_string(&self) -> String;\n}\n\nimpl PathExt for Path {\n fn single_ident(&self) -> Option<&Ident> {\n if self.leading_colon.is_none()\n && self.segments.len() == 1\n && self.segments[0].arguments == syn::PathArguments::None\n {\n Some(&self.segments[0].ident)\n } else {\n None\n }\n }\n\n fn to_compact_string(&self) -> String {\n self\n .segments\n .iter()\n .map(|s| {\n let mut ident = s.ident.to_string();\n match &s.arguments {\n syn::PathArguments::None => ident,\n syn::PathArguments::AngleBracketed(args) => {\n if args.colon2_token.is_some() {\n ident.push_str(\"::\");\n }\n\n ident.push_str(\"<\");\n for arg in &args.args {\n match arg {\n syn::GenericArgument::Lifetime(l) => {\n ident.push('\\'');\n ident.push_str(&l.ident.to_string());\n }\n\n syn::GenericArgument::Type(t) => {\n let mut ts = TokenStream::new();\n t.to_tokens(&mut ts);\n ident.push_str(&format!(\"{}\", ts));\n }\n\n syn::GenericArgument::Binding(b) => {\n ident.push_str(&b.ident.to_string());\n ident.push('=');\n let mut ts = TokenStream::new();\n b.ty.to_tokens(&mut ts);\n ident.push_str(&format!(\"{}\", ts));\n }\n\n syn::GenericArgument::Constraint(c) => {\n ident.push_str(&c.ident.to_string());\n ident.push_str(\": \");\n let mut ts = TokenStream::new();\n c.bounds.to_tokens(&mut ts);\n ident.push_str(&format!(\"{}\", ts));\n }\n\n syn::GenericArgument::Const(e) => {\n let mut ts = TokenStream::new();\n e.to_tokens(&mut ts);\n ident.push_str(&format!(\"{}\", ts));\n }\n }\n }\n\n ident.push_str(\">\");\n ident\n }\n syn::PathArguments::Parenthesized(args) => {\n let mut ts = TokenStream::new();\n args.to_tokens(&mut ts);\n ident.push_str(&format!(\"{}\", ts));\n ident\n }\n }\n })\n .collect::<Vec<String>>()\n .join(\"::\")\n }\n}\n\npub trait AttrExt {\n fn meta(&self) -> Result<Meta>;\n}\n\nimpl AttrExt for Attribute {\n fn meta(&self) -> Result<Meta> {\n let parser = |input: ParseStream| parse_meta_after_path(self.path.clone(), input);\n\n parse::Parser::parse2(parser, self.tokens.clone())\n }\n}\n\n#[derive(Debug, Clone, PartialEq)]\npub enum Meta {\n Path(syn::Path),\n List(MetaList),\n NameValue(MetaNameValue),\n}\n\nimpl Meta {\n pub fn path(&self) -> &Path {\n match self {\n Meta::Path(meta) => meta,\n Meta::List(meta) => &meta.path,\n Meta::NameValue(meta) => &meta.path,\n }\n }\n\n pub fn is<S>(&self, path: S) -> bool\n where\n S: AsRef<str>,\n {\n match self.path().single_ident() {\n None => false,\n Some(i) => {\n let actual = i.to_string();\n &actual == path.as_ref()\n }\n }\n }\n}\n\n#[derive(Debug, Clone, PartialEq)]\npub struct MetaList {\n pub path: syn::Path,\n pub paren_token: syn::token::Paren,\n pub nested: syn::punctuated::Punctuated<NestedMeta, syn::token::Comma>,\n}\n\nimpl IntoIterator for MetaList {\n type Item = <syn::punctuated::Punctuated<NestedMeta, syn::token::Comma> as IntoIterator>::Item;\n type IntoIter =\n <syn::punctuated::Punctuated<NestedMeta, syn::token::Comma> as IntoIterator>::IntoIter;\n\n #[inline]\n fn into_iter(self) -> Self::IntoIter {\n self.nested.into_iter()\n }\n}\n\nimpl<'a> IntoIterator for &'a MetaList {\n type Item =\n <&'a syn::punctuated::Punctuated<NestedMeta, syn::token::Comma> as IntoIterator>::Item;\n type IntoIter =\n <&'a syn::punctuated::Punctuated<NestedMeta, syn::token::Comma> as IntoIterator>::IntoIter;\n\n #[inline]\n fn into_iter(self) -> Self::IntoIter {\n (&self.nested).into_iter()\n }\n}\n\n#[derive(Debug, Clone, PartialEq)]\npub enum NestedMeta {\n \n \n Meta(Meta),\n\n \n Literal(syn::Lit),\n}\n\n#[derive(Debug, Clone, PartialEq)]\npub struct MetaNameValue {\n pub path: syn::Path,\n pub eq_token: syn::token::Eq,\n pub val: MetaValue,\n}\n\n#[derive(Debug, Clone, PartialEq)]\npub enum MetaValue {\n Path(syn::Path),\n Literal(syn::Lit),\n}\n\nimpl Parse for MetaValue {\n fn parse(input: ParseStream) -> Result<Self> {\n let ahead = input.fork();\n\n if ahead.call(Path::parse).is_ok() {\n input.parse().map(MetaValue::Path)\n } else if ahead.call(Lit::parse).is_ok() {\n input.parse().map(MetaValue::Literal)\n } else {\n Err(input.error(\"expected path or literal\"))\n }\n }\n}\n\nimpl Parse for Meta {\n fn parse(input: ParseStream) -> Result<Self> {\n let path = input.call(Path::parse)?;\n parse_meta_after_path(path, input)\n }\n}\n\nimpl Parse for MetaList {\n fn parse(input: ParseStream) -> Result<Self> {\n let path = input.call(Path::parse)?;\n parse_meta_list_after_path(path, input)\n }\n}\n\nimpl Parse for MetaNameValue {\n fn parse(input: ParseStream) -> Result<Self> {\n let path = input.call(Path::parse)?;\n parse_meta_name_value_after_path(path, input)\n }\n}\n\nimpl Parse for NestedMeta {\n fn parse(input: ParseStream) -> Result<Self> {\n let ahead = input.fork();\n\n if ahead.peek(Lit) && !(ahead.peek(LitBool) && ahead.peek2(Token![=])) {\n input.parse().map(NestedMeta::Literal)\n } else if ahead.call(Path::parse).is_ok() {\n input.parse().map(NestedMeta::Meta)\n } else {\n Err(input.error(\"expected path or literal\"))\n }\n }\n}\n\nfn parse_meta_after_path(path: Path, input: ParseStream) -> Result<Meta> {\n if input.peek(token::Paren) {\n parse_meta_list_after_path(path, input).map(Meta::List)\n } else if input.peek(Token![=]) {\n parse_meta_name_value_after_path(path, input).map(Meta::NameValue)\n } else {\n Ok(Meta::Path(path))\n }\n}\n\nfn parse_meta_list_after_path(path: Path, input: ParseStream) -> Result<MetaList> {\n let content;\n Ok(MetaList {\n path: path,\n paren_token: parenthesized!(content in input),\n nested: content.parse_terminated(NestedMeta::parse)?,\n })\n}\n\nfn parse_meta_name_value_after_path(path: Path, input: ParseStream) -> Result<MetaNameValue> {\n Ok(MetaNameValue {\n path: path,\n eq_token: input.parse()?,\n val: input.parse()?,\n })\n}\n\nimpl ToTokens for MetaValue {\n fn to_tokens(&self, tokens: &mut TokenStream) {\n match self {\n MetaValue::Literal(l) => l.to_tokens(tokens),\n MetaValue::Path(p) => p.to_tokens(tokens),\n }\n }\n}\n\nimpl ToTokens for MetaNameValue {\n fn to_tokens(&self, tokens: &mut TokenStream) {\n self.path.to_tokens(tokens);\n self.eq_token.to_tokens(tokens);\n self.val.to_tokens(tokens);\n }\n}\n\nimpl ToTokens for NestedMeta {\n fn to_tokens(&self, tokens: &mut TokenStream) {\n match self {\n NestedMeta::Meta(meta) => meta.to_tokens(tokens),\n NestedMeta::Literal(lit) => lit.to_tokens(tokens),\n }\n }\n}\n\nimpl ToTokens for MetaList {\n fn to_tokens(&self, tokens: &mut TokenStream) {\n self.path.to_tokens(tokens);\n self.paren_token.surround(tokens, |tokens| {\n self.nested.to_tokens(tokens);\n })\n }\n}\n\nimpl ToTokens for Meta {\n fn to_tokens(&self, tokens: &mut TokenStream) {\n match self {\n Meta::Path(path) => path.to_tokens(tokens),\n Meta::List(list) => list.to_tokens(tokens),\n Meta::NameValue(nv) => nv.to_tokens(tokens),\n }\n }\n}\n\n#[cfg(test)]\nmod test {\n use super::*;\n\n #[test]\n pub fn derive_test() {\n let input: syn::ItemStruct = parse_quote! { #[evitable::from = ::std::io::Error] struct Foo; };\n let attr = &input.attrs[0];\n let meta = attr.meta().unwrap();\n let path_str = format!(\"{}\", meta.path().into_token_stream());\n println!(\"{:?}\", meta);\n assert_eq!(path_str, \"evitable :: from\");\n }\n}\n"},"prefix":{"kind":"string","value":"extern crate ident_case;\nextern crate proc_macro2;\n#[cfg_attr(test, macro_use)]\nextern crate quote;\n#[cfg_attr(test, macro_use)]\nextern crate syn;\n\nuse proc_macro2::TokenStream;\nuse quote::ToTokens;\n\nuse syn::parse::*;\nuse syn::{parenthesized, parse, token, Attribute, Ident, Lit, LitBool, Path, Token};\n\npub mod ast;\npub mod error;\nmod from_derive_input;\nmod from_field;\nmod from_meta;\nmod from_variant;\n\npub use ast::*;\npub use from_derive_input::FromDeriveInput;\npub use from_field::FromField;\npub use from_meta::FromMeta;\npub use from_variant::FromVariant;\n\npub trait PathExt {\n fn single_ident(&self) -> Option<&Ident>;\n fn to_compact_string(&self) -> String;\n}\n\nimpl PathExt for Path {\n fn single_ident(&self) -> Option<&Ident> {\n if self.leading_colon.is_none()\n && self.segments.len() == 1\n && self.segments[0].arguments == syn::PathArguments::None\n {\n Some(&self.segments[0].ident)\n } else {\n None\n }\n }\n\n fn to_compact_string(&self) -> String {\n self\n .segments\n .iter()\n .map(|s| {\n let mut ident = s.ident.to_string();\n match &s.arguments {\n syn::PathArguments::None => ident,\n syn::PathArguments::AngleBracketed(args) => {\n if args.colon2_token.is_some() {\n ident.push_str(\"::\");\n }\n\n ident.push_str(\"<\");\n for arg in &args.args {\n match arg {\n syn::GenericArgument::Lifetime(l) => {\n ident.push('\\'');\n ident.push_str(&l.ident.to_string());\n }\n\n syn::GenericArgument::Type(t) => {\n let mut ts = TokenStream::new();\n t.to_tokens(&mut ts);\n ident.push_str(&format!(\"{}\", ts));\n }\n\n syn::GenericArgument::Binding(b) => {\n ident.push_str(&b.ident.to_string());\n ident.push('=');\n let mut ts = TokenStream::new();\n b.ty.to_tokens(&mut ts);\n ident.push_str(&format!(\"{}\", ts));\n }\n\n syn::GenericArgument::Constraint(c) => {\n ident.push_str(&c.ident.to_string());\n ident.push_str(\": \");\n let mut ts = TokenStream::new();\n c.bounds.to_tokens(&mut ts);\n ident.push_str(&format!(\"{}\", ts));\n }\n\n syn::GenericArgument::Const(e) => {\n let mut ts = TokenStream::new();\n e.to_tokens(&mut ts);\n ident.push_str(&format!(\"{}\", ts));\n }\n }\n }\n\n ident.push_str(\">\");\n ident\n }\n syn::PathArguments::Parenthesized(args) => {\n let mut ts = TokenStream::new();\n args.to_tokens(&mut ts);\n ident.push_str(&format!(\"{}\", ts));\n ident\n }\n }\n })\n .collect::<Vec<String>>()\n .join(\"::\")\n }\n}\n\npub trait AttrExt {\n fn meta(&self) -> Result<Meta>;\n}\n\nimpl AttrExt for Attribute {\n fn meta(&self) -> Result<Meta> {\n let parser = |input: ParseStream| parse_meta_after_path(self.path.clone(), input);\n\n parse::Parser::parse2(parser, self.tokens.clone())\n }\n}\n\n#[derive(Debug, Clone, PartialEq)]\npub enum Meta {\n Path(syn::Path),\n List(MetaList),\n NameValue(MetaNameValue),\n}\n\nimpl Meta {\n pub fn path(&self) -> &Path {\n match self {\n Meta::Path(meta) => meta,\n Meta::List(meta) => &meta.path,\n Meta::NameValue(meta) => &meta.path,\n }\n }\n\n pub fn is<S>(&self, path: S) -> bool\n where\n S: AsRef<str>,\n {\n match self.path().single_ident() {\n None => false,\n Some(i) => {\n let actual = i.to_string();\n &actual == path.as_ref()\n }\n }\n }\n}\n\n#[derive(Debug, Clone, PartialEq)]\npub struct MetaList {\n pub path: syn::Path,\n pub paren_token: syn::token::Paren,\n pub nested: syn::punctuated::Punctuated<NestedMeta, syn::token::Comma>,\n}\n\nimpl IntoIterator for MetaList {\n type Item = <syn::punctuated::Punctuated<NestedMeta, syn::token::Comma> as IntoIterator>::Item;\n type IntoIter =\n <syn::punctuated::Punctuated<NestedMeta, syn::token::Comma> as IntoIterator>::IntoIter;\n\n #[inline]\n fn into_iter(self) -> Self::IntoIter {\n self.nested.into_iter()\n }\n}\n\nimpl<'a> IntoIterator for &'a MetaList {\n type Item =\n <&'a syn::punctuated::Punctuated<NestedMeta, syn::token::Comma> as IntoIterator>::Item;\n type IntoIter =\n <&'a syn::punctuated::Punctuated<NestedMeta, syn::token::Comma> as IntoIterator>::IntoIter;\n\n #[inline]\n fn into_iter(self) -> Self::IntoIter {\n (&self.nested).into_iter()\n }\n}\n\n#[derive(Debug, Clone, PartialEq)]\npub enum NestedMeta {\n \n \n Meta(Meta),\n\n \n Literal(syn::Lit),\n}\n\n#[derive(Debug, Clone, PartialEq)]\npub struct MetaNameValue {\n pub path: syn::Path,\n pub eq_token: syn::token::Eq,\n pub val: MetaValue,\n}\n\n#[derive(Debug, Clone, PartialEq)]\npub enum MetaValue {\n Path(syn::Path),\n Literal(syn::Lit),\n}\n\nimpl Parse for MetaValue {\n fn parse(input: ParseStream) -> Result<Self> {\n let ahead = input.fork();\n\n if ahead.call(Path::parse).is_ok() {\n input.parse().map(MetaValue::Path)\n } else if ahead.call(Lit::parse).is_ok() {\n input.parse().map(MetaValue::Literal)\n } else {\n Err(input.error(\"expected path or literal\"))\n }\n }\n}\n\nimpl Parse for Meta {\n fn parse(input: ParseStream) -> Result<Self> {\n let path = input.call(Path::parse)?;\n parse_meta_after_path(path, input)\n }\n}\n\nimpl Parse for MetaList {\n fn parse(input: ParseStream) -> Result<Self> {\n let path = input.call(Path::parse)?;\n parse_meta_list_after_path(path, input)\n }\n}\n\nimpl Parse for MetaNameValue {\n fn parse(input: ParseStream) -> Result<Self> {\n let path = input.call(Path::parse)?;\n parse_meta_name_value_after_path(path, input)\n }\n}\n\nimpl Parse for NestedMeta {\n fn parse(input: ParseStream) -> Result<Self> {\n let ahead = input.fork();\n\n if ahead.peek(Lit) && !(ahead.peek(LitBool) && ahead.peek2(Token![=])) {\n input.parse().map(NestedMeta::Literal)\n } else if ahead.call(Path::parse).is_ok() {\n input.parse().map(NestedMeta::Meta)\n } else {\n Err(input.error(\"expected path or literal\"))\n }\n }\n}\n\nfn parse_meta_after_path(path: Path, input: ParseStream) -> Result<Meta> {\n if input.peek(token::Paren) {\n parse_meta_list_after_path(pa"},"suffix":{"kind":"string","value":"} else {\n Ok(Meta::Path(path))\n }\n}\n\nfn parse_meta_list_after_path(path: Path, input: ParseStream) -> Result<MetaList> {\n let content;\n Ok(MetaList {\n path: path,\n paren_token: parenthesized!(content in input),\n nested: content.parse_terminated(NestedMeta::parse)?,\n })\n}\n\nfn parse_meta_name_value_after_path(path: Path, input: ParseStream) -> Result<MetaNameValue> {\n Ok(MetaNameValue {\n path: path,\n eq_token: input.parse()?,\n val: input.parse()?,\n })\n}\n\nimpl ToTokens for MetaValue {\n fn to_tokens(&self, tokens: &mut TokenStream) {\n match self {\n MetaValue::Literal(l) => l.to_tokens(tokens),\n MetaValue::Path(p) => p.to_tokens(tokens),\n }\n }\n}\n\nimpl ToTokens for MetaNameValue {\n fn to_tokens(&self, tokens: &mut TokenStream) {\n self.path.to_tokens(tokens);\n self.eq_token.to_tokens(tokens);\n self.val.to_tokens(tokens);\n }\n}\n\nimpl ToTokens for NestedMeta {\n fn to_tokens(&self, tokens: &mut TokenStream) {\n match self {\n NestedMeta::Meta(meta) => meta.to_tokens(tokens),\n NestedMeta::Literal(lit) => lit.to_tokens(tokens),\n }\n }\n}\n\nimpl ToTokens for MetaList {\n fn to_tokens(&self, tokens: &mut TokenStream) {\n self.path.to_tokens(tokens);\n self.paren_token.surround(tokens, |tokens| {\n self.nested.to_tokens(tokens);\n })\n }\n}\n\nimpl ToTokens for Meta {\n fn to_tokens(&self, tokens: &mut TokenStream) {\n match self {\n Meta::Path(path) => path.to_tokens(tokens),\n Meta::List(list) => list.to_tokens(tokens),\n Meta::NameValue(nv) => nv.to_tokens(tokens),\n }\n }\n}\n\n#[cfg(test)]\nmod test {\n use super::*;\n\n #[test]\n pub fn derive_test() {\n let input: syn::ItemStruct = parse_quote! { #[evitable::from = ::std::io::Error] struct Foo; };\n let attr = &input.attrs[0];\n let meta = attr.meta().unwrap();\n let path_str = format!(\"{}\", meta.path().into_token_stream());\n println!(\"{:?}\", meta);\n assert_eq!(path_str, \"evitable :: from\");\n }\n}\n"},"middle":{"kind":"string","value":"th, input).map(Meta::List)\n } else if input.peek(Token![=]) {\n parse_meta_name_value_after_path(path, input).map(Meta::NameValue)\n "},"strategy":{"kind":"string","value":"function_block-random_span"},"context_items":{"kind":"list like","value":[{"content":"pub fn assert_trait_impl(ty: &Type, trait_path: &Path, tokens: &mut TokenStream) {\n\n ToTokens::to_tokens(&TraitAssertion { ty, trait_path }, tokens)\n\n}\n","file_path":"evitable-derive-core/src/trait_assert.rs","rank":0,"score":249387.9298914886},{"content":"pub fn derive_evitable(meta: &TokenStream, input: &mut DeriveInput) -> TokenStream {\n\n let mut cloned = input.clone();\n\n remove_evitable_attrs(input);\n\n\n\n if !meta.is_empty() {\n\n let meta_attr_quote = quote! {#[evitable(#meta)]};\n\n let parser = Attribute::parse_outer;\n\n let attr = match parser.parse2(meta_attr_quote) {\n\n Ok(val) => val[0].clone(),\n\n Err(err) => return err.to_compile_error(),\n\n };\n\n\n\n add_attribute(&mut cloned, attr);\n\n }\n\n\n\n let error_type = ErrorType::from_derive_input(&cloned);\n\n match error_type {\n\n Ok(val) => quote! { #input #val },\n\n Err(err) => err.write_errors(),\n\n }\n\n}\n","file_path":"evitable-derive-core/src/lib.rs","rank":2,"score":204512.65009277826},{"content":"type DeriveInputShape = String;\n","file_path":"syn-meta-ext/src/error/kind.rs","rank":5,"score":188495.89711632984},{"content":"enum IntoIterEnum {\n\n Single(iter::Once<Error>),\n\n Multiple(vec::IntoIter<Error>),\n\n}\n\n\n\nimpl Iterator for IntoIterEnum {\n\n type Item = Error;\n\n\n\n fn next(&mut self) -> Option<Self::Item> {\n\n match *self {\n\n IntoIterEnum::Single(ref mut content) => content.next(),\n\n IntoIterEnum::Multiple(ref mut content) => content.next(),\n\n }\n\n }\n\n}\n\n\n\n/// An iterator that moves out of an `Error`.\n\npub struct IntoIter {\n\n inner: IntoIterEnum,\n\n}\n","file_path":"syn-meta-ext/src/error/mod.rs","rank":6,"score":188206.99590330492},{"content":"pub trait MapFields<T> {\n\n fn try_map_fields<E, U>(self, f: impl Fn(T) -> Result<U, E>) -> Result<Fields<U>, E>;\n\n fn map_fields<U>(self, f: impl Fn(T) -> U) -> Fields<U>\n\n where\n\n Self: Sized,\n\n {\n\n self\n\n .try_map_fields(|field| Result::<_, Unreachable>::Ok(f(field)))\n\n .unwrap()\n\n }\n\n}\n\n\n\nimpl MapFields<syn::Field> for syn::Fields {\n\n fn try_map_fields<E, U>(self, f: impl Fn(syn::Field) -> Result<U, E>) -> Result<Fields<U>, E> {\n\n match self {\n\n syn::Fields::Named(fields) => {\n\n let mut v = Vec::with_capacity(fields.named.len());\n\n for field in fields.named {\n\n let ident = field.ident.clone().unwrap();\n\n v.push((ident, f(field)?))\n","file_path":"syn-meta-ext/src/ast.rs","rank":7,"score":187749.2424792518},{"content":"#[proc_macro_attribute]\n\npub fn evitable(meta: TokenStream, input: TokenStream) -> TokenStream {\n\n derive_evitable(&parse_macro_input!(meta), &mut parse_macro_input!(input)).into()\n\n}\n","file_path":"evitable-derive/src/lib.rs","rank":9,"score":178483.1065565417},{"content":"type MetaFormat = String;\n\n\n\n#[derive(Debug)]\n\n#[cfg_attr(test, derive(Clone, PartialEq, Eq))]\n\npub(super) enum ErrorKind {\n\n /// An arbitrary error message.\n\n Custom(String),\n\n Parse(String),\n\n DuplicateField(FieldName),\n\n MissingField(FieldName),\n\n UnsupportedShape(DeriveInputShape),\n\n UnknownField(ErrorUnknownField),\n\n UnexpectedFormat(MetaFormat),\n\n UnexpectedType(String),\n\n UnknownValue(String),\n\n TooFewItems(usize),\n\n TooManyItems(usize),\n\n /// A set of errors.\n\n Multiple(Vec<Error>),\n\n\n","file_path":"syn-meta-ext/src/error/kind.rs","rank":10,"score":175908.02873465937},{"content":"type FieldName = String;\n","file_path":"syn-meta-ext/src/error/kind.rs","rank":11,"score":167611.9473773053},{"content":"/// Creates an instance by parsing an entire proc-macro `derive` input,\n\n/// including the, identity, generics, and visibility of the type.\n\n///\n\n/// This trait should either be derived or manually implemented by a type\n\n/// in the proc macro crate which is directly using `darling`. It is unlikely\n\n/// that these implementations will be reusable across crates.\n\npub trait FromDeriveInput: Sized {\n\n /// Create an instance from `syn::DeriveInput`, or return an error.\n\n fn from_derive_input(input: &DeriveInput) -> Result<Self> {\n\n match &input.data {\n\n Data::Union(d) => {\n\n Self::from_union(&input.attrs, &input.vis, &input.ident, &input.generics, d)\n\n }\n\n Data::Enum(d) => Self::from_enum(&input.attrs, &input.vis, &input.ident, &input.generics, d),\n\n Data::Struct(d) => {\n\n Self::from_struct(&input.attrs, &input.vis, &input.ident, &input.generics, d)\n\n }\n\n }\n\n }\n\n\n\n fn from_union(\n\n attrs: &Vec<Attribute>,\n\n vis: &Visibility,\n\n ident: &Ident,\n\n generics: &Generics,\n\n input: &DataUnion,\n","file_path":"syn-meta-ext/src/from_derive_input.rs","rank":12,"score":166614.13135233315},{"content":"fn add_attribute(input: &mut DeriveInput, attr: Attribute) {\n\n input.attrs.push(attr);\n\n}\n\n\n","file_path":"evitable-derive-core/src/lib.rs","rank":14,"score":154639.2932403677},{"content":"pub trait FromMeta: Sized {\n\n fn from_nested_meta(item: &NestedMeta) -> Result<Self> {\n\n (match item {\n\n NestedMeta::Literal(lit) => Self::from_lit(lit),\n\n NestedMeta::Meta(mi) => match mi {\n\n Meta::Path(p) => Self::from_path(p),\n\n Meta::NameValue(_) => Err(Error::unexpected_type(\"name value\").with_span(item)),\n\n Meta::List(_) => Err(Error::unexpected_type(\"list\").with_span(item)),\n\n },\n\n })\n\n .map_err(|e| e.with_span(item))\n\n }\n\n\n\n /// Create an instance from a `syn::Meta` by dispatching to the format-appropriate\n\n /// trait function. This generally should not be overridden by implementers.\n\n ///\n\n /// # Error Spans\n\n /// If this method is overridden and can introduce errors that weren't passed up from\n\n /// other `from_meta` calls, the override must call `with_span` on the error using the\n\n /// `item` to make sure that the emitted diagnostic points to the correct location in\n","file_path":"syn-meta-ext/src/from_meta.rs","rank":15,"score":151556.0837991106},{"content":"/// Creates an instance by parsing an individual field and its attributes.\n\npub trait FromField: Sized {\n\n fn from_field(field: &Field) -> Result<Self>;\n\n}\n\n\n\nimpl FromField for () {\n\n fn from_field(_: &Field) -> Result<Self> {\n\n Ok(())\n\n }\n\n}\n\n\n\nimpl FromField for Field {\n\n fn from_field(field: &Field) -> Result<Self> {\n\n Ok(field.clone())\n\n }\n\n}\n\n\n\nimpl FromField for syn::Type {\n\n fn from_field(field: &Field) -> Result<Self> {\n\n Ok(field.ty.clone())\n\n }\n","file_path":"syn-meta-ext/src/from_field.rs","rank":16,"score":139226.85527159402},{"content":"/// Creates an instance from a specified `syn::Variant`.\n\npub trait FromVariant: Sized {\n\n /// Create an instance from `syn::Variant`, or return an error.\n\n fn from_variant(variant: &Variant) -> Result<Self>;\n\n}\n\n\n\nimpl FromVariant for () {\n\n fn from_variant(_: &Variant) -> Result<Self> {\n\n Ok(())\n\n }\n\n}\n\n\n\nimpl FromVariant for Variant {\n\n fn from_variant(variant: &Variant) -> Result<Self> {\n\n Ok(variant.clone())\n\n }\n\n}\n\n\n\nimpl FromVariant for syn::Ident {\n\n fn from_variant(variant: &Variant) -> Result<Self> {\n\n Ok(variant.ident.clone())\n\n }\n\n}\n\n\n\nimpl FromVariant for Vec<syn::Attribute> {\n\n fn from_variant(variant: &Variant) -> Result<Self> {\n\n Ok(variant.attrs.clone())\n\n }\n\n}\n","file_path":"syn-meta-ext/src/from_variant.rs","rank":17,"score":139226.82992736678},{"content":"enum Unreachable {}\n\n\n\nimpl std::fmt::Debug for Unreachable {\n\n fn fmt(&self, f: &mut std::fmt::Formatter) -> std::fmt::Result {\n\n unreachable!()\n\n }\n\n}\n\n\n\npub enum Fields<T> {\n\n Named(Vec<(Ident, T)>),\n\n Unnamed(Vec<(usize, T)>),\n\n Unit,\n\n}\n\n\n\nimpl<T> Fields<T> {\n\n pub fn iter<'a>(&'a self) -> FieldsIter<'a, T> {\n\n match self {\n\n Fields::Named(v) => FieldsIter::Named(v.iter()),\n\n Fields::Unnamed(v) => FieldsIter::Unnamed(v.iter()),\n\n Fields::Unit => FieldsIter::Unit,\n\n }\n\n }\n\n}\n\n\n","file_path":"syn-meta-ext/src/ast.rs","rank":18,"score":134308.64519629756},{"content":"#[cfg(feature = \"suggestions\")]\n\nfn did_you_mean<'a, T, I>(field: &str, alternates: I) -> Option<String>\n\nwhere\n\n T: AsRef<str> + 'a,\n\n I: IntoIterator<Item = &'a T>,\n\n{\n\n let mut candidate: Option<(f64, &str)> = None;\n\n for pv in alternates {\n\n let confidence = ::strsim::jaro_winkler(field, pv.as_ref());\n\n if confidence > 0.8 && (candidate.is_none() || (candidate.as_ref().unwrap().0 < confidence)) {\n\n candidate = Some((confidence, pv.as_ref()));\n\n }\n\n }\n\n match candidate {\n\n None => None,\n\n Some((_, candidate)) => Some(candidate.into()),\n\n }\n\n}\n\n\n","file_path":"syn-meta-ext/src/error/kind.rs","rank":19,"score":132210.81455122953},{"content":"#[cfg(not(feature = \"suggestions\"))]\n\nfn did_you_mean<'a, T, I>(_field: &str, _alternates: I) -> Option<String>\n\nwhere\n\n T: AsRef<str> + 'a,\n\n I: IntoIterator<Item = &'a T>,\n\n{\n\n None\n\n}\n","file_path":"syn-meta-ext/src/error/kind.rs","rank":20,"score":132210.81455122953},{"content":"fn remove_evitable_attrs(input: &mut DeriveInput) {\n\n input.visit(&|attrs| {\n\n let a = std::mem::replace(attrs, Vec::new());\n\n let a = a\n\n .into_iter()\n\n .filter(|attr| attr.meta().map(|m| !m.is(\"evitable\")).unwrap_or(true))\n\n .collect();\n\n std::mem::replace(attrs, a);\n\n });\n\n}\n\n\n","file_path":"evitable-derive-core/src/lib.rs","rank":21,"score":131801.23470275788},{"content":"/// Trait for \"error kinds\". An `ErrorKind` enum is generated for\n\n/// every `#[evitable]` type which typically just contains\n\n/// variants for each error variant (or just a single variant in\n\n/// case of error structs).\n\npub trait EvitableErrorKind: PartialEq + Display {}\n\n\n","file_path":"evitable/src/lib.rs","rank":22,"score":126392.02165136699},{"content":" }\n\n}\n\n\n\nimpl Error {\n\n /// Create a new error about a literal string that doesn't match a set of known\n\n /// or permissible values. This function can be made public if the API proves useful\n\n /// beyond impls for `syn` types.\n\n pub(crate) fn unknown_lit_str_value(value: &LitStr) -> Self {\n\n Error::unknown_value(&value.value()).with_span(value)\n\n }\n\n}\n\n\n\n/// Error instance methods\n\nimpl Error {\n\n /// Check if this error is associated with a span in the token stream.\n\n pub fn has_span(&self) -> bool {\n\n self.span.is_some()\n\n }\n\n\n\n /// Tie a span to the error if none is already present. This is used in `darling::FromMeta`\n","file_path":"syn-meta-ext/src/error/mod.rs","rank":23,"score":109294.36814373499},{"content":"use proc_macro2::{Span, TokenStream};\n\nuse std::error::Error as StdError;\n\nuse std::fmt;\n\nuse std::iter::{self, Iterator};\n\nuse std::string::ToString;\n\nuse std::vec;\n\nuse syn::spanned::Spanned;\n\nuse syn::{Lit, LitStr};\n\n\n\nmod kind;\n\n\n\nuse self::kind::{ErrorKind, ErrorUnknownField};\n\n\n\n/// An alias of `Result` specific to attribute parsing.\n\npub type Result<T> = ::std::result::Result<T, Error>;\n\n\n\n/// An error encountered during attribute parsing.\n\n///\n\n/// Given that most errors darling encounters represent code bugs in dependent crates,\n\n/// the internal structure of the error is deliberately opaque.\n","file_path":"syn-meta-ext/src/error/mod.rs","rank":24,"score":109289.22971890547},{"content":" /// Creates a new error for a field which has an unexpected literal type.\n\n pub fn unexpected_type(ty: &str) -> Self {\n\n Error::new(ErrorKind::UnexpectedType(ty.into()))\n\n }\n\n\n\n /// Creates a new error for a field which has an unexpected literal type. This will automatically\n\n /// extract the literal type name from the passed-in `Lit` and set the span to encompass only the\n\n /// literal value.\n\n pub fn unexpected_lit_type(lit: &Lit) -> Self {\n\n Error::unexpected_type(match *lit {\n\n Lit::Str(_) => \"string\",\n\n Lit::ByteStr(_) => \"byte string\",\n\n Lit::Byte(_) => \"byte\",\n\n Lit::Char(_) => \"char\",\n\n Lit::Int(_) => \"int\",\n\n Lit::Float(_) => \"float\",\n\n Lit::Bool(_) => \"bool\",\n\n Lit::Verbatim(_) => \"verbatim\",\n\n })\n\n .with_span(lit)\n","file_path":"syn-meta-ext/src/error/mod.rs","rank":25,"score":109288.48560503374},{"content":" /// and other traits to attach errors to the most specific possible location in the input\n\n /// source code.\n\n ///\n\n /// All `darling`-built impls, either from the crate or from the proc macro, will call this\n\n /// when appropriate during parsing, so it should not be necessary to call this unless you have\n\n /// overridden:\n\n ///\n\n /// * `FromMeta::from_meta`\n\n /// * `FromMeta::from_nested_meta`\n\n /// * `FromMeta::from_value`\n\n pub fn with_span<T: Spanned>(mut self, node: &T) -> Self {\n\n if !self.has_span() {\n\n self.span = Some(node.span());\n\n }\n\n\n\n self\n\n }\n\n\n\n /// Recursively converts a tree of errors to a flattened list.\n\n pub fn flatten(self) -> Self {\n","file_path":"syn-meta-ext/src/error/mod.rs","rank":26,"score":109286.70991709961},{"content":"\n\nimpl Iterator for IntoIter {\n\n type Item = Error;\n\n\n\n fn next(&mut self) -> Option<Error> {\n\n self.inner.next()\n\n }\n\n}\n\n\n\n#[cfg(test)]\n\nmod tests {\n\n use super::Error;\n\n\n\n #[test]\n\n fn flatten_noop() {\n\n let err = Error::duplicate_field(\"hello\").at(\"world\");\n\n assert_eq!(err.clone().flatten(), err);\n\n }\n\n\n\n #[test]\n","file_path":"syn-meta-ext/src/error/mod.rs","rank":27,"score":109284.22914422497},{"content":"\n\n /// Gets the location slice.\n\n #[cfg(test)]\n\n pub(crate) fn location(&self) -> Vec<&str> {\n\n self.locations.iter().map(|i| i.as_str()).collect()\n\n }\n\n\n\n /// Write this error and any children as compile errors into a `TokenStream` to\n\n /// be returned by the proc-macro.\n\n ///\n\n /// Return these tokens unmodified to avoid disturbing the attached span information.\n\n pub fn write_errors(self) -> TokenStream {\n\n self\n\n .flatten()\n\n .into_iter()\n\n .map(|e| e.single_to_syn_error().to_compile_error())\n\n .collect()\n\n }\n\n\n\n fn single_to_syn_error(self) -> ::syn::Error {\n","file_path":"syn-meta-ext/src/error/mod.rs","rank":28,"score":109284.16084355667},{"content":" /// # Panics\n\n /// This function will panic if `errors.is_empty() == true`.\n\n pub fn multiple(mut errors: Vec<Error>) -> Self {\n\n if errors.len() > 1 {\n\n Error::new(ErrorKind::Multiple(errors))\n\n } else if errors.len() == 1 {\n\n errors\n\n .pop()\n\n .expect(\"Error array of length 1 has a first item\")\n\n } else {\n\n panic!(\"Can't deal with 0 errors\")\n\n }\n\n }\n\n}\n\n\n\nimpl From<syn::Error> for Error {\n\n fn from(e: syn::Error) -> Self {\n\n let mut ret = Error::new(ErrorKind::Parse(e.to_string()));\n\n ret.span = Some(e.span());\n\n ret\n","file_path":"syn-meta-ext/src/error/mod.rs","rank":29,"score":109283.05848631788},{"content":"\n\nimpl IntoIterator for Error {\n\n type Item = Error;\n\n type IntoIter = IntoIter;\n\n\n\n fn into_iter(self) -> IntoIter {\n\n if let ErrorKind::Multiple(errors) = self.kind {\n\n IntoIter {\n\n inner: IntoIterEnum::Multiple(errors.into_iter()),\n\n }\n\n } else {\n\n IntoIter {\n\n inner: IntoIterEnum::Single(iter::once(self)),\n\n }\n\n }\n\n }\n\n}\n\n\n","file_path":"syn-meta-ext/src/error/mod.rs","rank":30,"score":109280.93566049571},{"content":" match self.span {\n\n Some(span) => ::syn::Error::new(span, self.kind),\n\n None => ::syn::Error::new(Span::call_site(), self),\n\n }\n\n }\n\n}\n\n\n\nimpl StdError for Error {\n\n fn description(&self) -> &str {\n\n &self.kind.description()\n\n }\n\n\n\n fn cause(&self) -> Option<&StdError> {\n\n None\n\n }\n\n}\n\n\n\nimpl fmt::Display for Error {\n\n fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {\n\n write!(f, \"{}\", self.kind)?;\n","file_path":"syn-meta-ext/src/error/mod.rs","rank":31,"score":109280.87471236807},{"content":"#[derive(Debug)]\n\n#[cfg_attr(test, derive(Clone))]\n\npub struct Error {\n\n kind: ErrorKind,\n\n locations: Vec<String>,\n\n /// The span to highlight in the emitted diagnostic.\n\n span: Option<Span>,\n\n}\n\n\n\n/// Error creation functions\n\nimpl Error {\n\n pub(self) fn new(kind: ErrorKind) -> Self {\n\n Error {\n\n kind,\n\n locations: Vec::new(),\n\n span: None,\n\n }\n\n }\n\n\n\n /// Creates a new error with a custom message.\n","file_path":"syn-meta-ext/src/error/mod.rs","rank":32,"score":109280.48057118335},{"content":" }\n\n\n\n /// Creates a new error for a value which doesn't match a set of expected literals.\n\n pub fn unknown_value(value: &str) -> Self {\n\n Error::new(ErrorKind::UnknownValue(value.into()))\n\n }\n\n\n\n /// Creates a new error for a list which did not get enough items to proceed.\n\n pub fn too_few_items(min: usize) -> Self {\n\n Error::new(ErrorKind::TooFewItems(min))\n\n }\n\n\n\n /// Creates a new error when a list got more items than it supports. The `max` argument\n\n /// is the largest number of items the receiver could accept.\n\n pub fn too_many_items(max: usize) -> Self {\n\n Error::new(ErrorKind::TooManyItems(max))\n\n }\n\n\n\n /// Bundle a set of multiple errors into a single `Error` instance.\n\n ///\n","file_path":"syn-meta-ext/src/error/mod.rs","rank":33,"score":109280.28622625684},{"content":" /// Creates a new error for a field name that appears in the input but does not correspond to\n\n /// a known attribute. The second argument is the list of known attributes; if a similar name\n\n /// is found that will be shown in the emitted error message.\n\n pub fn unknown_field_with_alts<'a, T, I>(field: &str, alternates: I) -> Self\n\n where\n\n T: AsRef<str> + 'a,\n\n I: IntoIterator<Item = &'a T>,\n\n {\n\n Error::new(ErrorUnknownField::with_alts(field, alternates).into())\n\n }\n\n\n\n /// Creates a new error for a struct or variant that does not adhere to the supported shape.\n\n pub fn unsupported_shape(shape: &str) -> Self {\n\n Error::new(ErrorKind::UnsupportedShape(shape.into()))\n\n }\n\n\n\n pub fn unsupported_format(format: &str) -> Self {\n\n Error::new(ErrorKind::UnexpectedFormat(format.into()))\n\n }\n\n\n","file_path":"syn-meta-ext/src/error/mod.rs","rank":34,"score":109279.68006346026},{"content":" Error::multiple(self.into_vec())\n\n }\n\n\n\n fn into_vec(self) -> Vec<Self> {\n\n if let ErrorKind::Multiple(errors) = self.kind {\n\n let mut flat = Vec::new();\n\n for error in errors {\n\n flat.extend(error.prepend_at(self.locations.clone()).into_vec());\n\n }\n\n\n\n flat\n\n } else {\n\n vec![self]\n\n }\n\n }\n\n\n\n /// Adds a location to the error, such as a field or variant.\n\n /// Locations must be added in reverse order of specificity.\n\n pub fn at<T: fmt::Display>(mut self, location: T) -> Self {\n\n self.locations.insert(0, location.to_string());\n","file_path":"syn-meta-ext/src/error/mod.rs","rank":35,"score":109278.97643753214},{"content":" pub fn custom<T: fmt::Display>(msg: T) -> Self {\n\n Error::new(ErrorKind::Custom(msg.to_string()))\n\n }\n\n\n\n /// Creates a new error for a field that appears twice in the input.\n\n pub fn duplicate_field(name: &str) -> Self {\n\n Error::new(ErrorKind::DuplicateField(name.into()))\n\n }\n\n\n\n /// Creates a new error for a non-optional field that does not appear in the input.\n\n pub fn missing_field(name: &str) -> Self {\n\n Error::new(ErrorKind::MissingField(name.into()))\n\n }\n\n\n\n /// Creates a new error for a field name that appears in the input but does not correspond\n\n /// to a known field.\n\n pub fn unknown_field(name: &str) -> Self {\n\n Error::new(ErrorKind::UnknownField(name.into()))\n\n }\n\n\n","file_path":"syn-meta-ext/src/error/mod.rs","rank":36,"score":109278.15021806167},{"content":" self\n\n }\n\n\n\n /// Gets the number of individual errors in this error.\n\n ///\n\n /// This function never returns `0`, as it's impossible to construct\n\n /// a multi-error from an empty `Vec`.\n\n pub fn len(&self) -> usize {\n\n self.kind.len()\n\n }\n\n\n\n /// Adds a location chain to the head of the error's existing locations.\n\n fn prepend_at(mut self, mut locations: Vec<String>) -> Self {\n\n if !locations.is_empty() {\n\n locations.extend(self.locations);\n\n self.locations = locations;\n\n }\n\n\n\n self\n\n }\n","file_path":"syn-meta-ext/src/error/mod.rs","rank":37,"score":109276.86296661441},{"content":" if !self.locations.is_empty() {\n\n write!(f, \" at {}\", self.locations.join(\"/\"))?;\n\n }\n\n\n\n Ok(())\n\n }\n\n}\n\n\n\n// Don't want to publicly commit to Error supporting equality yet, but\n\n// not having it makes testing very difficult. Note that spans are not\n\n// considered for equality since that would break testing in most cases.\n\n#[cfg(test)]\n\nimpl PartialEq for Error {\n\n fn eq(&self, other: &Self) -> bool {\n\n self.kind == other.kind && self.locations == other.locations\n\n }\n\n}\n\n\n\n#[cfg(test)]\n\nimpl Eq for Error {}\n","file_path":"syn-meta-ext/src/error/mod.rs","rank":38,"score":109276.3561837629},{"content":" fn flatten_simple() {\n\n let err = Error::multiple(vec![\n\n Error::unknown_field(\"hello\").at(\"world\"),\n\n Error::missing_field(\"hell_no\").at(\"world\"),\n\n ])\n\n .at(\"foo\")\n\n .flatten();\n\n\n\n assert!(err.location().is_empty());\n\n\n\n let mut err_iter = err.into_iter();\n\n\n\n let first = err_iter.next();\n\n assert!(first.is_some());\n\n assert_eq!(first.unwrap().location(), vec![\"foo\", \"world\"]);\n\n\n\n let second = err_iter.next();\n\n assert!(second.is_some());\n\n\n\n assert_eq!(second.unwrap().location(), vec![\"foo\", \"world\"]);\n","file_path":"syn-meta-ext/src/error/mod.rs","rank":39,"score":109272.51742404282},{"content":"\n\n assert!(err_iter.next().is_none());\n\n }\n\n\n\n #[test]\n\n fn len_single() {\n\n let err = Error::duplicate_field(\"hello\");\n\n assert_eq!(1, err.len());\n\n }\n\n\n\n #[test]\n\n fn len_multiple() {\n\n let err = Error::multiple(vec![\n\n Error::duplicate_field(\"hello\"),\n\n Error::missing_field(\"hell_no\"),\n\n ]);\n\n assert_eq!(2, err.len());\n\n }\n\n\n\n #[test]\n","file_path":"syn-meta-ext/src/error/mod.rs","rank":40,"score":109272.22067807186},{"content":" fn len_nested() {\n\n let err = Error::multiple(vec![\n\n Error::duplicate_field(\"hello\"),\n\n Error::multiple(vec![\n\n Error::duplicate_field(\"hi\"),\n\n Error::missing_field(\"bye\"),\n\n Error::multiple(vec![Error::duplicate_field(\"whatsup\")]),\n\n ]),\n\n ]);\n\n\n\n assert_eq!(4, err.len());\n\n }\n\n}\n","file_path":"syn-meta-ext/src/error/mod.rs","rank":41,"score":109270.68412269409},{"content":"struct ErrorType {\n\n ident: Ident,\n\n prefix: Option<String>,\n\n vis: Visibility,\n\n generics: Generics,\n\n data: ErrorData,\n\n attrs: ErrorTypeAttrs,\n\n mod_name: Ident,\n\n mod_vis: Visibility,\n\n impls_from: Vec<from::FromImplFor>,\n\n}\n\n\n","file_path":"evitable-derive-core/src/lib.rs","rank":42,"score":106005.00863828407},{"content":"/// Trait implemented for all error types generated by `#[evitable]`.\n\n/// Allows for creating new errors from the [ErrorContext](ErrorContext), and\n\n/// allows getting the error kind.\n\npub trait EvitableError: StdError + Sized + Send + Sync + 'static {\n\n /// Error kind type. Generated by `#[evitable]`.\n\n type Kind: EvitableErrorKind;\n\n\n\n /// Error context type. The type marked by `#[evitable]`.\n\n type Context: ErrorContext<Error = Self, Kind = Self::Kind>;\n\n\n\n /// Create a new error instance, based on an error context and an optional source error.\n\n /// Instead of using this directly, see [from_error_context](EvitableError::from_error_context) when\n\n /// wanting to create error instances with source errors, and [from_context](EvitableError::from_context)\n\n /// when not. Derived implementations of this trait also implements `From<ErrorContext>`, so using\n\n /// [from](std::convert::From::from) or [into](std::convert::Into::into) is also an option.\n\n ///\n\n /// # Arguments\n\n ///\n\n /// * `context` - Error context\n\n /// * `source` - Optional error source\n\n ///\n\n /// # Example\n\n ///\n","file_path":"evitable/src/lib.rs","rank":43,"score":105666.56863991338},{"content":"/// Extension trait for option and result types for easy convertion\n\n/// to evitable errors.\n\npub trait OptionExt<T, C: ErrorContext> {\n\n /// Convert to a [Result](std::result::Result) where ther error\n\n /// case is constructed from the given context factory.\n\n ///\n\n /// # Arguments\n\n ///\n\n /// * `f` - Error context factory\n\n ///\n\n /// # Example\n\n ///\n\n /// ```rust\n\n ///# use evitable::*;\n\n ///# use std::io;\n\n /// #[evitable(description = \"Error\")]\n\n /// pub struct Context(u8);\n\n ///\n\n /// // Later\n\n ///# fn main() {\n\n /// let option_error: Option<u8> = None;\n\n /// let io_error: std::io::Result<u8> = Err(io::Error::from(io::ErrorKind::NotFound));\n","file_path":"evitable/src/lib.rs","rank":44,"score":105408.51194101041},{"content":"struct ErrorTypeAttrs {\n\n error_type_name: TypeAliasName,\n\n result_type_name: TypeAliasName,\n\n kind_type_name: TypeAliasName,\n\n}\n\n\n\nimpl ErrorTypeAttrs {\n\n fn from_attrs(attrs: &mut Attrs) -> Result<Self> {\n\n let error_type_name = attrs.get_optional(\"error_type\")?.unwrap_or_default();\n\n let result_type_name = attrs.get_optional(\"result_type\")?.unwrap_or_default();\n\n let kind_type_name = attrs.get_optional(\"kind_type\")?.unwrap_or_default();\n\n\n\n Ok(Self {\n\n error_type_name,\n\n result_type_name,\n\n kind_type_name,\n\n })\n\n }\n\n}\n\n\n","file_path":"evitable-derive-core/src/lib.rs","rank":45,"score":103089.4433668907},{"content":"#[test]\n\npub fn test_both() {\n\n let _ = NotFoundError::from(NotFoundContext);\n\n let _ = BadRequestError::from(BadRequestContext);\n\n}\n","file_path":"evitable/tests/multiple.rs","rank":46,"score":99009.19936339183},{"content":"/// Error context trait, typically used with `#[evitable]`.\n\n/// This produces Error and ErrorKind types for the given context.\n\npub trait ErrorContext: Display + Debug + Sized + Send + Sync + 'static {\n\n /// Associated error kind enum.\n\n type Kind: EvitableErrorKind;\n\n\n\n /// Associated error struct.\n\n type Error: EvitableError<Context = Self, Kind = Self::Kind>;\n\n\n\n /// Get the error kind.\n\n ///\n\n /// # Example\n\n ///\n\n /// ```rust\n\n ///# use evitable::*;\n\n /// #[evitable]\n\n /// pub enum Context {\n\n /// #[evitable(description(\"Io error ({})\", 0))]\n\n /// Io(u8),\n\n ///\n\n /// #[evitable(description = \"Fmt error\")]\n\n /// Fmt,\n","file_path":"evitable/src/lib.rs","rank":47,"score":95056.84122362596},{"content":"/// Extension trait for result types (and other types carrying\n\n/// errors with them).\n\npub trait ResultExt<T, E, C: ErrorContext>: OptionExt<T, C> {\n\n /// Convert to a [Result](std::result::Result) where ther error\n\n /// case is constructed from the given context factory which also\n\n /// accepts a reference to the original error.\n\n ///\n\n /// # Arguments\n\n ///\n\n /// * `f` - Error context factory\n\n ///\n\n /// # Example\n\n ///\n\n /// ```rust\n\n ///# use evitable::*;\n\n ///# use std::io;\n\n /// #[evitable(description = \"Error\")]\n\n /// pub struct Context(String);\n\n ///\n\n /// // Later\n\n ///# fn main() {\n\n /// let io_error: std::io::Result<u8> = Err(io::Error::from(io::ErrorKind::NotFound));\n","file_path":"evitable/src/lib.rs","rank":48,"score":87674.632856866},{"content":"struct ErrorStruct {\n\n description: ResolvedDescription,\n\n from_impls: Vec<FromImpl>,\n\n fields: Fields<ErrorField>,\n\n}\n\n\n","file_path":"evitable-derive-core/src/lib.rs","rank":49,"score":87008.85097153844},{"content":" trait AssertImpl {\n\n #[inline]\n\n fn assert() {}\n\n }\n\n\n\n impl<T: #trait_path> AssertImpl for AssertHelper<T> {}\n\n AssertHelper::<#ty>::assert();\n\n }})\n\n }\n\n}\n\n\n","file_path":"evitable-derive-core/src/trait_assert.rs","rank":50,"score":85102.57232874782},{"content":"\n\nimpl<'a, T> Iterator for FieldsIter<'a, T> {\n\n type Item = (Option<&'a Ident>, &'a T);\n\n\n\n fn next(&mut self) -> Option<Self::Item> {\n\n match self {\n\n FieldsIter::Named(iter) => match iter.next() {\n\n None => None,\n\n Some(tpl) => Some((Some(&tpl.0), &tpl.1)),\n\n },\n\n\n\n FieldsIter::Unnamed(iter) => match iter.next() {\n\n None => None,\n\n Some((_, val)) => Some((None, val)),\n\n },\n\n\n\n FieldsIter::Unit => None,\n\n }\n\n }\n\n}\n","file_path":"syn-meta-ext/src/ast.rs","rank":51,"score":84879.75812027688},{"content":" fn try_map_fields<E, U>(\n\n self,\n\n f: impl Fn(&'a syn::Field) -> Result<U, E>,\n\n ) -> Result<Fields<U>, E> {\n\n match self {\n\n syn::Fields::Named(fields) => {\n\n let mut v = Vec::with_capacity(fields.named.len());\n\n for field in &fields.named {\n\n let ident = field.ident.clone().unwrap();\n\n v.push((ident, f(field)?))\n\n }\n\n\n\n Ok(Fields::Named(v))\n\n }\n\n\n\n syn::Fields::Unnamed(fields) => {\n\n let mut v = Vec::with_capacity(fields.unnamed.len());\n\n for (index, field) in fields.unnamed.iter().enumerate() {\n\n v.push((index, f(field)?))\n\n }\n","file_path":"syn-meta-ext/src/ast.rs","rank":52,"score":84873.2519372441},{"content":"\n\n Ok(Fields::Unnamed(v))\n\n }\n\n\n\n syn::Fields::Unit => Ok(Fields::Unit),\n\n }\n\n }\n\n}\n\n\n\nimpl<T> MapFields<T> for Fields<T> {\n\n fn try_map_fields<E, U>(self, f: impl Fn(T) -> Result<U, E>) -> Result<Fields<U>, E> {\n\n match self {\n\n Fields::Named(fields) => {\n\n let mut v = Vec::with_capacity(fields.len());\n\n for field in fields {\n\n v.push((field.0, f(field.1)?))\n\n }\n\n\n\n Ok(Fields::Named(v))\n\n }\n","file_path":"syn-meta-ext/src/ast.rs","rank":53,"score":84867.65431113541},{"content":" }\n\n\n\n Ok(Fields::Named(v))\n\n }\n\n\n\n syn::Fields::Unnamed(fields) => {\n\n let mut v = Vec::with_capacity(fields.unnamed.len());\n\n for (index, field) in fields.unnamed.into_iter().enumerate() {\n\n v.push((index, f(field)?))\n\n }\n\n\n\n Ok(Fields::Unnamed(v))\n\n }\n\n\n\n syn::Fields::Unit => Ok(Fields::Unit),\n\n }\n\n }\n\n}\n\n\n\nimpl<'a> MapFields<&'a syn::Field> for &'a syn::Fields {\n","file_path":"syn-meta-ext/src/ast.rs","rank":54,"score":84866.67098198408},{"content":"use syn::Ident;\n\n\n","file_path":"syn-meta-ext/src/ast.rs","rank":55,"score":84865.37437331474},{"content":"\n\n Fields::Unnamed(fields) => {\n\n let mut v = Vec::with_capacity(fields.len());\n\n for (index, field) in fields {\n\n v.push((index, f(field)?))\n\n }\n\n\n\n Ok(Fields::Unnamed(v))\n\n }\n\n\n\n Fields::Unit => Ok(Fields::Unit),\n\n }\n\n }\n\n}\n\n\n\npub enum FieldsIter<'a, T> {\n\n Named(std::slice::Iter<'a, (Ident, T)>),\n\n Unnamed(std::slice::Iter<'a, (usize, T)>),\n\n Unit,\n\n}\n","file_path":"syn-meta-ext/src/ast.rs","rank":56,"score":84864.20212841187},{"content":"struct TraitAssertion<'a> {\n\n ty: &'a Type,\n\n trait_path: &'a Path,\n\n}\n\n\n\nimpl<'a> ToTokens for TraitAssertion<'a> {\n\n fn to_tokens(&self, tokens: &mut TokenStream) {\n\n let ty = &self.ty;\n\n let trait_path = &self.trait_path;\n\n tokens.extend(quote! {{\n\n #[allow(dead_code)]\n\n struct AssertHelper<T>(::std::marker::PhantomData<*const T>);\n","file_path":"evitable-derive-core/src/trait_assert.rs","rank":57,"score":83531.04107411475},{"content":"use super::error::{Error, Result};\n\nuse proc_macro2::TokenStream;\n\nuse syn::{\n\n Attribute, Data, DataEnum, DataStruct, DataUnion, DeriveInput, Generics, Ident, Visibility,\n\n};\n\n\n\n/// Creates an instance by parsing an entire proc-macro `derive` input,\n\n/// including the, identity, generics, and visibility of the type.\n\n///\n\n/// This trait should either be derived or manually implemented by a type\n\n/// in the proc macro crate which is directly using `darling`. It is unlikely\n\n/// that these implementations will be reusable across crates.\n","file_path":"syn-meta-ext/src/from_derive_input.rs","rank":58,"score":81553.14769772442},{"content":" ) -> Result<Self> {\n\n Err(Error::unsupported_shape(\"union\"))\n\n }\n\n\n\n fn from_enum(\n\n attrs: &Vec<Attribute>,\n\n vis: &Visibility,\n\n ident: &Ident,\n\n generics: &Generics,\n\n input: &DataEnum,\n\n ) -> Result<Self> {\n\n Err(Error::unsupported_shape(\"enum\"))\n\n }\n\n\n\n fn from_struct(\n\n attrs: &Vec<Attribute>,\n\n vis: &Visibility,\n\n ident: &Ident,\n\n generics: &Generics,\n\n input: &DataStruct,\n","file_path":"syn-meta-ext/src/from_derive_input.rs","rank":59,"score":81549.88068599244},{"content":" ) -> Result<Self> {\n\n Err(Error::unsupported_shape(\"struct\"))\n\n }\n\n\n\n fn parse(input: TokenStream) -> Result<Self> {\n\n let input = syn::parse2(input)?;\n\n Self::from_derive_input(&input)\n\n }\n\n}\n\n\n\nimpl FromDeriveInput for () {\n\n fn from_derive_input(_: &DeriveInput) -> Result<Self> {\n\n Ok(())\n\n }\n\n}\n\n\n\nimpl FromDeriveInput for DeriveInput {\n\n fn from_derive_input(input: &DeriveInput) -> Result<Self> {\n\n Ok(input.clone())\n\n }\n\n}\n","file_path":"syn-meta-ext/src/from_derive_input.rs","rank":60,"score":81547.2122625937},{"content":" TooManyItems(_) => \"Too many items\",\n\n Multiple(_) => \"Multiple errors\",\n\n __NonExhaustive => unreachable!(),\n\n }\n\n }\n\n\n\n /// Deeply counts the number of errors this item represents.\n\n pub fn len(&self) -> usize {\n\n if let ErrorKind::Multiple(ref items) = *self {\n\n items.iter().map(Error::len).sum()\n\n } else {\n\n 1\n\n }\n\n }\n\n}\n\n\n\nimpl fmt::Display for ErrorKind {\n\n fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {\n\n use self::ErrorKind::*;\n\n\n","file_path":"syn-meta-ext/src/error/kind.rs","rank":61,"score":80693.20623446364},{"content":" // TODO make this variant take `!` so it can't exist\n\n #[doc(hidden)]\n\n __NonExhaustive,\n\n}\n\n\n\nimpl ErrorKind {\n\n pub fn description(&self) -> &str {\n\n use self::ErrorKind::*;\n\n\n\n match *self {\n\n Custom(ref s) => s,\n\n Parse(ref s) => s,\n\n DuplicateField(_) => \"Duplicate field\",\n\n MissingField(_) => \"Missing field\",\n\n UnknownField(_) => \"Unexpected field\",\n\n UnsupportedShape(_) => \"Unsupported shape\",\n\n UnexpectedFormat(_) => \"Unexpected meta-item format\",\n\n UnexpectedType(_) => \"Unexpected literal type\",\n\n UnknownValue(_) => \"Unknown literal value\",\n\n TooFewItems(_) => \"Too few items\",\n","file_path":"syn-meta-ext/src/error/kind.rs","rank":62,"score":80692.67708926907},{"content":" T: AsRef<str> + 'a,\n\n I: IntoIterator<Item = &'a T>,\n\n {\n\n ErrorUnknownField::new(field, did_you_mean(field, alternates))\n\n }\n\n}\n\n\n\nimpl From<String> for ErrorUnknownField {\n\n fn from(name: String) -> Self {\n\n ErrorUnknownField::new(name, None)\n\n }\n\n}\n\n\n\nimpl<'a> From<&'a str> for ErrorUnknownField {\n\n fn from(name: &'a str) -> Self {\n\n ErrorUnknownField::new(name, None)\n\n }\n\n}\n\n\n\nimpl fmt::Display for ErrorUnknownField {\n","file_path":"syn-meta-ext/src/error/kind.rs","rank":63,"score":80692.6621054622},{"content":"/// the user back on the right track.\n\n#[derive(Debug)]\n\n// Don't want to publicly commit to ErrorKind supporting equality yet, but\n\n// not having it makes testing very difficult.\n\n#[cfg_attr(test, derive(Clone, PartialEq, Eq))]\n\npub(super) struct ErrorUnknownField {\n\n name: String,\n\n did_you_mean: Option<String>,\n\n}\n\n\n\nimpl ErrorUnknownField {\n\n pub fn new<I: Into<String>>(name: I, did_you_mean: Option<String>) -> Self {\n\n ErrorUnknownField {\n\n name: name.into(),\n\n did_you_mean,\n\n }\n\n }\n\n\n\n pub fn with_alts<'a, T, I>(field: &str, alternates: I) -> Self\n\n where\n","file_path":"syn-meta-ext/src/error/kind.rs","rank":64,"score":80689.05178460985},{"content":" match *self {\n\n Custom(ref s) => s.fmt(f),\n\n Parse(ref s) => write!(f, \"Error parsing: {}\", s),\n\n DuplicateField(ref field) => write!(f, \"Duplicate field `{}`\", field),\n\n MissingField(ref field) => write!(f, \"Missing field `{}`\", field),\n\n UnknownField(ref field) => field.fmt(f),\n\n UnsupportedShape(ref shape) => write!(f, \"Unsupported shape `{}`\", shape),\n\n UnexpectedFormat(ref format) => write!(f, \"Unexpected meta-item format `{}`\", format),\n\n UnexpectedType(ref ty) => write!(f, \"Unexpected literal type `{}`\", ty),\n\n UnknownValue(ref val) => write!(f, \"Unknown literal value `{}`\", val),\n\n TooFewItems(ref min) => write!(f, \"Too few items: Expected at least {}\", min),\n\n TooManyItems(ref max) => write!(f, \"Too many items: Expected no more than {}\", max),\n\n Multiple(ref items) if items.len() == 1 => items[0].fmt(f),\n\n Multiple(ref items) => {\n\n write!(f, \"Multiple errors: (\")?;\n\n let mut first = true;\n\n for item in items {\n\n if !first {\n\n write!(f, \", \")?;\n\n } else {\n","file_path":"syn-meta-ext/src/error/kind.rs","rank":65,"score":80688.63255127451},{"content":" first = false;\n\n }\n\n\n\n item.fmt(f)?;\n\n }\n\n\n\n write!(f, \")\")\n\n }\n\n __NonExhaustive => unreachable!(),\n\n }\n\n }\n\n}\n\n\n\nimpl From<ErrorUnknownField> for ErrorKind {\n\n fn from(err: ErrorUnknownField) -> Self {\n\n ErrorKind::UnknownField(err)\n\n }\n\n}\n\n\n\n/// An error for an unknown field, with a possible \"did-you-mean\" suggestion to get\n","file_path":"syn-meta-ext/src/error/kind.rs","rank":66,"score":80684.47598957559},{"content":"use std::fmt;\n\n\n\nuse super::Error;\n\n\n","file_path":"syn-meta-ext/src/error/kind.rs","rank":67,"score":80681.18996610725},{"content":" fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {\n\n write!(f, \"Unknown field: `{}`\", self.name)?;\n\n\n\n if let Some(ref did_you_mean) = self.did_you_mean {\n\n write!(f, \". Did you mean `{}`?\", did_you_mean)?;\n\n }\n\n\n\n Ok(())\n\n }\n\n}\n\n\n","file_path":"syn-meta-ext/src/error/kind.rs","rank":68,"score":80677.1246859909},{"content":"enum ErrorData {\n\n Struct(ErrorStruct),\n\n Enum(Vec<ErrorVariant>),\n\n}\n\n\n","file_path":"evitable-derive-core/src/lib.rs","rank":69,"score":78535.74176787407},{"content":"trait AttributeTree {\n\n fn visit(&mut self, f: &impl Fn(&mut Vec<Attribute>) -> ());\n\n}\n\n\n\nimpl AttributeTree for syn::Field {\n\n fn visit(&mut self, f: &impl Fn(&mut Vec<Attribute>) -> ()) {\n\n f(&mut self.attrs);\n\n }\n\n}\n\n\n\nimpl AttributeTree for syn::FieldsNamed {\n\n fn visit(&mut self, f: &impl Fn(&mut Vec<Attribute>) -> ()) {\n\n for field in self.named.iter_mut() {\n\n field.visit(f);\n\n }\n\n }\n\n}\n\n\n\nimpl AttributeTree for syn::FieldsUnnamed {\n\n fn visit(&mut self, f: &impl Fn(&mut Vec<Attribute>) -> ()) {\n","file_path":"evitable-derive-core/src/lib.rs","rank":70,"score":78154.1942518761},{"content":"struct ErrorVariant {\n\n ident: Ident,\n\n description: ResolvedDescription,\n\n from_impls: Vec<FromImpl>,\n\n fields: Fields<ErrorField>,\n\n}\n\n\n\nimpl ErrorVariant {\n\n pub(crate) fn destruct(&self) -> TokenStream {\n\n match &self.fields {\n\n Fields::Unit => TokenStream::new(),\n\n Fields::Named(f) => {\n\n let idents = f.iter().map(|(i, _)| i);\n\n quote! { { #(#idents,)* } }\n\n }\n\n Fields::Unnamed(f) => {\n\n let idents = f.iter().map(|(i, _)| i.into_ident());\n\n quote! { ( #(#idents,)* ) }\n\n }\n\n }\n\n }\n\n}\n\n\n","file_path":"evitable-derive-core/src/lib.rs","rank":71,"score":78150.23187747928},{"content":"struct ErrorField {\n\n ty: Type,\n\n include_in_kind: bool,\n\n method: CopyMethod,\n\n}\n\n\n\nimpl ErrorField {\n\n #[inline]\n\n pub fn is_copy(&self) -> bool {\n\n self.method.is_copy()\n\n }\n\n}\n\n\n","file_path":"evitable-derive-core/src/lib.rs","rank":72,"score":78150.23187747928},{"content":"trait IntoIdent<'a> {\n\n fn into_ident(self) -> Cow<'a, Ident>;\n\n}\n\n\n\nimpl<'a> IntoIdent<'a> for Ident {\n\n #[inline]\n\n fn into_ident(self) -> Cow<'a, Ident> {\n\n Cow::Owned(self)\n\n }\n\n}\n\n\n\nimpl<'a> IntoIdent<'a> for &'a Ident {\n\n #[inline]\n\n fn into_ident(self) -> Cow<'a, Ident> {\n\n Cow::Borrowed(self)\n\n }\n\n}\n\n\n\nimpl<'a> IntoIdent<'a> for String {\n\n #[inline]\n","file_path":"evitable-derive-core/src/lib.rs","rank":73,"score":78106.56676779348},{"content":"enum TypeAliasName {\n\n Default,\n\n Override(Ident),\n\n Disabled,\n\n Enabled,\n\n}\n\n\n\nimpl TypeAliasName {\n\n fn ident(&self, default: &str) -> Option<Ident> {\n\n match self {\n\n TypeAliasName::Disabled => None,\n\n TypeAliasName::Override(i) => Some(i.clone()),\n\n TypeAliasName::Default | TypeAliasName::Enabled => {\n\n Some(Ident::new(default, Span::call_site()))\n\n }\n\n }\n\n }\n\n}\n\n\n\nimpl Default for TypeAliasName {\n","file_path":"evitable-derive-core/src/lib.rs","rank":74,"score":77507.69212181725},{"content":"pub fn inherited(vis: &Visibility, depth: usize) -> Visibility {\n\n match vis {\n\n Visibility::Public(_) => vis.clone(),\n\n Visibility::Crate(_) => vis.clone(),\n\n Visibility::Inherited => create_super_vis(depth),\n\n Visibility::Restricted(r) => modify_vis(r, depth),\n\n }\n\n}\n","file_path":"evitable-derive-core/src/visibility.rs","rank":75,"score":73216.80269024646},{"content":"fn create_enum_case<'a>(\n\n enum_name: &Ident,\n\n variant_name: &Ident,\n\n case: &ErrorKind<'a>,\n\n type_asserts: &mut TokenStream,\n\n) -> TokenStream {\n\n let mut tokens = TokenStream::new();\n\n let extract = match (&case.all_fields, &case.included_fields) {\n\n (Fields::Unit, Fields::Unit) => TokenStream::new(),\n\n (Fields::Named(_), Fields::Unit) => quote! { { .. } },\n\n (Fields::Unnamed(_), Fields::Unit) => quote! { (_) },\n\n (Fields::Named(all), Fields::Named(included)) => {\n\n if all.len() == included.len() {\n\n let idents = all.iter().map(|(n, _)| n);\n\n quote! { { #(#idents,)* } }\n\n } else {\n\n assert!(all.len() > included.len());\n\n let idents = included.iter().map(|(n, _)| n);\n\n quote! { { #(#idents,)* .. } }\n\n }\n","file_path":"evitable-derive-core/src/from_context.rs","rank":76,"score":72797.65003249899},{"content":"fn create_struct_kind<'a>(\n\n name: &Ident,\n\n included_fields: &Fields<&ErrorField>,\n\n tokens: &mut TokenStream,\n\n type_asserts: &mut TokenStream,\n\n) {\n\n match included_fields {\n\n Fields::Unit => tokens.extend(quote! { ErrorKind::#name }),\n\n Fields::Named(fields) => {\n\n let mut assignments = Vec::with_capacity(fields.len());\n\n for (n, f) in fields.iter() {\n\n assert_trait_impl(&f.ty, &f.method.trait_path(), type_asserts);\n\n let copy = f.method.copy("e! { &context.#n });\n\n assignments.push(quote! { #n: #copy, });\n\n }\n\n\n\n tokens.extend(quote! { ErrorKind::#name { #(#assignments)* } })\n\n }\n\n Fields::Unnamed(fields) => {\n\n let mut assignments = Vec::with_capacity(fields.len());\n","file_path":"evitable-derive-core/src/from_context.rs","rank":77,"score":72660.74853157772},{"content":"from_meta_lit!(syn::LitBool, Lit::Bool);\n\nfrom_meta_lit!(proc_macro2::Literal, Lit::Verbatim);\n\n\n\nimpl FromMeta for Meta {\n\n fn from_meta(value: &Meta) -> Result<Self> {\n\n Ok(value.clone())\n\n }\n\n}\n\n\n\nimpl FromMeta for ident_case::RenameRule {\n\n fn from_string<S: Spanned>(value: &str, span: &S) -> Result<Self> {\n\n value\n\n .parse()\n\n .map_err(|_| Error::unknown_value(value).with_span(span))\n\n }\n\n}\n\n\n\nimpl<T: FromMeta> FromMeta for Option<T> {\n\n fn from_meta(item: &Meta) -> Result<Self> {\n\n FromMeta::from_meta(item).map(Some)\n","file_path":"syn-meta-ext/src/from_meta.rs","rank":78,"score":62655.596225213514},{"content":"use crate::quote::ToTokens;\n\nuse proc_macro2::TokenStream;\n\nuse std::rc::Rc;\n\nuse std::sync::atomic::AtomicBool;\n\nuse std::sync::Arc;\n\nuse syn::spanned::Spanned;\n\nuse syn::{Ident, Lit, Path};\n\n\n\nuse super::error::{Error, Result};\n\nuse super::{Meta, MetaValue, NestedMeta};\n\n\n","file_path":"syn-meta-ext/src/from_meta.rs","rank":79,"score":62654.94013798437},{"content":"#[cfg(test)]\n\nmod tests {\n\n use proc_macro2::TokenStream;\n\n use syn;\n\n\n\n use super::Meta;\n\n use super::{FromMeta, Result};\n\n use crate::AttrExt;\n\n\n\n /// parse a string as a syn::Meta instance.\n\n fn pm(tokens: TokenStream) -> ::std::result::Result<Meta, String> {\n\n let attribute: syn::Attribute = parse_quote!(#[#tokens]);\n\n attribute.meta().map_err(|_| \"Unable to parse\".into())\n\n }\n\n\n\n fn fm<T: FromMeta>(tokens: TokenStream) -> T {\n\n FromMeta::from_meta(&pm(tokens).expect(\"Tests should pass well-formed input\"))\n\n .expect(\"Tests should pass valid input\")\n\n }\n\n\n","file_path":"syn-meta-ext/src/from_meta.rs","rank":80,"score":62653.127606400936},{"content":"\n\nimpl FromMeta for AtomicBool {\n\n fn from_meta(mi: &Meta) -> Result<Self> {\n\n FromMeta::from_meta(mi)\n\n .map(AtomicBool::new)\n\n .map_err(|e| e.with_span(mi))\n\n }\n\n}\n\n\n\nimpl FromMeta for String {\n\n fn from_string<S: Spanned>(s: &str, _span: &S) -> Result<Self> {\n\n Ok(s.to_string())\n\n }\n\n\n\n fn from_path(p: &Path) -> Result<Self> {\n\n let mut ss = TokenStream::new();\n\n p.to_tokens(&mut ss);\n\n Ok(format!(\"{}\", ss))\n\n }\n\n}\n","file_path":"syn-meta-ext/src/from_meta.rs","rank":81,"score":62651.994424972945},{"content":"\n\n/// Generate an impl of `FromMeta` that will accept strings which parse to numbers or\n\n/// integer literals.\n\nmacro_rules! from_meta_num {\n\n ($ty:ident) => {\n\n impl FromMeta for $ty {\n\n fn from_string<S: Spanned>(s: &str, span: &S) -> Result<Self> {\n\n s.parse()\n\n .map_err(|_| Error::unknown_value(s).with_span(span))\n\n }\n\n\n\n fn from_lit(value: &Lit) -> Result<Self> {\n\n (match value {\n\n Lit::Str(s) => Self::from_string(&s.value(), s),\n\n Lit::Int(s) => Ok(s.base10_parse()?),\n\n v => Err(Error::unexpected_lit_type(value).with_span(&v)),\n\n })\n\n .map_err(|e| e.with_span(value))\n\n }\n\n }\n","file_path":"syn-meta-ext/src/from_meta.rs","rank":82,"score":62651.11690647849},{"content":" fn from_list(items: &[&NestedMeta]) -> Result<Self> {\n\n match items.len() {\n\n 0 => Self::from_empty(),\n\n 1 => Self::from_nested_meta(&items[0]),\n\n _ => Err(Error::unsupported_format(\"list\")),\n\n }\n\n }\n\n\n\n /// Create an instance from a literal value of either `foo = \"bar\"` or `foo(\"bar\")`.\n\n /// This dispatches to the appropriate method based on the type of literal encountered,\n\n /// and generally should not be overridden by implementers.\n\n ///\n\n /// # Error Spans\n\n /// If this method is overridden, the override must make sure to add `value`'s span\n\n /// information to the returned error by calling `with_span(value)` on the `Error` instance.\n\n fn from_value(value: &MetaValue) -> Result<Self> {\n\n (match value {\n\n MetaValue::Path(path) => Self::from_path(path),\n\n MetaValue::Literal(lit) => Self::from_lit(lit),\n\n })\n","file_path":"syn-meta-ext/src/from_meta.rs","rank":83,"score":62650.71839213901},{"content":" #[allow(unused_variables)]\n\n fn from_string<S: Spanned>(value: &str, span: &S) -> Result<Self> {\n\n Err(Error::unexpected_type(\"string\").with_span(span))\n\n }\n\n\n\n /// Create an instance from a bool literal in a value position.\n\n #[allow(unused_variables)]\n\n fn from_bool<S: Spanned>(value: bool, span: &S) -> Result<Self> {\n\n Err(Error::unexpected_type(\"bool\").with_span(span))\n\n }\n\n\n\n #[allow(unused_variables)]\n\n fn from_ident(value: &Ident) -> Result<Self> {\n\n Err(Error::unexpected_type(\"ident\"))\n\n }\n\n}\n\n\n\n// FromMeta impls for std and syn types.\n\n\n\nimpl FromMeta for () {\n","file_path":"syn-meta-ext/src/from_meta.rs","rank":84,"score":62650.50270429675},{"content":" /// source code.\n\n fn from_meta(item: &Meta) -> Result<Self> {\n\n (match item {\n\n Meta::Path(_) => Self::from_empty(),\n\n Meta::List(value) => {\n\n Self::from_list(value.nested.iter().collect::<Vec<&NestedMeta>>().as_ref())\n\n }\n\n Meta::NameValue(value) => Self::from_value(&value.val),\n\n })\n\n .map_err(|e| e.with_span(item))\n\n }\n\n\n\n /// Create an instance from the presence of the word in the attribute with no\n\n /// additional options specified.\n\n fn from_empty() -> Result<Self> {\n\n Err(Error::unsupported_format(\"empty\"))\n\n }\n\n\n\n /// Create an instance from a list of nested meta items.\n\n #[allow(unused_variables)]\n","file_path":"syn-meta-ext/src/from_meta.rs","rank":85,"score":62650.3158080975},{"content":" syn::parse_str(value).map_err(|_| Error::unknown_value(value).with_span(span))\n\n }\n\n\n\n fn from_lit(value: &Lit) -> Result<Self> {\n\n if let Lit::Str(ref path_str) = *value {\n\n path_str\n\n .parse()\n\n .map_err(|_| Error::unknown_lit_str_value(path_str).with_span(value))\n\n } else {\n\n Err(Error::unexpected_lit_type(value).with_span(value))\n\n }\n\n }\n\n}\n\n\n\nimpl FromMeta for syn::Lit {\n\n fn from_lit(value: &Lit) -> Result<Self> {\n\n Ok(value.clone())\n\n }\n\n}\n\n\n","file_path":"syn-meta-ext/src/from_meta.rs","rank":86,"score":62649.60459961121},{"content":" /// Create an instance from a int literal in a value position.\n\n #[allow(unused_variables)]\n\n fn from_int<S: Spanned>(value: u64, span: &S) -> Result<Self> {\n\n Err(Error::unexpected_type(\"int\").with_span(span))\n\n }\n\n\n\n /// Create an instance from a char literal in a value position.\n\n #[allow(unused_variables)]\n\n fn from_path(value: &Path) -> Result<Self> {\n\n if value.leading_colon.is_none()\n\n && value.segments.len() == 1\n\n && value.segments[0].arguments == syn::PathArguments::None\n\n {\n\n Self::from_ident(&value.segments[0].ident)\n\n } else {\n\n Err(Error::unexpected_type(\"path\"))\n\n }\n\n }\n\n\n\n /// Create an instance from a string literal in a value position.\n","file_path":"syn-meta-ext/src/from_meta.rs","rank":87,"score":62649.48574609685},{"content":"/// when available, but also supports parsing strings with the call site as the\n\n/// emitted span.\n\nimpl FromMeta for syn::Ident {\n\n fn from_ident(value: &Ident) -> Result<Self> {\n\n Ok(value.clone())\n\n }\n\n\n\n fn from_string<S: Spanned>(value: &str, span: &S) -> Result<Self> {\n\n Ok(syn::Ident::new(value, span.span()))\n\n }\n\n}\n\n\n\n/// Parsing support for paths. This attempts to preserve span information when available,\n\n/// but also supports parsing strings with the call site as the emitted span.\n\nimpl FromMeta for syn::Path {\n\n fn from_path(path: &Path) -> Result<Self> {\n\n Ok(path.clone())\n\n }\n\n\n\n fn from_string<S: Spanned>(value: &str, span: &S) -> Result<Self> {\n","file_path":"syn-meta-ext/src/from_meta.rs","rank":88,"score":62647.74236091694},{"content":"macro_rules! from_meta_lit {\n\n ($impl_ty:path, $lit_variant:path) => {\n\n impl FromMeta for $impl_ty {\n\n fn from_lit(value: &Lit) -> Result<Self> {\n\n if let $lit_variant(ref value) = *value {\n\n Ok(value.clone())\n\n } else {\n\n Err(Error::unexpected_lit_type(value).with_span(value))\n\n }\n\n }\n\n }\n\n };\n\n}\n\n\n\nfrom_meta_lit!(syn::LitInt, Lit::Int);\n\nfrom_meta_lit!(syn::LitFloat, Lit::Float);\n\nfrom_meta_lit!(syn::LitStr, Lit::Str);\n\nfrom_meta_lit!(syn::LitByte, Lit::Byte);\n\nfrom_meta_lit!(syn::LitByteStr, Lit::ByteStr);\n\nfrom_meta_lit!(syn::LitChar, Lit::Char);\n","file_path":"syn-meta-ext/src/from_meta.rs","rank":89,"score":62647.54948690525},{"content":" .map_err(|e| e.with_span(value))\n\n }\n\n\n\n fn from_lit(lit: &Lit) -> Result<Self> {\n\n (match lit {\n\n Lit::Bool(b) => Self::from_bool(b.value, b),\n\n Lit::Str(s) => Self::from_string(&s.value(), s),\n\n Lit::Char(c) => Self::from_char(c.value(), c),\n\n Lit::Int(i) => Self::from_int(i.base10_parse()?, i),\n\n _ => Err(Error::unexpected_lit_type(lit)),\n\n })\n\n .map_err(|e| e.with_span(lit))\n\n }\n\n\n\n /// Create an instance from a char literal in a value position.\n\n #[allow(unused_variables)]\n\n fn from_char<S: Spanned>(value: char, span: &S) -> Result<Self> {\n\n Err(Error::unexpected_type(\"char\").with_span(span))\n\n }\n\n\n","file_path":"syn-meta-ext/src/from_meta.rs","rank":90,"score":62647.19056376134},{"content":" }\n\n\n\n fn from_list(items: &[&NestedMeta]) -> Result<Self> {\n\n let mut ret = Vec::with_capacity(items.len());\n\n for item in items {\n\n ret.push(T::from_nested_meta(item)?);\n\n }\n\n\n\n Ok(ret)\n\n }\n\n\n\n fn from_value(val: &MetaValue) -> Result<Self> {\n\n let mut ret = Vec::with_capacity(1);\n\n ret.push(T::from_value(val)?);\n\n Ok(ret)\n\n }\n\n}\n\n\n\n/// Tests for `FromMeta` implementations. Wherever the word `ignore` appears in test input,\n\n/// it should not be considered by the parsing.\n","file_path":"syn-meta-ext/src/from_meta.rs","rank":91,"score":62645.45230854758},{"content":" s.parse()\n\n .map_err(|_| Error::unknown_value(s).with_span(span))\n\n }\n\n\n\n fn from_lit(value: &Lit) -> Result<Self> {\n\n (match value {\n\n Lit::Str(s) => Self::from_string(&s.value(), s),\n\n Lit::Float(s) => Ok(s.base10_parse()?),\n\n v => Err(Error::unexpected_lit_type(value).with_span(&v)),\n\n })\n\n .map_err(|e| e.with_span(value))\n\n }\n\n }\n\n };\n\n}\n\n\n\nfrom_meta_float!(f32);\n\nfrom_meta_float!(f64);\n\n\n\n/// Parsing support for identifiers. This attempts to preserve span information\n","file_path":"syn-meta-ext/src/from_meta.rs","rank":92,"score":62645.15903080945},{"content":" }\n\n}\n\n\n\nimpl<T: FromMeta> FromMeta for Box<T> {\n\n fn from_meta(item: &Meta) -> Result<Self> {\n\n FromMeta::from_meta(item).map(Box::new)\n\n }\n\n}\n\n\n\nimpl<T: FromMeta> FromMeta for Result<T> {\n\n fn from_meta(item: &Meta) -> Result<Self> {\n\n Ok(FromMeta::from_meta(item))\n\n }\n\n}\n\n\n\n/// Parses the meta-item, and in case of error preserves a copy of the input for\n\n/// later analysis.\n\nimpl<T: FromMeta> FromMeta for ::std::result::Result<T, Meta> {\n\n fn from_meta(item: &Meta) -> Result<Self> {\n\n T::from_meta(item)\n","file_path":"syn-meta-ext/src/from_meta.rs","rank":93,"score":62644.507080653464},{"content":" .map(Ok)\n\n .or_else(|_| Ok(Err(item.clone())))\n\n }\n\n}\n\n\n\nimpl<T: FromMeta> FromMeta for Rc<T> {\n\n fn from_meta(item: &Meta) -> Result<Self> {\n\n FromMeta::from_meta(item).map(Rc::new)\n\n }\n\n}\n\n\n\nimpl<T: FromMeta> FromMeta for Arc<T> {\n\n fn from_meta(item: &Meta) -> Result<Self> {\n\n FromMeta::from_meta(item).map(Arc::new)\n\n }\n\n}\n\n\n\nimpl<T: FromMeta> FromMeta for Vec<T> {\n\n fn from_empty() -> Result<Self> {\n\n Ok(Vec::new())\n","file_path":"syn-meta-ext/src/from_meta.rs","rank":94,"score":62644.4901734512},{"content":" fn from_empty() -> Result<Self> {\n\n Ok(())\n\n }\n\n}\n\n\n\nimpl FromMeta for bool {\n\n fn from_empty() -> Result<Self> {\n\n Ok(true)\n\n }\n\n\n\n fn from_bool<S: Spanned>(value: bool, _: &S) -> Result<Self> {\n\n Ok(value)\n\n }\n\n\n\n fn from_string<S: Spanned>(value: &str, span: &S) -> Result<Self> {\n\n value\n\n .parse()\n\n .map_err(|_| Error::unknown_value(value).with_span(span))\n\n }\n\n}\n","file_path":"syn-meta-ext/src/from_meta.rs","rank":95,"score":62642.10934489033},{"content":" };\n\n}\n\n\n\nfrom_meta_num!(u8);\n\nfrom_meta_num!(u16);\n\nfrom_meta_num!(u32);\n\nfrom_meta_num!(u64);\n\nfrom_meta_num!(usize);\n\nfrom_meta_num!(i8);\n\nfrom_meta_num!(i16);\n\nfrom_meta_num!(i32);\n\nfrom_meta_num!(i64);\n\nfrom_meta_num!(isize);\n\n\n\n/// Generate an impl of `FromMeta` that will accept strings which parse to floats or\n\n/// float literals.\n\nmacro_rules! from_meta_float {\n\n ($ty:ident) => {\n\n impl FromMeta for $ty {\n\n fn from_string<S: Spanned>(s: &str, span: &S) -> Result<Self> {\n","file_path":"syn-meta-ext/src/from_meta.rs","rank":96,"score":62639.81564175402},{"content":" #[test]\n\n fn unit_succeeds() {\n\n assert_eq!(fm::<()>(quote!(ignore)), ());\n\n }\n\n\n\n #[test]\n\n fn bool_succeeds() {\n\n // word format\n\n assert_eq!(fm::<bool>(quote!(ignore)), true);\n\n\n\n // bool literal\n\n assert_eq!(fm::<bool>(quote!(ignore = true)), true);\n\n assert_eq!(fm::<bool>(quote!(ignore = false)), false);\n\n\n\n // string literals\n\n assert_eq!(fm::<bool>(quote!(ignore = \"true\")), true);\n\n assert_eq!(fm::<bool>(quote!(ignore = \"false\")), false);\n\n }\n\n\n\n #[test]\n","file_path":"syn-meta-ext/src/from_meta.rs","rank":97,"score":62637.643611272004},{"content":" fn string_succeeds() {\n\n // cooked form\n\n assert_eq!(&fm::<String>(quote!(ignore = \"world\")), \"world\");\n\n\n\n // raw form\n\n assert_eq!(&fm::<String>(quote!(ignore = r#\"world\"#)), \"world\");\n\n }\n\n\n\n #[test]\n\n fn number_succeeds() {\n\n assert_eq!(fm::<u8>(quote!(ignore = \"2\")), 2u8);\n\n assert_eq!(fm::<i16>(quote!(ignore = \"-25\")), -25i16);\n\n assert_eq!(fm::<f64>(quote!(ignore = \"1.4e10\")), 1.4e10);\n\n }\n\n\n\n #[test]\n\n fn int_without_quotes() {\n\n assert_eq!(fm::<u8>(quote!(ignore = 2)), 2u8);\n\n assert_eq!(fm::<u16>(quote!(ignore = 255)), 255u16);\n\n assert_eq!(fm::<u32>(quote!(ignore = 5000)), 5000u32);\n","file_path":"syn-meta-ext/src/from_meta.rs","rank":98,"score":62632.27914791538},{"content":"\n\n // Check that we aren't tripped up by incorrect suffixes\n\n assert_eq!(fm::<u32>(quote!(ignore = 5000i32)), 5000u32);\n\n }\n\n\n\n #[test]\n\n fn float_without_quotes() {\n\n assert_eq!(fm::<f32>(quote!(ignore = 2.)), 2.0f32);\n\n assert_eq!(fm::<f32>(quote!(ignore = 2.0)), 2.0f32);\n\n assert_eq!(fm::<f64>(quote!(ignore = 1.4e10)), 1.4e10f64);\n\n }\n\n\n\n #[test]\n\n fn meta_succeeds() {\n\n assert_eq!(\n\n fm::<Meta>(quote!(hello(world, today))),\n\n pm(quote!(hello(world, today))).unwrap()\n\n );\n\n }\n\n\n\n /// Tests that fallible parsing will always produce an outer `Ok` (from `fm`),\n\n /// and will accurately preserve the inner contents.\n\n #[test]\n\n fn result_succeeds() {\n\n fm::<Result<()>>(quote!(ignore)).unwrap();\n\n fm::<Result<()>>(quote!(ignore(world))).unwrap_err();\n\n }\n\n}\n","file_path":"syn-meta-ext/src/from_meta.rs","rank":99,"score":62631.42456905248}],"string":"[\n {\n \"content\": \"pub fn assert_trait_impl(ty: &Type, trait_path: &Path, tokens: &mut TokenStream) {\\n\\n ToTokens::to_tokens(&TraitAssertion { ty, trait_path }, tokens)\\n\\n}\\n\",\n \"file_path\": \"evitable-derive-core/src/trait_assert.rs\",\n \"rank\": 0,\n \"score\": 249387.9298914886\n },\n {\n \"content\": \"pub fn derive_evitable(meta: &TokenStream, input: &mut DeriveInput) -> TokenStream {\\n\\n let mut cloned = input.clone();\\n\\n remove_evitable_attrs(input);\\n\\n\\n\\n if !meta.is_empty() {\\n\\n let meta_attr_quote = quote! {#[evitable(#meta)]};\\n\\n let parser = Attribute::parse_outer;\\n\\n let attr = match parser.parse2(meta_attr_quote) {\\n\\n Ok(val) => val[0].clone(),\\n\\n Err(err) => return err.to_compile_error(),\\n\\n };\\n\\n\\n\\n add_attribute(&mut cloned, attr);\\n\\n }\\n\\n\\n\\n let error_type = ErrorType::from_derive_input(&cloned);\\n\\n match error_type {\\n\\n Ok(val) => quote! { #input #val },\\n\\n Err(err) => err.write_errors(),\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"evitable-derive-core/src/lib.rs\",\n \"rank\": 2,\n \"score\": 204512.65009277826\n },\n {\n \"content\": \"type DeriveInputShape = String;\\n\",\n \"file_path\": \"syn-meta-ext/src/error/kind.rs\",\n \"rank\": 5,\n \"score\": 188495.89711632984\n },\n {\n \"content\": \"enum IntoIterEnum {\\n\\n Single(iter::Once<Error>),\\n\\n Multiple(vec::IntoIter<Error>),\\n\\n}\\n\\n\\n\\nimpl Iterator for IntoIterEnum {\\n\\n type Item = Error;\\n\\n\\n\\n fn next(&mut self) -> Option<Self::Item> {\\n\\n match *self {\\n\\n IntoIterEnum::Single(ref mut content) => content.next(),\\n\\n IntoIterEnum::Multiple(ref mut content) => content.next(),\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\n/// An iterator that moves out of an `Error`.\\n\\npub struct IntoIter {\\n\\n inner: IntoIterEnum,\\n\\n}\\n\",\n \"file_path\": \"syn-meta-ext/src/error/mod.rs\",\n \"rank\": 6,\n \"score\": 188206.99590330492\n },\n {\n \"content\": \"pub trait MapFields<T> {\\n\\n fn try_map_fields<E, U>(self, f: impl Fn(T) -> Result<U, E>) -> Result<Fields<U>, E>;\\n\\n fn map_fields<U>(self, f: impl Fn(T) -> U) -> Fields<U>\\n\\n where\\n\\n Self: Sized,\\n\\n {\\n\\n self\\n\\n .try_map_fields(|field| Result::<_, Unreachable>::Ok(f(field)))\\n\\n .unwrap()\\n\\n }\\n\\n}\\n\\n\\n\\nimpl MapFields<syn::Field> for syn::Fields {\\n\\n fn try_map_fields<E, U>(self, f: impl Fn(syn::Field) -> Result<U, E>) -> Result<Fields<U>, E> {\\n\\n match self {\\n\\n syn::Fields::Named(fields) => {\\n\\n let mut v = Vec::with_capacity(fields.named.len());\\n\\n for field in fields.named {\\n\\n let ident = field.ident.clone().unwrap();\\n\\n v.push((ident, f(field)?))\\n\",\n \"file_path\": \"syn-meta-ext/src/ast.rs\",\n \"rank\": 7,\n \"score\": 187749.2424792518\n },\n {\n \"content\": \"#[proc_macro_attribute]\\n\\npub fn evitable(meta: TokenStream, input: TokenStream) -> TokenStream {\\n\\n derive_evitable(&parse_macro_input!(meta), &mut parse_macro_input!(input)).into()\\n\\n}\\n\",\n \"file_path\": \"evitable-derive/src/lib.rs\",\n \"rank\": 9,\n \"score\": 178483.1065565417\n },\n {\n \"content\": \"type MetaFormat = String;\\n\\n\\n\\n#[derive(Debug)]\\n\\n#[cfg_attr(test, derive(Clone, PartialEq, Eq))]\\n\\npub(super) enum ErrorKind {\\n\\n /// An arbitrary error message.\\n\\n Custom(String),\\n\\n Parse(String),\\n\\n DuplicateField(FieldName),\\n\\n MissingField(FieldName),\\n\\n UnsupportedShape(DeriveInputShape),\\n\\n UnknownField(ErrorUnknownField),\\n\\n UnexpectedFormat(MetaFormat),\\n\\n UnexpectedType(String),\\n\\n UnknownValue(String),\\n\\n TooFewItems(usize),\\n\\n TooManyItems(usize),\\n\\n /// A set of errors.\\n\\n Multiple(Vec<Error>),\\n\\n\\n\",\n \"file_path\": \"syn-meta-ext/src/error/kind.rs\",\n \"rank\": 10,\n \"score\": 175908.02873465937\n },\n {\n \"content\": \"type FieldName = String;\\n\",\n \"file_path\": \"syn-meta-ext/src/error/kind.rs\",\n \"rank\": 11,\n \"score\": 167611.9473773053\n },\n {\n \"content\": \"/// Creates an instance by parsing an entire proc-macro `derive` input,\\n\\n/// including the, identity, generics, and visibility of the type.\\n\\n///\\n\\n/// This trait should either be derived or manually implemented by a type\\n\\n/// in the proc macro crate which is directly using `darling`. It is unlikely\\n\\n/// that these implementations will be reusable across crates.\\n\\npub trait FromDeriveInput: Sized {\\n\\n /// Create an instance from `syn::DeriveInput`, or return an error.\\n\\n fn from_derive_input(input: &DeriveInput) -> Result<Self> {\\n\\n match &input.data {\\n\\n Data::Union(d) => {\\n\\n Self::from_union(&input.attrs, &input.vis, &input.ident, &input.generics, d)\\n\\n }\\n\\n Data::Enum(d) => Self::from_enum(&input.attrs, &input.vis, &input.ident, &input.generics, d),\\n\\n Data::Struct(d) => {\\n\\n Self::from_struct(&input.attrs, &input.vis, &input.ident, &input.generics, d)\\n\\n }\\n\\n }\\n\\n }\\n\\n\\n\\n fn from_union(\\n\\n attrs: &Vec<Attribute>,\\n\\n vis: &Visibility,\\n\\n ident: &Ident,\\n\\n generics: &Generics,\\n\\n input: &DataUnion,\\n\",\n \"file_path\": \"syn-meta-ext/src/from_derive_input.rs\",\n \"rank\": 12,\n \"score\": 166614.13135233315\n },\n {\n \"content\": \"fn add_attribute(input: &mut DeriveInput, attr: Attribute) {\\n\\n input.attrs.push(attr);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"evitable-derive-core/src/lib.rs\",\n \"rank\": 14,\n \"score\": 154639.2932403677\n },\n {\n \"content\": \"pub trait FromMeta: Sized {\\n\\n fn from_nested_meta(item: &NestedMeta) -> Result<Self> {\\n\\n (match item {\\n\\n NestedMeta::Literal(lit) => Self::from_lit(lit),\\n\\n NestedMeta::Meta(mi) => match mi {\\n\\n Meta::Path(p) => Self::from_path(p),\\n\\n Meta::NameValue(_) => Err(Error::unexpected_type(\\\"name value\\\").with_span(item)),\\n\\n Meta::List(_) => Err(Error::unexpected_type(\\\"list\\\").with_span(item)),\\n\\n },\\n\\n })\\n\\n .map_err(|e| e.with_span(item))\\n\\n }\\n\\n\\n\\n /// Create an instance from a `syn::Meta` by dispatching to the format-appropriate\\n\\n /// trait function. This generally should not be overridden by implementers.\\n\\n ///\\n\\n /// # Error Spans\\n\\n /// If this method is overridden and can introduce errors that weren't passed up from\\n\\n /// other `from_meta` calls, the override must call `with_span` on the error using the\\n\\n /// `item` to make sure that the emitted diagnostic points to the correct location in\\n\",\n \"file_path\": \"syn-meta-ext/src/from_meta.rs\",\n \"rank\": 15,\n \"score\": 151556.0837991106\n },\n {\n \"content\": \"/// Creates an instance by parsing an individual field and its attributes.\\n\\npub trait FromField: Sized {\\n\\n fn from_field(field: &Field) -> Result<Self>;\\n\\n}\\n\\n\\n\\nimpl FromField for () {\\n\\n fn from_field(_: &Field) -> Result<Self> {\\n\\n Ok(())\\n\\n }\\n\\n}\\n\\n\\n\\nimpl FromField for Field {\\n\\n fn from_field(field: &Field) -> Result<Self> {\\n\\n Ok(field.clone())\\n\\n }\\n\\n}\\n\\n\\n\\nimpl FromField for syn::Type {\\n\\n fn from_field(field: &Field) -> Result<Self> {\\n\\n Ok(field.ty.clone())\\n\\n }\\n\",\n \"file_path\": \"syn-meta-ext/src/from_field.rs\",\n \"rank\": 16,\n \"score\": 139226.85527159402\n },\n {\n \"content\": \"/// Creates an instance from a specified `syn::Variant`.\\n\\npub trait FromVariant: Sized {\\n\\n /// Create an instance from `syn::Variant`, or return an error.\\n\\n fn from_variant(variant: &Variant) -> Result<Self>;\\n\\n}\\n\\n\\n\\nimpl FromVariant for () {\\n\\n fn from_variant(_: &Variant) -> Result<Self> {\\n\\n Ok(())\\n\\n }\\n\\n}\\n\\n\\n\\nimpl FromVariant for Variant {\\n\\n fn from_variant(variant: &Variant) -> Result<Self> {\\n\\n Ok(variant.clone())\\n\\n }\\n\\n}\\n\\n\\n\\nimpl FromVariant for syn::Ident {\\n\\n fn from_variant(variant: &Variant) -> Result<Self> {\\n\\n Ok(variant.ident.clone())\\n\\n }\\n\\n}\\n\\n\\n\\nimpl FromVariant for Vec<syn::Attribute> {\\n\\n fn from_variant(variant: &Variant) -> Result<Self> {\\n\\n Ok(variant.attrs.clone())\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"syn-meta-ext/src/from_variant.rs\",\n \"rank\": 17,\n \"score\": 139226.82992736678\n },\n {\n \"content\": \"enum Unreachable {}\\n\\n\\n\\nimpl std::fmt::Debug for Unreachable {\\n\\n fn fmt(&self, f: &mut std::fmt::Formatter) -> std::fmt::Result {\\n\\n unreachable!()\\n\\n }\\n\\n}\\n\\n\\n\\npub enum Fields<T> {\\n\\n Named(Vec<(Ident, T)>),\\n\\n Unnamed(Vec<(usize, T)>),\\n\\n Unit,\\n\\n}\\n\\n\\n\\nimpl<T> Fields<T> {\\n\\n pub fn iter<'a>(&'a self) -> FieldsIter<'a, T> {\\n\\n match self {\\n\\n Fields::Named(v) => FieldsIter::Named(v.iter()),\\n\\n Fields::Unnamed(v) => FieldsIter::Unnamed(v.iter()),\\n\\n Fields::Unit => FieldsIter::Unit,\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"syn-meta-ext/src/ast.rs\",\n \"rank\": 18,\n \"score\": 134308.64519629756\n },\n {\n \"content\": \"#[cfg(feature = \\\"suggestions\\\")]\\n\\nfn did_you_mean<'a, T, I>(field: &str, alternates: I) -> Option<String>\\n\\nwhere\\n\\n T: AsRef<str> + 'a,\\n\\n I: IntoIterator<Item = &'a T>,\\n\\n{\\n\\n let mut candidate: Option<(f64, &str)> = None;\\n\\n for pv in alternates {\\n\\n let confidence = ::strsim::jaro_winkler(field, pv.as_ref());\\n\\n if confidence > 0.8 && (candidate.is_none() || (candidate.as_ref().unwrap().0 < confidence)) {\\n\\n candidate = Some((confidence, pv.as_ref()));\\n\\n }\\n\\n }\\n\\n match candidate {\\n\\n None => None,\\n\\n Some((_, candidate)) => Some(candidate.into()),\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"syn-meta-ext/src/error/kind.rs\",\n \"rank\": 19,\n \"score\": 132210.81455122953\n },\n {\n \"content\": \"#[cfg(not(feature = \\\"suggestions\\\"))]\\n\\nfn did_you_mean<'a, T, I>(_field: &str, _alternates: I) -> Option<String>\\n\\nwhere\\n\\n T: AsRef<str> + 'a,\\n\\n I: IntoIterator<Item = &'a T>,\\n\\n{\\n\\n None\\n\\n}\\n\",\n \"file_path\": \"syn-meta-ext/src/error/kind.rs\",\n \"rank\": 20,\n \"score\": 132210.81455122953\n },\n {\n \"content\": \"fn remove_evitable_attrs(input: &mut DeriveInput) {\\n\\n input.visit(&|attrs| {\\n\\n let a = std::mem::replace(attrs, Vec::new());\\n\\n let a = a\\n\\n .into_iter()\\n\\n .filter(|attr| attr.meta().map(|m| !m.is(\\\"evitable\\\")).unwrap_or(true))\\n\\n .collect();\\n\\n std::mem::replace(attrs, a);\\n\\n });\\n\\n}\\n\\n\\n\",\n \"file_path\": \"evitable-derive-core/src/lib.rs\",\n \"rank\": 21,\n \"score\": 131801.23470275788\n },\n {\n \"content\": \"/// Trait for \\\"error kinds\\\". An `ErrorKind` enum is generated for\\n\\n/// every `#[evitable]` type which typically just contains\\n\\n/// variants for each error variant (or just a single variant in\\n\\n/// case of error structs).\\n\\npub trait EvitableErrorKind: PartialEq + Display {}\\n\\n\\n\",\n \"file_path\": \"evitable/src/lib.rs\",\n \"rank\": 22,\n \"score\": 126392.02165136699\n },\n {\n \"content\": \" }\\n\\n}\\n\\n\\n\\nimpl Error {\\n\\n /// Create a new error about a literal string that doesn't match a set of known\\n\\n /// or permissible values. This function can be made public if the API proves useful\\n\\n /// beyond impls for `syn` types.\\n\\n pub(crate) fn unknown_lit_str_value(value: &LitStr) -> Self {\\n\\n Error::unknown_value(&value.value()).with_span(value)\\n\\n }\\n\\n}\\n\\n\\n\\n/// Error instance methods\\n\\nimpl Error {\\n\\n /// Check if this error is associated with a span in the token stream.\\n\\n pub fn has_span(&self) -> bool {\\n\\n self.span.is_some()\\n\\n }\\n\\n\\n\\n /// Tie a span to the error if none is already present. This is used in `darling::FromMeta`\\n\",\n \"file_path\": \"syn-meta-ext/src/error/mod.rs\",\n \"rank\": 23,\n \"score\": 109294.36814373499\n },\n {\n \"content\": \"use proc_macro2::{Span, TokenStream};\\n\\nuse std::error::Error as StdError;\\n\\nuse std::fmt;\\n\\nuse std::iter::{self, Iterator};\\n\\nuse std::string::ToString;\\n\\nuse std::vec;\\n\\nuse syn::spanned::Spanned;\\n\\nuse syn::{Lit, LitStr};\\n\\n\\n\\nmod kind;\\n\\n\\n\\nuse self::kind::{ErrorKind, ErrorUnknownField};\\n\\n\\n\\n/// An alias of `Result` specific to attribute parsing.\\n\\npub type Result<T> = ::std::result::Result<T, Error>;\\n\\n\\n\\n/// An error encountered during attribute parsing.\\n\\n///\\n\\n/// Given that most errors darling encounters represent code bugs in dependent crates,\\n\\n/// the internal structure of the error is deliberately opaque.\\n\",\n \"file_path\": \"syn-meta-ext/src/error/mod.rs\",\n \"rank\": 24,\n \"score\": 109289.22971890547\n },\n {\n \"content\": \" /// Creates a new error for a field which has an unexpected literal type.\\n\\n pub fn unexpected_type(ty: &str) -> Self {\\n\\n Error::new(ErrorKind::UnexpectedType(ty.into()))\\n\\n }\\n\\n\\n\\n /// Creates a new error for a field which has an unexpected literal type. This will automatically\\n\\n /// extract the literal type name from the passed-in `Lit` and set the span to encompass only the\\n\\n /// literal value.\\n\\n pub fn unexpected_lit_type(lit: &Lit) -> Self {\\n\\n Error::unexpected_type(match *lit {\\n\\n Lit::Str(_) => \\\"string\\\",\\n\\n Lit::ByteStr(_) => \\\"byte string\\\",\\n\\n Lit::Byte(_) => \\\"byte\\\",\\n\\n Lit::Char(_) => \\\"char\\\",\\n\\n Lit::Int(_) => \\\"int\\\",\\n\\n Lit::Float(_) => \\\"float\\\",\\n\\n Lit::Bool(_) => \\\"bool\\\",\\n\\n Lit::Verbatim(_) => \\\"verbatim\\\",\\n\\n })\\n\\n .with_span(lit)\\n\",\n \"file_path\": \"syn-meta-ext/src/error/mod.rs\",\n \"rank\": 25,\n \"score\": 109288.48560503374\n },\n {\n \"content\": \" /// and other traits to attach errors to the most specific possible location in the input\\n\\n /// source code.\\n\\n ///\\n\\n /// All `darling`-built impls, either from the crate or from the proc macro, will call this\\n\\n /// when appropriate during parsing, so it should not be necessary to call this unless you have\\n\\n /// overridden:\\n\\n ///\\n\\n /// * `FromMeta::from_meta`\\n\\n /// * `FromMeta::from_nested_meta`\\n\\n /// * `FromMeta::from_value`\\n\\n pub fn with_span<T: Spanned>(mut self, node: &T) -> Self {\\n\\n if !self.has_span() {\\n\\n self.span = Some(node.span());\\n\\n }\\n\\n\\n\\n self\\n\\n }\\n\\n\\n\\n /// Recursively converts a tree of errors to a flattened list.\\n\\n pub fn flatten(self) -> Self {\\n\",\n \"file_path\": \"syn-meta-ext/src/error/mod.rs\",\n \"rank\": 26,\n \"score\": 109286.70991709961\n },\n {\n \"content\": \"\\n\\nimpl Iterator for IntoIter {\\n\\n type Item = Error;\\n\\n\\n\\n fn next(&mut self) -> Option<Error> {\\n\\n self.inner.next()\\n\\n }\\n\\n}\\n\\n\\n\\n#[cfg(test)]\\n\\nmod tests {\\n\\n use super::Error;\\n\\n\\n\\n #[test]\\n\\n fn flatten_noop() {\\n\\n let err = Error::duplicate_field(\\\"hello\\\").at(\\\"world\\\");\\n\\n assert_eq!(err.clone().flatten(), err);\\n\\n }\\n\\n\\n\\n #[test]\\n\",\n \"file_path\": \"syn-meta-ext/src/error/mod.rs\",\n \"rank\": 27,\n \"score\": 109284.22914422497\n },\n {\n \"content\": \"\\n\\n /// Gets the location slice.\\n\\n #[cfg(test)]\\n\\n pub(crate) fn location(&self) -> Vec<&str> {\\n\\n self.locations.iter().map(|i| i.as_str()).collect()\\n\\n }\\n\\n\\n\\n /// Write this error and any children as compile errors into a `TokenStream` to\\n\\n /// be returned by the proc-macro.\\n\\n ///\\n\\n /// Return these tokens unmodified to avoid disturbing the attached span information.\\n\\n pub fn write_errors(self) -> TokenStream {\\n\\n self\\n\\n .flatten()\\n\\n .into_iter()\\n\\n .map(|e| e.single_to_syn_error().to_compile_error())\\n\\n .collect()\\n\\n }\\n\\n\\n\\n fn single_to_syn_error(self) -> ::syn::Error {\\n\",\n \"file_path\": \"syn-meta-ext/src/error/mod.rs\",\n \"rank\": 28,\n \"score\": 109284.16084355667\n },\n {\n \"content\": \" /// # Panics\\n\\n /// This function will panic if `errors.is_empty() == true`.\\n\\n pub fn multiple(mut errors: Vec<Error>) -> Self {\\n\\n if errors.len() > 1 {\\n\\n Error::new(ErrorKind::Multiple(errors))\\n\\n } else if errors.len() == 1 {\\n\\n errors\\n\\n .pop()\\n\\n .expect(\\\"Error array of length 1 has a first item\\\")\\n\\n } else {\\n\\n panic!(\\\"Can't deal with 0 errors\\\")\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\nimpl From<syn::Error> for Error {\\n\\n fn from(e: syn::Error) -> Self {\\n\\n let mut ret = Error::new(ErrorKind::Parse(e.to_string()));\\n\\n ret.span = Some(e.span());\\n\\n ret\\n\",\n \"file_path\": \"syn-meta-ext/src/error/mod.rs\",\n \"rank\": 29,\n \"score\": 109283.05848631788\n },\n {\n \"content\": \"\\n\\nimpl IntoIterator for Error {\\n\\n type Item = Error;\\n\\n type IntoIter = IntoIter;\\n\\n\\n\\n fn into_iter(self) -> IntoIter {\\n\\n if let ErrorKind::Multiple(errors) = self.kind {\\n\\n IntoIter {\\n\\n inner: IntoIterEnum::Multiple(errors.into_iter()),\\n\\n }\\n\\n } else {\\n\\n IntoIter {\\n\\n inner: IntoIterEnum::Single(iter::once(self)),\\n\\n }\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"syn-meta-ext/src/error/mod.rs\",\n \"rank\": 30,\n \"score\": 109280.93566049571\n },\n {\n \"content\": \" match self.span {\\n\\n Some(span) => ::syn::Error::new(span, self.kind),\\n\\n None => ::syn::Error::new(Span::call_site(), self),\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\nimpl StdError for Error {\\n\\n fn description(&self) -> &str {\\n\\n &self.kind.description()\\n\\n }\\n\\n\\n\\n fn cause(&self) -> Option<&StdError> {\\n\\n None\\n\\n }\\n\\n}\\n\\n\\n\\nimpl fmt::Display for Error {\\n\\n fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {\\n\\n write!(f, \\\"{}\\\", self.kind)?;\\n\",\n \"file_path\": \"syn-meta-ext/src/error/mod.rs\",\n \"rank\": 31,\n \"score\": 109280.87471236807\n },\n {\n \"content\": \"#[derive(Debug)]\\n\\n#[cfg_attr(test, derive(Clone))]\\n\\npub struct Error {\\n\\n kind: ErrorKind,\\n\\n locations: Vec<String>,\\n\\n /// The span to highlight in the emitted diagnostic.\\n\\n span: Option<Span>,\\n\\n}\\n\\n\\n\\n/// Error creation functions\\n\\nimpl Error {\\n\\n pub(self) fn new(kind: ErrorKind) -> Self {\\n\\n Error {\\n\\n kind,\\n\\n locations: Vec::new(),\\n\\n span: None,\\n\\n }\\n\\n }\\n\\n\\n\\n /// Creates a new error with a custom message.\\n\",\n \"file_path\": \"syn-meta-ext/src/error/mod.rs\",\n \"rank\": 32,\n \"score\": 109280.48057118335\n },\n {\n \"content\": \" }\\n\\n\\n\\n /// Creates a new error for a value which doesn't match a set of expected literals.\\n\\n pub fn unknown_value(value: &str) -> Self {\\n\\n Error::new(ErrorKind::UnknownValue(value.into()))\\n\\n }\\n\\n\\n\\n /// Creates a new error for a list which did not get enough items to proceed.\\n\\n pub fn too_few_items(min: usize) -> Self {\\n\\n Error::new(ErrorKind::TooFewItems(min))\\n\\n }\\n\\n\\n\\n /// Creates a new error when a list got more items than it supports. The `max` argument\\n\\n /// is the largest number of items the receiver could accept.\\n\\n pub fn too_many_items(max: usize) -> Self {\\n\\n Error::new(ErrorKind::TooManyItems(max))\\n\\n }\\n\\n\\n\\n /// Bundle a set of multiple errors into a single `Error` instance.\\n\\n ///\\n\",\n \"file_path\": \"syn-meta-ext/src/error/mod.rs\",\n \"rank\": 33,\n \"score\": 109280.28622625684\n },\n {\n \"content\": \" /// Creates a new error for a field name that appears in the input but does not correspond to\\n\\n /// a known attribute. The second argument is the list of known attributes; if a similar name\\n\\n /// is found that will be shown in the emitted error message.\\n\\n pub fn unknown_field_with_alts<'a, T, I>(field: &str, alternates: I) -> Self\\n\\n where\\n\\n T: AsRef<str> + 'a,\\n\\n I: IntoIterator<Item = &'a T>,\\n\\n {\\n\\n Error::new(ErrorUnknownField::with_alts(field, alternates).into())\\n\\n }\\n\\n\\n\\n /// Creates a new error for a struct or variant that does not adhere to the supported shape.\\n\\n pub fn unsupported_shape(shape: &str) -> Self {\\n\\n Error::new(ErrorKind::UnsupportedShape(shape.into()))\\n\\n }\\n\\n\\n\\n pub fn unsupported_format(format: &str) -> Self {\\n\\n Error::new(ErrorKind::UnexpectedFormat(format.into()))\\n\\n }\\n\\n\\n\",\n \"file_path\": \"syn-meta-ext/src/error/mod.rs\",\n \"rank\": 34,\n \"score\": 109279.68006346026\n },\n {\n \"content\": \" Error::multiple(self.into_vec())\\n\\n }\\n\\n\\n\\n fn into_vec(self) -> Vec<Self> {\\n\\n if let ErrorKind::Multiple(errors) = self.kind {\\n\\n let mut flat = Vec::new();\\n\\n for error in errors {\\n\\n flat.extend(error.prepend_at(self.locations.clone()).into_vec());\\n\\n }\\n\\n\\n\\n flat\\n\\n } else {\\n\\n vec![self]\\n\\n }\\n\\n }\\n\\n\\n\\n /// Adds a location to the error, such as a field or variant.\\n\\n /// Locations must be added in reverse order of specificity.\\n\\n pub fn at<T: fmt::Display>(mut self, location: T) -> Self {\\n\\n self.locations.insert(0, location.to_string());\\n\",\n \"file_path\": \"syn-meta-ext/src/error/mod.rs\",\n \"rank\": 35,\n \"score\": 109278.97643753214\n },\n {\n \"content\": \" pub fn custom<T: fmt::Display>(msg: T) -> Self {\\n\\n Error::new(ErrorKind::Custom(msg.to_string()))\\n\\n }\\n\\n\\n\\n /// Creates a new error for a field that appears twice in the input.\\n\\n pub fn duplicate_field(name: &str) -> Self {\\n\\n Error::new(ErrorKind::DuplicateField(name.into()))\\n\\n }\\n\\n\\n\\n /// Creates a new error for a non-optional field that does not appear in the input.\\n\\n pub fn missing_field(name: &str) -> Self {\\n\\n Error::new(ErrorKind::MissingField(name.into()))\\n\\n }\\n\\n\\n\\n /// Creates a new error for a field name that appears in the input but does not correspond\\n\\n /// to a known field.\\n\\n pub fn unknown_field(name: &str) -> Self {\\n\\n Error::new(ErrorKind::UnknownField(name.into()))\\n\\n }\\n\\n\\n\",\n \"file_path\": \"syn-meta-ext/src/error/mod.rs\",\n \"rank\": 36,\n \"score\": 109278.15021806167\n },\n {\n \"content\": \" self\\n\\n }\\n\\n\\n\\n /// Gets the number of individual errors in this error.\\n\\n ///\\n\\n /// This function never returns `0`, as it's impossible to construct\\n\\n /// a multi-error from an empty `Vec`.\\n\\n pub fn len(&self) -> usize {\\n\\n self.kind.len()\\n\\n }\\n\\n\\n\\n /// Adds a location chain to the head of the error's existing locations.\\n\\n fn prepend_at(mut self, mut locations: Vec<String>) -> Self {\\n\\n if !locations.is_empty() {\\n\\n locations.extend(self.locations);\\n\\n self.locations = locations;\\n\\n }\\n\\n\\n\\n self\\n\\n }\\n\",\n \"file_path\": \"syn-meta-ext/src/error/mod.rs\",\n \"rank\": 37,\n \"score\": 109276.86296661441\n },\n {\n \"content\": \" if !self.locations.is_empty() {\\n\\n write!(f, \\\" at {}\\\", self.locations.join(\\\"/\\\"))?;\\n\\n }\\n\\n\\n\\n Ok(())\\n\\n }\\n\\n}\\n\\n\\n\\n// Don't want to publicly commit to Error supporting equality yet, but\\n\\n// not having it makes testing very difficult. Note that spans are not\\n\\n// considered for equality since that would break testing in most cases.\\n\\n#[cfg(test)]\\n\\nimpl PartialEq for Error {\\n\\n fn eq(&self, other: &Self) -> bool {\\n\\n self.kind == other.kind && self.locations == other.locations\\n\\n }\\n\\n}\\n\\n\\n\\n#[cfg(test)]\\n\\nimpl Eq for Error {}\\n\",\n \"file_path\": \"syn-meta-ext/src/error/mod.rs\",\n \"rank\": 38,\n \"score\": 109276.3561837629\n },\n {\n \"content\": \" fn flatten_simple() {\\n\\n let err = Error::multiple(vec![\\n\\n Error::unknown_field(\\\"hello\\\").at(\\\"world\\\"),\\n\\n Error::missing_field(\\\"hell_no\\\").at(\\\"world\\\"),\\n\\n ])\\n\\n .at(\\\"foo\\\")\\n\\n .flatten();\\n\\n\\n\\n assert!(err.location().is_empty());\\n\\n\\n\\n let mut err_iter = err.into_iter();\\n\\n\\n\\n let first = err_iter.next();\\n\\n assert!(first.is_some());\\n\\n assert_eq!(first.unwrap().location(), vec![\\\"foo\\\", \\\"world\\\"]);\\n\\n\\n\\n let second = err_iter.next();\\n\\n assert!(second.is_some());\\n\\n\\n\\n assert_eq!(second.unwrap().location(), vec![\\\"foo\\\", \\\"world\\\"]);\\n\",\n \"file_path\": \"syn-meta-ext/src/error/mod.rs\",\n \"rank\": 39,\n \"score\": 109272.51742404282\n },\n {\n \"content\": \"\\n\\n assert!(err_iter.next().is_none());\\n\\n }\\n\\n\\n\\n #[test]\\n\\n fn len_single() {\\n\\n let err = Error::duplicate_field(\\\"hello\\\");\\n\\n assert_eq!(1, err.len());\\n\\n }\\n\\n\\n\\n #[test]\\n\\n fn len_multiple() {\\n\\n let err = Error::multiple(vec![\\n\\n Error::duplicate_field(\\\"hello\\\"),\\n\\n Error::missing_field(\\\"hell_no\\\"),\\n\\n ]);\\n\\n assert_eq!(2, err.len());\\n\\n }\\n\\n\\n\\n #[test]\\n\",\n \"file_path\": \"syn-meta-ext/src/error/mod.rs\",\n \"rank\": 40,\n \"score\": 109272.22067807186\n },\n {\n \"content\": \" fn len_nested() {\\n\\n let err = Error::multiple(vec![\\n\\n Error::duplicate_field(\\\"hello\\\"),\\n\\n Error::multiple(vec![\\n\\n Error::duplicate_field(\\\"hi\\\"),\\n\\n Error::missing_field(\\\"bye\\\"),\\n\\n Error::multiple(vec![Error::duplicate_field(\\\"whatsup\\\")]),\\n\\n ]),\\n\\n ]);\\n\\n\\n\\n assert_eq!(4, err.len());\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"syn-meta-ext/src/error/mod.rs\",\n \"rank\": 41,\n \"score\": 109270.68412269409\n },\n {\n \"content\": \"struct ErrorType {\\n\\n ident: Ident,\\n\\n prefix: Option<String>,\\n\\n vis: Visibility,\\n\\n generics: Generics,\\n\\n data: ErrorData,\\n\\n attrs: ErrorTypeAttrs,\\n\\n mod_name: Ident,\\n\\n mod_vis: Visibility,\\n\\n impls_from: Vec<from::FromImplFor>,\\n\\n}\\n\\n\\n\",\n \"file_path\": \"evitable-derive-core/src/lib.rs\",\n \"rank\": 42,\n \"score\": 106005.00863828407\n },\n {\n \"content\": \"/// Trait implemented for all error types generated by `#[evitable]`.\\n\\n/// Allows for creating new errors from the [ErrorContext](ErrorContext), and\\n\\n/// allows getting the error kind.\\n\\npub trait EvitableError: StdError + Sized + Send + Sync + 'static {\\n\\n /// Error kind type. Generated by `#[evitable]`.\\n\\n type Kind: EvitableErrorKind;\\n\\n\\n\\n /// Error context type. The type marked by `#[evitable]`.\\n\\n type Context: ErrorContext<Error = Self, Kind = Self::Kind>;\\n\\n\\n\\n /// Create a new error instance, based on an error context and an optional source error.\\n\\n /// Instead of using this directly, see [from_error_context](EvitableError::from_error_context) when\\n\\n /// wanting to create error instances with source errors, and [from_context](EvitableError::from_context)\\n\\n /// when not. Derived implementations of this trait also implements `From<ErrorContext>`, so using\\n\\n /// [from](std::convert::From::from) or [into](std::convert::Into::into) is also an option.\\n\\n ///\\n\\n /// # Arguments\\n\\n ///\\n\\n /// * `context` - Error context\\n\\n /// * `source` - Optional error source\\n\\n ///\\n\\n /// # Example\\n\\n ///\\n\",\n \"file_path\": \"evitable/src/lib.rs\",\n \"rank\": 43,\n \"score\": 105666.56863991338\n },\n {\n \"content\": \"/// Extension trait for option and result types for easy convertion\\n\\n/// to evitable errors.\\n\\npub trait OptionExt<T, C: ErrorContext> {\\n\\n /// Convert to a [Result](std::result::Result) where ther error\\n\\n /// case is constructed from the given context factory.\\n\\n ///\\n\\n /// # Arguments\\n\\n ///\\n\\n /// * `f` - Error context factory\\n\\n ///\\n\\n /// # Example\\n\\n ///\\n\\n /// ```rust\\n\\n ///# use evitable::*;\\n\\n ///# use std::io;\\n\\n /// #[evitable(description = \\\"Error\\\")]\\n\\n /// pub struct Context(u8);\\n\\n ///\\n\\n /// // Later\\n\\n ///# fn main() {\\n\\n /// let option_error: Option<u8> = None;\\n\\n /// let io_error: std::io::Result<u8> = Err(io::Error::from(io::ErrorKind::NotFound));\\n\",\n \"file_path\": \"evitable/src/lib.rs\",\n \"rank\": 44,\n \"score\": 105408.51194101041\n },\n {\n \"content\": \"struct ErrorTypeAttrs {\\n\\n error_type_name: TypeAliasName,\\n\\n result_type_name: TypeAliasName,\\n\\n kind_type_name: TypeAliasName,\\n\\n}\\n\\n\\n\\nimpl ErrorTypeAttrs {\\n\\n fn from_attrs(attrs: &mut Attrs) -> Result<Self> {\\n\\n let error_type_name = attrs.get_optional(\\\"error_type\\\")?.unwrap_or_default();\\n\\n let result_type_name = attrs.get_optional(\\\"result_type\\\")?.unwrap_or_default();\\n\\n let kind_type_name = attrs.get_optional(\\\"kind_type\\\")?.unwrap_or_default();\\n\\n\\n\\n Ok(Self {\\n\\n error_type_name,\\n\\n result_type_name,\\n\\n kind_type_name,\\n\\n })\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"evitable-derive-core/src/lib.rs\",\n \"rank\": 45,\n \"score\": 103089.4433668907\n },\n {\n \"content\": \"#[test]\\n\\npub fn test_both() {\\n\\n let _ = NotFoundError::from(NotFoundContext);\\n\\n let _ = BadRequestError::from(BadRequestContext);\\n\\n}\\n\",\n \"file_path\": \"evitable/tests/multiple.rs\",\n \"rank\": 46,\n \"score\": 99009.19936339183\n },\n {\n \"content\": \"/// Error context trait, typically used with `#[evitable]`.\\n\\n/// This produces Error and ErrorKind types for the given context.\\n\\npub trait ErrorContext: Display + Debug + Sized + Send + Sync + 'static {\\n\\n /// Associated error kind enum.\\n\\n type Kind: EvitableErrorKind;\\n\\n\\n\\n /// Associated error struct.\\n\\n type Error: EvitableError<Context = Self, Kind = Self::Kind>;\\n\\n\\n\\n /// Get the error kind.\\n\\n ///\\n\\n /// # Example\\n\\n ///\\n\\n /// ```rust\\n\\n ///# use evitable::*;\\n\\n /// #[evitable]\\n\\n /// pub enum Context {\\n\\n /// #[evitable(description(\\\"Io error ({})\\\", 0))]\\n\\n /// Io(u8),\\n\\n ///\\n\\n /// #[evitable(description = \\\"Fmt error\\\")]\\n\\n /// Fmt,\\n\",\n \"file_path\": \"evitable/src/lib.rs\",\n \"rank\": 47,\n \"score\": 95056.84122362596\n },\n {\n \"content\": \"/// Extension trait for result types (and other types carrying\\n\\n/// errors with them).\\n\\npub trait ResultExt<T, E, C: ErrorContext>: OptionExt<T, C> {\\n\\n /// Convert to a [Result](std::result::Result) where ther error\\n\\n /// case is constructed from the given context factory which also\\n\\n /// accepts a reference to the original error.\\n\\n ///\\n\\n /// # Arguments\\n\\n ///\\n\\n /// * `f` - Error context factory\\n\\n ///\\n\\n /// # Example\\n\\n ///\\n\\n /// ```rust\\n\\n ///# use evitable::*;\\n\\n ///# use std::io;\\n\\n /// #[evitable(description = \\\"Error\\\")]\\n\\n /// pub struct Context(String);\\n\\n ///\\n\\n /// // Later\\n\\n ///# fn main() {\\n\\n /// let io_error: std::io::Result<u8> = Err(io::Error::from(io::ErrorKind::NotFound));\\n\",\n \"file_path\": \"evitable/src/lib.rs\",\n \"rank\": 48,\n \"score\": 87674.632856866\n },\n {\n \"content\": \"struct ErrorStruct {\\n\\n description: ResolvedDescription,\\n\\n from_impls: Vec<FromImpl>,\\n\\n fields: Fields<ErrorField>,\\n\\n}\\n\\n\\n\",\n \"file_path\": \"evitable-derive-core/src/lib.rs\",\n \"rank\": 49,\n \"score\": 87008.85097153844\n },\n {\n \"content\": \" trait AssertImpl {\\n\\n #[inline]\\n\\n fn assert() {}\\n\\n }\\n\\n\\n\\n impl<T: #trait_path> AssertImpl for AssertHelper<T> {}\\n\\n AssertHelper::<#ty>::assert();\\n\\n }})\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"evitable-derive-core/src/trait_assert.rs\",\n \"rank\": 50,\n \"score\": 85102.57232874782\n },\n {\n \"content\": \"\\n\\nimpl<'a, T> Iterator for FieldsIter<'a, T> {\\n\\n type Item = (Option<&'a Ident>, &'a T);\\n\\n\\n\\n fn next(&mut self) -> Option<Self::Item> {\\n\\n match self {\\n\\n FieldsIter::Named(iter) => match iter.next() {\\n\\n None => None,\\n\\n Some(tpl) => Some((Some(&tpl.0), &tpl.1)),\\n\\n },\\n\\n\\n\\n FieldsIter::Unnamed(iter) => match iter.next() {\\n\\n None => None,\\n\\n Some((_, val)) => Some((None, val)),\\n\\n },\\n\\n\\n\\n FieldsIter::Unit => None,\\n\\n }\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"syn-meta-ext/src/ast.rs\",\n \"rank\": 51,\n \"score\": 84879.75812027688\n },\n {\n \"content\": \" fn try_map_fields<E, U>(\\n\\n self,\\n\\n f: impl Fn(&'a syn::Field) -> Result<U, E>,\\n\\n ) -> Result<Fields<U>, E> {\\n\\n match self {\\n\\n syn::Fields::Named(fields) => {\\n\\n let mut v = Vec::with_capacity(fields.named.len());\\n\\n for field in &fields.named {\\n\\n let ident = field.ident.clone().unwrap();\\n\\n v.push((ident, f(field)?))\\n\\n }\\n\\n\\n\\n Ok(Fields::Named(v))\\n\\n }\\n\\n\\n\\n syn::Fields::Unnamed(fields) => {\\n\\n let mut v = Vec::with_capacity(fields.unnamed.len());\\n\\n for (index, field) in fields.unnamed.iter().enumerate() {\\n\\n v.push((index, f(field)?))\\n\\n }\\n\",\n \"file_path\": \"syn-meta-ext/src/ast.rs\",\n \"rank\": 52,\n \"score\": 84873.2519372441\n },\n {\n \"content\": \"\\n\\n Ok(Fields::Unnamed(v))\\n\\n }\\n\\n\\n\\n syn::Fields::Unit => Ok(Fields::Unit),\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\nimpl<T> MapFields<T> for Fields<T> {\\n\\n fn try_map_fields<E, U>(self, f: impl Fn(T) -> Result<U, E>) -> Result<Fields<U>, E> {\\n\\n match self {\\n\\n Fields::Named(fields) => {\\n\\n let mut v = Vec::with_capacity(fields.len());\\n\\n for field in fields {\\n\\n v.push((field.0, f(field.1)?))\\n\\n }\\n\\n\\n\\n Ok(Fields::Named(v))\\n\\n }\\n\",\n \"file_path\": \"syn-meta-ext/src/ast.rs\",\n \"rank\": 53,\n \"score\": 84867.65431113541\n },\n {\n \"content\": \" }\\n\\n\\n\\n Ok(Fields::Named(v))\\n\\n }\\n\\n\\n\\n syn::Fields::Unnamed(fields) => {\\n\\n let mut v = Vec::with_capacity(fields.unnamed.len());\\n\\n for (index, field) in fields.unnamed.into_iter().enumerate() {\\n\\n v.push((index, f(field)?))\\n\\n }\\n\\n\\n\\n Ok(Fields::Unnamed(v))\\n\\n }\\n\\n\\n\\n syn::Fields::Unit => Ok(Fields::Unit),\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\nimpl<'a> MapFields<&'a syn::Field> for &'a syn::Fields {\\n\",\n \"file_path\": \"syn-meta-ext/src/ast.rs\",\n \"rank\": 54,\n \"score\": 84866.67098198408\n },\n {\n \"content\": \"use syn::Ident;\\n\\n\\n\",\n \"file_path\": \"syn-meta-ext/src/ast.rs\",\n \"rank\": 55,\n \"score\": 84865.37437331474\n },\n {\n \"content\": \"\\n\\n Fields::Unnamed(fields) => {\\n\\n let mut v = Vec::with_capacity(fields.len());\\n\\n for (index, field) in fields {\\n\\n v.push((index, f(field)?))\\n\\n }\\n\\n\\n\\n Ok(Fields::Unnamed(v))\\n\\n }\\n\\n\\n\\n Fields::Unit => Ok(Fields::Unit),\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\npub enum FieldsIter<'a, T> {\\n\\n Named(std::slice::Iter<'a, (Ident, T)>),\\n\\n Unnamed(std::slice::Iter<'a, (usize, T)>),\\n\\n Unit,\\n\\n}\\n\",\n \"file_path\": \"syn-meta-ext/src/ast.rs\",\n \"rank\": 56,\n \"score\": 84864.20212841187\n },\n {\n \"content\": \"struct TraitAssertion<'a> {\\n\\n ty: &'a Type,\\n\\n trait_path: &'a Path,\\n\\n}\\n\\n\\n\\nimpl<'a> ToTokens for TraitAssertion<'a> {\\n\\n fn to_tokens(&self, tokens: &mut TokenStream) {\\n\\n let ty = &self.ty;\\n\\n let trait_path = &self.trait_path;\\n\\n tokens.extend(quote! {{\\n\\n #[allow(dead_code)]\\n\\n struct AssertHelper<T>(::std::marker::PhantomData<*const T>);\\n\",\n \"file_path\": \"evitable-derive-core/src/trait_assert.rs\",\n \"rank\": 57,\n \"score\": 83531.04107411475\n },\n {\n \"content\": \"use super::error::{Error, Result};\\n\\nuse proc_macro2::TokenStream;\\n\\nuse syn::{\\n\\n Attribute, Data, DataEnum, DataStruct, DataUnion, DeriveInput, Generics, Ident, Visibility,\\n\\n};\\n\\n\\n\\n/// Creates an instance by parsing an entire proc-macro `derive` input,\\n\\n/// including the, identity, generics, and visibility of the type.\\n\\n///\\n\\n/// This trait should either be derived or manually implemented by a type\\n\\n/// in the proc macro crate which is directly using `darling`. It is unlikely\\n\\n/// that these implementations will be reusable across crates.\\n\",\n \"file_path\": \"syn-meta-ext/src/from_derive_input.rs\",\n \"rank\": 58,\n \"score\": 81553.14769772442\n },\n {\n \"content\": \" ) -> Result<Self> {\\n\\n Err(Error::unsupported_shape(\\\"union\\\"))\\n\\n }\\n\\n\\n\\n fn from_enum(\\n\\n attrs: &Vec<Attribute>,\\n\\n vis: &Visibility,\\n\\n ident: &Ident,\\n\\n generics: &Generics,\\n\\n input: &DataEnum,\\n\\n ) -> Result<Self> {\\n\\n Err(Error::unsupported_shape(\\\"enum\\\"))\\n\\n }\\n\\n\\n\\n fn from_struct(\\n\\n attrs: &Vec<Attribute>,\\n\\n vis: &Visibility,\\n\\n ident: &Ident,\\n\\n generics: &Generics,\\n\\n input: &DataStruct,\\n\",\n \"file_path\": \"syn-meta-ext/src/from_derive_input.rs\",\n \"rank\": 59,\n \"score\": 81549.88068599244\n },\n {\n \"content\": \" ) -> Result<Self> {\\n\\n Err(Error::unsupported_shape(\\\"struct\\\"))\\n\\n }\\n\\n\\n\\n fn parse(input: TokenStream) -> Result<Self> {\\n\\n let input = syn::parse2(input)?;\\n\\n Self::from_derive_input(&input)\\n\\n }\\n\\n}\\n\\n\\n\\nimpl FromDeriveInput for () {\\n\\n fn from_derive_input(_: &DeriveInput) -> Result<Self> {\\n\\n Ok(())\\n\\n }\\n\\n}\\n\\n\\n\\nimpl FromDeriveInput for DeriveInput {\\n\\n fn from_derive_input(input: &DeriveInput) -> Result<Self> {\\n\\n Ok(input.clone())\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"syn-meta-ext/src/from_derive_input.rs\",\n \"rank\": 60,\n \"score\": 81547.2122625937\n },\n {\n \"content\": \" TooManyItems(_) => \\\"Too many items\\\",\\n\\n Multiple(_) => \\\"Multiple errors\\\",\\n\\n __NonExhaustive => unreachable!(),\\n\\n }\\n\\n }\\n\\n\\n\\n /// Deeply counts the number of errors this item represents.\\n\\n pub fn len(&self) -> usize {\\n\\n if let ErrorKind::Multiple(ref items) = *self {\\n\\n items.iter().map(Error::len).sum()\\n\\n } else {\\n\\n 1\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\nimpl fmt::Display for ErrorKind {\\n\\n fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {\\n\\n use self::ErrorKind::*;\\n\\n\\n\",\n \"file_path\": \"syn-meta-ext/src/error/kind.rs\",\n \"rank\": 61,\n \"score\": 80693.20623446364\n },\n {\n \"content\": \" // TODO make this variant take `!` so it can't exist\\n\\n #[doc(hidden)]\\n\\n __NonExhaustive,\\n\\n}\\n\\n\\n\\nimpl ErrorKind {\\n\\n pub fn description(&self) -> &str {\\n\\n use self::ErrorKind::*;\\n\\n\\n\\n match *self {\\n\\n Custom(ref s) => s,\\n\\n Parse(ref s) => s,\\n\\n DuplicateField(_) => \\\"Duplicate field\\\",\\n\\n MissingField(_) => \\\"Missing field\\\",\\n\\n UnknownField(_) => \\\"Unexpected field\\\",\\n\\n UnsupportedShape(_) => \\\"Unsupported shape\\\",\\n\\n UnexpectedFormat(_) => \\\"Unexpected meta-item format\\\",\\n\\n UnexpectedType(_) => \\\"Unexpected literal type\\\",\\n\\n UnknownValue(_) => \\\"Unknown literal value\\\",\\n\\n TooFewItems(_) => \\\"Too few items\\\",\\n\",\n \"file_path\": \"syn-meta-ext/src/error/kind.rs\",\n \"rank\": 62,\n \"score\": 80692.67708926907\n },\n {\n \"content\": \" T: AsRef<str> + 'a,\\n\\n I: IntoIterator<Item = &'a T>,\\n\\n {\\n\\n ErrorUnknownField::new(field, did_you_mean(field, alternates))\\n\\n }\\n\\n}\\n\\n\\n\\nimpl From<String> for ErrorUnknownField {\\n\\n fn from(name: String) -> Self {\\n\\n ErrorUnknownField::new(name, None)\\n\\n }\\n\\n}\\n\\n\\n\\nimpl<'a> From<&'a str> for ErrorUnknownField {\\n\\n fn from(name: &'a str) -> Self {\\n\\n ErrorUnknownField::new(name, None)\\n\\n }\\n\\n}\\n\\n\\n\\nimpl fmt::Display for ErrorUnknownField {\\n\",\n \"file_path\": \"syn-meta-ext/src/error/kind.rs\",\n \"rank\": 63,\n \"score\": 80692.6621054622\n },\n {\n \"content\": \"/// the user back on the right track.\\n\\n#[derive(Debug)]\\n\\n// Don't want to publicly commit to ErrorKind supporting equality yet, but\\n\\n// not having it makes testing very difficult.\\n\\n#[cfg_attr(test, derive(Clone, PartialEq, Eq))]\\n\\npub(super) struct ErrorUnknownField {\\n\\n name: String,\\n\\n did_you_mean: Option<String>,\\n\\n}\\n\\n\\n\\nimpl ErrorUnknownField {\\n\\n pub fn new<I: Into<String>>(name: I, did_you_mean: Option<String>) -> Self {\\n\\n ErrorUnknownField {\\n\\n name: name.into(),\\n\\n did_you_mean,\\n\\n }\\n\\n }\\n\\n\\n\\n pub fn with_alts<'a, T, I>(field: &str, alternates: I) -> Self\\n\\n where\\n\",\n \"file_path\": \"syn-meta-ext/src/error/kind.rs\",\n \"rank\": 64,\n \"score\": 80689.05178460985\n },\n {\n \"content\": \" match *self {\\n\\n Custom(ref s) => s.fmt(f),\\n\\n Parse(ref s) => write!(f, \\\"Error parsing: {}\\\", s),\\n\\n DuplicateField(ref field) => write!(f, \\\"Duplicate field `{}`\\\", field),\\n\\n MissingField(ref field) => write!(f, \\\"Missing field `{}`\\\", field),\\n\\n UnknownField(ref field) => field.fmt(f),\\n\\n UnsupportedShape(ref shape) => write!(f, \\\"Unsupported shape `{}`\\\", shape),\\n\\n UnexpectedFormat(ref format) => write!(f, \\\"Unexpected meta-item format `{}`\\\", format),\\n\\n UnexpectedType(ref ty) => write!(f, \\\"Unexpected literal type `{}`\\\", ty),\\n\\n UnknownValue(ref val) => write!(f, \\\"Unknown literal value `{}`\\\", val),\\n\\n TooFewItems(ref min) => write!(f, \\\"Too few items: Expected at least {}\\\", min),\\n\\n TooManyItems(ref max) => write!(f, \\\"Too many items: Expected no more than {}\\\", max),\\n\\n Multiple(ref items) if items.len() == 1 => items[0].fmt(f),\\n\\n Multiple(ref items) => {\\n\\n write!(f, \\\"Multiple errors: (\\\")?;\\n\\n let mut first = true;\\n\\n for item in items {\\n\\n if !first {\\n\\n write!(f, \\\", \\\")?;\\n\\n } else {\\n\",\n \"file_path\": \"syn-meta-ext/src/error/kind.rs\",\n \"rank\": 65,\n \"score\": 80688.63255127451\n },\n {\n \"content\": \" first = false;\\n\\n }\\n\\n\\n\\n item.fmt(f)?;\\n\\n }\\n\\n\\n\\n write!(f, \\\")\\\")\\n\\n }\\n\\n __NonExhaustive => unreachable!(),\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\nimpl From<ErrorUnknownField> for ErrorKind {\\n\\n fn from(err: ErrorUnknownField) -> Self {\\n\\n ErrorKind::UnknownField(err)\\n\\n }\\n\\n}\\n\\n\\n\\n/// An error for an unknown field, with a possible \\\"did-you-mean\\\" suggestion to get\\n\",\n \"file_path\": \"syn-meta-ext/src/error/kind.rs\",\n \"rank\": 66,\n \"score\": 80684.47598957559\n },\n {\n \"content\": \"use std::fmt;\\n\\n\\n\\nuse super::Error;\\n\\n\\n\",\n \"file_path\": \"syn-meta-ext/src/error/kind.rs\",\n \"rank\": 67,\n \"score\": 80681.18996610725\n },\n {\n \"content\": \" fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {\\n\\n write!(f, \\\"Unknown field: `{}`\\\", self.name)?;\\n\\n\\n\\n if let Some(ref did_you_mean) = self.did_you_mean {\\n\\n write!(f, \\\". Did you mean `{}`?\\\", did_you_mean)?;\\n\\n }\\n\\n\\n\\n Ok(())\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"syn-meta-ext/src/error/kind.rs\",\n \"rank\": 68,\n \"score\": 80677.1246859909\n },\n {\n \"content\": \"enum ErrorData {\\n\\n Struct(ErrorStruct),\\n\\n Enum(Vec<ErrorVariant>),\\n\\n}\\n\\n\\n\",\n \"file_path\": \"evitable-derive-core/src/lib.rs\",\n \"rank\": 69,\n \"score\": 78535.74176787407\n },\n {\n \"content\": \"trait AttributeTree {\\n\\n fn visit(&mut self, f: &impl Fn(&mut Vec<Attribute>) -> ());\\n\\n}\\n\\n\\n\\nimpl AttributeTree for syn::Field {\\n\\n fn visit(&mut self, f: &impl Fn(&mut Vec<Attribute>) -> ()) {\\n\\n f(&mut self.attrs);\\n\\n }\\n\\n}\\n\\n\\n\\nimpl AttributeTree for syn::FieldsNamed {\\n\\n fn visit(&mut self, f: &impl Fn(&mut Vec<Attribute>) -> ()) {\\n\\n for field in self.named.iter_mut() {\\n\\n field.visit(f);\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\nimpl AttributeTree for syn::FieldsUnnamed {\\n\\n fn visit(&mut self, f: &impl Fn(&mut Vec<Attribute>) -> ()) {\\n\",\n \"file_path\": \"evitable-derive-core/src/lib.rs\",\n \"rank\": 70,\n \"score\": 78154.1942518761\n },\n {\n \"content\": \"struct ErrorVariant {\\n\\n ident: Ident,\\n\\n description: ResolvedDescription,\\n\\n from_impls: Vec<FromImpl>,\\n\\n fields: Fields<ErrorField>,\\n\\n}\\n\\n\\n\\nimpl ErrorVariant {\\n\\n pub(crate) fn destruct(&self) -> TokenStream {\\n\\n match &self.fields {\\n\\n Fields::Unit => TokenStream::new(),\\n\\n Fields::Named(f) => {\\n\\n let idents = f.iter().map(|(i, _)| i);\\n\\n quote! { { #(#idents,)* } }\\n\\n }\\n\\n Fields::Unnamed(f) => {\\n\\n let idents = f.iter().map(|(i, _)| i.into_ident());\\n\\n quote! { ( #(#idents,)* ) }\\n\\n }\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"evitable-derive-core/src/lib.rs\",\n \"rank\": 71,\n \"score\": 78150.23187747928\n },\n {\n \"content\": \"struct ErrorField {\\n\\n ty: Type,\\n\\n include_in_kind: bool,\\n\\n method: CopyMethod,\\n\\n}\\n\\n\\n\\nimpl ErrorField {\\n\\n #[inline]\\n\\n pub fn is_copy(&self) -> bool {\\n\\n self.method.is_copy()\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"evitable-derive-core/src/lib.rs\",\n \"rank\": 72,\n \"score\": 78150.23187747928\n },\n {\n \"content\": \"trait IntoIdent<'a> {\\n\\n fn into_ident(self) -> Cow<'a, Ident>;\\n\\n}\\n\\n\\n\\nimpl<'a> IntoIdent<'a> for Ident {\\n\\n #[inline]\\n\\n fn into_ident(self) -> Cow<'a, Ident> {\\n\\n Cow::Owned(self)\\n\\n }\\n\\n}\\n\\n\\n\\nimpl<'a> IntoIdent<'a> for &'a Ident {\\n\\n #[inline]\\n\\n fn into_ident(self) -> Cow<'a, Ident> {\\n\\n Cow::Borrowed(self)\\n\\n }\\n\\n}\\n\\n\\n\\nimpl<'a> IntoIdent<'a> for String {\\n\\n #[inline]\\n\",\n \"file_path\": \"evitable-derive-core/src/lib.rs\",\n \"rank\": 73,\n \"score\": 78106.56676779348\n },\n {\n \"content\": \"enum TypeAliasName {\\n\\n Default,\\n\\n Override(Ident),\\n\\n Disabled,\\n\\n Enabled,\\n\\n}\\n\\n\\n\\nimpl TypeAliasName {\\n\\n fn ident(&self, default: &str) -> Option<Ident> {\\n\\n match self {\\n\\n TypeAliasName::Disabled => None,\\n\\n TypeAliasName::Override(i) => Some(i.clone()),\\n\\n TypeAliasName::Default | TypeAliasName::Enabled => {\\n\\n Some(Ident::new(default, Span::call_site()))\\n\\n }\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\nimpl Default for TypeAliasName {\\n\",\n \"file_path\": \"evitable-derive-core/src/lib.rs\",\n \"rank\": 74,\n \"score\": 77507.69212181725\n },\n {\n \"content\": \"pub fn inherited(vis: &Visibility, depth: usize) -> Visibility {\\n\\n match vis {\\n\\n Visibility::Public(_) => vis.clone(),\\n\\n Visibility::Crate(_) => vis.clone(),\\n\\n Visibility::Inherited => create_super_vis(depth),\\n\\n Visibility::Restricted(r) => modify_vis(r, depth),\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"evitable-derive-core/src/visibility.rs\",\n \"rank\": 75,\n \"score\": 73216.80269024646\n },\n {\n \"content\": \"fn create_enum_case<'a>(\\n\\n enum_name: &Ident,\\n\\n variant_name: &Ident,\\n\\n case: &ErrorKind<'a>,\\n\\n type_asserts: &mut TokenStream,\\n\\n) -> TokenStream {\\n\\n let mut tokens = TokenStream::new();\\n\\n let extract = match (&case.all_fields, &case.included_fields) {\\n\\n (Fields::Unit, Fields::Unit) => TokenStream::new(),\\n\\n (Fields::Named(_), Fields::Unit) => quote! { { .. } },\\n\\n (Fields::Unnamed(_), Fields::Unit) => quote! { (_) },\\n\\n (Fields::Named(all), Fields::Named(included)) => {\\n\\n if all.len() == included.len() {\\n\\n let idents = all.iter().map(|(n, _)| n);\\n\\n quote! { { #(#idents,)* } }\\n\\n } else {\\n\\n assert!(all.len() > included.len());\\n\\n let idents = included.iter().map(|(n, _)| n);\\n\\n quote! { { #(#idents,)* .. } }\\n\\n }\\n\",\n \"file_path\": \"evitable-derive-core/src/from_context.rs\",\n \"rank\": 76,\n \"score\": 72797.65003249899\n },\n {\n \"content\": \"fn create_struct_kind<'a>(\\n\\n name: &Ident,\\n\\n included_fields: &Fields<&ErrorField>,\\n\\n tokens: &mut TokenStream,\\n\\n type_asserts: &mut TokenStream,\\n\\n) {\\n\\n match included_fields {\\n\\n Fields::Unit => tokens.extend(quote! { ErrorKind::#name }),\\n\\n Fields::Named(fields) => {\\n\\n let mut assignments = Vec::with_capacity(fields.len());\\n\\n for (n, f) in fields.iter() {\\n\\n assert_trait_impl(&f.ty, &f.method.trait_path(), type_asserts);\\n\\n let copy = f.method.copy("e! { &context.#n });\\n\\n assignments.push(quote! { #n: #copy, });\\n\\n }\\n\\n\\n\\n tokens.extend(quote! { ErrorKind::#name { #(#assignments)* } })\\n\\n }\\n\\n Fields::Unnamed(fields) => {\\n\\n let mut assignments = Vec::with_capacity(fields.len());\\n\",\n \"file_path\": \"evitable-derive-core/src/from_context.rs\",\n \"rank\": 77,\n \"score\": 72660.74853157772\n },\n {\n \"content\": \"from_meta_lit!(syn::LitBool, Lit::Bool);\\n\\nfrom_meta_lit!(proc_macro2::Literal, Lit::Verbatim);\\n\\n\\n\\nimpl FromMeta for Meta {\\n\\n fn from_meta(value: &Meta) -> Result<Self> {\\n\\n Ok(value.clone())\\n\\n }\\n\\n}\\n\\n\\n\\nimpl FromMeta for ident_case::RenameRule {\\n\\n fn from_string<S: Spanned>(value: &str, span: &S) -> Result<Self> {\\n\\n value\\n\\n .parse()\\n\\n .map_err(|_| Error::unknown_value(value).with_span(span))\\n\\n }\\n\\n}\\n\\n\\n\\nimpl<T: FromMeta> FromMeta for Option<T> {\\n\\n fn from_meta(item: &Meta) -> Result<Self> {\\n\\n FromMeta::from_meta(item).map(Some)\\n\",\n \"file_path\": \"syn-meta-ext/src/from_meta.rs\",\n \"rank\": 78,\n \"score\": 62655.596225213514\n },\n {\n \"content\": \"use crate::quote::ToTokens;\\n\\nuse proc_macro2::TokenStream;\\n\\nuse std::rc::Rc;\\n\\nuse std::sync::atomic::AtomicBool;\\n\\nuse std::sync::Arc;\\n\\nuse syn::spanned::Spanned;\\n\\nuse syn::{Ident, Lit, Path};\\n\\n\\n\\nuse super::error::{Error, Result};\\n\\nuse super::{Meta, MetaValue, NestedMeta};\\n\\n\\n\",\n \"file_path\": \"syn-meta-ext/src/from_meta.rs\",\n \"rank\": 79,\n \"score\": 62654.94013798437\n },\n {\n \"content\": \"#[cfg(test)]\\n\\nmod tests {\\n\\n use proc_macro2::TokenStream;\\n\\n use syn;\\n\\n\\n\\n use super::Meta;\\n\\n use super::{FromMeta, Result};\\n\\n use crate::AttrExt;\\n\\n\\n\\n /// parse a string as a syn::Meta instance.\\n\\n fn pm(tokens: TokenStream) -> ::std::result::Result<Meta, String> {\\n\\n let attribute: syn::Attribute = parse_quote!(#[#tokens]);\\n\\n attribute.meta().map_err(|_| \\\"Unable to parse\\\".into())\\n\\n }\\n\\n\\n\\n fn fm<T: FromMeta>(tokens: TokenStream) -> T {\\n\\n FromMeta::from_meta(&pm(tokens).expect(\\\"Tests should pass well-formed input\\\"))\\n\\n .expect(\\\"Tests should pass valid input\\\")\\n\\n }\\n\\n\\n\",\n \"file_path\": \"syn-meta-ext/src/from_meta.rs\",\n \"rank\": 80,\n \"score\": 62653.127606400936\n },\n {\n \"content\": \"\\n\\nimpl FromMeta for AtomicBool {\\n\\n fn from_meta(mi: &Meta) -> Result<Self> {\\n\\n FromMeta::from_meta(mi)\\n\\n .map(AtomicBool::new)\\n\\n .map_err(|e| e.with_span(mi))\\n\\n }\\n\\n}\\n\\n\\n\\nimpl FromMeta for String {\\n\\n fn from_string<S: Spanned>(s: &str, _span: &S) -> Result<Self> {\\n\\n Ok(s.to_string())\\n\\n }\\n\\n\\n\\n fn from_path(p: &Path) -> Result<Self> {\\n\\n let mut ss = TokenStream::new();\\n\\n p.to_tokens(&mut ss);\\n\\n Ok(format!(\\\"{}\\\", ss))\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"syn-meta-ext/src/from_meta.rs\",\n \"rank\": 81,\n \"score\": 62651.994424972945\n },\n {\n \"content\": \"\\n\\n/// Generate an impl of `FromMeta` that will accept strings which parse to numbers or\\n\\n/// integer literals.\\n\\nmacro_rules! from_meta_num {\\n\\n ($ty:ident) => {\\n\\n impl FromMeta for $ty {\\n\\n fn from_string<S: Spanned>(s: &str, span: &S) -> Result<Self> {\\n\\n s.parse()\\n\\n .map_err(|_| Error::unknown_value(s).with_span(span))\\n\\n }\\n\\n\\n\\n fn from_lit(value: &Lit) -> Result<Self> {\\n\\n (match value {\\n\\n Lit::Str(s) => Self::from_string(&s.value(), s),\\n\\n Lit::Int(s) => Ok(s.base10_parse()?),\\n\\n v => Err(Error::unexpected_lit_type(value).with_span(&v)),\\n\\n })\\n\\n .map_err(|e| e.with_span(value))\\n\\n }\\n\\n }\\n\",\n \"file_path\": \"syn-meta-ext/src/from_meta.rs\",\n \"rank\": 82,\n \"score\": 62651.11690647849\n },\n {\n \"content\": \" fn from_list(items: &[&NestedMeta]) -> Result<Self> {\\n\\n match items.len() {\\n\\n 0 => Self::from_empty(),\\n\\n 1 => Self::from_nested_meta(&items[0]),\\n\\n _ => Err(Error::unsupported_format(\\\"list\\\")),\\n\\n }\\n\\n }\\n\\n\\n\\n /// Create an instance from a literal value of either `foo = \\\"bar\\\"` or `foo(\\\"bar\\\")`.\\n\\n /// This dispatches to the appropriate method based on the type of literal encountered,\\n\\n /// and generally should not be overridden by implementers.\\n\\n ///\\n\\n /// # Error Spans\\n\\n /// If this method is overridden, the override must make sure to add `value`'s span\\n\\n /// information to the returned error by calling `with_span(value)` on the `Error` instance.\\n\\n fn from_value(value: &MetaValue) -> Result<Self> {\\n\\n (match value {\\n\\n MetaValue::Path(path) => Self::from_path(path),\\n\\n MetaValue::Literal(lit) => Self::from_lit(lit),\\n\\n })\\n\",\n \"file_path\": \"syn-meta-ext/src/from_meta.rs\",\n \"rank\": 83,\n \"score\": 62650.71839213901\n },\n {\n \"content\": \" #[allow(unused_variables)]\\n\\n fn from_string<S: Spanned>(value: &str, span: &S) -> Result<Self> {\\n\\n Err(Error::unexpected_type(\\\"string\\\").with_span(span))\\n\\n }\\n\\n\\n\\n /// Create an instance from a bool literal in a value position.\\n\\n #[allow(unused_variables)]\\n\\n fn from_bool<S: Spanned>(value: bool, span: &S) -> Result<Self> {\\n\\n Err(Error::unexpected_type(\\\"bool\\\").with_span(span))\\n\\n }\\n\\n\\n\\n #[allow(unused_variables)]\\n\\n fn from_ident(value: &Ident) -> Result<Self> {\\n\\n Err(Error::unexpected_type(\\\"ident\\\"))\\n\\n }\\n\\n}\\n\\n\\n\\n// FromMeta impls for std and syn types.\\n\\n\\n\\nimpl FromMeta for () {\\n\",\n \"file_path\": \"syn-meta-ext/src/from_meta.rs\",\n \"rank\": 84,\n \"score\": 62650.50270429675\n },\n {\n \"content\": \" /// source code.\\n\\n fn from_meta(item: &Meta) -> Result<Self> {\\n\\n (match item {\\n\\n Meta::Path(_) => Self::from_empty(),\\n\\n Meta::List(value) => {\\n\\n Self::from_list(value.nested.iter().collect::<Vec<&NestedMeta>>().as_ref())\\n\\n }\\n\\n Meta::NameValue(value) => Self::from_value(&value.val),\\n\\n })\\n\\n .map_err(|e| e.with_span(item))\\n\\n }\\n\\n\\n\\n /// Create an instance from the presence of the word in the attribute with no\\n\\n /// additional options specified.\\n\\n fn from_empty() -> Result<Self> {\\n\\n Err(Error::unsupported_format(\\\"empty\\\"))\\n\\n }\\n\\n\\n\\n /// Create an instance from a list of nested meta items.\\n\\n #[allow(unused_variables)]\\n\",\n \"file_path\": \"syn-meta-ext/src/from_meta.rs\",\n \"rank\": 85,\n \"score\": 62650.3158080975\n },\n {\n \"content\": \" syn::parse_str(value).map_err(|_| Error::unknown_value(value).with_span(span))\\n\\n }\\n\\n\\n\\n fn from_lit(value: &Lit) -> Result<Self> {\\n\\n if let Lit::Str(ref path_str) = *value {\\n\\n path_str\\n\\n .parse()\\n\\n .map_err(|_| Error::unknown_lit_str_value(path_str).with_span(value))\\n\\n } else {\\n\\n Err(Error::unexpected_lit_type(value).with_span(value))\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\nimpl FromMeta for syn::Lit {\\n\\n fn from_lit(value: &Lit) -> Result<Self> {\\n\\n Ok(value.clone())\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"syn-meta-ext/src/from_meta.rs\",\n \"rank\": 86,\n \"score\": 62649.60459961121\n },\n {\n \"content\": \" /// Create an instance from a int literal in a value position.\\n\\n #[allow(unused_variables)]\\n\\n fn from_int<S: Spanned>(value: u64, span: &S) -> Result<Self> {\\n\\n Err(Error::unexpected_type(\\\"int\\\").with_span(span))\\n\\n }\\n\\n\\n\\n /// Create an instance from a char literal in a value position.\\n\\n #[allow(unused_variables)]\\n\\n fn from_path(value: &Path) -> Result<Self> {\\n\\n if value.leading_colon.is_none()\\n\\n && value.segments.len() == 1\\n\\n && value.segments[0].arguments == syn::PathArguments::None\\n\\n {\\n\\n Self::from_ident(&value.segments[0].ident)\\n\\n } else {\\n\\n Err(Error::unexpected_type(\\\"path\\\"))\\n\\n }\\n\\n }\\n\\n\\n\\n /// Create an instance from a string literal in a value position.\\n\",\n \"file_path\": \"syn-meta-ext/src/from_meta.rs\",\n \"rank\": 87,\n \"score\": 62649.48574609685\n },\n {\n \"content\": \"/// when available, but also supports parsing strings with the call site as the\\n\\n/// emitted span.\\n\\nimpl FromMeta for syn::Ident {\\n\\n fn from_ident(value: &Ident) -> Result<Self> {\\n\\n Ok(value.clone())\\n\\n }\\n\\n\\n\\n fn from_string<S: Spanned>(value: &str, span: &S) -> Result<Self> {\\n\\n Ok(syn::Ident::new(value, span.span()))\\n\\n }\\n\\n}\\n\\n\\n\\n/// Parsing support for paths. This attempts to preserve span information when available,\\n\\n/// but also supports parsing strings with the call site as the emitted span.\\n\\nimpl FromMeta for syn::Path {\\n\\n fn from_path(path: &Path) -> Result<Self> {\\n\\n Ok(path.clone())\\n\\n }\\n\\n\\n\\n fn from_string<S: Spanned>(value: &str, span: &S) -> Result<Self> {\\n\",\n \"file_path\": \"syn-meta-ext/src/from_meta.rs\",\n \"rank\": 88,\n \"score\": 62647.74236091694\n },\n {\n \"content\": \"macro_rules! from_meta_lit {\\n\\n ($impl_ty:path, $lit_variant:path) => {\\n\\n impl FromMeta for $impl_ty {\\n\\n fn from_lit(value: &Lit) -> Result<Self> {\\n\\n if let $lit_variant(ref value) = *value {\\n\\n Ok(value.clone())\\n\\n } else {\\n\\n Err(Error::unexpected_lit_type(value).with_span(value))\\n\\n }\\n\\n }\\n\\n }\\n\\n };\\n\\n}\\n\\n\\n\\nfrom_meta_lit!(syn::LitInt, Lit::Int);\\n\\nfrom_meta_lit!(syn::LitFloat, Lit::Float);\\n\\nfrom_meta_lit!(syn::LitStr, Lit::Str);\\n\\nfrom_meta_lit!(syn::LitByte, Lit::Byte);\\n\\nfrom_meta_lit!(syn::LitByteStr, Lit::ByteStr);\\n\\nfrom_meta_lit!(syn::LitChar, Lit::Char);\\n\",\n \"file_path\": \"syn-meta-ext/src/from_meta.rs\",\n \"rank\": 89,\n \"score\": 62647.54948690525\n },\n {\n \"content\": \" .map_err(|e| e.with_span(value))\\n\\n }\\n\\n\\n\\n fn from_lit(lit: &Lit) -> Result<Self> {\\n\\n (match lit {\\n\\n Lit::Bool(b) => Self::from_bool(b.value, b),\\n\\n Lit::Str(s) => Self::from_string(&s.value(), s),\\n\\n Lit::Char(c) => Self::from_char(c.value(), c),\\n\\n Lit::Int(i) => Self::from_int(i.base10_parse()?, i),\\n\\n _ => Err(Error::unexpected_lit_type(lit)),\\n\\n })\\n\\n .map_err(|e| e.with_span(lit))\\n\\n }\\n\\n\\n\\n /// Create an instance from a char literal in a value position.\\n\\n #[allow(unused_variables)]\\n\\n fn from_char<S: Spanned>(value: char, span: &S) -> Result<Self> {\\n\\n Err(Error::unexpected_type(\\\"char\\\").with_span(span))\\n\\n }\\n\\n\\n\",\n \"file_path\": \"syn-meta-ext/src/from_meta.rs\",\n \"rank\": 90,\n \"score\": 62647.19056376134\n },\n {\n \"content\": \" }\\n\\n\\n\\n fn from_list(items: &[&NestedMeta]) -> Result<Self> {\\n\\n let mut ret = Vec::with_capacity(items.len());\\n\\n for item in items {\\n\\n ret.push(T::from_nested_meta(item)?);\\n\\n }\\n\\n\\n\\n Ok(ret)\\n\\n }\\n\\n\\n\\n fn from_value(val: &MetaValue) -> Result<Self> {\\n\\n let mut ret = Vec::with_capacity(1);\\n\\n ret.push(T::from_value(val)?);\\n\\n Ok(ret)\\n\\n }\\n\\n}\\n\\n\\n\\n/// Tests for `FromMeta` implementations. Wherever the word `ignore` appears in test input,\\n\\n/// it should not be considered by the parsing.\\n\",\n \"file_path\": \"syn-meta-ext/src/from_meta.rs\",\n \"rank\": 91,\n \"score\": 62645.45230854758\n },\n {\n \"content\": \" s.parse()\\n\\n .map_err(|_| Error::unknown_value(s).with_span(span))\\n\\n }\\n\\n\\n\\n fn from_lit(value: &Lit) -> Result<Self> {\\n\\n (match value {\\n\\n Lit::Str(s) => Self::from_string(&s.value(), s),\\n\\n Lit::Float(s) => Ok(s.base10_parse()?),\\n\\n v => Err(Error::unexpected_lit_type(value).with_span(&v)),\\n\\n })\\n\\n .map_err(|e| e.with_span(value))\\n\\n }\\n\\n }\\n\\n };\\n\\n}\\n\\n\\n\\nfrom_meta_float!(f32);\\n\\nfrom_meta_float!(f64);\\n\\n\\n\\n/// Parsing support for identifiers. This attempts to preserve span information\\n\",\n \"file_path\": \"syn-meta-ext/src/from_meta.rs\",\n \"rank\": 92,\n \"score\": 62645.15903080945\n },\n {\n \"content\": \" }\\n\\n}\\n\\n\\n\\nimpl<T: FromMeta> FromMeta for Box<T> {\\n\\n fn from_meta(item: &Meta) -> Result<Self> {\\n\\n FromMeta::from_meta(item).map(Box::new)\\n\\n }\\n\\n}\\n\\n\\n\\nimpl<T: FromMeta> FromMeta for Result<T> {\\n\\n fn from_meta(item: &Meta) -> Result<Self> {\\n\\n Ok(FromMeta::from_meta(item))\\n\\n }\\n\\n}\\n\\n\\n\\n/// Parses the meta-item, and in case of error preserves a copy of the input for\\n\\n/// later analysis.\\n\\nimpl<T: FromMeta> FromMeta for ::std::result::Result<T, Meta> {\\n\\n fn from_meta(item: &Meta) -> Result<Self> {\\n\\n T::from_meta(item)\\n\",\n \"file_path\": \"syn-meta-ext/src/from_meta.rs\",\n \"rank\": 93,\n \"score\": 62644.507080653464\n },\n {\n \"content\": \" .map(Ok)\\n\\n .or_else(|_| Ok(Err(item.clone())))\\n\\n }\\n\\n}\\n\\n\\n\\nimpl<T: FromMeta> FromMeta for Rc<T> {\\n\\n fn from_meta(item: &Meta) -> Result<Self> {\\n\\n FromMeta::from_meta(item).map(Rc::new)\\n\\n }\\n\\n}\\n\\n\\n\\nimpl<T: FromMeta> FromMeta for Arc<T> {\\n\\n fn from_meta(item: &Meta) -> Result<Self> {\\n\\n FromMeta::from_meta(item).map(Arc::new)\\n\\n }\\n\\n}\\n\\n\\n\\nimpl<T: FromMeta> FromMeta for Vec<T> {\\n\\n fn from_empty() -> Result<Self> {\\n\\n Ok(Vec::new())\\n\",\n \"file_path\": \"syn-meta-ext/src/from_meta.rs\",\n \"rank\": 94,\n \"score\": 62644.4901734512\n },\n {\n \"content\": \" fn from_empty() -> Result<Self> {\\n\\n Ok(())\\n\\n }\\n\\n}\\n\\n\\n\\nimpl FromMeta for bool {\\n\\n fn from_empty() -> Result<Self> {\\n\\n Ok(true)\\n\\n }\\n\\n\\n\\n fn from_bool<S: Spanned>(value: bool, _: &S) -> Result<Self> {\\n\\n Ok(value)\\n\\n }\\n\\n\\n\\n fn from_string<S: Spanned>(value: &str, span: &S) -> Result<Self> {\\n\\n value\\n\\n .parse()\\n\\n .map_err(|_| Error::unknown_value(value).with_span(span))\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"syn-meta-ext/src/from_meta.rs\",\n \"rank\": 95,\n \"score\": 62642.10934489033\n },\n {\n \"content\": \" };\\n\\n}\\n\\n\\n\\nfrom_meta_num!(u8);\\n\\nfrom_meta_num!(u16);\\n\\nfrom_meta_num!(u32);\\n\\nfrom_meta_num!(u64);\\n\\nfrom_meta_num!(usize);\\n\\nfrom_meta_num!(i8);\\n\\nfrom_meta_num!(i16);\\n\\nfrom_meta_num!(i32);\\n\\nfrom_meta_num!(i64);\\n\\nfrom_meta_num!(isize);\\n\\n\\n\\n/// Generate an impl of `FromMeta` that will accept strings which parse to floats or\\n\\n/// float literals.\\n\\nmacro_rules! from_meta_float {\\n\\n ($ty:ident) => {\\n\\n impl FromMeta for $ty {\\n\\n fn from_string<S: Spanned>(s: &str, span: &S) -> Result<Self> {\\n\",\n \"file_path\": \"syn-meta-ext/src/from_meta.rs\",\n \"rank\": 96,\n \"score\": 62639.81564175402\n },\n {\n \"content\": \" #[test]\\n\\n fn unit_succeeds() {\\n\\n assert_eq!(fm::<()>(quote!(ignore)), ());\\n\\n }\\n\\n\\n\\n #[test]\\n\\n fn bool_succeeds() {\\n\\n // word format\\n\\n assert_eq!(fm::<bool>(quote!(ignore)), true);\\n\\n\\n\\n // bool literal\\n\\n assert_eq!(fm::<bool>(quote!(ignore = true)), true);\\n\\n assert_eq!(fm::<bool>(quote!(ignore = false)), false);\\n\\n\\n\\n // string literals\\n\\n assert_eq!(fm::<bool>(quote!(ignore = \\\"true\\\")), true);\\n\\n assert_eq!(fm::<bool>(quote!(ignore = \\\"false\\\")), false);\\n\\n }\\n\\n\\n\\n #[test]\\n\",\n \"file_path\": \"syn-meta-ext/src/from_meta.rs\",\n \"rank\": 97,\n \"score\": 62637.643611272004\n },\n {\n \"content\": \" fn string_succeeds() {\\n\\n // cooked form\\n\\n assert_eq!(&fm::<String>(quote!(ignore = \\\"world\\\")), \\\"world\\\");\\n\\n\\n\\n // raw form\\n\\n assert_eq!(&fm::<String>(quote!(ignore = r#\\\"world\\\"#)), \\\"world\\\");\\n\\n }\\n\\n\\n\\n #[test]\\n\\n fn number_succeeds() {\\n\\n assert_eq!(fm::<u8>(quote!(ignore = \\\"2\\\")), 2u8);\\n\\n assert_eq!(fm::<i16>(quote!(ignore = \\\"-25\\\")), -25i16);\\n\\n assert_eq!(fm::<f64>(quote!(ignore = \\\"1.4e10\\\")), 1.4e10);\\n\\n }\\n\\n\\n\\n #[test]\\n\\n fn int_without_quotes() {\\n\\n assert_eq!(fm::<u8>(quote!(ignore = 2)), 2u8);\\n\\n assert_eq!(fm::<u16>(quote!(ignore = 255)), 255u16);\\n\\n assert_eq!(fm::<u32>(quote!(ignore = 5000)), 5000u32);\\n\",\n \"file_path\": \"syn-meta-ext/src/from_meta.rs\",\n \"rank\": 98,\n \"score\": 62632.27914791538\n },\n {\n \"content\": \"\\n\\n // Check that we aren't tripped up by incorrect suffixes\\n\\n assert_eq!(fm::<u32>(quote!(ignore = 5000i32)), 5000u32);\\n\\n }\\n\\n\\n\\n #[test]\\n\\n fn float_without_quotes() {\\n\\n assert_eq!(fm::<f32>(quote!(ignore = 2.)), 2.0f32);\\n\\n assert_eq!(fm::<f32>(quote!(ignore = 2.0)), 2.0f32);\\n\\n assert_eq!(fm::<f64>(quote!(ignore = 1.4e10)), 1.4e10f64);\\n\\n }\\n\\n\\n\\n #[test]\\n\\n fn meta_succeeds() {\\n\\n assert_eq!(\\n\\n fm::<Meta>(quote!(hello(world, today))),\\n\\n pm(quote!(hello(world, today))).unwrap()\\n\\n );\\n\\n }\\n\\n\\n\\n /// Tests that fallible parsing will always produce an outer `Ok` (from `fm`),\\n\\n /// and will accurately preserve the inner contents.\\n\\n #[test]\\n\\n fn result_succeeds() {\\n\\n fm::<Result<()>>(quote!(ignore)).unwrap();\\n\\n fm::<Result<()>>(quote!(ignore(world))).unwrap_err();\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"syn-meta-ext/src/from_meta.rs\",\n \"rank\": 99,\n \"score\": 62631.42456905248\n }\n]","isConversational":false}}},{"rowIdx":2394,"cells":{"lang":{"kind":"string","value":"Rust"},"file_path":{"kind":"string","value":"src/api/routes/namespace_routes_api.rs"},"repo_name":{"kind":"string","value":"proximax-storage/rust-xpx-chain-sdk"},"commit":{"kind":"string","value":"55613067328d511dbd9a129be30b9e048ef79175"},"file_code":{"kind":"string","value":"/*\n * Copyright 2018 ProximaX Limited. All rights reserved.\n * Use of this source code is governed by the Apache 2.0\n * license that can be found in the LICENSE file.\n */\n\nuse {\n ::std::{future::Future, pin::Pin, sync::Arc},\n reqwest::Method,\n};\n\nuse crate::{\n account::{AccountsId, Address},\n api::{\n internally::valid_vec_len, request as __internal_request, sirius_client::ApiClient,\n NamespaceInfoDto, NamespaceNameDto,\n },\n errors_const::{ERR_EMPTY_ADDRESSES_IDS, ERR_EMPTY_NAMESPACE_IDS},\n models::Result,\n namespace::{NamespaceId, NamespaceIds, NamespaceInfo, NamespaceName},\n network::NetworkType,\n AssetId,\n};\n\nuse super::{\n NAMESPACES_FROM_ACCOUNTS_ROUTE, NAMESPACES_FROM_ACCOUNT_ROUTES, NAMESPACE_NAMES_ROUTE,\n NAMESPACE_ROUTE,\n};\n\n#[derive(Clone)]\npub struct NamespaceRoutes(Arc<ApiClient>, NetworkType);\n\nimpl NamespaceRoutes {\n pub(crate) fn new(client: Arc<ApiClient>, network_time: NetworkType) -> Self {\n NamespaceRoutes(client, network_time)\n }\n\n fn __client(&self) -> Arc<ApiClient> {\n Arc::clone(&self.0)\n }\n\n fn __network_type(&self) -> NetworkType {\n self.1\n }\n\n fn __build_namespace_hierarchy<'b>(\n self,\n ns_info: &'b mut NamespaceInfo,\n ) -> Pin<Box<dyn Future<Output = ()> + 'b>> {\n Box::pin(async move {\n let info_parent = match &ns_info.parent {\n Some(info) => info,\n _ => return,\n };\n\n if info_parent.namespace_id.to_u64() == 0 {\n return;\n }\n\n let rest_info = self\n .clone()\n .get_namespace_info(info_parent.namespace_id)\n .await;\n let mut parent_ns_info = match rest_info {\n Ok(parent) => Box::new(parent),\n _ => return,\n };\n\n ns_info.parent = Some(parent_ns_info.to_owned());\n\n if parent_ns_info.to_owned().parent.is_none() {\n return;\n }\n\n self.__build_namespace_hierarchy(&mut parent_ns_info).await\n })\n }\n\n fn __build_namespaces_hierarchy<'b>(\n self,\n ns_infos: &'b mut Vec<NamespaceInfo>,\n ) -> Pin<Box<dyn Future<Output = ()> + 'b>> {\n Box::pin(async move {\n for ns_info in ns_infos.iter_mut() {\n self.clone().__build_namespace_hierarchy(ns_info).await\n }\n })\n }\n\n pub async fn get_namespace_info(self, namespace_id: NamespaceId) -> Result<NamespaceInfo> {\n let mut req = __internal_request::Request::new(Method::GET, NAMESPACE_ROUTE.to_string());\n\n req = req.with_path_param(\"namespaceId\".to_string(), namespace_id.to_string());\n\n let dto_raw: Result<NamespaceInfoDto> = req.clone().execute(self.__client()).await;\n\n let mut dto_to_struct = dto_raw?.compact(self.__network_type())?;\n\n self.__build_namespace_hierarchy(&mut dto_to_struct).await;\n\n Ok(dto_to_struct)\n }\n\n pub async fn get_namespaces_names(\n self,\n namespace_ids: Vec<NamespaceId>,\n ) -> Result<Vec<NamespaceName>> {\n valid_vec_len(&namespace_ids, ERR_EMPTY_NAMESPACE_IDS)?;\n\n let namespace_ids_ = NamespaceIds::from(namespace_ids);\n let mut req =\n __internal_request::Request::new(Method::POST, NAMESPACE_NAMES_ROUTE.to_string());\n\n req = req.with_body_param(namespace_ids_);\n\n let dto: Vec<NamespaceNameDto> = req.execute(self.__client()).await?;\n\n let mut namespace_name: Vec<NamespaceName> = vec![];\n for namespace_name_dto in dto.into_iter() {\n namespace_name.push(namespace_name_dto.compact()?);\n }\n\n Ok(namespace_name)\n }\n\n pub async fn get_namespaces_from_account(\n self,\n address: Address,\n ns_id: Option<NamespaceId>,\n page_size: Option<i32>,\n ) -> Result<Vec<NamespaceInfo>> {\n let mut req = __internal_request::Request::new(\n Method::GET,\n NAMESPACES_FROM_ACCOUNT_ROUTES.to_string(),\n );\n\n if let Some(ref s) = page_size {\n req = req.with_query_param(\"pageSize\".to_string(), s.to_string());\n }\n if let Some(ref s) = ns_id {\n req = req.with_query_param(\"id\".to_string(), s.to_hex());\n }\n\n req = req.with_path_param(\"accountId\".to_string(), address.address_string());\n\n let dto: Vec<NamespaceInfoDto> = req.execute(self.__client()).await?;\n\n let mut namespace_info: Vec<NamespaceInfo> = vec![];\n for namespace_dto in dto.into_iter() {\n namespace_info.push(namespace_dto.compact(self.__network_type())?);\n }\n\n self.__build_namespaces_hierarchy(&mut namespace_info).await;\n\n Ok(namespace_info)\n }\n\n pub async fn get_namespaces_from_accounts(\n self,\n accounts_id: Vec<&str>,\n ns_id: Option<NamespaceId>,\n page_size: Option<i32>,\n ) -> Result<Vec<NamespaceInfo>> {\n valid_vec_len(&accounts_id, ERR_EMPTY_ADDRESSES_IDS)?;\n\n let accounts = AccountsId::from(accounts_id);\n\n let mut req = __internal_request::Request::new(\n Method::POST,\n NAMESPACES_FROM_ACCOUNTS_ROUTE.to_string(),\n );\n\n if let Some(ref s) = page_size {\n req = req.with_query_param(\"pageSize\".to_string(), s.to_string());\n }\n if let Some(ref s) = ns_id {\n req = req.with_query_param(\"id\".to_string(), s.to_hex());\n }\n\n req = req.with_body_param(&accounts);\n\n let dto: Vec<NamespaceInfoDto> = req.execute(self.__client()).await?;\n\n let mut namespace_info: Vec<NamespaceInfo> = vec![];\n for namespace_dto in dto.into_iter() {\n namespace_info.push(namespace_dto.compact(self.__network_type())?);\n }\n\n self.__build_namespaces_hierarchy(&mut namespace_info).await;\n\n Ok(namespace_info)\n }\n}\n"},"prefix":{"kind":"string","value":"/*\n * Copyright 2018 ProximaX Limited. All rights reserved.\n * Use of this source code is governed by the Apache 2.0\n * license that can be found in the LICENSE file.\n */\n\nuse {\n ::std::{future::Future, pin::Pin, sync::Arc},\n reqwest::Method,\n};\n\nuse crate::{\n account::{AccountsId, Address},\n api::{\n internally::valid_vec_len, request as __internal_request, sirius_client::ApiClient,\n NamespaceInfoDto, NamespaceNameDto,\n },\n errors_const::{ERR_EMPTY_ADDRESSES_IDS, ERR_EMPTY_NAMESPACE_IDS},\n models::Result,\n namespace::{NamespaceId, NamespaceIds, NamespaceInfo, NamespaceName},\n network::NetworkType,\n AssetId,\n};\n\nuse super::{\n NAMESPACES_FROM_ACCOUNTS_ROUTE, NAMESPACES_FROM_ACCOUNT_ROUTES, NAMESPACE_NAMES_ROUTE,\n NAMESPACE_ROUTE,\n};\n\n#[derive(Clone)]\npub struct NamespaceRoutes(Arc<ApiClient>, NetworkType);\n\nimpl NamespaceRoutes {\n pub(crate) fn new(client: Arc<ApiClient>, network_time: NetworkType) -> Self {\n NamespaceRoutes(client, network_time)\n }\n\n fn __client(&self) -> Arc<ApiClient> {\n Arc::clone(&self.0)\n }\n\n fn __network_type(&self) -> NetworkType {\n self.1\n }\n\n fn __build_namespace_hierarchy<'b>(\n self,\n ns_info: &'b mut NamespaceInfo,\n ) -> Pin<Box<dyn Future<Output = ()> + 'b>> {\n Box::pin(async move {\n let info_parent = match &ns_info.parent {\n Some(info) => info,\n _ => return,\n };\n\n if info_parent.namespace_id.to_u64() == 0 {\n return;\n }\n\n let rest_info = self\n .clone()\n .get_namespace_info(info_parent.namespace_id)\n .await;\n let mut parent_ns_info = match rest_info {\n Ok(parent) => Box::new(parent),\n _ => return,\n };\n\n ns_info.parent = Some(parent_ns_info.to_owned());\n\n if parent_ns_info.to_owned().parent.is_none() {\n return;\n }\n\n self.__build_namespace_hierarchy(&mut parent_ns_info).await\n })\n }\n\n fn __build_namespaces_hierarchy<'b>(\n self,\n ns_infos: &'b mut Vec<NamespaceInfo>,\n ) -> Pin<Box<dyn Future<Output = ()> + 'b>> {\n Box::pin(async move {\n for ns_info in ns_infos.iter_mut() {\n self.clone().__build_namespace_hierarchy(ns_info).await\n }\n })\n }\n\n pub async fn get_namespace_info(self, namespace_id: NamespaceId) -> Result<NamespaceInfo> {\n let mut req = __internal_request::Request::new(Method::GET, NAMESPACE_ROUTE.to_string());\n\n req = req.with_path_param(\"namespaceId\".to_string(), namespace_id.to_string());\n\n let dto_raw: Result<NamespaceInfoDto> = req.clone().execute(self.__client()).await;\n\n let mut dto_to_struct = dto_raw?.compact(self.__network_type())?;\n\n self.__build_namespace_hierarchy(&mut dto_to_struct).await;\n\n Ok(dto_to_struct)\n }\n\n pub async fn get_namespaces_names(\n self,\n namespace_ids: Vec<NamespaceId>,\n ) -> Result<Vec<NamespaceName>> {\n valid_vec_len(&namespace_ids, ERR_EMPTY_NAMESPACE_IDS)?;\n\n let namespace_ids_ = NamespaceIds::from(namespace_ids);\n let mut req =\n __internal_request::Request::new(Method::POST, NAMESPACE_NAMES_ROUTE.to_string());\n\n req = req.with_body_param(namespace_ids_);\n\n let dto: Vec<NamespaceNameDto> = req.execute(self.__client()).await?;\n\n let mut namespace_name: Vec<NamespaceName> = vec![];\n for namespace_name_dto in dto.into_iter() {\n namespace_name.push(namespace_name_dto.compact()?);\n }\n\n Ok(namespace_name)\n }\n\n pub async fn get_namespaces_from_account(\n self,\n address: Address,\n ns_id: Option<NamespaceId>,\n page_size: Option<i32>,\n ) -> Result<Vec<NamespaceInfo>> {\n let mut req = __internal_request::Request::new(\n Method::GET,\n NAMESPACES_FROM_ACCOUNT_ROUTES.to_string(),\n );\n\n if let Some(ref s) = page_size {\n req = req.with_query_param(\"pageSize\".to_string(), s.to_string());\n }\n if let Some(ref s) = ns_id {\n req = req.with_query_param(\"id\".to_string(), s.to_hex());\n }\n\n req = req.with_path_param(\"accountId\".to_string(), address.address_string());\n\n let dto: Vec<NamespaceInfoDto> = req.execute(self.__client()).await?;\n\n "},"suffix":{"kind":"string","value":"\n\n pub async fn get_namespaces_from_accounts(\n self,\n accounts_id: Vec<&str>,\n ns_id: Option<NamespaceId>,\n page_size: Option<i32>,\n ) -> Result<Vec<NamespaceInfo>> {\n valid_vec_len(&accounts_id, ERR_EMPTY_ADDRESSES_IDS)?;\n\n let accounts = AccountsId::from(accounts_id);\n\n let mut req = __internal_request::Request::new(\n Method::POST,\n NAMESPACES_FROM_ACCOUNTS_ROUTE.to_string(),\n );\n\n if let Some(ref s) = page_size {\n req = req.with_query_param(\"pageSize\".to_string(), s.to_string());\n }\n if let Some(ref s) = ns_id {\n req = req.with_query_param(\"id\".to_string(), s.to_hex());\n }\n\n req = req.with_body_param(&accounts);\n\n let dto: Vec<NamespaceInfoDto> = req.execute(self.__client()).await?;\n\n let mut namespace_info: Vec<NamespaceInfo> = vec![];\n for namespace_dto in dto.into_iter() {\n namespace_info.push(namespace_dto.compact(self.__network_type())?);\n }\n\n self.__build_namespaces_hierarchy(&mut namespace_info).await;\n\n Ok(namespace_info)\n }\n}\n"},"middle":{"kind":"string","value":"let mut namespace_info: Vec<NamespaceInfo> = vec![];\n for namespace_dto in dto.into_iter() {\n namespace_info.push(namespace_dto.compact(self.__network_type())?);\n }\n\n self.__build_namespaces_hierarchy(&mut namespace_info).await;\n\n Ok(namespace_info)\n }"},"strategy":{"kind":"string","value":"function_block-function_prefix_line"},"context_items":{"kind":"list like","value":[{"content":"fn parse_meta_ws(value_dto: &mut Value) -> Result<()> {\n\n if let Some(v) = value_dto[\"transaction\"][\"transactions\"].as_array_mut() {\n\n let mut meta_value: Vec<Value> = vec![];\n\n\n\n for item in v.iter_mut() {\n\n if item[\"meta\"].is_null() {\n\n let meta = r#\"\"meta\": {}, \"transaction\":\"#;\n\n let parse_meta_srt = format!(\"{}\", item).replace(r#\"\"transaction\":\"#, meta);\n\n\n\n let parse_meta: Value = serde_json::from_str(&parse_meta_srt)?;\n\n meta_value.push(parse_meta)\n\n } else {\n\n let parse_meta: Value = serde_json::from_str(&*format!(\"{}\", item))?;\n\n meta_value.push(parse_meta)\n\n }\n\n }\n\n v.clear();\n\n v.append(&mut meta_value)\n\n };\n\n Ok(())\n\n}\n\n\n","file_path":"src/api/internally.rs","rank":0,"score":199868.54982480197},{"content":"fn path_parse_address(mut path: String, address: Address) -> String {\n\n path.push_str(\"/\");\n\n path.push_str(&address.address_string());\n\n path\n\n}\n\n\n","file_path":"src/websocket/client.rs","rank":1,"score":194066.74521329853},{"content":"pub fn hex_decode(data: &str) -> Vec<u8> {\n\n hex::decode(data)\n\n .map_err(|err| panic!(\"Failed to decode hex data {} : {}\", data, err))\n\n .unwrap()\n\n}\n\n\n","file_path":"src/helpers/utils_hex.rs","rank":2,"score":172835.29757663194},{"content":"#[derive(Clone, Serialize)]\n\n#[serde(rename_all = \"camelCase\")]\n\nstruct PropertiesDto {\n\n property_type: u8,\n\n #[serde(skip_serializing_if = \"Option::is_none\")]\n\n mosaic_ids: Option<Vec<Uint64Dto>>,\n\n #[serde(skip_serializing_if = \"Option::is_none\")]\n\n addresses: Option<Vec<String>>,\n\n #[serde(skip_serializing_if = \"Option::is_none\")]\n\n entity_types: Option<Vec<u16>>,\n\n}\n\n\n\nimpl<'de> Deserialize<'de> for PropertiesDto {\n\n fn deserialize<D>(deserializer: D) -> ::std::result::Result<Self, D::Error>\n\n where\n\n D: Deserializer<'de>,\n\n {\n\n #[derive(Deserialize, Debug)]\n\n struct PropertyValue {\n\n #[serde(rename = \"propertyType\")]\n\n r#type: u8,\n\n values: Value,\n","file_path":"src/api/dtos/account_dto.rs","rank":3,"score":166279.64268948545},{"content":"#[derive(Clone, Serialize, Deserialize)]\n\n#[serde(rename_all = \"camelCase\")]\n\nstruct AccountDto {\n\n address: String,\n\n address_height: Uint64Dto,\n\n /// The public key of an account can be used to verify signatures of the account. Only accounts that have already published a transaction have a public key assigned to the account. Otherwise, the field is null.\n\n public_key: String,\n\n public_key_height: Uint64Dto,\n\n /// The list of mosaics the account owns. The amount is represented in absolute amount. Thus a balance of 123456789 for a mosaic with divisibility 6 (absolute) means the account owns 123.456789 instead.\n\n mosaics: Vec<MosaicDto>,\n\n account_type: u8,\n\n /// The public key of a linked account. The linked account can use|provide balance for delegated harvesting.\n\n linked_account_key: String,\n\n}\n\n\n\n#[derive(Serialize, Deserialize)]\n\npub(crate) struct AccountInfoDto {\n\n account: AccountDto,\n\n}\n\n\n\nimpl AccountInfoDto {\n\n pub(crate) fn compact(&self) -> crate::Result<AccountInfo> {\n","file_path":"src/api/dtos/account_dto.rs","rank":4,"score":166279.60964477784},{"content":"#[derive(Serialize, Deserialize)]\n\n#[serde(rename_all = \"camelCase\")]\n\nstruct BlockDtoAllOf {\n\n height: Uint64Dto,\n\n timestamp: Uint64Dto,\n\n difficulty: Uint64Dto,\n\n /// The fee multiplier applied to transactions contained in block.\n\n fee_multiplier: i32,\n\n /// The hash of the previous block.\n\n previous_block_hash: String,\n\n /// The transactions included in a block are hashed forming a merkle tree. The root of the tree summarizes them.\n\n block_transactions_hash: String,\n\n /// The collection of receipts are hashed into a merkle tree and linked to a block. The block header stores the root hash.\n\n block_receipts_hash: String,\n\n /// For each block, the state of the blockchain is stored in RocksDB, forming a patricia tree. The root of the tree summarizes the state of the blockchain for the given block.\n\n state_hash: String,\n\n /// The public key of the optional beneficiary designated by harvester.\n\n beneficiary: String,\n\n /// The part of the transaction fee harvester is willing to get. From 0 up to FeeInterestDenominator. The customer gets (FeeInterest / FeeInterestDenominator)'th part of the maximum transaction fee.\n\n fee_interest: i32,\n\n /// Denominator of the transaction fee.\n\n fee_interest_denominator: i32,\n\n}\n","file_path":"src/api/dtos/block_dto.rs","rank":5,"score":166274.7413419521},{"content":"#[derive(Serialize, Deserialize)]\n\n#[serde(rename_all = \"camelCase\")]\n\nstruct BlockMetaDto {\n\n hash: String,\n\n generation_hash: String,\n\n total_fee: Uint64Dto,\n\n num_transactions: u64,\n\n}\n\n\n\n#[derive(Serialize, Deserialize)]\n\n#[serde(rename_all = \"camelCase\")]\n\npub(crate) struct BlockDto {\n\n signature: String,\n\n signer: String,\n\n version: u32,\n\n #[serde(rename = \"type\")]\n\n _type: u32,\n\n pub height: Uint64Dto,\n\n timestamp: Uint64Dto,\n\n difficulty: Uint64Dto,\n\n #[serde(skip_serializing_if = \"Option::is_none\")]\n\n fee_multiplier: Option<i32>,\n","file_path":"src/api/dtos/block_dto.rs","rank":6,"score":164172.02513978007},{"content":"#[derive(Serialize, Deserialize)]\n\nstruct MosaicMetaDto {\n\n #[serde(rename = \"id\")]\n\n id: String,\n\n}\n\n\n\n#[derive(Serialize, Deserialize)]\n\n#[serde(rename_all = \"camelCase\")]\n\npub(crate) struct MosaicDefinitionTransactionInfoDto {\n\n meta: TransactionMetaDto,\n\n transaction: MosaicDefinitionTransactionDto,\n\n}\n\n\n\n/// MosaicDefinitionTransactionDto : Transaction that creates a new mosaic.\n\n#[derive(Clone, Serialize, Deserialize)]\n\n#[serde(rename_all = \"camelCase\")]\n\npub(crate) struct MosaicDefinitionTransactionDto {\n\n #[serde(flatten)]\n\n r#abstract: AbstractTransactionDto,\n\n /// Random nonce used to generate the mosaic id.\n\n mosaic_nonce: u32,\n","file_path":"src/api/dtos/mosaic_dto.rs","rank":7,"score":164172.02513978007},{"content":"#[derive(Serialize, Deserialize)]\n\nstruct CommunicationTimestampsDto {\n\n #[serde(rename = \"sendTimestamp\", skip_serializing_if = \"Option::is_none\")]\n\n send_timestamp: Option<Uint64Dto>,\n\n #[serde(rename = \"receiveTimestamp\", skip_serializing_if = \"Option::is_none\")]\n\n receive_timestamp: Option<Uint64Dto>,\n\n}\n\n\n\nimpl NodeTimeDto {\n\n pub(crate) fn compact(&self) -> NodeTime {\n\n let mut send = Uint64::default();\n\n if let Some(value) = &self.communication_timestamps.send_timestamp {\n\n send = value.compact();\n\n };\n\n\n\n let mut receive = Uint64::default();\n\n if let Some(value) = &self.communication_timestamps.receive_timestamp {\n\n receive = value.compact();\n\n };\n\n\n\n NodeTime {\n\n send_timestamp: Some(send),\n\n receive_timestamp: Some(receive),\n\n }\n\n }\n\n}\n","file_path":"src/api/dtos/node_dto.rs","rank":8,"score":164172.02513978007},{"content":"pub fn schema_common_definition() -> Vec<Box<dyn SchemaAttribute>> {\n\n vec![\n\n Box::new(ScalarAttribute::new(\"size\", SIZEOF_INT)),\n\n Box::new(ArrayAttribute::new(\"signature\", SIZEOF_BYTE)),\n\n Box::new(ArrayAttribute::new(\"signer\", SIZEOF_BYTE)),\n\n Box::new(ScalarAttribute::new(\"version\", SIZEOF_INT)),\n\n Box::new(ScalarAttribute::new(\"type\", SIZEOF_SHORT)),\n\n Box::new(ArrayAttribute::new(\"max_fee\", SIZEOF_INT)),\n\n Box::new(ArrayAttribute::new(\"deadline\", SIZEOF_INT)),\n\n ]\n\n}\n","file_path":"src/models/transaction/schema/schema_common_definition.rs","rank":9,"score":163229.2427109059},{"content":"#[derive(Clone, Serialize, Deserialize)]\n\nstruct AccountPropertiesModificationDto {\n\n r#type: u8,\n\n /// The address, transaction type or mosaic id to filter.\n\n value: Value,\n\n}\n\n\n\n#[derive(Serialize, Deserialize)]\n\n#[serde(rename_all = \"camelCase\")]\n\npub(crate) struct AccountPropertiesInfoDto {\n\n account_properties: AccountPropertiesDto,\n\n}\n\n\n\nimpl AccountPropertiesInfoDto {\n\n pub fn compact(&self) -> Result<AccountProperties> {\n\n let dto = self.account_properties.clone();\n\n\n\n let mut allowed_addresses: Vec<Address> = vec![];\n\n let mut allowed_mosaic_id: Vec<MosaicId> = vec![];\n\n let mut allowed_entity_types: Vec<TransactionType> = vec![];\n\n let mut blocked_addresses: Vec<Address> = vec![];\n","file_path":"src/api/dtos/account_dto.rs","rank":10,"score":162138.7001246756},{"content":"#[derive(Serialize, Deserialize)]\n\n#[serde(rename_all = \"camelCase\")]\n\nstruct AccountLinkTransactionDto {\n\n #[serde(flatten)]\n\n r#abstract: AbstractTransactionDto,\n\n /// The public key of the remote account.\n\n remote_account_key: String,\n\n action: u8,\n\n}\n\n\n\n#[derive(Clone, Serialize, Deserialize)]\n\n#[serde(rename_all = \"camelCase\")]\n\npub(crate) struct AccountNamesDto {\n\n /// The address of the account in hexadecimal.\n\n address: String,\n\n /// The mosaic linked namespace names.\n\n names: Vec<String>,\n\n}\n\n\n\nimpl AccountNamesDto {\n\n pub fn compact(&self) -> crate::Result<AccountName> {\n\n let address = Address::from_encoded(&self.address)?;\n","file_path":"src/api/dtos/account_dto.rs","rank":11,"score":162133.69689548985},{"content":"type RemoveOfferDTOs = Vec<RemoveOfferDto>;\n","file_path":"src/api/dtos/exchange_dto.rs","rank":12,"score":151718.89812448283},{"content":"type AddOfferDTOs = Vec<AddOfferDto>;\n","file_path":"src/api/dtos/exchange_dto.rs","rank":13,"score":151718.89812448283},{"content":"fn parse_entity_type_dto(value_dto: Value, entity_dto: &str) -> String {\n\n let info_dto = format!(\"{{\\\"{}TransactionInfoDto\\\":{{\\\"meta\\\":\", entity_dto);\n\n\n\n format!(\"{}\", value_dto)\n\n .replace(r#\"{\"meta\":\"#, &info_dto)\n\n .replace(\"}}\", r#\"}}}\"#)\n\n}\n\n\n\npub(crate) fn map_aggregate_transactions_dto(\n\n transactions: Vec<Value>,\n\n) -> Result<Vec<Box<dyn TransactionDto>>> {\n\n let mut txs_dto: Vec<Box<dyn TransactionDto>> = vec![];\n\n for item in transactions.into_iter() {\n\n let body: Bytes = Bytes::from(item[\"AggregateTransactionInfoDto\"].to_string());\n\n let map_dto = map_transaction_dto(body)?;\n\n txs_dto.push(serde_json::from_str(&map_dto)?);\n\n }\n\n\n\n Ok(txs_dto)\n\n}\n","file_path":"src/api/internally.rs","rank":14,"score":147215.455794352},{"content":"fn parse_meta(value_dto: Value, entity_dto: &str) -> String {\n\n let meta = r#\"{\"meta\": {}, \"transaction\":\"#;\n\n\n\n let parse_meta = format!(\"{}\", value_dto).replace(r#\"{\"transaction\":\"#, meta);\n\n\n\n parse_entity_type_dto(parse_meta.parse().unwrap(), entity_dto)\n\n}\n\n\n","file_path":"src/api/internally.rs","rank":15,"score":145854.8864921942},{"content":"type ConfirmationOfferDTOs = Vec<ConfirmationOffer>;\n\n\n\n#[derive(Clone, Serialize, Deserialize)]\n\n#[serde(rename_all = \"camelCase\")]\n\npub(crate) struct OfferDTO {\n\n mosaic_id: Uint64Dto,\n\n mosaic_amount: Uint64Dto,\n\n cost: Uint64Dto,\n\n r#type: u8,\n\n}\n\n\n\nimpl OfferDTO {\n\n fn compact(&self) -> Offer {\n\n let asset_id = self.mosaic_id.compact();\n\n Offer {\n\n r#type: OfferType::from(self.r#type),\n\n mosaic: Mosaic {\n\n asset_id: Box::new(MosaicId::from(asset_id)),\n\n amount: self.mosaic_amount.compact(),\n\n },\n","file_path":"src/api/dtos/exchange_dto.rs","rank":16,"score":143198.67346812127},{"content":"// Copyright 2018 ProximaX Limited. All rights reserved.\n\n// Use of this source code is governed by the Apache 2.0\n\n// license that can be found in the LICENSE file.\n\n\n\n/// SourceDto : The transaction that triggered the receipt.\n\n#[derive(Serialize, Deserialize)]\n\npub(crate) struct SourceDto {\n\n /// The transaction index within the block.\n\n primary_id: i32,\n\n /// The transaction index inside within the aggregate transaction. If the transaction is not an inner transaction, then the secondary id is set to 0.\n\n secondary_id: i32,\n\n}\n","file_path":"src/api/dtos/source_dto.rs","rank":17,"score":137230.05403490967},{"content":"/*\n\n * Copyright 2018 ProximaX Limited. All rights reserved.\n\n * Use of this source code is governed by the Apache 2.0\n\n * license that can be found in the LICENSE file.\n\n */\n\n\n\nuse crate::{\n\n account::Address,\n\n transaction::{MetadataAddressTransaction, Transaction},\n\n};\n\n\n\nuse super::{ModifyMetadataTransactionDto, TransactionDto, TransactionMetaDto};\n\n\n\n/// AddressMetadataTransactionDto :\n\n///Transaction that addes metadata to account.\n\n#[derive(Clone, Serialize, Deserialize)]\n\n#[serde(rename_all = \"camelCase\")]\n\npub(crate) struct AddressMetadataTransactionDto {\n\n #[serde(flatten)]\n\n metadata_transaction: ModifyMetadataTransactionDto,\n","file_path":"src/api/dtos/address_dto.rs","rank":18,"score":137020.45159999118},{"content":" #[serde(rename = \"metadataId\")]\n\n address: String,\n\n}\n\n\n\n#[derive(Serialize, Deserialize)]\n\n#[serde(rename_all = \"camelCase\")]\n\npub(crate) struct AddressMetadataTransactionInfoDto {\n\n meta: TransactionMetaDto,\n\n transaction: AddressMetadataTransactionDto,\n\n}\n\n\n\n#[typetag::serde]\n\nimpl TransactionDto for AddressMetadataTransactionInfoDto {\n\n fn compact(&self) -> crate::models::Result<Box<dyn Transaction>> {\n\n let dto = self.transaction.clone();\n\n\n\n let info = self.meta.compact()?;\n\n\n\n let metadata_transaction = dto.metadata_transaction.compact(info)?;\n\n\n\n let address = Address::from_encoded(&dto.address)?;\n\n\n\n Ok(Box::new(MetadataAddressTransaction {\n\n metadata_transaction,\n\n address,\n\n }))\n\n }\n\n}\n","file_path":"src/api/dtos/address_dto.rs","rank":19,"score":136989.13470176628},{"content":"pub fn alias_transaction_schema() -> Schema {\n\n let mut schema_definition = schema_common_definition();\n\n\n\n let mut alias_definition: Vec<Box<dyn SchemaAttribute>> = vec![\n\n Box::new(ScalarAttribute::new(\"action_type\", SIZEOF_BYTE)),\n\n Box::new(ArrayAttribute::new(\"namespace_id\", SIZEOF_INT)),\n\n Box::new(ArrayAttribute::new(\"aliasId\", SIZEOF_BYTE)),\n\n ];\n\n\n\n schema_definition.append(&mut alias_definition);\n\n\n\n Schema::new(schema_definition)\n\n}\n","file_path":"src/models/transaction/schema/transaction_alias.rs","rank":20,"score":118474.79208423689},{"content":"pub fn transfer_transaction_schema() -> Schema {\n\n let mut schema_definition = schema_common_definition();\n\n\n\n let mut transfer_schema_definition: Vec<Box<dyn SchemaAttribute>> = vec![\n\n Box::new(ArrayAttribute::new(\"recipient\", SIZEOF_BYTE)),\n\n Box::new(ScalarAttribute::new(\"message_size\", SIZEOF_SHORT)),\n\n Box::new(ScalarAttribute::new(\"num_mosaics\", SIZEOF_BYTE)),\n\n Box::new(TableAttribute::new(\n\n \"message\",\n\n vec![\n\n Box::new(ScalarAttribute::new(\"type\", SIZEOF_BYTE)),\n\n Box::new(ArrayAttribute::new(\"payload\", SIZEOF_BYTE)),\n\n ],\n\n )),\n\n Box::new(TableArrayAttribute::new(\n\n \"mosaics\",\n\n vec![\n\n Box::new(ArrayAttribute::new(\"id\", SIZEOF_INT)),\n\n Box::new(ArrayAttribute::new(\"amount\", SIZEOF_INT)),\n\n ],\n\n )),\n\n ];\n\n\n\n schema_definition.append(&mut transfer_schema_definition);\n\n\n\n Schema::new(schema_definition)\n\n}\n","file_path":"src/models/transaction/schema/transaction_transafer.rs","rank":21,"score":118474.79208423689},{"content":"pub fn aggregate_transaction_schema() -> Schema {\n\n let mut schema_definition = schema_common_definition();\n\n\n\n let mut aggregate: Vec<Box<dyn SchemaAttribute>> = vec![\n\n Box::new(ScalarAttribute::new(\"transactions_size\", SIZEOF_INT)),\n\n Box::new(ArrayAttribute::new(\"transactions\", SIZEOF_BYTE)),\n\n ];\n\n\n\n schema_definition.append(&mut aggregate);\n\n\n\n Schema::new(schema_definition)\n\n}\n","file_path":"src/models/transaction/schema/transaction_aggregate.rs","rank":22,"score":118474.79208423689},{"content":"pub fn is_hex(input: &str) -> bool {\n\n if input == \"\" {\n\n return false;\n\n }\n\n\n\n let re = Regex::new(r\"^[a-fA-F0-9]+$\").unwrap();\n\n\n\n re.is_match(input)\n\n}\n\n\n","file_path":"src/helpers/utils_hex.rs","rank":23,"score":117282.76480328871},{"content":"pub fn exchange_offer_transaction_schema() -> Schema {\n\n let mut schema_definition = schema_common_definition();\n\n\n\n let mut transfer_schema_definition: Vec<Box<dyn SchemaAttribute>> = vec![\n\n Box::new(ScalarAttribute::new(\"offers_count\", SIZEOF_BYTE)),\n\n Box::new(TableArrayAttribute::new(\n\n \"offers\",\n\n vec![\n\n Box::new(ArrayAttribute::new(\"mosaic_id\", SIZEOF_INT)),\n\n Box::new(ArrayAttribute::new(\"mosaic_amount\", SIZEOF_INT)),\n\n Box::new(ArrayAttribute::new(\"cost\", SIZEOF_INT)),\n\n Box::new(ScalarAttribute::new(\"type\", SIZEOF_BYTE)),\n\n Box::new(ArrayAttribute::new(\"owner\", SIZEOF_BYTE)),\n\n ],\n\n )),\n\n ];\n\n\n\n schema_definition.append(&mut transfer_schema_definition);\n\n\n\n Schema::new(schema_definition)\n\n}\n\n\n","file_path":"src/models/transaction/schema/transaction_exchange.rs","rank":24,"score":117112.2271494889},{"content":"pub fn modify_metadata_transaction_schema() -> Schema {\n\n let mut schema_definition = schema_common_definition();\n\n\n\n let mut alias_definition: Vec<Box<dyn SchemaAttribute>> = vec![\n\n Box::new(ScalarAttribute::new(\"metadata_type\", SIZEOF_BYTE)),\n\n Box::new(ArrayAttribute::new(\"metadata_id\", SIZEOF_BYTE)),\n\n Box::new(TableArrayAttribute::new(\n\n \"modifications\",\n\n vec![\n\n Box::new(ScalarAttribute::new(\"size\", SIZEOF_INT)),\n\n Box::new(ScalarAttribute::new(\"modification_type\", SIZEOF_BYTE)),\n\n Box::new(ScalarAttribute::new(\"key_size\", SIZEOF_BYTE)),\n\n Box::new(ArrayAttribute::new(\"value_size\", SIZEOF_BYTE)),\n\n Box::new(ArrayAttribute::new(\"key\", SIZEOF_BYTE)),\n\n Box::new(ArrayAttribute::new(\"value\", SIZEOF_BYTE)),\n\n ],\n\n )),\n\n ];\n\n\n\n schema_definition.append(&mut alias_definition);\n\n\n\n Schema::new(schema_definition)\n\n}\n","file_path":"src/models/transaction/schema/transaction_metadata.rs","rank":25,"score":117112.2271494889},{"content":"pub fn hex_encode(bytes: &[u8]) -> String {\n\n hex::encode(bytes)\n\n}\n","file_path":"src/helpers/utils_hex.rs","rank":26,"score":115826.25496219334},{"content":"pub fn account_property_transaction_schema() -> Schema {\n\n let mut schema_definition = schema_common_definition();\n\n\n\n let mut transfer_schema_definition: Vec<Box<dyn SchemaAttribute>> = vec![\n\n Box::new(ScalarAttribute::new(\"property_type\", SIZEOF_BYTE)),\n\n Box::new(ScalarAttribute::new(\"modification_count\", SIZEOF_BYTE)),\n\n Box::new(TableArrayAttribute::new(\n\n \"modifications\",\n\n vec![\n\n Box::new(ScalarAttribute::new(\"modificationType\", SIZEOF_BYTE)),\n\n Box::new(ArrayAttribute::new(\"value\", SIZEOF_BYTE)),\n\n ],\n\n )),\n\n ];\n\n\n\n schema_definition.append(&mut transfer_schema_definition);\n\n\n\n Schema::new(schema_definition)\n\n}\n","file_path":"src/models/transaction/schema/transaction_account_property.rs","rank":27,"score":115793.26220666015},{"content":"pub fn mosaic_definition_transaction_schema() -> Schema {\n\n let mut schema_definition = schema_common_definition();\n\n\n\n let mut transfer_schema_definition: Vec<Box<dyn SchemaAttribute>> = vec![\n\n Box::new(ScalarAttribute::new(\"mosaic_nonce\", SIZEOF_INT)),\n\n Box::new(ArrayAttribute::new(\"mosaic_id\", SIZEOF_INT)),\n\n Box::new(ScalarAttribute::new(\"num_optional_properties\", SIZEOF_BYTE)),\n\n Box::new(ScalarAttribute::new(\"flags\", SIZEOF_BYTE)),\n\n Box::new(ScalarAttribute::new(\"divisibility\", SIZEOF_BYTE)),\n\n Box::new(TableArrayAttribute::new(\n\n \"modifications\",\n\n vec![\n\n Box::new(ScalarAttribute::new(\"mosaic_property_id\", SIZEOF_BYTE)),\n\n Box::new(ArrayAttribute::new(\"value\", SIZEOF_INT)),\n\n ],\n\n )),\n\n ];\n\n\n\n schema_definition.append(&mut transfer_schema_definition);\n\n\n\n Schema::new(schema_definition)\n\n}\n","file_path":"src/models/transaction/schema/transaction_mosaic_definition.rs","rank":28,"score":115793.26220666015},{"content":"pub fn lock_funds_transaction_schema() -> Schema {\n\n let mut schema_definition = schema_common_definition();\n\n\n\n let mut lock_funds_transaction_definition: Vec<Box<dyn SchemaAttribute>> = vec![\n\n Box::new(ArrayAttribute::new(\"mosaic_id\", SIZEOF_INT)),\n\n Box::new(ArrayAttribute::new(\"mosaic_amount\", SIZEOF_INT)),\n\n Box::new(ArrayAttribute::new(\"duration\", SIZEOF_INT)),\n\n Box::new(ArrayAttribute::new(\"hash\", SIZEOF_BYTE)),\n\n ];\n\n\n\n schema_definition.append(&mut lock_funds_transaction_definition);\n\n\n\n Schema::new(schema_definition)\n\n}\n","file_path":"src/models/transaction/schema/transaction_hash_lock.rs","rank":29,"score":115793.26220666015},{"content":"pub fn add_exchange_offer_transaction_schema() -> Schema {\n\n let mut schema_definition = schema_common_definition();\n\n\n\n let mut transfer_schema_definition: Vec<Box<dyn SchemaAttribute>> = vec![\n\n Box::new(ScalarAttribute::new(\"offers_count\", SIZEOF_BYTE)),\n\n Box::new(TableArrayAttribute::new(\n\n \"offers\",\n\n vec![\n\n Box::new(ArrayAttribute::new(\"mosaic_id\", SIZEOF_INT)),\n\n Box::new(ArrayAttribute::new(\"mosaic_amount\", SIZEOF_INT)),\n\n Box::new(ArrayAttribute::new(\"cost\", SIZEOF_INT)),\n\n Box::new(ScalarAttribute::new(\"type\", SIZEOF_BYTE)),\n\n Box::new(ArrayAttribute::new(\"duration\", SIZEOF_INT)),\n\n ],\n\n )),\n\n ];\n\n\n\n schema_definition.append(&mut transfer_schema_definition);\n\n\n\n Schema::new(schema_definition)\n\n}\n\n\n","file_path":"src/models/transaction/schema/transaction_exchange.rs","rank":30,"score":115793.26220666015},{"content":"pub fn remove_exchange_offer_transaction_schema() -> Schema {\n\n let mut schema_definition = schema_common_definition();\n\n\n\n let mut transfer_schema_definition: Vec<Box<dyn SchemaAttribute>> = vec![\n\n Box::new(ScalarAttribute::new(\"offers_count\", SIZEOF_BYTE)),\n\n Box::new(TableArrayAttribute::new(\n\n \"offers\",\n\n vec![\n\n Box::new(ArrayAttribute::new(\"mosaic_id\", SIZEOF_INT)),\n\n Box::new(ScalarAttribute::new(\"type\", SIZEOF_BYTE)),\n\n ],\n\n )),\n\n ];\n\n\n\n schema_definition.append(&mut transfer_schema_definition);\n\n\n\n Schema::new(schema_definition)\n\n}\n","file_path":"src/models/transaction/schema/transaction_exchange.rs","rank":31,"score":115793.26220666015},{"content":"pub fn register_namespace_transaction_schema() -> Schema {\n\n let mut schema_definition = schema_common_definition();\n\n\n\n let mut register_namespace_definition: Vec<Box<dyn SchemaAttribute>> = vec![\n\n Box::new(ScalarAttribute::new(\"namespace_type\", SIZEOF_BYTE)),\n\n Box::new(ArrayAttribute::new(\"duration_parent_id\", SIZEOF_INT)),\n\n Box::new(ArrayAttribute::new(\"namespace_id\", SIZEOF_INT)),\n\n Box::new(ScalarAttribute::new(\"namespace_name_size\", SIZEOF_BYTE)),\n\n Box::new(ArrayAttribute::new(\"name\", SIZEOF_BYTE)),\n\n ];\n\n\n\n schema_definition.append(&mut register_namespace_definition);\n\n\n\n Schema::new(schema_definition)\n\n}\n","file_path":"src/models/transaction/schema/transaction_register_namespace.rs","rank":32,"score":115793.26220666015},{"content":"pub fn array_u8_to_u64(bytes: &[u8]) -> u64 {\n\n (bytes[0] as u64)\n\n | (bytes[1] as u64) << 8\n\n | (bytes[2] as u64) << 16\n\n | (bytes[3] as u64) << 24\n\n | (bytes[4] as u64) << 32\n\n | (bytes[5] as u64) << 40\n\n | (bytes[6] as u64) << 48\n\n | (bytes[7] as u64) << 56\n\n}\n\n\n","file_path":"src/helpers/utils_bytes.rs","rank":33,"score":114417.89182707938},{"content":"pub fn modify_multisig_account_transaction_schema() -> Schema {\n\n let mut schema_definition = schema_common_definition();\n\n\n\n let mut modify_multisig_account_transaction: Vec<Box<dyn SchemaAttribute>> = vec![\n\n Box::new(ScalarAttribute::new(\"min_removal_delta\", SIZEOF_BYTE)),\n\n Box::new(ScalarAttribute::new(\"min_approval_delta\", SIZEOF_BYTE)),\n\n Box::new(ScalarAttribute::new(\"num_modifications\", SIZEOF_BYTE)),\n\n Box::new(TableArrayAttribute::new(\n\n \"modification\",\n\n vec![\n\n Box::new(ScalarAttribute::new(\"type\", SIZEOF_BYTE)),\n\n Box::new(ArrayAttribute::new(\"cosignatory_publicKey\", SIZEOF_BYTE)),\n\n ],\n\n )),\n\n ];\n\n\n\n schema_definition.append(&mut modify_multisig_account_transaction);\n\n\n\n Schema::new(schema_definition)\n\n}\n","file_path":"src/models/transaction/schema/transaction_modify_multisig_account.rs","rank":34,"score":113278.02104639719},{"content":"pub fn mosaic_supply_change_transaction_schema() -> Schema {\n\n let mut schema_definition = schema_common_definition();\n\n\n\n let mut mosaic_supply_change_definition: Vec<Box<dyn SchemaAttribute>> = vec![\n\n Box::new(ArrayAttribute::new(\"mosaic_id\", SIZEOF_INT)),\n\n Box::new(ScalarAttribute::new(\"direction\", SIZEOF_BYTE)),\n\n Box::new(ArrayAttribute::new(\"delta\", SIZEOF_INT)),\n\n ];\n\n\n\n schema_definition.append(&mut mosaic_supply_change_definition);\n\n\n\n Schema::new(schema_definition)\n\n}\n","file_path":"src/models/transaction/schema/transaction_mosaic_supply_change.rs","rank":35,"score":113278.02104639719},{"content":"pub fn has_bits(number: u64, bits: u64) -> bool {\n\n (number & bits) == bits\n\n}\n","file_path":"src/helpers/utils_bytes.rs","rank":36,"score":111210.90084167274},{"content":"#[inline]\n\npub fn u32_to_array_u8(value: u32) -> [u8; SIZE_U32] {\n\n let mut buf = [0u8; SIZE_U32];\n\n buf.as_mut()\n\n .write_u32::<LittleEndian>(value)\n\n .expect(\"Unable to write\");\n\n buf\n\n}\n\n\n","file_path":"src/helpers/utils_bytes.rs","rank":37,"score":110044.24290340747},{"content":"pub fn array_u8_to_u32(bytes: [u8; SIZE_U32]) -> u32 {\n\n (bytes[0] as u32) | (bytes[1] as u32) << 8 | (bytes[2] as u32) << 16 | (bytes[3] as u32) << 24\n\n}\n\n\n","file_path":"src/helpers/utils_bytes.rs","rank":38,"score":110044.24290340747},{"content":"#[inline]\n\npub fn u64_to_array_u8(value: u64) -> [u8; SIZE_U64] {\n\n let mut buf = [0u8; SIZE_U64];\n\n buf.as_mut()\n\n .write_u64::<LittleEndian>(value)\n\n .expect(\"Unable to write\");\n\n buf\n\n}\n\n\n","file_path":"src/helpers/utils_bytes.rs","rank":39,"score":110044.24290340747},{"content":"type NamespaceIdDto = Option<Uint64Dto>;\n\n\n\n#[derive(Serialize, Deserialize)]\n\n#[serde(rename_all = \"camelCase\")]\n\npub(crate) struct NamespaceDto {\n\n /// The public key of the owner of the namespace.\n\n owner: String,\n\n /// The address of the owner of the namespace in hexadecimal.\n\n owner_address: String,\n\n start_height: Uint64Dto,\n\n end_height: Uint64Dto,\n\n #[serde(rename = \"depth\")]\n\n depth: u8,\n\n #[serde(skip_serializing_if = \"Option::is_none\")]\n\n level0: NamespaceIdDto,\n\n #[serde(skip_serializing_if = \"Option::is_none\")]\n\n level1: NamespaceIdDto,\n\n #[serde(skip_serializing_if = \"Option::is_none\")]\n\n level2: NamespaceIdDto,\n\n #[serde(rename = \"type\")]\n","file_path":"src/api/dtos/namespace_dto.rs","rank":40,"score":96302.97046793539},{"content":"/*\n\n * Copyright 2018 ProximaX Limited. All rights reserved.\n\n * Use of this source code is governed by the Apache 2.0\n\n * license that can be found in the LICENSE file.\n\n */\n\n\n\nuse {\n\n ::std::{collections::HashMap, sync::Arc},\n\n reqwest::{\n\n header::{HeaderMap, CONTENT_LENGTH, CONTENT_TYPE, USER_AGENT},\n\n Method, StatusCode, Url,\n\n },\n\n serde_json,\n\n};\n\n\n\nuse crate::models::error::{Error, SiriusError};\n\n\n\nuse super::{\n\n internally::{map_transaction_dto, map_transaction_dto_vec},\n\n sirius_client::ApiClient,\n","file_path":"src/api/request.rs","rank":41,"score":94881.66936092699},{"content":" let param = param.replace('\"', \"\");\n\n self.path_params.insert(basename, param);\n\n self\n\n }\n\n\n\n pub fn set_transaction(mut self) -> Self {\n\n self.is_transaction = true;\n\n self\n\n }\n\n\n\n pub fn set_transaction_vec(mut self) -> Self {\n\n self.is_transaction_vec = true;\n\n self\n\n }\n\n\n\n pub async fn execute<U>(self, api: Arc<ApiClient>) -> crate::models::Result<U>\n\n where\n\n for<'de> U: serde::Deserialize<'de>,\n\n {\n\n // raw_headers is for headers we don't know the proper type of (e.g. custom api key\n","file_path":"src/api/request.rs","rank":42,"score":94855.37194627292},{"content":"};\n\n\n\n#[derive(Clone)]\n\npub(crate) struct Request {\n\n method: Method,\n\n path: String,\n\n query_params: HashMap<String, String>,\n\n path_params: HashMap<String, String>,\n\n header_params: HashMap<String, String>,\n\n // TODO: multiple body params are possible technically, but not supported here.\n\n serialized_body: Option<String>,\n\n is_transaction: bool,\n\n is_transaction_vec: bool,\n\n}\n\n\n\nimpl Request {\n\n pub fn new(method: reqwest::Method, path: String) -> Self {\n\n Request {\n\n method,\n\n path,\n","file_path":"src/api/request.rs","rank":43,"score":94850.91978018929},{"content":" // set new pairs\n\n url.query_pairs_mut()\n\n .clear()\n\n .extend_pairs(pairs.iter().map(|&(k, v)| (&k[..], &v[..])));\n\n };\n\n\n\n // create request\n\n let builder = api.client.request(self.method, url.as_str()).body(\n\n self.serialized_body\n\n .clone()\n\n .unwrap_or_else(|| \"\".to_owned()),\n\n );\n\n\n\n let mut req = builder.build()?;\n\n\n\n if let Some(body) = self.serialized_body {\n\n req.headers_mut().insert(\n\n CONTENT_TYPE,\n\n \"application/json\"\n\n .parse()\n","file_path":"src/api/request.rs","rank":44,"score":94846.37502476864},{"content":" let status = resp.status();\n\n\n\n let body = resp.bytes().await?;\n\n\n\n match status {\n\n StatusCode::OK | StatusCode::ACCEPTED => {\n\n if self.is_transaction {\n\n let map_dto = map_transaction_dto(body)?;\n\n let res: U = serde_json::from_str(&map_dto)?;\n\n Ok(res)\n\n } else if self.is_transaction_vec {\n\n let map_dto_vec = map_transaction_dto_vec(body)?;\n\n let res: U = serde_json::from_str(&map_dto_vec)?;\n\n Ok(res)\n\n } else {\n\n let res: U = serde_json::from_slice(&body)?;\n\n Ok(res)\n\n }\n\n }\n\n _ => {\n\n let err: SiriusError = serde_json::from_slice(&body)?;\n\n Err(Error::from(err))\n\n }\n\n }\n\n }\n\n}\n","file_path":"src/api/request.rs","rank":45,"score":94846.02504587766},{"content":" .map_err(|err| Error::from(format_err!(\"{}\", err)))?,\n\n );\n\n\n\n req.headers_mut().insert(CONTENT_LENGTH, body.len().into());\n\n }\n\n\n\n let req_headers = req.headers_mut();\n\n if let Some(ref user_agent) = api.user_agent {\n\n req_headers.insert(\n\n USER_AGENT,\n\n user_agent\n\n .parse()\n\n .map_err(|err| Error::from(format_err!(\"{}\", err)))?,\n\n );\n\n }\n\n\n\n req_headers.extend(headers);\n\n\n\n let resp = api.client.execute(req).await?;\n\n\n","file_path":"src/api/request.rs","rank":46,"score":94842.70913481578},{"content":" query_params: HashMap::new(),\n\n path_params: HashMap::new(),\n\n header_params: HashMap::new(),\n\n serialized_body: None,\n\n is_transaction: false,\n\n is_transaction_vec: false,\n\n }\n\n }\n\n\n\n pub fn with_body_param<T: serde::Serialize>(mut self, param: T) -> Self {\n\n self.serialized_body = Some(serde_json::to_string(¶m).unwrap());\n\n self\n\n }\n\n\n\n pub fn with_query_param(mut self, basename: String, param: String) -> Self {\n\n self.query_params.insert(basename, param);\n\n self\n\n }\n\n\n\n pub fn with_path_param(mut self, basename: String, param: String) -> Self {\n","file_path":"src/api/request.rs","rank":47,"score":94841.34168692291},{"content":"\n\n if !self.query_params.is_empty() {\n\n let existing: Vec<(String, String)> = url\n\n .query_pairs()\n\n .map(|(a, b)| (a.to_string(), b.to_string()))\n\n .collect();\n\n\n\n // final pairs\n\n let mut pairs: Vec<(&str, &str)> = Vec::new();\n\n\n\n // add first existing\n\n for pair in &existing {\n\n pairs.push((&pair.0, &pair.1));\n\n }\n\n\n\n // add given query to the pairs\n\n for (key, val) in self.query_params.iter() {\n\n pairs.push((key, val));\n\n }\n\n\n","file_path":"src/api/request.rs","rank":48,"score":94832.29075500843},{"content":" // headers); headers is for ones we do know the type of.\n\n let mut raw_headers = HashMap::new();\n\n let headers: HeaderMap = HeaderMap::new();\n\n\n\n let mut path = self.path;\n\n\n\n self.path_params.into_iter().for_each(|(key, val)| {\n\n // replace {id} with the value of the id path param\n\n path = path.replace(&format!(\"{{{}}}\", key), &val);\n\n });\n\n\n\n self.header_params.into_iter().for_each(|(key, val)| {\n\n raw_headers.insert(key, val);\n\n });\n\n\n\n let uri_str = format!(\"{}{}\", api.base_path, path);\n\n\n\n let mut url = Url::parse(&uri_str)\n\n .map_err(|e| format!(\"could not parse url: {:?}\", e))\n\n .unwrap();\n","file_path":"src/api/request.rs","rank":49,"score":94831.70934380362},{"content":"/*\n\n * Copyright 2018 ProximaX Limited. All rights reserved.\n\n * Use of this source code is governed by the Apache 2.0\n\n * license that can be found in the LICENSE file.\n\n */\n\n\n\nuse crate::{\n\n account::{Address, PublicAccount},\n\n api::cosignatory_dto_vec_to_struct,\n\n models::Result,\n\n multisig::MultisigAccountInfo,\n\n network::NetworkType,\n\n transaction::{ModifyMultisigAccountTransaction, Transaction},\n\n};\n\n\n\nuse super::{\n\n AbstractTransactionDto, CosignatoryModificationDto, TransactionDto, TransactionMetaDto,\n\n};\n\n\n\n#[derive(Clone, Serialize, Deserialize)]\n","file_path":"src/api/dtos/multisig_dto.rs","rank":50,"score":90552.94469699076},{"content":"/*\n\n * Copyright 2018 ProximaX Limited. All rights reserved.\n\n * Use of this source code is governed by the Apache 2.0\n\n * license that can be found in the LICENSE file.\n\n */\n\n\n\nuse crate::blockchain::{BlockchainScore, HeightInfo};\n\n\n\nuse super::{AbstractTransactionDto, Uint64Dto, UpgradeDto};\n\n\n\n#[derive(Serialize, Deserialize)]\n\npub(crate) struct HeightInfoDto {\n\n #[serde(rename = \"height\")]\n\n height: Uint64Dto,\n\n}\n\n\n\nimpl HeightInfoDto {\n\n pub fn compact(&self) -> HeightInfo {\n\n HeightInfo {\n\n height: self.height.compact(),\n","file_path":"src/api/dtos/blockchain_dto.rs","rank":51,"score":90545.51347423355},{"content":"/*\n\n * Copyright 2018 ProximaX Limited. All rights reserved.\n\n * Use of this source code is governed by the Apache 2.0\n\n * license that can be found in the LICENSE file.\n\n */\n\n\n\nuse downcast_rs::__std::collections::HashMap;\n\n\n\nuse crate::{\n\n api::metadata_dto_vec_to_struct,\n\n models::{\n\n account::Address,\n\n metadata::{\n\n AddressMetadataInfo, MetadataInfo, MetadataModification, MetadataModificationType,\n\n MetadataType, MosaicMetadataInfo, NamespaceMetadataInfo,\n\n },\n\n mosaic::MosaicId,\n\n namespace::NamespaceId,\n\n transaction::{ModifyMetadataTransaction, TransactionInfo},\n\n },\n","file_path":"src/api/dtos/metadata_dto.rs","rank":52,"score":90545.27607064642},{"content":"/*\n\n * Copyright 2018 ProximaX Limited. All rights reserved.\n\n * Use of this source code is governed by the Apache 2.0\n\n * license that can be found in the LICENSE file.\n\n */\n\n\n\nuse super::{ResolutionStatementDto, SourceDto};\n\n\n\n/// StatementsDto : The collection of transaction statements and resolutions triggered for the block requested.\n\n#[derive(Serialize, Deserialize)]\n\npub(crate) struct StatementsDto {\n\n /// The array of transaction statements for the block requested.\n\n transaction_statements: Vec<TransactionStatementDto>,\n\n /// The array of address resolutions for the block requested.\n\n address_resolution_statements: Vec<ResolutionStatementDto>,\n\n /// The array of mosaic resolutions for the block requested.\n\n mosaic_resolution_statements: Vec<ResolutionStatementDto>,\n\n}\n\n\n\n/// TransactionStatementDto : The collection of receipts related to a transaction.\n\n#[derive(Serialize, Deserialize)]\n\npub(crate) struct TransactionStatementDto {\n\n height: Vec<i32>,\n\n source: SourceDto,\n\n /// The array of receipts.\n\n receipts: Vec<String>,\n\n}\n","file_path":"src/api/dtos/statements_dto.rs","rank":53,"score":90544.98150662113},{"content":"/*\n\n * Copyright 2018 ProximaX Limited. All rights reserved.\n\n * Use of this source code is governed by the Apache 2.0\n\n * license that can be found in the LICENSE file.\n\n */\n\n\n\nuse serde_json::Value;\n\n\n\nuse crate::Uint64;\n\n\n\n#[derive(Debug, Clone, Deserialize, Serialize)] // we derive Default in order to use the clear() method in Drop\n\npub(crate) struct Uint64Dto(pub(crate) [u32; 2]);\n\n\n\nimpl Uint64Dto {\n\n pub fn compact(&self) -> Uint64 {\n\n Uint64::from((self.0[0], self.0[1]))\n\n }\n\n\n\n pub fn from_value(value: Value) -> Self {\n\n Self(serde_json::from_value(value).unwrap())\n\n }\n\n}\n","file_path":"src/api/dtos/uint_64_dto.rs","rank":54,"score":90544.48613821573},{"content":"/*\n\n * Copyright 2018 ProximaX Limited. All rights reserved.\n\n * Use of this source code is governed by the Apache 2.0\n\n * license that can be found in the LICENSE file.\n\n */\n\n\n\nuse crate::{\n\n helpers::hex_decode,\n\n message::{Message, PlainMessage},\n\n};\n\n\n\n#[derive(Clone, Serialize, Deserialize)]\n\npub(crate) struct MessageDto {\n\n #[serde(rename = \"type\")]\n\n _type: u8,\n\n #[serde(rename = \"payload\")]\n\n payload: String,\n\n}\n\n\n\nimpl MessageDto {\n","file_path":"src/api/dtos/message_dto.rs","rank":55,"score":90541.00480169109},{"content":"/*\n\n * Copyright 2018 ProximaX Limited. All rights reserved.\n\n * Use of this source code is governed by the Apache 2.0\n\n * license that can be found in the LICENSE file.\n\n */\n\n\n\nuse crate::{node::NodeTime, Uint64};\n\n\n\nuse super::Uint64Dto;\n\n\n\n#[derive(Serialize, Deserialize)]\n\npub(crate) struct NodeTimeDto {\n\n #[serde(rename = \"communicationTimestamps\")]\n\n communication_timestamps: CommunicationTimestampsDto,\n\n}\n\n\n\n#[derive(Serialize, Deserialize)]\n","file_path":"src/api/dtos/node_dto.rs","rank":56,"score":90537.9933110632},{"content":"/*\n\n * Copyright 2018 ProximaX Limited. All rights reserved.\n\n * Use of this source code is governed by the Apache 2.0\n\n * license that can be found in the LICENSE file.\n\n */\n\n\n\nuse crate::{\n\n account::Address,\n\n alias::AliasActionType,\n\n models::Result,\n\n mosaic::MosaicId,\n\n namespace::{NamespaceAlias, NamespaceId},\n\n transaction::{AddressAliasTransaction, AliasTransaction, MosaicAliasTransaction, Transaction},\n\n};\n\n\n\nuse super::{AbstractTransactionDto, TransactionDto, TransactionMetaDto, Uint64Dto};\n\n\n\n#[derive(Serialize, Deserialize)]\n\n#[serde(rename_all = \"camelCase\")]\n\npub(crate) struct AliasDto {\n","file_path":"src/api/dtos/alias_dto.rs","rank":57,"score":90537.99263470396},{"content":"// Copyright 2018 ProximaX Limited. All rights reserved.\n\n// Use of this source code is governed by the Apache 2.0\n\n// license that can be found in the LICENSE file.\n\n\n\n#[derive(Serialize, Deserialize)]\n\npub(crate) struct ServerDto {\n\n server_info: ServerInfoDto,\n\n}\n\n\n\n#[derive(Serialize, Deserialize)]\n\npub(crate) struct ServerInfoDto {\n\n /// The catapult-rest component version.\n\n rest_version: String,\n\n /// The catapult-sdk component version.\n\n sdk_version: String,\n\n}\n","file_path":"src/api/dtos/server_dto.rs","rank":58,"score":90537.79635265878},{"content":"// Copyright 2018 ProximaX Limited. All rights reserved.\n\n// Use of this source code is governed by the Apache 2.0\n\n// license that can be found in the LICENSE file.\n\n\n\n#[derive(Serialize, Deserialize)]\n\npub(crate) struct UpgradeDto {\n\n #[serde(rename = \"height\")]\n\n height: Vec<i32>,\n\n #[serde(rename = \"blockChainVersion\")]\n\n block_chain_version: Vec<i32>,\n\n}\n","file_path":"src/api/dtos/upgrade_dto.rs","rank":59,"score":90536.96987155586},{"content":"/*\n\n * Copyright 2018 ProximaX Limited. All rights reserved.\n\n * Use of this source code is governed by the Apache 2.0\n\n * license that can be found in the LICENSE file.\n\n */\n\n\n\nuse super::{SourceDto, Uint64Dto};\n\n\n\n#[derive(Serialize, Deserialize)]\n\npub(crate) struct ResolutionEntryDto {\n\n #[serde(rename = \"source\")]\n\n source: SourceDto,\n\n #[serde(rename = \"resolved\")]\n\n resolved: Uint64Dto,\n\n}\n\n\n\n/// ResolutionStatementDto : A resolution statement keeps the relation between a namespace alias used in a transaction and the real address or mosaic_id.\n\n#[derive(Serialize, Deserialize)]\n\npub(crate) struct ResolutionStatementDto {\n\n height: Uint64Dto,\n\n unresolved: Uint64Dto,\n\n /// The array of resolution entries linked to the unresolved namespace_id. It is an array instead of a single UInt64 field since within one block the resolution might change for different sources due to alias related transactions.\n\n resolution_entries: Vec<ResolutionEntryDto>,\n\n}\n","file_path":"src/api/dtos/resolution_dto.rs","rank":60,"score":90536.6910752302},{"content":"// Copyright 2018 ProximaX Limited. All rights reserved.\n\n// Use of this source code is governed by the Apache 2.0\n\n// license that can be found in the LICENSE file.\n\n\n\n#[derive(Serialize, Deserialize)]\n\npub(crate) struct FieldDto {\n\n #[serde(rename = \"key\")]\n\n pub key: String,\n\n #[serde(rename = \"value\")]\n\n pub value: String,\n\n}\n","file_path":"src/api/dtos/field_dto.rs","rank":61,"score":90534.38022172819},{"content":"/*\n\n * Copyright 2018 ProximaX Limited. All rights reserved.\n\n * Use of this source code is governed by the Apache 2.0\n\n * license that can be found in the LICENSE file.\n\n */\n\n\n\nuse crate::{\n\n api::mosaic_properties,\n\n models::{\n\n errors_const,\n\n mosaic::{Mosaic, MosaicId, MosaicInfo, MosaicNames, MosaicNonce, MosaicSupplyType},\n\n transaction::{\n\n MetadataMosaicTransaction, MosaicDefinitionTransaction, MosaicSupplyChangeTransaction,\n\n Transaction,\n\n },\n\n Result,\n\n },\n\n};\n\n\n\nuse super::{\n","file_path":"src/api/dtos/mosaic_dto.rs","rank":62,"score":90534.36389028298},{"content":"/*\n\n * Copyright 2018 ProximaX Limited. All rights reserved.\n\n * Use of this source code is governed by the Apache 2.0\n\n * license that can be found in the LICENSE file.\n\n */\n\n\n\nuse crate::{\n\n account::PublicAccount,\n\n multisig::{CosignatoryModification, Cosignature, MultisigModificationType},\n\n network::NetworkType,\n\n};\n\n\n\n#[derive(Clone, Serialize, Deserialize)]\n\n#[serde(rename_all = \"camelCase\")]\n\npub(crate) struct CosignatoryModificationDto {\n\n #[serde(rename = \"type\")]\n\n modification_type: u8,\n\n cosignatory_public_key: String,\n\n}\n\n\n","file_path":"src/api/dtos/cosignature_dto.rs","rank":63,"score":90534.01716954978},{"content":"/*\n\n * Copyright 2018 ProximaX Limited. All rights reserved.\n\n * Use of this source code is governed by the Apache 2.0\n\n * license that can be found in the LICENSE file.\n\n */\n\n\n\nuse ::std::str::FromStr;\n\n\n\nuse crate::{\n\n account::{PublicAccount, EMPTY_PUBLIC_KEY},\n\n blockchain::BlockInfo,\n\n network::extract_network_type,\n\n transaction::{internal::extract_version, BlockchainTimestamp, HashValue},\n\n Result,\n\n};\n\n\n\nuse super::Uint64Dto;\n\n\n\n#[derive(Serialize, Deserialize)]\n\n#[serde(rename_all = \"camelCase\")]\n","file_path":"src/api/dtos/block_dto.rs","rank":64,"score":90533.7894971473},{"content":"/*\n\n * Copyright 2018 ProximaX Limited. All rights reserved.\n\n * Use of this source code is governed by the Apache 2.0\n\n * license that can be found in the LICENSE file.\n\n */\n\n\n\nuse crate::{\n\n account::PublicAccount,\n\n errors_const,\n\n models::Result,\n\n namespace::{NamespaceId, NamespaceInfo, NamespaceName, NamespaceType},\n\n network::NetworkType,\n\n transaction::{MetadataNamespaceTransaction, RegisterNamespaceTransaction, Transaction},\n\n AssetId,\n\n};\n\n\n\nuse super::{\n\n AbstractTransactionDto, AliasDto, ModifyMetadataTransactionDto, TransactionDto,\n\n TransactionMetaDto, Uint64Dto,\n\n};\n\n\n","file_path":"src/api/dtos/namespace_dto.rs","rank":65,"score":90533.32466941379},{"content":"/*\n\n * Copyright 2018 ProximaX Limited. All rights reserved.\n\n * Use of this source code is governed by the Apache 2.0\n\n * license that can be found in the LICENSE file.\n\n */\n\n\n\nuse ::std::str::FromStr;\n\n\n\nuse crate::models::transaction::Signature;\n\nuse crate::{\n\n account::{Address, PublicAccount},\n\n models::Result,\n\n mosaic::{Mosaic, MosaicId},\n\n network::extract_network_type,\n\n transaction::{\n\n internal::extract_version, AbstractTransaction, BlockchainTimestamp, Deadline, HashValue,\n\n LockFundsTransaction, SignedTransaction, Transaction, TransactionInfo, TransactionStatus,\n\n TransactionType, TransferTransaction,\n\n },\n\n};\n","file_path":"src/api/dtos/transaction_dto.rs","rank":66,"score":90528.6293891636},{"content":"/*\n\n * Copyright 2018 ProximaX Limited. All rights reserved.\n\n * Use of this source code is governed by the Apache 2.0\n\n * license that can be found in the LICENSE file.\n\n */\n\n\n\nuse {\n\n serde::{Deserialize, Deserializer},\n\n serde_json::Value,\n\n};\n\n\n\nuse crate::{\n\n account::{\n\n AccountInfo, AccountLinkType, AccountName, AccountProperties,\n\n AccountPropertiesAddressModification, AccountPropertiesEntityTypeModification,\n\n AccountPropertiesModificationType, AccountPropertiesMosaicModification,\n\n AccountPropertyType, Address,\n\n },\n\n models::{error::Error::Failure, Result},\n\n mosaic::{Mosaic, MosaicId},\n","file_path":"src/api/dtos/account_dto.rs","rank":67,"score":90528.54880259665},{"content":"/*\n\n * Copyright 2018 ProximaX Limited. All rights reserved.\n\n * Use of this source code is governed by the Apache 2.0\n\n * license that can be found in the LICENSE file.\n\n */\n\n\n\nuse ::std::collections::HashMap;\n\n\n\nuse crate::{\n\n helpers::has_bits,\n\n models::{\n\n account::PublicAccount,\n\n exchange::{\n\n AddOffer, ExchangeConfirmation, Offer, OfferIdInfo, OfferIdInfos, OfferInfo, OfferType,\n\n OfferType::{BuyOffer, SellOffer},\n\n RemoveOffer, UserExchangeInfo,\n\n },\n\n mosaic::{Mosaic, MosaicId},\n\n namespace::{NamespaceId, NAMESPACE_BIT},\n\n network::NetworkType,\n","file_path":"src/api/dtos/exchange_dto.rs","rank":68,"score":90525.2619955299},{"content":"};\n\n\n\nuse super::{AbstractTransactionDto, FieldDto, Uint64Dto};\n\n\n\n#[derive(Deserialize)]\n\npub(crate) struct MetadataDto<T> {\n\n pub(crate) metadata: T,\n\n}\n\n\n\n#[derive(Deserialize)]\n\npub(crate) struct MetadataInfoDto {\n\n #[serde(rename = \"metadataType\")]\n\n r#_type: u8,\n\n fields: Vec<FieldDto>,\n\n}\n\n\n\nimpl MetadataInfoDto {\n\n pub fn compact(&self) -> MetadataInfo {\n\n let mut fields: HashMap<String, String> = HashMap::new();\n\n\n","file_path":"src/api/dtos/metadata_dto.rs","rank":69,"score":90519.67946685763},{"content":"impl ModifyMetadataTransactionDto {\n\n pub fn compact(&self, info: TransactionInfo) -> crate::Result<ModifyMetadataTransaction> {\n\n let abs_transaction = self.r#abstract.compact(info)?;\n\n\n\n let modifications = metadata_dto_vec_to_struct(self.modifications.clone());\n\n Ok(ModifyMetadataTransaction {\n\n abs_transaction,\n\n metadata_type: MetadataType::from(self.metadata_type),\n\n modifications,\n\n })\n\n }\n\n}\n\n\n\n#[derive(Deserialize)]\n\npub(crate) struct AddressMetadataInfoDto {\n\n #[serde(flatten)]\n\n metadata: MetadataInfoDto,\n\n #[serde(rename = \"metadataId\")]\n\n address: String,\n\n}\n","file_path":"src/api/dtos/metadata_dto.rs","rank":70,"score":90519.0231516045},{"content":"// Copyright 2018 ProximaX Limited. All rights reserved.\n\n// Use of this source code is governed by the Apache 2.0\n\n// license that can be found in the LICENSE file.\n\n\n\n/// The type of the receipt:\n\n///* 0x134D (4941 decimal) - Mosaic_Rental_Fee.\n\n///* 0x124E (4686 decimal) - Namespace_Rental_Fee.\n\n///* 0x2143 (8515 decimal) - Harvest_Fee.\n\n///* 0x2248 (8776 decimal) - LockHash_Completed.\n\n///* 0x2348 (9032 decimal) - LockHash_Expired.\n\n///* 0x2252 (8786 decimal) - LockSecret_Completed.\n\n///* 0x2352 (9042 decimal) - LockSecret_Expired.\n\n///* 0x3148 (12616 decimal) - LockHash_Created.\n\n///* 0x3152 (12626 decimal) - LockSecret_Created.\n\n///* 0x414D (16717 decimal) - Mosaic_Expired.\n\n///* 0x414E (16718 decimal) - Namespace_Expired.\n\n///* 0x5143 (20803 decimal) - Inflation.\n\n///* 0xE134 (57652 decimal) - Transaction_Group.\n\n///* 0xF143 (61763 decimal) - Address_Alias_Resolution.\n\n///* 0xF243 (62019 decimal) - Mosaic_Alias_Resolution.\n","file_path":"src/api/dtos/receipt_dto.rs","rank":71,"score":90514.57726643789},{"content":"pub(crate) struct AccountPropertiesTransactionDto {\n\n #[serde(flatten)]\n\n r#abstract: AbstractTransactionDto,\n\n property_type: u8,\n\n modifications: Vec<AccountPropertiesModificationDto>,\n\n}\n\n\n\n#[typetag::serde]\n\nimpl TransactionDto for AccountPropertiesTransactionInfoDto {\n\n fn compact(&self) -> Result<Box<dyn Transaction>> {\n\n let dto = self.transaction.clone();\n\n\n\n let info = self.meta.compact()?;\n\n\n\n let abs_transaction = dto.r#abstract.compact(info)?;\n\n\n\n if dto.property_type & AccountPropertyType::AllowAddress.value() != 0 {\n\n let modifications: Vec<AccountPropertiesAddressModification> = dto\n\n .modifications\n\n .iter()\n","file_path":"src/api/dtos/account_dto.rs","rank":72,"score":90513.75925111523},{"content":" pub fn compact(&self) -> crate::Result<Vec<MultisigAccountInfo>> {\n\n Ok(self\n\n .multisig_entries\n\n .iter()\n\n .map(|item| item.compact().unwrap())\n\n .collect())\n\n }\n\n}\n\n\n\n#[derive(Serialize, Deserialize)]\n\npub(crate) struct MultisigAccountInfoDto {\n\n #[serde(rename = \"multisig\")]\n\n multisig: MultisigDto,\n\n}\n\n\n\nimpl MultisigAccountInfoDto {\n\n pub fn compact(&self) -> crate::Result<MultisigAccountInfo> {\n\n let dto = self.multisig.to_owned();\n\n let network_type: NetworkType =\n\n Address::from_encoded(&dto.account_address.unwrap())?.network_type();\n","file_path":"src/api/dtos/multisig_dto.rs","rank":73,"score":90512.66217651396},{"content":"#[serde(rename_all = \"camelCase\")]\n\npub(crate) struct MultisigDto {\n\n account: String,\n\n #[serde(rename = \"accountAddress\", skip_serializing_if = \"Option::is_none\")]\n\n account_address: Option<String>,\n\n min_approval: i32,\n\n min_removal: i32,\n\n cosignatories: Vec<String>,\n\n multisig_accounts: Vec<String>,\n\n}\n\n\n\n#[derive(Serialize, Deserialize)]\n\npub(crate) struct MultisigAccountGraphInfoDto {\n\n #[serde(rename = \"level\")]\n\n pub level: i16,\n\n #[serde(rename = \"multisigEntries\")]\n\n multisig_entries: Vec<MultisigAccountInfoDto>,\n\n}\n\n\n\nimpl MultisigAccountGraphInfoDto {\n","file_path":"src/api/dtos/multisig_dto.rs","rank":74,"score":90512.4972710403},{"content":" mosaic_id: Option<Uint64Dto>,\n\n}\n\n\n\n#[derive(Serialize, Deserialize)]\n\n#[serde(rename_all = \"camelCase\")]\n\npub(crate) struct AddressAliasTransactionInfoDto {\n\n meta: TransactionMetaDto,\n\n transaction: AliasTransactionDto,\n\n}\n\n\n\n#[typetag::serde]\n\nimpl TransactionDto for AddressAliasTransactionInfoDto {\n\n fn compact(&self) -> Result<Box<dyn Transaction>> {\n\n let dto = self.transaction.clone();\n\n\n\n let info = self.meta.compact()?;\n\n\n\n let address_encoded = dto.address.unwrap();\n\n\n\n let address = Address::from_encoded(&address_encoded)?;\n","file_path":"src/api/dtos/alias_dto.rs","rank":75,"score":90511.1876476279},{"content":"\n\n#[typetag::serde]\n\nimpl TransactionDto for TransferTransactionInfoDto {\n\n fn compact(&self) -> Result<Box<dyn Transaction>> {\n\n let dto = self.transaction.clone();\n\n let info = self.meta.compact()?;\n\n\n\n let abs_transaction = dto.r#abstract.compact(info)?;\n\n\n\n let mut mosaics: Vec<Mosaic> = vec![];\n\n if let Some(value) = &dto.mosaics {\n\n for mosaic in value {\n\n mosaics.push(mosaic.compact());\n\n }\n\n };\n\n\n\n let recipient = Address::from_encoded(&dto.recipient)?;\n\n\n\n Ok(Box::new(TransferTransaction {\n\n abs_transaction,\n","file_path":"src/api/dtos/transaction_dto.rs","rank":76,"score":90510.73174812277},{"content":" r#abstract: AbstractTransactionDto,\n\n pub offers: AddOfferDTOs,\n\n}\n\n\n\n#[derive(Clone, Serialize, Deserialize)]\n\n#[serde(rename_all = \"camelCase\")]\n\npub(crate) struct AddExchangeOfferTransactionInfoDto {\n\n pub meta: TransactionMetaDto,\n\n pub transaction: AddExchangeOfferTransactionDto,\n\n}\n\n\n\n#[typetag::serde]\n\nimpl TransactionDto for AddExchangeOfferTransactionInfoDto {\n\n fn compact(&self) -> Result<Box<dyn Transaction>> {\n\n let dto = self.transaction.clone();\n\n let info = self.meta.compact()?;\n\n\n\n let abs_transaction = dto.r#abstract.compact(info)?;\n\n\n\n let offers: Vec<AddOffer> = dto\n","file_path":"src/api/dtos/exchange_dto.rs","rank":77,"score":90510.69836347211},{"content":" transaction::{\n\n AddExchangeOfferTransaction, ExchangeOfferTransaction, RemoveExchangeOfferTransaction,\n\n Transaction,\n\n },\n\n AssetId, Result,\n\n },\n\n};\n\n\n\nuse super::{AbstractTransactionDto, TransactionDto, TransactionMetaDto, Uint64Dto};\n\n\n\npub(crate) type OfferInfoDTOs = Vec<OfferInfoDto>;\n","file_path":"src/api/dtos/exchange_dto.rs","rank":78,"score":90510.62766981818},{"content":"\n\nimpl AddressMetadataInfoDto {\n\n pub fn compact(&self) -> crate::Result<AddressMetadataInfo> {\n\n let info = self.metadata.compact();\n\n\n\n let address = if !self.address.is_empty() {\n\n Address::from_encoded(&self.address)?\n\n } else {\n\n Address::default()\n\n };\n\n Ok(AddressMetadataInfo { info, address })\n\n }\n\n}\n\n\n\n#[derive(Deserialize)]\n\npub(crate) struct MosaicMetadataInfoDto {\n\n #[serde(flatten)]\n\n metadata: MetadataInfoDto,\n\n #[serde(rename = \"metadataId\")]\n\n mosaic_id: Uint64Dto,\n","file_path":"src/api/dtos/metadata_dto.rs","rank":79,"score":90510.42190668189},{"content":"}\n\n\n\nimpl ExchangeInfoDto {\n\n pub(crate) fn compact(&self, network_type: NetworkType) -> Result<UserExchangeInfo> {\n\n let dto = self.to_owned();\n\n let owner = PublicAccount::from_public_key(&dto.exchange.owner, network_type)?;\n\n\n\n let mut buy_offer: OfferIdInfos = vec![];\n\n let mut buy_offer_offers: Vec<OfferInfo> = vec![];\n\n for item in dto.exchange.buy_offers.into_iter() {\n\n buy_offer_offers.push(item.compact(owner.to_owned())?)\n\n }\n\n\n\n for offer_info in buy_offer_offers.into_iter() {\n\n let id = &offer_info.mosaic.asset_id;\n\n buy_offer.push(OfferIdInfo {\n\n mosaic_id: id.as_mosaic_id()?,\n\n offer_info,\n\n });\n\n }\n","file_path":"src/api/dtos/exchange_dto.rs","rank":80,"score":90509.53819607715},{"content":"pub(crate) struct RegisterNamespaceTransactionInfoDto {\n\n meta: TransactionMetaDto,\n\n transaction: RegisterNamespaceTransactionDto,\n\n}\n\n\n\n#[typetag::serde]\n\nimpl TransactionDto for RegisterNamespaceTransactionInfoDto {\n\n fn compact(&self) -> Result<Box<dyn Transaction>> {\n\n let dto = self.transaction.clone();\n\n\n\n let info = self.meta.compact()?;\n\n\n\n let abs_transaction = dto.r#abstract.compact(info)?;\n\n\n\n let namespace_type = NamespaceType::from(dto.namespace_type);\n\n\n\n let namespace_id = NamespaceId::from(dto.namespace_id.compact());\n\n\n\n let mut parent_id = None;\n\n\n","file_path":"src/api/dtos/namespace_dto.rs","rank":81,"score":90508.6189400059},{"content":" owner,\n\n offers: offers_map,\n\n })\n\n }\n\n}\n\n\n\n#[derive(Clone, Serialize, Deserialize)]\n\n#[serde(rename_all = \"camelCase\")]\n\npub(crate) struct OfferInfoDto {\n\n mosaic_id: Uint64Dto,\n\n amount: Uint64Dto,\n\n initial_amount: Uint64Dto,\n\n initial_cost: Uint64Dto,\n\n deadline: Uint64Dto,\n\n pub owner: Option<String>,\n\n}\n\n\n\nimpl OfferInfoDto {\n\n pub(crate) fn compact(&self, owner: PublicAccount) -> crate::Result<OfferInfo> {\n\n let dto = self.to_owned();\n","file_path":"src/api/dtos/exchange_dto.rs","rank":82,"score":90508.35504358371},{"content":"#[serde(rename_all = \"camelCase\")]\n\npub(crate) struct ExchangeOfferTransactionDto {\n\n #[serde(flatten)]\n\n r#abstract: AbstractTransactionDto,\n\n pub offers: ConfirmationOfferDTOs,\n\n}\n\n\n\n#[derive(Clone, Serialize, Deserialize)]\n\n#[serde(rename_all = \"camelCase\")]\n\npub(crate) struct ExchangeOfferTransactionInfoDto {\n\n pub meta: TransactionMetaDto,\n\n pub transaction: ExchangeOfferTransactionDto,\n\n}\n\n\n\n#[typetag::serde]\n\nimpl TransactionDto for ExchangeOfferTransactionInfoDto {\n\n fn compact(&self) -> Result<Box<dyn Transaction>> {\n\n let dto = self.transaction.clone();\n\n let info = self.meta.compact()?;\n\n\n","file_path":"src/api/dtos/exchange_dto.rs","rank":83,"score":90508.31540451657},{"content":" let dto = &self.account;\n\n let add = Address::from_encoded(&dto.clone().address)?;\n\n let acc_type = AccountLinkType::new(dto.clone().account_type);\n\n\n\n let mosaics: Vec<Mosaic> = dto\n\n .mosaics\n\n .iter()\n\n .map(move |mosaic_dto| mosaic_dto.compact())\n\n .collect();\n\n\n\n Ok(AccountInfo::new(\n\n add,\n\n dto.clone().address_height.compact(),\n\n dto.clone().public_key,\n\n dto.public_key_height.compact(),\n\n acc_type,\n\n mosaics,\n\n ))\n\n }\n\n}\n\n\n\n/// AccountLinkTransactionDto : Delegates the account importance score to a proxy account.\n","file_path":"src/api/dtos/account_dto.rs","rank":84,"score":90507.59914264442},{"content":"\n\nimpl MetadataModificationDto {\n\n pub fn compact(&self) -> MetadataModification {\n\n MetadataModification {\n\n r#type: MetadataModificationType::from(self.modification_type),\n\n key: self.key.clone(),\n\n value: self.value.clone(),\n\n }\n\n }\n\n}\n\n\n\n#[derive(Clone, Serialize, Deserialize)]\n\n#[serde(rename_all = \"camelCase\")]\n\npub(crate) struct ModifyMetadataTransactionDto {\n\n #[serde(flatten)]\n\n pub r#abstract: AbstractTransactionDto,\n\n pub metadata_type: u8,\n\n pub modifications: Vec<MetadataModificationDto>,\n\n}\n\n\n","file_path":"src/api/dtos/metadata_dto.rs","rank":85,"score":90506.94952124306},{"content":" });\n\n\n\n Ok(AccountProperties {\n\n address: Address::from_encoded(&dto.address)?,\n\n allowed_addresses,\n\n allowed_mosaic_id,\n\n allowed_entity_types,\n\n blocked_addresses,\n\n blocked_mosaic_id,\n\n blocked_entity_types,\n\n })\n\n }\n\n}\n\n\n\n#[derive(Clone, Serialize, Deserialize)]\n\n#[serde(rename_all = \"camelCase\")]\n\npub(crate) struct AccountPropertiesDto {\n\n address: String,\n\n properties: Vec<PropertiesDto>,\n\n}\n\n\n","file_path":"src/api/dtos/account_dto.rs","rank":86,"score":90506.58937642124},{"content":" let mut blocked_mosaic_id: Vec<MosaicId> = vec![];\n\n let mut blocked_entity_types: Vec<TransactionType> = vec![];\n\n\n\n dto.properties.iter().for_each(|p_dto| {\n\n if let Some(item) = p_dto.addresses.clone() {\n\n let property_addresses = item\n\n .into_iter()\n\n .map(|hex_address| Address::from_encoded(&hex_address).unwrap())\n\n .collect();\n\n if p_dto.property_type == AccountPropertyType::AllowAddress.value() {\n\n allowed_addresses = property_addresses;\n\n } else {\n\n blocked_addresses = property_addresses;\n\n }\n\n };\n\n });\n\n\n\n dto.properties.iter().for_each(|p_dto| {\n\n if let Some(item) = p_dto.mosaic_ids.clone() {\n\n let property_mosaic_id = item\n","file_path":"src/api/dtos/account_dto.rs","rank":87,"score":90506.4157940474},{"content":"#[derive(Clone, Serialize, Deserialize)]\n\n#[serde(rename_all = \"camelCase\")]\n\npub(crate) struct ConfirmationOffer {\n\n #[serde(flatten)]\n\n offer_dto: OfferDTO,\n\n owner: String,\n\n}\n\n\n\n#[derive(Clone, Serialize, Deserialize)]\n\n#[serde(rename_all = \"camelCase\")]\n\npub(crate) struct ExchangeDto {\n\n owner: String,\n\n buy_offers: OfferInfoDTOs,\n\n sell_offers: OfferInfoDTOs,\n\n}\n\n\n\n#[derive(Clone, Serialize, Deserialize)]\n\n#[serde(rename_all = \"camelCase\")]\n\npub(crate) struct ExchangeInfoDto {\n\n exchange: ExchangeDto,\n","file_path":"src/api/dtos/exchange_dto.rs","rank":88,"score":90505.62758444347},{"content":"}\n\n\n\n#[typetag::serde]\n\nimpl TransactionDto for ModifyMultisigAccountTransactionInfoDto {\n\n fn compact(&self) -> Result<Box<dyn Transaction>> {\n\n let dto = self.transaction.clone();\n\n let info = self.meta.compact()?;\n\n\n\n let abs_transaction = dto.r#abstract.compact(info)?;\n\n\n\n let modifications =\n\n cosignatory_dto_vec_to_struct(dto.modifications, abs_transaction.network_type);\n\n\n\n Ok(Box::new(ModifyMultisigAccountTransaction {\n\n abs_transaction,\n\n min_removal_delta: dto.min_removal_delta,\n\n min_approval_delta: dto.min_approval_delta,\n\n modifications,\n\n }))\n\n }\n\n}\n","file_path":"src/api/dtos/multisig_dto.rs","rank":89,"score":90505.2988022442},{"content":" #[serde(rename = \"type\")]\n\n _type: u16,\n\n #[serde(skip_serializing_if = \"Option::is_none\")]\n\n mosaic_id: Option<Uint64Dto>,\n\n /// The aliased address in hexadecimal.\n\n #[serde(skip_serializing_if = \"Option::is_none\")]\n\n address: Option<String>,\n\n}\n\n\n\nimpl AliasDto {\n\n pub fn compact(&self) -> crate::Result<NamespaceAlias> {\n\n let mut alias = NamespaceAlias::default();\n\n alias.type_ = self._type as u8;\n\n\n\n if let Some(a) = &self.address {\n\n let address = Address::from_encoded(a)?;\n\n alias.address = Some(address)\n\n };\n\n\n\n if let Some(m) = &self.mosaic_id {\n","file_path":"src/api/dtos/alias_dto.rs","rank":90,"score":90505.12973691158},{"content":"pub(crate) struct NamespaceMetadataTransactionInfoDto {\n\n meta: TransactionMetaDto,\n\n transaction: NamespaceMetadataTransactionDto,\n\n}\n\n\n\n#[typetag::serde]\n\nimpl TransactionDto for NamespaceMetadataTransactionInfoDto {\n\n fn compact(&self) -> Result<Box<dyn Transaction>> {\n\n let dto = self.transaction.clone();\n\n\n\n let info = self.meta.compact()?;\n\n\n\n let metadata_transaction = dto.metadata_transaction.compact(info)?;\n\n\n\n let namespace_id = NamespaceId::from(dto.namespace_id.compact());\n\n\n\n Ok(Box::new(MetadataNamespaceTransaction {\n\n metadata_transaction,\n\n namespace_id,\n\n }))\n","file_path":"src/api/dtos/namespace_dto.rs","rank":91,"score":90505.10875483896},{"content":" #[serde(flatten)]\n\n metadata_transaction: ModifyMetadataTransactionDto,\n\n #[serde(rename = \"metadataId\")]\n\n mosaic_id: Uint64Dto,\n\n}\n\n\n\n#[derive(Serialize, Deserialize)]\n\n#[serde(rename_all = \"camelCase\")]\n\npub(crate) struct MosaicMetadataTransactionInfoDto {\n\n meta: TransactionMetaDto,\n\n transaction: MosaicMetadataTransactionDto,\n\n}\n\n\n\n#[typetag::serde]\n\nimpl TransactionDto for MosaicMetadataTransactionInfoDto {\n\n fn compact(&self) -> Result<Box<dyn Transaction>> {\n\n let dto = self.transaction.clone();\n\n\n\n let info = self.meta.compact()?;\n\n\n","file_path":"src/api/dtos/mosaic_dto.rs","rank":92,"score":90504.9721699059},{"content":"\n\n Ok(AccountName {\n\n address,\n\n names: self.to_owned().names,\n\n })\n\n }\n\n}\n\n\n\n#[derive(Serialize, Deserialize)]\n\n#[serde(rename_all = \"camelCase\")]\n\npub(crate) struct AccountPropertiesTransactionInfoDto {\n\n meta: TransactionMetaDto,\n\n transaction: AccountPropertiesTransactionDto,\n\n}\n\n\n\n/// AccountPropertiesTransactionDto :\n\n/// Transaction that prevents receiving transactions from undesired\n\n/// addresses, mosaics or sending certain transaction types.\n\n#[derive(Clone, Serialize, Deserialize)]\n\n#[serde(rename_all = \"camelCase\")]\n","file_path":"src/api/dtos/account_dto.rs","rank":93,"score":90504.87245619828},{"content":" let metadata_transaction = dto.metadata_transaction.compact(info)?;\n\n\n\n let mosaic_id = MosaicId::from(dto.mosaic_id.compact());\n\n\n\n Ok(Box::new(MetadataMosaicTransaction {\n\n metadata_transaction,\n\n mosaic_id,\n\n }))\n\n }\n\n}\n\n\n\n#[derive(Serialize, Deserialize)]\n\n#[serde(rename_all = \"camelCase\")]\n\npub(crate) struct MosaicNamesDto {\n\n mosaic_id: Uint64Dto,\n\n names: Vec<String>,\n\n}\n\n\n\nimpl MosaicNamesDto {\n\n pub fn compact(&self) -> MosaicNames {\n","file_path":"src/api/dtos/mosaic_dto.rs","rank":94,"score":90504.74833935809},{"content":" })\n\n }\n\n}\n\n\n\n#[derive(Serialize, Deserialize)]\n\n#[serde(rename_all = \"camelCase\")]\n\npub(crate) struct ModifyMultisigAccountTransactionInfoDto {\n\n meta: TransactionMetaDto,\n\n transaction: ModifyMultisigAccountTransactionDto,\n\n}\n\n\n\n/// ModifyMultisigAccountTransactionDto : Transaction that creates or modifies a multisig account.\n\n#[derive(Clone, Serialize, Deserialize)]\n\n#[serde(rename_all = \"camelCase\")]\n\npub(crate) struct ModifyMultisigAccountTransactionDto {\n\n #[serde(flatten)]\n\n r#abstract: AbstractTransactionDto,\n\n min_removal_delta: i8,\n\n min_approval_delta: i8,\n\n modifications: Vec<CosignatoryModificationDto>,\n","file_path":"src/api/dtos/multisig_dto.rs","rank":95,"score":90504.6375216104},{"content":" MosaicNames::new(\n\n MosaicId::from(self.mosaic_id.compact()),\n\n (self.names).to_owned(),\n\n )\n\n }\n\n}\n\n\n\n#[derive(Clone, Serialize, Deserialize)]\n\npub(crate) struct MosaicPropertyDto {\n\n pub(crate) id: u8,\n\n pub(crate) value: Uint64Dto,\n\n}\n\n\n\n#[derive(Clone, Serialize, Deserialize)]\n\n#[serde(rename_all = \"camelCase\")]\n\npub(crate) struct MosaicSupplyChangeTransactionInfoDto {\n\n meta: TransactionMetaDto,\n\n transaction: MosaicSupplyChangeTransactionDto,\n\n}\n\n\n","file_path":"src/api/dtos/mosaic_dto.rs","rank":96,"score":90504.56589782966},{"content":"}\n\n\n\nimpl MosaicMetadataInfoDto {\n\n pub fn compact(&self) -> crate::Result<MosaicMetadataInfo> {\n\n let info = self.metadata.compact();\n\n\n\n let mosaic_id = if !self.mosaic_id.0.is_empty() {\n\n MosaicId::from(self.mosaic_id.compact())\n\n } else {\n\n MosaicId::default()\n\n };\n\n Ok(MosaicMetadataInfo { info, mosaic_id })\n\n }\n\n}\n\n\n\n#[derive(Deserialize)]\n\npub(crate) struct NamespaceMetadataInfoDto {\n\n #[serde(flatten)]\n\n metadata: MetadataInfoDto,\n\n #[serde(rename = \"metadataId\")]\n","file_path":"src/api/dtos/metadata_dto.rs","rank":97,"score":90503.76918955275},{"content":" } else {\n\n None\n\n };\n\n\n\n Ok(TransactionStatus::new(\n\n dto.group.clone().unwrap(),\n\n dto.status.clone(),\n\n HashValue::from_str(&dto.hash.as_ref().unwrap())?,\n\n deadline,\n\n height,\n\n ))\n\n }\n\n}\n\n\n\n#[derive(Clone, Serialize, Deserialize)]\n\n#[serde(rename_all = \"camelCase\")]\n\npub(crate) struct TransferTransactionInfoDto {\n\n pub meta: TransactionMetaDto,\n\n pub transaction: TransferTransactionDto,\n\n}\n","file_path":"src/api/dtos/transaction_dto.rs","rank":98,"score":90503.75979421864},{"content":" confirmations,\n\n }))\n\n }\n\n}\n\n\n\n/// AddExchangeOfferTransactionDto.\n\n#[derive(Clone, Serialize, Deserialize)]\n\n#[serde(rename_all = \"camelCase\")]\n\npub(crate) struct RemoveExchangeOfferTransactionDto {\n\n #[serde(flatten)]\n\n r#abstract: AbstractTransactionDto,\n\n pub offers: RemoveOfferDTOs,\n\n}\n\n\n\n#[derive(Clone, Serialize, Deserialize)]\n\n#[serde(rename_all = \"camelCase\")]\n\npub(crate) struct RemoveExchangeOfferTransactionInfoDto {\n\n pub meta: TransactionMetaDto,\n\n pub transaction: RemoveExchangeOfferTransactionDto,\n\n}\n","file_path":"src/api/dtos/exchange_dto.rs","rank":99,"score":90503.62273871123}],"string":"[\n {\n \"content\": \"fn parse_meta_ws(value_dto: &mut Value) -> Result<()> {\\n\\n if let Some(v) = value_dto[\\\"transaction\\\"][\\\"transactions\\\"].as_array_mut() {\\n\\n let mut meta_value: Vec<Value> = vec![];\\n\\n\\n\\n for item in v.iter_mut() {\\n\\n if item[\\\"meta\\\"].is_null() {\\n\\n let meta = r#\\\"\\\"meta\\\": {}, \\\"transaction\\\":\\\"#;\\n\\n let parse_meta_srt = format!(\\\"{}\\\", item).replace(r#\\\"\\\"transaction\\\":\\\"#, meta);\\n\\n\\n\\n let parse_meta: Value = serde_json::from_str(&parse_meta_srt)?;\\n\\n meta_value.push(parse_meta)\\n\\n } else {\\n\\n let parse_meta: Value = serde_json::from_str(&*format!(\\\"{}\\\", item))?;\\n\\n meta_value.push(parse_meta)\\n\\n }\\n\\n }\\n\\n v.clear();\\n\\n v.append(&mut meta_value)\\n\\n };\\n\\n Ok(())\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/api/internally.rs\",\n \"rank\": 0,\n \"score\": 199868.54982480197\n },\n {\n \"content\": \"fn path_parse_address(mut path: String, address: Address) -> String {\\n\\n path.push_str(\\\"/\\\");\\n\\n path.push_str(&address.address_string());\\n\\n path\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/websocket/client.rs\",\n \"rank\": 1,\n \"score\": 194066.74521329853\n },\n {\n \"content\": \"pub fn hex_decode(data: &str) -> Vec<u8> {\\n\\n hex::decode(data)\\n\\n .map_err(|err| panic!(\\\"Failed to decode hex data {} : {}\\\", data, err))\\n\\n .unwrap()\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/helpers/utils_hex.rs\",\n \"rank\": 2,\n \"score\": 172835.29757663194\n },\n {\n \"content\": \"#[derive(Clone, Serialize)]\\n\\n#[serde(rename_all = \\\"camelCase\\\")]\\n\\nstruct PropertiesDto {\\n\\n property_type: u8,\\n\\n #[serde(skip_serializing_if = \\\"Option::is_none\\\")]\\n\\n mosaic_ids: Option<Vec<Uint64Dto>>,\\n\\n #[serde(skip_serializing_if = \\\"Option::is_none\\\")]\\n\\n addresses: Option<Vec<String>>,\\n\\n #[serde(skip_serializing_if = \\\"Option::is_none\\\")]\\n\\n entity_types: Option<Vec<u16>>,\\n\\n}\\n\\n\\n\\nimpl<'de> Deserialize<'de> for PropertiesDto {\\n\\n fn deserialize<D>(deserializer: D) -> ::std::result::Result<Self, D::Error>\\n\\n where\\n\\n D: Deserializer<'de>,\\n\\n {\\n\\n #[derive(Deserialize, Debug)]\\n\\n struct PropertyValue {\\n\\n #[serde(rename = \\\"propertyType\\\")]\\n\\n r#type: u8,\\n\\n values: Value,\\n\",\n \"file_path\": \"src/api/dtos/account_dto.rs\",\n \"rank\": 3,\n \"score\": 166279.64268948545\n },\n {\n \"content\": \"#[derive(Clone, Serialize, Deserialize)]\\n\\n#[serde(rename_all = \\\"camelCase\\\")]\\n\\nstruct AccountDto {\\n\\n address: String,\\n\\n address_height: Uint64Dto,\\n\\n /// The public key of an account can be used to verify signatures of the account. Only accounts that have already published a transaction have a public key assigned to the account. Otherwise, the field is null.\\n\\n public_key: String,\\n\\n public_key_height: Uint64Dto,\\n\\n /// The list of mosaics the account owns. The amount is represented in absolute amount. Thus a balance of 123456789 for a mosaic with divisibility 6 (absolute) means the account owns 123.456789 instead.\\n\\n mosaics: Vec<MosaicDto>,\\n\\n account_type: u8,\\n\\n /// The public key of a linked account. The linked account can use|provide balance for delegated harvesting.\\n\\n linked_account_key: String,\\n\\n}\\n\\n\\n\\n#[derive(Serialize, Deserialize)]\\n\\npub(crate) struct AccountInfoDto {\\n\\n account: AccountDto,\\n\\n}\\n\\n\\n\\nimpl AccountInfoDto {\\n\\n pub(crate) fn compact(&self) -> crate::Result<AccountInfo> {\\n\",\n \"file_path\": \"src/api/dtos/account_dto.rs\",\n \"rank\": 4,\n \"score\": 166279.60964477784\n },\n {\n \"content\": \"#[derive(Serialize, Deserialize)]\\n\\n#[serde(rename_all = \\\"camelCase\\\")]\\n\\nstruct BlockDtoAllOf {\\n\\n height: Uint64Dto,\\n\\n timestamp: Uint64Dto,\\n\\n difficulty: Uint64Dto,\\n\\n /// The fee multiplier applied to transactions contained in block.\\n\\n fee_multiplier: i32,\\n\\n /// The hash of the previous block.\\n\\n previous_block_hash: String,\\n\\n /// The transactions included in a block are hashed forming a merkle tree. The root of the tree summarizes them.\\n\\n block_transactions_hash: String,\\n\\n /// The collection of receipts are hashed into a merkle tree and linked to a block. The block header stores the root hash.\\n\\n block_receipts_hash: String,\\n\\n /// For each block, the state of the blockchain is stored in RocksDB, forming a patricia tree. The root of the tree summarizes the state of the blockchain for the given block.\\n\\n state_hash: String,\\n\\n /// The public key of the optional beneficiary designated by harvester.\\n\\n beneficiary: String,\\n\\n /// The part of the transaction fee harvester is willing to get. From 0 up to FeeInterestDenominator. The customer gets (FeeInterest / FeeInterestDenominator)'th part of the maximum transaction fee.\\n\\n fee_interest: i32,\\n\\n /// Denominator of the transaction fee.\\n\\n fee_interest_denominator: i32,\\n\\n}\\n\",\n \"file_path\": \"src/api/dtos/block_dto.rs\",\n \"rank\": 5,\n \"score\": 166274.7413419521\n },\n {\n \"content\": \"#[derive(Serialize, Deserialize)]\\n\\n#[serde(rename_all = \\\"camelCase\\\")]\\n\\nstruct BlockMetaDto {\\n\\n hash: String,\\n\\n generation_hash: String,\\n\\n total_fee: Uint64Dto,\\n\\n num_transactions: u64,\\n\\n}\\n\\n\\n\\n#[derive(Serialize, Deserialize)]\\n\\n#[serde(rename_all = \\\"camelCase\\\")]\\n\\npub(crate) struct BlockDto {\\n\\n signature: String,\\n\\n signer: String,\\n\\n version: u32,\\n\\n #[serde(rename = \\\"type\\\")]\\n\\n _type: u32,\\n\\n pub height: Uint64Dto,\\n\\n timestamp: Uint64Dto,\\n\\n difficulty: Uint64Dto,\\n\\n #[serde(skip_serializing_if = \\\"Option::is_none\\\")]\\n\\n fee_multiplier: Option<i32>,\\n\",\n \"file_path\": \"src/api/dtos/block_dto.rs\",\n \"rank\": 6,\n \"score\": 164172.02513978007\n },\n {\n \"content\": \"#[derive(Serialize, Deserialize)]\\n\\nstruct MosaicMetaDto {\\n\\n #[serde(rename = \\\"id\\\")]\\n\\n id: String,\\n\\n}\\n\\n\\n\\n#[derive(Serialize, Deserialize)]\\n\\n#[serde(rename_all = \\\"camelCase\\\")]\\n\\npub(crate) struct MosaicDefinitionTransactionInfoDto {\\n\\n meta: TransactionMetaDto,\\n\\n transaction: MosaicDefinitionTransactionDto,\\n\\n}\\n\\n\\n\\n/// MosaicDefinitionTransactionDto : Transaction that creates a new mosaic.\\n\\n#[derive(Clone, Serialize, Deserialize)]\\n\\n#[serde(rename_all = \\\"camelCase\\\")]\\n\\npub(crate) struct MosaicDefinitionTransactionDto {\\n\\n #[serde(flatten)]\\n\\n r#abstract: AbstractTransactionDto,\\n\\n /// Random nonce used to generate the mosaic id.\\n\\n mosaic_nonce: u32,\\n\",\n \"file_path\": \"src/api/dtos/mosaic_dto.rs\",\n \"rank\": 7,\n \"score\": 164172.02513978007\n },\n {\n \"content\": \"#[derive(Serialize, Deserialize)]\\n\\nstruct CommunicationTimestampsDto {\\n\\n #[serde(rename = \\\"sendTimestamp\\\", skip_serializing_if = \\\"Option::is_none\\\")]\\n\\n send_timestamp: Option<Uint64Dto>,\\n\\n #[serde(rename = \\\"receiveTimestamp\\\", skip_serializing_if = \\\"Option::is_none\\\")]\\n\\n receive_timestamp: Option<Uint64Dto>,\\n\\n}\\n\\n\\n\\nimpl NodeTimeDto {\\n\\n pub(crate) fn compact(&self) -> NodeTime {\\n\\n let mut send = Uint64::default();\\n\\n if let Some(value) = &self.communication_timestamps.send_timestamp {\\n\\n send = value.compact();\\n\\n };\\n\\n\\n\\n let mut receive = Uint64::default();\\n\\n if let Some(value) = &self.communication_timestamps.receive_timestamp {\\n\\n receive = value.compact();\\n\\n };\\n\\n\\n\\n NodeTime {\\n\\n send_timestamp: Some(send),\\n\\n receive_timestamp: Some(receive),\\n\\n }\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/api/dtos/node_dto.rs\",\n \"rank\": 8,\n \"score\": 164172.02513978007\n },\n {\n \"content\": \"pub fn schema_common_definition() -> Vec<Box<dyn SchemaAttribute>> {\\n\\n vec![\\n\\n Box::new(ScalarAttribute::new(\\\"size\\\", SIZEOF_INT)),\\n\\n Box::new(ArrayAttribute::new(\\\"signature\\\", SIZEOF_BYTE)),\\n\\n Box::new(ArrayAttribute::new(\\\"signer\\\", SIZEOF_BYTE)),\\n\\n Box::new(ScalarAttribute::new(\\\"version\\\", SIZEOF_INT)),\\n\\n Box::new(ScalarAttribute::new(\\\"type\\\", SIZEOF_SHORT)),\\n\\n Box::new(ArrayAttribute::new(\\\"max_fee\\\", SIZEOF_INT)),\\n\\n Box::new(ArrayAttribute::new(\\\"deadline\\\", SIZEOF_INT)),\\n\\n ]\\n\\n}\\n\",\n \"file_path\": \"src/models/transaction/schema/schema_common_definition.rs\",\n \"rank\": 9,\n \"score\": 163229.2427109059\n },\n {\n \"content\": \"#[derive(Clone, Serialize, Deserialize)]\\n\\nstruct AccountPropertiesModificationDto {\\n\\n r#type: u8,\\n\\n /// The address, transaction type or mosaic id to filter.\\n\\n value: Value,\\n\\n}\\n\\n\\n\\n#[derive(Serialize, Deserialize)]\\n\\n#[serde(rename_all = \\\"camelCase\\\")]\\n\\npub(crate) struct AccountPropertiesInfoDto {\\n\\n account_properties: AccountPropertiesDto,\\n\\n}\\n\\n\\n\\nimpl AccountPropertiesInfoDto {\\n\\n pub fn compact(&self) -> Result<AccountProperties> {\\n\\n let dto = self.account_properties.clone();\\n\\n\\n\\n let mut allowed_addresses: Vec<Address> = vec![];\\n\\n let mut allowed_mosaic_id: Vec<MosaicId> = vec![];\\n\\n let mut allowed_entity_types: Vec<TransactionType> = vec![];\\n\\n let mut blocked_addresses: Vec<Address> = vec![];\\n\",\n \"file_path\": \"src/api/dtos/account_dto.rs\",\n \"rank\": 10,\n \"score\": 162138.7001246756\n },\n {\n \"content\": \"#[derive(Serialize, Deserialize)]\\n\\n#[serde(rename_all = \\\"camelCase\\\")]\\n\\nstruct AccountLinkTransactionDto {\\n\\n #[serde(flatten)]\\n\\n r#abstract: AbstractTransactionDto,\\n\\n /// The public key of the remote account.\\n\\n remote_account_key: String,\\n\\n action: u8,\\n\\n}\\n\\n\\n\\n#[derive(Clone, Serialize, Deserialize)]\\n\\n#[serde(rename_all = \\\"camelCase\\\")]\\n\\npub(crate) struct AccountNamesDto {\\n\\n /// The address of the account in hexadecimal.\\n\\n address: String,\\n\\n /// The mosaic linked namespace names.\\n\\n names: Vec<String>,\\n\\n}\\n\\n\\n\\nimpl AccountNamesDto {\\n\\n pub fn compact(&self) -> crate::Result<AccountName> {\\n\\n let address = Address::from_encoded(&self.address)?;\\n\",\n \"file_path\": \"src/api/dtos/account_dto.rs\",\n \"rank\": 11,\n \"score\": 162133.69689548985\n },\n {\n \"content\": \"type RemoveOfferDTOs = Vec<RemoveOfferDto>;\\n\",\n \"file_path\": \"src/api/dtos/exchange_dto.rs\",\n \"rank\": 12,\n \"score\": 151718.89812448283\n },\n {\n \"content\": \"type AddOfferDTOs = Vec<AddOfferDto>;\\n\",\n \"file_path\": \"src/api/dtos/exchange_dto.rs\",\n \"rank\": 13,\n \"score\": 151718.89812448283\n },\n {\n \"content\": \"fn parse_entity_type_dto(value_dto: Value, entity_dto: &str) -> String {\\n\\n let info_dto = format!(\\\"{{\\\\\\\"{}TransactionInfoDto\\\\\\\":{{\\\\\\\"meta\\\\\\\":\\\", entity_dto);\\n\\n\\n\\n format!(\\\"{}\\\", value_dto)\\n\\n .replace(r#\\\"{\\\"meta\\\":\\\"#, &info_dto)\\n\\n .replace(\\\"}}\\\", r#\\\"}}}\\\"#)\\n\\n}\\n\\n\\n\\npub(crate) fn map_aggregate_transactions_dto(\\n\\n transactions: Vec<Value>,\\n\\n) -> Result<Vec<Box<dyn TransactionDto>>> {\\n\\n let mut txs_dto: Vec<Box<dyn TransactionDto>> = vec![];\\n\\n for item in transactions.into_iter() {\\n\\n let body: Bytes = Bytes::from(item[\\\"AggregateTransactionInfoDto\\\"].to_string());\\n\\n let map_dto = map_transaction_dto(body)?;\\n\\n txs_dto.push(serde_json::from_str(&map_dto)?);\\n\\n }\\n\\n\\n\\n Ok(txs_dto)\\n\\n}\\n\",\n \"file_path\": \"src/api/internally.rs\",\n \"rank\": 14,\n \"score\": 147215.455794352\n },\n {\n \"content\": \"fn parse_meta(value_dto: Value, entity_dto: &str) -> String {\\n\\n let meta = r#\\\"{\\\"meta\\\": {}, \\\"transaction\\\":\\\"#;\\n\\n\\n\\n let parse_meta = format!(\\\"{}\\\", value_dto).replace(r#\\\"{\\\"transaction\\\":\\\"#, meta);\\n\\n\\n\\n parse_entity_type_dto(parse_meta.parse().unwrap(), entity_dto)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/api/internally.rs\",\n \"rank\": 15,\n \"score\": 145854.8864921942\n },\n {\n \"content\": \"type ConfirmationOfferDTOs = Vec<ConfirmationOffer>;\\n\\n\\n\\n#[derive(Clone, Serialize, Deserialize)]\\n\\n#[serde(rename_all = \\\"camelCase\\\")]\\n\\npub(crate) struct OfferDTO {\\n\\n mosaic_id: Uint64Dto,\\n\\n mosaic_amount: Uint64Dto,\\n\\n cost: Uint64Dto,\\n\\n r#type: u8,\\n\\n}\\n\\n\\n\\nimpl OfferDTO {\\n\\n fn compact(&self) -> Offer {\\n\\n let asset_id = self.mosaic_id.compact();\\n\\n Offer {\\n\\n r#type: OfferType::from(self.r#type),\\n\\n mosaic: Mosaic {\\n\\n asset_id: Box::new(MosaicId::from(asset_id)),\\n\\n amount: self.mosaic_amount.compact(),\\n\\n },\\n\",\n \"file_path\": \"src/api/dtos/exchange_dto.rs\",\n \"rank\": 16,\n \"score\": 143198.67346812127\n },\n {\n \"content\": \"// Copyright 2018 ProximaX Limited. All rights reserved.\\n\\n// Use of this source code is governed by the Apache 2.0\\n\\n// license that can be found in the LICENSE file.\\n\\n\\n\\n/// SourceDto : The transaction that triggered the receipt.\\n\\n#[derive(Serialize, Deserialize)]\\n\\npub(crate) struct SourceDto {\\n\\n /// The transaction index within the block.\\n\\n primary_id: i32,\\n\\n /// The transaction index inside within the aggregate transaction. If the transaction is not an inner transaction, then the secondary id is set to 0.\\n\\n secondary_id: i32,\\n\\n}\\n\",\n \"file_path\": \"src/api/dtos/source_dto.rs\",\n \"rank\": 17,\n \"score\": 137230.05403490967\n },\n {\n \"content\": \"/*\\n\\n * Copyright 2018 ProximaX Limited. All rights reserved.\\n\\n * Use of this source code is governed by the Apache 2.0\\n\\n * license that can be found in the LICENSE file.\\n\\n */\\n\\n\\n\\nuse crate::{\\n\\n account::Address,\\n\\n transaction::{MetadataAddressTransaction, Transaction},\\n\\n};\\n\\n\\n\\nuse super::{ModifyMetadataTransactionDto, TransactionDto, TransactionMetaDto};\\n\\n\\n\\n/// AddressMetadataTransactionDto :\\n\\n///Transaction that addes metadata to account.\\n\\n#[derive(Clone, Serialize, Deserialize)]\\n\\n#[serde(rename_all = \\\"camelCase\\\")]\\n\\npub(crate) struct AddressMetadataTransactionDto {\\n\\n #[serde(flatten)]\\n\\n metadata_transaction: ModifyMetadataTransactionDto,\\n\",\n \"file_path\": \"src/api/dtos/address_dto.rs\",\n \"rank\": 18,\n \"score\": 137020.45159999118\n },\n {\n \"content\": \" #[serde(rename = \\\"metadataId\\\")]\\n\\n address: String,\\n\\n}\\n\\n\\n\\n#[derive(Serialize, Deserialize)]\\n\\n#[serde(rename_all = \\\"camelCase\\\")]\\n\\npub(crate) struct AddressMetadataTransactionInfoDto {\\n\\n meta: TransactionMetaDto,\\n\\n transaction: AddressMetadataTransactionDto,\\n\\n}\\n\\n\\n\\n#[typetag::serde]\\n\\nimpl TransactionDto for AddressMetadataTransactionInfoDto {\\n\\n fn compact(&self) -> crate::models::Result<Box<dyn Transaction>> {\\n\\n let dto = self.transaction.clone();\\n\\n\\n\\n let info = self.meta.compact()?;\\n\\n\\n\\n let metadata_transaction = dto.metadata_transaction.compact(info)?;\\n\\n\\n\\n let address = Address::from_encoded(&dto.address)?;\\n\\n\\n\\n Ok(Box::new(MetadataAddressTransaction {\\n\\n metadata_transaction,\\n\\n address,\\n\\n }))\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/api/dtos/address_dto.rs\",\n \"rank\": 19,\n \"score\": 136989.13470176628\n },\n {\n \"content\": \"pub fn alias_transaction_schema() -> Schema {\\n\\n let mut schema_definition = schema_common_definition();\\n\\n\\n\\n let mut alias_definition: Vec<Box<dyn SchemaAttribute>> = vec![\\n\\n Box::new(ScalarAttribute::new(\\\"action_type\\\", SIZEOF_BYTE)),\\n\\n Box::new(ArrayAttribute::new(\\\"namespace_id\\\", SIZEOF_INT)),\\n\\n Box::new(ArrayAttribute::new(\\\"aliasId\\\", SIZEOF_BYTE)),\\n\\n ];\\n\\n\\n\\n schema_definition.append(&mut alias_definition);\\n\\n\\n\\n Schema::new(schema_definition)\\n\\n}\\n\",\n \"file_path\": \"src/models/transaction/schema/transaction_alias.rs\",\n \"rank\": 20,\n \"score\": 118474.79208423689\n },\n {\n \"content\": \"pub fn transfer_transaction_schema() -> Schema {\\n\\n let mut schema_definition = schema_common_definition();\\n\\n\\n\\n let mut transfer_schema_definition: Vec<Box<dyn SchemaAttribute>> = vec![\\n\\n Box::new(ArrayAttribute::new(\\\"recipient\\\", SIZEOF_BYTE)),\\n\\n Box::new(ScalarAttribute::new(\\\"message_size\\\", SIZEOF_SHORT)),\\n\\n Box::new(ScalarAttribute::new(\\\"num_mosaics\\\", SIZEOF_BYTE)),\\n\\n Box::new(TableAttribute::new(\\n\\n \\\"message\\\",\\n\\n vec![\\n\\n Box::new(ScalarAttribute::new(\\\"type\\\", SIZEOF_BYTE)),\\n\\n Box::new(ArrayAttribute::new(\\\"payload\\\", SIZEOF_BYTE)),\\n\\n ],\\n\\n )),\\n\\n Box::new(TableArrayAttribute::new(\\n\\n \\\"mosaics\\\",\\n\\n vec![\\n\\n Box::new(ArrayAttribute::new(\\\"id\\\", SIZEOF_INT)),\\n\\n Box::new(ArrayAttribute::new(\\\"amount\\\", SIZEOF_INT)),\\n\\n ],\\n\\n )),\\n\\n ];\\n\\n\\n\\n schema_definition.append(&mut transfer_schema_definition);\\n\\n\\n\\n Schema::new(schema_definition)\\n\\n}\\n\",\n \"file_path\": \"src/models/transaction/schema/transaction_transafer.rs\",\n \"rank\": 21,\n \"score\": 118474.79208423689\n },\n {\n \"content\": \"pub fn aggregate_transaction_schema() -> Schema {\\n\\n let mut schema_definition = schema_common_definition();\\n\\n\\n\\n let mut aggregate: Vec<Box<dyn SchemaAttribute>> = vec![\\n\\n Box::new(ScalarAttribute::new(\\\"transactions_size\\\", SIZEOF_INT)),\\n\\n Box::new(ArrayAttribute::new(\\\"transactions\\\", SIZEOF_BYTE)),\\n\\n ];\\n\\n\\n\\n schema_definition.append(&mut aggregate);\\n\\n\\n\\n Schema::new(schema_definition)\\n\\n}\\n\",\n \"file_path\": \"src/models/transaction/schema/transaction_aggregate.rs\",\n \"rank\": 22,\n \"score\": 118474.79208423689\n },\n {\n \"content\": \"pub fn is_hex(input: &str) -> bool {\\n\\n if input == \\\"\\\" {\\n\\n return false;\\n\\n }\\n\\n\\n\\n let re = Regex::new(r\\\"^[a-fA-F0-9]+$\\\").unwrap();\\n\\n\\n\\n re.is_match(input)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/helpers/utils_hex.rs\",\n \"rank\": 23,\n \"score\": 117282.76480328871\n },\n {\n \"content\": \"pub fn exchange_offer_transaction_schema() -> Schema {\\n\\n let mut schema_definition = schema_common_definition();\\n\\n\\n\\n let mut transfer_schema_definition: Vec<Box<dyn SchemaAttribute>> = vec![\\n\\n Box::new(ScalarAttribute::new(\\\"offers_count\\\", SIZEOF_BYTE)),\\n\\n Box::new(TableArrayAttribute::new(\\n\\n \\\"offers\\\",\\n\\n vec![\\n\\n Box::new(ArrayAttribute::new(\\\"mosaic_id\\\", SIZEOF_INT)),\\n\\n Box::new(ArrayAttribute::new(\\\"mosaic_amount\\\", SIZEOF_INT)),\\n\\n Box::new(ArrayAttribute::new(\\\"cost\\\", SIZEOF_INT)),\\n\\n Box::new(ScalarAttribute::new(\\\"type\\\", SIZEOF_BYTE)),\\n\\n Box::new(ArrayAttribute::new(\\\"owner\\\", SIZEOF_BYTE)),\\n\\n ],\\n\\n )),\\n\\n ];\\n\\n\\n\\n schema_definition.append(&mut transfer_schema_definition);\\n\\n\\n\\n Schema::new(schema_definition)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/models/transaction/schema/transaction_exchange.rs\",\n \"rank\": 24,\n \"score\": 117112.2271494889\n },\n {\n \"content\": \"pub fn modify_metadata_transaction_schema() -> Schema {\\n\\n let mut schema_definition = schema_common_definition();\\n\\n\\n\\n let mut alias_definition: Vec<Box<dyn SchemaAttribute>> = vec![\\n\\n Box::new(ScalarAttribute::new(\\\"metadata_type\\\", SIZEOF_BYTE)),\\n\\n Box::new(ArrayAttribute::new(\\\"metadata_id\\\", SIZEOF_BYTE)),\\n\\n Box::new(TableArrayAttribute::new(\\n\\n \\\"modifications\\\",\\n\\n vec![\\n\\n Box::new(ScalarAttribute::new(\\\"size\\\", SIZEOF_INT)),\\n\\n Box::new(ScalarAttribute::new(\\\"modification_type\\\", SIZEOF_BYTE)),\\n\\n Box::new(ScalarAttribute::new(\\\"key_size\\\", SIZEOF_BYTE)),\\n\\n Box::new(ArrayAttribute::new(\\\"value_size\\\", SIZEOF_BYTE)),\\n\\n Box::new(ArrayAttribute::new(\\\"key\\\", SIZEOF_BYTE)),\\n\\n Box::new(ArrayAttribute::new(\\\"value\\\", SIZEOF_BYTE)),\\n\\n ],\\n\\n )),\\n\\n ];\\n\\n\\n\\n schema_definition.append(&mut alias_definition);\\n\\n\\n\\n Schema::new(schema_definition)\\n\\n}\\n\",\n \"file_path\": \"src/models/transaction/schema/transaction_metadata.rs\",\n \"rank\": 25,\n \"score\": 117112.2271494889\n },\n {\n \"content\": \"pub fn hex_encode(bytes: &[u8]) -> String {\\n\\n hex::encode(bytes)\\n\\n}\\n\",\n \"file_path\": \"src/helpers/utils_hex.rs\",\n \"rank\": 26,\n \"score\": 115826.25496219334\n },\n {\n \"content\": \"pub fn account_property_transaction_schema() -> Schema {\\n\\n let mut schema_definition = schema_common_definition();\\n\\n\\n\\n let mut transfer_schema_definition: Vec<Box<dyn SchemaAttribute>> = vec![\\n\\n Box::new(ScalarAttribute::new(\\\"property_type\\\", SIZEOF_BYTE)),\\n\\n Box::new(ScalarAttribute::new(\\\"modification_count\\\", SIZEOF_BYTE)),\\n\\n Box::new(TableArrayAttribute::new(\\n\\n \\\"modifications\\\",\\n\\n vec![\\n\\n Box::new(ScalarAttribute::new(\\\"modificationType\\\", SIZEOF_BYTE)),\\n\\n Box::new(ArrayAttribute::new(\\\"value\\\", SIZEOF_BYTE)),\\n\\n ],\\n\\n )),\\n\\n ];\\n\\n\\n\\n schema_definition.append(&mut transfer_schema_definition);\\n\\n\\n\\n Schema::new(schema_definition)\\n\\n}\\n\",\n \"file_path\": \"src/models/transaction/schema/transaction_account_property.rs\",\n \"rank\": 27,\n \"score\": 115793.26220666015\n },\n {\n \"content\": \"pub fn mosaic_definition_transaction_schema() -> Schema {\\n\\n let mut schema_definition = schema_common_definition();\\n\\n\\n\\n let mut transfer_schema_definition: Vec<Box<dyn SchemaAttribute>> = vec![\\n\\n Box::new(ScalarAttribute::new(\\\"mosaic_nonce\\\", SIZEOF_INT)),\\n\\n Box::new(ArrayAttribute::new(\\\"mosaic_id\\\", SIZEOF_INT)),\\n\\n Box::new(ScalarAttribute::new(\\\"num_optional_properties\\\", SIZEOF_BYTE)),\\n\\n Box::new(ScalarAttribute::new(\\\"flags\\\", SIZEOF_BYTE)),\\n\\n Box::new(ScalarAttribute::new(\\\"divisibility\\\", SIZEOF_BYTE)),\\n\\n Box::new(TableArrayAttribute::new(\\n\\n \\\"modifications\\\",\\n\\n vec![\\n\\n Box::new(ScalarAttribute::new(\\\"mosaic_property_id\\\", SIZEOF_BYTE)),\\n\\n Box::new(ArrayAttribute::new(\\\"value\\\", SIZEOF_INT)),\\n\\n ],\\n\\n )),\\n\\n ];\\n\\n\\n\\n schema_definition.append(&mut transfer_schema_definition);\\n\\n\\n\\n Schema::new(schema_definition)\\n\\n}\\n\",\n \"file_path\": \"src/models/transaction/schema/transaction_mosaic_definition.rs\",\n \"rank\": 28,\n \"score\": 115793.26220666015\n },\n {\n \"content\": \"pub fn lock_funds_transaction_schema() -> Schema {\\n\\n let mut schema_definition = schema_common_definition();\\n\\n\\n\\n let mut lock_funds_transaction_definition: Vec<Box<dyn SchemaAttribute>> = vec![\\n\\n Box::new(ArrayAttribute::new(\\\"mosaic_id\\\", SIZEOF_INT)),\\n\\n Box::new(ArrayAttribute::new(\\\"mosaic_amount\\\", SIZEOF_INT)),\\n\\n Box::new(ArrayAttribute::new(\\\"duration\\\", SIZEOF_INT)),\\n\\n Box::new(ArrayAttribute::new(\\\"hash\\\", SIZEOF_BYTE)),\\n\\n ];\\n\\n\\n\\n schema_definition.append(&mut lock_funds_transaction_definition);\\n\\n\\n\\n Schema::new(schema_definition)\\n\\n}\\n\",\n \"file_path\": \"src/models/transaction/schema/transaction_hash_lock.rs\",\n \"rank\": 29,\n \"score\": 115793.26220666015\n },\n {\n \"content\": \"pub fn add_exchange_offer_transaction_schema() -> Schema {\\n\\n let mut schema_definition = schema_common_definition();\\n\\n\\n\\n let mut transfer_schema_definition: Vec<Box<dyn SchemaAttribute>> = vec![\\n\\n Box::new(ScalarAttribute::new(\\\"offers_count\\\", SIZEOF_BYTE)),\\n\\n Box::new(TableArrayAttribute::new(\\n\\n \\\"offers\\\",\\n\\n vec![\\n\\n Box::new(ArrayAttribute::new(\\\"mosaic_id\\\", SIZEOF_INT)),\\n\\n Box::new(ArrayAttribute::new(\\\"mosaic_amount\\\", SIZEOF_INT)),\\n\\n Box::new(ArrayAttribute::new(\\\"cost\\\", SIZEOF_INT)),\\n\\n Box::new(ScalarAttribute::new(\\\"type\\\", SIZEOF_BYTE)),\\n\\n Box::new(ArrayAttribute::new(\\\"duration\\\", SIZEOF_INT)),\\n\\n ],\\n\\n )),\\n\\n ];\\n\\n\\n\\n schema_definition.append(&mut transfer_schema_definition);\\n\\n\\n\\n Schema::new(schema_definition)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/models/transaction/schema/transaction_exchange.rs\",\n \"rank\": 30,\n \"score\": 115793.26220666015\n },\n {\n \"content\": \"pub fn remove_exchange_offer_transaction_schema() -> Schema {\\n\\n let mut schema_definition = schema_common_definition();\\n\\n\\n\\n let mut transfer_schema_definition: Vec<Box<dyn SchemaAttribute>> = vec![\\n\\n Box::new(ScalarAttribute::new(\\\"offers_count\\\", SIZEOF_BYTE)),\\n\\n Box::new(TableArrayAttribute::new(\\n\\n \\\"offers\\\",\\n\\n vec![\\n\\n Box::new(ArrayAttribute::new(\\\"mosaic_id\\\", SIZEOF_INT)),\\n\\n Box::new(ScalarAttribute::new(\\\"type\\\", SIZEOF_BYTE)),\\n\\n ],\\n\\n )),\\n\\n ];\\n\\n\\n\\n schema_definition.append(&mut transfer_schema_definition);\\n\\n\\n\\n Schema::new(schema_definition)\\n\\n}\\n\",\n \"file_path\": \"src/models/transaction/schema/transaction_exchange.rs\",\n \"rank\": 31,\n \"score\": 115793.26220666015\n },\n {\n \"content\": \"pub fn register_namespace_transaction_schema() -> Schema {\\n\\n let mut schema_definition = schema_common_definition();\\n\\n\\n\\n let mut register_namespace_definition: Vec<Box<dyn SchemaAttribute>> = vec![\\n\\n Box::new(ScalarAttribute::new(\\\"namespace_type\\\", SIZEOF_BYTE)),\\n\\n Box::new(ArrayAttribute::new(\\\"duration_parent_id\\\", SIZEOF_INT)),\\n\\n Box::new(ArrayAttribute::new(\\\"namespace_id\\\", SIZEOF_INT)),\\n\\n Box::new(ScalarAttribute::new(\\\"namespace_name_size\\\", SIZEOF_BYTE)),\\n\\n Box::new(ArrayAttribute::new(\\\"name\\\", SIZEOF_BYTE)),\\n\\n ];\\n\\n\\n\\n schema_definition.append(&mut register_namespace_definition);\\n\\n\\n\\n Schema::new(schema_definition)\\n\\n}\\n\",\n \"file_path\": \"src/models/transaction/schema/transaction_register_namespace.rs\",\n \"rank\": 32,\n \"score\": 115793.26220666015\n },\n {\n \"content\": \"pub fn array_u8_to_u64(bytes: &[u8]) -> u64 {\\n\\n (bytes[0] as u64)\\n\\n | (bytes[1] as u64) << 8\\n\\n | (bytes[2] as u64) << 16\\n\\n | (bytes[3] as u64) << 24\\n\\n | (bytes[4] as u64) << 32\\n\\n | (bytes[5] as u64) << 40\\n\\n | (bytes[6] as u64) << 48\\n\\n | (bytes[7] as u64) << 56\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/helpers/utils_bytes.rs\",\n \"rank\": 33,\n \"score\": 114417.89182707938\n },\n {\n \"content\": \"pub fn modify_multisig_account_transaction_schema() -> Schema {\\n\\n let mut schema_definition = schema_common_definition();\\n\\n\\n\\n let mut modify_multisig_account_transaction: Vec<Box<dyn SchemaAttribute>> = vec![\\n\\n Box::new(ScalarAttribute::new(\\\"min_removal_delta\\\", SIZEOF_BYTE)),\\n\\n Box::new(ScalarAttribute::new(\\\"min_approval_delta\\\", SIZEOF_BYTE)),\\n\\n Box::new(ScalarAttribute::new(\\\"num_modifications\\\", SIZEOF_BYTE)),\\n\\n Box::new(TableArrayAttribute::new(\\n\\n \\\"modification\\\",\\n\\n vec![\\n\\n Box::new(ScalarAttribute::new(\\\"type\\\", SIZEOF_BYTE)),\\n\\n Box::new(ArrayAttribute::new(\\\"cosignatory_publicKey\\\", SIZEOF_BYTE)),\\n\\n ],\\n\\n )),\\n\\n ];\\n\\n\\n\\n schema_definition.append(&mut modify_multisig_account_transaction);\\n\\n\\n\\n Schema::new(schema_definition)\\n\\n}\\n\",\n \"file_path\": \"src/models/transaction/schema/transaction_modify_multisig_account.rs\",\n \"rank\": 34,\n \"score\": 113278.02104639719\n },\n {\n \"content\": \"pub fn mosaic_supply_change_transaction_schema() -> Schema {\\n\\n let mut schema_definition = schema_common_definition();\\n\\n\\n\\n let mut mosaic_supply_change_definition: Vec<Box<dyn SchemaAttribute>> = vec![\\n\\n Box::new(ArrayAttribute::new(\\\"mosaic_id\\\", SIZEOF_INT)),\\n\\n Box::new(ScalarAttribute::new(\\\"direction\\\", SIZEOF_BYTE)),\\n\\n Box::new(ArrayAttribute::new(\\\"delta\\\", SIZEOF_INT)),\\n\\n ];\\n\\n\\n\\n schema_definition.append(&mut mosaic_supply_change_definition);\\n\\n\\n\\n Schema::new(schema_definition)\\n\\n}\\n\",\n \"file_path\": \"src/models/transaction/schema/transaction_mosaic_supply_change.rs\",\n \"rank\": 35,\n \"score\": 113278.02104639719\n },\n {\n \"content\": \"pub fn has_bits(number: u64, bits: u64) -> bool {\\n\\n (number & bits) == bits\\n\\n}\\n\",\n \"file_path\": \"src/helpers/utils_bytes.rs\",\n \"rank\": 36,\n \"score\": 111210.90084167274\n },\n {\n \"content\": \"#[inline]\\n\\npub fn u32_to_array_u8(value: u32) -> [u8; SIZE_U32] {\\n\\n let mut buf = [0u8; SIZE_U32];\\n\\n buf.as_mut()\\n\\n .write_u32::<LittleEndian>(value)\\n\\n .expect(\\\"Unable to write\\\");\\n\\n buf\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/helpers/utils_bytes.rs\",\n \"rank\": 37,\n \"score\": 110044.24290340747\n },\n {\n \"content\": \"pub fn array_u8_to_u32(bytes: [u8; SIZE_U32]) -> u32 {\\n\\n (bytes[0] as u32) | (bytes[1] as u32) << 8 | (bytes[2] as u32) << 16 | (bytes[3] as u32) << 24\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/helpers/utils_bytes.rs\",\n \"rank\": 38,\n \"score\": 110044.24290340747\n },\n {\n \"content\": \"#[inline]\\n\\npub fn u64_to_array_u8(value: u64) -> [u8; SIZE_U64] {\\n\\n let mut buf = [0u8; SIZE_U64];\\n\\n buf.as_mut()\\n\\n .write_u64::<LittleEndian>(value)\\n\\n .expect(\\\"Unable to write\\\");\\n\\n buf\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/helpers/utils_bytes.rs\",\n \"rank\": 39,\n \"score\": 110044.24290340747\n },\n {\n \"content\": \"type NamespaceIdDto = Option<Uint64Dto>;\\n\\n\\n\\n#[derive(Serialize, Deserialize)]\\n\\n#[serde(rename_all = \\\"camelCase\\\")]\\n\\npub(crate) struct NamespaceDto {\\n\\n /// The public key of the owner of the namespace.\\n\\n owner: String,\\n\\n /// The address of the owner of the namespace in hexadecimal.\\n\\n owner_address: String,\\n\\n start_height: Uint64Dto,\\n\\n end_height: Uint64Dto,\\n\\n #[serde(rename = \\\"depth\\\")]\\n\\n depth: u8,\\n\\n #[serde(skip_serializing_if = \\\"Option::is_none\\\")]\\n\\n level0: NamespaceIdDto,\\n\\n #[serde(skip_serializing_if = \\\"Option::is_none\\\")]\\n\\n level1: NamespaceIdDto,\\n\\n #[serde(skip_serializing_if = \\\"Option::is_none\\\")]\\n\\n level2: NamespaceIdDto,\\n\\n #[serde(rename = \\\"type\\\")]\\n\",\n \"file_path\": \"src/api/dtos/namespace_dto.rs\",\n \"rank\": 40,\n \"score\": 96302.97046793539\n },\n {\n \"content\": \"/*\\n\\n * Copyright 2018 ProximaX Limited. All rights reserved.\\n\\n * Use of this source code is governed by the Apache 2.0\\n\\n * license that can be found in the LICENSE file.\\n\\n */\\n\\n\\n\\nuse {\\n\\n ::std::{collections::HashMap, sync::Arc},\\n\\n reqwest::{\\n\\n header::{HeaderMap, CONTENT_LENGTH, CONTENT_TYPE, USER_AGENT},\\n\\n Method, StatusCode, Url,\\n\\n },\\n\\n serde_json,\\n\\n};\\n\\n\\n\\nuse crate::models::error::{Error, SiriusError};\\n\\n\\n\\nuse super::{\\n\\n internally::{map_transaction_dto, map_transaction_dto_vec},\\n\\n sirius_client::ApiClient,\\n\",\n \"file_path\": \"src/api/request.rs\",\n \"rank\": 41,\n \"score\": 94881.66936092699\n },\n {\n \"content\": \" let param = param.replace('\\\"', \\\"\\\");\\n\\n self.path_params.insert(basename, param);\\n\\n self\\n\\n }\\n\\n\\n\\n pub fn set_transaction(mut self) -> Self {\\n\\n self.is_transaction = true;\\n\\n self\\n\\n }\\n\\n\\n\\n pub fn set_transaction_vec(mut self) -> Self {\\n\\n self.is_transaction_vec = true;\\n\\n self\\n\\n }\\n\\n\\n\\n pub async fn execute<U>(self, api: Arc<ApiClient>) -> crate::models::Result<U>\\n\\n where\\n\\n for<'de> U: serde::Deserialize<'de>,\\n\\n {\\n\\n // raw_headers is for headers we don't know the proper type of (e.g. custom api key\\n\",\n \"file_path\": \"src/api/request.rs\",\n \"rank\": 42,\n \"score\": 94855.37194627292\n },\n {\n \"content\": \"};\\n\\n\\n\\n#[derive(Clone)]\\n\\npub(crate) struct Request {\\n\\n method: Method,\\n\\n path: String,\\n\\n query_params: HashMap<String, String>,\\n\\n path_params: HashMap<String, String>,\\n\\n header_params: HashMap<String, String>,\\n\\n // TODO: multiple body params are possible technically, but not supported here.\\n\\n serialized_body: Option<String>,\\n\\n is_transaction: bool,\\n\\n is_transaction_vec: bool,\\n\\n}\\n\\n\\n\\nimpl Request {\\n\\n pub fn new(method: reqwest::Method, path: String) -> Self {\\n\\n Request {\\n\\n method,\\n\\n path,\\n\",\n \"file_path\": \"src/api/request.rs\",\n \"rank\": 43,\n \"score\": 94850.91978018929\n },\n {\n \"content\": \" // set new pairs\\n\\n url.query_pairs_mut()\\n\\n .clear()\\n\\n .extend_pairs(pairs.iter().map(|&(k, v)| (&k[..], &v[..])));\\n\\n };\\n\\n\\n\\n // create request\\n\\n let builder = api.client.request(self.method, url.as_str()).body(\\n\\n self.serialized_body\\n\\n .clone()\\n\\n .unwrap_or_else(|| \\\"\\\".to_owned()),\\n\\n );\\n\\n\\n\\n let mut req = builder.build()?;\\n\\n\\n\\n if let Some(body) = self.serialized_body {\\n\\n req.headers_mut().insert(\\n\\n CONTENT_TYPE,\\n\\n \\\"application/json\\\"\\n\\n .parse()\\n\",\n \"file_path\": \"src/api/request.rs\",\n \"rank\": 44,\n \"score\": 94846.37502476864\n },\n {\n \"content\": \" let status = resp.status();\\n\\n\\n\\n let body = resp.bytes().await?;\\n\\n\\n\\n match status {\\n\\n StatusCode::OK | StatusCode::ACCEPTED => {\\n\\n if self.is_transaction {\\n\\n let map_dto = map_transaction_dto(body)?;\\n\\n let res: U = serde_json::from_str(&map_dto)?;\\n\\n Ok(res)\\n\\n } else if self.is_transaction_vec {\\n\\n let map_dto_vec = map_transaction_dto_vec(body)?;\\n\\n let res: U = serde_json::from_str(&map_dto_vec)?;\\n\\n Ok(res)\\n\\n } else {\\n\\n let res: U = serde_json::from_slice(&body)?;\\n\\n Ok(res)\\n\\n }\\n\\n }\\n\\n _ => {\\n\\n let err: SiriusError = serde_json::from_slice(&body)?;\\n\\n Err(Error::from(err))\\n\\n }\\n\\n }\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/api/request.rs\",\n \"rank\": 45,\n \"score\": 94846.02504587766\n },\n {\n \"content\": \" .map_err(|err| Error::from(format_err!(\\\"{}\\\", err)))?,\\n\\n );\\n\\n\\n\\n req.headers_mut().insert(CONTENT_LENGTH, body.len().into());\\n\\n }\\n\\n\\n\\n let req_headers = req.headers_mut();\\n\\n if let Some(ref user_agent) = api.user_agent {\\n\\n req_headers.insert(\\n\\n USER_AGENT,\\n\\n user_agent\\n\\n .parse()\\n\\n .map_err(|err| Error::from(format_err!(\\\"{}\\\", err)))?,\\n\\n );\\n\\n }\\n\\n\\n\\n req_headers.extend(headers);\\n\\n\\n\\n let resp = api.client.execute(req).await?;\\n\\n\\n\",\n \"file_path\": \"src/api/request.rs\",\n \"rank\": 46,\n \"score\": 94842.70913481578\n },\n {\n \"content\": \" query_params: HashMap::new(),\\n\\n path_params: HashMap::new(),\\n\\n header_params: HashMap::new(),\\n\\n serialized_body: None,\\n\\n is_transaction: false,\\n\\n is_transaction_vec: false,\\n\\n }\\n\\n }\\n\\n\\n\\n pub fn with_body_param<T: serde::Serialize>(mut self, param: T) -> Self {\\n\\n self.serialized_body = Some(serde_json::to_string(¶m).unwrap());\\n\\n self\\n\\n }\\n\\n\\n\\n pub fn with_query_param(mut self, basename: String, param: String) -> Self {\\n\\n self.query_params.insert(basename, param);\\n\\n self\\n\\n }\\n\\n\\n\\n pub fn with_path_param(mut self, basename: String, param: String) -> Self {\\n\",\n \"file_path\": \"src/api/request.rs\",\n \"rank\": 47,\n \"score\": 94841.34168692291\n },\n {\n \"content\": \"\\n\\n if !self.query_params.is_empty() {\\n\\n let existing: Vec<(String, String)> = url\\n\\n .query_pairs()\\n\\n .map(|(a, b)| (a.to_string(), b.to_string()))\\n\\n .collect();\\n\\n\\n\\n // final pairs\\n\\n let mut pairs: Vec<(&str, &str)> = Vec::new();\\n\\n\\n\\n // add first existing\\n\\n for pair in &existing {\\n\\n pairs.push((&pair.0, &pair.1));\\n\\n }\\n\\n\\n\\n // add given query to the pairs\\n\\n for (key, val) in self.query_params.iter() {\\n\\n pairs.push((key, val));\\n\\n }\\n\\n\\n\",\n \"file_path\": \"src/api/request.rs\",\n \"rank\": 48,\n \"score\": 94832.29075500843\n },\n {\n \"content\": \" // headers); headers is for ones we do know the type of.\\n\\n let mut raw_headers = HashMap::new();\\n\\n let headers: HeaderMap = HeaderMap::new();\\n\\n\\n\\n let mut path = self.path;\\n\\n\\n\\n self.path_params.into_iter().for_each(|(key, val)| {\\n\\n // replace {id} with the value of the id path param\\n\\n path = path.replace(&format!(\\\"{{{}}}\\\", key), &val);\\n\\n });\\n\\n\\n\\n self.header_params.into_iter().for_each(|(key, val)| {\\n\\n raw_headers.insert(key, val);\\n\\n });\\n\\n\\n\\n let uri_str = format!(\\\"{}{}\\\", api.base_path, path);\\n\\n\\n\\n let mut url = Url::parse(&uri_str)\\n\\n .map_err(|e| format!(\\\"could not parse url: {:?}\\\", e))\\n\\n .unwrap();\\n\",\n \"file_path\": \"src/api/request.rs\",\n \"rank\": 49,\n \"score\": 94831.70934380362\n },\n {\n \"content\": \"/*\\n\\n * Copyright 2018 ProximaX Limited. All rights reserved.\\n\\n * Use of this source code is governed by the Apache 2.0\\n\\n * license that can be found in the LICENSE file.\\n\\n */\\n\\n\\n\\nuse crate::{\\n\\n account::{Address, PublicAccount},\\n\\n api::cosignatory_dto_vec_to_struct,\\n\\n models::Result,\\n\\n multisig::MultisigAccountInfo,\\n\\n network::NetworkType,\\n\\n transaction::{ModifyMultisigAccountTransaction, Transaction},\\n\\n};\\n\\n\\n\\nuse super::{\\n\\n AbstractTransactionDto, CosignatoryModificationDto, TransactionDto, TransactionMetaDto,\\n\\n};\\n\\n\\n\\n#[derive(Clone, Serialize, Deserialize)]\\n\",\n \"file_path\": \"src/api/dtos/multisig_dto.rs\",\n \"rank\": 50,\n \"score\": 90552.94469699076\n },\n {\n \"content\": \"/*\\n\\n * Copyright 2018 ProximaX Limited. All rights reserved.\\n\\n * Use of this source code is governed by the Apache 2.0\\n\\n * license that can be found in the LICENSE file.\\n\\n */\\n\\n\\n\\nuse crate::blockchain::{BlockchainScore, HeightInfo};\\n\\n\\n\\nuse super::{AbstractTransactionDto, Uint64Dto, UpgradeDto};\\n\\n\\n\\n#[derive(Serialize, Deserialize)]\\n\\npub(crate) struct HeightInfoDto {\\n\\n #[serde(rename = \\\"height\\\")]\\n\\n height: Uint64Dto,\\n\\n}\\n\\n\\n\\nimpl HeightInfoDto {\\n\\n pub fn compact(&self) -> HeightInfo {\\n\\n HeightInfo {\\n\\n height: self.height.compact(),\\n\",\n \"file_path\": \"src/api/dtos/blockchain_dto.rs\",\n \"rank\": 51,\n \"score\": 90545.51347423355\n },\n {\n \"content\": \"/*\\n\\n * Copyright 2018 ProximaX Limited. All rights reserved.\\n\\n * Use of this source code is governed by the Apache 2.0\\n\\n * license that can be found in the LICENSE file.\\n\\n */\\n\\n\\n\\nuse downcast_rs::__std::collections::HashMap;\\n\\n\\n\\nuse crate::{\\n\\n api::metadata_dto_vec_to_struct,\\n\\n models::{\\n\\n account::Address,\\n\\n metadata::{\\n\\n AddressMetadataInfo, MetadataInfo, MetadataModification, MetadataModificationType,\\n\\n MetadataType, MosaicMetadataInfo, NamespaceMetadataInfo,\\n\\n },\\n\\n mosaic::MosaicId,\\n\\n namespace::NamespaceId,\\n\\n transaction::{ModifyMetadataTransaction, TransactionInfo},\\n\\n },\\n\",\n \"file_path\": \"src/api/dtos/metadata_dto.rs\",\n \"rank\": 52,\n \"score\": 90545.27607064642\n },\n {\n \"content\": \"/*\\n\\n * Copyright 2018 ProximaX Limited. All rights reserved.\\n\\n * Use of this source code is governed by the Apache 2.0\\n\\n * license that can be found in the LICENSE file.\\n\\n */\\n\\n\\n\\nuse super::{ResolutionStatementDto, SourceDto};\\n\\n\\n\\n/// StatementsDto : The collection of transaction statements and resolutions triggered for the block requested.\\n\\n#[derive(Serialize, Deserialize)]\\n\\npub(crate) struct StatementsDto {\\n\\n /// The array of transaction statements for the block requested.\\n\\n transaction_statements: Vec<TransactionStatementDto>,\\n\\n /// The array of address resolutions for the block requested.\\n\\n address_resolution_statements: Vec<ResolutionStatementDto>,\\n\\n /// The array of mosaic resolutions for the block requested.\\n\\n mosaic_resolution_statements: Vec<ResolutionStatementDto>,\\n\\n}\\n\\n\\n\\n/// TransactionStatementDto : The collection of receipts related to a transaction.\\n\\n#[derive(Serialize, Deserialize)]\\n\\npub(crate) struct TransactionStatementDto {\\n\\n height: Vec<i32>,\\n\\n source: SourceDto,\\n\\n /// The array of receipts.\\n\\n receipts: Vec<String>,\\n\\n}\\n\",\n \"file_path\": \"src/api/dtos/statements_dto.rs\",\n \"rank\": 53,\n \"score\": 90544.98150662113\n },\n {\n \"content\": \"/*\\n\\n * Copyright 2018 ProximaX Limited. All rights reserved.\\n\\n * Use of this source code is governed by the Apache 2.0\\n\\n * license that can be found in the LICENSE file.\\n\\n */\\n\\n\\n\\nuse serde_json::Value;\\n\\n\\n\\nuse crate::Uint64;\\n\\n\\n\\n#[derive(Debug, Clone, Deserialize, Serialize)] // we derive Default in order to use the clear() method in Drop\\n\\npub(crate) struct Uint64Dto(pub(crate) [u32; 2]);\\n\\n\\n\\nimpl Uint64Dto {\\n\\n pub fn compact(&self) -> Uint64 {\\n\\n Uint64::from((self.0[0], self.0[1]))\\n\\n }\\n\\n\\n\\n pub fn from_value(value: Value) -> Self {\\n\\n Self(serde_json::from_value(value).unwrap())\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/api/dtos/uint_64_dto.rs\",\n \"rank\": 54,\n \"score\": 90544.48613821573\n },\n {\n \"content\": \"/*\\n\\n * Copyright 2018 ProximaX Limited. All rights reserved.\\n\\n * Use of this source code is governed by the Apache 2.0\\n\\n * license that can be found in the LICENSE file.\\n\\n */\\n\\n\\n\\nuse crate::{\\n\\n helpers::hex_decode,\\n\\n message::{Message, PlainMessage},\\n\\n};\\n\\n\\n\\n#[derive(Clone, Serialize, Deserialize)]\\n\\npub(crate) struct MessageDto {\\n\\n #[serde(rename = \\\"type\\\")]\\n\\n _type: u8,\\n\\n #[serde(rename = \\\"payload\\\")]\\n\\n payload: String,\\n\\n}\\n\\n\\n\\nimpl MessageDto {\\n\",\n \"file_path\": \"src/api/dtos/message_dto.rs\",\n \"rank\": 55,\n \"score\": 90541.00480169109\n },\n {\n \"content\": \"/*\\n\\n * Copyright 2018 ProximaX Limited. All rights reserved.\\n\\n * Use of this source code is governed by the Apache 2.0\\n\\n * license that can be found in the LICENSE file.\\n\\n */\\n\\n\\n\\nuse crate::{node::NodeTime, Uint64};\\n\\n\\n\\nuse super::Uint64Dto;\\n\\n\\n\\n#[derive(Serialize, Deserialize)]\\n\\npub(crate) struct NodeTimeDto {\\n\\n #[serde(rename = \\\"communicationTimestamps\\\")]\\n\\n communication_timestamps: CommunicationTimestampsDto,\\n\\n}\\n\\n\\n\\n#[derive(Serialize, Deserialize)]\\n\",\n \"file_path\": \"src/api/dtos/node_dto.rs\",\n \"rank\": 56,\n \"score\": 90537.9933110632\n },\n {\n \"content\": \"/*\\n\\n * Copyright 2018 ProximaX Limited. All rights reserved.\\n\\n * Use of this source code is governed by the Apache 2.0\\n\\n * license that can be found in the LICENSE file.\\n\\n */\\n\\n\\n\\nuse crate::{\\n\\n account::Address,\\n\\n alias::AliasActionType,\\n\\n models::Result,\\n\\n mosaic::MosaicId,\\n\\n namespace::{NamespaceAlias, NamespaceId},\\n\\n transaction::{AddressAliasTransaction, AliasTransaction, MosaicAliasTransaction, Transaction},\\n\\n};\\n\\n\\n\\nuse super::{AbstractTransactionDto, TransactionDto, TransactionMetaDto, Uint64Dto};\\n\\n\\n\\n#[derive(Serialize, Deserialize)]\\n\\n#[serde(rename_all = \\\"camelCase\\\")]\\n\\npub(crate) struct AliasDto {\\n\",\n \"file_path\": \"src/api/dtos/alias_dto.rs\",\n \"rank\": 57,\n \"score\": 90537.99263470396\n },\n {\n \"content\": \"// Copyright 2018 ProximaX Limited. All rights reserved.\\n\\n// Use of this source code is governed by the Apache 2.0\\n\\n// license that can be found in the LICENSE file.\\n\\n\\n\\n#[derive(Serialize, Deserialize)]\\n\\npub(crate) struct ServerDto {\\n\\n server_info: ServerInfoDto,\\n\\n}\\n\\n\\n\\n#[derive(Serialize, Deserialize)]\\n\\npub(crate) struct ServerInfoDto {\\n\\n /// The catapult-rest component version.\\n\\n rest_version: String,\\n\\n /// The catapult-sdk component version.\\n\\n sdk_version: String,\\n\\n}\\n\",\n \"file_path\": \"src/api/dtos/server_dto.rs\",\n \"rank\": 58,\n \"score\": 90537.79635265878\n },\n {\n \"content\": \"// Copyright 2018 ProximaX Limited. All rights reserved.\\n\\n// Use of this source code is governed by the Apache 2.0\\n\\n// license that can be found in the LICENSE file.\\n\\n\\n\\n#[derive(Serialize, Deserialize)]\\n\\npub(crate) struct UpgradeDto {\\n\\n #[serde(rename = \\\"height\\\")]\\n\\n height: Vec<i32>,\\n\\n #[serde(rename = \\\"blockChainVersion\\\")]\\n\\n block_chain_version: Vec<i32>,\\n\\n}\\n\",\n \"file_path\": \"src/api/dtos/upgrade_dto.rs\",\n \"rank\": 59,\n \"score\": 90536.96987155586\n },\n {\n \"content\": \"/*\\n\\n * Copyright 2018 ProximaX Limited. All rights reserved.\\n\\n * Use of this source code is governed by the Apache 2.0\\n\\n * license that can be found in the LICENSE file.\\n\\n */\\n\\n\\n\\nuse super::{SourceDto, Uint64Dto};\\n\\n\\n\\n#[derive(Serialize, Deserialize)]\\n\\npub(crate) struct ResolutionEntryDto {\\n\\n #[serde(rename = \\\"source\\\")]\\n\\n source: SourceDto,\\n\\n #[serde(rename = \\\"resolved\\\")]\\n\\n resolved: Uint64Dto,\\n\\n}\\n\\n\\n\\n/// ResolutionStatementDto : A resolution statement keeps the relation between a namespace alias used in a transaction and the real address or mosaic_id.\\n\\n#[derive(Serialize, Deserialize)]\\n\\npub(crate) struct ResolutionStatementDto {\\n\\n height: Uint64Dto,\\n\\n unresolved: Uint64Dto,\\n\\n /// The array of resolution entries linked to the unresolved namespace_id. It is an array instead of a single UInt64 field since within one block the resolution might change for different sources due to alias related transactions.\\n\\n resolution_entries: Vec<ResolutionEntryDto>,\\n\\n}\\n\",\n \"file_path\": \"src/api/dtos/resolution_dto.rs\",\n \"rank\": 60,\n \"score\": 90536.6910752302\n },\n {\n \"content\": \"// Copyright 2018 ProximaX Limited. All rights reserved.\\n\\n// Use of this source code is governed by the Apache 2.0\\n\\n// license that can be found in the LICENSE file.\\n\\n\\n\\n#[derive(Serialize, Deserialize)]\\n\\npub(crate) struct FieldDto {\\n\\n #[serde(rename = \\\"key\\\")]\\n\\n pub key: String,\\n\\n #[serde(rename = \\\"value\\\")]\\n\\n pub value: String,\\n\\n}\\n\",\n \"file_path\": \"src/api/dtos/field_dto.rs\",\n \"rank\": 61,\n \"score\": 90534.38022172819\n },\n {\n \"content\": \"/*\\n\\n * Copyright 2018 ProximaX Limited. All rights reserved.\\n\\n * Use of this source code is governed by the Apache 2.0\\n\\n * license that can be found in the LICENSE file.\\n\\n */\\n\\n\\n\\nuse crate::{\\n\\n api::mosaic_properties,\\n\\n models::{\\n\\n errors_const,\\n\\n mosaic::{Mosaic, MosaicId, MosaicInfo, MosaicNames, MosaicNonce, MosaicSupplyType},\\n\\n transaction::{\\n\\n MetadataMosaicTransaction, MosaicDefinitionTransaction, MosaicSupplyChangeTransaction,\\n\\n Transaction,\\n\\n },\\n\\n Result,\\n\\n },\\n\\n};\\n\\n\\n\\nuse super::{\\n\",\n \"file_path\": \"src/api/dtos/mosaic_dto.rs\",\n \"rank\": 62,\n \"score\": 90534.36389028298\n },\n {\n \"content\": \"/*\\n\\n * Copyright 2018 ProximaX Limited. All rights reserved.\\n\\n * Use of this source code is governed by the Apache 2.0\\n\\n * license that can be found in the LICENSE file.\\n\\n */\\n\\n\\n\\nuse crate::{\\n\\n account::PublicAccount,\\n\\n multisig::{CosignatoryModification, Cosignature, MultisigModificationType},\\n\\n network::NetworkType,\\n\\n};\\n\\n\\n\\n#[derive(Clone, Serialize, Deserialize)]\\n\\n#[serde(rename_all = \\\"camelCase\\\")]\\n\\npub(crate) struct CosignatoryModificationDto {\\n\\n #[serde(rename = \\\"type\\\")]\\n\\n modification_type: u8,\\n\\n cosignatory_public_key: String,\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/api/dtos/cosignature_dto.rs\",\n \"rank\": 63,\n \"score\": 90534.01716954978\n },\n {\n \"content\": \"/*\\n\\n * Copyright 2018 ProximaX Limited. All rights reserved.\\n\\n * Use of this source code is governed by the Apache 2.0\\n\\n * license that can be found in the LICENSE file.\\n\\n */\\n\\n\\n\\nuse ::std::str::FromStr;\\n\\n\\n\\nuse crate::{\\n\\n account::{PublicAccount, EMPTY_PUBLIC_KEY},\\n\\n blockchain::BlockInfo,\\n\\n network::extract_network_type,\\n\\n transaction::{internal::extract_version, BlockchainTimestamp, HashValue},\\n\\n Result,\\n\\n};\\n\\n\\n\\nuse super::Uint64Dto;\\n\\n\\n\\n#[derive(Serialize, Deserialize)]\\n\\n#[serde(rename_all = \\\"camelCase\\\")]\\n\",\n \"file_path\": \"src/api/dtos/block_dto.rs\",\n \"rank\": 64,\n \"score\": 90533.7894971473\n },\n {\n \"content\": \"/*\\n\\n * Copyright 2018 ProximaX Limited. All rights reserved.\\n\\n * Use of this source code is governed by the Apache 2.0\\n\\n * license that can be found in the LICENSE file.\\n\\n */\\n\\n\\n\\nuse crate::{\\n\\n account::PublicAccount,\\n\\n errors_const,\\n\\n models::Result,\\n\\n namespace::{NamespaceId, NamespaceInfo, NamespaceName, NamespaceType},\\n\\n network::NetworkType,\\n\\n transaction::{MetadataNamespaceTransaction, RegisterNamespaceTransaction, Transaction},\\n\\n AssetId,\\n\\n};\\n\\n\\n\\nuse super::{\\n\\n AbstractTransactionDto, AliasDto, ModifyMetadataTransactionDto, TransactionDto,\\n\\n TransactionMetaDto, Uint64Dto,\\n\\n};\\n\\n\\n\",\n \"file_path\": \"src/api/dtos/namespace_dto.rs\",\n \"rank\": 65,\n \"score\": 90533.32466941379\n },\n {\n \"content\": \"/*\\n\\n * Copyright 2018 ProximaX Limited. All rights reserved.\\n\\n * Use of this source code is governed by the Apache 2.0\\n\\n * license that can be found in the LICENSE file.\\n\\n */\\n\\n\\n\\nuse ::std::str::FromStr;\\n\\n\\n\\nuse crate::models::transaction::Signature;\\n\\nuse crate::{\\n\\n account::{Address, PublicAccount},\\n\\n models::Result,\\n\\n mosaic::{Mosaic, MosaicId},\\n\\n network::extract_network_type,\\n\\n transaction::{\\n\\n internal::extract_version, AbstractTransaction, BlockchainTimestamp, Deadline, HashValue,\\n\\n LockFundsTransaction, SignedTransaction, Transaction, TransactionInfo, TransactionStatus,\\n\\n TransactionType, TransferTransaction,\\n\\n },\\n\\n};\\n\",\n \"file_path\": \"src/api/dtos/transaction_dto.rs\",\n \"rank\": 66,\n \"score\": 90528.6293891636\n },\n {\n \"content\": \"/*\\n\\n * Copyright 2018 ProximaX Limited. All rights reserved.\\n\\n * Use of this source code is governed by the Apache 2.0\\n\\n * license that can be found in the LICENSE file.\\n\\n */\\n\\n\\n\\nuse {\\n\\n serde::{Deserialize, Deserializer},\\n\\n serde_json::Value,\\n\\n};\\n\\n\\n\\nuse crate::{\\n\\n account::{\\n\\n AccountInfo, AccountLinkType, AccountName, AccountProperties,\\n\\n AccountPropertiesAddressModification, AccountPropertiesEntityTypeModification,\\n\\n AccountPropertiesModificationType, AccountPropertiesMosaicModification,\\n\\n AccountPropertyType, Address,\\n\\n },\\n\\n models::{error::Error::Failure, Result},\\n\\n mosaic::{Mosaic, MosaicId},\\n\",\n \"file_path\": \"src/api/dtos/account_dto.rs\",\n \"rank\": 67,\n \"score\": 90528.54880259665\n },\n {\n \"content\": \"/*\\n\\n * Copyright 2018 ProximaX Limited. All rights reserved.\\n\\n * Use of this source code is governed by the Apache 2.0\\n\\n * license that can be found in the LICENSE file.\\n\\n */\\n\\n\\n\\nuse ::std::collections::HashMap;\\n\\n\\n\\nuse crate::{\\n\\n helpers::has_bits,\\n\\n models::{\\n\\n account::PublicAccount,\\n\\n exchange::{\\n\\n AddOffer, ExchangeConfirmation, Offer, OfferIdInfo, OfferIdInfos, OfferInfo, OfferType,\\n\\n OfferType::{BuyOffer, SellOffer},\\n\\n RemoveOffer, UserExchangeInfo,\\n\\n },\\n\\n mosaic::{Mosaic, MosaicId},\\n\\n namespace::{NamespaceId, NAMESPACE_BIT},\\n\\n network::NetworkType,\\n\",\n \"file_path\": \"src/api/dtos/exchange_dto.rs\",\n \"rank\": 68,\n \"score\": 90525.2619955299\n },\n {\n \"content\": \"};\\n\\n\\n\\nuse super::{AbstractTransactionDto, FieldDto, Uint64Dto};\\n\\n\\n\\n#[derive(Deserialize)]\\n\\npub(crate) struct MetadataDto<T> {\\n\\n pub(crate) metadata: T,\\n\\n}\\n\\n\\n\\n#[derive(Deserialize)]\\n\\npub(crate) struct MetadataInfoDto {\\n\\n #[serde(rename = \\\"metadataType\\\")]\\n\\n r#_type: u8,\\n\\n fields: Vec<FieldDto>,\\n\\n}\\n\\n\\n\\nimpl MetadataInfoDto {\\n\\n pub fn compact(&self) -> MetadataInfo {\\n\\n let mut fields: HashMap<String, String> = HashMap::new();\\n\\n\\n\",\n \"file_path\": \"src/api/dtos/metadata_dto.rs\",\n \"rank\": 69,\n \"score\": 90519.67946685763\n },\n {\n \"content\": \"impl ModifyMetadataTransactionDto {\\n\\n pub fn compact(&self, info: TransactionInfo) -> crate::Result<ModifyMetadataTransaction> {\\n\\n let abs_transaction = self.r#abstract.compact(info)?;\\n\\n\\n\\n let modifications = metadata_dto_vec_to_struct(self.modifications.clone());\\n\\n Ok(ModifyMetadataTransaction {\\n\\n abs_transaction,\\n\\n metadata_type: MetadataType::from(self.metadata_type),\\n\\n modifications,\\n\\n })\\n\\n }\\n\\n}\\n\\n\\n\\n#[derive(Deserialize)]\\n\\npub(crate) struct AddressMetadataInfoDto {\\n\\n #[serde(flatten)]\\n\\n metadata: MetadataInfoDto,\\n\\n #[serde(rename = \\\"metadataId\\\")]\\n\\n address: String,\\n\\n}\\n\",\n \"file_path\": \"src/api/dtos/metadata_dto.rs\",\n \"rank\": 70,\n \"score\": 90519.0231516045\n },\n {\n \"content\": \"// Copyright 2018 ProximaX Limited. All rights reserved.\\n\\n// Use of this source code is governed by the Apache 2.0\\n\\n// license that can be found in the LICENSE file.\\n\\n\\n\\n/// The type of the receipt:\\n\\n///* 0x134D (4941 decimal) - Mosaic_Rental_Fee.\\n\\n///* 0x124E (4686 decimal) - Namespace_Rental_Fee.\\n\\n///* 0x2143 (8515 decimal) - Harvest_Fee.\\n\\n///* 0x2248 (8776 decimal) - LockHash_Completed.\\n\\n///* 0x2348 (9032 decimal) - LockHash_Expired.\\n\\n///* 0x2252 (8786 decimal) - LockSecret_Completed.\\n\\n///* 0x2352 (9042 decimal) - LockSecret_Expired.\\n\\n///* 0x3148 (12616 decimal) - LockHash_Created.\\n\\n///* 0x3152 (12626 decimal) - LockSecret_Created.\\n\\n///* 0x414D (16717 decimal) - Mosaic_Expired.\\n\\n///* 0x414E (16718 decimal) - Namespace_Expired.\\n\\n///* 0x5143 (20803 decimal) - Inflation.\\n\\n///* 0xE134 (57652 decimal) - Transaction_Group.\\n\\n///* 0xF143 (61763 decimal) - Address_Alias_Resolution.\\n\\n///* 0xF243 (62019 decimal) - Mosaic_Alias_Resolution.\\n\",\n \"file_path\": \"src/api/dtos/receipt_dto.rs\",\n \"rank\": 71,\n \"score\": 90514.57726643789\n },\n {\n \"content\": \"pub(crate) struct AccountPropertiesTransactionDto {\\n\\n #[serde(flatten)]\\n\\n r#abstract: AbstractTransactionDto,\\n\\n property_type: u8,\\n\\n modifications: Vec<AccountPropertiesModificationDto>,\\n\\n}\\n\\n\\n\\n#[typetag::serde]\\n\\nimpl TransactionDto for AccountPropertiesTransactionInfoDto {\\n\\n fn compact(&self) -> Result<Box<dyn Transaction>> {\\n\\n let dto = self.transaction.clone();\\n\\n\\n\\n let info = self.meta.compact()?;\\n\\n\\n\\n let abs_transaction = dto.r#abstract.compact(info)?;\\n\\n\\n\\n if dto.property_type & AccountPropertyType::AllowAddress.value() != 0 {\\n\\n let modifications: Vec<AccountPropertiesAddressModification> = dto\\n\\n .modifications\\n\\n .iter()\\n\",\n \"file_path\": \"src/api/dtos/account_dto.rs\",\n \"rank\": 72,\n \"score\": 90513.75925111523\n },\n {\n \"content\": \" pub fn compact(&self) -> crate::Result<Vec<MultisigAccountInfo>> {\\n\\n Ok(self\\n\\n .multisig_entries\\n\\n .iter()\\n\\n .map(|item| item.compact().unwrap())\\n\\n .collect())\\n\\n }\\n\\n}\\n\\n\\n\\n#[derive(Serialize, Deserialize)]\\n\\npub(crate) struct MultisigAccountInfoDto {\\n\\n #[serde(rename = \\\"multisig\\\")]\\n\\n multisig: MultisigDto,\\n\\n}\\n\\n\\n\\nimpl MultisigAccountInfoDto {\\n\\n pub fn compact(&self) -> crate::Result<MultisigAccountInfo> {\\n\\n let dto = self.multisig.to_owned();\\n\\n let network_type: NetworkType =\\n\\n Address::from_encoded(&dto.account_address.unwrap())?.network_type();\\n\",\n \"file_path\": \"src/api/dtos/multisig_dto.rs\",\n \"rank\": 73,\n \"score\": 90512.66217651396\n },\n {\n \"content\": \"#[serde(rename_all = \\\"camelCase\\\")]\\n\\npub(crate) struct MultisigDto {\\n\\n account: String,\\n\\n #[serde(rename = \\\"accountAddress\\\", skip_serializing_if = \\\"Option::is_none\\\")]\\n\\n account_address: Option<String>,\\n\\n min_approval: i32,\\n\\n min_removal: i32,\\n\\n cosignatories: Vec<String>,\\n\\n multisig_accounts: Vec<String>,\\n\\n}\\n\\n\\n\\n#[derive(Serialize, Deserialize)]\\n\\npub(crate) struct MultisigAccountGraphInfoDto {\\n\\n #[serde(rename = \\\"level\\\")]\\n\\n pub level: i16,\\n\\n #[serde(rename = \\\"multisigEntries\\\")]\\n\\n multisig_entries: Vec<MultisigAccountInfoDto>,\\n\\n}\\n\\n\\n\\nimpl MultisigAccountGraphInfoDto {\\n\",\n \"file_path\": \"src/api/dtos/multisig_dto.rs\",\n \"rank\": 74,\n \"score\": 90512.4972710403\n },\n {\n \"content\": \" mosaic_id: Option<Uint64Dto>,\\n\\n}\\n\\n\\n\\n#[derive(Serialize, Deserialize)]\\n\\n#[serde(rename_all = \\\"camelCase\\\")]\\n\\npub(crate) struct AddressAliasTransactionInfoDto {\\n\\n meta: TransactionMetaDto,\\n\\n transaction: AliasTransactionDto,\\n\\n}\\n\\n\\n\\n#[typetag::serde]\\n\\nimpl TransactionDto for AddressAliasTransactionInfoDto {\\n\\n fn compact(&self) -> Result<Box<dyn Transaction>> {\\n\\n let dto = self.transaction.clone();\\n\\n\\n\\n let info = self.meta.compact()?;\\n\\n\\n\\n let address_encoded = dto.address.unwrap();\\n\\n\\n\\n let address = Address::from_encoded(&address_encoded)?;\\n\",\n \"file_path\": \"src/api/dtos/alias_dto.rs\",\n \"rank\": 75,\n \"score\": 90511.1876476279\n },\n {\n \"content\": \"\\n\\n#[typetag::serde]\\n\\nimpl TransactionDto for TransferTransactionInfoDto {\\n\\n fn compact(&self) -> Result<Box<dyn Transaction>> {\\n\\n let dto = self.transaction.clone();\\n\\n let info = self.meta.compact()?;\\n\\n\\n\\n let abs_transaction = dto.r#abstract.compact(info)?;\\n\\n\\n\\n let mut mosaics: Vec<Mosaic> = vec![];\\n\\n if let Some(value) = &dto.mosaics {\\n\\n for mosaic in value {\\n\\n mosaics.push(mosaic.compact());\\n\\n }\\n\\n };\\n\\n\\n\\n let recipient = Address::from_encoded(&dto.recipient)?;\\n\\n\\n\\n Ok(Box::new(TransferTransaction {\\n\\n abs_transaction,\\n\",\n \"file_path\": \"src/api/dtos/transaction_dto.rs\",\n \"rank\": 76,\n \"score\": 90510.73174812277\n },\n {\n \"content\": \" r#abstract: AbstractTransactionDto,\\n\\n pub offers: AddOfferDTOs,\\n\\n}\\n\\n\\n\\n#[derive(Clone, Serialize, Deserialize)]\\n\\n#[serde(rename_all = \\\"camelCase\\\")]\\n\\npub(crate) struct AddExchangeOfferTransactionInfoDto {\\n\\n pub meta: TransactionMetaDto,\\n\\n pub transaction: AddExchangeOfferTransactionDto,\\n\\n}\\n\\n\\n\\n#[typetag::serde]\\n\\nimpl TransactionDto for AddExchangeOfferTransactionInfoDto {\\n\\n fn compact(&self) -> Result<Box<dyn Transaction>> {\\n\\n let dto = self.transaction.clone();\\n\\n let info = self.meta.compact()?;\\n\\n\\n\\n let abs_transaction = dto.r#abstract.compact(info)?;\\n\\n\\n\\n let offers: Vec<AddOffer> = dto\\n\",\n \"file_path\": \"src/api/dtos/exchange_dto.rs\",\n \"rank\": 77,\n \"score\": 90510.69836347211\n },\n {\n \"content\": \" transaction::{\\n\\n AddExchangeOfferTransaction, ExchangeOfferTransaction, RemoveExchangeOfferTransaction,\\n\\n Transaction,\\n\\n },\\n\\n AssetId, Result,\\n\\n },\\n\\n};\\n\\n\\n\\nuse super::{AbstractTransactionDto, TransactionDto, TransactionMetaDto, Uint64Dto};\\n\\n\\n\\npub(crate) type OfferInfoDTOs = Vec<OfferInfoDto>;\\n\",\n \"file_path\": \"src/api/dtos/exchange_dto.rs\",\n \"rank\": 78,\n \"score\": 90510.62766981818\n },\n {\n \"content\": \"\\n\\nimpl AddressMetadataInfoDto {\\n\\n pub fn compact(&self) -> crate::Result<AddressMetadataInfo> {\\n\\n let info = self.metadata.compact();\\n\\n\\n\\n let address = if !self.address.is_empty() {\\n\\n Address::from_encoded(&self.address)?\\n\\n } else {\\n\\n Address::default()\\n\\n };\\n\\n Ok(AddressMetadataInfo { info, address })\\n\\n }\\n\\n}\\n\\n\\n\\n#[derive(Deserialize)]\\n\\npub(crate) struct MosaicMetadataInfoDto {\\n\\n #[serde(flatten)]\\n\\n metadata: MetadataInfoDto,\\n\\n #[serde(rename = \\\"metadataId\\\")]\\n\\n mosaic_id: Uint64Dto,\\n\",\n \"file_path\": \"src/api/dtos/metadata_dto.rs\",\n \"rank\": 79,\n \"score\": 90510.42190668189\n },\n {\n \"content\": \"}\\n\\n\\n\\nimpl ExchangeInfoDto {\\n\\n pub(crate) fn compact(&self, network_type: NetworkType) -> Result<UserExchangeInfo> {\\n\\n let dto = self.to_owned();\\n\\n let owner = PublicAccount::from_public_key(&dto.exchange.owner, network_type)?;\\n\\n\\n\\n let mut buy_offer: OfferIdInfos = vec![];\\n\\n let mut buy_offer_offers: Vec<OfferInfo> = vec![];\\n\\n for item in dto.exchange.buy_offers.into_iter() {\\n\\n buy_offer_offers.push(item.compact(owner.to_owned())?)\\n\\n }\\n\\n\\n\\n for offer_info in buy_offer_offers.into_iter() {\\n\\n let id = &offer_info.mosaic.asset_id;\\n\\n buy_offer.push(OfferIdInfo {\\n\\n mosaic_id: id.as_mosaic_id()?,\\n\\n offer_info,\\n\\n });\\n\\n }\\n\",\n \"file_path\": \"src/api/dtos/exchange_dto.rs\",\n \"rank\": 80,\n \"score\": 90509.53819607715\n },\n {\n \"content\": \"pub(crate) struct RegisterNamespaceTransactionInfoDto {\\n\\n meta: TransactionMetaDto,\\n\\n transaction: RegisterNamespaceTransactionDto,\\n\\n}\\n\\n\\n\\n#[typetag::serde]\\n\\nimpl TransactionDto for RegisterNamespaceTransactionInfoDto {\\n\\n fn compact(&self) -> Result<Box<dyn Transaction>> {\\n\\n let dto = self.transaction.clone();\\n\\n\\n\\n let info = self.meta.compact()?;\\n\\n\\n\\n let abs_transaction = dto.r#abstract.compact(info)?;\\n\\n\\n\\n let namespace_type = NamespaceType::from(dto.namespace_type);\\n\\n\\n\\n let namespace_id = NamespaceId::from(dto.namespace_id.compact());\\n\\n\\n\\n let mut parent_id = None;\\n\\n\\n\",\n \"file_path\": \"src/api/dtos/namespace_dto.rs\",\n \"rank\": 81,\n \"score\": 90508.6189400059\n },\n {\n \"content\": \" owner,\\n\\n offers: offers_map,\\n\\n })\\n\\n }\\n\\n}\\n\\n\\n\\n#[derive(Clone, Serialize, Deserialize)]\\n\\n#[serde(rename_all = \\\"camelCase\\\")]\\n\\npub(crate) struct OfferInfoDto {\\n\\n mosaic_id: Uint64Dto,\\n\\n amount: Uint64Dto,\\n\\n initial_amount: Uint64Dto,\\n\\n initial_cost: Uint64Dto,\\n\\n deadline: Uint64Dto,\\n\\n pub owner: Option<String>,\\n\\n}\\n\\n\\n\\nimpl OfferInfoDto {\\n\\n pub(crate) fn compact(&self, owner: PublicAccount) -> crate::Result<OfferInfo> {\\n\\n let dto = self.to_owned();\\n\",\n \"file_path\": \"src/api/dtos/exchange_dto.rs\",\n \"rank\": 82,\n \"score\": 90508.35504358371\n },\n {\n \"content\": \"#[serde(rename_all = \\\"camelCase\\\")]\\n\\npub(crate) struct ExchangeOfferTransactionDto {\\n\\n #[serde(flatten)]\\n\\n r#abstract: AbstractTransactionDto,\\n\\n pub offers: ConfirmationOfferDTOs,\\n\\n}\\n\\n\\n\\n#[derive(Clone, Serialize, Deserialize)]\\n\\n#[serde(rename_all = \\\"camelCase\\\")]\\n\\npub(crate) struct ExchangeOfferTransactionInfoDto {\\n\\n pub meta: TransactionMetaDto,\\n\\n pub transaction: ExchangeOfferTransactionDto,\\n\\n}\\n\\n\\n\\n#[typetag::serde]\\n\\nimpl TransactionDto for ExchangeOfferTransactionInfoDto {\\n\\n fn compact(&self) -> Result<Box<dyn Transaction>> {\\n\\n let dto = self.transaction.clone();\\n\\n let info = self.meta.compact()?;\\n\\n\\n\",\n \"file_path\": \"src/api/dtos/exchange_dto.rs\",\n \"rank\": 83,\n \"score\": 90508.31540451657\n },\n {\n \"content\": \" let dto = &self.account;\\n\\n let add = Address::from_encoded(&dto.clone().address)?;\\n\\n let acc_type = AccountLinkType::new(dto.clone().account_type);\\n\\n\\n\\n let mosaics: Vec<Mosaic> = dto\\n\\n .mosaics\\n\\n .iter()\\n\\n .map(move |mosaic_dto| mosaic_dto.compact())\\n\\n .collect();\\n\\n\\n\\n Ok(AccountInfo::new(\\n\\n add,\\n\\n dto.clone().address_height.compact(),\\n\\n dto.clone().public_key,\\n\\n dto.public_key_height.compact(),\\n\\n acc_type,\\n\\n mosaics,\\n\\n ))\\n\\n }\\n\\n}\\n\\n\\n\\n/// AccountLinkTransactionDto : Delegates the account importance score to a proxy account.\\n\",\n \"file_path\": \"src/api/dtos/account_dto.rs\",\n \"rank\": 84,\n \"score\": 90507.59914264442\n },\n {\n \"content\": \"\\n\\nimpl MetadataModificationDto {\\n\\n pub fn compact(&self) -> MetadataModification {\\n\\n MetadataModification {\\n\\n r#type: MetadataModificationType::from(self.modification_type),\\n\\n key: self.key.clone(),\\n\\n value: self.value.clone(),\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\n#[derive(Clone, Serialize, Deserialize)]\\n\\n#[serde(rename_all = \\\"camelCase\\\")]\\n\\npub(crate) struct ModifyMetadataTransactionDto {\\n\\n #[serde(flatten)]\\n\\n pub r#abstract: AbstractTransactionDto,\\n\\n pub metadata_type: u8,\\n\\n pub modifications: Vec<MetadataModificationDto>,\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/api/dtos/metadata_dto.rs\",\n \"rank\": 85,\n \"score\": 90506.94952124306\n },\n {\n \"content\": \" });\\n\\n\\n\\n Ok(AccountProperties {\\n\\n address: Address::from_encoded(&dto.address)?,\\n\\n allowed_addresses,\\n\\n allowed_mosaic_id,\\n\\n allowed_entity_types,\\n\\n blocked_addresses,\\n\\n blocked_mosaic_id,\\n\\n blocked_entity_types,\\n\\n })\\n\\n }\\n\\n}\\n\\n\\n\\n#[derive(Clone, Serialize, Deserialize)]\\n\\n#[serde(rename_all = \\\"camelCase\\\")]\\n\\npub(crate) struct AccountPropertiesDto {\\n\\n address: String,\\n\\n properties: Vec<PropertiesDto>,\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/api/dtos/account_dto.rs\",\n \"rank\": 86,\n \"score\": 90506.58937642124\n },\n {\n \"content\": \" let mut blocked_mosaic_id: Vec<MosaicId> = vec![];\\n\\n let mut blocked_entity_types: Vec<TransactionType> = vec![];\\n\\n\\n\\n dto.properties.iter().for_each(|p_dto| {\\n\\n if let Some(item) = p_dto.addresses.clone() {\\n\\n let property_addresses = item\\n\\n .into_iter()\\n\\n .map(|hex_address| Address::from_encoded(&hex_address).unwrap())\\n\\n .collect();\\n\\n if p_dto.property_type == AccountPropertyType::AllowAddress.value() {\\n\\n allowed_addresses = property_addresses;\\n\\n } else {\\n\\n blocked_addresses = property_addresses;\\n\\n }\\n\\n };\\n\\n });\\n\\n\\n\\n dto.properties.iter().for_each(|p_dto| {\\n\\n if let Some(item) = p_dto.mosaic_ids.clone() {\\n\\n let property_mosaic_id = item\\n\",\n \"file_path\": \"src/api/dtos/account_dto.rs\",\n \"rank\": 87,\n \"score\": 90506.4157940474\n },\n {\n \"content\": \"#[derive(Clone, Serialize, Deserialize)]\\n\\n#[serde(rename_all = \\\"camelCase\\\")]\\n\\npub(crate) struct ConfirmationOffer {\\n\\n #[serde(flatten)]\\n\\n offer_dto: OfferDTO,\\n\\n owner: String,\\n\\n}\\n\\n\\n\\n#[derive(Clone, Serialize, Deserialize)]\\n\\n#[serde(rename_all = \\\"camelCase\\\")]\\n\\npub(crate) struct ExchangeDto {\\n\\n owner: String,\\n\\n buy_offers: OfferInfoDTOs,\\n\\n sell_offers: OfferInfoDTOs,\\n\\n}\\n\\n\\n\\n#[derive(Clone, Serialize, Deserialize)]\\n\\n#[serde(rename_all = \\\"camelCase\\\")]\\n\\npub(crate) struct ExchangeInfoDto {\\n\\n exchange: ExchangeDto,\\n\",\n \"file_path\": \"src/api/dtos/exchange_dto.rs\",\n \"rank\": 88,\n \"score\": 90505.62758444347\n },\n {\n \"content\": \"}\\n\\n\\n\\n#[typetag::serde]\\n\\nimpl TransactionDto for ModifyMultisigAccountTransactionInfoDto {\\n\\n fn compact(&self) -> Result<Box<dyn Transaction>> {\\n\\n let dto = self.transaction.clone();\\n\\n let info = self.meta.compact()?;\\n\\n\\n\\n let abs_transaction = dto.r#abstract.compact(info)?;\\n\\n\\n\\n let modifications =\\n\\n cosignatory_dto_vec_to_struct(dto.modifications, abs_transaction.network_type);\\n\\n\\n\\n Ok(Box::new(ModifyMultisigAccountTransaction {\\n\\n abs_transaction,\\n\\n min_removal_delta: dto.min_removal_delta,\\n\\n min_approval_delta: dto.min_approval_delta,\\n\\n modifications,\\n\\n }))\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/api/dtos/multisig_dto.rs\",\n \"rank\": 89,\n \"score\": 90505.2988022442\n },\n {\n \"content\": \" #[serde(rename = \\\"type\\\")]\\n\\n _type: u16,\\n\\n #[serde(skip_serializing_if = \\\"Option::is_none\\\")]\\n\\n mosaic_id: Option<Uint64Dto>,\\n\\n /// The aliased address in hexadecimal.\\n\\n #[serde(skip_serializing_if = \\\"Option::is_none\\\")]\\n\\n address: Option<String>,\\n\\n}\\n\\n\\n\\nimpl AliasDto {\\n\\n pub fn compact(&self) -> crate::Result<NamespaceAlias> {\\n\\n let mut alias = NamespaceAlias::default();\\n\\n alias.type_ = self._type as u8;\\n\\n\\n\\n if let Some(a) = &self.address {\\n\\n let address = Address::from_encoded(a)?;\\n\\n alias.address = Some(address)\\n\\n };\\n\\n\\n\\n if let Some(m) = &self.mosaic_id {\\n\",\n \"file_path\": \"src/api/dtos/alias_dto.rs\",\n \"rank\": 90,\n \"score\": 90505.12973691158\n },\n {\n \"content\": \"pub(crate) struct NamespaceMetadataTransactionInfoDto {\\n\\n meta: TransactionMetaDto,\\n\\n transaction: NamespaceMetadataTransactionDto,\\n\\n}\\n\\n\\n\\n#[typetag::serde]\\n\\nimpl TransactionDto for NamespaceMetadataTransactionInfoDto {\\n\\n fn compact(&self) -> Result<Box<dyn Transaction>> {\\n\\n let dto = self.transaction.clone();\\n\\n\\n\\n let info = self.meta.compact()?;\\n\\n\\n\\n let metadata_transaction = dto.metadata_transaction.compact(info)?;\\n\\n\\n\\n let namespace_id = NamespaceId::from(dto.namespace_id.compact());\\n\\n\\n\\n Ok(Box::new(MetadataNamespaceTransaction {\\n\\n metadata_transaction,\\n\\n namespace_id,\\n\\n }))\\n\",\n \"file_path\": \"src/api/dtos/namespace_dto.rs\",\n \"rank\": 91,\n \"score\": 90505.10875483896\n },\n {\n \"content\": \" #[serde(flatten)]\\n\\n metadata_transaction: ModifyMetadataTransactionDto,\\n\\n #[serde(rename = \\\"metadataId\\\")]\\n\\n mosaic_id: Uint64Dto,\\n\\n}\\n\\n\\n\\n#[derive(Serialize, Deserialize)]\\n\\n#[serde(rename_all = \\\"camelCase\\\")]\\n\\npub(crate) struct MosaicMetadataTransactionInfoDto {\\n\\n meta: TransactionMetaDto,\\n\\n transaction: MosaicMetadataTransactionDto,\\n\\n}\\n\\n\\n\\n#[typetag::serde]\\n\\nimpl TransactionDto for MosaicMetadataTransactionInfoDto {\\n\\n fn compact(&self) -> Result<Box<dyn Transaction>> {\\n\\n let dto = self.transaction.clone();\\n\\n\\n\\n let info = self.meta.compact()?;\\n\\n\\n\",\n \"file_path\": \"src/api/dtos/mosaic_dto.rs\",\n \"rank\": 92,\n \"score\": 90504.9721699059\n },\n {\n \"content\": \"\\n\\n Ok(AccountName {\\n\\n address,\\n\\n names: self.to_owned().names,\\n\\n })\\n\\n }\\n\\n}\\n\\n\\n\\n#[derive(Serialize, Deserialize)]\\n\\n#[serde(rename_all = \\\"camelCase\\\")]\\n\\npub(crate) struct AccountPropertiesTransactionInfoDto {\\n\\n meta: TransactionMetaDto,\\n\\n transaction: AccountPropertiesTransactionDto,\\n\\n}\\n\\n\\n\\n/// AccountPropertiesTransactionDto :\\n\\n/// Transaction that prevents receiving transactions from undesired\\n\\n/// addresses, mosaics or sending certain transaction types.\\n\\n#[derive(Clone, Serialize, Deserialize)]\\n\\n#[serde(rename_all = \\\"camelCase\\\")]\\n\",\n \"file_path\": \"src/api/dtos/account_dto.rs\",\n \"rank\": 93,\n \"score\": 90504.87245619828\n },\n {\n \"content\": \" let metadata_transaction = dto.metadata_transaction.compact(info)?;\\n\\n\\n\\n let mosaic_id = MosaicId::from(dto.mosaic_id.compact());\\n\\n\\n\\n Ok(Box::new(MetadataMosaicTransaction {\\n\\n metadata_transaction,\\n\\n mosaic_id,\\n\\n }))\\n\\n }\\n\\n}\\n\\n\\n\\n#[derive(Serialize, Deserialize)]\\n\\n#[serde(rename_all = \\\"camelCase\\\")]\\n\\npub(crate) struct MosaicNamesDto {\\n\\n mosaic_id: Uint64Dto,\\n\\n names: Vec<String>,\\n\\n}\\n\\n\\n\\nimpl MosaicNamesDto {\\n\\n pub fn compact(&self) -> MosaicNames {\\n\",\n \"file_path\": \"src/api/dtos/mosaic_dto.rs\",\n \"rank\": 94,\n \"score\": 90504.74833935809\n },\n {\n \"content\": \" })\\n\\n }\\n\\n}\\n\\n\\n\\n#[derive(Serialize, Deserialize)]\\n\\n#[serde(rename_all = \\\"camelCase\\\")]\\n\\npub(crate) struct ModifyMultisigAccountTransactionInfoDto {\\n\\n meta: TransactionMetaDto,\\n\\n transaction: ModifyMultisigAccountTransactionDto,\\n\\n}\\n\\n\\n\\n/// ModifyMultisigAccountTransactionDto : Transaction that creates or modifies a multisig account.\\n\\n#[derive(Clone, Serialize, Deserialize)]\\n\\n#[serde(rename_all = \\\"camelCase\\\")]\\n\\npub(crate) struct ModifyMultisigAccountTransactionDto {\\n\\n #[serde(flatten)]\\n\\n r#abstract: AbstractTransactionDto,\\n\\n min_removal_delta: i8,\\n\\n min_approval_delta: i8,\\n\\n modifications: Vec<CosignatoryModificationDto>,\\n\",\n \"file_path\": \"src/api/dtos/multisig_dto.rs\",\n \"rank\": 95,\n \"score\": 90504.6375216104\n },\n {\n \"content\": \" MosaicNames::new(\\n\\n MosaicId::from(self.mosaic_id.compact()),\\n\\n (self.names).to_owned(),\\n\\n )\\n\\n }\\n\\n}\\n\\n\\n\\n#[derive(Clone, Serialize, Deserialize)]\\n\\npub(crate) struct MosaicPropertyDto {\\n\\n pub(crate) id: u8,\\n\\n pub(crate) value: Uint64Dto,\\n\\n}\\n\\n\\n\\n#[derive(Clone, Serialize, Deserialize)]\\n\\n#[serde(rename_all = \\\"camelCase\\\")]\\n\\npub(crate) struct MosaicSupplyChangeTransactionInfoDto {\\n\\n meta: TransactionMetaDto,\\n\\n transaction: MosaicSupplyChangeTransactionDto,\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/api/dtos/mosaic_dto.rs\",\n \"rank\": 96,\n \"score\": 90504.56589782966\n },\n {\n \"content\": \"}\\n\\n\\n\\nimpl MosaicMetadataInfoDto {\\n\\n pub fn compact(&self) -> crate::Result<MosaicMetadataInfo> {\\n\\n let info = self.metadata.compact();\\n\\n\\n\\n let mosaic_id = if !self.mosaic_id.0.is_empty() {\\n\\n MosaicId::from(self.mosaic_id.compact())\\n\\n } else {\\n\\n MosaicId::default()\\n\\n };\\n\\n Ok(MosaicMetadataInfo { info, mosaic_id })\\n\\n }\\n\\n}\\n\\n\\n\\n#[derive(Deserialize)]\\n\\npub(crate) struct NamespaceMetadataInfoDto {\\n\\n #[serde(flatten)]\\n\\n metadata: MetadataInfoDto,\\n\\n #[serde(rename = \\\"metadataId\\\")]\\n\",\n \"file_path\": \"src/api/dtos/metadata_dto.rs\",\n \"rank\": 97,\n \"score\": 90503.76918955275\n },\n {\n \"content\": \" } else {\\n\\n None\\n\\n };\\n\\n\\n\\n Ok(TransactionStatus::new(\\n\\n dto.group.clone().unwrap(),\\n\\n dto.status.clone(),\\n\\n HashValue::from_str(&dto.hash.as_ref().unwrap())?,\\n\\n deadline,\\n\\n height,\\n\\n ))\\n\\n }\\n\\n}\\n\\n\\n\\n#[derive(Clone, Serialize, Deserialize)]\\n\\n#[serde(rename_all = \\\"camelCase\\\")]\\n\\npub(crate) struct TransferTransactionInfoDto {\\n\\n pub meta: TransactionMetaDto,\\n\\n pub transaction: TransferTransactionDto,\\n\\n}\\n\",\n \"file_path\": \"src/api/dtos/transaction_dto.rs\",\n \"rank\": 98,\n \"score\": 90503.75979421864\n },\n {\n \"content\": \" confirmations,\\n\\n }))\\n\\n }\\n\\n}\\n\\n\\n\\n/// AddExchangeOfferTransactionDto.\\n\\n#[derive(Clone, Serialize, Deserialize)]\\n\\n#[serde(rename_all = \\\"camelCase\\\")]\\n\\npub(crate) struct RemoveExchangeOfferTransactionDto {\\n\\n #[serde(flatten)]\\n\\n r#abstract: AbstractTransactionDto,\\n\\n pub offers: RemoveOfferDTOs,\\n\\n}\\n\\n\\n\\n#[derive(Clone, Serialize, Deserialize)]\\n\\n#[serde(rename_all = \\\"camelCase\\\")]\\n\\npub(crate) struct RemoveExchangeOfferTransactionInfoDto {\\n\\n pub meta: TransactionMetaDto,\\n\\n pub transaction: RemoveExchangeOfferTransactionDto,\\n\\n}\\n\",\n \"file_path\": \"src/api/dtos/exchange_dto.rs\",\n \"rank\": 99,\n \"score\": 90503.62273871123\n }\n]","isConversational":false}}},{"rowIdx":2395,"cells":{"lang":{"kind":"string","value":"Rust"},"file_path":{"kind":"string","value":"src/config/mod.rs"},"repo_name":{"kind":"string","value":"pc37utn/rocfl"},"commit":{"kind":"string","value":"723501625b4b8775901470ffacd856124bfd4713"},"file_code":{"kind":"string","value":"use std::collections::HashMap;\nuse std::fs;\nuse std::io::Read;\nuse std::path::{Path, PathBuf};\n\nuse directories::ProjectDirs;\nuse serde::Deserialize;\n\nuse crate::ocfl::{DigestAlgorithm, Result, RocflError};\n\nconst CONFIG_FILE: &str = \"config.toml\";\nconst GLOBAL: &str = \"global\";\n\n#[derive(Deserialize, Debug)]\n#[serde(deny_unknown_fields)]\npub struct Config {\n pub author_name: Option<String>,\n pub author_address: Option<String>,\n pub root: Option<String>,\n pub staging_root: Option<String>,\n pub region: Option<String>,\n pub bucket: Option<String>,\n pub endpoint: Option<String>,\n pub profile: Option<String>,\n}\n\nimpl Config {\n pub fn new() -> Self {\n Self {\n author_name: None,\n author_address: None,\n root: None,\n staging_root: None,\n region: None,\n bucket: None,\n endpoint: None,\n profile: None,\n }\n }\n\n pub fn validate(&self) -> Result<()> {\n if self.bucket.is_some() {\n if self.region.is_none() {\n return Err(RocflError::InvalidConfiguration(\n \"Region must be specified when using S3\".to_string(),\n ));\n }\n } else if self.region.is_some() || self.endpoint.is_some() {\n return Err(RocflError::InvalidConfiguration(\n \"Region and endpoint should not be set when not using S3. \\\n If you intended to use S3, then you must specify a bucket.\"\n .to_string(),\n ));\n }\n\n Ok(())\n }\n}\n\nimpl Default for Config {\n fn default() -> Self {\n Self::new()\n }\n}\n\npub fn load_config(name: &Option<String>) -> Result<Config> {\n if let Some(config_file) = config_path() {\n if config_file.exists() {\n let config = parse_config(&config_file)?;\n return Ok(resolve_config(name, config));\n }\n }\n Ok(Config::new())\n}\n\npub fn config_path() -> Option<PathBuf> {\n project_dirs().map(|dirs| dirs.config_dir().join(CONFIG_FILE))\n}\n\npub fn project_dirs() -> Option<ProjectDirs> {\n ProjectDirs::from(\"org\", \"rocfl\", \"rocfl\")\n}\n\npub fn s3_staging_path(config: &Config) -> Result<String> {\n match project_dirs() {\n Some(dirs) => {\n let mut staging = dirs.data_dir().join(\"s3\").join(\"staging\");\n staging.push(s3_identifier(config)?);\n Ok(staging.to_string_lossy().to_string())\n }\n None => Err(RocflError::General(\n \"Failed to locate a suitable directory for staging objects. Please specify a directory using '--staging-root'\".to_string()))\n }\n}\n\nfn s3_identifier(config: &Config) -> Result<String> {\n let mut name = config.bucket.clone().unwrap();\n if let Some(root) = &config.root {\n name.push('/');\n name.push_str(root);\n }\n let hash = DigestAlgorithm::Sha256.hash_hex(&mut name.as_bytes())?;\n Ok(hash.to_string())\n}\n\nfn parse_config(config_file: impl AsRef<Path>) -> Result<HashMap<String, Config>> {\n let mut buffer = Vec::new();\n fs::File::open(config_file.as_ref())?.read_to_end(&mut buffer)?;\n let config: HashMap<String, Config> = toml::from_slice(&buffer)?;\n Ok(config)\n}\n\nfn resolve_config(name: &Option<String>, mut config: HashMap<String, Config>) -> Config {\n let global_config = config.remove(GLOBAL);\n let repo_config = match name {\n None => None,\n Some(name) => config.remove(name),\n };\n\n match (global_config, repo_config) {\n (Some(global), None) => global,\n (None, Some(repo)) => repo,\n (None, None) => Config::new(),\n (Some(global), Some(repo)) => {\n let mut resolved = Config::new();\n\n resolved.author_name = resolve_field(global.author_name, repo.author_name);\n resolved.author_address = resolve_field(global.author_address, repo.author_address);\n resolved.root = resolve_field(global.root, repo.root);\n resolved.staging_root = resolve_field(global.staging_root, repo.staging_root);\n resolved.region = resolve_field(global.region, repo.region);\n resolved.bucket = resolve_field(global.bucket, repo.bucket);\n resolved.endpoint = resolve_field(global.endpoint, repo.endpoint);\n resolved.profile = resolve_field(global.profile, repo.profile);\n\n resolved\n }\n }\n}\n\nfn resolve_field(global_field: Option<String>, repo_field: Option<String>) -> Option<String> {\n if repo_field.is_some() {\n repo_field\n } else {\n global_field\n }\n}\n"},"prefix":{"kind":"string","value":"use std::collections::HashMap;\nuse std::fs;\nuse std::io::Read;\nuse std::path::{Path, PathBuf};\n\nuse directories::ProjectDirs;\nuse serde::Deserialize;\n\nuse crate::ocfl::{DigestAlgorithm, Result, RocflError};\n\nconst CONFIG_FILE: &str = \"config.toml\";\nconst GLOBAL: &str = \"global\";\n\n#[derive(Deserialize, Debug)]\n#[serde(deny_unknown_fields)]\npub struct Config {\n pub author_name: Option<String>,\n pub author_address: Option<String>,\n pub root: Option<String>,\n pub staging_root: Option<String>,\n pub region: Option<String>,\n pub bucket: Option<String>,\n pub endpoint: Option<String>,\n pub profile: Option<String>,\n}\n\nimpl Config {\n pub fn new() -> Self {\n Self {\n author_name: None,\n author_address: None,\n root: None,\n staging_root: None,\n region: None,\n bucket: None,\n endpoint: None,\n profile: None,\n }\n }\n\n pub fn validate(&self) -> Result<()> {\n if self.bucket.is_some() {\n if self.region.is_none() {\n return Err(RocflError::InvalidConfiguration(\n \"Region must be specified when using S3\".to_string(),\n ));\n }\n } else if self.region.is_some() || self.endpoint.is_some() {\n return Err(RocflError::InvalidConfiguration(\n \"Region and endpoint should not be set when not using S3. \\\n If you intended to use S3, then you must specify a bucket.\"\n .to_string(),\n ));\n }\n\n Ok(())\n }\n}\n\nimpl Default for Config {\n fn default() -> Self {\n Self::new()\n }\n}\n\npub fn load_config(name: &Option<String>) -> Result<Config> {\n if let Some(config_file) = config_path() {\n if config_file.exists() {\n let config = parse_config(&config_file)?;\n return Ok(resolve_config(name, config));\n }\n }\n Ok(Config::new())\n}\n\npub fn config_path() -> Option<PathBuf> {\n project_dirs().map(|dirs| dirs.config_dir().join(CONFIG_FILE))\n}\n\npub fn project_dirs() -> Option<ProjectDirs> {\n ProjectDirs::from(\"org\", \"rocfl\", \"rocfl\")\n}\n\npub fn s3_staging_path(config: &Config) -> Result<String> {\n match project_dirs() {\n Some(dirs) => {\n let mut staging = dirs.data_dir().join(\"s3\").join(\"staging\");\n staging.push(s3_identifier(config)?);\n Ok(staging.to_string_lossy().to_string())\n }\n None => Err(RocflError::General(\n \"Failed to locate a suitable directory for staging objects. Please specify a directory using '--staging-root'\".to_string()))\n }\n}\n\nfn s3_identifier(config: &Config) -> Result<String> {\n let mut name = config.bucket.clone().unwrap();\n if let Some(root) = &config.root {\n name.push('/');\n name.push_str(root);\n }\n let hash = DigestAlgorithm::Sha256.hash_hex(&mut name.as_bytes())?;\n Ok(hash.to_string())\n}\n\nfn parse_config(config_file: impl AsRef<Path>) -> Result<HashMap<String, Config>> {\n let mut buffer = Vec::new();\n fs::File::open(config_file.as_ref())?.read_to_end(&mut buffer)?;\n let config: HashMap<String, Config> = toml::from_slice(&buffer)?;\n Ok(config)\n}\n\nfn resolve_config(name: &Option<String>, mut config: HashMap<String, Config>) -> Config {\n let global_config = config.remove(GLOBAL);\n let repo_config = match name {\n None => None,\n Some(name) => config.remove(name),\n };\n\n match (global_config, repo_config) {\n (Some(global), None) => global,\n (None, Some(repo)) => repo,\n (None, Non"},"suffix":{"kind":"string","value":"\n\nfn resolve_field(global_field: Option<String>, repo_field: Option<String>) -> Option<String> {\n if repo_field.is_some() {\n repo_field\n } else {\n global_field\n }\n}\n"},"middle":{"kind":"string","value":"e) => Config::new(),\n (Some(global), Some(repo)) => {\n let mut resolved = Config::new();\n\n resolved.author_name = resolve_field(global.author_name, repo.author_name);\n resolved.author_address = resolve_field(global.author_address, repo.author_address);\n resolved.root = resolve_field(global.root, repo.root);\n resolved.staging_root = resolve_field(global.staging_root, repo.staging_root);\n resolved.region = resolve_field(global.region, repo.region);\n resolved.bucket = resolve_field(global.bucket, repo.bucket);\n resolved.endpoint = resolve_field(global.endpoint, repo.endpoint);\n resolved.profile = resolve_field(global.profile, repo.profile);\n\n resolved\n }\n }\n}"},"strategy":{"kind":"string","value":"function_block-function_prefixed"},"context_items":{"kind":"list like","value":[{"content":"fn default_values(mut config: Config) -> Result<Config> {\n\n if is_s3(&config) {\n\n if config.staging_root.is_none() {\n\n config.staging_root = Some(config::s3_staging_path(&config)?);\n\n }\n\n } else if config.root.is_none() {\n\n config.root = Some(\".\".to_string());\n\n }\n\n\n\n Ok(config)\n\n}\n\n\n","file_path":"src/cmd/mod.rs","rank":1,"score":283411.5315744112},{"content":"fn assert_storage_layout(s3_client: &S3Client, root: &str, layout_name: &str, config: &str) {\n\n assert_file_contains(\n\n s3_client,\n\n root,\n\n \"ocfl_layout.json\",\n\n &format!(\"\\\"extension\\\": \\\"{}\\\"\", layout_name),\n\n );\n\n\n\n let layout_spec = format!(\"{}.md\", layout_name);\n\n assert_file(s3_client, root, &layout_spec, &read_spec(&layout_spec));\n\n\n\n assert_file(\n\n s3_client,\n\n root,\n\n &format!(\"extensions/{}/config.json\", layout_name),\n\n config,\n\n );\n\n}\n\n\n","file_path":"tests/s3-tests.rs","rank":2,"score":282407.11824722},{"content":"fn default_repo(prefix: &str, staging: impl AsRef<Path>) -> OcflRepo {\n\n init_repo(\n\n prefix,\n\n staging,\n\n Some(\n\n StorageLayout::new(\n\n LayoutExtensionName::HashedNTupleLayout,\n\n Some(DEFAULT_LAYOUT.as_bytes()),\n\n )\n\n .unwrap(),\n\n ),\n\n )\n\n}\n\n\n","file_path":"tests/s3-tests.rs","rank":3,"score":276388.3673924161},{"content":"fn validate_repo_root(name: &str) -> PathBuf {\n\n let mut path = PathBuf::from(env!(\"CARGO_MANIFEST_DIR\"));\n\n path.push(\"resources\");\n\n path.push(\"test\");\n\n path.push(\"validate\");\n\n path.push(\"custom\");\n\n path.push(\"repos\");\n\n path.push(name);\n\n path\n\n}\n","file_path":"tests/cli-tests.rs","rank":5,"score":263327.91053200816},{"content":"fn create_repo_root(name: &str) -> PathBuf {\n\n let mut path = PathBuf::from(env!(\"CARGO_MANIFEST_DIR\"));\n\n path.push(\"resources\");\n\n path.push(\"test\");\n\n path.push(\"repos\");\n\n path.push(name);\n\n path\n\n}\n\n\n","file_path":"tests/fs-tests.rs","rank":6,"score":263327.91053200816},{"content":"#[cfg(feature = \"s3\")]\n\nfn create_s3_repo(config: &Config) -> Result<OcflRepo> {\n\n let region = resolve_region(config)?;\n\n\n\n OcflRepo::s3_repo(\n\n region,\n\n config.bucket.as_ref().unwrap(),\n\n config.root.as_deref(),\n\n config.staging_root.as_ref().unwrap(),\n\n config.profile.as_deref(),\n\n )\n\n}\n\n\n","file_path":"src/cmd/mod.rs","rank":7,"score":261117.9290338247},{"content":"#[cfg(feature = \"s3\")]\n\nfn resolve_region(config: &Config) -> Result<Region> {\n\n Ok(match config.endpoint.is_some() {\n\n true => Region::Custom {\n\n name: config.region.as_ref().unwrap().to_owned(),\n\n endpoint: config.endpoint.as_ref().unwrap().to_owned(),\n\n },\n\n false => config.region.as_ref().unwrap().parse()?,\n\n })\n\n}\n\n\n","file_path":"src/cmd/mod.rs","rank":8,"score":260947.84294797608},{"content":"pub fn init_repo(cmd: &InitCmd, args: &RocflArgs, config: &Config) -> Result<()> {\n\n if is_s3(config) {\n\n #[cfg(not(feature = \"s3\"))]\n\n return Err(RocflError::General(\n\n \"This binary was not compiled with S3 support.\".to_string(),\n\n ));\n\n\n\n #[cfg(feature = \"s3\")]\n\n let _ = init_s3_repo(\n\n config,\n\n create_layout(cmd.layout, cmd.config_file.as_deref())?,\n\n )?;\n\n } else {\n\n let _ = OcflRepo::init_fs_repo(\n\n config.root.as_ref().unwrap(),\n\n config.staging_root.as_ref().map(Path::new),\n\n create_layout(cmd.layout, cmd.config_file.as_deref())?,\n\n )?;\n\n }\n\n\n\n if !args.quiet {\n\n println(format!(\n\n \"Initialized OCFL repository with layout {}\",\n\n cmd.layout\n\n ));\n\n }\n\n\n\n Ok(())\n\n}\n\n\n","file_path":"src/cmd/mod.rs","rank":9,"score":258227.6259868616},{"content":"/// If `object_id` is empty, then an `InvalidValue` error is returned. This does not enforce that\n\n/// the id is a URI.\n\npub fn validate_object_id(object_id: &str) -> Result<()> {\n\n if object_id.is_empty() {\n\n return Err(RocflError::InvalidValue(\n\n \"Object IDs may not be blank\".to_string(),\n\n ));\n\n }\n\n Ok(())\n\n}\n\n\n","file_path":"src/ocfl/validate/mod.rs","rank":10,"score":255704.73523611232},{"content":"/// Executes a `rocfl` command\n\npub fn exec_command(args: &RocflArgs, config: Config) -> Result<()> {\n\n let config = resolve_config(args, config);\n\n let config = default_values(config)?;\n\n\n\n info!(\"Resolved configuration: {:?}\", config);\n\n\n\n config.validate()?;\n\n\n\n match &args.command {\n\n Command::Init(command) => {\n\n // init cmd needs to be handled differently because the repo does not exist yet\n\n init_repo(command, args, &config)\n\n }\n\n Command::Config(_command) => edit_config()\n\n .map_err(|e| RocflError::General(format!(\"Failed to edit config file: {}\", e))),\n\n _ => {\n\n let repo = Arc::new(create_repo(&config)?);\n\n let terminate = Arc::new(AtomicBool::new(false));\n\n\n\n let repo_ref = repo.clone();\n","file_path":"src/cmd/mod.rs","rank":11,"score":253301.39997573127},{"content":"fn copy_existing_repo(name: &str, root: &TempDir) {\n\n let path = create_repo_root(name);\n\n\n\n let options = CopyOptions::new();\n\n\n\n fs_extra::dir::copy(&path, root.path(), &options).unwrap();\n\n}\n\n\n","file_path":"tests/fs-tests.rs","rank":12,"score":249367.7980776208},{"content":"fn assert_layout_extension(root: &TempDir, layout_name: &str, config: &str) {\n\n root.child(\"ocfl_layout.json\")\n\n .assert(predicates::path::is_file())\n\n .assert(predicates::str::contains(format!(\n\n \"\\\"extension\\\": \\\"{}\\\"\",\n\n layout_name\n\n )));\n\n\n\n let layout_spec = format!(\"{}.md\", layout_name);\n\n root.child(&layout_spec)\n\n .assert(predicates::path::is_file())\n\n .assert(read_spec(&layout_spec));\n\n\n\n let extensions = root.child(\"extensions\");\n\n extensions.assert(predicates::path::is_dir());\n\n\n\n let layout_dir = extensions.child(layout_name);\n\n layout_dir.assert(predicates::path::is_dir());\n\n layout_dir\n\n .child(\"config.json\")\n\n .assert(predicates::path::is_file())\n\n .assert(config);\n\n}\n\n\n","file_path":"tests/fs-tests.rs","rank":14,"score":244942.85860128212},{"content":"fn create_rusoto_client(region: Region, profile: Option<&str>) -> RusotoS3Client {\n\n match profile {\n\n Some(profile) => {\n\n // Client setup code copied from Rusoto -- they don't make it easy to set the profile\n\n let credentials_provider =\n\n AutoRefreshingProvider::new(ChainProvider::with_profile_provider(\n\n ProfileProvider::with_default_credentials(profile)\n\n .expect(\"failed to create profile provider\"),\n\n ))\n\n .expect(\"failed to create credentials provider\");\n\n let dispatcher = HttpClient::new().expect(\"failed to create request dispatcher\");\n\n let client = Client::new_with(credentials_provider, dispatcher);\n\n RusotoS3Client::new_with_client(client, region)\n\n }\n\n None => RusotoS3Client::new(region),\n\n }\n\n}\n\n\n","file_path":"src/ocfl/store/s3.rs","rank":15,"score":233896.95147983322},{"content":"fn default_repo(root: impl AsRef<Path>) -> OcflRepo {\n\n OcflRepo::init_fs_repo(\n\n root,\n\n None,\n\n Some(StorageLayout::new(LayoutExtensionName::HashedNTupleLayout, None).unwrap()),\n\n )\n\n .unwrap()\n\n}\n\n\n","file_path":"tests/fs-tests.rs","rank":16,"score":233674.99551990448},{"content":"fn new_repo(root: impl AsRef<Path>) -> OcflRepo {\n\n OcflRepo::fs_repo(root, None).unwrap()\n\n}\n\n\n","file_path":"tests/validate-tests.rs","rank":17,"score":233646.52286568878},{"content":"fn official_error_test(name: &str) -> ObjectValidationResult {\n\n let repo = new_repo(official_error_root());\n\n repo.validate_object_at(name, true).unwrap()\n\n}\n\n\n","file_path":"tests/validate-tests.rs","rank":18,"score":232946.46921466803},{"content":"fn official_warn_test(name: &str) -> ObjectValidationResult {\n\n let repo = new_repo(official_warn_root());\n\n repo.validate_object_at(name, true).unwrap()\n\n}\n\n\n","file_path":"tests/validate-tests.rs","rank":19,"score":232946.46921466803},{"content":"fn official_valid_test(name: &str) -> ObjectValidationResult {\n\n let repo = new_repo(official_valid_root());\n\n repo.validate_object_at(name, true).unwrap()\n\n}\n\n\n","file_path":"tests/validate-tests.rs","rank":20,"score":232946.46921466803},{"content":"fn create_repo(config: &Config) -> Result<OcflRepo> {\n\n if is_s3(config) {\n\n #[cfg(not(feature = \"s3\"))]\n\n return Err(RocflError::General(\n\n \"This binary was not compiled with S3 support.\".to_string(),\n\n ));\n\n\n\n #[cfg(feature = \"s3\")]\n\n create_s3_repo(config)\n\n } else {\n\n OcflRepo::fs_repo(\n\n config.root.as_ref().unwrap(),\n\n config.staging_root.as_ref().map(Path::new),\n\n )\n\n }\n\n}\n\n\n","file_path":"src/cmd/mod.rs","rank":21,"score":232871.08014795612},{"content":"fn init_new_repo(root: impl AsRef<Path>, layout: Option<&StorageLayout>) -> Result<()> {\n\n let root = root.as_ref().to_path_buf();\n\n\n\n if root.exists() {\n\n if !root.is_dir() {\n\n return Err(RocflError::IllegalState(format!(\n\n \"Cannot create new repository. Storage root {} is not a directory\",\n\n canonical_str(root)\n\n )));\n\n }\n\n\n\n if fs::read_dir(&root)?.next().is_some() {\n\n return Err(RocflError::IllegalState(format!(\n\n \"Cannot create new repository. Storage root {} must be empty\",\n\n canonical_str(root)\n\n )));\n\n }\n\n }\n\n\n\n info!(\"Initializing OCFL storage root at {}\", canonical_str(&root));\n","file_path":"src/ocfl/store/fs.rs","rank":22,"score":231588.3930326305},{"content":"#[test]\n\n#[should_panic(expected = \"must be empty\")]\n\nfn fail_new_repo_creation_when_non_empty_root() {\n\n let root = TempDir::new().unwrap();\n\n\n\n root.child(\"file\").write_str(\"contents\").unwrap();\n\n\n\n let _repo = OcflRepo::init_fs_repo(\n\n root.path(),\n\n None,\n\n Some(StorageLayout::new(LayoutExtensionName::HashedNTupleLayout, None).unwrap()),\n\n )\n\n .unwrap();\n\n}\n\n\n","file_path":"tests/fs-tests.rs","rank":25,"score":231379.92921277176},{"content":"fn repo_test_path(name: &str) -> PathBuf {\n\n let mut path = validate_repo_root();\n\n path.push(\"custom\");\n\n path.push(\"repos\");\n\n path.push(name);\n\n path\n\n}\n\n\n","file_path":"tests/validate-tests.rs","rank":26,"score":229646.4112218346},{"content":"#[test]\n\nfn purge_should_remove_object_from_repo_and_staging() -> Result<()> {\n\n let root = TempDir::new().unwrap();\n\n let temp = TempDir::new().unwrap();\n\n\n\n let repo = default_repo(root.path());\n\n\n\n let object_id = \"purge me2\";\n\n\n\n create_example_object(object_id, &repo, &temp);\n\n\n\n repo.move_files_external(\n\n object_id,\n\n &vec![create_file(&temp, \"blah\", \"blah\").path()],\n\n \"blah\",\n\n )?;\n\n\n\n repo.purge_object(object_id)?;\n\n\n\n assert_obj_not_exists(&repo, object_id);\n\n assert_staged_obj_not_exists(&repo, object_id);\n\n\n\n validate_repo(&repo);\n\n Ok(())\n\n}\n\n\n","file_path":"tests/fs-tests.rs","rank":27,"score":229430.1333143084},{"content":"fn assert_staged_obj_not_exists(repo: &OcflRepo, object_id: &str) {\n\n match repo.get_staged_object(object_id) {\n\n Err(RocflError::NotFound(_)) => (),\n\n _ => panic!(\"Expected staged object '{}' to not be found\", object_id),\n\n }\n\n}\n\n\n","file_path":"tests/fs-tests.rs","rank":28,"score":228974.13519533892},{"content":"#[cfg(feature = \"s3\")]\n\nfn init_s3_repo(config: &Config, layout: Option<StorageLayout>) -> Result<OcflRepo> {\n\n let region = resolve_region(config)?;\n\n\n\n OcflRepo::init_s3_repo(\n\n region,\n\n config.bucket.as_ref().unwrap(),\n\n config.root.as_deref(),\n\n config.staging_root.as_ref().unwrap(),\n\n layout,\n\n config.profile.as_deref(),\n\n )\n\n}\n\n\n","file_path":"src/cmd/mod.rs","rank":29,"score":228498.3363536025},{"content":"fn resolve_config(args: &RocflArgs, mut config: Config) -> Config {\n\n if args.root.is_some() {\n\n config.root = args.root.clone();\n\n }\n\n if args.staging_root.is_some() {\n\n config.staging_root = args.staging_root.clone();\n\n }\n\n if args.bucket.is_some() {\n\n config.bucket = args.bucket.clone();\n\n }\n\n if args.region.is_some() {\n\n config.region = args.region.clone();\n\n }\n\n if args.endpoint.is_some() {\n\n config.endpoint = args.endpoint.clone();\n\n }\n\n if args.profile.is_some() {\n\n config.profile = args.profile.clone()\n\n }\n\n\n","file_path":"src/cmd/mod.rs","rank":30,"score":220827.99386428058},{"content":"pub fn no_warnings(result: &ObjectValidationResult) {\n\n assert!(\n\n result.warnings().is_empty(),\n\n \"Expected no warnings; found: {:?}\",\n\n result.warnings()\n\n )\n\n}\n\n\n","file_path":"tests/common/mod.rs","rank":31,"score":220457.7948561284},{"content":"pub fn no_errors(result: &ObjectValidationResult) {\n\n assert!(\n\n result.errors().is_empty(),\n\n \"Expected no errors; found: {:?}\",\n\n result.errors()\n\n )\n\n}\n\n\n","file_path":"tests/common/mod.rs","rank":32,"score":220457.7948561284},{"content":"#[test]\n\nfn create_new_hash_id_repo_empty_dir() -> Result<()> {\n\n let root = TempDir::new().unwrap();\n\n let temp = TempDir::new().unwrap();\n\n\n\n let repo = OcflRepo::init_fs_repo(\n\n root.path(),\n\n None,\n\n Some(StorageLayout::new(\n\n LayoutExtensionName::HashedNTupleObjectIdLayout,\n\n None,\n\n )?),\n\n )?;\n\n\n\n assert_storage_root(&root);\n\n assert_layout_extension(\n\n &root,\n\n \"0003-hash-and-id-n-tuple-storage-layout\",\n\n r#\"{\n\n \"extensionName\": \"0003-hash-and-id-n-tuple-storage-layout\",\n\n \"digestAlgorithm\": \"sha256\",\n","file_path":"tests/fs-tests.rs","rank":33,"score":218601.36750143618},{"content":"fn init_repo(prefix: &str, staging: impl AsRef<Path>, layout: Option<StorageLayout>) -> OcflRepo {\n\n OcflRepo::init_s3_repo(REGION, &bucket(), Some(prefix), staging, layout, None).unwrap()\n\n}\n\n\n","file_path":"tests/s3-tests.rs","rank":34,"score":217077.93031723518},{"content":"fn assert_file(s3_client: &S3Client, root: &str, path: &str, content: &str) {\n\n let key = format!(\"{}/{}\", root, path);\n\n let actual_content = get_content_with_key(s3_client, &key);\n\n assert_eq!(content, actual_content);\n\n}\n\n\n","file_path":"tests/s3-tests.rs","rank":35,"score":216713.72271682476},{"content":"fn delete_all(s3_client: &S3Client, root: &str) {\n\n tokio_test::block_on(async move {\n\n let list = s3_client\n\n .list_objects_v2(ListObjectsV2Request {\n\n bucket: bucket(),\n\n prefix: Some(format!(\"{}/\", root)),\n\n ..Default::default()\n\n })\n\n .await\n\n .unwrap();\n\n\n\n for object in list.contents.unwrap() {\n\n s3_client\n\n .delete_object(DeleteObjectRequest {\n\n bucket: bucket(),\n\n key: object.key.unwrap(),\n\n ..Default::default()\n\n })\n\n .await\n\n .unwrap();\n\n }\n\n });\n\n}\n\n\n","file_path":"tests/s3-tests.rs","rank":36,"score":216696.39565524005},{"content":"fn assert_file_exists(s3_client: &S3Client, root: &str, path: &str) {\n\n let key = format!(\"{}/{}\", root, path);\n\n let _ = tokio_test::block_on(s3_client.head_object(HeadObjectRequest {\n\n bucket: bucket(),\n\n key: key.clone(),\n\n ..Default::default()\n\n }))\n\n .expect(&format!(\"Expected {} to exist\", key));\n\n}\n\n\n","file_path":"tests/s3-tests.rs","rank":37,"score":214546.91858610002},{"content":"fn read_spec(name: &str) -> String {\n\n let mut path = PathBuf::from(env!(\"CARGO_MANIFEST_DIR\"));\n\n path.push(\"resources\");\n\n path.push(\"main\");\n\n path.push(\"specs\");\n\n path.push(name);\n\n fs::read_to_string(path).unwrap()\n\n}\n","file_path":"tests/s3-tests.rs","rank":38,"score":214105.8956377837},{"content":"fn assert_file_contains(s3_client: &S3Client, root: &str, path: &str, content: &str) {\n\n let key = format!(\"{}/{}\", root, path);\n\n let actual_content = get_content_with_key(s3_client, &key);\n\n assert!(\n\n actual_content.contains(content),\n\n \"Expected {} to contain {}. Found: {}\",\n\n key,\n\n content,\n\n actual_content\n\n );\n\n}\n\n\n","file_path":"tests/s3-tests.rs","rank":39,"score":213668.98370446474},{"content":"/// Runs the test if the environment is configured to run S3 tests, and removes all resources\n\n/// created during the test run, regardless of the test's outcome.\n\nfn run_s3_test(name: &str, test: impl FnOnce(S3Client, String, TempDir, TempDir) + UnwindSafe) {\n\n // let _ = env_logger::builder().is_test(true).filter_level(LevelFilter::Info).try_init();\n\n\n\n let staging = TempDir::new().unwrap();\n\n let temp = TempDir::new().unwrap();\n\n let prefix = s3_prefix();\n\n\n\n let result = panic::catch_unwind(|| test(S3Client::new(REGION), prefix.clone(), staging, temp));\n\n\n\n if let Err(e) = panic::catch_unwind(|| delete_all(&S3Client::new(REGION), &prefix)) {\n\n let s = e\n\n .downcast()\n\n .unwrap_or_else(|e| Box::new(format!(\"{:?}\", e)));\n\n eprintln!(\"Failed to cleanup test {}: {}\", name, s);\n\n }\n\n\n\n if let Err(e) = result {\n\n let s = e\n\n .downcast()\n\n .unwrap_or_else(|e| Box::new(format!(\"{:?}\", e)));\n\n panic!(\"Test {} failed: {}\", name, s);\n\n }\n\n}\n\n\n","file_path":"tests/s3-tests.rs","rank":40,"score":213580.08805915888},{"content":"/// Constructs a `RocflError::NotFound` error\n\npub fn not_found(object_id: &str, version_num: Option<VersionNum>) -> RocflError {\n\n match version_num {\n\n Some(version) => RocflError::NotFound(format!(\"Object {} version {}\", object_id, version)),\n\n None => RocflError::NotFound(format!(\"Object {}\", object_id)),\n\n }\n\n}\n\n\n","file_path":"src/ocfl/error.rs","rank":41,"score":212295.8401498741},{"content":"fn write_layout_config(root: impl AsRef<Path>, layout: &StorageLayout) -> Result<()> {\n\n let extension_name = layout.extension_name().to_string();\n\n\n\n let ocfl_layout = OcflLayout {\n\n extension: layout.extension_name(),\n\n description: format!(\"See specification document {}.md\", extension_name),\n\n };\n\n\n\n serde_json::to_writer_pretty(\n\n File::create(paths::ocfl_layout_path(root.as_ref()))?,\n\n &ocfl_layout,\n\n )?;\n\n\n\n let mut layout_ext_dir = paths::extensions_path(root.as_ref());\n\n layout_ext_dir.push(&extension_name);\n\n fs::create_dir_all(&layout_ext_dir)?;\n\n\n\n File::create(layout_ext_dir.join(EXTENSIONS_CONFIG_FILE))?.write_all(&layout.serialize()?)?;\n\n\n\n let extension_spec = match layout.extension_name() {\n","file_path":"src/ocfl/store/fs.rs","rank":42,"score":212277.75553087651},{"content":"/// If `content_dir` contains `.`, `..`, or `/`, then an `InvalidValue` error is returned.\n\npub fn validate_content_dir(content_dir: &str) -> Result<()> {\n\n if content_dir.eq(\".\") || content_dir.eq(\"..\") || content_dir.contains('/') {\n\n return Err(RocflError::InvalidValue(format!(\n\n \"The content directory cannot equal '.' or '..' and cannot contain a '/'. Found: {}\",\n\n content_dir\n\n )));\n\n }\n\n Ok(())\n\n}\n\n\n\n/// OCFL validation codes for errors: https://ocfl.io/1.0/spec/validation-codes.html\n\n#[allow(dead_code)]\n\n#[derive(Debug, EnumDisplay, EnumString, Copy, Clone, Eq, PartialEq)]\n\npub enum ErrorCode {\n\n E001,\n\n E002,\n\n E003,\n\n E004,\n\n E005,\n\n E006,\n","file_path":"src/ocfl/validate/mod.rs","rank":44,"score":211865.85848488176},{"content":"fn commit(object_id: &str, repo: &OcflRepo) {\n\n repo.commit(object_id, CommitMeta::new(), None, false)\n\n .unwrap();\n\n}\n\n\n","file_path":"tests/fs-tests.rs","rank":45,"score":210064.0129351823},{"content":"#[test]\n\n#[should_panic(expected = \"Cannot create new repository. Storage root must be empty\")]\n\nfn fail_create_new_repo_when_repo_already_exists() {\n\n panic_or_run_s3_test(\n\n \"fail_create_new_repo_when_repo_already_exists\",\n\n \"Cannot create new repository. Storage root must be empty\",\n\n |_s3_client: S3Client, prefix: String, staging: TempDir, _temp: TempDir| {\n\n let _ = default_repo(&prefix, staging.path());\n\n let _ = default_repo(&prefix, staging.path());\n\n },\n\n );\n\n}\n\n\n","file_path":"tests/s3-tests.rs","rank":46,"score":209445.19828216964},{"content":"#[test]\n\n#[should_panic(expected = \"Cannot create object s3-object because it already exists\")]\n\nfn fail_create_new_object_when_already_exists() {\n\n panic_or_run_s3_test(\n\n \"fail_create_new_object_when_already_exists\",\n\n \"Cannot create object s3-object because it already exists\",\n\n |_s3_client: S3Client, prefix: String, staging: TempDir, temp: TempDir| {\n\n let repo = default_repo(&prefix, staging.path());\n\n let object_id = \"s3-object\";\n\n\n\n repo.create_object(object_id, DigestAlgorithm::Sha256, \"content\", 0)\n\n .unwrap();\n\n repo.copy_files_external(\n\n object_id,\n\n &vec![create_file(&temp, \"test.txt\", \"testing\").path()],\n\n \"/\",\n\n false,\n\n )\n\n .unwrap();\n\n repo.commit(object_id, CommitMeta::new(), None, false)\n\n .unwrap();\n\n\n\n repo.create_object(object_id, DigestAlgorithm::Sha256, \"content\", 0)\n\n .unwrap();\n\n },\n\n );\n\n}\n\n\n","file_path":"tests/s3-tests.rs","rank":47,"score":203281.10448958183},{"content":"fn assert_obj_not_exists(repo: &OcflRepo, object_id: &str) {\n\n match repo.get_object(object_id, VersionRef::Head) {\n\n Err(RocflError::NotFound(_)) => (),\n\n _ => panic!(\"Expected object '{}' to not be found\", object_id),\n\n }\n\n}\n\n\n","file_path":"tests/fs-tests.rs","rank":48,"score":201960.12398949778},{"content":"#[test]\n\nfn copy_files_into_new_object() -> Result<()> {\n\n let root = TempDir::new().unwrap();\n\n let temp = TempDir::new().unwrap();\n\n\n\n let repo = default_repo(root.path());\n\n\n\n let object_id = \"foobar\";\n\n\n\n assert_staged_obj_count(&repo, 0);\n\n repo.create_object(object_id, DigestAlgorithm::Sha512, \"content\", 0)?;\n\n assert_staged_obj_count(&repo, 1);\n\n\n\n let staged: Vec<ObjectVersionDetails> = repo.list_staged_objects(None)?.flatten().collect();\n\n assert_eq!(object_id, staged.first().unwrap().id);\n\n\n\n create_file(&temp, \"test.txt\", \"testing\");\n\n repo.copy_files_external(\n\n object_id,\n\n &vec![temp.child(\"test.txt\").path()],\n\n \"test.txt\",\n","file_path":"tests/fs-tests.rs","rank":49,"score":199900.318006039},{"content":"#[test]\n\nfn move_files_into_new_object() -> Result<()> {\n\n let root = TempDir::new().unwrap();\n\n let temp = TempDir::new().unwrap();\n\n\n\n let repo = default_repo(root.path());\n\n\n\n let object_id = \"move files\";\n\n\n\n repo.create_object(object_id, DigestAlgorithm::Sha512, \"content\", 0)?;\n\n\n\n create_file(&temp, \"test.txt\", \"testing\");\n\n create_dirs(&temp, \"nested/dir\");\n\n create_file(&temp, \"nested/1.txt\", \"File 1\");\n\n create_file(&temp, \"nested/dir/2.txt\", \"File 2\");\n\n create_file(&temp, \"nested/dir/3.txt\", \"File 3\");\n\n\n\n repo.move_files_external(\n\n object_id,\n\n &vec![\n\n temp.child(\"test.txt\").path(),\n","file_path":"tests/fs-tests.rs","rank":50,"score":199900.31800603896},{"content":"#[test]\n\nfn commit_should_remove_staged_object() -> Result<()> {\n\n let root = TempDir::new().unwrap();\n\n let temp = TempDir::new().unwrap();\n\n\n\n let repo = default_repo(root.path());\n\n\n\n let object_id = \"commit meta\";\n\n\n\n repo.create_object(object_id, DigestAlgorithm::Sha256, \"content\", 0)?;\n\n\n\n repo.move_files_external(\n\n object_id,\n\n &vec![create_file(&temp, \"blah\", \"blah\").path()],\n\n \"blah\",\n\n )?;\n\n\n\n commit(object_id, &repo);\n\n\n\n let _obj = repo.get_object(object_id, VersionRef::Head)?;\n\n\n\n assert_staged_obj_not_exists(&repo, object_id);\n\n\n\n validate_repo(&repo);\n\n Ok(())\n\n}\n\n\n","file_path":"tests/fs-tests.rs","rank":51,"score":199889.79540873485},{"content":"#[test]\n\nfn list_repo_with_invalid_objects() -> Result<()> {\n\n let repo_root = create_repo_root(\"invalid\");\n\n let repo = OcflRepo::fs_repo(&repo_root, None)?;\n\n\n\n let object_root = repo_root\n\n .join(\"925\")\n\n .join(\"0b9\")\n\n .join(\"912\")\n\n .join(\"9250b9912ee91d6b46e23299459ecd6eb8154451d62558a3a0a708a77926ad04\");\n\n\n\n let iter = repo.list_objects(None)?;\n\n\n\n for object in iter {\n\n if let Ok(object) = object {\n\n assert_eq!(\n\n object,\n\n ObjectVersionDetails {\n\n id: \"o2\".to_string(),\n\n object_root: object_root.display().to_string(),\n\n digest_algorithm: DigestAlgorithm::Sha512,\n\n version_details: o2_v3_details()\n\n }\n\n );\n\n }\n\n }\n\n\n\n Ok(())\n\n}\n\n\n","file_path":"tests/fs-tests.rs","rank":52,"score":199349.44231862767},{"content":"#[test]\n\nfn purge_should_remove_object_from_repo() -> Result<()> {\n\n let root = TempDir::new().unwrap();\n\n let temp = TempDir::new().unwrap();\n\n\n\n let repo = default_repo(root.path());\n\n\n\n let object_id = \"purge me\";\n\n\n\n create_example_object(object_id, &repo, &temp);\n\n\n\n repo.purge_object(object_id)?;\n\n\n\n assert_obj_not_exists(&repo, object_id);\n\n\n\n validate_repo(&repo);\n\n Ok(())\n\n}\n\n\n","file_path":"tests/fs-tests.rs","rank":53,"score":199349.44231862767},{"content":"/// Walks up the directory hierarchy deleting directories until it finds a non-empty directory.\n\npub fn clean_dirs_up(start_dir: impl AsRef<Path>) -> Result<()> {\n\n let mut current = start_dir.as_ref();\n\n\n\n while dir_is_empty(current)? {\n\n fs::remove_dir(current)?;\n\n current = current.parent().unwrap();\n\n }\n\n\n\n Ok(())\n\n}\n","file_path":"src/ocfl/util.rs","rank":54,"score":198900.58154427836},{"content":"/// Walks down the directory hierarchy deleting all non-empty directories\n\npub fn clean_dirs_down(start_dir: impl AsRef<Path>) -> Result<()> {\n\n let start_dir = start_dir.as_ref();\n\n\n\n for entry in WalkDir::new(start_dir).contents_first(true) {\n\n let path = entry?;\n\n if path.file_type().is_dir() && dir_is_empty(path.path())? {\n\n fs::remove_dir(path.path())?;\n\n }\n\n }\n\n\n\n Ok(())\n\n}\n\n\n","file_path":"src/ocfl/util.rs","rank":55,"score":198900.41761850094},{"content":"#[test]\n\nfn get_staged_object_file_when_exists_in_staged_version() -> Result<()> {\n\n let root = TempDir::new().unwrap();\n\n let temp = TempDir::new().unwrap();\n\n\n\n let repo = default_repo(root.path());\n\n\n\n let object_id = \"get file\";\n\n\n\n create_example_object(object_id, &repo, &temp);\n\n\n\n repo.move_files_external(\n\n object_id,\n\n &vec![create_file(&temp, \"blah\", \"blah\").path()],\n\n \"blah\",\n\n )?;\n\n\n\n let mut out: Vec<u8> = Vec::new();\n\n\n\n repo.get_staged_object_file(object_id, &lpath(\"blah\"), &mut out)?;\n\n\n\n assert_eq!(\"blah\", String::from_utf8(out).unwrap());\n\n\n\n validate_repo(&repo);\n\n Ok(())\n\n}\n\n\n","file_path":"tests/fs-tests.rs","rank":56,"score":198650.49722790415},{"content":"fn rocfl(path: impl AsRef<Path>, command: &str) -> Command {\n\n let mut rocfl = Command::cargo_bin(\"rocfl\").unwrap();\n\n rocfl\n\n .arg(\"-S\")\n\n .arg(\"-r\")\n\n .arg(path.as_ref().to_string_lossy().as_ref())\n\n .arg(command);\n\n rocfl\n\n}\n\n\n","file_path":"tests/cli-tests.rs","rank":57,"score":198354.8925007808},{"content":"pub fn error_count(expected: usize, result: &ObjectValidationResult) {\n\n assert_eq!(\n\n expected,\n\n result.errors().len(),\n\n \"Expected {} errors; found {}: {:?}\",\n\n expected,\n\n result.errors().len(),\n\n result.errors()\n\n )\n\n}\n\n\n","file_path":"tests/common/mod.rs","rank":58,"score":196195.9274396057},{"content":"pub fn warning_count(expected: usize, result: &ObjectValidationResult) {\n\n assert_eq!(\n\n expected,\n\n result.warnings().len(),\n\n \"Expected {} warnings; found {}: {:?}\",\n\n expected,\n\n result.warnings().len(),\n\n result.warnings()\n\n )\n\n}\n\n\n","file_path":"tests/common/mod.rs","rank":59,"score":196195.9274396057},{"content":"#[test]\n\nfn get_object_when_exists_using_layout() -> Result<()> {\n\n let repo_root = create_repo_root(\"multiple-objects-with-layout\");\n\n let repo = OcflRepo::fs_repo(&repo_root, None)?;\n\n\n\n let object = repo.get_object(\"o2\", VersionRef::Head)?;\n\n\n\n let object_root = repo_root\n\n .join(\"925\")\n\n .join(\"0b9\")\n\n .join(\"912\")\n\n .join(\"9250b9912ee91d6b46e23299459ecd6eb8154451d62558a3a0a708a77926ad04\");\n\n\n\n assert_eq!(\n\n object,\n\n ObjectVersion {\n\n id: \"o2\".to_string(),\n\n object_root: object_root.to_string_lossy().to_string(),\n\n digest_algorithm: DigestAlgorithm::Sha512,\n\n version_details: o2_v3_details(),\n\n state: hashmap! {\n","file_path":"tests/fs-tests.rs","rank":60,"score":195085.18733471652},{"content":"#[test]\n\nfn create_new_repo_empty_dir() -> Result<()> {\n\n let root = TempDir::new().unwrap();\n\n let temp = TempDir::new().unwrap();\n\n\n\n let repo = OcflRepo::init_fs_repo(\n\n root.path(),\n\n None,\n\n Some(StorageLayout::new(\n\n LayoutExtensionName::HashedNTupleLayout,\n\n None,\n\n )?),\n\n )?;\n\n\n\n assert_storage_root(&root);\n\n assert_layout_extension(\n\n &root,\n\n \"0004-hashed-n-tuple-storage-layout\",\n\n r#\"{\n\n \"extensionName\": \"0004-hashed-n-tuple-storage-layout\",\n\n \"digestAlgorithm\": \"sha256\",\n","file_path":"tests/fs-tests.rs","rank":61,"score":194740.86879585776},{"content":"/// # v1\n\n///\n\n/// - a/file1.txt\n\n/// - a/b/file2.txt\n\n/// - a/b/file3.txt\n\n/// - a/b/c/file4.txt\n\n/// - a/d/e/file5.txt\n\n/// - a/f/file6.txt\n\n///\n\n/// # v2\n\n///\n\n/// - a/file1.txt\n\n/// - a/b/file2.txt\n\n/// - a/d/e/file5.txt\n\n/// - a/f/file6.txt\n\n///\n\n///# v3\n\n///\n\n/// - file3.txt\n\n/// - a/file1.txt\n\n/// - a/b/file2.txt\n\n/// - a/d/e/file5.txt\n\n/// - a/f/file6.txt\n\n/// - something/file1.txt\n\n/// - something/new.txt\n\n///\n\n/// # v4\n\n///\n\n/// - file3.txt\n\n/// - a/file1.txt\n\n/// - a/file5.txt\n\n/// - a/b/file2.txt\n\n/// - a/f/file6.txt (updated)\n\n/// - something/file1.txt\n\n/// - something/new.txt\n\nfn create_example_object(object_id: &str, repo: &OcflRepo, temp: &TempDir) {\n\n repo.create_object(object_id, DigestAlgorithm::Sha256, \"content\", 0)\n\n .unwrap();\n\n\n\n create_dirs(temp, \"a/b/c\");\n\n create_dirs(temp, \"a/d/e\");\n\n create_dirs(temp, \"a/f\");\n\n\n\n create_file(temp, \"a/file1.txt\", \"File One\");\n\n create_file(temp, \"a/b/file2.txt\", \"File Two\");\n\n create_file(temp, \"a/b/file3.txt\", \"File Three\");\n\n create_file(temp, \"a/b/c/file4.txt\", \"File Four\");\n\n create_file(temp, \"a/d/e/file5.txt\", \"File Five\");\n\n create_file(temp, \"a/f/file6.txt\", \"File Six\");\n\n\n\n repo.move_files_external(object_id, &vec![temp.child(\"a\").path()], \"/\")\n\n .unwrap();\n\n\n\n commit(object_id, &repo);\n\n\n","file_path":"tests/fs-tests.rs","rank":62,"score":193834.3960114414},{"content":"fn create_simple_object(object_id: &str, repo: &OcflRepo, temp: &TempDir) {\n\n repo.create_object(object_id, DigestAlgorithm::Sha512, \"content\", 0)\n\n .unwrap();\n\n\n\n temp.child(\"test.txt\").write_str(\"testing\").unwrap();\n\n repo.copy_files_external(\n\n object_id,\n\n &vec![temp.child(\"test.txt\").path()],\n\n \"test.txt\",\n\n false,\n\n )\n\n .unwrap();\n\n\n\n commit(object_id, &repo);\n\n}\n\n\n","file_path":"tests/fs-tests.rs","rank":63,"score":193830.38380080965},{"content":"/// Returns true if the specified directory does not contain any files\n\npub fn dir_is_empty(dir: impl AsRef<Path>) -> Result<bool> {\n\n Ok(fs::read_dir(dir)?.next().is_none())\n\n}\n\n\n","file_path":"src/ocfl/util.rs","rank":64,"score":193659.70140991977},{"content":"fn init_new_repo(s3_client: &S3Client, layout: Option<&StorageLayout>) -> Result<()> {\n\n if !s3_client.list_dir(\"\")?.is_empty() {\n\n return Err(RocflError::IllegalState(\n\n \"Cannot create new repository. Storage root must be empty\".to_string(),\n\n ));\n\n }\n\n\n\n info!(\n\n \"Initializing OCFL storage root in bucket {} under prefix {}\",\n\n s3_client.bucket, s3_client.prefix\n\n );\n\n\n\n s3_client.put_object_bytes(\n\n REPO_NAMASTE_FILE,\n\n Bytes::from(ROOT_NAMASTE_CONTENT.as_bytes()),\n\n Some(TYPE_PLAIN),\n\n )?;\n\n\n\n s3_client.put_object_bytes(\n\n OCFL_SPEC_FILE,\n","file_path":"src/ocfl/store/s3.rs","rank":65,"score":193504.6692003283},{"content":"pub fn has_warnings(result: &ObjectValidationResult, expected_warnings: &[ValidationWarning]) {\n\n for expected in expected_warnings {\n\n assert!(\n\n result.warnings().contains(expected),\n\n \"Expected warnings to contain {:?}. Found: {:?}\",\n\n expected,\n\n result.warnings()\n\n );\n\n }\n\n assert_eq!(\n\n expected_warnings.len(),\n\n result.warnings().len(),\n\n \"Expected {} warnings; found {}: {:?}\",\n\n expected_warnings.len(),\n\n result.warnings().len(),\n\n result.warnings()\n\n )\n\n}\n\n\n","file_path":"tests/common/mod.rs","rank":66,"score":192478.014905773},{"content":"pub fn has_errors(result: &ObjectValidationResult, expected_errors: &[ValidationError]) {\n\n for expected in expected_errors {\n\n assert!(\n\n result.errors().contains(expected),\n\n \"Expected errors to contain {:?}. Found: {:?}\",\n\n expected,\n\n result.errors()\n\n );\n\n }\n\n assert_eq!(\n\n expected_errors.len(),\n\n result.errors().len(),\n\n \"Expected {} errors; found {}: {:?}\",\n\n expected_errors.len(),\n\n result.errors().len(),\n\n result.errors()\n\n )\n\n}\n\n\n","file_path":"tests/common/mod.rs","rank":67,"score":192478.014905773},{"content":"/// Trims all lead and trailing slashes from the path\n\npub fn trim_slashes(path: &str) -> &str {\n\n trim_trailing_slashes(trim_leading_slashes(path))\n\n}\n","file_path":"src/ocfl/util.rs","rank":68,"score":190767.54048391624},{"content":"#[test]\n\nfn create_new_flat_repo_empty_dir() -> Result<()> {\n\n let root = TempDir::new().unwrap();\n\n let temp = TempDir::new().unwrap();\n\n\n\n let repo = OcflRepo::init_fs_repo(\n\n root.path(),\n\n None,\n\n Some(StorageLayout::new(\n\n LayoutExtensionName::FlatDirectLayout,\n\n None,\n\n )?),\n\n )?;\n\n\n\n assert_storage_root(&root);\n\n assert_layout_extension(\n\n &root,\n\n \"0002-flat-direct-storage-layout\",\n\n r#\"{\n\n \"extensionName\": \"0002-flat-direct-storage-layout\"\n\n}\"#,\n","file_path":"tests/fs-tests.rs","rank":69,"score":190218.3498617914},{"content":"/// Trims all trailing slashes from the path\n\npub fn trim_trailing_slashes(path: &str) -> &str {\n\n path.trim_end_matches('/')\n\n}\n\n\n","file_path":"src/ocfl/util.rs","rank":70,"score":187465.46683819656},{"content":"/// Trims all trailing slashes from the path\n\npub fn trim_leading_slashes(path: &str) -> &str {\n\n path.trim_start_matches('/')\n\n}\n\n\n","file_path":"src/ocfl/util.rs","rank":71,"score":187465.46683819656},{"content":"/// Identical to `fs::remove_file()` except `NotFound` errors are ignored\n\npub fn remove_file_ignore_not_found(path: impl AsRef<Path>) -> io::Result<()> {\n\n if let Err(e) = fs::remove_file(path) {\n\n if e.kind() != ErrorKind::NotFound {\n\n return Err(e);\n\n }\n\n }\n\n Ok(())\n\n}\n\n\n","file_path":"src/ocfl/util.rs","rank":72,"score":186375.18347144584},{"content":"#[test]\n\nfn get_staged_object_file_when_exists_in_prior_version() -> Result<()> {\n\n let root = TempDir::new().unwrap();\n\n let temp = TempDir::new().unwrap();\n\n\n\n let repo = default_repo(root.path());\n\n\n\n let object_id = \"get file\";\n\n\n\n create_example_object(object_id, &repo, &temp);\n\n\n\n repo.move_files_external(\n\n object_id,\n\n &vec![create_file(&temp, \"blah\", \"blah\").path()],\n\n \"blah\",\n\n )?;\n\n\n\n let mut out: Vec<u8> = Vec::new();\n\n\n\n repo.get_staged_object_file(object_id, &lpath(\"a/file1.txt\"), &mut out)?;\n\n\n\n assert_eq!(\"File One\", String::from_utf8(out).unwrap());\n\n\n\n validate_repo(&repo);\n\n Ok(())\n\n}\n\n\n","file_path":"tests/fs-tests.rs","rank":73,"score":186262.31151256524},{"content":"#[test]\n\nfn create_new_repo_empty_dir_custom_layout() -> Result<()> {\n\n let root = TempDir::new().unwrap();\n\n let temp = TempDir::new().unwrap();\n\n\n\n let layout = r#\"{\n\n \"extensionName\": \"0004-hashed-n-tuple-storage-layout\",\n\n \"digestAlgorithm\": \"sha512\",\n\n \"tupleSize\": 5,\n\n \"numberOfTuples\": 2,\n\n \"shortObjectRoot\": true\n\n}\"#;\n\n\n\n let repo = OcflRepo::init_fs_repo(\n\n root.path(),\n\n None,\n\n Some(StorageLayout::new(\n\n LayoutExtensionName::HashedNTupleLayout,\n\n Some(layout.as_bytes()),\n\n )?),\n\n )?;\n","file_path":"tests/fs-tests.rs","rank":74,"score":185984.27079025412},{"content":"#[test]\n\nfn create_new_object() {\n\n skip_or_run_s3_test(\n\n \"create_new_object\",\n\n |s3_client: S3Client, prefix: String, staging: TempDir, temp: TempDir| {\n\n let repo = default_repo(&prefix, staging.path());\n\n let object_id = \"s3-object\";\n\n\n\n repo.create_object(object_id, DigestAlgorithm::Sha256, \"content\", 0)\n\n .unwrap();\n\n repo.copy_files_external(\n\n object_id,\n\n &vec![create_file(&temp, \"test.txt\", \"testing\").path()],\n\n \"/\",\n\n false,\n\n )\n\n .unwrap();\n\n repo.commit(object_id, CommitMeta::new(), None, false)\n\n .unwrap();\n\n\n\n let object = repo.get_object(object_id, VersionRef::Head).unwrap();\n","file_path":"tests/s3-tests.rs","rank":75,"score":184019.23900004878},{"content":"fn validate_non_conflicting<F>(paths: &HashSet<&str>, error: F)\n\nwhere\n\n F: Fn(&str, &str),\n\n{\n\n for path in paths {\n\n let mut part = *path;\n\n while let Some(index) = part.rfind('/') {\n\n part = &part[0..index];\n\n if paths.contains(part) {\n\n error(path, part);\n\n break;\n\n }\n\n }\n\n }\n\n}\n\n\n","file_path":"src/ocfl/validate/serde.rs","rank":76,"score":183610.61979186494},{"content":"#[test]\n\n#[should_panic(expected = \"Cannot create object object 2 because an object already exists at\")]\n\nfn fail_object_commit_when_no_known_storage_layout_and_root_specified_and_obj_already_there() {\n\n let root = TempDir::new().unwrap();\n\n let temp = TempDir::new().unwrap();\n\n let repo = OcflRepo::fs_repo(root.path(), None).unwrap();\n\n\n\n let object_id = \"custom_layout\";\n\n let object_root = \"random/path/to/object\";\n\n\n\n repo.create_object(object_id, DigestAlgorithm::Sha256, \"content\", 0)\n\n .unwrap();\n\n\n\n repo.copy_files_external(\n\n object_id,\n\n &vec![create_file(&temp, \"test.txt\", \"testing\").path()],\n\n \"test.txt\",\n\n false,\n\n )\n\n .unwrap();\n\n\n\n repo.commit(object_id, CommitMeta::new(), Some(object_root), false)\n","file_path":"tests/fs-tests.rs","rank":77,"score":182874.08302784886},{"content":"pub fn no_warnings_storage(result: &StorageValidationResult) {\n\n assert!(\n\n result.warnings().is_empty(),\n\n \"Expected no warnings; found: {:?}\",\n\n result.warnings()\n\n )\n\n}\n\n\n","file_path":"tests/common/mod.rs","rank":78,"score":182462.9196899529},{"content":"pub fn no_errors_storage(result: &StorageValidationResult) {\n\n assert!(\n\n result.errors().is_empty(),\n\n \"Expected no errors; found: {:?}\",\n\n result.errors()\n\n )\n\n}\n","file_path":"tests/common/mod.rs","rank":79,"score":182462.9196899529},{"content":"/// Returns the path to the root of the staging extension\n\npub fn staging_extension_path<P>(storage_root: P) -> PathBuf\n\nwhere\n\n P: AsRef<Path>,\n\n{\n\n let mut extensions = extensions_path(storage_root);\n\n extensions.push(ROCFL_STAGING_EXTENSION);\n\n extensions\n\n}\n\n\n","file_path":"src/ocfl/paths.rs","rank":80,"score":181140.12824217117},{"content":"fn is_s3(config: &Config) -> bool {\n\n config.bucket.is_some()\n\n}\n\n\n","file_path":"src/cmd/mod.rs","rank":81,"score":180112.91354345798},{"content":"fn defaulted_str<'a>(value: &'a Option<String>, default: &'a str) -> &'a str {\n\n match value {\n\n Some(value) => value.as_ref(),\n\n None => default,\n\n }\n\n}\n","file_path":"src/cmd/diff.rs","rank":82,"score":179314.4092117156},{"content":"/// Changes `\\\\` to `/` on Windows\n\npub fn convert_backslash_to_forward(path: &str) -> Cow<str> {\n\n if BACKSLASH_SEPARATOR && path.contains('\\\\') {\n\n return Cow::Owned(path.replace('\\\\', \"/\"));\n\n }\n\n path.into()\n\n}\n\n\n","file_path":"src/ocfl/util.rs","rank":83,"score":178783.50778988205},{"content":"/// Changes `/` to `\\` on Windows\n\npub fn convert_forwardslash_to_back(path: &str) -> Cow<str> {\n\n if BACKSLASH_SEPARATOR && path.contains('/') {\n\n return Cow::Owned(path.replace('/', \"\\\\\"));\n\n }\n\n path.into()\n\n}\n\n\n","file_path":"src/ocfl/util.rs","rank":84,"score":178783.50778988205},{"content":"#[test]\n\n#[should_panic(expected = \"Expected object to exist at\")]\n\nfn fail_when_incorrect_object_in_root() {\n\n let root = TempDir::new().unwrap();\n\n let temp = TempDir::new().unwrap();\n\n\n\n let repo = OcflRepo::init_fs_repo(\n\n root.path(),\n\n None,\n\n Some(StorageLayout::new(LayoutExtensionName::FlatDirectLayout, None).unwrap()),\n\n )\n\n .unwrap();\n\n\n\n let object_id_1 = \"original\";\n\n let object_id_2 = \"different\";\n\n\n\n repo.create_object(object_id_1, DigestAlgorithm::Sha256, \"content\", 0)\n\n .unwrap();\n\n repo.move_files_external(\n\n object_id_1,\n\n &vec![create_file(&temp, \"file1.txt\", \"one\").path()],\n\n \"/\",\n","file_path":"tests/fs-tests.rs","rank":85,"score":178707.6150880159},{"content":"fn read_spec(name: &str) -> String {\n\n let mut path = PathBuf::from(env!(\"CARGO_MANIFEST_DIR\"));\n\n path.push(\"resources\");\n\n path.push(\"main\");\n\n path.push(\"specs\");\n\n path.push(name);\n\n fs::read_to_string(path).unwrap()\n\n}\n\n\n","file_path":"tests/fs-tests.rs","rank":86,"score":178335.5375745715},{"content":"fn bucket() -> String {\n\n env::var(BUCKET_VAR).unwrap()\n\n}\n\n\n","file_path":"tests/s3-tests.rs","rank":87,"score":177598.73012218863},{"content":"/// Joins two string path parts, inserting at `/` if needed\n\npub fn join(part1: &str, part2: &str) -> String {\n\n let mut joined = match part1.ends_with('/') {\n\n true => part1[..part1.len() - 1].to_string(),\n\n false => part1.to_string(),\n\n };\n\n\n\n if !part2.is_empty() {\n\n if (!joined.is_empty() || part1 == \"/\") && !part2.starts_with('/') {\n\n joined.push('/');\n\n }\n\n joined.push_str(part2);\n\n }\n\n\n\n joined\n\n}\n\n\n","file_path":"src/ocfl/paths.rs","rank":88,"score":177102.8098935499},{"content":"fn create_logical_dirs(object: &ObjectVersion) -> HashSet<LogicalPath> {\n\n let mut dirs = HashSet::with_capacity(object.state.len());\n\n\n\n dirs.insert(\"\".try_into().unwrap());\n\n\n\n for path in object.state.keys() {\n\n let mut parent = path.parent();\n\n while !parent.is_empty() {\n\n let next = parent.parent();\n\n dirs.insert(parent);\n\n parent = next;\n\n }\n\n }\n\n\n\n dirs\n\n}\n\n\n","file_path":"src/cmd/list.rs","rank":89,"score":176397.48808580218},{"content":"pub fn root_warning(code: WarnCode, text: &str) -> ValidationWarning {\n\n ValidationWarning::new(ProblemLocation::ObjectRoot, code, text.to_string())\n\n}\n\n\n","file_path":"tests/common/mod.rs","rank":90,"score":176223.04353901144},{"content":"pub fn root_error(code: ErrorCode, text: &str) -> ValidationError {\n\n ValidationError::new(ProblemLocation::ObjectRoot, code, text.to_string())\n\n}\n\n\n","file_path":"tests/common/mod.rs","rank":91,"score":176223.04353901144},{"content":"fn missing_version_field(field: &str, version: &str, result: &ParseValidationResult) {\n\n result.error(\n\n ErrorCode::E048,\n\n format!(\n\n \"Inventory version '{}' is missing required key '{}'\",\n\n version, field\n\n ),\n\n );\n\n}\n\n\n","file_path":"src/ocfl/validate/serde.rs","rank":92,"score":174976.97617412274},{"content":"fn duplicate_version_field(field: &str, version: &str, result: &ParseValidationResult) {\n\n result.error(\n\n ErrorCode::E033,\n\n format!(\n\n \"Inventory version '{}' contains duplicate key '{}'\",\n\n version, field\n\n ),\n\n );\n\n}\n\n\n","file_path":"src/ocfl/validate/serde.rs","rank":93,"score":174976.97617412274},{"content":"fn unknown_version_field(field: &str, version: &str, result: &ParseValidationResult) {\n\n result.error(\n\n ErrorCode::E102,\n\n format!(\n\n \"Inventory version '{}' contains unknown key '{}'\",\n\n version, field\n\n ),\n\n );\n\n}\n\n\n","file_path":"src/ocfl/validate/serde.rs","rank":94,"score":174976.97617412274},{"content":"#[test]\n\nfn create_object_with_non_standard_config() {\n\n let root = TempDir::new().unwrap();\n\n let temp = TempDir::new().unwrap();\n\n\n\n let repo = default_repo(root.path());\n\n\n\n let object_id = \"non-standard\";\n\n\n\n assert_staged_obj_count(&repo, 0);\n\n repo.create_object(object_id, DigestAlgorithm::Sha256, \"content-dir\", 5)\n\n .unwrap();\n\n assert_staged_obj_count(&repo, 1);\n\n\n\n create_file(&temp, \"test.txt\", \"testing\");\n\n\n\n repo.copy_files_external(\n\n object_id,\n\n &vec![temp.child(\"test.txt\").path()],\n\n \"test.txt\",\n\n false,\n","file_path":"tests/fs-tests.rs","rank":95,"score":173580.4199686878},{"content":"#[test]\n\nfn create_new_repo_empty_dir() {\n\n skip_or_run_s3_test(\n\n \"create_new_repo_empty_dir\",\n\n |s3_client: S3Client, prefix: String, staging: TempDir, temp: TempDir| {\n\n let repo = default_repo(&prefix, staging.path());\n\n\n\n assert_file(&s3_client, &prefix, \"0=ocfl_1.0\", \"ocfl_1.0\\n\");\n\n assert_file(\n\n &s3_client,\n\n &prefix,\n\n \"ocfl_1.0.txt\",\n\n &read_spec(\"ocfl_1.0.txt\"),\n\n );\n\n assert_storage_layout(\n\n &s3_client,\n\n &prefix,\n\n \"0004-hashed-n-tuple-storage-layout\",\n\n DEFAULT_LAYOUT,\n\n );\n\n\n","file_path":"tests/s3-tests.rs","rank":96,"score":172891.26101943158},{"content":"fn missing_version_field_warn(field: &str, version: &str, result: &ParseValidationResult) {\n\n result.warn(\n\n WarnCode::W007,\n\n format!(\n\n \"Inventory version '{}' is missing recommended key '{}'\",\n\n version, field\n\n ),\n\n );\n\n}\n\n\n\n#[cfg(test)]\n\nmod tests {\n\n use crate::ocfl::validate::serde::parse;\n\n use crate::ocfl::validate::{ParseResult, ParseValidationResult};\n\n use crate::ocfl::{ErrorCode, ProblemLocation, ValidationError, ValidationWarning, WarnCode};\n\n\n\n #[test]\n\n fn head_wrong_type() {\n\n let json = r###\"{\n\n \"id\": \"urn:example:test\",\n","file_path":"src/ocfl/validate/serde.rs","rank":97,"score":172584.25387953207},{"content":"fn edit_config() -> Result<()> {\n\n match config::config_path() {\n\n Some(config_path) => {\n\n if !config_path.exists() {\n\n fs::create_dir_all(config_path.parent().unwrap())?;\n\n let mut file = fs::File::create(&config_path)?;\n\n write!(\n\n file,\n\n \"{}\",\n\n include_str!(\"../../resources/main/files/config.toml\")\n\n )?;\n\n }\n\n\n\n edit::edit_file(&config_path)?;\n\n Ok(())\n\n }\n\n None => Err(RocflError::General(\n\n \"Failed to find rocfl config\".to_string(),\n\n )),\n\n }\n\n}\n","file_path":"src/cmd/mod.rs","rank":98,"score":171996.26284402178},{"content":"#[test]\n\nfn list_all_objects() -> Result<()> {\n\n let repo_root = create_repo_root(\"multiple-objects\");\n\n let repo = OcflRepo::fs_repo(&repo_root, None)?;\n\n\n\n let mut objects: Vec<ObjectVersionDetails> = repo.list_objects(None)?.flatten().collect();\n\n\n\n sort_obj_details(&mut objects);\n\n\n\n assert_eq!(3, objects.len());\n\n\n\n assert_eq!(\n\n objects.remove(0),\n\n ObjectVersionDetails {\n\n id: \"o1\".to_string(),\n\n object_root: repo_root\n\n .join(\"235\")\n\n .join(\"2da\")\n\n .join(\"728\")\n\n .join(\"2352da7280f1decc3acf1ba84eb945c9fc2b7b541094e1d0992dbffd1b6664cc\")\n\n .to_string_lossy()\n","file_path":"tests/fs-tests.rs","rank":99,"score":171810.13127900875}],"string":"[\n {\n \"content\": \"fn default_values(mut config: Config) -> Result<Config> {\\n\\n if is_s3(&config) {\\n\\n if config.staging_root.is_none() {\\n\\n config.staging_root = Some(config::s3_staging_path(&config)?);\\n\\n }\\n\\n } else if config.root.is_none() {\\n\\n config.root = Some(\\\".\\\".to_string());\\n\\n }\\n\\n\\n\\n Ok(config)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/cmd/mod.rs\",\n \"rank\": 1,\n \"score\": 283411.5315744112\n },\n {\n \"content\": \"fn assert_storage_layout(s3_client: &S3Client, root: &str, layout_name: &str, config: &str) {\\n\\n assert_file_contains(\\n\\n s3_client,\\n\\n root,\\n\\n \\\"ocfl_layout.json\\\",\\n\\n &format!(\\\"\\\\\\\"extension\\\\\\\": \\\\\\\"{}\\\\\\\"\\\", layout_name),\\n\\n );\\n\\n\\n\\n let layout_spec = format!(\\\"{}.md\\\", layout_name);\\n\\n assert_file(s3_client, root, &layout_spec, &read_spec(&layout_spec));\\n\\n\\n\\n assert_file(\\n\\n s3_client,\\n\\n root,\\n\\n &format!(\\\"extensions/{}/config.json\\\", layout_name),\\n\\n config,\\n\\n );\\n\\n}\\n\\n\\n\",\n \"file_path\": \"tests/s3-tests.rs\",\n \"rank\": 2,\n \"score\": 282407.11824722\n },\n {\n \"content\": \"fn default_repo(prefix: &str, staging: impl AsRef<Path>) -> OcflRepo {\\n\\n init_repo(\\n\\n prefix,\\n\\n staging,\\n\\n Some(\\n\\n StorageLayout::new(\\n\\n LayoutExtensionName::HashedNTupleLayout,\\n\\n Some(DEFAULT_LAYOUT.as_bytes()),\\n\\n )\\n\\n .unwrap(),\\n\\n ),\\n\\n )\\n\\n}\\n\\n\\n\",\n \"file_path\": \"tests/s3-tests.rs\",\n \"rank\": 3,\n \"score\": 276388.3673924161\n },\n {\n \"content\": \"fn validate_repo_root(name: &str) -> PathBuf {\\n\\n let mut path = PathBuf::from(env!(\\\"CARGO_MANIFEST_DIR\\\"));\\n\\n path.push(\\\"resources\\\");\\n\\n path.push(\\\"test\\\");\\n\\n path.push(\\\"validate\\\");\\n\\n path.push(\\\"custom\\\");\\n\\n path.push(\\\"repos\\\");\\n\\n path.push(name);\\n\\n path\\n\\n}\\n\",\n \"file_path\": \"tests/cli-tests.rs\",\n \"rank\": 5,\n \"score\": 263327.91053200816\n },\n {\n \"content\": \"fn create_repo_root(name: &str) -> PathBuf {\\n\\n let mut path = PathBuf::from(env!(\\\"CARGO_MANIFEST_DIR\\\"));\\n\\n path.push(\\\"resources\\\");\\n\\n path.push(\\\"test\\\");\\n\\n path.push(\\\"repos\\\");\\n\\n path.push(name);\\n\\n path\\n\\n}\\n\\n\\n\",\n \"file_path\": \"tests/fs-tests.rs\",\n \"rank\": 6,\n \"score\": 263327.91053200816\n },\n {\n \"content\": \"#[cfg(feature = \\\"s3\\\")]\\n\\nfn create_s3_repo(config: &Config) -> Result<OcflRepo> {\\n\\n let region = resolve_region(config)?;\\n\\n\\n\\n OcflRepo::s3_repo(\\n\\n region,\\n\\n config.bucket.as_ref().unwrap(),\\n\\n config.root.as_deref(),\\n\\n config.staging_root.as_ref().unwrap(),\\n\\n config.profile.as_deref(),\\n\\n )\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/cmd/mod.rs\",\n \"rank\": 7,\n \"score\": 261117.9290338247\n },\n {\n \"content\": \"#[cfg(feature = \\\"s3\\\")]\\n\\nfn resolve_region(config: &Config) -> Result<Region> {\\n\\n Ok(match config.endpoint.is_some() {\\n\\n true => Region::Custom {\\n\\n name: config.region.as_ref().unwrap().to_owned(),\\n\\n endpoint: config.endpoint.as_ref().unwrap().to_owned(),\\n\\n },\\n\\n false => config.region.as_ref().unwrap().parse()?,\\n\\n })\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/cmd/mod.rs\",\n \"rank\": 8,\n \"score\": 260947.84294797608\n },\n {\n \"content\": \"pub fn init_repo(cmd: &InitCmd, args: &RocflArgs, config: &Config) -> Result<()> {\\n\\n if is_s3(config) {\\n\\n #[cfg(not(feature = \\\"s3\\\"))]\\n\\n return Err(RocflError::General(\\n\\n \\\"This binary was not compiled with S3 support.\\\".to_string(),\\n\\n ));\\n\\n\\n\\n #[cfg(feature = \\\"s3\\\")]\\n\\n let _ = init_s3_repo(\\n\\n config,\\n\\n create_layout(cmd.layout, cmd.config_file.as_deref())?,\\n\\n )?;\\n\\n } else {\\n\\n let _ = OcflRepo::init_fs_repo(\\n\\n config.root.as_ref().unwrap(),\\n\\n config.staging_root.as_ref().map(Path::new),\\n\\n create_layout(cmd.layout, cmd.config_file.as_deref())?,\\n\\n )?;\\n\\n }\\n\\n\\n\\n if !args.quiet {\\n\\n println(format!(\\n\\n \\\"Initialized OCFL repository with layout {}\\\",\\n\\n cmd.layout\\n\\n ));\\n\\n }\\n\\n\\n\\n Ok(())\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/cmd/mod.rs\",\n \"rank\": 9,\n \"score\": 258227.6259868616\n },\n {\n \"content\": \"/// If `object_id` is empty, then an `InvalidValue` error is returned. This does not enforce that\\n\\n/// the id is a URI.\\n\\npub fn validate_object_id(object_id: &str) -> Result<()> {\\n\\n if object_id.is_empty() {\\n\\n return Err(RocflError::InvalidValue(\\n\\n \\\"Object IDs may not be blank\\\".to_string(),\\n\\n ));\\n\\n }\\n\\n Ok(())\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/ocfl/validate/mod.rs\",\n \"rank\": 10,\n \"score\": 255704.73523611232\n },\n {\n \"content\": \"/// Executes a `rocfl` command\\n\\npub fn exec_command(args: &RocflArgs, config: Config) -> Result<()> {\\n\\n let config = resolve_config(args, config);\\n\\n let config = default_values(config)?;\\n\\n\\n\\n info!(\\\"Resolved configuration: {:?}\\\", config);\\n\\n\\n\\n config.validate()?;\\n\\n\\n\\n match &args.command {\\n\\n Command::Init(command) => {\\n\\n // init cmd needs to be handled differently because the repo does not exist yet\\n\\n init_repo(command, args, &config)\\n\\n }\\n\\n Command::Config(_command) => edit_config()\\n\\n .map_err(|e| RocflError::General(format!(\\\"Failed to edit config file: {}\\\", e))),\\n\\n _ => {\\n\\n let repo = Arc::new(create_repo(&config)?);\\n\\n let terminate = Arc::new(AtomicBool::new(false));\\n\\n\\n\\n let repo_ref = repo.clone();\\n\",\n \"file_path\": \"src/cmd/mod.rs\",\n \"rank\": 11,\n \"score\": 253301.39997573127\n },\n {\n \"content\": \"fn copy_existing_repo(name: &str, root: &TempDir) {\\n\\n let path = create_repo_root(name);\\n\\n\\n\\n let options = CopyOptions::new();\\n\\n\\n\\n fs_extra::dir::copy(&path, root.path(), &options).unwrap();\\n\\n}\\n\\n\\n\",\n \"file_path\": \"tests/fs-tests.rs\",\n \"rank\": 12,\n \"score\": 249367.7980776208\n },\n {\n \"content\": \"fn assert_layout_extension(root: &TempDir, layout_name: &str, config: &str) {\\n\\n root.child(\\\"ocfl_layout.json\\\")\\n\\n .assert(predicates::path::is_file())\\n\\n .assert(predicates::str::contains(format!(\\n\\n \\\"\\\\\\\"extension\\\\\\\": \\\\\\\"{}\\\\\\\"\\\",\\n\\n layout_name\\n\\n )));\\n\\n\\n\\n let layout_spec = format!(\\\"{}.md\\\", layout_name);\\n\\n root.child(&layout_spec)\\n\\n .assert(predicates::path::is_file())\\n\\n .assert(read_spec(&layout_spec));\\n\\n\\n\\n let extensions = root.child(\\\"extensions\\\");\\n\\n extensions.assert(predicates::path::is_dir());\\n\\n\\n\\n let layout_dir = extensions.child(layout_name);\\n\\n layout_dir.assert(predicates::path::is_dir());\\n\\n layout_dir\\n\\n .child(\\\"config.json\\\")\\n\\n .assert(predicates::path::is_file())\\n\\n .assert(config);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"tests/fs-tests.rs\",\n \"rank\": 14,\n \"score\": 244942.85860128212\n },\n {\n \"content\": \"fn create_rusoto_client(region: Region, profile: Option<&str>) -> RusotoS3Client {\\n\\n match profile {\\n\\n Some(profile) => {\\n\\n // Client setup code copied from Rusoto -- they don't make it easy to set the profile\\n\\n let credentials_provider =\\n\\n AutoRefreshingProvider::new(ChainProvider::with_profile_provider(\\n\\n ProfileProvider::with_default_credentials(profile)\\n\\n .expect(\\\"failed to create profile provider\\\"),\\n\\n ))\\n\\n .expect(\\\"failed to create credentials provider\\\");\\n\\n let dispatcher = HttpClient::new().expect(\\\"failed to create request dispatcher\\\");\\n\\n let client = Client::new_with(credentials_provider, dispatcher);\\n\\n RusotoS3Client::new_with_client(client, region)\\n\\n }\\n\\n None => RusotoS3Client::new(region),\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/ocfl/store/s3.rs\",\n \"rank\": 15,\n \"score\": 233896.95147983322\n },\n {\n \"content\": \"fn default_repo(root: impl AsRef<Path>) -> OcflRepo {\\n\\n OcflRepo::init_fs_repo(\\n\\n root,\\n\\n None,\\n\\n Some(StorageLayout::new(LayoutExtensionName::HashedNTupleLayout, None).unwrap()),\\n\\n )\\n\\n .unwrap()\\n\\n}\\n\\n\\n\",\n \"file_path\": \"tests/fs-tests.rs\",\n \"rank\": 16,\n \"score\": 233674.99551990448\n },\n {\n \"content\": \"fn new_repo(root: impl AsRef<Path>) -> OcflRepo {\\n\\n OcflRepo::fs_repo(root, None).unwrap()\\n\\n}\\n\\n\\n\",\n \"file_path\": \"tests/validate-tests.rs\",\n \"rank\": 17,\n \"score\": 233646.52286568878\n },\n {\n \"content\": \"fn official_error_test(name: &str) -> ObjectValidationResult {\\n\\n let repo = new_repo(official_error_root());\\n\\n repo.validate_object_at(name, true).unwrap()\\n\\n}\\n\\n\\n\",\n \"file_path\": \"tests/validate-tests.rs\",\n \"rank\": 18,\n \"score\": 232946.46921466803\n },\n {\n \"content\": \"fn official_warn_test(name: &str) -> ObjectValidationResult {\\n\\n let repo = new_repo(official_warn_root());\\n\\n repo.validate_object_at(name, true).unwrap()\\n\\n}\\n\\n\\n\",\n \"file_path\": \"tests/validate-tests.rs\",\n \"rank\": 19,\n \"score\": 232946.46921466803\n },\n {\n \"content\": \"fn official_valid_test(name: &str) -> ObjectValidationResult {\\n\\n let repo = new_repo(official_valid_root());\\n\\n repo.validate_object_at(name, true).unwrap()\\n\\n}\\n\\n\\n\",\n \"file_path\": \"tests/validate-tests.rs\",\n \"rank\": 20,\n \"score\": 232946.46921466803\n },\n {\n \"content\": \"fn create_repo(config: &Config) -> Result<OcflRepo> {\\n\\n if is_s3(config) {\\n\\n #[cfg(not(feature = \\\"s3\\\"))]\\n\\n return Err(RocflError::General(\\n\\n \\\"This binary was not compiled with S3 support.\\\".to_string(),\\n\\n ));\\n\\n\\n\\n #[cfg(feature = \\\"s3\\\")]\\n\\n create_s3_repo(config)\\n\\n } else {\\n\\n OcflRepo::fs_repo(\\n\\n config.root.as_ref().unwrap(),\\n\\n config.staging_root.as_ref().map(Path::new),\\n\\n )\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/cmd/mod.rs\",\n \"rank\": 21,\n \"score\": 232871.08014795612\n },\n {\n \"content\": \"fn init_new_repo(root: impl AsRef<Path>, layout: Option<&StorageLayout>) -> Result<()> {\\n\\n let root = root.as_ref().to_path_buf();\\n\\n\\n\\n if root.exists() {\\n\\n if !root.is_dir() {\\n\\n return Err(RocflError::IllegalState(format!(\\n\\n \\\"Cannot create new repository. Storage root {} is not a directory\\\",\\n\\n canonical_str(root)\\n\\n )));\\n\\n }\\n\\n\\n\\n if fs::read_dir(&root)?.next().is_some() {\\n\\n return Err(RocflError::IllegalState(format!(\\n\\n \\\"Cannot create new repository. Storage root {} must be empty\\\",\\n\\n canonical_str(root)\\n\\n )));\\n\\n }\\n\\n }\\n\\n\\n\\n info!(\\\"Initializing OCFL storage root at {}\\\", canonical_str(&root));\\n\",\n \"file_path\": \"src/ocfl/store/fs.rs\",\n \"rank\": 22,\n \"score\": 231588.3930326305\n },\n {\n \"content\": \"#[test]\\n\\n#[should_panic(expected = \\\"must be empty\\\")]\\n\\nfn fail_new_repo_creation_when_non_empty_root() {\\n\\n let root = TempDir::new().unwrap();\\n\\n\\n\\n root.child(\\\"file\\\").write_str(\\\"contents\\\").unwrap();\\n\\n\\n\\n let _repo = OcflRepo::init_fs_repo(\\n\\n root.path(),\\n\\n None,\\n\\n Some(StorageLayout::new(LayoutExtensionName::HashedNTupleLayout, None).unwrap()),\\n\\n )\\n\\n .unwrap();\\n\\n}\\n\\n\\n\",\n \"file_path\": \"tests/fs-tests.rs\",\n \"rank\": 25,\n \"score\": 231379.92921277176\n },\n {\n \"content\": \"fn repo_test_path(name: &str) -> PathBuf {\\n\\n let mut path = validate_repo_root();\\n\\n path.push(\\\"custom\\\");\\n\\n path.push(\\\"repos\\\");\\n\\n path.push(name);\\n\\n path\\n\\n}\\n\\n\\n\",\n \"file_path\": \"tests/validate-tests.rs\",\n \"rank\": 26,\n \"score\": 229646.4112218346\n },\n {\n \"content\": \"#[test]\\n\\nfn purge_should_remove_object_from_repo_and_staging() -> Result<()> {\\n\\n let root = TempDir::new().unwrap();\\n\\n let temp = TempDir::new().unwrap();\\n\\n\\n\\n let repo = default_repo(root.path());\\n\\n\\n\\n let object_id = \\\"purge me2\\\";\\n\\n\\n\\n create_example_object(object_id, &repo, &temp);\\n\\n\\n\\n repo.move_files_external(\\n\\n object_id,\\n\\n &vec![create_file(&temp, \\\"blah\\\", \\\"blah\\\").path()],\\n\\n \\\"blah\\\",\\n\\n )?;\\n\\n\\n\\n repo.purge_object(object_id)?;\\n\\n\\n\\n assert_obj_not_exists(&repo, object_id);\\n\\n assert_staged_obj_not_exists(&repo, object_id);\\n\\n\\n\\n validate_repo(&repo);\\n\\n Ok(())\\n\\n}\\n\\n\\n\",\n \"file_path\": \"tests/fs-tests.rs\",\n \"rank\": 27,\n \"score\": 229430.1333143084\n },\n {\n \"content\": \"fn assert_staged_obj_not_exists(repo: &OcflRepo, object_id: &str) {\\n\\n match repo.get_staged_object(object_id) {\\n\\n Err(RocflError::NotFound(_)) => (),\\n\\n _ => panic!(\\\"Expected staged object '{}' to not be found\\\", object_id),\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"tests/fs-tests.rs\",\n \"rank\": 28,\n \"score\": 228974.13519533892\n },\n {\n \"content\": \"#[cfg(feature = \\\"s3\\\")]\\n\\nfn init_s3_repo(config: &Config, layout: Option<StorageLayout>) -> Result<OcflRepo> {\\n\\n let region = resolve_region(config)?;\\n\\n\\n\\n OcflRepo::init_s3_repo(\\n\\n region,\\n\\n config.bucket.as_ref().unwrap(),\\n\\n config.root.as_deref(),\\n\\n config.staging_root.as_ref().unwrap(),\\n\\n layout,\\n\\n config.profile.as_deref(),\\n\\n )\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/cmd/mod.rs\",\n \"rank\": 29,\n \"score\": 228498.3363536025\n },\n {\n \"content\": \"fn resolve_config(args: &RocflArgs, mut config: Config) -> Config {\\n\\n if args.root.is_some() {\\n\\n config.root = args.root.clone();\\n\\n }\\n\\n if args.staging_root.is_some() {\\n\\n config.staging_root = args.staging_root.clone();\\n\\n }\\n\\n if args.bucket.is_some() {\\n\\n config.bucket = args.bucket.clone();\\n\\n }\\n\\n if args.region.is_some() {\\n\\n config.region = args.region.clone();\\n\\n }\\n\\n if args.endpoint.is_some() {\\n\\n config.endpoint = args.endpoint.clone();\\n\\n }\\n\\n if args.profile.is_some() {\\n\\n config.profile = args.profile.clone()\\n\\n }\\n\\n\\n\",\n \"file_path\": \"src/cmd/mod.rs\",\n \"rank\": 30,\n \"score\": 220827.99386428058\n },\n {\n \"content\": \"pub fn no_warnings(result: &ObjectValidationResult) {\\n\\n assert!(\\n\\n result.warnings().is_empty(),\\n\\n \\\"Expected no warnings; found: {:?}\\\",\\n\\n result.warnings()\\n\\n )\\n\\n}\\n\\n\\n\",\n \"file_path\": \"tests/common/mod.rs\",\n \"rank\": 31,\n \"score\": 220457.7948561284\n },\n {\n \"content\": \"pub fn no_errors(result: &ObjectValidationResult) {\\n\\n assert!(\\n\\n result.errors().is_empty(),\\n\\n \\\"Expected no errors; found: {:?}\\\",\\n\\n result.errors()\\n\\n )\\n\\n}\\n\\n\\n\",\n \"file_path\": \"tests/common/mod.rs\",\n \"rank\": 32,\n \"score\": 220457.7948561284\n },\n {\n \"content\": \"#[test]\\n\\nfn create_new_hash_id_repo_empty_dir() -> Result<()> {\\n\\n let root = TempDir::new().unwrap();\\n\\n let temp = TempDir::new().unwrap();\\n\\n\\n\\n let repo = OcflRepo::init_fs_repo(\\n\\n root.path(),\\n\\n None,\\n\\n Some(StorageLayout::new(\\n\\n LayoutExtensionName::HashedNTupleObjectIdLayout,\\n\\n None,\\n\\n )?),\\n\\n )?;\\n\\n\\n\\n assert_storage_root(&root);\\n\\n assert_layout_extension(\\n\\n &root,\\n\\n \\\"0003-hash-and-id-n-tuple-storage-layout\\\",\\n\\n r#\\\"{\\n\\n \\\"extensionName\\\": \\\"0003-hash-and-id-n-tuple-storage-layout\\\",\\n\\n \\\"digestAlgorithm\\\": \\\"sha256\\\",\\n\",\n \"file_path\": \"tests/fs-tests.rs\",\n \"rank\": 33,\n \"score\": 218601.36750143618\n },\n {\n \"content\": \"fn init_repo(prefix: &str, staging: impl AsRef<Path>, layout: Option<StorageLayout>) -> OcflRepo {\\n\\n OcflRepo::init_s3_repo(REGION, &bucket(), Some(prefix), staging, layout, None).unwrap()\\n\\n}\\n\\n\\n\",\n \"file_path\": \"tests/s3-tests.rs\",\n \"rank\": 34,\n \"score\": 217077.93031723518\n },\n {\n \"content\": \"fn assert_file(s3_client: &S3Client, root: &str, path: &str, content: &str) {\\n\\n let key = format!(\\\"{}/{}\\\", root, path);\\n\\n let actual_content = get_content_with_key(s3_client, &key);\\n\\n assert_eq!(content, actual_content);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"tests/s3-tests.rs\",\n \"rank\": 35,\n \"score\": 216713.72271682476\n },\n {\n \"content\": \"fn delete_all(s3_client: &S3Client, root: &str) {\\n\\n tokio_test::block_on(async move {\\n\\n let list = s3_client\\n\\n .list_objects_v2(ListObjectsV2Request {\\n\\n bucket: bucket(),\\n\\n prefix: Some(format!(\\\"{}/\\\", root)),\\n\\n ..Default::default()\\n\\n })\\n\\n .await\\n\\n .unwrap();\\n\\n\\n\\n for object in list.contents.unwrap() {\\n\\n s3_client\\n\\n .delete_object(DeleteObjectRequest {\\n\\n bucket: bucket(),\\n\\n key: object.key.unwrap(),\\n\\n ..Default::default()\\n\\n })\\n\\n .await\\n\\n .unwrap();\\n\\n }\\n\\n });\\n\\n}\\n\\n\\n\",\n \"file_path\": \"tests/s3-tests.rs\",\n \"rank\": 36,\n \"score\": 216696.39565524005\n },\n {\n \"content\": \"fn assert_file_exists(s3_client: &S3Client, root: &str, path: &str) {\\n\\n let key = format!(\\\"{}/{}\\\", root, path);\\n\\n let _ = tokio_test::block_on(s3_client.head_object(HeadObjectRequest {\\n\\n bucket: bucket(),\\n\\n key: key.clone(),\\n\\n ..Default::default()\\n\\n }))\\n\\n .expect(&format!(\\\"Expected {} to exist\\\", key));\\n\\n}\\n\\n\\n\",\n \"file_path\": \"tests/s3-tests.rs\",\n \"rank\": 37,\n \"score\": 214546.91858610002\n },\n {\n \"content\": \"fn read_spec(name: &str) -> String {\\n\\n let mut path = PathBuf::from(env!(\\\"CARGO_MANIFEST_DIR\\\"));\\n\\n path.push(\\\"resources\\\");\\n\\n path.push(\\\"main\\\");\\n\\n path.push(\\\"specs\\\");\\n\\n path.push(name);\\n\\n fs::read_to_string(path).unwrap()\\n\\n}\\n\",\n \"file_path\": \"tests/s3-tests.rs\",\n \"rank\": 38,\n \"score\": 214105.8956377837\n },\n {\n \"content\": \"fn assert_file_contains(s3_client: &S3Client, root: &str, path: &str, content: &str) {\\n\\n let key = format!(\\\"{}/{}\\\", root, path);\\n\\n let actual_content = get_content_with_key(s3_client, &key);\\n\\n assert!(\\n\\n actual_content.contains(content),\\n\\n \\\"Expected {} to contain {}. Found: {}\\\",\\n\\n key,\\n\\n content,\\n\\n actual_content\\n\\n );\\n\\n}\\n\\n\\n\",\n \"file_path\": \"tests/s3-tests.rs\",\n \"rank\": 39,\n \"score\": 213668.98370446474\n },\n {\n \"content\": \"/// Runs the test if the environment is configured to run S3 tests, and removes all resources\\n\\n/// created during the test run, regardless of the test's outcome.\\n\\nfn run_s3_test(name: &str, test: impl FnOnce(S3Client, String, TempDir, TempDir) + UnwindSafe) {\\n\\n // let _ = env_logger::builder().is_test(true).filter_level(LevelFilter::Info).try_init();\\n\\n\\n\\n let staging = TempDir::new().unwrap();\\n\\n let temp = TempDir::new().unwrap();\\n\\n let prefix = s3_prefix();\\n\\n\\n\\n let result = panic::catch_unwind(|| test(S3Client::new(REGION), prefix.clone(), staging, temp));\\n\\n\\n\\n if let Err(e) = panic::catch_unwind(|| delete_all(&S3Client::new(REGION), &prefix)) {\\n\\n let s = e\\n\\n .downcast()\\n\\n .unwrap_or_else(|e| Box::new(format!(\\\"{:?}\\\", e)));\\n\\n eprintln!(\\\"Failed to cleanup test {}: {}\\\", name, s);\\n\\n }\\n\\n\\n\\n if let Err(e) = result {\\n\\n let s = e\\n\\n .downcast()\\n\\n .unwrap_or_else(|e| Box::new(format!(\\\"{:?}\\\", e)));\\n\\n panic!(\\\"Test {} failed: {}\\\", name, s);\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"tests/s3-tests.rs\",\n \"rank\": 40,\n \"score\": 213580.08805915888\n },\n {\n \"content\": \"/// Constructs a `RocflError::NotFound` error\\n\\npub fn not_found(object_id: &str, version_num: Option<VersionNum>) -> RocflError {\\n\\n match version_num {\\n\\n Some(version) => RocflError::NotFound(format!(\\\"Object {} version {}\\\", object_id, version)),\\n\\n None => RocflError::NotFound(format!(\\\"Object {}\\\", object_id)),\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/ocfl/error.rs\",\n \"rank\": 41,\n \"score\": 212295.8401498741\n },\n {\n \"content\": \"fn write_layout_config(root: impl AsRef<Path>, layout: &StorageLayout) -> Result<()> {\\n\\n let extension_name = layout.extension_name().to_string();\\n\\n\\n\\n let ocfl_layout = OcflLayout {\\n\\n extension: layout.extension_name(),\\n\\n description: format!(\\\"See specification document {}.md\\\", extension_name),\\n\\n };\\n\\n\\n\\n serde_json::to_writer_pretty(\\n\\n File::create(paths::ocfl_layout_path(root.as_ref()))?,\\n\\n &ocfl_layout,\\n\\n )?;\\n\\n\\n\\n let mut layout_ext_dir = paths::extensions_path(root.as_ref());\\n\\n layout_ext_dir.push(&extension_name);\\n\\n fs::create_dir_all(&layout_ext_dir)?;\\n\\n\\n\\n File::create(layout_ext_dir.join(EXTENSIONS_CONFIG_FILE))?.write_all(&layout.serialize()?)?;\\n\\n\\n\\n let extension_spec = match layout.extension_name() {\\n\",\n \"file_path\": \"src/ocfl/store/fs.rs\",\n \"rank\": 42,\n \"score\": 212277.75553087651\n },\n {\n \"content\": \"/// If `content_dir` contains `.`, `..`, or `/`, then an `InvalidValue` error is returned.\\n\\npub fn validate_content_dir(content_dir: &str) -> Result<()> {\\n\\n if content_dir.eq(\\\".\\\") || content_dir.eq(\\\"..\\\") || content_dir.contains('/') {\\n\\n return Err(RocflError::InvalidValue(format!(\\n\\n \\\"The content directory cannot equal '.' or '..' and cannot contain a '/'. Found: {}\\\",\\n\\n content_dir\\n\\n )));\\n\\n }\\n\\n Ok(())\\n\\n}\\n\\n\\n\\n/// OCFL validation codes for errors: https://ocfl.io/1.0/spec/validation-codes.html\\n\\n#[allow(dead_code)]\\n\\n#[derive(Debug, EnumDisplay, EnumString, Copy, Clone, Eq, PartialEq)]\\n\\npub enum ErrorCode {\\n\\n E001,\\n\\n E002,\\n\\n E003,\\n\\n E004,\\n\\n E005,\\n\\n E006,\\n\",\n \"file_path\": \"src/ocfl/validate/mod.rs\",\n \"rank\": 44,\n \"score\": 211865.85848488176\n },\n {\n \"content\": \"fn commit(object_id: &str, repo: &OcflRepo) {\\n\\n repo.commit(object_id, CommitMeta::new(), None, false)\\n\\n .unwrap();\\n\\n}\\n\\n\\n\",\n \"file_path\": \"tests/fs-tests.rs\",\n \"rank\": 45,\n \"score\": 210064.0129351823\n },\n {\n \"content\": \"#[test]\\n\\n#[should_panic(expected = \\\"Cannot create new repository. Storage root must be empty\\\")]\\n\\nfn fail_create_new_repo_when_repo_already_exists() {\\n\\n panic_or_run_s3_test(\\n\\n \\\"fail_create_new_repo_when_repo_already_exists\\\",\\n\\n \\\"Cannot create new repository. Storage root must be empty\\\",\\n\\n |_s3_client: S3Client, prefix: String, staging: TempDir, _temp: TempDir| {\\n\\n let _ = default_repo(&prefix, staging.path());\\n\\n let _ = default_repo(&prefix, staging.path());\\n\\n },\\n\\n );\\n\\n}\\n\\n\\n\",\n \"file_path\": \"tests/s3-tests.rs\",\n \"rank\": 46,\n \"score\": 209445.19828216964\n },\n {\n \"content\": \"#[test]\\n\\n#[should_panic(expected = \\\"Cannot create object s3-object because it already exists\\\")]\\n\\nfn fail_create_new_object_when_already_exists() {\\n\\n panic_or_run_s3_test(\\n\\n \\\"fail_create_new_object_when_already_exists\\\",\\n\\n \\\"Cannot create object s3-object because it already exists\\\",\\n\\n |_s3_client: S3Client, prefix: String, staging: TempDir, temp: TempDir| {\\n\\n let repo = default_repo(&prefix, staging.path());\\n\\n let object_id = \\\"s3-object\\\";\\n\\n\\n\\n repo.create_object(object_id, DigestAlgorithm::Sha256, \\\"content\\\", 0)\\n\\n .unwrap();\\n\\n repo.copy_files_external(\\n\\n object_id,\\n\\n &vec![create_file(&temp, \\\"test.txt\\\", \\\"testing\\\").path()],\\n\\n \\\"/\\\",\\n\\n false,\\n\\n )\\n\\n .unwrap();\\n\\n repo.commit(object_id, CommitMeta::new(), None, false)\\n\\n .unwrap();\\n\\n\\n\\n repo.create_object(object_id, DigestAlgorithm::Sha256, \\\"content\\\", 0)\\n\\n .unwrap();\\n\\n },\\n\\n );\\n\\n}\\n\\n\\n\",\n \"file_path\": \"tests/s3-tests.rs\",\n \"rank\": 47,\n \"score\": 203281.10448958183\n },\n {\n \"content\": \"fn assert_obj_not_exists(repo: &OcflRepo, object_id: &str) {\\n\\n match repo.get_object(object_id, VersionRef::Head) {\\n\\n Err(RocflError::NotFound(_)) => (),\\n\\n _ => panic!(\\\"Expected object '{}' to not be found\\\", object_id),\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"tests/fs-tests.rs\",\n \"rank\": 48,\n \"score\": 201960.12398949778\n },\n {\n \"content\": \"#[test]\\n\\nfn copy_files_into_new_object() -> Result<()> {\\n\\n let root = TempDir::new().unwrap();\\n\\n let temp = TempDir::new().unwrap();\\n\\n\\n\\n let repo = default_repo(root.path());\\n\\n\\n\\n let object_id = \\\"foobar\\\";\\n\\n\\n\\n assert_staged_obj_count(&repo, 0);\\n\\n repo.create_object(object_id, DigestAlgorithm::Sha512, \\\"content\\\", 0)?;\\n\\n assert_staged_obj_count(&repo, 1);\\n\\n\\n\\n let staged: Vec<ObjectVersionDetails> = repo.list_staged_objects(None)?.flatten().collect();\\n\\n assert_eq!(object_id, staged.first().unwrap().id);\\n\\n\\n\\n create_file(&temp, \\\"test.txt\\\", \\\"testing\\\");\\n\\n repo.copy_files_external(\\n\\n object_id,\\n\\n &vec![temp.child(\\\"test.txt\\\").path()],\\n\\n \\\"test.txt\\\",\\n\",\n \"file_path\": \"tests/fs-tests.rs\",\n \"rank\": 49,\n \"score\": 199900.318006039\n },\n {\n \"content\": \"#[test]\\n\\nfn move_files_into_new_object() -> Result<()> {\\n\\n let root = TempDir::new().unwrap();\\n\\n let temp = TempDir::new().unwrap();\\n\\n\\n\\n let repo = default_repo(root.path());\\n\\n\\n\\n let object_id = \\\"move files\\\";\\n\\n\\n\\n repo.create_object(object_id, DigestAlgorithm::Sha512, \\\"content\\\", 0)?;\\n\\n\\n\\n create_file(&temp, \\\"test.txt\\\", \\\"testing\\\");\\n\\n create_dirs(&temp, \\\"nested/dir\\\");\\n\\n create_file(&temp, \\\"nested/1.txt\\\", \\\"File 1\\\");\\n\\n create_file(&temp, \\\"nested/dir/2.txt\\\", \\\"File 2\\\");\\n\\n create_file(&temp, \\\"nested/dir/3.txt\\\", \\\"File 3\\\");\\n\\n\\n\\n repo.move_files_external(\\n\\n object_id,\\n\\n &vec![\\n\\n temp.child(\\\"test.txt\\\").path(),\\n\",\n \"file_path\": \"tests/fs-tests.rs\",\n \"rank\": 50,\n \"score\": 199900.31800603896\n },\n {\n \"content\": \"#[test]\\n\\nfn commit_should_remove_staged_object() -> Result<()> {\\n\\n let root = TempDir::new().unwrap();\\n\\n let temp = TempDir::new().unwrap();\\n\\n\\n\\n let repo = default_repo(root.path());\\n\\n\\n\\n let object_id = \\\"commit meta\\\";\\n\\n\\n\\n repo.create_object(object_id, DigestAlgorithm::Sha256, \\\"content\\\", 0)?;\\n\\n\\n\\n repo.move_files_external(\\n\\n object_id,\\n\\n &vec![create_file(&temp, \\\"blah\\\", \\\"blah\\\").path()],\\n\\n \\\"blah\\\",\\n\\n )?;\\n\\n\\n\\n commit(object_id, &repo);\\n\\n\\n\\n let _obj = repo.get_object(object_id, VersionRef::Head)?;\\n\\n\\n\\n assert_staged_obj_not_exists(&repo, object_id);\\n\\n\\n\\n validate_repo(&repo);\\n\\n Ok(())\\n\\n}\\n\\n\\n\",\n \"file_path\": \"tests/fs-tests.rs\",\n \"rank\": 51,\n \"score\": 199889.79540873485\n },\n {\n \"content\": \"#[test]\\n\\nfn list_repo_with_invalid_objects() -> Result<()> {\\n\\n let repo_root = create_repo_root(\\\"invalid\\\");\\n\\n let repo = OcflRepo::fs_repo(&repo_root, None)?;\\n\\n\\n\\n let object_root = repo_root\\n\\n .join(\\\"925\\\")\\n\\n .join(\\\"0b9\\\")\\n\\n .join(\\\"912\\\")\\n\\n .join(\\\"9250b9912ee91d6b46e23299459ecd6eb8154451d62558a3a0a708a77926ad04\\\");\\n\\n\\n\\n let iter = repo.list_objects(None)?;\\n\\n\\n\\n for object in iter {\\n\\n if let Ok(object) = object {\\n\\n assert_eq!(\\n\\n object,\\n\\n ObjectVersionDetails {\\n\\n id: \\\"o2\\\".to_string(),\\n\\n object_root: object_root.display().to_string(),\\n\\n digest_algorithm: DigestAlgorithm::Sha512,\\n\\n version_details: o2_v3_details()\\n\\n }\\n\\n );\\n\\n }\\n\\n }\\n\\n\\n\\n Ok(())\\n\\n}\\n\\n\\n\",\n \"file_path\": \"tests/fs-tests.rs\",\n \"rank\": 52,\n \"score\": 199349.44231862767\n },\n {\n \"content\": \"#[test]\\n\\nfn purge_should_remove_object_from_repo() -> Result<()> {\\n\\n let root = TempDir::new().unwrap();\\n\\n let temp = TempDir::new().unwrap();\\n\\n\\n\\n let repo = default_repo(root.path());\\n\\n\\n\\n let object_id = \\\"purge me\\\";\\n\\n\\n\\n create_example_object(object_id, &repo, &temp);\\n\\n\\n\\n repo.purge_object(object_id)?;\\n\\n\\n\\n assert_obj_not_exists(&repo, object_id);\\n\\n\\n\\n validate_repo(&repo);\\n\\n Ok(())\\n\\n}\\n\\n\\n\",\n \"file_path\": \"tests/fs-tests.rs\",\n \"rank\": 53,\n \"score\": 199349.44231862767\n },\n {\n \"content\": \"/// Walks up the directory hierarchy deleting directories until it finds a non-empty directory.\\n\\npub fn clean_dirs_up(start_dir: impl AsRef<Path>) -> Result<()> {\\n\\n let mut current = start_dir.as_ref();\\n\\n\\n\\n while dir_is_empty(current)? {\\n\\n fs::remove_dir(current)?;\\n\\n current = current.parent().unwrap();\\n\\n }\\n\\n\\n\\n Ok(())\\n\\n}\\n\",\n \"file_path\": \"src/ocfl/util.rs\",\n \"rank\": 54,\n \"score\": 198900.58154427836\n },\n {\n \"content\": \"/// Walks down the directory hierarchy deleting all non-empty directories\\n\\npub fn clean_dirs_down(start_dir: impl AsRef<Path>) -> Result<()> {\\n\\n let start_dir = start_dir.as_ref();\\n\\n\\n\\n for entry in WalkDir::new(start_dir).contents_first(true) {\\n\\n let path = entry?;\\n\\n if path.file_type().is_dir() && dir_is_empty(path.path())? {\\n\\n fs::remove_dir(path.path())?;\\n\\n }\\n\\n }\\n\\n\\n\\n Ok(())\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/ocfl/util.rs\",\n \"rank\": 55,\n \"score\": 198900.41761850094\n },\n {\n \"content\": \"#[test]\\n\\nfn get_staged_object_file_when_exists_in_staged_version() -> Result<()> {\\n\\n let root = TempDir::new().unwrap();\\n\\n let temp = TempDir::new().unwrap();\\n\\n\\n\\n let repo = default_repo(root.path());\\n\\n\\n\\n let object_id = \\\"get file\\\";\\n\\n\\n\\n create_example_object(object_id, &repo, &temp);\\n\\n\\n\\n repo.move_files_external(\\n\\n object_id,\\n\\n &vec![create_file(&temp, \\\"blah\\\", \\\"blah\\\").path()],\\n\\n \\\"blah\\\",\\n\\n )?;\\n\\n\\n\\n let mut out: Vec<u8> = Vec::new();\\n\\n\\n\\n repo.get_staged_object_file(object_id, &lpath(\\\"blah\\\"), &mut out)?;\\n\\n\\n\\n assert_eq!(\\\"blah\\\", String::from_utf8(out).unwrap());\\n\\n\\n\\n validate_repo(&repo);\\n\\n Ok(())\\n\\n}\\n\\n\\n\",\n \"file_path\": \"tests/fs-tests.rs\",\n \"rank\": 56,\n \"score\": 198650.49722790415\n },\n {\n \"content\": \"fn rocfl(path: impl AsRef<Path>, command: &str) -> Command {\\n\\n let mut rocfl = Command::cargo_bin(\\\"rocfl\\\").unwrap();\\n\\n rocfl\\n\\n .arg(\\\"-S\\\")\\n\\n .arg(\\\"-r\\\")\\n\\n .arg(path.as_ref().to_string_lossy().as_ref())\\n\\n .arg(command);\\n\\n rocfl\\n\\n}\\n\\n\\n\",\n \"file_path\": \"tests/cli-tests.rs\",\n \"rank\": 57,\n \"score\": 198354.8925007808\n },\n {\n \"content\": \"pub fn error_count(expected: usize, result: &ObjectValidationResult) {\\n\\n assert_eq!(\\n\\n expected,\\n\\n result.errors().len(),\\n\\n \\\"Expected {} errors; found {}: {:?}\\\",\\n\\n expected,\\n\\n result.errors().len(),\\n\\n result.errors()\\n\\n )\\n\\n}\\n\\n\\n\",\n \"file_path\": \"tests/common/mod.rs\",\n \"rank\": 58,\n \"score\": 196195.9274396057\n },\n {\n \"content\": \"pub fn warning_count(expected: usize, result: &ObjectValidationResult) {\\n\\n assert_eq!(\\n\\n expected,\\n\\n result.warnings().len(),\\n\\n \\\"Expected {} warnings; found {}: {:?}\\\",\\n\\n expected,\\n\\n result.warnings().len(),\\n\\n result.warnings()\\n\\n )\\n\\n}\\n\\n\\n\",\n \"file_path\": \"tests/common/mod.rs\",\n \"rank\": 59,\n \"score\": 196195.9274396057\n },\n {\n \"content\": \"#[test]\\n\\nfn get_object_when_exists_using_layout() -> Result<()> {\\n\\n let repo_root = create_repo_root(\\\"multiple-objects-with-layout\\\");\\n\\n let repo = OcflRepo::fs_repo(&repo_root, None)?;\\n\\n\\n\\n let object = repo.get_object(\\\"o2\\\", VersionRef::Head)?;\\n\\n\\n\\n let object_root = repo_root\\n\\n .join(\\\"925\\\")\\n\\n .join(\\\"0b9\\\")\\n\\n .join(\\\"912\\\")\\n\\n .join(\\\"9250b9912ee91d6b46e23299459ecd6eb8154451d62558a3a0a708a77926ad04\\\");\\n\\n\\n\\n assert_eq!(\\n\\n object,\\n\\n ObjectVersion {\\n\\n id: \\\"o2\\\".to_string(),\\n\\n object_root: object_root.to_string_lossy().to_string(),\\n\\n digest_algorithm: DigestAlgorithm::Sha512,\\n\\n version_details: o2_v3_details(),\\n\\n state: hashmap! {\\n\",\n \"file_path\": \"tests/fs-tests.rs\",\n \"rank\": 60,\n \"score\": 195085.18733471652\n },\n {\n \"content\": \"#[test]\\n\\nfn create_new_repo_empty_dir() -> Result<()> {\\n\\n let root = TempDir::new().unwrap();\\n\\n let temp = TempDir::new().unwrap();\\n\\n\\n\\n let repo = OcflRepo::init_fs_repo(\\n\\n root.path(),\\n\\n None,\\n\\n Some(StorageLayout::new(\\n\\n LayoutExtensionName::HashedNTupleLayout,\\n\\n None,\\n\\n )?),\\n\\n )?;\\n\\n\\n\\n assert_storage_root(&root);\\n\\n assert_layout_extension(\\n\\n &root,\\n\\n \\\"0004-hashed-n-tuple-storage-layout\\\",\\n\\n r#\\\"{\\n\\n \\\"extensionName\\\": \\\"0004-hashed-n-tuple-storage-layout\\\",\\n\\n \\\"digestAlgorithm\\\": \\\"sha256\\\",\\n\",\n \"file_path\": \"tests/fs-tests.rs\",\n \"rank\": 61,\n \"score\": 194740.86879585776\n },\n {\n \"content\": \"/// # v1\\n\\n///\\n\\n/// - a/file1.txt\\n\\n/// - a/b/file2.txt\\n\\n/// - a/b/file3.txt\\n\\n/// - a/b/c/file4.txt\\n\\n/// - a/d/e/file5.txt\\n\\n/// - a/f/file6.txt\\n\\n///\\n\\n/// # v2\\n\\n///\\n\\n/// - a/file1.txt\\n\\n/// - a/b/file2.txt\\n\\n/// - a/d/e/file5.txt\\n\\n/// - a/f/file6.txt\\n\\n///\\n\\n///# v3\\n\\n///\\n\\n/// - file3.txt\\n\\n/// - a/file1.txt\\n\\n/// - a/b/file2.txt\\n\\n/// - a/d/e/file5.txt\\n\\n/// - a/f/file6.txt\\n\\n/// - something/file1.txt\\n\\n/// - something/new.txt\\n\\n///\\n\\n/// # v4\\n\\n///\\n\\n/// - file3.txt\\n\\n/// - a/file1.txt\\n\\n/// - a/file5.txt\\n\\n/// - a/b/file2.txt\\n\\n/// - a/f/file6.txt (updated)\\n\\n/// - something/file1.txt\\n\\n/// - something/new.txt\\n\\nfn create_example_object(object_id: &str, repo: &OcflRepo, temp: &TempDir) {\\n\\n repo.create_object(object_id, DigestAlgorithm::Sha256, \\\"content\\\", 0)\\n\\n .unwrap();\\n\\n\\n\\n create_dirs(temp, \\\"a/b/c\\\");\\n\\n create_dirs(temp, \\\"a/d/e\\\");\\n\\n create_dirs(temp, \\\"a/f\\\");\\n\\n\\n\\n create_file(temp, \\\"a/file1.txt\\\", \\\"File One\\\");\\n\\n create_file(temp, \\\"a/b/file2.txt\\\", \\\"File Two\\\");\\n\\n create_file(temp, \\\"a/b/file3.txt\\\", \\\"File Three\\\");\\n\\n create_file(temp, \\\"a/b/c/file4.txt\\\", \\\"File Four\\\");\\n\\n create_file(temp, \\\"a/d/e/file5.txt\\\", \\\"File Five\\\");\\n\\n create_file(temp, \\\"a/f/file6.txt\\\", \\\"File Six\\\");\\n\\n\\n\\n repo.move_files_external(object_id, &vec![temp.child(\\\"a\\\").path()], \\\"/\\\")\\n\\n .unwrap();\\n\\n\\n\\n commit(object_id, &repo);\\n\\n\\n\",\n \"file_path\": \"tests/fs-tests.rs\",\n \"rank\": 62,\n \"score\": 193834.3960114414\n },\n {\n \"content\": \"fn create_simple_object(object_id: &str, repo: &OcflRepo, temp: &TempDir) {\\n\\n repo.create_object(object_id, DigestAlgorithm::Sha512, \\\"content\\\", 0)\\n\\n .unwrap();\\n\\n\\n\\n temp.child(\\\"test.txt\\\").write_str(\\\"testing\\\").unwrap();\\n\\n repo.copy_files_external(\\n\\n object_id,\\n\\n &vec![temp.child(\\\"test.txt\\\").path()],\\n\\n \\\"test.txt\\\",\\n\\n false,\\n\\n )\\n\\n .unwrap();\\n\\n\\n\\n commit(object_id, &repo);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"tests/fs-tests.rs\",\n \"rank\": 63,\n \"score\": 193830.38380080965\n },\n {\n \"content\": \"/// Returns true if the specified directory does not contain any files\\n\\npub fn dir_is_empty(dir: impl AsRef<Path>) -> Result<bool> {\\n\\n Ok(fs::read_dir(dir)?.next().is_none())\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/ocfl/util.rs\",\n \"rank\": 64,\n \"score\": 193659.70140991977\n },\n {\n \"content\": \"fn init_new_repo(s3_client: &S3Client, layout: Option<&StorageLayout>) -> Result<()> {\\n\\n if !s3_client.list_dir(\\\"\\\")?.is_empty() {\\n\\n return Err(RocflError::IllegalState(\\n\\n \\\"Cannot create new repository. Storage root must be empty\\\".to_string(),\\n\\n ));\\n\\n }\\n\\n\\n\\n info!(\\n\\n \\\"Initializing OCFL storage root in bucket {} under prefix {}\\\",\\n\\n s3_client.bucket, s3_client.prefix\\n\\n );\\n\\n\\n\\n s3_client.put_object_bytes(\\n\\n REPO_NAMASTE_FILE,\\n\\n Bytes::from(ROOT_NAMASTE_CONTENT.as_bytes()),\\n\\n Some(TYPE_PLAIN),\\n\\n )?;\\n\\n\\n\\n s3_client.put_object_bytes(\\n\\n OCFL_SPEC_FILE,\\n\",\n \"file_path\": \"src/ocfl/store/s3.rs\",\n \"rank\": 65,\n \"score\": 193504.6692003283\n },\n {\n \"content\": \"pub fn has_warnings(result: &ObjectValidationResult, expected_warnings: &[ValidationWarning]) {\\n\\n for expected in expected_warnings {\\n\\n assert!(\\n\\n result.warnings().contains(expected),\\n\\n \\\"Expected warnings to contain {:?}. Found: {:?}\\\",\\n\\n expected,\\n\\n result.warnings()\\n\\n );\\n\\n }\\n\\n assert_eq!(\\n\\n expected_warnings.len(),\\n\\n result.warnings().len(),\\n\\n \\\"Expected {} warnings; found {}: {:?}\\\",\\n\\n expected_warnings.len(),\\n\\n result.warnings().len(),\\n\\n result.warnings()\\n\\n )\\n\\n}\\n\\n\\n\",\n \"file_path\": \"tests/common/mod.rs\",\n \"rank\": 66,\n \"score\": 192478.014905773\n },\n {\n \"content\": \"pub fn has_errors(result: &ObjectValidationResult, expected_errors: &[ValidationError]) {\\n\\n for expected in expected_errors {\\n\\n assert!(\\n\\n result.errors().contains(expected),\\n\\n \\\"Expected errors to contain {:?}. Found: {:?}\\\",\\n\\n expected,\\n\\n result.errors()\\n\\n );\\n\\n }\\n\\n assert_eq!(\\n\\n expected_errors.len(),\\n\\n result.errors().len(),\\n\\n \\\"Expected {} errors; found {}: {:?}\\\",\\n\\n expected_errors.len(),\\n\\n result.errors().len(),\\n\\n result.errors()\\n\\n )\\n\\n}\\n\\n\\n\",\n \"file_path\": \"tests/common/mod.rs\",\n \"rank\": 67,\n \"score\": 192478.014905773\n },\n {\n \"content\": \"/// Trims all lead and trailing slashes from the path\\n\\npub fn trim_slashes(path: &str) -> &str {\\n\\n trim_trailing_slashes(trim_leading_slashes(path))\\n\\n}\\n\",\n \"file_path\": \"src/ocfl/util.rs\",\n \"rank\": 68,\n \"score\": 190767.54048391624\n },\n {\n \"content\": \"#[test]\\n\\nfn create_new_flat_repo_empty_dir() -> Result<()> {\\n\\n let root = TempDir::new().unwrap();\\n\\n let temp = TempDir::new().unwrap();\\n\\n\\n\\n let repo = OcflRepo::init_fs_repo(\\n\\n root.path(),\\n\\n None,\\n\\n Some(StorageLayout::new(\\n\\n LayoutExtensionName::FlatDirectLayout,\\n\\n None,\\n\\n )?),\\n\\n )?;\\n\\n\\n\\n assert_storage_root(&root);\\n\\n assert_layout_extension(\\n\\n &root,\\n\\n \\\"0002-flat-direct-storage-layout\\\",\\n\\n r#\\\"{\\n\\n \\\"extensionName\\\": \\\"0002-flat-direct-storage-layout\\\"\\n\\n}\\\"#,\\n\",\n \"file_path\": \"tests/fs-tests.rs\",\n \"rank\": 69,\n \"score\": 190218.3498617914\n },\n {\n \"content\": \"/// Trims all trailing slashes from the path\\n\\npub fn trim_trailing_slashes(path: &str) -> &str {\\n\\n path.trim_end_matches('/')\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/ocfl/util.rs\",\n \"rank\": 70,\n \"score\": 187465.46683819656\n },\n {\n \"content\": \"/// Trims all trailing slashes from the path\\n\\npub fn trim_leading_slashes(path: &str) -> &str {\\n\\n path.trim_start_matches('/')\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/ocfl/util.rs\",\n \"rank\": 71,\n \"score\": 187465.46683819656\n },\n {\n \"content\": \"/// Identical to `fs::remove_file()` except `NotFound` errors are ignored\\n\\npub fn remove_file_ignore_not_found(path: impl AsRef<Path>) -> io::Result<()> {\\n\\n if let Err(e) = fs::remove_file(path) {\\n\\n if e.kind() != ErrorKind::NotFound {\\n\\n return Err(e);\\n\\n }\\n\\n }\\n\\n Ok(())\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/ocfl/util.rs\",\n \"rank\": 72,\n \"score\": 186375.18347144584\n },\n {\n \"content\": \"#[test]\\n\\nfn get_staged_object_file_when_exists_in_prior_version() -> Result<()> {\\n\\n let root = TempDir::new().unwrap();\\n\\n let temp = TempDir::new().unwrap();\\n\\n\\n\\n let repo = default_repo(root.path());\\n\\n\\n\\n let object_id = \\\"get file\\\";\\n\\n\\n\\n create_example_object(object_id, &repo, &temp);\\n\\n\\n\\n repo.move_files_external(\\n\\n object_id,\\n\\n &vec![create_file(&temp, \\\"blah\\\", \\\"blah\\\").path()],\\n\\n \\\"blah\\\",\\n\\n )?;\\n\\n\\n\\n let mut out: Vec<u8> = Vec::new();\\n\\n\\n\\n repo.get_staged_object_file(object_id, &lpath(\\\"a/file1.txt\\\"), &mut out)?;\\n\\n\\n\\n assert_eq!(\\\"File One\\\", String::from_utf8(out).unwrap());\\n\\n\\n\\n validate_repo(&repo);\\n\\n Ok(())\\n\\n}\\n\\n\\n\",\n \"file_path\": \"tests/fs-tests.rs\",\n \"rank\": 73,\n \"score\": 186262.31151256524\n },\n {\n \"content\": \"#[test]\\n\\nfn create_new_repo_empty_dir_custom_layout() -> Result<()> {\\n\\n let root = TempDir::new().unwrap();\\n\\n let temp = TempDir::new().unwrap();\\n\\n\\n\\n let layout = r#\\\"{\\n\\n \\\"extensionName\\\": \\\"0004-hashed-n-tuple-storage-layout\\\",\\n\\n \\\"digestAlgorithm\\\": \\\"sha512\\\",\\n\\n \\\"tupleSize\\\": 5,\\n\\n \\\"numberOfTuples\\\": 2,\\n\\n \\\"shortObjectRoot\\\": true\\n\\n}\\\"#;\\n\\n\\n\\n let repo = OcflRepo::init_fs_repo(\\n\\n root.path(),\\n\\n None,\\n\\n Some(StorageLayout::new(\\n\\n LayoutExtensionName::HashedNTupleLayout,\\n\\n Some(layout.as_bytes()),\\n\\n )?),\\n\\n )?;\\n\",\n \"file_path\": \"tests/fs-tests.rs\",\n \"rank\": 74,\n \"score\": 185984.27079025412\n },\n {\n \"content\": \"#[test]\\n\\nfn create_new_object() {\\n\\n skip_or_run_s3_test(\\n\\n \\\"create_new_object\\\",\\n\\n |s3_client: S3Client, prefix: String, staging: TempDir, temp: TempDir| {\\n\\n let repo = default_repo(&prefix, staging.path());\\n\\n let object_id = \\\"s3-object\\\";\\n\\n\\n\\n repo.create_object(object_id, DigestAlgorithm::Sha256, \\\"content\\\", 0)\\n\\n .unwrap();\\n\\n repo.copy_files_external(\\n\\n object_id,\\n\\n &vec![create_file(&temp, \\\"test.txt\\\", \\\"testing\\\").path()],\\n\\n \\\"/\\\",\\n\\n false,\\n\\n )\\n\\n .unwrap();\\n\\n repo.commit(object_id, CommitMeta::new(), None, false)\\n\\n .unwrap();\\n\\n\\n\\n let object = repo.get_object(object_id, VersionRef::Head).unwrap();\\n\",\n \"file_path\": \"tests/s3-tests.rs\",\n \"rank\": 75,\n \"score\": 184019.23900004878\n },\n {\n \"content\": \"fn validate_non_conflicting<F>(paths: &HashSet<&str>, error: F)\\n\\nwhere\\n\\n F: Fn(&str, &str),\\n\\n{\\n\\n for path in paths {\\n\\n let mut part = *path;\\n\\n while let Some(index) = part.rfind('/') {\\n\\n part = &part[0..index];\\n\\n if paths.contains(part) {\\n\\n error(path, part);\\n\\n break;\\n\\n }\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/ocfl/validate/serde.rs\",\n \"rank\": 76,\n \"score\": 183610.61979186494\n },\n {\n \"content\": \"#[test]\\n\\n#[should_panic(expected = \\\"Cannot create object object 2 because an object already exists at\\\")]\\n\\nfn fail_object_commit_when_no_known_storage_layout_and_root_specified_and_obj_already_there() {\\n\\n let root = TempDir::new().unwrap();\\n\\n let temp = TempDir::new().unwrap();\\n\\n let repo = OcflRepo::fs_repo(root.path(), None).unwrap();\\n\\n\\n\\n let object_id = \\\"custom_layout\\\";\\n\\n let object_root = \\\"random/path/to/object\\\";\\n\\n\\n\\n repo.create_object(object_id, DigestAlgorithm::Sha256, \\\"content\\\", 0)\\n\\n .unwrap();\\n\\n\\n\\n repo.copy_files_external(\\n\\n object_id,\\n\\n &vec![create_file(&temp, \\\"test.txt\\\", \\\"testing\\\").path()],\\n\\n \\\"test.txt\\\",\\n\\n false,\\n\\n )\\n\\n .unwrap();\\n\\n\\n\\n repo.commit(object_id, CommitMeta::new(), Some(object_root), false)\\n\",\n \"file_path\": \"tests/fs-tests.rs\",\n \"rank\": 77,\n \"score\": 182874.08302784886\n },\n {\n \"content\": \"pub fn no_warnings_storage(result: &StorageValidationResult) {\\n\\n assert!(\\n\\n result.warnings().is_empty(),\\n\\n \\\"Expected no warnings; found: {:?}\\\",\\n\\n result.warnings()\\n\\n )\\n\\n}\\n\\n\\n\",\n \"file_path\": \"tests/common/mod.rs\",\n \"rank\": 78,\n \"score\": 182462.9196899529\n },\n {\n \"content\": \"pub fn no_errors_storage(result: &StorageValidationResult) {\\n\\n assert!(\\n\\n result.errors().is_empty(),\\n\\n \\\"Expected no errors; found: {:?}\\\",\\n\\n result.errors()\\n\\n )\\n\\n}\\n\",\n \"file_path\": \"tests/common/mod.rs\",\n \"rank\": 79,\n \"score\": 182462.9196899529\n },\n {\n \"content\": \"/// Returns the path to the root of the staging extension\\n\\npub fn staging_extension_path<P>(storage_root: P) -> PathBuf\\n\\nwhere\\n\\n P: AsRef<Path>,\\n\\n{\\n\\n let mut extensions = extensions_path(storage_root);\\n\\n extensions.push(ROCFL_STAGING_EXTENSION);\\n\\n extensions\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/ocfl/paths.rs\",\n \"rank\": 80,\n \"score\": 181140.12824217117\n },\n {\n \"content\": \"fn is_s3(config: &Config) -> bool {\\n\\n config.bucket.is_some()\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/cmd/mod.rs\",\n \"rank\": 81,\n \"score\": 180112.91354345798\n },\n {\n \"content\": \"fn defaulted_str<'a>(value: &'a Option<String>, default: &'a str) -> &'a str {\\n\\n match value {\\n\\n Some(value) => value.as_ref(),\\n\\n None => default,\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/cmd/diff.rs\",\n \"rank\": 82,\n \"score\": 179314.4092117156\n },\n {\n \"content\": \"/// Changes `\\\\\\\\` to `/` on Windows\\n\\npub fn convert_backslash_to_forward(path: &str) -> Cow<str> {\\n\\n if BACKSLASH_SEPARATOR && path.contains('\\\\\\\\') {\\n\\n return Cow::Owned(path.replace('\\\\\\\\', \\\"/\\\"));\\n\\n }\\n\\n path.into()\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/ocfl/util.rs\",\n \"rank\": 83,\n \"score\": 178783.50778988205\n },\n {\n \"content\": \"/// Changes `/` to `\\\\` on Windows\\n\\npub fn convert_forwardslash_to_back(path: &str) -> Cow<str> {\\n\\n if BACKSLASH_SEPARATOR && path.contains('/') {\\n\\n return Cow::Owned(path.replace('/', \\\"\\\\\\\\\\\"));\\n\\n }\\n\\n path.into()\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/ocfl/util.rs\",\n \"rank\": 84,\n \"score\": 178783.50778988205\n },\n {\n \"content\": \"#[test]\\n\\n#[should_panic(expected = \\\"Expected object to exist at\\\")]\\n\\nfn fail_when_incorrect_object_in_root() {\\n\\n let root = TempDir::new().unwrap();\\n\\n let temp = TempDir::new().unwrap();\\n\\n\\n\\n let repo = OcflRepo::init_fs_repo(\\n\\n root.path(),\\n\\n None,\\n\\n Some(StorageLayout::new(LayoutExtensionName::FlatDirectLayout, None).unwrap()),\\n\\n )\\n\\n .unwrap();\\n\\n\\n\\n let object_id_1 = \\\"original\\\";\\n\\n let object_id_2 = \\\"different\\\";\\n\\n\\n\\n repo.create_object(object_id_1, DigestAlgorithm::Sha256, \\\"content\\\", 0)\\n\\n .unwrap();\\n\\n repo.move_files_external(\\n\\n object_id_1,\\n\\n &vec![create_file(&temp, \\\"file1.txt\\\", \\\"one\\\").path()],\\n\\n \\\"/\\\",\\n\",\n \"file_path\": \"tests/fs-tests.rs\",\n \"rank\": 85,\n \"score\": 178707.6150880159\n },\n {\n \"content\": \"fn read_spec(name: &str) -> String {\\n\\n let mut path = PathBuf::from(env!(\\\"CARGO_MANIFEST_DIR\\\"));\\n\\n path.push(\\\"resources\\\");\\n\\n path.push(\\\"main\\\");\\n\\n path.push(\\\"specs\\\");\\n\\n path.push(name);\\n\\n fs::read_to_string(path).unwrap()\\n\\n}\\n\\n\\n\",\n \"file_path\": \"tests/fs-tests.rs\",\n \"rank\": 86,\n \"score\": 178335.5375745715\n },\n {\n \"content\": \"fn bucket() -> String {\\n\\n env::var(BUCKET_VAR).unwrap()\\n\\n}\\n\\n\\n\",\n \"file_path\": \"tests/s3-tests.rs\",\n \"rank\": 87,\n \"score\": 177598.73012218863\n },\n {\n \"content\": \"/// Joins two string path parts, inserting at `/` if needed\\n\\npub fn join(part1: &str, part2: &str) -> String {\\n\\n let mut joined = match part1.ends_with('/') {\\n\\n true => part1[..part1.len() - 1].to_string(),\\n\\n false => part1.to_string(),\\n\\n };\\n\\n\\n\\n if !part2.is_empty() {\\n\\n if (!joined.is_empty() || part1 == \\\"/\\\") && !part2.starts_with('/') {\\n\\n joined.push('/');\\n\\n }\\n\\n joined.push_str(part2);\\n\\n }\\n\\n\\n\\n joined\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/ocfl/paths.rs\",\n \"rank\": 88,\n \"score\": 177102.8098935499\n },\n {\n \"content\": \"fn create_logical_dirs(object: &ObjectVersion) -> HashSet<LogicalPath> {\\n\\n let mut dirs = HashSet::with_capacity(object.state.len());\\n\\n\\n\\n dirs.insert(\\\"\\\".try_into().unwrap());\\n\\n\\n\\n for path in object.state.keys() {\\n\\n let mut parent = path.parent();\\n\\n while !parent.is_empty() {\\n\\n let next = parent.parent();\\n\\n dirs.insert(parent);\\n\\n parent = next;\\n\\n }\\n\\n }\\n\\n\\n\\n dirs\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/cmd/list.rs\",\n \"rank\": 89,\n \"score\": 176397.48808580218\n },\n {\n \"content\": \"pub fn root_warning(code: WarnCode, text: &str) -> ValidationWarning {\\n\\n ValidationWarning::new(ProblemLocation::ObjectRoot, code, text.to_string())\\n\\n}\\n\\n\\n\",\n \"file_path\": \"tests/common/mod.rs\",\n \"rank\": 90,\n \"score\": 176223.04353901144\n },\n {\n \"content\": \"pub fn root_error(code: ErrorCode, text: &str) -> ValidationError {\\n\\n ValidationError::new(ProblemLocation::ObjectRoot, code, text.to_string())\\n\\n}\\n\\n\\n\",\n \"file_path\": \"tests/common/mod.rs\",\n \"rank\": 91,\n \"score\": 176223.04353901144\n },\n {\n \"content\": \"fn missing_version_field(field: &str, version: &str, result: &ParseValidationResult) {\\n\\n result.error(\\n\\n ErrorCode::E048,\\n\\n format!(\\n\\n \\\"Inventory version '{}' is missing required key '{}'\\\",\\n\\n version, field\\n\\n ),\\n\\n );\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/ocfl/validate/serde.rs\",\n \"rank\": 92,\n \"score\": 174976.97617412274\n },\n {\n \"content\": \"fn duplicate_version_field(field: &str, version: &str, result: &ParseValidationResult) {\\n\\n result.error(\\n\\n ErrorCode::E033,\\n\\n format!(\\n\\n \\\"Inventory version '{}' contains duplicate key '{}'\\\",\\n\\n version, field\\n\\n ),\\n\\n );\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/ocfl/validate/serde.rs\",\n \"rank\": 93,\n \"score\": 174976.97617412274\n },\n {\n \"content\": \"fn unknown_version_field(field: &str, version: &str, result: &ParseValidationResult) {\\n\\n result.error(\\n\\n ErrorCode::E102,\\n\\n format!(\\n\\n \\\"Inventory version '{}' contains unknown key '{}'\\\",\\n\\n version, field\\n\\n ),\\n\\n );\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/ocfl/validate/serde.rs\",\n \"rank\": 94,\n \"score\": 174976.97617412274\n },\n {\n \"content\": \"#[test]\\n\\nfn create_object_with_non_standard_config() {\\n\\n let root = TempDir::new().unwrap();\\n\\n let temp = TempDir::new().unwrap();\\n\\n\\n\\n let repo = default_repo(root.path());\\n\\n\\n\\n let object_id = \\\"non-standard\\\";\\n\\n\\n\\n assert_staged_obj_count(&repo, 0);\\n\\n repo.create_object(object_id, DigestAlgorithm::Sha256, \\\"content-dir\\\", 5)\\n\\n .unwrap();\\n\\n assert_staged_obj_count(&repo, 1);\\n\\n\\n\\n create_file(&temp, \\\"test.txt\\\", \\\"testing\\\");\\n\\n\\n\\n repo.copy_files_external(\\n\\n object_id,\\n\\n &vec![temp.child(\\\"test.txt\\\").path()],\\n\\n \\\"test.txt\\\",\\n\\n false,\\n\",\n \"file_path\": \"tests/fs-tests.rs\",\n \"rank\": 95,\n \"score\": 173580.4199686878\n },\n {\n \"content\": \"#[test]\\n\\nfn create_new_repo_empty_dir() {\\n\\n skip_or_run_s3_test(\\n\\n \\\"create_new_repo_empty_dir\\\",\\n\\n |s3_client: S3Client, prefix: String, staging: TempDir, temp: TempDir| {\\n\\n let repo = default_repo(&prefix, staging.path());\\n\\n\\n\\n assert_file(&s3_client, &prefix, \\\"0=ocfl_1.0\\\", \\\"ocfl_1.0\\\\n\\\");\\n\\n assert_file(\\n\\n &s3_client,\\n\\n &prefix,\\n\\n \\\"ocfl_1.0.txt\\\",\\n\\n &read_spec(\\\"ocfl_1.0.txt\\\"),\\n\\n );\\n\\n assert_storage_layout(\\n\\n &s3_client,\\n\\n &prefix,\\n\\n \\\"0004-hashed-n-tuple-storage-layout\\\",\\n\\n DEFAULT_LAYOUT,\\n\\n );\\n\\n\\n\",\n \"file_path\": \"tests/s3-tests.rs\",\n \"rank\": 96,\n \"score\": 172891.26101943158\n },\n {\n \"content\": \"fn missing_version_field_warn(field: &str, version: &str, result: &ParseValidationResult) {\\n\\n result.warn(\\n\\n WarnCode::W007,\\n\\n format!(\\n\\n \\\"Inventory version '{}' is missing recommended key '{}'\\\",\\n\\n version, field\\n\\n ),\\n\\n );\\n\\n}\\n\\n\\n\\n#[cfg(test)]\\n\\nmod tests {\\n\\n use crate::ocfl::validate::serde::parse;\\n\\n use crate::ocfl::validate::{ParseResult, ParseValidationResult};\\n\\n use crate::ocfl::{ErrorCode, ProblemLocation, ValidationError, ValidationWarning, WarnCode};\\n\\n\\n\\n #[test]\\n\\n fn head_wrong_type() {\\n\\n let json = r###\\\"{\\n\\n \\\"id\\\": \\\"urn:example:test\\\",\\n\",\n \"file_path\": \"src/ocfl/validate/serde.rs\",\n \"rank\": 97,\n \"score\": 172584.25387953207\n },\n {\n \"content\": \"fn edit_config() -> Result<()> {\\n\\n match config::config_path() {\\n\\n Some(config_path) => {\\n\\n if !config_path.exists() {\\n\\n fs::create_dir_all(config_path.parent().unwrap())?;\\n\\n let mut file = fs::File::create(&config_path)?;\\n\\n write!(\\n\\n file,\\n\\n \\\"{}\\\",\\n\\n include_str!(\\\"../../resources/main/files/config.toml\\\")\\n\\n )?;\\n\\n }\\n\\n\\n\\n edit::edit_file(&config_path)?;\\n\\n Ok(())\\n\\n }\\n\\n None => Err(RocflError::General(\\n\\n \\\"Failed to find rocfl config\\\".to_string(),\\n\\n )),\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/cmd/mod.rs\",\n \"rank\": 98,\n \"score\": 171996.26284402178\n },\n {\n \"content\": \"#[test]\\n\\nfn list_all_objects() -> Result<()> {\\n\\n let repo_root = create_repo_root(\\\"multiple-objects\\\");\\n\\n let repo = OcflRepo::fs_repo(&repo_root, None)?;\\n\\n\\n\\n let mut objects: Vec<ObjectVersionDetails> = repo.list_objects(None)?.flatten().collect();\\n\\n\\n\\n sort_obj_details(&mut objects);\\n\\n\\n\\n assert_eq!(3, objects.len());\\n\\n\\n\\n assert_eq!(\\n\\n objects.remove(0),\\n\\n ObjectVersionDetails {\\n\\n id: \\\"o1\\\".to_string(),\\n\\n object_root: repo_root\\n\\n .join(\\\"235\\\")\\n\\n .join(\\\"2da\\\")\\n\\n .join(\\\"728\\\")\\n\\n .join(\\\"2352da7280f1decc3acf1ba84eb945c9fc2b7b541094e1d0992dbffd1b6664cc\\\")\\n\\n .to_string_lossy()\\n\",\n \"file_path\": \"tests/fs-tests.rs\",\n \"rank\": 99,\n \"score\": 171810.13127900875\n }\n]","isConversational":false}}},{"rowIdx":2396,"cells":{"lang":{"kind":"string","value":"Rust"},"file_path":{"kind":"string","value":"src/core/mod.rs"},"repo_name":{"kind":"string","value":"yamafaktory/hypergraph"},"commit":{"kind":"string","value":"e253ed0f0c34af8e3d07e753323c457644aaa819"},"file_code":{"kind":"string","value":"pub(crate) mod bi_hash_map;\n#[doc(hidden)]\npub mod errors;\n#[doc(hidden)]\npub mod hyperedges;\nmod shared;\nmod utils;\n#[doc(hidden)]\npub mod vertices;\n\nuse bi_hash_map::BiHashMap;\nuse indexmap::{IndexMap, IndexSet};\nuse std::{\n fmt::{Debug, Display, Formatter, Result},\n hash::Hash,\n};\n\npub trait SharedTrait: Copy + Debug + Display + Eq + Hash {}\n\nimpl<T> SharedTrait for T where T: Copy + Debug + Display + Eq + Hash {}\n\n#[derive(Clone, Copy, Debug, Eq, Hash, Ord, PartialEq, PartialOrd)]\npub struct VertexIndex(pub usize);\n\nimpl Display for VertexIndex {\n fn fmt(&self, f: &mut Formatter<'_>) -> Result {\n write!(f, \"{}\", self.0)\n }\n}\n\n#[derive(Clone, Copy, Debug, Eq, Hash, Ord, PartialEq, PartialOrd)]\npub struct HyperedgeIndex(pub usize);\n\nimpl Display for HyperedgeIndex {\n fn fmt(&self, f: &mut Formatter<'_>) -> Result {\n write!(f, \"{}\", self.0)\n }\n}\n\n#[derive(Clone, Debug, Eq, Hash, Ord, PartialEq, PartialOrd)]\npub struct HyperedgeKey<HE> {\n vertices: Vec<usize>,\n weight: HE,\n}\n\nimpl<HE> HyperedgeKey<HE> {\n \n pub(crate) fn new(vertices: Vec<usize>, weight: HE) -> HyperedgeKey<HE> {\n Self { vertices, weight }\n }\n}\n\npub struct Hypergraph<V, HE> {\n \n \n \n pub vertices: IndexMap<V, IndexSet<usize>>,\n\n \n \n \n pub hyperedges: IndexSet<HyperedgeKey<HE>>,\n\n \n hyperedges_mapping: BiHashMap<HyperedgeIndex>,\n vertices_mapping: BiHashMap<VertexIndex>,\n\n \n hyperedges_count: usize,\n vertices_count: usize,\n}\n\nimpl<V: Eq + Hash + Debug, HE: Debug> Debug for Hypergraph<V, HE> {\n fn fmt(&self, f: &mut Formatter<'_>) -> Result {\n f.debug_struct(\"Hypergraph\")\n .field(\"vertices\", &self.vertices)\n .field(\"hyperedges\", &self.hyperedges)\n .finish()\n }\n}\n\nimpl<V, HE> Default for Hypergraph<V, HE>\nwhere\n V: SharedTrait,\n HE: SharedTrait,\n{\n fn default() -> Self {\n Hypergraph::new()\n }\n}\n\nimpl<V, HE> Hypergraph<V, HE>\nwhere\n V: SharedTrait,\n HE: SharedTrait,\n{\n \n pub fn clear(&mut self) {\n \n self.hyperedges.clear();\n self.vertices.clear();\n\n \n self.hyperedges_mapping = BiHashMap::default();\n self.vertices_mapping = BiHashMap::default();\n\n \n self.hyperedges_count = 0;\n self.vertices_count = 0;\n }\n\n \n pub fn new() -> Self {\n Hypergraph::with_capacity(0, 0)\n }\n\n \n pub fn with_capacity(vertices: usize, hyperedges: usize) -> Self {\n Hypergraph {\n hyperedges_count: 0,\n hyperedges_mapping: BiHashMap::default(),\n hyperedges: IndexSet::with_capacity(hyperedges),\n vertices_count: 0,\n vertices_mapping: BiHashMap::default(),\n vertices: IndexMap::with_capacity(vertices),\n }\n }\n}\n"},"prefix":{"kind":"string","value":"pub(crate) mod bi_hash_map;\n#[doc(hidden)]\npub mod errors;\n#[doc(hidden)]\npub mod hyperedges;\nmod shared;\nmod utils;\n#[doc(hidden)]\npub mod vertices;\n\nuse bi_hash_map::BiHashMap;\nuse indexmap::{IndexMap, IndexSet};\nuse std::{\n fmt::{Debug, Display, Formatter, Result},\n hash::Hash,\n};\n\npub trait SharedTrait: Copy + Debug + Display + Eq + Hash {}\n\nimpl<T> SharedTrait for T where T: Copy + Debug + Display + Eq + Hash {}\n\n#[derive(Clone, Copy, Debug, Eq, Hash, Ord, PartialEq, PartialOrd)]\npub struct VertexIndex(pub usize);\n\nimpl Display for VertexIndex {\n fn fmt(&self, f: &mut Formatter<'_>) -> Result {\n write!(f, \"{}\", self.0)\n }\n}\n\n#[derive(Clone, Copy, Debug, Eq, Hash, Ord, PartialEq, PartialOrd)]\npub struct HyperedgeIndex(pub usize);\n\nimpl Display for HyperedgeIndex {\n fn fmt(&self, f: &mut Formatter<'_>) -> Result {\n write!(f, \"{}\", self.0)\n }\n}\n\n#[derive(Clone, Debug, Eq, Hash, Ord, PartialEq, PartialOrd)]\npub struct HyperedgeKey<HE> {\n vertices: Vec<usize>,\n weight: HE,\n}\n\nimpl<HE> HyperedgeKey<HE> {\n \n pub(crate) fn new(vertices: Vec<usize>, weight: HE) -> HyperedgeKey<HE> {\n Self { vertices, weight }\n }\n}\n\npub struct Hypergraph<V, HE> {\n \n \n \n pub vertices: IndexMap<V, IndexSet<usize>>,\n\n \n \n \n pub hyperedges: IndexSet<HyperedgeKey<HE>>,\n\n \n hyperedges_mapping: BiHashMap<HyperedgeIndex>,\n vertices_mapping: BiHashMap<VertexIndex>,\n\n \n hyperedges_count: usize,\n vertices_count: usize,\n}\n\nimpl<V: Eq + Hash + Debug, HE: Debug> Debug for Hypergraph<V, HE> {\n fn fmt(&self, f: &mut Formatter<'_>) -> Result {\n f.debug_struct(\"Hypergraph\")\n .field(\"vertices\", &self.vertices)\n .field(\"hyperedges\", &self.hyperedges)\n .finish()\n }\n}\n\nimpl<V, HE> Default for Hypergraph<V, HE>\nwhere\n V: SharedTrait,\n HE: SharedTrait,\n{\n fn default() -> Self {\n Hypergraph::new()\n }\n}\n\nimpl<V, HE> Hypergraph<V, HE>\nwhere\n V: SharedTrait,\n HE: SharedTrait,\n{\n \n pub fn clear(&mut self) {\n \n self.hyperedges.clear();\n self.vertices.clear();\n\n \n self.hyperedges_mapping = BiHashMap::default();\n self.vertices_mapping = BiHashMap::default();\n\n \n self.hyperedges_count = 0;\n self.vertices_count = 0;\n }\n\n \n pub fn new() -> Self {\n Hypergraph::with_capacity(0, 0)\n }\n\n \n "},"suffix":{"kind":"string","value":"\n}\n"},"middle":{"kind":"string","value":"pub fn with_capacity(vertices: usize, hyperedges: usize) -> Self {\n Hypergraph {\n hyperedges_count: 0,\n hyperedges_mapping: BiHashMap::default(),\n hyperedges: IndexSet::with_capacity(hyperedges),\n vertices_count: 0,\n vertices_mapping: BiHashMap::default(),\n vertices: IndexMap::with_capacity(vertices),\n }\n }"},"strategy":{"kind":"string","value":"function_block-full_function"},"context_items":{"kind":"list like","value":[{"content":"use crate::{errors::HypergraphError, HyperedgeIndex, HyperedgeKey, Hypergraph, SharedTrait};\n\n\n\nimpl<V, HE> Hypergraph<V, HE>\n\nwhere\n\n V: SharedTrait,\n\n HE: SharedTrait,\n\n{\n\n /// Updates the weight of a hyperedge by index.\n\n pub fn update_hyperedge_weight(\n\n &mut self,\n\n hyperedge_index: HyperedgeIndex,\n\n weight: HE,\n\n ) -> Result<(), HypergraphError<V, HE>> {\n\n let internal_index = self.get_internal_hyperedge(hyperedge_index)?;\n\n\n\n let HyperedgeKey {\n\n vertices,\n\n weight: previous_weight,\n\n } = self\n\n .hyperedges\n","file_path":"src/core/hyperedges/update_hyperedge_weight.rs","rank":1,"score":58277.35562021103},{"content":"use crate::{errors::HypergraphError, HyperedgeIndex, Hypergraph, SharedTrait};\n\n\n\nimpl<V, HE> Hypergraph<V, HE>\n\nwhere\n\n V: SharedTrait,\n\n HE: SharedTrait,\n\n{\n\n /// Gets the weight of a hyperedge from its index.\n\n pub fn get_hyperedge_weight(\n\n &self,\n\n hyperedge_index: HyperedgeIndex,\n\n ) -> Result<HE, HypergraphError<V, HE>> {\n\n let internal_index = self.get_internal_hyperedge(hyperedge_index)?;\n\n\n\n let hyperedge_key = self\n\n .hyperedges\n\n .get_index(internal_index)\n\n .ok_or(HypergraphError::InternalVertexIndexNotFound(internal_index))?;\n\n\n\n Ok(hyperedge_key.weight)\n\n }\n\n}\n","file_path":"src/core/hyperedges/get_hyperedge_weight.rs","rank":2,"score":58272.25236452031},{"content":" .get_index(internal_index)\n\n .map(|hyperedge_key| hyperedge_key.to_owned())\n\n .ok_or(HypergraphError::InternalHyperedgeIndexNotFound(\n\n internal_index,\n\n ))?;\n\n\n\n // Return an error if the new weight is the same as the previous one.\n\n if weight == previous_weight {\n\n return Err(HypergraphError::HyperedgeWeightUnchanged {\n\n index: hyperedge_index,\n\n weight,\n\n });\n\n }\n\n\n\n // Return an error if the new weight is already assigned to another\n\n // hyperedge.\n\n // We can't use the contains method here since the key is a combination\n\n // of the weight and the vertices.\n\n if self.hyperedges.iter().any(\n\n |HyperedgeKey {\n","file_path":"src/core/hyperedges/update_hyperedge_weight.rs","rank":3,"score":58262.49987200435},{"content":" weight: current_weight,\n\n ..\n\n }| { *current_weight == weight },\n\n ) {\n\n return Err(HypergraphError::HyperedgeWeightAlreadyAssigned(weight));\n\n }\n\n\n\n // IndexMap doesn't allow holes by design, see:\n\n // https://github.com/bluss/indexmap/issues/90#issuecomment-455381877\n\n //\n\n // As a consequence, we have two options. Either we use shift_remove\n\n // and it will result in an expensive regeneration of all the indexes\n\n // in the map/set or we use swap_remove methods and deal with the fact\n\n // that the last element will be swapped in place of the removed one\n\n // and will thus get a new index.\n\n //\n\n // In our case, since we are inserting an entry upfront, it circumvents\n\n // the aforementioned issue.\n\n //\n\n // First case: index alteration is avoided.\n","file_path":"src/core/hyperedges/update_hyperedge_weight.rs","rank":4,"score":58258.480025744015},{"content":" // ^ ^\n\n // | |\n\n // +--+\n\n // 2.Swap and remove\n\n //\n\n // Insert the new entry.\n\n // Since we have already checked that the new weight is not in the\n\n // map, we can safely perform the operation without checking its output.\n\n self.hyperedges.insert(HyperedgeKey { vertices, weight });\n\n\n\n // Swap and remove by index.\n\n // Since we know that the internal index is correct, we can safely\n\n // perform the operation without checking its output.\n\n self.hyperedges.swap_remove_index(internal_index);\n\n\n\n // Return a unit.\n\n Ok(())\n\n }\n\n}\n","file_path":"src/core/hyperedges/update_hyperedge_weight.rs","rank":5,"score":58256.41754124734},{"content":" //\n\n // Entry to remove\n\n // | 1.Insert new entry\n\n // | |\n\n // v v\n\n // [a, b, c] -> [a, b, c, d] -> [d, b, c, _]\n\n // ^ ^\n\n // | |\n\n // +--------+\n\n // 2.Swap and remove\n\n //\n\n // -----------------------------------------\n\n //\n\n // Second case: no index alteration.\n\n //\n\n // Entry to remove\n\n // | 1.Insert new entry\n\n // | |\n\n // v v\n\n // [a, b, c] -> [a, b, c, d] -> [a, b, d, _]\n","file_path":"src/core/hyperedges/update_hyperedge_weight.rs","rank":6,"score":58250.00409462207},{"content":"use crate::{\n\n core::utils::are_slices_equal, errors::HypergraphError, HyperedgeIndex, HyperedgeKey,\n\n Hypergraph, SharedTrait, VertexIndex,\n\n};\n\n\n\nuse itertools::Itertools;\n\n\n\nimpl<V, HE> Hypergraph<V, HE>\n\nwhere\n\n V: SharedTrait,\n\n HE: SharedTrait,\n\n{\n\n /// Updates the vertices of a hyperedge by index.\n\n pub fn update_hyperedge_vertices(\n\n &mut self,\n\n hyperedge_index: HyperedgeIndex,\n\n vertices: Vec<VertexIndex>,\n\n ) -> Result<(), HypergraphError<V, HE>> {\n\n // If the provided vertices are empty, skip the update.\n\n if vertices.is_empty() {\n","file_path":"src/core/hyperedges/update_hyperedge_vertices.rs","rank":7,"score":56845.41510880503},{"content":"use crate::{\n\n core::utils::are_slices_equal, errors::HypergraphError, HyperedgeIndex, Hypergraph,\n\n SharedTrait, VertexIndex,\n\n};\n\n\n\nuse itertools::Itertools;\n\n\n\nimpl<V, HE> Hypergraph<V, HE>\n\nwhere\n\n V: SharedTrait,\n\n HE: SharedTrait,\n\n{\n\n /// Contracts a set of the vertices of a hyperedge into one single vertex.\n\n /// Returns the updated vertices.\n\n /// Based on <https://en.wikipedia.org/wiki/Edge_contraction>\n\n pub fn contract_hyperedge_vertices(\n\n &mut self,\n\n hyperedge_index: HyperedgeIndex,\n\n vertices: Vec<VertexIndex>,\n\n target: VertexIndex,\n","file_path":"src/core/hyperedges/contract_hyperedge_vertices.rs","rank":8,"score":56841.94572036051},{"content":"use crate::{\n\n errors::HypergraphError, HyperedgeIndex, HyperedgeKey, Hypergraph, SharedTrait, VertexIndex,\n\n};\n\n\n\nimpl<V, HE> Hypergraph<V, HE>\n\nwhere\n\n V: SharedTrait,\n\n HE: SharedTrait,\n\n{\n\n /// Gets the vertices of a hyperedge.\n\n pub fn get_hyperedge_vertices(\n\n &self,\n\n hyperedge_index: HyperedgeIndex,\n\n ) -> Result<Vec<VertexIndex>, HypergraphError<V, HE>> {\n\n let internal_index = self.get_internal_hyperedge(hyperedge_index)?;\n\n\n\n let HyperedgeKey { vertices, .. } = self.hyperedges.get_index(internal_index).ok_or(\n\n HypergraphError::InternalHyperedgeIndexNotFound(internal_index),\n\n )?;\n\n\n\n self.get_vertices(vertices.to_owned())\n\n }\n\n}\n","file_path":"src/core/hyperedges/get_hyperedge_vertices.rs","rank":9,"score":56839.93150172768},{"content":" return Err(HypergraphError::HyperedgeUpdateNoVertices(hyperedge_index));\n\n }\n\n\n\n let internal_index = self.get_internal_hyperedge(hyperedge_index)?;\n\n\n\n let internal_vertices = self.get_internal_vertices(vertices)?;\n\n\n\n let HyperedgeKey {\n\n vertices: previous_vertices,\n\n weight,\n\n } = self\n\n .hyperedges\n\n .get_index(internal_index)\n\n .map(|hyperedge_key| hyperedge_key.to_owned())\n\n .ok_or(HypergraphError::InternalHyperedgeIndexNotFound(\n\n internal_index,\n\n ))?;\n\n\n\n // If the new vertices are the same as the old ones, skip the update.\n\n if are_slices_equal(&internal_vertices, &previous_vertices) {\n","file_path":"src/core/hyperedges/update_hyperedge_vertices.rs","rank":10,"score":56827.603645166964},{"content":" ) -> Result<Vec<VertexIndex>, HypergraphError<V, HE>> {\n\n // Get all the vertices of the hyperedge.\n\n let hyperedge_vertices = self.get_hyperedge_vertices(hyperedge_index)?;\n\n\n\n // Get the deduped vertices.\n\n let deduped_vertices = vertices.iter().sorted().dedup().collect_vec();\n\n\n\n // Check that the target is included in the deduped vertices.\n\n if !deduped_vertices\n\n .iter()\n\n .any(|¤t_index| current_index == &target)\n\n {\n\n return Err(HypergraphError::HyperedgeInvalidContraction {\n\n index: hyperedge_index,\n\n target,\n\n vertices: deduped_vertices.into_iter().cloned().collect(),\n\n });\n\n }\n\n\n\n // Get the vertices not found in the hyperedge.\n","file_path":"src/core/hyperedges/contract_hyperedge_vertices.rs","rank":11,"score":56827.3998387396},{"content":" return Err(HypergraphError::HyperedgeVerticesUnchanged(hyperedge_index));\n\n }\n\n\n\n // Find the vertices which have been added.\n\n let added = internal_vertices\n\n .iter()\n\n .fold(vec![], |mut acc: Vec<usize>, index| {\n\n if !previous_vertices\n\n .iter()\n\n .any(|current_index| current_index == index)\n\n {\n\n acc.push(*index)\n\n }\n\n\n\n acc\n\n })\n\n .into_iter()\n\n .sorted()\n\n .dedup()\n\n .collect_vec();\n","file_path":"src/core/hyperedges/update_hyperedge_vertices.rs","rank":12,"score":56826.90491271635},{"content":"\n\n // Insert the new entry.\n\n // Since we are not altering the weight, we can safely perform the\n\n // operation without checking its output.\n\n self.hyperedges.insert(HyperedgeKey {\n\n vertices: internal_vertices,\n\n weight,\n\n });\n\n\n\n // Swap and remove by index.\n\n // Since we know that the internal index is correct, we can safely\n\n // perform the operation without checking its output.\n\n self.hyperedges.swap_remove_index(internal_index);\n\n\n\n // Return a unit.\n\n Ok(())\n\n }\n\n}\n","file_path":"src/core/hyperedges/update_hyperedge_vertices.rs","rank":13,"score":56824.99544889156},{"content":" let vertices_not_found =\n\n deduped_vertices\n\n .iter()\n\n .fold(vec![], |mut acc: Vec<VertexIndex>, &index| {\n\n if !hyperedge_vertices\n\n .iter()\n\n .any(|¤t_index| current_index == *index)\n\n {\n\n acc.push(index.to_owned())\n\n }\n\n\n\n acc\n\n });\n\n\n\n // Check that all the vertices - target included - are a subset of\n\n // the current hyperedge's vertices.\n\n if !vertices_not_found.is_empty() {\n\n return Err(HypergraphError::HyperedgeVerticesIndexesNotFound {\n\n index: hyperedge_index,\n\n vertices: vertices_not_found,\n","file_path":"src/core/hyperedges/contract_hyperedge_vertices.rs","rank":14,"score":56824.97896707374},{"content":" });\n\n }\n\n\n\n // Store all the hyperedges which are going to change.\n\n let mut all_hyperedges: Vec<HyperedgeIndex> = vec![];\n\n\n\n // Iterate over all the deduped vertices.\n\n for &vertex in deduped_vertices.iter() {\n\n // Safely get the hyperedges of the current vertex.\n\n let mut vertex_hyperedges = self.get_vertex_hyperedges(*vertex)?;\n\n\n\n // Concatenate them to the global ones.\n\n all_hyperedges.append(&mut vertex_hyperedges);\n\n }\n\n\n\n // Iterate over all the deduped hyperedges.\n\n for &hyperedge in all_hyperedges.iter().sorted().dedup() {\n\n let hyperedge_vertices = self.get_hyperedge_vertices(hyperedge)?;\n\n\n\n // Contract the vertices of the hyperedge.\n","file_path":"src/core/hyperedges/contract_hyperedge_vertices.rs","rank":15,"score":56824.6605777007},{"content":" let contraction = hyperedge_vertices\n\n .iter()\n\n // First remap each vertex to itself or to the target.\n\n .map(|vertex| {\n\n if deduped_vertices\n\n .iter()\n\n .any(|¤t_index| current_index == vertex)\n\n {\n\n target\n\n } else {\n\n *vertex\n\n }\n\n })\n\n // Then dedupe the resulting vector.\n\n .dedup()\n\n .collect_vec();\n\n\n\n // Only update the hyperedge if necessary.\n\n if !are_slices_equal(\n\n &self.get_internal_vertices(&contraction)?,\n","file_path":"src/core/hyperedges/contract_hyperedge_vertices.rs","rank":16,"score":56822.59394760825},{"content":" match self.vertices.get_index_mut(index) {\n\n Some((_, index_set)) => {\n\n index_set.insert(internal_index);\n\n }\n\n None => return Err(HypergraphError::InternalVertexIndexNotFound(index)),\n\n }\n\n }\n\n\n\n // Update the removed vertices.\n\n for index in removed.into_iter() {\n\n match self.vertices.get_index_mut(index) {\n\n Some((_, index_set)) => {\n\n // This has an impact on the internal indexing for the set.\n\n // However since this is not exposed to the user - i.e. no\n\n // mapping is involved - we can safely perform the operation.\n\n index_set.swap_remove_index(internal_index);\n\n }\n\n None => return Err(HypergraphError::InternalVertexIndexNotFound(index)),\n\n }\n\n }\n","file_path":"src/core/hyperedges/update_hyperedge_vertices.rs","rank":17,"score":56822.3039174044},{"content":" &self.get_internal_vertices(hyperedge_vertices)?,\n\n ) {\n\n // Safely update the current hyperedge with the contraction.\n\n self.update_hyperedge_vertices(hyperedge, contraction)?;\n\n }\n\n }\n\n\n\n // Return the contraction.\n\n self.get_hyperedge_vertices(hyperedge_index)\n\n }\n\n}\n","file_path":"src/core/hyperedges/contract_hyperedge_vertices.rs","rank":18,"score":56821.54029631087},{"content":"\n\n // Find the vertices which have been removed.\n\n let removed = previous_vertices\n\n .iter()\n\n .filter_map(|index| {\n\n if !internal_vertices\n\n .iter()\n\n .any(|current_index| index == current_index)\n\n {\n\n Some(*index)\n\n } else {\n\n None\n\n }\n\n })\n\n .sorted()\n\n .dedup()\n\n .collect_vec();\n\n\n\n // Update the added vertices.\n\n for index in added.into_iter() {\n","file_path":"src/core/hyperedges/update_hyperedge_vertices.rs","rank":19,"score":56818.07072682149},{"content":"pub(crate) mod add_vertex_index;\n\npub(crate) mod get_internal_vertex;\n\npub(crate) mod get_internal_vertices;\n\npub(crate) mod get_vertex;\n\npub(crate) mod get_vertices;\n\n\n\npub mod add_vertex;\n\npub mod count_vertices;\n\npub mod get_adjacent_vertices_from;\n\npub mod get_adjacent_vertices_to;\n\npub mod get_dijkstra_connections;\n\npub mod get_full_vertex_hyperedges;\n\npub mod get_vertex_degree_in;\n\npub mod get_vertex_degree_out;\n\npub mod get_vertex_hyperedges;\n\npub mod get_vertex_weight;\n\npub mod remove_vertex;\n\npub mod update_vertex_weight;\n","file_path":"src/core/vertices/mod.rs","rank":20,"score":55024.537842338716},{"content":"pub(crate) mod add_hyperedge_index;\n\npub(crate) mod get_hyperedge;\n\npub(crate) mod get_hyperedges;\n\npub(crate) mod get_internal_hyperedge;\n\npub(crate) mod get_internal_hyperedges;\n\n\n\npub mod add_hyperedge;\n\npub mod clear_hyperedges;\n\npub mod contract_hyperedge_vertices;\n\npub mod count_hyperedges;\n\npub mod get_hyperedge_vertices;\n\npub mod get_hyperedge_weight;\n\npub mod get_hyperedges_connecting;\n\npub mod get_hyperedges_intersections;\n\npub mod remove_hyperedge;\n\npub mod reverse_hyperedge;\n\npub mod update_hyperedge_vertices;\n\npub mod update_hyperedge_weight;\n","file_path":"src/core/hyperedges/mod.rs","rank":21,"score":54974.347395593286},{"content":"use crate::{errors::HypergraphError, Hypergraph, SharedTrait, VertexIndex};\n\n\n\nimpl<V, HE> Hypergraph<V, HE>\n\nwhere\n\n V: SharedTrait,\n\n HE: SharedTrait,\n\n{\n\n /// Updates the weight of a vertex by index.\n\n pub fn update_vertex_weight(\n\n &mut self,\n\n vertex_index: VertexIndex,\n\n weight: V,\n\n ) -> Result<(), HypergraphError<V, HE>> {\n\n let internal_index = self.get_internal_vertex(vertex_index)?;\n\n\n\n let (previous_weight, index_set) = self\n\n .vertices\n\n .get_index(internal_index)\n\n .map(|(previous_weight, index_set)| (previous_weight.to_owned(), index_set.to_owned()))\n\n .ok_or(HypergraphError::InternalVertexIndexNotFound(internal_index))?;\n","file_path":"src/core/vertices/update_vertex_weight.rs","rank":22,"score":50611.795052880334},{"content":"use crate::{errors::HypergraphError, Hypergraph, SharedTrait, VertexIndex};\n\n\n\nimpl<V, HE> Hypergraph<V, HE>\n\nwhere\n\n V: SharedTrait,\n\n HE: SharedTrait,\n\n{\n\n /// Gets the weight of a vertex from its index.\n\n pub fn get_vertex_weight(\n\n &self,\n\n vertex_index: VertexIndex,\n\n ) -> Result<V, HypergraphError<V, HE>> {\n\n let internal_index = self.get_internal_vertex(vertex_index)?;\n\n\n\n self.vertices\n\n .get_index(internal_index)\n\n .map(|(weight, _)| *weight)\n\n .ok_or(HypergraphError::InternalVertexIndexNotFound(internal_index))\n\n }\n\n}\n","file_path":"src/core/vertices/get_vertex_weight.rs","rank":23,"score":50611.497370432735},{"content":"\n\n // Return an error if the new weight is the same as the previous one.\n\n if weight == previous_weight {\n\n return Err(HypergraphError::VertexWeightUnchanged {\n\n index: vertex_index,\n\n weight,\n\n });\n\n }\n\n\n\n // Return an error if the new weight is already assigned to another\n\n // vertex.\n\n if self.vertices.contains_key(&weight) {\n\n return Err(HypergraphError::VertexWeightAlreadyAssigned(weight));\n\n }\n\n\n\n // We can't directly replace the value in the map.\n\n // First, we need to insert the new weight, it will end up\n\n // being at the last position.\n\n // Since we have already checked that the new weight is not in the\n\n // map, we can safely perform the operation without checking its output.\n","file_path":"src/core/vertices/update_vertex_weight.rs","rank":24,"score":50598.5134703989},{"content":" self.vertices.insert(weight, index_set);\n\n\n\n // Then we use swap and remove. This will remove the previous weight\n\n // and insert the new one at the index position of the former.\n\n // This doesn't alter the indexing.\n\n // See the update_hyperedge_weight method for more detailed explanation.\n\n // Since we know that the internal index is correct, we can safely\n\n // perform the operation without checking its output.\n\n self.vertices.swap_remove_index(internal_index);\n\n\n\n // Return a unit.\n\n Ok(())\n\n }\n\n}\n","file_path":"src/core/vertices/update_vertex_weight.rs","rank":25,"score":50597.81618690161},{"content":"use crate::{errors::HypergraphError, HyperedgeIndex, Hypergraph, SharedTrait, VertexIndex};\n\n\n\nuse itertools::Itertools;\n\n\n\nimpl<V, HE> Hypergraph<V, HE>\n\nwhere\n\n V: SharedTrait,\n\n HE: SharedTrait,\n\n{\n\n /// Gets the hyperedges of a vertex as a vector of HyperedgeIndex.\n\n pub fn get_vertex_hyperedges(\n\n &self,\n\n vertex_index: VertexIndex,\n\n ) -> Result<Vec<HyperedgeIndex>, HypergraphError<V, HE>> {\n\n let internal_index = self.get_internal_vertex(vertex_index)?;\n\n\n\n let (_, hyperedges_index_set) = self\n\n .vertices\n\n .get_index(internal_index)\n\n .ok_or(HypergraphError::InternalVertexIndexNotFound(internal_index))?;\n\n\n\n self.get_hyperedges(hyperedges_index_set.clone().into_iter().collect_vec())\n\n }\n\n}\n","file_path":"src/core/vertices/get_vertex_hyperedges.rs","rank":26,"score":49130.99139329906},{"content":"use crate::{errors::HypergraphError, Hypergraph, SharedTrait, VertexIndex};\n\n\n\nimpl<V, HE> Hypergraph<V, HE>\n\nwhere\n\n V: SharedTrait,\n\n HE: SharedTrait,\n\n{\n\n /// Gets the hyperedges of a vertex as a vector of vectors of VertexIndex.\n\n pub fn get_full_vertex_hyperedges(\n\n &self,\n\n vertex_index: VertexIndex,\n\n ) -> Result<Vec<Vec<VertexIndex>>, HypergraphError<V, HE>> {\n\n self.get_vertex_hyperedges(vertex_index).map(|hyperedges| {\n\n hyperedges\n\n .into_iter()\n\n .flat_map(|hyperedge_index| self.get_hyperedge_vertices(hyperedge_index))\n\n .collect()\n\n })\n\n }\n\n}\n","file_path":"src/core/vertices/get_full_vertex_hyperedges.rs","rank":27,"score":47234.08209218856},{"content":"#[test]\n\nfn integration() {\n\n // Create a new hypergraph.\n\n let mut graph = Hypergraph::<Vertex<'_>, &str>::new();\n\n\n\n // Create some vertices.\n\n let andrea = Vertex::new(\"Andrea\");\n\n let bjǫrn = Vertex::new(\"Bjǫrn\");\n\n let charlie = Vertex::new(\"Charlie\");\n\n let dana = Vertex::new(\"Dana\");\n\n let enola = Vertex::new(\"Enola\");\n\n\n\n // Add those vertices to the hypergraph.\n\n assert_eq!(\n\n graph.add_vertex(andrea),\n\n Ok(VertexIndex(0)),\n\n \"should add the first vertex\"\n\n );\n\n assert_eq!(\n\n graph.add_vertex(bjǫrn),\n\n Ok(VertexIndex(1)),\n","file_path":"tests/integration_main.rs","rank":28,"score":35002.14815973941},{"content":"#[test]\n\nfn integration_contration() {\n\n // Create a new hypergraph.\n\n let mut graph = Hypergraph::<Vertex<'_>, &str>::new();\n\n\n\n // Create some vertices.\n\n let a = graph.add_vertex(Vertex::new(\"a\")).unwrap();\n\n let b = graph.add_vertex(Vertex::new(\"b\")).unwrap();\n\n let c = graph.add_vertex(Vertex::new(\"c\")).unwrap();\n\n let d = graph.add_vertex(Vertex::new(\"d\")).unwrap();\n\n let e = graph.add_vertex(Vertex::new(\"e\")).unwrap();\n\n\n\n // Create some hyperedges.\n\n let alpha = graph.add_hyperedge(vec![a, b, c, d, e], \"α\").unwrap();\n\n let beta = graph.add_hyperedge(vec![a, c, d, e, c], \"β\").unwrap();\n\n let gamma = graph.add_hyperedge(vec![a, e, b], \"γ\").unwrap();\n\n let delta = graph.add_hyperedge(vec![b, c, b, d, c], \"δ\").unwrap();\n\n let epsilon = graph.add_hyperedge(vec![c, c, c], \"ε\").unwrap();\n\n\n\n // In the alpha hyperedge, contract the vertices b and c into one single vertex b.\n\n assert_eq!(\n","file_path":"tests/integration_contraction.rs","rank":29,"score":33804.70137271395},{"content":"use crate::{errors::HypergraphError, Hypergraph, SharedTrait, VertexIndex};\n\n\n\nimpl<V, HE> Hypergraph<V, HE>\n\nwhere\n\n V: SharedTrait,\n\n HE: SharedTrait,\n\n{\n\n // Private method to get a vector of VertexIndex from a vector of internal indexes.\n\n pub(crate) fn get_vertices(\n\n &self,\n\n vertices: Vec<usize>,\n\n ) -> Result<Vec<VertexIndex>, HypergraphError<V, HE>> {\n\n vertices\n\n .iter()\n\n .map(|vertex_index| self.get_vertex(*vertex_index))\n\n .collect()\n\n }\n\n}\n","file_path":"src/core/vertices/get_vertices.rs","rank":30,"score":33200.96063156437},{"content":"use crate::{Hypergraph, SharedTrait};\n\n\n\nimpl<V, HE> Hypergraph<V, HE>\n\nwhere\n\n V: SharedTrait,\n\n HE: SharedTrait,\n\n{\n\n /// Returns the number of vertices in the hypergraph.\n\n pub fn count_vertices(&self) -> usize {\n\n self.vertices.len()\n\n }\n\n}\n","file_path":"src/core/vertices/count_vertices.rs","rank":31,"score":33200.327275684875},{"content":"use crate::{\n\n errors::HypergraphError, HyperedgeIndex, HyperedgeKey, Hypergraph, SharedTrait, VertexIndex,\n\n};\n\n\n\nimpl<V, HE> Hypergraph<V, HE>\n\nwhere\n\n V: SharedTrait,\n\n HE: SharedTrait,\n\n{\n\n /// Adds a hyperedge as an array of vertices indexes and a custom weight in the hypergraph.\n\n /// Returns the weighted index of the hyperedge.\n\n pub fn add_hyperedge(\n\n &mut self,\n\n vertices: Vec<VertexIndex>,\n\n weight: HE,\n\n ) -> Result<HyperedgeIndex, HypergraphError<V, HE>> {\n\n // If the provided vertices are empty, skip the update.\n\n if vertices.is_empty() {\n\n return Err(HypergraphError::HyperedgeCreationNoVertices(weight));\n\n }\n","file_path":"src/core/hyperedges/add_hyperedge.rs","rank":32,"score":33142.54024360859},{"content":"use crate::{bi_hash_map::BiHashMap, errors::HypergraphError, Hypergraph, SharedTrait};\n\n\n\nimpl<V, HE> Hypergraph<V, HE>\n\nwhere\n\n V: SharedTrait,\n\n HE: SharedTrait,\n\n{\n\n /// Clears all the hyperedges from the hypergraph.\n\n pub fn clear_hyperedges(&mut self) -> Result<(), HypergraphError<V, HE>> {\n\n // Clear the set while keeping its capacity.\n\n self.hyperedges.clear();\n\n\n\n // Reset the hyperedges mapping.\n\n self.hyperedges_mapping = BiHashMap::default();\n\n\n\n // Reset the hyperedges counter.\n\n self.hyperedges_count = 0;\n\n\n\n // Update the vertices accordingly.\n\n self.vertices\n\n .iter_mut()\n\n // Clear the sets while keeping their capacities.\n\n .for_each(|(_, hyperedges)| hyperedges.clear());\n\n\n\n Ok(())\n\n }\n\n}\n","file_path":"src/core/hyperedges/clear_hyperedges.rs","rank":33,"score":33141.67823522222},{"content":"use crate::{errors::HypergraphError, HyperedgeIndex, Hypergraph, SharedTrait};\n\n\n\nuse itertools::Itertools;\n\n\n\nimpl<V, HE> Hypergraph<V, HE>\n\nwhere\n\n V: SharedTrait,\n\n HE: SharedTrait,\n\n{\n\n // Reverses a hyperedge.\n\n pub fn reverse_hyperedge(\n\n &mut self,\n\n hyperedge_index: HyperedgeIndex,\n\n ) -> Result<(), HypergraphError<V, HE>> {\n\n // Get the vertices of the hyperedge.\n\n let vertices = self.get_hyperedge_vertices(hyperedge_index)?;\n\n\n\n // Update the hyperedge with the reversed vertices.\n\n self.update_hyperedge_vertices(hyperedge_index, vertices.into_iter().rev().collect_vec())\n\n }\n\n}\n","file_path":"src/core/hyperedges/reverse_hyperedge.rs","rank":34,"score":33140.810261692815},{"content":"use crate::{errors::HypergraphError, HyperedgeIndex, Hypergraph, SharedTrait};\n\n\n\nimpl<V, HE> Hypergraph<V, HE>\n\nwhere\n\n V: SharedTrait,\n\n HE: SharedTrait,\n\n{\n\n // Private method to get a vector of HyperedgeIndex from a vector of internal indexes.\n\n pub(crate) fn get_hyperedges(\n\n &self,\n\n hyperedges: Vec<usize>,\n\n ) -> Result<Vec<HyperedgeIndex>, HypergraphError<V, HE>> {\n\n hyperedges\n\n .iter()\n\n .map(|hyperedge_index| self.get_hyperedge(*hyperedge_index))\n\n .collect()\n\n }\n\n}\n","file_path":"src/core/hyperedges/get_hyperedges.rs","rank":35,"score":33137.76113289751},{"content":"use crate::{errors::HypergraphError, HyperedgeIndex, HyperedgeKey, Hypergraph, SharedTrait};\n\n\n\nimpl<V, HE> Hypergraph<V, HE>\n\nwhere\n\n V: SharedTrait,\n\n HE: SharedTrait,\n\n{\n\n /// Removes a hyperedge by index.\n\n pub fn remove_hyperedge(\n\n &mut self,\n\n hyperedge_index: HyperedgeIndex,\n\n ) -> Result<(), HypergraphError<V, HE>> {\n\n let internal_index = self.get_internal_hyperedge(hyperedge_index)?;\n\n\n\n let HyperedgeKey { vertices, .. } = self\n\n .hyperedges\n\n .get_index(internal_index)\n\n .map(|hyperedge_key| hyperedge_key.to_owned())\n\n .ok_or(HypergraphError::InternalHyperedgeIndexNotFound(\n\n internal_index,\n","file_path":"src/core/hyperedges/remove_hyperedge.rs","rank":36,"score":33137.742930046436},{"content":"use crate::{errors::HypergraphError, HyperedgeIndex, Hypergraph, SharedTrait};\n\n\n\nimpl<V, HE> Hypergraph<V, HE>\n\nwhere\n\n V: SharedTrait,\n\n HE: SharedTrait,\n\n{\n\n // Private method to get the HyperedgeIndex matching an internal index.\n\n pub(crate) fn get_hyperedge(\n\n &self,\n\n hyperedge_index: usize,\n\n ) -> Result<HyperedgeIndex, HypergraphError<V, HE>> {\n\n match self.hyperedges_mapping.left.get(&hyperedge_index) {\n\n Some(index) => Ok(*index),\n\n None => Err(HypergraphError::InternalHyperedgeIndexNotFound(\n\n hyperedge_index,\n\n )),\n\n }\n\n }\n\n}\n","file_path":"src/core/hyperedges/get_hyperedge.rs","rank":37,"score":33136.87150555072},{"content":"use crate::{Hypergraph, SharedTrait};\n\n\n\nimpl<V, HE> Hypergraph<V, HE>\n\nwhere\n\n V: SharedTrait,\n\n HE: SharedTrait,\n\n{\n\n /// Returns the number of hyperedges in the hypergraph.\n\n pub fn count_hyperedges(&self) -> usize {\n\n self.hyperedges.len()\n\n }\n\n}\n","file_path":"src/core/hyperedges/count_hyperedges.rs","rank":38,"score":33136.408269066116},{"content":"\n\n let internal_vertices = self.get_internal_vertices(vertices)?;\n\n\n\n // Return an error if the weight is already assigned to another\n\n // hyperedge.\n\n // We can't use the contains method here since the key is a combination\n\n // of the weight and the vertices.\n\n if self.hyperedges.iter().any(\n\n |HyperedgeKey {\n\n weight: current_weight,\n\n ..\n\n }| { *current_weight == weight },\n\n ) {\n\n return Err(HypergraphError::HyperedgeWeightAlreadyAssigned(weight));\n\n }\n\n\n\n // We don't care about the second member of the tuple returned from\n\n // the insertion since this is an infallible operation.\n\n let (internal_index, _) = self\n\n .hyperedges\n","file_path":"src/core/hyperedges/add_hyperedge.rs","rank":39,"score":33126.25480495996},{"content":" .insert_full(HyperedgeKey::new(internal_vertices.clone(), weight));\n\n\n\n // Update the vertices so that we keep directly track of the hyperedge.\n\n for vertex in internal_vertices.into_iter() {\n\n let (_, index_set) = self\n\n .vertices\n\n .get_index_mut(vertex)\n\n .ok_or(HypergraphError::InternalVertexIndexNotFound(vertex))?;\n\n\n\n index_set.insert(internal_index);\n\n }\n\n\n\n Ok(self.add_hyperedge_index(internal_index))\n\n }\n\n}\n","file_path":"src/core/hyperedges/add_hyperedge.rs","rank":40,"score":33125.90588915673},{"content":"\n\n // Get the vertices of the swapped hyperedge.\n\n let HyperedgeKey {\n\n vertices: swapped_vertices,\n\n ..\n\n } = self\n\n .hyperedges\n\n .get_index(internal_index)\n\n .map(|hyperedge_key| hyperedge_key.to_owned())\n\n .ok_or(HypergraphError::InternalHyperedgeIndexNotFound(\n\n internal_index,\n\n ))?;\n\n\n\n // Update the impacted vertices accordingly.\n\n for vertex in swapped_vertices.into_iter() {\n\n match self.vertices.get_index_mut(vertex) {\n\n Some((_, index_set)) => {\n\n // Update the by performing an insertion of the current\n\n // hyperedge and a removal of the swapped one.\n\n index_set.insert(internal_index);\n","file_path":"src/core/hyperedges/remove_hyperedge.rs","rank":41,"score":33121.80595759407},{"content":" ))?;\n\n\n\n // Find the last index.\n\n let last_index = self.hyperedges.len() - 1;\n\n\n\n // Swap and remove by index.\n\n self.hyperedges.swap_remove_index(internal_index);\n\n\n\n // Update the mapping for the removed hyperedge.\n\n self.hyperedges_mapping.left.remove(&internal_index);\n\n self.hyperedges_mapping.right.remove(&hyperedge_index);\n\n\n\n // Remove the hyperedge from the vertices.\n\n for vertex in vertices.into_iter() {\n\n match self.vertices.get_index_mut(vertex) {\n\n Some((_, index_set)) => {\n\n index_set.remove(&internal_index);\n\n }\n\n None => return Err(HypergraphError::InternalVertexIndexNotFound(vertex)),\n\n }\n","file_path":"src/core/hyperedges/remove_hyperedge.rs","rank":42,"score":33121.16815666116},{"content":" }\n\n\n\n // Given the following bi-mapping with three hyperedges, i.e. an\n\n // initial set of hyperedges [0, 1, 2]. Let's assume in this example\n\n // that the first hyperedge will be removed:\n\n //\n\n // left | Right\n\n // ---------------------------------------------------------\n\n // 0usize -> HyperedgeIndex(0) | HyperedgeIndex(0) -> 0usize\n\n // 1usize -> HyperedgeIndex(1) | HyperedgeIndex(1) -> 1usize\n\n // 2usize -> HyperedgeIndex(2) | HyperedgeIndex(2) -> 2usize\n\n //\n\n // In the previous steps, the current hyperedge has been already nuked.\n\n // So we now have:\n\n //\n\n // left | Right\n\n // ---------------------------------------------------------\n\n // xxxxxxxxxxxxxxxxxxxxxxxxxxx | xxxxxxxxxxxxxxxxxxxxxxxxxxx\n\n // 1usize -> HyperedgeIndex(1) | HyperedgeIndex(1) -> 1usize\n\n // 2usize -> HyperedgeIndex(2) | HyperedgeIndex(2) -> 2usize\n","file_path":"src/core/hyperedges/remove_hyperedge.rs","rank":43,"score":33119.507855204036},{"content":" //\n\n // The next step will be to insert the swapped index on the right:\n\n //\n\n // left | Right\n\n // ---------------------------------------------------------\n\n // xxxxxxxxxxxxxxxxxxxxxxxxxxx | xxxxxxxxxxxxxxxxxxxxxxxxxxx\n\n // 1usize -> HyperedgeIndex(1) | HyperedgeIndex(1) -> 1usize\n\n // 2usize -> HyperedgeIndex(2) | HyperedgeIndex(2) -> 0usize\n\n //\n\n // Now remove the index which no longer exists on the left:\n\n //\n\n // left | Right\n\n // ---------------------------------------------------------\n\n // xxxxxxxxxxxxxxxxxxxxxxxxxxx | xxxxxxxxxxxxxxxxxxxxxxxxxxx\n\n // 1usize -> HyperedgeIndex(1) | HyperedgeIndex(1) -> 1usize\n\n // xxxxxxxxxxxxxxxxxxxxxxxxxxx | HyperedgeIndex(2) -> 0usize\n\n //\n\n // Insert the swapped index on the left:\n\n //\n\n // left | Right\n","file_path":"src/core/hyperedges/remove_hyperedge.rs","rank":44,"score":33119.14957539039},{"content":" // ---------------------------------------------------------\n\n // 0usize -> HyperedgeIndex(2) | xxxxxxxxxxxxxxxxxxxxxxxxxxx\n\n // 1usize -> HyperedgeIndex(1) | HyperedgeIndex(1) -> 1usize\n\n // xxxxxxxxxxxxxxxxxxxxxxxxxxx | HyperedgeIndex(2) -> 0usize\n\n //\n\n // If the index to remove wasn't the last one, the last hyperedge has\n\n // been swapped in place of the removed one. Thus we need to update\n\n // the mapping accordingly.\n\n if internal_index != last_index {\n\n // Get the index of the swapped hyperedge.\n\n let swapped_hyperedge_index = self.get_hyperedge(last_index)?;\n\n\n\n // Proceed with the aforementioned operations.\n\n self.hyperedges_mapping\n\n .right\n\n .insert(swapped_hyperedge_index, internal_index);\n\n self.hyperedges_mapping.left.remove(&last_index);\n\n self.hyperedges_mapping\n\n .left\n\n .insert(internal_index, swapped_hyperedge_index);\n","file_path":"src/core/hyperedges/remove_hyperedge.rs","rank":45,"score":33118.55143205702},{"content":" index_set.remove(&last_index);\n\n }\n\n None => return Err(HypergraphError::InternalVertexIndexNotFound(vertex)),\n\n }\n\n }\n\n }\n\n\n\n // Return a unit.\n\n Ok(())\n\n }\n\n}\n","file_path":"src/core/hyperedges/remove_hyperedge.rs","rank":46,"score":33114.49636577883},{"content":"use crate::{errors::HypergraphError, Hypergraph, SharedTrait, VertexIndex};\n\n\n\nimpl<V, HE> Hypergraph<V, HE>\n\nwhere\n\n V: SharedTrait,\n\n HE: SharedTrait,\n\n{\n\n // Private method to get the internal vertices from a vector of VertexIndex.\n\n pub(crate) fn get_internal_vertices<E: AsRef<Vec<VertexIndex>>>(\n\n &self,\n\n vertices: E,\n\n ) -> Result<Vec<usize>, HypergraphError<V, HE>> {\n\n vertices\n\n .as_ref()\n\n .iter()\n\n .map(|vertex_index| self.get_internal_vertex(*vertex_index))\n\n .collect()\n\n }\n\n}\n","file_path":"src/core/vertices/get_internal_vertices.rs","rank":47,"score":32324.136354634356},{"content":"use crate::{\n\n core::shared::Connection, errors::HypergraphError, Hypergraph, SharedTrait, VertexIndex,\n\n};\n\n\n\nuse itertools::Itertools;\n\n\n\nimpl<V, HE> Hypergraph<V, HE>\n\nwhere\n\n V: SharedTrait,\n\n HE: SharedTrait,\n\n{\n\n /// Gets the list of all vertices connected to a given vertex.\n\n pub fn get_adjacent_vertices_to(\n\n &self,\n\n to: VertexIndex,\n\n ) -> Result<Vec<VertexIndex>, HypergraphError<V, HE>> {\n\n let results = self.get_connections(Connection::Out(to))?;\n\n\n\n Ok(results\n\n .into_iter()\n\n .filter_map(|(_, vertex_index)| vertex_index)\n\n .sorted()\n\n .dedup()\n\n .collect_vec())\n\n }\n\n}\n","file_path":"src/core/vertices/get_adjacent_vertices_to.rs","rank":48,"score":32323.42812756316},{"content":"use crate::{\n\n core::shared::Connection, errors::HypergraphError, Hypergraph, SharedTrait, VertexIndex,\n\n};\n\n\n\nuse itertools::Itertools;\n\n\n\nimpl<V, HE> Hypergraph<V, HE>\n\nwhere\n\n V: SharedTrait,\n\n HE: SharedTrait,\n\n{\n\n /// Gets the list of all vertices connected from a given vertex.\n\n pub fn get_adjacent_vertices_from(\n\n &self,\n\n from: VertexIndex,\n\n ) -> Result<Vec<VertexIndex>, HypergraphError<V, HE>> {\n\n let results = self.get_connections(Connection::In(from))?;\n\n\n\n Ok(results\n\n .into_iter()\n\n .filter_map(|(_, vertex_index)| vertex_index)\n\n .sorted()\n\n .dedup()\n\n .collect_vec())\n\n }\n\n}\n","file_path":"src/core/vertices/get_adjacent_vertices_from.rs","rank":49,"score":32323.42812756316},{"content":"use crate::{errors::HypergraphError, HyperedgeIndex, Hypergraph, SharedTrait};\n\n\n\nimpl<V, HE> Hypergraph<V, HE>\n\nwhere\n\n V: SharedTrait,\n\n HE: SharedTrait,\n\n{\n\n // Private method to get the internal hyperedges from a vector of HyperedgeIndex.\n\n pub(crate) fn get_internal_hyperedges(\n\n &self,\n\n hyperedges: Vec<HyperedgeIndex>,\n\n ) -> Result<Vec<usize>, HypergraphError<V, HE>> {\n\n hyperedges\n\n .iter()\n\n .map(|hyperedge_index| self.get_internal_hyperedge(*hyperedge_index))\n\n .collect()\n\n }\n\n}\n","file_path":"src/core/hyperedges/get_internal_hyperedges.rs","rank":50,"score":32263.03853431045},{"content":"use crate::{\n\n errors::HypergraphError, HyperedgeIndex, HyperedgeKey, Hypergraph, SharedTrait, VertexIndex,\n\n};\n\n\n\nuse itertools::Itertools;\n\n\n\nimpl<V, HE> Hypergraph<V, HE>\n\nwhere\n\n V: SharedTrait,\n\n HE: SharedTrait,\n\n{\n\n /// Gets the intersections of a set of hyperedges as a vector of vertices.\n\n pub fn get_hyperedges_intersections(\n\n &self,\n\n hyperedges: Vec<HyperedgeIndex>,\n\n ) -> Result<Vec<VertexIndex>, HypergraphError<V, HE>> {\n\n // Keep track of the number of hyperedges.\n\n let number_of_hyperedges = hyperedges.len();\n\n\n\n // Early exit if less than two hyperedges are provided.\n","file_path":"src/core/hyperedges/get_hyperedges_intersections.rs","rank":51,"score":32262.375543619717},{"content":"use crate::{errors::HypergraphError, HyperedgeIndex, Hypergraph, SharedTrait};\n\n\n\nimpl<V, HE> Hypergraph<V, HE>\n\nwhere\n\n V: SharedTrait,\n\n HE: SharedTrait,\n\n{\n\n // Private method to get the internal hyperedge matching a HyperedgeIndex.\n\n pub(crate) fn get_internal_hyperedge(\n\n &self,\n\n hyperedge_index: HyperedgeIndex,\n\n ) -> Result<usize, HypergraphError<V, HE>> {\n\n match self.hyperedges_mapping.right.get(&hyperedge_index) {\n\n Some(index) => Ok(*index),\n\n None => Err(HypergraphError::HyperedgeIndexNotFound(hyperedge_index)),\n\n }\n\n }\n\n}\n","file_path":"src/core/hyperedges/get_internal_hyperedge.rs","rank":52,"score":32262.303361698057},{"content":"use crate::{\n\n core::shared::Connection, errors::HypergraphError, HyperedgeIndex, Hypergraph, SharedTrait,\n\n VertexIndex,\n\n};\n\n\n\nuse itertools::Itertools;\n\n\n\nimpl<V, HE> Hypergraph<V, HE>\n\nwhere\n\n V: SharedTrait,\n\n HE: SharedTrait,\n\n{\n\n /// Gets the hyperedges directly connecting a vertex to another.\n\n pub fn get_hyperedges_connecting(\n\n &self,\n\n from: VertexIndex,\n\n to: VertexIndex,\n\n ) -> Result<Vec<HyperedgeIndex>, HypergraphError<V, HE>> {\n\n let results = self.get_connections(Connection::InAndOut(from, to))?;\n\n\n\n Ok(results\n\n .into_iter()\n\n .map(|(hyperedged_index, _)| hyperedged_index)\n\n .collect_vec())\n\n }\n\n}\n","file_path":"src/core/hyperedges/get_hyperedges_connecting.rs","rank":53,"score":32262.00690566154},{"content":"use crate::{HyperedgeIndex, Hypergraph, SharedTrait};\n\n\n\nimpl<V, HE> Hypergraph<V, HE>\n\nwhere\n\n V: SharedTrait,\n\n HE: SharedTrait,\n\n{\n\n // This private method is infallible since adding the same hyperedge\n\n // will return the existing index.\n\n pub(crate) fn add_hyperedge_index(&mut self, internal_index: usize) -> HyperedgeIndex {\n\n match self.hyperedges_mapping.left.get(&internal_index) {\n\n Some(hyperedge_index) => *hyperedge_index,\n\n None => {\n\n let hyperedge_index = HyperedgeIndex(self.hyperedges_count);\n\n\n\n if self\n\n .hyperedges_mapping\n\n .left\n\n .insert(internal_index, hyperedge_index)\n\n .is_none()\n","file_path":"src/core/hyperedges/add_hyperedge_index.rs","rank":54,"score":32258.838524202638},{"content":" )\n\n .collect::<Result<Vec<Vec<usize>>, HypergraphError<V, HE>>>();\n\n\n\n match vertices {\n\n Ok(vertices) => {\n\n self.get_vertices(\n\n vertices\n\n .into_iter()\n\n // Flatten and sort the vertices.\n\n .flatten()\n\n .sorted()\n\n // Map the result to tuples where the second term is an arbitrary value.\n\n // The goal is to group them by indexes.\n\n .map(|index| (index, 0))\n\n .into_group_map()\n\n .into_iter()\n\n // Filter the groups having the same size as the hyperedge.\n\n .filter_map(|(index, occurences)| {\n\n if occurences.len() == number_of_hyperedges {\n\n Some(index)\n","file_path":"src/core/hyperedges/get_hyperedges_intersections.rs","rank":55,"score":32251.33535068677},{"content":" if number_of_hyperedges < 2 {\n\n return Err(HypergraphError::HyperedgesIntersections);\n\n }\n\n\n\n // Get the internal vertices of the hyperedges and keep the eventual error.\n\n let vertices = hyperedges\n\n .into_iter()\n\n .map(\n\n |hyperedge_index| match self.get_internal_hyperedge(hyperedge_index) {\n\n Ok(internal_index) => match self.hyperedges.get_index(internal_index).ok_or(\n\n HypergraphError::InternalHyperedgeIndexNotFound(internal_index),\n\n ) {\n\n Ok(HyperedgeKey { vertices, .. }) => {\n\n // Keep the unique vertices.\n\n Ok(vertices.iter().unique().cloned().collect_vec())\n\n }\n\n Err(error) => Err(error),\n\n },\n\n Err(error) => Err(error),\n\n },\n","file_path":"src/core/hyperedges/get_hyperedges_intersections.rs","rank":56,"score":32246.94626721219},{"content":" } else {\n\n None\n\n }\n\n })\n\n .sorted()\n\n .collect_vec(),\n\n )\n\n }\n\n Err(error) => Err(error),\n\n }\n\n }\n\n}\n","file_path":"src/core/hyperedges/get_hyperedges_intersections.rs","rank":57,"score":32240.766757086305},{"content":" {\n\n // Update the counter only for the first insertion.\n\n self.hyperedges_count += 1;\n\n }\n\n\n\n self.hyperedges_mapping\n\n .right\n\n .insert(hyperedge_index, internal_index);\n\n\n\n hyperedge_index\n\n }\n\n }\n\n }\n\n}\n","file_path":"src/core/hyperedges/add_hyperedge_index.rs","rank":58,"score":32240.577439157816},{"content":"use itertools::Itertools;\n\n\n\npub(crate) fn are_slices_equal(a: &[usize], b: &[usize]) -> bool {\n\n // Early guard if lengths are different.\n\n if a.len() != b.len() {\n\n return false;\n\n }\n\n\n\n a.iter().zip_eq(b).fold(true, |acc, (a, b)| acc && a == b)\n\n}\n\n\n\n#[cfg(test)]\n\nmod tests {\n\n use super::*;\n\n\n\n #[test]\n\n fn check_matching() {\n\n assert!(are_slices_equal(&[], &[]));\n\n assert!(are_slices_equal(&[1], &[1]));\n\n assert!(are_slices_equal(&[1, 2, 3], &[1, 2, 3]));\n","file_path":"src/core/utils.rs","rank":59,"score":29910.408316224315},{"content":" }\n\n #[test]\n\n fn check_not_matching() {\n\n assert!(!are_slices_equal(&[], &[1]));\n\n assert!(!are_slices_equal(&[1], &[]));\n\n assert!(!are_slices_equal(&[1], &[2]));\n\n assert!(!are_slices_equal(&[1, 2, 3], &[1, 2, 4]));\n\n assert!(!are_slices_equal(&[1, 2, 3], &[1, 2, 3, 4]));\n\n }\n\n}\n","file_path":"src/core/utils.rs","rank":60,"score":29897.99982012266},{"content":"use crate::{HyperedgeIndex, SharedTrait, VertexIndex};\n\n\n\nuse thiserror::Error;\n\n\n\n/// Enumeration of all the possible errors.\n\n#[derive(Clone, Debug, Eq, Error, PartialEq)]\n\npub enum HypergraphError<V, HE>\n\nwhere\n\n V: SharedTrait,\n\n HE: SharedTrait,\n\n{\n\n /// Error when a HyperedgeIndex was not found.\n\n #[error(\"HyperedgeIndex {0} was not found\")]\n\n HyperedgeIndexNotFound(HyperedgeIndex),\n\n\n\n /// Error when an internal hyperedge index was not found.\n\n #[error(\"Internal hyperedge index {0} was not found\")]\n\n InternalHyperedgeIndexNotFound(usize),\n\n\n\n /// Error when a hyperedge weight was not found.\n","file_path":"src/core/errors.rs","rank":61,"score":29845.051588911512},{"content":" #[error(\"Hyperedge weight {0} was not found\")]\n\n HyperedgeWeightNotFound(HE),\n\n\n\n /// Error when a hyperedge is updated with the same weight.\n\n #[error(\"HyperedgeIndex {index:?} weight {weight:?} is unchanged (no-op)\")]\n\n HyperedgeWeightUnchanged { index: HyperedgeIndex, weight: HE },\n\n\n\n /// Error when a hyperedge is updated with the same vertices.\n\n #[error(\"HyperedgeIndex {0} vertices are unchanged (no-op)\")]\n\n HyperedgeVerticesUnchanged(HyperedgeIndex),\n\n\n\n /// Error when a hyperedge is updated with no vertices.\n\n #[error(\"HyperedgeIndex {0} vertices are missing\")]\n\n HyperedgeCreationNoVertices(HE),\n\n\n\n /// Error when a hyperedge is updated with no vertices.\n\n #[error(\"HyperedgeIndex {0} vertices are missing\")]\n\n HyperedgeUpdateNoVertices(HyperedgeIndex),\n\n\n\n /// Error when a hyperedge doesn't contain some vertices.\n","file_path":"src/core/errors.rs","rank":62,"score":29831.196025453733},{"content":" HyperedgesIntersections,\n\n\n\n /// Error when a VertexIndex was not found.\n\n #[error(\"VertexIndex {0} was not found\")]\n\n VertexIndexNotFound(VertexIndex),\n\n\n\n /// Error when a an internal vertex index was not found.\n\n #[error(\"Internal vertex index {0} was not found\")]\n\n InternalVertexIndexNotFound(usize),\n\n\n\n /// Error when a vertex weight was not found.\n\n #[error(\"Vertex weight {0} was not found\")]\n\n VertexWeightNotFound(V),\n\n\n\n /// Error when a vertex weight is updated with the same value.\n\n #[error(\"VertexIndex {index:?} weight {weight:?} unchanged (no-op)\")]\n\n VertexWeightUnchanged { index: VertexIndex, weight: V },\n\n\n\n /// Error when a vertex weight is updated with the weight of another one.\n\n #[error(\"Vertex weight {0} was already assigned\")]\n\n VertexWeightAlreadyAssigned(V),\n\n}\n","file_path":"src/core/errors.rs","rank":63,"score":29830.330937441737},{"content":" #[error(\"HyperedgeIndex {index:?} does not include vertices {vertices:?}\")]\n\n HyperedgeVerticesIndexesNotFound {\n\n index: HyperedgeIndex,\n\n vertices: Vec<VertexIndex>,\n\n },\n\n\n\n /// Error when a hyperedge contraction is invalid.\n\n #[error(\"HyperedgeIndex {index:?} contraction of vertices {vertices:?} into vertex {target:?} is invalid\" )]\n\n HyperedgeInvalidContraction {\n\n index: HyperedgeIndex,\n\n target: VertexIndex,\n\n vertices: Vec<VertexIndex>,\n\n },\n\n\n\n /// Error when a hyperedge is updated with the weight of another one.\n\n #[error(\"Hyperedge weight {0} was already assigned\")]\n\n HyperedgeWeightAlreadyAssigned(HE),\n\n\n\n /// Error when trying to get the intersections of less than two hyperedges.\n\n #[error(\"At least two hyperedges must be provided to find their intersections\")]\n","file_path":"src/core/errors.rs","rank":64,"score":29829.665751046017},{"content":"use crate::{errors::HypergraphError, HyperedgeIndex, Hypergraph, SharedTrait, VertexIndex};\n\n\n\nuse itertools::Itertools;\n\n\n\n/// Enumeration of the different types of connection.\n\n/// Only used as a guard argument for the `get_connections` method.\n\npub(crate) enum Connection<Index = VertexIndex> {\n\n In(Index),\n\n Out(Index),\n\n InAndOut(Index, Index),\n\n}\n\n\n\nimpl<V, HE> Hypergraph<V, HE>\n\nwhere\n\n V: SharedTrait,\n\n HE: SharedTrait,\n\n{\n\n /// Private helper function used internally.\n\n /// Takes a connection as an enum and returns a vector of tuples of the\n\n /// form (hyperedge index, connected vertex index) where connected vertex\n","file_path":"src/core/shared.rs","rank":65,"score":29757.969320042885},{"content":" .into_iter()\n\n .map(\n\n |hyperedge_index| match self.get_hyperedge_vertices(hyperedge_index) {\n\n Ok(vertices) => Ok((hyperedge_index, vertices)),\n\n Err(error) => Err(error),\n\n },\n\n )\n\n .collect::<Result<Vec<(HyperedgeIndex, Vec<VertexIndex>)>, HypergraphError<V, HE>>>()?;\n\n\n\n let results = hyperedges_with_vertices.into_iter().fold(\n\n Vec::new(),\n\n |acc: Vec<(HyperedgeIndex, Option<VertexIndex>)>, (hyperedge_index, vertices)| {\n\n vertices.iter().tuple_windows::<(_, _)>().fold(\n\n acc,\n\n |index_acc, (window_from, window_to)| {\n\n match connections {\n\n Connection::In(from) => {\n\n // Inject the index of the hyperedge and the\n\n // vertex index if the current window is a\n\n // match.\n","file_path":"src/core/shared.rs","rank":66,"score":29752.054562267298},{"content":" /// index is an optional value - None for InAndOut connections.\n\n #[allow(clippy::type_complexity)]\n\n pub(crate) fn get_connections(\n\n &self,\n\n connections: Connection,\n\n ) -> Result<Vec<(HyperedgeIndex, Option<VertexIndex>)>, HypergraphError<V, HE>> {\n\n let internal_index = self.get_internal_vertex(match connections {\n\n Connection::In(vertex_index) | Connection::Out(vertex_index) => vertex_index,\n\n Connection::InAndOut(vertex_index, _) => vertex_index,\n\n })?;\n\n\n\n let (_, hyperedges_index_set) = self\n\n .vertices\n\n .get_index(internal_index)\n\n .ok_or(HypergraphError::InternalVertexIndexNotFound(internal_index))?;\n\n\n\n let hyperedges =\n\n self.get_hyperedges(hyperedges_index_set.clone().into_iter().collect_vec())?;\n\n\n\n let hyperedges_with_vertices = hyperedges\n","file_path":"src/core/shared.rs","rank":67,"score":29749.300354131596},{"content":" // if the current window is a match.\n\n if *window_from == from && *window_to == to {\n\n return index_acc\n\n .into_iter()\n\n .chain(vec![(hyperedge_index, None)])\n\n .collect_vec();\n\n }\n\n }\n\n }\n\n\n\n index_acc\n\n },\n\n )\n\n },\n\n );\n\n\n\n Ok(results)\n\n }\n\n}\n","file_path":"src/core/shared.rs","rank":68,"score":29742.162828788027},{"content":" if *window_from == from {\n\n return index_acc\n\n .into_iter()\n\n .chain(vec![(hyperedge_index, Some(*window_to))])\n\n .collect_vec();\n\n }\n\n }\n\n Connection::Out(to) => {\n\n // Inject the index of the hyperedge and the\n\n // vertex index if the current window is a\n\n // match.\n\n if *window_to == to {\n\n return index_acc\n\n .into_iter()\n\n .chain(vec![(hyperedge_index, Some(*window_from))])\n\n .collect_vec();\n\n }\n\n }\n\n Connection::InAndOut(from, to) => {\n\n // Inject only the index of the hyperedge\n","file_path":"src/core/shared.rs","rank":69,"score":29740.166974382482},{"content":"#![deny(unsafe_code, nonstandard_style)]\n\n\n\nuse std::fmt::{Display, Formatter, Result};\n\n\n\n#[derive(Debug, Copy, Clone, Hash, Eq, PartialEq)]\n\npub struct Vertex<'a> {\n\n name: &'a str,\n\n}\n\n\n\nimpl<'a> Vertex<'a> {\n\n pub fn new(name: &'a str) -> Self {\n\n Vertex { name }\n\n }\n\n}\n\n\n\nimpl<'a> Display for Vertex<'a> {\n\n fn fmt(&self, f: &mut Formatter<'_>) -> Result {\n\n write!(f, \"{}\", self)\n\n }\n\n}\n","file_path":"tests/common/mod.rs","rank":73,"score":29612.180784567867},{"content":"use crate::SharedTrait;\n\n\n\nuse std::{collections::HashMap, fmt::Debug};\n\n\n\n/// Bi-directional hashmap used to store the mapping between the internal\n\n/// unstable indexes - generated by IndexMap and IndexSet - and the exposed\n\n/// stable indexes.\n\n#[derive(Debug)]\n\npub(crate) struct BiHashMap<Index>\n\nwhere\n\n Index: SharedTrait,\n\n{\n\n pub(crate) left: HashMap<usize, Index>,\n\n pub(crate) right: HashMap<Index, usize>,\n\n}\n\n\n\nimpl<Index> BiHashMap<Index>\n\nwhere\n\n Index: SharedTrait,\n\n{\n","file_path":"src/core/bi_hash_map.rs","rank":77,"score":27381.230602396383},{"content":" /// Creates a new BiHashMap with no allocation.\n\n pub(crate) fn new() -> BiHashMap<Index> {\n\n Self {\n\n left: HashMap::<usize, Index>::with_capacity(0),\n\n right: HashMap::<Index, usize>::with_capacity(0),\n\n }\n\n }\n\n}\n\n\n\nimpl<Index> Default for BiHashMap<Index>\n\nwhere\n\n Index: SharedTrait,\n\n{\n\n fn default() -> Self {\n\n BiHashMap::new()\n\n }\n\n}\n","file_path":"src/core/bi_hash_map.rs","rank":78,"score":27380.850014113763},{"content":"use crate::{errors::HypergraphError, Hypergraph, SharedTrait, VertexIndex};\n\n\n\nuse indexmap::IndexSet;\n\n\n\nimpl<V, HE> Hypergraph<V, HE>\n\nwhere\n\n V: SharedTrait,\n\n HE: SharedTrait,\n\n{\n\n /// Adds a vertex with a custom weight to the hypergraph.\n\n /// Returns the index of the vertex.\n\n pub fn add_vertex(&mut self, weight: V) -> Result<VertexIndex, HypergraphError<V, HE>> {\n\n // Return an error if the weight is already assigned to another vertex.\n\n if self.vertices.contains_key(&weight) {\n\n return Err(HypergraphError::VertexWeightAlreadyAssigned(weight));\n\n }\n\n\n\n self.vertices\n\n .entry(weight)\n\n .or_insert(IndexSet::with_capacity(0));\n","file_path":"src/core/vertices/add_vertex.rs","rank":79,"score":25634.580623755264},{"content":"use crate::{errors::HypergraphError, HyperedgeKey, Hypergraph, SharedTrait, VertexIndex};\n\n\n\nuse itertools::Itertools;\n\n\n\nimpl<V, HE> Hypergraph<V, HE>\n\nwhere\n\n V: SharedTrait,\n\n HE: SharedTrait,\n\n{\n\n /// Removes a vertex by index.\n\n pub fn remove_vertex(\n\n &mut self,\n\n vertex_index: VertexIndex,\n\n ) -> Result<(), HypergraphError<V, HE>> {\n\n let internal_index = self.get_internal_vertex(vertex_index)?;\n\n\n\n // Get the hyperedges of the vertex.\n\n let hyperedges = self.get_internal_hyperedges(self.get_vertex_hyperedges(vertex_index)?)?;\n\n\n\n // Remove the vertex from the hyperedges which contain it.\n","file_path":"src/core/vertices/remove_vertex.rs","rank":80,"score":25631.861364788747},{"content":"use crate::{errors::HypergraphError, Hypergraph, SharedTrait, VertexIndex};\n\n\n\nimpl<V, HE> Hypergraph<V, HE>\n\nwhere\n\n V: SharedTrait,\n\n HE: SharedTrait,\n\n{\n\n // Private method to get the VertexIndex matching an internal index.\n\n pub(crate) fn get_vertex(\n\n &self,\n\n vertex_index: usize,\n\n ) -> Result<VertexIndex, HypergraphError<V, HE>> {\n\n match self.vertices_mapping.left.get(&vertex_index) {\n\n Some(index) => Ok(*index),\n\n None => Err(HypergraphError::InternalVertexIndexNotFound(vertex_index)),\n\n }\n\n }\n\n}\n","file_path":"src/core/vertices/get_vertex.rs","rank":81,"score":25630.141160401956},{"content":" .hyperedges\n\n .get_index(hyperedge)\n\n .map(|hyperedge_key| hyperedge_key.to_owned())\n\n .ok_or(HypergraphError::InternalHyperedgeIndexNotFound(hyperedge))?;\n\n\n\n let updated_vertices = vertices\n\n .into_iter()\n\n .map(|vertex| {\n\n // Remap the vertex if this is the swapped one.\n\n if vertex == last_index {\n\n internal_index\n\n } else {\n\n vertex\n\n }\n\n })\n\n .collect_vec();\n\n\n\n // Insert the new entry with the updated vertices.\n\n // Since we are not altering the weight, we can safely perform\n\n // the operation without checking its output.\n","file_path":"src/core/vertices/remove_vertex.rs","rank":82,"score":25618.470317065112},{"content":" for hyperedge in hyperedges.into_iter() {\n\n let HyperedgeKey { vertices, .. } = self\n\n .hyperedges\n\n .get_index(hyperedge)\n\n .map(|hyperedge_key| hyperedge_key.to_owned())\n\n .ok_or(HypergraphError::InternalHyperedgeIndexNotFound(hyperedge))?;\n\n\n\n let hyperedge_index = self.get_hyperedge(hyperedge)?;\n\n\n\n // Get the unique vertices, i.e. check for self-loops.\n\n let unique_vertices = vertices.iter().sorted().dedup().collect_vec();\n\n\n\n // Remove the hyperedge if the vertex is the only one present.\n\n if unique_vertices.len() == 1 {\n\n self.remove_hyperedge(hyperedge_index)?;\n\n } else {\n\n // Otherwise update the hyperedge with the updated vertices.\n\n let updated_vertices = self.get_vertices(\n\n vertices\n\n .into_iter()\n","file_path":"src/core/vertices/remove_vertex.rs","rank":83,"score":25615.243829569125},{"content":" self.hyperedges.insert(HyperedgeKey {\n\n vertices: updated_vertices,\n\n weight,\n\n });\n\n\n\n // Swap and remove by index.\n\n // Since we know that the hyperedge index is correct, we can\n\n // safely perform the operation without checking its output.\n\n self.hyperedges.swap_remove_index(hyperedge);\n\n }\n\n }\n\n\n\n // Return a unit.\n\n Ok(())\n\n }\n\n}\n","file_path":"src/core/vertices/remove_vertex.rs","rank":84,"score":25615.14331005148},{"content":"\n\n let internal_index = self\n\n .vertices\n\n .get_index_of(&weight)\n\n // This safe-check should always pass since the weight has been\n\n // inserted upfront.\n\n .ok_or(HypergraphError::VertexWeightNotFound(weight))?;\n\n\n\n Ok(self.add_vertex_index(internal_index))\n\n }\n\n}\n","file_path":"src/core/vertices/add_vertex.rs","rank":85,"score":25615.136019370733},{"content":" // method for more details about the internals.\n\n if internal_index != last_index {\n\n // Get the index of the swapped vertex.\n\n let swapped_vertex_index = self.get_vertex(last_index)?;\n\n\n\n // Proceed with the aforementioned operations.\n\n self.vertices_mapping\n\n .right\n\n .insert(swapped_vertex_index, internal_index);\n\n self.vertices_mapping.left.remove(&last_index);\n\n self.vertices_mapping\n\n .left\n\n .insert(internal_index, swapped_vertex_index);\n\n\n\n let stale_hyperedges =\n\n self.get_internal_hyperedges(self.get_vertex_hyperedges(swapped_vertex_index)?)?;\n\n\n\n // Update the impacted hyperedges accordingly.\n\n for hyperedge in stale_hyperedges.into_iter() {\n\n let HyperedgeKey { vertices, weight } = self\n","file_path":"src/core/vertices/remove_vertex.rs","rank":86,"score":25614.387474565374},{"content":" .filter(|vertex| *vertex != internal_index)\n\n .collect_vec(),\n\n )?;\n\n\n\n self.update_hyperedge_vertices(hyperedge_index, updated_vertices)?;\n\n }\n\n }\n\n\n\n // Find the last index.\n\n let last_index = self.vertices.len() - 1;\n\n\n\n // Swap and remove by index.\n\n self.vertices.swap_remove_index(internal_index);\n\n\n\n // Update the mapping for the removed vertex.\n\n self.vertices_mapping.left.remove(&internal_index);\n\n self.vertices_mapping.right.remove(&vertex_index);\n\n\n\n // If the index to remove wasn't the last one, the last vertex has\n\n // been swapped in place of the removed one. See the remove_hyperedge\n","file_path":"src/core/vertices/remove_vertex.rs","rank":87,"score":25612.511133766086},{"content":"use crate::{errors::HypergraphError, Hypergraph, SharedTrait, VertexIndex};\n\n\n\nuse std::{cmp::Ordering, collections::BinaryHeap, fmt::Debug};\n\n\n\nimpl<V, HE> Hypergraph<V, HE>\n\nwhere\n\n V: SharedTrait,\n\n HE: SharedTrait,\n\n{\n\n /// Gets a list of the shortest path of vertices between two vertices.\n\n /// The implementation of the algorithm is based on\n\n /// <https://doc.rust-lang.org/std/collections/binary_heap/#examples>\n\n pub fn get_dijkstra_connections(\n\n &self,\n\n from: VertexIndex,\n\n to: VertexIndex,\n\n ) -> Result<Vec<VertexIndex>, HypergraphError<V, HE>> {\n\n #[derive(Clone, Copy, Debug, PartialEq, Eq)]\n\n struct Cursor {\n\n distance: usize,\n","file_path":"src/core/vertices/get_dijkstra_connections.rs","rank":88,"score":24609.786921681567},{"content":"use crate::{\n\n core::shared::Connection, errors::HypergraphError, Hypergraph, SharedTrait, VertexIndex,\n\n};\n\n\n\nimpl<V, HE> Hypergraph<V, HE>\n\nwhere\n\n V: SharedTrait,\n\n HE: SharedTrait,\n\n{\n\n /// Gets the in-degree of a vertex.\n\n /// <https://en.wikipedia.org/wiki/Directed_graph#Indegree_and_outdegree>\n\n pub fn get_vertex_degree_in(&self, to: VertexIndex) -> Result<usize, HypergraphError<V, HE>> {\n\n let results = self.get_connections(Connection::Out(to))?;\n\n\n\n Ok(results.len())\n\n }\n\n}\n","file_path":"src/core/vertices/get_vertex_degree_in.rs","rank":89,"score":24601.614842835785},{"content":"use crate::{\n\n core::shared::Connection, errors::HypergraphError, Hypergraph, SharedTrait, VertexIndex,\n\n};\n\n\n\nimpl<V, HE> Hypergraph<V, HE>\n\nwhere\n\n V: SharedTrait,\n\n HE: SharedTrait,\n\n{\n\n /// Gets the out-degree of a vertex.\n\n /// <https://en.wikipedia.org/wiki/Directed_graph#Indegree_and_outdegree>\n\n pub fn get_vertex_degree_out(\n\n &self,\n\n from: VertexIndex,\n\n ) -> Result<usize, HypergraphError<V, HE>> {\n\n let results = self.get_connections(Connection::In(from))?;\n\n\n\n Ok(results.len())\n\n }\n\n}\n","file_path":"src/core/vertices/get_vertex_degree_out.rs","rank":90,"score":24601.614842835785},{"content":"use crate::{errors::HypergraphError, Hypergraph, SharedTrait, VertexIndex};\n\n\n\nimpl<V, HE> Hypergraph<V, HE>\n\nwhere\n\n V: SharedTrait,\n\n HE: SharedTrait,\n\n{\n\n // Private method to get the internal vertex matching a VertexIndex.\n\n pub(crate) fn get_internal_vertex(\n\n &self,\n\n vertex_index: VertexIndex,\n\n ) -> Result<usize, HypergraphError<V, HE>> {\n\n match self.vertices_mapping.right.get(&vertex_index) {\n\n Some(index) => Ok(*index),\n\n None => Err(HypergraphError::VertexIndexNotFound(vertex_index)),\n\n }\n\n }\n\n}\n","file_path":"src/core/vertices/get_internal_vertex.rs","rank":91,"score":24600.789434960203},{"content":"use crate::{Hypergraph, SharedTrait, VertexIndex};\n\n\n\nimpl<V, HE> Hypergraph<V, HE>\n\nwhere\n\n V: SharedTrait,\n\n HE: SharedTrait,\n\n{\n\n // This private method is infallible since adding the same vertex\n\n // will return the existing index.\n\n pub(crate) fn add_vertex_index(&mut self, internal_index: usize) -> VertexIndex {\n\n match self.vertices_mapping.left.get(&internal_index) {\n\n Some(vertex_index) => *vertex_index,\n\n None => {\n\n let vertex_index = VertexIndex(self.vertices_count);\n\n\n\n if self\n\n .vertices_mapping\n\n .left\n\n .insert(internal_index, vertex_index)\n\n .is_none()\n","file_path":"src/core/vertices/add_vertex_index.rs","rank":92,"score":24598.301670543577},{"content":" index: usize,\n\n }\n\n\n\n // Use a custom implementation of Ord as we want a min-heap BinaryHeap.\n\n impl Ord for Cursor {\n\n fn cmp(&self, other: &Cursor) -> Ordering {\n\n other\n\n .distance\n\n .cmp(&self.distance)\n\n .then_with(|| self.distance.cmp(&other.distance))\n\n }\n\n }\n\n\n\n impl PartialOrd for Cursor {\n\n fn partial_cmp(&self, other: &Cursor) -> Option<Ordering> {\n\n Some(self.cmp(other))\n\n }\n\n }\n\n\n\n // Get the internal indexes of the vertices.\n","file_path":"src/core/vertices/get_dijkstra_connections.rs","rank":93,"score":24590.699853271195},{"content":" let internal_from = self.get_internal_vertex(from)?;\n\n let internal_to = self.get_internal_vertex(to)?;\n\n\n\n // We need to initialize a vector of length equal to the number of vertices.\n\n // The default value, as per Dijkstra, must be set to infinity.\n\n // A value of usize::MAX is used.\n\n let mut distances = (0..self.vertices.len())\n\n .map(|_| usize::MAX)\n\n .collect::<Vec<usize>>();\n\n\n\n // Create an empty binary heap.\n\n let mut heap = BinaryHeap::new();\n\n\n\n // Initialize the first vertex to zero.\n\n distances[internal_from] = 0;\n\n\n\n // Push the first cursor to the heap.\n\n heap.push(Cursor {\n\n distance: 0,\n\n index: internal_from,\n","file_path":"src/core/vertices/get_dijkstra_connections.rs","rank":94,"score":24589.231564727448},{"content":" });\n\n\n\n // Keep track of the traversal path.\n\n let mut path = Vec::<usize>::new();\n\n\n\n while let Some(Cursor { distance, index }) = heap.pop() {\n\n // End of the traversal.\n\n if index == internal_to {\n\n // We need to inject the index of the target vertex.\n\n path.push(internal_to);\n\n\n\n // Remove duplicates generated during the iteration of the algorithm.\n\n path.dedup();\n\n\n\n return self.get_vertices(path);\n\n }\n\n\n\n // Skip if a better path has already been found.\n\n if distance > distances[index] {\n\n continue;\n","file_path":"src/core/vertices/get_dijkstra_connections.rs","rank":95,"score":24585.728628449444},{"content":" }\n\n\n\n let mapped_index = self.get_vertex(index)?;\n\n let indexes = self.get_adjacent_vertices_from(mapped_index)?;\n\n let internal_indexes = self.get_internal_vertices(indexes)?;\n\n\n\n // For every connected vertex, try to find the lowest distance.\n\n for vertex_index in internal_indexes {\n\n let next = Cursor {\n\n // We assume a distance of one by default since vertices\n\n // have custom weights.\n\n distance: distance + 1,\n\n index: vertex_index,\n\n };\n\n\n\n // If so, add it to the frontier and continue.\n\n if next.distance < distances[next.index] {\n\n // Update the traversal accordingly.\n\n path.push(index);\n\n\n","file_path":"src/core/vertices/get_dijkstra_connections.rs","rank":96,"score":24582.072860533957},{"content":" {\n\n // Update the counter only for the first insertion.\n\n self.vertices_count += 1;\n\n }\n\n\n\n self.vertices_mapping\n\n .right\n\n .insert(vertex_index, internal_index);\n\n\n\n vertex_index\n\n }\n\n }\n\n }\n\n}\n","file_path":"src/core/vertices/add_vertex_index.rs","rank":97,"score":24580.5448245351},{"content":" // Push it to the heap.\n\n heap.push(next);\n\n\n\n // Relaxation, we have now found a better way\n\n distances[vertex_index] = next.distance;\n\n }\n\n }\n\n }\n\n\n\n // If we reach this point, return an empty vector.\n\n Ok(vec![])\n\n }\n\n}\n","file_path":"src/core/vertices/get_dijkstra_connections.rs","rank":98,"score":24577.524925457998},{"content":"//! - Stable indexes assigned for each hyperedge and each vertex\n\n//!\n\n//! ## Example\n\n//!\n\n//! Please notice that the hyperedges and the vertices must implement the [SharedTrait](crate::SharedTrait).\n\n//!\n\n//! ```\n\n//! use hypergraph::{HyperedgeIndex, Hypergraph, VertexIndex};\n\n//! use std::fmt::{Display, Formatter, Result};\n\n//!\n\n//! // Create a new struct to represent a vertex.\n\n//! #[derive(Debug, Copy, Clone, Hash, Eq, PartialEq)]\n\n//! struct Vertex<'a> {\n\n//! name: &'a str,\n\n//! }\n\n//!\n\n//! impl<'a> Vertex<'a> {\n\n//! pub fn new(name: &'a str) -> Self {\n\n//! Vertex { name }\n\n//! }\n","file_path":"src/lib.rs","rank":99,"score":37.83487243128075}],"string":"[\n {\n \"content\": \"use crate::{errors::HypergraphError, HyperedgeIndex, HyperedgeKey, Hypergraph, SharedTrait};\\n\\n\\n\\nimpl<V, HE> Hypergraph<V, HE>\\n\\nwhere\\n\\n V: SharedTrait,\\n\\n HE: SharedTrait,\\n\\n{\\n\\n /// Updates the weight of a hyperedge by index.\\n\\n pub fn update_hyperedge_weight(\\n\\n &mut self,\\n\\n hyperedge_index: HyperedgeIndex,\\n\\n weight: HE,\\n\\n ) -> Result<(), HypergraphError<V, HE>> {\\n\\n let internal_index = self.get_internal_hyperedge(hyperedge_index)?;\\n\\n\\n\\n let HyperedgeKey {\\n\\n vertices,\\n\\n weight: previous_weight,\\n\\n } = self\\n\\n .hyperedges\\n\",\n \"file_path\": \"src/core/hyperedges/update_hyperedge_weight.rs\",\n \"rank\": 1,\n \"score\": 58277.35562021103\n },\n {\n \"content\": \"use crate::{errors::HypergraphError, HyperedgeIndex, Hypergraph, SharedTrait};\\n\\n\\n\\nimpl<V, HE> Hypergraph<V, HE>\\n\\nwhere\\n\\n V: SharedTrait,\\n\\n HE: SharedTrait,\\n\\n{\\n\\n /// Gets the weight of a hyperedge from its index.\\n\\n pub fn get_hyperedge_weight(\\n\\n &self,\\n\\n hyperedge_index: HyperedgeIndex,\\n\\n ) -> Result<HE, HypergraphError<V, HE>> {\\n\\n let internal_index = self.get_internal_hyperedge(hyperedge_index)?;\\n\\n\\n\\n let hyperedge_key = self\\n\\n .hyperedges\\n\\n .get_index(internal_index)\\n\\n .ok_or(HypergraphError::InternalVertexIndexNotFound(internal_index))?;\\n\\n\\n\\n Ok(hyperedge_key.weight)\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/core/hyperedges/get_hyperedge_weight.rs\",\n \"rank\": 2,\n \"score\": 58272.25236452031\n },\n {\n \"content\": \" .get_index(internal_index)\\n\\n .map(|hyperedge_key| hyperedge_key.to_owned())\\n\\n .ok_or(HypergraphError::InternalHyperedgeIndexNotFound(\\n\\n internal_index,\\n\\n ))?;\\n\\n\\n\\n // Return an error if the new weight is the same as the previous one.\\n\\n if weight == previous_weight {\\n\\n return Err(HypergraphError::HyperedgeWeightUnchanged {\\n\\n index: hyperedge_index,\\n\\n weight,\\n\\n });\\n\\n }\\n\\n\\n\\n // Return an error if the new weight is already assigned to another\\n\\n // hyperedge.\\n\\n // We can't use the contains method here since the key is a combination\\n\\n // of the weight and the vertices.\\n\\n if self.hyperedges.iter().any(\\n\\n |HyperedgeKey {\\n\",\n \"file_path\": \"src/core/hyperedges/update_hyperedge_weight.rs\",\n \"rank\": 3,\n \"score\": 58262.49987200435\n },\n {\n \"content\": \" weight: current_weight,\\n\\n ..\\n\\n }| { *current_weight == weight },\\n\\n ) {\\n\\n return Err(HypergraphError::HyperedgeWeightAlreadyAssigned(weight));\\n\\n }\\n\\n\\n\\n // IndexMap doesn't allow holes by design, see:\\n\\n // https://github.com/bluss/indexmap/issues/90#issuecomment-455381877\\n\\n //\\n\\n // As a consequence, we have two options. Either we use shift_remove\\n\\n // and it will result in an expensive regeneration of all the indexes\\n\\n // in the map/set or we use swap_remove methods and deal with the fact\\n\\n // that the last element will be swapped in place of the removed one\\n\\n // and will thus get a new index.\\n\\n //\\n\\n // In our case, since we are inserting an entry upfront, it circumvents\\n\\n // the aforementioned issue.\\n\\n //\\n\\n // First case: index alteration is avoided.\\n\",\n \"file_path\": \"src/core/hyperedges/update_hyperedge_weight.rs\",\n \"rank\": 4,\n \"score\": 58258.480025744015\n },\n {\n \"content\": \" // ^ ^\\n\\n // | |\\n\\n // +--+\\n\\n // 2.Swap and remove\\n\\n //\\n\\n // Insert the new entry.\\n\\n // Since we have already checked that the new weight is not in the\\n\\n // map, we can safely perform the operation without checking its output.\\n\\n self.hyperedges.insert(HyperedgeKey { vertices, weight });\\n\\n\\n\\n // Swap and remove by index.\\n\\n // Since we know that the internal index is correct, we can safely\\n\\n // perform the operation without checking its output.\\n\\n self.hyperedges.swap_remove_index(internal_index);\\n\\n\\n\\n // Return a unit.\\n\\n Ok(())\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/core/hyperedges/update_hyperedge_weight.rs\",\n \"rank\": 5,\n \"score\": 58256.41754124734\n },\n {\n \"content\": \" //\\n\\n // Entry to remove\\n\\n // | 1.Insert new entry\\n\\n // | |\\n\\n // v v\\n\\n // [a, b, c] -> [a, b, c, d] -> [d, b, c, _]\\n\\n // ^ ^\\n\\n // | |\\n\\n // +--------+\\n\\n // 2.Swap and remove\\n\\n //\\n\\n // -----------------------------------------\\n\\n //\\n\\n // Second case: no index alteration.\\n\\n //\\n\\n // Entry to remove\\n\\n // | 1.Insert new entry\\n\\n // | |\\n\\n // v v\\n\\n // [a, b, c] -> [a, b, c, d] -> [a, b, d, _]\\n\",\n \"file_path\": \"src/core/hyperedges/update_hyperedge_weight.rs\",\n \"rank\": 6,\n \"score\": 58250.00409462207\n },\n {\n \"content\": \"use crate::{\\n\\n core::utils::are_slices_equal, errors::HypergraphError, HyperedgeIndex, HyperedgeKey,\\n\\n Hypergraph, SharedTrait, VertexIndex,\\n\\n};\\n\\n\\n\\nuse itertools::Itertools;\\n\\n\\n\\nimpl<V, HE> Hypergraph<V, HE>\\n\\nwhere\\n\\n V: SharedTrait,\\n\\n HE: SharedTrait,\\n\\n{\\n\\n /// Updates the vertices of a hyperedge by index.\\n\\n pub fn update_hyperedge_vertices(\\n\\n &mut self,\\n\\n hyperedge_index: HyperedgeIndex,\\n\\n vertices: Vec<VertexIndex>,\\n\\n ) -> Result<(), HypergraphError<V, HE>> {\\n\\n // If the provided vertices are empty, skip the update.\\n\\n if vertices.is_empty() {\\n\",\n \"file_path\": \"src/core/hyperedges/update_hyperedge_vertices.rs\",\n \"rank\": 7,\n \"score\": 56845.41510880503\n },\n {\n \"content\": \"use crate::{\\n\\n core::utils::are_slices_equal, errors::HypergraphError, HyperedgeIndex, Hypergraph,\\n\\n SharedTrait, VertexIndex,\\n\\n};\\n\\n\\n\\nuse itertools::Itertools;\\n\\n\\n\\nimpl<V, HE> Hypergraph<V, HE>\\n\\nwhere\\n\\n V: SharedTrait,\\n\\n HE: SharedTrait,\\n\\n{\\n\\n /// Contracts a set of the vertices of a hyperedge into one single vertex.\\n\\n /// Returns the updated vertices.\\n\\n /// Based on <https://en.wikipedia.org/wiki/Edge_contraction>\\n\\n pub fn contract_hyperedge_vertices(\\n\\n &mut self,\\n\\n hyperedge_index: HyperedgeIndex,\\n\\n vertices: Vec<VertexIndex>,\\n\\n target: VertexIndex,\\n\",\n \"file_path\": \"src/core/hyperedges/contract_hyperedge_vertices.rs\",\n \"rank\": 8,\n \"score\": 56841.94572036051\n },\n {\n \"content\": \"use crate::{\\n\\n errors::HypergraphError, HyperedgeIndex, HyperedgeKey, Hypergraph, SharedTrait, VertexIndex,\\n\\n};\\n\\n\\n\\nimpl<V, HE> Hypergraph<V, HE>\\n\\nwhere\\n\\n V: SharedTrait,\\n\\n HE: SharedTrait,\\n\\n{\\n\\n /// Gets the vertices of a hyperedge.\\n\\n pub fn get_hyperedge_vertices(\\n\\n &self,\\n\\n hyperedge_index: HyperedgeIndex,\\n\\n ) -> Result<Vec<VertexIndex>, HypergraphError<V, HE>> {\\n\\n let internal_index = self.get_internal_hyperedge(hyperedge_index)?;\\n\\n\\n\\n let HyperedgeKey { vertices, .. } = self.hyperedges.get_index(internal_index).ok_or(\\n\\n HypergraphError::InternalHyperedgeIndexNotFound(internal_index),\\n\\n )?;\\n\\n\\n\\n self.get_vertices(vertices.to_owned())\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/core/hyperedges/get_hyperedge_vertices.rs\",\n \"rank\": 9,\n \"score\": 56839.93150172768\n },\n {\n \"content\": \" return Err(HypergraphError::HyperedgeUpdateNoVertices(hyperedge_index));\\n\\n }\\n\\n\\n\\n let internal_index = self.get_internal_hyperedge(hyperedge_index)?;\\n\\n\\n\\n let internal_vertices = self.get_internal_vertices(vertices)?;\\n\\n\\n\\n let HyperedgeKey {\\n\\n vertices: previous_vertices,\\n\\n weight,\\n\\n } = self\\n\\n .hyperedges\\n\\n .get_index(internal_index)\\n\\n .map(|hyperedge_key| hyperedge_key.to_owned())\\n\\n .ok_or(HypergraphError::InternalHyperedgeIndexNotFound(\\n\\n internal_index,\\n\\n ))?;\\n\\n\\n\\n // If the new vertices are the same as the old ones, skip the update.\\n\\n if are_slices_equal(&internal_vertices, &previous_vertices) {\\n\",\n \"file_path\": \"src/core/hyperedges/update_hyperedge_vertices.rs\",\n \"rank\": 10,\n \"score\": 56827.603645166964\n },\n {\n \"content\": \" ) -> Result<Vec<VertexIndex>, HypergraphError<V, HE>> {\\n\\n // Get all the vertices of the hyperedge.\\n\\n let hyperedge_vertices = self.get_hyperedge_vertices(hyperedge_index)?;\\n\\n\\n\\n // Get the deduped vertices.\\n\\n let deduped_vertices = vertices.iter().sorted().dedup().collect_vec();\\n\\n\\n\\n // Check that the target is included in the deduped vertices.\\n\\n if !deduped_vertices\\n\\n .iter()\\n\\n .any(|¤t_index| current_index == &target)\\n\\n {\\n\\n return Err(HypergraphError::HyperedgeInvalidContraction {\\n\\n index: hyperedge_index,\\n\\n target,\\n\\n vertices: deduped_vertices.into_iter().cloned().collect(),\\n\\n });\\n\\n }\\n\\n\\n\\n // Get the vertices not found in the hyperedge.\\n\",\n \"file_path\": \"src/core/hyperedges/contract_hyperedge_vertices.rs\",\n \"rank\": 11,\n \"score\": 56827.3998387396\n },\n {\n \"content\": \" return Err(HypergraphError::HyperedgeVerticesUnchanged(hyperedge_index));\\n\\n }\\n\\n\\n\\n // Find the vertices which have been added.\\n\\n let added = internal_vertices\\n\\n .iter()\\n\\n .fold(vec![], |mut acc: Vec<usize>, index| {\\n\\n if !previous_vertices\\n\\n .iter()\\n\\n .any(|current_index| current_index == index)\\n\\n {\\n\\n acc.push(*index)\\n\\n }\\n\\n\\n\\n acc\\n\\n })\\n\\n .into_iter()\\n\\n .sorted()\\n\\n .dedup()\\n\\n .collect_vec();\\n\",\n \"file_path\": \"src/core/hyperedges/update_hyperedge_vertices.rs\",\n \"rank\": 12,\n \"score\": 56826.90491271635\n },\n {\n \"content\": \"\\n\\n // Insert the new entry.\\n\\n // Since we are not altering the weight, we can safely perform the\\n\\n // operation without checking its output.\\n\\n self.hyperedges.insert(HyperedgeKey {\\n\\n vertices: internal_vertices,\\n\\n weight,\\n\\n });\\n\\n\\n\\n // Swap and remove by index.\\n\\n // Since we know that the internal index is correct, we can safely\\n\\n // perform the operation without checking its output.\\n\\n self.hyperedges.swap_remove_index(internal_index);\\n\\n\\n\\n // Return a unit.\\n\\n Ok(())\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/core/hyperedges/update_hyperedge_vertices.rs\",\n \"rank\": 13,\n \"score\": 56824.99544889156\n },\n {\n \"content\": \" let vertices_not_found =\\n\\n deduped_vertices\\n\\n .iter()\\n\\n .fold(vec![], |mut acc: Vec<VertexIndex>, &index| {\\n\\n if !hyperedge_vertices\\n\\n .iter()\\n\\n .any(|¤t_index| current_index == *index)\\n\\n {\\n\\n acc.push(index.to_owned())\\n\\n }\\n\\n\\n\\n acc\\n\\n });\\n\\n\\n\\n // Check that all the vertices - target included - are a subset of\\n\\n // the current hyperedge's vertices.\\n\\n if !vertices_not_found.is_empty() {\\n\\n return Err(HypergraphError::HyperedgeVerticesIndexesNotFound {\\n\\n index: hyperedge_index,\\n\\n vertices: vertices_not_found,\\n\",\n \"file_path\": \"src/core/hyperedges/contract_hyperedge_vertices.rs\",\n \"rank\": 14,\n \"score\": 56824.97896707374\n },\n {\n \"content\": \" });\\n\\n }\\n\\n\\n\\n // Store all the hyperedges which are going to change.\\n\\n let mut all_hyperedges: Vec<HyperedgeIndex> = vec![];\\n\\n\\n\\n // Iterate over all the deduped vertices.\\n\\n for &vertex in deduped_vertices.iter() {\\n\\n // Safely get the hyperedges of the current vertex.\\n\\n let mut vertex_hyperedges = self.get_vertex_hyperedges(*vertex)?;\\n\\n\\n\\n // Concatenate them to the global ones.\\n\\n all_hyperedges.append(&mut vertex_hyperedges);\\n\\n }\\n\\n\\n\\n // Iterate over all the deduped hyperedges.\\n\\n for &hyperedge in all_hyperedges.iter().sorted().dedup() {\\n\\n let hyperedge_vertices = self.get_hyperedge_vertices(hyperedge)?;\\n\\n\\n\\n // Contract the vertices of the hyperedge.\\n\",\n \"file_path\": \"src/core/hyperedges/contract_hyperedge_vertices.rs\",\n \"rank\": 15,\n \"score\": 56824.6605777007\n },\n {\n \"content\": \" let contraction = hyperedge_vertices\\n\\n .iter()\\n\\n // First remap each vertex to itself or to the target.\\n\\n .map(|vertex| {\\n\\n if deduped_vertices\\n\\n .iter()\\n\\n .any(|¤t_index| current_index == vertex)\\n\\n {\\n\\n target\\n\\n } else {\\n\\n *vertex\\n\\n }\\n\\n })\\n\\n // Then dedupe the resulting vector.\\n\\n .dedup()\\n\\n .collect_vec();\\n\\n\\n\\n // Only update the hyperedge if necessary.\\n\\n if !are_slices_equal(\\n\\n &self.get_internal_vertices(&contraction)?,\\n\",\n \"file_path\": \"src/core/hyperedges/contract_hyperedge_vertices.rs\",\n \"rank\": 16,\n \"score\": 56822.59394760825\n },\n {\n \"content\": \" match self.vertices.get_index_mut(index) {\\n\\n Some((_, index_set)) => {\\n\\n index_set.insert(internal_index);\\n\\n }\\n\\n None => return Err(HypergraphError::InternalVertexIndexNotFound(index)),\\n\\n }\\n\\n }\\n\\n\\n\\n // Update the removed vertices.\\n\\n for index in removed.into_iter() {\\n\\n match self.vertices.get_index_mut(index) {\\n\\n Some((_, index_set)) => {\\n\\n // This has an impact on the internal indexing for the set.\\n\\n // However since this is not exposed to the user - i.e. no\\n\\n // mapping is involved - we can safely perform the operation.\\n\\n index_set.swap_remove_index(internal_index);\\n\\n }\\n\\n None => return Err(HypergraphError::InternalVertexIndexNotFound(index)),\\n\\n }\\n\\n }\\n\",\n \"file_path\": \"src/core/hyperedges/update_hyperedge_vertices.rs\",\n \"rank\": 17,\n \"score\": 56822.3039174044\n },\n {\n \"content\": \" &self.get_internal_vertices(hyperedge_vertices)?,\\n\\n ) {\\n\\n // Safely update the current hyperedge with the contraction.\\n\\n self.update_hyperedge_vertices(hyperedge, contraction)?;\\n\\n }\\n\\n }\\n\\n\\n\\n // Return the contraction.\\n\\n self.get_hyperedge_vertices(hyperedge_index)\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/core/hyperedges/contract_hyperedge_vertices.rs\",\n \"rank\": 18,\n \"score\": 56821.54029631087\n },\n {\n \"content\": \"\\n\\n // Find the vertices which have been removed.\\n\\n let removed = previous_vertices\\n\\n .iter()\\n\\n .filter_map(|index| {\\n\\n if !internal_vertices\\n\\n .iter()\\n\\n .any(|current_index| index == current_index)\\n\\n {\\n\\n Some(*index)\\n\\n } else {\\n\\n None\\n\\n }\\n\\n })\\n\\n .sorted()\\n\\n .dedup()\\n\\n .collect_vec();\\n\\n\\n\\n // Update the added vertices.\\n\\n for index in added.into_iter() {\\n\",\n \"file_path\": \"src/core/hyperedges/update_hyperedge_vertices.rs\",\n \"rank\": 19,\n \"score\": 56818.07072682149\n },\n {\n \"content\": \"pub(crate) mod add_vertex_index;\\n\\npub(crate) mod get_internal_vertex;\\n\\npub(crate) mod get_internal_vertices;\\n\\npub(crate) mod get_vertex;\\n\\npub(crate) mod get_vertices;\\n\\n\\n\\npub mod add_vertex;\\n\\npub mod count_vertices;\\n\\npub mod get_adjacent_vertices_from;\\n\\npub mod get_adjacent_vertices_to;\\n\\npub mod get_dijkstra_connections;\\n\\npub mod get_full_vertex_hyperedges;\\n\\npub mod get_vertex_degree_in;\\n\\npub mod get_vertex_degree_out;\\n\\npub mod get_vertex_hyperedges;\\n\\npub mod get_vertex_weight;\\n\\npub mod remove_vertex;\\n\\npub mod update_vertex_weight;\\n\",\n \"file_path\": \"src/core/vertices/mod.rs\",\n \"rank\": 20,\n \"score\": 55024.537842338716\n },\n {\n \"content\": \"pub(crate) mod add_hyperedge_index;\\n\\npub(crate) mod get_hyperedge;\\n\\npub(crate) mod get_hyperedges;\\n\\npub(crate) mod get_internal_hyperedge;\\n\\npub(crate) mod get_internal_hyperedges;\\n\\n\\n\\npub mod add_hyperedge;\\n\\npub mod clear_hyperedges;\\n\\npub mod contract_hyperedge_vertices;\\n\\npub mod count_hyperedges;\\n\\npub mod get_hyperedge_vertices;\\n\\npub mod get_hyperedge_weight;\\n\\npub mod get_hyperedges_connecting;\\n\\npub mod get_hyperedges_intersections;\\n\\npub mod remove_hyperedge;\\n\\npub mod reverse_hyperedge;\\n\\npub mod update_hyperedge_vertices;\\n\\npub mod update_hyperedge_weight;\\n\",\n \"file_path\": \"src/core/hyperedges/mod.rs\",\n \"rank\": 21,\n \"score\": 54974.347395593286\n },\n {\n \"content\": \"use crate::{errors::HypergraphError, Hypergraph, SharedTrait, VertexIndex};\\n\\n\\n\\nimpl<V, HE> Hypergraph<V, HE>\\n\\nwhere\\n\\n V: SharedTrait,\\n\\n HE: SharedTrait,\\n\\n{\\n\\n /// Updates the weight of a vertex by index.\\n\\n pub fn update_vertex_weight(\\n\\n &mut self,\\n\\n vertex_index: VertexIndex,\\n\\n weight: V,\\n\\n ) -> Result<(), HypergraphError<V, HE>> {\\n\\n let internal_index = self.get_internal_vertex(vertex_index)?;\\n\\n\\n\\n let (previous_weight, index_set) = self\\n\\n .vertices\\n\\n .get_index(internal_index)\\n\\n .map(|(previous_weight, index_set)| (previous_weight.to_owned(), index_set.to_owned()))\\n\\n .ok_or(HypergraphError::InternalVertexIndexNotFound(internal_index))?;\\n\",\n \"file_path\": \"src/core/vertices/update_vertex_weight.rs\",\n \"rank\": 22,\n \"score\": 50611.795052880334\n },\n {\n \"content\": \"use crate::{errors::HypergraphError, Hypergraph, SharedTrait, VertexIndex};\\n\\n\\n\\nimpl<V, HE> Hypergraph<V, HE>\\n\\nwhere\\n\\n V: SharedTrait,\\n\\n HE: SharedTrait,\\n\\n{\\n\\n /// Gets the weight of a vertex from its index.\\n\\n pub fn get_vertex_weight(\\n\\n &self,\\n\\n vertex_index: VertexIndex,\\n\\n ) -> Result<V, HypergraphError<V, HE>> {\\n\\n let internal_index = self.get_internal_vertex(vertex_index)?;\\n\\n\\n\\n self.vertices\\n\\n .get_index(internal_index)\\n\\n .map(|(weight, _)| *weight)\\n\\n .ok_or(HypergraphError::InternalVertexIndexNotFound(internal_index))\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/core/vertices/get_vertex_weight.rs\",\n \"rank\": 23,\n \"score\": 50611.497370432735\n },\n {\n \"content\": \"\\n\\n // Return an error if the new weight is the same as the previous one.\\n\\n if weight == previous_weight {\\n\\n return Err(HypergraphError::VertexWeightUnchanged {\\n\\n index: vertex_index,\\n\\n weight,\\n\\n });\\n\\n }\\n\\n\\n\\n // Return an error if the new weight is already assigned to another\\n\\n // vertex.\\n\\n if self.vertices.contains_key(&weight) {\\n\\n return Err(HypergraphError::VertexWeightAlreadyAssigned(weight));\\n\\n }\\n\\n\\n\\n // We can't directly replace the value in the map.\\n\\n // First, we need to insert the new weight, it will end up\\n\\n // being at the last position.\\n\\n // Since we have already checked that the new weight is not in the\\n\\n // map, we can safely perform the operation without checking its output.\\n\",\n \"file_path\": \"src/core/vertices/update_vertex_weight.rs\",\n \"rank\": 24,\n \"score\": 50598.5134703989\n },\n {\n \"content\": \" self.vertices.insert(weight, index_set);\\n\\n\\n\\n // Then we use swap and remove. This will remove the previous weight\\n\\n // and insert the new one at the index position of the former.\\n\\n // This doesn't alter the indexing.\\n\\n // See the update_hyperedge_weight method for more detailed explanation.\\n\\n // Since we know that the internal index is correct, we can safely\\n\\n // perform the operation without checking its output.\\n\\n self.vertices.swap_remove_index(internal_index);\\n\\n\\n\\n // Return a unit.\\n\\n Ok(())\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/core/vertices/update_vertex_weight.rs\",\n \"rank\": 25,\n \"score\": 50597.81618690161\n },\n {\n \"content\": \"use crate::{errors::HypergraphError, HyperedgeIndex, Hypergraph, SharedTrait, VertexIndex};\\n\\n\\n\\nuse itertools::Itertools;\\n\\n\\n\\nimpl<V, HE> Hypergraph<V, HE>\\n\\nwhere\\n\\n V: SharedTrait,\\n\\n HE: SharedTrait,\\n\\n{\\n\\n /// Gets the hyperedges of a vertex as a vector of HyperedgeIndex.\\n\\n pub fn get_vertex_hyperedges(\\n\\n &self,\\n\\n vertex_index: VertexIndex,\\n\\n ) -> Result<Vec<HyperedgeIndex>, HypergraphError<V, HE>> {\\n\\n let internal_index = self.get_internal_vertex(vertex_index)?;\\n\\n\\n\\n let (_, hyperedges_index_set) = self\\n\\n .vertices\\n\\n .get_index(internal_index)\\n\\n .ok_or(HypergraphError::InternalVertexIndexNotFound(internal_index))?;\\n\\n\\n\\n self.get_hyperedges(hyperedges_index_set.clone().into_iter().collect_vec())\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/core/vertices/get_vertex_hyperedges.rs\",\n \"rank\": 26,\n \"score\": 49130.99139329906\n },\n {\n \"content\": \"use crate::{errors::HypergraphError, Hypergraph, SharedTrait, VertexIndex};\\n\\n\\n\\nimpl<V, HE> Hypergraph<V, HE>\\n\\nwhere\\n\\n V: SharedTrait,\\n\\n HE: SharedTrait,\\n\\n{\\n\\n /// Gets the hyperedges of a vertex as a vector of vectors of VertexIndex.\\n\\n pub fn get_full_vertex_hyperedges(\\n\\n &self,\\n\\n vertex_index: VertexIndex,\\n\\n ) -> Result<Vec<Vec<VertexIndex>>, HypergraphError<V, HE>> {\\n\\n self.get_vertex_hyperedges(vertex_index).map(|hyperedges| {\\n\\n hyperedges\\n\\n .into_iter()\\n\\n .flat_map(|hyperedge_index| self.get_hyperedge_vertices(hyperedge_index))\\n\\n .collect()\\n\\n })\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/core/vertices/get_full_vertex_hyperedges.rs\",\n \"rank\": 27,\n \"score\": 47234.08209218856\n },\n {\n \"content\": \"#[test]\\n\\nfn integration() {\\n\\n // Create a new hypergraph.\\n\\n let mut graph = Hypergraph::<Vertex<'_>, &str>::new();\\n\\n\\n\\n // Create some vertices.\\n\\n let andrea = Vertex::new(\\\"Andrea\\\");\\n\\n let bjǫrn = Vertex::new(\\\"Bjǫrn\\\");\\n\\n let charlie = Vertex::new(\\\"Charlie\\\");\\n\\n let dana = Vertex::new(\\\"Dana\\\");\\n\\n let enola = Vertex::new(\\\"Enola\\\");\\n\\n\\n\\n // Add those vertices to the hypergraph.\\n\\n assert_eq!(\\n\\n graph.add_vertex(andrea),\\n\\n Ok(VertexIndex(0)),\\n\\n \\\"should add the first vertex\\\"\\n\\n );\\n\\n assert_eq!(\\n\\n graph.add_vertex(bjǫrn),\\n\\n Ok(VertexIndex(1)),\\n\",\n \"file_path\": \"tests/integration_main.rs\",\n \"rank\": 28,\n \"score\": 35002.14815973941\n },\n {\n \"content\": \"#[test]\\n\\nfn integration_contration() {\\n\\n // Create a new hypergraph.\\n\\n let mut graph = Hypergraph::<Vertex<'_>, &str>::new();\\n\\n\\n\\n // Create some vertices.\\n\\n let a = graph.add_vertex(Vertex::new(\\\"a\\\")).unwrap();\\n\\n let b = graph.add_vertex(Vertex::new(\\\"b\\\")).unwrap();\\n\\n let c = graph.add_vertex(Vertex::new(\\\"c\\\")).unwrap();\\n\\n let d = graph.add_vertex(Vertex::new(\\\"d\\\")).unwrap();\\n\\n let e = graph.add_vertex(Vertex::new(\\\"e\\\")).unwrap();\\n\\n\\n\\n // Create some hyperedges.\\n\\n let alpha = graph.add_hyperedge(vec![a, b, c, d, e], \\\"α\\\").unwrap();\\n\\n let beta = graph.add_hyperedge(vec![a, c, d, e, c], \\\"β\\\").unwrap();\\n\\n let gamma = graph.add_hyperedge(vec![a, e, b], \\\"γ\\\").unwrap();\\n\\n let delta = graph.add_hyperedge(vec![b, c, b, d, c], \\\"δ\\\").unwrap();\\n\\n let epsilon = graph.add_hyperedge(vec![c, c, c], \\\"ε\\\").unwrap();\\n\\n\\n\\n // In the alpha hyperedge, contract the vertices b and c into one single vertex b.\\n\\n assert_eq!(\\n\",\n \"file_path\": \"tests/integration_contraction.rs\",\n \"rank\": 29,\n \"score\": 33804.70137271395\n },\n {\n \"content\": \"use crate::{errors::HypergraphError, Hypergraph, SharedTrait, VertexIndex};\\n\\n\\n\\nimpl<V, HE> Hypergraph<V, HE>\\n\\nwhere\\n\\n V: SharedTrait,\\n\\n HE: SharedTrait,\\n\\n{\\n\\n // Private method to get a vector of VertexIndex from a vector of internal indexes.\\n\\n pub(crate) fn get_vertices(\\n\\n &self,\\n\\n vertices: Vec<usize>,\\n\\n ) -> Result<Vec<VertexIndex>, HypergraphError<V, HE>> {\\n\\n vertices\\n\\n .iter()\\n\\n .map(|vertex_index| self.get_vertex(*vertex_index))\\n\\n .collect()\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/core/vertices/get_vertices.rs\",\n \"rank\": 30,\n \"score\": 33200.96063156437\n },\n {\n \"content\": \"use crate::{Hypergraph, SharedTrait};\\n\\n\\n\\nimpl<V, HE> Hypergraph<V, HE>\\n\\nwhere\\n\\n V: SharedTrait,\\n\\n HE: SharedTrait,\\n\\n{\\n\\n /// Returns the number of vertices in the hypergraph.\\n\\n pub fn count_vertices(&self) -> usize {\\n\\n self.vertices.len()\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/core/vertices/count_vertices.rs\",\n \"rank\": 31,\n \"score\": 33200.327275684875\n },\n {\n \"content\": \"use crate::{\\n\\n errors::HypergraphError, HyperedgeIndex, HyperedgeKey, Hypergraph, SharedTrait, VertexIndex,\\n\\n};\\n\\n\\n\\nimpl<V, HE> Hypergraph<V, HE>\\n\\nwhere\\n\\n V: SharedTrait,\\n\\n HE: SharedTrait,\\n\\n{\\n\\n /// Adds a hyperedge as an array of vertices indexes and a custom weight in the hypergraph.\\n\\n /// Returns the weighted index of the hyperedge.\\n\\n pub fn add_hyperedge(\\n\\n &mut self,\\n\\n vertices: Vec<VertexIndex>,\\n\\n weight: HE,\\n\\n ) -> Result<HyperedgeIndex, HypergraphError<V, HE>> {\\n\\n // If the provided vertices are empty, skip the update.\\n\\n if vertices.is_empty() {\\n\\n return Err(HypergraphError::HyperedgeCreationNoVertices(weight));\\n\\n }\\n\",\n \"file_path\": \"src/core/hyperedges/add_hyperedge.rs\",\n \"rank\": 32,\n \"score\": 33142.54024360859\n },\n {\n \"content\": \"use crate::{bi_hash_map::BiHashMap, errors::HypergraphError, Hypergraph, SharedTrait};\\n\\n\\n\\nimpl<V, HE> Hypergraph<V, HE>\\n\\nwhere\\n\\n V: SharedTrait,\\n\\n HE: SharedTrait,\\n\\n{\\n\\n /// Clears all the hyperedges from the hypergraph.\\n\\n pub fn clear_hyperedges(&mut self) -> Result<(), HypergraphError<V, HE>> {\\n\\n // Clear the set while keeping its capacity.\\n\\n self.hyperedges.clear();\\n\\n\\n\\n // Reset the hyperedges mapping.\\n\\n self.hyperedges_mapping = BiHashMap::default();\\n\\n\\n\\n // Reset the hyperedges counter.\\n\\n self.hyperedges_count = 0;\\n\\n\\n\\n // Update the vertices accordingly.\\n\\n self.vertices\\n\\n .iter_mut()\\n\\n // Clear the sets while keeping their capacities.\\n\\n .for_each(|(_, hyperedges)| hyperedges.clear());\\n\\n\\n\\n Ok(())\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/core/hyperedges/clear_hyperedges.rs\",\n \"rank\": 33,\n \"score\": 33141.67823522222\n },\n {\n \"content\": \"use crate::{errors::HypergraphError, HyperedgeIndex, Hypergraph, SharedTrait};\\n\\n\\n\\nuse itertools::Itertools;\\n\\n\\n\\nimpl<V, HE> Hypergraph<V, HE>\\n\\nwhere\\n\\n V: SharedTrait,\\n\\n HE: SharedTrait,\\n\\n{\\n\\n // Reverses a hyperedge.\\n\\n pub fn reverse_hyperedge(\\n\\n &mut self,\\n\\n hyperedge_index: HyperedgeIndex,\\n\\n ) -> Result<(), HypergraphError<V, HE>> {\\n\\n // Get the vertices of the hyperedge.\\n\\n let vertices = self.get_hyperedge_vertices(hyperedge_index)?;\\n\\n\\n\\n // Update the hyperedge with the reversed vertices.\\n\\n self.update_hyperedge_vertices(hyperedge_index, vertices.into_iter().rev().collect_vec())\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/core/hyperedges/reverse_hyperedge.rs\",\n \"rank\": 34,\n \"score\": 33140.810261692815\n },\n {\n \"content\": \"use crate::{errors::HypergraphError, HyperedgeIndex, Hypergraph, SharedTrait};\\n\\n\\n\\nimpl<V, HE> Hypergraph<V, HE>\\n\\nwhere\\n\\n V: SharedTrait,\\n\\n HE: SharedTrait,\\n\\n{\\n\\n // Private method to get a vector of HyperedgeIndex from a vector of internal indexes.\\n\\n pub(crate) fn get_hyperedges(\\n\\n &self,\\n\\n hyperedges: Vec<usize>,\\n\\n ) -> Result<Vec<HyperedgeIndex>, HypergraphError<V, HE>> {\\n\\n hyperedges\\n\\n .iter()\\n\\n .map(|hyperedge_index| self.get_hyperedge(*hyperedge_index))\\n\\n .collect()\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/core/hyperedges/get_hyperedges.rs\",\n \"rank\": 35,\n \"score\": 33137.76113289751\n },\n {\n \"content\": \"use crate::{errors::HypergraphError, HyperedgeIndex, HyperedgeKey, Hypergraph, SharedTrait};\\n\\n\\n\\nimpl<V, HE> Hypergraph<V, HE>\\n\\nwhere\\n\\n V: SharedTrait,\\n\\n HE: SharedTrait,\\n\\n{\\n\\n /// Removes a hyperedge by index.\\n\\n pub fn remove_hyperedge(\\n\\n &mut self,\\n\\n hyperedge_index: HyperedgeIndex,\\n\\n ) -> Result<(), HypergraphError<V, HE>> {\\n\\n let internal_index = self.get_internal_hyperedge(hyperedge_index)?;\\n\\n\\n\\n let HyperedgeKey { vertices, .. } = self\\n\\n .hyperedges\\n\\n .get_index(internal_index)\\n\\n .map(|hyperedge_key| hyperedge_key.to_owned())\\n\\n .ok_or(HypergraphError::InternalHyperedgeIndexNotFound(\\n\\n internal_index,\\n\",\n \"file_path\": \"src/core/hyperedges/remove_hyperedge.rs\",\n \"rank\": 36,\n \"score\": 33137.742930046436\n },\n {\n \"content\": \"use crate::{errors::HypergraphError, HyperedgeIndex, Hypergraph, SharedTrait};\\n\\n\\n\\nimpl<V, HE> Hypergraph<V, HE>\\n\\nwhere\\n\\n V: SharedTrait,\\n\\n HE: SharedTrait,\\n\\n{\\n\\n // Private method to get the HyperedgeIndex matching an internal index.\\n\\n pub(crate) fn get_hyperedge(\\n\\n &self,\\n\\n hyperedge_index: usize,\\n\\n ) -> Result<HyperedgeIndex, HypergraphError<V, HE>> {\\n\\n match self.hyperedges_mapping.left.get(&hyperedge_index) {\\n\\n Some(index) => Ok(*index),\\n\\n None => Err(HypergraphError::InternalHyperedgeIndexNotFound(\\n\\n hyperedge_index,\\n\\n )),\\n\\n }\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/core/hyperedges/get_hyperedge.rs\",\n \"rank\": 37,\n \"score\": 33136.87150555072\n },\n {\n \"content\": \"use crate::{Hypergraph, SharedTrait};\\n\\n\\n\\nimpl<V, HE> Hypergraph<V, HE>\\n\\nwhere\\n\\n V: SharedTrait,\\n\\n HE: SharedTrait,\\n\\n{\\n\\n /// Returns the number of hyperedges in the hypergraph.\\n\\n pub fn count_hyperedges(&self) -> usize {\\n\\n self.hyperedges.len()\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/core/hyperedges/count_hyperedges.rs\",\n \"rank\": 38,\n \"score\": 33136.408269066116\n },\n {\n \"content\": \"\\n\\n let internal_vertices = self.get_internal_vertices(vertices)?;\\n\\n\\n\\n // Return an error if the weight is already assigned to another\\n\\n // hyperedge.\\n\\n // We can't use the contains method here since the key is a combination\\n\\n // of the weight and the vertices.\\n\\n if self.hyperedges.iter().any(\\n\\n |HyperedgeKey {\\n\\n weight: current_weight,\\n\\n ..\\n\\n }| { *current_weight == weight },\\n\\n ) {\\n\\n return Err(HypergraphError::HyperedgeWeightAlreadyAssigned(weight));\\n\\n }\\n\\n\\n\\n // We don't care about the second member of the tuple returned from\\n\\n // the insertion since this is an infallible operation.\\n\\n let (internal_index, _) = self\\n\\n .hyperedges\\n\",\n \"file_path\": \"src/core/hyperedges/add_hyperedge.rs\",\n \"rank\": 39,\n \"score\": 33126.25480495996\n },\n {\n \"content\": \" .insert_full(HyperedgeKey::new(internal_vertices.clone(), weight));\\n\\n\\n\\n // Update the vertices so that we keep directly track of the hyperedge.\\n\\n for vertex in internal_vertices.into_iter() {\\n\\n let (_, index_set) = self\\n\\n .vertices\\n\\n .get_index_mut(vertex)\\n\\n .ok_or(HypergraphError::InternalVertexIndexNotFound(vertex))?;\\n\\n\\n\\n index_set.insert(internal_index);\\n\\n }\\n\\n\\n\\n Ok(self.add_hyperedge_index(internal_index))\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/core/hyperedges/add_hyperedge.rs\",\n \"rank\": 40,\n \"score\": 33125.90588915673\n },\n {\n \"content\": \"\\n\\n // Get the vertices of the swapped hyperedge.\\n\\n let HyperedgeKey {\\n\\n vertices: swapped_vertices,\\n\\n ..\\n\\n } = self\\n\\n .hyperedges\\n\\n .get_index(internal_index)\\n\\n .map(|hyperedge_key| hyperedge_key.to_owned())\\n\\n .ok_or(HypergraphError::InternalHyperedgeIndexNotFound(\\n\\n internal_index,\\n\\n ))?;\\n\\n\\n\\n // Update the impacted vertices accordingly.\\n\\n for vertex in swapped_vertices.into_iter() {\\n\\n match self.vertices.get_index_mut(vertex) {\\n\\n Some((_, index_set)) => {\\n\\n // Update the by performing an insertion of the current\\n\\n // hyperedge and a removal of the swapped one.\\n\\n index_set.insert(internal_index);\\n\",\n \"file_path\": \"src/core/hyperedges/remove_hyperedge.rs\",\n \"rank\": 41,\n \"score\": 33121.80595759407\n },\n {\n \"content\": \" ))?;\\n\\n\\n\\n // Find the last index.\\n\\n let last_index = self.hyperedges.len() - 1;\\n\\n\\n\\n // Swap and remove by index.\\n\\n self.hyperedges.swap_remove_index(internal_index);\\n\\n\\n\\n // Update the mapping for the removed hyperedge.\\n\\n self.hyperedges_mapping.left.remove(&internal_index);\\n\\n self.hyperedges_mapping.right.remove(&hyperedge_index);\\n\\n\\n\\n // Remove the hyperedge from the vertices.\\n\\n for vertex in vertices.into_iter() {\\n\\n match self.vertices.get_index_mut(vertex) {\\n\\n Some((_, index_set)) => {\\n\\n index_set.remove(&internal_index);\\n\\n }\\n\\n None => return Err(HypergraphError::InternalVertexIndexNotFound(vertex)),\\n\\n }\\n\",\n \"file_path\": \"src/core/hyperedges/remove_hyperedge.rs\",\n \"rank\": 42,\n \"score\": 33121.16815666116\n },\n {\n \"content\": \" }\\n\\n\\n\\n // Given the following bi-mapping with three hyperedges, i.e. an\\n\\n // initial set of hyperedges [0, 1, 2]. Let's assume in this example\\n\\n // that the first hyperedge will be removed:\\n\\n //\\n\\n // left | Right\\n\\n // ---------------------------------------------------------\\n\\n // 0usize -> HyperedgeIndex(0) | HyperedgeIndex(0) -> 0usize\\n\\n // 1usize -> HyperedgeIndex(1) | HyperedgeIndex(1) -> 1usize\\n\\n // 2usize -> HyperedgeIndex(2) | HyperedgeIndex(2) -> 2usize\\n\\n //\\n\\n // In the previous steps, the current hyperedge has been already nuked.\\n\\n // So we now have:\\n\\n //\\n\\n // left | Right\\n\\n // ---------------------------------------------------------\\n\\n // xxxxxxxxxxxxxxxxxxxxxxxxxxx | xxxxxxxxxxxxxxxxxxxxxxxxxxx\\n\\n // 1usize -> HyperedgeIndex(1) | HyperedgeIndex(1) -> 1usize\\n\\n // 2usize -> HyperedgeIndex(2) | HyperedgeIndex(2) -> 2usize\\n\",\n \"file_path\": \"src/core/hyperedges/remove_hyperedge.rs\",\n \"rank\": 43,\n \"score\": 33119.507855204036\n },\n {\n \"content\": \" //\\n\\n // The next step will be to insert the swapped index on the right:\\n\\n //\\n\\n // left | Right\\n\\n // ---------------------------------------------------------\\n\\n // xxxxxxxxxxxxxxxxxxxxxxxxxxx | xxxxxxxxxxxxxxxxxxxxxxxxxxx\\n\\n // 1usize -> HyperedgeIndex(1) | HyperedgeIndex(1) -> 1usize\\n\\n // 2usize -> HyperedgeIndex(2) | HyperedgeIndex(2) -> 0usize\\n\\n //\\n\\n // Now remove the index which no longer exists on the left:\\n\\n //\\n\\n // left | Right\\n\\n // ---------------------------------------------------------\\n\\n // xxxxxxxxxxxxxxxxxxxxxxxxxxx | xxxxxxxxxxxxxxxxxxxxxxxxxxx\\n\\n // 1usize -> HyperedgeIndex(1) | HyperedgeIndex(1) -> 1usize\\n\\n // xxxxxxxxxxxxxxxxxxxxxxxxxxx | HyperedgeIndex(2) -> 0usize\\n\\n //\\n\\n // Insert the swapped index on the left:\\n\\n //\\n\\n // left | Right\\n\",\n \"file_path\": \"src/core/hyperedges/remove_hyperedge.rs\",\n \"rank\": 44,\n \"score\": 33119.14957539039\n },\n {\n \"content\": \" // ---------------------------------------------------------\\n\\n // 0usize -> HyperedgeIndex(2) | xxxxxxxxxxxxxxxxxxxxxxxxxxx\\n\\n // 1usize -> HyperedgeIndex(1) | HyperedgeIndex(1) -> 1usize\\n\\n // xxxxxxxxxxxxxxxxxxxxxxxxxxx | HyperedgeIndex(2) -> 0usize\\n\\n //\\n\\n // If the index to remove wasn't the last one, the last hyperedge has\\n\\n // been swapped in place of the removed one. Thus we need to update\\n\\n // the mapping accordingly.\\n\\n if internal_index != last_index {\\n\\n // Get the index of the swapped hyperedge.\\n\\n let swapped_hyperedge_index = self.get_hyperedge(last_index)?;\\n\\n\\n\\n // Proceed with the aforementioned operations.\\n\\n self.hyperedges_mapping\\n\\n .right\\n\\n .insert(swapped_hyperedge_index, internal_index);\\n\\n self.hyperedges_mapping.left.remove(&last_index);\\n\\n self.hyperedges_mapping\\n\\n .left\\n\\n .insert(internal_index, swapped_hyperedge_index);\\n\",\n \"file_path\": \"src/core/hyperedges/remove_hyperedge.rs\",\n \"rank\": 45,\n \"score\": 33118.55143205702\n },\n {\n \"content\": \" index_set.remove(&last_index);\\n\\n }\\n\\n None => return Err(HypergraphError::InternalVertexIndexNotFound(vertex)),\\n\\n }\\n\\n }\\n\\n }\\n\\n\\n\\n // Return a unit.\\n\\n Ok(())\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/core/hyperedges/remove_hyperedge.rs\",\n \"rank\": 46,\n \"score\": 33114.49636577883\n },\n {\n \"content\": \"use crate::{errors::HypergraphError, Hypergraph, SharedTrait, VertexIndex};\\n\\n\\n\\nimpl<V, HE> Hypergraph<V, HE>\\n\\nwhere\\n\\n V: SharedTrait,\\n\\n HE: SharedTrait,\\n\\n{\\n\\n // Private method to get the internal vertices from a vector of VertexIndex.\\n\\n pub(crate) fn get_internal_vertices<E: AsRef<Vec<VertexIndex>>>(\\n\\n &self,\\n\\n vertices: E,\\n\\n ) -> Result<Vec<usize>, HypergraphError<V, HE>> {\\n\\n vertices\\n\\n .as_ref()\\n\\n .iter()\\n\\n .map(|vertex_index| self.get_internal_vertex(*vertex_index))\\n\\n .collect()\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/core/vertices/get_internal_vertices.rs\",\n \"rank\": 47,\n \"score\": 32324.136354634356\n },\n {\n \"content\": \"use crate::{\\n\\n core::shared::Connection, errors::HypergraphError, Hypergraph, SharedTrait, VertexIndex,\\n\\n};\\n\\n\\n\\nuse itertools::Itertools;\\n\\n\\n\\nimpl<V, HE> Hypergraph<V, HE>\\n\\nwhere\\n\\n V: SharedTrait,\\n\\n HE: SharedTrait,\\n\\n{\\n\\n /// Gets the list of all vertices connected to a given vertex.\\n\\n pub fn get_adjacent_vertices_to(\\n\\n &self,\\n\\n to: VertexIndex,\\n\\n ) -> Result<Vec<VertexIndex>, HypergraphError<V, HE>> {\\n\\n let results = self.get_connections(Connection::Out(to))?;\\n\\n\\n\\n Ok(results\\n\\n .into_iter()\\n\\n .filter_map(|(_, vertex_index)| vertex_index)\\n\\n .sorted()\\n\\n .dedup()\\n\\n .collect_vec())\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/core/vertices/get_adjacent_vertices_to.rs\",\n \"rank\": 48,\n \"score\": 32323.42812756316\n },\n {\n \"content\": \"use crate::{\\n\\n core::shared::Connection, errors::HypergraphError, Hypergraph, SharedTrait, VertexIndex,\\n\\n};\\n\\n\\n\\nuse itertools::Itertools;\\n\\n\\n\\nimpl<V, HE> Hypergraph<V, HE>\\n\\nwhere\\n\\n V: SharedTrait,\\n\\n HE: SharedTrait,\\n\\n{\\n\\n /// Gets the list of all vertices connected from a given vertex.\\n\\n pub fn get_adjacent_vertices_from(\\n\\n &self,\\n\\n from: VertexIndex,\\n\\n ) -> Result<Vec<VertexIndex>, HypergraphError<V, HE>> {\\n\\n let results = self.get_connections(Connection::In(from))?;\\n\\n\\n\\n Ok(results\\n\\n .into_iter()\\n\\n .filter_map(|(_, vertex_index)| vertex_index)\\n\\n .sorted()\\n\\n .dedup()\\n\\n .collect_vec())\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/core/vertices/get_adjacent_vertices_from.rs\",\n \"rank\": 49,\n \"score\": 32323.42812756316\n },\n {\n \"content\": \"use crate::{errors::HypergraphError, HyperedgeIndex, Hypergraph, SharedTrait};\\n\\n\\n\\nimpl<V, HE> Hypergraph<V, HE>\\n\\nwhere\\n\\n V: SharedTrait,\\n\\n HE: SharedTrait,\\n\\n{\\n\\n // Private method to get the internal hyperedges from a vector of HyperedgeIndex.\\n\\n pub(crate) fn get_internal_hyperedges(\\n\\n &self,\\n\\n hyperedges: Vec<HyperedgeIndex>,\\n\\n ) -> Result<Vec<usize>, HypergraphError<V, HE>> {\\n\\n hyperedges\\n\\n .iter()\\n\\n .map(|hyperedge_index| self.get_internal_hyperedge(*hyperedge_index))\\n\\n .collect()\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/core/hyperedges/get_internal_hyperedges.rs\",\n \"rank\": 50,\n \"score\": 32263.03853431045\n },\n {\n \"content\": \"use crate::{\\n\\n errors::HypergraphError, HyperedgeIndex, HyperedgeKey, Hypergraph, SharedTrait, VertexIndex,\\n\\n};\\n\\n\\n\\nuse itertools::Itertools;\\n\\n\\n\\nimpl<V, HE> Hypergraph<V, HE>\\n\\nwhere\\n\\n V: SharedTrait,\\n\\n HE: SharedTrait,\\n\\n{\\n\\n /// Gets the intersections of a set of hyperedges as a vector of vertices.\\n\\n pub fn get_hyperedges_intersections(\\n\\n &self,\\n\\n hyperedges: Vec<HyperedgeIndex>,\\n\\n ) -> Result<Vec<VertexIndex>, HypergraphError<V, HE>> {\\n\\n // Keep track of the number of hyperedges.\\n\\n let number_of_hyperedges = hyperedges.len();\\n\\n\\n\\n // Early exit if less than two hyperedges are provided.\\n\",\n \"file_path\": \"src/core/hyperedges/get_hyperedges_intersections.rs\",\n \"rank\": 51,\n \"score\": 32262.375543619717\n },\n {\n \"content\": \"use crate::{errors::HypergraphError, HyperedgeIndex, Hypergraph, SharedTrait};\\n\\n\\n\\nimpl<V, HE> Hypergraph<V, HE>\\n\\nwhere\\n\\n V: SharedTrait,\\n\\n HE: SharedTrait,\\n\\n{\\n\\n // Private method to get the internal hyperedge matching a HyperedgeIndex.\\n\\n pub(crate) fn get_internal_hyperedge(\\n\\n &self,\\n\\n hyperedge_index: HyperedgeIndex,\\n\\n ) -> Result<usize, HypergraphError<V, HE>> {\\n\\n match self.hyperedges_mapping.right.get(&hyperedge_index) {\\n\\n Some(index) => Ok(*index),\\n\\n None => Err(HypergraphError::HyperedgeIndexNotFound(hyperedge_index)),\\n\\n }\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/core/hyperedges/get_internal_hyperedge.rs\",\n \"rank\": 52,\n \"score\": 32262.303361698057\n },\n {\n \"content\": \"use crate::{\\n\\n core::shared::Connection, errors::HypergraphError, HyperedgeIndex, Hypergraph, SharedTrait,\\n\\n VertexIndex,\\n\\n};\\n\\n\\n\\nuse itertools::Itertools;\\n\\n\\n\\nimpl<V, HE> Hypergraph<V, HE>\\n\\nwhere\\n\\n V: SharedTrait,\\n\\n HE: SharedTrait,\\n\\n{\\n\\n /// Gets the hyperedges directly connecting a vertex to another.\\n\\n pub fn get_hyperedges_connecting(\\n\\n &self,\\n\\n from: VertexIndex,\\n\\n to: VertexIndex,\\n\\n ) -> Result<Vec<HyperedgeIndex>, HypergraphError<V, HE>> {\\n\\n let results = self.get_connections(Connection::InAndOut(from, to))?;\\n\\n\\n\\n Ok(results\\n\\n .into_iter()\\n\\n .map(|(hyperedged_index, _)| hyperedged_index)\\n\\n .collect_vec())\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/core/hyperedges/get_hyperedges_connecting.rs\",\n \"rank\": 53,\n \"score\": 32262.00690566154\n },\n {\n \"content\": \"use crate::{HyperedgeIndex, Hypergraph, SharedTrait};\\n\\n\\n\\nimpl<V, HE> Hypergraph<V, HE>\\n\\nwhere\\n\\n V: SharedTrait,\\n\\n HE: SharedTrait,\\n\\n{\\n\\n // This private method is infallible since adding the same hyperedge\\n\\n // will return the existing index.\\n\\n pub(crate) fn add_hyperedge_index(&mut self, internal_index: usize) -> HyperedgeIndex {\\n\\n match self.hyperedges_mapping.left.get(&internal_index) {\\n\\n Some(hyperedge_index) => *hyperedge_index,\\n\\n None => {\\n\\n let hyperedge_index = HyperedgeIndex(self.hyperedges_count);\\n\\n\\n\\n if self\\n\\n .hyperedges_mapping\\n\\n .left\\n\\n .insert(internal_index, hyperedge_index)\\n\\n .is_none()\\n\",\n \"file_path\": \"src/core/hyperedges/add_hyperedge_index.rs\",\n \"rank\": 54,\n \"score\": 32258.838524202638\n },\n {\n \"content\": \" )\\n\\n .collect::<Result<Vec<Vec<usize>>, HypergraphError<V, HE>>>();\\n\\n\\n\\n match vertices {\\n\\n Ok(vertices) => {\\n\\n self.get_vertices(\\n\\n vertices\\n\\n .into_iter()\\n\\n // Flatten and sort the vertices.\\n\\n .flatten()\\n\\n .sorted()\\n\\n // Map the result to tuples where the second term is an arbitrary value.\\n\\n // The goal is to group them by indexes.\\n\\n .map(|index| (index, 0))\\n\\n .into_group_map()\\n\\n .into_iter()\\n\\n // Filter the groups having the same size as the hyperedge.\\n\\n .filter_map(|(index, occurences)| {\\n\\n if occurences.len() == number_of_hyperedges {\\n\\n Some(index)\\n\",\n \"file_path\": \"src/core/hyperedges/get_hyperedges_intersections.rs\",\n \"rank\": 55,\n \"score\": 32251.33535068677\n },\n {\n \"content\": \" if number_of_hyperedges < 2 {\\n\\n return Err(HypergraphError::HyperedgesIntersections);\\n\\n }\\n\\n\\n\\n // Get the internal vertices of the hyperedges and keep the eventual error.\\n\\n let vertices = hyperedges\\n\\n .into_iter()\\n\\n .map(\\n\\n |hyperedge_index| match self.get_internal_hyperedge(hyperedge_index) {\\n\\n Ok(internal_index) => match self.hyperedges.get_index(internal_index).ok_or(\\n\\n HypergraphError::InternalHyperedgeIndexNotFound(internal_index),\\n\\n ) {\\n\\n Ok(HyperedgeKey { vertices, .. }) => {\\n\\n // Keep the unique vertices.\\n\\n Ok(vertices.iter().unique().cloned().collect_vec())\\n\\n }\\n\\n Err(error) => Err(error),\\n\\n },\\n\\n Err(error) => Err(error),\\n\\n },\\n\",\n \"file_path\": \"src/core/hyperedges/get_hyperedges_intersections.rs\",\n \"rank\": 56,\n \"score\": 32246.94626721219\n },\n {\n \"content\": \" } else {\\n\\n None\\n\\n }\\n\\n })\\n\\n .sorted()\\n\\n .collect_vec(),\\n\\n )\\n\\n }\\n\\n Err(error) => Err(error),\\n\\n }\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/core/hyperedges/get_hyperedges_intersections.rs\",\n \"rank\": 57,\n \"score\": 32240.766757086305\n },\n {\n \"content\": \" {\\n\\n // Update the counter only for the first insertion.\\n\\n self.hyperedges_count += 1;\\n\\n }\\n\\n\\n\\n self.hyperedges_mapping\\n\\n .right\\n\\n .insert(hyperedge_index, internal_index);\\n\\n\\n\\n hyperedge_index\\n\\n }\\n\\n }\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/core/hyperedges/add_hyperedge_index.rs\",\n \"rank\": 58,\n \"score\": 32240.577439157816\n },\n {\n \"content\": \"use itertools::Itertools;\\n\\n\\n\\npub(crate) fn are_slices_equal(a: &[usize], b: &[usize]) -> bool {\\n\\n // Early guard if lengths are different.\\n\\n if a.len() != b.len() {\\n\\n return false;\\n\\n }\\n\\n\\n\\n a.iter().zip_eq(b).fold(true, |acc, (a, b)| acc && a == b)\\n\\n}\\n\\n\\n\\n#[cfg(test)]\\n\\nmod tests {\\n\\n use super::*;\\n\\n\\n\\n #[test]\\n\\n fn check_matching() {\\n\\n assert!(are_slices_equal(&[], &[]));\\n\\n assert!(are_slices_equal(&[1], &[1]));\\n\\n assert!(are_slices_equal(&[1, 2, 3], &[1, 2, 3]));\\n\",\n \"file_path\": \"src/core/utils.rs\",\n \"rank\": 59,\n \"score\": 29910.408316224315\n },\n {\n \"content\": \" }\\n\\n #[test]\\n\\n fn check_not_matching() {\\n\\n assert!(!are_slices_equal(&[], &[1]));\\n\\n assert!(!are_slices_equal(&[1], &[]));\\n\\n assert!(!are_slices_equal(&[1], &[2]));\\n\\n assert!(!are_slices_equal(&[1, 2, 3], &[1, 2, 4]));\\n\\n assert!(!are_slices_equal(&[1, 2, 3], &[1, 2, 3, 4]));\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/core/utils.rs\",\n \"rank\": 60,\n \"score\": 29897.99982012266\n },\n {\n \"content\": \"use crate::{HyperedgeIndex, SharedTrait, VertexIndex};\\n\\n\\n\\nuse thiserror::Error;\\n\\n\\n\\n/// Enumeration of all the possible errors.\\n\\n#[derive(Clone, Debug, Eq, Error, PartialEq)]\\n\\npub enum HypergraphError<V, HE>\\n\\nwhere\\n\\n V: SharedTrait,\\n\\n HE: SharedTrait,\\n\\n{\\n\\n /// Error when a HyperedgeIndex was not found.\\n\\n #[error(\\\"HyperedgeIndex {0} was not found\\\")]\\n\\n HyperedgeIndexNotFound(HyperedgeIndex),\\n\\n\\n\\n /// Error when an internal hyperedge index was not found.\\n\\n #[error(\\\"Internal hyperedge index {0} was not found\\\")]\\n\\n InternalHyperedgeIndexNotFound(usize),\\n\\n\\n\\n /// Error when a hyperedge weight was not found.\\n\",\n \"file_path\": \"src/core/errors.rs\",\n \"rank\": 61,\n \"score\": 29845.051588911512\n },\n {\n \"content\": \" #[error(\\\"Hyperedge weight {0} was not found\\\")]\\n\\n HyperedgeWeightNotFound(HE),\\n\\n\\n\\n /// Error when a hyperedge is updated with the same weight.\\n\\n #[error(\\\"HyperedgeIndex {index:?} weight {weight:?} is unchanged (no-op)\\\")]\\n\\n HyperedgeWeightUnchanged { index: HyperedgeIndex, weight: HE },\\n\\n\\n\\n /// Error when a hyperedge is updated with the same vertices.\\n\\n #[error(\\\"HyperedgeIndex {0} vertices are unchanged (no-op)\\\")]\\n\\n HyperedgeVerticesUnchanged(HyperedgeIndex),\\n\\n\\n\\n /// Error when a hyperedge is updated with no vertices.\\n\\n #[error(\\\"HyperedgeIndex {0} vertices are missing\\\")]\\n\\n HyperedgeCreationNoVertices(HE),\\n\\n\\n\\n /// Error when a hyperedge is updated with no vertices.\\n\\n #[error(\\\"HyperedgeIndex {0} vertices are missing\\\")]\\n\\n HyperedgeUpdateNoVertices(HyperedgeIndex),\\n\\n\\n\\n /// Error when a hyperedge doesn't contain some vertices.\\n\",\n \"file_path\": \"src/core/errors.rs\",\n \"rank\": 62,\n \"score\": 29831.196025453733\n },\n {\n \"content\": \" HyperedgesIntersections,\\n\\n\\n\\n /// Error when a VertexIndex was not found.\\n\\n #[error(\\\"VertexIndex {0} was not found\\\")]\\n\\n VertexIndexNotFound(VertexIndex),\\n\\n\\n\\n /// Error when a an internal vertex index was not found.\\n\\n #[error(\\\"Internal vertex index {0} was not found\\\")]\\n\\n InternalVertexIndexNotFound(usize),\\n\\n\\n\\n /// Error when a vertex weight was not found.\\n\\n #[error(\\\"Vertex weight {0} was not found\\\")]\\n\\n VertexWeightNotFound(V),\\n\\n\\n\\n /// Error when a vertex weight is updated with the same value.\\n\\n #[error(\\\"VertexIndex {index:?} weight {weight:?} unchanged (no-op)\\\")]\\n\\n VertexWeightUnchanged { index: VertexIndex, weight: V },\\n\\n\\n\\n /// Error when a vertex weight is updated with the weight of another one.\\n\\n #[error(\\\"Vertex weight {0} was already assigned\\\")]\\n\\n VertexWeightAlreadyAssigned(V),\\n\\n}\\n\",\n \"file_path\": \"src/core/errors.rs\",\n \"rank\": 63,\n \"score\": 29830.330937441737\n },\n {\n \"content\": \" #[error(\\\"HyperedgeIndex {index:?} does not include vertices {vertices:?}\\\")]\\n\\n HyperedgeVerticesIndexesNotFound {\\n\\n index: HyperedgeIndex,\\n\\n vertices: Vec<VertexIndex>,\\n\\n },\\n\\n\\n\\n /// Error when a hyperedge contraction is invalid.\\n\\n #[error(\\\"HyperedgeIndex {index:?} contraction of vertices {vertices:?} into vertex {target:?} is invalid\\\" )]\\n\\n HyperedgeInvalidContraction {\\n\\n index: HyperedgeIndex,\\n\\n target: VertexIndex,\\n\\n vertices: Vec<VertexIndex>,\\n\\n },\\n\\n\\n\\n /// Error when a hyperedge is updated with the weight of another one.\\n\\n #[error(\\\"Hyperedge weight {0} was already assigned\\\")]\\n\\n HyperedgeWeightAlreadyAssigned(HE),\\n\\n\\n\\n /// Error when trying to get the intersections of less than two hyperedges.\\n\\n #[error(\\\"At least two hyperedges must be provided to find their intersections\\\")]\\n\",\n \"file_path\": \"src/core/errors.rs\",\n \"rank\": 64,\n \"score\": 29829.665751046017\n },\n {\n \"content\": \"use crate::{errors::HypergraphError, HyperedgeIndex, Hypergraph, SharedTrait, VertexIndex};\\n\\n\\n\\nuse itertools::Itertools;\\n\\n\\n\\n/// Enumeration of the different types of connection.\\n\\n/// Only used as a guard argument for the `get_connections` method.\\n\\npub(crate) enum Connection<Index = VertexIndex> {\\n\\n In(Index),\\n\\n Out(Index),\\n\\n InAndOut(Index, Index),\\n\\n}\\n\\n\\n\\nimpl<V, HE> Hypergraph<V, HE>\\n\\nwhere\\n\\n V: SharedTrait,\\n\\n HE: SharedTrait,\\n\\n{\\n\\n /// Private helper function used internally.\\n\\n /// Takes a connection as an enum and returns a vector of tuples of the\\n\\n /// form (hyperedge index, connected vertex index) where connected vertex\\n\",\n \"file_path\": \"src/core/shared.rs\",\n \"rank\": 65,\n \"score\": 29757.969320042885\n },\n {\n \"content\": \" .into_iter()\\n\\n .map(\\n\\n |hyperedge_index| match self.get_hyperedge_vertices(hyperedge_index) {\\n\\n Ok(vertices) => Ok((hyperedge_index, vertices)),\\n\\n Err(error) => Err(error),\\n\\n },\\n\\n )\\n\\n .collect::<Result<Vec<(HyperedgeIndex, Vec<VertexIndex>)>, HypergraphError<V, HE>>>()?;\\n\\n\\n\\n let results = hyperedges_with_vertices.into_iter().fold(\\n\\n Vec::new(),\\n\\n |acc: Vec<(HyperedgeIndex, Option<VertexIndex>)>, (hyperedge_index, vertices)| {\\n\\n vertices.iter().tuple_windows::<(_, _)>().fold(\\n\\n acc,\\n\\n |index_acc, (window_from, window_to)| {\\n\\n match connections {\\n\\n Connection::In(from) => {\\n\\n // Inject the index of the hyperedge and the\\n\\n // vertex index if the current window is a\\n\\n // match.\\n\",\n \"file_path\": \"src/core/shared.rs\",\n \"rank\": 66,\n \"score\": 29752.054562267298\n },\n {\n \"content\": \" /// index is an optional value - None for InAndOut connections.\\n\\n #[allow(clippy::type_complexity)]\\n\\n pub(crate) fn get_connections(\\n\\n &self,\\n\\n connections: Connection,\\n\\n ) -> Result<Vec<(HyperedgeIndex, Option<VertexIndex>)>, HypergraphError<V, HE>> {\\n\\n let internal_index = self.get_internal_vertex(match connections {\\n\\n Connection::In(vertex_index) | Connection::Out(vertex_index) => vertex_index,\\n\\n Connection::InAndOut(vertex_index, _) => vertex_index,\\n\\n })?;\\n\\n\\n\\n let (_, hyperedges_index_set) = self\\n\\n .vertices\\n\\n .get_index(internal_index)\\n\\n .ok_or(HypergraphError::InternalVertexIndexNotFound(internal_index))?;\\n\\n\\n\\n let hyperedges =\\n\\n self.get_hyperedges(hyperedges_index_set.clone().into_iter().collect_vec())?;\\n\\n\\n\\n let hyperedges_with_vertices = hyperedges\\n\",\n \"file_path\": \"src/core/shared.rs\",\n \"rank\": 67,\n \"score\": 29749.300354131596\n },\n {\n \"content\": \" // if the current window is a match.\\n\\n if *window_from == from && *window_to == to {\\n\\n return index_acc\\n\\n .into_iter()\\n\\n .chain(vec![(hyperedge_index, None)])\\n\\n .collect_vec();\\n\\n }\\n\\n }\\n\\n }\\n\\n\\n\\n index_acc\\n\\n },\\n\\n )\\n\\n },\\n\\n );\\n\\n\\n\\n Ok(results)\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/core/shared.rs\",\n \"rank\": 68,\n \"score\": 29742.162828788027\n },\n {\n \"content\": \" if *window_from == from {\\n\\n return index_acc\\n\\n .into_iter()\\n\\n .chain(vec![(hyperedge_index, Some(*window_to))])\\n\\n .collect_vec();\\n\\n }\\n\\n }\\n\\n Connection::Out(to) => {\\n\\n // Inject the index of the hyperedge and the\\n\\n // vertex index if the current window is a\\n\\n // match.\\n\\n if *window_to == to {\\n\\n return index_acc\\n\\n .into_iter()\\n\\n .chain(vec![(hyperedge_index, Some(*window_from))])\\n\\n .collect_vec();\\n\\n }\\n\\n }\\n\\n Connection::InAndOut(from, to) => {\\n\\n // Inject only the index of the hyperedge\\n\",\n \"file_path\": \"src/core/shared.rs\",\n \"rank\": 69,\n \"score\": 29740.166974382482\n },\n {\n \"content\": \"#![deny(unsafe_code, nonstandard_style)]\\n\\n\\n\\nuse std::fmt::{Display, Formatter, Result};\\n\\n\\n\\n#[derive(Debug, Copy, Clone, Hash, Eq, PartialEq)]\\n\\npub struct Vertex<'a> {\\n\\n name: &'a str,\\n\\n}\\n\\n\\n\\nimpl<'a> Vertex<'a> {\\n\\n pub fn new(name: &'a str) -> Self {\\n\\n Vertex { name }\\n\\n }\\n\\n}\\n\\n\\n\\nimpl<'a> Display for Vertex<'a> {\\n\\n fn fmt(&self, f: &mut Formatter<'_>) -> Result {\\n\\n write!(f, \\\"{}\\\", self)\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"tests/common/mod.rs\",\n \"rank\": 73,\n \"score\": 29612.180784567867\n },\n {\n \"content\": \"use crate::SharedTrait;\\n\\n\\n\\nuse std::{collections::HashMap, fmt::Debug};\\n\\n\\n\\n/// Bi-directional hashmap used to store the mapping between the internal\\n\\n/// unstable indexes - generated by IndexMap and IndexSet - and the exposed\\n\\n/// stable indexes.\\n\\n#[derive(Debug)]\\n\\npub(crate) struct BiHashMap<Index>\\n\\nwhere\\n\\n Index: SharedTrait,\\n\\n{\\n\\n pub(crate) left: HashMap<usize, Index>,\\n\\n pub(crate) right: HashMap<Index, usize>,\\n\\n}\\n\\n\\n\\nimpl<Index> BiHashMap<Index>\\n\\nwhere\\n\\n Index: SharedTrait,\\n\\n{\\n\",\n \"file_path\": \"src/core/bi_hash_map.rs\",\n \"rank\": 77,\n \"score\": 27381.230602396383\n },\n {\n \"content\": \" /// Creates a new BiHashMap with no allocation.\\n\\n pub(crate) fn new() -> BiHashMap<Index> {\\n\\n Self {\\n\\n left: HashMap::<usize, Index>::with_capacity(0),\\n\\n right: HashMap::<Index, usize>::with_capacity(0),\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\nimpl<Index> Default for BiHashMap<Index>\\n\\nwhere\\n\\n Index: SharedTrait,\\n\\n{\\n\\n fn default() -> Self {\\n\\n BiHashMap::new()\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/core/bi_hash_map.rs\",\n \"rank\": 78,\n \"score\": 27380.850014113763\n },\n {\n \"content\": \"use crate::{errors::HypergraphError, Hypergraph, SharedTrait, VertexIndex};\\n\\n\\n\\nuse indexmap::IndexSet;\\n\\n\\n\\nimpl<V, HE> Hypergraph<V, HE>\\n\\nwhere\\n\\n V: SharedTrait,\\n\\n HE: SharedTrait,\\n\\n{\\n\\n /// Adds a vertex with a custom weight to the hypergraph.\\n\\n /// Returns the index of the vertex.\\n\\n pub fn add_vertex(&mut self, weight: V) -> Result<VertexIndex, HypergraphError<V, HE>> {\\n\\n // Return an error if the weight is already assigned to another vertex.\\n\\n if self.vertices.contains_key(&weight) {\\n\\n return Err(HypergraphError::VertexWeightAlreadyAssigned(weight));\\n\\n }\\n\\n\\n\\n self.vertices\\n\\n .entry(weight)\\n\\n .or_insert(IndexSet::with_capacity(0));\\n\",\n \"file_path\": \"src/core/vertices/add_vertex.rs\",\n \"rank\": 79,\n \"score\": 25634.580623755264\n },\n {\n \"content\": \"use crate::{errors::HypergraphError, HyperedgeKey, Hypergraph, SharedTrait, VertexIndex};\\n\\n\\n\\nuse itertools::Itertools;\\n\\n\\n\\nimpl<V, HE> Hypergraph<V, HE>\\n\\nwhere\\n\\n V: SharedTrait,\\n\\n HE: SharedTrait,\\n\\n{\\n\\n /// Removes a vertex by index.\\n\\n pub fn remove_vertex(\\n\\n &mut self,\\n\\n vertex_index: VertexIndex,\\n\\n ) -> Result<(), HypergraphError<V, HE>> {\\n\\n let internal_index = self.get_internal_vertex(vertex_index)?;\\n\\n\\n\\n // Get the hyperedges of the vertex.\\n\\n let hyperedges = self.get_internal_hyperedges(self.get_vertex_hyperedges(vertex_index)?)?;\\n\\n\\n\\n // Remove the vertex from the hyperedges which contain it.\\n\",\n \"file_path\": \"src/core/vertices/remove_vertex.rs\",\n \"rank\": 80,\n \"score\": 25631.861364788747\n },\n {\n \"content\": \"use crate::{errors::HypergraphError, Hypergraph, SharedTrait, VertexIndex};\\n\\n\\n\\nimpl<V, HE> Hypergraph<V, HE>\\n\\nwhere\\n\\n V: SharedTrait,\\n\\n HE: SharedTrait,\\n\\n{\\n\\n // Private method to get the VertexIndex matching an internal index.\\n\\n pub(crate) fn get_vertex(\\n\\n &self,\\n\\n vertex_index: usize,\\n\\n ) -> Result<VertexIndex, HypergraphError<V, HE>> {\\n\\n match self.vertices_mapping.left.get(&vertex_index) {\\n\\n Some(index) => Ok(*index),\\n\\n None => Err(HypergraphError::InternalVertexIndexNotFound(vertex_index)),\\n\\n }\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/core/vertices/get_vertex.rs\",\n \"rank\": 81,\n \"score\": 25630.141160401956\n },\n {\n \"content\": \" .hyperedges\\n\\n .get_index(hyperedge)\\n\\n .map(|hyperedge_key| hyperedge_key.to_owned())\\n\\n .ok_or(HypergraphError::InternalHyperedgeIndexNotFound(hyperedge))?;\\n\\n\\n\\n let updated_vertices = vertices\\n\\n .into_iter()\\n\\n .map(|vertex| {\\n\\n // Remap the vertex if this is the swapped one.\\n\\n if vertex == last_index {\\n\\n internal_index\\n\\n } else {\\n\\n vertex\\n\\n }\\n\\n })\\n\\n .collect_vec();\\n\\n\\n\\n // Insert the new entry with the updated vertices.\\n\\n // Since we are not altering the weight, we can safely perform\\n\\n // the operation without checking its output.\\n\",\n \"file_path\": \"src/core/vertices/remove_vertex.rs\",\n \"rank\": 82,\n \"score\": 25618.470317065112\n },\n {\n \"content\": \" for hyperedge in hyperedges.into_iter() {\\n\\n let HyperedgeKey { vertices, .. } = self\\n\\n .hyperedges\\n\\n .get_index(hyperedge)\\n\\n .map(|hyperedge_key| hyperedge_key.to_owned())\\n\\n .ok_or(HypergraphError::InternalHyperedgeIndexNotFound(hyperedge))?;\\n\\n\\n\\n let hyperedge_index = self.get_hyperedge(hyperedge)?;\\n\\n\\n\\n // Get the unique vertices, i.e. check for self-loops.\\n\\n let unique_vertices = vertices.iter().sorted().dedup().collect_vec();\\n\\n\\n\\n // Remove the hyperedge if the vertex is the only one present.\\n\\n if unique_vertices.len() == 1 {\\n\\n self.remove_hyperedge(hyperedge_index)?;\\n\\n } else {\\n\\n // Otherwise update the hyperedge with the updated vertices.\\n\\n let updated_vertices = self.get_vertices(\\n\\n vertices\\n\\n .into_iter()\\n\",\n \"file_path\": \"src/core/vertices/remove_vertex.rs\",\n \"rank\": 83,\n \"score\": 25615.243829569125\n },\n {\n \"content\": \" self.hyperedges.insert(HyperedgeKey {\\n\\n vertices: updated_vertices,\\n\\n weight,\\n\\n });\\n\\n\\n\\n // Swap and remove by index.\\n\\n // Since we know that the hyperedge index is correct, we can\\n\\n // safely perform the operation without checking its output.\\n\\n self.hyperedges.swap_remove_index(hyperedge);\\n\\n }\\n\\n }\\n\\n\\n\\n // Return a unit.\\n\\n Ok(())\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/core/vertices/remove_vertex.rs\",\n \"rank\": 84,\n \"score\": 25615.14331005148\n },\n {\n \"content\": \"\\n\\n let internal_index = self\\n\\n .vertices\\n\\n .get_index_of(&weight)\\n\\n // This safe-check should always pass since the weight has been\\n\\n // inserted upfront.\\n\\n .ok_or(HypergraphError::VertexWeightNotFound(weight))?;\\n\\n\\n\\n Ok(self.add_vertex_index(internal_index))\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/core/vertices/add_vertex.rs\",\n \"rank\": 85,\n \"score\": 25615.136019370733\n },\n {\n \"content\": \" // method for more details about the internals.\\n\\n if internal_index != last_index {\\n\\n // Get the index of the swapped vertex.\\n\\n let swapped_vertex_index = self.get_vertex(last_index)?;\\n\\n\\n\\n // Proceed with the aforementioned operations.\\n\\n self.vertices_mapping\\n\\n .right\\n\\n .insert(swapped_vertex_index, internal_index);\\n\\n self.vertices_mapping.left.remove(&last_index);\\n\\n self.vertices_mapping\\n\\n .left\\n\\n .insert(internal_index, swapped_vertex_index);\\n\\n\\n\\n let stale_hyperedges =\\n\\n self.get_internal_hyperedges(self.get_vertex_hyperedges(swapped_vertex_index)?)?;\\n\\n\\n\\n // Update the impacted hyperedges accordingly.\\n\\n for hyperedge in stale_hyperedges.into_iter() {\\n\\n let HyperedgeKey { vertices, weight } = self\\n\",\n \"file_path\": \"src/core/vertices/remove_vertex.rs\",\n \"rank\": 86,\n \"score\": 25614.387474565374\n },\n {\n \"content\": \" .filter(|vertex| *vertex != internal_index)\\n\\n .collect_vec(),\\n\\n )?;\\n\\n\\n\\n self.update_hyperedge_vertices(hyperedge_index, updated_vertices)?;\\n\\n }\\n\\n }\\n\\n\\n\\n // Find the last index.\\n\\n let last_index = self.vertices.len() - 1;\\n\\n\\n\\n // Swap and remove by index.\\n\\n self.vertices.swap_remove_index(internal_index);\\n\\n\\n\\n // Update the mapping for the removed vertex.\\n\\n self.vertices_mapping.left.remove(&internal_index);\\n\\n self.vertices_mapping.right.remove(&vertex_index);\\n\\n\\n\\n // If the index to remove wasn't the last one, the last vertex has\\n\\n // been swapped in place of the removed one. See the remove_hyperedge\\n\",\n \"file_path\": \"src/core/vertices/remove_vertex.rs\",\n \"rank\": 87,\n \"score\": 25612.511133766086\n },\n {\n \"content\": \"use crate::{errors::HypergraphError, Hypergraph, SharedTrait, VertexIndex};\\n\\n\\n\\nuse std::{cmp::Ordering, collections::BinaryHeap, fmt::Debug};\\n\\n\\n\\nimpl<V, HE> Hypergraph<V, HE>\\n\\nwhere\\n\\n V: SharedTrait,\\n\\n HE: SharedTrait,\\n\\n{\\n\\n /// Gets a list of the shortest path of vertices between two vertices.\\n\\n /// The implementation of the algorithm is based on\\n\\n /// <https://doc.rust-lang.org/std/collections/binary_heap/#examples>\\n\\n pub fn get_dijkstra_connections(\\n\\n &self,\\n\\n from: VertexIndex,\\n\\n to: VertexIndex,\\n\\n ) -> Result<Vec<VertexIndex>, HypergraphError<V, HE>> {\\n\\n #[derive(Clone, Copy, Debug, PartialEq, Eq)]\\n\\n struct Cursor {\\n\\n distance: usize,\\n\",\n \"file_path\": \"src/core/vertices/get_dijkstra_connections.rs\",\n \"rank\": 88,\n \"score\": 24609.786921681567\n },\n {\n \"content\": \"use crate::{\\n\\n core::shared::Connection, errors::HypergraphError, Hypergraph, SharedTrait, VertexIndex,\\n\\n};\\n\\n\\n\\nimpl<V, HE> Hypergraph<V, HE>\\n\\nwhere\\n\\n V: SharedTrait,\\n\\n HE: SharedTrait,\\n\\n{\\n\\n /// Gets the in-degree of a vertex.\\n\\n /// <https://en.wikipedia.org/wiki/Directed_graph#Indegree_and_outdegree>\\n\\n pub fn get_vertex_degree_in(&self, to: VertexIndex) -> Result<usize, HypergraphError<V, HE>> {\\n\\n let results = self.get_connections(Connection::Out(to))?;\\n\\n\\n\\n Ok(results.len())\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/core/vertices/get_vertex_degree_in.rs\",\n \"rank\": 89,\n \"score\": 24601.614842835785\n },\n {\n \"content\": \"use crate::{\\n\\n core::shared::Connection, errors::HypergraphError, Hypergraph, SharedTrait, VertexIndex,\\n\\n};\\n\\n\\n\\nimpl<V, HE> Hypergraph<V, HE>\\n\\nwhere\\n\\n V: SharedTrait,\\n\\n HE: SharedTrait,\\n\\n{\\n\\n /// Gets the out-degree of a vertex.\\n\\n /// <https://en.wikipedia.org/wiki/Directed_graph#Indegree_and_outdegree>\\n\\n pub fn get_vertex_degree_out(\\n\\n &self,\\n\\n from: VertexIndex,\\n\\n ) -> Result<usize, HypergraphError<V, HE>> {\\n\\n let results = self.get_connections(Connection::In(from))?;\\n\\n\\n\\n Ok(results.len())\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/core/vertices/get_vertex_degree_out.rs\",\n \"rank\": 90,\n \"score\": 24601.614842835785\n },\n {\n \"content\": \"use crate::{errors::HypergraphError, Hypergraph, SharedTrait, VertexIndex};\\n\\n\\n\\nimpl<V, HE> Hypergraph<V, HE>\\n\\nwhere\\n\\n V: SharedTrait,\\n\\n HE: SharedTrait,\\n\\n{\\n\\n // Private method to get the internal vertex matching a VertexIndex.\\n\\n pub(crate) fn get_internal_vertex(\\n\\n &self,\\n\\n vertex_index: VertexIndex,\\n\\n ) -> Result<usize, HypergraphError<V, HE>> {\\n\\n match self.vertices_mapping.right.get(&vertex_index) {\\n\\n Some(index) => Ok(*index),\\n\\n None => Err(HypergraphError::VertexIndexNotFound(vertex_index)),\\n\\n }\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/core/vertices/get_internal_vertex.rs\",\n \"rank\": 91,\n \"score\": 24600.789434960203\n },\n {\n \"content\": \"use crate::{Hypergraph, SharedTrait, VertexIndex};\\n\\n\\n\\nimpl<V, HE> Hypergraph<V, HE>\\n\\nwhere\\n\\n V: SharedTrait,\\n\\n HE: SharedTrait,\\n\\n{\\n\\n // This private method is infallible since adding the same vertex\\n\\n // will return the existing index.\\n\\n pub(crate) fn add_vertex_index(&mut self, internal_index: usize) -> VertexIndex {\\n\\n match self.vertices_mapping.left.get(&internal_index) {\\n\\n Some(vertex_index) => *vertex_index,\\n\\n None => {\\n\\n let vertex_index = VertexIndex(self.vertices_count);\\n\\n\\n\\n if self\\n\\n .vertices_mapping\\n\\n .left\\n\\n .insert(internal_index, vertex_index)\\n\\n .is_none()\\n\",\n \"file_path\": \"src/core/vertices/add_vertex_index.rs\",\n \"rank\": 92,\n \"score\": 24598.301670543577\n },\n {\n \"content\": \" index: usize,\\n\\n }\\n\\n\\n\\n // Use a custom implementation of Ord as we want a min-heap BinaryHeap.\\n\\n impl Ord for Cursor {\\n\\n fn cmp(&self, other: &Cursor) -> Ordering {\\n\\n other\\n\\n .distance\\n\\n .cmp(&self.distance)\\n\\n .then_with(|| self.distance.cmp(&other.distance))\\n\\n }\\n\\n }\\n\\n\\n\\n impl PartialOrd for Cursor {\\n\\n fn partial_cmp(&self, other: &Cursor) -> Option<Ordering> {\\n\\n Some(self.cmp(other))\\n\\n }\\n\\n }\\n\\n\\n\\n // Get the internal indexes of the vertices.\\n\",\n \"file_path\": \"src/core/vertices/get_dijkstra_connections.rs\",\n \"rank\": 93,\n \"score\": 24590.699853271195\n },\n {\n \"content\": \" let internal_from = self.get_internal_vertex(from)?;\\n\\n let internal_to = self.get_internal_vertex(to)?;\\n\\n\\n\\n // We need to initialize a vector of length equal to the number of vertices.\\n\\n // The default value, as per Dijkstra, must be set to infinity.\\n\\n // A value of usize::MAX is used.\\n\\n let mut distances = (0..self.vertices.len())\\n\\n .map(|_| usize::MAX)\\n\\n .collect::<Vec<usize>>();\\n\\n\\n\\n // Create an empty binary heap.\\n\\n let mut heap = BinaryHeap::new();\\n\\n\\n\\n // Initialize the first vertex to zero.\\n\\n distances[internal_from] = 0;\\n\\n\\n\\n // Push the first cursor to the heap.\\n\\n heap.push(Cursor {\\n\\n distance: 0,\\n\\n index: internal_from,\\n\",\n \"file_path\": \"src/core/vertices/get_dijkstra_connections.rs\",\n \"rank\": 94,\n \"score\": 24589.231564727448\n },\n {\n \"content\": \" });\\n\\n\\n\\n // Keep track of the traversal path.\\n\\n let mut path = Vec::<usize>::new();\\n\\n\\n\\n while let Some(Cursor { distance, index }) = heap.pop() {\\n\\n // End of the traversal.\\n\\n if index == internal_to {\\n\\n // We need to inject the index of the target vertex.\\n\\n path.push(internal_to);\\n\\n\\n\\n // Remove duplicates generated during the iteration of the algorithm.\\n\\n path.dedup();\\n\\n\\n\\n return self.get_vertices(path);\\n\\n }\\n\\n\\n\\n // Skip if a better path has already been found.\\n\\n if distance > distances[index] {\\n\\n continue;\\n\",\n \"file_path\": \"src/core/vertices/get_dijkstra_connections.rs\",\n \"rank\": 95,\n \"score\": 24585.728628449444\n },\n {\n \"content\": \" }\\n\\n\\n\\n let mapped_index = self.get_vertex(index)?;\\n\\n let indexes = self.get_adjacent_vertices_from(mapped_index)?;\\n\\n let internal_indexes = self.get_internal_vertices(indexes)?;\\n\\n\\n\\n // For every connected vertex, try to find the lowest distance.\\n\\n for vertex_index in internal_indexes {\\n\\n let next = Cursor {\\n\\n // We assume a distance of one by default since vertices\\n\\n // have custom weights.\\n\\n distance: distance + 1,\\n\\n index: vertex_index,\\n\\n };\\n\\n\\n\\n // If so, add it to the frontier and continue.\\n\\n if next.distance < distances[next.index] {\\n\\n // Update the traversal accordingly.\\n\\n path.push(index);\\n\\n\\n\",\n \"file_path\": \"src/core/vertices/get_dijkstra_connections.rs\",\n \"rank\": 96,\n \"score\": 24582.072860533957\n },\n {\n \"content\": \" {\\n\\n // Update the counter only for the first insertion.\\n\\n self.vertices_count += 1;\\n\\n }\\n\\n\\n\\n self.vertices_mapping\\n\\n .right\\n\\n .insert(vertex_index, internal_index);\\n\\n\\n\\n vertex_index\\n\\n }\\n\\n }\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/core/vertices/add_vertex_index.rs\",\n \"rank\": 97,\n \"score\": 24580.5448245351\n },\n {\n \"content\": \" // Push it to the heap.\\n\\n heap.push(next);\\n\\n\\n\\n // Relaxation, we have now found a better way\\n\\n distances[vertex_index] = next.distance;\\n\\n }\\n\\n }\\n\\n }\\n\\n\\n\\n // If we reach this point, return an empty vector.\\n\\n Ok(vec![])\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/core/vertices/get_dijkstra_connections.rs\",\n \"rank\": 98,\n \"score\": 24577.524925457998\n },\n {\n \"content\": \"//! - Stable indexes assigned for each hyperedge and each vertex\\n\\n//!\\n\\n//! ## Example\\n\\n//!\\n\\n//! Please notice that the hyperedges and the vertices must implement the [SharedTrait](crate::SharedTrait).\\n\\n//!\\n\\n//! ```\\n\\n//! use hypergraph::{HyperedgeIndex, Hypergraph, VertexIndex};\\n\\n//! use std::fmt::{Display, Formatter, Result};\\n\\n//!\\n\\n//! // Create a new struct to represent a vertex.\\n\\n//! #[derive(Debug, Copy, Clone, Hash, Eq, PartialEq)]\\n\\n//! struct Vertex<'a> {\\n\\n//! name: &'a str,\\n\\n//! }\\n\\n//!\\n\\n//! impl<'a> Vertex<'a> {\\n\\n//! pub fn new(name: &'a str) -> Self {\\n\\n//! Vertex { name }\\n\\n//! }\\n\",\n \"file_path\": \"src/lib.rs\",\n \"rank\": 99,\n \"score\": 37.83487243128075\n }\n]","isConversational":false}}},{"rowIdx":2397,"cells":{"lang":{"kind":"string","value":"Rust"},"file_path":{"kind":"string","value":"src/basic/model.rs"},"repo_name":{"kind":"string","value":"nyari/rtrace"},"commit":{"kind":"string","value":"2321a0a50c10940c58a690c678df8f939d5b22fc"},"file_code":{"kind":"string","value":"use core::{Model, Material, RayIntersection, Ray, RayIntersectionError};\nuse defs::{Point3, Vector3, FloatType};\nuse tools::{CompareWithTolerance};\nuse na;\nuse na::{Unit};\nuse std;\nuse uuid::{Uuid};\n\npub struct SolidSphere {\n material: Material,\n origo: Point3,\n radius: FloatType,\n identifier: Uuid\n}\n\nimpl SolidSphere {\n pub fn new(material: Material) -> Self {\n Self { material: material,\n origo: Point3::new(0.0, 0.0, 0.0),\n radius: 1.0,\n identifier: Uuid::new_v4()}\n }\n\n pub fn new_positioned(material: Material, origo: Point3, radius: FloatType) -> Self {\n Self { material: material,\n origo: origo,\n radius: radius,\n identifier: Uuid::new_v4()}\n }\n\n pub fn set_custom_identifier(&mut self, identifier: Uuid) {\n self.identifier = identifier;\n }\n}\n\nimpl Model for SolidSphere {\n fn get_intersection(&self, ray: &Ray) -> Option<RayIntersection> {\n let dir = ray.get_direction();\n let origin = ray.get_origin();\n let ray_origo = origin - self.origo;\n\n let a = dir.x.powi(2) + dir.y.powi(2) + dir.z.powi(2);\n let b = 2.0 * (ray_origo.x * dir.x + ray_origo.y * dir.y + ray_origo.z * dir.z);\n let c = ray_origo.x.powi(2) + ray_origo.y.powi(2) + ray_origo.z.powi(2) - self.radius.powi(2);\n\n let determinant = b.powi(2) - 4.0 * a * c;\n if determinant.less_eps(&0.0) {\n None\n } else {\n let t1 = (-b + determinant.sqrt()) / (2.0 * a);\n let t2 = (-b - determinant.sqrt()) / (2.0 * a);\n let result_calc = |t, inside: bool| {\n let intersection_point = origin + dir * t;\n let normal = if !inside { intersection_point - self.origo } else { self.origo - intersection_point };\n\n match RayIntersection::new_model_identifier(normal, intersection_point, ray, self.material, inside, self.identifier) {\n Ok(intersection) => Some(intersection),\n Err(RayIntersectionError::NoRayTravelDistance) => None,\n _ => panic!(\"Unrecoverable RayIntersectin:new_model_identifier error\")\n }\n };\n\n if t1.is_sign_negative() && t2.is_sign_negative() {\n None\n } else if t1.is_sign_positive() && t2.is_sign_negative() {\n result_calc(t1, true)\n } else {\n match result_calc(t2, false) {\n Some(result) => Some(result),\n None => result_calc(t1, true),\n }\n }\n }\n }\n}\n\npub struct SolidPlane {\n material: Material,\n base: Point3,\n normal: Vector3,\n identifier: Uuid,\n}\n\nimpl SolidPlane {\n pub fn new(material: Material) -> Self {\n Self { material: material,\n base: Point3::origin(),\n normal: Vector3::new(0.0, 0.0, 1.0),\n identifier: Uuid::new_v4()\n }\n }\n\n pub fn new_positioned(material: Material, base: Point3, normal: Unit<Vector3>) -> Self {\n Self { material: material,\n base: base,\n normal: normal.unwrap(),\n identifier: Uuid::new_v4()\n }\n }\n\n pub fn set_custom_identifier(&mut self, identifier: Uuid) {\n self.identifier = identifier;\n }\n}\n\nimpl Model for SolidPlane {\n fn get_intersection(&self, ray: &Ray) -> Option<RayIntersection> {\n let origin = ray.get_origin();\n let dir = ray.get_direction();\n\n let u = self.normal.dot(dir);\n if !u.near_zero_eps() {\n let k = self.normal.x * self.base.x + self.normal.y * self.base.y + self.normal.z * self.base.z;\n let s = self.normal.x * origin.x + self.normal.y * origin.y + self.normal.z * origin.z;\n let t = (k-s) / u;\n if t.greater_eq_eps(&0.0) {\n let is_inside = na::angle(&self.normal, dir).less_eq_eps(&std::f64::consts::FRAC_PI_2);\n let point = origin + dir * t;\n if !is_inside {\n match RayIntersection::new_model_identifier(self.normal, point, ray, self.material, is_inside, self.identifier) {\n Ok(intersection) => Some(intersection),\n Err(RayIntersectionError::NoRayTravelDistance) => None,\n _ => panic!(\"Unrecoverable RayIntersectin:new_model_identifier error\")\n }\n } else {\n match RayIntersection::new_model_identifier(-self.normal, point, ray, self.material, is_inside, self.identifier) {\n Ok(intersection) => Some(intersection),\n Err(RayIntersectionError::NoRayTravelDistance) => None,\n _ => panic!(\"Unrecoverable RayIntersectin:new_model_identifier error\")\n }\n }\n } else {\n None\n }\n } else {\n None\n }\n }\n}\n\n#[cfg(test)]\nmod tests {\n use super::*;\n use core::Color;\n\n fn test_solid_unit_sphere(test_ray: &Ray, expected_result: Option<&Point3>) {\n let test_material = Material::new_shiny(Color::new(1.0, 1.0, 1.0), (Color::new(1.0, 1.0, 1.0), 1.5), None);\n let test_sphere = SolidSphere::new(test_material);\n\n let intersection_result = test_sphere.get_intersection(test_ray);\n\n match expected_result {\n Some(expected_point) => {\n let intersection = intersection_result.expect(\"Was expected intersection but none intersected\");\n\n assert_relative_eq!(expected_point, intersection.get_intersection_point());\n },\n None => {\n assert!(intersection_result.is_none());\n }\n }\n }\n\n #[test]\n fn test_solid_unit_sphere_head_on() {\n let test_ray = Ray::new_single_shot(Point3::new(2.0, 0.0, 0.0), Vector3::new(-1.0, 0.0, 0.0));\n test_solid_unit_sphere(&test_ray, Some(&Point3::new(1.0, 0.0, 0.0)));\n }\n\n #[test]\n fn test_solid_unit_sphere_tangential_hit() {\n let test_ray = Ray::new_single_shot(Point3::new(2.0, 0.0, 1.0), Vector3::new(-1.0, 0.0, 0.0));\n test_solid_unit_sphere(&test_ray, Some(&Point3::new(0.0, 0.0, 1.0)));\n }\n\n #[test]\n fn test_solid_unit_sphere_tangential_miss() {\n let test_ray = Ray::new_single_shot(Point3::new(2.0, 0.0, 1.01), Vector3::new(-1.0, 0.0, 0.0));\n test_solid_unit_sphere(&test_ray, None);\n }\n}"},"prefix":{"kind":"string","value":"use core::{Model, Material, RayIntersection, Ray, RayIntersectionError};\nuse defs::{Point3, Vector3, FloatType};\nuse tools::{CompareWithTolerance};\nuse na;\nuse na::{Unit};\nuse std;\nuse uuid::{Uuid};\n\npub struct SolidSphere {\n material: Material,\n origo: Point3,\n radius: FloatType,\n identifier: Uuid\n}\n\nimpl SolidSphere {\n pub fn new(material: Material) -> Self {\n Self { material: material,\n origo: Point3::new(0.0, 0.0, 0.0),\n radius: 1.0,\n identifier: Uuid::new_v4()}\n }\n\n pub fn new_positioned(material: Material, origo: Point3, radius: FloatType) -> Self {\n Self { material: material,\n origo: origo,\n radius: radius,\n identifier: Uuid::new_v4()}\n }\n\n pub fn set_custom_identifier(&mut self, identifier: Uuid) {\n self.identifier = identifier;\n }\n}\n\nimpl Model for SolidSphere {\n fn get_intersection(&self, ray: &Ray) -> Option<RayIntersection> {\n let dir = ray.get_direction();\n let origin = ray.get_origin();\n let ray_origo = origin - self.origo;\n\n let a = dir.x.powi(2) + dir.y.powi(2) + dir.z.powi(2);\n let b = 2.0 * (ray_origo.x * dir.x + ray_origo.y * dir.y + ray_origo.z * dir.z)"},"suffix":{"kind":"string","value":"None);\n }\n}"},"middle":{"kind":"string","value":";\n let c = ray_origo.x.powi(2) + ray_origo.y.powi(2) + ray_origo.z.powi(2) - self.radius.powi(2);\n\n let determinant = b.powi(2) - 4.0 * a * c;\n if determinant.less_eps(&0.0) {\n None\n } else {\n let t1 = (-b + determinant.sqrt()) / (2.0 * a);\n let t2 = (-b - determinant.sqrt()) / (2.0 * a);\n let result_calc = |t, inside: bool| {\n let intersection_point = origin + dir * t;\n let normal = if !inside { intersection_point - self.origo } else { self.origo - intersection_point };\n\n match RayIntersection::new_model_identifier(normal, intersection_point, ray, self.material, inside, self.identifier) {\n Ok(intersection) => Some(intersection),\n Err(RayIntersectionError::NoRayTravelDistance) => None,\n _ => panic!(\"Unrecoverable RayIntersectin:new_model_identifier error\")\n }\n };\n\n if t1.is_sign_negative() && t2.is_sign_negative() {\n None\n } else if t1.is_sign_positive() && t2.is_sign_negative() {\n result_calc(t1, true)\n } else {\n match result_calc(t2, false) {\n Some(result) => Some(result),\n None => result_calc(t1, true),\n }\n }\n }\n }\n}\n\npub struct SolidPlane {\n material: Material,\n base: Point3,\n normal: Vector3,\n identifier: Uuid,\n}\n\nimpl SolidPlane {\n pub fn new(material: Material) -> Self {\n Self { material: material,\n base: Point3::origin(),\n normal: Vector3::new(0.0, 0.0, 1.0),\n identifier: Uuid::new_v4()\n }\n }\n\n pub fn new_positioned(material: Material, base: Point3, normal: Unit<Vector3>) -> Self {\n Self { material: material,\n base: base,\n normal: normal.unwrap(),\n identifier: Uuid::new_v4()\n }\n }\n\n pub fn set_custom_identifier(&mut self, identifier: Uuid) {\n self.identifier = identifier;\n }\n}\n\nimpl Model for SolidPlane {\n fn get_intersection(&self, ray: &Ray) -> Option<RayIntersection> {\n let origin = ray.get_origin();\n let dir = ray.get_direction();\n\n let u = self.normal.dot(dir);\n if !u.near_zero_eps() {\n let k = self.normal.x * self.base.x + self.normal.y * self.base.y + self.normal.z * self.base.z;\n let s = self.normal.x * origin.x + self.normal.y * origin.y + self.normal.z * origin.z;\n let t = (k-s) / u;\n if t.greater_eq_eps(&0.0) {\n let is_inside = na::angle(&self.normal, dir).less_eq_eps(&std::f64::consts::FRAC_PI_2);\n let point = origin + dir * t;\n if !is_inside {\n match RayIntersection::new_model_identifier(self.normal, point, ray, self.material, is_inside, self.identifier) {\n Ok(intersection) => Some(intersection),\n Err(RayIntersectionError::NoRayTravelDistance) => None,\n _ => panic!(\"Unrecoverable RayIntersectin:new_model_identifier error\")\n }\n } else {\n match RayIntersection::new_model_identifier(-self.normal, point, ray, self.material, is_inside, self.identifier) {\n Ok(intersection) => Some(intersection),\n Err(RayIntersectionError::NoRayTravelDistance) => None,\n _ => panic!(\"Unrecoverable RayIntersectin:new_model_identifier error\")\n }\n }\n } else {\n None\n }\n } else {\n None\n }\n }\n}\n\n#[cfg(test)]\nmod tests {\n use super::*;\n use core::Color;\n\n fn test_solid_unit_sphere(test_ray: &Ray, expected_result: Option<&Point3>) {\n let test_material = Material::new_shiny(Color::new(1.0, 1.0, 1.0), (Color::new(1.0, 1.0, 1.0), 1.5), None);\n let test_sphere = SolidSphere::new(test_material);\n\n let intersection_result = test_sphere.get_intersection(test_ray);\n\n match expected_result {\n Some(expected_point) => {\n let intersection = intersection_result.expect(\"Was expected intersection but none intersected\");\n\n assert_relative_eq!(expected_point, intersection.get_intersection_point());\n },\n None => {\n assert!(intersection_result.is_none());\n }\n }\n }\n\n #[test]\n fn test_solid_unit_sphere_head_on() {\n let test_ray = Ray::new_single_shot(Point3::new(2.0, 0.0, 0.0), Vector3::new(-1.0, 0.0, 0.0));\n test_solid_unit_sphere(&test_ray, Some(&Point3::new(1.0, 0.0, 0.0)));\n }\n\n #[test]\n fn test_solid_unit_sphere_tangential_hit() {\n let test_ray = Ray::new_single_shot(Point3::new(2.0, 0.0, 1.0), Vector3::new(-1.0, 0.0, 0.0));\n test_solid_unit_sphere(&test_ray, Some(&Point3::new(0.0, 0.0, 1.0)));\n }\n\n #[test]\n fn test_solid_unit_sphere_tangential_miss() {\n let test_ray = Ray::new_single_shot(Point3::new(2.0, 0.0, 1.01), Vector3::new(-1.0, 0.0, 0.0));\n test_solid_unit_sphere(&test_ray, "},"strategy":{"kind":"string","value":"random"},"context_items":{"kind":"list like","value":[{"content":"pub trait Model: Send + Sync {\n\n fn get_intersection(&self, ray: &Ray) -> Option<RayIntersection>;\n\n}\n\n\n\npub struct ModelViewModelWrapper<T: Model> {\n\n wrapped_model: T,\n\n tf_matrix: Matrix4,\n\n inverse_tf_matrix: Matrix4\n\n}\n\n\n\nimpl<T: Model> ModelViewModelWrapper<T> {\n\n pub fn new(model: T, model_view_matrix: Matrix4) -> Self {\n\n Self { wrapped_model: model,\n\n inverse_tf_matrix: model_view_matrix.try_inverse().expect(\"Uninvertable Model View Matrix\"),\n\n tf_matrix: model_view_matrix\n\n }\n\n }\n\n\n\n pub fn new_identity(model: T) -> Self {\n\n Self { wrapped_model: model,\n","file_path":"src/core/model.rs","rank":0,"score":80912.9031832758},{"content":"#[derive(Clone, Copy, Debug)]\n\nstruct RayState {\n\n distance_to_origin : FloatType,\n\n depth_counter : i32,\n\n depth_limit: Option<u32>,\n\n}\n\n\n\nimpl RayState {\n\n pub fn get_continuation(input: &Self, distance_to_intersection: FloatType) -> Result<Self, RayError> {\n\n match input.depth_limit {\n\n Some(depth_limit) => {\n\n if depth_limit >= 1 {\n\n Ok (Self { distance_to_origin: input.distance_to_origin + distance_to_intersection,\n\n depth_counter: input.depth_counter + 1,\n\n depth_limit: Some(depth_limit - 1),\n\n ..*input\n\n })\n\n } else {\n\n Err(RayError::DepthLimitReached)\n\n }\n\n },\n","file_path":"src/core/ray.rs","rank":1,"score":80476.82722555535},{"content":"#[derive(Debug, Copy, Clone)]\n\nstruct FresnelData {\n\n pub n: FresnelIndex,\n\n pub n_inverse: FresnelIndex,\n\n pub n_avg: FloatType,\n\n pub n_imaginary: FresnelIndex,\n\n pub n_imaginary_inverse: FresnelIndex,\n\n pub n_imaginary_avg: FloatType,\n\n pub f0: FresnelIndex,\n\n pub f0_avg: FloatType,\n\n pub f0_inverse: FresnelIndex,\n\n pub f0_inverse_avg: FloatType\n\n}\n\n\n\nimpl FresnelData {\n\n fn new(real: FresnelIndex, imaginary: FresnelIndex) -> Self {\n\n let mut f0 = ((real - FresnelIndex::one()) * (real - FresnelIndex::one())) + imaginary * imaginary;\n\n f0 *= (((real + FresnelIndex::one()) * (real + FresnelIndex::one())) + imaginary * imaginary).recip();\n\n\n\n let mut f0_inverse = ((imaginary - FresnelIndex::one()) * (imaginary - FresnelIndex::one())) + imaginary * imaginary;\n\n f0_inverse *= (((imaginary + FresnelIndex::one()) * (imaginary + FresnelIndex::one())) + imaginary * imaginary).recip(); \n","file_path":"src/core/material.rs","rank":2,"score":71990.14834633234},{"content":"pub trait Vector3Extensions {\n\n fn same_direction_as(&self, rhs: &Vector3) -> bool;\n\n fn length(&self) -> FloatType;\n\n}\n\n\n\nimpl Vector3Extensions for Vector3 {\n\n fn same_direction_as(&self, rhs: &Vector3) -> bool {\n\n let closed_angle = na::angle(self, &rhs);\n\n closed_angle.near_zero_eps()\n\n }\n\n\n\n fn length(&self) -> FloatType {\n\n let mut result: FloatType = 0.0;\n\n\n\n for item in self.iter() {\n\n result += item.powi(2);\n\n }\n\n\n\n result.sqrt()\n\n }\n\n}\n\n\n\n\n","file_path":"src/tools.rs","rank":3,"score":63772.52006160385},{"content":"pub trait Intersector: Send + Sync { \n\n fn get_intersections_reverse_ordered(&self, ray: &Ray) -> Vec<RayIntersection>;\n\n fn get_nearest_intersection(&self, ray: &Ray) -> Option<RayIntersection>;\n\n}\n\n\n\n\n\n#[cfg(test)]\n\nmod tests {\n\n use super::*;\n\n use core::{Material};\n\n use defs::{Point3};\n\n use std;\n\n\n\n struct DummyModel {\n\n\n\n }\n\n\n\n impl DummyModel {\n\n pub fn new() -> Self {\n\n Self {\n","file_path":"src/core/model.rs","rank":4,"score":56917.00136309267},{"content":"pub trait RayCaster: Send + Sync {\n\n fn cast_ray(&self, ray: &Ray) -> Option<Color>;\n\n fn cast_colored_light_ray(&self, ray: &Ray, intersection: &RayIntersection) -> Option<Color>;\n\n fn cast_model_ray(&self, ray: &Ray) -> Option<RayIntersection>;\n\n}\n\n\n","file_path":"src/core/world.rs","rank":5,"score":55142.77990105537},{"content":"struct OrderedTaskIteratorInternals {\n\n pub producers : Vec<Box<RenderingTaskProducer>>,\n\n pub current_terator : Option<Box<ThreadSafeIterator<Item=Box<RenderingTask>>>>\n\n}\n\n\n\nimpl OrderedTaskIteratorInternals {\n\n pub fn new(mut producers : Vec<Box<RenderingTaskProducer>>) -> Self {\n\n producers.reverse();\n\n if let Some(first_producer) = producers.pop() {\n\n Self {\n\n producers: producers,\n\n current_terator: Some(first_producer.create_task_iterator())\n\n }\n\n } else {\n\n Self {\n\n producers: producers,\n\n current_terator: None\n\n }\n\n }\n\n }\n","file_path":"src/core/execution.rs","rank":6,"score":43371.12808317646},{"content":"struct GlobalIlluminationShaderState {\n\n pub buffer: Vec<Option<UuidColor>>,\n\n pub visible: HashSet<Uuid>\n\n}\n\n\n\nimpl GlobalIlluminationShaderState {\n\n pub fn new(input: Vec<Option<UuidColor>>) -> Self {\n\n Self {\n\n buffer: input,\n\n visible: HashSet::new()\n\n }\n\n }\n\n\n\n pub fn set_color(&mut self, index: usize, input: UuidColor) {\n\n self.visible.insert(input.id.clone());\n\n self.buffer[index] = Some(input);\n\n }\n\n}\n\n\n\npub struct GlobalIlluminationShader {\n","file_path":"src/basic/postprocessing/gi.rs","rank":7,"score":42357.04760783042},{"content":"pub trait OrderingQuery {\n\n fn is_less(self) -> bool;\n\n fn is_equal(self) -> bool;\n\n fn is_greater(self) -> bool;\n\n}\n\n\n\nimpl OrderingQuery for Ordering {\n\n fn is_less(self) -> bool {\n\n match self {\n\n Ordering::Less => true,\n\n _ => false\n\n }\n\n }\n\n\n\n fn is_equal(self) -> bool {\n\n match self {\n\n Ordering::Equal => true,\n\n _ => false\n\n }\n\n }\n\n\n\n fn is_greater(self) -> bool {\n\n match self {\n\n Ordering::Greater => true,\n\n _ => false\n\n }\n\n }\n\n}\n\n\n","file_path":"src/tools.rs","rank":8,"score":37086.61993239532},{"content":"pub trait Between<T: Num> {\n\n fn between(&self, less: &T, more: &T) -> bool;\n\n}\n\n\n\nimpl Between<FloatType> for FloatType {\n\n fn between(&self, less: &FloatType, more: &FloatType) -> bool {\n\n less.greater_eq_eps(&self) && more.less_eq_eps(&self)\n\n }\n\n}\n\n\n\nimpl Between<IntType> for IntType {\n\n fn between(&self, less: &IntType, more: &IntType) -> bool {\n\n less <= self && self <= more\n\n }\n\n}","file_path":"src/tools.rs","rank":9,"score":35415.056949093836},{"content":"pub trait Scene: Send + Sync {\n\n fn get_pixel_color(&self, pixel: Point2Int) -> Result<Color, SceneError>;\n\n fn get_pixel_intersection(&self, pixel: Point2Int) -> Result<RayIntersection, SceneError>;\n\n fn get_view(&self) -> &View;\n\n fn get_ray_caster(&self) -> &RayCaster;\n\n fn get_illumination_caster(&self) -> &IlluminationCaster;\n\n}\n\n\n\n#[derive(Debug)]\n\npub enum SceneBufferError {\n\n InvalidInputCoord,\n\n MutexLockError,\n\n OtherBufferNotSameSize\n\n}\n\n\n\n#[derive(Debug)]\n\npub enum SceneBufferLayering {\n\n Under,\n\n Over\n\n}\n\n\n","file_path":"src/core/scene.rs","rank":10,"score":33135.372075716026},{"content":"pub trait Illuminator: Send + Sync {\n\n fn get_illumination_at(&self, intersection: &RayIntersection, illumination_caster: &RayCaster) -> Vec<LightIntersection>;\n\n}","file_path":"src/core/light.rs","rank":11,"score":33135.372075716026},{"content":"pub trait CompareWithTolerance<T: Float> {\n\n fn compare_eps(&self, rhs: &T) -> Ordering;\n\n fn less_eps(&self, rhs: &T) -> bool;\n\n fn less_eq_eps(&self, rhs: &T) -> bool;\n\n fn equal_eps(&self, rhs: &T) -> bool;\n\n fn greater_eps(&self, rhs: &T) -> bool;\n\n fn greater_eq_eps(&self, rhs: &T) -> bool;\n\n fn near_zero_eps(&self) -> bool;\n\n}\n\n\n\nimpl CompareWithTolerance<FloatType> for FloatType {\n\n fn compare_eps(&self, rhs: &FloatType) -> Ordering {\n\n self.approx_cmp_ulps(&rhs, FLOAT_ULPS_TOLERANCE)\n\n }\n\n\n\n fn less_eps(&self, rhs: &FloatType) -> bool {\n\n self.approx_cmp_ulps(&rhs, FLOAT_ULPS_TOLERANCE) == Ordering::Less\n\n }\n\n\n\n fn less_eq_eps(&self, rhs: &FloatType) -> bool {\n","file_path":"src/tools.rs","rank":12,"score":33135.372075716026},{"content":"pub trait RenderingTask: Send + Sync {\n\n fn execute(self: Box<Self>);\n\n}\n\n\n","file_path":"src/core/execution.rs","rank":13,"score":32138.37131194181},{"content":"pub trait ColorCalculator: Send + Sync {\n\n fn get_color(&self, itersection: &RayIntersection, ray_caster: &RayCaster, illumination_caster: &IlluminationCaster) -> Option<Color>;\n\n}\n\n\n\npub struct World<IntersectorType, ColorCalculatorType, IlluminatorType> {\n\n intersector : IntersectorType,\n\n color_calculator : ColorCalculatorType,\n\n illuminator: IlluminatorType,\n\n depth_limit : i32,\n\n}\n\n\n\nimpl<IntersectorType: Intersector + Send + Sync,\n\n ColorCalculatorType: ColorCalculator + Send + Sync,\n\n IlluminatorType : Illuminator + Send + Sync> \n\n World<IntersectorType, ColorCalculatorType, IlluminatorType> {\n\n \n\n pub fn new(intersector: IntersectorType, colorcalc: ColorCalculatorType, illuminator: IlluminatorType, ray_depth_limit: i32) -> Self {\n\n Self {intersector: intersector,\n\n color_calculator: colorcalc,\n\n illuminator: illuminator,\n","file_path":"src/core/world.rs","rank":14,"score":32138.37131194181},{"content":"pub trait IlluminationCaster: Send + Sync {\n\n fn get_illumination_at(&self, intersection: &RayIntersection) -> Vec<LightIntersection>;\n\n}\n\n\n","file_path":"src/core/world.rs","rank":15,"score":32138.37131194181},{"content":"pub trait LightSource: Send + Sync {\n\n fn get_ray_to_intersection(&self, intersection: &RayIntersection) -> Option<Ray>;\n\n fn get_illumination_at(&self, intersection: &RayIntersection) -> Option<LightIntersection>;\n\n fn get_intersection(&self, ray: &Ray) -> Option<LightIntersection>;\n\n}\n\n\n","file_path":"src/core/light.rs","rank":16,"score":32138.37131194181},{"content":"pub trait ThreadSafeIterator: Send + Sync {\n\n type Item;\n\n\n\n fn next(&self) -> Option<Self::Item>;\n\n}\n\n\n","file_path":"src/core/execution.rs","rank":17,"score":31221.324790793806},{"content":"pub trait RenderingTaskProducer: Send + Sync {\n\n fn create_task_iterator(self: Box<Self>) -> Box<ThreadSafeIterator<Item=Box<RenderingTask>>>;\n\n}\n\n\n\npub struct OrderedTaskProducers {\n\n producers: Option<Vec<Box<RenderingTaskProducer>>>\n\n}\n\n\n\nimpl OrderedTaskProducers {\n\n pub fn new(producers: Vec<Box<RenderingTaskProducer>>) -> Box<RenderingTaskProducer> {\n\n Box::new(Self {\n\n producers: Some(producers)\n\n })\n\n }\n\n}\n\n\n\nimpl RenderingTaskProducer for OrderedTaskProducers {\n\n fn create_task_iterator(mut self: Box<Self>) -> Box<ThreadSafeIterator<Item=Box<RenderingTask>>> {\n\n Box::new(OrderedTaskIterator::new(self.producers.take().expect(\"OrderedTaskProducers should have not been created empty\")))\n\n }\n\n}\n\n\n\n\n","file_path":"src/core/execution.rs","rank":18,"score":31221.324790793806},{"content":"pub trait ImmutableSceneBuffer: Send + Sync {\n\n fn get_pixel_value(&self, pixel: Point2Int) -> Result<Option<Color>, SceneBufferError>;\n\n fn get_screen(&self) -> &Screen;\n\n\n\n fn is_same_size_buffer(&self, rhs: &ImmutableSceneBuffer) -> bool {\n\n self.get_screen().get_resolution() == rhs.get_screen().get_resolution()\n\n }\n\n}\n\n\n","file_path":"src/core/scene.rs","rank":19,"score":31221.324790793806},{"content":"pub trait WorldViewTrait: Scene + SceneBuffer {\n\n\n\n}\n\n\n\npub struct WorldView<WorldT> {\n\n world: Arc<WorldT>,\n\n view: View,\n\n result_buffer: BasicSceneBuffer,\n\n}\n\n\n\nimpl<WorldT> WorldView<WorldT>\n\n where WorldT: RayCaster + IlluminationCaster + Send + Sync\n\n{\n\n #[allow(dead_code)]\n\n pub fn new(world: WorldT, view: View) -> Self {\n\n let screen_clone = view.get_screen().clone();\n\n Self { world: Arc::new(world),\n\n view: view,\n\n result_buffer: BasicSceneBuffer::new(screen_clone) }\n\n }\n","file_path":"src/core/worldview.rs","rank":20,"score":30374.985428502172},{"content":" pub fn get_depth_counter(&self) -> i32 {\n\n self.depth_counter\n\n }\n\n}\n\n\n\n#[derive(Debug, Clone)]\n\npub struct Ray {\n\n direction : Unit<Vector3>,\n\n origin : Point3,\n\n state : RayState,\n\n mediums : Option<VecDeque<Material>>, \n\n}\n\n\n\nimpl Ray {\n\n pub fn new(origin: Point3, dir: Vector3) -> Self {\n\n Self { direction: Unit::new_normalize(dir),\n\n origin: origin,\n\n mediums: None,\n\n state: RayState { distance_to_origin: 0.0,\n\n depth_counter: 0,\n","file_path":"src/core/ray.rs","rank":21,"score":29102.02886649265},{"content":"use defs::{Vector3, Point3, FloatType, Matrix4};\n\nuse std::collections::{VecDeque};\n\nuse core::{RayIntersection, Material};\n\nuse tools::Vector3Extensions;\n\nuse na::{Unit};\n\n\n\n\n\n#[derive(Debug)]\n\npub enum RayError {\n\n DepthLimitReached,\n\n InvalidContinuationDirection,\n\n}\n\n\n\n\n\n#[derive(Clone, Copy, Debug)]\n","file_path":"src/core/ray.rs","rank":22,"score":29098.02411890841},{"content":" depth_limit: None }\n\n }\n\n }\n\n\n\n pub fn new_depth_limited(origin: Point3, dir: Vector3, depth_limit: u32) -> Self {\n\n Self { direction: Unit::new_normalize(dir),\n\n origin: origin,\n\n mediums: None,\n\n state: RayState { distance_to_origin: 0.0,\n\n depth_counter: 0,\n\n depth_limit: Some(depth_limit) }\n\n }\n\n }\n\n\n\n pub fn new_single_shot(origin: Point3, dir: Vector3) -> Self {\n\n Self::new_depth_limited(origin, dir, 1)\n\n }\n\n\n\n pub fn set_maximum_depth_limited(&self, maximum_depth_limit: u32) -> Self {\n\n Self {\n","file_path":"src/core/ray.rs","rank":23,"score":29097.700837259017},{"content":" pub fn new_reversed_ray(ray: &Ray) -> Self {\n\n Self { direction: (-ray.direction),\n\n ..ray.clone() }\n\n }\n\n\n\n pub fn get_transformed(&self, transformation_matrix: &Matrix4) -> Self {\n\n let origin = self.origin.to_homogeneous();\n\n let direction = self.direction.to_homogeneous();\n\n\n\n Self { origin: Point3::from_homogeneous(transformation_matrix * origin).expect(\"Unhomogeneous transformed point\"),\n\n direction: Unit::new_normalize(Vector3::from_homogeneous(transformation_matrix * direction).expect(\"Unhomogeneous transformed vector\")),\n\n ..self.clone()\n\n }\n\n }\n\n\n\n pub fn get_origin(&self) -> &Point3 {\n\n &self.origin\n\n }\n\n\n\n pub fn get_direction(&self) -> &Vector3 {\n","file_path":"src/core/ray.rs","rank":24,"score":29095.925952724756},{"content":" }\n\n\n\n pub fn continue_ray_from_previous(previous_ray: &Ray, origin: Point3, direction: Vector3) -> Result<Self, RayError> {\n\n let calculated_direction = origin - previous_ray.get_origin();\n\n\n\n match RayState::get_continuation(&previous_ray.state, calculated_direction.length()) {\n\n Ok (continued_state) => {\n\n Ok (Self { direction: Unit::new_normalize(direction),\n\n origin: origin,\n\n state: continued_state,\n\n ..previous_ray.clone()})\n\n },\n\n Err(e) => Err(e)\n\n }\n\n }\n\n\n\n fn get_state(&self) -> &RayState {\n\n &self.state\n\n }\n\n\n","file_path":"src/core/ray.rs","rank":25,"score":29092.606918580026},{"content":" }\n\n }\n\n}\n\n\n\n\n\n#[cfg(test)]\n\nmod tests {\n\n use super::*;\n\n use core::{RayIntersection, Material};\n\n\n\n #[test]\n\n fn test_ray_new1_assignment() {\n\n let test_ray = Ray::new(Point3::new(0.0, 0.0, 0.0), Vector3::new(1.0, 0.0, 0.0));\n\n\n\n assert_eq!(test_ray.get_distance_to_origin(), 0.0);\n\n assert_eq!(test_ray.get_depth_counter(), 0);\n\n }\n\n\n\n #[test]\n\n fn test_continue_ray_from_intersection() {\n","file_path":"src/core/ray.rs","rank":26,"score":29092.561495760012},{"content":" let initial_ray = Ray::new(Point3::new(0.0, 0.0, 0.0), Vector3::new(1.0, 0.0, 0.0));\n\n let intersection = RayIntersection::new(Vector3::new(0.0, 0.0, 1.0),\n\n Point3::new(1.0, 0.0, 0.0),\n\n &initial_ray,\n\n Material::new_useless(),\n\n false).unwrap();\n\n let continued_ray = Ray::continue_ray_from_intersection(&intersection, Vector3::new(0.0, 1.0, 0.0)).unwrap();\n\n\n\n assert_eq!(continued_ray.get_depth_counter(), 1);\n\n assert_eq!(continued_ray.get_distance_to_origin(), 1.0);\n\n }\n\n\n\n #[test]\n\n fn test_depth_limits() {\n\n let initial_ray = Ray::new_depth_limited(Point3::new(0.0, 0.0, 0.0), Vector3::new(1.0, 0.0, 0.0), 1);\n\n let continue_1 = Ray::continue_ray_from_previous(&initial_ray, Point3::new(1.0, 0.0, 0.0), Vector3::new(1.0, 0.0, 0.0)).expect(\"Ray should still continue\");\n\n let continue_2 = Ray::continue_ray_from_previous(&continue_1, Point3::new(2.0, 0.0, 0.0), Vector3::new(1.0, 0.0, 0.0));\n\n if !continue_2.is_err() {\n\n panic!(\"Ray should not continue further\");\n\n }\n\n }\n\n}\n","file_path":"src/core/ray.rs","rank":27,"score":29090.91059908333},{"content":" } else {\n\n result.push_medium(*intersection.get_material());\n\n }\n\n\n\n Ok(result)\n\n },\n\n Err(e) => Err(e)\n\n }\n\n }\n\n\n\n pub fn continue_ray_from_intersection(intersection: &RayIntersection, direction: Vector3) -> Result<Self, RayError> {\n\n match RayState::get_continuation(intersection.get_intersector_ray().get_state(), intersection.get_distance_to_intersection()) {\n\n Ok (continued_state) => {\n\n Ok (Self { direction: Unit::new_normalize(direction),\n\n origin: *intersection.get_intersection_point(),\n\n state: continued_state,\n\n ..intersection.get_intersector_ray().clone()})\n\n },\n\n Err(e) => Err(e)\n\n }\n","file_path":"src/core/ray.rs","rank":28,"score":29090.054086979344},{"content":" if let Some(ref mut mediums) = self.mediums {\n\n mediums.pop_back();\n\n }\n\n if self.mediums.as_ref().unwrap().is_empty() {\n\n self.mediums = None;\n\n }\n\n }\n\n }\n\n\n\n pub fn continue_ray_from_intersection_into_medium(intersection: &RayIntersection, direction: Vector3) -> Result<Self, RayError> {\n\n let original_ray = intersection.get_intersector_ray();\n\n\n\n match RayState::get_continuation(original_ray.get_state(), intersection.get_distance_to_intersection()) {\n\n Ok (continued_state) => {\n\n let mut result = Self { direction: Unit::new_normalize(direction),\n\n origin: *intersection.get_intersection_point(),\n\n mediums: original_ray.mediums.clone(),\n\n state: continued_state};\n\n if intersection.was_inside() {\n\n result.pop_medium();\n","file_path":"src/core/ray.rs","rank":29,"score":29089.455605878997},{"content":"\n\n\n\n#[derive(Debug, Copy, Clone)]\n\npub struct Material {\n\n ambient: Option<Color>,\n\n diffuse: Option<Color>,\n\n specular: Option<(Color, FloatType)>,\n\n fresnel: Option<FresnelData>,\n\n reflective: bool,\n\n refractive: bool,\n\n}\n\n\n\nimpl Material {\n\n pub fn new_useless() -> Self {\n\n Self { ambient: None,\n\n diffuse: None,\n\n specular: None,\n\n fresnel: None,\n\n reflective: false,\n\n refractive: false\n","file_path":"src/core/material.rs","rank":30,"score":29087.665006903826},{"content":"\n\n pub fn get_fresnel_reflection(ray_intersection: &RayIntersection) -> Option<Color> {\n\n let material = ray_intersection.get_material();\n\n material.get_fresnel_data().and_then(|fresnel_data| {\n\n fresnel_data.get_fresnel_reflect(ray_intersection)\n\n })\n\n }\n\n\n\n pub fn get_fresnel_refraction(ray_intersection: &RayIntersection) -> Option<Color> {\n\n let material = ray_intersection.get_material();\n\n material.get_fresnel_data().and_then(|fresnel_data| {\n\n fresnel_data.get_fresnel_refract(ray_intersection)\n\n })\n\n }\n\n}","file_path":"src/core/material.rs","rank":31,"score":29087.29022723986},{"content":" None => {\n\n Ok (Self { distance_to_origin: input.distance_to_origin + distance_to_intersection,\n\n depth_counter: input.depth_counter + 1,\n\n ..*input\n\n })\n\n }\n\n }\n\n }\n\n\n\n pub fn get_maximum_depth_limited(&self, maximum_depth_limit: u32) -> Self {\n\n Self {\n\n depth_limit: Some(maximum_depth_limit.min(if let Some(depth_limit) = self.depth_limit {depth_limit} else {maximum_depth_limit})),\n\n ..*self\n\n }\n\n }\n\n\n\n pub fn get_distance_to_origin(&self) -> FloatType {\n\n self.distance_to_origin\n\n }\n\n\n","file_path":"src/core/ray.rs","rank":32,"score":29086.610916144447},{"content":" &self.direction.as_ref()\n\n }\n\n\n\n pub fn get_distance_to_origin(&self) -> FloatType {\n\n self.state.get_distance_to_origin()\n\n }\n\n\n\n pub fn get_depth_counter(&self) -> i32 {\n\n self.state.get_depth_counter()\n\n }\n\n\n\n pub fn get_medium(&self) -> Option<Material> {\n\n if let Some(ref mediums) = self.mediums {\n\n if let Some(last_item) = mediums.back() {\n\n Some(last_item.clone())\n\n } else {\n\n None\n\n }\n\n } else {\n\n None\n","file_path":"src/core/ray.rs","rank":33,"score":29085.778171870916},{"content":" Some(fresnel_data.n_avg)\n\n })\n\n }\n\n\n\n pub fn get_refractive_index_for_component(&self, component: ColorComponent) -> Option<FloatType> {\n\n self.fresnel.and_then(|fresnel_data| {\n\n Some(fresnel_data.n.get_component(component))\n\n })\n\n }\n\n\n\n fn get_fresnel_data(&self) -> Option<&FresnelData> {\n\n self.fresnel.as_ref()\n\n }\n\n\n\n pub fn get_diffuse_illumination(ray_intersection: &RayIntersection, light_intersection: &LightIntersection) -> Option<Color> {\n\n let material = ray_intersection.get_material();\n\n\n\n material.get_diffuse_color().and_then(|color| {\n\n let surface_normal = ray_intersection.get_normal_vector();\n\n let light_direction = light_intersection.get_light_direction();\n","file_path":"src/core/material.rs","rank":34,"score":29085.59741706477},{"content":"use core::Material;","file_path":"src/basic/materials.rs","rank":35,"score":29084.671092696713},{"content":" let cosln = light_direction.dot(surface_normal).max(0.0);\n\n let illumination = light_intersection.get_illumination();\n\n Some ((*color * *illumination).mul_scalar(&cosln))\n\n })\n\n }\n\n\n\n pub fn get_specular_illumination(ray_intersection: &RayIntersection, light_intersection: &LightIntersection) -> Option<Color> {\n\n let material = ray_intersection.get_material();\n\n\n\n material.get_specular_color().and_then(|color_shiny| {\n\n let illumination = light_intersection.get_illumination();\n\n let view_direction = ray_intersection.get_view_direction();\n\n let surface_normal = ray_intersection.get_normal_vector();\n\n let (color, shininess) = *color_shiny;\n\n let light_direction = light_intersection.get_light_direction();\n\n let half_direction = (view_direction + light_direction).normalize();\n\n let coshn = half_direction.dot(surface_normal).max(0.0).powf(shininess);\n\n Some((color * *illumination).mul_scalar(&coshn))\n\n })\n\n }\n","file_path":"src/core/material.rs","rank":36,"score":29084.368017359702},{"content":"use core::{Color, ColorComponent, FresnelIndex, RayIntersection, LightIntersection};\n\n\n\nuse defs::FloatType;\n\nuse tools::CompareWithTolerance;\n\n\n\n#[derive(Debug, Copy, Clone)]\n","file_path":"src/core/material.rs","rank":37,"score":29083.840245098265},{"content":" }\n\n }\n\n\n\n pub fn new_diffuse(diffuse: Color, ambient: Option<Color>) -> Self {\n\n Self { diffuse: Some(diffuse),\n\n ambient: ambient,\n\n specular: None,\n\n fresnel: None,\n\n reflective: false,\n\n refractive: false}\n\n }\n\n\n\n pub fn new_shiny(diffuse: Color, specular: (Color, FloatType), ambient: Option<Color>) -> Self {\n\n Self { diffuse: Some(diffuse),\n\n ambient: ambient,\n\n specular: Some(specular),\n\n fresnel: None,\n\n reflective: false,\n\n refractive: false}\n\n }\n","file_path":"src/core/material.rs","rank":38,"score":29083.36819497293},{"content":" Self { diffuse: diffuse,\n\n ambient: ambient,\n\n specular: specular,\n\n fresnel: Some(FresnelData::new(fresnel_real, fresnel_imagninary)),\n\n reflective: true,\n\n refractive: true}\n\n }\n\n\n\n pub fn new_light_source(diffuse: Color, ambient: Option<Color>) -> Self {\n\n Self {\n\n diffuse: Some(diffuse),\n\n ambient: ambient,\n\n specular: None,\n\n fresnel: Some(FresnelData::new(FresnelIndex::one(), FresnelIndex::one())),\n\n reflective: false,\n\n refractive: true\n\n }\n\n }\n\n\n\n pub fn get_ambient_color(&self) -> Option<&Color> {\n","file_path":"src/core/material.rs","rank":39,"score":29082.84056336116},{"content":"\n\n pub fn new_reflective(fresnel_real: FresnelIndex, fresnel_imagninary: FresnelIndex, diffuse: Option<Color>, specular: Option<(Color, FloatType)>, ambient: Option<Color>) -> Self {\n\n Self { diffuse: diffuse,\n\n ambient: ambient,\n\n specular: specular,\n\n fresnel: Some(FresnelData::new(fresnel_real, fresnel_imagninary)),\n\n reflective: true,\n\n refractive: false}\n\n }\n\n\n\n pub fn new_refractive(fresnel_real: FresnelIndex, fresnel_imagninary: FresnelIndex, diffuse: Option<Color>, specular: Option<(Color, FloatType)>, ambient: Option<Color>) -> Self {\n\n Self { diffuse: diffuse,\n\n ambient: ambient,\n\n specular: specular,\n\n fresnel: Some(FresnelData::new(fresnel_real, fresnel_imagninary)),\n\n reflective: false,\n\n refractive: true}\n\n }\n\n\n\n pub fn new_reflective_and_refractive(fresnel_real: FresnelIndex, fresnel_imagninary: FresnelIndex, diffuse: Option<Color>, specular: Option<(Color, FloatType)>, ambient: Option<Color>) -> Self {\n","file_path":"src/core/material.rs","rank":40,"score":29082.621948553166},{"content":" state: self.state.get_maximum_depth_limited(maximum_depth_limit),\n\n ..self.clone()\n\n }\n\n }\n\n\n\n pub fn set_maximum_depth_limited_mut(&mut self, maximum_depth_limit: u32){\n\n self.state = self.state.get_maximum_depth_limited(maximum_depth_limit);\n\n }\n\n\n\n fn push_medium(&mut self, material: Material) {\n\n if let Some(ref mut mediums) = self.mediums {\n\n mediums.push_back(material);\n\n } else {\n\n self.mediums = Some(VecDeque::new());\n\n self.mediums.as_mut().unwrap().push_back(material);\n\n }\n\n }\n\n\n\n fn pop_medium(&mut self) {\n\n if self.mediums.is_some() {\n","file_path":"src/core/ray.rs","rank":41,"score":29082.548615841104},{"content":"\n\n Self { n: real,\n\n n_inverse: real.recip(),\n\n n_avg: real.intensity_avg(),\n\n n_imaginary: imaginary,\n\n n_imaginary_inverse: imaginary.recip(),\n\n n_imaginary_avg: imaginary.intensity_avg(),\n\n f0: f0,\n\n f0_avg: f0.intensity_avg(),\n\n f0_inverse: f0_inverse,\n\n f0_inverse_avg: f0_inverse.intensity_avg()\n\n }\n\n }\n\n\n\n pub fn get_fresnel_reflect(&self, intersection: &RayIntersection) -> Option<Color> {\n\n let view_and_normal_angle_cosine = intersection.get_view_direction().dot(intersection.get_normal_vector());\n\n\n\n if view_and_normal_angle_cosine.greater_eq_eps(&0.0) {\n\n let f = if !intersection.was_inside() {\n\n self.f0\n","file_path":"src/core/material.rs","rank":42,"score":29082.053037724483},{"content":" } else {\n\n self.f0_inverse\n\n };\n\n\n\n let f1 = (Color::one()-f) * Color::one().mul_scalar(&(1.0 - view_and_normal_angle_cosine).powi(5));\n\n \n\n Some(f + f1)\n\n } else {\n\n None\n\n }\n\n }\n\n\n\n pub fn get_fresnel_refract(&self, intersection: &RayIntersection) -> Option<Color> {\n\n if let Some(color) = self.get_fresnel_reflect(intersection) {\n\n Some(Color::one() - color)\n\n } else {\n\n None\n\n }\n\n }\n\n}\n","file_path":"src/core/material.rs","rank":43,"score":29081.6292868064},{"content":" self.ambient.as_ref()\n\n }\n\n\n\n pub fn get_diffuse_color(&self) -> Option<&Color> {\n\n self.diffuse.as_ref()\n\n }\n\n\n\n pub fn get_specular_color(&self) -> Option<&(Color, FloatType)> {\n\n self.specular.as_ref()\n\n }\n\n\n\n pub fn is_opaque(&self) -> bool {\n\n !self.refractive\n\n }\n\n\n\n pub fn is_transparent(&self) -> bool {\n\n !self.is_opaque()\n\n }\n\n\n\n pub fn is_reflective(&self) -> bool {\n","file_path":"src/core/material.rs","rank":44,"score":29080.997631415692},{"content":" self.reflective\n\n }\n\n\n\n pub fn is_refractive(&self) -> bool {\n\n self.refractive\n\n }\n\n\n\n pub fn get_transparency_to_light(&self) -> Option<Color> {\n\n if self.is_transparent() {\n\n match self.diffuse {\n\n None => Some(Color::one()),\n\n Some(color) => Some(color)\n\n }\n\n } else {\n\n None\n\n }\n\n }\n\n\n\n pub fn get_average_refractive_index(&self) -> Option<FloatType> {\n\n self.fresnel.and_then(|fresnel_data| {\n","file_path":"src/core/material.rs","rank":45,"score":29080.648740995628},{"content":" 0.0, 0.0, 0.0, 1.0);\n\n \n\n assert_relative_eq!(wrapper.get_tf_matrix(), &expected);\n\n }\n\n\n\n struct ModelMock {\n\n point: Point3,\n\n normal: Vector3,\n\n }\n\n\n\n impl ModelMock {\n\n pub fn new(point: Point3, normal: Vector3) -> Self {\n\n Self { point: point,\n\n normal: normal }\n\n }\n\n }\n\n\n\n impl Model for ModelMock {\n\n fn get_intersection(&self, ray: &Ray) -> Option<RayIntersection> {\n\n Some(RayIntersection::new(self.normal, self.point, ray, Material::new_useless(), false).expect(\"Ray depth limit reached\"))\n","file_path":"src/core/model.rs","rank":50,"score":28825.159381214857},{"content":" test_model.rotate(Vector3::new(0.0, 0.0, 1.0), std::f64::consts::FRAC_PI_2);\n\n\n\n let intersector_ray = Ray::new_single_shot(Point3::new(0.0, -5.0, 2.0), Vector3::new(0.0, 1.0, 0.0));\n\n let transformed_intersection = test_model.get_intersection(&intersector_ray).expect(\"There was no intersection returned when ModelMock always returns\");\n\n\n\n assert_relative_eq!(transformed_intersection.get_intersection_point(), &Point3::new(0.0, 0.0, 2.0));\n\n assert_relative_eq!(transformed_intersection.get_normal_vector(), &Vector3::new(1.0, 1.0, 1.0).normalize());\n\n assert_relative_eq!(transformed_intersection.get_distance_to_intersection(), &5.0);\n\n }\n\n\n\n #[test]\n\n fn mvo_wrapper_complete_scale_translate() {\n\n let mut test_model = ModelViewModelWrapper::new_identity(ModelMock::new(Point3::new(0.0, 0.0, 1.0), Vector3::new(1.0, -1.0, 1.0)));\n\n test_model.scale_uniform(2.0);\n\n test_model.translate(Vector3::new(0.0, 1.0, 0.0)); \n\n\n\n let intersector_ray = Ray::new_single_shot(Point3::new(0.0, -5.0, 2.0), Vector3::new(0.0, 1.0, 0.0));\n\n let transformed_intersection = test_model.get_intersection(&intersector_ray).expect(\"There was no intersection returned when ModelMock always returns\");\n\n\n\n assert_relative_eq!(transformed_intersection.get_intersection_point(), &Point3::new(0.0, 1.0, 2.0));\n\n assert_relative_eq!(transformed_intersection.get_normal_vector(), &Vector3::new(1.0, -1.0, 1.0).normalize());\n\n assert_relative_eq!(transformed_intersection.get_distance_to_intersection(), &6.0);\n\n }\n\n}","file_path":"src/core/model.rs","rank":53,"score":28817.57548545539},{"content":"use defs::{Matrix4, Vector3, FloatType};\n\nuse core::{Ray, RayIntersection};\n\nuse na::{Similarity3, Rotation3, Translation3, Unit};\n\n\n","file_path":"src/core/model.rs","rank":54,"score":28817.404552708285},{"content":"\n\n self.recalculate_cached_matrices();\n\n }\n\n\n\n pub fn rotate(&mut self, axis: Vector3, angle: FloatType) {\n\n let rotation = Rotation3::from_axis_angle(&Unit::new_normalize(axis), angle);\n\n\n\n self.tf_matrix = rotation.to_homogeneous() * self.tf_matrix;\n\n\n\n self.recalculate_cached_matrices();\n\n }\n\n\n\n #[cfg(test)]\n\n pub fn get_tf_matrix(&self) -> &Matrix4 {\n\n &self.tf_matrix\n\n }\n\n}\n\n\n\nimpl<T: Model> Model for ModelViewModelWrapper<T> {\n\n fn get_intersection(&self, ray: & Ray) -> Option<RayIntersection<>> {\n","file_path":"src/core/model.rs","rank":55,"score":28816.64321132849},{"content":" }\n\n }\n\n\n\n #[test]\n\n fn mvo_wrapper_complete_translate() {\n\n let mut test_model = ModelViewModelWrapper::new_identity(ModelMock::new(Point3::new(0.0, 0.0, 1.0), Vector3::new(1.0, -1.0, 1.0)));\n\n test_model.translate(Vector3::new(0.0, 0.0, 1.0));\n\n\n\n let intersector_ray = Ray::new_single_shot(Point3::new(0.0, -5.0, 2.0), Vector3::new(0.0, 1.0, 0.0));\n\n let transformed_intersection = test_model.get_intersection(&intersector_ray).expect(\"There was no intersection returned when ModelMock always returns\");\n\n\n\n assert_relative_eq!(transformed_intersection.get_intersection_point(), &Point3::new(0.0, 0.0, 2.0));\n\n assert_relative_eq!(transformed_intersection.get_normal_vector(), &Vector3::new(1.0, -1.0, 1.0).normalize());\n\n assert_relative_eq!(transformed_intersection.get_distance_to_intersection(), &5.0);\n\n }\n\n\n\n #[test]\n\n fn mvo_wrapper_complete_rotate_translate() {\n\n let mut test_model = ModelViewModelWrapper::new_identity(ModelMock::new(Point3::new(0.0, 0.0, 1.0), Vector3::new(1.0, -1.0, 1.0)));\n\n test_model.translate(Vector3::new(0.0, 0.0, 1.0));\n","file_path":"src/core/model.rs","rank":56,"score":28816.638824152367},{"content":"\n\n }\n\n }\n\n }\n\n\n\n impl Model for DummyModel {\n\n fn get_intersection(&self, _ray: &Ray) -> Option<RayIntersection> {\n\n None\n\n }\n\n }\n\n\n\n #[test]\n\n fn mvo_wrapper_scale_uniform() {\n\n let mut wrapper = ModelViewModelWrapper::new_identity(DummyModel::new());\n\n wrapper.scale_uniform(2.0);\n\n\n\n let expected = Matrix4::new(2.0, 0.0, 0.0, 0.0,\n\n 0.0, 2.0, 0.0, 0.0,\n\n 0.0, 0.0, 2.0, 0.0,\n\n 0.0, 0.0, 0.0, 1.0);\n","file_path":"src/core/model.rs","rank":59,"score":28813.74831776716},{"content":" wrapper.translate(Vector3::new(1.0, 1.0, 1.0));\n\n\n\n let expected = Matrix4::new(1.0, 0.0, 0.0, 1.0,\n\n 0.0, 1.0, 0.0, 1.0,\n\n 0.0, 0.0, 1.0, 1.0,\n\n 0.0, 0.0, 0.0, 1.0);\n\n \n\n assert_relative_eq!(wrapper.get_tf_matrix(), &expected);\n\n }\n\n\n\n #[test]\n\n fn mvo_wrapper_scale_translate() {\n\n let mut wrapper = ModelViewModelWrapper::new_identity(DummyModel::new());\n\n\n\n wrapper.scale_non_uniform(Vector3::new(2.0, 2.0, 2.0));\n\n wrapper.translate(Vector3::new(1.0, 1.0, 1.0));\n\n\n\n let expected = Matrix4::new(2.0, 0.0, 0.0, 1.0,\n\n 0.0, 2.0, 0.0, 1.0,\n\n 0.0, 0.0, 2.0, 1.0,\n","file_path":"src/core/model.rs","rank":61,"score":28811.009329436616},{"content":" let transformed_ray = ray.get_transformed(&self.inverse_tf_matrix);\n\n\n\n match self.wrapped_model.get_intersection(&transformed_ray) {\n\n None => None,\n\n Some(transformed_intersection) => transformed_intersection.get_transformed(&self.tf_matrix).ok()\n\n }\n\n }\n\n}\n\n\n\n\n","file_path":"src/core/model.rs","rank":62,"score":28810.240787735518},{"content":" \n\n assert_relative_eq!(wrapper.get_tf_matrix(), &expected);\n\n }\n\n\n\n #[test]\n\n fn mvo_wrapper_scale_non_uniform() {\n\n let mut wrapper = ModelViewModelWrapper::new_identity(DummyModel::new());\n\n wrapper.scale_non_uniform(Vector3::new(2.0, 3.0, 4.0));\n\n\n\n let expected = Matrix4::new(2.0, 0.0, 0.0, 0.0,\n\n 0.0, 3.0, 0.0, 0.0,\n\n 0.0, 0.0, 4.0, 0.0,\n\n 0.0, 0.0, 0.0, 1.0);\n\n \n\n assert_relative_eq!(wrapper.get_tf_matrix(), &expected);\n\n }\n\n\n\n #[test]\n\n fn mvo_wrapper_translate() {\n\n let mut wrapper = ModelViewModelWrapper::new_identity(DummyModel::new());\n","file_path":"src/core/model.rs","rank":63,"score":28809.961011642412},{"content":" }\n\n\n\n pub fn scale_non_uniform(&mut self, scaling: Vector3) {\n\n let diagonal = {\n\n let mut result = scaling.to_homogeneous();\n\n result[(3, 0)] = 1.0;\n\n result\n\n };\n\n\n\n let similarity = Matrix4::from_diagonal(&diagonal);\n\n \n\n self.tf_matrix = similarity * self.tf_matrix;\n\n\n\n self.recalculate_cached_matrices();\n\n }\n\n\n\n pub fn translate(&mut self, translation: Vector3) {\n\n let translate = Translation3::from_vector(translation);\n\n\n\n self.tf_matrix = translate.to_homogeneous() * self.tf_matrix;\n","file_path":"src/core/model.rs","rank":64,"score":28809.763092340443},{"content":" inverse_tf_matrix: Matrix4::identity(),\n\n tf_matrix: Matrix4::identity()\n\n }\n\n }\n\n\n\n fn recalculate_cached_matrices(&mut self) {\n\n self.inverse_tf_matrix = self.tf_matrix.try_inverse().expect(\"Uninvertable Model View Matrix\");\n\n }\n\n\n\n pub fn load_identity(&mut self) {\n\n self.tf_matrix = Matrix4::identity();\n\n self.inverse_tf_matrix = Matrix4::identity();\n\n }\n\n\n\n pub fn scale_uniform(&mut self, scaling: FloatType) {\n\n let similarity = Similarity3::from_scaling(scaling);\n\n\n\n self.tf_matrix = similarity.to_homogeneous() * self.tf_matrix;\n\n\n\n self.recalculate_cached_matrices(); \n","file_path":"src/core/model.rs","rank":65,"score":28808.40954026133},{"content":"pub trait SceneBuffer: ImmutableSceneBuffer + MutableSceneBuffer + Send + Sync {\n\n\n\n}\n\n\n\n\n\npub struct SceneBufferIterator<'buffer> {\n\n buffer: &'buffer ImmutableSceneBuffer,\n\n screen_iterator: ScreenIterator\n\n}\n\n\n\nimpl<'buffer> SceneBufferIterator<'buffer> {\n\n pub fn new(buffer: &'buffer ImmutableSceneBuffer) -> Self {\n\n Self {\n\n buffer: buffer,\n\n screen_iterator: ScreenIterator::new(buffer.get_screen())\n\n }\n\n }\n\n}\n\n\n\nimpl<'buffer> Iterator for SceneBufferIterator<'buffer> {\n","file_path":"src/core/scene.rs","rank":66,"score":26326.559688248748},{"content":"pub trait MutableSceneBuffer: ImmutableSceneBuffer + Send + Sync { //Internally mutable (Mutex), thread safe\n\n fn set_pixel_value(&self, pixel: Point2Int, color: &Color) -> Result<(), SceneBufferError>;\n\n fn accumulate_pixel_value(&self, pixel: Point2Int, color: &Color) -> Result<(), SceneBufferError>;\n\n fn reset_pixel(&self, pixel: Point2Int) -> Result<(), SceneBufferError>;\n\n\n\n fn layer_buffer(&self, place: SceneBufferLayering, rhs: &ImmutableSceneBuffer) -> Result<(), SceneBufferError> {\n\n let layerer = |self_color_option: Option<Color>, rhs_color_option: Option<Color>| {\n\n match place {\n\n SceneBufferLayering::Under => {\n\n match self_color_option {\n\n Some(_) => None,\n\n None => rhs_color_option\n\n }\n\n },\n\n SceneBufferLayering::Over => {\n\n match rhs_color_option {\n\n Some(color) => Some(color),\n\n None => None\n\n }\n\n }\n","file_path":"src/core/scene.rs","rank":67,"score":22976.396398707835},{"content":"use defs::{FloatType, Point3, Vector3, Matrix4};\n\nuse core::{Ray, Material};\n\nuse tools::{CompareWithTolerance};\n\nuse na::{Unit};\n\nuse na;\n\nuse uuid::{Uuid};\n\n\n\nstatic MIMIMUM_INTERSECTION_DISTANCE: FloatType = 0.000000001;\n\n\n\n#[derive(Debug)]\n\npub enum RayIntersectionError {\n\n NoRayTravelDistance,\n\n NoModelIdentifierPresent\n\n}\n\n\n\n#[derive(Clone)]\n\npub struct RayIntersection {\n\n normal : Unit<Vector3>,\n\n point : Point3,\n\n material_at_intersection : Material,\n","file_path":"src/core/intersection.rs","rank":68,"score":27.34003249949724},{"content":" }\n\n }\n\n\n\n pub fn new_model_identifier(normal: Vector3, point: Point3, ray: &Ray, material: Material, was_inside: bool, model_identier: Uuid) -> Result<Self, RayIntersectionError> {\n\n match Self::new(normal, point, ray, material, was_inside) {\n\n Ok(mut intersection) => {\n\n intersection.set_model_identifier_mut(Some(model_identier));\n\n Ok(intersection)\n\n },\n\n Err(err) => Err(err)\n\n }\n\n }\n\n\n\n pub fn get_intersection_point(&self) -> &Point3 {\n\n &self.point\n\n }\n\n\n\n pub fn get_normal_vector(&self) -> &Vector3 {\n\n &self.normal.as_ref()\n\n }\n","file_path":"src/core/intersection.rs","rank":69,"score":24.399726833506556},{"content":" distance_to_intersection : FloatType,\n\n was_inside : bool,\n\n ray : Ray,\n\n model_identifier : Option<Uuid>,\n\n}\n\n\n\nimpl RayIntersection {\n\n pub fn new(normal: Vector3, point: Point3, ray: &Ray, material: Material, was_inside: bool) -> Result<Self, RayIntersectionError> {\n\n let distance_to_intersection = na::distance(ray.get_origin(), &point);\n\n if distance_to_intersection.greater_eq_eps(&MIMIMUM_INTERSECTION_DISTANCE) {\n\n Ok (Self { normal: Unit::new_normalize(normal), \n\n point: point, \n\n ray: ray.clone(),\n\n material_at_intersection: material,\n\n distance_to_intersection: distance_to_intersection,\n\n was_inside: was_inside,\n\n model_identifier: None\n\n })\n\n } else {\n\n Err(RayIntersectionError::NoRayTravelDistance)\n","file_path":"src/core/intersection.rs","rank":70,"score":24.16072208070324},{"content":"\n\n pub fn was_inside(&self) -> bool {\n\n self.was_inside\n\n }\n\n\n\n pub fn get_transformed(self, transformation_matrix: &Matrix4) -> Result<Self, RayIntersectionError> {\n\n let point = Point3::from_homogeneous(transformation_matrix * self.point.to_homogeneous()).expect(\"Unhomogeneous transformed point\");\n\n let normal = Vector3::from_homogeneous(transformation_matrix * self.normal.to_homogeneous()).expect(\"Unhomogeneous transformed vector\");\n\n let ray = self.ray.get_transformed(transformation_matrix);\n\n\n\n Self::new(normal, point, &ray, self.material_at_intersection, self.was_inside)\n\n }\n\n\n\n pub fn get_model_identifier(&self) -> Option<&Uuid> {\n\n self.model_identifier.as_ref()\n\n }\n\n\n\n pub fn set_model_identifier_mut(&mut self, identifier: Option<Uuid>) {\n\n self.model_identifier = identifier;\n\n }\n","file_path":"src/core/intersection.rs","rank":71,"score":22.196828261431165},{"content":"use std::collections::{HashSet};\n\nuse std::sync::{Arc, Mutex};\n\nuse std;\n\n\n\nuse defs::{IntType, FloatType, Point2Int};\n\nuse core::{WorldViewTrait, Color, Screen, ScreenIterator, RayIntersection, Material,\n\n RayPropagator, BasicSceneBuffer, SceneBuffer, RayPropagatorError,\n\n RenderingTask, RenderingTaskProducer, ThreadSafeIterator, Ray, RayError};\n\n\n\nuse uuid::{Uuid};\n\nuse rand;\n\nuse rand::{Rng};\n\n\n\n#[derive(Clone, Copy)]\n\npub struct UuidColor {\n\n pub id: Uuid,\n\n pub color: Color\n\n}\n\n\n\nimpl UuidColor {\n","file_path":"src/basic/postprocessing/gi.rs","rank":72,"score":18.910656114825645},{"content":"use core::{LightSource, Ray, LightIntersection, RayIntersection, Color};\n\nuse defs::{Vector3, Point3, FloatType};\n\nuse na;\n\nuse na::{Unit};\n\n\n\npub struct DotLightSource {\n\n color: Color,\n\n intensity: FloatType,\n\n position: Point3,\n\n attenuation_const: FloatType,\n\n attenuation_linear: FloatType,\n\n attenuation_squared: FloatType\n\n}\n\n\n\nimpl DotLightSource {\n\n pub fn new_natural(color: Color, intensity: FloatType, position: Point3) -> Self {\n\n Self { color: color,\n\n intensity: intensity,\n\n position: position,\n\n attenuation_const: 0.0,\n","file_path":"src/basic/lightsource.rs","rank":73,"score":18.811544488110624},{"content":"\n\n pub fn set_model_identifier(&self, identifier: Option<Uuid>) -> Self {\n\n Self { model_identifier: identifier,\n\n ..self.clone() }\n\n }\n\n\n\n pub fn is_same_model_intersection(&self, rhs: &RayIntersection) -> Result<bool, RayIntersectionError> {\n\n if self.model_identifier.is_some() && rhs.model_identifier.is_some() {\n\n Ok(self.model_identifier.unwrap() == rhs.model_identifier.unwrap())\n\n } else {\n\n Err(RayIntersectionError::NoModelIdentifierPresent)\n\n }\n\n }\n\n}\n\n\n\n\n\n#[cfg(test)]\n\nmod tests {\n\n\n\n}","file_path":"src/core/intersection.rs","rank":74,"score":18.50554160455596},{"content":"use core::{Ray, RayIntersection, Color, RayCaster};\n\nuse defs::Vector3;\n\nuse na::{Unit};\n\n\n\npub struct LightIntersection {\n\n illumination: Color,\n\n light_direction: Unit<Vector3>\n\n}\n\n\n\nimpl LightIntersection {\n\n pub fn new(illumination: Color, light_direction: Vector3) -> Self {\n\n Self { illumination: illumination, \n\n light_direction : Unit::new_normalize(light_direction.normalize())}\n\n }\n\n\n\n pub fn get_shadowed(&self, shadowing: &Color) -> Self {\n\n Self { illumination: self.illumination * *shadowing,\n\n ..*self}\n\n }\n\n\n\n pub fn get_illumination(&self) -> &Color {\n\n &self.illumination\n\n }\n\n\n\n pub fn get_light_direction(&self) -> &Vector3 {\n\n &self.light_direction.as_ref()\n\n }\n\n}\n\n\n","file_path":"src/core/light.rs","rank":75,"score":18.353560271492064},{"content":"use defs::{FloatType, Vector3};\n\n\n\nuse core::{Ray, RayError, RayIntersection, ColorComponent};\n\nuse tools::{CompareWithTolerance};\n\n\n\nuse na;\n\nuse na::{Rotation3, Unit};\n\n\n\n\n\n#[derive(Debug)]\n\npub enum RayPropagatorError {\n\n RayRelated(RayError),\n\n NoRefraction,\n\n NotRefractiveMaterial\n\n}\n\n\n\npub struct RayPropagator<'intersection> {\n\n intersection: &'intersection RayIntersection,\n\n view_axis: Unit<Vector3>\n\n}\n","file_path":"src/core/propagation.rs","rank":76,"score":17.5279649299454},{"content":"use core::{Intersector, Model, RayIntersection, Ray};\n\n\n\nuse tools::CompareWithTolerance;\n\n\n\n\n\npub type ModelVec = Vec<Box<Model>>;\n\n\n\npub struct SimpleIntersector {\n\n models: ModelVec,\n\n}\n\n\n\nimpl SimpleIntersector {\n\n pub fn new(models: ModelVec) -> Self {\n\n Self { models: models}\n\n }\n\n}\n\n\n\nimpl Intersector for SimpleIntersector {\n\n fn get_intersections_reverse_ordered(&self, ray: &Ray) -> Vec<RayIntersection> { //Nearest elem is last\n\n let mut result: Vec<RayIntersection> = self.models.iter().filter_map(|model_box| model_box.get_intersection(ray)).collect();\n","file_path":"src/basic/intersector.rs","rank":77,"score":17.36360279178099},{"content":"use defs::{Point3, Vector3, Matrix3, Point2Int, FloatType, IntType};\n\nuse core::{Ray};\n\nuse tools::{CompareWithTolerance, Vector3Extensions};\n\nuse na::{Unit};\n\n\n\n#[derive(Debug)]\n\npub enum ScreenError {\n\n PixelOutOfBoundsError\n\n}\n\n\n\n\n\n#[derive(Copy, Clone)]\n\npub struct Screen {\n\n center: Point3,\n\n up: Unit<Vector3>,\n\n left: Unit<Vector3>,\n\n normal: Unit<Vector3>,\n\n to_plane_trasform_matrix: Matrix3,\n\n width: FloatType,\n\n height: FloatType,\n","file_path":"src/core/view.rs","rank":78,"score":15.637935707482075},{"content":"pub mod ray;\n\npub mod intersection;\n\npub mod model;\n\npub mod world;\n\npub mod light;\n\npub mod material;\n\npub mod color;\n\npub mod view;\n\npub mod propagation;\n\npub mod worldview;\n\npub mod execution;\n\npub mod scene;\n\n\n\npub use self::model::*;\n\npub use self::ray::*;\n\npub use self::intersection::*;\n\npub use self::model::*;\n\npub use self::world::*;\n\npub use self::light::*;\n\npub use self::material::*;\n\npub use self::color::*;\n\npub use self::view::*;\n\npub use self::propagation::*;\n\npub use self::worldview::*;\n\npub use self::execution::*;\n\npub use self::scene::*;","file_path":"src/core/mod.rs","rank":79,"score":15.356662896380548},{"content":"#[derive(Copy, Clone)]\n\npub struct Eye {\n\n position: Point3,\n\n direction: Unit<Vector3>,\n\n}\n\n\n\nimpl Eye {\n\n pub fn new(position: Point3, direction: Vector3) -> Self {\n\n Self { position: position,\n\n direction: Unit::new_normalize(direction)}\n\n }\n\n\n\n pub fn get_position(&self) -> &Point3 {\n\n &self.position\n\n }\n\n\n\n pub fn get_direction(&self) -> &Vector3 {\n\n &self.direction.as_ref()\n\n }\n\n}\n","file_path":"src/core/view.rs","rank":80,"score":15.006123199026991},{"content":" None\n\n }\n\n \n\n } else {\n\n None\n\n }\n\n }\n\n\n\n pub fn new_calculate_uuid_color_for_pixel(&self, coord: &Point2Int) -> Result<Option<UuidColor>, GlobalIlluminationShaderError> {\n\n if let Ok(ray) = self.worldview.get_view().get_ray_to_screen_coordinate(*coord) {\n\n if let Some(intersection) = self.worldview.get_ray_caster().cast_model_ray(&ray) {\n\n if let Some(model_identifier) = intersection.get_model_identifier() {\n\n if let Some(resulting_color) = self.trace_ray_and_calculate_color(&ray) {\n\n Ok(Some(UuidColor::new(*model_identifier, resulting_color)))\n\n } else {\n\n Ok(None)\n\n }\n\n } else {\n\n Err(GlobalIlluminationShaderError::NotExistingModelId)\n\n }\n","file_path":"src/basic/postprocessing/gi.rs","rank":81,"score":14.40077146232672},{"content":" use na::{Unit};\n\n use std::f64::consts::{PI};\n\n\n\n #[test]\n\n fn diffuse_direction_vector() {\n\n let ray = Ray::new(Point3::new(1.0, 0.0, 1.0), Vector3::new(-1.0, 0.0, -1.0));\n\n let intersection = RayIntersection::new(Vector3::new(0.0, 0.0, 1.0), Point3::new(0.0, 0.0, 0.0),\n\n &ray, Material::new_useless(), false).unwrap();\n\n\n\n let propagator = RayPropagator::new(&intersection);\n\n\n\n assert_relative_eq!(propagator.get_diffuse_direction_vector(PI/4.0, 0.0), Unit::new_normalize(Vector3::new(1.0, 0.0, 1.0)).unwrap());\n\n assert_relative_eq!(propagator.get_diffuse_direction_vector(PI/8.0, 0.0), Unit::new_normalize(Vector3::new((3.0*PI/8.0).tan(), 0.0, 1.0)).unwrap());\n\n assert_relative_eq!(propagator.get_diffuse_direction_vector(PI/8.0, PI/2.0), Unit::new_normalize(Vector3::new(0.0, (3.0*PI/8.0).tan(), 1.0)).unwrap());\n\n assert_relative_eq!(propagator.get_diffuse_direction_vector(PI/8.0, PI), Unit::new_normalize(Vector3::new(-((3.0*PI/8.0).tan()), 0.0, 1.0)).unwrap());\n\n }\n\n\n\n}\n","file_path":"src/core/propagation.rs","rank":82,"score":14.017011094078303},{"content":"use core::{RayCaster, RayIntersection, Color, ColorCalculator, Material,\n\n IlluminationCaster, LightIntersection, RayPropagator, RayPropagatorError};\n\n\n\npub struct SimpleColorCalculator {\n\n \n\n}\n\n\n\nimpl SimpleColorCalculator {\n\n pub fn new() -> Self {\n\n Self {}\n\n }\n\n\n\n fn get_ambient_color(&self, intersection: &RayIntersection) -> Color {\n\n let material = intersection.get_material();\n\n *material.get_ambient_color().unwrap_or(&Color::zero())\n\n }\n\n\n\n fn get_local_color(&self, intersection: &RayIntersection, illuminations: &Vec<LightIntersection>) -> Color { \n\n illuminations.iter().fold(Color::zero(), |acc, light_intersection|{\n\n let diffuse_color = Material::get_diffuse_illumination(intersection, light_intersection);\n","file_path":"src/basic/colorcalculator.rs","rank":83,"score":13.86269172632253},{"content":" \n\n result\n\n }\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 screen_get_intersected_pixel_hit_origin() {\n\n let test_screen = Screen::new_unit(Point3::origin(), Vector3::new(0.0, 0.0, 1.0), Vector3::new(0.0, 1.0, 0.0), 1.0, 1.0, 1000);\n\n let test_ray = Ray::new(Point3::new(0.0, 0.0, 1.0), Vector3::new(0.0, 0.0, -1.0));\n\n\n\n let result = test_screen.get_intersected_pixel(&test_ray).expect(\"Should have hit screen\");\n\n\n\n assert_eq!(result, Point2Int::new(500, 500));\n\n }\n\n\n","file_path":"src/core/view.rs","rank":84,"score":13.680130701785682},{"content":"\n\n pub fn get_distance_to_intersection(&self) -> FloatType {\n\n self.distance_to_intersection\n\n }\n\n\n\n pub fn get_intersector_ray(&self) -> &Ray {\n\n &self.ray\n\n }\n\n\n\n pub fn get_view_direction(&self) -> Vector3 {\n\n -self.ray.get_direction()\n\n }\n\n\n\n pub fn get_material(&self) -> &Material {\n\n &self.material_at_intersection\n\n }\n\n\n\n pub fn get_ray_medium(&self) -> Option<Material> {\n\n self.ray.get_medium()\n\n }\n","file_path":"src/core/intersection.rs","rank":85,"score":12.894069494684135},{"content":"use std::cmp;\n\n\n\nuse defs::{Point2Int, Vector2Int, IntType};\n\n\n\n#[derive(Debug)]\n\npub enum RectError {\n\n InvalidRect\n\n}\n\n\n\npub struct Rect {\n\n left_up: Point2Int,\n\n right_down: Point2Int,\n\n}\n\n\n\nimpl Rect {\n\n pub fn new(left_up: Point2Int, right_down: Point2Int) -> Result<Self, RectError> {\n\n let result = Self {\n\n left_up: left_up,\n\n right_down: right_down\n\n };\n","file_path":"src/basic/postprocessing/base.rs","rank":86,"score":12.507177361910445},{"content":" #[test]\n\n fn screen_get_intersected_pixel_hit_to_not_origin() {\n\n let test_screen = Screen::new_unit(Point3::origin(), Vector3::new(0.0, 0.0, 1.0), Vector3::new(0.0, 1.0, 0.0), 1.0, 1.0, 1000);\n\n let test_ray = Ray::new(Point3::new(0.25, 0.25, 1.0), Vector3::new(0.0, 0.0, -1.0));\n\n\n\n let result = test_screen.get_intersected_pixel(&test_ray).expect(\"Should have hit screen\");\n\n\n\n assert_eq!(result, Point2Int::new(250, 250));\n\n }\n\n\n\n #[test]\n\n fn screen_get_intersected_pixel_hit_not_to_origin_not_perpendicular() {\n\n let target_on_screen_point = Point3::new(0.25, 0.25, 0.0);\n\n let eye_point = Point3::new(0.0, 0.0, -1.0);\n\n let eye_ray_direction = (target_on_screen_point - eye_point).normalize();\n\n\n\n let test_screen = Screen::new_unit(Point3::origin(), Vector3::new(0.0, 0.0, 1.0), Vector3::new(0.0, 1.0, 0.0), 1.0, 1.0, 1000);\n\n let test_ray = Ray::new(eye_point + (eye_ray_direction * 5.0), -eye_ray_direction);\n\n\n\n let result = test_screen.get_intersected_pixel(&test_ray).expect(\"Should have hit screen\");\n","file_path":"src/core/view.rs","rank":87,"score":12.485939385673168},{"content":" }\n\n\n\n pub fn get_pixel_index_by_screen_coord(&self, coord: &Point2Int) -> Result<IntType, ScreenError> {\n\n if self.check_pixel_bounds(coord) {\n\n Ok(coord.x + self.horizontal_resolution * coord.y)\n\n } else {\n\n Err(ScreenError::PixelOutOfBoundsError)\n\n }\n\n }\n\n\n\n fn get_screen_plane_intersection_point(&self, ray: &Ray) -> Option<Point3> {\n\n let origin = ray.get_origin();\n\n let dir = ray.get_direction();\n\n\n\n let u = self.normal.dot(dir);\n\n if !u.near_zero_eps() {\n\n let k = self.normal.x * self.center.x + self.normal.y * self.center.y + self.normal.z * self.center.z;\n\n let s = self.normal.x * origin.x + self.normal.y * origin.y + self.normal.z * origin.z;\n\n let t = (k-s) / u;\n\n if t.greater_eq_eps(&0.0) {\n","file_path":"src/core/view.rs","rank":88,"score":12.285608300187251},{"content":"use core::{RayIntersection, RayCaster, LightIntersection, LightSource, Illuminator};\n\n\n\npub type LightSourceVec = Vec<Box<LightSource>>;\n\n\n\npub struct SimpleIlluminator {\n\n lights : LightSourceVec\n\n}\n\n\n\nimpl SimpleIlluminator {\n\n pub fn new(lights: LightSourceVec) -> Self {\n\n Self { lights: lights}\n\n }\n\n}\n\n\n\nimpl Illuminator for SimpleIlluminator {\n\n fn get_illumination_at(&self, intersection: &RayIntersection, illumination_caster: &RayCaster) -> Vec<LightIntersection> {\n\n self.lights.iter().filter_map(|light| {\n\n match light.get_ray_to_intersection(intersection) {\n\n None => None,\n\n Some(ray) => {\n","file_path":"src/basic/illuminator.rs","rank":89,"score":12.16001220351592},{"content":"use defs::{IntType, FloatType, Point2Int};\n\n\n\nuse core::{Screen, Color, ImmutableSceneBuffer, SceneBufferError};\n\nuse basic::{Rect, RectIterator};\n\nuse tools::{CompareWithTolerance};\n\n\n\npub struct MedianFilter<'obuffer> {\n\n original_buffer: &'obuffer ImmutableSceneBuffer,\n\n rect_radius: IntType,\n\n}\n\n\n\nimpl<'obuffer> MedianFilter<'obuffer> {\n\n pub fn new(original_buffer: &'obuffer ImmutableSceneBuffer, rect_radius: IntType) -> Self {\n\n Self {\n\n original_buffer: original_buffer,\n\n rect_radius: rect_radius\n\n }\n\n }\n\n\n\n fn get_vector_median(vector: &mut Vec<FloatType>) -> Option<FloatType> {\n","file_path":"src/basic/postprocessing/filter.rs","rank":90,"score":12.02106609319575},{"content":"use std::cmp::Ordering;\n\nuse defs::{Vector3, FloatType, IntType, FLOAT_ULPS_TOLERANCE};\n\nuse ::na;\n\nuse ::numt::Num;\n\nuse ::numt::float::Float;\n\nuse ::flcmp::ApproxOrdUlps;\n\n\n\n\n","file_path":"src/tools.rs","rank":91,"score":11.81753894700585},{"content":"pub type FloatType = f64;\n\npub type IntType = i32;\n\n\n\npub type VectorRow4 = super::na::core::Matrix1x4<FloatType>;\n\npub type VectorColumn4 = super::na::core::Vector4<FloatType>;\n\n\n\npub type Matrix4 = super::na::core::Matrix4<FloatType>;\n\npub type Matrix3 = super::na::core::Matrix3<FloatType>;\n\n\n\npub type Point3 = super::na::Point3<FloatType>;\n\npub type Vector3 = super::na::core::Vector3<FloatType>;\n\n\n\npub type Point2 = super::na::Point2<FloatType>;\n\npub type Vector2 = super::na::Vector2<FloatType>;\n\n\n\npub type Point2Int = super::na::Point2<IntType>;\n\npub type Vector2Int = super::na::Vector2<IntType>;\n\n\n\npub static FLOAT_ULPS_TOLERANCE: i64 = 65536;","file_path":"src/defs.rs","rank":92,"score":11.675129101599978},{"content":"\n\n assert_eq!(result, Point2Int::new(250, 250));\n\n }\n\n\n\n #[test]\n\n fn screen_get_intersected_pixel_miss() {\n\n let test_screen = Screen::new_unit(Point3::origin(), Vector3::new(0.0, 0.0, 1.0), Vector3::new(0.0, 1.0, 0.0), 1.0, 1.0, 1000);\n\n let test_ray = Ray::new(Point3::new(0.6, 0.6, 1.0), Vector3::new(0.0, 0.0, -1.0));\n\n\n\n assert!(test_screen.get_intersected_pixel(&test_ray).is_none());\n\n }\n\n}","file_path":"src/core/view.rs","rank":93,"score":11.636557993869655},{"content":"\n\n#[derive(Debug)]\n\npub enum ViewError {\n\n ScreenRelated(ScreenError)\n\n}\n\n\n\n#[derive(Copy, Clone)]\n\npub struct View {\n\n screen: Screen,\n\n eye: Eye\n\n}\n\n\n\nimpl View {\n\n pub fn new(screen: Screen, eye: Eye) -> Self {\n\n Self { screen: screen,\n\n eye: eye}\n\n }\n\n\n\n pub fn new_unit(eye_position: Point3, eye_direction: Vector3, screen_up: Vector3, screen_width_to_height_ratio: FloatType, screen_height: FloatType, screen_v_res: IntType) -> Self{\n\n let eye_unit_direction = Unit::new_normalize(eye_direction);\n","file_path":"src/core/view.rs","rank":94,"score":11.406981341932742},{"content":"\n\n rotate_around_normal * rotate_to_normal * view\n\n }\n\n\n\n pub fn get_diffuse_direction_ray(&self, pitch: FloatType, yaw: FloatType) -> Result<Ray, RayPropagatorError> {\n\n Ray::continue_ray_from_intersection(self.intersection, self.get_diffuse_direction_vector(pitch, yaw)).map_err(|ray_error| {\n\n match ray_error {\n\n RayError::DepthLimitReached => RayPropagatorError::RayRelated(ray_error),\n\n _ => panic!(\"RayPropagator encountered unhandleable RayError\")\n\n }\n\n })\n\n }\n\n}\n\n\n\n\n\n#[cfg(test)]\n\nmod tests {\n\n use super::*;\n\n use defs::{Point3};\n\n use core::{Material};\n","file_path":"src/core/propagation.rs","rank":95,"score":11.387437710618428},{"content":" pub fn new(id: Uuid, color: Color) -> Self {\n\n Self {\n\n id: id,\n\n color: color\n\n }\n\n }\n\n}\n\n\n\n#[derive(Debug)]\n\npub enum GlobalIlluminationShaderError {\n\n InvalidCoord,\n\n MutexLockError,\n\n NotExistingModelId\n\n}\n\n\n","file_path":"src/basic/postprocessing/gi.rs","rank":96,"score":10.97825651161935},{"content":"use defs::{Point2Int};\n\nuse core::{RayCaster, IlluminationCaster, View, Color, RayIntersection, Screen, ScreenIterator};\n\nuse std::sync::{Arc, Mutex};\n\n\n\n\n\n#[derive(Debug)]\n\npub enum SceneError {\n\n NothingIntersected,\n\n InvalidInputCoord\n\n}\n\n\n","file_path":"src/core/scene.rs","rank":97,"score":10.974037960925195},{"content":"use core::{RenderingTaskProducer, RenderingTask, Screen, SceneError, WorldViewTrait, ThreadSafeIterator};\n\nuse defs::{Point2Int, IntType};\n\nuse std::sync::{Arc, Mutex};\n\n\n\npub struct WorldViewTaskProducer {\n\n worldview: Arc<WorldViewTrait>,\n\n}\n\n\n\nimpl WorldViewTaskProducer {\n\n pub fn new(worldview: Arc<WorldViewTrait>) -> Box<RenderingTaskProducer> {\n\n Box::new(Self {\n\n worldview: worldview\n\n })\n\n } \n\n}\n\n\n\nimpl RenderingTaskProducer for WorldViewTaskProducer {\n\n fn create_task_iterator(self: Box<Self>) -> Box<ThreadSafeIterator<Item=Box<RenderingTask>>> {\n\n Box::new(WorldViewTaskIterator::new(Arc::clone(&self.worldview)))\n\n }\n","file_path":"src/basic/rendering.rs","rank":98,"score":10.261387907191448},{"content":" None\n\n }\n\n}\n\n\n\n\n\npub struct SpotLightSource {\n\n dot_light: DotLightSource,\n\n direction: Unit<Vector3>,\n\n max_angle_rad: FloatType\n\n}\n\n\n\nimpl SpotLightSource {\n\n pub fn new(dot_light: DotLightSource, direction: Vector3, max_angle_radian: FloatType) -> Self {\n\n Self { dot_light: dot_light,\n\n direction: Unit::new_normalize(direction),\n\n max_angle_rad: max_angle_radian}\n\n }\n\n}\n\n\n\nimpl LightSource for SpotLightSource {\n","file_path":"src/basic/lightsource.rs","rank":99,"score":10.060635023441282}],"string":"[\n {\n \"content\": \"pub trait Model: Send + Sync {\\n\\n fn get_intersection(&self, ray: &Ray) -> Option<RayIntersection>;\\n\\n}\\n\\n\\n\\npub struct ModelViewModelWrapper<T: Model> {\\n\\n wrapped_model: T,\\n\\n tf_matrix: Matrix4,\\n\\n inverse_tf_matrix: Matrix4\\n\\n}\\n\\n\\n\\nimpl<T: Model> ModelViewModelWrapper<T> {\\n\\n pub fn new(model: T, model_view_matrix: Matrix4) -> Self {\\n\\n Self { wrapped_model: model,\\n\\n inverse_tf_matrix: model_view_matrix.try_inverse().expect(\\\"Uninvertable Model View Matrix\\\"),\\n\\n tf_matrix: model_view_matrix\\n\\n }\\n\\n }\\n\\n\\n\\n pub fn new_identity(model: T) -> Self {\\n\\n Self { wrapped_model: model,\\n\",\n \"file_path\": \"src/core/model.rs\",\n \"rank\": 0,\n \"score\": 80912.9031832758\n },\n {\n \"content\": \"#[derive(Clone, Copy, Debug)]\\n\\nstruct RayState {\\n\\n distance_to_origin : FloatType,\\n\\n depth_counter : i32,\\n\\n depth_limit: Option<u32>,\\n\\n}\\n\\n\\n\\nimpl RayState {\\n\\n pub fn get_continuation(input: &Self, distance_to_intersection: FloatType) -> Result<Self, RayError> {\\n\\n match input.depth_limit {\\n\\n Some(depth_limit) => {\\n\\n if depth_limit >= 1 {\\n\\n Ok (Self { distance_to_origin: input.distance_to_origin + distance_to_intersection,\\n\\n depth_counter: input.depth_counter + 1,\\n\\n depth_limit: Some(depth_limit - 1),\\n\\n ..*input\\n\\n })\\n\\n } else {\\n\\n Err(RayError::DepthLimitReached)\\n\\n }\\n\\n },\\n\",\n \"file_path\": \"src/core/ray.rs\",\n \"rank\": 1,\n \"score\": 80476.82722555535\n },\n {\n \"content\": \"#[derive(Debug, Copy, Clone)]\\n\\nstruct FresnelData {\\n\\n pub n: FresnelIndex,\\n\\n pub n_inverse: FresnelIndex,\\n\\n pub n_avg: FloatType,\\n\\n pub n_imaginary: FresnelIndex,\\n\\n pub n_imaginary_inverse: FresnelIndex,\\n\\n pub n_imaginary_avg: FloatType,\\n\\n pub f0: FresnelIndex,\\n\\n pub f0_avg: FloatType,\\n\\n pub f0_inverse: FresnelIndex,\\n\\n pub f0_inverse_avg: FloatType\\n\\n}\\n\\n\\n\\nimpl FresnelData {\\n\\n fn new(real: FresnelIndex, imaginary: FresnelIndex) -> Self {\\n\\n let mut f0 = ((real - FresnelIndex::one()) * (real - FresnelIndex::one())) + imaginary * imaginary;\\n\\n f0 *= (((real + FresnelIndex::one()) * (real + FresnelIndex::one())) + imaginary * imaginary).recip();\\n\\n\\n\\n let mut f0_inverse = ((imaginary - FresnelIndex::one()) * (imaginary - FresnelIndex::one())) + imaginary * imaginary;\\n\\n f0_inverse *= (((imaginary + FresnelIndex::one()) * (imaginary + FresnelIndex::one())) + imaginary * imaginary).recip(); \\n\",\n \"file_path\": \"src/core/material.rs\",\n \"rank\": 2,\n \"score\": 71990.14834633234\n },\n {\n \"content\": \"pub trait Vector3Extensions {\\n\\n fn same_direction_as(&self, rhs: &Vector3) -> bool;\\n\\n fn length(&self) -> FloatType;\\n\\n}\\n\\n\\n\\nimpl Vector3Extensions for Vector3 {\\n\\n fn same_direction_as(&self, rhs: &Vector3) -> bool {\\n\\n let closed_angle = na::angle(self, &rhs);\\n\\n closed_angle.near_zero_eps()\\n\\n }\\n\\n\\n\\n fn length(&self) -> FloatType {\\n\\n let mut result: FloatType = 0.0;\\n\\n\\n\\n for item in self.iter() {\\n\\n result += item.powi(2);\\n\\n }\\n\\n\\n\\n result.sqrt()\\n\\n }\\n\\n}\\n\\n\\n\\n\\n\",\n \"file_path\": \"src/tools.rs\",\n \"rank\": 3,\n \"score\": 63772.52006160385\n },\n {\n \"content\": \"pub trait Intersector: Send + Sync { \\n\\n fn get_intersections_reverse_ordered(&self, ray: &Ray) -> Vec<RayIntersection>;\\n\\n fn get_nearest_intersection(&self, ray: &Ray) -> Option<RayIntersection>;\\n\\n}\\n\\n\\n\\n\\n\\n#[cfg(test)]\\n\\nmod tests {\\n\\n use super::*;\\n\\n use core::{Material};\\n\\n use defs::{Point3};\\n\\n use std;\\n\\n\\n\\n struct DummyModel {\\n\\n\\n\\n }\\n\\n\\n\\n impl DummyModel {\\n\\n pub fn new() -> Self {\\n\\n Self {\\n\",\n \"file_path\": \"src/core/model.rs\",\n \"rank\": 4,\n \"score\": 56917.00136309267\n },\n {\n \"content\": \"pub trait RayCaster: Send + Sync {\\n\\n fn cast_ray(&self, ray: &Ray) -> Option<Color>;\\n\\n fn cast_colored_light_ray(&self, ray: &Ray, intersection: &RayIntersection) -> Option<Color>;\\n\\n fn cast_model_ray(&self, ray: &Ray) -> Option<RayIntersection>;\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/core/world.rs\",\n \"rank\": 5,\n \"score\": 55142.77990105537\n },\n {\n \"content\": \"struct OrderedTaskIteratorInternals {\\n\\n pub producers : Vec<Box<RenderingTaskProducer>>,\\n\\n pub current_terator : Option<Box<ThreadSafeIterator<Item=Box<RenderingTask>>>>\\n\\n}\\n\\n\\n\\nimpl OrderedTaskIteratorInternals {\\n\\n pub fn new(mut producers : Vec<Box<RenderingTaskProducer>>) -> Self {\\n\\n producers.reverse();\\n\\n if let Some(first_producer) = producers.pop() {\\n\\n Self {\\n\\n producers: producers,\\n\\n current_terator: Some(first_producer.create_task_iterator())\\n\\n }\\n\\n } else {\\n\\n Self {\\n\\n producers: producers,\\n\\n current_terator: None\\n\\n }\\n\\n }\\n\\n }\\n\",\n \"file_path\": \"src/core/execution.rs\",\n \"rank\": 6,\n \"score\": 43371.12808317646\n },\n {\n \"content\": \"struct GlobalIlluminationShaderState {\\n\\n pub buffer: Vec<Option<UuidColor>>,\\n\\n pub visible: HashSet<Uuid>\\n\\n}\\n\\n\\n\\nimpl GlobalIlluminationShaderState {\\n\\n pub fn new(input: Vec<Option<UuidColor>>) -> Self {\\n\\n Self {\\n\\n buffer: input,\\n\\n visible: HashSet::new()\\n\\n }\\n\\n }\\n\\n\\n\\n pub fn set_color(&mut self, index: usize, input: UuidColor) {\\n\\n self.visible.insert(input.id.clone());\\n\\n self.buffer[index] = Some(input);\\n\\n }\\n\\n}\\n\\n\\n\\npub struct GlobalIlluminationShader {\\n\",\n \"file_path\": \"src/basic/postprocessing/gi.rs\",\n \"rank\": 7,\n \"score\": 42357.04760783042\n },\n {\n \"content\": \"pub trait OrderingQuery {\\n\\n fn is_less(self) -> bool;\\n\\n fn is_equal(self) -> bool;\\n\\n fn is_greater(self) -> bool;\\n\\n}\\n\\n\\n\\nimpl OrderingQuery for Ordering {\\n\\n fn is_less(self) -> bool {\\n\\n match self {\\n\\n Ordering::Less => true,\\n\\n _ => false\\n\\n }\\n\\n }\\n\\n\\n\\n fn is_equal(self) -> bool {\\n\\n match self {\\n\\n Ordering::Equal => true,\\n\\n _ => false\\n\\n }\\n\\n }\\n\\n\\n\\n fn is_greater(self) -> bool {\\n\\n match self {\\n\\n Ordering::Greater => true,\\n\\n _ => false\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/tools.rs\",\n \"rank\": 8,\n \"score\": 37086.61993239532\n },\n {\n \"content\": \"pub trait Between<T: Num> {\\n\\n fn between(&self, less: &T, more: &T) -> bool;\\n\\n}\\n\\n\\n\\nimpl Between<FloatType> for FloatType {\\n\\n fn between(&self, less: &FloatType, more: &FloatType) -> bool {\\n\\n less.greater_eq_eps(&self) && more.less_eq_eps(&self)\\n\\n }\\n\\n}\\n\\n\\n\\nimpl Between<IntType> for IntType {\\n\\n fn between(&self, less: &IntType, more: &IntType) -> bool {\\n\\n less <= self && self <= more\\n\\n }\\n\\n}\",\n \"file_path\": \"src/tools.rs\",\n \"rank\": 9,\n \"score\": 35415.056949093836\n },\n {\n \"content\": \"pub trait Scene: Send + Sync {\\n\\n fn get_pixel_color(&self, pixel: Point2Int) -> Result<Color, SceneError>;\\n\\n fn get_pixel_intersection(&self, pixel: Point2Int) -> Result<RayIntersection, SceneError>;\\n\\n fn get_view(&self) -> &View;\\n\\n fn get_ray_caster(&self) -> &RayCaster;\\n\\n fn get_illumination_caster(&self) -> &IlluminationCaster;\\n\\n}\\n\\n\\n\\n#[derive(Debug)]\\n\\npub enum SceneBufferError {\\n\\n InvalidInputCoord,\\n\\n MutexLockError,\\n\\n OtherBufferNotSameSize\\n\\n}\\n\\n\\n\\n#[derive(Debug)]\\n\\npub enum SceneBufferLayering {\\n\\n Under,\\n\\n Over\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/core/scene.rs\",\n \"rank\": 10,\n \"score\": 33135.372075716026\n },\n {\n \"content\": \"pub trait Illuminator: Send + Sync {\\n\\n fn get_illumination_at(&self, intersection: &RayIntersection, illumination_caster: &RayCaster) -> Vec<LightIntersection>;\\n\\n}\",\n \"file_path\": \"src/core/light.rs\",\n \"rank\": 11,\n \"score\": 33135.372075716026\n },\n {\n \"content\": \"pub trait CompareWithTolerance<T: Float> {\\n\\n fn compare_eps(&self, rhs: &T) -> Ordering;\\n\\n fn less_eps(&self, rhs: &T) -> bool;\\n\\n fn less_eq_eps(&self, rhs: &T) -> bool;\\n\\n fn equal_eps(&self, rhs: &T) -> bool;\\n\\n fn greater_eps(&self, rhs: &T) -> bool;\\n\\n fn greater_eq_eps(&self, rhs: &T) -> bool;\\n\\n fn near_zero_eps(&self) -> bool;\\n\\n}\\n\\n\\n\\nimpl CompareWithTolerance<FloatType> for FloatType {\\n\\n fn compare_eps(&self, rhs: &FloatType) -> Ordering {\\n\\n self.approx_cmp_ulps(&rhs, FLOAT_ULPS_TOLERANCE)\\n\\n }\\n\\n\\n\\n fn less_eps(&self, rhs: &FloatType) -> bool {\\n\\n self.approx_cmp_ulps(&rhs, FLOAT_ULPS_TOLERANCE) == Ordering::Less\\n\\n }\\n\\n\\n\\n fn less_eq_eps(&self, rhs: &FloatType) -> bool {\\n\",\n \"file_path\": \"src/tools.rs\",\n \"rank\": 12,\n \"score\": 33135.372075716026\n },\n {\n \"content\": \"pub trait RenderingTask: Send + Sync {\\n\\n fn execute(self: Box<Self>);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/core/execution.rs\",\n \"rank\": 13,\n \"score\": 32138.37131194181\n },\n {\n \"content\": \"pub trait ColorCalculator: Send + Sync {\\n\\n fn get_color(&self, itersection: &RayIntersection, ray_caster: &RayCaster, illumination_caster: &IlluminationCaster) -> Option<Color>;\\n\\n}\\n\\n\\n\\npub struct World<IntersectorType, ColorCalculatorType, IlluminatorType> {\\n\\n intersector : IntersectorType,\\n\\n color_calculator : ColorCalculatorType,\\n\\n illuminator: IlluminatorType,\\n\\n depth_limit : i32,\\n\\n}\\n\\n\\n\\nimpl<IntersectorType: Intersector + Send + Sync,\\n\\n ColorCalculatorType: ColorCalculator + Send + Sync,\\n\\n IlluminatorType : Illuminator + Send + Sync> \\n\\n World<IntersectorType, ColorCalculatorType, IlluminatorType> {\\n\\n \\n\\n pub fn new(intersector: IntersectorType, colorcalc: ColorCalculatorType, illuminator: IlluminatorType, ray_depth_limit: i32) -> Self {\\n\\n Self {intersector: intersector,\\n\\n color_calculator: colorcalc,\\n\\n illuminator: illuminator,\\n\",\n \"file_path\": \"src/core/world.rs\",\n \"rank\": 14,\n \"score\": 32138.37131194181\n },\n {\n \"content\": \"pub trait IlluminationCaster: Send + Sync {\\n\\n fn get_illumination_at(&self, intersection: &RayIntersection) -> Vec<LightIntersection>;\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/core/world.rs\",\n \"rank\": 15,\n \"score\": 32138.37131194181\n },\n {\n \"content\": \"pub trait LightSource: Send + Sync {\\n\\n fn get_ray_to_intersection(&self, intersection: &RayIntersection) -> Option<Ray>;\\n\\n fn get_illumination_at(&self, intersection: &RayIntersection) -> Option<LightIntersection>;\\n\\n fn get_intersection(&self, ray: &Ray) -> Option<LightIntersection>;\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/core/light.rs\",\n \"rank\": 16,\n \"score\": 32138.37131194181\n },\n {\n \"content\": \"pub trait ThreadSafeIterator: Send + Sync {\\n\\n type Item;\\n\\n\\n\\n fn next(&self) -> Option<Self::Item>;\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/core/execution.rs\",\n \"rank\": 17,\n \"score\": 31221.324790793806\n },\n {\n \"content\": \"pub trait RenderingTaskProducer: Send + Sync {\\n\\n fn create_task_iterator(self: Box<Self>) -> Box<ThreadSafeIterator<Item=Box<RenderingTask>>>;\\n\\n}\\n\\n\\n\\npub struct OrderedTaskProducers {\\n\\n producers: Option<Vec<Box<RenderingTaskProducer>>>\\n\\n}\\n\\n\\n\\nimpl OrderedTaskProducers {\\n\\n pub fn new(producers: Vec<Box<RenderingTaskProducer>>) -> Box<RenderingTaskProducer> {\\n\\n Box::new(Self {\\n\\n producers: Some(producers)\\n\\n })\\n\\n }\\n\\n}\\n\\n\\n\\nimpl RenderingTaskProducer for OrderedTaskProducers {\\n\\n fn create_task_iterator(mut self: Box<Self>) -> Box<ThreadSafeIterator<Item=Box<RenderingTask>>> {\\n\\n Box::new(OrderedTaskIterator::new(self.producers.take().expect(\\\"OrderedTaskProducers should have not been created empty\\\")))\\n\\n }\\n\\n}\\n\\n\\n\\n\\n\",\n \"file_path\": \"src/core/execution.rs\",\n \"rank\": 18,\n \"score\": 31221.324790793806\n },\n {\n \"content\": \"pub trait ImmutableSceneBuffer: Send + Sync {\\n\\n fn get_pixel_value(&self, pixel: Point2Int) -> Result<Option<Color>, SceneBufferError>;\\n\\n fn get_screen(&self) -> &Screen;\\n\\n\\n\\n fn is_same_size_buffer(&self, rhs: &ImmutableSceneBuffer) -> bool {\\n\\n self.get_screen().get_resolution() == rhs.get_screen().get_resolution()\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/core/scene.rs\",\n \"rank\": 19,\n \"score\": 31221.324790793806\n },\n {\n \"content\": \"pub trait WorldViewTrait: Scene + SceneBuffer {\\n\\n\\n\\n}\\n\\n\\n\\npub struct WorldView<WorldT> {\\n\\n world: Arc<WorldT>,\\n\\n view: View,\\n\\n result_buffer: BasicSceneBuffer,\\n\\n}\\n\\n\\n\\nimpl<WorldT> WorldView<WorldT>\\n\\n where WorldT: RayCaster + IlluminationCaster + Send + Sync\\n\\n{\\n\\n #[allow(dead_code)]\\n\\n pub fn new(world: WorldT, view: View) -> Self {\\n\\n let screen_clone = view.get_screen().clone();\\n\\n Self { world: Arc::new(world),\\n\\n view: view,\\n\\n result_buffer: BasicSceneBuffer::new(screen_clone) }\\n\\n }\\n\",\n \"file_path\": \"src/core/worldview.rs\",\n \"rank\": 20,\n \"score\": 30374.985428502172\n },\n {\n \"content\": \" pub fn get_depth_counter(&self) -> i32 {\\n\\n self.depth_counter\\n\\n }\\n\\n}\\n\\n\\n\\n#[derive(Debug, Clone)]\\n\\npub struct Ray {\\n\\n direction : Unit<Vector3>,\\n\\n origin : Point3,\\n\\n state : RayState,\\n\\n mediums : Option<VecDeque<Material>>, \\n\\n}\\n\\n\\n\\nimpl Ray {\\n\\n pub fn new(origin: Point3, dir: Vector3) -> Self {\\n\\n Self { direction: Unit::new_normalize(dir),\\n\\n origin: origin,\\n\\n mediums: None,\\n\\n state: RayState { distance_to_origin: 0.0,\\n\\n depth_counter: 0,\\n\",\n \"file_path\": \"src/core/ray.rs\",\n \"rank\": 21,\n \"score\": 29102.02886649265\n },\n {\n \"content\": \"use defs::{Vector3, Point3, FloatType, Matrix4};\\n\\nuse std::collections::{VecDeque};\\n\\nuse core::{RayIntersection, Material};\\n\\nuse tools::Vector3Extensions;\\n\\nuse na::{Unit};\\n\\n\\n\\n\\n\\n#[derive(Debug)]\\n\\npub enum RayError {\\n\\n DepthLimitReached,\\n\\n InvalidContinuationDirection,\\n\\n}\\n\\n\\n\\n\\n\\n#[derive(Clone, Copy, Debug)]\\n\",\n \"file_path\": \"src/core/ray.rs\",\n \"rank\": 22,\n \"score\": 29098.02411890841\n },\n {\n \"content\": \" depth_limit: None }\\n\\n }\\n\\n }\\n\\n\\n\\n pub fn new_depth_limited(origin: Point3, dir: Vector3, depth_limit: u32) -> Self {\\n\\n Self { direction: Unit::new_normalize(dir),\\n\\n origin: origin,\\n\\n mediums: None,\\n\\n state: RayState { distance_to_origin: 0.0,\\n\\n depth_counter: 0,\\n\\n depth_limit: Some(depth_limit) }\\n\\n }\\n\\n }\\n\\n\\n\\n pub fn new_single_shot(origin: Point3, dir: Vector3) -> Self {\\n\\n Self::new_depth_limited(origin, dir, 1)\\n\\n }\\n\\n\\n\\n pub fn set_maximum_depth_limited(&self, maximum_depth_limit: u32) -> Self {\\n\\n Self {\\n\",\n \"file_path\": \"src/core/ray.rs\",\n \"rank\": 23,\n \"score\": 29097.700837259017\n },\n {\n \"content\": \" pub fn new_reversed_ray(ray: &Ray) -> Self {\\n\\n Self { direction: (-ray.direction),\\n\\n ..ray.clone() }\\n\\n }\\n\\n\\n\\n pub fn get_transformed(&self, transformation_matrix: &Matrix4) -> Self {\\n\\n let origin = self.origin.to_homogeneous();\\n\\n let direction = self.direction.to_homogeneous();\\n\\n\\n\\n Self { origin: Point3::from_homogeneous(transformation_matrix * origin).expect(\\\"Unhomogeneous transformed point\\\"),\\n\\n direction: Unit::new_normalize(Vector3::from_homogeneous(transformation_matrix * direction).expect(\\\"Unhomogeneous transformed vector\\\")),\\n\\n ..self.clone()\\n\\n }\\n\\n }\\n\\n\\n\\n pub fn get_origin(&self) -> &Point3 {\\n\\n &self.origin\\n\\n }\\n\\n\\n\\n pub fn get_direction(&self) -> &Vector3 {\\n\",\n \"file_path\": \"src/core/ray.rs\",\n \"rank\": 24,\n \"score\": 29095.925952724756\n },\n {\n \"content\": \" }\\n\\n\\n\\n pub fn continue_ray_from_previous(previous_ray: &Ray, origin: Point3, direction: Vector3) -> Result<Self, RayError> {\\n\\n let calculated_direction = origin - previous_ray.get_origin();\\n\\n\\n\\n match RayState::get_continuation(&previous_ray.state, calculated_direction.length()) {\\n\\n Ok (continued_state) => {\\n\\n Ok (Self { direction: Unit::new_normalize(direction),\\n\\n origin: origin,\\n\\n state: continued_state,\\n\\n ..previous_ray.clone()})\\n\\n },\\n\\n Err(e) => Err(e)\\n\\n }\\n\\n }\\n\\n\\n\\n fn get_state(&self) -> &RayState {\\n\\n &self.state\\n\\n }\\n\\n\\n\",\n \"file_path\": \"src/core/ray.rs\",\n \"rank\": 25,\n \"score\": 29092.606918580026\n },\n {\n \"content\": \" }\\n\\n }\\n\\n}\\n\\n\\n\\n\\n\\n#[cfg(test)]\\n\\nmod tests {\\n\\n use super::*;\\n\\n use core::{RayIntersection, Material};\\n\\n\\n\\n #[test]\\n\\n fn test_ray_new1_assignment() {\\n\\n let test_ray = Ray::new(Point3::new(0.0, 0.0, 0.0), Vector3::new(1.0, 0.0, 0.0));\\n\\n\\n\\n assert_eq!(test_ray.get_distance_to_origin(), 0.0);\\n\\n assert_eq!(test_ray.get_depth_counter(), 0);\\n\\n }\\n\\n\\n\\n #[test]\\n\\n fn test_continue_ray_from_intersection() {\\n\",\n \"file_path\": \"src/core/ray.rs\",\n \"rank\": 26,\n \"score\": 29092.561495760012\n },\n {\n \"content\": \" let initial_ray = Ray::new(Point3::new(0.0, 0.0, 0.0), Vector3::new(1.0, 0.0, 0.0));\\n\\n let intersection = RayIntersection::new(Vector3::new(0.0, 0.0, 1.0),\\n\\n Point3::new(1.0, 0.0, 0.0),\\n\\n &initial_ray,\\n\\n Material::new_useless(),\\n\\n false).unwrap();\\n\\n let continued_ray = Ray::continue_ray_from_intersection(&intersection, Vector3::new(0.0, 1.0, 0.0)).unwrap();\\n\\n\\n\\n assert_eq!(continued_ray.get_depth_counter(), 1);\\n\\n assert_eq!(continued_ray.get_distance_to_origin(), 1.0);\\n\\n }\\n\\n\\n\\n #[test]\\n\\n fn test_depth_limits() {\\n\\n let initial_ray = Ray::new_depth_limited(Point3::new(0.0, 0.0, 0.0), Vector3::new(1.0, 0.0, 0.0), 1);\\n\\n let continue_1 = Ray::continue_ray_from_previous(&initial_ray, Point3::new(1.0, 0.0, 0.0), Vector3::new(1.0, 0.0, 0.0)).expect(\\\"Ray should still continue\\\");\\n\\n let continue_2 = Ray::continue_ray_from_previous(&continue_1, Point3::new(2.0, 0.0, 0.0), Vector3::new(1.0, 0.0, 0.0));\\n\\n if !continue_2.is_err() {\\n\\n panic!(\\\"Ray should not continue further\\\");\\n\\n }\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/core/ray.rs\",\n \"rank\": 27,\n \"score\": 29090.91059908333\n },\n {\n \"content\": \" } else {\\n\\n result.push_medium(*intersection.get_material());\\n\\n }\\n\\n\\n\\n Ok(result)\\n\\n },\\n\\n Err(e) => Err(e)\\n\\n }\\n\\n }\\n\\n\\n\\n pub fn continue_ray_from_intersection(intersection: &RayIntersection, direction: Vector3) -> Result<Self, RayError> {\\n\\n match RayState::get_continuation(intersection.get_intersector_ray().get_state(), intersection.get_distance_to_intersection()) {\\n\\n Ok (continued_state) => {\\n\\n Ok (Self { direction: Unit::new_normalize(direction),\\n\\n origin: *intersection.get_intersection_point(),\\n\\n state: continued_state,\\n\\n ..intersection.get_intersector_ray().clone()})\\n\\n },\\n\\n Err(e) => Err(e)\\n\\n }\\n\",\n \"file_path\": \"src/core/ray.rs\",\n \"rank\": 28,\n \"score\": 29090.054086979344\n },\n {\n \"content\": \" if let Some(ref mut mediums) = self.mediums {\\n\\n mediums.pop_back();\\n\\n }\\n\\n if self.mediums.as_ref().unwrap().is_empty() {\\n\\n self.mediums = None;\\n\\n }\\n\\n }\\n\\n }\\n\\n\\n\\n pub fn continue_ray_from_intersection_into_medium(intersection: &RayIntersection, direction: Vector3) -> Result<Self, RayError> {\\n\\n let original_ray = intersection.get_intersector_ray();\\n\\n\\n\\n match RayState::get_continuation(original_ray.get_state(), intersection.get_distance_to_intersection()) {\\n\\n Ok (continued_state) => {\\n\\n let mut result = Self { direction: Unit::new_normalize(direction),\\n\\n origin: *intersection.get_intersection_point(),\\n\\n mediums: original_ray.mediums.clone(),\\n\\n state: continued_state};\\n\\n if intersection.was_inside() {\\n\\n result.pop_medium();\\n\",\n \"file_path\": \"src/core/ray.rs\",\n \"rank\": 29,\n \"score\": 29089.455605878997\n },\n {\n \"content\": \"\\n\\n\\n\\n#[derive(Debug, Copy, Clone)]\\n\\npub struct Material {\\n\\n ambient: Option<Color>,\\n\\n diffuse: Option<Color>,\\n\\n specular: Option<(Color, FloatType)>,\\n\\n fresnel: Option<FresnelData>,\\n\\n reflective: bool,\\n\\n refractive: bool,\\n\\n}\\n\\n\\n\\nimpl Material {\\n\\n pub fn new_useless() -> Self {\\n\\n Self { ambient: None,\\n\\n diffuse: None,\\n\\n specular: None,\\n\\n fresnel: None,\\n\\n reflective: false,\\n\\n refractive: false\\n\",\n \"file_path\": \"src/core/material.rs\",\n \"rank\": 30,\n \"score\": 29087.665006903826\n },\n {\n \"content\": \"\\n\\n pub fn get_fresnel_reflection(ray_intersection: &RayIntersection) -> Option<Color> {\\n\\n let material = ray_intersection.get_material();\\n\\n material.get_fresnel_data().and_then(|fresnel_data| {\\n\\n fresnel_data.get_fresnel_reflect(ray_intersection)\\n\\n })\\n\\n }\\n\\n\\n\\n pub fn get_fresnel_refraction(ray_intersection: &RayIntersection) -> Option<Color> {\\n\\n let material = ray_intersection.get_material();\\n\\n material.get_fresnel_data().and_then(|fresnel_data| {\\n\\n fresnel_data.get_fresnel_refract(ray_intersection)\\n\\n })\\n\\n }\\n\\n}\",\n \"file_path\": \"src/core/material.rs\",\n \"rank\": 31,\n \"score\": 29087.29022723986\n },\n {\n \"content\": \" None => {\\n\\n Ok (Self { distance_to_origin: input.distance_to_origin + distance_to_intersection,\\n\\n depth_counter: input.depth_counter + 1,\\n\\n ..*input\\n\\n })\\n\\n }\\n\\n }\\n\\n }\\n\\n\\n\\n pub fn get_maximum_depth_limited(&self, maximum_depth_limit: u32) -> Self {\\n\\n Self {\\n\\n depth_limit: Some(maximum_depth_limit.min(if let Some(depth_limit) = self.depth_limit {depth_limit} else {maximum_depth_limit})),\\n\\n ..*self\\n\\n }\\n\\n }\\n\\n\\n\\n pub fn get_distance_to_origin(&self) -> FloatType {\\n\\n self.distance_to_origin\\n\\n }\\n\\n\\n\",\n \"file_path\": \"src/core/ray.rs\",\n \"rank\": 32,\n \"score\": 29086.610916144447\n },\n {\n \"content\": \" &self.direction.as_ref()\\n\\n }\\n\\n\\n\\n pub fn get_distance_to_origin(&self) -> FloatType {\\n\\n self.state.get_distance_to_origin()\\n\\n }\\n\\n\\n\\n pub fn get_depth_counter(&self) -> i32 {\\n\\n self.state.get_depth_counter()\\n\\n }\\n\\n\\n\\n pub fn get_medium(&self) -> Option<Material> {\\n\\n if let Some(ref mediums) = self.mediums {\\n\\n if let Some(last_item) = mediums.back() {\\n\\n Some(last_item.clone())\\n\\n } else {\\n\\n None\\n\\n }\\n\\n } else {\\n\\n None\\n\",\n \"file_path\": \"src/core/ray.rs\",\n \"rank\": 33,\n \"score\": 29085.778171870916\n },\n {\n \"content\": \" Some(fresnel_data.n_avg)\\n\\n })\\n\\n }\\n\\n\\n\\n pub fn get_refractive_index_for_component(&self, component: ColorComponent) -> Option<FloatType> {\\n\\n self.fresnel.and_then(|fresnel_data| {\\n\\n Some(fresnel_data.n.get_component(component))\\n\\n })\\n\\n }\\n\\n\\n\\n fn get_fresnel_data(&self) -> Option<&FresnelData> {\\n\\n self.fresnel.as_ref()\\n\\n }\\n\\n\\n\\n pub fn get_diffuse_illumination(ray_intersection: &RayIntersection, light_intersection: &LightIntersection) -> Option<Color> {\\n\\n let material = ray_intersection.get_material();\\n\\n\\n\\n material.get_diffuse_color().and_then(|color| {\\n\\n let surface_normal = ray_intersection.get_normal_vector();\\n\\n let light_direction = light_intersection.get_light_direction();\\n\",\n \"file_path\": \"src/core/material.rs\",\n \"rank\": 34,\n \"score\": 29085.59741706477\n },\n {\n \"content\": \"use core::Material;\",\n \"file_path\": \"src/basic/materials.rs\",\n \"rank\": 35,\n \"score\": 29084.671092696713\n },\n {\n \"content\": \" let cosln = light_direction.dot(surface_normal).max(0.0);\\n\\n let illumination = light_intersection.get_illumination();\\n\\n Some ((*color * *illumination).mul_scalar(&cosln))\\n\\n })\\n\\n }\\n\\n\\n\\n pub fn get_specular_illumination(ray_intersection: &RayIntersection, light_intersection: &LightIntersection) -> Option<Color> {\\n\\n let material = ray_intersection.get_material();\\n\\n\\n\\n material.get_specular_color().and_then(|color_shiny| {\\n\\n let illumination = light_intersection.get_illumination();\\n\\n let view_direction = ray_intersection.get_view_direction();\\n\\n let surface_normal = ray_intersection.get_normal_vector();\\n\\n let (color, shininess) = *color_shiny;\\n\\n let light_direction = light_intersection.get_light_direction();\\n\\n let half_direction = (view_direction + light_direction).normalize();\\n\\n let coshn = half_direction.dot(surface_normal).max(0.0).powf(shininess);\\n\\n Some((color * *illumination).mul_scalar(&coshn))\\n\\n })\\n\\n }\\n\",\n \"file_path\": \"src/core/material.rs\",\n \"rank\": 36,\n \"score\": 29084.368017359702\n },\n {\n \"content\": \"use core::{Color, ColorComponent, FresnelIndex, RayIntersection, LightIntersection};\\n\\n\\n\\nuse defs::FloatType;\\n\\nuse tools::CompareWithTolerance;\\n\\n\\n\\n#[derive(Debug, Copy, Clone)]\\n\",\n \"file_path\": \"src/core/material.rs\",\n \"rank\": 37,\n \"score\": 29083.840245098265\n },\n {\n \"content\": \" }\\n\\n }\\n\\n\\n\\n pub fn new_diffuse(diffuse: Color, ambient: Option<Color>) -> Self {\\n\\n Self { diffuse: Some(diffuse),\\n\\n ambient: ambient,\\n\\n specular: None,\\n\\n fresnel: None,\\n\\n reflective: false,\\n\\n refractive: false}\\n\\n }\\n\\n\\n\\n pub fn new_shiny(diffuse: Color, specular: (Color, FloatType), ambient: Option<Color>) -> Self {\\n\\n Self { diffuse: Some(diffuse),\\n\\n ambient: ambient,\\n\\n specular: Some(specular),\\n\\n fresnel: None,\\n\\n reflective: false,\\n\\n refractive: false}\\n\\n }\\n\",\n \"file_path\": \"src/core/material.rs\",\n \"rank\": 38,\n \"score\": 29083.36819497293\n },\n {\n \"content\": \" Self { diffuse: diffuse,\\n\\n ambient: ambient,\\n\\n specular: specular,\\n\\n fresnel: Some(FresnelData::new(fresnel_real, fresnel_imagninary)),\\n\\n reflective: true,\\n\\n refractive: true}\\n\\n }\\n\\n\\n\\n pub fn new_light_source(diffuse: Color, ambient: Option<Color>) -> Self {\\n\\n Self {\\n\\n diffuse: Some(diffuse),\\n\\n ambient: ambient,\\n\\n specular: None,\\n\\n fresnel: Some(FresnelData::new(FresnelIndex::one(), FresnelIndex::one())),\\n\\n reflective: false,\\n\\n refractive: true\\n\\n }\\n\\n }\\n\\n\\n\\n pub fn get_ambient_color(&self) -> Option<&Color> {\\n\",\n \"file_path\": \"src/core/material.rs\",\n \"rank\": 39,\n \"score\": 29082.84056336116\n },\n {\n \"content\": \"\\n\\n pub fn new_reflective(fresnel_real: FresnelIndex, fresnel_imagninary: FresnelIndex, diffuse: Option<Color>, specular: Option<(Color, FloatType)>, ambient: Option<Color>) -> Self {\\n\\n Self { diffuse: diffuse,\\n\\n ambient: ambient,\\n\\n specular: specular,\\n\\n fresnel: Some(FresnelData::new(fresnel_real, fresnel_imagninary)),\\n\\n reflective: true,\\n\\n refractive: false}\\n\\n }\\n\\n\\n\\n pub fn new_refractive(fresnel_real: FresnelIndex, fresnel_imagninary: FresnelIndex, diffuse: Option<Color>, specular: Option<(Color, FloatType)>, ambient: Option<Color>) -> Self {\\n\\n Self { diffuse: diffuse,\\n\\n ambient: ambient,\\n\\n specular: specular,\\n\\n fresnel: Some(FresnelData::new(fresnel_real, fresnel_imagninary)),\\n\\n reflective: false,\\n\\n refractive: true}\\n\\n }\\n\\n\\n\\n pub fn new_reflective_and_refractive(fresnel_real: FresnelIndex, fresnel_imagninary: FresnelIndex, diffuse: Option<Color>, specular: Option<(Color, FloatType)>, ambient: Option<Color>) -> Self {\\n\",\n \"file_path\": \"src/core/material.rs\",\n \"rank\": 40,\n \"score\": 29082.621948553166\n },\n {\n \"content\": \" state: self.state.get_maximum_depth_limited(maximum_depth_limit),\\n\\n ..self.clone()\\n\\n }\\n\\n }\\n\\n\\n\\n pub fn set_maximum_depth_limited_mut(&mut self, maximum_depth_limit: u32){\\n\\n self.state = self.state.get_maximum_depth_limited(maximum_depth_limit);\\n\\n }\\n\\n\\n\\n fn push_medium(&mut self, material: Material) {\\n\\n if let Some(ref mut mediums) = self.mediums {\\n\\n mediums.push_back(material);\\n\\n } else {\\n\\n self.mediums = Some(VecDeque::new());\\n\\n self.mediums.as_mut().unwrap().push_back(material);\\n\\n }\\n\\n }\\n\\n\\n\\n fn pop_medium(&mut self) {\\n\\n if self.mediums.is_some() {\\n\",\n \"file_path\": \"src/core/ray.rs\",\n \"rank\": 41,\n \"score\": 29082.548615841104\n },\n {\n \"content\": \"\\n\\n Self { n: real,\\n\\n n_inverse: real.recip(),\\n\\n n_avg: real.intensity_avg(),\\n\\n n_imaginary: imaginary,\\n\\n n_imaginary_inverse: imaginary.recip(),\\n\\n n_imaginary_avg: imaginary.intensity_avg(),\\n\\n f0: f0,\\n\\n f0_avg: f0.intensity_avg(),\\n\\n f0_inverse: f0_inverse,\\n\\n f0_inverse_avg: f0_inverse.intensity_avg()\\n\\n }\\n\\n }\\n\\n\\n\\n pub fn get_fresnel_reflect(&self, intersection: &RayIntersection) -> Option<Color> {\\n\\n let view_and_normal_angle_cosine = intersection.get_view_direction().dot(intersection.get_normal_vector());\\n\\n\\n\\n if view_and_normal_angle_cosine.greater_eq_eps(&0.0) {\\n\\n let f = if !intersection.was_inside() {\\n\\n self.f0\\n\",\n \"file_path\": \"src/core/material.rs\",\n \"rank\": 42,\n \"score\": 29082.053037724483\n },\n {\n \"content\": \" } else {\\n\\n self.f0_inverse\\n\\n };\\n\\n\\n\\n let f1 = (Color::one()-f) * Color::one().mul_scalar(&(1.0 - view_and_normal_angle_cosine).powi(5));\\n\\n \\n\\n Some(f + f1)\\n\\n } else {\\n\\n None\\n\\n }\\n\\n }\\n\\n\\n\\n pub fn get_fresnel_refract(&self, intersection: &RayIntersection) -> Option<Color> {\\n\\n if let Some(color) = self.get_fresnel_reflect(intersection) {\\n\\n Some(Color::one() - color)\\n\\n } else {\\n\\n None\\n\\n }\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/core/material.rs\",\n \"rank\": 43,\n \"score\": 29081.6292868064\n },\n {\n \"content\": \" self.ambient.as_ref()\\n\\n }\\n\\n\\n\\n pub fn get_diffuse_color(&self) -> Option<&Color> {\\n\\n self.diffuse.as_ref()\\n\\n }\\n\\n\\n\\n pub fn get_specular_color(&self) -> Option<&(Color, FloatType)> {\\n\\n self.specular.as_ref()\\n\\n }\\n\\n\\n\\n pub fn is_opaque(&self) -> bool {\\n\\n !self.refractive\\n\\n }\\n\\n\\n\\n pub fn is_transparent(&self) -> bool {\\n\\n !self.is_opaque()\\n\\n }\\n\\n\\n\\n pub fn is_reflective(&self) -> bool {\\n\",\n \"file_path\": \"src/core/material.rs\",\n \"rank\": 44,\n \"score\": 29080.997631415692\n },\n {\n \"content\": \" self.reflective\\n\\n }\\n\\n\\n\\n pub fn is_refractive(&self) -> bool {\\n\\n self.refractive\\n\\n }\\n\\n\\n\\n pub fn get_transparency_to_light(&self) -> Option<Color> {\\n\\n if self.is_transparent() {\\n\\n match self.diffuse {\\n\\n None => Some(Color::one()),\\n\\n Some(color) => Some(color)\\n\\n }\\n\\n } else {\\n\\n None\\n\\n }\\n\\n }\\n\\n\\n\\n pub fn get_average_refractive_index(&self) -> Option<FloatType> {\\n\\n self.fresnel.and_then(|fresnel_data| {\\n\",\n \"file_path\": \"src/core/material.rs\",\n \"rank\": 45,\n \"score\": 29080.648740995628\n },\n {\n \"content\": \" 0.0, 0.0, 0.0, 1.0);\\n\\n \\n\\n assert_relative_eq!(wrapper.get_tf_matrix(), &expected);\\n\\n }\\n\\n\\n\\n struct ModelMock {\\n\\n point: Point3,\\n\\n normal: Vector3,\\n\\n }\\n\\n\\n\\n impl ModelMock {\\n\\n pub fn new(point: Point3, normal: Vector3) -> Self {\\n\\n Self { point: point,\\n\\n normal: normal }\\n\\n }\\n\\n }\\n\\n\\n\\n impl Model for ModelMock {\\n\\n fn get_intersection(&self, ray: &Ray) -> Option<RayIntersection> {\\n\\n Some(RayIntersection::new(self.normal, self.point, ray, Material::new_useless(), false).expect(\\\"Ray depth limit reached\\\"))\\n\",\n \"file_path\": \"src/core/model.rs\",\n \"rank\": 50,\n \"score\": 28825.159381214857\n },\n {\n \"content\": \" test_model.rotate(Vector3::new(0.0, 0.0, 1.0), std::f64::consts::FRAC_PI_2);\\n\\n\\n\\n let intersector_ray = Ray::new_single_shot(Point3::new(0.0, -5.0, 2.0), Vector3::new(0.0, 1.0, 0.0));\\n\\n let transformed_intersection = test_model.get_intersection(&intersector_ray).expect(\\\"There was no intersection returned when ModelMock always returns\\\");\\n\\n\\n\\n assert_relative_eq!(transformed_intersection.get_intersection_point(), &Point3::new(0.0, 0.0, 2.0));\\n\\n assert_relative_eq!(transformed_intersection.get_normal_vector(), &Vector3::new(1.0, 1.0, 1.0).normalize());\\n\\n assert_relative_eq!(transformed_intersection.get_distance_to_intersection(), &5.0);\\n\\n }\\n\\n\\n\\n #[test]\\n\\n fn mvo_wrapper_complete_scale_translate() {\\n\\n let mut test_model = ModelViewModelWrapper::new_identity(ModelMock::new(Point3::new(0.0, 0.0, 1.0), Vector3::new(1.0, -1.0, 1.0)));\\n\\n test_model.scale_uniform(2.0);\\n\\n test_model.translate(Vector3::new(0.0, 1.0, 0.0)); \\n\\n\\n\\n let intersector_ray = Ray::new_single_shot(Point3::new(0.0, -5.0, 2.0), Vector3::new(0.0, 1.0, 0.0));\\n\\n let transformed_intersection = test_model.get_intersection(&intersector_ray).expect(\\\"There was no intersection returned when ModelMock always returns\\\");\\n\\n\\n\\n assert_relative_eq!(transformed_intersection.get_intersection_point(), &Point3::new(0.0, 1.0, 2.0));\\n\\n assert_relative_eq!(transformed_intersection.get_normal_vector(), &Vector3::new(1.0, -1.0, 1.0).normalize());\\n\\n assert_relative_eq!(transformed_intersection.get_distance_to_intersection(), &6.0);\\n\\n }\\n\\n}\",\n \"file_path\": \"src/core/model.rs\",\n \"rank\": 53,\n \"score\": 28817.57548545539\n },\n {\n \"content\": \"use defs::{Matrix4, Vector3, FloatType};\\n\\nuse core::{Ray, RayIntersection};\\n\\nuse na::{Similarity3, Rotation3, Translation3, Unit};\\n\\n\\n\",\n \"file_path\": \"src/core/model.rs\",\n \"rank\": 54,\n \"score\": 28817.404552708285\n },\n {\n \"content\": \"\\n\\n self.recalculate_cached_matrices();\\n\\n }\\n\\n\\n\\n pub fn rotate(&mut self, axis: Vector3, angle: FloatType) {\\n\\n let rotation = Rotation3::from_axis_angle(&Unit::new_normalize(axis), angle);\\n\\n\\n\\n self.tf_matrix = rotation.to_homogeneous() * self.tf_matrix;\\n\\n\\n\\n self.recalculate_cached_matrices();\\n\\n }\\n\\n\\n\\n #[cfg(test)]\\n\\n pub fn get_tf_matrix(&self) -> &Matrix4 {\\n\\n &self.tf_matrix\\n\\n }\\n\\n}\\n\\n\\n\\nimpl<T: Model> Model for ModelViewModelWrapper<T> {\\n\\n fn get_intersection(&self, ray: & Ray) -> Option<RayIntersection<>> {\\n\",\n \"file_path\": \"src/core/model.rs\",\n \"rank\": 55,\n \"score\": 28816.64321132849\n },\n {\n \"content\": \" }\\n\\n }\\n\\n\\n\\n #[test]\\n\\n fn mvo_wrapper_complete_translate() {\\n\\n let mut test_model = ModelViewModelWrapper::new_identity(ModelMock::new(Point3::new(0.0, 0.0, 1.0), Vector3::new(1.0, -1.0, 1.0)));\\n\\n test_model.translate(Vector3::new(0.0, 0.0, 1.0));\\n\\n\\n\\n let intersector_ray = Ray::new_single_shot(Point3::new(0.0, -5.0, 2.0), Vector3::new(0.0, 1.0, 0.0));\\n\\n let transformed_intersection = test_model.get_intersection(&intersector_ray).expect(\\\"There was no intersection returned when ModelMock always returns\\\");\\n\\n\\n\\n assert_relative_eq!(transformed_intersection.get_intersection_point(), &Point3::new(0.0, 0.0, 2.0));\\n\\n assert_relative_eq!(transformed_intersection.get_normal_vector(), &Vector3::new(1.0, -1.0, 1.0).normalize());\\n\\n assert_relative_eq!(transformed_intersection.get_distance_to_intersection(), &5.0);\\n\\n }\\n\\n\\n\\n #[test]\\n\\n fn mvo_wrapper_complete_rotate_translate() {\\n\\n let mut test_model = ModelViewModelWrapper::new_identity(ModelMock::new(Point3::new(0.0, 0.0, 1.0), Vector3::new(1.0, -1.0, 1.0)));\\n\\n test_model.translate(Vector3::new(0.0, 0.0, 1.0));\\n\",\n \"file_path\": \"src/core/model.rs\",\n \"rank\": 56,\n \"score\": 28816.638824152367\n },\n {\n \"content\": \"\\n\\n }\\n\\n }\\n\\n }\\n\\n\\n\\n impl Model for DummyModel {\\n\\n fn get_intersection(&self, _ray: &Ray) -> Option<RayIntersection> {\\n\\n None\\n\\n }\\n\\n }\\n\\n\\n\\n #[test]\\n\\n fn mvo_wrapper_scale_uniform() {\\n\\n let mut wrapper = ModelViewModelWrapper::new_identity(DummyModel::new());\\n\\n wrapper.scale_uniform(2.0);\\n\\n\\n\\n let expected = Matrix4::new(2.0, 0.0, 0.0, 0.0,\\n\\n 0.0, 2.0, 0.0, 0.0,\\n\\n 0.0, 0.0, 2.0, 0.0,\\n\\n 0.0, 0.0, 0.0, 1.0);\\n\",\n \"file_path\": \"src/core/model.rs\",\n \"rank\": 59,\n \"score\": 28813.74831776716\n },\n {\n \"content\": \" wrapper.translate(Vector3::new(1.0, 1.0, 1.0));\\n\\n\\n\\n let expected = Matrix4::new(1.0, 0.0, 0.0, 1.0,\\n\\n 0.0, 1.0, 0.0, 1.0,\\n\\n 0.0, 0.0, 1.0, 1.0,\\n\\n 0.0, 0.0, 0.0, 1.0);\\n\\n \\n\\n assert_relative_eq!(wrapper.get_tf_matrix(), &expected);\\n\\n }\\n\\n\\n\\n #[test]\\n\\n fn mvo_wrapper_scale_translate() {\\n\\n let mut wrapper = ModelViewModelWrapper::new_identity(DummyModel::new());\\n\\n\\n\\n wrapper.scale_non_uniform(Vector3::new(2.0, 2.0, 2.0));\\n\\n wrapper.translate(Vector3::new(1.0, 1.0, 1.0));\\n\\n\\n\\n let expected = Matrix4::new(2.0, 0.0, 0.0, 1.0,\\n\\n 0.0, 2.0, 0.0, 1.0,\\n\\n 0.0, 0.0, 2.0, 1.0,\\n\",\n \"file_path\": \"src/core/model.rs\",\n \"rank\": 61,\n \"score\": 28811.009329436616\n },\n {\n \"content\": \" let transformed_ray = ray.get_transformed(&self.inverse_tf_matrix);\\n\\n\\n\\n match self.wrapped_model.get_intersection(&transformed_ray) {\\n\\n None => None,\\n\\n Some(transformed_intersection) => transformed_intersection.get_transformed(&self.tf_matrix).ok()\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\n\\n\",\n \"file_path\": \"src/core/model.rs\",\n \"rank\": 62,\n \"score\": 28810.240787735518\n },\n {\n \"content\": \" \\n\\n assert_relative_eq!(wrapper.get_tf_matrix(), &expected);\\n\\n }\\n\\n\\n\\n #[test]\\n\\n fn mvo_wrapper_scale_non_uniform() {\\n\\n let mut wrapper = ModelViewModelWrapper::new_identity(DummyModel::new());\\n\\n wrapper.scale_non_uniform(Vector3::new(2.0, 3.0, 4.0));\\n\\n\\n\\n let expected = Matrix4::new(2.0, 0.0, 0.0, 0.0,\\n\\n 0.0, 3.0, 0.0, 0.0,\\n\\n 0.0, 0.0, 4.0, 0.0,\\n\\n 0.0, 0.0, 0.0, 1.0);\\n\\n \\n\\n assert_relative_eq!(wrapper.get_tf_matrix(), &expected);\\n\\n }\\n\\n\\n\\n #[test]\\n\\n fn mvo_wrapper_translate() {\\n\\n let mut wrapper = ModelViewModelWrapper::new_identity(DummyModel::new());\\n\",\n \"file_path\": \"src/core/model.rs\",\n \"rank\": 63,\n \"score\": 28809.961011642412\n },\n {\n \"content\": \" }\\n\\n\\n\\n pub fn scale_non_uniform(&mut self, scaling: Vector3) {\\n\\n let diagonal = {\\n\\n let mut result = scaling.to_homogeneous();\\n\\n result[(3, 0)] = 1.0;\\n\\n result\\n\\n };\\n\\n\\n\\n let similarity = Matrix4::from_diagonal(&diagonal);\\n\\n \\n\\n self.tf_matrix = similarity * self.tf_matrix;\\n\\n\\n\\n self.recalculate_cached_matrices();\\n\\n }\\n\\n\\n\\n pub fn translate(&mut self, translation: Vector3) {\\n\\n let translate = Translation3::from_vector(translation);\\n\\n\\n\\n self.tf_matrix = translate.to_homogeneous() * self.tf_matrix;\\n\",\n \"file_path\": \"src/core/model.rs\",\n \"rank\": 64,\n \"score\": 28809.763092340443\n },\n {\n \"content\": \" inverse_tf_matrix: Matrix4::identity(),\\n\\n tf_matrix: Matrix4::identity()\\n\\n }\\n\\n }\\n\\n\\n\\n fn recalculate_cached_matrices(&mut self) {\\n\\n self.inverse_tf_matrix = self.tf_matrix.try_inverse().expect(\\\"Uninvertable Model View Matrix\\\");\\n\\n }\\n\\n\\n\\n pub fn load_identity(&mut self) {\\n\\n self.tf_matrix = Matrix4::identity();\\n\\n self.inverse_tf_matrix = Matrix4::identity();\\n\\n }\\n\\n\\n\\n pub fn scale_uniform(&mut self, scaling: FloatType) {\\n\\n let similarity = Similarity3::from_scaling(scaling);\\n\\n\\n\\n self.tf_matrix = similarity.to_homogeneous() * self.tf_matrix;\\n\\n\\n\\n self.recalculate_cached_matrices(); \\n\",\n \"file_path\": \"src/core/model.rs\",\n \"rank\": 65,\n \"score\": 28808.40954026133\n },\n {\n \"content\": \"pub trait SceneBuffer: ImmutableSceneBuffer + MutableSceneBuffer + Send + Sync {\\n\\n\\n\\n}\\n\\n\\n\\n\\n\\npub struct SceneBufferIterator<'buffer> {\\n\\n buffer: &'buffer ImmutableSceneBuffer,\\n\\n screen_iterator: ScreenIterator\\n\\n}\\n\\n\\n\\nimpl<'buffer> SceneBufferIterator<'buffer> {\\n\\n pub fn new(buffer: &'buffer ImmutableSceneBuffer) -> Self {\\n\\n Self {\\n\\n buffer: buffer,\\n\\n screen_iterator: ScreenIterator::new(buffer.get_screen())\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\nimpl<'buffer> Iterator for SceneBufferIterator<'buffer> {\\n\",\n \"file_path\": \"src/core/scene.rs\",\n \"rank\": 66,\n \"score\": 26326.559688248748\n },\n {\n \"content\": \"pub trait MutableSceneBuffer: ImmutableSceneBuffer + Send + Sync { //Internally mutable (Mutex), thread safe\\n\\n fn set_pixel_value(&self, pixel: Point2Int, color: &Color) -> Result<(), SceneBufferError>;\\n\\n fn accumulate_pixel_value(&self, pixel: Point2Int, color: &Color) -> Result<(), SceneBufferError>;\\n\\n fn reset_pixel(&self, pixel: Point2Int) -> Result<(), SceneBufferError>;\\n\\n\\n\\n fn layer_buffer(&self, place: SceneBufferLayering, rhs: &ImmutableSceneBuffer) -> Result<(), SceneBufferError> {\\n\\n let layerer = |self_color_option: Option<Color>, rhs_color_option: Option<Color>| {\\n\\n match place {\\n\\n SceneBufferLayering::Under => {\\n\\n match self_color_option {\\n\\n Some(_) => None,\\n\\n None => rhs_color_option\\n\\n }\\n\\n },\\n\\n SceneBufferLayering::Over => {\\n\\n match rhs_color_option {\\n\\n Some(color) => Some(color),\\n\\n None => None\\n\\n }\\n\\n }\\n\",\n \"file_path\": \"src/core/scene.rs\",\n \"rank\": 67,\n \"score\": 22976.396398707835\n },\n {\n \"content\": \"use defs::{FloatType, Point3, Vector3, Matrix4};\\n\\nuse core::{Ray, Material};\\n\\nuse tools::{CompareWithTolerance};\\n\\nuse na::{Unit};\\n\\nuse na;\\n\\nuse uuid::{Uuid};\\n\\n\\n\\nstatic MIMIMUM_INTERSECTION_DISTANCE: FloatType = 0.000000001;\\n\\n\\n\\n#[derive(Debug)]\\n\\npub enum RayIntersectionError {\\n\\n NoRayTravelDistance,\\n\\n NoModelIdentifierPresent\\n\\n}\\n\\n\\n\\n#[derive(Clone)]\\n\\npub struct RayIntersection {\\n\\n normal : Unit<Vector3>,\\n\\n point : Point3,\\n\\n material_at_intersection : Material,\\n\",\n \"file_path\": \"src/core/intersection.rs\",\n \"rank\": 68,\n \"score\": 27.34003249949724\n },\n {\n \"content\": \" }\\n\\n }\\n\\n\\n\\n pub fn new_model_identifier(normal: Vector3, point: Point3, ray: &Ray, material: Material, was_inside: bool, model_identier: Uuid) -> Result<Self, RayIntersectionError> {\\n\\n match Self::new(normal, point, ray, material, was_inside) {\\n\\n Ok(mut intersection) => {\\n\\n intersection.set_model_identifier_mut(Some(model_identier));\\n\\n Ok(intersection)\\n\\n },\\n\\n Err(err) => Err(err)\\n\\n }\\n\\n }\\n\\n\\n\\n pub fn get_intersection_point(&self) -> &Point3 {\\n\\n &self.point\\n\\n }\\n\\n\\n\\n pub fn get_normal_vector(&self) -> &Vector3 {\\n\\n &self.normal.as_ref()\\n\\n }\\n\",\n \"file_path\": \"src/core/intersection.rs\",\n \"rank\": 69,\n \"score\": 24.399726833506556\n },\n {\n \"content\": \" distance_to_intersection : FloatType,\\n\\n was_inside : bool,\\n\\n ray : Ray,\\n\\n model_identifier : Option<Uuid>,\\n\\n}\\n\\n\\n\\nimpl RayIntersection {\\n\\n pub fn new(normal: Vector3, point: Point3, ray: &Ray, material: Material, was_inside: bool) -> Result<Self, RayIntersectionError> {\\n\\n let distance_to_intersection = na::distance(ray.get_origin(), &point);\\n\\n if distance_to_intersection.greater_eq_eps(&MIMIMUM_INTERSECTION_DISTANCE) {\\n\\n Ok (Self { normal: Unit::new_normalize(normal), \\n\\n point: point, \\n\\n ray: ray.clone(),\\n\\n material_at_intersection: material,\\n\\n distance_to_intersection: distance_to_intersection,\\n\\n was_inside: was_inside,\\n\\n model_identifier: None\\n\\n })\\n\\n } else {\\n\\n Err(RayIntersectionError::NoRayTravelDistance)\\n\",\n \"file_path\": \"src/core/intersection.rs\",\n \"rank\": 70,\n \"score\": 24.16072208070324\n },\n {\n \"content\": \"\\n\\n pub fn was_inside(&self) -> bool {\\n\\n self.was_inside\\n\\n }\\n\\n\\n\\n pub fn get_transformed(self, transformation_matrix: &Matrix4) -> Result<Self, RayIntersectionError> {\\n\\n let point = Point3::from_homogeneous(transformation_matrix * self.point.to_homogeneous()).expect(\\\"Unhomogeneous transformed point\\\");\\n\\n let normal = Vector3::from_homogeneous(transformation_matrix * self.normal.to_homogeneous()).expect(\\\"Unhomogeneous transformed vector\\\");\\n\\n let ray = self.ray.get_transformed(transformation_matrix);\\n\\n\\n\\n Self::new(normal, point, &ray, self.material_at_intersection, self.was_inside)\\n\\n }\\n\\n\\n\\n pub fn get_model_identifier(&self) -> Option<&Uuid> {\\n\\n self.model_identifier.as_ref()\\n\\n }\\n\\n\\n\\n pub fn set_model_identifier_mut(&mut self, identifier: Option<Uuid>) {\\n\\n self.model_identifier = identifier;\\n\\n }\\n\",\n \"file_path\": \"src/core/intersection.rs\",\n \"rank\": 71,\n \"score\": 22.196828261431165\n },\n {\n \"content\": \"use std::collections::{HashSet};\\n\\nuse std::sync::{Arc, Mutex};\\n\\nuse std;\\n\\n\\n\\nuse defs::{IntType, FloatType, Point2Int};\\n\\nuse core::{WorldViewTrait, Color, Screen, ScreenIterator, RayIntersection, Material,\\n\\n RayPropagator, BasicSceneBuffer, SceneBuffer, RayPropagatorError,\\n\\n RenderingTask, RenderingTaskProducer, ThreadSafeIterator, Ray, RayError};\\n\\n\\n\\nuse uuid::{Uuid};\\n\\nuse rand;\\n\\nuse rand::{Rng};\\n\\n\\n\\n#[derive(Clone, Copy)]\\n\\npub struct UuidColor {\\n\\n pub id: Uuid,\\n\\n pub color: Color\\n\\n}\\n\\n\\n\\nimpl UuidColor {\\n\",\n \"file_path\": \"src/basic/postprocessing/gi.rs\",\n \"rank\": 72,\n \"score\": 18.910656114825645\n },\n {\n \"content\": \"use core::{LightSource, Ray, LightIntersection, RayIntersection, Color};\\n\\nuse defs::{Vector3, Point3, FloatType};\\n\\nuse na;\\n\\nuse na::{Unit};\\n\\n\\n\\npub struct DotLightSource {\\n\\n color: Color,\\n\\n intensity: FloatType,\\n\\n position: Point3,\\n\\n attenuation_const: FloatType,\\n\\n attenuation_linear: FloatType,\\n\\n attenuation_squared: FloatType\\n\\n}\\n\\n\\n\\nimpl DotLightSource {\\n\\n pub fn new_natural(color: Color, intensity: FloatType, position: Point3) -> Self {\\n\\n Self { color: color,\\n\\n intensity: intensity,\\n\\n position: position,\\n\\n attenuation_const: 0.0,\\n\",\n \"file_path\": \"src/basic/lightsource.rs\",\n \"rank\": 73,\n \"score\": 18.811544488110624\n },\n {\n \"content\": \"\\n\\n pub fn set_model_identifier(&self, identifier: Option<Uuid>) -> Self {\\n\\n Self { model_identifier: identifier,\\n\\n ..self.clone() }\\n\\n }\\n\\n\\n\\n pub fn is_same_model_intersection(&self, rhs: &RayIntersection) -> Result<bool, RayIntersectionError> {\\n\\n if self.model_identifier.is_some() && rhs.model_identifier.is_some() {\\n\\n Ok(self.model_identifier.unwrap() == rhs.model_identifier.unwrap())\\n\\n } else {\\n\\n Err(RayIntersectionError::NoModelIdentifierPresent)\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\n\\n\\n#[cfg(test)]\\n\\nmod tests {\\n\\n\\n\\n}\",\n \"file_path\": \"src/core/intersection.rs\",\n \"rank\": 74,\n \"score\": 18.50554160455596\n },\n {\n \"content\": \"use core::{Ray, RayIntersection, Color, RayCaster};\\n\\nuse defs::Vector3;\\n\\nuse na::{Unit};\\n\\n\\n\\npub struct LightIntersection {\\n\\n illumination: Color,\\n\\n light_direction: Unit<Vector3>\\n\\n}\\n\\n\\n\\nimpl LightIntersection {\\n\\n pub fn new(illumination: Color, light_direction: Vector3) -> Self {\\n\\n Self { illumination: illumination, \\n\\n light_direction : Unit::new_normalize(light_direction.normalize())}\\n\\n }\\n\\n\\n\\n pub fn get_shadowed(&self, shadowing: &Color) -> Self {\\n\\n Self { illumination: self.illumination * *shadowing,\\n\\n ..*self}\\n\\n }\\n\\n\\n\\n pub fn get_illumination(&self) -> &Color {\\n\\n &self.illumination\\n\\n }\\n\\n\\n\\n pub fn get_light_direction(&self) -> &Vector3 {\\n\\n &self.light_direction.as_ref()\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/core/light.rs\",\n \"rank\": 75,\n \"score\": 18.353560271492064\n },\n {\n \"content\": \"use defs::{FloatType, Vector3};\\n\\n\\n\\nuse core::{Ray, RayError, RayIntersection, ColorComponent};\\n\\nuse tools::{CompareWithTolerance};\\n\\n\\n\\nuse na;\\n\\nuse na::{Rotation3, Unit};\\n\\n\\n\\n\\n\\n#[derive(Debug)]\\n\\npub enum RayPropagatorError {\\n\\n RayRelated(RayError),\\n\\n NoRefraction,\\n\\n NotRefractiveMaterial\\n\\n}\\n\\n\\n\\npub struct RayPropagator<'intersection> {\\n\\n intersection: &'intersection RayIntersection,\\n\\n view_axis: Unit<Vector3>\\n\\n}\\n\",\n \"file_path\": \"src/core/propagation.rs\",\n \"rank\": 76,\n \"score\": 17.5279649299454\n },\n {\n \"content\": \"use core::{Intersector, Model, RayIntersection, Ray};\\n\\n\\n\\nuse tools::CompareWithTolerance;\\n\\n\\n\\n\\n\\npub type ModelVec = Vec<Box<Model>>;\\n\\n\\n\\npub struct SimpleIntersector {\\n\\n models: ModelVec,\\n\\n}\\n\\n\\n\\nimpl SimpleIntersector {\\n\\n pub fn new(models: ModelVec) -> Self {\\n\\n Self { models: models}\\n\\n }\\n\\n}\\n\\n\\n\\nimpl Intersector for SimpleIntersector {\\n\\n fn get_intersections_reverse_ordered(&self, ray: &Ray) -> Vec<RayIntersection> { //Nearest elem is last\\n\\n let mut result: Vec<RayIntersection> = self.models.iter().filter_map(|model_box| model_box.get_intersection(ray)).collect();\\n\",\n \"file_path\": \"src/basic/intersector.rs\",\n \"rank\": 77,\n \"score\": 17.36360279178099\n },\n {\n \"content\": \"use defs::{Point3, Vector3, Matrix3, Point2Int, FloatType, IntType};\\n\\nuse core::{Ray};\\n\\nuse tools::{CompareWithTolerance, Vector3Extensions};\\n\\nuse na::{Unit};\\n\\n\\n\\n#[derive(Debug)]\\n\\npub enum ScreenError {\\n\\n PixelOutOfBoundsError\\n\\n}\\n\\n\\n\\n\\n\\n#[derive(Copy, Clone)]\\n\\npub struct Screen {\\n\\n center: Point3,\\n\\n up: Unit<Vector3>,\\n\\n left: Unit<Vector3>,\\n\\n normal: Unit<Vector3>,\\n\\n to_plane_trasform_matrix: Matrix3,\\n\\n width: FloatType,\\n\\n height: FloatType,\\n\",\n \"file_path\": \"src/core/view.rs\",\n \"rank\": 78,\n \"score\": 15.637935707482075\n },\n {\n \"content\": \"pub mod ray;\\n\\npub mod intersection;\\n\\npub mod model;\\n\\npub mod world;\\n\\npub mod light;\\n\\npub mod material;\\n\\npub mod color;\\n\\npub mod view;\\n\\npub mod propagation;\\n\\npub mod worldview;\\n\\npub mod execution;\\n\\npub mod scene;\\n\\n\\n\\npub use self::model::*;\\n\\npub use self::ray::*;\\n\\npub use self::intersection::*;\\n\\npub use self::model::*;\\n\\npub use self::world::*;\\n\\npub use self::light::*;\\n\\npub use self::material::*;\\n\\npub use self::color::*;\\n\\npub use self::view::*;\\n\\npub use self::propagation::*;\\n\\npub use self::worldview::*;\\n\\npub use self::execution::*;\\n\\npub use self::scene::*;\",\n \"file_path\": \"src/core/mod.rs\",\n \"rank\": 79,\n \"score\": 15.356662896380548\n },\n {\n \"content\": \"#[derive(Copy, Clone)]\\n\\npub struct Eye {\\n\\n position: Point3,\\n\\n direction: Unit<Vector3>,\\n\\n}\\n\\n\\n\\nimpl Eye {\\n\\n pub fn new(position: Point3, direction: Vector3) -> Self {\\n\\n Self { position: position,\\n\\n direction: Unit::new_normalize(direction)}\\n\\n }\\n\\n\\n\\n pub fn get_position(&self) -> &Point3 {\\n\\n &self.position\\n\\n }\\n\\n\\n\\n pub fn get_direction(&self) -> &Vector3 {\\n\\n &self.direction.as_ref()\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/core/view.rs\",\n \"rank\": 80,\n \"score\": 15.006123199026991\n },\n {\n \"content\": \" None\\n\\n }\\n\\n \\n\\n } else {\\n\\n None\\n\\n }\\n\\n }\\n\\n\\n\\n pub fn new_calculate_uuid_color_for_pixel(&self, coord: &Point2Int) -> Result<Option<UuidColor>, GlobalIlluminationShaderError> {\\n\\n if let Ok(ray) = self.worldview.get_view().get_ray_to_screen_coordinate(*coord) {\\n\\n if let Some(intersection) = self.worldview.get_ray_caster().cast_model_ray(&ray) {\\n\\n if let Some(model_identifier) = intersection.get_model_identifier() {\\n\\n if let Some(resulting_color) = self.trace_ray_and_calculate_color(&ray) {\\n\\n Ok(Some(UuidColor::new(*model_identifier, resulting_color)))\\n\\n } else {\\n\\n Ok(None)\\n\\n }\\n\\n } else {\\n\\n Err(GlobalIlluminationShaderError::NotExistingModelId)\\n\\n }\\n\",\n \"file_path\": \"src/basic/postprocessing/gi.rs\",\n \"rank\": 81,\n \"score\": 14.40077146232672\n },\n {\n \"content\": \" use na::{Unit};\\n\\n use std::f64::consts::{PI};\\n\\n\\n\\n #[test]\\n\\n fn diffuse_direction_vector() {\\n\\n let ray = Ray::new(Point3::new(1.0, 0.0, 1.0), Vector3::new(-1.0, 0.0, -1.0));\\n\\n let intersection = RayIntersection::new(Vector3::new(0.0, 0.0, 1.0), Point3::new(0.0, 0.0, 0.0),\\n\\n &ray, Material::new_useless(), false).unwrap();\\n\\n\\n\\n let propagator = RayPropagator::new(&intersection);\\n\\n\\n\\n assert_relative_eq!(propagator.get_diffuse_direction_vector(PI/4.0, 0.0), Unit::new_normalize(Vector3::new(1.0, 0.0, 1.0)).unwrap());\\n\\n assert_relative_eq!(propagator.get_diffuse_direction_vector(PI/8.0, 0.0), Unit::new_normalize(Vector3::new((3.0*PI/8.0).tan(), 0.0, 1.0)).unwrap());\\n\\n assert_relative_eq!(propagator.get_diffuse_direction_vector(PI/8.0, PI/2.0), Unit::new_normalize(Vector3::new(0.0, (3.0*PI/8.0).tan(), 1.0)).unwrap());\\n\\n assert_relative_eq!(propagator.get_diffuse_direction_vector(PI/8.0, PI), Unit::new_normalize(Vector3::new(-((3.0*PI/8.0).tan()), 0.0, 1.0)).unwrap());\\n\\n }\\n\\n\\n\\n}\\n\",\n \"file_path\": \"src/core/propagation.rs\",\n \"rank\": 82,\n \"score\": 14.017011094078303\n },\n {\n \"content\": \"use core::{RayCaster, RayIntersection, Color, ColorCalculator, Material,\\n\\n IlluminationCaster, LightIntersection, RayPropagator, RayPropagatorError};\\n\\n\\n\\npub struct SimpleColorCalculator {\\n\\n \\n\\n}\\n\\n\\n\\nimpl SimpleColorCalculator {\\n\\n pub fn new() -> Self {\\n\\n Self {}\\n\\n }\\n\\n\\n\\n fn get_ambient_color(&self, intersection: &RayIntersection) -> Color {\\n\\n let material = intersection.get_material();\\n\\n *material.get_ambient_color().unwrap_or(&Color::zero())\\n\\n }\\n\\n\\n\\n fn get_local_color(&self, intersection: &RayIntersection, illuminations: &Vec<LightIntersection>) -> Color { \\n\\n illuminations.iter().fold(Color::zero(), |acc, light_intersection|{\\n\\n let diffuse_color = Material::get_diffuse_illumination(intersection, light_intersection);\\n\",\n \"file_path\": \"src/basic/colorcalculator.rs\",\n \"rank\": 83,\n \"score\": 13.86269172632253\n },\n {\n \"content\": \" \\n\\n result\\n\\n }\\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 screen_get_intersected_pixel_hit_origin() {\\n\\n let test_screen = Screen::new_unit(Point3::origin(), Vector3::new(0.0, 0.0, 1.0), Vector3::new(0.0, 1.0, 0.0), 1.0, 1.0, 1000);\\n\\n let test_ray = Ray::new(Point3::new(0.0, 0.0, 1.0), Vector3::new(0.0, 0.0, -1.0));\\n\\n\\n\\n let result = test_screen.get_intersected_pixel(&test_ray).expect(\\\"Should have hit screen\\\");\\n\\n\\n\\n assert_eq!(result, Point2Int::new(500, 500));\\n\\n }\\n\\n\\n\",\n \"file_path\": \"src/core/view.rs\",\n \"rank\": 84,\n \"score\": 13.680130701785682\n },\n {\n \"content\": \"\\n\\n pub fn get_distance_to_intersection(&self) -> FloatType {\\n\\n self.distance_to_intersection\\n\\n }\\n\\n\\n\\n pub fn get_intersector_ray(&self) -> &Ray {\\n\\n &self.ray\\n\\n }\\n\\n\\n\\n pub fn get_view_direction(&self) -> Vector3 {\\n\\n -self.ray.get_direction()\\n\\n }\\n\\n\\n\\n pub fn get_material(&self) -> &Material {\\n\\n &self.material_at_intersection\\n\\n }\\n\\n\\n\\n pub fn get_ray_medium(&self) -> Option<Material> {\\n\\n self.ray.get_medium()\\n\\n }\\n\",\n \"file_path\": \"src/core/intersection.rs\",\n \"rank\": 85,\n \"score\": 12.894069494684135\n },\n {\n \"content\": \"use std::cmp;\\n\\n\\n\\nuse defs::{Point2Int, Vector2Int, IntType};\\n\\n\\n\\n#[derive(Debug)]\\n\\npub enum RectError {\\n\\n InvalidRect\\n\\n}\\n\\n\\n\\npub struct Rect {\\n\\n left_up: Point2Int,\\n\\n right_down: Point2Int,\\n\\n}\\n\\n\\n\\nimpl Rect {\\n\\n pub fn new(left_up: Point2Int, right_down: Point2Int) -> Result<Self, RectError> {\\n\\n let result = Self {\\n\\n left_up: left_up,\\n\\n right_down: right_down\\n\\n };\\n\",\n \"file_path\": \"src/basic/postprocessing/base.rs\",\n \"rank\": 86,\n \"score\": 12.507177361910445\n },\n {\n \"content\": \" #[test]\\n\\n fn screen_get_intersected_pixel_hit_to_not_origin() {\\n\\n let test_screen = Screen::new_unit(Point3::origin(), Vector3::new(0.0, 0.0, 1.0), Vector3::new(0.0, 1.0, 0.0), 1.0, 1.0, 1000);\\n\\n let test_ray = Ray::new(Point3::new(0.25, 0.25, 1.0), Vector3::new(0.0, 0.0, -1.0));\\n\\n\\n\\n let result = test_screen.get_intersected_pixel(&test_ray).expect(\\\"Should have hit screen\\\");\\n\\n\\n\\n assert_eq!(result, Point2Int::new(250, 250));\\n\\n }\\n\\n\\n\\n #[test]\\n\\n fn screen_get_intersected_pixel_hit_not_to_origin_not_perpendicular() {\\n\\n let target_on_screen_point = Point3::new(0.25, 0.25, 0.0);\\n\\n let eye_point = Point3::new(0.0, 0.0, -1.0);\\n\\n let eye_ray_direction = (target_on_screen_point - eye_point).normalize();\\n\\n\\n\\n let test_screen = Screen::new_unit(Point3::origin(), Vector3::new(0.0, 0.0, 1.0), Vector3::new(0.0, 1.0, 0.0), 1.0, 1.0, 1000);\\n\\n let test_ray = Ray::new(eye_point + (eye_ray_direction * 5.0), -eye_ray_direction);\\n\\n\\n\\n let result = test_screen.get_intersected_pixel(&test_ray).expect(\\\"Should have hit screen\\\");\\n\",\n \"file_path\": \"src/core/view.rs\",\n \"rank\": 87,\n \"score\": 12.485939385673168\n },\n {\n \"content\": \" }\\n\\n\\n\\n pub fn get_pixel_index_by_screen_coord(&self, coord: &Point2Int) -> Result<IntType, ScreenError> {\\n\\n if self.check_pixel_bounds(coord) {\\n\\n Ok(coord.x + self.horizontal_resolution * coord.y)\\n\\n } else {\\n\\n Err(ScreenError::PixelOutOfBoundsError)\\n\\n }\\n\\n }\\n\\n\\n\\n fn get_screen_plane_intersection_point(&self, ray: &Ray) -> Option<Point3> {\\n\\n let origin = ray.get_origin();\\n\\n let dir = ray.get_direction();\\n\\n\\n\\n let u = self.normal.dot(dir);\\n\\n if !u.near_zero_eps() {\\n\\n let k = self.normal.x * self.center.x + self.normal.y * self.center.y + self.normal.z * self.center.z;\\n\\n let s = self.normal.x * origin.x + self.normal.y * origin.y + self.normal.z * origin.z;\\n\\n let t = (k-s) / u;\\n\\n if t.greater_eq_eps(&0.0) {\\n\",\n \"file_path\": \"src/core/view.rs\",\n \"rank\": 88,\n \"score\": 12.285608300187251\n },\n {\n \"content\": \"use core::{RayIntersection, RayCaster, LightIntersection, LightSource, Illuminator};\\n\\n\\n\\npub type LightSourceVec = Vec<Box<LightSource>>;\\n\\n\\n\\npub struct SimpleIlluminator {\\n\\n lights : LightSourceVec\\n\\n}\\n\\n\\n\\nimpl SimpleIlluminator {\\n\\n pub fn new(lights: LightSourceVec) -> Self {\\n\\n Self { lights: lights}\\n\\n }\\n\\n}\\n\\n\\n\\nimpl Illuminator for SimpleIlluminator {\\n\\n fn get_illumination_at(&self, intersection: &RayIntersection, illumination_caster: &RayCaster) -> Vec<LightIntersection> {\\n\\n self.lights.iter().filter_map(|light| {\\n\\n match light.get_ray_to_intersection(intersection) {\\n\\n None => None,\\n\\n Some(ray) => {\\n\",\n \"file_path\": \"src/basic/illuminator.rs\",\n \"rank\": 89,\n \"score\": 12.16001220351592\n },\n {\n \"content\": \"use defs::{IntType, FloatType, Point2Int};\\n\\n\\n\\nuse core::{Screen, Color, ImmutableSceneBuffer, SceneBufferError};\\n\\nuse basic::{Rect, RectIterator};\\n\\nuse tools::{CompareWithTolerance};\\n\\n\\n\\npub struct MedianFilter<'obuffer> {\\n\\n original_buffer: &'obuffer ImmutableSceneBuffer,\\n\\n rect_radius: IntType,\\n\\n}\\n\\n\\n\\nimpl<'obuffer> MedianFilter<'obuffer> {\\n\\n pub fn new(original_buffer: &'obuffer ImmutableSceneBuffer, rect_radius: IntType) -> Self {\\n\\n Self {\\n\\n original_buffer: original_buffer,\\n\\n rect_radius: rect_radius\\n\\n }\\n\\n }\\n\\n\\n\\n fn get_vector_median(vector: &mut Vec<FloatType>) -> Option<FloatType> {\\n\",\n \"file_path\": \"src/basic/postprocessing/filter.rs\",\n \"rank\": 90,\n \"score\": 12.02106609319575\n },\n {\n \"content\": \"use std::cmp::Ordering;\\n\\nuse defs::{Vector3, FloatType, IntType, FLOAT_ULPS_TOLERANCE};\\n\\nuse ::na;\\n\\nuse ::numt::Num;\\n\\nuse ::numt::float::Float;\\n\\nuse ::flcmp::ApproxOrdUlps;\\n\\n\\n\\n\\n\",\n \"file_path\": \"src/tools.rs\",\n \"rank\": 91,\n \"score\": 11.81753894700585\n },\n {\n \"content\": \"pub type FloatType = f64;\\n\\npub type IntType = i32;\\n\\n\\n\\npub type VectorRow4 = super::na::core::Matrix1x4<FloatType>;\\n\\npub type VectorColumn4 = super::na::core::Vector4<FloatType>;\\n\\n\\n\\npub type Matrix4 = super::na::core::Matrix4<FloatType>;\\n\\npub type Matrix3 = super::na::core::Matrix3<FloatType>;\\n\\n\\n\\npub type Point3 = super::na::Point3<FloatType>;\\n\\npub type Vector3 = super::na::core::Vector3<FloatType>;\\n\\n\\n\\npub type Point2 = super::na::Point2<FloatType>;\\n\\npub type Vector2 = super::na::Vector2<FloatType>;\\n\\n\\n\\npub type Point2Int = super::na::Point2<IntType>;\\n\\npub type Vector2Int = super::na::Vector2<IntType>;\\n\\n\\n\\npub static FLOAT_ULPS_TOLERANCE: i64 = 65536;\",\n \"file_path\": \"src/defs.rs\",\n \"rank\": 92,\n \"score\": 11.675129101599978\n },\n {\n \"content\": \"\\n\\n assert_eq!(result, Point2Int::new(250, 250));\\n\\n }\\n\\n\\n\\n #[test]\\n\\n fn screen_get_intersected_pixel_miss() {\\n\\n let test_screen = Screen::new_unit(Point3::origin(), Vector3::new(0.0, 0.0, 1.0), Vector3::new(0.0, 1.0, 0.0), 1.0, 1.0, 1000);\\n\\n let test_ray = Ray::new(Point3::new(0.6, 0.6, 1.0), Vector3::new(0.0, 0.0, -1.0));\\n\\n\\n\\n assert!(test_screen.get_intersected_pixel(&test_ray).is_none());\\n\\n }\\n\\n}\",\n \"file_path\": \"src/core/view.rs\",\n \"rank\": 93,\n \"score\": 11.636557993869655\n },\n {\n \"content\": \"\\n\\n#[derive(Debug)]\\n\\npub enum ViewError {\\n\\n ScreenRelated(ScreenError)\\n\\n}\\n\\n\\n\\n#[derive(Copy, Clone)]\\n\\npub struct View {\\n\\n screen: Screen,\\n\\n eye: Eye\\n\\n}\\n\\n\\n\\nimpl View {\\n\\n pub fn new(screen: Screen, eye: Eye) -> Self {\\n\\n Self { screen: screen,\\n\\n eye: eye}\\n\\n }\\n\\n\\n\\n pub fn new_unit(eye_position: Point3, eye_direction: Vector3, screen_up: Vector3, screen_width_to_height_ratio: FloatType, screen_height: FloatType, screen_v_res: IntType) -> Self{\\n\\n let eye_unit_direction = Unit::new_normalize(eye_direction);\\n\",\n \"file_path\": \"src/core/view.rs\",\n \"rank\": 94,\n \"score\": 11.406981341932742\n },\n {\n \"content\": \"\\n\\n rotate_around_normal * rotate_to_normal * view\\n\\n }\\n\\n\\n\\n pub fn get_diffuse_direction_ray(&self, pitch: FloatType, yaw: FloatType) -> Result<Ray, RayPropagatorError> {\\n\\n Ray::continue_ray_from_intersection(self.intersection, self.get_diffuse_direction_vector(pitch, yaw)).map_err(|ray_error| {\\n\\n match ray_error {\\n\\n RayError::DepthLimitReached => RayPropagatorError::RayRelated(ray_error),\\n\\n _ => panic!(\\\"RayPropagator encountered unhandleable RayError\\\")\\n\\n }\\n\\n })\\n\\n }\\n\\n}\\n\\n\\n\\n\\n\\n#[cfg(test)]\\n\\nmod tests {\\n\\n use super::*;\\n\\n use defs::{Point3};\\n\\n use core::{Material};\\n\",\n \"file_path\": \"src/core/propagation.rs\",\n \"rank\": 95,\n \"score\": 11.387437710618428\n },\n {\n \"content\": \" pub fn new(id: Uuid, color: Color) -> Self {\\n\\n Self {\\n\\n id: id,\\n\\n color: color\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\n#[derive(Debug)]\\n\\npub enum GlobalIlluminationShaderError {\\n\\n InvalidCoord,\\n\\n MutexLockError,\\n\\n NotExistingModelId\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/basic/postprocessing/gi.rs\",\n \"rank\": 96,\n \"score\": 10.97825651161935\n },\n {\n \"content\": \"use defs::{Point2Int};\\n\\nuse core::{RayCaster, IlluminationCaster, View, Color, RayIntersection, Screen, ScreenIterator};\\n\\nuse std::sync::{Arc, Mutex};\\n\\n\\n\\n\\n\\n#[derive(Debug)]\\n\\npub enum SceneError {\\n\\n NothingIntersected,\\n\\n InvalidInputCoord\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/core/scene.rs\",\n \"rank\": 97,\n \"score\": 10.974037960925195\n },\n {\n \"content\": \"use core::{RenderingTaskProducer, RenderingTask, Screen, SceneError, WorldViewTrait, ThreadSafeIterator};\\n\\nuse defs::{Point2Int, IntType};\\n\\nuse std::sync::{Arc, Mutex};\\n\\n\\n\\npub struct WorldViewTaskProducer {\\n\\n worldview: Arc<WorldViewTrait>,\\n\\n}\\n\\n\\n\\nimpl WorldViewTaskProducer {\\n\\n pub fn new(worldview: Arc<WorldViewTrait>) -> Box<RenderingTaskProducer> {\\n\\n Box::new(Self {\\n\\n worldview: worldview\\n\\n })\\n\\n } \\n\\n}\\n\\n\\n\\nimpl RenderingTaskProducer for WorldViewTaskProducer {\\n\\n fn create_task_iterator(self: Box<Self>) -> Box<ThreadSafeIterator<Item=Box<RenderingTask>>> {\\n\\n Box::new(WorldViewTaskIterator::new(Arc::clone(&self.worldview)))\\n\\n }\\n\",\n \"file_path\": \"src/basic/rendering.rs\",\n \"rank\": 98,\n \"score\": 10.261387907191448\n },\n {\n \"content\": \" None\\n\\n }\\n\\n}\\n\\n\\n\\n\\n\\npub struct SpotLightSource {\\n\\n dot_light: DotLightSource,\\n\\n direction: Unit<Vector3>,\\n\\n max_angle_rad: FloatType\\n\\n}\\n\\n\\n\\nimpl SpotLightSource {\\n\\n pub fn new(dot_light: DotLightSource, direction: Vector3, max_angle_radian: FloatType) -> Self {\\n\\n Self { dot_light: dot_light,\\n\\n direction: Unit::new_normalize(direction),\\n\\n max_angle_rad: max_angle_radian}\\n\\n }\\n\\n}\\n\\n\\n\\nimpl LightSource for SpotLightSource {\\n\",\n \"file_path\": \"src/basic/lightsource.rs\",\n \"rank\": 99,\n \"score\": 10.060635023441282\n }\n]","isConversational":false}}},{"rowIdx":2398,"cells":{"lang":{"kind":"string","value":"Rust"},"file_path":{"kind":"string","value":"src/error.rs"},"repo_name":{"kind":"string","value":"gadunga/obj-rs"},"commit":{"kind":"string","value":"581b76d40d4f5ab33612ee51098ab09d6ee568fc"},"file_code":{"kind":"string","value":"\n\nuse std::fmt;\nuse std::io;\nuse std::num::{ParseIntError, ParseFloatError};\nuse std::convert::From;\nuse std::error::Error;\n\npub type ObjResult<T> = Result<T, ObjError>;\n\n#[derive(Debug)]\npub enum ObjError {\n \n Io(io::Error),\n \n ParseInt(ParseIntError),\n \n ParseFloat(ParseFloatError),\n \n Load(LoadError)\n}\n\nmacro_rules! implmnt {\n ($name:ident, $error:path) => (\n impl From<$error> for ObjError {\n fn from(err: $error) -> Self {\n ObjError::$name(err)\n }\n }\n )\n}\n\nimpl fmt::Display for ObjError {\n fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {\n match self {\n &ObjError::Io(ref e) => e.fmt(f),\n &ObjError::ParseInt(ref e) => e.fmt(f),\n &ObjError::ParseFloat(ref e) => e.fmt(f),\n &ObjError::Load(ref e) => e.fmt(f),\n }\n }\n}\n\nimpl Error for ObjError {\n fn description(&self) -> &str {\n match *self {\n ObjError::Io(ref err) => err.description(),\n ObjError::ParseInt(ref err) => err.description(),\n ObjError::ParseFloat(ref err) => err.description(),\n ObjError::Load(ref err) => err.description(),\n }\n }\n\n fn cause(&self) -> Option<&Error> {\n match *self {\n ObjError::Io(ref err) => Some(err),\n ObjError::ParseInt(ref err) => Some(err),\n ObjError::ParseFloat(ref err) => Some(err),\n ObjError::Load(ref err) => Some(err),\n }\n }\n}\n\nimplmnt!(Io, io::Error);\nimplmnt!(ParseInt, ParseIntError);\nimplmnt!(ParseFloat, ParseFloatError);\nimplmnt!(Load, LoadError);\n\n#[derive(PartialEq, Eq, Clone, Debug)]\npub struct LoadError {\n kind: LoadErrorKind,\n desc: &'static str,\n}\n\n#[derive(Copy, PartialEq, Eq, Clone, Debug)]\npub enum LoadErrorKind {\n \n UnexpectedStatement,\n \n WrongNumberOfArguments,\n \n WrongTypeOfArguments,\n \n UntriangulatedModel,\n \n InsufficientData,\n}\n\nimpl LoadError {\n \n pub fn new(kind: LoadErrorKind, desc: &'static str) -> Self {\n LoadError { kind: kind, desc: desc }\n }\n}\n\nimpl Error for LoadError {\n fn description(&self) -> &str {\n match self.kind {\n LoadErrorKind::UnexpectedStatement => \"Met unexpected statement\",\n LoadErrorKind::WrongNumberOfArguments => \"Received wrong number of arguments\",\n LoadErrorKind::WrongTypeOfArguments => \"Received unexpected type of arguments\",\n LoadErrorKind::UntriangulatedModel => \"Model should be triangulated first to be loaded properly\",\n LoadErrorKind::InsufficientData => \"Model cannot be transformed into requested form\",\n }\n }\n}\n\nimpl fmt::Display for LoadError {\n fn fmt(&self, fmt: &mut fmt::Formatter) -> fmt::Result {\n write!(fmt, \"{}: {}\", self.description(), self.desc)\n }\n}\n\nmacro_rules! error {\n ($kind:ident, $desc:expr) => {\n return Err(\n ::std::convert::From::from(\n $crate::error::LoadError::new(\n $crate::error::LoadErrorKind::$kind, $desc\n )\n )\n )\n }\n}\n"},"prefix":{"kind":"string","value":"\n\nuse std::fmt;\nuse std::io;\nuse std::num::{ParseIntError, ParseFloatError};\nuse std::convert::From;\nuse std::error::Error;\n\npub type ObjResult<T> = Result<T, ObjError>;\n\n#[derive(Debug)]\npub enum ObjError {\n \n Io(io::Error),\n \n ParseInt(ParseIntError),\n \n ParseFloat(ParseFloatError),\n \n Load(LoadError)\n}\n\nmacro_rules! implmnt {\n ($name:ident, $error:path) => (\n impl From<$error> for ObjError {\n fn from(err: $error) -> Self {\n ObjError::$name(err)\n }\n }\n )\n}\n\nimpl fmt::Display for ObjError {\n "},"suffix":{"kind":"string","value":"\n}\n\nimpl Error for ObjError {\n fn description(&self) -> &str {\n match *self {\n ObjError::Io(ref err) => err.description(),\n ObjError::ParseInt(ref err) => err.description(),\n ObjError::ParseFloat(ref err) => err.description(),\n ObjError::Load(ref err) => err.description(),\n }\n }\n\n fn cause(&self) -> Option<&Error> {\n match *self {\n ObjError::Io(ref err) => Some(err),\n ObjError::ParseInt(ref err) => Some(err),\n ObjError::ParseFloat(ref err) => Some(err),\n ObjError::Load(ref err) => Some(err),\n }\n }\n}\n\nimplmnt!(Io, io::Error);\nimplmnt!(ParseInt, ParseIntError);\nimplmnt!(ParseFloat, ParseFloatError);\nimplmnt!(Load, LoadError);\n\n#[derive(PartialEq, Eq, Clone, Debug)]\npub struct LoadError {\n kind: LoadErrorKind,\n desc: &'static str,\n}\n\n#[derive(Copy, PartialEq, Eq, Clone, Debug)]\npub enum LoadErrorKind {\n \n UnexpectedStatement,\n \n WrongNumberOfArguments,\n \n WrongTypeOfArguments,\n \n UntriangulatedModel,\n \n InsufficientData,\n}\n\nimpl LoadError {\n \n pub fn new(kind: LoadErrorKind, desc: &'static str) -> Self {\n LoadError { kind: kind, desc: desc }\n }\n}\n\nimpl Error for LoadError {\n fn description(&self) -> &str {\n match self.kind {\n LoadErrorKind::UnexpectedStatement => \"Met unexpected statement\",\n LoadErrorKind::WrongNumberOfArguments => \"Received wrong number of arguments\",\n LoadErrorKind::WrongTypeOfArguments => \"Received unexpected type of arguments\",\n LoadErrorKind::UntriangulatedModel => \"Model should be triangulated first to be loaded properly\",\n LoadErrorKind::InsufficientData => \"Model cannot be transformed into requested form\",\n }\n }\n}\n\nimpl fmt::Display for LoadError {\n fn fmt(&self, fmt: &mut fmt::Formatter) -> fmt::Result {\n write!(fmt, \"{}: {}\", self.description(), self.desc)\n }\n}\n\nmacro_rules! error {\n ($kind:ident, $desc:expr) => {\n return Err(\n ::std::convert::From::from(\n $crate::error::LoadError::new(\n $crate::error::LoadErrorKind::$kind, $desc\n )\n )\n )\n }\n}\n"},"middle":{"kind":"string","value":"fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {\n match self {\n &ObjError::Io(ref e) => e.fmt(f),\n &ObjError::ParseInt(ref e) => e.fmt(f),\n &ObjError::ParseFloat(ref e) => e.fmt(f),\n &ObjError::Load(ref e) => e.fmt(f),\n }\n }"},"strategy":{"kind":"string","value":"function_block-full_function"},"context_items":{"kind":"list like","value":[{"content":"/// Parses a wavefront `.obj` format.\n\npub fn parse_obj<T: BufRead>(input: T) -> ObjResult<RawObj> {\n\n let mut name = None;\n\n let mut material_libraries = Vec::new();\n\n\n\n let mut positions = Vec::new();\n\n let mut tex_coords = Vec::new();\n\n let mut normals = Vec::new();\n\n let mut param_vertices = Vec::new();\n\n\n\n let mut points = Vec::new();\n\n let mut lines = Vec::new();\n\n let mut polygons = Vec::new();\n\n\n\n let counter = Counter::new(&points, &lines, &polygons);\n\n let mut group_builder = counter.hash_map(\"default\".to_string());\n\n let mut mesh_builder = counter.hash_map(String::new());\n\n let mut smoothing_builder = counter.vec_map();\n\n let mut merging_builder = counter.vec_map();\n\n\n\n try!(lex(input, |stmt, args| {\n","file_path":"src/raw/object.rs","rank":0,"score":46346.785573901754},{"content":"/// Parses a wavefront `.mtl` format *(incomplete)*\n\npub fn parse_mtl<T: BufRead>(input: T) -> ObjResult<RawMtl> {\n\n let mut materials = HashMap::new();\n\n\n\n // Properties of the material being currently parsed\n\n let mut name: Option<String> = None;\n\n let mut mat: Material = Material::default();\n\n\n\n try!(lex(input, |stmt, args| {\n\n match stmt {\n\n // Material name statement\n\n \"newmtl\" => {\n\n // Finish whatever material we were parsing\n\n if let Some(name) = name.take() {\n\n materials.insert(name, replace(&mut mat, Material::default()));\n\n }\n\n\n\n match args.len() {\n\n 1 => name = Some(args[0].to_owned()),\n\n _ => error!(WrongNumberOfArguments, \"Expected exactly 1 argument\")\n\n }\n","file_path":"src/raw/material.rs","rank":1,"score":46346.785573901754},{"content":"pub fn lex<T, F>(input: T, mut callback: F) -> ObjResult<()>\n\n where T: BufRead, F: FnMut(&str, &[&str]) -> ObjResult<()>\n\n{\n\n // This is a buffer of the \"arguments\" for each line, it uses raw pointers\n\n // in order to allow it to be re-used across iterations.\n\n let mut args : Vec<*const str> = Vec::new();\n\n\n\n // This is a buffer for continued lines joined by '\\'.\n\n let mut multi_line = String::new();\n\n\n\n for line in input.lines() {\n\n let line = line?;\n\n let line = line.split('#').next().unwrap(); // Remove comments\n\n\n\n if line.ends_with('\\\\') {\n\n multi_line.push_str(&line[..line.len()-1]);\n\n multi_line.push(' '); // Insert a space to delimit the following lines\n\n continue\n\n }\n\n\n","file_path":"src/raw/lexer.rs","rank":2,"score":44964.15696264678},{"content":"#[test]\n\nfn dome() {\n\n let obj: Obj<Position> = load_obj(fixture!(\"dome.obj\")).unwrap();\n\n\n\n macro_rules! p {\n\n ($($x:expr),*) => (Position { position: [$(stringify!($x).parse::<f32>().unwrap()),*] })\n\n }\n\n\n\n assert_eq!(obj.name, Some(\"Dome\".to_string()));\n\n assert_eq!(obj.vertices[0], p!(-0.382683, 0.923880, 0.000000));\n\n assert_eq!(obj.vertices[1], p!(-0.707107, 0.707107, 0.000000));\n\n assert_eq!(obj.indices[0], 3);\n\n assert_eq!(obj.indices[1], 2);\n\n assert_eq!(obj.indices[2], 6);\n\n}\n\n\n","file_path":"tests/obj.rs","rank":3,"score":41831.505468034855},{"content":"#[cfg(not(feature = \"glium-support\"))]\n\nfn main() {\n\n println!(\"\\n\\\n\n Please execute it with \\x1b[4m--features glium-support\\x1b[24m the option\n\n\n\n $ \\x1b[33mcargo run --example glium --features glium-support\\x1b[0m\\n\");\n\n}\n","file_path":"examples/glium.rs","rank":4,"score":41831.505468034855},{"content":"#[test]\n\nfn cube() {\n\n let mtl = fixture(\"cube.mtl\");\n\n assert_eq!(mtl.materials.len(), 1);\n\n\n\n let mat = mtl.materials.get(\"Material\").unwrap();\n\n assert_eq!(mat, &Material {\n\n ambient: Some(MtlColor::Rgb(0.0, 0.0, 0.0)),\n\n diffuse: Some(MtlColor::Rgb(0.64, 0.64, 0.64)),\n\n specular: Some(MtlColor::Rgb(0.5, 0.5, 0.5)),\n\n dissolve: Some(1.0),\n\n specular_exponent: Some(96.078431),\n\n optical_density: Some(1.0),\n\n illumination_model: Some(2),\n\n diffuse_map: Some(MtlTextureMap { file: \"cube-uv-num.png\".to_owned() }),\n\n ..Material::default()\n\n });\n\n}\n\n\n","file_path":"tests/raw-material.rs","rank":5,"score":40448.58242215944},{"content":"#[test]\n\nfn normal_cone() {\n\n let obj: Obj = load_obj(fixture!(\"normal-cone.obj\")).unwrap();\n\n\n\n macro_rules! v {\n\n (($($p:expr),*), ($($n:expr),*)) => ({\n\n Vertex {\n\n position: [$(stringify!($p).parse::<f32>().unwrap()),*],\n\n normal: [$(stringify!($n).parse::<f32>().unwrap()),*],\n\n }\n\n })\n\n }\n\n\n\n assert_eq!(obj.name, Some(\"Cone\".to_string()));\n\n assert_eq!(obj.vertices.len(), 96);\n\n assert_eq!(obj.vertices[0], v!((-0.382682, -1.000000, -0.923880), (-0.259887, 0.445488, -0.856737)));\n\n assert_eq!(obj.vertices[1], v!(( 0.000000, 1.000000, 0.000000), (-0.259887, 0.445488, -0.856737)));\n\n assert_eq!(obj.indices.len(), 96);\n\n assert_eq!(obj.indices[0], 0);\n\n assert_eq!(obj.indices[1], 1);\n\n assert_eq!(obj.indices[2], 2);\n\n}\n\n\n","file_path":"tests/obj.rs","rank":6,"score":40448.58242215944},{"content":"#[test]\n\nfn textured_cube() {\n\n let obj: Obj<TexturedVertex, u32> = load_obj(fixture!(\"textured-cube.obj\")).unwrap();\n\n\n\n macro_rules! vt {\n\n (($($p:expr),*), ($($n:expr),*), ($($t:expr),*)) => ({\n\n TexturedVertex {\n\n position: [$(stringify!($p).parse::<f32>().unwrap()),*],\n\n normal: [$(stringify!($n).parse::<f32>().unwrap()),*],\n\n texture: [$(stringify!($t).parse::<f32>().unwrap()),*]\n\n }\n\n })\n\n }\n\n\n\n assert_eq!(obj.name, Some(\"cube\".to_string()));\n\n assert_eq!(obj.vertices.len(), 24);\n\n dbg!(&obj.vertices);\n\n assert_eq!(obj.vertices[0], vt!((-0.500000, -0.500000, 0.500000), (0.000000, 0.000000, 1.000000), (0.000000, 0.000000, 0.000000)));\n\n assert_eq!(obj.vertices[1], vt!((0.500000, -0.500000, 0.500000), (0.000000, 0.000000, 1.000000), (1.000000, 0.000000, 0.000000)));\n\n assert_eq!(obj.vertices[2], vt!((-0.500000, 0.500000, 0.500000), (0.000000, 0.000000, 1.000000), (0.000000, 1.000000, 0.000000)));\n\n assert_eq!(obj.vertices[3], vt!((0.500000, 0.500000, 0.500000), (0.000000, 0.000000, 1.000000), (1.000000, 1.000000, 0.000000))); \n","file_path":"tests/obj.rs","rank":7,"score":40448.58242215944},{"content":"#[test]\n\nfn dome() {\n\n let obj = fixture(\"dome.obj\");\n\n\n\n test! {\n\n obj.name, Some(\"Dome\".to_string())\n\n obj.material_libraries, vec![ \"dome.mtl\" ]\n\n\n\n obj.positions.len(), 33\n\n obj.tex_coords.len(), 0\n\n obj.normals.len(), 0\n\n obj.param_vertices.len(), 0\n\n\n\n obj.points.len(), 0\n\n obj.lines.len(), 0\n\n obj.polygons.len(), 62\n\n\n\n obj.groups.len(), 1\n\n obj.meshes.len(), 1\n\n obj.smoothing_groups.len(), 2\n\n obj.merging_groups.len(), 0\n","file_path":"tests/raw-basics.rs","rank":8,"score":40448.58242215944},{"content":"#[test]\n\nfn cube() {\n\n let obj = fixture(\"cube.obj\");\n\n\n\n test! {\n\n obj.name, Some(\"Cube\".to_string())\n\n obj.material_libraries, vec![ \"cube.mtl\" ]\n\n\n\n obj.positions.len(), 8\n\n obj.tex_coords.len(), 14\n\n obj.normals.len(), 0\n\n obj.param_vertices.len(), 0\n\n\n\n obj.points.len(), 0\n\n obj.lines.len(), 0\n\n obj.polygons.len(), 6\n\n\n\n obj.groups.len(), 1\n\n obj.meshes.len(), 1\n\n obj.smoothing_groups.len(), 0\n\n obj.merging_groups.len(), 0\n","file_path":"tests/raw-basics.rs","rank":9,"score":40448.58242215944},{"content":"#[test]\n\nfn untitled() {\n\n let mtl = fixture(\"untitled.mtl\");\n\n assert_eq!(mtl.materials.len(), 2);\n\n\n\n let mat = mtl.materials.get(\"Material\").unwrap();\n\n assert_eq!(mat, &Material {\n\n ambient: Some(MtlColor::Rgb(0.0, 0.0, 0.0)),\n\n diffuse: Some(MtlColor::Rgb(0.64, 0.64, 0.64)),\n\n specular: Some(MtlColor::Rgb(0.5, 0.5, 0.5)),\n\n dissolve: Some(1.0),\n\n specular_exponent: Some(96.078431),\n\n optical_density: Some(1.0),\n\n illumination_model: Some(2),\n\n ..Material::default()\n\n });\n\n\n\n let mat = mtl.materials.get(\"None\").unwrap();\n\n assert_eq!(mat, &Material {\n\n ambient: Some(MtlColor::Rgb(0.0, 0.0, 0.0)),\n\n diffuse: Some(MtlColor::Rgb(0.8, 0.8, 0.8)),\n\n specular: Some(MtlColor::Rgb(0.8, 0.8, 0.8)),\n\n dissolve: Some(1.0),\n\n specular_exponent: Some(0.0),\n\n illumination_model: Some(2),\n\n ..Material::default()\n\n });\n\n}\n","file_path":"tests/raw-material.rs","rank":10,"score":40448.58242215944},{"content":"#[test]\n\nfn sponza() {\n\n // Sponza atrium model, it's reasonably big and more importantly uses negative indexes\n\n // for some of the face specifications.\n\n let obj = fixture(\"sponza.obj\");\n\n\n\n test! {\n\n obj.name, Some(\"sponza.lwo\".to_owned())\n\n obj.positions.len(), 39742\n\n obj.polygons.len(), 36347\n\n }\n\n}\n\n\n","file_path":"tests/raw-basics.rs","rank":11,"score":40448.58242215944},{"content":"#[test]\n\nfn empty() {\n\n let obj = fixture(\"empty.obj\");\n\n\n\n test! {\n\n obj.name, None\n\n obj.material_libraries, Vec::<String>::new()\n\n\n\n obj.positions.len(), 0\n\n obj.tex_coords.len(), 0\n\n obj.normals.len(), 0\n\n obj.param_vertices.len(), 0\n\n\n\n obj.points.len(), 0\n\n obj.lines.len(), 0\n\n obj.polygons.len(), 0\n\n\n\n obj.groups.len(), 0\n\n obj.meshes.len(), 0\n\n obj.smoothing_groups.len(), 0\n\n obj.merging_groups.len(), 0\n\n }\n\n}\n\n\n","file_path":"tests/raw-basics.rs","rank":12,"score":40448.58242215944},{"content":"#[test]\n\nfn lines_points() {\n\n // Basic test for lines and points geometry statements\n\n let obj = fixture(\"lines_points.obj\");\n\n\n\n test! {\n\n obj.name, Some(\"lines.obj\".to_owned())\n\n obj.positions.len(), 3\n\n obj.tex_coords.len(), 2\n\n obj.lines.len(), 2\n\n obj.points.len(), 3\n\n }\n\n}\n","file_path":"tests/raw-basics.rs","rank":13,"score":39218.029523281875},{"content":"#[test]\n\nfn dup_groupnames() {\n\n let input = BufReader::new(File::open(\"tests/fixtures/group.obj\").unwrap());\n\n let raw = match parse_obj(input) {\n\n Ok(raw) => raw,\n\n Err(e) => panic!(e)\n\n };\n\n\n\n test! {\n\n raw.smoothing_groups.len(), 2\n\n raw.smoothing_groups[1].points.len(), 0\n\n raw.smoothing_groups[1].lines.len(), 0\n\n raw.smoothing_groups[1].polygons.len(), 2\n\n raw.smoothing_groups[1].polygons[0], Range { start: 0, end: 3 }\n\n raw.smoothing_groups[1].polygons[1], Range { start: 6, end: 9 }\n\n raw.smoothing_groups[2].points.len(), 0\n\n raw.smoothing_groups[2].lines.len(), 0\n\n raw.smoothing_groups[2].polygons.len(), 1\n\n raw.smoothing_groups[2].polygons[0], Range { start: 3, end: 6 }\n\n }\n\n}\n","file_path":"tests/raw-group.rs","rank":14,"score":39218.029523281875},{"content":"#[test]\n\nfn test_lex() {\n\n let input = r#\"\n\n statement0 arg0 arg1\targ2#argX argX\n\nstatement1 arg0 arg1\n\n# Comment\n\nstatement2 Hello, world!\n\nbmat u 1 -3 3 -1 \\\n\n 0 3 -6 3 \\\n\n 0 0 3 -3 \\\n\n 0 0 0 1\n\nbmat u 1 -3 3 -1 0 3 -6 3 \\\n\n 0 0 3 -3 0 0 0 1\n\nbmat u 1 -3 3 -1 0 3 -6 3 0 0 3 -3 0 0 0 1\n\n\"#;\n\n\n\n assert!(lex(&mut input.as_bytes(), |stmt, args| {\n\n match stmt {\n\n \"statement0\" => assert_eq!(args, [\"arg0\", \"arg1\", \"arg2\"]),\n\n \"statement1\" => assert_eq!(args, [\"arg0\", \"arg1\"]),\n\n \"statement2\" => assert_eq!(args, [\"Hello,\", \"world!\"]),\n\n \"bmat\" => assert_eq!(args, [\"u\", \"1\", \"-3\", \"3\", \"-1\", \"0\", \"3\", \"-6\", \"3\", \"0\", \"0\", \"3\", \"-3\", \"0\", \"0\", \"0\", \"1\"]),\n\n _ => panic!(\"Unit test failed\")\n\n }\n\n Ok(())\n\n }).is_ok());\n\n}\n","file_path":"src/raw/lexer.rs","rank":15,"score":39218.029523281875},{"content":"/// Load a wavefront OBJ file into Rust & OpenGL friendly format.\n\npub fn load_obj<V: FromRawVertex<I>, T: BufRead, I>(input: T) -> ObjResult<Obj<V, I>> {\n\n let raw = try!(raw::parse_obj(input));\n\n Obj::new(raw)\n\n}\n\n\n\n/// 3D model object loaded from wavefront OBJ.\n\n#[derive(Serialize, Deserialize)]\n\npub struct Obj<V = Vertex, I = u16> {\n\n /// Object's name.\n\n pub name: Option<String>,\n\n /// Vertex buffer.\n\n pub vertices: Vec<V>,\n\n /// Index buffer.\n\n pub indices: Vec<I>,\n\n}\n\n\n\nimpl<V: FromRawVertex<I>, I> Obj<V, I> {\n\n /// Create `Obj` from `RawObj` object.\n\n pub fn new(raw: raw::RawObj) -> ObjResult<Self> {\n\n let (vertices, indices) = try!(FromRawVertex::process(raw.positions, raw.normals, raw.tex_coords, raw.polygons));\n\n\n\n Ok(Obj {\n\n name: raw.name,\n\n vertices: vertices,\n\n indices: indices\n\n })\n\n }\n\n}\n\n\n","file_path":"src/lib.rs","rank":16,"score":38767.13983613928},{"content":"/// Conversion from `RawObj`'s raw data.\n\npub trait FromRawVertex<I> : Sized {\n\n /// Build vertex and index buffer from raw object data.\n\n fn process(vertices: Vec<(f32, f32, f32, f32)>, normals: Vec<(f32, f32, f32)>, tex_coords: Vec<(f32, f32, f32)>, polygons: Vec<Polygon>) -> ObjResult<(Vec<Self>, Vec<I>)>;\n\n}\n\n\n\n/// Vertex data type of `Obj` which contains position and normal data of a vertex.\n\n#[derive(Copy, PartialEq, Clone, Debug, Serialize, Deserialize)]\n\npub struct Vertex {\n\n /// Position vector of a vertex.\n\n pub position: [f32; 3],\n\n /// Normal vertor of a vertex.\n\n pub normal: [f32; 3],\n\n}\n\n\n\n#[cfg(feature = \"glium-support\")]\n\nimplement_vertex!(Vertex, position, normal);\n\n\n\nimpl<I: FromPrimitive + Integer + Copy> FromRawVertex<I> for Vertex {\n\n fn process(positions: Vec<(f32, f32, f32, f32)>, normals: Vec<(f32, f32, f32)>, _: Vec<(f32, f32, f32)>, polygons: Vec<Polygon>) -> ObjResult<(Vec<Self>, Vec<I>)> {\n\n let mut vb = Vec::with_capacity(polygons.len() * 3);\n","file_path":"src/lib.rs","rank":17,"score":35028.287816044125},{"content":"#[bench]\n\nfn sponza(b: &mut Bencher) {\n\n let data = load_file(\"sponza.obj\");\n\n let mut data = std::io::Cursor::new(&data[..]);\n\n b.iter(|| {\n\n parse_obj(&mut data).unwrap()\n\n });\n\n}\n","file_path":"benches/bench.rs","rank":18,"score":33412.84336503969},{"content":"fn fixture(filename: &str) -> RawMtl {\n\n use std::path::Path;\n\n use std::fs::File;\n\n use std::io::BufReader;\n\n\n\n let path = Path::new(\"tests\").join(\"fixtures\").join(filename);\n\n let file = match File::open(&path) {\n\n Ok(f) => f,\n\n Err(e) => panic!(\"Failed to open \\\"{}\\\". \\x1b[31m{}\\x1b[0m\", path.to_string_lossy(), e)\n\n };\n\n let input = BufReader::new(file);\n\n\n\n parse_mtl(input).unwrap()\n\n}\n\n\n","file_path":"tests/raw-material.rs","rank":19,"score":30419.299672512065},{"content":"fn fixture(filename: &str) -> RawObj {\n\n use std::path::Path;\n\n use std::fs::File;\n\n use std::io::BufReader;\n\n\n\n let path = Path::new(\"tests\").join(\"fixtures\").join(filename);\n\n let file = match File::open(&path) {\n\n Ok(f) => f,\n\n Err(e) => panic!(\"Failed to open \\\"{}\\\". \\x1b[31m{}\\x1b[0m\", path.to_string_lossy(), e)\n\n };\n\n let input = BufReader::new(file);\n\n\n\n parse_obj(input).unwrap()\n\n}\n\n\n\nmacro_rules! test_v4 {\n\n ($lhs:expr => $($x:expr, $y:expr, $z:expr, $w:expr;)*) => ({\n\n let mut index = 0usize;\n\n $(\n\n let (x, y, z, w) = $lhs[index];\n","file_path":"tests/raw-basics.rs","rank":20,"score":30419.299672512065},{"content":"fn load_file(filename: &str) -> Vec<u8> {\n\n use std::path::Path;\n\n use std::fs::File;\n\n use std::io::Read;\n\n\n\n let path = Path::new(\"tests\").join(\"fixtures\").join(filename);\n\n let mut file = match File::open(&path) {\n\n Ok(f) => f,\n\n Err(e) => panic!(\"Failed to open \\\"{}\\\". \\x1b[31m{}\\x1b[0m\", path.to_string_lossy(), e)\n\n };\n\n\n\n let mut data = Vec::new();\n\n match file.read_to_end(&mut data) {\n\n Err(e) => panic!(\"Failed to read \\\"{}\\\". \\x1b[31m{}\\x1b[0m\", path.to_string_lossy(), e),\n\n Ok(_) => ()\n\n }\n\n\n\n data\n\n}\n\n\n","file_path":"benches/bench.rs","rank":21,"score":29231.394964624236},{"content":"/// Parses a color from the arguments of a statement\n\nfn parse_color(args: &[&str]) -> ObjResult<MtlColor> {\n\n if args.is_empty() {\n\n error!(WrongNumberOfArguments, \"Expected at least 1 argument\");\n\n }\n\n\n\n Ok(match args[0] {\n\n \"xyz\" => {\n\n let args = f!(&args[1..]);\n\n match args.len() {\n\n 1 => MtlColor::Xyz(args[0], args[0], args[0]),\n\n 3 => MtlColor::Xyz(args[0], args[1], args[2]),\n\n _ => error!(WrongNumberOfArguments, \"Expected 1 or 3 color values\")\n\n }\n\n }\n\n\n\n \"spectral\" => {\n\n match args.len() {\n\n 2 => MtlColor::Spectral(args[1].to_owned(), 1.0),\n\n 3 => MtlColor::Spectral(args[1].to_owned(), try!(args[2].parse())),\n\n _ => error!(WrongNumberOfArguments, \"Expected 2 or 3 arguments\")\n","file_path":"src/raw/material.rs","rank":22,"score":26981.52256242364},{"content":"/// Parses a texture map specification from the arguments of a statement\n\nfn parse_texture_map(args: &[&str]) -> ObjResult<MtlTextureMap> {\n\n if args.len() == 1 {\n\n Ok(MtlTextureMap { file: args[0].to_owned() })\n\n } else {\n\n error!(WrongNumberOfArguments, \"Expected exactly 1 argument\")\n\n }\n\n}\n\n\n\n/// Low-level Rust binding for `.mtl` format *(incomplete)*.\n\n#[derive(Clone, Debug)]\n\npub struct RawMtl {\n\n /// Map from the material name to its properties\n\n pub materials: HashMap<String, Material>\n\n}\n\n\n\n/// A single material from a `.mtl` file\n\n#[derive(Clone, PartialEq, Debug, Default)]\n\npub struct Material {\n\n /// The ambient color, specified by `Ka`\n\n pub ambient: Option<MtlColor>,\n","file_path":"src/raw/material.rs","rank":30,"score":25768.37464512796},{"content":"// Parses the vertex group in the face statement, missing entries\n\n// are indicated with a 0 value\n\nfn parse_vertex_group(s: &str) -> ObjResult<(i32, i32, i32)> {\n\n let mut indices = s.split('/');\n\n\n\n let first = indices.next().unwrap_or(\"\");\n\n let second = indices.next().unwrap_or(\"\");\n\n let third = indices.next().unwrap_or(\"\");\n\n\n\n let first = try!(first.parse());\n\n let second = if second == \"\" {\n\n 0\n\n } else {\n\n try!(second.parse())\n\n };\n\n\n\n let third = if third == \"\" {\n\n 0\n\n } else {\n\n try!(third.parse())\n\n };\n\n\n\n Ok((first, second, third))\n\n}\n\n\n\n\n","file_path":"src/raw/object.rs","rank":31,"score":24551.694624674812},{"content":"#[macro_use] mod error;\n\npub mod raw;\n\n\n\nuse num::{FromPrimitive, Integer};\n\nuse std::io::BufRead;\n\nuse std::collections::hash_map::{HashMap, Entry};\n\nuse raw::object::Polygon;\n\npub use error::{ObjResult, ObjError, LoadError, LoadErrorKind};\n\n\n\n/// Load a wavefront OBJ file into Rust & OpenGL friendly format.\n","file_path":"src/lib.rs","rank":32,"score":9.145514236046079},{"content":" use glium::{vertex, index, VertexBuffer, IndexBuffer};\n\n use glium::backend::Facade;\n\n use super::Obj;\n\n\n\n impl<V: vertex::Vertex, I: glium::index::Index> Obj<V, I> {\n\n /// Retrieve glium-compatible vertex buffer from Obj\n\n pub fn vertex_buffer<F: Facade>(&self, facade: &F) -> Result<VertexBuffer<V>, vertex::BufferCreationError> {\n\n VertexBuffer::new(facade, &self.vertices)\n\n }\n\n\n\n /// Retrieve glium-compatible index buffer from Obj\n\n pub fn index_buffer<F: Facade>(&self, facade: &F) -> Result<IndexBuffer<I>, index::BufferCreationError> {\n\n IndexBuffer::new(facade, index::PrimitiveType::TrianglesList, &self.indices)\n\n }\n\n }\n\n}\n","file_path":"src/lib.rs","rank":33,"score":8.728070407893533},{"content":" if group.2 != 0 {\n\n error!(WrongTypeOfArguments, \"Unexpected vertex format\");\n\n }\n\n\n\n points.push((\n\n idx!(group.0, positions),\n\n idx!(group.1, tex_coords)));\n\n }\n\n Line::PT(points)\n\n }\n\n _ => {\n\n error!(WrongTypeOfArguments, \"Unexpected vertex format, expected `#` or `#/#`\");\n\n }\n\n };\n\n lines.push(line);\n\n }\n\n \"fo\" | \"f\" => {\n\n if args.len() < 3 { error!(WrongNumberOfArguments, \"Expected at least 3 arguments\") }\n\n\n\n let mut args = args.iter();\n","file_path":"src/raw/object.rs","rank":34,"score":5.367314921518111},{"content":"// Copyright 2014-2017 Hyeon Kim\n\n//\n\n// Licensed under the Apache License, Version 2.0 <LICENSE-APACHE or\n\n// http://www.apache.org/licenses/LICENSE-2.0> or the MIT license\n\n// <LICENSE-MIT or http://opensource.org/licenses/MIT>, at your\n\n// option. This file may not be copied, modified, or distributed\n\n// except according to those terms.\n\n\n\n//! Provides low-level API for Wavefront OBJ format.\n\n\n\nmod lexer;\n\npub mod object;\n\npub mod material;\n\n\n\npub use self::object::{parse_obj, RawObj};\n\npub use self::material::{parse_mtl, RawMtl};\n","file_path":"src/raw/mod.rs","rank":35,"score":5.189779181376492},{"content":" 2 if args[0] == \"rat\" => { _rational = true; args[1] }\n\n 1 => { _rational = false; args[0] }\n\n _ => error!(WrongTypeOfArguments, \"Expected 'rat xxx' or 'xxx' format\")\n\n };\n\n\n\n match geometry {\n\n \"bmatrix\" => unimplemented!(),\n\n \"bezier\" => unimplemented!(),\n\n \"bspline\" => unimplemented!(),\n\n \"cardinal\" => unimplemented!(),\n\n \"taylor\" => unimplemented!(),\n\n _ => error!(WrongTypeOfArguments, \"Expected one of 'bmatrix', 'bezier', 'bspline', 'cardinal' and 'taylor'\")\n\n }\n\n }\n\n \"deg\" => {\n\n let args = f!(args);\n\n match args.len() {\n\n 2 => unimplemented!(), // (deg_u, deg_v)\n\n 1 => unimplemented!(), // (deg_u)\n\n _ => error!(WrongNumberOfArguments, \"Expected 1 or 2 arguments\")\n","file_path":"src/raw/object.rs","rank":36,"score":4.944046430002453},{"content":"pub struct TexturedVertex {\n\n /// Position vector of a vertex.\n\n pub position: [f32; 3],\n\n /// Normal vertor of a vertex.\n\n pub normal: [f32; 3],\n\n /// Texture of a vertex.\n\n pub texture: [f32; 3]\n\n}\n\n\n\n#[cfg(feature = \"glium-support\")]\n\nimplement_vertex!(TexturedVertex, position, normal, texture);\n\n\n\nimpl<I: FromPrimitive + Integer + Copy> FromRawVertex<I> for TexturedVertex {\n\n fn process(positions: Vec<(f32, f32, f32, f32)>, normals: Vec<(f32, f32, f32)>, tex_coords: Vec<(f32, f32, f32)>, polygons: Vec<Polygon>) -> ObjResult<(Vec<Self>, Vec<I>)> {\n\n let mut vb = Vec::with_capacity(polygons.len() * 3);\n\n let mut ib = Vec::with_capacity(polygons.len() * 3);\n\n {\n\n let mut cache = HashMap::new();\n\n let mut map = |pi: usize, ni: usize, ti: usize| {\n\n // Look up cache\n","file_path":"src/lib.rs","rank":37,"score":4.927458782157471},{"content":"// Copyright 2014-2017 Hyeon Kim\n\n//\n\n// Licensed under the Apache License, Version 2.0 <LICENSE-APACHE or\n\n// http://www.apache.org/licenses/LICENSE-2.0> or the MIT license\n\n// <LICENSE-MIT or http://opensource.org/licenses/MIT>, at your\n\n// option. This file may not be copied, modified, or distributed\n\n// except according to those terms.\n\n\n\nuse std;\n\nuse std::io::prelude::*;\n\nuse error::ObjResult;\n\n\n","file_path":"src/raw/lexer.rs","rank":38,"score":4.614878601498033},{"content":"\n\n\n\n/// Constant which is used to represent undefined bound of range.\n\nconst UNDEFINED: usize = ::std::usize::MAX;\n\n\n\nimpl Group {\n\n fn new(count: (usize, usize, usize)) -> Self {\n\n let mut ret = Group {\n\n points: Vec::with_capacity(1),\n\n lines: Vec::with_capacity(1),\n\n polygons: Vec::with_capacity(1)\n\n };\n\n ret.start(count);\n\n ret\n\n }\n\n\n\n fn start(&mut self, count: (usize, usize, usize)) {\n\n self.points.push(Range { start: count.0, end: UNDEFINED });\n\n self.lines.push(Range { start: count.1, end: UNDEFINED });\n\n self.polygons.push(Range { start: count.2, end: UNDEFINED })\n","file_path":"src/raw/object.rs","rank":39,"score":4.52697892129598},{"content":" /// The diffuse color, specified by `Kd`\n\n pub diffuse: Option<MtlColor>,\n\n /// The specular color, specified by `Ks`\n\n pub specular: Option<MtlColor>,\n\n /// The emissive color, specified by `Ke`\n\n pub emissive: Option<MtlColor>,\n\n /// The transmission filter, specified by `Tf`\n\n pub transmission_filter: Option<MtlColor>,\n\n /// The illumination model to use for this material; see the `.mtl` spec for more details.\n\n pub illumination_model: Option<u32>,\n\n /// The dissolve (opacity) of the material, specified by `d`\n\n pub dissolve: Option<f32>,\n\n /// The specular exponent, specified by `Ne`\n\n pub specular_exponent: Option<f32>,\n\n /// The optical density, i.e. index of refraction, specified by `Ni`\n\n pub optical_density: Option<f32>,\n\n /// The ambient color map, specified by `map_Ka`\n\n pub ambient_map: Option<MtlTextureMap>,\n\n /// The diffuse color map, specified by `map_Kd`\n\n pub diffuse_map: Option<MtlTextureMap>,\n","file_path":"src/raw/material.rs","rank":40,"score":4.430365112993197},{"content":"// Copyright 2014-2017 Hyeon Kim\n\n//\n\n// Licensed under the Apache License, Version 2.0 <LICENSE-APACHE or\n\n// http://www.apache.org/licenses/LICENSE-2.0> or the MIT license\n\n// <LICENSE-MIT or http://opensource.org/licenses/MIT>, at your\n\n// option. This file may not be copied, modified, or distributed\n\n// except according to those terms.\n\n\n\n//! Parses `.mtl` format which stores material data\n\n\n\nuse std::io::prelude::*;\n\nuse std::collections::HashMap;\n\nuse std::mem::replace;\n\n\n\nuse error::ObjResult;\n\nuse raw::lexer::lex;\n\n\n\n/// Parses &[&str] into &[f32].\n\nmacro_rules! f {\n\n ($args:expr) => (\n","file_path":"src/raw/material.rs","rank":41,"score":4.383881059861473},{"content":"// Copyright 2014-2017 Hyeon Kim\n\n//\n\n// Licensed under the Apache License, Version 2.0 <LICENSE-APACHE or\n\n// http://www.apache.org/licenses/LICENSE-2.0> or the MIT license\n\n// <LICENSE-MIT or http://opensource.org/licenses/MIT>, at your\n\n// option. This file may not be copied, modified, or distributed\n\n// except according to those terms.\n\n\n\n//! Parses `.obj` format which stores 3D mesh data\n\n\n\nuse std::io::BufRead;\n\nuse std::collections::HashMap;\n\nuse vec_map::VecMap;\n\nuse error::ObjResult;\n\nuse raw::lexer::lex;\n\n\n\n/// Parses &[&str] into &[f32].\n\nmacro_rules! f {\n\n ($args:expr) => (\n\n &{\n","file_path":"src/raw/object.rs","rank":42,"score":4.31264260892797},{"content":"}\n\n\n\n/// Vertex data type of `Obj` which contains only position data of a vertex.\n\n#[derive(Copy, PartialEq, Clone, Debug, Serialize, Deserialize)]\n\npub struct Position {\n\n /// Position vector of a vertex.\n\n pub position: [f32; 3]\n\n}\n\n\n\n#[cfg(feature = \"glium-support\")]\n\nimplement_vertex!(Position, position);\n\n\n\nimpl<I: FromPrimitive + Integer> FromRawVertex<I> for Position {\n\n fn process(vertices: Vec<(f32, f32, f32, f32)>, _: Vec<(f32, f32, f32)>, _: Vec<(f32, f32, f32)>, polygons: Vec<Polygon>) -> ObjResult<(Vec<Self>, Vec<I>)> {\n\n let vb = vertices.into_iter().map(|v| Position { position: [v.0, v.1, v.2] }).collect();\n\n let mut ib = Vec::with_capacity(polygons.len() * 3);\n\n {\n\n let mut map = |pi: usize| { ib.push(I::from_usize(pi).expect(\"Unable to convert the index from usize\")) };\n\n\n\n for polygon in polygons {\n","file_path":"src/lib.rs","rank":43,"score":4.262158990687179},{"content":" /// The specular color map, specified by `map_Ks`\n\n pub specular_map: Option<MtlTextureMap>,\n\n /// The emissive color map, specified by `map_Ke`\n\n pub emissive_map: Option<MtlTextureMap>,\n\n /// The dissolve map, specified by `map_d`\n\n pub dissolve_map: Option<MtlTextureMap>,\n\n /// The bump map (normal map), specified by `bump`\n\n pub bump_map: Option<MtlTextureMap>,\n\n}\n\n\n\n/// A color specified in a `.mtl` file\n\n#[derive(Clone, PartialEq, Debug)]\n\npub enum MtlColor {\n\n /// Color in the RGB color space\n\n Rgb(f32, f32, f32),\n\n /// Color in the CIEXYZ color space\n\n Xyz(f32, f32, f32),\n\n /// Color using a spectral curve\n\n ///\n\n /// The first argument is the name of a `.rfl` file specifying the curve.\n","file_path":"src/raw/material.rs","rank":44,"score":4.0147976758304775},{"content":" let mut polygon = vec![(\n\n idx!(p, positions),\n\n idx!(t, tex_coords))];\n\n for gs in rest {\n\n let group = try!(parse_vertex_group(gs));\n\n if group.2 != 0 {\n\n error!(WrongTypeOfArguments, \"Unexpected vertex format\");\n\n }\n\n\n\n polygon.push((\n\n idx!(group.0, positions),\n\n idx!(group.1, tex_coords)));\n\n }\n\n\n\n Polygon::PT(polygon)\n\n }\n\n (p, 0, n) => {\n\n let mut polygon = vec![(\n\n idx!(p, positions),\n\n idx!(n, normals))];\n","file_path":"src/raw/object.rs","rank":45,"score":3.539684793448432},{"content":" for gs in rest {\n\n let group = try!(parse_vertex_group(gs));\n\n if group.1 != 0 {\n\n error!(WrongTypeOfArguments, \"Unexpected vertex format\");\n\n }\n\n\n\n polygon.push((\n\n idx!(group.0, positions),\n\n idx!(group.2, normals)));\n\n }\n\n\n\n Polygon::PN(polygon)\n\n }\n\n (p, t, n) => {\n\n let mut polygon = vec![(\n\n idx!(p, positions),\n\n idx!(t, tex_coords),\n\n idx!(n, normals))];\n\n for gs in rest {\n\n let group = try!(parse_vertex_group(gs));\n","file_path":"src/raw/object.rs","rank":46,"score":3.499303377599087},{"content":" let first = args.next().unwrap();\n\n let rest = args;\n\n\n\n let group = try!(parse_vertex_group(first));\n\n\n\n let polygon = match group {\n\n (p, 0, 0) => {\n\n let mut polygon = vec![idx!(p, positions)];\n\n for gs in rest {\n\n let group = try!(parse_vertex_group(gs));\n\n if group.1 != 0 || group.2 != 0 {\n\n error!(WrongTypeOfArguments, \"Unexpected vertex format\");\n\n }\n\n\n\n polygon.push(idx!(group.0, positions));\n\n }\n\n\n\n Polygon::P(polygon)\n\n }\n\n (p, t, 0) => {\n","file_path":"src/raw/object.rs","rank":47,"score":3.499303377599087},{"content":" pub param_vertices: Vec<(f32, f32, f32)>,\n\n\n\n /// Points which stores the index data of position vectors.\n\n pub points: Vec<Point>,\n\n /// Lines which store the index data of vectors.\n\n pub lines: Vec<Line>,\n\n /// Polygons which store the index data of vectors.\n\n pub polygons: Vec<Polygon>,\n\n\n\n /// Groups of multiple geometries.\n\n pub groups: HashMap<String, Group>,\n\n /// Geometries which consist in a same material.\n\n pub meshes: HashMap<String, Group>,\n\n /// Smoothing groups.\n\n pub smoothing_groups: VecMap<Group>,\n\n /// Merging groups.\n\n pub merging_groups: VecMap<Group>\n\n}\n\n\n\n/// The `Point` type which stores the index of the position vector.\n","file_path":"src/raw/object.rs","rank":48,"score":3.4769930350772817},{"content":" PN(Vec<(usize, usize)>),\n\n /// A polygon which contains all position, texture coordinate and normal data of each vertex.\n\n PTN(Vec<(usize, usize, usize)>)\n\n}\n\n\n\n/// A group which contains ranges of points, lines and polygons\n\n#[derive(Clone, Debug)]\n\npub struct Group {\n\n /// Multiple range of points\n\n pub points: Vec<Range>,\n\n /// Multiple range of lines\n\n pub lines: Vec<Range>,\n\n /// Multiple range of polygons\n\n pub polygons: Vec<Range>\n\n}\n\n\n\n\n\n/// A struct which represent `[start, end)` range.\n\n#[derive(Copy, PartialEq, Eq, Clone, Debug)]\n\npub struct Range {\n\n /// The lower bound of the range (inclusive).\n\n pub start: usize,\n\n /// The upper bound of the range (exclusive).\n\n pub end: usize\n\n}\n","file_path":"src/raw/object.rs","rank":49,"score":3.364168587863815},{"content":"\n\n let line = match group {\n\n (p, 0, 0) => {\n\n let mut points = vec![idx!(p, positions)];\n\n for gs in rest {\n\n let group = try!(parse_vertex_group(gs));\n\n if group.1 != 0 || group.2 != 0 {\n\n error!(WrongTypeOfArguments, \"Unexpected vertex format\");\n\n }\n\n\n\n points.push(idx!(group.0, positions));\n\n }\n\n Line::P(points)\n\n }\n\n (p, t, 0) => {\n\n let mut points = vec![(\n\n idx!(p, positions),\n\n idx!(t, tex_coords))];\n\n for gs in rest {\n\n let group = try!(parse_vertex_group(gs));\n","file_path":"src/raw/object.rs","rank":50,"score":3.346589203118696},{"content":"/// A trait which should be implemented by a type passed into `Key` of `Map`.\n\ntrait Key : Eq {}\n\n\n\nimpl Key for String {}\n\nimpl Key for usize {}\n\n\n\n\n\n/// Low-level Rust binding for `.obj` format.\n\npub struct RawObj {\n\n /// Name of the object.\n\n pub name: Option<String>,\n\n /// `.mtl` files which required by this object.\n\n pub material_libraries: Vec<String>,\n\n\n\n /// Position vectors of each vertex.\n\n pub positions: Vec<(f32, f32, f32, f32)>,\n\n /// Texture coordinates of each vertex.\n\n pub tex_coords: Vec<(f32, f32, f32)>,\n\n /// Normal vectors of each vertex.\n\n pub normals: Vec<(f32, f32, f32)>,\n\n /// Parametric vertices.\n","file_path":"src/raw/object.rs","rank":51,"score":3.109482886076595},{"content":" ],\n\n light: (-1.0, -1.0, -1.0f32)\n\n };\n\n\n\n let params = glium::DrawParameters {\n\n depth: glium::Depth {\n\n test: glium::DepthTest::IfLess,\n\n write: true,\n\n ..Default::default()\n\n },\n\n ..Default::default()\n\n };\n\n\n\n // the main loop\n\n // each cycle will draw once\n\n let mut running = true;\n\n while running {\n\n use glium::Surface;\n\n use std::thread::sleep;\n\n use std::time::Duration;\n","file_path":"examples/glium.rs","rank":52,"score":2.9695104650106368},{"content":"// Copyright 2014-2017 Hyeon Kim\n\n//\n\n// Licensed under the Apache License, Version 2.0 <LICENSE-APACHE or\n\n// http://www.apache.org/licenses/LICENSE-2.0> or the MIT license\n\n// <LICENSE-MIT or http://opensource.org/licenses/MIT>, at your\n\n// option. This file may not be copied, modified, or distributed\n\n// except according to those terms.\n\n\n\nextern crate obj;\n\n\n\nuse std::fs::File;\n\nuse std::io::BufReader;\n\nuse obj::raw::*;\n\nuse obj::raw::object::Range;\n\n\n\nmacro_rules! test {\n\n ($($lhs:expr, $rhs:expr)*) => ({\n\n $(eq!($lhs, $rhs);)*\n\n });\n\n}\n","file_path":"tests/raw-group.rs","rank":53,"score":2.8954307733903173},{"content":" }\n\n \"illum\" => {\n\n match args.len() {\n\n 1 => mat.illumination_model = Some(try!(args[0].parse())),\n\n _ => error!(WrongNumberOfArguments, \"Expected exactly 1 argument\")\n\n }\n\n }\n\n \"d\" => {\n\n match args.len() {\n\n 1 => mat.dissolve = Some(try!(args[0].parse())),\n\n _ => error!(WrongNumberOfArguments, \"Expected exactly 1 argument\")\n\n }\n\n }\n\n \"Tr\" => {\n\n match args.len() {\n\n 1 => mat.dissolve = Some(1.0 - try!(args[0].parse::<f32>())),\n\n _ => error!(WrongNumberOfArguments, \"Expected exactly 1 argument\")\n\n }\n\n }\n\n\n","file_path":"src/raw/material.rs","rank":54,"score":2.8091625652868446},{"content":" /// The second argument is a multiplier for the values in the `.rfl` file.\n\n Spectral(String, f32)\n\n}\n\n\n\n/// A texture map specified in a `.mtl` file\n\n#[derive(Clone, PartialEq, Eq, Debug)]\n\npub struct MtlTextureMap {\n\n /// The name of the texture file\n\n pub file: String,\n\n // TODO: support arguments to the texture map\n\n}\n","file_path":"src/raw/material.rs","rank":55,"score":2.738057987022006},{"content":" for polygon in polygons {\n\n match polygon {\n\n Polygon::P(_) => error!(InsufficientData, \"Tried to extract normal and texture data which are not contained in the model\"),\n\n Polygon::PT(_) => error!(InsufficientData, \"Tried to extract normal data which are not contained in the model\"),\n\n Polygon::PN(_) => error!(InsufficientData, \"Tried to extract texture data which are not contained in the model\"),\n\n Polygon::PTN(ref vec) if vec.len() == 3 => {\n\n for &(pi, ti, ni) in vec { map(pi, ni, ti) }\n\n }\n\n _ => error!(UntriangulatedModel, \"Model should be triangulated first to be loaded properly\")\n\n }\n\n }\n\n }\n\n vb.shrink_to_fit();\n\n Ok((vb, ib))\n\n }\n\n}\n\n\n\n\n\n#[cfg(feature = \"glium-support\")]\n\nmod glium_support {\n","file_path":"src/lib.rs","rank":56,"score":2.704392087524562},{"content":"// Copyright 2014-2017 Hyeon Kim\n\n//\n\n// Licensed under the Apache License, Version 2.0 <LICENSE-APACHE or\n\n// http://www.apache.org/licenses/LICENSE-2.0> or the MIT license\n\n// <LICENSE-MIT or http://opensource.org/licenses/MIT>, at your\n\n// option. This file may not be copied, modified, or distributed\n\n// except according to those terms.\n\n\n\nextern crate obj;\n\n\n\nuse std::fs::File;\n\nuse std::io::BufReader;\n\nuse obj::*;\n\n\n\nmacro_rules! fixture {\n\n ($name:expr) => (BufReader::new(File::open(concat!(\"tests/fixtures/\", $name)).unwrap()))\n\n}\n\n\n\n#[test]\n","file_path":"tests/obj.rs","rank":57,"score":2.582237748344732},{"content":"pub type Point = usize;\n\n\n\n/// The `Line` type.\n\n#[derive(PartialEq, Eq, Clone, Debug)]\n\npub enum Line {\n\n /// A series of line segments which contain only the position data of each vertex\n\n P(Vec<usize>),\n\n /// A series of line segments which contain both position and texture coordinate\n\n /// data of each vertex\n\n PT(Vec<(usize, usize)>)\n\n}\n\n\n\n/// The `Polygon` type.\n\n#[derive(PartialEq, Eq, Clone, Debug)]\n\npub enum Polygon {\n\n /// A polygon which contains only the position data of each vertex.\n\n P(Vec<usize>),\n\n /// A polygon which contains both position and texture coordinate data of each vertex.\n\n PT(Vec<(usize, usize)>),\n\n /// A polygon which contains both position and normal data of each vertex.\n","file_path":"src/raw/object.rs","rank":58,"score":2.567680683475059},{"content":"// Copyright 2014-2017 Hyeon Kim\n\n//\n\n// Licensed under the Apache License, Version 2.0 <LICENSE-APACHE or\n\n// http://www.apache.org/licenses/LICENSE-2.0> or the MIT license\n\n// <LICENSE-MIT or http://opensource.org/licenses/MIT>, at your\n\n// option. This file may not be copied, modified, or distributed\n\n// except according to those terms.\n\n\n\n/*!\n\n\n\n[Wavefront OBJ][obj] parser for Rust. It handles both `.obj` and `.mtl` formats. [GitHub][]\n\n\n\n```rust\n\nuse std::fs::File;\n\nuse std::io::BufReader;\n\nuse obj::*;\n\n\n\nlet input = BufReader::new(File::open(\"tests/fixtures/normal-cone.obj\").unwrap());\n\nlet dome: Obj = load_obj(input).unwrap();\n\n\n","file_path":"src/lib.rs","rank":59,"score":2.4436746488949304},{"content":" match stmt {\n\n // Vertex data\n\n \"v\" => {\n\n let args = f!(args);\n\n positions.push(match args.len() {\n\n 4 => (args[0], args[1], args[2], args[3]),\n\n 3 => (args[0], args[1], args[2], 1.0),\n\n _ => error!(WrongNumberOfArguments, \"Expected 3 or 4 arguments\")\n\n })\n\n }\n\n \"vt\" => {\n\n let args = f!(args);\n\n tex_coords.push(match args.len() {\n\n 3 => (args[0], args[1], args[2]),\n\n 2 => (args[0], args[1], 0.0),\n\n 1 => (args[0], 0.0, 0.0),\n\n _ => error!(WrongNumberOfArguments, \"Expected 1, 2 or 3 arguments\")\n\n })\n\n }\n\n \"vn\" => {\n","file_path":"src/raw/object.rs","rank":60,"score":2.387398479252434},{"content":"// Copyright 2014-2017 Hyeon Kim\n\n//\n\n// Licensed under the Apache License, Version 2.0 <LICENSE-APACHE or\n\n// http://www.apache.org/licenses/LICENSE-2.0> or the MIT license\n\n// <LICENSE-MIT or http://opensource.org/licenses/MIT>, at your\n\n// option. This file may not be copied, modified, or distributed\n\n// except according to those terms.\n\n\n\n#![feature(test)]\n\n\n\nextern crate obj;\n\nextern crate test;\n\n\n\nuse test::Bencher;\n\n\n\nuse obj::raw::parse_obj;\n\n\n","file_path":"benches/bench.rs","rank":61,"score":2.3717348147016515},{"content":" \"scrv\" => unimplemented!(),\n\n \"sp\" => unimplemented!(),\n\n \"end\" => unimplemented!(),\n\n\n\n // Connectivity between free-form surfaces\n\n \"con\" => unimplemented!(),\n\n\n\n // Grouping\n\n \"g\" => {\n\n match args.len() {\n\n 1 => group_builder.start(args[0].to_string()),\n\n _ => error!(WrongNumberOfArguments, \"Expected group name parameter, but nothing has been supplied\")\n\n }\n\n }\n\n \"s\" => {\n\n match args.len() {\n\n 1 if (args[0] == \"off\" || args[0] == \"0\") => smoothing_builder.end(),\n\n 1 => smoothing_builder.start(try!(args[0].parse())),\n\n _ => error!(WrongNumberOfArguments, \"Expected only 1 argument\")\n\n }\n","file_path":"src/raw/object.rs","rank":62,"score":2.368451965300313},{"content":" \"usemtl\" => {\n\n match args.len() {\n\n 1 => mesh_builder.start(args[0].to_string()),\n\n _ => error!(WrongNumberOfArguments, \"Expected only 1 argument\")\n\n }\n\n }\n\n \"mtllib\" => {\n\n // TODO: .push_all()\n\n material_libraries.reserve(args.len());\n\n for path in args {\n\n material_libraries.push(path.to_string());\n\n }\n\n }\n\n \"shadow_obj\" => unimplemented!(),\n\n \"trace_obj\" => unimplemented!(),\n\n \"ctech\" => unimplemented!(),\n\n \"stech\" => unimplemented!(),\n\n\n\n // Unexpected statement\n\n _ => error!(UnexpectedStatement, \"Received unknown statement\")\n","file_path":"src/raw/object.rs","rank":63,"score":2.349803804570155},{"content":" let args = f!(args);\n\n normals.push(match args.len() {\n\n 3 => (args[0], args[1], args[2]),\n\n _ => error!(WrongNumberOfArguments, \"Expected 3 arguments\")\n\n })\n\n }\n\n \"vp\" => {\n\n let args = f!(args);\n\n param_vertices.push(match args.len() {\n\n 3 => (args[0], args[1], args[2]),\n\n 2 => (args[0], args[1], 1.0),\n\n 1 => (args[0], 0.0, 1.0),\n\n _ => error!(WrongNumberOfArguments, \"Expected 1, 2 or 3 arguments\")\n\n })\n\n }\n\n\n\n // Free-form curve / surface attributes\n\n \"cstype\" => {\n\n let _rational: bool;\n\n let geometry = match args.len() {\n","file_path":"src/raw/object.rs","rank":64,"score":2.349803804570155},{"content":"// Do whatever you want\n\ndome.vertices;\n\ndome.indices;\n\n```\n\n\n\n<img src=\"http://simnalamburt.github.io/obj-rs/screenshot.png\" style=\"max-width:100%\">\n\n\n\n[obj]: https://en.wikipedia.org/wiki/Wavefront_.obj_file\n\n[GitHub]: https://github.com/simnalamburt/obj-rs\n\n\n\n*/\n\n\n\n#![deny(missing_docs)]\n\n\n\n#[cfg(feature = \"glium-support\")] #[macro_use] extern crate glium;\n\nextern crate num;\n\nextern crate vec_map;\n\n\n\n#[macro_use] extern crate serde_derive;\n\n\n","file_path":"src/lib.rs","rank":65,"score":2.199879025312731},{"content":" };\n\n ib.push(index)\n\n };\n\n\n\n for polygon in polygons {\n\n match polygon {\n\n Polygon::P(_) | Polygon::PT(_) => error!(InsufficientData, \"Tried to extract normal data which are not contained in the model\"),\n\n Polygon::PN(ref vec) if vec.len() == 3 => {\n\n for &(pi, ni) in vec { map(pi, ni) }\n\n }\n\n Polygon::PTN(ref vec) if vec.len() == 3 => {\n\n for &(pi, _, ni) in vec { map(pi, ni) }\n\n }\n\n _ => error!(UntriangulatedModel, \"Model should be triangulated first to be loaded properly\")\n\n }\n\n }\n\n }\n\n vb.shrink_to_fit();\n\n Ok((vb, ib))\n\n }\n","file_path":"src/lib.rs","rank":66,"score":2.178294378642745},{"content":" }\n\n }\n\n\n\n _ => {\n\n let args = f!(args);\n\n match args.len() {\n\n 1 => MtlColor::Rgb(args[0], args[0], args[0]),\n\n 3 => MtlColor::Rgb(args[0], args[1], args[2]),\n\n _ => error!(WrongNumberOfArguments, \"Expected 1 or 3 color values\")\n\n }\n\n }\n\n })\n\n}\n\n\n","file_path":"src/raw/material.rs","rank":67,"score":2.173451235172776},{"content":" }\n\n\n\n // Material color and illumination statements\n\n \"Ka\" => mat.ambient = Some(try!(parse_color(args))),\n\n \"Kd\" => mat.diffuse = Some(try!(parse_color(args))),\n\n \"Ks\" => mat.specular = Some(try!(parse_color(args))),\n\n \"Ke\" => mat.emissive = Some(try!(parse_color(args))),\n\n \"Km\" => unimplemented!(),\n\n \"Tf\" => mat.transmission_filter = Some(try!(parse_color(args))),\n\n \"Ns\" => {\n\n match args.len() {\n\n 1 => mat.specular_exponent = Some(try!(args[0].parse())),\n\n _ => error!(WrongNumberOfArguments, \"Expected exactly 1 argument\")\n\n }\n\n }\n\n \"Ni\" => {\n\n match args.len() {\n\n 1 => mat.optical_density = Some(try!(args[0].parse())),\n\n _ => error!(WrongNumberOfArguments, \"Expected exactly 1 argument\")\n\n }\n","file_path":"src/raw/material.rs","rank":68,"score":2.0164020720360236},{"content":"obj-rs [![Travis Build Status]][travis] [![AppVeyor Build Status]][appveyor]\n\n========\n\n[Wavefront obj] parser for [Rust]. It handles both `.obj` and `.mtl` formats.\n\n\n\n- [API Documentation](https://simnalamburt.github.io/obj-rs/)\n\n- [See `obj-rs` in crates.io](https://crates.io/crates/obj-rs)\n\n\n\n```toml\n\n[dependencies]\n\nobj-rs = \"0.4\"\n\n```\n\n```rust\n\nuse std::fs::File;\n\nuse std::io::BufReader;\n\nuse obj::*;\n\n\n\nlet input = try!(BufReader::new(File::open(\"tests/fixtures/dome.obj\")));\n\nlet dome: Obj = try!(load_obj(input));\n\n\n\n// Do whatever you want\n\ndome.vertices;\n\ndome.indices;\n\n```\n\n\n\n![img]\n\n\n\n> This sample image is pretty good illustration of current status of **obj-rs**.\n\n**obj-rs** is currently able to load position and normal data of `obj` but not\n\ntexture & material data yet.\n\n\n\n<br>\n\n\n\nGlium support\n\n--------\n\n**obj-rs** supports [glium] out of the box.\n\n\n\n```toml\n\n[dependencies]\n\nglium = \"0.14\"\n\nobj-rs = { version = \"0.4\", features = [\"glium-support\"] }\n\n```\n\n```rust\n\nuse std::fs::File;\n\nuse std::io::BufReader;\n\nuse obj::*;\n\n\n\nlet input = BufReader::new(try!(File::open(\"rilakkuma.obj\")));\n\nlet obj: Obj = try!(load_obj(input));\n\n\n\nlet vb = try!(obj.vertex_buffer(&display));\n\nlet ib = try!(obj.index_buffer(&display));\n\n```\n\n\n\nPlease see the [working sample] for the further details. Use can execute it with\n\nthe command below.\n\n```bash\n\ncargo run --example glium --features glium-support\n\n```\n\n\n\n<br>\n\n\n\n--------\n\n*obj-rs* is primarily distributed under the terms of both the [Apache License\n\n(Version 2.0)] and the [MIT license]. See [COPYRIGHT] for details.\n\n\n\n[Travis Build Status]: https://travis-ci.org/simnalamburt/obj-rs.svg?branch=master\n\n[travis]: https://travis-ci.org/simnalamburt/obj-rs\n\n[AppVeyor Build Status]: https://ci.appveyor.com/api/projects/status/281kjgy7oxaa120s/branch/master?svg=true\n\n[appveyor]: https://ci.appveyor.com/project/simnalamburt/obj-rs/branch/master\n\n\n\n[Wavefront obj]: https://en.wikipedia.org/wiki/Wavefront_.obj_file\n\n[Rust]: http://rust-lang.org\n\n[img]: https://simnalamburt.github.io/obj-rs/screenshot.png\n\n[glium]: https://github.com/tomaka/glium\n\n[working sample]: examples/glium.rs\n\n[MIT license]: LICENSE-MIT\n\n[Apache License (Version 2.0)]: LICENSE-APACHE\n\n[COPYRIGHT]: COPYRIGHT\n","file_path":"README.md","rank":69,"score":1.9759617433130363},{"content":" }\n\n }\n\n \"bmat\" => unimplemented!(),\n\n \"step\" => unimplemented!(),\n\n\n\n // Elements\n\n \"p\" => {\n\n for v in args {\n\n let v : i32 = try!(v.parse());\n\n let v = idx!(v, positions);\n\n points.push(v);\n\n }\n\n }\n\n \"l\" => {\n\n if args.len() < 2 { error!(WrongNumberOfArguments, \"Expected at least 2 arguments\") }\n\n let mut args = args.iter();\n\n let first = args.next().unwrap();\n\n let rest = args;\n\n\n\n let group = try!(parse_vertex_group(first));\n","file_path":"src/raw/object.rs","rank":70,"score":1.8500862841781238},{"content":" }\n\n \"mg\" => {\n\n match args.len() {\n\n 1 if (args[0] == \"off\" || args[0] == \"0\") => merging_builder.end(),\n\n 1 => merging_builder.start(try!(args[0].parse())),\n\n _ => error!(WrongNumberOfArguments, \"Expected only 1 argument\")\n\n }\n\n }\n\n \"o\" => {\n\n name = match args.len() {\n\n 0 => None,\n\n _ => Some(args.join(\" \"))\n\n }\n\n }\n\n\n\n // Display / render attributes\n\n \"bevel\" => unimplemented!(),\n\n \"c_interp\" => unimplemented!(),\n\n \"d_interp\" => unimplemented!(),\n\n \"lod\" => unimplemented!(),\n","file_path":"src/raw/object.rs","rank":71,"score":1.8274292854922525},{"content":"// Copyright 2014-2017 Hyeon Kim\n\n//\n\n// Licensed under the Apache License, Version 2.0 <LICENSE-APACHE or\n\n// http://www.apache.org/licenses/LICENSE-2.0> or the MIT license\n\n// <LICENSE-MIT or http://opensource.org/licenses/MIT>, at your\n\n// option. This file may not be copied, modified, or distributed\n\n// except according to those terms.\n\n\n\nextern crate obj;\n\n\n\nuse obj::raw::{RawObj, parse_obj};\n\n\n","file_path":"tests/raw-basics.rs","rank":72,"score":1.731760050839843},{"content":"\n\nmacro_rules! eq {\n\n ($lhs:expr, $rhs:expr) => (eq!($lhs, $rhs, stringify!($lhs)));\n\n\n\n ($lhs:expr, $rhs:expr, $exp:expr) => ({\n\n let left = &($lhs);\n\n let right = &($rhs);\n\n\n\n if !((*left == *right) && (*right == *left)) {\n\n use std::io::Write;\n\n let _ = writeln!(&mut std::io::stderr(), \"\\x1b[33m{}\\x1b[0m should be \\x1b[33m{:?}\\x1b[0m, \\\n\n but it was \\x1b[33m{:?}\\x1b[0m\", $exp, *right, *left);\n\n panic!($exp);\n\n }\n\n });\n\n}\n\n\n","file_path":"tests/raw-basics.rs","rank":73,"score":1.6744526032799207},{"content":"// Copyright 2014-2017 Hyeon Kim\n\n//\n\n// Licensed under the Apache License, Version 2.0 <LICENSE-APACHE or\n\n// http://www.apache.org/licenses/LICENSE-2.0> or the MIT license\n\n// <LICENSE-MIT or http://opensource.org/licenses/MIT>, at your\n\n// option. This file may not be copied, modified, or distributed\n\n// except according to those terms.\n\n\n\nextern crate obj;\n\n\n\nuse obj::raw::material::{RawMtl, Material, MtlColor, MtlTextureMap, parse_mtl};\n\n\n","file_path":"tests/raw-material.rs","rank":74,"score":1.603693323074617},{"content":"\n\n let mut target = display.draw();\n\n target.clear_color_and_depth((0.0, 0.0, 0.0, 0.0), 1.0);\n\n target.draw(&vb, &ib, &program, &uniforms, ¶ms).unwrap();\n\n target.finish().unwrap();\n\n\n\n // sleeping for some time in order not to use up too much CPU\n\n sleep(Duration::from_millis(17));\n\n\n\n // polling and handling the events received by the window\n\n events_loop.poll_events(|event| {\n\n match event {\n\n glutin::Event::WindowEvent {event: glutin::WindowEvent::CloseRequested, ..} => running = false,\n\n _ => ()\n\n }\n\n });\n\n }\n\n}\n\n\n","file_path":"examples/glium.rs","rank":75,"score":1.5705098965571946},{"content":" let index = match cache.entry((pi, ni, ti)) {\n\n // Cache miss -> make new, store it on cache\n\n Entry::Vacant(entry) => {\n\n let p = positions[pi];\n\n let n = normals[ni];\n\n let t = tex_coords[ti];\n\n let vertex = TexturedVertex { position: [p.0, p.1, p.2], normal: [n.0, n.1, n.2], texture: [t.0, t.1, t.2] };\n\n let index = I::from_usize(vb.len()).expect(\"Unable to convert the index from usize\");\n\n vb.push(vertex);\n\n entry.insert(index);\n\n index\n\n }\n\n // Cache hit -> use it\n\n Entry::Occupied(entry) => {\n\n *entry.get()\n\n }\n\n };\n\n ib.push(index)\n\n };\n\n\n","file_path":"src/lib.rs","rank":76,"score":1.5232320975684193},{"content":"// Copyright 2014-2017 Hyeon Kim\n\n//\n\n// Licensed under the Apache License, Version 2.0 <LICENSE-APACHE or\n\n// http://www.apache.org/licenses/LICENSE-2.0> or the MIT license\n\n// <LICENSE-MIT or http://opensource.org/licenses/MIT>, at your\n\n// option. This file may not be copied, modified, or distributed\n\n// except according to those terms.\n\n\n\n//! Working example of *obj-rs*\n\n//! ========\n\n//!\n\n//! Execute it with the command below\n\n//!\n\n//! cargo run --example glium --features glium-support\n\n\n\n#[macro_use] extern crate glium;\n\nextern crate obj;\n\n\n\n#[cfg(feature = \"glium-support\")]\n","file_path":"examples/glium.rs","rank":77,"score":1.4787175663228433},{"content":"\n\nmacro_rules! eq {\n\n ($lhs:expr, $rhs:expr) => (eq!($lhs, $rhs, stringify!($lhs)));\n\n\n\n ($lhs:expr, $rhs:expr, $exp:expr) => ({\n\n let left = &($lhs);\n\n let right = &($rhs);\n\n\n\n if !((*left == *right) && (*right == *left)) {\n\n stderr!(\"\");\n\n stderr!(\"{w}{}{c} should be {o}{:?}{c}, but it was {o}{:?}{c}. See {b}{}:{}{c}.\",\n\n $exp, *right, *left, line!(), column!(),\n\n w=\"\\x1b[97m\", b=\"\\x1b[34m\", o=\"\\x1b[33m\", c=\"\\x1b[0m\");\n\n stderr!(\"\");\n\n panic!($exp);\n\n }\n\n });\n\n}\n\n\n\nmacro_rules! stderr {\n\n ($($arg:tt)*) => ({\n\n use std::io::Write;\n\n writeln!(&mut std::io::stderr(), $($arg)*).unwrap()\n\n })\n\n}\n\n\n\n#[test]\n","file_path":"tests/raw-group.rs","rank":78,"score":1.4787175663228433},{"content":" let mut ib = Vec::with_capacity(polygons.len() * 3);\n\n {\n\n let mut cache = HashMap::new();\n\n let mut map = |pi: usize, ni: usize| {\n\n // Look up cache\n\n let index = match cache.entry((pi, ni)) {\n\n // Cache miss -> make new, store it on cache\n\n Entry::Vacant(entry) => {\n\n let p = positions[pi];\n\n let n = normals[ni];\n\n let vertex = Vertex { position: [p.0, p.1, p.2], normal: [n.0, n.1, n.2]};\n\n let index = I::from_usize(vb.len()).expect(\"Unable to convert the index from usize\");\n\n vb.push(vertex);\n\n entry.insert(index);\n\n index\n\n }\n\n // Cache hit -> use it\n\n Entry::Occupied(entry) => {\n\n *entry.get()\n\n }\n","file_path":"src/lib.rs","rank":79,"score":1.3843224005108343},{"content":" match polygon {\n\n Polygon::P(ref vec) if vec.len() == 3 => {\n\n for &pi in vec { map(pi) }\n\n }\n\n Polygon::PT(ref vec) | Polygon::PN(ref vec) if vec.len() == 3 => {\n\n for &(pi, _) in vec { map(pi) }\n\n }\n\n Polygon::PTN(ref vec) if vec.len() == 3 => {\n\n for &(pi, _, _) in vec { map(pi) }\n\n }\n\n _ => error!(UntriangulatedModel, \"Model should be triangulated first to be loaded properly\")\n\n }\n\n }\n\n }\n\n Ok((vb, ib))\n\n }\n\n}\n\n\n\n/// Vertex data type of `Obj` which contains position, normal and texture data of a vertex.\n\n#[derive(Copy, PartialEq, Clone, Debug, Serialize, Deserialize)]\n","file_path":"src/lib.rs","rank":80,"score":1.3733313760530148},{"content":" // Texture map statements\n\n \"map_Ka\" => mat.ambient_map = Some(try!(parse_texture_map(args))),\n\n \"map_Kd\" => mat.diffuse_map = Some(try!(parse_texture_map(args))),\n\n \"map_Ks\" => mat.specular_map = Some(try!(parse_texture_map(args))),\n\n \"map_Ke\" => mat.emissive_map = Some(try!(parse_texture_map(args))),\n\n \"map_d\" => mat.dissolve_map = Some(try!(parse_texture_map(args))),\n\n \"map_aat\" => unimplemented!(),\n\n \"map_refl\" => unimplemented!(),\n\n \"map_bump\" | \"map_Bump\" | \"bump\" => mat.bump_map = Some(try!(parse_texture_map(args))),\n\n \"disp\" => unimplemented!(),\n\n\n\n // Reflection map statement\n\n \"refl\" => unimplemented!(),\n\n\n\n // Unexpected statement\n\n _ => error!(UnexpectedStatement, \"Received unknown statement\")\n\n }\n\n\n\n Ok(())\n\n }));\n\n\n\n // Insert the final material\n\n if let Some(name) = name {\n\n materials.insert(name, mat);\n\n }\n\n\n\n Ok(RawMtl { materials })\n\n}\n\n\n","file_path":"src/raw/material.rs","rank":81,"score":1.0761941634189842}],"string":"[\n {\n \"content\": \"/// Parses a wavefront `.obj` format.\\n\\npub fn parse_obj<T: BufRead>(input: T) -> ObjResult<RawObj> {\\n\\n let mut name = None;\\n\\n let mut material_libraries = Vec::new();\\n\\n\\n\\n let mut positions = Vec::new();\\n\\n let mut tex_coords = Vec::new();\\n\\n let mut normals = Vec::new();\\n\\n let mut param_vertices = Vec::new();\\n\\n\\n\\n let mut points = Vec::new();\\n\\n let mut lines = Vec::new();\\n\\n let mut polygons = Vec::new();\\n\\n\\n\\n let counter = Counter::new(&points, &lines, &polygons);\\n\\n let mut group_builder = counter.hash_map(\\\"default\\\".to_string());\\n\\n let mut mesh_builder = counter.hash_map(String::new());\\n\\n let mut smoothing_builder = counter.vec_map();\\n\\n let mut merging_builder = counter.vec_map();\\n\\n\\n\\n try!(lex(input, |stmt, args| {\\n\",\n \"file_path\": \"src/raw/object.rs\",\n \"rank\": 0,\n \"score\": 46346.785573901754\n },\n {\n \"content\": \"/// Parses a wavefront `.mtl` format *(incomplete)*\\n\\npub fn parse_mtl<T: BufRead>(input: T) -> ObjResult<RawMtl> {\\n\\n let mut materials = HashMap::new();\\n\\n\\n\\n // Properties of the material being currently parsed\\n\\n let mut name: Option<String> = None;\\n\\n let mut mat: Material = Material::default();\\n\\n\\n\\n try!(lex(input, |stmt, args| {\\n\\n match stmt {\\n\\n // Material name statement\\n\\n \\\"newmtl\\\" => {\\n\\n // Finish whatever material we were parsing\\n\\n if let Some(name) = name.take() {\\n\\n materials.insert(name, replace(&mut mat, Material::default()));\\n\\n }\\n\\n\\n\\n match args.len() {\\n\\n 1 => name = Some(args[0].to_owned()),\\n\\n _ => error!(WrongNumberOfArguments, \\\"Expected exactly 1 argument\\\")\\n\\n }\\n\",\n \"file_path\": \"src/raw/material.rs\",\n \"rank\": 1,\n \"score\": 46346.785573901754\n },\n {\n \"content\": \"pub fn lex<T, F>(input: T, mut callback: F) -> ObjResult<()>\\n\\n where T: BufRead, F: FnMut(&str, &[&str]) -> ObjResult<()>\\n\\n{\\n\\n // This is a buffer of the \\\"arguments\\\" for each line, it uses raw pointers\\n\\n // in order to allow it to be re-used across iterations.\\n\\n let mut args : Vec<*const str> = Vec::new();\\n\\n\\n\\n // This is a buffer for continued lines joined by '\\\\'.\\n\\n let mut multi_line = String::new();\\n\\n\\n\\n for line in input.lines() {\\n\\n let line = line?;\\n\\n let line = line.split('#').next().unwrap(); // Remove comments\\n\\n\\n\\n if line.ends_with('\\\\\\\\') {\\n\\n multi_line.push_str(&line[..line.len()-1]);\\n\\n multi_line.push(' '); // Insert a space to delimit the following lines\\n\\n continue\\n\\n }\\n\\n\\n\",\n \"file_path\": \"src/raw/lexer.rs\",\n \"rank\": 2,\n \"score\": 44964.15696264678\n },\n {\n \"content\": \"#[test]\\n\\nfn dome() {\\n\\n let obj: Obj<Position> = load_obj(fixture!(\\\"dome.obj\\\")).unwrap();\\n\\n\\n\\n macro_rules! p {\\n\\n ($($x:expr),*) => (Position { position: [$(stringify!($x).parse::<f32>().unwrap()),*] })\\n\\n }\\n\\n\\n\\n assert_eq!(obj.name, Some(\\\"Dome\\\".to_string()));\\n\\n assert_eq!(obj.vertices[0], p!(-0.382683, 0.923880, 0.000000));\\n\\n assert_eq!(obj.vertices[1], p!(-0.707107, 0.707107, 0.000000));\\n\\n assert_eq!(obj.indices[0], 3);\\n\\n assert_eq!(obj.indices[1], 2);\\n\\n assert_eq!(obj.indices[2], 6);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"tests/obj.rs\",\n \"rank\": 3,\n \"score\": 41831.505468034855\n },\n {\n \"content\": \"#[cfg(not(feature = \\\"glium-support\\\"))]\\n\\nfn main() {\\n\\n println!(\\\"\\\\n\\\\\\n\\n Please execute it with \\\\x1b[4m--features glium-support\\\\x1b[24m the option\\n\\n\\n\\n $ \\\\x1b[33mcargo run --example glium --features glium-support\\\\x1b[0m\\\\n\\\");\\n\\n}\\n\",\n \"file_path\": \"examples/glium.rs\",\n \"rank\": 4,\n \"score\": 41831.505468034855\n },\n {\n \"content\": \"#[test]\\n\\nfn cube() {\\n\\n let mtl = fixture(\\\"cube.mtl\\\");\\n\\n assert_eq!(mtl.materials.len(), 1);\\n\\n\\n\\n let mat = mtl.materials.get(\\\"Material\\\").unwrap();\\n\\n assert_eq!(mat, &Material {\\n\\n ambient: Some(MtlColor::Rgb(0.0, 0.0, 0.0)),\\n\\n diffuse: Some(MtlColor::Rgb(0.64, 0.64, 0.64)),\\n\\n specular: Some(MtlColor::Rgb(0.5, 0.5, 0.5)),\\n\\n dissolve: Some(1.0),\\n\\n specular_exponent: Some(96.078431),\\n\\n optical_density: Some(1.0),\\n\\n illumination_model: Some(2),\\n\\n diffuse_map: Some(MtlTextureMap { file: \\\"cube-uv-num.png\\\".to_owned() }),\\n\\n ..Material::default()\\n\\n });\\n\\n}\\n\\n\\n\",\n \"file_path\": \"tests/raw-material.rs\",\n \"rank\": 5,\n \"score\": 40448.58242215944\n },\n {\n \"content\": \"#[test]\\n\\nfn normal_cone() {\\n\\n let obj: Obj = load_obj(fixture!(\\\"normal-cone.obj\\\")).unwrap();\\n\\n\\n\\n macro_rules! v {\\n\\n (($($p:expr),*), ($($n:expr),*)) => ({\\n\\n Vertex {\\n\\n position: [$(stringify!($p).parse::<f32>().unwrap()),*],\\n\\n normal: [$(stringify!($n).parse::<f32>().unwrap()),*],\\n\\n }\\n\\n })\\n\\n }\\n\\n\\n\\n assert_eq!(obj.name, Some(\\\"Cone\\\".to_string()));\\n\\n assert_eq!(obj.vertices.len(), 96);\\n\\n assert_eq!(obj.vertices[0], v!((-0.382682, -1.000000, -0.923880), (-0.259887, 0.445488, -0.856737)));\\n\\n assert_eq!(obj.vertices[1], v!(( 0.000000, 1.000000, 0.000000), (-0.259887, 0.445488, -0.856737)));\\n\\n assert_eq!(obj.indices.len(), 96);\\n\\n assert_eq!(obj.indices[0], 0);\\n\\n assert_eq!(obj.indices[1], 1);\\n\\n assert_eq!(obj.indices[2], 2);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"tests/obj.rs\",\n \"rank\": 6,\n \"score\": 40448.58242215944\n },\n {\n \"content\": \"#[test]\\n\\nfn textured_cube() {\\n\\n let obj: Obj<TexturedVertex, u32> = load_obj(fixture!(\\\"textured-cube.obj\\\")).unwrap();\\n\\n\\n\\n macro_rules! vt {\\n\\n (($($p:expr),*), ($($n:expr),*), ($($t:expr),*)) => ({\\n\\n TexturedVertex {\\n\\n position: [$(stringify!($p).parse::<f32>().unwrap()),*],\\n\\n normal: [$(stringify!($n).parse::<f32>().unwrap()),*],\\n\\n texture: [$(stringify!($t).parse::<f32>().unwrap()),*]\\n\\n }\\n\\n })\\n\\n }\\n\\n\\n\\n assert_eq!(obj.name, Some(\\\"cube\\\".to_string()));\\n\\n assert_eq!(obj.vertices.len(), 24);\\n\\n dbg!(&obj.vertices);\\n\\n assert_eq!(obj.vertices[0], vt!((-0.500000, -0.500000, 0.500000), (0.000000, 0.000000, 1.000000), (0.000000, 0.000000, 0.000000)));\\n\\n assert_eq!(obj.vertices[1], vt!((0.500000, -0.500000, 0.500000), (0.000000, 0.000000, 1.000000), (1.000000, 0.000000, 0.000000)));\\n\\n assert_eq!(obj.vertices[2], vt!((-0.500000, 0.500000, 0.500000), (0.000000, 0.000000, 1.000000), (0.000000, 1.000000, 0.000000)));\\n\\n assert_eq!(obj.vertices[3], vt!((0.500000, 0.500000, 0.500000), (0.000000, 0.000000, 1.000000), (1.000000, 1.000000, 0.000000))); \\n\",\n \"file_path\": \"tests/obj.rs\",\n \"rank\": 7,\n \"score\": 40448.58242215944\n },\n {\n \"content\": \"#[test]\\n\\nfn dome() {\\n\\n let obj = fixture(\\\"dome.obj\\\");\\n\\n\\n\\n test! {\\n\\n obj.name, Some(\\\"Dome\\\".to_string())\\n\\n obj.material_libraries, vec![ \\\"dome.mtl\\\" ]\\n\\n\\n\\n obj.positions.len(), 33\\n\\n obj.tex_coords.len(), 0\\n\\n obj.normals.len(), 0\\n\\n obj.param_vertices.len(), 0\\n\\n\\n\\n obj.points.len(), 0\\n\\n obj.lines.len(), 0\\n\\n obj.polygons.len(), 62\\n\\n\\n\\n obj.groups.len(), 1\\n\\n obj.meshes.len(), 1\\n\\n obj.smoothing_groups.len(), 2\\n\\n obj.merging_groups.len(), 0\\n\",\n \"file_path\": \"tests/raw-basics.rs\",\n \"rank\": 8,\n \"score\": 40448.58242215944\n },\n {\n \"content\": \"#[test]\\n\\nfn cube() {\\n\\n let obj = fixture(\\\"cube.obj\\\");\\n\\n\\n\\n test! {\\n\\n obj.name, Some(\\\"Cube\\\".to_string())\\n\\n obj.material_libraries, vec![ \\\"cube.mtl\\\" ]\\n\\n\\n\\n obj.positions.len(), 8\\n\\n obj.tex_coords.len(), 14\\n\\n obj.normals.len(), 0\\n\\n obj.param_vertices.len(), 0\\n\\n\\n\\n obj.points.len(), 0\\n\\n obj.lines.len(), 0\\n\\n obj.polygons.len(), 6\\n\\n\\n\\n obj.groups.len(), 1\\n\\n obj.meshes.len(), 1\\n\\n obj.smoothing_groups.len(), 0\\n\\n obj.merging_groups.len(), 0\\n\",\n \"file_path\": \"tests/raw-basics.rs\",\n \"rank\": 9,\n \"score\": 40448.58242215944\n },\n {\n \"content\": \"#[test]\\n\\nfn untitled() {\\n\\n let mtl = fixture(\\\"untitled.mtl\\\");\\n\\n assert_eq!(mtl.materials.len(), 2);\\n\\n\\n\\n let mat = mtl.materials.get(\\\"Material\\\").unwrap();\\n\\n assert_eq!(mat, &Material {\\n\\n ambient: Some(MtlColor::Rgb(0.0, 0.0, 0.0)),\\n\\n diffuse: Some(MtlColor::Rgb(0.64, 0.64, 0.64)),\\n\\n specular: Some(MtlColor::Rgb(0.5, 0.5, 0.5)),\\n\\n dissolve: Some(1.0),\\n\\n specular_exponent: Some(96.078431),\\n\\n optical_density: Some(1.0),\\n\\n illumination_model: Some(2),\\n\\n ..Material::default()\\n\\n });\\n\\n\\n\\n let mat = mtl.materials.get(\\\"None\\\").unwrap();\\n\\n assert_eq!(mat, &Material {\\n\\n ambient: Some(MtlColor::Rgb(0.0, 0.0, 0.0)),\\n\\n diffuse: Some(MtlColor::Rgb(0.8, 0.8, 0.8)),\\n\\n specular: Some(MtlColor::Rgb(0.8, 0.8, 0.8)),\\n\\n dissolve: Some(1.0),\\n\\n specular_exponent: Some(0.0),\\n\\n illumination_model: Some(2),\\n\\n ..Material::default()\\n\\n });\\n\\n}\\n\",\n \"file_path\": \"tests/raw-material.rs\",\n \"rank\": 10,\n \"score\": 40448.58242215944\n },\n {\n \"content\": \"#[test]\\n\\nfn sponza() {\\n\\n // Sponza atrium model, it's reasonably big and more importantly uses negative indexes\\n\\n // for some of the face specifications.\\n\\n let obj = fixture(\\\"sponza.obj\\\");\\n\\n\\n\\n test! {\\n\\n obj.name, Some(\\\"sponza.lwo\\\".to_owned())\\n\\n obj.positions.len(), 39742\\n\\n obj.polygons.len(), 36347\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"tests/raw-basics.rs\",\n \"rank\": 11,\n \"score\": 40448.58242215944\n },\n {\n \"content\": \"#[test]\\n\\nfn empty() {\\n\\n let obj = fixture(\\\"empty.obj\\\");\\n\\n\\n\\n test! {\\n\\n obj.name, None\\n\\n obj.material_libraries, Vec::<String>::new()\\n\\n\\n\\n obj.positions.len(), 0\\n\\n obj.tex_coords.len(), 0\\n\\n obj.normals.len(), 0\\n\\n obj.param_vertices.len(), 0\\n\\n\\n\\n obj.points.len(), 0\\n\\n obj.lines.len(), 0\\n\\n obj.polygons.len(), 0\\n\\n\\n\\n obj.groups.len(), 0\\n\\n obj.meshes.len(), 0\\n\\n obj.smoothing_groups.len(), 0\\n\\n obj.merging_groups.len(), 0\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"tests/raw-basics.rs\",\n \"rank\": 12,\n \"score\": 40448.58242215944\n },\n {\n \"content\": \"#[test]\\n\\nfn lines_points() {\\n\\n // Basic test for lines and points geometry statements\\n\\n let obj = fixture(\\\"lines_points.obj\\\");\\n\\n\\n\\n test! {\\n\\n obj.name, Some(\\\"lines.obj\\\".to_owned())\\n\\n obj.positions.len(), 3\\n\\n obj.tex_coords.len(), 2\\n\\n obj.lines.len(), 2\\n\\n obj.points.len(), 3\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"tests/raw-basics.rs\",\n \"rank\": 13,\n \"score\": 39218.029523281875\n },\n {\n \"content\": \"#[test]\\n\\nfn dup_groupnames() {\\n\\n let input = BufReader::new(File::open(\\\"tests/fixtures/group.obj\\\").unwrap());\\n\\n let raw = match parse_obj(input) {\\n\\n Ok(raw) => raw,\\n\\n Err(e) => panic!(e)\\n\\n };\\n\\n\\n\\n test! {\\n\\n raw.smoothing_groups.len(), 2\\n\\n raw.smoothing_groups[1].points.len(), 0\\n\\n raw.smoothing_groups[1].lines.len(), 0\\n\\n raw.smoothing_groups[1].polygons.len(), 2\\n\\n raw.smoothing_groups[1].polygons[0], Range { start: 0, end: 3 }\\n\\n raw.smoothing_groups[1].polygons[1], Range { start: 6, end: 9 }\\n\\n raw.smoothing_groups[2].points.len(), 0\\n\\n raw.smoothing_groups[2].lines.len(), 0\\n\\n raw.smoothing_groups[2].polygons.len(), 1\\n\\n raw.smoothing_groups[2].polygons[0], Range { start: 3, end: 6 }\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"tests/raw-group.rs\",\n \"rank\": 14,\n \"score\": 39218.029523281875\n },\n {\n \"content\": \"#[test]\\n\\nfn test_lex() {\\n\\n let input = r#\\\"\\n\\n statement0 arg0 arg1\\targ2#argX argX\\n\\nstatement1 arg0 arg1\\n\\n# Comment\\n\\nstatement2 Hello, world!\\n\\nbmat u 1 -3 3 -1 \\\\\\n\\n 0 3 -6 3 \\\\\\n\\n 0 0 3 -3 \\\\\\n\\n 0 0 0 1\\n\\nbmat u 1 -3 3 -1 0 3 -6 3 \\\\\\n\\n 0 0 3 -3 0 0 0 1\\n\\nbmat u 1 -3 3 -1 0 3 -6 3 0 0 3 -3 0 0 0 1\\n\\n\\\"#;\\n\\n\\n\\n assert!(lex(&mut input.as_bytes(), |stmt, args| {\\n\\n match stmt {\\n\\n \\\"statement0\\\" => assert_eq!(args, [\\\"arg0\\\", \\\"arg1\\\", \\\"arg2\\\"]),\\n\\n \\\"statement1\\\" => assert_eq!(args, [\\\"arg0\\\", \\\"arg1\\\"]),\\n\\n \\\"statement2\\\" => assert_eq!(args, [\\\"Hello,\\\", \\\"world!\\\"]),\\n\\n \\\"bmat\\\" => assert_eq!(args, [\\\"u\\\", \\\"1\\\", \\\"-3\\\", \\\"3\\\", \\\"-1\\\", \\\"0\\\", \\\"3\\\", \\\"-6\\\", \\\"3\\\", \\\"0\\\", \\\"0\\\", \\\"3\\\", \\\"-3\\\", \\\"0\\\", \\\"0\\\", \\\"0\\\", \\\"1\\\"]),\\n\\n _ => panic!(\\\"Unit test failed\\\")\\n\\n }\\n\\n Ok(())\\n\\n }).is_ok());\\n\\n}\\n\",\n \"file_path\": \"src/raw/lexer.rs\",\n \"rank\": 15,\n \"score\": 39218.029523281875\n },\n {\n \"content\": \"/// Load a wavefront OBJ file into Rust & OpenGL friendly format.\\n\\npub fn load_obj<V: FromRawVertex<I>, T: BufRead, I>(input: T) -> ObjResult<Obj<V, I>> {\\n\\n let raw = try!(raw::parse_obj(input));\\n\\n Obj::new(raw)\\n\\n}\\n\\n\\n\\n/// 3D model object loaded from wavefront OBJ.\\n\\n#[derive(Serialize, Deserialize)]\\n\\npub struct Obj<V = Vertex, I = u16> {\\n\\n /// Object's name.\\n\\n pub name: Option<String>,\\n\\n /// Vertex buffer.\\n\\n pub vertices: Vec<V>,\\n\\n /// Index buffer.\\n\\n pub indices: Vec<I>,\\n\\n}\\n\\n\\n\\nimpl<V: FromRawVertex<I>, I> Obj<V, I> {\\n\\n /// Create `Obj` from `RawObj` object.\\n\\n pub fn new(raw: raw::RawObj) -> ObjResult<Self> {\\n\\n let (vertices, indices) = try!(FromRawVertex::process(raw.positions, raw.normals, raw.tex_coords, raw.polygons));\\n\\n\\n\\n Ok(Obj {\\n\\n name: raw.name,\\n\\n vertices: vertices,\\n\\n indices: indices\\n\\n })\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/lib.rs\",\n \"rank\": 16,\n \"score\": 38767.13983613928\n },\n {\n \"content\": \"/// Conversion from `RawObj`'s raw data.\\n\\npub trait FromRawVertex<I> : Sized {\\n\\n /// Build vertex and index buffer from raw object data.\\n\\n fn process(vertices: Vec<(f32, f32, f32, f32)>, normals: Vec<(f32, f32, f32)>, tex_coords: Vec<(f32, f32, f32)>, polygons: Vec<Polygon>) -> ObjResult<(Vec<Self>, Vec<I>)>;\\n\\n}\\n\\n\\n\\n/// Vertex data type of `Obj` which contains position and normal data of a vertex.\\n\\n#[derive(Copy, PartialEq, Clone, Debug, Serialize, Deserialize)]\\n\\npub struct Vertex {\\n\\n /// Position vector of a vertex.\\n\\n pub position: [f32; 3],\\n\\n /// Normal vertor of a vertex.\\n\\n pub normal: [f32; 3],\\n\\n}\\n\\n\\n\\n#[cfg(feature = \\\"glium-support\\\")]\\n\\nimplement_vertex!(Vertex, position, normal);\\n\\n\\n\\nimpl<I: FromPrimitive + Integer + Copy> FromRawVertex<I> for Vertex {\\n\\n fn process(positions: Vec<(f32, f32, f32, f32)>, normals: Vec<(f32, f32, f32)>, _: Vec<(f32, f32, f32)>, polygons: Vec<Polygon>) -> ObjResult<(Vec<Self>, Vec<I>)> {\\n\\n let mut vb = Vec::with_capacity(polygons.len() * 3);\\n\",\n \"file_path\": \"src/lib.rs\",\n \"rank\": 17,\n \"score\": 35028.287816044125\n },\n {\n \"content\": \"#[bench]\\n\\nfn sponza(b: &mut Bencher) {\\n\\n let data = load_file(\\\"sponza.obj\\\");\\n\\n let mut data = std::io::Cursor::new(&data[..]);\\n\\n b.iter(|| {\\n\\n parse_obj(&mut data).unwrap()\\n\\n });\\n\\n}\\n\",\n \"file_path\": \"benches/bench.rs\",\n \"rank\": 18,\n \"score\": 33412.84336503969\n },\n {\n \"content\": \"fn fixture(filename: &str) -> RawMtl {\\n\\n use std::path::Path;\\n\\n use std::fs::File;\\n\\n use std::io::BufReader;\\n\\n\\n\\n let path = Path::new(\\\"tests\\\").join(\\\"fixtures\\\").join(filename);\\n\\n let file = match File::open(&path) {\\n\\n Ok(f) => f,\\n\\n Err(e) => panic!(\\\"Failed to open \\\\\\\"{}\\\\\\\". \\\\x1b[31m{}\\\\x1b[0m\\\", path.to_string_lossy(), e)\\n\\n };\\n\\n let input = BufReader::new(file);\\n\\n\\n\\n parse_mtl(input).unwrap()\\n\\n}\\n\\n\\n\",\n \"file_path\": \"tests/raw-material.rs\",\n \"rank\": 19,\n \"score\": 30419.299672512065\n },\n {\n \"content\": \"fn fixture(filename: &str) -> RawObj {\\n\\n use std::path::Path;\\n\\n use std::fs::File;\\n\\n use std::io::BufReader;\\n\\n\\n\\n let path = Path::new(\\\"tests\\\").join(\\\"fixtures\\\").join(filename);\\n\\n let file = match File::open(&path) {\\n\\n Ok(f) => f,\\n\\n Err(e) => panic!(\\\"Failed to open \\\\\\\"{}\\\\\\\". \\\\x1b[31m{}\\\\x1b[0m\\\", path.to_string_lossy(), e)\\n\\n };\\n\\n let input = BufReader::new(file);\\n\\n\\n\\n parse_obj(input).unwrap()\\n\\n}\\n\\n\\n\\nmacro_rules! test_v4 {\\n\\n ($lhs:expr => $($x:expr, $y:expr, $z:expr, $w:expr;)*) => ({\\n\\n let mut index = 0usize;\\n\\n $(\\n\\n let (x, y, z, w) = $lhs[index];\\n\",\n \"file_path\": \"tests/raw-basics.rs\",\n \"rank\": 20,\n \"score\": 30419.299672512065\n },\n {\n \"content\": \"fn load_file(filename: &str) -> Vec<u8> {\\n\\n use std::path::Path;\\n\\n use std::fs::File;\\n\\n use std::io::Read;\\n\\n\\n\\n let path = Path::new(\\\"tests\\\").join(\\\"fixtures\\\").join(filename);\\n\\n let mut file = match File::open(&path) {\\n\\n Ok(f) => f,\\n\\n Err(e) => panic!(\\\"Failed to open \\\\\\\"{}\\\\\\\". \\\\x1b[31m{}\\\\x1b[0m\\\", path.to_string_lossy(), e)\\n\\n };\\n\\n\\n\\n let mut data = Vec::new();\\n\\n match file.read_to_end(&mut data) {\\n\\n Err(e) => panic!(\\\"Failed to read \\\\\\\"{}\\\\\\\". \\\\x1b[31m{}\\\\x1b[0m\\\", path.to_string_lossy(), e),\\n\\n Ok(_) => ()\\n\\n }\\n\\n\\n\\n data\\n\\n}\\n\\n\\n\",\n \"file_path\": \"benches/bench.rs\",\n \"rank\": 21,\n \"score\": 29231.394964624236\n },\n {\n \"content\": \"/// Parses a color from the arguments of a statement\\n\\nfn parse_color(args: &[&str]) -> ObjResult<MtlColor> {\\n\\n if args.is_empty() {\\n\\n error!(WrongNumberOfArguments, \\\"Expected at least 1 argument\\\");\\n\\n }\\n\\n\\n\\n Ok(match args[0] {\\n\\n \\\"xyz\\\" => {\\n\\n let args = f!(&args[1..]);\\n\\n match args.len() {\\n\\n 1 => MtlColor::Xyz(args[0], args[0], args[0]),\\n\\n 3 => MtlColor::Xyz(args[0], args[1], args[2]),\\n\\n _ => error!(WrongNumberOfArguments, \\\"Expected 1 or 3 color values\\\")\\n\\n }\\n\\n }\\n\\n\\n\\n \\\"spectral\\\" => {\\n\\n match args.len() {\\n\\n 2 => MtlColor::Spectral(args[1].to_owned(), 1.0),\\n\\n 3 => MtlColor::Spectral(args[1].to_owned(), try!(args[2].parse())),\\n\\n _ => error!(WrongNumberOfArguments, \\\"Expected 2 or 3 arguments\\\")\\n\",\n \"file_path\": \"src/raw/material.rs\",\n \"rank\": 22,\n \"score\": 26981.52256242364\n },\n {\n \"content\": \"/// Parses a texture map specification from the arguments of a statement\\n\\nfn parse_texture_map(args: &[&str]) -> ObjResult<MtlTextureMap> {\\n\\n if args.len() == 1 {\\n\\n Ok(MtlTextureMap { file: args[0].to_owned() })\\n\\n } else {\\n\\n error!(WrongNumberOfArguments, \\\"Expected exactly 1 argument\\\")\\n\\n }\\n\\n}\\n\\n\\n\\n/// Low-level Rust binding for `.mtl` format *(incomplete)*.\\n\\n#[derive(Clone, Debug)]\\n\\npub struct RawMtl {\\n\\n /// Map from the material name to its properties\\n\\n pub materials: HashMap<String, Material>\\n\\n}\\n\\n\\n\\n/// A single material from a `.mtl` file\\n\\n#[derive(Clone, PartialEq, Debug, Default)]\\n\\npub struct Material {\\n\\n /// The ambient color, specified by `Ka`\\n\\n pub ambient: Option<MtlColor>,\\n\",\n \"file_path\": \"src/raw/material.rs\",\n \"rank\": 30,\n \"score\": 25768.37464512796\n },\n {\n \"content\": \"// Parses the vertex group in the face statement, missing entries\\n\\n// are indicated with a 0 value\\n\\nfn parse_vertex_group(s: &str) -> ObjResult<(i32, i32, i32)> {\\n\\n let mut indices = s.split('/');\\n\\n\\n\\n let first = indices.next().unwrap_or(\\\"\\\");\\n\\n let second = indices.next().unwrap_or(\\\"\\\");\\n\\n let third = indices.next().unwrap_or(\\\"\\\");\\n\\n\\n\\n let first = try!(first.parse());\\n\\n let second = if second == \\\"\\\" {\\n\\n 0\\n\\n } else {\\n\\n try!(second.parse())\\n\\n };\\n\\n\\n\\n let third = if third == \\\"\\\" {\\n\\n 0\\n\\n } else {\\n\\n try!(third.parse())\\n\\n };\\n\\n\\n\\n Ok((first, second, third))\\n\\n}\\n\\n\\n\\n\\n\",\n \"file_path\": \"src/raw/object.rs\",\n \"rank\": 31,\n \"score\": 24551.694624674812\n },\n {\n \"content\": \"#[macro_use] mod error;\\n\\npub mod raw;\\n\\n\\n\\nuse num::{FromPrimitive, Integer};\\n\\nuse std::io::BufRead;\\n\\nuse std::collections::hash_map::{HashMap, Entry};\\n\\nuse raw::object::Polygon;\\n\\npub use error::{ObjResult, ObjError, LoadError, LoadErrorKind};\\n\\n\\n\\n/// Load a wavefront OBJ file into Rust & OpenGL friendly format.\\n\",\n \"file_path\": \"src/lib.rs\",\n \"rank\": 32,\n \"score\": 9.145514236046079\n },\n {\n \"content\": \" use glium::{vertex, index, VertexBuffer, IndexBuffer};\\n\\n use glium::backend::Facade;\\n\\n use super::Obj;\\n\\n\\n\\n impl<V: vertex::Vertex, I: glium::index::Index> Obj<V, I> {\\n\\n /// Retrieve glium-compatible vertex buffer from Obj\\n\\n pub fn vertex_buffer<F: Facade>(&self, facade: &F) -> Result<VertexBuffer<V>, vertex::BufferCreationError> {\\n\\n VertexBuffer::new(facade, &self.vertices)\\n\\n }\\n\\n\\n\\n /// Retrieve glium-compatible index buffer from Obj\\n\\n pub fn index_buffer<F: Facade>(&self, facade: &F) -> Result<IndexBuffer<I>, index::BufferCreationError> {\\n\\n IndexBuffer::new(facade, index::PrimitiveType::TrianglesList, &self.indices)\\n\\n }\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/lib.rs\",\n \"rank\": 33,\n \"score\": 8.728070407893533\n },\n {\n \"content\": \" if group.2 != 0 {\\n\\n error!(WrongTypeOfArguments, \\\"Unexpected vertex format\\\");\\n\\n }\\n\\n\\n\\n points.push((\\n\\n idx!(group.0, positions),\\n\\n idx!(group.1, tex_coords)));\\n\\n }\\n\\n Line::PT(points)\\n\\n }\\n\\n _ => {\\n\\n error!(WrongTypeOfArguments, \\\"Unexpected vertex format, expected `#` or `#/#`\\\");\\n\\n }\\n\\n };\\n\\n lines.push(line);\\n\\n }\\n\\n \\\"fo\\\" | \\\"f\\\" => {\\n\\n if args.len() < 3 { error!(WrongNumberOfArguments, \\\"Expected at least 3 arguments\\\") }\\n\\n\\n\\n let mut args = args.iter();\\n\",\n \"file_path\": \"src/raw/object.rs\",\n \"rank\": 34,\n \"score\": 5.367314921518111\n },\n {\n \"content\": \"// Copyright 2014-2017 Hyeon Kim\\n\\n//\\n\\n// Licensed under the Apache License, Version 2.0 <LICENSE-APACHE or\\n\\n// http://www.apache.org/licenses/LICENSE-2.0> or the MIT license\\n\\n// <LICENSE-MIT or http://opensource.org/licenses/MIT>, at your\\n\\n// option. This file may not be copied, modified, or distributed\\n\\n// except according to those terms.\\n\\n\\n\\n//! Provides low-level API for Wavefront OBJ format.\\n\\n\\n\\nmod lexer;\\n\\npub mod object;\\n\\npub mod material;\\n\\n\\n\\npub use self::object::{parse_obj, RawObj};\\n\\npub use self::material::{parse_mtl, RawMtl};\\n\",\n \"file_path\": \"src/raw/mod.rs\",\n \"rank\": 35,\n \"score\": 5.189779181376492\n },\n {\n \"content\": \" 2 if args[0] == \\\"rat\\\" => { _rational = true; args[1] }\\n\\n 1 => { _rational = false; args[0] }\\n\\n _ => error!(WrongTypeOfArguments, \\\"Expected 'rat xxx' or 'xxx' format\\\")\\n\\n };\\n\\n\\n\\n match geometry {\\n\\n \\\"bmatrix\\\" => unimplemented!(),\\n\\n \\\"bezier\\\" => unimplemented!(),\\n\\n \\\"bspline\\\" => unimplemented!(),\\n\\n \\\"cardinal\\\" => unimplemented!(),\\n\\n \\\"taylor\\\" => unimplemented!(),\\n\\n _ => error!(WrongTypeOfArguments, \\\"Expected one of 'bmatrix', 'bezier', 'bspline', 'cardinal' and 'taylor'\\\")\\n\\n }\\n\\n }\\n\\n \\\"deg\\\" => {\\n\\n let args = f!(args);\\n\\n match args.len() {\\n\\n 2 => unimplemented!(), // (deg_u, deg_v)\\n\\n 1 => unimplemented!(), // (deg_u)\\n\\n _ => error!(WrongNumberOfArguments, \\\"Expected 1 or 2 arguments\\\")\\n\",\n \"file_path\": \"src/raw/object.rs\",\n \"rank\": 36,\n \"score\": 4.944046430002453\n },\n {\n \"content\": \"pub struct TexturedVertex {\\n\\n /// Position vector of a vertex.\\n\\n pub position: [f32; 3],\\n\\n /// Normal vertor of a vertex.\\n\\n pub normal: [f32; 3],\\n\\n /// Texture of a vertex.\\n\\n pub texture: [f32; 3]\\n\\n}\\n\\n\\n\\n#[cfg(feature = \\\"glium-support\\\")]\\n\\nimplement_vertex!(TexturedVertex, position, normal, texture);\\n\\n\\n\\nimpl<I: FromPrimitive + Integer + Copy> FromRawVertex<I> for TexturedVertex {\\n\\n fn process(positions: Vec<(f32, f32, f32, f32)>, normals: Vec<(f32, f32, f32)>, tex_coords: Vec<(f32, f32, f32)>, polygons: Vec<Polygon>) -> ObjResult<(Vec<Self>, Vec<I>)> {\\n\\n let mut vb = Vec::with_capacity(polygons.len() * 3);\\n\\n let mut ib = Vec::with_capacity(polygons.len() * 3);\\n\\n {\\n\\n let mut cache = HashMap::new();\\n\\n let mut map = |pi: usize, ni: usize, ti: usize| {\\n\\n // Look up cache\\n\",\n \"file_path\": \"src/lib.rs\",\n \"rank\": 37,\n \"score\": 4.927458782157471\n },\n {\n \"content\": \"// Copyright 2014-2017 Hyeon Kim\\n\\n//\\n\\n// Licensed under the Apache License, Version 2.0 <LICENSE-APACHE or\\n\\n// http://www.apache.org/licenses/LICENSE-2.0> or the MIT license\\n\\n// <LICENSE-MIT or http://opensource.org/licenses/MIT>, at your\\n\\n// option. This file may not be copied, modified, or distributed\\n\\n// except according to those terms.\\n\\n\\n\\nuse std;\\n\\nuse std::io::prelude::*;\\n\\nuse error::ObjResult;\\n\\n\\n\",\n \"file_path\": \"src/raw/lexer.rs\",\n \"rank\": 38,\n \"score\": 4.614878601498033\n },\n {\n \"content\": \"\\n\\n\\n\\n/// Constant which is used to represent undefined bound of range.\\n\\nconst UNDEFINED: usize = ::std::usize::MAX;\\n\\n\\n\\nimpl Group {\\n\\n fn new(count: (usize, usize, usize)) -> Self {\\n\\n let mut ret = Group {\\n\\n points: Vec::with_capacity(1),\\n\\n lines: Vec::with_capacity(1),\\n\\n polygons: Vec::with_capacity(1)\\n\\n };\\n\\n ret.start(count);\\n\\n ret\\n\\n }\\n\\n\\n\\n fn start(&mut self, count: (usize, usize, usize)) {\\n\\n self.points.push(Range { start: count.0, end: UNDEFINED });\\n\\n self.lines.push(Range { start: count.1, end: UNDEFINED });\\n\\n self.polygons.push(Range { start: count.2, end: UNDEFINED })\\n\",\n \"file_path\": \"src/raw/object.rs\",\n \"rank\": 39,\n \"score\": 4.52697892129598\n },\n {\n \"content\": \" /// The diffuse color, specified by `Kd`\\n\\n pub diffuse: Option<MtlColor>,\\n\\n /// The specular color, specified by `Ks`\\n\\n pub specular: Option<MtlColor>,\\n\\n /// The emissive color, specified by `Ke`\\n\\n pub emissive: Option<MtlColor>,\\n\\n /// The transmission filter, specified by `Tf`\\n\\n pub transmission_filter: Option<MtlColor>,\\n\\n /// The illumination model to use for this material; see the `.mtl` spec for more details.\\n\\n pub illumination_model: Option<u32>,\\n\\n /// The dissolve (opacity) of the material, specified by `d`\\n\\n pub dissolve: Option<f32>,\\n\\n /// The specular exponent, specified by `Ne`\\n\\n pub specular_exponent: Option<f32>,\\n\\n /// The optical density, i.e. index of refraction, specified by `Ni`\\n\\n pub optical_density: Option<f32>,\\n\\n /// The ambient color map, specified by `map_Ka`\\n\\n pub ambient_map: Option<MtlTextureMap>,\\n\\n /// The diffuse color map, specified by `map_Kd`\\n\\n pub diffuse_map: Option<MtlTextureMap>,\\n\",\n \"file_path\": \"src/raw/material.rs\",\n \"rank\": 40,\n \"score\": 4.430365112993197\n },\n {\n \"content\": \"// Copyright 2014-2017 Hyeon Kim\\n\\n//\\n\\n// Licensed under the Apache License, Version 2.0 <LICENSE-APACHE or\\n\\n// http://www.apache.org/licenses/LICENSE-2.0> or the MIT license\\n\\n// <LICENSE-MIT or http://opensource.org/licenses/MIT>, at your\\n\\n// option. This file may not be copied, modified, or distributed\\n\\n// except according to those terms.\\n\\n\\n\\n//! Parses `.mtl` format which stores material data\\n\\n\\n\\nuse std::io::prelude::*;\\n\\nuse std::collections::HashMap;\\n\\nuse std::mem::replace;\\n\\n\\n\\nuse error::ObjResult;\\n\\nuse raw::lexer::lex;\\n\\n\\n\\n/// Parses &[&str] into &[f32].\\n\\nmacro_rules! f {\\n\\n ($args:expr) => (\\n\",\n \"file_path\": \"src/raw/material.rs\",\n \"rank\": 41,\n \"score\": 4.383881059861473\n },\n {\n \"content\": \"// Copyright 2014-2017 Hyeon Kim\\n\\n//\\n\\n// Licensed under the Apache License, Version 2.0 <LICENSE-APACHE or\\n\\n// http://www.apache.org/licenses/LICENSE-2.0> or the MIT license\\n\\n// <LICENSE-MIT or http://opensource.org/licenses/MIT>, at your\\n\\n// option. This file may not be copied, modified, or distributed\\n\\n// except according to those terms.\\n\\n\\n\\n//! Parses `.obj` format which stores 3D mesh data\\n\\n\\n\\nuse std::io::BufRead;\\n\\nuse std::collections::HashMap;\\n\\nuse vec_map::VecMap;\\n\\nuse error::ObjResult;\\n\\nuse raw::lexer::lex;\\n\\n\\n\\n/// Parses &[&str] into &[f32].\\n\\nmacro_rules! f {\\n\\n ($args:expr) => (\\n\\n &{\\n\",\n \"file_path\": \"src/raw/object.rs\",\n \"rank\": 42,\n \"score\": 4.31264260892797\n },\n {\n \"content\": \"}\\n\\n\\n\\n/// Vertex data type of `Obj` which contains only position data of a vertex.\\n\\n#[derive(Copy, PartialEq, Clone, Debug, Serialize, Deserialize)]\\n\\npub struct Position {\\n\\n /// Position vector of a vertex.\\n\\n pub position: [f32; 3]\\n\\n}\\n\\n\\n\\n#[cfg(feature = \\\"glium-support\\\")]\\n\\nimplement_vertex!(Position, position);\\n\\n\\n\\nimpl<I: FromPrimitive + Integer> FromRawVertex<I> for Position {\\n\\n fn process(vertices: Vec<(f32, f32, f32, f32)>, _: Vec<(f32, f32, f32)>, _: Vec<(f32, f32, f32)>, polygons: Vec<Polygon>) -> ObjResult<(Vec<Self>, Vec<I>)> {\\n\\n let vb = vertices.into_iter().map(|v| Position { position: [v.0, v.1, v.2] }).collect();\\n\\n let mut ib = Vec::with_capacity(polygons.len() * 3);\\n\\n {\\n\\n let mut map = |pi: usize| { ib.push(I::from_usize(pi).expect(\\\"Unable to convert the index from usize\\\")) };\\n\\n\\n\\n for polygon in polygons {\\n\",\n \"file_path\": \"src/lib.rs\",\n \"rank\": 43,\n \"score\": 4.262158990687179\n },\n {\n \"content\": \" /// The specular color map, specified by `map_Ks`\\n\\n pub specular_map: Option<MtlTextureMap>,\\n\\n /// The emissive color map, specified by `map_Ke`\\n\\n pub emissive_map: Option<MtlTextureMap>,\\n\\n /// The dissolve map, specified by `map_d`\\n\\n pub dissolve_map: Option<MtlTextureMap>,\\n\\n /// The bump map (normal map), specified by `bump`\\n\\n pub bump_map: Option<MtlTextureMap>,\\n\\n}\\n\\n\\n\\n/// A color specified in a `.mtl` file\\n\\n#[derive(Clone, PartialEq, Debug)]\\n\\npub enum MtlColor {\\n\\n /// Color in the RGB color space\\n\\n Rgb(f32, f32, f32),\\n\\n /// Color in the CIEXYZ color space\\n\\n Xyz(f32, f32, f32),\\n\\n /// Color using a spectral curve\\n\\n ///\\n\\n /// The first argument is the name of a `.rfl` file specifying the curve.\\n\",\n \"file_path\": \"src/raw/material.rs\",\n \"rank\": 44,\n \"score\": 4.0147976758304775\n },\n {\n \"content\": \" let mut polygon = vec![(\\n\\n idx!(p, positions),\\n\\n idx!(t, tex_coords))];\\n\\n for gs in rest {\\n\\n let group = try!(parse_vertex_group(gs));\\n\\n if group.2 != 0 {\\n\\n error!(WrongTypeOfArguments, \\\"Unexpected vertex format\\\");\\n\\n }\\n\\n\\n\\n polygon.push((\\n\\n idx!(group.0, positions),\\n\\n idx!(group.1, tex_coords)));\\n\\n }\\n\\n\\n\\n Polygon::PT(polygon)\\n\\n }\\n\\n (p, 0, n) => {\\n\\n let mut polygon = vec![(\\n\\n idx!(p, positions),\\n\\n idx!(n, normals))];\\n\",\n \"file_path\": \"src/raw/object.rs\",\n \"rank\": 45,\n \"score\": 3.539684793448432\n },\n {\n \"content\": \" for gs in rest {\\n\\n let group = try!(parse_vertex_group(gs));\\n\\n if group.1 != 0 {\\n\\n error!(WrongTypeOfArguments, \\\"Unexpected vertex format\\\");\\n\\n }\\n\\n\\n\\n polygon.push((\\n\\n idx!(group.0, positions),\\n\\n idx!(group.2, normals)));\\n\\n }\\n\\n\\n\\n Polygon::PN(polygon)\\n\\n }\\n\\n (p, t, n) => {\\n\\n let mut polygon = vec![(\\n\\n idx!(p, positions),\\n\\n idx!(t, tex_coords),\\n\\n idx!(n, normals))];\\n\\n for gs in rest {\\n\\n let group = try!(parse_vertex_group(gs));\\n\",\n \"file_path\": \"src/raw/object.rs\",\n \"rank\": 46,\n \"score\": 3.499303377599087\n },\n {\n \"content\": \" let first = args.next().unwrap();\\n\\n let rest = args;\\n\\n\\n\\n let group = try!(parse_vertex_group(first));\\n\\n\\n\\n let polygon = match group {\\n\\n (p, 0, 0) => {\\n\\n let mut polygon = vec![idx!(p, positions)];\\n\\n for gs in rest {\\n\\n let group = try!(parse_vertex_group(gs));\\n\\n if group.1 != 0 || group.2 != 0 {\\n\\n error!(WrongTypeOfArguments, \\\"Unexpected vertex format\\\");\\n\\n }\\n\\n\\n\\n polygon.push(idx!(group.0, positions));\\n\\n }\\n\\n\\n\\n Polygon::P(polygon)\\n\\n }\\n\\n (p, t, 0) => {\\n\",\n \"file_path\": \"src/raw/object.rs\",\n \"rank\": 47,\n \"score\": 3.499303377599087\n },\n {\n \"content\": \" pub param_vertices: Vec<(f32, f32, f32)>,\\n\\n\\n\\n /// Points which stores the index data of position vectors.\\n\\n pub points: Vec<Point>,\\n\\n /// Lines which store the index data of vectors.\\n\\n pub lines: Vec<Line>,\\n\\n /// Polygons which store the index data of vectors.\\n\\n pub polygons: Vec<Polygon>,\\n\\n\\n\\n /// Groups of multiple geometries.\\n\\n pub groups: HashMap<String, Group>,\\n\\n /// Geometries which consist in a same material.\\n\\n pub meshes: HashMap<String, Group>,\\n\\n /// Smoothing groups.\\n\\n pub smoothing_groups: VecMap<Group>,\\n\\n /// Merging groups.\\n\\n pub merging_groups: VecMap<Group>\\n\\n}\\n\\n\\n\\n/// The `Point` type which stores the index of the position vector.\\n\",\n \"file_path\": \"src/raw/object.rs\",\n \"rank\": 48,\n \"score\": 3.4769930350772817\n },\n {\n \"content\": \" PN(Vec<(usize, usize)>),\\n\\n /// A polygon which contains all position, texture coordinate and normal data of each vertex.\\n\\n PTN(Vec<(usize, usize, usize)>)\\n\\n}\\n\\n\\n\\n/// A group which contains ranges of points, lines and polygons\\n\\n#[derive(Clone, Debug)]\\n\\npub struct Group {\\n\\n /// Multiple range of points\\n\\n pub points: Vec<Range>,\\n\\n /// Multiple range of lines\\n\\n pub lines: Vec<Range>,\\n\\n /// Multiple range of polygons\\n\\n pub polygons: Vec<Range>\\n\\n}\\n\\n\\n\\n\\n\\n/// A struct which represent `[start, end)` range.\\n\\n#[derive(Copy, PartialEq, Eq, Clone, Debug)]\\n\\npub struct Range {\\n\\n /// The lower bound of the range (inclusive).\\n\\n pub start: usize,\\n\\n /// The upper bound of the range (exclusive).\\n\\n pub end: usize\\n\\n}\\n\",\n \"file_path\": \"src/raw/object.rs\",\n \"rank\": 49,\n \"score\": 3.364168587863815\n },\n {\n \"content\": \"\\n\\n let line = match group {\\n\\n (p, 0, 0) => {\\n\\n let mut points = vec![idx!(p, positions)];\\n\\n for gs in rest {\\n\\n let group = try!(parse_vertex_group(gs));\\n\\n if group.1 != 0 || group.2 != 0 {\\n\\n error!(WrongTypeOfArguments, \\\"Unexpected vertex format\\\");\\n\\n }\\n\\n\\n\\n points.push(idx!(group.0, positions));\\n\\n }\\n\\n Line::P(points)\\n\\n }\\n\\n (p, t, 0) => {\\n\\n let mut points = vec![(\\n\\n idx!(p, positions),\\n\\n idx!(t, tex_coords))];\\n\\n for gs in rest {\\n\\n let group = try!(parse_vertex_group(gs));\\n\",\n \"file_path\": \"src/raw/object.rs\",\n \"rank\": 50,\n \"score\": 3.346589203118696\n },\n {\n \"content\": \"/// A trait which should be implemented by a type passed into `Key` of `Map`.\\n\\ntrait Key : Eq {}\\n\\n\\n\\nimpl Key for String {}\\n\\nimpl Key for usize {}\\n\\n\\n\\n\\n\\n/// Low-level Rust binding for `.obj` format.\\n\\npub struct RawObj {\\n\\n /// Name of the object.\\n\\n pub name: Option<String>,\\n\\n /// `.mtl` files which required by this object.\\n\\n pub material_libraries: Vec<String>,\\n\\n\\n\\n /// Position vectors of each vertex.\\n\\n pub positions: Vec<(f32, f32, f32, f32)>,\\n\\n /// Texture coordinates of each vertex.\\n\\n pub tex_coords: Vec<(f32, f32, f32)>,\\n\\n /// Normal vectors of each vertex.\\n\\n pub normals: Vec<(f32, f32, f32)>,\\n\\n /// Parametric vertices.\\n\",\n \"file_path\": \"src/raw/object.rs\",\n \"rank\": 51,\n \"score\": 3.109482886076595\n },\n {\n \"content\": \" ],\\n\\n light: (-1.0, -1.0, -1.0f32)\\n\\n };\\n\\n\\n\\n let params = glium::DrawParameters {\\n\\n depth: glium::Depth {\\n\\n test: glium::DepthTest::IfLess,\\n\\n write: true,\\n\\n ..Default::default()\\n\\n },\\n\\n ..Default::default()\\n\\n };\\n\\n\\n\\n // the main loop\\n\\n // each cycle will draw once\\n\\n let mut running = true;\\n\\n while running {\\n\\n use glium::Surface;\\n\\n use std::thread::sleep;\\n\\n use std::time::Duration;\\n\",\n \"file_path\": \"examples/glium.rs\",\n \"rank\": 52,\n \"score\": 2.9695104650106368\n },\n {\n \"content\": \"// Copyright 2014-2017 Hyeon Kim\\n\\n//\\n\\n// Licensed under the Apache License, Version 2.0 <LICENSE-APACHE or\\n\\n// http://www.apache.org/licenses/LICENSE-2.0> or the MIT license\\n\\n// <LICENSE-MIT or http://opensource.org/licenses/MIT>, at your\\n\\n// option. This file may not be copied, modified, or distributed\\n\\n// except according to those terms.\\n\\n\\n\\nextern crate obj;\\n\\n\\n\\nuse std::fs::File;\\n\\nuse std::io::BufReader;\\n\\nuse obj::raw::*;\\n\\nuse obj::raw::object::Range;\\n\\n\\n\\nmacro_rules! test {\\n\\n ($($lhs:expr, $rhs:expr)*) => ({\\n\\n $(eq!($lhs, $rhs);)*\\n\\n });\\n\\n}\\n\",\n \"file_path\": \"tests/raw-group.rs\",\n \"rank\": 53,\n \"score\": 2.8954307733903173\n },\n {\n \"content\": \" }\\n\\n \\\"illum\\\" => {\\n\\n match args.len() {\\n\\n 1 => mat.illumination_model = Some(try!(args[0].parse())),\\n\\n _ => error!(WrongNumberOfArguments, \\\"Expected exactly 1 argument\\\")\\n\\n }\\n\\n }\\n\\n \\\"d\\\" => {\\n\\n match args.len() {\\n\\n 1 => mat.dissolve = Some(try!(args[0].parse())),\\n\\n _ => error!(WrongNumberOfArguments, \\\"Expected exactly 1 argument\\\")\\n\\n }\\n\\n }\\n\\n \\\"Tr\\\" => {\\n\\n match args.len() {\\n\\n 1 => mat.dissolve = Some(1.0 - try!(args[0].parse::<f32>())),\\n\\n _ => error!(WrongNumberOfArguments, \\\"Expected exactly 1 argument\\\")\\n\\n }\\n\\n }\\n\\n\\n\",\n \"file_path\": \"src/raw/material.rs\",\n \"rank\": 54,\n \"score\": 2.8091625652868446\n },\n {\n \"content\": \" /// The second argument is a multiplier for the values in the `.rfl` file.\\n\\n Spectral(String, f32)\\n\\n}\\n\\n\\n\\n/// A texture map specified in a `.mtl` file\\n\\n#[derive(Clone, PartialEq, Eq, Debug)]\\n\\npub struct MtlTextureMap {\\n\\n /// The name of the texture file\\n\\n pub file: String,\\n\\n // TODO: support arguments to the texture map\\n\\n}\\n\",\n \"file_path\": \"src/raw/material.rs\",\n \"rank\": 55,\n \"score\": 2.738057987022006\n },\n {\n \"content\": \" for polygon in polygons {\\n\\n match polygon {\\n\\n Polygon::P(_) => error!(InsufficientData, \\\"Tried to extract normal and texture data which are not contained in the model\\\"),\\n\\n Polygon::PT(_) => error!(InsufficientData, \\\"Tried to extract normal data which are not contained in the model\\\"),\\n\\n Polygon::PN(_) => error!(InsufficientData, \\\"Tried to extract texture data which are not contained in the model\\\"),\\n\\n Polygon::PTN(ref vec) if vec.len() == 3 => {\\n\\n for &(pi, ti, ni) in vec { map(pi, ni, ti) }\\n\\n }\\n\\n _ => error!(UntriangulatedModel, \\\"Model should be triangulated first to be loaded properly\\\")\\n\\n }\\n\\n }\\n\\n }\\n\\n vb.shrink_to_fit();\\n\\n Ok((vb, ib))\\n\\n }\\n\\n}\\n\\n\\n\\n\\n\\n#[cfg(feature = \\\"glium-support\\\")]\\n\\nmod glium_support {\\n\",\n \"file_path\": \"src/lib.rs\",\n \"rank\": 56,\n \"score\": 2.704392087524562\n },\n {\n \"content\": \"// Copyright 2014-2017 Hyeon Kim\\n\\n//\\n\\n// Licensed under the Apache License, Version 2.0 <LICENSE-APACHE or\\n\\n// http://www.apache.org/licenses/LICENSE-2.0> or the MIT license\\n\\n// <LICENSE-MIT or http://opensource.org/licenses/MIT>, at your\\n\\n// option. This file may not be copied, modified, or distributed\\n\\n// except according to those terms.\\n\\n\\n\\nextern crate obj;\\n\\n\\n\\nuse std::fs::File;\\n\\nuse std::io::BufReader;\\n\\nuse obj::*;\\n\\n\\n\\nmacro_rules! fixture {\\n\\n ($name:expr) => (BufReader::new(File::open(concat!(\\\"tests/fixtures/\\\", $name)).unwrap()))\\n\\n}\\n\\n\\n\\n#[test]\\n\",\n \"file_path\": \"tests/obj.rs\",\n \"rank\": 57,\n \"score\": 2.582237748344732\n },\n {\n \"content\": \"pub type Point = usize;\\n\\n\\n\\n/// The `Line` type.\\n\\n#[derive(PartialEq, Eq, Clone, Debug)]\\n\\npub enum Line {\\n\\n /// A series of line segments which contain only the position data of each vertex\\n\\n P(Vec<usize>),\\n\\n /// A series of line segments which contain both position and texture coordinate\\n\\n /// data of each vertex\\n\\n PT(Vec<(usize, usize)>)\\n\\n}\\n\\n\\n\\n/// The `Polygon` type.\\n\\n#[derive(PartialEq, Eq, Clone, Debug)]\\n\\npub enum Polygon {\\n\\n /// A polygon which contains only the position data of each vertex.\\n\\n P(Vec<usize>),\\n\\n /// A polygon which contains both position and texture coordinate data of each vertex.\\n\\n PT(Vec<(usize, usize)>),\\n\\n /// A polygon which contains both position and normal data of each vertex.\\n\",\n \"file_path\": \"src/raw/object.rs\",\n \"rank\": 58,\n \"score\": 2.567680683475059\n },\n {\n \"content\": \"// Copyright 2014-2017 Hyeon Kim\\n\\n//\\n\\n// Licensed under the Apache License, Version 2.0 <LICENSE-APACHE or\\n\\n// http://www.apache.org/licenses/LICENSE-2.0> or the MIT license\\n\\n// <LICENSE-MIT or http://opensource.org/licenses/MIT>, at your\\n\\n// option. This file may not be copied, modified, or distributed\\n\\n// except according to those terms.\\n\\n\\n\\n/*!\\n\\n\\n\\n[Wavefront OBJ][obj] parser for Rust. It handles both `.obj` and `.mtl` formats. [GitHub][]\\n\\n\\n\\n```rust\\n\\nuse std::fs::File;\\n\\nuse std::io::BufReader;\\n\\nuse obj::*;\\n\\n\\n\\nlet input = BufReader::new(File::open(\\\"tests/fixtures/normal-cone.obj\\\").unwrap());\\n\\nlet dome: Obj = load_obj(input).unwrap();\\n\\n\\n\",\n \"file_path\": \"src/lib.rs\",\n \"rank\": 59,\n \"score\": 2.4436746488949304\n },\n {\n \"content\": \" match stmt {\\n\\n // Vertex data\\n\\n \\\"v\\\" => {\\n\\n let args = f!(args);\\n\\n positions.push(match args.len() {\\n\\n 4 => (args[0], args[1], args[2], args[3]),\\n\\n 3 => (args[0], args[1], args[2], 1.0),\\n\\n _ => error!(WrongNumberOfArguments, \\\"Expected 3 or 4 arguments\\\")\\n\\n })\\n\\n }\\n\\n \\\"vt\\\" => {\\n\\n let args = f!(args);\\n\\n tex_coords.push(match args.len() {\\n\\n 3 => (args[0], args[1], args[2]),\\n\\n 2 => (args[0], args[1], 0.0),\\n\\n 1 => (args[0], 0.0, 0.0),\\n\\n _ => error!(WrongNumberOfArguments, \\\"Expected 1, 2 or 3 arguments\\\")\\n\\n })\\n\\n }\\n\\n \\\"vn\\\" => {\\n\",\n \"file_path\": \"src/raw/object.rs\",\n \"rank\": 60,\n \"score\": 2.387398479252434\n },\n {\n \"content\": \"// Copyright 2014-2017 Hyeon Kim\\n\\n//\\n\\n// Licensed under the Apache License, Version 2.0 <LICENSE-APACHE or\\n\\n// http://www.apache.org/licenses/LICENSE-2.0> or the MIT license\\n\\n// <LICENSE-MIT or http://opensource.org/licenses/MIT>, at your\\n\\n// option. This file may not be copied, modified, or distributed\\n\\n// except according to those terms.\\n\\n\\n\\n#![feature(test)]\\n\\n\\n\\nextern crate obj;\\n\\nextern crate test;\\n\\n\\n\\nuse test::Bencher;\\n\\n\\n\\nuse obj::raw::parse_obj;\\n\\n\\n\",\n \"file_path\": \"benches/bench.rs\",\n \"rank\": 61,\n \"score\": 2.3717348147016515\n },\n {\n \"content\": \" \\\"scrv\\\" => unimplemented!(),\\n\\n \\\"sp\\\" => unimplemented!(),\\n\\n \\\"end\\\" => unimplemented!(),\\n\\n\\n\\n // Connectivity between free-form surfaces\\n\\n \\\"con\\\" => unimplemented!(),\\n\\n\\n\\n // Grouping\\n\\n \\\"g\\\" => {\\n\\n match args.len() {\\n\\n 1 => group_builder.start(args[0].to_string()),\\n\\n _ => error!(WrongNumberOfArguments, \\\"Expected group name parameter, but nothing has been supplied\\\")\\n\\n }\\n\\n }\\n\\n \\\"s\\\" => {\\n\\n match args.len() {\\n\\n 1 if (args[0] == \\\"off\\\" || args[0] == \\\"0\\\") => smoothing_builder.end(),\\n\\n 1 => smoothing_builder.start(try!(args[0].parse())),\\n\\n _ => error!(WrongNumberOfArguments, \\\"Expected only 1 argument\\\")\\n\\n }\\n\",\n \"file_path\": \"src/raw/object.rs\",\n \"rank\": 62,\n \"score\": 2.368451965300313\n },\n {\n \"content\": \" \\\"usemtl\\\" => {\\n\\n match args.len() {\\n\\n 1 => mesh_builder.start(args[0].to_string()),\\n\\n _ => error!(WrongNumberOfArguments, \\\"Expected only 1 argument\\\")\\n\\n }\\n\\n }\\n\\n \\\"mtllib\\\" => {\\n\\n // TODO: .push_all()\\n\\n material_libraries.reserve(args.len());\\n\\n for path in args {\\n\\n material_libraries.push(path.to_string());\\n\\n }\\n\\n }\\n\\n \\\"shadow_obj\\\" => unimplemented!(),\\n\\n \\\"trace_obj\\\" => unimplemented!(),\\n\\n \\\"ctech\\\" => unimplemented!(),\\n\\n \\\"stech\\\" => unimplemented!(),\\n\\n\\n\\n // Unexpected statement\\n\\n _ => error!(UnexpectedStatement, \\\"Received unknown statement\\\")\\n\",\n \"file_path\": \"src/raw/object.rs\",\n \"rank\": 63,\n \"score\": 2.349803804570155\n },\n {\n \"content\": \" let args = f!(args);\\n\\n normals.push(match args.len() {\\n\\n 3 => (args[0], args[1], args[2]),\\n\\n _ => error!(WrongNumberOfArguments, \\\"Expected 3 arguments\\\")\\n\\n })\\n\\n }\\n\\n \\\"vp\\\" => {\\n\\n let args = f!(args);\\n\\n param_vertices.push(match args.len() {\\n\\n 3 => (args[0], args[1], args[2]),\\n\\n 2 => (args[0], args[1], 1.0),\\n\\n 1 => (args[0], 0.0, 1.0),\\n\\n _ => error!(WrongNumberOfArguments, \\\"Expected 1, 2 or 3 arguments\\\")\\n\\n })\\n\\n }\\n\\n\\n\\n // Free-form curve / surface attributes\\n\\n \\\"cstype\\\" => {\\n\\n let _rational: bool;\\n\\n let geometry = match args.len() {\\n\",\n \"file_path\": \"src/raw/object.rs\",\n \"rank\": 64,\n \"score\": 2.349803804570155\n },\n {\n \"content\": \"// Do whatever you want\\n\\ndome.vertices;\\n\\ndome.indices;\\n\\n```\\n\\n\\n\\n<img src=\\\"http://simnalamburt.github.io/obj-rs/screenshot.png\\\" style=\\\"max-width:100%\\\">\\n\\n\\n\\n[obj]: https://en.wikipedia.org/wiki/Wavefront_.obj_file\\n\\n[GitHub]: https://github.com/simnalamburt/obj-rs\\n\\n\\n\\n*/\\n\\n\\n\\n#![deny(missing_docs)]\\n\\n\\n\\n#[cfg(feature = \\\"glium-support\\\")] #[macro_use] extern crate glium;\\n\\nextern crate num;\\n\\nextern crate vec_map;\\n\\n\\n\\n#[macro_use] extern crate serde_derive;\\n\\n\\n\",\n \"file_path\": \"src/lib.rs\",\n \"rank\": 65,\n \"score\": 2.199879025312731\n },\n {\n \"content\": \" };\\n\\n ib.push(index)\\n\\n };\\n\\n\\n\\n for polygon in polygons {\\n\\n match polygon {\\n\\n Polygon::P(_) | Polygon::PT(_) => error!(InsufficientData, \\\"Tried to extract normal data which are not contained in the model\\\"),\\n\\n Polygon::PN(ref vec) if vec.len() == 3 => {\\n\\n for &(pi, ni) in vec { map(pi, ni) }\\n\\n }\\n\\n Polygon::PTN(ref vec) if vec.len() == 3 => {\\n\\n for &(pi, _, ni) in vec { map(pi, ni) }\\n\\n }\\n\\n _ => error!(UntriangulatedModel, \\\"Model should be triangulated first to be loaded properly\\\")\\n\\n }\\n\\n }\\n\\n }\\n\\n vb.shrink_to_fit();\\n\\n Ok((vb, ib))\\n\\n }\\n\",\n \"file_path\": \"src/lib.rs\",\n \"rank\": 66,\n \"score\": 2.178294378642745\n },\n {\n \"content\": \" }\\n\\n }\\n\\n\\n\\n _ => {\\n\\n let args = f!(args);\\n\\n match args.len() {\\n\\n 1 => MtlColor::Rgb(args[0], args[0], args[0]),\\n\\n 3 => MtlColor::Rgb(args[0], args[1], args[2]),\\n\\n _ => error!(WrongNumberOfArguments, \\\"Expected 1 or 3 color values\\\")\\n\\n }\\n\\n }\\n\\n })\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/raw/material.rs\",\n \"rank\": 67,\n \"score\": 2.173451235172776\n },\n {\n \"content\": \" }\\n\\n\\n\\n // Material color and illumination statements\\n\\n \\\"Ka\\\" => mat.ambient = Some(try!(parse_color(args))),\\n\\n \\\"Kd\\\" => mat.diffuse = Some(try!(parse_color(args))),\\n\\n \\\"Ks\\\" => mat.specular = Some(try!(parse_color(args))),\\n\\n \\\"Ke\\\" => mat.emissive = Some(try!(parse_color(args))),\\n\\n \\\"Km\\\" => unimplemented!(),\\n\\n \\\"Tf\\\" => mat.transmission_filter = Some(try!(parse_color(args))),\\n\\n \\\"Ns\\\" => {\\n\\n match args.len() {\\n\\n 1 => mat.specular_exponent = Some(try!(args[0].parse())),\\n\\n _ => error!(WrongNumberOfArguments, \\\"Expected exactly 1 argument\\\")\\n\\n }\\n\\n }\\n\\n \\\"Ni\\\" => {\\n\\n match args.len() {\\n\\n 1 => mat.optical_density = Some(try!(args[0].parse())),\\n\\n _ => error!(WrongNumberOfArguments, \\\"Expected exactly 1 argument\\\")\\n\\n }\\n\",\n \"file_path\": \"src/raw/material.rs\",\n \"rank\": 68,\n \"score\": 2.0164020720360236\n },\n {\n \"content\": \"obj-rs [![Travis Build Status]][travis] [![AppVeyor Build Status]][appveyor]\\n\\n========\\n\\n[Wavefront obj] parser for [Rust]. It handles both `.obj` and `.mtl` formats.\\n\\n\\n\\n- [API Documentation](https://simnalamburt.github.io/obj-rs/)\\n\\n- [See `obj-rs` in crates.io](https://crates.io/crates/obj-rs)\\n\\n\\n\\n```toml\\n\\n[dependencies]\\n\\nobj-rs = \\\"0.4\\\"\\n\\n```\\n\\n```rust\\n\\nuse std::fs::File;\\n\\nuse std::io::BufReader;\\n\\nuse obj::*;\\n\\n\\n\\nlet input = try!(BufReader::new(File::open(\\\"tests/fixtures/dome.obj\\\")));\\n\\nlet dome: Obj = try!(load_obj(input));\\n\\n\\n\\n// Do whatever you want\\n\\ndome.vertices;\\n\\ndome.indices;\\n\\n```\\n\\n\\n\\n![img]\\n\\n\\n\\n> This sample image is pretty good illustration of current status of **obj-rs**.\\n\\n**obj-rs** is currently able to load position and normal data of `obj` but not\\n\\ntexture & material data yet.\\n\\n\\n\\n<br>\\n\\n\\n\\nGlium support\\n\\n--------\\n\\n**obj-rs** supports [glium] out of the box.\\n\\n\\n\\n```toml\\n\\n[dependencies]\\n\\nglium = \\\"0.14\\\"\\n\\nobj-rs = { version = \\\"0.4\\\", features = [\\\"glium-support\\\"] }\\n\\n```\\n\\n```rust\\n\\nuse std::fs::File;\\n\\nuse std::io::BufReader;\\n\\nuse obj::*;\\n\\n\\n\\nlet input = BufReader::new(try!(File::open(\\\"rilakkuma.obj\\\")));\\n\\nlet obj: Obj = try!(load_obj(input));\\n\\n\\n\\nlet vb = try!(obj.vertex_buffer(&display));\\n\\nlet ib = try!(obj.index_buffer(&display));\\n\\n```\\n\\n\\n\\nPlease see the [working sample] for the further details. Use can execute it with\\n\\nthe command below.\\n\\n```bash\\n\\ncargo run --example glium --features glium-support\\n\\n```\\n\\n\\n\\n<br>\\n\\n\\n\\n--------\\n\\n*obj-rs* is primarily distributed under the terms of both the [Apache License\\n\\n(Version 2.0)] and the [MIT license]. See [COPYRIGHT] for details.\\n\\n\\n\\n[Travis Build Status]: https://travis-ci.org/simnalamburt/obj-rs.svg?branch=master\\n\\n[travis]: https://travis-ci.org/simnalamburt/obj-rs\\n\\n[AppVeyor Build Status]: https://ci.appveyor.com/api/projects/status/281kjgy7oxaa120s/branch/master?svg=true\\n\\n[appveyor]: https://ci.appveyor.com/project/simnalamburt/obj-rs/branch/master\\n\\n\\n\\n[Wavefront obj]: https://en.wikipedia.org/wiki/Wavefront_.obj_file\\n\\n[Rust]: http://rust-lang.org\\n\\n[img]: https://simnalamburt.github.io/obj-rs/screenshot.png\\n\\n[glium]: https://github.com/tomaka/glium\\n\\n[working sample]: examples/glium.rs\\n\\n[MIT license]: LICENSE-MIT\\n\\n[Apache License (Version 2.0)]: LICENSE-APACHE\\n\\n[COPYRIGHT]: COPYRIGHT\\n\",\n \"file_path\": \"README.md\",\n \"rank\": 69,\n \"score\": 1.9759617433130363\n },\n {\n \"content\": \" }\\n\\n }\\n\\n \\\"bmat\\\" => unimplemented!(),\\n\\n \\\"step\\\" => unimplemented!(),\\n\\n\\n\\n // Elements\\n\\n \\\"p\\\" => {\\n\\n for v in args {\\n\\n let v : i32 = try!(v.parse());\\n\\n let v = idx!(v, positions);\\n\\n points.push(v);\\n\\n }\\n\\n }\\n\\n \\\"l\\\" => {\\n\\n if args.len() < 2 { error!(WrongNumberOfArguments, \\\"Expected at least 2 arguments\\\") }\\n\\n let mut args = args.iter();\\n\\n let first = args.next().unwrap();\\n\\n let rest = args;\\n\\n\\n\\n let group = try!(parse_vertex_group(first));\\n\",\n \"file_path\": \"src/raw/object.rs\",\n \"rank\": 70,\n \"score\": 1.8500862841781238\n },\n {\n \"content\": \" }\\n\\n \\\"mg\\\" => {\\n\\n match args.len() {\\n\\n 1 if (args[0] == \\\"off\\\" || args[0] == \\\"0\\\") => merging_builder.end(),\\n\\n 1 => merging_builder.start(try!(args[0].parse())),\\n\\n _ => error!(WrongNumberOfArguments, \\\"Expected only 1 argument\\\")\\n\\n }\\n\\n }\\n\\n \\\"o\\\" => {\\n\\n name = match args.len() {\\n\\n 0 => None,\\n\\n _ => Some(args.join(\\\" \\\"))\\n\\n }\\n\\n }\\n\\n\\n\\n // Display / render attributes\\n\\n \\\"bevel\\\" => unimplemented!(),\\n\\n \\\"c_interp\\\" => unimplemented!(),\\n\\n \\\"d_interp\\\" => unimplemented!(),\\n\\n \\\"lod\\\" => unimplemented!(),\\n\",\n \"file_path\": \"src/raw/object.rs\",\n \"rank\": 71,\n \"score\": 1.8274292854922525\n },\n {\n \"content\": \"// Copyright 2014-2017 Hyeon Kim\\n\\n//\\n\\n// Licensed under the Apache License, Version 2.0 <LICENSE-APACHE or\\n\\n// http://www.apache.org/licenses/LICENSE-2.0> or the MIT license\\n\\n// <LICENSE-MIT or http://opensource.org/licenses/MIT>, at your\\n\\n// option. This file may not be copied, modified, or distributed\\n\\n// except according to those terms.\\n\\n\\n\\nextern crate obj;\\n\\n\\n\\nuse obj::raw::{RawObj, parse_obj};\\n\\n\\n\",\n \"file_path\": \"tests/raw-basics.rs\",\n \"rank\": 72,\n \"score\": 1.731760050839843\n },\n {\n \"content\": \"\\n\\nmacro_rules! eq {\\n\\n ($lhs:expr, $rhs:expr) => (eq!($lhs, $rhs, stringify!($lhs)));\\n\\n\\n\\n ($lhs:expr, $rhs:expr, $exp:expr) => ({\\n\\n let left = &($lhs);\\n\\n let right = &($rhs);\\n\\n\\n\\n if !((*left == *right) && (*right == *left)) {\\n\\n use std::io::Write;\\n\\n let _ = writeln!(&mut std::io::stderr(), \\\"\\\\x1b[33m{}\\\\x1b[0m should be \\\\x1b[33m{:?}\\\\x1b[0m, \\\\\\n\\n but it was \\\\x1b[33m{:?}\\\\x1b[0m\\\", $exp, *right, *left);\\n\\n panic!($exp);\\n\\n }\\n\\n });\\n\\n}\\n\\n\\n\",\n \"file_path\": \"tests/raw-basics.rs\",\n \"rank\": 73,\n \"score\": 1.6744526032799207\n },\n {\n \"content\": \"// Copyright 2014-2017 Hyeon Kim\\n\\n//\\n\\n// Licensed under the Apache License, Version 2.0 <LICENSE-APACHE or\\n\\n// http://www.apache.org/licenses/LICENSE-2.0> or the MIT license\\n\\n// <LICENSE-MIT or http://opensource.org/licenses/MIT>, at your\\n\\n// option. This file may not be copied, modified, or distributed\\n\\n// except according to those terms.\\n\\n\\n\\nextern crate obj;\\n\\n\\n\\nuse obj::raw::material::{RawMtl, Material, MtlColor, MtlTextureMap, parse_mtl};\\n\\n\\n\",\n \"file_path\": \"tests/raw-material.rs\",\n \"rank\": 74,\n \"score\": 1.603693323074617\n },\n {\n \"content\": \"\\n\\n let mut target = display.draw();\\n\\n target.clear_color_and_depth((0.0, 0.0, 0.0, 0.0), 1.0);\\n\\n target.draw(&vb, &ib, &program, &uniforms, ¶ms).unwrap();\\n\\n target.finish().unwrap();\\n\\n\\n\\n // sleeping for some time in order not to use up too much CPU\\n\\n sleep(Duration::from_millis(17));\\n\\n\\n\\n // polling and handling the events received by the window\\n\\n events_loop.poll_events(|event| {\\n\\n match event {\\n\\n glutin::Event::WindowEvent {event: glutin::WindowEvent::CloseRequested, ..} => running = false,\\n\\n _ => ()\\n\\n }\\n\\n });\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"examples/glium.rs\",\n \"rank\": 75,\n \"score\": 1.5705098965571946\n },\n {\n \"content\": \" let index = match cache.entry((pi, ni, ti)) {\\n\\n // Cache miss -> make new, store it on cache\\n\\n Entry::Vacant(entry) => {\\n\\n let p = positions[pi];\\n\\n let n = normals[ni];\\n\\n let t = tex_coords[ti];\\n\\n let vertex = TexturedVertex { position: [p.0, p.1, p.2], normal: [n.0, n.1, n.2], texture: [t.0, t.1, t.2] };\\n\\n let index = I::from_usize(vb.len()).expect(\\\"Unable to convert the index from usize\\\");\\n\\n vb.push(vertex);\\n\\n entry.insert(index);\\n\\n index\\n\\n }\\n\\n // Cache hit -> use it\\n\\n Entry::Occupied(entry) => {\\n\\n *entry.get()\\n\\n }\\n\\n };\\n\\n ib.push(index)\\n\\n };\\n\\n\\n\",\n \"file_path\": \"src/lib.rs\",\n \"rank\": 76,\n \"score\": 1.5232320975684193\n },\n {\n \"content\": \"// Copyright 2014-2017 Hyeon Kim\\n\\n//\\n\\n// Licensed under the Apache License, Version 2.0 <LICENSE-APACHE or\\n\\n// http://www.apache.org/licenses/LICENSE-2.0> or the MIT license\\n\\n// <LICENSE-MIT or http://opensource.org/licenses/MIT>, at your\\n\\n// option. This file may not be copied, modified, or distributed\\n\\n// except according to those terms.\\n\\n\\n\\n//! Working example of *obj-rs*\\n\\n//! ========\\n\\n//!\\n\\n//! Execute it with the command below\\n\\n//!\\n\\n//! cargo run --example glium --features glium-support\\n\\n\\n\\n#[macro_use] extern crate glium;\\n\\nextern crate obj;\\n\\n\\n\\n#[cfg(feature = \\\"glium-support\\\")]\\n\",\n \"file_path\": \"examples/glium.rs\",\n \"rank\": 77,\n \"score\": 1.4787175663228433\n },\n {\n \"content\": \"\\n\\nmacro_rules! eq {\\n\\n ($lhs:expr, $rhs:expr) => (eq!($lhs, $rhs, stringify!($lhs)));\\n\\n\\n\\n ($lhs:expr, $rhs:expr, $exp:expr) => ({\\n\\n let left = &($lhs);\\n\\n let right = &($rhs);\\n\\n\\n\\n if !((*left == *right) && (*right == *left)) {\\n\\n stderr!(\\\"\\\");\\n\\n stderr!(\\\"{w}{}{c} should be {o}{:?}{c}, but it was {o}{:?}{c}. See {b}{}:{}{c}.\\\",\\n\\n $exp, *right, *left, line!(), column!(),\\n\\n w=\\\"\\\\x1b[97m\\\", b=\\\"\\\\x1b[34m\\\", o=\\\"\\\\x1b[33m\\\", c=\\\"\\\\x1b[0m\\\");\\n\\n stderr!(\\\"\\\");\\n\\n panic!($exp);\\n\\n }\\n\\n });\\n\\n}\\n\\n\\n\\nmacro_rules! stderr {\\n\\n ($($arg:tt)*) => ({\\n\\n use std::io::Write;\\n\\n writeln!(&mut std::io::stderr(), $($arg)*).unwrap()\\n\\n })\\n\\n}\\n\\n\\n\\n#[test]\\n\",\n \"file_path\": \"tests/raw-group.rs\",\n \"rank\": 78,\n \"score\": 1.4787175663228433\n },\n {\n \"content\": \" let mut ib = Vec::with_capacity(polygons.len() * 3);\\n\\n {\\n\\n let mut cache = HashMap::new();\\n\\n let mut map = |pi: usize, ni: usize| {\\n\\n // Look up cache\\n\\n let index = match cache.entry((pi, ni)) {\\n\\n // Cache miss -> make new, store it on cache\\n\\n Entry::Vacant(entry) => {\\n\\n let p = positions[pi];\\n\\n let n = normals[ni];\\n\\n let vertex = Vertex { position: [p.0, p.1, p.2], normal: [n.0, n.1, n.2]};\\n\\n let index = I::from_usize(vb.len()).expect(\\\"Unable to convert the index from usize\\\");\\n\\n vb.push(vertex);\\n\\n entry.insert(index);\\n\\n index\\n\\n }\\n\\n // Cache hit -> use it\\n\\n Entry::Occupied(entry) => {\\n\\n *entry.get()\\n\\n }\\n\",\n \"file_path\": \"src/lib.rs\",\n \"rank\": 79,\n \"score\": 1.3843224005108343\n },\n {\n \"content\": \" match polygon {\\n\\n Polygon::P(ref vec) if vec.len() == 3 => {\\n\\n for &pi in vec { map(pi) }\\n\\n }\\n\\n Polygon::PT(ref vec) | Polygon::PN(ref vec) if vec.len() == 3 => {\\n\\n for &(pi, _) in vec { map(pi) }\\n\\n }\\n\\n Polygon::PTN(ref vec) if vec.len() == 3 => {\\n\\n for &(pi, _, _) in vec { map(pi) }\\n\\n }\\n\\n _ => error!(UntriangulatedModel, \\\"Model should be triangulated first to be loaded properly\\\")\\n\\n }\\n\\n }\\n\\n }\\n\\n Ok((vb, ib))\\n\\n }\\n\\n}\\n\\n\\n\\n/// Vertex data type of `Obj` which contains position, normal and texture data of a vertex.\\n\\n#[derive(Copy, PartialEq, Clone, Debug, Serialize, Deserialize)]\\n\",\n \"file_path\": \"src/lib.rs\",\n \"rank\": 80,\n \"score\": 1.3733313760530148\n },\n {\n \"content\": \" // Texture map statements\\n\\n \\\"map_Ka\\\" => mat.ambient_map = Some(try!(parse_texture_map(args))),\\n\\n \\\"map_Kd\\\" => mat.diffuse_map = Some(try!(parse_texture_map(args))),\\n\\n \\\"map_Ks\\\" => mat.specular_map = Some(try!(parse_texture_map(args))),\\n\\n \\\"map_Ke\\\" => mat.emissive_map = Some(try!(parse_texture_map(args))),\\n\\n \\\"map_d\\\" => mat.dissolve_map = Some(try!(parse_texture_map(args))),\\n\\n \\\"map_aat\\\" => unimplemented!(),\\n\\n \\\"map_refl\\\" => unimplemented!(),\\n\\n \\\"map_bump\\\" | \\\"map_Bump\\\" | \\\"bump\\\" => mat.bump_map = Some(try!(parse_texture_map(args))),\\n\\n \\\"disp\\\" => unimplemented!(),\\n\\n\\n\\n // Reflection map statement\\n\\n \\\"refl\\\" => unimplemented!(),\\n\\n\\n\\n // Unexpected statement\\n\\n _ => error!(UnexpectedStatement, \\\"Received unknown statement\\\")\\n\\n }\\n\\n\\n\\n Ok(())\\n\\n }));\\n\\n\\n\\n // Insert the final material\\n\\n if let Some(name) = name {\\n\\n materials.insert(name, mat);\\n\\n }\\n\\n\\n\\n Ok(RawMtl { materials })\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/raw/material.rs\",\n \"rank\": 81,\n \"score\": 1.0761941634189842\n }\n]","isConversational":false}}},{"rowIdx":2399,"cells":{"lang":{"kind":"string","value":"Rust"},"file_path":{"kind":"string","value":"shipico/src/old/math/rect.rs"},"repo_name":{"kind":"string","value":"Shipica/Shipica.github.io"},"commit":{"kind":"string","value":"d5d451481d013228d99b98c1ccc1c8924f23ed61"},"file_code":{"kind":"string","value":"\n\nuse super::point::Point;\nuse super::size::Size;\nuse super::thickness::Thickness;\nuse super::vec2::Vec2;\n\nuse std::f64::{INFINITY, NEG_INFINITY};\nuse std::ops::{Add, Sub};\n\n#[derive(Copy, Clone, Debug, Default, PartialEq)]\n#[repr(C)]\npub struct Rect {\n \n pub left: f64,\n \n pub top: f64,\n \n pub right: f64,\n \n pub bottom: f64,\n}\n\n#[derive(Copy, Clone, Debug)]\npub enum RectCorner {\n \n TopLeft,\n \n TopRight,\n \n BottomLeft,\n \n BottomRight,\n}\n\nimpl Rect {\n \n pub const INFINITE: Rect = Rect {\n left: NEG_INFINITY,\n top: NEG_INFINITY,\n right: INFINITY,\n bottom: INFINITY,\n };\n\n \n #[inline]\n pub fn new(left: f64, top: f64, right: f64, bottom: f64) -> Rect {\n Rect {\n left,\n top,\n right,\n bottom,\n }\n }\n\n \n \n #[inline]\n pub fn from_points(p1: impl Into<Point>, p2: impl Into<Point>) -> Rect {\n let p1 = p1.into();\n let p2 = p2.into();\n Rect {\n left: p1.x.min(p2.x),\n top: p1.y.min(p2.y),\n right: p1.x.max(p2.x),\n bottom: p1.y.max(p2.y),\n }\n }\n\n \n \n #[inline]\n pub fn from_center_size(center: impl Into<Point>, size: impl Into<Size>) -> Rect {\n let center = center.into();\n let size = size.into();\n Rect {\n left: center.x - size.width / 2.0,\n top: center.y - size.height / 2.0,\n right: center.x + size.width / 2.0,\n bottom: center.y + size.height / 2.0,\n }\n }\n\n \n \n #[inline]\n pub fn from_center_half_extent(\n center: impl Into<Point>,\n half_extents: impl Into<Vec2>,\n ) -> Rect {\n let center = center.into();\n let half_extents = half_extents.into();\n Rect {\n left: center.x - half_extents.x,\n top: center.y - half_extents.y,\n right: center.x + half_extents.x,\n bottom: center.y + half_extents.y,\n }\n }\n\n \n \n #[inline]\n pub fn rounded(&self) -> Rect {\n Rect {\n left: self.left.round(),\n top: self.top.round(),\n right: self.right.round(),\n bottom: self.bottom.round(),\n }\n }\n\n \n #[inline]\n pub fn size(&self) -> Size {\n (\n self.right.max(self.left) - self.right.min(self.left),\n self.top.max(self.bottom) - self.top.min(self.bottom),\n )\n .into()\n }\n\n \n #[inline]\n pub fn center(&self) -> Point {\n Point {\n x: (self.left + self.right) / 2.0,\n y: (self.top + self.bottom) / 2.0,\n }\n }\n\n \n \n #[inline]\n pub fn half_extent(&self) -> Vec2 {\n let size = self.size();\n [size.width / 2.0, size.height / 2.0].into()\n }\n\n \n #[inline]\n pub fn corner(&self, corner: RectCorner) -> Point {\n match corner {\n RectCorner::TopLeft => (self.left, self.top).into(),\n RectCorner::TopRight => (self.right, self.top).into(),\n RectCorner::BottomLeft => (self.left, self.bottom).into(),\n RectCorner::BottomRight => (self.right, self.bottom).into(),\n }\n }\n\n \n #[inline]\n pub fn contains_point(&self, point: impl Into<Point>) -> bool {\n let point = point.into();\n point.x >= self.left\n && point.y >= self.top\n && point.x <= self.right\n && point.y <= self.bottom\n }\n\n \n #[inline]\n pub fn overlaps(&self, other: &Rect) -> bool {\n let a = self.normalized();\n let b = other.normalized();\n\n a.left < b.right && a.right > b.left && a.top < b.bottom && a.bottom > b.top\n }\n\n \n \n #[inline]\n pub fn normalized(self) -> Self {\n Rect {\n left: self.left.min(self.right),\n top: self.top.min(self.bottom),\n right: self.left.max(self.right),\n bottom: self.top.max(self.bottom),\n }\n }\n\n \n #[inline]\n pub fn translated_by(self, translation: impl Into<Vec2>) -> Self {\n let trans = translation.into();\n Rect {\n left: self.left + trans.x,\n top: self.top + trans.y,\n right: self.right + trans.x,\n bottom: self.bottom + trans.y,\n }\n }\n\n \n #[inline]\n pub fn expanded_by(self, thickness: impl Into<Thickness>) -> Self {\n let t = thickness.into();\n Rect {\n left: self.left - t.left,\n top: self.top - t.top,\n right: self.right + t.right,\n bottom: self.bottom + t.bottom,\n }\n }\n\n \n #[inline]\n pub fn shrunken_by(self, thickness: impl Into<Thickness>) -> Self {\n let t = thickness.into();\n Rect {\n left: self.left + t.left,\n top: self.top + t.top,\n right: self.right - t.right,\n bottom: self.bottom - t.bottom,\n }\n }\n\n \n \n #[inline]\n pub fn combined_with(&self, other: impl Into<Rect>) -> Self {\n let r1 = self.normalized();\n let r2 = other.into().normalized();\n\n let left = r1.left.min(r2.left);\n let top = r1.top.min(r2.top);\n let right = r1.right.max(r2.right);\n let bottom = r1.bottom.max(r2.bottom);\n\n Rect {\n left,\n top,\n right,\n bottom,\n }\n }\n}\n\nimpl Add<Vec2> for Rect {\n type Output = Rect;\n\n #[inline]\n fn add(self, rhs: Vec2) -> Rect {\n self.translated_by(rhs)\n }\n}\n\nimpl Sub<Vec2> for Rect {\n type Output = Rect;\n\n #[inline]\n fn sub(self, rhs: Vec2) -> Rect {\n self.translated_by(-rhs)\n }\n}\n\nimpl From<(Point, Point)> for Rect {\n #[inline]\n fn from((p1, p2): (Point, Point)) -> Rect {\n Rect::from_points(p1, p2)\n }\n}\n\nimpl From<(Point, Size)> for Rect {\n #[inline]\n fn from((center, size): (Point, Size)) -> Rect {\n Rect::from_center_size(center, size)\n }\n}\n\nimpl From<(Point, Vec2)> for Rect {\n #[inline]\n fn from((center, half_extent): (Point, Vec2)) -> Rect {\n Rect::from_center_half_extent(center, half_extent)\n }\n}\n\nimpl From<[f64; 4]> for Rect {\n #[inline]\n fn from(p: [f64; 4]) -> Rect {\n let (left, top, right, bottom) = (p[0], p[1], p[2], p[3]);\n Rect {\n left,\n top,\n right,\n bottom,\n }\n }\n}\n"},"prefix":{"kind":"string","value":"\n\nuse super::point::Point;\nuse super::size::Size;\nuse super::thickness::Thickness;\nuse super::vec2::Vec2;\n\nuse std::f64::{INFINITY, NEG_INFINITY};\nuse std::ops::{Add, Sub};\n\n#[derive(Copy, Clone, Debug, Default, PartialEq)]\n#[repr(C)]\npub struct Rect {\n \n pub left: f64,\n \n pub top: f64,\n \n pub right: f64,\n \n pub bottom: f64,\n}\n\n#[derive(Copy, Clone, Debug)]\npub enum RectCorner {\n \n TopLeft,\n \n TopRight,\n \n BottomLeft,\n \n BottomRight,\n}\n\nimpl Rect {\n \n pub const INFINITE: Rect = Rect {\n left: NEG_INFINITY,\n top: NEG_INFINITY,\n right: INFINITY,\n bottom: INFINITY,\n };\n\n \n #[inline]\n pub fn new(left: f64, top: f64, right: f64, bottom: f64) -> Rect {\n Rect {\n left,\n top,\n right,\n bottom,\n }\n }\n\n \n \n #[inline]\n pub fn from_points(p1: impl Into<Point>, p2: impl Into<Point>) -> Rect {\n let p1 = p1.into();\n let p2 = p2.into();\n Rect {\n left: p1.x.min(p2.x),\n top: p1.y.min(p2.y),\n right: p1.x.max(p2.x),\n bottom: p1.y.max(p2.y),\n }\n }\n\n \n \n #[inline]\n pub fn from_center_size(center: impl Into<Point>, size: impl Into<Size>) -> Rect {\n let center = center.into();\n let size = size.into();\n Rect {\n left: center.x - size.width / 2.0,\n top: center.y - size.height / 2.0,\n right: center.x + size.width / 2.0,\n bottom: center.y + size.height / 2.0,\n }\n }\n\n \n \n #[inline]\n "},"suffix":{"kind":"string","value":"\n\n \n \n #[inline]\n pub fn rounded(&self) -> Rect {\n Rect {\n left: self.left.round(),\n top: self.top.round(),\n right: self.right.round(),\n bottom: self.bottom.round(),\n }\n }\n\n \n #[inline]\n pub fn size(&self) -> Size {\n (\n self.right.max(self.left) - self.right.min(self.left),\n self.top.max(self.bottom) - self.top.min(self.bottom),\n )\n .into()\n }\n\n \n #[inline]\n pub fn center(&self) -> Point {\n Point {\n x: (self.left + self.right) / 2.0,\n y: (self.top + self.bottom) / 2.0,\n }\n }\n\n \n \n #[inline]\n pub fn half_extent(&self) -> Vec2 {\n let size = self.size();\n [size.width / 2.0, size.height / 2.0].into()\n }\n\n \n #[inline]\n pub fn corner(&self, corner: RectCorner) -> Point {\n match corner {\n RectCorner::TopLeft => (self.left, self.top).into(),\n RectCorner::TopRight => (self.right, self.top).into(),\n RectCorner::BottomLeft => (self.left, self.bottom).into(),\n RectCorner::BottomRight => (self.right, self.bottom).into(),\n }\n }\n\n \n #[inline]\n pub fn contains_point(&self, point: impl Into<Point>) -> bool {\n let point = point.into();\n point.x >= self.left\n && point.y >= self.top\n && point.x <= self.right\n && point.y <= self.bottom\n }\n\n \n #[inline]\n pub fn overlaps(&self, other: &Rect) -> bool {\n let a = self.normalized();\n let b = other.normalized();\n\n a.left < b.right && a.right > b.left && a.top < b.bottom && a.bottom > b.top\n }\n\n \n \n #[inline]\n pub fn normalized(self) -> Self {\n Rect {\n left: self.left.min(self.right),\n top: self.top.min(self.bottom),\n right: self.left.max(self.right),\n bottom: self.top.max(self.bottom),\n }\n }\n\n \n #[inline]\n pub fn translated_by(self, translation: impl Into<Vec2>) -> Self {\n let trans = translation.into();\n Rect {\n left: self.left + trans.x,\n top: self.top + trans.y,\n right: self.right + trans.x,\n bottom: self.bottom + trans.y,\n }\n }\n\n \n #[inline]\n pub fn expanded_by(self, thickness: impl Into<Thickness>) -> Self {\n let t = thickness.into();\n Rect {\n left: self.left - t.left,\n top: self.top - t.top,\n right: self.right + t.right,\n bottom: self.bottom + t.bottom,\n }\n }\n\n \n #[inline]\n pub fn shrunken_by(self, thickness: impl Into<Thickness>) -> Self {\n let t = thickness.into();\n Rect {\n left: self.left + t.left,\n top: self.top + t.top,\n right: self.right - t.right,\n bottom: self.bottom - t.bottom,\n }\n }\n\n \n \n #[inline]\n pub fn combined_with(&self, other: impl Into<Rect>) -> Self {\n let r1 = self.normalized();\n let r2 = other.into().normalized();\n\n let left = r1.left.min(r2.left);\n let top = r1.top.min(r2.top);\n let right = r1.right.max(r2.right);\n let bottom = r1.bottom.max(r2.bottom);\n\n Rect {\n left,\n top,\n right,\n bottom,\n }\n }\n}\n\nimpl Add<Vec2> for Rect {\n type Output = Rect;\n\n #[inline]\n fn add(self, rhs: Vec2) -> Rect {\n self.translated_by(rhs)\n }\n}\n\nimpl Sub<Vec2> for Rect {\n type Output = Rect;\n\n #[inline]\n fn sub(self, rhs: Vec2) -> Rect {\n self.translated_by(-rhs)\n }\n}\n\nimpl From<(Point, Point)> for Rect {\n #[inline]\n fn from((p1, p2): (Point, Point)) -> Rect {\n Rect::from_points(p1, p2)\n }\n}\n\nimpl From<(Point, Size)> for Rect {\n #[inline]\n fn from((center, size): (Point, Size)) -> Rect {\n Rect::from_center_size(center, size)\n }\n}\n\nimpl From<(Point, Vec2)> for Rect {\n #[inline]\n fn from((center, half_extent): (Point, Vec2)) -> Rect {\n Rect::from_center_half_extent(center, half_extent)\n }\n}\n\nimpl From<[f64; 4]> for Rect {\n #[inline]\n fn from(p: [f64; 4]) -> Rect {\n let (left, top, right, bottom) = (p[0], p[1], p[2], p[3]);\n Rect {\n left,\n top,\n right,\n bottom,\n }\n }\n}\n"},"middle":{"kind":"string","value":"pub fn from_center_half_extent(\n center: impl Into<Point>,\n half_extents: impl Into<Vec2>,\n ) -> Rect {\n let center = center.into();\n let half_extents = half_extents.into();\n Rect {\n left: center.x - half_extents.x,\n top: center.y - half_extents.y,\n right: center.x + half_extents.x,\n bottom: center.y + half_extents.y,\n }\n }"},"strategy":{"kind":"string","value":"function_block-full_function"},"context_items":{"kind":"list like","value":[{"content":"pub fn glWeightfvARB(size: GLint, weights: *const GLfloat) {\n\n unimplemented!();\n\n}\n\n\n","file_path":"shipico/miniquad/native/sapp-dummy/src/gl.rs","rank":0,"score":319145.9366847262},{"content":"pub fn glWeightusvARB(size: GLint, weights: *const GLushort) {\n\n unimplemented!();\n\n}\n\n\n","file_path":"shipico/miniquad/native/sapp-dummy/src/gl.rs","rank":1,"score":319145.9366847262},{"content":"pub fn glWeightdvARB(size: GLint, weights: *const GLdouble) {\n\n unimplemented!();\n\n}\n\n\n","file_path":"shipico/miniquad/native/sapp-dummy/src/gl.rs","rank":2,"score":319145.9366847262},{"content":"pub fn glWeightubvARB(size: GLint, weights: *const GLubyte) {\n\n unimplemented!();\n\n}\n\n\n","file_path":"shipico/miniquad/native/sapp-android/src/gl.rs","rank":3,"score":319145.9366847262},{"content":"pub fn glWeightbvARB(size: GLint, weights: *const GLbyte) {\n\n unimplemented!();\n\n}\n\n\n","file_path":"shipico/miniquad/native/sapp-kms/src/gl.rs","rank":4,"score":319145.9366847262},{"content":"pub fn glWeightivARB(size: GLint, weights: *const GLint) {\n\n unimplemented!();\n\n}\n\n\n","file_path":"shipico/miniquad/native/sapp-kms/src/gl.rs","rank":5,"score":319145.9366847262},{"content":"pub fn glWeightsvARB(size: GLint, weights: *const GLshort) {\n\n unimplemented!();\n\n}\n\n\n","file_path":"shipico/miniquad/native/sapp-dummy/src/gl.rs","rank":6,"score":319145.9366847262},{"content":"pub fn glWeightusvARB(size: GLint, weights: *const GLushort) {\n\n unimplemented!();\n\n}\n\n\n","file_path":"shipico/miniquad/native/sapp-android/src/gl.rs","rank":7,"score":319145.9366847262},{"content":"pub fn glWeightbvARB(size: GLint, weights: *const GLbyte) {\n\n unimplemented!();\n\n}\n\n\n","file_path":"shipico/miniquad/native/sapp-dummy/src/gl.rs","rank":8,"score":319145.9366847262},{"content":"pub fn glWeightivARB(size: GLint, weights: *const GLint) {\n\n unimplemented!();\n\n}\n\n\n","file_path":"shipico/miniquad/native/sapp-dummy/src/gl.rs","rank":9,"score":319145.9366847262},{"content":"pub fn glWeightuivARB(size: GLint, weights: *const GLuint) {\n\n unimplemented!();\n\n}\n\n\n","file_path":"shipico/miniquad/native/sapp-android/src/gl.rs","rank":10,"score":319145.9366847262},{"content":"pub fn glWeightbvARB(size: GLint, weights: *const GLbyte) {\n\n unimplemented!();\n\n}\n\n\n","file_path":"shipico/miniquad/native/sapp-android/src/gl.rs","rank":11,"score":319145.9366847262},{"content":"pub fn glWeightdvARB(size: GLint, weights: *const GLdouble) {\n\n unimplemented!();\n\n}\n\n\n","file_path":"shipico/miniquad/native/sapp-android/src/gl.rs","rank":12,"score":319145.9366847262},{"content":"pub fn glWeightuivARB(size: GLint, weights: *const GLuint) {\n\n unimplemented!();\n\n}\n\n\n","file_path":"shipico/miniquad/native/sapp-dummy/src/gl.rs","rank":13,"score":319145.9366847262},{"content":"pub fn glWeightuivARB(size: GLint, weights: *const GLuint) {\n\n unimplemented!();\n\n}\n\n\n","file_path":"shipico/miniquad/native/sapp-kms/src/gl.rs","rank":14,"score":319145.9366847262},{"content":"pub fn glWeightubvARB(size: GLint, weights: *const GLubyte) {\n\n unimplemented!();\n\n}\n\n\n","file_path":"shipico/miniquad/native/sapp-dummy/src/gl.rs","rank":15,"score":319145.9366847262},{"content":"pub fn glWeightivARB(size: GLint, weights: *const GLint) {\n\n unimplemented!();\n\n}\n\n\n","file_path":"shipico/miniquad/native/sapp-android/src/gl.rs","rank":16,"score":319145.9366847262},{"content":"pub fn glWeightfvARB(size: GLint, weights: *const GLfloat) {\n\n unimplemented!();\n\n}\n\n\n","file_path":"shipico/miniquad/native/sapp-android/src/gl.rs","rank":17,"score":319145.9366847262},{"content":"pub fn glWeightsvARB(size: GLint, weights: *const GLshort) {\n\n unimplemented!();\n\n}\n\n\n","file_path":"shipico/miniquad/native/sapp-kms/src/gl.rs","rank":18,"score":319145.9366847262},{"content":"pub fn glWeightusvARB(size: GLint, weights: *const GLushort) {\n\n unimplemented!();\n\n}\n\n\n","file_path":"shipico/miniquad/native/sapp-kms/src/gl.rs","rank":19,"score":319145.9366847262},{"content":"pub fn glWeightubvARB(size: GLint, weights: *const GLubyte) {\n\n unimplemented!();\n\n}\n\n\n","file_path":"shipico/miniquad/native/sapp-kms/src/gl.rs","rank":20,"score":319145.9366847262},{"content":"pub fn glWeightdvARB(size: GLint, weights: *const GLdouble) {\n\n unimplemented!();\n\n}\n\n\n","file_path":"shipico/miniquad/native/sapp-kms/src/gl.rs","rank":21,"score":319145.9366847262},{"content":"pub fn glWeightfvARB(size: GLint, weights: *const GLfloat) {\n\n unimplemented!();\n\n}\n\n\n","file_path":"shipico/miniquad/native/sapp-kms/src/gl.rs","rank":22,"score":319145.9366847262},{"content":"pub fn glWeightsvARB(size: GLint, weights: *const GLshort) {\n\n unimplemented!();\n\n}\n\n\n","file_path":"shipico/miniquad/native/sapp-android/src/gl.rs","rank":23,"score":319145.9366847262},{"content":"pub fn glMatrixIndexusvARB(size: GLint, indices: *const GLushort) {\n\n unimplemented!();\n\n}\n\n\n","file_path":"shipico/miniquad/native/sapp-dummy/src/gl.rs","rank":24,"score":316030.6155635694},{"content":"pub fn glMatrixIndexubvARB(size: GLint, indices: *const GLubyte) {\n\n unimplemented!();\n\n}\n\n\n","file_path":"shipico/miniquad/native/sapp-android/src/gl.rs","rank":25,"score":316030.6155635694},{"content":"pub fn glMatrixIndexuivARB(size: GLint, indices: *const GLuint) {\n\n unimplemented!();\n\n}\n\n\n","file_path":"shipico/miniquad/native/sapp-android/src/gl.rs","rank":26,"score":316030.6155635694},{"content":"pub fn glMatrixIndexusvARB(size: GLint, indices: *const GLushort) {\n\n unimplemented!();\n\n}\n\n\n","file_path":"shipico/miniquad/native/sapp-android/src/gl.rs","rank":27,"score":316030.6155635694},{"content":"pub fn glMatrixIndexubvARB(size: GLint, indices: *const GLubyte) {\n\n unimplemented!();\n\n}\n\n\n","file_path":"shipico/miniquad/native/sapp-kms/src/gl.rs","rank":28,"score":316030.6155635694},{"content":"pub fn glMatrixIndexuivARB(size: GLint, indices: *const GLuint) {\n\n unimplemented!();\n\n}\n\n\n","file_path":"shipico/miniquad/native/sapp-kms/src/gl.rs","rank":29,"score":316030.6155635694},{"content":"pub fn glMatrixIndexuivARB(size: GLint, indices: *const GLuint) {\n\n unimplemented!();\n\n}\n\n\n","file_path":"shipico/miniquad/native/sapp-dummy/src/gl.rs","rank":30,"score":316030.6155635694},{"content":"pub fn glMatrixIndexubvARB(size: GLint, indices: *const GLubyte) {\n\n unimplemented!();\n\n}\n\n\n","file_path":"shipico/miniquad/native/sapp-dummy/src/gl.rs","rank":31,"score":316030.6155635694},{"content":"pub fn glMatrixIndexusvARB(size: GLint, indices: *const GLushort) {\n\n unimplemented!();\n\n}\n\n\n","file_path":"shipico/miniquad/native/sapp-kms/src/gl.rs","rank":32,"score":316030.6155635694},{"content":"pub fn glPixelMapx(map: GLenum, size: GLint, values: *const GLfixed) {\n\n unimplemented!();\n\n}\n\n\n","file_path":"shipico/miniquad/native/sapp-android/src/gl.rs","rank":33,"score":296295.4220820715},{"content":"pub fn glPixelMapx(map: GLenum, size: GLint, values: *const GLfixed) {\n\n unimplemented!();\n\n}\n\n\n","file_path":"shipico/miniquad/native/sapp-kms/src/gl.rs","rank":34,"score":296295.4220820715},{"content":"pub fn glPixelMapx(map: GLenum, size: GLint, values: *const GLfixed) {\n\n unimplemented!();\n\n}\n\n\n","file_path":"shipico/miniquad/native/sapp-dummy/src/gl.rs","rank":35,"score":296295.4220820715},{"content":"pub fn glPointSize(size: GLfloat) {\n\n unimplemented!();\n\n}\n\n\n","file_path":"shipico/miniquad/native/sapp-dummy/src/gl.rs","rank":36,"score":279601.14918174327},{"content":"pub fn glPointSize(size: GLfloat) {\n\n unimplemented!();\n\n}\n\n\n","file_path":"shipico/miniquad/native/sapp-kms/src/gl.rs","rank":37,"score":279601.14918174327},{"content":"pub fn glPointSize(size: GLfloat) {\n\n unimplemented!();\n\n}\n\n\n","file_path":"shipico/miniquad/native/sapp-android/src/gl.rs","rank":38,"score":279601.14918174327},{"content":"pub fn glVertexPointer(size: GLint, type_: GLenum, stride: GLsizei, ptr: *const GLvoid) {\n\n unimplemented!();\n\n}\n\n\n","file_path":"shipico/miniquad/native/sapp-android/src/gl.rs","rank":39,"score":276886.40205057367},{"content":"pub fn glColorPointer(size: GLint, type_: GLenum, stride: GLsizei, ptr: *const GLvoid) {\n\n unimplemented!();\n\n}\n\n\n","file_path":"shipico/miniquad/native/sapp-dummy/src/gl.rs","rank":40,"score":276886.40205057367},{"content":"pub fn glVertexPointer(size: GLint, type_: GLenum, stride: GLsizei, ptr: *const GLvoid) {\n\n unimplemented!();\n\n}\n\n\n","file_path":"shipico/miniquad/native/sapp-kms/src/gl.rs","rank":41,"score":276886.40205057367},{"content":"pub fn glVertexPointer(size: GLint, type_: GLenum, stride: GLsizei, ptr: *const GLvoid) {\n\n unimplemented!();\n\n}\n\n\n","file_path":"shipico/miniquad/native/sapp-dummy/src/gl.rs","rank":42,"score":276886.40205057367},{"content":"pub fn glColorPointer(size: GLint, type_: GLenum, stride: GLsizei, ptr: *const GLvoid) {\n\n unimplemented!();\n\n}\n\n\n","file_path":"shipico/miniquad/native/sapp-kms/src/gl.rs","rank":43,"score":276886.40205057367},{"content":"pub fn glColorPointer(size: GLint, type_: GLenum, stride: GLsizei, ptr: *const GLvoid) {\n\n unimplemented!();\n\n}\n\n\n","file_path":"shipico/miniquad/native/sapp-android/src/gl.rs","rank":44,"score":276886.40205057367},{"content":"pub fn glTexCoordPointer(size: GLint, type_: GLenum, stride: GLsizei, ptr: *const GLvoid) {\n\n unimplemented!();\n\n}\n\n\n","file_path":"shipico/miniquad/native/sapp-dummy/src/gl.rs","rank":45,"score":274316.4534432518},{"content":"pub fn glTexCoordPointer(size: GLint, type_: GLenum, stride: GLsizei, ptr: *const GLvoid) {\n\n unimplemented!();\n\n}\n\n\n","file_path":"shipico/miniquad/native/sapp-kms/src/gl.rs","rank":46,"score":274316.4534432518},{"content":"pub fn glTexCoordPointer(size: GLint, type_: GLenum, stride: GLsizei, ptr: *const GLvoid) {\n\n unimplemented!();\n\n}\n\n\n","file_path":"shipico/miniquad/native/sapp-android/src/gl.rs","rank":47,"score":274316.4534432518},{"content":"pub fn glPointSizexOES(size: GLfixed) {\n\n unimplemented!();\n\n}\n\n\n","file_path":"shipico/miniquad/native/sapp-dummy/src/gl.rs","rank":48,"score":261468.2891872702},{"content":"pub fn glPointSizexOES(size: GLfixed) {\n\n unimplemented!();\n\n}\n\n\n","file_path":"shipico/miniquad/native/sapp-kms/src/gl.rs","rank":49,"score":261468.28918727016},{"content":"pub fn glPointSizexOES(size: GLfixed) {\n\n unimplemented!();\n\n}\n\n\n","file_path":"shipico/miniquad/native/sapp-android/src/gl.rs","rank":50,"score":261468.28918727016},{"content":"pub fn glDebugMessageCallback(callback: GLDEBUGPROC, userParam: *const ::std::os::raw::c_void) {\n\n unimplemented!();\n\n}\n\n\n","file_path":"shipico/miniquad/native/sapp-dummy/src/gl.rs","rank":51,"score":258178.24497591075},{"content":"pub fn glDebugMessageCallback(callback: GLDEBUGPROC, userParam: *const ::std::os::raw::c_void) {\n\n unimplemented!();\n\n}\n\n\n","file_path":"shipico/miniquad/native/sapp-android/src/gl.rs","rank":52,"score":258178.24497591075},{"content":"pub fn glDebugMessageCallback(callback: GLDEBUGPROC, userParam: *const ::std::os::raw::c_void) {\n\n unimplemented!();\n\n}\n\n\n","file_path":"shipico/miniquad/native/sapp-kms/src/gl.rs","rank":53,"score":258178.24497591075},{"content":"pub fn glColor3fVertex3fvSUN(c: *const GLfloat, v: *const GLfloat) {\n\n unimplemented!();\n\n}\n\n\n","file_path":"shipico/miniquad/native/sapp-android/src/gl.rs","rank":54,"score":258175.96686115547},{"content":"pub fn glColor4ubVertex3fvSUN(c: *const GLubyte, v: *const GLfloat) {\n\n unimplemented!();\n\n}\n\n\n","file_path":"shipico/miniquad/native/sapp-android/src/gl.rs","rank":55,"score":258175.96686115547},{"content":"pub fn glRectfv(v1: *const GLfloat, v2: *const GLfloat) {\n\n unimplemented!();\n\n}\n\n\n","file_path":"shipico/miniquad/native/sapp-android/src/gl.rs","rank":56,"score":258175.96686115547},{"content":"pub fn glRectfv(v1: *const GLfloat, v2: *const GLfloat) {\n\n unimplemented!();\n\n}\n\n\n","file_path":"shipico/miniquad/native/sapp-kms/src/gl.rs","rank":57,"score":258175.96686115547},{"content":"pub fn glColor4ubVertex3fvSUN(c: *const GLubyte, v: *const GLfloat) {\n\n unimplemented!();\n\n}\n\n\n","file_path":"shipico/miniquad/native/sapp-dummy/src/gl.rs","rank":58,"score":258175.96686115547},{"content":"pub fn glRectsv(v1: *const GLshort, v2: *const GLshort) {\n\n unimplemented!();\n\n}\n\n\n","file_path":"shipico/miniquad/native/sapp-android/src/gl.rs","rank":59,"score":258175.96686115547},{"content":"pub fn glRectdv(v1: *const GLdouble, v2: *const GLdouble) {\n\n unimplemented!();\n\n}\n\n\n","file_path":"shipico/miniquad/native/sapp-kms/src/gl.rs","rank":60,"score":258175.96686115547},{"content":"pub fn glColor4ubVertex2fvSUN(c: *const GLubyte, v: *const GLfloat) {\n\n unimplemented!();\n\n}\n\n\n","file_path":"shipico/miniquad/native/sapp-android/src/gl.rs","rank":61,"score":258175.96686115547},{"content":"pub fn glRectiv(v1: *const GLint, v2: *const GLint) {\n\n unimplemented!();\n\n}\n\n\n","file_path":"shipico/miniquad/native/sapp-android/src/gl.rs","rank":62,"score":258175.96686115547},{"content":"pub fn glRectfv(v1: *const GLfloat, v2: *const GLfloat) {\n\n unimplemented!();\n\n}\n\n\n","file_path":"shipico/miniquad/native/sapp-dummy/src/gl.rs","rank":63,"score":258175.96686115547},{"content":"pub fn glRectdv(v1: *const GLdouble, v2: *const GLdouble) {\n\n unimplemented!();\n\n}\n\n\n","file_path":"shipico/miniquad/native/sapp-android/src/gl.rs","rank":64,"score":258175.96686115547},{"content":"pub fn glRectdv(v1: *const GLdouble, v2: *const GLdouble) {\n\n unimplemented!();\n\n}\n\n\n","file_path":"shipico/miniquad/native/sapp-dummy/src/gl.rs","rank":65,"score":258175.96686115547},{"content":"pub fn glColor4ubVertex3fvSUN(c: *const GLubyte, v: *const GLfloat) {\n\n unimplemented!();\n\n}\n\n\n","file_path":"shipico/miniquad/native/sapp-kms/src/gl.rs","rank":66,"score":258175.96686115547},{"content":"pub fn glColor3fVertex3fvSUN(c: *const GLfloat, v: *const GLfloat) {\n\n unimplemented!();\n\n}\n\n\n","file_path":"shipico/miniquad/native/sapp-kms/src/gl.rs","rank":67,"score":258175.96686115547},{"content":"pub fn glRectiv(v1: *const GLint, v2: *const GLint) {\n\n unimplemented!();\n\n}\n\n\n","file_path":"shipico/miniquad/native/sapp-dummy/src/gl.rs","rank":68,"score":258175.96686115547},{"content":"pub fn glNormal3fVertex3fvSUN(n: *const GLfloat, v: *const GLfloat) {\n\n unimplemented!();\n\n}\n\n\n","file_path":"shipico/miniquad/native/sapp-kms/src/gl.rs","rank":69,"score":258175.96686115547},{"content":"pub fn glNormal3fVertex3fvSUN(n: *const GLfloat, v: *const GLfloat) {\n\n unimplemented!();\n\n}\n\n\n","file_path":"shipico/miniquad/native/sapp-dummy/src/gl.rs","rank":70,"score":258175.96686115547},{"content":"pub fn glColor3fVertex3fvSUN(c: *const GLfloat, v: *const GLfloat) {\n\n unimplemented!();\n\n}\n\n\n","file_path":"shipico/miniquad/native/sapp-dummy/src/gl.rs","rank":71,"score":258175.96686115547},{"content":"pub fn glColor4ubVertex2fvSUN(c: *const GLubyte, v: *const GLfloat) {\n\n unimplemented!();\n\n}\n\n\n","file_path":"shipico/miniquad/native/sapp-dummy/src/gl.rs","rank":72,"score":258175.96686115547},{"content":"pub fn glRectiv(v1: *const GLint, v2: *const GLint) {\n\n unimplemented!();\n\n}\n\n\n","file_path":"shipico/miniquad/native/sapp-kms/src/gl.rs","rank":73,"score":258175.96686115547},{"content":"pub fn glRectsv(v1: *const GLshort, v2: *const GLshort) {\n\n unimplemented!();\n\n}\n\n\n","file_path":"shipico/miniquad/native/sapp-dummy/src/gl.rs","rank":74,"score":258175.96686115547},{"content":"pub fn glNormal3fVertex3fvSUN(n: *const GLfloat, v: *const GLfloat) {\n\n unimplemented!();\n\n}\n\n\n","file_path":"shipico/miniquad/native/sapp-android/src/gl.rs","rank":75,"score":258175.96686115547},{"content":"pub fn glColor4ubVertex2fvSUN(c: *const GLubyte, v: *const GLfloat) {\n\n unimplemented!();\n\n}\n\n\n","file_path":"shipico/miniquad/native/sapp-kms/src/gl.rs","rank":76,"score":258175.96686115547},{"content":"pub fn glRectsv(v1: *const GLshort, v2: *const GLshort) {\n\n unimplemented!();\n\n}\n\n\n","file_path":"shipico/miniquad/native/sapp-kms/src/gl.rs","rank":77,"score":258175.96686115547},{"content":"pub fn glVertex3iv(v: *const GLint) {\n\n unimplemented!();\n\n}\n\n\n","file_path":"shipico/miniquad/native/sapp-android/src/gl.rs","rank":78,"score":257451.66424510535},{"content":"pub fn glVertex4dv(v: *const GLdouble) {\n\n unimplemented!();\n\n}\n\n\n","file_path":"shipico/miniquad/native/sapp-android/src/gl.rs","rank":79,"score":257451.66424510535},{"content":"pub fn glIndexdv(c: *const GLdouble) {\n\n unimplemented!();\n\n}\n\n\n","file_path":"shipico/miniquad/native/sapp-android/src/gl.rs","rank":80,"score":257451.66424510535},{"content":"pub fn glIndexfv(c: *const GLfloat) {\n\n unimplemented!();\n\n}\n\n\n","file_path":"shipico/miniquad/native/sapp-android/src/gl.rs","rank":81,"score":257451.66424510535},{"content":"pub fn glVertex4sv(v: *const GLshort) {\n\n unimplemented!();\n\n}\n\n\n","file_path":"shipico/miniquad/native/sapp-android/src/gl.rs","rank":82,"score":257451.66424510535},{"content":"pub fn glVertex3dv(v: *const GLdouble) {\n\n unimplemented!();\n\n}\n\n\n","file_path":"shipico/miniquad/native/sapp-android/src/gl.rs","rank":83,"score":257451.66424510535},{"content":"pub fn glNormal3bv(v: *const GLbyte) {\n\n unimplemented!();\n\n}\n\n\n","file_path":"shipico/miniquad/native/sapp-android/src/gl.rs","rank":84,"score":257451.66424510535},{"content":"pub fn glVertex2dv(v: *const GLdouble) {\n\n unimplemented!();\n\n}\n\n\n","file_path":"shipico/miniquad/native/sapp-android/src/gl.rs","rank":85,"score":257451.66424510535},{"content":"pub fn glIndexsv(c: *const GLshort) {\n\n unimplemented!();\n\n}\n\n\n","file_path":"shipico/miniquad/native/sapp-android/src/gl.rs","rank":86,"score":257451.66424510535},{"content":"pub fn glNormal3iv(v: *const GLint) {\n\n unimplemented!();\n\n}\n\n\n","file_path":"shipico/miniquad/native/sapp-android/src/gl.rs","rank":87,"score":257451.66424510535},{"content":"pub fn glVertex3fv(v: *const GLfloat) {\n\n unimplemented!();\n\n}\n\n\n","file_path":"shipico/miniquad/native/sapp-android/src/gl.rs","rank":88,"score":257451.66424510535},{"content":"pub fn glVertex2sv(v: *const GLshort) {\n\n unimplemented!();\n\n}\n\n\n","file_path":"shipico/miniquad/native/sapp-android/src/gl.rs","rank":89,"score":257451.66424510535},{"content":"pub fn glVertex2iv(v: *const GLint) {\n\n unimplemented!();\n\n}\n\n\n","file_path":"shipico/miniquad/native/sapp-android/src/gl.rs","rank":90,"score":257451.66424510535},{"content":"pub fn glVertex4iv(v: *const GLint) {\n\n unimplemented!();\n\n}\n\n\n","file_path":"shipico/miniquad/native/sapp-android/src/gl.rs","rank":91,"score":257451.66424510535},{"content":"pub fn glVertex3sv(v: *const GLshort) {\n\n unimplemented!();\n\n}\n\n\n","file_path":"shipico/miniquad/native/sapp-android/src/gl.rs","rank":92,"score":257451.66424510535},{"content":"pub fn glVertex4fv(v: *const GLfloat) {\n\n unimplemented!();\n\n}\n\n\n","file_path":"shipico/miniquad/native/sapp-android/src/gl.rs","rank":93,"score":257451.66424510535},{"content":"pub fn glVertex2fv(v: *const GLfloat) {\n\n unimplemented!();\n\n}\n\n\n","file_path":"shipico/miniquad/native/sapp-android/src/gl.rs","rank":94,"score":257451.66424510535},{"content":"pub fn glNormal3dv(v: *const GLdouble) {\n\n unimplemented!();\n\n}\n\n\n","file_path":"shipico/miniquad/native/sapp-android/src/gl.rs","rank":95,"score":257451.66424510535},{"content":"pub fn glNormal3sv(v: *const GLshort) {\n\n unimplemented!();\n\n}\n\n\n","file_path":"shipico/miniquad/native/sapp-android/src/gl.rs","rank":96,"score":257451.66424510535},{"content":"pub fn glIndexiv(c: *const GLint) {\n\n unimplemented!();\n\n}\n\n\n","file_path":"shipico/miniquad/native/sapp-android/src/gl.rs","rank":97,"score":257451.66424510535},{"content":"pub fn glNormal3fv(v: *const GLfloat) {\n\n unimplemented!();\n\n}\n\n\n","file_path":"shipico/miniquad/native/sapp-android/src/gl.rs","rank":98,"score":257451.66424510535},{"content":"pub fn glIndexubv(c: *const GLubyte) {\n\n unimplemented!();\n\n}\n\n\n","file_path":"shipico/miniquad/native/sapp-android/src/gl.rs","rank":99,"score":257451.66424510535}],"string":"[\n {\n \"content\": \"pub fn glWeightfvARB(size: GLint, weights: *const GLfloat) {\\n\\n unimplemented!();\\n\\n}\\n\\n\\n\",\n \"file_path\": \"shipico/miniquad/native/sapp-dummy/src/gl.rs\",\n \"rank\": 0,\n \"score\": 319145.9366847262\n },\n {\n \"content\": \"pub fn glWeightusvARB(size: GLint, weights: *const GLushort) {\\n\\n unimplemented!();\\n\\n}\\n\\n\\n\",\n \"file_path\": \"shipico/miniquad/native/sapp-dummy/src/gl.rs\",\n \"rank\": 1,\n \"score\": 319145.9366847262\n },\n {\n \"content\": \"pub fn glWeightdvARB(size: GLint, weights: *const GLdouble) {\\n\\n unimplemented!();\\n\\n}\\n\\n\\n\",\n \"file_path\": \"shipico/miniquad/native/sapp-dummy/src/gl.rs\",\n \"rank\": 2,\n \"score\": 319145.9366847262\n },\n {\n \"content\": \"pub fn glWeightubvARB(size: GLint, weights: *const GLubyte) {\\n\\n unimplemented!();\\n\\n}\\n\\n\\n\",\n \"file_path\": \"shipico/miniquad/native/sapp-android/src/gl.rs\",\n \"rank\": 3,\n \"score\": 319145.9366847262\n },\n {\n \"content\": \"pub fn glWeightbvARB(size: GLint, weights: *const GLbyte) {\\n\\n unimplemented!();\\n\\n}\\n\\n\\n\",\n \"file_path\": \"shipico/miniquad/native/sapp-kms/src/gl.rs\",\n \"rank\": 4,\n \"score\": 319145.9366847262\n },\n {\n \"content\": \"pub fn glWeightivARB(size: GLint, weights: *const GLint) {\\n\\n unimplemented!();\\n\\n}\\n\\n\\n\",\n \"file_path\": \"shipico/miniquad/native/sapp-kms/src/gl.rs\",\n \"rank\": 5,\n \"score\": 319145.9366847262\n },\n {\n \"content\": \"pub fn glWeightsvARB(size: GLint, weights: *const GLshort) {\\n\\n unimplemented!();\\n\\n}\\n\\n\\n\",\n \"file_path\": \"shipico/miniquad/native/sapp-dummy/src/gl.rs\",\n \"rank\": 6,\n \"score\": 319145.9366847262\n },\n {\n \"content\": \"pub fn glWeightusvARB(size: GLint, weights: *const GLushort) {\\n\\n unimplemented!();\\n\\n}\\n\\n\\n\",\n \"file_path\": \"shipico/miniquad/native/sapp-android/src/gl.rs\",\n \"rank\": 7,\n \"score\": 319145.9366847262\n },\n {\n \"content\": \"pub fn glWeightbvARB(size: GLint, weights: *const GLbyte) {\\n\\n unimplemented!();\\n\\n}\\n\\n\\n\",\n \"file_path\": \"shipico/miniquad/native/sapp-dummy/src/gl.rs\",\n \"rank\": 8,\n \"score\": 319145.9366847262\n },\n {\n \"content\": \"pub fn glWeightivARB(size: GLint, weights: *const GLint) {\\n\\n unimplemented!();\\n\\n}\\n\\n\\n\",\n \"file_path\": \"shipico/miniquad/native/sapp-dummy/src/gl.rs\",\n \"rank\": 9,\n \"score\": 319145.9366847262\n },\n {\n \"content\": \"pub fn glWeightuivARB(size: GLint, weights: *const GLuint) {\\n\\n unimplemented!();\\n\\n}\\n\\n\\n\",\n \"file_path\": \"shipico/miniquad/native/sapp-android/src/gl.rs\",\n \"rank\": 10,\n \"score\": 319145.9366847262\n },\n {\n \"content\": \"pub fn glWeightbvARB(size: GLint, weights: *const GLbyte) {\\n\\n unimplemented!();\\n\\n}\\n\\n\\n\",\n \"file_path\": \"shipico/miniquad/native/sapp-android/src/gl.rs\",\n \"rank\": 11,\n \"score\": 319145.9366847262\n },\n {\n \"content\": \"pub fn glWeightdvARB(size: GLint, weights: *const GLdouble) {\\n\\n unimplemented!();\\n\\n}\\n\\n\\n\",\n \"file_path\": \"shipico/miniquad/native/sapp-android/src/gl.rs\",\n \"rank\": 12,\n \"score\": 319145.9366847262\n },\n {\n \"content\": \"pub fn glWeightuivARB(size: GLint, weights: *const GLuint) {\\n\\n unimplemented!();\\n\\n}\\n\\n\\n\",\n \"file_path\": \"shipico/miniquad/native/sapp-dummy/src/gl.rs\",\n \"rank\": 13,\n \"score\": 319145.9366847262\n },\n {\n \"content\": \"pub fn glWeightuivARB(size: GLint, weights: *const GLuint) {\\n\\n unimplemented!();\\n\\n}\\n\\n\\n\",\n \"file_path\": \"shipico/miniquad/native/sapp-kms/src/gl.rs\",\n \"rank\": 14,\n \"score\": 319145.9366847262\n },\n {\n \"content\": \"pub fn glWeightubvARB(size: GLint, weights: *const GLubyte) {\\n\\n unimplemented!();\\n\\n}\\n\\n\\n\",\n \"file_path\": \"shipico/miniquad/native/sapp-dummy/src/gl.rs\",\n \"rank\": 15,\n \"score\": 319145.9366847262\n },\n {\n \"content\": \"pub fn glWeightivARB(size: GLint, weights: *const GLint) {\\n\\n unimplemented!();\\n\\n}\\n\\n\\n\",\n \"file_path\": \"shipico/miniquad/native/sapp-android/src/gl.rs\",\n \"rank\": 16,\n \"score\": 319145.9366847262\n },\n {\n \"content\": \"pub fn glWeightfvARB(size: GLint, weights: *const GLfloat) {\\n\\n unimplemented!();\\n\\n}\\n\\n\\n\",\n \"file_path\": \"shipico/miniquad/native/sapp-android/src/gl.rs\",\n \"rank\": 17,\n \"score\": 319145.9366847262\n },\n {\n \"content\": \"pub fn glWeightsvARB(size: GLint, weights: *const GLshort) {\\n\\n unimplemented!();\\n\\n}\\n\\n\\n\",\n \"file_path\": \"shipico/miniquad/native/sapp-kms/src/gl.rs\",\n \"rank\": 18,\n \"score\": 319145.9366847262\n },\n {\n \"content\": \"pub fn glWeightusvARB(size: GLint, weights: *const GLushort) {\\n\\n unimplemented!();\\n\\n}\\n\\n\\n\",\n \"file_path\": \"shipico/miniquad/native/sapp-kms/src/gl.rs\",\n \"rank\": 19,\n \"score\": 319145.9366847262\n },\n {\n \"content\": \"pub fn glWeightubvARB(size: GLint, weights: *const GLubyte) {\\n\\n unimplemented!();\\n\\n}\\n\\n\\n\",\n \"file_path\": \"shipico/miniquad/native/sapp-kms/src/gl.rs\",\n \"rank\": 20,\n \"score\": 319145.9366847262\n },\n {\n \"content\": \"pub fn glWeightdvARB(size: GLint, weights: *const GLdouble) {\\n\\n unimplemented!();\\n\\n}\\n\\n\\n\",\n \"file_path\": \"shipico/miniquad/native/sapp-kms/src/gl.rs\",\n \"rank\": 21,\n \"score\": 319145.9366847262\n },\n {\n \"content\": \"pub fn glWeightfvARB(size: GLint, weights: *const GLfloat) {\\n\\n unimplemented!();\\n\\n}\\n\\n\\n\",\n \"file_path\": \"shipico/miniquad/native/sapp-kms/src/gl.rs\",\n \"rank\": 22,\n \"score\": 319145.9366847262\n },\n {\n \"content\": \"pub fn glWeightsvARB(size: GLint, weights: *const GLshort) {\\n\\n unimplemented!();\\n\\n}\\n\\n\\n\",\n \"file_path\": \"shipico/miniquad/native/sapp-android/src/gl.rs\",\n \"rank\": 23,\n \"score\": 319145.9366847262\n },\n {\n \"content\": \"pub fn glMatrixIndexusvARB(size: GLint, indices: *const GLushort) {\\n\\n unimplemented!();\\n\\n}\\n\\n\\n\",\n \"file_path\": \"shipico/miniquad/native/sapp-dummy/src/gl.rs\",\n \"rank\": 24,\n \"score\": 316030.6155635694\n },\n {\n \"content\": \"pub fn glMatrixIndexubvARB(size: GLint, indices: *const GLubyte) {\\n\\n unimplemented!();\\n\\n}\\n\\n\\n\",\n \"file_path\": \"shipico/miniquad/native/sapp-android/src/gl.rs\",\n \"rank\": 25,\n \"score\": 316030.6155635694\n },\n {\n \"content\": \"pub fn glMatrixIndexuivARB(size: GLint, indices: *const GLuint) {\\n\\n unimplemented!();\\n\\n}\\n\\n\\n\",\n \"file_path\": \"shipico/miniquad/native/sapp-android/src/gl.rs\",\n \"rank\": 26,\n \"score\": 316030.6155635694\n },\n {\n \"content\": \"pub fn glMatrixIndexusvARB(size: GLint, indices: *const GLushort) {\\n\\n unimplemented!();\\n\\n}\\n\\n\\n\",\n \"file_path\": \"shipico/miniquad/native/sapp-android/src/gl.rs\",\n \"rank\": 27,\n \"score\": 316030.6155635694\n },\n {\n \"content\": \"pub fn glMatrixIndexubvARB(size: GLint, indices: *const GLubyte) {\\n\\n unimplemented!();\\n\\n}\\n\\n\\n\",\n \"file_path\": \"shipico/miniquad/native/sapp-kms/src/gl.rs\",\n \"rank\": 28,\n \"score\": 316030.6155635694\n },\n {\n \"content\": \"pub fn glMatrixIndexuivARB(size: GLint, indices: *const GLuint) {\\n\\n unimplemented!();\\n\\n}\\n\\n\\n\",\n \"file_path\": \"shipico/miniquad/native/sapp-kms/src/gl.rs\",\n \"rank\": 29,\n \"score\": 316030.6155635694\n },\n {\n \"content\": \"pub fn glMatrixIndexuivARB(size: GLint, indices: *const GLuint) {\\n\\n unimplemented!();\\n\\n}\\n\\n\\n\",\n \"file_path\": \"shipico/miniquad/native/sapp-dummy/src/gl.rs\",\n \"rank\": 30,\n \"score\": 316030.6155635694\n },\n {\n \"content\": \"pub fn glMatrixIndexubvARB(size: GLint, indices: *const GLubyte) {\\n\\n unimplemented!();\\n\\n}\\n\\n\\n\",\n \"file_path\": \"shipico/miniquad/native/sapp-dummy/src/gl.rs\",\n \"rank\": 31,\n \"score\": 316030.6155635694\n },\n {\n \"content\": \"pub fn glMatrixIndexusvARB(size: GLint, indices: *const GLushort) {\\n\\n unimplemented!();\\n\\n}\\n\\n\\n\",\n \"file_path\": \"shipico/miniquad/native/sapp-kms/src/gl.rs\",\n \"rank\": 32,\n \"score\": 316030.6155635694\n },\n {\n \"content\": \"pub fn glPixelMapx(map: GLenum, size: GLint, values: *const GLfixed) {\\n\\n unimplemented!();\\n\\n}\\n\\n\\n\",\n \"file_path\": \"shipico/miniquad/native/sapp-android/src/gl.rs\",\n \"rank\": 33,\n \"score\": 296295.4220820715\n },\n {\n \"content\": \"pub fn glPixelMapx(map: GLenum, size: GLint, values: *const GLfixed) {\\n\\n unimplemented!();\\n\\n}\\n\\n\\n\",\n \"file_path\": \"shipico/miniquad/native/sapp-kms/src/gl.rs\",\n \"rank\": 34,\n \"score\": 296295.4220820715\n },\n {\n \"content\": \"pub fn glPixelMapx(map: GLenum, size: GLint, values: *const GLfixed) {\\n\\n unimplemented!();\\n\\n}\\n\\n\\n\",\n \"file_path\": \"shipico/miniquad/native/sapp-dummy/src/gl.rs\",\n \"rank\": 35,\n \"score\": 296295.4220820715\n },\n {\n \"content\": \"pub fn glPointSize(size: GLfloat) {\\n\\n unimplemented!();\\n\\n}\\n\\n\\n\",\n \"file_path\": \"shipico/miniquad/native/sapp-dummy/src/gl.rs\",\n \"rank\": 36,\n \"score\": 279601.14918174327\n },\n {\n \"content\": \"pub fn glPointSize(size: GLfloat) {\\n\\n unimplemented!();\\n\\n}\\n\\n\\n\",\n \"file_path\": \"shipico/miniquad/native/sapp-kms/src/gl.rs\",\n \"rank\": 37,\n \"score\": 279601.14918174327\n },\n {\n \"content\": \"pub fn glPointSize(size: GLfloat) {\\n\\n unimplemented!();\\n\\n}\\n\\n\\n\",\n \"file_path\": \"shipico/miniquad/native/sapp-android/src/gl.rs\",\n \"rank\": 38,\n \"score\": 279601.14918174327\n },\n {\n \"content\": \"pub fn glVertexPointer(size: GLint, type_: GLenum, stride: GLsizei, ptr: *const GLvoid) {\\n\\n unimplemented!();\\n\\n}\\n\\n\\n\",\n \"file_path\": \"shipico/miniquad/native/sapp-android/src/gl.rs\",\n \"rank\": 39,\n \"score\": 276886.40205057367\n },\n {\n \"content\": \"pub fn glColorPointer(size: GLint, type_: GLenum, stride: GLsizei, ptr: *const GLvoid) {\\n\\n unimplemented!();\\n\\n}\\n\\n\\n\",\n \"file_path\": \"shipico/miniquad/native/sapp-dummy/src/gl.rs\",\n \"rank\": 40,\n \"score\": 276886.40205057367\n },\n {\n \"content\": \"pub fn glVertexPointer(size: GLint, type_: GLenum, stride: GLsizei, ptr: *const GLvoid) {\\n\\n unimplemented!();\\n\\n}\\n\\n\\n\",\n \"file_path\": \"shipico/miniquad/native/sapp-kms/src/gl.rs\",\n \"rank\": 41,\n \"score\": 276886.40205057367\n },\n {\n \"content\": \"pub fn glVertexPointer(size: GLint, type_: GLenum, stride: GLsizei, ptr: *const GLvoid) {\\n\\n unimplemented!();\\n\\n}\\n\\n\\n\",\n \"file_path\": \"shipico/miniquad/native/sapp-dummy/src/gl.rs\",\n \"rank\": 42,\n \"score\": 276886.40205057367\n },\n {\n \"content\": \"pub fn glColorPointer(size: GLint, type_: GLenum, stride: GLsizei, ptr: *const GLvoid) {\\n\\n unimplemented!();\\n\\n}\\n\\n\\n\",\n \"file_path\": \"shipico/miniquad/native/sapp-kms/src/gl.rs\",\n \"rank\": 43,\n \"score\": 276886.40205057367\n },\n {\n \"content\": \"pub fn glColorPointer(size: GLint, type_: GLenum, stride: GLsizei, ptr: *const GLvoid) {\\n\\n unimplemented!();\\n\\n}\\n\\n\\n\",\n \"file_path\": \"shipico/miniquad/native/sapp-android/src/gl.rs\",\n \"rank\": 44,\n \"score\": 276886.40205057367\n },\n {\n \"content\": \"pub fn glTexCoordPointer(size: GLint, type_: GLenum, stride: GLsizei, ptr: *const GLvoid) {\\n\\n unimplemented!();\\n\\n}\\n\\n\\n\",\n \"file_path\": \"shipico/miniquad/native/sapp-dummy/src/gl.rs\",\n \"rank\": 45,\n \"score\": 274316.4534432518\n },\n {\n \"content\": \"pub fn glTexCoordPointer(size: GLint, type_: GLenum, stride: GLsizei, ptr: *const GLvoid) {\\n\\n unimplemented!();\\n\\n}\\n\\n\\n\",\n \"file_path\": \"shipico/miniquad/native/sapp-kms/src/gl.rs\",\n \"rank\": 46,\n \"score\": 274316.4534432518\n },\n {\n \"content\": \"pub fn glTexCoordPointer(size: GLint, type_: GLenum, stride: GLsizei, ptr: *const GLvoid) {\\n\\n unimplemented!();\\n\\n}\\n\\n\\n\",\n \"file_path\": \"shipico/miniquad/native/sapp-android/src/gl.rs\",\n \"rank\": 47,\n \"score\": 274316.4534432518\n },\n {\n \"content\": \"pub fn glPointSizexOES(size: GLfixed) {\\n\\n unimplemented!();\\n\\n}\\n\\n\\n\",\n \"file_path\": \"shipico/miniquad/native/sapp-dummy/src/gl.rs\",\n \"rank\": 48,\n \"score\": 261468.2891872702\n },\n {\n \"content\": \"pub fn glPointSizexOES(size: GLfixed) {\\n\\n unimplemented!();\\n\\n}\\n\\n\\n\",\n \"file_path\": \"shipico/miniquad/native/sapp-kms/src/gl.rs\",\n \"rank\": 49,\n \"score\": 261468.28918727016\n },\n {\n \"content\": \"pub fn glPointSizexOES(size: GLfixed) {\\n\\n unimplemented!();\\n\\n}\\n\\n\\n\",\n \"file_path\": \"shipico/miniquad/native/sapp-android/src/gl.rs\",\n \"rank\": 50,\n \"score\": 261468.28918727016\n },\n {\n \"content\": \"pub fn glDebugMessageCallback(callback: GLDEBUGPROC, userParam: *const ::std::os::raw::c_void) {\\n\\n unimplemented!();\\n\\n}\\n\\n\\n\",\n \"file_path\": \"shipico/miniquad/native/sapp-dummy/src/gl.rs\",\n \"rank\": 51,\n \"score\": 258178.24497591075\n },\n {\n \"content\": \"pub fn glDebugMessageCallback(callback: GLDEBUGPROC, userParam: *const ::std::os::raw::c_void) {\\n\\n unimplemented!();\\n\\n}\\n\\n\\n\",\n \"file_path\": \"shipico/miniquad/native/sapp-android/src/gl.rs\",\n \"rank\": 52,\n \"score\": 258178.24497591075\n },\n {\n \"content\": \"pub fn glDebugMessageCallback(callback: GLDEBUGPROC, userParam: *const ::std::os::raw::c_void) {\\n\\n unimplemented!();\\n\\n}\\n\\n\\n\",\n \"file_path\": \"shipico/miniquad/native/sapp-kms/src/gl.rs\",\n \"rank\": 53,\n \"score\": 258178.24497591075\n },\n {\n \"content\": \"pub fn glColor3fVertex3fvSUN(c: *const GLfloat, v: *const GLfloat) {\\n\\n unimplemented!();\\n\\n}\\n\\n\\n\",\n \"file_path\": \"shipico/miniquad/native/sapp-android/src/gl.rs\",\n \"rank\": 54,\n \"score\": 258175.96686115547\n },\n {\n \"content\": \"pub fn glColor4ubVertex3fvSUN(c: *const GLubyte, v: *const GLfloat) {\\n\\n unimplemented!();\\n\\n}\\n\\n\\n\",\n \"file_path\": \"shipico/miniquad/native/sapp-android/src/gl.rs\",\n \"rank\": 55,\n \"score\": 258175.96686115547\n },\n {\n \"content\": \"pub fn glRectfv(v1: *const GLfloat, v2: *const GLfloat) {\\n\\n unimplemented!();\\n\\n}\\n\\n\\n\",\n \"file_path\": \"shipico/miniquad/native/sapp-android/src/gl.rs\",\n \"rank\": 56,\n \"score\": 258175.96686115547\n },\n {\n \"content\": \"pub fn glRectfv(v1: *const GLfloat, v2: *const GLfloat) {\\n\\n unimplemented!();\\n\\n}\\n\\n\\n\",\n \"file_path\": \"shipico/miniquad/native/sapp-kms/src/gl.rs\",\n \"rank\": 57,\n \"score\": 258175.96686115547\n },\n {\n \"content\": \"pub fn glColor4ubVertex3fvSUN(c: *const GLubyte, v: *const GLfloat) {\\n\\n unimplemented!();\\n\\n}\\n\\n\\n\",\n \"file_path\": \"shipico/miniquad/native/sapp-dummy/src/gl.rs\",\n \"rank\": 58,\n \"score\": 258175.96686115547\n },\n {\n \"content\": \"pub fn glRectsv(v1: *const GLshort, v2: *const GLshort) {\\n\\n unimplemented!();\\n\\n}\\n\\n\\n\",\n \"file_path\": \"shipico/miniquad/native/sapp-android/src/gl.rs\",\n \"rank\": 59,\n \"score\": 258175.96686115547\n },\n {\n \"content\": \"pub fn glRectdv(v1: *const GLdouble, v2: *const GLdouble) {\\n\\n unimplemented!();\\n\\n}\\n\\n\\n\",\n \"file_path\": \"shipico/miniquad/native/sapp-kms/src/gl.rs\",\n \"rank\": 60,\n \"score\": 258175.96686115547\n },\n {\n \"content\": \"pub fn glColor4ubVertex2fvSUN(c: *const GLubyte, v: *const GLfloat) {\\n\\n unimplemented!();\\n\\n}\\n\\n\\n\",\n \"file_path\": \"shipico/miniquad/native/sapp-android/src/gl.rs\",\n \"rank\": 61,\n \"score\": 258175.96686115547\n },\n {\n \"content\": \"pub fn glRectiv(v1: *const GLint, v2: *const GLint) {\\n\\n unimplemented!();\\n\\n}\\n\\n\\n\",\n \"file_path\": \"shipico/miniquad/native/sapp-android/src/gl.rs\",\n \"rank\": 62,\n \"score\": 258175.96686115547\n },\n {\n \"content\": \"pub fn glRectfv(v1: *const GLfloat, v2: *const GLfloat) {\\n\\n unimplemented!();\\n\\n}\\n\\n\\n\",\n \"file_path\": \"shipico/miniquad/native/sapp-dummy/src/gl.rs\",\n \"rank\": 63,\n \"score\": 258175.96686115547\n },\n {\n \"content\": \"pub fn glRectdv(v1: *const GLdouble, v2: *const GLdouble) {\\n\\n unimplemented!();\\n\\n}\\n\\n\\n\",\n \"file_path\": \"shipico/miniquad/native/sapp-android/src/gl.rs\",\n \"rank\": 64,\n \"score\": 258175.96686115547\n },\n {\n \"content\": \"pub fn glRectdv(v1: *const GLdouble, v2: *const GLdouble) {\\n\\n unimplemented!();\\n\\n}\\n\\n\\n\",\n \"file_path\": \"shipico/miniquad/native/sapp-dummy/src/gl.rs\",\n \"rank\": 65,\n \"score\": 258175.96686115547\n },\n {\n \"content\": \"pub fn glColor4ubVertex3fvSUN(c: *const GLubyte, v: *const GLfloat) {\\n\\n unimplemented!();\\n\\n}\\n\\n\\n\",\n \"file_path\": \"shipico/miniquad/native/sapp-kms/src/gl.rs\",\n \"rank\": 66,\n \"score\": 258175.96686115547\n },\n {\n \"content\": \"pub fn glColor3fVertex3fvSUN(c: *const GLfloat, v: *const GLfloat) {\\n\\n unimplemented!();\\n\\n}\\n\\n\\n\",\n \"file_path\": \"shipico/miniquad/native/sapp-kms/src/gl.rs\",\n \"rank\": 67,\n \"score\": 258175.96686115547\n },\n {\n \"content\": \"pub fn glRectiv(v1: *const GLint, v2: *const GLint) {\\n\\n unimplemented!();\\n\\n}\\n\\n\\n\",\n \"file_path\": \"shipico/miniquad/native/sapp-dummy/src/gl.rs\",\n \"rank\": 68,\n \"score\": 258175.96686115547\n },\n {\n \"content\": \"pub fn glNormal3fVertex3fvSUN(n: *const GLfloat, v: *const GLfloat) {\\n\\n unimplemented!();\\n\\n}\\n\\n\\n\",\n \"file_path\": \"shipico/miniquad/native/sapp-kms/src/gl.rs\",\n \"rank\": 69,\n \"score\": 258175.96686115547\n },\n {\n \"content\": \"pub fn glNormal3fVertex3fvSUN(n: *const GLfloat, v: *const GLfloat) {\\n\\n unimplemented!();\\n\\n}\\n\\n\\n\",\n \"file_path\": \"shipico/miniquad/native/sapp-dummy/src/gl.rs\",\n \"rank\": 70,\n \"score\": 258175.96686115547\n },\n {\n \"content\": \"pub fn glColor3fVertex3fvSUN(c: *const GLfloat, v: *const GLfloat) {\\n\\n unimplemented!();\\n\\n}\\n\\n\\n\",\n \"file_path\": \"shipico/miniquad/native/sapp-dummy/src/gl.rs\",\n \"rank\": 71,\n \"score\": 258175.96686115547\n },\n {\n \"content\": \"pub fn glColor4ubVertex2fvSUN(c: *const GLubyte, v: *const GLfloat) {\\n\\n unimplemented!();\\n\\n}\\n\\n\\n\",\n \"file_path\": \"shipico/miniquad/native/sapp-dummy/src/gl.rs\",\n \"rank\": 72,\n \"score\": 258175.96686115547\n },\n {\n \"content\": \"pub fn glRectiv(v1: *const GLint, v2: *const GLint) {\\n\\n unimplemented!();\\n\\n}\\n\\n\\n\",\n \"file_path\": \"shipico/miniquad/native/sapp-kms/src/gl.rs\",\n \"rank\": 73,\n \"score\": 258175.96686115547\n },\n {\n \"content\": \"pub fn glRectsv(v1: *const GLshort, v2: *const GLshort) {\\n\\n unimplemented!();\\n\\n}\\n\\n\\n\",\n \"file_path\": \"shipico/miniquad/native/sapp-dummy/src/gl.rs\",\n \"rank\": 74,\n \"score\": 258175.96686115547\n },\n {\n \"content\": \"pub fn glNormal3fVertex3fvSUN(n: *const GLfloat, v: *const GLfloat) {\\n\\n unimplemented!();\\n\\n}\\n\\n\\n\",\n \"file_path\": \"shipico/miniquad/native/sapp-android/src/gl.rs\",\n \"rank\": 75,\n \"score\": 258175.96686115547\n },\n {\n \"content\": \"pub fn glColor4ubVertex2fvSUN(c: *const GLubyte, v: *const GLfloat) {\\n\\n unimplemented!();\\n\\n}\\n\\n\\n\",\n \"file_path\": \"shipico/miniquad/native/sapp-kms/src/gl.rs\",\n \"rank\": 76,\n \"score\": 258175.96686115547\n },\n {\n \"content\": \"pub fn glRectsv(v1: *const GLshort, v2: *const GLshort) {\\n\\n unimplemented!();\\n\\n}\\n\\n\\n\",\n \"file_path\": \"shipico/miniquad/native/sapp-kms/src/gl.rs\",\n \"rank\": 77,\n \"score\": 258175.96686115547\n },\n {\n \"content\": \"pub fn glVertex3iv(v: *const GLint) {\\n\\n unimplemented!();\\n\\n}\\n\\n\\n\",\n \"file_path\": \"shipico/miniquad/native/sapp-android/src/gl.rs\",\n \"rank\": 78,\n \"score\": 257451.66424510535\n },\n {\n \"content\": \"pub fn glVertex4dv(v: *const GLdouble) {\\n\\n unimplemented!();\\n\\n}\\n\\n\\n\",\n \"file_path\": \"shipico/miniquad/native/sapp-android/src/gl.rs\",\n \"rank\": 79,\n \"score\": 257451.66424510535\n },\n {\n \"content\": \"pub fn glIndexdv(c: *const GLdouble) {\\n\\n unimplemented!();\\n\\n}\\n\\n\\n\",\n \"file_path\": \"shipico/miniquad/native/sapp-android/src/gl.rs\",\n \"rank\": 80,\n \"score\": 257451.66424510535\n },\n {\n \"content\": \"pub fn glIndexfv(c: *const GLfloat) {\\n\\n unimplemented!();\\n\\n}\\n\\n\\n\",\n \"file_path\": \"shipico/miniquad/native/sapp-android/src/gl.rs\",\n \"rank\": 81,\n \"score\": 257451.66424510535\n },\n {\n \"content\": \"pub fn glVertex4sv(v: *const GLshort) {\\n\\n unimplemented!();\\n\\n}\\n\\n\\n\",\n \"file_path\": \"shipico/miniquad/native/sapp-android/src/gl.rs\",\n \"rank\": 82,\n \"score\": 257451.66424510535\n },\n {\n \"content\": \"pub fn glVertex3dv(v: *const GLdouble) {\\n\\n unimplemented!();\\n\\n}\\n\\n\\n\",\n \"file_path\": \"shipico/miniquad/native/sapp-android/src/gl.rs\",\n \"rank\": 83,\n \"score\": 257451.66424510535\n },\n {\n \"content\": \"pub fn glNormal3bv(v: *const GLbyte) {\\n\\n unimplemented!();\\n\\n}\\n\\n\\n\",\n \"file_path\": \"shipico/miniquad/native/sapp-android/src/gl.rs\",\n \"rank\": 84,\n \"score\": 257451.66424510535\n },\n {\n \"content\": \"pub fn glVertex2dv(v: *const GLdouble) {\\n\\n unimplemented!();\\n\\n}\\n\\n\\n\",\n \"file_path\": \"shipico/miniquad/native/sapp-android/src/gl.rs\",\n \"rank\": 85,\n \"score\": 257451.66424510535\n },\n {\n \"content\": \"pub fn glIndexsv(c: *const GLshort) {\\n\\n unimplemented!();\\n\\n}\\n\\n\\n\",\n \"file_path\": \"shipico/miniquad/native/sapp-android/src/gl.rs\",\n \"rank\": 86,\n \"score\": 257451.66424510535\n },\n {\n \"content\": \"pub fn glNormal3iv(v: *const GLint) {\\n\\n unimplemented!();\\n\\n}\\n\\n\\n\",\n \"file_path\": \"shipico/miniquad/native/sapp-android/src/gl.rs\",\n \"rank\": 87,\n \"score\": 257451.66424510535\n },\n {\n \"content\": \"pub fn glVertex3fv(v: *const GLfloat) {\\n\\n unimplemented!();\\n\\n}\\n\\n\\n\",\n \"file_path\": \"shipico/miniquad/native/sapp-android/src/gl.rs\",\n \"rank\": 88,\n \"score\": 257451.66424510535\n },\n {\n \"content\": \"pub fn glVertex2sv(v: *const GLshort) {\\n\\n unimplemented!();\\n\\n}\\n\\n\\n\",\n \"file_path\": \"shipico/miniquad/native/sapp-android/src/gl.rs\",\n \"rank\": 89,\n \"score\": 257451.66424510535\n },\n {\n \"content\": \"pub fn glVertex2iv(v: *const GLint) {\\n\\n unimplemented!();\\n\\n}\\n\\n\\n\",\n \"file_path\": \"shipico/miniquad/native/sapp-android/src/gl.rs\",\n \"rank\": 90,\n \"score\": 257451.66424510535\n },\n {\n \"content\": \"pub fn glVertex4iv(v: *const GLint) {\\n\\n unimplemented!();\\n\\n}\\n\\n\\n\",\n \"file_path\": \"shipico/miniquad/native/sapp-android/src/gl.rs\",\n \"rank\": 91,\n \"score\": 257451.66424510535\n },\n {\n \"content\": \"pub fn glVertex3sv(v: *const GLshort) {\\n\\n unimplemented!();\\n\\n}\\n\\n\\n\",\n \"file_path\": \"shipico/miniquad/native/sapp-android/src/gl.rs\",\n \"rank\": 92,\n \"score\": 257451.66424510535\n },\n {\n \"content\": \"pub fn glVertex4fv(v: *const GLfloat) {\\n\\n unimplemented!();\\n\\n}\\n\\n\\n\",\n \"file_path\": \"shipico/miniquad/native/sapp-android/src/gl.rs\",\n \"rank\": 93,\n \"score\": 257451.66424510535\n },\n {\n \"content\": \"pub fn glVertex2fv(v: *const GLfloat) {\\n\\n unimplemented!();\\n\\n}\\n\\n\\n\",\n \"file_path\": \"shipico/miniquad/native/sapp-android/src/gl.rs\",\n \"rank\": 94,\n \"score\": 257451.66424510535\n },\n {\n \"content\": \"pub fn glNormal3dv(v: *const GLdouble) {\\n\\n unimplemented!();\\n\\n}\\n\\n\\n\",\n \"file_path\": \"shipico/miniquad/native/sapp-android/src/gl.rs\",\n \"rank\": 95,\n \"score\": 257451.66424510535\n },\n {\n \"content\": \"pub fn glNormal3sv(v: *const GLshort) {\\n\\n unimplemented!();\\n\\n}\\n\\n\\n\",\n \"file_path\": \"shipico/miniquad/native/sapp-android/src/gl.rs\",\n \"rank\": 96,\n \"score\": 257451.66424510535\n },\n {\n \"content\": \"pub fn glIndexiv(c: *const GLint) {\\n\\n unimplemented!();\\n\\n}\\n\\n\\n\",\n \"file_path\": \"shipico/miniquad/native/sapp-android/src/gl.rs\",\n \"rank\": 97,\n \"score\": 257451.66424510535\n },\n {\n \"content\": \"pub fn glNormal3fv(v: *const GLfloat) {\\n\\n unimplemented!();\\n\\n}\\n\\n\\n\",\n \"file_path\": \"shipico/miniquad/native/sapp-android/src/gl.rs\",\n \"rank\": 98,\n \"score\": 257451.66424510535\n },\n {\n \"content\": \"pub fn glIndexubv(c: *const GLubyte) {\\n\\n unimplemented!();\\n\\n}\\n\\n\\n\",\n \"file_path\": \"shipico/miniquad/native/sapp-android/src/gl.rs\",\n \"rank\": 99,\n \"score\": 257451.66424510535\n }\n]","isConversational":false}}}],"truncated":false,"partial":false},"paginationData":{"pageIndex":23,"numItemsPerPage":100,"numTotalItems":13489,"offset":2300,"length":100}},"jwt":"eyJhbGciOiJFZERTQSJ9.eyJyZWFkIjp0cnVlLCJwZXJtaXNzaW9ucyI6eyJyZXBvLmNvbnRlbnQucmVhZCI6dHJ1ZX0sImlhdCI6MTc3OTc4NTA4Mywic3ViIjoiL2RhdGFzZXRzL3NvdXJjZWdyYXBoL2NvbnRleHQtYXdhcmUtZmltLWNvZGUtY29tcGxldGlvbnMiLCJleHAiOjE3Nzk3ODg2ODMsImlzcyI6Imh0dHBzOi8vaHVnZ2luZ2ZhY2UuY28ifQ.xBaE83L-7i8TXhWDC-Sw87bj2if12KVlpRjznTAtUcrGE4Vjd5ZMMg5P3pgdeGgkQYE2vkC4lhRVHk5UeLyUDg","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 | lain/src/buffer.rs | Mrmaxmeier/lain | f4ae991c30abda5860ff7ac3933d91cc62e9c2a1 | use crate::traits::*;
use crate::types::UnsafeEnum;
use byteorder::{ByteOrder, WriteBytesExt};
use paste::paste;
use std::io::Write;
impl<T> SerializedSize for [T]
where
T: SerializedSize,
{
#[inline]
default fn serialized_size(&self) -> usize {
trace!("using default serialized_size for array");
... | use crate::traits::*;
use crate::types::UnsafeEnum;
use byteorder::{ByteOrder, WriteBytesExt};
use paste::paste;
use std::io::Write;
impl<T> SerializedSize for [T]
where
T: SerializedSize,
{
#[inline]
default fn serialized_size(&self) -> usize {
trace!("using default serialized_size for array");
... |
}
impl<T, const N: usize> BinarySerialize for [T; N]
where
T: BinarySerialize,
{
#[inline(always)]
fn binary_serialize<W: Write, E: ByteOrder>(&self, buffer: &mut W) -> usize {
self.as_ref().binary_serialize::<W, E>(buffer)
}
}
impl<T, I> BinarySerialize for UnsafeEnum<T, I>
where
T: Bina... | serialize<W: Write, E: ByteOrder>(&self, buffer: &mut W) -> usize {
let mut bytes_written = 0;
for item in self.iter() {
bytes_written += item.binary_serialize::<W, E>(buffer);
}
bytes_written
} | function_block-function_prefixed | [
{
"content": "fn bench_serialize_1000(c: &mut Criterion) {\n\n let struct_size = std::mem::size_of::<NestedStruct>();\n\n let function_name = format!(\n\n \"serialize BigEndian with struct of size 0x{:X}\",\n\n struct_size\n\n );\n\n\n\n let nested = TestStruct {\n\n single_byte... |
Rust | rust token listener/test/src/bin/test2.rs | everscale-experts/hackathon_new | dafaaea8b7f70cfdb9162a1b6752ac31d6a4a5df | use ureq::json;
use std::convert::TryInto;
use serde::Serialize;
use serde::Serializer;
use crypto::blake2b;
use crypto::Prefix;
use crypto::WithPrefix;
use crypto::WithoutPrefix;
use crypto::base58check::{FromBase58Check, ToBase58Check};
use crypto::FromBase58CheckError;
use crypto::NotMatchingPrefixError;
use types::... | use ureq::json;
use std::convert::TryInto;
use serde::Serialize;
use serde::Serializer;
use crypto::blake2b;
use crypto::Prefix;
use crypto::WithPrefix;
use crypto::WithoutPrefix;
use crypto::base58check::{FromBase58Check, ToBase58Check};
use crypto::FromBase58CheckError;
use crypto::NotMatchingPrefixError;
use types::... | ializer
{
serializer.serialize_str(
&self.to_base58check()
)
}
}
fn transfer() {
let params = json!("{
to: \"KT1MeAHVkJp87r9neejmaxCfaccoUfXAssy1\",
amount: 1,
parameter: {
entrypoint: \"transfer\",
value: {
prim: \... | not matching prefix")]
NotMatchingPrefix,
#[error("invalid size")]
InvalidSize,
}
impl From<FromBase58CheckError> for FromPrefixedBase58CheckError {
fn from(err: FromBase58CheckError) -> Self {
match err {
FromBase58CheckError::InvalidBase58 => {
Self::InvalidBase58
... | random | [
{
"content": "/// A trait for converting a value to base58 encoded string.\n\npub trait ToBase58Check {\n\n /// Converts a value of `self` to a base58 value, returning the owned string.\n\n fn to_base58check(&self) -> String;\n\n}\n\n\n",
"file_path": "rust token listener/crypto/src/base58check.rs",
... |
Rust | src/clean.rs | larsluthman/cargo-llvm-cov | 0a6842f901fda7d08be5211366e4d632c30782a7 |
use std::path::Path;
use anyhow::Result;
use cargo_metadata::PackageId;
use regex::Regex;
use walkdir::WalkDir;
use crate::{
cargo::{self, Workspace},
cli::{CleanOptions, ManifestOptions},
context::Context,
env::Env,
fs, term,
};
pub(crate) fn run(mut options: CleanOptions) -> Result<()> {
... |
use std::path::Path;
use anyhow::Result;
use cargo_metadata::PackageId;
use regex::Regex;
use walkdir::WalkDir;
use crate::{
cargo::{self, Workspace},
cli::{CleanOptions, ManifestOptions},
context::Context,
env::Env,
fs, term,
};
pub(crate) fn run(mut options: CleanOptions) -> Result<()> {
... |
pub(crate) fn clean_partial(cx: &Context) -> Result<()> {
if cx.no_run || cx.cov.no_report {
return Ok(());
}
clean_ws_inner(&cx.ws, &cx.workspace_members.included, cx.build.verbose > 1)?;
let package_args: Vec<_> = cx
.workspace_members
.included
.iter()
.fla... | for dir in &[&ws.target_dir, &ws.output_dir] {
rm_rf(dir, options.verbose != 0)?;
}
return Ok(());
}
clean_ws(&ws, &ws.metadata.workspace_members, &options.manifest, options.verbose)?;
Ok(())
} | function_block-function_prefix_line | [
{
"content": "fn package_root(env: &Env, manifest_path: Option<&Utf8Path>) -> Result<Utf8PathBuf> {\n\n let package_root = if let Some(manifest_path) = manifest_path {\n\n manifest_path.to_owned()\n\n } else {\n\n locate_project(env)?.into()\n\n };\n\n Ok(package_root)\n\n}\n\n\n",
... |
Rust | src/full_node/apply_block.rs | NilFoundation/rust-ton | ea970ca3a96f93f2ad48576fd5d8f5503ad2040d | use crate::{
block::BlockStuff, engine_traits::EngineOperations, shard_state::ShardStateStuff
};
use std::{ops::Deref, sync::Arc};
use storage::block_handle_db::BlockHandle;
use ton_types::{error, fail, Result};
use ton_block::BlockIdExt;
pub const MAX_RECURSION_DEPTH: u32 = 16;
pub async fn apply_block(
hand... | use crate::{
block::BlockStuff, engine_traits::EngineOperations, shard_state::ShardStateStuff
};
use std::{ops::Deref, sync::Arc};
use storage::block_handle_db::BlockHandle;
use ton_types::{error, fail, Result};
use ton_block::BlockIdExt;
pub const MAX_RECURSION_DEPTH: u32 = 16;
|
async fn check_prev_blocks(
prev_ids: &(BlockIdExt, Option<BlockIdExt>),
engine: &Arc<dyn EngineOperations>,
mc_seq_no: u32,
pre_apply: bool,
recursion_depth: u32
) -> Result<()> {
match prev_ids {
(prev1_id, Some(prev2_id)) => {
let mut apply_prev_futures = Vec::with_capac... | pub async fn apply_block(
handle: &Arc<BlockHandle>,
block: &BlockStuff,
mc_seq_no: u32,
engine: &Arc<dyn EngineOperations>,
pre_apply: bool,
recursion_depth: u32
) -> Result<()> {
if handle.id() != block.id() {
fail!("Block id mismatch in apply block: {} vs {}", handle.id(), block.i... | function_block-full_function | [] |
Rust | src/lexer/mod.rs | rickspencer3/sabre | de0de9f3bc14e85b5443046c7fe21cd4b142e8e5 | /**
* Copyright 2020 Garrit Franke
*
* 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/licenses/LICENSE-2.0
*
* Unless required by applicable law or agree... | /**
* Copyright 2020 Garrit Franke
*
* 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/licenses/LICENSE-2.0
*
* Unless required by applicable law or agree... |
fn eat_string(&mut self) {
loop {
match self.first() {
'"' | '\'' => break,
'\n' => panic!(
"String does not end on same line. At {}:{}",
self.pos().line,
self.pos().offset
... | fn eat_digits(&mut self) -> bool {
let mut has_digits = false;
loop {
match self.first() {
'_' => {
self.bump();
}
'0'..='9' => {
has_digits = true;
self.bump();
}
... | function_block-full_function | [
{
"content": "pub fn highlight_position_in_file(input: String, position: Position) -> String {\n\n // TODO: Chain without collecting in between\n\n input\n\n .chars()\n\n .skip(position.raw)\n\n .take_while(|c| c != &'\\n')\n\n .collect::<String>()\n\n .chars()\n\n ... |
Rust | examples/binance_websockets.rs | vikulikov/binance-rs-async | 40c0907e67d629d135dea562f56e5629e5046143 | use std::sync::atomic::{AtomicBool, Ordering};
use std::sync::RwLock;
use futures::stream::StreamExt;
use serde_json::from_str;
use tokio_tungstenite::tungstenite::Message;
use binance::api::*;
use binance::userstream::*;
use binance::websockets::*;
use binance::ws_model::{CombinedStreamEvent, WebsocketEvent, Websock... | use std::sync::atomic::{AtomicBool, Ordering};
use std::sync::RwLock;
use futures::stream::StreamExt;
use serde_json::from_str;
use tokio_tungstenite::tungstenite::Message;
use binance::api::*;
use binance::userstream::*;
use binance::websockets::*;
use binance::ws_model::{CombinedStreamEvent, WebsocketEvent, Websock... | => {
if msg.is_empty() {
continue;
}
let event: CombinedStreamEvent<WebsocketEventUntag> = from_str(msg.as_str()).unwrap();
eprintln!("event = {:?}", event);
}
... | t");
let mut web_socket: WebSockets<'_, WebsocketEventUntag> = WebSockets::new(|events: WebsocketEventUntag| {
if let WebsocketEventUntag::BookTicker(tick_event) = events {
println!("{:?}", tick_event)
}
Ok(())
});
web_socket.connect(&book_ticker).await.unwrap();
i... | random | [
{
"content": "pub fn kline_stream(symbol: &str, interval: &str) -> String { format!(\"{}@kline_{}\", symbol, interval) }\n\n\n",
"file_path": "src/websockets.rs",
"rank": 0,
"score": 149192.0712904504
},
{
"content": "pub fn trade_stream(symbol: &str) -> String { format!(\"{}@trade\", symbol... |
Rust | src/adoptopenjdk/mod.rs | wherkamp/adoptopenjdk-installer | d9b94c16d20fbcd4fbd05b15b070a877daa088d2 | use reqwest::{StatusCode, Response, Body, Client};
use std::error::Error;
use std::fmt::{Formatter, Display};
use crate::adoptopenjdk::response::AvailableReleases;
use serde::de::DeserializeOwned;
use reqwest::header::{USER_AGENT, HeaderValue, HeaderMap};
use std::path::{Path, PathBuf};
use crate::utils::utils;
use st... | use reqwest::{StatusCode, Response, Body, Client};
use std::error::Error;
use std::fmt::{Formatter, Display};
use crate::adoptopenjdk::response::AvailableReleases;
use serde::de::DeserializeOwned;
use reqwest::header::{USER_AGENT, HeaderValue, HeaderMap};
use std::path::{Path, PathBuf};
use crate::utils::utils;
use st... | dest: &str) -> String {
format!("https://api.adoptium.net/v3/{}", dest)
}
pub async fn respond<T: DeserializeOwned>(
result: Result<Response, reqwest::Error>,
) -> Result<T, AdoptOpenJDKError> {
if let Ok(response) = result {
let code = response.status();
... | onse, reqwest::Error> {
let string = self.build_url(url);
let mut headers = HeaderMap::new();
headers.insert(
USER_AGENT,
HeaderValue::from_str(&*self.user_agent).unwrap(),
);
self.client.get(string).headers(headers).send().await
}
pub async f... | random | [
{
"content": "/// Stolen from Tar depend and modified to fit my needs\n\npub fn unpack(mut archive: Archive<GzDecoder<File>>, dst: &Path) -> Result<String, AdoptOpenJDKError> {\n\n let dst = &dst.canonicalize().unwrap_or(dst.to_path_buf());\n\n let mut first = None;\n\n let mut directories = Vec::new()... |
Rust | src/lib.rs | FirelightFlagboy/egui_sdl2_gl | 70cde948a769ce841c72360b80da73e16b675c4f | #![warn(clippy::all)]
#![allow(clippy::single_match)]
pub use egui;
pub use gl;
pub use sdl2;
pub mod painter;
#[cfg(feature = "use_epi")]
pub use epi;
use painter::Painter;
#[cfg(feature = "use_epi")]
use std::time::Instant;
use {
egui::*,
sdl2::{
event::WindowEvent,
keyboard::{Keycode, Mod},
... | #![warn(clippy::all)]
#![allow(clippy::single_match)]
pub use egui;
pub use gl;
pub use sdl2;
pub mod painter;
#[cfg(feature = "use_epi")]
pub use epi;
use painter::Painter;
#[cfg(feature = "use_epi")]
use std::time::Instant;
use {
egui::*,
sdl2::{
event::WindowEvent,
keyboard::{Keycode, Mod},
... |
}
KeyDown {
keycode, keymod, ..
} => {
let key_code = match keycode {
Some(key_code) => key_code,
_ => return,
};
let key = match translate_virtual_key_code(key_code) {
Some(key) => key,
... | };
(painter, _self)
}
pub fn process_input(
&mut self,
window: &sdl2::video::Window,
event: sdl2::event::Event,
painter: &mut Painter,
) {
input_to_egui(window, event, painter, self);
}
pub fn process_output(&mut self, window: &sdl2::video::Win... | random | [
{
"content": "#[derive(Default)]\n\nstruct UserTexture {\n\n size: (usize, usize),\n\n\n\n /// Pending upload (will be emptied later).\n\n pixels: Vec<u8>,\n\n\n\n /// Lazily uploaded\n\n texture: Option<GLuint>,\n\n\n\n /// For user textures there is a choice between\n\n /// Linear (defaul... |
Rust | test/src/specs/tx_pool/send_large_cycles_tx.rs | chuijiaolianying/ckb | 04c8effb7c77f9cb86306090c7f7747dc122ada7 | use super::{new_block_assembler_config, type_lock_script_code_hash};
use crate::utils::wait_until;
use crate::{Net, Node, Spec, DEFAULT_TX_PROPOSAL_WINDOW};
use ckb_app_config::CKBAppConfig;
use ckb_crypto::secp::{Generator, Privkey};
use ckb_hash::{blake2b_256, new_blake2b};
use ckb_types::{
bytes::Bytes,
core... | use super::{new_block_assembler_config, type_lock_script_code_hash};
use crate::utils::wait_until;
use crate::{Net, Node, Spec, DEFAULT_TX_PROPOSAL_WINDOW};
use ckb_app_config::CKBAppConfig;
use ckb_crypto::secp::{Generator, Privkey};
use ckb_hash::{blake2b_256, new_blake2b};
use ckb_types::{
bytes::Bytes,
core... | mut Net) {
let mut node0 = net.nodes.remove(0);
let node1 = &net.nodes[0];
node0.stop();
node0.edit_config_file(
Box::new(|_| ()),
Box::new(move |config| {
config.tx_pool.max_tx_verify_cycles = std::u32::MAX.into();
})... | let block: BlockView = node0.get_tip_block();
assert_eq!(block.transactions()[1], tx);
node0.connect(&node1);
info!("Wait block relay to node1");
let result = wait_until(60, || {
let block2: BlockView = node1.get_tip_block();
block2.hash() == block.hash()
... | random | [
{
"content": "pub fn assert_new_block_committed(node: &Node, committed: &[TransactionView]) {\n\n let block = node.new_block(None, None, None);\n\n if committed != &block.transactions()[1..] {\n\n print_proposals_in_window(node);\n\n assert_eq!(committed, &block.transactions()[1..]);\n\n ... |
Rust | src/connectivity/bluetooth/core/bt-gap/src/host_device.rs | opensource-assist/fuschia | 66646c55b3d0b36aae90a4b6706b87f1a6261935 |
use {
fidl::endpoints::ClientEnd,
fidl_fuchsia_bluetooth::DeviceClass,
fidl_fuchsia_bluetooth::PeerId as FidlPeerId,
fidl_fuchsia_bluetooth_control::{
self as control, HostData, InputCapabilityType, OutputCapabilityType,
PairingDelegateMarker, PairingOptions,
},
fidl_fuchsia_bl... |
use {
fidl::endpoints::ClientEnd,
fidl_fuchsia_bluetooth::DeviceClass,
fidl_fuchsia_bluetooth::PeerId as FidlPeerId,
fidl_fuchsia_bluetooth_control::{
self as control, HostData, InputCapabilityType, OutputCapabilityType,
PairingDelegateMarker, PairingOptions,
},
fidl_fuchsia_bl... | ;
if let Err(e) = listener.on_new_host_bond(data.into()).await {
fx_log_err!("Failed to persist bonding data: {:#?}", e);
}
}
};
}
Ok(())
}
async fn watch_state(host: Arc<RwLock<HostDevice>>) -> types::Result<()> {
loop {
refre... | match data.try_into() {
Err(e) => {
fx_log_err!("Invalid bonding data, ignoring: {:#?}", e);
continue;
}
Ok(data) => data,
} | if_condition | [] |
Rust | examples/bindless/main.rs | peterwmwong/metal-rs | 1aaa9033a22b2af7ff8cae2ed412a4733799c3d3 |
use metal::*;
use objc::rc::autoreleasepool;
const BINDLESS_TEXTURE_COUNT: NSUInteger = 100_000;
fn main() {
autoreleasepool(|| {
let device = Device::system_default().expect("no device found");
/*
MSL
struct Textures {
texture2d<float> texture;
};
... |
use metal::*;
use objc::rc::autoreleasepool;
const BINDLESS_TEXTURE_COUNT: NSUInteger = 100_000;
| fn main() {
autoreleasepool(|| {
let device = Device::system_default().expect("no device found");
/*
MSL
struct Textures {
texture2d<float> texture;
};
struct BindlessTextures {
device Textures *textures;
};
*/
... | function_block-full_function | [
{
"content": "#[allow(non_camel_case_types)]\n\ntype dispatch_block_t = *const Block<(), ()>;\n\n\n\n#[cfg_attr(\n\n any(target_os = \"macos\", target_os = \"ios\"),\n\n link(name = \"System\", kind = \"dylib\")\n\n)]\n\n#[cfg_attr(\n\n not(any(target_os = \"macos\", target_os = \"ios\")),\n\n link(... | |
Rust | lib/emscripten/build/emtests.rs | cdetrio/wasmer | b68b109b7de1d27a334591fdeeda475c808c812a |
use glob::glob;
use std::fs;
use std::path::Path;
use std::path::PathBuf;
use std::process::Command;
use std::fs::File;
use std::io::prelude::*;
use std::io::BufReader;
static BANNER: &str = "// Rust test file autogenerated with cargo build (build/emtests.rs).
// Please do NOT modify it by hand, as it will be reset... |
use glob::glob;
use std::fs;
use std::path::Path;
use std::path::PathBuf;
use std::process::Command;
use std::fs::File;
use std::io::prelude::*;
use std::io::BufReader;
static BANNER: &str = "// Rust test file autogenerated with cargo build (build/emtests.rs).
// Please do NOT modify it by hand, as it will be reset... | Vec<String> = Vec::new();
let ignores = read_ignore_list();
for ext in EXTENSIONS.iter() {
for entry in glob(&format!("emtests/*.{}", ext)).unwrap() {
match entry {
Ok(path) => {
let test = path.to_str().unwrap();
if !EXCLUDES.it... | &module_path).is_file() {
println!("Path not found to test module: {}", module_path);
None
} else if !Path::new(&test_output_path).is_file() {
println!("Path not found to test output: {}", module_path);
None
} else {
let contents = format!(
"#[test]{ignore}
fn... | random | [
{
"content": "pub fn abort_with_message(ctx: &mut Ctx, message: &str) {\n\n debug!(\"emscripten::abort_with_message\");\n\n println!(\"{}\", message);\n\n _abort(ctx);\n\n}\n\n\n",
"file_path": "lib/emscripten/src/process.rs",
"rank": 0,
"score": 257234.96267437495
},
{
"content": "... |
Rust | src/cpu/addressing_mode.rs | Erj4/nes-emulator | 13f5e1bac138802f1a6bb383227b9d4f92b092ea | use crate::{cpu, memory};
#[derive(Debug)]
pub enum ResolvableAddress {
ZeroPage(cpu::Int),
XIndexedZeroPage(cpu::Int),
YIndexedZeroPage(cpu::Int),
Absolute(memory::Address),
XIndexedAbsolute(memory::Address),
YIndexedAbsolute(memory::Address),
... | use crate::{cpu, memory};
#[derive(Debug)]
pub enum ResolvableAddress {
ZeroPage(cpu::Int),
XIndexedZeroPage(cpu::Int),
YIndexedZeroPage(cpu::Int),
Absolute(memory::Address),
XIndexedAbsolute(memory::Address),
YIndexedAbsolute(memory::Address),
... |
}
}
}
#[derive(Debug)]
pub enum Resolvable<V> {
Resolved(V),
Resolvable(ResolvableAddress),
}
impl SteppableWithCPU for Resolvable<cpu::Int> {
type Output = cpu::Int;
fn step(resolvable: ResolvableAddress, cpu: &cpu::Cpu) -> Resolvable<Self::Output> {
ResolvableAddress::step(resolvable, cpu)
... | match Self::step(resolvable, cpu) {
Resolvable::Resolved(resolved) => break resolved,
Resolvable::Resolvable(unresolved) => resolvable = unresolved,
} | if_condition | [
{
"content": "#[derive(Error, Debug)]\n\nenum AddressExprError {\n\n #[error(\n\n \"address {address:#X?} is outside range (expected {:#X?} <= address <= {:#X?})\",\n\n memory::Address::MIN,\n\n memory::Address::MAX\n\n )]\n\n AddressOutOfRange {\n\n address: evalexpr::IntType,\n\n source: st... |
Rust | day7/main2.rs | allonsy/advent2017 | 644dd55ca9cc4319136123126c40330e9ba52de0 | mod util;
use std::cell::RefCell;
use std::collections::HashMap;
use std::collections::HashSet;
use std::rc::Rc;
type Pointer = Rc<RefCell<ProgramTower>>;
#[derive(Debug)]
struct ProgramTower {
name: String,
weight: i32,
children: HashMap<String, Pointer>,
}
impl ProgramTower {
fn new(name: String, ... | mod util;
use std::cell::RefCell;
use std::collections::HashMap;
use std::collections::HashSet;
use std::rc::Rc;
type Pointer = Rc<RefCell<ProgramTower>>;
#[derive(Debug)]
struct ProgramTower {
name: String,
weight: i32,
children: HashMap<String, Pointer>,
}
impl ProgramTower {
fn new(name: String, ... | (bad_child, None);
}
fn get_bad_weight(children: &HashMap<String, Pointer>) -> Option<(i64, Pointer)> {
let mut freq_map: HashMap<i64, (i32, Pointer)> = HashMap::new();
for (_, child) in children {
let this_weight = get_tower_weight(child);
freq_map.entry(this_weight).or_insert((0, child.clone(... | d_weight {
None => {
child_weight = Some(actual_child_weight);
}
Some(wt) => {
if wt != actual_child_weight {
return false;
}
}
}
}
return true;
}
fn analyze_children(children: &HashMap<S... | random | [
{
"content": "fn eval_condition(state: &mut HashMap<String, i32>, condition: &Condition) -> bool {\n\n let register_value = get_register_value(state, condition.register.clone());\n\n let operand = condition.operand;\n\n\n\n match condition.relation {\n\n Relation::LT => return register_value < o... |
Rust | sdk/data_cosmos/src/operations/get_collection.rs | adeschamps/azure-sdk-for-rust | 027f111683f02fd1c43bc041ac6902e87edc69d8 | use crate::prelude::*;
use crate::headers::from_headers::*;
use azure_core::headers::{
content_type_from_headers, etag_from_headers, session_token_from_headers,
};
use azure_core::{collect_pinned_stream, Context, Response as HttpResponse};
use chrono::{DateTime, Utc};
#[derive(Debug, Clone)]
pub struct GetCollect... | use crate::prelude::*;
use crate::headers::from_headers::*;
use azure_core::headers::{
content_type_from_headers, etag_from_headers, session_token_from_headers,
};
use azure_core::{collect_pinned_stream, Context, Response as HttpResponse};
use chrono::{DateTime, Utc};
#[derive(Debug, Clone)]
pub struct GetCollect... |
}
}
| Ok(Self {
collection: serde_json::from_slice(&body)?,
last_state_change: last_state_change_from_headers(&headers)?,
etag: etag_from_headers(&headers)?,
collection_partition_index: collection_partition_index_from_headers(&headers)?,
collection_service_index: co... | call_expression | [] |
Rust | libchordr/src/test_helpers.rs | chorddown/chordr | f28327dfd2d026076d557a926ca8a33063af82fc | use crate::models::meta::BNotation;
use crate::models::user::{User, Username};
use crate::parser::{MetaInformation, Node};
use crate::prelude::Password;
use crate::tokenizer::{Modifier, Token};
#[cfg(test)]
pub fn get_test_parser_input() -> Vec<Token> {
vec![
Token::headline(1, "Swing Low Sweet Chariot", M... | use crate::models::meta::BNotation;
use crate::models::user::{User, Username};
use crate::parser::{MetaInformation, Node};
use crate::prelude::Password;
use crate::tokenizer::{Modifier, Token};
#[cfg(test)]
pub fn get_test_parser_input() -> Vec<Token> {
vec![
Token::headline(1, "Swing Low Sweet Chariot", M... |
pub fn get_test_ast_w_inline_metadata() -> Node {
Node::Document(vec![
Node::section(
1,
"Swing Low Sweet Chariot",
Modifier::None,
vec![Node::newline()],
),
Node::meta("Artist: The Fantastic Corns").unwrap(),
Node::newline(),
... | Modifier::Chorus,
vec![
Node::newline(),
Node::text("Swing "),
Node::chord_text_pair("D", "low, sweet ").unwrap(),
Node::chord_text_pair("G", "chari").unwrap(),
Node::chord_text_pair("D", "ot.").unwrap(),
],
... | function_block-function_prefix_line | [
{
"content": "#[deprecated(note = \"Please use the `Token`s directly\")]\n\npub fn token_lines_to_tokens(token_lines: Vec<Vec<Token>>) -> Vec<Token> {\n\n let mut stream = vec![];\n\n for line in token_lines {\n\n for token in line {\n\n stream.push(token);\n\n }\n\n }\n\n\n\n ... |
Rust | vulkano/src/renderer_vulkano.rs | paulpage/rust_ldraw | bed7a738bc95b71b59e5d6d0b3485139a1cfe66d | use cgmath::{Matrix3, Matrix4, Point3, Rad, Vector3};
use vulkano::buffer::cpu_pool::CpuBufferPool;
use std::iter;
use vulkano::buffer::{BufferUsage, CpuAccessibleBuffer};
use vulkano::command_buffer::{AutoCommandBufferBuilder, DynamicState};
use vulkano::descriptor::descriptor_set::PersistentDescriptorSet;
use vulkano... | use cgmath::{Matrix3, Matrix4, Point3, Rad, Vector3};
use vulkano::buffer::cpu_pool::CpuBufferPool;
use std::iter;
use vulkano::buffer::{BufferUsage, CpuAccessibleBuffer};
use vulkano::command_buffer::{AutoCommandBufferBuilder, DynamicState};
use vulkano::descriptor::descriptor_set::PersistentDescriptorSet;
use vulkano... | s
.iter()
.map(|image| {
Arc::new(
Framebuffer::start(render_pass.clone())
.add(image.clone())
.unwrap()
.add(depth_buffer.clone())
.unwrap()
.build()
.unwr... | function_block-function_prefixed | [
{
"content": "fn unproject(source: Vector3<f32>, view: Matrix4<f32>, proj: Matrix4<f32>) -> Vector3<f32> {\n\n let view_proj = (proj * view).invert().unwrap();\n\n let q = view_proj * Vector4::new(source.x, source.y, source.z, 1.0);\n\n Vector3::new(q.x / q.w, q.y / q.w, q.z / q.w)\n\n}\n\n\n",
"fi... | |
Rust | src/scope.rs | redzic/grass | 37c1ada66418fdbb87968ede91efb9be83a80afa | use std::collections::HashMap;
use codemap::Spanned;
use crate::{
atrule::{Function, Mixin},
builtin::GLOBAL_FUNCTIONS,
common::Identifier,
error::SassResult,
value::Value,
};
#[derive(Debug, Clone, Default)]
pub(crate) struct Scope {
vars: HashMap<Identifier, Spanned<Value>>,
mixins: Has... | use std::collections::HashMap;
use codemap::Spanned;
use crate::{
atrule::{Function, Mixin},
builtin::GLOBAL_FUNCTIONS,
common::Identifier,
error::SassResult,
value::Value,
};
#[derive(Debug, Clone, Default)]
pub(crate) struct Scope {
vars: HashMap<Identifier, Spanned<Value>>,
mixins: Has... |
pub fn get_fn<T: Into<Identifier>>(
&self,
name: Spanned<T>,
global_scope: &Scope,
) -> SassResult<Function> {
let name = name.map_node(Into::into);
match self.functions.get(&name.node) {
Some(v) => Ok(v.clone()),
None => global_scope.get_fn_no_g... | fn get_fn_no_global(&self, name: &Spanned<Identifier>) -> SassResult<Function> {
match self.functions.get(&name.node) {
Some(v) => Ok(v.clone()),
None => Err(("Undefined function.", name.span).into()),
}
} | function_block-full_function | [
{
"content": "pub fn many_variable_redeclarations(c: &mut Criterion) {\n\n c.bench_function(\"many_variable_redeclarations\", |b| {\n\n b.iter(|| {\n\n StyleSheet::new(black_box(\n\n include_str!(\"many_variable_redeclarations.scss\").to_string(),\n\n ))\n\n ... |
Rust | src/advisories/diags.rs | svenstaro/cargo-deny | 4d7a236d6b4db82fc62052bc67dd808695498426 | use crate::{
diag::{Check, Diag, Diagnostic, KrateCoord, Label, Pack, Severity},
Krate, LintLevel,
};
use rustsec::advisory::{Id, Informational, Metadata, Versions};
fn get_notes_from_advisory(advisory: &Metadata) -> Vec<String> {
let mut n = vec![format!("ID: {}", advisory.id)];
if let Some(url) = adv... | use crate::{
diag::{Check, Diag, Diagnostic, KrateCoord, Label, Pack, Severity},
Krate, LintLevel,
};
use rustsec::advisory::{Id, Informational, Metadata, Versions};
fn get_notes_from_advisory(advisory: &Metadata) -> Vec<String> {
let mut n = vec![format!("ID: {}", advisory.id)];
if let Some(url) = adv... | )
.with_message("detected yanked crate")
.with_code("A005")
.with_labels(vec![self
.krate_spans
.label_for_index(krate_index.index(), "yanked version")]),
);
pack
}
pub(crate) fn diag_for_index_failure<D: std::fmt::Display>(&s... | match self.cfg.yanked.value {
LintLevel::Allow => Severity::Help,
LintLevel::Deny => Severity::Error,
LintLevel::Warn => Severity::Warning,
} | if_condition | [
{
"content": "#[inline]\n\nfn matches<'v>(arr: &'v [cfg::Skrate], details: &Krate) -> Option<Vec<ReqMatch<'v>>> {\n\n let matches: Vec<_> = arr\n\n .iter()\n\n .enumerate()\n\n .filter_map(|(index, req)| {\n\n if req.value.name == details.name\n\n && crate::matc... |
Rust | wrflib/examples/example_charts/src/lines_basic.rs | cruise-automation/webviz-rust-framework | 09bc1e0f72eb95a3ace45d2284bb4eb4ea5eb3c8 | use wrflib::*;
use wrflib_components::*;
use crate::ChartExample;
pub(crate) struct LinesBasic {
pub(crate) chart: Chart,
pub(crate) datasets: Vec<Vec<f32>>,
pub(crate) randomize_btn: Button,
pub(crate) add_dataset_btn: Button,
pub(crate) add_data_btn: Button,
pub(crate) remove_dataset_btn: Bu... | use wrflib::*;
use wrflib_components::*;
use crate::ChartExample;
pub(crate) struct LinesBasic {
pub(crate) chart: Chart,
pub(crate) datasets: Vec<Vec<f32>>,
pub(crate) randomize_btn: Button,
pub(crate) add_dataset_btn: Button,
pub(crate) add_data_btn: Button,
pub(crate) remove_dataset_btn: Bu... |
ret.add_dataset();
ret.add_dataset();
ret
}
}
impl LinesBasic {
pub(crate) fn with_dark_style() -> Self {
Self { style: CHART_STYLE_DARK, ..Self::default() }
}
pub(crate) fn with_zoom() -> Self {
Self { zoom_enabled: true, ..Self::default() }
}
... | let mut ret = Self {
chart: Chart::default(),
datasets: vec![],
randomize_btn: Button::default(),
add_dataset_btn: Button::default(),
add_data_btn: Button::default(),
remove_dataset_btn: Button::default(),
remove_data_btn: Button::defau... | assignment_statement | [
{
"content": "#[derive(Default)]\n\nstruct Tooltip {\n\n value: f32,\n\n path: String,\n\n}\n\n\n\nimpl ChartTooltipRenderer for Tooltip {\n\n fn draw_tooltip(&self, cx: &mut Cx, config: &ChartConfig, pos: Vec2) {\n\n let text_props =\n\n TextInsProps { text_style: TEXT_STYLE_MONO, co... |
Rust | age/src/error.rs | str4d/rage | 456ce707f6db01f2f953c9e22c058964f3437795 |
use i18n_embed_fl::fl;
use std::fmt;
use std::io;
use crate::{wfl, wlnfl};
#[cfg(feature = "plugin")]
use age_core::format::Stanza;
#[cfg(feature = "plugin")]
#[cfg_attr(docsrs, doc(cfg(feature = "plugin")))]
#[derive(Clone, Debug)]
pub enum PluginError {
Identity {
binary_name: String,
... |
use i18n_embed_fl::fl;
use std::fmt;
use std::io;
use crate::{wfl, wlnfl};
#[cfg(feature = "plugin")]
use age_core::format::Stanza;
#[cfg(feature = "plugin")]
#[cfg_attr(docsrs, doc(cfg(feature = "plugin")))]
#[derive(Clone, Debug)]
pub enum PluginError {
Identity {
binary_name: String,
... | e) => e.fmt(f),
DecryptError::KeyDecryptionFailed => wfl!(f, "err-key-decryption"),
#[cfg(feature = "plugin")]
DecryptError::MissingPlugin { binary_name } => {
writeln!(
f,
"{}",
fl!(
... |
message: String,
},
Other {
kind: String,
metadata: Vec<String>,
message: String,
},
}
#[cfg(feature = "plugin")]
impl From<Stanza> for PluginError {
fn from(mut s: Stanza) -> Self {
assert!(s.tag == "error");
let kind = ... | random | [
{
"content": "/// Runs the plugin state machine defined by `state_machine`.\n\n///\n\n/// This should be triggered if the `--age-plugin=state_machine` flag is provided as an\n\n/// argument when starting the plugin.\n\npub fn run_state_machine<R: recipient::RecipientPluginV1, I: identity::IdentityPluginV1>(\n\n... |
Rust | src/composable.rs | lostmsu/allocators | fb273782383a1b287bcd0498454cec68c237af46 |
use super::{Allocator, Error, Block, BlockOwner};
pub struct NullAllocator;
unsafe impl Allocator for NullAllocator {
unsafe fn allocate_raw(&self, _size: usize, _align: usize) -> Result<Block, Error> {
Err(Error::OutOfMemory)
}
unsafe fn reallocate_raw<'a>(&'a self, block: Block<'a>, _new_size... |
use super::{Allocator, Error, Block, BlockOwner};
pub struct NullAllocator;
unsafe impl Allocator for NullAllocator {
unsafe fn allocate_raw(&self, _size: usize, _align: usize) -> Result<Block, Error> {
Err(Error::OutOfMemory)
}
unsafe fn reallocate_raw<'a>(&'a self, block: Block<'a>, _new_size... |
}
unsafe impl<M: BlockOwner, F: BlockOwner> Allocator for Fallback<M, F> {
unsafe fn allocate_raw(&self, size: usize, align: usize) -> Result<Block, Error> {
match self.main.allocate_raw(size, align) {
Ok(block) => Ok(block),
Err(_) => self.fallback.allocate_raw(size, align),
... | pub fn new(main: M, fallback: F) -> Self {
Fallback {
main: main,
fallback: fallback,
}
} | function_block-full_function | [
{
"content": "pub fn make_place<A: ?Sized + Allocator, T>(alloc: &A) -> Result<Place<T, A>, super::Error> {\n\n let (size, align) = (mem::size_of::<T>(), mem::align_of::<T>());\n\n match unsafe { alloc.allocate_raw(size, align) } {\n\n Ok(block) => {\n\n Ok(Place {\n\n all... |
Rust | src/bvh.rs | ItsHoff/Rusty | f0418d775442d553b69d8e342a15c597a7786451 | use std::ops::{Index, Range};
use cgmath::Point3;
use crate::aabb::Aabb;
use crate::consts;
use crate::float::*;
use crate::intersect::{Intersect, Ray};
use crate::stats;
use crate::triangle::Triangle;
const MAX_LEAF_SIZE: usize = 8;
#[allow(dead_code)]
#[derive(Clone, Copy, Debug)]
pub enum SplitMode {
Object,... | use std::ops::{Index, Range};
use cgmath::Point3;
use crate::aabb::Aabb;
use crate::consts;
use crate::float::*;
use crate::intersect::{Intersect, Ray};
use crate::stats;
use crate::triangle::Triangle;
const MAX_LEAF_SIZE: usize = 8;
#[allow(dead_code)]
#[derive(Clone, Copy, Debug)]
pub enum SplitMode {
Object,... | right_bbs.push(new_bb);
}
let mut left_bb = Aabb::empty();
for i in 0..triangles.len() {
left_bb.add_aabb(&triangles[i].aabb());
let right_bb = &right_bbs[right_bbs.len() - 1 - i];
let n_left = i.to_float();
let n_right = (triangles.len() ... | function_block-function_prefix_line | [
{
"content": "#[allow(dead_code)]\n\npub fn gamma(n: u32) -> Float {\n\n let n = n.to_float();\n\n n * consts::MACHINE_EPSILON / (1.0 - n * consts::MACHINE_EPSILON)\n\n}\n\n\n",
"file_path": "src/float.rs",
"rank": 3,
"score": 211379.58543044538
},
{
"content": "#[allow(dead_code)]\n\n... | |
Rust | core/src/service/file_service.rs | lockbook/lockbook | 2aac315bad5989617308311d92e52bf82679d919 | use sha2::{Digest, Sha256};
use uuid::Uuid;
use crate::model::state::Config;
use crate::repo::document_repo;
use crate::repo::file_metadata_repo;
use crate::repo::{account_repo, local_changes_repo};
use crate::service::file_compression_service;
use crate::service::file_encryption_service;
use crate::CoreError;
use loc... | use sha2::{Digest, Sha256};
use uuid::Uuid;
use crate::model::state::Config;
use crate::repo::document_repo;
use crate::repo::file_metadata_repo;
use crate::repo::{account_repo, local_changes_repo};
use crate::service::file_compression_service;
use crate::service::file_encryption_service;
use crate::CoreError;
use loc... |
pub fn move_file(config: &Config, id: Uuid, new_parent: Uuid) -> Result<(), CoreError> {
let _account = account_repo::get_account(config)?;
let mut file = file_metadata_repo::maybe_get(config, id)?.ok_or(CoreError::FileNonexistent)?;
if file.id == file.parent {
return Err(CoreError::RootModificat... | nsSlash);
}
match file_metadata_repo::maybe_get(config, id)? {
None => Err(CoreError::FileNonexistent),
Some(mut file) => {
if file.id == file.parent {
return Err(CoreError::RootModificationInvalid);
}
let siblings = file_metadata_repo::get_c... | function_block-function_prefixed | [
{
"content": "pub fn decompress(content: &[u8]) -> SharedResult<Vec<u8>> {\n\n let mut decoder = ZlibDecoder::new(content);\n\n let mut result = Vec::<u8>::new();\n\n decoder\n\n .read_to_end(&mut result)\n\n .map_err(|_| SharedErrorKind::Unexpected(\"unexpected decompression error\"))?;\... |
Rust | src/day15.rs | codedstructure/aoc2021 | 27e151e4c8cbcda78b29fe734df6733818783461 | use std::{
collections::{HashMap, HashSet},
fs::File,
io::{BufRead, BufReader},
};
pub fn read_list(filename: &str) -> Vec<String> {
let f = File::open(filename).expect("Could not read file");
BufReader::new(f).lines().map(|l| l.expect("Err")).collect()
}
#[derive(Debug)]
struct RiskMaze {
ris... | use std::{
collections::{HashMap, HashSet},
fs::File,
io::{BufRead, BufReader},
};
pub fn read_list(filename: &str) -> Vec<String> {
let f = File::open(filename).expect("Could not read file");
BufReader::new(f).lines().map(|l| l.expect("Err")).collect()
}
#[derive(Debug)]
struct RiskMaze {
ris... |
fn bellman_ford(&self) -> i32 {
let start = (0, 0);
let target = (self.risk.len() - 1, self.line_width - 1);
let mut risk = HashMap::new();
for row in 0..self.risk.len() {
for col in 0..self.line_width {
risk.insert((row, col), 99999);... | 0);
boundary.insert((1, 0));
boundary.insert((0, 1));
while risk.get(&target).is_none() {
let mut new_boundary = HashSet::new();
for b in &boundary {
new_boundary.extend(
self.neighbours(*b)
.differe... | function_block-function_prefixed | [
{
"content": "pub fn read_csv_ints(filename: &str) -> Vec<i32> {\n\n let f = File::open(filename).expect(\"Could not read file\");\n\n let mut line = String::new();\n\n BufReader::new(f).read_line(&mut line).unwrap();\n\n // parse() breaks on line ending, so need to trim that...\n\n line.retain(|... |
Rust | src/day25.rs | marty777/adventofcode2019 | b2edc81b6f50ea3d0f64c056d8e9617d3ef6424d |
use std::collections::HashMap;
#[derive(PartialEq, Copy, Clone)]
enum Dir {
North,
East,
South,
West,
}
struct TextNode {
north: i64,
east: i64,
west: i64,
south: i64,
name: String,
explored:bool,
dest:bool,
}
#[derive(Clone)]
struct DNode {
dist:usize,
path:Vec<Dir>
}
fn dijkstra(nodes: &mut Vec<Text... |
use std::collections::HashMap;
#[derive(PartialEq, Copy, Clone)]
enum Dir {
North,
East,
South,
West,
}
struct TextNode {
north: i64,
east: i64,
west: i64,
south: i64,
name: String,
explored:bool,
dest:bool,
}
#[derive(Clone)]
struct DNode {
dist:usize,
path:Vec<Dir>
}
fn dijkstra(nodes: &mut Vec<Text... | : i64 = code.parse::<i64>().unwrap();
prog.mem.push(temp);
}
run_text_adventure(&mut prog);
} | et vec = super::utility::util_fread(file_path);
let intcodes_str:Vec<&str> = vec[0].split(",").collect();
let mut prog:super::utility::IntcodeProgram = super::utility::IntcodeProgram{mem:Vec::new(), pos:0, relative_base:0};
prog.mem.reserve(intcodes_str.len());
for code in intcodes_str {
let temp | function_block-random_span | [
{
"content": "pub fn execute_amp2(intcodes: &mut Vec<i64>, input_signal:i64, phase:i64, input_count:&mut u64, pos: &mut usize, exit:&mut bool) -> i64 {\n\n\tlet mut op_pos: usize = *pos;\n\n\tlet mut output:i64 = 0;\n\n\tlet mut input_signal_used = false;\n\n\tlet mut exit_found = false;\n\n\tloop {\n\n\t\tlet... |
Rust | src/ewmh.rs | aniketfuryrocks/worm | bc3793c68258e208cd95eaa13bae7b57b32ab096 | extern crate x11rb;
use protocol::xproto;
use protocol::xproto::ConnectionExt;
use x11rb::*;
type Result<T> = std::result::Result<T, Box<dyn std::error::Error>>;
pub enum Net {
ActiveWindow,
Supported,
SystemTray,
SystemTrayOP,
SystemTrayOrientation,
SystemTrayOrientationHorz,
WMName,
... | extern crate x11rb;
use protocol::xproto;
use protocol::xproto::ConnectionExt;
use x11rb::*;
type Result<T> = std::result::Result<T, Box<dyn std::error::Error>>;
pub enum Net {
ActiveWindow,
Supported,
SystemTray,
SystemTrayOP,
SystemTrayOrientation,
SystemTrayOrientationHorz,
WMName,
... | pub fn get_ewmh_atoms<C>(conn: &C) -> Result<[xproto::Atom; Net::Last as usize]>
where
C: connection::Connection,
{
Ok([
conn.intern_atom(false, b"_NET_ACTIVE_WINDOW")?
.reply()?
.atom,
conn.intern_atom(false, b"_NET_SUPPORTED")?.reply()?.atom,
... | function_block-full_function | [
{
"content": "pub fn get_ipc_atoms<C>(conn: &C) -> Result<[xproto::Atom; IPC::Last as usize]>\n\nwhere\n\n C: connection::Connection,\n\n{\n\n // see notes on ewmh.rs, exact same thing here\n\n\n\n Ok([\n\n conn.intern_atom(false, b\"_WORM_CLIENT_MESSAGE\")?\n\n .reply()?\n\n ... | |
Rust | generative_design/random_and_noise/m_1_3_03.rs | nfletton/nannou | c7c99328a16221a4d0b196c52647f30d75170b14 |
/**
* creates a texture based on noise values
*
* MOUSE
* position x/y : specify noise input range
*
* KEYS
* 1-2 : set noise mode
* arrow up : noise falloff +
* arrow down : noise falloff -
* arrow left : noise octaves -
* arrow right : noise oct... |
/**
* creates a texture based on noise values
*
* MOUSE
* position x/y : specify noise input range
*
* KEYS
* 1-2 : set noise mode
* arrow up : noise falloff +
* arrow down : noise falloff -
* arrow left : noise octaves -
* arrow right : noise oct... | model.octaves -= 1;
}
Key::Right => {
model.octaves += 1;
}
_otherkey => (),
}
if model.falloff > 1.0 {
model.falloff = 1.0;
}
if model.falloff <= 0.0 {
model.falloff = 0.0;
}
if model.octaves <= 1 {
model.octaves = 1;
... | octaves: usize,
falloff: f32,
noise_mode: u8,
noise_random_seed: u32,
texture: wgpu::Texture,
}
fn model(app: &App) -> Model {
let _window = app
.new_window()
.size(512, 512)
.view(view)
.key_pressed(key_pressed)
.key_released(key_released)
.build... | random | [] |
Rust | systeroid-tui/src/command.rs | orhun/systeroid | ba32367beb5cbe052d2cce6cc98b2babe742df28 | use crate::options::{Direction, ScrollArea};
use std::str::FromStr;
use termion::event::Key;
#[derive(Debug, PartialEq)]
pub enum Command {
Help,
Select,
Set(String, String),
Scroll(ScrollArea, Direction, u8),
MoveCursor(Direction),
Search,
ProcessInput,
... | use crate::options::{Direction, ScrollArea};
use std::str::FromStr;
use termion::event::Key;
#[derive(Debug, PartialEq)]
pub enum Command {
Help,
Select,
Set(String, String),
Scroll(ScrollArea, Direction, u8),
MoveCursor(Direction),
Search,
ProcessInput,
... |
}
}
}
}
impl Command {
pub fn parse(key: Key, input_mode: bool) -> Self {
if input_mode {
match key {
Key::Char('\n') => Command::ProcessInput,
Key::Char(c) => Command::UpdateInput(c),
Key::Backspace => Command::Clear... | if s.starts_with("set") {
let values: Vec<&str> = s
.trim_start_matches("set")
.trim()
.split_whitespace()
.collect();
Ok(Command::Set(
values.first().ok_or(())... | if_condition | [
{
"content": "/// Renders the user interface.\n\npub fn render<B: Backend>(frame: &mut Frame<'_, B>, app: &mut App, colors: &Colors) {\n\n let documentation = app\n\n .parameter_list\n\n .selected()\n\n .and_then(|parameter| parameter.get_documentation());\n\n let rect = frame.size();... |
Rust | cli/src/main.rs | asm0dey/cb | b68417ded4f52d8af1541296485bf39b95c0cf6c | #[macro_use]
extern crate common;
const VERSION: &str = env!("CARGO_PKG_VERSION");
use cli::Handler;
use common::constants::SOCKET_PATH;
use common::errors::StringErrorResult;
use gumdrop::Options;
use server;
use std::env::current_exe;
use std::io::{self, Read};
use std::os::unix::net::UnixStream;
use std::process::... | #[macro_use]
extern crate common;
const VERSION: &str = env!("CARGO_PKG_VERSION");
use cli::Handler;
use common::constants::SOCKET_PATH;
use common::errors::StringErrorResult;
use gumdrop::Options;
use server;
use std::env::current_exe;
use std::io::{self, Read};
use std::os::unix::net::UnixStream;
use std::process::... |
fn main() {
let mut opts = AppOptions::parse_args_default_or_exit();
if opts.server {
server::start();
}
if opts.help {
exit!("{}", AppOptions::usage());
}
if opts.version {
exit!("{}", VERSION);
}
let mut handler = Handler::new(match try_connect(true) {
... | fn try_connect(try_run: bool) -> Result<UnixStream, String> {
match UnixStream::connect(SOCKET_PATH) {
Ok(stream) => Ok(stream),
err => {
if try_run {
let _ = Command::new(current_exe().unwrap())
.arg("-s")
.spawn()
... | function_block-full_function | [
{
"content": "/// Starts server as a daemon\n\npub fn start() {\n\n env_logger::init();\n\n\n\n let socket_path = Path::new(SOCKET_PATH);\n\n\n\n let (username, group) = match get_user_group() {\n\n Ok(ug) => ug,\n\n Err(e) => {\n\n fatal!(\"{}\", e);\n\n }\n\n };\n\n... |
Rust | aer_data/src/metadata/chocolatey.rs | WormieCorp/aer | 9eaf1d86c36016cac1afd7125bb60c592bdd960a |
#![cfg_attr(docsrs, doc(cfg(feature = "chocolatey")))]
use std::collections::HashMap;
use std::fmt::Display;
use aer_version::Versions;
#[cfg(feature = "serialize")]
use serde::{Deserialize, Serialize};
use url::Url;
use crate::prelude::Description;
#[derive(Debug, Clone, PartialEq)]
#[cfg_attr(feature = "seriali... |
#![cfg_attr(docsrs, doc(cfg(feature = "chocolatey")))]
use std::collections::HashMap;
use std::fmt::Display;
use aer_version::Versions;
#[cfg(feature = "serialize")]
use serde::{Deserialize, Serialize};
use url::Url;
use crate::prelude::Description;
#[derive(Debug, Clone, PartialEq)]
#[cfg_attr(feature = "seriali... | on::Text(description.into()));
}
pub fn set_title(&mut self, title: &str) {
if let Some(ref mut self_title) = self.title {
self_title.clear();
self_title.push_str(title);
} else {
self.title = Some(title.into());
}
}
pub fn set_copyright(&mut... | authors: Vec<String>,
pub description: Description,
#[cfg_attr(
feature = "serialize",
serde(default = "crate::defaults::boolean_true")
)]
pub require_license_acceptance: bool,
pub documentation_url: Option<Url>,
pub issues_url: Option<Url>,
#[cfg_at... | random | [
{
"content": "#[cfg(feature = \"chocolatey\")]\n\npub fn boolean_true() -> bool {\n\n true\n\n}\n\n\n",
"file_path": "aer_data/src/defaults.rs",
"rank": 0,
"score": 93514.10413531325
},
{
"content": "pub trait FixVersion {\n\n fn is_fix_version(&self) -> bool;\n\n fn add_fix(&mut se... |
Rust | src/librustdoc/html/highlight.rs | Kroisse/rust | 5716abe3f019ab7d9c8cdde9879332040191cf88 |
use std::str;
use std::io;
use syntax::parse;
use syntax::parse::lexer;
use syntax::codemap::{BytePos, Span};
use html::escape::Escape;
use t = syntax::parse::token;
pub fn highlight(src: &str, class: Option<&str>, id: Option<&str>) -> String {
debug!("highlighting: ================\n{}\n==============", src)... |
use std::str;
use std::io;
use syntax::parse;
use syntax::parse::lexer;
use syntax::codemap::{BytePos, Span};
use html::escape::Escape;
use t = syntax::parse::token;
pub fn highlight(src: &str, class: Option<&str>, id: Option<&str>) -> String {
debug!("highlighting: ================\n{}\n==============", src)... | 2",
t::NOT if is_macro => { is_macro = false; "macro" }
t::EQ | t::LT | t::LE | t::EQEQ | t::NE | t::GE | t::GT |
t::ANDAND | t::OROR | t::NOT | t::BINOP(..) | t::RARROW |
t::BINOPEQ(..) | t::FAT_ARROW => "op",
... | function_block-function_prefixed | [
{
"content": "pub fn main() { loop { int_id(break); } }\n",
"file_path": "src/test/run-pass/break-value.rs",
"rank": 1,
"score": 533837.206130467
},
{
"content": "/// Run any tests/code examples in the markdown file `input`.\n\npub fn test(input: &str, libs: HashSet<Path>, mut test_args: Vec... | |
Rust | dao_vault/lib.rs | RainbowDAO/RainbowDAO-Protocol-Ink-Test-Version-05 | b17ecb5c37c868ca99a23e36957ac9e012474c29 | #![cfg_attr(not(feature = "std"), no_std)]
use ink_lang as ink;
extern crate alloc;
pub use self::dao_vault::DaoVault;
#[ink::contract]
mod dao_vault {
use alloc::string::String;
use alloc::vec::Vec;
use erc20::Erc20;
use ink_storage::{
collections::HashMap as StorageHashMap,
traits::{P... | #![cfg_attr(not(feature = "std"), no_std)]
use ink_lang as ink;
extern crate alloc;
pub use self::dao_vault::DaoVault;
#[ink::contract]
mod dao_vault {
use alloc::string::String;
use alloc::vec::Vec;
use erc20::Erc20;
use ink_storage::{
collections::HashMap as StorageHashMap,
traits::{P... |
#[ink(message)]
pub fn withdraw(&mut self,erc_20_address:AccountId,to_address:AccountId,value:u64) -> bool {
let from_address = self.vault_contract_address;
if self.tokens.contains_key(&erc_20_address) {
let mut erc_20 = self.get_erc20_by_address(erc_20_address)... | e(),
from_address:from_address,
value:value});
true
} else{
false
}
} | function_block-function_prefixed | [
{
"content": " }\n\n\n\n /// The ERC-20 error types.\n\n #[derive(Debug, PartialEq, Eq, scale::Encode, scale::Decode)]\n\n #[cfg_attr(feature = \"std\", derive(scale_info::TypeInfo))]\n\n pub enum Error {\n\n /// Returned if not enough balance to fulfill a request is available.\n\n ... |
Rust | crates/tm4c129x/src/pwm0/sync.rs | m-labs/ti2svd | 30145706b658136c35c90290701de3f02a4b8ef2 | #[doc = "Reader of register SYNC"]
pub type R = crate::R<u32, super::SYNC>;
#[doc = "Writer for register SYNC"]
pub type W = crate::W<u32, super::SYNC>;
#[doc = "Register SYNC `reset()`'s with value 0"]
impl crate::ResetValue for super::SYNC {
type Type = u32;
#[inline(always)]
fn reset_value() -> Self::Typ... | #[doc = "Reader of register SYNC"]
pub type R = crate::R<u32, super::SYNC>;
#[doc = "Writer for register SYNC"]
pub type W = crate::W<u32, super::SYNC>;
#[doc = "Register SYNC `reset()`'s with value 0"]
impl crate::ResetValue for super::SYNC {
type Type = u32;
#[inline(always)]
fn reset_value() -> Self::Typ... | )]
pub fn sync1(&mut self) -> SYNC1_W {
SYNC1_W { w: self }
}
#[doc = "Bit 2 - Reset Generator 2 Counter"]
#[inline(always)]
pub fn sync2(&mut self) -> SYNC2_W {
SYNC2_W { w: self }
}
#[doc = "Bit 3 - Reset Generator 3 Counter"]
#[inline(always)]
pub fn sync3(&mut sel... | as u32) & 0x01) << 2);
self.w
}
}
#[doc = "Reader of field `SYNC3`"]
pub type SYNC3_R = crate::R<bool, bool>;
#[doc = "Write proxy for field `SYNC3`"]
pub struct SYNC3_W<'a> {
w: &'a mut W,
}
impl<'a> SYNC3_W<'a> {
#[doc = r"Sets the field bit"]
#[inline(always)]
pub fn set_bit(self) -> &'a ... | 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 | benches/xml.rs | sahwar/roxmltree | fb3315cee821a370c6f90f33f3e65072dc735848 | #![allow(dead_code)]
#[macro_use]
extern crate bencher;
extern crate roxmltree;
extern crate xmlparser;
extern crate xmltree;
extern crate sxd_document;
extern crate elementtree;
extern crate treexml;
extern crate xml;
use std::fs;
use std::env;
use std::io::Read;
use bencher::Bencher;
fn load_string(path: &str) -... | #![allow(dead_code)]
#[macro_use]
extern crate bencher;
extern crate roxmltree;
extern crate xmlparser;
extern crate xmltree;
extern crate sxd_document;
extern crate elementtree;
extern crate treexml;
extern crate xml;
use std::fs;
use std::env;
use std::io::Read;
use bencher::Bencher;
fn load_string(path: &str) -... |
fn large_xmlrs(bencher: &mut Bencher) {
let text = load_string("large.plist");
bencher.iter(|| {
for event in xml::EventReader::new(text.as_bytes()) {
let _ = event.unwrap();
}
})
}
fn tiny_roxmltree(bencher: &mut Bencher) {
let text = load_string("fonts.conf");
benche... | bencher.iter(|| {
for event in xml::EventReader::new(text.as_bytes()) {
let _ = event.unwrap();
}
})
} | function_block-function_prefixed | [
{
"content": "fn load_file(path: &str) -> String {\n\n let mut file = fs::File::open(&path).unwrap();\n\n let mut text = String::new();\n\n file.read_to_string(&mut text).unwrap();\n\n text\n\n}\n",
"file_path": "examples/ast.rs",
"rank": 1,
"score": 190922.63934523566
},
{
"cont... |
Rust | amethyst_core/src/hide_system.rs | csh/amethyst | 68aa4eaadd56c40de6f91d1148affbe3c2381128 | use crate::{
ecs::prelude::{
BitSet, ComponentEvent, ReadExpect, ReadStorage, ReaderId, System, SystemData, World,
WriteStorage,
},
transform::components::{HierarchyEvent, Parent, ParentHierarchy},
SystemDesc,
};
#[cfg(feature = "profiler")]
use thread_profiler::profile_scope;
use log:... | use crate::{
ecs::prelude::{
BitSet, ComponentEvent, ReadExpect, ReadStorage, ReaderId, System, SystemData, World,
WriteStorage,
},
transform::components::{HierarchyEvent, Parent, ParentHierarchy},
SystemDesc,
};
#[cfg(feature = "profiler")]
use thread_profiler::profile_scope;
use log:... |
}
| fn run(&mut self, (mut hidden, parents, hierarchy): Self::SystemData) {
#[cfg(feature = "profiler")]
profile_scope!("hide_hierarchy_system");
self.marked_as_modified.clear();
self.manually_hidden.clear();
let self_hidden_events_id = &mut self.hidden_events_id;
... | function_block-full_function | [
{
"content": "fn create_default_mat<B: Backend>(world: &mut World) -> Material {\n\n use crate::mtl::TextureOffset;\n\n\n\n use amethyst_assets::Loader;\n\n\n\n let loader = world.fetch::<Loader>();\n\n\n\n let albedo = load_from_srgba(Srgba::new(0.5, 0.5, 0.5, 1.0));\n\n let emission = load_from... |
Rust | src/connectivity/network/testing/netemul/runner/test/netstack_intermediary/src/main.rs | yanyushr/fuchsia | 98e70672a81a206d235503e398f37b7b65581f79 |
#![feature(async_await, await_macro, futures_api)]
use {
ethernet,
failure::{bail, format_err, Error, ResultExt},
fidl_fuchsia_hardware_ethernet::{DeviceMarker, DeviceProxy},
fidl_fuchsia_hardware_ethertap::{
TapControlMarker, TapDeviceEvent, TapDeviceMarker, TapDeviceProxy,
},
fidl_f... |
#![feature(async_await, await_macro, futures_api)]
use {
ethernet,
failure::{bail, format_err, Error, ResultExt},
fidl_fuchsia_hardware_ethernet::{DeviceMarker, DeviceProxy},
fidl_fuchsia_hardware_ethertap::{
TapControlMarker, TapDeviceEvent, TapDeviceMarker, TapDeviceProxy,
},
fidl_f... | o_string.clone().into_bytes().drain(0..))?;
println!("To Server: {}", echo_string);
let mut tap_events = tap.take_event_stream();
while let Some(event) = await!(tap_events.try_next())? {
match event {
TapDeviceEvent::OnFrame { data } => {
let server_string = str::from_u... |
let eth_marker =
fidl::endpoints::ClientEnd::new(eth_device.into_channel().unwrap().into_zx_channel());
let netstack = client::connect_to_service::<NetstackMarker>()?;
let ip_addr_config = IpAddressConfig::Dhcp(true);
let mut cfg = InterfaceConfig {
name: "eth-test".to_string(),
... | random | [] |
Rust | crate2nix/src/prefetch.rs | alyssais/crate2nix | 049897e466ff326945a17303ed4585868cc65b35 |
use std::io::Write;
use std::process::Command;
use crate::resolve::{CrateDerivation, CratesIoSource, GitSource, ResolvedSource};
use crate::GenerateConfig;
use cargo_metadata::PackageId;
use failure::bail;
use failure::format_err;
use failure::Error;
use serde::Deserialize;
use std::collections::{BTreeMap, HashMap};... |
use std::io::Write;
use std::process::Command;
use crate::resolve::{CrateDerivation, CratesIoSource, GitSource, ResolvedSource};
use crate::GenerateConfig;
use cargo_metadata::PackageId;
use failure::bail;
use failure::format_err;
use failure::Error;
use serde::Deserialize;
use std::collections::{BTreeMap, HashMap};... |
if let Some(r#ref) = self.r#ref.as_ref() {
args.extend_from_slice(&["--branch-name", r#ref]);
}
let json = get_command_output("nix-prefetch-git", &args)?;
let prefetch_info: NixPrefetchGitInfo = serde_json::from_str(&json)?;
Ok(prefetch_i... | let mut args = vec![
"--url",
self.url.as_str(),
"--fetch-submodules",
"--rev",
&self.rev,
]; | assignment_statement | [
{
"content": "/// Run the command at the given path without arguments and capture the output in the return value.\n\npub fn run_cmd(cmd_path: impl AsRef<Path>) -> Result<String, Error> {\n\n let cmd_path = cmd_path.as_ref().to_string_lossy().to_string();\n\n let output = Command::new(&cmd_path)\n\n ... |
Rust | sdk/src/permissions.rs | target/grid | e8efd7f0109dadc89f4b1ab5d57b09aa2d87eb26 |
use std::error::Error;
use std::fmt;
cfg_if! {
if #[cfg(target_arch = "wasm32")] {
use sabre_sdk::WasmSdkError as ContextError;
use sabre_sdk::TransactionContext;
} else {
use sawtooth_sdk::processor::handler::ContextError;
use sawtooth_sdk::processor::handler::TransactionCont... |
use std::error::Error;
use std::fmt;
cfg_if! {
if #[cfg(target_arch = "wasm32")] {
use sabre_sdk::WasmSdkError as ContextError;
use sabre_sdk::TransactionContext;
} else {
use sawtooth_sdk::processor::handler::ContextError;
use sawtooth_sdk::processor::handler::TransactionCont... | ntextError),
InvalidPublicKey(String),
ProtoConversion(ProtoConversionError),
}
impl fmt::Display for PermissionCheckerError {
fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {
match *self {
PermissionCheckerError::Context(ref e) => e.fmt(f),
PermissionChecker... | ate::protocol::pike::state::{Agent, AgentList};
use crate::protos::{FromBytes, ProtoConversionError};
#[derive(Debug)]
pub enum PermissionCheckerError {
Context(Co | random | [
{
"content": "cfg_if! {\n\n if #[cfg(target_arch = \"wasm32\")] {\n\n #[macro_use]\n\n extern crate sabre_sdk;\n\n } else {\n\n #[macro_use]\n\n extern crate clap;\n\n #[macro_use]\n\n extern crate log;\n\n extern crate sawtooth_sdk;\n\n extern crate... |
Rust | thavalon-server/src/database/games/db_game.rs | theadd336/ThavalonWeb | cf5e9f80270cdab3d4d2d25fa8bc35748aa18f92 |
use crate::database::get_database;
use crate::utils;
use std::collections::{HashMap, HashSet};
use chrono::Utc;
use mongodb::{
bson::{self, doc, oid::ObjectId, Document},
Collection,
};
use serde::{Deserialize, Serialize};
use thiserror::Error;
const GAME_COLLECTION: &str = "thavalon_games";
const FRIEND_CO... |
use crate::database::get_database;
use crate::utils;
use std::collections::{HashMap, HashSet};
use chrono::Utc;
use mongodb::{
bson::{self, doc, oid::ObjectId, Document},
Collection,
};
use serde::{Deserialize, Serialize};
use thiserror::Error;
const GAME_COLLECTION: &str = "thavalon_games";
const FRIEND_CO... |
pub async fn end_game(&mut self) -> Result<(), DBGameError> {
self.friend_code.clear();
self.end_time = Some(Utc::now().timestamp());
self.status = DBGameStatus::Finished;
let update_doc = doc! {
"$set": {
"frie... | pub async fn start_game(&mut self) -> Result<(), DBGameError> {
log::info!("Starting DB game {}.", self._id);
self.start_time = Some(Utc::now().timestamp());
self.status = DBGameStatus::InProgress;
let update_doc = doc! {
"$set": {
"start_time": bson... | function_block-full_function | [
{
"content": "/// Generate an [`Effect`] that sends an error reply to the player.\n\nfn player_error<S: Into<String>>(message: S) -> Effect {\n\n Effect::Reply(Message::Error(message.into()))\n\n}\n",
"file_path": "thavalon-server/src/game/state.rs",
"rank": 0,
"score": 213652.85552980838
},
... |
Rust | src/mevdb.rs | sambacha/mev-inspect-rs | 9d111bf50910f188c3ee66624d5b25b41757c0e1 | use crate::types::Evaluation;
use ethers::types::{TxHash, U256};
use rust_decimal::prelude::*;
use thiserror::Error;
use tokio_postgres::{config::Config, Client, NoTls};
pub struct MevDB<'a> {
client: Client,
table_name: &'a str,
overwrite: String,
}
impl<'a> MevDB<'a> {
pub async fn connect(cfg:... | use crate::types::Evaluation;
use ethers::types::{TxHash, U256};
use rust_decimal::prelude::*;
use thiserror::Error;
use tokio_postgres::{config::Config, Client, NoTls};
pub struct MevDB<'a> {
client: Client,
table_name: &'a str,
overwrite: String,
}
impl<'a> MevDB<'a> {
pub async fn connect(cfg:... |
pub async fn exists(&mut self, hash: TxHash) -> Result<bool, DbError> {
let rows = self
.client
.query(
format!("SELECT hash FROM {} WHERE hash = $1", self.table_name).as_str(),
&[&format!("{:?}", hash)],
)
.await?;
... | contract,
proxy_impl
) VALUES ($1, $2, $3, $4, $5, $6, $7, $8, $9, $10, $11)
{}",
self.table_name, self.overwrite,
)
.as_str(),
&[
&format!("{:?}", evaluation.inspectio... | function_block-function_prefix_line | [
{
"content": "pub fn get_trace(hash: &str) -> Inspection {\n\n let hash = if hash.starts_with(\"0x\") {\n\n &hash[2..]\n\n } else {\n\n hash\n\n };\n\n\n\n TraceWrapper(\n\n TRACES\n\n .iter()\n\n .filter(|t| t.transaction_hash == Some(hash.parse::<TxHash>(... |
Rust | src/impls/primitive.rs | JuanPotato/deku | 09427b8eb5e39402c4dec49070e9ae0a5ecbe20d | use crate::{ctx::*, DekuError, DekuRead, DekuWrite};
use bitvec::prelude::*;
use core::convert::TryInto;
#[cfg(feature = "alloc")]
use alloc::format;
macro_rules! ImplDekuTraits {
($typ:ty) => {
impl DekuRead<'_, (Endian, Size)> for $typ {
fn read(
input: &BitSlice<u8, Msb0>,
... | use crate::{ctx::*, DekuError, DekuRead, DekuWrite};
use bitvec::prelude::*;
use core::convert::TryInto;
#[cfg(feature = "alloc")]
use alloc::format;
macro_rules! ImplDekuTraits {
($typ:ty) => {
impl DekuRead<'_, (Endian, Size)> for $typ {
fn read(
input: &BitSlice<u8, Msb0>,
... | 3F, 0x01, 0xEF],
native_endian!(-0x10FEC0FE_i32)
);
TestPrimitive!(
test_i64,
i64,
vec![0x02u8, 0x3F, 0x01, 0xEF, 0x01, 0x3F, 0x01, 0xEF],
native_endian!(-0x10FEC0FE10FEC0FE_i64)
);
TestPrimitive!(
test_i128,
i128,
vec![
0x02u8,... | ice.len() == max_type_bits
&& bit_slice.domain().region().unwrap().1.len() * 8 == max_type_bits
{
let bytes: &[u8] = bit_slice.domain().region().unwrap().1;
if input_is_le {
<$... | random | [
{
"content": "fn emit_magic_read(input: &DekuData) -> TokenStream {\n\n let crate_ = super::get_crate_name();\n\n if let Some(magic) = &input.magic {\n\n quote! {\n\n let __deku_magic = #magic;\n\n\n\n for __deku_byte in __deku_magic {\n\n let (__deku_new_rest, ... |
Rust | src/main.rs | pmalmgren/pongbrickbreaker | 708bee1059243ea43af39418dac04eeca8034275 | use ncurses::CURSOR_VISIBILITY::CURSOR_INVISIBLE;
use ncurses::*;
use std::char;
use std::process;
use std::{thread, time};
use std::cmp;
use std::time::{SystemTime, UNIX_EPOCH};
use std::convert::TryFrom;
const PADDLE_WIDTH: i32 = 12;
const NUM_ROWS: i32 = 4;
const BRICKS_PER_ROW: i32 = 6;
enum Direction {
Left,... | use ncurses::CURSOR_VISIBILITY::CURSOR_INVISIBLE;
use ncurses::*;
use std::char;
use std::process;
use std::{thread, time};
use std::cmp;
use std::time::{SystemTime, UNIX_EPOCH};
use std::convert::TryFrom;
const PADDLE_WIDTH: i32 = 12;
const NUM_ROWS: i32 = 4;
const BRICKS_PER_ROW: i32 = 6;
enum Direction {
Left,... | ;
match y_collision {
Some(MoveResult::HitPaddleCenter) => {
self.vel.y = -self.vel.y;
self.vel.x = 0;
},
Some(MoveResult::HitPaddleLeft) => {
self.vel.x = -1;
self.vel.y = -self.vel.y;
},
... | match self.vel.y {
y if y > 0 => self.move1(Direction::Down, screen_bounds, paddle_bounds, brick_bounds),
y if y < 0 => self.move1(Direction::Up, screen_bounds, paddle_bounds, brick_bounds),
_ => None,
} | if_condition | [
{
"content": "# Pong Brick Breaker Game\n\n\n\nA console pong brick breaker game written with Rust and ncurses.\n\n\n\n`a` moves the paddle to the left, `d` moves the paddle to the right.\n\n\n\n## Requirements\n\n\n\nYou'll need [Rust](https://www.rust-lang.org/tools/install) and ncurses to play. Once you have... |
Rust | host/src/route/chain.rs | manasrivastava/tinychain | e6082f587ac089307ca9264d90d20c3f0991da52 | use log::debug;
use safecast::TryCastFrom;
use tc_error::*;
use tc_transact::fs::File;
use tc_transact::Transaction;
use tc_value::Value;
use tcgeneric::{Instance, PathSegment, TCPath};
use crate::chain::{Chain, ChainInstance, ChainType, Subject, SUBJECT};
use super::{DeleteHandler, GetHandler, Handler, PostHandler,... | use log::debug;
use safecast::TryCastFrom;
use tc_error::*;
use tc_transact::fs::File;
use tc_transact::Transaction;
use tc_value::Value;
use tcgeneric::{Instance, PathSegment, TCPath};
use crate::chain::{Chain, ChainInstance, ChainType, Subject, SUBJECT};
use super::{DeleteHandler, GetHandler, Handler, PostHandler,... | > From<&'a Chain> for ChainHandler<'a> {
fn from(chain: &'a Chain) -> Self {
Self { chain }
}
}
impl<'a> Handler<'a> for ChainHandler<'a> {
fn get<'b>(self: Box<Self>) -> Option<GetHandler<'a, 'b>>
where
'b: 'a,
{
Some(Box::new(|_txn, key| {
Box::pin(async move {... | nc move {
debug!("Chain::delete {}", key);
self.chain
.append_delete(*txn.id(), self.path.to_vec().into(), key.clone())
.await?;
delete_handler(txn, key).await
})
... | random | [
{
"content": "fn route<'a, T>(tensor: &'a T, path: &'a [PathSegment]) -> Option<Box<dyn Handler<'a> + 'a>>\n\nwhere\n\n T: TensorAccess\n\n + TensorIO<fs::Dir, Txn = Txn>\n\n + TensorCompare<Tensor, Compare = Tensor, Dense = Tensor>\n\n + TensorBoolean<Tensor, Combine = Tensor>\n\n ... |
Rust | src/block_ciphers.rs | dkull/cryptopals | 8d6b723b2c7f7905755804631a2bdda4c6b2005e | use crate::xor_arrays;
use aes::Aes128;
use std::collections::VecDeque;
#[derive(PartialEq, Clone, Copy, Debug)]
pub enum AESBlockMode {
ECB,
CBC,
CTR,
}
fn ctr_input(nonce: Option<[u8; 8]>, n: usize) -> [u8; 16] {
let nonce = if let Some(n) = nonce { n } else { [0u8; 8] };
let counter = &(n as u... | use crate::xor_arrays;
use aes::Aes128;
use std::collections::VecDeque;
#[derive(PartialEq, Clone, Copy, Debug)]
pub enum AESBlockMode {
ECB,
CBC,
CTR,
}
fn ctr_input(nonce: Option<[u8; 8]>, n: usize) -> [u8; 16] {
let nonce = if let Some(n) = nonce { n } else { [0u8; 8] };
let counter = &(n as u... |
pub fn pkcs7_padding_strip(data: &mut Vec<u8>) -> bool {
let padding = data[data.len() - 1];
if padding as usize > data.len() {
return false;
}
if padding == 0 {
return false;
}
let padding_start = data.len() - padding as usize;
for p in padding_start..data.len() {
... | fn pkcs7_padding_works() {
let mut case1 = (vec![0x00, 0xff, 0x01], vec![0x00, 0xff], 3);
pkcs7_padding(&mut case1.1, case1.2);
assert_eq!(case1.0, case1.1);
let mut case2 = (
vec![0x00, 0xff, 0x01, 0x00, 0xff, 0x01, 0x02, 0x02],
vec![0x00, 0xff, 0x01, 0x00, 0xff, 0x01],
8,
... | function_block-full_function | [
{
"content": "pub fn xor_arrays(a: &[u8], b: &[u8]) -> Vec<u8> {\n\n assert!(a.len() >= b.len(), format!(\"{} vs {}\", a.len(), b.len()));\n\n a.to_vec()\n\n .iter()\n\n .zip(b.to_vec().iter().cycle())\n\n .map(|(a, b)| a ^ b)\n\n .collect()\n\n}\n\n\n",
"file_path": "src/l... |
Rust | sigma-tree/src/sigma_protocol.rs | robkorn/sigma-rust | 3aa25d62a2b6f6b071b5b89607d0688e5509a9a6 |
#![allow(dead_code)]
#![allow(unused_variables)]
#![allow(missing_docs)]
pub mod dlog_group;
pub mod dlog_protocol;
pub mod prover;
pub mod verifier;
use k256::arithmetic::Scalar;
use crate::{big_integer::BigInteger, serialization::op_code::OpCode};
use blake2::digest::{Update, VariableOutput};
use blake2::VarBlak... |
#![allow(dead_code)]
#![allow(unused_variables)]
#![allow(missing_docs)]
pub mod dlog_group;
pub mod dlog_protocol;
pub mod prover;
pub mod verifier;
use k256::arithmetic::Scalar;
use crate::{big_integer::BigInteger, serialization::op_code::OpCode};
use blake2::digest::{Update, VariableOutput};
use blake2::VarBlak... |
#[cfg(test)]
mod tests {
use super::*;
use proptest::prelude::*;
impl Arbitrary for ProveDlog {
type Parameters = ();
type Strategy = BoxedStrategy<Self>;
fn arbitrary_with(_args: Self::Parameters) -> Self::Strategy {
(any::<EcPoint>()).prop_map(ProveDlog::new).boxed(... | p();
hasher.update(input);
let hash = hasher.finalize_boxed();
FiatShamirHash(hash.try_into().unwrap())
} | function_block-function_prefixed | [
{
"content": "/// Creates a random scalar, a big-endian integer in the range [0, n), where n is group order\n\npub fn random_scalar_in_group_range() -> Scalar {\n\n loop {\n\n // Generate a new secret key using the operating system's\n\n // cryptographically secure random number generator\n\n ... |
Rust | src/lib.rs | load1n9/neko | addb9c2b2e911e33f2926230677c2d90b3b43de0 |
extern crate minifb;
use std::cell::RefCell;
use std::collections::HashMap;
use minifb::Key;
use minifb::Window;
use minifb::WindowOptions;
use minifb::MouseMode;
use minifb::MouseButton;
pub static SUCCESS: u32 = 0;
pub static ERR_WINDOW_NOT_FOUND: u32 = 2;
pub static ERR_UPDATE_WITH_BUFFER_FAILED: u32 = 3;
thread... |
extern crate minifb;
use std::cell::RefCell;
use std::collections::HashMap;
use minifb::Key;
use minifb::Window;
use minifb::WindowOptions;
use minifb::MouseMode;
use minifb::MouseButton;
pub static SUCCESS: u32 = 0;
pub static ERR_WINDOW_NOT_FOUND: u32 = 2;
pub static ERR_UPDATE_WITH_BUFFER_FAILED: u32 = 3;
thread... |
#[no_mangle]
pub extern "C" fn window_is_active(id: u32) -> u32 {
WINDOWS.with(|map| {
let mut map = map.borrow_mut();
if let Some(window) = map.get_mut(&id) {
if window.is_active() {
1
} else {
0
}
} else {
ER... | pub extern "C" fn window_is_open(id: u32) -> u32 {
WINDOWS.with(|map| {
let map = map.borrow();
if let Some(window) = map.get(&id) {
if window.is_open() {
1
} else {
0
}
} else {
ERR_WINDOW_NOT_FOUND
}
... | function_block-full_function | [
{
"content": "const width = 800;\n",
"file_path": "examples/test.ts",
"rank": 2,
"score": 55611.0160243587
},
{
"content": "const height = 600;\n",
"file_path": "examples/test.ts",
"rank": 3,
"score": 55611.0160243587
},
{
"content": "const H = 300;\n",
"file_path": "... |
Rust | applications/swap/src/lib.rs | jacob-earle/Theseus | d53038328d1a39c69ffff6e32226394e8c957e33 |
#![no_std]
#![feature(slice_concat_ext)]
#[macro_use] extern crate alloc;
#[macro_use] extern crate terminal_print;
extern crate itertools;
extern crate getopts;
extern crate memory;
extern crate mod_mgmt;
extern crate crate_swap;
extern crate hpet;
extern crate task;
extern crate path;
extern crate fs_node;
use a... |
#![no_std]
#![feature(slice_concat_ext)]
#[macro_use] extern crate alloc;
#[macro_use] extern crate terminal_print;
extern crate itertools;
extern crate getopts;
extern crate memory;
extern crate mod_mgmt;
extern crate crate_swap;
extern crate hpet;
extern crate task;
extern crate path;
extern crate fs_node;
use a... | ace = task::get_my_current_task().ok_or("Couldn't get current task")?.get_namespace();
let swap_requests = {
let mut requests: Vec<SwapRequest> = Vec::with_capacity(tuples.len());
for (old_crate_name, new_crate_str, reexport) in tuples {
let (into... | v.push((o, n, reexport_bool));
}
_ => return Err("list of crate tuples is formatted incorrectly.".to_string()),
}
}
if v.is_empty() {
Err("no crate tuples specified.".to_string())
}
else {
Ok(v)
}
}
fn do_swap(
tuples: Vec<(&str, &str, bool)>... | random | [
{
"content": "/// Spawns a new userspace task based on the provided `path`, which must point to an ELF executable file with a defined entry point.\n\n/// Optionally, provide a `name` for the new Task. If none is provided, the name is based on the given `Path`.\n\npub fn spawn_userspace(path: Path, name: Option<... |
Rust | src/de/value.rs | Mingun/serde-gff | 2bfacbb0b6b361da749082f99edaec474ccc6c7c |
use std::collections::HashMap;
use std::fmt;
use std::marker::PhantomData;
use indexmap::IndexMap;
use serde::forward_to_deserialize_any;
use serde::de::{Deserialize, Deserializer, Error, IntoDeserializer, SeqAccess, MapAccess, Visitor};
use crate::Label;
use crate::string::{GffString, StringKey};
use crate::value::... |
use std::collections::HashMap;
use std::fmt;
use std::marker::PhantomData;
use indexmap::IndexMap;
use serde::forward_to_deserialize_any;
use serde::de::{Deserialize, Deserializer, Error, IntoDeserializer, SeqAccess, MapAccess, Visitor};
use crate::Label;
use crate::string::{GffString, StringKey};
use crate::value::... |
}
impl<'de> Deserialize<'de> for Label {
#[inline]
fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where D: Deserializer<'de>,
{
deserializer.deserialize_any(LabelVisitor)
}
}
#[derive(Debug)]
pub struct LabelDeserializer<E> {
value: Label,
marker: PhantomData<E>,
}
impl<'de, E... | 8]) -> Result<Label, E>
where E: Error,
{
use crate::error::Error::TooLongLabel;
match Label::from_bytes(value) {
Ok(label) => Ok(label),
Err(TooLongLabel(len)) => Err(E::invalid_length(len, &self)),
Err(err) => Err(E::custom(err)),
}
} | function_block-function_prefixed | [
{
"content": "/// Десериализатор для чтения идентификаторов полей\n\nstruct Field<'a, R: 'a + Read + Seek>(&'a mut Deserializer<R>);\n\n\n\nimpl<'de, 'a, R: 'a + Read + Seek> de::Deserializer<'de> for Field<'a, R> {\n\n type Error = Error;\n\n\n\n #[inline]\n\n fn is_human_readable(&self) -> bool { false }\n... |
Rust | src/intrinsics_orthographic.rs | strawlab/cam-geom | 0d160e2510d4f0df7af1123d51cf1518c7a58070 | use nalgebra::{
allocator::Allocator,
base::storage::{Owned, Storage},
convert, DefaultAllocator, Dim, OMatrix, RealField, U2, U3,
};
#[cfg(feature = "serde-serialize")]
use serde::{Deserialize, Serialize};
use crate::{
coordinate_system::CameraFrame, Bundle, IntrinsicParameters, Pixels, Points, RayBu... | use nalgebra::{
allocator::Allocator,
base::storage::{Owned, Storage},
convert, DefaultAllocator, Dim, OMatrix, RealField, U2, U3,
};
#[cfg(feature = "serde-serialize")]
use serde::{Deserialize, Serialize};
use crate::{
coordinate_system::CameraFrame, Bundle, IntrinsicParameters, Pixels, Points, RayBu... |
#[test]
#[cfg(feature = "serde-serialize")]
fn test_serde() {
let params = OrthographicParams {
sx: 100.0,
sy: 102.0,
cx: 321.0,
cy: 239.9,
};
let expected: IntrinsicParametersOrthographic<_> = params.into();
let buf = serde_... | fn roundtrip() {
let params = OrthographicParams {
sx: 100.0,
sy: 102.0,
cx: 321.0,
cy: 239.9,
};
let cam: IntrinsicParametersOrthographic<_> = params.into();
roundtrip_intrinsics(&cam, 640, 480, 5, 0, nalgebra::convert(1e-10));
l... | function_block-full_function | [
{
"content": "#[cfg(test)]\n\npub fn roundtrip_camera<R, I>(\n\n cam: Camera<R, I>,\n\n width: usize,\n\n height: usize,\n\n step: usize,\n\n border: usize,\n\n eps: R,\n\n) where\n\n R: RealField,\n\n I: IntrinsicParameters<R>,\n\n I::BundleType: Bundle<R>,\n\n{\n\n let pixels = c... |
Rust | src/handler/description.rs | p0lunin/dptree | cf41f052a864e145ef600faf79a1dff186b5a905 |
use core::mem;
use std::{
collections::{hash_map::RandomState, HashSet},
hash::{BuildHasher, Hash},
};
pub trait HandlerDescription: Sized + Send + Sync + 'static {
fn entry() -> Self;
fn user_defined() -> Self;
fn merge_chain(&self, other: &Self) -> Self;
fn merge... |
use core::mem;
use std::{
collections::{hash_map::RandomState, HashSet},
hash::{BuildHasher, Hash},
};
pub trait HandlerDescription: Sized + Send + Sync + 'static {
fn entry() -> Self;
fn user_defined() -> Self;
fn merge_chain(&self, other: &Self) -> Self;
fn merge... |
fn merge_branch(&self, other: &Self) -> Self {
use EventKind::*;
match (self, other) {
(Entry, other) | (other, Entry) => other.clone(),
(InterestList(l), InterestList(r)) => {
let hasher = l.... | d::*;
match (self, other) {
(Entry, other) | (other, Entry) => other.clone(),
(InterestList(l), InterestList(r)) => {
let hasher = l.hasher().clone();
let mut res = HashSet::with_hasher(hash... | function_block-function_prefixed | [
{
"content": "#[must_use]\n\n#[track_caller]\n\npub fn filter_map<'a, Projection, Input, Output, NewType, Args, Descr>(\n\n proj: Projection,\n\n) -> Handler<'a, Input, Output, Descr>\n\nwhere\n\n Input: Clone,\n\n Asyncify<Projection>: Injectable<Input, Option<NewType>, Args> + Send + Sync + 'a,\n\n ... |
Rust | src/init/init_game_data.rs | Noah2610/LD48 | 433d248beef1b7a4dd99116d48348bef66bdd301 | use crate::resource;
use crate::resources::prelude::*;
use crate::settings::Settings;
use crate::states::aliases::{CustomData, GameDataBuilder};
use amethyst::prelude::Config;
use amethyst::window::DisplayConfig;
use deathframe::amethyst;
pub(super) fn build_game_data<'a, 'b>(
settings: &Settings,
) -> amethyst::R... | use crate::resource;
use crate::resources::prelude::*;
use crate::settings::Settings;
use crate::states::aliases::{CustomData, GameDataBuilder};
use amethyst::prelude::Config;
use amethyst::window::DisplayConfig;
use deathframe::amethyst;
pub(super) fn build_game_data<'a, 'b>(
settings: &Settings,
) -> amethyst::R... |
fn get_display_config() -> amethyst::Result<DisplayConfig> {
#[cfg(not(feature = "dev"))]
let display_config = DisplayConfig::load(resource("config/display.ron"))?;
#[cfg(feature = "dev")]
let display_config = {
let mut config = DisplayConfig::load(resource("config/display.ron"))?;
con... | with(
DispatcherId::ZoneSelect,
UpdateHighscoreUi::default(),
"zone_select_update_highscore_ui_system",
&[],
)?
.with(
DispatcherId::GameOver,
UpdateRotate::default(),
"game_over_update_rotate_system",
&[],
... | function_block-function_prefix_line | [
{
"content": "/// Merge `Vec` of settings `T` together.\n\n/// Returns `None` if given `Vec` is empty.\n\nfn merge_settings<T>(all_settings: Vec<T>) -> Option<T>\n\nwhere\n\n T: Merge,\n\n{\n\n let mut merged_settings: Option<T> = None;\n\n for settings in all_settings {\n\n if let Some(merged) ... |
Rust | src/fixes.rs | utter-step/dotenv-linter | 6005dbcb2ea3de0f233f218bf91d8373813b589e | use crate::common::*;
mod ending_blank_line;
mod key_without_value;
mod lowercase_key;
mod quote_character;
mod space_character;
mod trailing_whitespace;
trait Fix {
fn name(&self) -> &str;
fn fix_warnings(
&self,
warnings: Vec<&mut Warning>,
lines: &mut Vec<LineEntry>,
) -> Optio... | use crate::common::*;
mod ending_blank_line;
mod key_without_value;
mod lowercase_key;
mod quote_character;
mod space_character;
mod trailing_whitespace;
trait Fix {
fn name(&self) -> &str;
fn fix_warnings(
&self,
warnings: Vec<&mut Warning>,
lines: &mut Vec<LineEntry>,
) -> Optio... |
}
| let fixer = TestFixer { name: "fixer" };
fixer.fix_warnings(vec![&mut warning], &mut lines);
assert!(!warning.is_fixed)
} | function_block-function_prefix_line | [
{
"content": "#[test]\n\nfn unfixed_warnings() {\n\n let testdir = TestDir::new();\n\n let testfile = testdir.create_testfile(\".env\", \"A=DEF\\nB=BAR \\nf=BAR\\n\\n\");\n\n\n\n let expected_output = String::from(\n\n \"Fixed warnings:\\n\\\n\n .env:2 TrailingWhitespace: Trailing whitesp... |
Rust | core/src/util.rs | kruton/SEGIMAP | 7e9e68fecd5e2ad22862ec02c5f1a2be9f35269b |
use regex::Regex;
use std::env::current_dir;
use std::fs;
use std::path::Path;
use std::path::PathBuf;
use walkdir::WalkDir;
use crate::folder::Folder;
#[macro_export]
macro_rules! path_filename_to_str(
($p:ident) => ({
use std::ffi::OsStr;
$p.file_name().unwrap_or_else(|| OsStr::new("")).to_str... |
use regex::Regex;
use std::env::current_dir;
use std::fs;
use std::path::Path;
use std::path::PathBuf;
use walkdir::WalkDir;
use crate::folder::Folder;
#[macro_export]
macro_rules! path_filename_to_str(
($p:ident) => ({
use std::ffi::OsStr;
$p.file_name().unwrap_or_else(|| OsStr::new("")).to_str... | r);
let mut flags = match fs::read_dir(&dir.join("cur")) {
Err(_) => "\\Noselect".to_string(),
_ => {
match fs::read_dir(&dir.join("new")) {
Err(_) => "\\Noselect".to_string(),
... | select_args: &[&str],
examine: bool,
tag: &str,
) -> (Option<Folder>, String) {
let err_res = (None, "".to_string());
if select_args.len() < 1 {
return err_res;
}
let mbox_name = select_args[0].trim_matches('"').replace("INBOX", ".");
let mut maildir_path = PathBuf::new();
maildi... | random | [
{
"content": "/// Parse and perform the store operation specified by `store_args`. Returns the\n\n/// response to the client or None if a BAD response should be sent back to\n\n/// the client\n\npub fn store(folder: &mut Folder, store_args: &[&str], seq_uid: bool, tag: &str) -> Option<String> {\n\n if store_... |
Rust | dbcrossbarlib/src/config.rs | drusellers/dbcrossbar | c16ed98771a7d18dbef861f88cc8403839c96936 |
use failure::Fail;
use std::{
env, fmt,
fs::{create_dir_all, File},
io::{self, Read},
path::{Path, PathBuf},
};
use toml_edit::{Array, Document, Item, Value};
use crate::common::*;
#[cfg(not(target_os = "macos"))]
fn system_config_dir() -> Option<PathBuf> {
dirs::config_dir()
}
#[cfg(target_os ... |
use failure::Fail;
use std::{
env, fmt,
fs::{create_dir_all, File},
io::{self, Read},
path::{Path, PathBuf},
};
use toml_edit::{Array, Document, Item, Value};
use crate::common::*;
#[cfg(not(target_os = "macos"))]
fn system_config_dir() -> Option<PathBuf> {
dirs::config_dir()
}
#[cfg(target_os ... | e value types don't match", key)
})?;
raw_array.fmt();
Ok(())
}
pub fn remove_from_string_array(
&mut self,
key: &Key<'_>,
value: &str,
) -> Result<()> {
let raw_array = self.raw_string_array_mut(key)?;
let mut indices = ve... | if raw_item.as_str() == Some(value) {
return Ok(());
}
}
raw_array.push(value).map_err(|_| {
format_err!("cannot append to {} becaus | function_block-random_span | [
{
"content": "/// Generate the `COPY ... FROM ...` SQL we'll pass to `copy_in`. `data_format`\n\n/// should be something like `\"CSV HRADER\"` or `\"BINARY\"`.\n\n///\n\n/// We have a separate function for generating this because we'll use it for\n\n/// multiple `COPY` statements.\n\nfn copy_from_sql(table: &Pg... |
Rust | src/prns.rs | Chris--B/comms-rs | 8b9278e698c4c817a77449f74fa5ffed3f5c5425 |
use crate::prelude::*;
extern crate num;
use num::PrimInt;
use std::mem::size_of;
pub struct PrnGen<T> {
poly_mask: T,
state: T,
}
impl<T: PrimInt> PrnGen<T> {
pub fn new(poly_mask: T, state: T) -> PrnGen<T> {
PrnGen { poly_mask, state }
}
... |
use crate::prelude::*;
extern crate num;
use num::PrimInt;
use std::mem::size_of;
pub struct PrnGen<T> {
poly_mask: T,
state: T,
}
impl<T: PrimInt> PrnGen<T> {
pub fn new(poly_mask: T, state: T) -> PrnGen<T> {
PrnGen { poly_mask, state }
}
... |
let fb_bit =
T::from((self.state & self.poly_mask).count_ones() % 2)
.unwrap();
let output = self.state >> (size_of::<T>() * 8 - 1);
self.state = self.state << 1;
self.state = self.state | fb_bit;
... | if self.statemap.contains_key(&self.state) {
println!("\nSize of <T>: {}", size_of::<T>());
println!("\n\nWrapped, size = {}!", self.statemap.len());
assert_eq!(self.statemap.len(), 255);
return None;
} else {
... | if_condition | [
{
"content": "/// Modulates a byte via BPSK into 8 int16 samples\n\npub fn bpsk_byte_mod(byte: u8) -> Vec<Complex<i16>> {\n\n (0..8)\n\n .map(|i| bpsk_bit_mod(((1_u8 << i) & byte).rotate_right(i)).unwrap())\n\n .collect()\n\n}\n\n\n",
"file_path": "src/modulation/digital.rs",
"rank": 0,... |
Rust | buildkit-llb/src/ops/fs/copy.rs | student-coin/dockerfile-plus | 559196e0838404d32fa2f1b81151124573a64898 | use std::collections::HashMap;
use std::fmt::Debug;
use std::path::{Path, PathBuf};
use buildkit_proto::pb;
use super::path::{LayerPath, UnsetPath};
use super::FileOperation;
use crate::serialization::{Context, Result};
use crate::utils::OutputIdx;
#[derive(Debug)]
pub struct CopyOperation<From: Debug, To: Debug> {... | use std::collections::HashMap;
use std::fmt::Debug;
use std::path::{Path, PathBuf};
use buildkit_proto::pb;
use super::path::{LayerPath, UnsetPath};
use super::FileOperation;
use crate::serialization::{Context, Result};
use crate::utils::OutputIdx;
#[derive(Debug)]
pub struct CopyOperation<From: Debug, To: Debug> {... | ion: self.description,
caps: self.caps,
}
}
}
impl<'a> OpWithSource<'a> {
pub fn to<P>(self, output: OutputIdx, destination: LayerPath<'a, P>) -> OpWithDestination<'a>
where
P: AsRef<Path>,
{
CopyOperation {
source: self.source,
destination: (... | tPath,
follow_symlinks: self.follow_symlinks,
recursive: self.recursive,
create_path: self.create_path,
wildcard: self.wildcard,
descript | function_block-random_span | [
{
"content": "pub fn from_env<T, I>(pairs: I) -> Result<T>\n\nwhere\n\n T: DeserializeOwned,\n\n I: IntoIterator<Item = (String, String)>,\n\n{\n\n let owned_pairs = pairs.into_iter().collect::<Vec<_>>();\n\n let pairs = {\n\n owned_pairs.iter().filter_map(|(name, value)| {\n\n if ... |
Rust | src/shared/binary_rate_limiter.rs | rnestler/cobalt-rs | cf8a23791d4c253c75635a6206e8eeeb3f3e1969 |
use std::cmp;
use std::time::{Duration, Instant};
use ::{Config, RateLimiter};
const MIN_GOOD_MODE_TIME_DELAY: u64 = 1000;
const MAX_GOOD_MODE_TIME_DELAY: u64 = 60000;
#[derive(Debug, PartialEq)]
enum Mode {
Good,
Bad
}
#[derive(Debug)]
pub struct BinaryRateLimiter {
tick: u32,
max_tick: u32,
... |
use std::cmp;
use std::time::{Duration, Instant};
use ::{Config, RateLimiter};
const MIN_GOOD_MODE_TIME_DELAY: u64 = 1000;
const MAX_GOOD_MODE_TIME_DELAY: u64 = 60000;
#[derive(Debug, PartialEq)]
enum Mode {
Good,
Bad
}
#[derive(Debug)]
pub struct BinaryRateLimiter {
tick: u32,
max_tick: u32,
... | MIN_GOOD_MODE_TIME_DELAY
);
}
}
},
Mode::Bad => {
if time_since(&self.last_bad_time) > self.delay_until_good_mode {
self.mode = Mode::Good;... | Mode::Good => {
if self.good_time_duration >= 10000 {
self.good_time_duration -= 10000;
self.delay_until_good_mode = cmp::max... | function_block-random_span | [
{
"content": "fn create_connection(config: Option<Config>) -> Connection<BinaryRateLimiter, NoopPacketModifier> {\n\n create_connection_with_modifier::<NoopPacketModifier>(config)\n\n}\n\n\n",
"file_path": "src/test/connection.rs",
"rank": 3,
"score": 102625.29645147541
},
{
"content": "/... |
Rust | pkmnapi-db/src/pic/mod.rs | kevinselwyn/pkmnapi | 170e6b6c9a74e85c377137bc086793898c415125 |
mod bitplane;
mod bitstream;
mod encoding_method;
pub use encoding_method::EncodingMethod as PicEncodingMethod;
use crate::error::{self, Result};
use bitplane::*;
use bitstream::*;
use image::{self, DynamicImage, ImageBuffer, ImageFormat, Luma};
#[derive(Clone, Debug, PartialEq)]
pub struct Pic {
pub width: u8... |
mod bitplane;
mod bitstream;
mod encoding_method;
pub use encoding_method::EncodingMethod as PicEncodingMethod;
use crate::error::{self, Result};
use bitplane::*;
use bitstream::*;
use image::{self, DynamicImage, ImageBuffer, ImageFormat, Luma};
#[derive(Clone, Debug, PartialEq)]
pub struct Pic {
pub width: u8... |
}
pub fn from_png(data: Vec<u8>) -> Result<Self> {
Pic::from(data, ImageFormat::Png)
}
pub fn from_jpeg(data: Vec<u8>) -> Result<Self> {
Pic::from(data, ImageFormat::Jpeg)
}
pub fn decode_bitplane(width: u8, height: u8, bitstream: &mut Bitstream) -> Bitplane {
let mut... | Ok(Pic {
width,
height,
pixels,
bytes: 0,
encoding_method,
}) | call_expression | [
{
"content": "pub fn get_data_raw(data: Data) -> Vec<u8> {\n\n let mut raw = Vec::new();\n\n\n\n data.stream_to(&mut raw).unwrap();\n\n\n\n raw\n\n}\n\n\n",
"file_path": "pkmnapi-api/src/utils.rs",
"rank": 0,
"score": 323389.12652447517
},
{
"content": "pub fn get_etag(if_match: Res... |
Rust | yarte_codegen/src/wasm/client/each.rs | dskleingeld/yarte | f3cd2db21fc4c64f74ef08f988357a282defee96 | use std::{collections::HashSet, iter};
use proc_macro2::TokenStream;
use quote::{format_ident, quote};
use syn::{parse2, Expr, Ident};
use yarte_dom::dom::{Each, ExprId, VarId};
use super::{
component::get_component,
state::{InsertPath, Len, Parent, State, Step},
utils::*,
BlackBox, WASMCodeGen,
};
... | use std::{collections::HashSet, iter};
use proc_macro2::TokenStream;
use quote::{format_ident, quote};
use syn::{parse2, Expr, Ident};
use yarte_dom::dom::{Each, ExprId, VarId};
use super::{
component::get_component,
state::{InsertPath, Len, Parent, State, Step},
utils::*,
BlackBox, WASMCodeGen,
};
... |
}
| false
});
let render = self.render(curr);
assert!(!render.is_empty());
if parents {
quote! {
for (#vdom, #expr) in #table
.iter_mut()
.zip(#args)
{
... | function_block-function_prefix_line | [
{
"content": "pub fn resolve_if_block<'a>(expr: &'a Expr, id: usize, builder: &'a mut DOMBuilder) -> Vec<VarId> {\n\n ResolveIf::new(builder, id).resolve(expr)\n\n}\n\n\n",
"file_path": "yarte_dom/src/dom/resolve.rs",
"rank": 0,
"score": 414137.18538381014
},
{
"content": "#[inline]\n\npu... |
Rust | src/atsame70q21b/usbhs/usbhs_deveptier_intrpt_mode.rs | tstellanova/atsame7x-pac | f7e24c71181651c141d0727379147c388661ce0e | #[doc = "Writer for register USBHS_DEVEPTIER_INTRPT_MODE[%s]"]
pub type W = crate::W<u32, super::USBHS_DEVEPTIER_INTRPT_MODE>;
#[doc = "Register USBHS_DEVEPTIER_INTRPT_MODE[%s]
`reset()`'s with value 0"]
impl crate::ResetValue for super::USBHS_DEVEPTIER_INTRPT_MODE {
type Type = u32;
#[inline(always)]
fn re... | #[doc = "Writer for register USBHS_DEVEPTIER_INTRPT_MODE[%s]"]
pub type W = crate::W<u32, super::USBHS_DEVEPTIER_INTRPT_MODE>;
#[doc = "Register USBHS_DEVEPTIER_INTRPT_MODE[%s]
`reset()`'s with value 0"]
impl crate::ResetValue for super::USBHS_DEVEPTIER_INTRPT_MODE {
type Type = u32;
#[inline(always)]
fn re... | #[inline(always)]
pub fn clear_bit(self) -> &'a mut W {
self.bit(false)
}
#[doc = r"Writes raw bits to the field"]
#[inline(always)]
pub fn bit(self, value: bool) -> &'a mut W {
self.w.bits = (self.w.bits & !(0x01 << 7)) | (((value as u32) & 0x01) << 7);
self.w
}
}
#[doc ... | 2) & 0x01) << 3);
self.w
}
}
#[doc = "Write proxy for field `NAKINES`"]
pub struct NAKINES_W<'a> {
w: &'a mut W,
}
impl<'a> NAKINES_W<'a> {
#[doc = r"Sets the field bit"]
#[inline(always)]
pub fn set_bit(self) -> &'a mut W {
self.bit(true)
}
#[doc = r"Clears the field bit"]
... | random | [] |
Rust | crate/workspace_tests/src/game_input/system/shared_controller_input_update_system.rs | Lighty0410/autexousious | 99d142d8fdbf2076f3fd929f61b8140d47cf6b86 | #[cfg(test)]
mod tests {
use std::any;
use amethyst::{
ecs::{Builder, Entity, Join, ReadStorage, WorldExt, WriteStorage},
Error,
};
use amethyst_test::AmethystApplication;
use game_input_model::{
config::{ControlBindings, ControllerId},
play::{ControllerInput, InputC... | #[cfg(test)]
mod tests {
use std::any;
use amethyst::{
ecs::{Builder, Entity, Join, ReadStorage, WorldExt, WriteStorage},
Error,
};
use amethyst_test::AmethystApplication;
use game_input_model::{
config::{ControlBindings, ControllerId},
play::{ControllerInput, InputC... | .expect("Failed to delete entity.")
});
})
.with_assertion(|world| {
let entity = *world.read_resource::<Entity>();
let store = world.read_storage::<ControllerInput>();
assert_eq!(
So... | olled::new(controller_id))
.with(ControllerInput::default())
.build()
})
.collect::<Vec<Entity>>();
world.insert(controller_entities);
let entity = world.create_entity().with(SharedInputContr... | function_block-random_span | [
{
"content": "#[test]\n\nfn read_and_exit() -> Result<(), OutputError> {\n\n let command = CargoBuild::new()\n\n .example(\"01_read_and_exit\")\n\n .current_release()\n\n .run()\n\n .expect(\"Failed to create `cargo` command\")\n\n .command();\n\n Command::from_std(comma... |
Rust | binding-generator/src/smart_ptr.rs | tanxxjun321/opencv-rust | 1cfceeba79eb8fffce3c8ae698c56cdf2d4e5ff5 | use std::{
borrow::Cow,
fmt,
};
use clang::Entity;
use maplit::hashmap;
use once_cell::sync::Lazy;
use crate::{
Constness,
CompiledInterpolation,
DefaultElement,
DefinitionLocation,
Element,
EntityElement,
GeneratedElement,
GeneratorEnv,
ReturnTypeWrapper,
StrExt,
type_ref::TemplateArg,
TypeRef,
};
#[d... | use std::{
borrow::Cow,
fmt,
};
use clang::Entity;
use maplit::hashmap;
use once_cell::sync::Lazy;
use crate::{
Constness,
CompiledInterpolation,
DefaultElement,
DefinitionLocation,
Element,
EntityElement,
GeneratedElement,
GeneratorEnv,
ReturnTypeWrapper,
StrExt,
type_ref::TemplateArg,
TypeRef,
};
#[d... | ment_safe_id(&self) -> String {
format!("{}-{}", self.rust_module(), self.rust_localalias())
}
fn gen_rust(&self, _opencv_version: &str) -> String {
static TPL: Lazy<CompiledInterpolation> = Lazy::new(
|| include_str!("../tpl/smart_ptr/rust.tpl.rs").compile_interpolation()
);
static TRAIT_CAST_TPL: Lazy<... | artPtr<'tu, '_> {
fn entity(&self) -> Entity<'tu> {
self.entity
}
}
impl Element for SmartPtr<'_, '_> {
fn is_excluded(&self) -> bool {
DefaultElement::is_excluded(self) || self.pointee().is_excluded()
}
fn is_ignored(&self) -> bool {
DefaultElement::is_ignored(self) || self.pointee().is_ignored()
}
fn ... | random | [
{
"content": "/// Default face detector\n\n/// This function is mainly utilized by the implementation of a Facemark Algorithm.\n\n/// End users are advised to use function Facemark::getFaces which can be manually defined\n\n/// and circumvented to the algorithm by Facemark::setFaceDetector.\n\n/// \n\n/// ## Pa... |
Rust | src/database.rs | chongyi/inspirer-rs | 78cf180162e9ba302b16a6873629e56cfb318b4f | use actix::*;
use actix_web::*;
use diesel;
use diesel::prelude::MysqlConnection;
use diesel::r2d2::{ Pool, PooledConnection, ConnectionManager };
use diesel::sql_types;
use error::Error;
pub struct DatabaseExecutor(pub Pool<ConnectionManager<MysqlConnection>>);
pub type Conn = PooledConnection<ConnectionManager<Mys... | use actix::*;
use actix_web::*;
use diesel;
use diesel::prelude::MysqlConnection;
use diesel::r2d2::{ Pool, PooledConnection, ConnectionManager };
use diesel::sql_types;
use error::Error;
pub struct DatabaseExecutor(pub Pool<ConnectionManager<MysqlConnection>>);
pub type Conn = PooledConnection<ConnectionManager<Mys... | ome(stringify!($table))))
}
};
}
#[macro_export]
macro_rules! update_by_id {
($conn:expr => ($table:ident # = $id:expr; <- $update:expr)) => {
update_by_id!($conn => ($table id = $id; <- $update))
};
($conn:expr => ($table:ident $id_field:ident = $id:expr; <- $update:expr)) => {
... | > {
{
use $crate::error::database::map_database_error as map_db_err;
diesel::delete($table)
.filter($id_field.eq($id))
.execute($conn)
.map_err(map_db_err(Some(stringify!($table))))
}
};
}
#[macro_export]
macro_rules! find_by_i... | random | [
{
"content": "#[derive(Deserialize, Debug, Clone)]\n\nstruct CreateContent {\n\n\n\n}\n\n\n",
"file_path": "src/controllers/admin/content.rs",
"rank": 0,
"score": 48109.37637340417
},
{
"content": "pub fn map_database_error(target: Option<&'static str>) -> impl FnOnce(DieselError) -> Error {... |
Rust | src/rocksdb_options.rs | susytech/susy-rocksdb | 2ca57972fb6661863c72c1bf8549d63122305be6 |
extern crate libc;
use self::libc::{c_int, size_t};
use std::ffi::CString;
use std::mem;
use rocksdb_ffi;
use merge_operator::{self, MergeOperands, MergeOperatorCallback,
full_merge_callback, partial_merge_callback};
use comparator::{self, ComparatorCallback, compare_callback};
pub enum IndexTy... |
extern crate libc;
use self::libc::{c_int, size_t};
use std::ffi::CString;
use std::mem;
use rocksdb_ffi;
use merge_operator::{self, MergeOperands, MergeOperatorCallback,
full_merge_callback, partial_merge_callback};
use comparator::{self, ComparatorCallback, compare_callback};
pub enum IndexTy... |
pub fn set_block_size(&mut self, size: usize) {
unsafe {
rocksdb_ffi::rocksdb_block_based_options_set_block_size(self.inner,
size);
}
}
pub fn set_index_type(&mut self, index_type: IndexType) {
let it ... | pub fn new() -> BlockBasedOptions {
let block_opts = unsafe {
rocksdb_ffi::rocksdb_block_based_options_create()
};
if block_opts.is_null() {
panic!("Could not create rocksdb block based options".to_string());
}
BlockBasedOptions { inner: block_opts, filter... | function_block-full_function | [
{
"content": "pub fn new_cache(capacity: size_t) -> DBCache {\n\n unsafe { rocksdb_cache_create_lru(capacity) }\n\n}\n\n\n\n#[repr(C)]\n\npub enum DBCompressionType {\n\n DBNoCompression = 0,\n\n DBSnappyCompression = 1,\n\n DBZlibCompression = 2,\n\n DBBz2Compression = 3,\n\n DBLz4Compression... |
Rust | src/lib.rs | newAM/clap-num | 7d23825a4976b41bfd5d6f8ce70bcfa4ca434fc1 |
#![doc(html_root_url = "https://docs.rs/clap-num/0.2.0")]
#![deny(missing_docs)]
use core::convert::TryFrom;
use core::str::FromStr;
use num_traits::identities::Zero;
use num_traits::{sign, CheckedAdd, CheckedMul, CheckedSub, Num};
fn check_range<T: Ord + std::fmt::Display>(val: T, min: T, max: T) -> Result<T, Stri... |
#![doc(html_root_url = "https://docs.rs/clap-num/0.2.0")]
#![deny(missing_docs)]
use core::convert::TryFrom;
use core::str::FromStr;
use num_traits::identities::Zero;
use num_traits::{sign, CheckedAdd, CheckedMul, CheckedSub, Num};
fn check_range<T: Ord + std::fmt::Display>(val: T, min: T, max: T) -> Result<T, Stri... | pre.checked_add(&post)
.ok_or_else(|| OVERFLOW_MSG.to_string())
} else {
pre.checked_sub(&post)
.ok_or_else(|| OVERFLOW_MSG.to_string())
}
} else {
s.parse::<T>().map_err(stringify)
}
}
pub fn si_number_range<T: Ord + Partia... | 000_000, 9, Some(i)),
'M' => return (1_000_000, 6, Some(i)),
'k' => return (1_000, 3, Some(i)),
_ => continue,
};
}
(1, 0, None)
}
fn find_decimal(s: &str) -> Option<usize> {
for (i, c) in s.chars().enumerate() {
if c == '.' {
return Some(i);
... | random | [
{
"content": "fn less_than_100(s: &str) -> Result<u8, String> {\n\n number_range(s, 0, 99)\n\n}\n\n\n",
"file_path": "examples/change.rs",
"rank": 7,
"score": 74407.00790011589
},
{
"content": "#[test]\n\nfn test_readme_deps() {\n\n version_sync::assert_markdown_deps_updated!(\"README.... |
Rust | game/src/sandbox/score.rs | jinzhong2/abstreet | e1c5edc76d636af4f3e4593efc25055bdd637dd7 | use crate::game::{State, Transition, WizardState};
use crate::sandbox::gameplay::{cmp_count_fewer, cmp_count_more, cmp_duration_shorter};
use crate::ui::UI;
use abstutil::prettyprint_usize;
use ezgui::{
hotkey, Choice, Color, EventCtx, GfxCtx, HorizontalAlignment, Key, Line, ModalMenu, Text,
VerticalAlignment, ... | use crate::game::{State, Transition, WizardState};
use crate::sandbox::gameplay::{cmp_count_fewer, cmp_count_more, cmp_duration_shorter};
use crate::ui::UI;
use abstutil::prettyprint_usize;
use ezgui::{
hotkey, Choice, Color, EventCtx, GfxCtx, HorizontalAlignment, Key, Line, ModalMenu, Text,
VerticalAlignment, ... |
fn draw(&self, g: &mut GfxCtx, _: &UI) {
g.draw_blocking_text(
&self.summary,
(HorizontalAlignment::Center, VerticalAlignment::Center),
);
self.menu.draw(g);
}
}
fn browse_trips(wiz: &mut Wizard, ctx: &mut EventCtx, ui: &mut UI) -> Option<Transition> {
let ... | return Transition::Pop;
}
if self.menu.action("browse trips") {
return Transition::Push(WizardState::new(Box::new(browse_trips)));
}
Transition::Keep
} | function_block-function_prefix_line | [
{
"content": "fn pick_color(wiz: &mut Wizard, ctx: &mut EventCtx, ui: &mut UI) -> Option<Transition> {\n\n let name = wiz\n\n .wrap(ctx)\n\n .choose_string(\"Change which color?\", || ui.cs.color_names())?;\n\n Some(Transition::Replace(Box::new(ColorChanger {\n\n name: name.clone(),\n... |
Rust | src/types/float.rs | dholroyd/hls_m3u8 | 7e6da6224dad326d915d113357e22f6fc0455c92 | use core::cmp::Ordering;
use core::convert::TryFrom;
use core::str::FromStr;
use derive_more::{AsRef, Deref, Display};
use crate::Error;
#[derive(AsRef, Deref, Default, Debug, Copy, Clone, Display, PartialOrd)]
pub struct Float(f32);
impl Float {
... | use core::cmp::Ordering;
use core::convert::TryFrom;
use core::str::FromStr;
use derive_more::{AsRef, Deref, Display};
use crate::Error;
#[derive(AsRef, Deref, Default, Debug, Copy, Clone, Display, PartialOrd)]
pub struct Float(f32);
impl Float {
... |
#[must_use]
pub const fn as_f32(self) -> f32 { self.0 }
}
impl FromStr for Float {
type Err = Error;
fn from_str(input: &str) -> Result<Self, Self::Err> {
let float = f32::from_str(input).map_err(|e| Error::parse_float(input, e))?;
Self::try_fr... | be finite: `{}`", float);
}
if float.is_nan() {
panic!("float must not be `NaN`");
}
Self(float)
} | function_block-function_prefixed | [
{
"content": " pub trait Sealed {}\n\n impl Sealed for crate::MediaSegment {}\n\n impl Sealed for crate::tags::ExtXMap {}\n\n}\n\n\n",
"file_path": "src/traits.rs",
"rank": 0,
"score": 50488.99251107057
},
{
"content": "#[doc(hidden)]\n\npub trait RequiredVersion {\n\n /// Return... |
Rust | src/app.rs | rsookram/srs-cli | 8825fcf6a7f9055d5f13ac8a23cf55f6d959895d | use crate::Srs;
use anyhow::anyhow;
use anyhow::Result;
use dialoguer::theme::Theme;
use dialoguer::Confirm;
use srs_cli::Card;
use srs_cli::DeckStats;
use srs_cli::GlobalStats;
use std::io;
pub struct App<W: io::Write> {
srs: Srs,
output: W,
}
impl<W: io::Write> App<W> {
pub fn new(srs: Srs, output: W) -... | use crate::Srs;
use anyhow::anyhow;
use anyhow::Result;
use dialoguer::theme::Theme;
use dialoguer::Confirm;
use srs_cli::Card;
use srs_cli::DeckStats;
use srs_cli::GlobalStats;
use std::io;
pub struct App<W: io::Write> {
srs: Srs,
output: W,
}
impl<W: io::Write> App<W> {
pub fn new(srs: Srs, output: W) -... |
pub fn switch(&mut self, card_id: u64, deck_id: u64) -> Result<()> {
let front = self.srs.get_card(card_id)?.front;
let deck_name = self.srs.get_deck(deck_id)?.name;
if Confirm::new()
.with_prompt(format!(
"Are you sure you want to switch '{front}' to {deck_nam... | fn output_deck(&mut self, stats: &DeckStats) -> Result<()> {
let total = stats.active + stats.suspended + (stats.leech as u32);
writeln!(
self.output,
"{}\n {} / {total} active",
stats.name, stats.active
)?;
if stats.leech > 0 {
writeln!(... | function_block-full_function | [
{
"content": "CREATE INDEX cardDeckId ON Card(deckId);\n\n\n",
"file_path": "src/schema.sql",
"rank": 1,
"score": 80076.39999327567
},
{
"content": "CREATE INDEX answerCardId ON Answer(cardId);\n",
"file_path": "src/schema.sql",
"rank": 2,
"score": 80021.74427068235
},
{
... |
Rust | src/cluster/src/local.rs | simlay/fluvio | a42283200e667223d3a52b217d266db8927db4eb | use std::path::Path;
use std::borrow::Cow;
use std::fs::{File, create_dir_all};
use std::process::{Command, Stdio};
use std::time::Duration;
use fluvio::{FluvioConfig};
use tracing::{info, warn, debug};
use fluvio::config::{TlsPolicy, TlsConfig, TlsPaths, ConfigFile, Profile, LOCAL_PROFILE};
use fluvio::metadata::spg:... | use std::path::Path;
use std::borrow::Cow;
use std::fs::{File, create_dir_all};
use std::process::{Command, Stdio};
use std::time::Duration;
use fluvio::{FluvioConfig};
use tracing::{info, warn, debug};
use fluvio::config::{TlsPolicy, TlsConfig, TlsPaths, ConfigFile, Profile, LOCAL_PROFILE};
use fluvio::metadata::spg:... |
fn set_server_tls(
&self,
cmd: &mut Command,
tls: &TlsConfig,
port: u16,
) -> Result<(), ClusterError> {
let paths: Cow<TlsPaths> = match tls {
TlsConfig::Files(paths) => Cow::Borrowed(paths),
TlsConfig::Inline(certs) => Cow::Owned(certs.try_into... | g_dir))?;
let errors = outputs.try_clone()?;
debug!("starting sc server");
let mut binary = {
let mut cmd = Command::new(std::env::current_exe()?);
cmd.arg("run");
cmd.arg("sc");
cmd
};
if let TlsPolicy::Verified(tls) = &self.config... | function_block-function_prefixed | [
{
"content": "/// create new local cluster and profile\n\npub fn set_local_context(local_config: LocalOpt) -> Result<String, CliError> {\n\n let local_addr = local_config.local;\n\n let mut config_file = ConfigFile::load_default_or_new()?;\n\n\n\n let config = config_file.mut_config();\n\n\n\n // ch... |
Rust | exe-common/src/network/hermes.rs | nahern/rust-cardano | 03fc923641808361273f1645eef221fdf908f5cf | use cardano::{block::{block, Block, BlockHeader, BlockDate, RawBlock, HeaderHash}, tx::{TxAux}};
use cardano::hash::{HASH_SIZE_256};
use storage;
use std::io::Write;
use std::time::{SystemTime, Duration};
use std::thread;
use futures::{Future, Stream};
use hyper::Client;
use tokio_core::reactor::Core;
use network::{R... | use cardano::{block::{block, Block, BlockHeader, BlockDate, RawBlock, HeaderHash}, tx::{TxAux}};
use cardano::hash::{HASH_SIZE_256};
use storage;
use std::io::Write;
use std::time::{SystemTime, Duration};
use std::thread;
use futures::{Future, Stream};
use hyper::Client;
use tokio_core::reactor::Core;
use network::{R... |
from = BlockRef {
hash: hdr.compute_hash(),
parent: hdr.get_previous_header(),
date: hdr.get_blockdate()
};
inclusive = false;
}
}
else {
... | if from.date <= hdr.get_blockdate() {
got_block(&hdr.compute_hash(), &block, &block_raw);
} | if_condition | [
{
"content": "pub fn resolve_date_to_blockhash(storage: &Storage, tip: &BlockHash, date: &BlockDate) -> Result<Option<BlockHash>> {\n\n let epoch = date.get_epochid();\n\n match epoch_open_packref(&storage.config, epoch) {\n\n Ok(mut handle) => {\n\n let slotid = match date {\n\n ... |
Rust | argonautica-rs/examples/example_serde.rs | philipahlberg/argonautica | bd9d7cb0f10dcf9a92f8b2e913b7116c1f10099d | extern crate argonautica;
extern crate failure;
extern crate serde;
extern crate serde_json;
use argonautica::{Hasher, Verifier};
fn serialize_hasher() -> Result<String, failure::Error> {
let additional_data = [1u8, 2, 3, 4];
let salt = [1u8, 2, 3, 4, 5, 6, 7, 8];
let mut hasher = Hasher::default();
h... | extern crate argonautica;
extern crate failure;
extern crate serde;
extern crate serde_json;
use argonautica::{Hasher, Verifier};
fn serialize_hasher() -> Result<String, failure::Error> {
let additional_data = [1u8, 2, 3, 4];
let salt = [1u8, 2, 3, 4, 5, 6, 7, 8];
let mut hasher = Hasher::default();
h... |
fn deserialize_verifier(j: &str) -> Result<argonautica::Verifier, failure::Error> {
let verifier: Verifier = serde_json::from_str(&j)?;
println!("*** Deserialized Verifier ***");
println!("{:#?}\n", &verifier);
... | fn serialize_verifier() -> Result<String, failure::Error> {
let additional_data = [1u8, 2, 3, 4];
let mut verifier = Verifier::default();
verifier
.with_additional_data(&additional_data[..])
.with_hash("$argon2id$v=19$m=4096,t=128,p=2$c29tZXNhbHQ$WwD2/wGGTuw7u4BW8sLM0Q")
.with_passwo... | function_block-function_prefixed | [
{
"content": "fn bench_crates(c: &mut Criterion) {\n\n // argon2rs\n\n let hasher = argon2rs::Argon2::new(\n\n /* passes */ DEFAULT_ITERATIONS,\n\n /* lanes */ default_lanes(),\n\n /* kib */ DEFAULT_MEMORY_SIZE,\n\n /* variant */ argon2rs::Variant::Argon2i,\n\n )\n\n .unw... |
Rust | src/procfs.rs | wojciechkepka/rustop | b8ac5b8c36aae9364fb16b64030d3de614e94747 | use super::*;
pub async fn os_release() -> Result<String> {
Ok(fs::read_to_string(SysProperty::OsRelease.path())?.trim_end().to_string())
}
pub async fn hostname() -> Result<String> {
Ok(fs::read_to_string(SysProperty::Hostname.path())?.trim_end().to_string())
}
pub async fn uptime() -> Result<f64> {
let... | use super::*;
pub async fn os_release() -> Result<String> {
Ok(fs::read_to_string(SysProperty::OsRelease.path())?.trim_end().to_string())
}
pub async fn hostname() -> Result<String> {
Ok(fs::read_to_string(SysProperty::Hostname.path())?.trim_end().to_string())
}
pub async fn uptime() -> Result<f64> {
let... |
}
partition.major = handle(storage_dev[1].parse::<u16>());
partition.minor = handle(storage_dev[2].parse::<u16>());
partition.size = handle(storage_dev[3].parse::<u64>()) * 1024;
partition.name = partition_name.to_string();
partitions.push(partition);
}
partition... | if &found_partition[1] == partition_name {
partition.mountpoint = found_partition[2].to_string();
partition.filesystem = found_partition[3].to_string();
break;
} else {
partition.mountpoint = "".to_string();
partition.filesystem... | if_condition | [] |
Rust | src/graph.rs | fexolm/max_clique | c181294902c53842fd06450c7a1618daf5bc270b | use std::collections::*;
use std::fs::File;
use std::io::*;
use std::iter::*;
use std::sync::Arc;
use std::sync::RwLock;
use std::u64;
use rayon::{Scope};
use regex::Regex;
pub struct Graph {
adj_list: HashMap<u16, HashSet<u16>>,
}
pub struct MaxCliqueData {
max_clique: Vec<u16>,
current_clique: Vec<u16>... | use std::collections::*;
use std::fs::File;
use std::io::*;
use std::iter::*;
use std::sync::Arc;
use std::sync::RwLock;
use std::u64;
use rayon::{Scope};
use regex::Regex;
pub struct Graph {
adj_list: HashMap<u16, HashSet<u16>>,
}
pub struct MaxCliqueData {
max_clique: Vec<u16>,
current_clique: Vec<u16>... |
fn greedy_coloring(&self, vertexes: &HashSet<u16>) -> HashMap<u16, i16> {
let mut res = HashMap::new();
let mut powers = Vec::from_iter(
vertexes.iter().copied()
.map(|v| (v, Vec::from_iter(self.subgraph_neighbours(vertexes, v))))
);
powers.sort_unstabl... | fn max_clique_heuristic(&self, data: &mut MaxCliqueData) {
let mut queue = BinaryHeap::from_iter(
self.adj_list.keys().copied().map(|n| (self.degree(n), n)));
while let Some((_, node)) = queue.pop() {
if self.degree(node) > data.max_clique.len() as u16 {
data.cur... | function_block-full_function | [
{
"content": "fn print_clique(v: &Vec<u16>) {\n\n for &n in v {\n\n print!(\"{} \", n);\n\n }\n\n}\n\n\n",
"file_path": "src/main.rs",
"rank": 3,
"score": 38032.75972512833
},
{
"content": "fn main() -> Result<()> {\n\n use graph::Graph;\n\n use time::PreciseTime;\n\n\n\n ... |
Rust | necsim/impls/std/src/cogs/active_lineage_sampler/gillespie/sampler.rs | fossabot/necsim-rust | 996b6a6977bc27a997a123e3e4f5a7b11e1a1aef | use necsim_core::{
cogs::{
ActiveLineageSampler, CoalescenceSampler, DispersalSampler, EmigrationExit,
EmptyActiveLineageSamplerError, GloballyCoherentLineageStore, Habitat, ImmigrationEntry,
LineageReference, PeekableActiveLineageSampler, RngCore, SpeciationProbability,
TurnoverRate... | use necsim_core::{
cogs::{
ActiveLineageSampler, CoalescenceSampler, DispersalSampler, EmigrationExit,
EmptyActiveLineageSamplerError, GloballyCoherentLineageStore, Habitat, ImmigrationEntry,
LineageReference, PeekableActiveLineageSampler, RngCore, SpeciationProbability,
TurnoverRate... |
}
#[contract_trait]
impl<
H: Habitat,
G: RngCore,
R: LineageReference<H>,
S: GloballyCoherentLineageStore<H, R>,
X: EmigrationExit<H, G, R, S>,
D: DispersalSampler<H, G>,
C: CoalescenceSampler<H, R, S>,
T: TurnoverRate<H>,
N: SpeciationProbabilit... | fn insert_new_lineage_to_indexed_location(
&mut self,
global_reference: GlobalLineageReference,
indexed_location: IndexedLocation,
time: PositiveF64,
simulation: &mut PartialSimulation<H, G, R, S, X, D, C, T, N, E>,
rng: &mut G,
) {
use necsim_core::cogs::RngS... | function_block-full_function | [
{
"content": "#[contract_trait]\n\npub trait EmigrationExit<H: Habitat, G: RngCore, R: LineageReference<H>, S: LineageStore<H, R>>:\n\n crate::cogs::Backup + core::fmt::Debug\n\n{\n\n #[must_use]\n\n #[debug_ensures(match &ret {\n\n Some((\n\n ret_lineage_reference,\n\n ret... |
Rust | sos21-gateway/database/src/pending_project_repository.rs | sohosai/sos21-backend | f1883844b0e5c68d6b3f9d159c9268142abc81b4 | use crate::project_repository::{
from_project_attributes, from_project_category, to_project_attributes, to_project_category,
};
use crate::user_repository::to_user;
use anyhow::Result;
use futures::lock::Mutex;
use ref_cast::RefCast;
use sos21_database::{command, model as data, query};
use sos21_domain::context::p... | use crate::project_repository::{
from_project_attributes, from_project_category, to_project_attributes, to_project_category,
};
use crate::user_repository::to_user;
use anyhow::Result;
use futures::lock::Mutex;
use ref_cast::RefCast;
use sos21_database::{command, model as data, query};
use sos21_domain::context::p... | me: group_name.into_string(),
kana_group_name: kana_group_name.into_string(),
description: description.into_string(),
category: from_project_category(category),
attributes: from_project_attributes(&attributes),
}
}
fn to_pending_project_with_owner(
pending_project_with_owner: da... | ectKanaGroupName, ProjectKanaName, ProjectName,
},
user::UserId,
};
use sqlx::{Postgres, Transaction};
#[derive(Debug, RefCast)]
#[repr(transparent)]
pub struct PendingProjectDatabase(Mutex<Transaction<'static, Postgres>>);
#[async_trait::async_trait]
impl PendingProjectRepository for PendingProjectDatabase {... | random | [
{
"content": "use crate::model::project::{ProjectAttribute, ProjectCategory};\n\n\n\nuse sos21_domain::model::project_query as entity;\n\n\n\n#[derive(Debug, Clone, PartialEq, Eq)]\n\npub struct ProjectQueryConjunction {\n\n pub category: Option<ProjectCategory>,\n\n pub attributes: Vec<ProjectAttribute>,... |
Rust | examples/bvh_viewer/main.rs | tpltnt/bvh_anim | 1f5e37061c6b67c9a0746591dec752adc114a540 | #![allow(unused)]
mod arcball_camera;
use arcball_camera::ArcBall;
use bvh_anim::{Bvh, JointData};
use gl::{self, types::*};
use glutin::{
dpi::LogicalSize, ContextBuilder, DeviceEvent, ElementState, Event, EventsLoop, KeyboardInput,
MouseButton, Touch, TouchPhase, VirtualKeyCode, WindowBuilder, WindowEvent,
... | #![allow(unused)]
mod arcball_camera;
use arcball_camera::ArcBall;
use bvh_anim::{Bvh, JointData};
use gl::{self, types::*};
use glutin::{
dpi::LogicalSize, ContextBuilder, DeviceEvent, ElementState, Event, EventsLoop, KeyboardInput,
MouseButton, Touch, TouchPhase, VirtualKeyCode, WindowBuilder, WindowEvent,
... | ref state,
button: MouseButton::Left,
..
} => match state {
ElementState::Pressed => is_mouse_down = true,
ElementState::Released => is_mouse_down = false,
},
WindowEvent::Touch(ref t) => {
... | delta: (ref mx, ref my),
}
if is_mouse_down =>
{
arcball.on_mouse_move(*mx as f32, *my as f32);
}
_ => {}
},
Event::WindowEvent { ref event, .. } => match event {
WindowEven... | random | [
{
"content": "fn collect_channels(channels: &[ChannelType], num_channels: &mut usize) -> SmallVec<[Channel; 6]> {\n\n let out_channels = channels\n\n .iter()\n\n .enumerate()\n\n .map(|(motion_index, &channel_type)| Channel {\n\n channel_type,\n\n motion_index: moti... |
Rust | library/src/canvas.rs | feenkcom/libskia | 2a9e95a65acb944fae8167abb93c91443ce71a95 | use boxer::array::BoxerArray;
use boxer::boxes::{ReferenceBox, ReferenceBoxPointer};
use boxer::{assert_reference_box, function};
use boxer::{ValueBox, ValueBoxPointer};
use float_cmp::ApproxEqUlps;
use layer::SaveLayerRecWrapper;
use skia_safe::canvas::{PointMode, SaveLayerRec};
use skia_safe::utils::shadow_utils::Sha... | use boxer::array::BoxerArray;
use boxer::boxes::{ReferenceBox, ReferenceBoxPointer};
use boxer::{assert_reference_box, function};
use boxer::{ValueBox, ValueBoxPointer};
use float_cmp::ApproxEqUlps;
use layer::SaveLayerRecWrapper;
use skia_safe::canvas::{PointMode, SaveLayerRec};
use skia_safe::utils::shadow_utils::Sha... |
#[no_mangle]
pub fn skia_canvas_draw_rrect(
canvas_ptr: *mut ReferenceBox<Canvas>,
rrect_ptr: *mut ValueBox<RRect>,
paint_ptr: *mut ValueBox<Paint>,
) {
assert_reference_box(canvas_ptr, function!());
canvas_ptr.with_not_null(|canvas| {
rrect_ptr.with_not_null(|rrect| {
paint_pt... | vas_ptr, function!());
canvas_ptr.with_not_null(|canvas| {
paint_ptr.with_not_null(|paint| {
canvas.draw_circle(Point::new(center_x, center_y), radius, paint);
});
});
} | function_block-function_prefixed | [
{
"content": "#[no_mangle]\n\npub fn skia_paint_set_rgba(paint_ptr: *mut ValueBox<Paint>, r: u8, g: u8, b: u8, a: u8) {\n\n paint_ptr.with_not_null(|paint| {\n\n paint.set_argb(a, r, g, b);\n\n });\n\n}\n\n\n",
"file_path": "library/src/paint.rs",
"rank": 0,
"score": 443120.23559253
}... |
Rust | src/strencrypt.rs | JohnAgapeyev/R2D2 | bc2ca7143844fe82b4ecc3e221de667a8bb5b3b4 | use quote::*;
use syn::spanned::Spanned;
use syn::visit_mut::*;
use syn::*;
use crate::crypto::*;
use crate::parse::*;
#[allow(unused_imports)]
use crate as r2d2;
struct MemEncCtx {
ctx: MemoryEncryptionCtx<XChaCha20Poly1305>,
needs_owned_str: bool,
}
impl ToTokens for MemEncCtx {
fn to_tokens(&self, to... | use quote::*;
use syn::spanned::Spanned;
use syn::visit_mut::*;
use syn::*;
use crate::crypto::*;
use crate::parse::*;
#[allow(unused_imports)]
use crate as r2d2;
struct MemEncCtx {
ctx: MemoryEncryptionCtx<XChaCha20Poly1305>,
needs_owned_str: bool,
}
impl ToTokens for MemEncCtx {
fn to_tokens(&self, to... |
fn visit_expr_mut(&mut self, node: &mut Expr) {
/*
* Skip function call expressions
* This is a case of lifetime scoping problems
* Given a function foo("hello"), only a String type would support decryption
* If the function takes a &str, the temporary will go out of sc... | fn visit_macro_mut(&mut self, node: &mut Macro) {
let macro_path = node
.path
.get_ident()
.map(|ident| ident.to_string())
.unwrap_or_default();
let mut can_encrypt = match macro_path.as_str() {
"println" => true,
"eprintln" => true... | function_block-full_function | [
{
"content": "fn is_shuffle_attr(attr: &str) -> bool {\n\n match attr {\n\n SHUFFLE_ATTR_NAME => true,\n\n _ => false,\n\n }\n\n}\n\n\n",
"file_path": "src/shuffle.rs",
"rank": 1,
"score": 200775.69576019843
},
{
"content": "/// Render a sparkline of `data` into `buffer`.... |
Rust | src/connectivity/network/ping3/src/store.rs | EnderNightLord-ChromeBook/zircon-rpi | b09b1eb3aa7a127c65568229fe10edd251869283 |
use fuchsia_async as fasync;
use fuchsia_zircon as zx;
use thiserror::Error;
#[derive(Clone)]
pub struct SequenceStore {
next_seq: u16,
last_seq: u16,
start_time: zx::Time,
}
#[derive(Error, Debug)]
#[error("No sequence numbers available")]
pub struct OutOfSequencesError;
#[derive... |
use fuchsia_async as fasync;
use fuchsia_zircon as zx;
use thiserror::Error;
#[derive(Clone)]
pub struct SequenceStore {
next_seq: u16,
last_seq: u16,
start_time: zx::Time,
}
#[derive(Error, Debug)]
#[error("No sequence numbers available")]
pub struct OutOfSequencesError;
#[derive... | );
let (_, b_time) = s.take().expect("Failed to take");
assert_eq!(b_time - a_time, SHORT_DELAY);
}
#[test]
fn give_latency() {
let executor = fasync::Executor::new_with_fake_time().expect("Failed to create executor");
let mut s = SequenceStore::new();
let (a, a_tim... | .expect("Failed to take").0, i);
}
s.take().expect_err("There shouldn't be any more sequence numbers available");
}
#[test]
fn give_out_of_order() {
let _executor = fasync::Executor::new_with_fake_time().expect("Failed to create executor");
let mut s = SequenceStore::new();
... | random | [] |
Rust | src/application/core.rs | mass10/rzip | d9a3cf8dbe3208a382bd5da3d353331a27e59df0 |
use super::errors::ApplicationError;
use crate::configuration;
use crate::functions;
use std::io::Read;
#[allow(unused)]
fn matches(pattern: &str, text: &str) -> bool {
let reg = regex::Regex::new(pattern);
if reg.is_err() {
panic!("[ERROR] Fatal error. (reason: {})", reg.err().unwrap());
return false;
}
let... |
use super::errors::ApplicationError;
use crate::configuration;
use crate::functions;
use std::io::Read;
#[allow(unused)]
fn matches(pattern: &str, text: &str) -> bool {
let reg = regex::Regex::new(pattern);
if reg.is_err() {
pani |
pub struct Zipper;
impl Zipper {
pub fn new() -> Zipper {
let instance = Zipper {};
return instance;
}
fn append_entry(&self, archiver: &mut zip::ZipWriter<std::fs::File>, base_name: &str, path: &str, settings: &configuration::Settings) -> Result<(), Box<dyn std::error::Error>> {
use cr... | c!("[ERROR] Fatal error. (reason: {})", reg.err().unwrap());
return false;
}
let result = reg.unwrap().find(text);
if result.is_none() {
return false;
}
return true;
} | function_block-function_prefixed | [
{
"content": "/// Build a path from `path` and `name`.\n\n///\n\n/// # Arguments\n\n/// * `parent` Parent path.\n\n/// * `name` Name of the file or directory.\n\n///\n\n/// # Returns\n\n/// * Path to the file or directory.\n\npub fn build_path(parent: &str, name: &str) -> String {\n\n\tif parent == \"\" {\n\n\t... |
Rust | src/headers/mod.rs | vv9k/mobi-rs | c15606e2842759db9797122c5f8196d36388feba | pub(crate) mod exth;
pub(crate) mod header;
pub(crate) mod mobih;
pub(crate) mod palmdoch;
pub use self::{
exth::{ExtHeader, ExthRecord},
header::{Header, HeaderParseError},
mobih::{Language, MobiHeader, MobiType, TextEncoding},
palmdoch::{Compression, Encryption, PalmDocHeader},
};
use crate::record:... | pub(crate) mod exth;
pub(crate) mod header;
pub(crate) mod mobih;
pub(crate) mod palmdoch;
pub use self::{
exth::{ExtHeader, ExthRecord},
header::{Header, HeaderParseError},
mobih::{Language, MobiHeader, MobiType, TextEncoding},
palmdoch::{Compression, Encryption, PalmDocHeader},
};
use crate::record:... | ;
reader.set_position((records.records[0].offset + mobi.name_offset) as usize)?;
let name = reader.read_vec_header(mobi.name_length as usize)?;
Ok(MobiMetadata {
name,
header,
records,
palmdoc,
mobi,
exth,
})
}... | if mobi.has_exth_header() {
ExtHeader::parse(reader)?
} else {
ExtHeader::default()
} | if_condition | [
{
"content": "pub fn decompress(data: &[u8]) -> Vec<u8> {\n\n let length = data.len();\n\n let mut pos: usize = 0;\n\n let mut text_pos: usize = 0;\n\n let mut text: Vec<u8> = vec![];\n\n\n\n let mut prev = None;\n\n while pos < length {\n\n let byte = data[pos];\n\n pos += 1;\n\... |
Rust | src/walker.rs | oxidecomputer/openapi-lint | 025fc867b7da62b33474d0a765823653a437f362 |
use indexmap::IndexMap;
use openapiv3::{
Components, MediaType, OpenAPI, Operation, Parameter, ParameterSchemaOrContent, PathItem,
ReferenceOr, RequestBody, Response, Schema,
};
pub(crate) trait SchemaWalker<'a> {
type SchemaIterator: Iterator<Item = (Option<String>, &'a Schema)>;
fn walk(&'a self) -... |
use indexmap::IndexMap;
use openapiv3::{
Components, MediaType, OpenAPI, Operation, Parameter, ParameterSchemaOrContent, PathItem,
ReferenceOr, RequestBody, Response, Schema,
};
pub(crate) trait SchemaWalker<'a> {
type SchemaIterator: Iterator<Item = (Option<String>, &'a Schema)>;
fn walk(&'a self) -... |
}
impl<'a> SchemaWalker<'a> for IndexMap<String, ReferenceOr<Schema>> {
type SchemaIterator = std::vec::IntoIter<(Option<String>, &'a Schema)>;
fn walk(&'a self) -> Self::SchemaIterator {
self.iter()
.flat_map(|(key, value)| {
value
.walk()
... | fn walk(&'a self) -> Self::SchemaIterator {
match self {
None => Vec::<(Option<String>, &Schema)>::new().into_iter(),
Some(walker) => walker.walk().collect::<Vec<_>>().into_iter(),
}
} | function_block-full_function | [
{
"content": "trait ComponentLookup: Sized {\n\n fn get_components(components: &Components) -> &IndexMap<String, ReferenceOr<Self>>;\n\n}\n\n\n\nimpl<T: ComponentLookup> ReferenceOrExt<T> for openapiv3::ReferenceOr<T> {\n\n fn item<'a>(&'a self, components: &'a Option<Components>) -> Option<&'a T> {\n\n ... |
Rust | native-windows-gui/src/controls/notice.rs | gyk/native-windows-gui | 163d0fcb5c2af8a859f603ce23a7ec218e9b6813 | use super::control_handle::ControlHandle;
use crate::win32::{window::build_notice, window_helper as wh};
use crate::NwgError;
const NOT_BOUND: &str = "Notice is not yet bound to a winapi object";
const UNUSABLE_NOTICE: &str = "Notice parent window was freed";
const BAD_HANDLE: &str = "INTERNAL ERROR: Notice handle is ... | use super::control_handle::ControlHandle;
use crate::win32::{window::build_notice, window_helper as wh};
use crate::NwgError;
const NOT_BOUND: &str = "Notice is not yet bound to a winapi object";
const UNUSABLE_NOTICE: &str = "Notice parent window was freed";
const BAD_HANDLE: &str = "INTERNAL ERROR: Notice handle is ... |
}
| pub fn build(self, out: &mut Notice) -> Result<(), NwgError> {
let parent = match self.parent {
Some(p) => match p.hwnd() {
Some(handle) => Ok(handle),
None => Err(NwgError::control_create("Wrong parent type")),
},
None => Err(NwgError::no_pare... | function_block-full_function | [
{
"content": "pub fn check_hwnd(handle: &ControlHandle, not_bound: &str, bad_handle: &str) -> HWND {\n\n use winapi::um::winuser::IsWindow;\n\n\n\n if handle.blank() {\n\n panic!(\"{}\", not_bound);\n\n }\n\n match handle.hwnd() {\n\n Some(hwnd) => match unsafe { IsWindow(hwnd) } {\n\n... |
Rust | src/lib.rs | helium/longfi-device-rs | 97ad8f380205a0b0b1c90ff0513e30c576b71e5d | #![cfg_attr(not(test), no_std)]
use longfi_sys;
pub use longfi_sys::AntPinsMode_t as AntPinsMode;
pub use longfi_sys::BoardBindings_t as BoardBindings;
pub use longfi_sys::ClientEvent_t as ClientEvent;
pub use longfi_sys::LongFiAuthCallbacks as AuthCb;
pub use longfi_sys::LongFiAuthMode_t as AuthMode;
pub use longfi_s... | #![cfg_attr(not(test), no_std)]
use longfi_sys;
pub use longfi_sys::AntPinsMode_t as AntPinsMode;
pub use longfi_sys::BoardBindings_t as BoardBindings;
pub use longfi_sys::ClientEvent_t as ClientEvent;
pub use longfi_sys::LongFiAuthCallbacks as AuthCb;
pub use longfi_sys::LongFiAuthMode_t as AuthMode;
pub use longfi_s... |
longfi_sys::longfi_init(&mut longfi_radio.c_handle);
Ok(longfi_radio)
} else {
Err(Error::NoRadioPointer)
}
}
}
pub fn set_buffer(&mut self, buffer: &mut [u8]) {
unsafe {
longfi_sys::longfi_set_buf(&mut self.... | let mut longfi_radio = LongFi {
c_handle: longfi_sys::longfi_new_handle(bindings, radio_ptr, config, auth_cb),
}; | assignment_statement | [
{
"content": "pub fn initialize_irq(\n\n pin: gpiob::PB4<Uninitialized>,\n\n syscfg: &mut hal::syscfg::SYSCFG,\n\n exti: &mut exti::Exti,\n\n) -> gpiob::PB4<Input<PullUp>> {\n\n let dio0 = pin.into_pull_up_input();\n\n\n\n exti.listen_gpio(\n\n syscfg,\n\n dio0.port(),\n\n Gp... |
Rust | src/dft/mod.rs | feos-org/feos-gc-pcsaft | 4ce900cab46848a4f6352432d6d23c8f1fda5b6b | use crate::eos::GcPcSaftOptions;
use feos_core::MolarWeight;
use feos_dft::adsorption::FluidParameters;
use feos_dft::fundamental_measure_theory::{FMTContribution, FMTProperties, FMTVersion};
use feos_dft::{FunctionalContribution, HelmholtzEnergyFunctional, MoleculeShape, DFT};
use ndarray::Array1;
use num_dual::DualNu... | use crate::eos::GcPcSaftOptions;
use feos_core::MolarWeight;
use feos_dft::adsorption::FluidParameters;
use feos_dft::fundamental_measure_theory::{FMTContribution, FMTProperties, FMTVersion};
use feos_dft::{FunctionalContribution, HelmholtzEnergyFunctional, MoleculeShape, DFT};
use ndarray::Array1;
use num_dual::DualNu... |
fn compute_max_density(&self, moles: &Array1<f64>) -> f64 {
let p = &self.parameters;
let moles_segments: Array1<f64> = p.component_index.iter().map(|&i| moles[i]).collect();
self.options.max_eta * moles.sum()
/ (FRAC_PI_6 * &p.m * p.sigma.mapv(|v| v.powi(3)) * moles_segments).... | fn subset(&self, component_list: &[usize]) -> DFT<Self> {
Self::with_options(
Rc::new(self.parameters.subset(component_list)),
self.fmt_version,
self.options,
)
} | function_block-full_function | [
{
"content": "#[pymodule]\n\npub fn dft(_py: Python<'_>, m: &PyModule) -> PyResult<()> {\n\n m.add_class::<PyGcPcSaftFunctional>()?;\n\n m.add_class::<PyState>()?;\n\n m.add_class::<PyPhaseDiagram>()?;\n\n m.add_class::<PyPhaseEquilibrium>()?;\n\n m.add_class::<PyPlanarInterface>()?;\n\n m.add... |
Rust | rust-kernel-rdma/KRdmaKit/src/qp/rc_op.rs | Hf7WCdtO/KRCore | 52369924ba175419912a274634d368d478dda501 | use rust_kernel_rdma_base::*;
use crate::qp::{DoorbellHelper, RC};
use core::option::Option;
use linux_kernel_module::bindings::*;
use linux_kernel_module::{Error};
use alloc::sync::Arc;
#[allow(unused_imports)]
pub struct RCOp<'a> {
qp: &'a Arc<RC>,
}
impl<'a> RCOp<'a> {
pub fn new(qp: &'a Arc<RC>) -> Self {... | use rust_kernel_rdma_base::*;
use crate::qp::{DoorbellHelper, RC};
use core::option::Option;
use linux_kernel_module::bindings::*;
use linux_kernel_module::{Error};
use alloc::sync::Arc;
#[allow(unused_imports)]
pub struct RCOp<'a> {
qp: &'a Arc<RC>,
}
impl<'a> RCOp<'a> {
pub fn new(qp: &'a Arc<RC>) -> Self {... | WR_RDMA_READ,
local_ptr, lkey, sz, remote_addr, rkey, ib_send_flags::IB_SEND_SIGNALED)
.and_then(|()| Ok(self.wait_til_comp()))
}
#[inline]
pub fn write(&mut self,
local_ptr: u64,
lkey: u32,
sz: usize,
remote_... | None
}
#[inline]
fn post_send(
&mut self,
mut sge: ib_sge,
mut wr: ib_rdma_wr,
) -> linux_kernel_module::KernelResult<()> {
wr.wr.sg_list = &mut sge as *mut _;
wr.wr.num_sge = 1;
let mut bad_wr: *mut ib_send_wr = core::ptr::null_mut();
... | random | [
{
"content": "#[inline]\n\nfn create_ib_qp(config: &Config, pd: *mut ib_pd, qp_type: u32, cq: *mut ib_cq, recv_cq: *mut ib_cq, srq: *mut ib_srq) -> *mut ib_qp {\n\n let mut qp_attr: ib_qp_init_attr = Default::default();\n\n qp_attr.cap.max_send_wr = config.max_send_wr_sz as u32;\n\n qp_attr.cap.max_rec... |
Rust | pallet/src/tests.rs | 4meta5/deleg8 | 6bca6d8e1385ea259f7e52eb03dee46d2be112b7 | #![cfg(test)]
use super::*;
use frame_support::{
assert_noop,
assert_ok,
impl_outer_event,
impl_outer_origin,
parameter_types,
weights::Weight,
};
use sp_core::H256;
use sp_runtime::{
testing::Header,
traits::IdentityLookup,
Perbill,
};
pub type AccountId = u64;
pub type BlockNumbe... | #![cfg(test)]
use super::*;
use frame_support::{
assert_noop,
assert_ok,
impl_outer_event,
impl_outer_origin,
parameter_types,
weights::Weight,
};
use sp_core::H256;
use sp_runtime::{
testing::Header,
traits::IdentityLookup,
Perbill,
};
pub type AccountId = u64;
pub type BlockNumbe... |
#[test]
fn genesis_config_works() {
new_test_ext().execute_with(|| {
assert!(System::events().is_empty());
});
}
#[test]
fn create_root_works() {
new_test_ext().execute_with(|| {
assert_noop!(
Delegate::create_root(Origin::signed(21)),
DispatchError::Module {
... | unwrap();
pallet_balances::GenesisConfig::<TestRuntime> {
balances: vec![
(1, 1000),
(2, 100),
(3, 100),
(4, 100),
(5, 100),
(6, 100),
],
}
.assimilate_storage(&mut t)
.unwrap();
let mut ext: sp_io::TestExternali... | function_block-function_prefix_line | [
{
"content": "pub trait Trait: System {\n\n /// Overarching event type\n\n type Event: From<Event<Self>> + Into<<Self as System>::Event>;\n\n\n\n /// The identifier for trees\n\n type TreeId: Parameter\n\n + Member\n\n + AtLeast32Bit\n\n + Codec\n\n + Default\n\n +... |
Rust | src/run_plan.rs | camchenry/lolbench | 941ebb099a398ad33cb3658bcd021a98081dfa80 | use super::Result;
use std::{
fmt::{Display, Formatter, Result as FmtResult},
path::PathBuf,
process::Command,
};
use ring::digest::{digest, SHA256};
use marky_mark::Benchmark;
use cpu_shield::{RenameThisCommandWrapper, ShieldSpec};
use toolchain::Toolchain;
use CriterionConfig;
#[derive(Clone, Debug, ... | use super::Result;
use std::{
fmt::{Display, Formatter, Result as FmtResult},
path::PathBuf,
process::Command,
};
use ring::digest::{digest, SHA256};
use marky_mark::Benchmark;
use cpu_shield::{RenameThisCommandWrapper, ShieldSpec};
use toolchain::Toolchain;
use CriterionConfig;
#[derive(Clone, Debug, ... |
}
impl RunPlan {
pub fn new(
benchmark: Benchmark,
bench_config: Option<CriterionConfig>,
shield: Option<ShieldSpec>,
toolchain: Option<Toolchain>,
source_path: PathBuf,
) -> Result<Self> {
let binary_name = source_path
.file_stem()
.unwr... | s!(
"{}: {}::{}@{:?}",
tcs, self.benchmark.crate_name, self.benchmark.name, self.benchmark.runner,
))
} | function_block-function_prefixed | [
{
"content": "fn most_covered_toolchains_runtimes(data_dir: impl AsRef<Path>) -> Result<Vec<(R64, String)>> {\n\n info!(\"finding all existing estimates\");\n\n let estimates = GitStore::ensure_initialized(data_dir)?.all_stored_estimates()?;\n\n\n\n info!(\"reorganizing them by toolchain\");\n\n let... |
Rust | bin/inx-chronicle/src/api/stardust/v2/routes.rs | iotaledger/inx-chronicle | d7d1643a57f418fec5550ad8c24a63986a2c91a6 |
use std::str::FromStr;
use axum::{
extract::{Extension, Path},
routing::*,
Router,
};
use chronicle::{
db::MongoDb,
types::{
stardust::block::{BlockId, MilestoneId, OutputId, TransactionId},
tangle::MilestoneIndex,
},
};
use super::responses::*;
use crate::api::{error::ApiErr... |
use std::str::FromStr;
use axum::{
extract::{Extension, Path},
routing::*,
Router,
};
use chronicle::{
db::MongoDb,
types::{
stardust::block::{BlockId, MilestoneId, OutputId, TransactionId},
tangle::MilestoneIndex,
},
};
use super::responses::*;
use crate::api::{error::ApiErr... |
}
async fn transaction_included_block(
database: Extension<MongoDb>,
Path(transaction_id): Path<String>,
) -> ApiResult<BlockResponse> {
let transaction_id_dto = TransactionId::from_str(&transaction_id).map_err(ApiError::bad_parse)?;
let block = database
.get_block_for_transaction(&transaction... | Ok(OutputMetadataResponse {
block_id: metadata.block_id.to_hex(),
transaction_id: metadata.transaction_id.to_hex(),
output_index: metadata.output_id.index,
is_spent: metadata.spent.is_some(),
milestone_index_spent: metadata.spent.as_ref().map(|s| s.spent.milestone_index),
... | call_expression | [
{
"content": "// Copyright 2022 IOTA Stiftung\n\n// SPDX-License-Identifier: Apache-2.0\n\n\n\nuse std::str::FromStr;\n\n\n\nuse bee_block_stardust::payload::milestone as bee;\n\nuse mongodb::bson::{spec::BinarySubtype, Binary, Bson};\n\nuse serde::{Deserialize, Serialize};\n\n\n\nuse crate::types::util::bytify... |
Rust | src/asm/aarch64/cdef.rs | EwoutH/rav1e | 39f35d0c94a0523bc6c26042bb54f7dca28efb37 |
use crate::cdef::*;
use crate::cpu_features::CpuFeatureLevel;
use crate::frame::*;
use crate::tiling::PlaneRegionMut;
use crate::util::*;
type CdefPaddingFn = unsafe extern fn(
tmp: *mut u16,
src: *const u8,
src_stride: isize,
left: *const [u8; 2],
top: *const u8,
h: i32,
edges: isize,
);
type CdefPad... |
use crate::cdef::*;
use crate::cpu_features::CpuFeatureLevel;
use crate::frame::*;
use crate::tiling::PlaneRegionMut;
use crate::util::*;
type CdefPaddingFn = unsafe extern fn(
tmp: *mut u16,
src: *const u8,
src_stride: isize,
left: *const [u8; 2],
top: *const u8,
h: i32,
edges: isize,
);
type CdefPad... |
extern {
fn rav1e_cdef_find_dir_8bpc_neon(
tmp: *const u8, tmp_stride: isize, var: *mut u32,
) -> i32;
}
extern {
fn rav1e_cdef_find_dir_16bpc_neon(
tmp: *const u16, tmp_stride: isize, var: *mut u32, max_bitdepth: i32,
) -> i32;
}
cpu_function_lookup_table!(
CDEF_DIR_LBD_FNS: [Option<CdefDirLBDFn>... | pub(crate) fn cdef_find_dir<T: Pixel>(
img: &PlaneSlice<'_, T>, var: &mut u32, coeff_shift: usize,
cpu: CpuFeatureLevel,
) -> i32 {
let call_rust =
|var: &mut u32| rust::cdef_find_dir::<T>(img, var, coeff_shift, cpu);
#[cfg(feature = "check_asm")]
let (ref_dir, ref_var) = {
let mut var: u32 = 0;
... | function_block-full_function | [
{
"content": "type CdefDirHBDFn = unsafe extern fn(\n\n tmp: *const u16,\n\n tmp_stride: isize,\n\n var: *mut u32,\n\n bitdepth_max: i32,\n\n) -> i32;\n\n\n\n#[inline(always)]\n\n#[allow(clippy::let_and_return)]\n\npub(crate) fn cdef_find_dir<T: Pixel>(\n\n img: &PlaneSlice<'_, T>, var: &mut u32, coeff_shi... |
Rust | pnets_shrink/tests/standard_reduce_tests.rs | nicolasAmat/pnets | 482d014001f31afe31bc1c47c08d5c1183bf78a3 | use pnets::standard::Net;
use pnets_shrink::modifications::{
Agglomeration, InequalityReduction, Modification, Reduction, TransitionElimination,
};
use pnets_shrink::reducers::standard::{
IdentityPlaceReducer, IdentityTransitionReducer, ParallelPlaceReducer,
ParallelTransitionReducer, SimpleChainReducer, So... | use pnets::standard::Net;
use pnets_shrink::modifications::{
Agglomeration, InequalityReduction, Modification, Reduction, TransitionElimination,
};
use pnets_shrink::reducers::standard::{
IdentityPlaceReducer, IdentityTransitionReducer, ParallelPlaceReducer,
ParallelTransitionReducer, SimpleChainReducer, So... | fn self_loop_transition_elimination() {
let parser =
pnets_tina::Parser::new(include_str!("self_loop_transition_eliminations.net").as_bytes());
let mut net = Net::from(parser.parse().unwrap());
let mut modifications = vec![];
IdentityTransitionReducer::reduce(&mut net, &mut modifications);
... | function_block-function_prefix_line | [
{
"content": "#[test]\n\nfn create_transition_with_used_name() {\n\n let mut net = Net::default();\n\n let tr_1 = net.create_transition();\n\n net.rename_node(NodeId::Transition(tr_1), \"tr_1\").unwrap();\n\n let tr_2 = net.create_transition();\n\n assert_eq!(net.transitions.len(), 2);\n\n ass... | |
Rust | src/api/data/client.rs | rnag/rust-wistia | 91e430ad9ba3665e8b89fb2aa2acef25acf46483 | use crate::auth::auth_token;
use crate::constants::ENV_VAR_NAME;
use crate::https::{get_https_client, tls};
use crate::log::*;
use crate::models::*;
use crate::status::raise_for_status;
use crate::utils::{into_struct_from_slice, stream_reader_from_url};
use crate::RustWistiaError;
use std::borrow::Cow;
use std::io::Cu... | use crate::auth::auth_token;
use crate::constants::ENV_VAR_NAME;
use crate::https::{get_https_client, tls};
use crate::log::*;
use crate::models::*;
use crate::status::raise_for_status;
use crate::utils::{into_struct_from_slice, stream_reader_from_url};
use crate::RustWistiaError;
use std::borrow::Cow;
use std::io::Cu... | ;
let req = Request::builder()
.method(Method::PUT)
.uri(url)
.header(AUTHORIZATION, token)
.body(Body::empty())?;
self.make_request(url, req).await
}
pub async fn put_with_body<B: Serialize, R: DeserializeOwned>(
&'a self,
... | if params_len != 0 {
uri = String::with_capacity(url.len() + params.len() + 1);
uri.push_str(url);
uri.push('?');
uri.push_str(¶ms);
uri.as_str()
} else {
url
} | if_condition | [
{
"content": "/// Returns the value to set in the `AUTHORIZATION` header for a request.\n\npub fn auth_token(token: &str) -> String {\n\n // \"Bearer \".len() == 7\n\n let mut bearer_token = String::with_capacity(7 + token.len());\n\n bearer_token.push_str(\"Bearer \");\n\n bearer_token.push_str(tok... |
Rust | syn-meta-ext/src/lib.rs | YoloDev/evitable | c1284df0c60a99f07caf037e22b7c8ab37b28fca | extern crate ident_case;
extern crate proc_macro2;
#[cfg_attr(test, macro_use)]
extern crate quote;
#[cfg_attr(test, macro_use)]
extern crate syn;
use proc_macro2::TokenStream;
use quote::ToTokens;
use syn::parse::*;
use syn::{parenthesized, parse, token, Attribute, Ident, Lit, LitBool, Path, Token};
pub mod ast;
pu... | extern crate ident_case;
extern crate proc_macro2;
#[cfg_attr(test, macro_use)]
extern crate quote;
#[cfg_attr(test, macro_use)]
extern crate syn;
use proc_macro2::TokenStream;
use quote::ToTokens;
use syn::parse::*;
use syn::{parenthesized, parse, token, Attribute, Ident, Lit, LitBool, Path, Token};
pub mod ast;
pu... | } else {
Ok(Meta::Path(path))
}
}
fn parse_meta_list_after_path(path: Path, input: ParseStream) -> Result<MetaList> {
let content;
Ok(MetaList {
path: path,
paren_token: parenthesized!(content in input),
nested: content.parse_terminated(NestedMeta::parse)?,
})
}
fn parse_meta_name_value_after_... | th, input).map(Meta::List)
} else if input.peek(Token![=]) {
parse_meta_name_value_after_path(path, input).map(Meta::NameValue)
| function_block-random_span | [
{
"content": "pub fn assert_trait_impl(ty: &Type, trait_path: &Path, tokens: &mut TokenStream) {\n\n ToTokens::to_tokens(&TraitAssertion { ty, trait_path }, tokens)\n\n}\n",
"file_path": "evitable-derive-core/src/trait_assert.rs",
"rank": 0,
"score": 249387.9298914886
},
{
"content": "pub f... |
Rust | src/api/routes/namespace_routes_api.rs | proximax-storage/rust-xpx-chain-sdk | 55613067328d511dbd9a129be30b9e048ef79175 | /*
* Copyright 2018 ProximaX Limited. All rights reserved.
* Use of this source code is governed by the Apache 2.0
* license that can be found in the LICENSE file.
*/
use {
::std::{future::Future, pin::Pin, sync::Arc},
reqwest::Method,
};
use crate::{
account::{AccountsId, Address},
api::{
... | /*
* Copyright 2018 ProximaX Limited. All rights reserved.
* Use of this source code is governed by the Apache 2.0
* license that can be found in the LICENSE file.
*/
use {
::std::{future::Future, pin::Pin, sync::Arc},
reqwest::Method,
};
use crate::{
account::{AccountsId, Address},
api::{
... |
pub async fn get_namespaces_from_accounts(
self,
accounts_id: Vec<&str>,
ns_id: Option<NamespaceId>,
page_size: Option<i32>,
) -> Result<Vec<NamespaceInfo>> {
valid_vec_len(&accounts_id, ERR_EMPTY_ADDRESSES_IDS)?;
let accounts = AccountsId::from(accounts_id);
... | let mut namespace_info: Vec<NamespaceInfo> = vec![];
for namespace_dto in dto.into_iter() {
namespace_info.push(namespace_dto.compact(self.__network_type())?);
}
self.__build_namespaces_hierarchy(&mut namespace_info).await;
Ok(namespace_info)
} | function_block-function_prefix_line | [
{
"content": "fn parse_meta_ws(value_dto: &mut Value) -> Result<()> {\n\n if let Some(v) = value_dto[\"transaction\"][\"transactions\"].as_array_mut() {\n\n let mut meta_value: Vec<Value> = vec![];\n\n\n\n for item in v.iter_mut() {\n\n if item[\"meta\"].is_null() {\n\n ... |
Rust | src/config/mod.rs | pc37utn/rocfl | 723501625b4b8775901470ffacd856124bfd4713 | use std::collections::HashMap;
use std::fs;
use std::io::Read;
use std::path::{Path, PathBuf};
use directories::ProjectDirs;
use serde::Deserialize;
use crate::ocfl::{DigestAlgorithm, Result, RocflError};
const CONFIG_FILE: &str = "config.toml";
const GLOBAL: &str = "global";
#[derive(Deserialize, Debug)]
#[serde(d... | use std::collections::HashMap;
use std::fs;
use std::io::Read;
use std::path::{Path, PathBuf};
use directories::ProjectDirs;
use serde::Deserialize;
use crate::ocfl::{DigestAlgorithm, Result, RocflError};
const CONFIG_FILE: &str = "config.toml";
const GLOBAL: &str = "global";
#[derive(Deserialize, Debug)]
#[serde(d... |
fn resolve_field(global_field: Option<String>, repo_field: Option<String>) -> Option<String> {
if repo_field.is_some() {
repo_field
} else {
global_field
}
}
| e) => Config::new(),
(Some(global), Some(repo)) => {
let mut resolved = Config::new();
resolved.author_name = resolve_field(global.author_name, repo.author_name);
resolved.author_address = resolve_field(global.author_address, repo.author_address);
resolved.root =... | function_block-function_prefixed | [
{
"content": "fn default_values(mut config: Config) -> Result<Config> {\n\n if is_s3(&config) {\n\n if config.staging_root.is_none() {\n\n config.staging_root = Some(config::s3_staging_path(&config)?);\n\n }\n\n } else if config.root.is_none() {\n\n config.root = Some(\".\"... |
Rust | src/core/mod.rs | yamafaktory/hypergraph | e253ed0f0c34af8e3d07e753323c457644aaa819 | pub(crate) mod bi_hash_map;
#[doc(hidden)]
pub mod errors;
#[doc(hidden)]
pub mod hyperedges;
mod shared;
mod utils;
#[doc(hidden)]
pub mod vertices;
use bi_hash_map::BiHashMap;
use indexmap::{IndexMap, IndexSet};
use std::{
fmt::{Debug, Display, Formatter, Result},
hash::Hash,
};
pub trait SharedTrait: Copy ... | pub(crate) mod bi_hash_map;
#[doc(hidden)]
pub mod errors;
#[doc(hidden)]
pub mod hyperedges;
mod shared;
mod utils;
#[doc(hidden)]
pub mod vertices;
use bi_hash_map::BiHashMap;
use indexmap::{IndexMap, IndexSet};
use std::{
fmt::{Debug, Display, Formatter, Result},
hash::Hash,
};
pub trait SharedTrait: Copy ... |
}
| pub fn with_capacity(vertices: usize, hyperedges: usize) -> Self {
Hypergraph {
hyperedges_count: 0,
hyperedges_mapping: BiHashMap::default(),
hyperedges: IndexSet::with_capacity(hyperedges),
vertices_count: 0,
vertices_mapping: BiHashMap::default(),
... | function_block-full_function | [
{
"content": "use crate::{errors::HypergraphError, HyperedgeIndex, HyperedgeKey, Hypergraph, SharedTrait};\n\n\n\nimpl<V, HE> Hypergraph<V, HE>\n\nwhere\n\n V: SharedTrait,\n\n HE: SharedTrait,\n\n{\n\n /// Updates the weight of a hyperedge by index.\n\n pub fn update_hyperedge_weight(\n\n &m... |
Rust | src/basic/model.rs | nyari/rtrace | 2321a0a50c10940c58a690c678df8f939d5b22fc | use core::{Model, Material, RayIntersection, Ray, RayIntersectionError};
use defs::{Point3, Vector3, FloatType};
use tools::{CompareWithTolerance};
use na;
use na::{Unit};
use std;
use uuid::{Uuid};
pub struct SolidSphere {
material: Material,
origo: Point3,
radius: FloatType,
identifier: Uuid
}
impl ... | use core::{Model, Material, RayIntersection, Ray, RayIntersectionError};
use defs::{Point3, Vector3, FloatType};
use tools::{CompareWithTolerance};
use na;
use na::{Unit};
use std;
use uuid::{Uuid};
pub struct SolidSphere {
material: Material,
origo: Point3,
radius: FloatType,
identifier: Uuid
}
impl ... | None);
}
} | ;
let c = ray_origo.x.powi(2) + ray_origo.y.powi(2) + ray_origo.z.powi(2) - self.radius.powi(2);
let determinant = b.powi(2) - 4.0 * a * c;
if determinant.less_eps(&0.0) {
None
} else {
let t1 = (-b + determinant.sqrt()) / (2.0 * a);
let t2 = (-b - de... | random | [
{
"content": "pub trait Model: Send + Sync {\n\n fn get_intersection(&self, ray: &Ray) -> Option<RayIntersection>;\n\n}\n\n\n\npub struct ModelViewModelWrapper<T: Model> {\n\n wrapped_model: T,\n\n tf_matrix: Matrix4,\n\n inverse_tf_matrix: Matrix4\n\n}\n\n\n\nimpl<T: Model> ModelViewModelWrapper<T>... |
Rust | src/error.rs | gadunga/obj-rs | 581b76d40d4f5ab33612ee51098ab09d6ee568fc |
use std::fmt;
use std::io;
use std::num::{ParseIntError, ParseFloatError};
use std::convert::From;
use std::error::Error;
pub type ObjResult<T> = Result<T, ObjError>;
#[derive(Debug)]
pub enum ObjError {
Io(io::Error),
ParseInt(ParseIntError),
ParseFloat(ParseFloatError),
Load(Lo... |
use std::fmt;
use std::io;
use std::num::{ParseIntError, ParseFloatError};
use std::convert::From;
use std::error::Error;
pub type ObjResult<T> = Result<T, ObjError>;
#[derive(Debug)]
pub enum ObjError {
Io(io::Error),
ParseInt(ParseIntError),
ParseFloat(ParseFloatError),
Load(Lo... |
}
impl Error for ObjError {
fn description(&self) -> &str {
match *self {
ObjError::Io(ref err) => err.description(),
ObjError::ParseInt(ref err) => err.description(),
ObjError::ParseFloat(ref err) => err.description(),
ObjError::Load(ref err) => err.descrip... | fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {
match self {
&ObjError::Io(ref e) => e.fmt(f),
&ObjError::ParseInt(ref e) => e.fmt(f),
&ObjError::ParseFloat(ref e) => e.fmt(f),
&ObjError::Load(ref e) => e.fmt(f),
}
} | function_block-full_function | [
{
"content": "/// Parses a wavefront `.obj` format.\n\npub fn parse_obj<T: BufRead>(input: T) -> ObjResult<RawObj> {\n\n let mut name = None;\n\n let mut material_libraries = Vec::new();\n\n\n\n let mut positions = Vec::new();\n\n let mut tex_coords = Vec::new();\n\n let mut normals = Vec::new();... |
Rust | shipico/src/old/math/rect.rs | Shipica/Shipica.github.io | d5d451481d013228d99b98c1ccc1c8924f23ed61 |
use super::point::Point;
use super::size::Size;
use super::thickness::Thickness;
use super::vec2::Vec2;
use std::f64::{INFINITY, NEG_INFINITY};
use std::ops::{Add, Sub};
#[derive(Copy, Clone, Debug, Default, PartialEq)]
#[repr(C)]
pub struct Rect {
pub left: f64,
pub top: f64,
pub right: ... |
use super::point::Point;
use super::size::Size;
use super::thickness::Thickness;
use super::vec2::Vec2;
use std::f64::{INFINITY, NEG_INFINITY};
use std::ops::{Add, Sub};
#[derive(Copy, Clone, Debug, Default, PartialEq)]
#[repr(C)]
pub struct Rect {
pub left: f64,
pub top: f64,
pub right: ... |
#[inline]
pub fn rounded(&self) -> Rect {
Rect {
left: self.left.round(),
top: self.top.round(),
right: self.right.round(),
bottom: self.bottom.round(),
}
}
#[inline]
pub fn size(&self) -> Size {
(
... | pub fn from_center_half_extent(
center: impl Into<Point>,
half_extents: impl Into<Vec2>,
) -> Rect {
let center = center.into();
let half_extents = half_extents.into();
Rect {
left: center.x - half_extents.x,
top: center.y - half_extents.y,
... | function_block-full_function | [
{
"content": "pub fn glWeightfvARB(size: GLint, weights: *const GLfloat) {\n\n unimplemented!();\n\n}\n\n\n",
"file_path": "shipico/miniquad/native/sapp-dummy/src/gl.rs",
"rank": 0,
"score": 319145.9366847262
},
{
"content": "pub fn glWeightusvARB(size: GLint, weights: *const GLushort) {\... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.